Knowledge Representation & Reasoning Lecture #1 UIUC CS 498: Section EA Professor: Eyal Amir Fall Semester 2004.

Slides:



Advertisements
Similar presentations
1 Knowledge Representation Introduction KR and Logic.
Advertisements

1 Probability and the Web Ken Baclawski Northeastern University VIStology, Inc.
Computer Science CPSC 322 Lecture 25 Top Down Proof Procedure (Ch 5.2.2)
UIUC CS 497: Section EA Lecture #2 Reasoning in Artificial Intelligence Professor: Eyal Amir Spring Semester 2004.
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 20
Agents That Reason Logically Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2004.
Propositional Logic Reading: C , C Logic: Outline Propositional Logic Inference in Propositional Logic First-order logic.
Logic.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
CS498-EA Reasoning in AI Lecture #1 Instructor: Eyal Amir Fall Semester 2011.
CPSC 322, Lecture 20Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Computer Science cpsc322, Lecture 20 (Textbook.
CS 561, Sessions Knowledge and reasoning – second part Knowledge representation Logic and representation Propositional (Boolean) logic Normal forms.
CS 460, Sessions Knowledge and reasoning – second part Knowledge representation Logic and representation Propositional (Boolean) logic Normal forms.
Computing & Information Sciences Kansas State University Lecture 11 of 42 CIS 530 / 730 Artificial Intelligence Lecture 11 of 42 William H. Hsu Department.
Knowledge Representation I (Propositional Logic) CSE 473.
Probabilistic Robotics Introduction Probabilities Bayes rule Bayes filters.
Logical Agents Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 7 Spring 2005.
Rutgers CS440, Fall 2003 Propositional Logic Reading: Ch. 7, AIMA 2 nd Ed. (skip )
Knowledge Representation and Reasoning University "Politehnica" of Bucharest Department of Computer Science Fall 2010 Adina Magda Florea
UIUC CS 497: Section EA Lecture #3 Reasoning in Artificial Intelligence Professor: Eyal Amir Spring Semester 2004.
Fall 98 Introduction to Artificial Intelligence LECTURE 7: Knowledge Representation and Logic Motivation Knowledge bases and inferences Logic as a representation.
Pattern-directed inference systems
1 Logical Agents CS 171/271 (Chapter 7) Some text and images in these slides were drawn from Russel & Norvig’s published material.
Slide 1 Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs Jim Little UBC CS 322 – CSP October 20, 2014.
Semantic web course – Computer Engineering Department – Sharif Univ. of Technology – Fall Description Logics: Logic foundation of Semantic Web Semantic.
Knowledge Repn. & Reasoning Lec #11: Partitioning & Treewidth UIUC CS 498: Section EA Professor: Eyal Amir Fall Semester 2004.
1 2010/2011 Semester 2 Introduction: Chapter 1 ARTIFICIAL INTELLIGENCE.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 17 Wednesday, 01 October.
CS 4100 Artificial Intelligence Prof. C. Hafner Class Notes Jan 17, 2012.
Logical Agents Chapter 7. Knowledge bases Knowledge base (KB): set of sentences in a formal language Inference: deriving new sentences from the KB. E.g.:
1 Logical Agents CS 171/271 (Chapter 7) Some text and images in these slides were drawn from Russel & Norvig’s published material.
9/30/98 Prof. Richard Fikes Inference In First Order Logic Computer Science Department Stanford University CS222 Fall 1998.
CS6133 Software Specification and Verification
CPSC 322, Lecture 19Slide 1 (finish Planning) Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt – 5.2) Oct,
© Copyright 2008 STI INNSBRUCK Intelligent Systems Propositional Logic.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
1 First order theories (Chapter 1, Sections 1.4 – 1.5) From the slides for the book “Decision procedures” by D.Kroening and O.Strichman.
11 Artificial Intelligence CS 165A Thursday, October 25, 2007  Knowledge and reasoning (Ch 7) Propositional logic 1.
Slide 1 Propositional Logic Intro, Syntax Jim Little UBC CS 322 – CSP October 17, 2014 Textbook § – 5.2.
Decision Making Under Uncertainty Lec #1: Introduction UIUC CS 598: Section EA Professor: Eyal Amir Spring Semester 2005.
Knowledge Repn. & Reasoning Lec. #5: First-Order Logic UIUC CS 498: Section EA Professor: Eyal Amir Fall Semester 2004.
Spring, 2005 CSE391 – Lecture 1 1 Introduction to Artificial Intelligence Martha Palmer CSE391 Spring, 2005.
Computing & Information Sciences Kansas State University Lecture 12 of 42 CIS 530 / 730 Artificial Intelligence Lecture 12 of 42 William H. Hsu Department.
Logic: Proof procedures, soundness and correctness CPSC 322 – Logic 2 Textbook §5.2 March 7, 2011.
1 Propositional Logic Limits The expressive power of propositional logic is limited. The assumption is that everything can be expressed by simple facts.
Probabilistic Robotics Introduction Probabilities Bayes rule Bayes filters.
Logical Agents Chapter 7. Outline Knowledge-based agents Propositional (Boolean) logic Equivalence, validity, satisfiability Inference rules and theorem.
CSE 473 Uncertainty. © UW CSE AI Faculty 2 Many Techniques Developed Fuzzy Logic Certainty Factors Non-monotonic logic Probability Only one has stood.
Knowledge Representation & Reasoning Lecture #1 UIUC CS 498: Section EA Professor: Eyal Amir Fall Semester 2005.
Daniel Kroening and Ofer Strichman 1 Decision Procedures An Algorithmic Point of View Basic Concepts and Background.
Knowledge Repn. & Reasoning Lecture #9: Propositional Logic UIUC CS 498: Section EA Professor: Eyal Amir Fall Semester 2005.
Computing & Information Sciences Kansas State University Wednesday, 04 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 17 of 42 Wednesday, 04 October.
Computing & Information Sciences Kansas State University Friday, 13 Oct 2006CIS 490 / 730: Artificial Intelligence Lecture 21 of 42 Friday, 13 October.
Announcements  Upcoming due dates  Thursday 10/1 in class Midterm  Coverage: everything in lecture and readings except first-order logic; NOT probability.
Computing & Information Sciences Kansas State University Monday, 18 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 11 of 42 Monday, 18 September.
Introduction to Artificial Intelligence Heshaam Faili University of Tehran.
Logical Agents. Outline Knowledge-based agents Logic in general - models and entailment Propositional (Boolean) logic Equivalence, validity, satisfiability.
CENG 424-Logic for CS Introduction Based on the Lecture Notes of Konstantin Korovin, Valentin Goranko, Russel and Norvig, and Michael Genesereth.
Computer Science cpsc322, Lecture 20
CS 4700: Foundations of Artificial Intelligence
Knowledge Representation and Reasoning
Knowledge and reasoning – second part
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 20
Knowledge and reasoning – second part
Back to “Serious” Topics…
Knowledge Representation I (Propositional Logic)
Computer Science cpsc322, Lecture 20
Deniz Beser A Fundamental Tradeoff in Knowledge Representation and Reasoning Hector J. Levesque and Ronald J. Brachman.
Representations & Reasoning Systems (RRS) (2.2)
Presentation transcript:

