1 / 9

CS 344 Artificial Intelligence By Prof: Pushpak Bhattacharya Class on 25/Jan/2007

CS 344 Artificial Intelligence By Prof: Pushpak Bhattacharya Class on 25/Jan/2007. Logic and inferencing. Vision. NLP. Search Reasoning Learning Knowledge. Expert Systems. Robotics. Planning. Obtaining implication of given facts and rules -- Hallmark of intelligence.

chapa
Télécharger la présentation

CS 344 Artificial Intelligence By Prof: Pushpak Bhattacharya Class on 25/Jan/2007

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS 344 Artificial Intelligence By Prof: Pushpak Bhattacharya Class on 25/Jan/2007

  2. Logic and inferencing Vision NLP • Search • Reasoning • Learning • Knowledge Expert Systems Robotics Planning Obtaining implication of given facts and rules -- Hallmark of intelligence

  3. Inferencing through • Deduction (General to specific) • Induction (Specific to General) • Abduction (Conclusion to hypothesis in absence of any other evidence to contrary) Deduction Given: All men are mortal (rule) Shakespeare is a man (fact) To prove: Shakespeare is mortal (inference) Induction Given: Shakespeare is mortal Newton is mortal (Observation) Dijkstra is mortal To prove: All men are mortal (Generalization)

  4. If there is rain, then there will be no picnic Fact1: There was rain Conclude: There was no picnic Deduction Fact2: There was no picnic Conclude: There was no rain (?) Induction and abduction are fallible forms of reasoning. Their conclusions are susceptible to retraction Two systems of logic 1) Propositional calculus 2) Predicate calculus

  5. Propositions • Stand for facts/assertions • Declarative statements • As opposed to interrogative statements (questions) or imperative statements (request, order) • Operators • => and ¬ form a minimal set (can express other operations) • - Prove it. • Tautologies are formulae whose truth value is always T, whatever the assignment is

  6. Model • In propositional calculus any formula with n propositions has 2n models (assignments) • - Tautologies evaluate to T in all models. • Examples: • 1) • 2) - De Morgan with AND

  7. Semantic Tree/Tableau method of proving tautology To prove: Start with the negation of the formula to be proved a tautology α-formula β-formula - β - formula α-formula - α - formula

  8. Example 2: X (α - formula) (α - formulae) α-formula (β - formulae) B C B C Contradictions in all paths

  9. Exercise: Prove the backward implication in the previous example

More Related