Propositions. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 1

Similar documents
Propositional Logic: Semantics and an Example

Chapter 5: Propositions and Inference. c D. Poole, A. Mackworth 2010, W. Menzel 2015 Artificial Intelligence, Chapter 5, Page 1

Propositions. c D. Poole and A. Mackworth 2008 Artificial Intelligence, Lecture 5.1, Page 1

Chapters 2&3: A Representation and Reasoning System

Individuals and Relations

Announcements. Assignment 5 due today Assignment 6 (smaller than others) available sometime today Midterm: 27 February.

Logic: Bottom-up & Top-down proof procedures

Propositional Logic: Bottom-Up Proofs

Logic: Intro & Propositional Definite Clause Logic

Contents Chapters 2 & 3

Künstliche Intelligenz

Propositional Logic 1

Chapter 1, Part I: Propositional Logic. With Question/Answer Animations

Introduction to Artificial Intelligence Propositional Logic & SAT Solving. UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010

Agents that reason logically

The Foundations: Logic and Proofs. Part I

First Order Logic (FOL)

Reasoning Under Uncertainty: Introduction to Probability

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Reasoning Under Uncertainty: Introduction to Probability

Outline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference

COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning

Chapter 4: Classical Propositional Semantics

Outline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):

CSCI 5582 Artificial Intelligence. Today 9/28. Knowledge Representation. Lecture 9

Logic. Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001

Artificial Intelligence Knowledge Representation I

Stochastic Simulation

Logical Agents. September 14, 2004

Introduction to Artificial Intelligence. Logical Agents

Kecerdasan Buatan M. Ali Fauzi

Logic: Resolution Proofs; Datalog

Artificial Intelligence. Propositional logic

Propositional Languages

EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS

Agenda. Artificial Intelligence. Reasoning in the Wumpus World. The Wumpus World

a. ~p : if p is T, then ~p is F, and vice versa

Topic 1: Propositional logic

Artificial Intelligence Chapter 7: Logical Agents

Propositional Logic: Review

Harvard CS 121 and CSCI E-121 Lecture 22: The P vs. NP Question and NP-completeness

Logical Agent & Propositional Logic

KR: First Order Logic - Intro

CSC242: Intro to AI. Lecture 11. Tuesday, February 26, 13

CS 331: Artificial Intelligence Propositional Logic I. Knowledge-based Agents

Knowledge-based Agents. CS 331: Artificial Intelligence Propositional Logic I. Knowledge-based Agents. Outline. Knowledge-based Agents

Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs

CSE20: Discrete Mathematics for Computer Science. Lecture Unit 2: Boolan Functions, Logic Circuits, and Implication

Foundations of Artificial Intelligence

Logical Agent & Propositional Logic

Foundations of Artificial Intelligence

CS154, Lecture 10: Rice s Theorem, Oracle Machines

Equational Logic and Term Rewriting: Lecture I

Logic: Propositional Logic (Part I)

CS 4700: Artificial Intelligence

Introduction to Intelligent Systems

Introduction to Intelligent Systems

Learning Objectives. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 7.2, Page 1

Logical Agents (I) Instructor: Tsung-Che Chiang

Propositional Reasoning

cse 311: foundations of computing Fall 2015 Lecture 6: Predicate Logic, Logical Inference

Propositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.

Propositional and Predicate Logic

A statement is a sentence that is definitely either true or false but not both.

cse541 LOGIC FOR COMPUTER SCIENCE

Introduction to Karnaugh Maps

PL: Truth Trees. Handout Truth Trees: The Setup

Propositional and Predicate Logic

cis32-ai lecture # 18 mon-3-apr-2006

Rule-Based Classifiers

Chapter 2: Introduction to Propositional Logic

Intelligent Agents. Pınar Yolum Utrecht University

Proofs Propositions and Calculuses

Propositional Resolution Introduction

Reasoning Under Uncertainty: Belief Network Inference

CS 4700: Foundations of Artificial Intelligence

Stochastic Simulation

Knowledge based Agents

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Foundations of Artificial Intelligence

Logic: Top-down proof procedure and Datalog

ECE473 Lecture 15: Propositional Logic

Artificial Intelligence

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

CSE 20 DISCRETE MATH. Fall

CSC384: Intro to Artificial Intelligence Knowledge Representation II. Required Readings: 9.1, 9.2, and 9.5 Announcements:

Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.

First Order Logic: Syntax and Semantics

KB Agents and Propositional Logic

Logical reasoning - Can we formalise our thought processes?

THE LOGIC OF COMPOUND STATEMENTS


Price: $25 (incl. T-Shirt, morning tea and lunch) Visit:

MA103 STATEMENTS, PROOF, LOGIC

First Order Logic (FOL)

Announcements. Project 1 underway... Second midterm Friday. discuss ideas with TAs check out wiki

COMP219: Artificial Intelligence. Lecture 20: Propositional Reasoning