Knowledge Representation & Reasoning Lecture #1 UIUC CS 498: Section EA Professor: Eyal Amir Fall Semester 2004

Explicit Knowledge Representation What is knowledge? What applications do you know of knowledge? Where do we not need knowledge? How do we use knowledge?

Knowledge in Different Forms CYC, OpenMind, SUMO – Commonsense Ontologies – frame-based, semantic web Medical knowledge Diseases/symptoms networks Dynamic systems Specific applications: NLP, Databases

Knowledge Representation and Reasoning (KR&R) Advice taker: a paradigm for KR&R –Represent knowledge (with statements) –Add statements when you want to give advice (control knowledge = statements) –World vs Reasoner (Decision Maker) Reasoner + Knowledge World Sensory information Actions/Decisions

Knowledge Representation and Reasoning (KR&R) Advice taker: a paradigm for KR&R Examples: –A robot moving and manipulating the world –An internet agent booking flights for us –A virtual agent in a computer game Reasoner + Knowledge World Sensory information Actions/Decisions

Reasoning Tasks A robot moving and manipulating the world –Track the environment and its body (actions) –Update its knowledge with new information (sensors & communications) –Make timely decisions –Safe decisions –Take uncertainty into account –Learning and generalizing from knowledge

Example A robot moving and manipulating the world Reasoner + Knowledge World Sensory information Actions/Decisions Reasoning Algorithm KB Symbols to Sensors Tasks Mngr

Example Details 1 A robot moving and manipulating the world Reasoning Algorithm KB Symbols to Sensors Tasks Mngr Reasoning Algorithm KB Symbols to Sensors Tasks Mngr Task: Decide on action Call reasoning algorithm with query. Examples: - next_action(move_fwd) - next_action(look_door)

Example Details 2 A robot moving and manipulating the world Reasoning Algorithm KB Symbols to Sensors Tasks Mngr Task: Is the action safe? Call reasoning algorithm with query. Examples: - safe_action(move_fwd) - safe_action(look_door,s)

Example Details 3 A robot moving and manipulating the world Reasoning Algorithm KB Symbols to Sensors Tasks Mngr Task: Track the world Use reasoning to update knowledge. Examples: get_KB(result(move_fwd)) get_KB(result(arm(10),s))

Example Use of Reasoning 1 Task: select an action to perform Logical KB: (a) Prove that KB entails move_fwd (e.g.,FOL) (b) Find a model of KB that satisfies move_fwd (e.g., propositional logic) Probabilistic KB: –Find the probability of move_fwd (e.g., BNs) –Find an action that gives best utility (MDPs)

Example Use of Reasoning 2 Task: find cause of error Err Logical KB: Abduction: Find an explanation Exp such that KB  Exp logically entails Err Probabilistic KB: –Find the set of variable assignments that has maximum posterior probability given Err

