CS344: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 20,21: Application of Predicate Calculus.

Slides:



Advertisements
Similar presentations
Knowledge Representation using First-Order Logic
Advertisements

ADDER, HALF ADDER & FULL ADDER
CS344: Principles of Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 11, 12: Perceptron Training 30 th and 31 st Jan, 2012.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 15, 16: Perceptrons and their computing power 6 th and.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 10– Club and Circuit Examples.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 9,10,11- Logic; Deduction Theorem 23/1/09 to 30/1/09.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture– 4, 5, 6: A* properties 9 th,10 th and 12 th January,
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 12- Completeness Proof; Self References and Paradoxes 16 th August,
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 7– Predicate Calculus and Knowledge Representation.
Lecture. Outline Bits Gates Combinatorial Logic Spice Hands-On Stuff.
CSE-221 Digital Logic Design (DLD)
© Franz Kurfess Knowledge-Based Systems CSC 480: Artificial Intelligence Dr. Franz J. Kurfess Computer Science Department Cal Poly.
Knowledge Representation using First-Order Logic (Part III) This lecture: R&N Chapters 8, 9 Next lecture: Chapter 13; Chapter (Please read lecture.
CE An introduction to Artificial Intelligence CE Chapter 8: First Order Logic Ramin Halavati In which we notice that.
First-Order Logic Knowledge Representation Reading: Chapter 8, , FOL Syntax and Semantics read: FOL Knowledge Engineering read:
 Arithmetic circuit  Addition  Subtraction  Division  Multiplication.
CS621: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–4: Fuzzy Inferencing 29 th July 2010.
Dr. Samy Abu Nasser Faculty of Engineering & Information Technology Artificial Intelligence.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 21- Forward Probabilities and Robotic Action Sequences.
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
Using building blocks to make bigger circuits
Artificial Intelligence Building Knowledge Base Chapter 8.
CS621: Artificial Intelligence Lecture 11: Perceptrons capacity Pushpak Bhattacharyya Computer Science and Engineering Department IIT Bombay.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
1 First-Order Logic Chapter 8. 2 Why FOL? –How do you say “All students are smart?” –Some students work hard –Hardworking students have good marks –If.
CS344 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 29 Introducing Neural Nets.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 19: Interpretation in Predicate.
© Copyright 2008 STI INNSBRUCK Intelligent Systems Predicate Logic.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 30: Perceptron training convergence;
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 30 Uncertainty, Fuizziness.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 12- Completeness Proof; Self References and Paradoxes 16 th August,
CS 666 AI P. T. Chung First-Order Logic First-Order Logic Chapter 8.
The electronic circuits domain (and preparations for exercise) The circuit representation in chapter 8 is more detailed than necessary if we care only.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 29: Perceptron training and.
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Prof. Pushpak Bhattacharyya, IIT Bombay 1 CS 621 Artificial Intelligence Lecture /08/05 Prof. Pushpak Bhattacharyya Fuzzy Set (contd) Fuzzy.
CS621 : Artificial Intelligence
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 32: sigmoid neuron; Feedforward.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–2: Introduction: Search+Logic.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 21: Perceptron training and convergence.
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
CS344: Introduction to Artificial Intelligence (associated lab: CS386) Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 14: AI, Logic, and Puzzle Solving.
Prof. Pushpak Bhattacharyya, IIT Bombay 1 CS 621 Artificial Intelligence Lecture 5 – 08/08/05 Prof. Pushpak Bhattacharyya FUZZY LOGIC & INFERENCING.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 35–Himalayan Club example; introducing Prolog.
Lecture 8-2CS250: Intro to AI/Lisp What do you mean, “What do I mean?” Lecture 8-2 November 18 th, 1999 CS250.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 23- Forward probability and Robot Plan; start of plan.
4–1. BSCS 5 th Semester Introduction Logic diagram: a graphical representation of a circuit –Each type of gate is represented by a specific graphical.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 16 Description Logic.
First-Order Logic Knowledge Representation
The electronic circuits domain (and preparations for exercise)
CS344: Introduction to Artificial Intelligence (associated lab: CS386)
Artificial Intelligence First Order Logic
Notes 8: Predicate logic and inference
First-Order Logic Knowledge Representation
First-Order Logic Knowledge Representation
CS344 : Introduction to Artificial Intelligence
CSE Winter 2001 – Arithmetic Unit - 1
First-Order Logic Knowledge Representation
Discrete Mathematics CS 2610
Introduction to Artificial Intelligence
Number Systems and Circuits for Addition
CS344 : Introduction to Artificial Intelligence
Logic Circuits I Lecture 3.
Knowledge Representation using First-Order Logic (Part III)
First-Order Logic Knowledge Representation
XOR Function Logic Symbol  Description  Truth Table 
Prof. Pushpak Bhattacharyya, IIT Bombay
CS621: Artificial Intelligence Lecture 18: Feedforward network contd
Presentation transcript:

CS344: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 20,21: Application of Predicate Calculus

Application of Predicate Calculus Systematic Inferencing Knowledge Representation Puzzles -- Circuit Verification -- Robotics -- Intelligent DB

Circuit Verification Does the circuit meet the specs? Are there faults? are they locatable?

Example : 2-bit full adder C1X2X1YC X 1, X 2 : inputs; C 1 : prev. carry; C 2 : next carry; Y: output

K-Map x2x1 c1 Y 0 1

K-Map (contd..) x2x1 c1 0 1 C2

Circuit

Verification First task (most difficult)  Building blocks : predicates  Circuit observation : Assertion on terminals

Predicates & Functions Function–1signal(t)t is a terminal ; signal takes the value 0 or 1 Function–2type(x)x is a circuit element; type(x) takes the value AND, OR, NOT, XOR Predicate – 3connected(t1,t2)t1 is an output terminal and t2 is an input terminal Function-3In(n,x)n th input of ckt element x Function-4Out(x)Output of ckt element x

Alternate Full Adder Circuit

Functions type(X) : takes values AND, OR NOT and XOR, where X is a gate. in(n, X) : the value of signal at the n th input of gate X. out(X) : output of gate X. signal(t) : state at terminal t = 1/0 Predicates connected(t1,t2): true, if terminal t1 and t2 are connected

General Properties Commutativity: ∀ t 1,t 2 [connected(t 1,t 2 ) → connected(t 2,t 1 )] By definition of connection: ∀ t 1,t 2 [connected(t 1,t 2 ) → { signal(t 1 ) = signal(t 1 )}]

Gate properties 1. OR definition: 2. AND definition:

Gate properties contd… 1. XOR definition: 2. NOT definition:

Some necessary functions a. no_of_input(x), takes values from N. b. Count_ls(x), returns #ls in the input of X

Circuit specific properties Connectivity: connected(x 1, in(1,A 1 )), connected(x 1, in(2, A 1 )), connected(out(A 1 ), in(1, A 2 )), connected(c1, in(2, A 2 )), connected(y, out(A 2 )) … Circuit elements: type(A 1 ) = XOR, type(A 2 ) = XOR, type(A 3 ) = AND …