Notes 8: Predicate logic and inference

Slides:



Advertisements
Similar presentations
Predicate Logic Colin Campbell. A Formal Language Predicate Logic provides a way to formalize natural language so that ambiguity is removed. Mathematical.
Advertisements

1 First order theories (Chapter 1, Sections 1.4 – 1.5)
First-Order Logic.
Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.
Knowledge Representation using First-Order Logic (Part II) Reading: Chapter 8, First lecture slides read: Second lecture slides read:
Predicate Calculus.
CIA2326 Week4: Predicate Logic : introduction Lee McCluskey, room 2/07
FIRST ORDER LOGIC Levent Tolga EREN.
Predicates and Quantifiers
First Order Logic Chapter 7. PL is a Weak Representational Language §Propositional Logic (PL) is not a very expressive language because: §Hard to identify.
1st-order Predicate Logic (FOL)
First-Order Logic Semantics Reading: Chapter 8, , FOL Syntax and Semantics read: FOL Knowledge Engineering read: FOL.
ARTIFICIAL INTELLIGENCE Lecture 3 Predicate Calculus.
1.  Provides the ability to access individual assertions. e.g. in Predicate calculus we may say: P denotes “It rained on Tuesday” but in predicate calculus.
Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Description Logics: Logic foundation of Semantic Web Semantic.
1 Search vs. planning Situation calculus STRIPS operators Search vs. planning Situation calculus STRIPS operators.
1 Introduction to Computational Linguistics Eleni Miltsakaki AUTH Spring 2006-Lecture 8.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
October 17, 2012Introduction to Artificial Intelligence Lecture 11: Knowledge Representation and Reasoning I 1Semantics In propositional logic, we associate.
Logical Agents Chapter 7. Outline Knowledge-based agents Logic in general Propositional (Boolean) logic Equivalence, validity, satisfiability.
CS6133 Software Specification and Verification
Artificial Intelligence Chapter 15 The Predicate Calculus Artificial Intelligence Chapter 15 The Predicate Calculus Biointelligence Lab School of Computer.
LDK R Logics for Data and Knowledge Representation First Order Logics (FOL) Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto.
CS2351 Artificial Intelligence Bhaskar.V Class Notes on Knowledge Representation - Logical Agents.
LDK R Logics for Data and Knowledge Representation Propositional Logic Originally by Alessandro Agostini and Fausto Giunchiglia Modified by Fausto Giunchiglia,
First-Order Logic Semantics Reading: Chapter 8, , FOL Syntax and Semantics read: FOL Knowledge Engineering read: FOL.
Propositional Logic Rather than jumping right into FOL, we begin with propositional logic A logic involves: §Language (with a syntax) §Semantics §Proof.
1 First Order Logic CS 171/271 (Chapter 8) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Formal Semantics Purpose: formalize correct reasoning.
1 Chapter 2.1 Chapter 2.2 Chapter 2.3 Chapter 2.4 All images are copyrighted to their respective copyright holders and reproduced here for academic purposes.
Lecture 041 Predicate Calculus Learning outcomes Students are able to: 1. Evaluate predicate 2. Translate predicate into human language and vice versa.
March 3, 2016Introduction to Artificial Intelligence Lecture 12: Knowledge Representation & Reasoning I 1 Back to “Serious” Topics… Knowledge Representation.
CS.462 Artificial Intelligence SOMCHAI THANGSATHITYANGKUL Lecture 04 : Logic.
Propositional Logic (a.k.a. Sentential Logic)
Chapter 7. Propositional and Predicate Logic
Chapter 8 : Fuzzy Logic.
Logics for Data and Knowledge Representation
Knowledge Representation and Reasoning
L9. Planning Agents L7_exAnswer and explanation Review
Knowledge Representation III First-Order Logic
The Propositional Calculus
Predicate logic CSC 333.
ARTIFICIAL INTELLIGENCE
Notes 8: Predicate logic and inference
Predicate Logic Lecture 7.
Artificial Intelligence
Semantics In propositional logic, we associate atoms with propositions about the world. We specify the semantics of our logic, giving it a “meaning”. Such.
CS201: Data Structures and Discrete Mathematics I
Knowledge Representation III First-Order Logic
Logics for Data and Knowledge Representation
Logics for Data and Knowledge Representation
L11. Planning Agents and STRIPS
Artificial Intelligence Chapter 15. The Predicate Calculus
Formal Methods in software development
1st-order Predicate Logic (FOL)
Back to “Serious” Topics…
MA/CSSE 474 More Math Review Theory of Computation
Logics for Data and Knowledge Representation
Chapter 7. Propositional and Predicate Logic
Knowledge Representation I (Propositional Logic)
Artificial Intelligence Chapter 21. The Situation Calculus
Formal Methods in software development
Chapter 1: Propositional and First-Order Logic
Logics for Data and Knowledge Representation
CS201: Data Structures and Discrete Mathematics I
Logical and Rule-Based Reasoning Part I
Introduction to Computational Linguistics
Artificial Intelligence
CS589 Principles of DB Systems Fall 2008 Lecture 4e: Logic (Model-theoretic view of a DB) Lois Delcambre
1st-order Predicate Logic (FOL)
Presentation transcript:

Notes 8: Predicate logic and inference ICS 171 Fall 2006

Propositional logic is not expressive Needs to refer to objects in the world, Needs to express general rules On(x,y) à ~ clear(y) All man are mortal Everyone who passed age 21 can drink One student in this class got perfect score Etc…. First order logic, also called Predicate calculus allows more expressiveness

Semantics: Models An interpretation satisfies a wff (sentence) if the wff has the value “true” under the interpretation. An interpretation that satisfies a wff is a model of that wff Any wff that has the value “true” under all interpretations is valid Any wff that does not have a model is inconsistent or unsatisfiable If a wff w has a value true under all the models of a set of sentences delta then delta logically entails w

Example of models The formulas: On(A,F1)  Clear(B) Clear(B) and Clear(C)  On(A,F1) Clear(B) or Clear(A) Clear(B) Clear(C) Possible interpretations which are models: On = {<B,A>,<A,floor>,<C,Floor>} Clear = {<C>,<B>}

Modeling a domain; Conceptualization The kinship domain: object are people Properties include gender and they are related by relations such as parenthood, brotherhood,marriage predicates: Male, Female (unary) Parent,Sibling,Daughter,Son... Function:Mother Father