Knowledge Representation and Reasoning (KR&R) Two agents interacting –Sales and purchase agent –Collaboration to achieve a task –Information agent and user agent Reasoning Agent 1 + Knowledge Base 1 Agent 2 + Knowledge Base 2 Response Request

Knowledge Representation and Reasoning (KR&R) Query answering: –Formal verification of digital circuits –Temporal verification of programs –Prediction and explanation Human / Software Reasoning with A Knowledge Base Answer Query

Tractability of Reasoning More expressive languages require more time to reason with Expressivity – Tractability tradeoff Compact representations not always more efficient for reasoning Reasoning with a complete model many times easier than reasoning with general knowledge in the same language

Summary: Why, When, How KR&R Reasoning with knowledge is good when we are not sure about knowledge or query. The language of KB is determined by the application: –Need for expressive language –Need for fast/accurate response Knowledge is entered by hand or learned Tasks for reasoning algorithms vary

In This Course: Representation Knowledge Representation Languages –Logic: propositional, First-Order Logic, Description Logics [, defaults, linear logic] –Probabilities: graphical models (e.g., BNs), relational-probabilistic models [, causality] Specific cases: –Dynamic worlds: logical, probabilistic –Space/Shape: logical, probabilistic –Knowledge about knowledge

In This Course: Reasoning Exact inference: –Fundamental principles –Structure: treewidth [, context-based] Approximate inference: –Sampling, variational, lower/upper bounds,… Special tasks: –Dynamic worlds: filtering, smoothing,… –Space/Shape: logical, probabilistic –Equality

Course Requirements First-order logic (e.g., Models, signature, formulae, literal): [R&N ’03] ch. 8 (lec. #3) Probability & Statistics (e.g., Normal distr., Bayes rule): [R&N ’03] ch. 13 (lecture #6) Computational complexity (level of CS373)

Course Requirements #2 Mathematical maturity: proofs, understanding Independence: follow beyond your presentation reading to gain depth Independence: project will require readings that are not specified Independence: search for information instead of thinking it will come to you

Project Selection Select from list or suggest your own Projects for one or two people 12 th lec. (Oct 7): Project proposals (~1 pg) 18 th lec. (Oct 28): Extended proposals (~3-pages) 24 th lec. (Nov 18): Review of progress (~1 page) Final Exam (Dec 16): Projects due

Cheating Policy First offense: –Exam: zero on exam –Project/homework: zero + loss of full letter grade Second offense: –In same course: failure –In different course: expulsion

More Administrativia Late HW submission policy: 7 days Date/time for midterm ? Course grading Newsgroup

Next Example of (non-traditional) reasoning with first-order logic in a robotics setting Reminder of Propositional Logic notation and concepts

Propositional Logic Language includes –Prop. symbols –Logical connectives Formulas: –Atom –Literal –Formula KB: Set of formulas

Representing Knowledge Propositional symbols represent facts under consideration: –there_is_rain, there_are_clouds, door1_open, robot_in_pos_56_210 Not propositions: –is_there_rain? –location_of_robot –Dan_Roth

Representing Knowledge Knowledge bases are sets of formulae –There_is_rain  there_are_clouds –Robot_in_pos_3_1   Position_3_1_empty –Has_drink  coffee  tea

Knowledge Engineering Select a language: set of features Examine cases Decide on dependencies between features Write dependencies formally Test

Propositional Logic Semantics: –Truth assignments that satisfy KB/formula -a-b a -a b a b Interpretations: I 1 [a]=FALSE I 1 [b]=FALSE assign truth values to propositional symbols I1I1 I2I2 I3I3 I4I4

Propositional Logic Semantics: –Truth assignments that satisfy KB/formula b a b -a -b a -a ╨ Models of f: Interpretations that satisfy f I1I1 I2I2 M 1 = I 3 M 2 = I 4 M1M1

Propositional Logic Semantics: –Truth assignments that satisfy KB/formula ╨ M1M1 Logical Entailment ╨╨╨╨

Propositional Logic Semantics: –Truth assignments that satisfy KB/formula Logical Entailment ╨ ┴ Deduction (inference)

More Notations Interpretations ~ Models Axioms – formulae that are “assumed” Signature – the symbols used by a KB Theory ~ KB (a set of axioms), or Theory ~ the complete set of sentences entailed by the axioms Sentence = formula (in prop. logic)

More Notations The value that symbol p takes in model M: –[[ M ]] p –p M –M[p] -- we will primarily use this Clauses: {lit1, lit2, lit3,…} or lit1  lit2  lit3...

Summary Propositional logic as a language for representing knowledge Did not touch on reasoning procedures Defined language, signature, models

Homework 1.Read readings for next time (on website) 2.Make sure you know: 1.Completeness theorem for prop. Logic 2.What does soundness mean? 3.Deduction theorem for prop. Logic 4.De-Morgan + Distributive Laws 5.Signatures, formulae, models