Deduction by Daniel Bonevac. Chapter 3 Truth Trees

Inference in Propositional Logic

Transcription:

Propositions An interpretation is an assignment of values to all variables. A model is an interpretation that satisfies the constraints. Often we don t want to just find a model, but want to know what is true in all models. A proposition is statement that is true or false in each interpretation. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 1

Why propositions? Specifying logical formulae is often more natural than filling in tables It is easier to check correctness and debug formulae than tables We can exploit the Boolean nature for efficient reasoning We need a language for asking queries (of what follows in all models) that may be more complicated than asking for the value of a variable It is easy to incrementally add formulae It can be extended to infinitely many variables with infinite domains (using logical quantification) c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 2

Human s view of semantics Step 1 Begin with a task domain. Step 2 Choose atoms in the computer to denote propositions. These atoms have meaning to the KB designer. Step 3 Tell the system knowledge about the domain. Step 4 Ask the system questions. the system can tell you whether the question is a logical consequence. You can interpret the answer with the meaning associated with the atoms. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 3

Role of semantics In computer: light1 broken sw up power unlit light1. sw up. power lit light2. unlit light1. lit light2. Conclusion: light1 broken In user s mind: light1 broken: light #1 is broken sw up: switch is up power: there is power in the building unlit light1: light #1 isn t lit lit light2: light #2 is lit The computer doesn t know the meaning of the symbols The user can interpret the symbol using their meaning c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 4

Simple language: propositional definite clauses An atom is a symbol starting with a lower case letter A body is an atom or is of the form b 1 b 2 where b 1 and b 2 are bodies. A definite clause is an atom or is a rule of the form h b where h is an atom and b is a body. A knowledge base is a set of definite clauses c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 5

Semantics An interpretation I assigns a truth value to each atom. A body b 1 b 2 is true in I if b 1 is true in I and b 2 is true in I. A rule h b is false in I if b is true in I and h is false in I. The rule is true otherwise. A knowledge base KB is true in I if and only if every clause in KB is true in I. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 6

Models and Logical Consequence A model of a set of clauses is an interpretation in which all the clauses are true. If KB is a set of clauses and g is a conjunction of atoms, g is a logical consequence of KB, written KB = g, if g is true in every model of KB. That is, KB = g if there is no interpretation in which KB is true and g is false. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 7

Simple Example p q. KB = q. r s. p q r s model? I 1 true true true true I 2 false false false false I 3 true true false false I 4 true true true false I 5 true true false true c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 8

Simple Example p q. KB = q. r s. p q r s model? I 1 true true true true is a model of KB I 2 false false false false not a model of KB I 3 true true false false is a model of KB I 4 true true true false is a model of KB I 5 true true false true not a model of KB c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 9

Simple Example p q. KB = q. r s. p q r s model? I 1 true true true true is a model of KB I 2 false false false false not a model of KB I 3 true true false false is a model of KB I 4 true true true false is a model of KB I 5 true true false true not a model of KB Which of p, q, r, q logically follow from KB? c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 10

Simple Example p q. KB = q. r s. p q r s model? I 1 true true true true is a model of KB I 2 false false false false not a model of KB I 3 true true false false is a model of KB I 4 true true true false is a model of KB I 5 true true false true not a model of KB Which of p, q, r, q logically follow from KB? KB = p, KB = q, KB = r, KB = s c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 11

User s view of Semantics 1. Choose a task domain: intended interpretation. 2. Associate an atom with each proposition you want to represent. 3. Tell the system clauses that are true in the intended interpretation: axiomatizing the domain. 4. Ask questions about the intended interpretation. 5. If KB = g, then g must be true in the intended interpretation. 6. Users can interpret the answer using their intended interpretation of the symbols. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 12

Computer s view of semantics The computer doesn t have access to the intended interpretation. All it knows is the knowledge base. The computer can determine if a formula is a logical consequence of KB. If KB = g then g must be true in the intended interpretation. If KB = g then there is a model of KB in which g is false. This could be the intended interpretation. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 13

Electrical Environment cb1 outside power s1 w5 w0 l1 s2 w1 w2 w4 s3 w3 cb2 w6 p2 off circuit breaker switch on two-way switch p1 light l2 power outlet c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 14

Representing the Electrical Environment light l 1. light l 2. down s 1. up s 2. up s 3. ok l 1. ok l 2. ok cb 1. ok cb 2. live outside. lit l 1 live w 0 ok l 1 live w 0 live w 1 up s 2. live w 0 live w 2 down s 2. live w 1 live w 3 up s 1. live w 2 live w 3 down s 1. lit l 2 live w 4 ok l 2. live w 4 live w 3 up s 3. live p 1 live w 3. live w 3 live w 5 ok cb 1. live p 2 live w 6. live w 6 live w 5 ok cb 2. live w 5 live outside. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 15