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.

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

First-Order Logic Chapter 8.
Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
Logic Programming Automated Reasoning in practice.
Logic.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 330 Programming Language Structures Ch.2: Syntax and Semantics Fall 2005.
CPSC 322 Introduction to Artificial Intelligence September 15, 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.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
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 Blind State-Space Search Notes for Ch.11 of Bratko For CSCE 580 Sp03 Marco.
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.
A Preliminary Study on Reasoning About Causes Pedro Cabalar AI Lab., Dept. of Computer Science University of Corunna, SPAIN.
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 Using Definite Knowledge: Lists and Difference Lists Notes for Ch.3 of Poole.
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 580 Artificial Intelligence Ch.12 [P]: Individuals and Relations Proofs.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Using Definite Knowledge: Two Short Examples Notes for Ch.3 of Poole et al.
All rights reservedL. Manevitz Lecture 41 Artificial Intelligence Logic L. Manevitz.
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 Using Definite Knowledge: Axiomatizing the Natural Numbers Notes for Ch.3 of.
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.
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.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Lists, Operators, Arithmetic Notes for Ch.3 of Bratko For CSCE 580 Sp03 Marco.
Chapter 3 Propositional Logic
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) March, 8, 2010.
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 Introduction to Functional Programming Notes for CSCE 190 Based on Sebesta,
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.
7.1.3 Student Book © 2005 Propane Education & Research CouncilPage Applying a Systems Approach to Gas Appliance Troubleshooting Troubleshooting.
Proof Systems KB |- Q iff there is a sequence of wffs D1,..., Dn such that Dn is Q and for each Di in the sequence: a) either Di is in KB or b) Di can.
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.
Knowledge Representation Use of logic. Artificial agents need Knowledge and reasoning power Can combine GK with current percepts Build up KB incrementally.
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 781 AILog for Ch.5 Spring 2011 Marco Valtorta
Circuits. How a Blender Gets Power A Generator at a power plant produces a voltage difference across the outlet Causes charges to move when the circuit.
CS Introduction to AI Tutorial 8 Resolution Tutorial 8 Resolution.
You will need: your science journal a pencil a smile.
3.2 Semantics. 2 Semantics Attribute Grammars The Meanings of Programs: Semantics Sebesta Chapter 3.
TEKS 5.6B Demonstrate that the flow of electricity in circuits requires a complete path through which an electric current can pass and can produce light,
Computer Science, Algorithms, Abstractions, & Information CSC 2001.
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.
Logic: Proof procedures, soundness and correctness CPSC 322 – Logic 2 Textbook §5.2 March 7, 2011.
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View Basic Concepts and Background.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 330 Programming Language Structures Operational Semantics (Slides mainly.
CPSC 322, Lecture 22Slide 1 Logic: Domain Modeling /Proofs + Top-Down Proofs Computer Science cpsc322, Lecture 22 (Textbook Chpt 5.2) Oct, 30, 2013.
Physical Science 7.3 Electrical Energy.
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
Probabilistic Horn abduction and Bayesian Networks
Physical Science 7.3 Electrical Energy.
Logic: Top-down proof procedure and Datalog
Assignment-2 due now Enterprise Architecture Conference Sat. Oct 27
CSCE 390 Professional Issues in Computer Science and Engineering Ch
First-order (predicate) Logic
Logic: Domain Modeling /Proofs + Computer Science cpsc322, Lecture 22
Electric Circuits Ch 17, section 4.
Representations & Reasoning Systems (RRS) (2.2)
Presentation transcript:

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 Definite Clause Language A database language A question-answering system A programming language A representation and reasoning systems (RRS)

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Definite Clauses as RRS Which concepts and individuals to represent? At what level of detail? Is each clause true in the intended interpretation? –If so, a sound proof procedure will generate only answers that are true in the intended interpretation! Do the rules for the predicates cover all cases?

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering House Wiring (elect.pl) Review Fig. 3.1 (same as 1.3) Level of detail (abstraction) influenced by goals of modeling and available information –Determine whether light are on or off –Voltage and frequency are irrelevant –Common-sense level: we may ignore Kirkhoff’s law

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Individuals and Relations Wires, switches, lights, outlets, circuit breakers. Relationships represented by predicates: –light(L)---L is a light –lit(L)---L, a light, is lit –live(W)---W, a wire, has current –up(S)---S, a switch, is up –down(S) –ok(E)---E, a circuit breaker or a light, is not blown –connected_to(X,Y)---current (if present at Y) would flow to X.

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Axiomatize! Write what is true in the intended interpretation, using constant and predicate names. Start with facts. –light(l1)---l1 is a light –down(s1)---switch s1 is down –ok(l2)---l2 is not blown There is a “light” predicate but no “switch” predicate. Why? –Because we distinguish lights when we define “lit” –Because switches cannot be broken

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Keep axiomatizing! Rules, e.g.: –connected_to(w0,w1) <- up(s2) Is this true in the intended interpretation? Check it! –Check what? The figure! –connected_to(w5, outside). Should connected_to be transitive? Symmetric? Reflexive? –Maybe, but it is not in elect.pl!

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering More Rules for House Wiring lit(L) <- light(L) & ok(L) & live(L). A recursive definition: –live(Y) <- connected_to(Y,Z) ^ live(Z). –live(outside).

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering Is this axiomatization good? Every clause is true in the intended interpretation. Some “true” facts are not represented at all. –Some are impossible to represent in definite clause logic without introducing new predicates or constants, e.g.: “If a light is ok and live and it is not lit, then it is blown” requires a negated atom in the body of a clause!