UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 781 AILog for Ch.5 Spring 2011 Marco Valtorta

Slides:



Advertisements
Similar presentations
Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
Advertisements

Logic Programming Automated Reasoning in practice.
Justification-based TMSs (JTMS) JTMS utilizes 3 types of nodes, where each node is associated with an assertion: 1.Premises. Their justifications (provided.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Chapter 3. Conditional Probability and Independence Section 3.1. Conditional Probability Section 3.2 Independence.
1 DCP 1172 Introduction to Artificial Intelligence Chang-Sheng Chen Topics Covered: Introduction to Nonmonotonic Logic.
What if you don’t choose well? light(l1). light(l2). down(s1). up(s2). up(s3). ok(l1). ok(l2). ok(cb1). ok(cb2). connected_to(l1, w0). connected_to(w0,
CPSC 322, Lecture 21Slide 1 Bottom Up: Soundness and Completeness Computer Science cpsc322, Lecture 21 (Textbook Chpt 5.2) February, 27, 2009.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6 [P]: Reasoning Under Uncertainty Section.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Consistency-Based vs. Explanation- Based (Abduction) Diagnosis Andrew Smith.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.5 [P]: Propositions and Inference Sections.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Controlling Backtracking Notes for Ch.5 of Bratko For CSCE 580 Sp03 Marco Valtorta.
CPSC 322 Introduction to Artificial Intelligence September 20, 2004.
CPSC 322, Lecture 23Slide 1 Logic: TD as search, Datalog (variables) Computer Science cpsc322, Lecture 23 (Textbook Chpt 5.2 & some basic concepts from.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Program 1 Fall 2008 Marco Valtorta
Models -1 Scientists often describe what they do as constructing models. Understanding scientific reasoning requires understanding something about models.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.12 [P]: Individuals and Relations Proofs.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Using Definite Knowledge Notes for Ch.3 of Poole et al. CSCE 580 Marco Valtorta.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Introduction to Prolog Notes for Ch.1 of Bratko For CSCE 580 Sp03 Marco Valtorta.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Input and Output Notes for Ch.6 of Bratko For CSCE 580 Sp03 Marco Valtorta.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 330 Programming Language Structures Haskell Fall 2005 Marco Valtorta
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.6 [P]: Reasoning Under Uncertainty Sections.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering A Hole in Goal Trees Notes for: D.W. Loveland and M. Stickel. “A Hole in Goal.
CPSC 322, Lecture 21Slide 1 Bottom Up: Soundness and Completeness Computer Science cpsc322, Lecture 21 (Textbook Chpt 5.2) March, 5, 2010.
EXPERT SYSTEMS Part I.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Using Definite Knowledge Notes for Ch.3 of Poole et al. CSCE 580 Marco Valtorta.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 390 Professional Issues in Computer Science and Engineering Ch.6: The.
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) March, 8, 2010.
1 CILOG User Manual Bayesian Networks Seminar Sep 7th, 2006.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 190 Computing in the Modern World Two Example Bayesian Networks March.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 330 Programming Language Structures Literate Programming in Haskell Fall.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.12 [P]: Individuals and Relations Datalog.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Using Definite Knowledge: NLP and nl_interface.pl Notes for Ch.3 of Poole et.
©Ian Sommerville 2004Software Engineering, 7th edition. Chapter 23 Slide 1 Software testing.
1 Knowledge Based Systems (CM0377) Lecture 12 (Last modified 2nd May 2002)
FATIH UNIVERSITY Department of Computer Engineering Controlling Backtracking Notes for Ch.5 of Bratko For CENG 421 Fall03.
Software Engineering Chapter 23 Software Testing Ku-Yaw Chang Assistant Professor Department of Computer Science and Information.
Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Jim Little UBC CS 322 – CSP October 22, 2014.
Applications of Propositional Logic
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) Oct, 26, 2010.
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
Expert System Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.
Computing & Information Sciences Kansas State University Monday, 25 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 14 of 42 Monday, 25 September.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 13 –Reasoning with Uncertainty Tuesday –AIMA, Ch. 14.
Computer Science CPSC 322 Lecture 22 Logical Consequences, Proof Procedures (Ch 5.2.2)
Slide 1 Propositional Logic Intro, Syntax Jim Little UBC CS 322 – CSP October 17, 2014 Textbook § – 5.2.
The Foundations: Logic and Proofs
Expert Systems. Learning Objectives: By the end of this topic you should be able to: explain what is meant by an expert system describe the components.
Logic: Proof procedures, soundness and correctness CPSC 322 – Logic 2 Textbook §5.2 March 7, 2011.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Introduction to Probability (CSCE 317) January 21, 2016 Marco Valtorta SWRG.
Assumption-based Truth Maintenance Systems: Motivation n Problem solvers need to explore multiple contexts at the same time, instead of a single one (the.
Chapter 1, Part I: Propositional Logic With Question/Answer Animations.
Chapter 9 Introduction to the t Statistic
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 781 Knowledge Systems: Student Presentations Spring 2011 Marco Valtorta.
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) Oct, 30, 2013.
Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19
Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19
Propositional Definite Clause Logic: Syntax, Semantics, R&R and Proofs
Chapter 7: Beyond Definite Knowledge
The Foundations: Logic and Proofs
The Foundations: Logic and Proofs
Normality and Faults in Logic-Based Diagnosis
Probabilistic Horn abduction and Bayesian Networks
CSCE 390 Professional Issues in Computer Science and Engineering Ch
Logic: Domain Modeling /Proofs + Computer Science cpsc322, Lecture 22
Bottom Up: Soundness and Completeness
CSCE 390 Professional Issues in Computer Science and Engineering Ch
The Foundations: Logic and Proofs
Representations & Reasoning Systems (RRS) (2.2)
Bottom Up: Soundness and Completeness
Presentation transcript:

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 781 AILog for Ch.5 Spring 2011 Marco Valtorta

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering AILog Examples for Ch.5 [P] elect_prop.ailelect_prop.ail electrical wiring example; Example 5.5 from Section 5.2 elect_ask.ailelect_ask.ail electrical wiring example with askables; Example 5.10 from Section elect_bug.ailelect_bug.ail the buggy electrical wiring knowledge base from Example 5.14 in Section elect_bug2.ailelect_bug2.ail the buggy electrical wiring example from Exercise 5.6 elect_bug3.ailelect_bug3.ail a buggy electrical wiring example, which fails to prove lit_l2, but should succeed elect_cbd.ailelect_cbd.ail electrical wiring example for consistency-based diagnosis; Example 5.20 in Section elect_naf.ailelect_naf.ail electrical wiring example with negation as failure; Example 5.26 in Section 5.5 beach.ailbeach.ail default reasoning about swimming at beaches; Example 5.27 in Section bronchitis.ailbronchitis.ail diagnosis Example 5.30 in Section 5.6 elect_abd.ailelect_abd.ail electrical wiring example with abduction; Example 5.31 in Section 5.6 plumbing.ailplumbing.ail plumbing domain from Exercise 5.2

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering AILog Examples for Ch.5 [P] elect_prop.ailelect_prop.ail electrical wiring example; Example 5.5 from Section 5.2 This is exactly the KB of Ex.5.5. The questions of Example 5.6 are answered as in the book (except that longer answers are given in place of yes and no). This KB is different from the KB in slide 12 for Lecture 5.1 provided by Poole.

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering AILog Examples for Ch.5 [P] elect_ask.ailelect_ask.ail electrical wiring example with askables; Example 5.10 from Section This is the same as the KB of example 5.5 without assertions (facts) for the switch positions, which are now made askable. Note that there is no constraint stating that up and down switch positions are mutually exclusive.

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering AILog Examples for Ch.5 [P] elect_bug.ailelect_bug.ail the buggy electrical wiring knowledge base from Example 5.14 in Section The incorrect rule is: live_w1 <- live_w3 & up_s3. (instead of up_s1) Example 5.15 uses the same KB as example 5.5 (i.e., elec_prop.ail.). However, now we assume that the world has s2 down, and that the KB designer made a mistake in the axiomatization, by forgetting to include the fact down_s2

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering AILog Examples for Ch.5 [P] elect_bug2.ailelect_bug2.ail the buggy electrical wiring example from Exercise 5.6 Ask lit_l1. It should be false (i.e. it is false in the intended interpretation), but AILog states it can be proved. The error can be found by using how. (It is “up_s1.”)

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering AILog Examples for Ch.5 [P] elect_bug3.ailelect_bug3.ail a buggy electrical wiring example, which fails to prove lit_l2, but should succeed. Use whynot lit_l2. ok_cb1. is missing.

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering AILog Examples for Ch.5 [P] elect_cbd.ailelect_cbd.ail electrical wiring example for consistency-based diagnosis; Example 5.20 in Section Add assumables: circuit breakers, switches, and lights are OK. Add integrity constraints (impossibility axioms) for dark and lit Tell AILog that the switches are all up and that both lights are dark, by answering questions about the corresponding askable atoms. create_nogoods creates the conflicts nogoods displays the conflicts

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering AILog Examples for Ch.5 [P] elect_naf.ailelect_naf.ail electrical wiring example with negation as failure; Example 5.26 in Section 5.5 Negation as failure is used in the following rules: –ok_l1 <- ~broken_l1. –ok_l2 <- ~broken_l2. –ok_cb1 <- ~broken_cb1. –ok_cb2 <- ~broken_cb2. –down_s1 <- ~up_s1. –down_s2 <- ~up_s2. –down_s3 <- ~up_s3. Defaults: switches up, circuit breakers ok, lights ok. To describe the situation in the figure, the user only needs to specify up_s2 and up_s3.

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering AILog Examples for Ch.5 [P] beach.ail beach.ail default reasoning about swimming at beaches; Example 5.27 in Section Non- monotonic reasoning

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering AILog Examples for Ch.5 [P] bronchitis.ailbronchitis.ail abductive (explanation-based) diagnosis Example 5.30 in Section 5.6 The KB in the file has two extra assumables: influenzaCausesBronchitis and smokingCausessBronchitis. This leads to two diagnoses for wheezing & fever: [influenza, influenzaCausessBronchitis] and [influenza, smokes, smokingCausesBronchitis], rather than just [influenza] as in example bronchitis <- influenza & influenzaCausesBronchitis. bronchitis <- smokes & smokingCausesBronchitis. coughing <- bronchitis. wheezing <- bronchitis. fever <- influenza. soreThroat <- influenza. false <- smokes & nonsmoker. assumable smokes. assumable nonsmoker. assumable influenza. assumable influenzaCausesBronchitis. assumable smokingCausesBronchitis. bronchitis <- influenza. bronchitis <- smokes. coughing <- bronchitis. wheezing <- bronchitis. fever <- influenza. soreThroat <- influenza. false <- smokes & nonsmoker. assumable smokes. assumable nonsmoker. assumable influenza.

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Abduction with Horn Clauses and Assumables

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering AILog Examples for Ch.5 [P] elect_abd.ailelect_abd.ail electrical wiring example with abduction; Example 5.31 in Section 5.6 Many more axioms, because in addition to normal behavior, fault models must be provided. E.g., for l1: lit_l1 <- live_w0 & ok_l1. dark_l1 <- broken_l1. dark_l1 <- dead_w0. Instead of just: lit_l1 <- light_l1 & live_l1 & ok_l1.

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering AILog Examples for Ch.5 [P] plumbing.ailplumbing.ail plumbing domain from Exercise 5.2. pressurised_p1. pressurised_p2 <- on_t1 & pressurised_p1. flow_shower <- on_t2 & pressurised_p2. wet_bath <- flow_shower. flow_d2 <- wet_bath & unplugged_bath. flow_d1 <- flow_d2. on_t1. on_t2. unplugged_bath. These are the axioms for the bath only. You need to add axioms for the sink. You also need to add askables.