Situation Calculus. Gerald Steinbauer. Institute for Software Technology. Gerald Steinbauer. Situation Calculus - Introduction
|
|
- Baldric Ferguson
- 5 years ago
- Views:
Transcription
1 Situation Calculus Institute for Software Technology 1
2 Dates Organizational Issues :45-11:00 (HS i12) lecture and first assignment :45-11:00 (HS i12) lecture and programming assignment :00-18:45 (HS i11) practice :00-18:45 (HS i11) practice and solution for first assignment :00 submission first assignment :59 submission programming assignment 2
3 Organizational Issues Motivation Introduction Agenda Brief Recap of First Order Logic (if needed) Situation Calculus (today) Introduction Formal Definition Usage Programming in Situation Calculus (next week) Programming Language YAGI Domain Modeling 3
4 Literature Knowledge in Action by Raymond Reiter MIT Press Artificial Intelligence: A Modern Approach by Stuart Russel amd Peter Norvig Prentice Hall 4
5 Motivation What is Situation Calculus good for? 5
6 There is nothing permanent except change. Heraclitus of Ephesus, 535 c. 475 BC 6
7 Perception-Decision-Execution 7
8 Dealing with Multiple Worlds 8
9 Belief Management 9
10 Belief Management 10
11 Brief Recap First Order Logic 11
12 The Situation Calculus is a methodology to reason about actions and change it allows deductive reasoning on how to behave what are the consequences proposed by John McCarthy (1963) further developed by Raymond Reiter and others originally used for database transactions (1995) uses second-order logic (Reiter 2001) modeling of dynamic systems (e.g., robots, plants, ) basis for several (action) programming languages (e.g. Golog) 18
13 Properties of the Situation Calculus Advantages allows for reasoning about actions and change uses the foundations of logic allows for testing and proving of properties is solution to some fundamental problems of AI (e.g. frame problem) Drawbacks based on second-order logic domain modeling is complex and error prune real implementation somehow fuzzy computational expensive (in particular if you do it wrong) 19
14 Building Blocks Domain Dependent Objects Fluents Situations Actions The green building blocks are different sorts in the second order logic. The blue building block is used to retrieve properties about the world. 20
15 States Electrical Engineering or Computer Science several applications of states Deterministic Finite Automaton signup protocols parser model checking testing submission pass q 0 q 1 q 2 q 30 A Q,, q,, 0 F no submission not pass 22
16 Situations inductively defined as term a constant symbol S 0 denotes the initial situation (nothing happened so far) a binary function symbol do:actions sitations situations situations can be interpreted as sequences of actions do(a,s) performs action a in situation s do(a,s) adds action a to sequence represented by s binary predicate symbol :situation situation s s denotes that s is a proper subsequence of s 23
17 Sates versus Situations situations are different to states they contain a history of what happened so far snapshots of properties of the world are retrieved by fluents, i.e. which predicates hold in a situation two situations are different if their sequence is different the state of fluents may be the same 24
18 Situation Tree do(a n,s 0 ) a n a 3 a 2 a n a 1 S 0 a 3 a 2 do(a n,do(a 1,S 0 )) a 1 do(a 1,S 0 ) a n a 3 a 2 a 1 25
19 Example Dress Up 26
20 Actions actions are the only entities which change something (i.e., situations and truth values of fluents) actions are represented as function symbols actions have a unique name, if the names are different the actions perform different things actions can have parameters of arity n, e.g. moveto(object, room) or sleep() an action a is executed in a situation s by the function s =do(a,s) leading to a new situation s an action has a precondition in which situation an action is possible to be executed 27
21 Action Precondition Axioms take care if an action a is executable we introduce a binary predicate symbol Poss:action situation is a sentence in the form Poss(A(x 1,,x n ),s) A (x 1,,x n,s) A is a formula with free variables x 1,,x n and s e.g. Poss(enter_room(x),s) door_open(x,s) axioms have to be defined for all actions a A 29
22 Fluents used to catch the dynamic world fluents are related to states represent relations and functions that change from situation to situation two different fluents relational fluents functional fluents 30
23 Relational Fluents represents a relation (or properties) of objects in a situation s it is represented by a predicate symbol with arity n+1 in the form F(x 1,,x n,s) F:(objects actions) n situation {T,F} it represents the truth value of a relation or property in a certain situation examples: at(x,y,s) or broken(x,s) 31
24 Functional Fluents represents a function of objects in a situation s it is represented by a function symbol with arity n+1 in the form f(x 1,,x n,s) it represents the result (object) of a function f:(objects actions) n situation (objects actions) example: position(x,s) 32
25 Frame Problem another important (fundamental) problem of AI formulated by John McCarhty and Patrick Hayes related to the abstract modeling of dynamic world how to efficiently specify what is changed by an action and what remains the same sloppy: logic has no memory we need frame axioms example: the color of an object does not change if it is lifted, color(x,c,s) color(x,c,do(lift(x),s)) 33
26 Successor State Axioms (1) are a solution to the Frame Problem naively we have to specify all effect axioms (because of the frame problem) a. φ F+ (x 1,,x n, y 1,,y m, s) F(x 1,,x n,do(a(y 1,,y m ),s)) b. φ F- (x 1,,x n, y 1,,y m, s) F(x 1,,x n,do(a(y 1,,y m ),s)) example: fragile(x,s) broken(x,do(drop(x),s)) use Causal Completeness Assumption a and b specify all casual laws related to A and F 34
27 Successor State Axioms (2) F(x 1,,x n,s) F(x 1,,x n,do(a(y 1,,y m ),s)) φ F- (x 1,,x n,y 1,,y m,s) F(x 1,,x n,s) φ F- (x 1,,x n,y 1,,y m,s) F(x 1,,x n,do(a(y 1,,y m ),s)) [PFA] F(x 1,,x n,s) F(x 1,,x n,do(a(y 1,,y m ),s)) φ F+ (x 1,,x n,y 1,,y m,s) F(x 1,,x n,s) φ F+ (x 1,,x n,y 1,,y m,s) F(x 1,,x n,do(a(y 1,,y m ),s)) [NFA] lead to 2 x #actions x #fluents frame axioms fragile(x,s) broken(x,do(drop(x),s)) [PEA] broken(x,s) fragile(x,s) broken(x,do(drop(x),s)) [NFA] 35
28 Successor State Axioms (4) the general solution positive and negative normal form effect axioms + F(t 1,,t n,do(α,s)) ( y 1,,y m )[a=α x=t + ] F(x 1,,x n,do(a,s)) + F(x 1,,x n,do(a,s)) ( +(1) +(k) ) F(x 1,,x n,do(a,s)) + (x 1,,x n,a,s) F(x 1,,x n,do(a,s)) [PNF] - (x 1,,x n,a,s) F(x 1,,x n,do(a,s)) [NNF] unique name axiom for actions A(x) B(y) and A(x 1,,x n )=A(y 1,,y n ) x 1 =y 1 x n =y n if T entails ( x,a,s). + (x,a,s) - (x,a,s) F(x,do(a,s)) + (x,a,s) F(x,s) - (x,a,s) [SSA-RF] 37
29 Successor State Axioms (5) now we need only #actions + #fluents axioms 38
30 Summary Successor State Axioms provides a solution to the Frame Problem yields simple compact axioms only for deterministic primitive actions does not solve the qualification and ramification problem length of successor state axioms ~ #actions change a fluent assumption: only a few actions change a fluent 39
31 Initial Situation S 0 is a special constant of sort situation it represents the initial situation D S0 is the initial database it comprises sentences describing the initial theory of the world, i.e. fluents that hold in S 0 S 0 is the only situation mentioned D S0 must not mention Poss, do or it may comprise non-situation terms examples: location(robot,office1,s 0 ), mountain(mteverest) 42
32 Foundational Axioms for Situations ensure some properties of situations situations are understood as sequence of actions abbreviation: do(a n,( do(a 1,S 0 )) = do([a 1,a n ],S 0 ) s s denotes that s is a subsequence of s 1. do(a 1,s 1 )=do(a 2,s 2 ) a 1 =a 2 s 1 =s 2 [UNA] 2. P.P(S 0 ) a,s.(p(s) P(do(a,s))) s.p(s) [SCA] 3. (s S 0 ) [nothing happened prior S 0 ] 4. s do(a,s ) s s with s s ~ s s s=s 43
33 Basic Action Theory (BAT) D D ssa D ap D una D S 0 Σ set of foundational axioms for situations D ssa set of successor state axioms D ap set of action precondition axioms D una set of unique name axioms for actions D set of first order sentences uniform in S S
34 Putting all Together (An Example) Towers of Hanoi a b c
35 Regression related to the projection problem does a sentence hold for a future situation used for automated reasoning and planning in the SC sketch: prove if sentence W is entailed by BAT W mentions a relational fluent F(x 1,,x n,do(a,σ)) successor state axiom F(x 1,,x n,do(a,s)) F (x 1,,x n,a,s) obtain W by substituting F by F eliminating complex situation do(a, σ) from W W is closer to S 0 than W repeat the substitution until W 0 uniform in S 0 now we can prove W in the initial database (no second order axioms) 46
36 Regressable Formulas a formula W in the situation calculus is regressable iff 1. situation terms mentioned in W are of the form do([α 1,,α n ],S 0 ) 2. for atoms of form Poss(α,s) mentioned in W α has the form A(t 1,,t n ) and is an action function symbol 3. W does not quantify over situations 4. W does not mention the predicate symbol nor any equality atom σ=σ for situations 47
37 Examples for Regressable Formulas 1. Poss(walk(A,B)S 0 ) Poss(enter(office(Sue)),do(walk(A,B),S 0 )) Poss(giveCoffee(Sue),do([walk(A,B),enter(Office(Sue))],S 0 ) 2. ( a,a ).ontable(a,do(a,s 0 )) ( x).x A ontable(x,do([a,a ],S 0 )) Regressable? Poss(a,S 0 ) holding(x,do(pickup(a),s)) 48
38 Regression Operator 1. if W is situation-independent or a relational fluent F(x,S 0 ) [W]=W 2. if W is a regressable Poss(A(t),σ) atom and Poss(A(x),s) A (x,s) [W]= [ A (t,σ)] 3. if W is a relational fluent F(t,do(α,σ)) and F(x,do(a,s)) F (x,a,s) [W]= [ F (t,α,σ)] 4. [ W]= [W] [W 1 W 2 ]= [W 1 ] [W 2 ] [( v)w]=( v) [W] 49
39 Important Result from Regression if D is a basic action theory and W is a regressable sentence then, D W iff D S 0 D una [W] 50
40 Situation Calculus Summary allows for reasoning about change and actions a dialect of the second-order logic uses the concept of situations allows for proving properties solves the frame problem Basic Action Theory implements the situation calculus Action Precondition & Successor State Axioms & Unique Name Assumption & Foundation Axioms & Initial Situation Regression and Planning allows for automated reasoning and planning 53
41 Outlook Programming with SC Situation Calculus is yet only a theoretical construct Golog (algol for Logic) is based on the Situation Calculus it is a program language for dynamic systems cumbersome to use (Prolog-based interpreter ) YAGI (yet another golog interpreter) gives a clear syntax and better usability 54
42 Questions? 55
The Situation Calculus and Golog
and A Tutorial Gerhard Lakemeyer Dept. of Computer Science RWTH Aachen University Germany 2nd Hybris Workshop, Freiburg, May 27 28, 2013 Outline 1 2 3 May 28, 2013 2 / 34 Knowledge-Based Agents Example:
More informationGerald Steinbauer Institute for Software Technology
Situation ti Calculus l and Golog Institute for Software Technology 1 Recap Situation Calculus Situation Calculus allows for reasoning about change and actions a dialect of the second-orderorder logic
More informationSituation Calculus and Golog
Situation Calculus and Golog Institute for Software Technology 1 Recap Situation Calculus Situation Calculus allows for reasoning about change and actions a dialect of the second-order logic uses the concept
More informationOn the Role of Possibility in Action Execution and Knowledge in the Situation Calculus
On the Role of Possibility in Action Execution and Knowledge in the Situation Calculus Vahid Vaezian (B) and James P. Delgrande School of Computing Science, Simon Fraser University, Burnaby, BC V5A 1S6,
More information14. Actions. KR & R Brachman & Levesque Situation calculus
14. Actions KR & R Brachman & Levesque 2005 236 Situation calculus The situation calculus is a dialect of FOL for representing dynamically changing worlds in which all changes are the result of named actions.
More informationOn the Progression of Situation Calculus Basic Action Theories: Resolving a 10-year-old Conjecture
On the Progression of Situation Calculus Basic Action Theories: Resolving a 10-year-old Conjecture Stavros Vassos and Hector J Levesque Department of Computer Science University of Toronto Toronto, ON,
More informationReconciling Situation Calculus and Fluent Calculus
Reconciling Situation Calculus and Fluent Calculus Stephan Schiffel and Michael Thielscher Department of Computer Science Dresden University of Technology {stephan.schiffel,mit}@inf.tu-dresden.de Abstract
More informationTractable Reasoning with Incomplete First-Order Knowledge in Dynamic Systems with Context-Dependent Actions
Tractable Reasoning with Incomplete First-Order Knowledge in Dynamic Systems with Context-Dependent Actions Yongmei Liu and Hector J. Levesque Department of Computer Science University of Toronto Toronto,
More informationNon-Markovian Control in the Situation Calculus
From: AAAI-02 Proceedings. Copyright 2002, AAAI (www.aaai.org). All rights reserved. Non-Markovian Control in the Situation Calculus Alfredo Gabaldon Department of Computer Science University of Toronto
More informationNon-Markovian Control in the Situation Calculus
Non-Markovian Control in the Situation Calculus An Elaboration Niklas Hoppe Seminar Foundations Of Artificial Intelligence Knowledge-Based Systems Group RWTH Aachen May 3, 2009 1 Contents 1 Introduction
More informationContinuing the KRR Journey
1 Weeks 1 3 Week 4 Week 5 Week 6 Continuing the KRR Journey Propositional and first-order logic (FOL) Expressiveness and Decidability: Propositional logic is decidable, FOL is not. Classical planning problems:
More informationExpressing Transactions with Savepoints as Non-Markovian Theories of Actions
Expressing Transactions with Savepoints as Non-Markovian Theories of Actions Iluju Kiringa School of Info. Technology and Eng. University of Ottawa Alfredo Gabaldon Department of Computer Science University
More informationOn Defaults in Action Theories
On Defaults in Action Theories Hannes Strass and Michael Thielscher Department of Computer Science Dresden University of Technology {hannes.strass,mit}@inf.tu-dresden.de Abstract. We study the integration
More informationIntegrating State Constraints and Obligations in Situation Calculus
Integrating State Constraints and Obligations in Situation Calculus Robert Demolombe ONERA-Toulouse 2, Avenue Edouard Belin BP 4025, 31055 Toulouse Cedex 4, France. Robert.Demolombe@cert.fr Pilar Pozos
More information14. Actions. Situation calculus. Fluents. Preconditions and effects
Situation calculus 14. Actions The situation calculus is a dialect of FOL for representing dynamically changing worlds in which all changes are the result of named actions. There are two distinguished
More informationCumulative Effects of Concurrent Actions on Numeric-Valued Fluents
Cumulative Effects of Concurrent Actions on Numeric-Valued Fluents Esra Erdem Institute of Information Systems, Vienna University of Technology, Vienna, Austria esra@kr.tuwien.ac.at Alfredo Gabaldon National
More informationDecidable Reasoning in a Modified Situation Calculus
Decidable Reasoning in a Modified Situation Calculus Yilan Gu Dept. of Computer Science University of Toronto 10 King s College Road Toronto, ON, M5S 3G4, Canada Email: yilan@cs.toronto.edu Abstract We
More informationOntologies and Domain Theories
Ontologies and Domain Theories Michael Grüninger Department of Mechanical and Industrial Engineering University of Toronto gruninger@mie.utoronto.ca Abstract Although there is consensus that a formal ontology
More informationExample: Robot Tasks. What is planning? Background: Situation Calculus. Issues in Planning I
What is planning? q A plan is any hierarchical process in the organism that can control the order in which a sequence of operations is to be performed. [Miller, Galanter and Pribram 1960] q Planning can
More informationTHE LANGUAGE OF FIRST-ORDER LOGIC (FOL) Sec2 Sec1(1-16)
THE LANGUAGE OF FIRST-ORDER LOGIC (FOL) Sec2 Sec1(1-16) FOL: A language to formulate knowledge Logic is the study of entailment relationslanguages, truth conditions and rules of inference. FOL or Predicate
More informationProjection using Regression and Sensors
Projection using Regression and Sensors Giuseppe De Giacomo Dipartimento di Informatica e Sistemistica Università di Roma La Sapienza Via Salaria 11, 00198 Roma, Italy degiacomo@dis.uniroma1.it Hector
More informationA description logic based situation calculus
Ann Math Artif Intell (2010) 58:3 83 DOI 10.1007/s10472-010-9176-z A description logic based situation calculus Yilan Gu Mikhail Soutchanski Published online: 18 March 2010 Springer Science+Business Media
More informationOn First-Order Definability and Computability of Progression for Local-Effect Actions and Beyond
On First-Order Definability and Computability of Progression for Local-Effect Actions and Beyond Yongmei Liu Dept. of Computer Science Sun Yat-sen University Guangzhou 510275, China ymliu@mail.sysu.edu.cn
More informationPrice: $25 (incl. T-Shirt, morning tea and lunch) Visit:
Three days of interesting talks & workshops from industry experts across Australia Explore new computing topics Network with students & employers in Brisbane Price: $25 (incl. T-Shirt, morning tea and
More informationInterpreting Golog Programs in Flux
Interpreting Golog Programs in Flux Stephan Schiffel and Michael Thielscher Department of Computer Science Dresden University of Technology {stephan.schiffel,mit}@inf.tu-dresden.de Abstract A new semantics
More informationEmbracing Causality in Specifying the Indirect Effects of Actions*
Embracing Causality in Specifying the Indirect Effects of Actions* Fangzhen Lin Department of Computer Science University of Toronto Toronto, Canada M5S 1A4 Email: fl@cs.toronto.edu Abstract represented
More informationProgression of Situation Calculus Action Theories with Incomplete Information
Progression of Situation Calculus Action Theories with Incomplete Information Stavros Vassos and Hector Levesque Department of Computer Science University of Toronto Toronto, ON, CANADA {stavros,hector}@cs.toronto.edu
More informationIntroduction on Situational Calculus
Introduction on Situational Calculus Fangkai Yang Department of Computer Sciences The University of Texas at Austin September 24, 2010 Fangkai Yang (fkyang@cs.utexas.edu) September 24, 2010 1 / 27 Outline
More informationHandling Uncertainty System in the Situation Calculus with Macro-actions. actions
Handling Uncertainty System in the Situation Calculus with Macro-actions actions Yilan Gu Department of Computer Science University of Toronto November 28, 2002 Outline Review the situation calculus Introducing
More informationFrom Causal Theories to Successor State Axioms and STRIPS-Like Systems
From: AAAI-00 Proceedings. Copyright 2000, AAAI (www.aaai.org). All rights reserved. From Causal Theories to Successor State Axioms and STRIPS-Like Systems Fangzhen Lin (flin@cs.ust.hk) Department of Computer
More informationCOMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning
COMP9414, Monday 26 March, 2012 Propositional Logic 2 COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning Overview Proof systems (including soundness and completeness) Normal Forms
More informationPlanning and search. FOL and situation calculus. FOL and situation calculus 1
Planning and search FOL and situation calculus FOL and situation calculus 1 Outline First-order logic continued Situation calculus Logic and planning FOL and situation calculus 2 Fun with sentences Brothers
More informationPrecondition Control and the Progression Algorithm
From: ICAPS-04 Proceedings. Copyright 2004, AAAI (www.aaai.org). All rights reserved. Precondition Control and the Progression Algorithm Alfredo Gabaldon Department of Computer Science University of Toronto
More informationSituation Calculus. Chapter 16. Fangzhen Lin
Handbook of Knowledge Representation Edited by F. van Harmelen, V. Lifschitz and B. Porter 2008 Elsevier B.V. All rights reserved DOI: 10.1016/S1574-6526(07)03016-7 649 Chapter 16 Situation Calculus Fangzhen
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationDefault Reasoning in Action Domains with Conditional, Non-Local Effect Actions
Default Reasoning in Action Domains with Conditional, Non-Local Effect Actions Hannes Strass Department of Computer Science, Dresden University of Technology hannes.strass@inf.tu-dresden.de Michael Thielscher
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationReasoning about Noisy Sensors and Effectors in the Situation Calculus
Reasoning about Noisy Sensors and Effectors in the Situation Calculus arxiv:cs/9809013v1 [cs.ai] 9 Sep 1998 Fahiem Bacchus Dept. Computer Science University of Waterloo Waterloo, Ontario Canada, N2L 3G1
More informationCOMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning " Hanna Kurniawati"
COMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning " Hanna Kurniawati" Last week" Main components of PRM" Collision check for a configuration"
More informationAction, Belief Change and the Frame Problem: A Fluent Calculus Approach
Action, Belief Change and the Frame Problem: A Fluent Calculus Approach Richard B. Scherl Computer Science Department Monmouth University West Long Brach, NJ 07764 U.S.A. email: rscherl@monmouth.edu Abstract
More informationSituations, si! Situation terms, no!
Situations, si! Situation terms, no! Gerhard Lakemeyer Dept. of Computer Science RWTH Aachen 52056 Aachen Germany gerhard@cs.rwth-aachen.de Hector J. Levesque Dept. of Computer Science University of Toronto
More informationCS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.
3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on
More informationChange, Change, Change: three approaches
Change, Change, Change: three approaches Tom Costello Computer Science Department Stanford University Stanford, CA 94305 email: costelloqcs.stanford.edu Abstract We consider the frame problem, that is,
More informationPropositional Logic: Logical Agents (Part I)
Propositional Logic: Logical Agents (Part I) This lecture topic: Propositional Logic (two lectures) Chapter 7.1-7.4 (this lecture, Part I) Chapter 7.5 (next lecture, Part II) Next lecture topic: First-order
More informationReasoning by Regression: Pre- and Postdiction Procedures for Logics of Action and Change with Nondeterminism*
Reasoning by Regression: Pre- and Postdiction Procedures for Logics of Action and Change with Nondeterminism* Marcus Bjareland and Lars Karlsson Department of Computer and Information Science Linkopings
More informationA Closed-Form Solution to the Ramification Problem (Sometimes)
A losed-form Solution to the Ramification Problem (Sometimes) Sheila A McIlraith Department of omputer Science University of Toronto Toronto M5S 3G4 anada E-mail: mcilrait@csutorontoca October 19 1997
More informationOverview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural
More informationCompiling Causal Theories to Successor State Axioms and STRIPS-Like Systems
Journal of Artificial Intelligence Research 19 (2003) 279-314 Submitted 09/02; published 10/03 Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems Fangzhen Lin Department of Computer
More informationFirst Order Logic: Syntax and Semantics
CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday
More informationLecture 10: Feb. 11, 2015
CS324: AI (Situation Calculus & Reasoning.) Spring 2015 Lecturer: K.R. Chowdhary Lecture 10: Feb. 11, 2015 : Professor of CS (VF) Disclaimer: These notes have not been subjected to the usual scrutiny reserved
More informationOn Ability to Autonomously Execute Agent Programs with Sensing
On Ability to Autonomously Execute Agent Programs with Sensing Sebastian Sardiña Dept. of Computer Science University of Toronto ssardina@cs.toronto.edu Yves Lespérance Dept. of Computer Science York University
More informationA Generative Dialogue System for Arguing about Plans in Situation Calculus
A Generative Dialogue System for Arguing about Plans in Situation Calculus Alexandros Belesiotis 1, Michael Rovatsos 1, and Iyad Rahwan 2,1 1 School of Informatics, The University of Edinburgh, Edinburgh
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More informationPropositional logic. First order logic. Alexander Clark. Autumn 2014
Propositional logic First order logic Alexander Clark Autumn 2014 Formal Logic Logical arguments are valid because of their form. Formal languages are devised to express exactly that relevant form and
More informationOn the Decidability of Verifying LTL Properties of GOLOG Programs
On the Decidability of Verifying LTL Properties of GOLOG Programs Benjamin Zarrieß Theoretical Computer Science TU Dresden, Germany zarriess@tcs.inf.tu-dresden.de Jens Claßen Knowledge-Based Systems Group
More informationOn the Progression of Knowledge in the Situation Calculus
On the Progression of Knowledge in the Situation Calculus Yongmei Liu Department of Computer Science Sun Yat-sen University Guangzhou, China Joint work with Ximing Wen KRW-2012, Guiyang June 17, 2012 Y.
More informationPropositional Logic: Logical Agents (Part I)
Propositional Logic: Logical Agents (Part I) First Lecture Today (Tue 21 Jun) Read Chapters 1 and 2 Second Lecture Today (Tue 21 Jun) Read Chapter 7.1-7.4 Next Lecture (Thu 23 Jun) Read Chapters 7.5 (optional:
More informationLogic Background (1A) Young W. Lim 12/14/15
Young W. Lim 12/14/15 Copyright (c) 2014-2015 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any
More informationIntelligent Agents. Formal Characteristics of Planning. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University
Intelligent Agents Formal Characteristics of Planning Ute Schmid Cognitive Systems, Applied Computer Science, Bamberg University Extensions to the slides for chapter 3 of Dana Nau with contributions by
More informationApplications of the Situation Calculus To Formalizing. Control and Strategic Information: The Prolog Cut Operator. Fangzhen Lin
Applications of the Situation Calculus To Formalizing Control and Strategic Information: The Prolog Cut Operator Fangzhen Lin (in@csusthk) Department of Computer Science The Hong Kong University of Science
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More informationAgenda Artificial Intelligence. Let s Talk About the Wumpus Instead? Let s Talk About Blocks, Baby...
Agenda Artificial Intelligence 12. Predicate Logic Reasoning, Part I: Basics Do You Think About the World in Terms of Propositions? 1 Introduction Álvaro Torralba Wolfgang Wahlster 2 Syntax 3 Semantics
More informationReasoning about State Constraints in the Situation Calculus
Reasoning about State Constraints in the Situation Calculus Joint work with Naiqi Li and Yi Fan Yongmei Liu Dept. of Computer Science Sun Yat-sen University Guangzhou, China Presented at IRIT June 26,
More informationPrinciples of Intelligent Systems: Situation Calculus
Principles of Intelligent Systems: Situation Calculus Lecture 11 These slides are based on Chapters 8 and 10 of Russell and Norvig s Artificial Intelligence: A modern approach (http://aima.eecs.berkeley.edu/slides-pdf/)
More informationReasoning. Inference. Knowledge Representation 4/6/2018. User
Reasoning Robotics First-order logic Chapter 8-Russel Representation and Reasoning In order to determine appropriate actions to take, an intelligent system needs to represent information about the world
More informationLogic & Logic Agents Chapter 7 (& Some background)
Lecture Notes on Logic & Logic Agents University of Birzeit, Palestine 2013 Artificial Intelligence Logic & Logic Agents Chapter 7 (& Some background) Dr. Mustafa Jarrar Sina Institute, University of Birzeit
More informationCOMPUTER SCIENCE TRIPOS
CST.2014.2.1 COMPUTER SCIENCE TRIPOS Part IA Tuesday 3 June 2014 1.30 to 4.30 pm COMPUTER SCIENCE Paper 2 Answer one question from each of Sections A, B and C, and two questions from Section D. Submit
More informationLogic Background (1A) Young W. Lim 5/14/18
Young W. Lim Copyright (c) 2014 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More informationIterated Belief Change in the Situation Calculus
Iterated Belief Change in the Situation Calculus Steven Shapiro a,, Maurice Pagnucco b, Yves Lespérance c, Hector J. Levesque a a Department of Computer Science, University of Toronto, Toronto, ON M5S
More informationLTCS Report. On the Decidability of Verifying LTL Properties of Golog Programs (Extended Version) LTCS-Report 13-10
Technische Universität Dresden Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report On the Decidability of Verifying LTL Properties of Golog Programs (Extended Version) Benjamin
More informationThe Two-Variable Situation Calculus
The Two-Variable Situation Calculus 1. Introduction Yilan GU a, Mikhail SOUTCHANSKI b,1 a Department of Computer Science, University of Toronto, email: yilan@cs.toronto.edu b Department of Computer Science,
More informationInductive situation calculus
Artificial Intelligence 171 (2007) 332 360 www.elsevier.com/locate/artint Inductive situation calculus Marc Denecker a,, Eugenia Ternovska b a Department of Computer Science, KU Leuven, Belgium b School
More informationA Fixed Point Representation of References
A Fixed Point Representation of References Susumu Yamasaki Department of Computer Science, Okayama University, Okayama, Japan yamasaki@momo.cs.okayama-u.ac.jp Abstract. This position paper is concerned
More informationAdding Modal Operators to the Action Language A
Adding Modal Operators to the Action Language A Aaron Hunter Simon Fraser University Burnaby, B.C. Canada V5A 1S6 amhunter@cs.sfu.ca Abstract The action language A is a simple high-level language for describing
More informationAI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic
AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic Propositional logic Logical connectives Rules for wffs Truth tables for the connectives Using Truth Tables to evaluate
More informationPropositional Logic Arguments (5A) Young W. Lim 11/8/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationPrinciples of AI Planning
Principles of 5. Planning as search: progression and regression Malte Helmert and Bernhard Nebel Albert-Ludwigs-Universität Freiburg May 4th, 2010 Planning as (classical) search Introduction Classification
More informationThe Typed Situation Calculus
1 he yped Situation Calculus YILAN GU AND MIKHAIL SOUCHANSKI ABSRAC. We propose a theory for reasoning about actions based on order-sorted predicate logic where one can consider an elaborate taxonomy of
More informationInference in first-order logic. Production systems.
CS 1571 Introduction to AI Lecture 17 Inference in first-order logic. Production systems. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Sentences in Horn normal form Horn normal form (HNF) in
More informationA Logic Primer. Stavros Tripakis University of California, Berkeley
EE 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2015 A Logic Primer Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 144/244,
More information22c:145 Artificial Intelligence
22c:145 Artificial Intelligence Fall 2005 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2001-05 Cesare Tinelli and Hantao Zhang. a a These notes are copyrighted material and may not
More informationSCOPE: A Situation Calculus Ontology of Petri Nets
SCOPE: A Situation Calculus Ontology of Petri Nets Xing TAN 1 Semantic Technologies Laboratory, Department of Mechanical and Industrial Engineering, University of Toronto Abstract. By axiomatizing the
More informationPart of this work we present an extension for Language PP and we show how this
Chapter 5 Planning problems Currently, we can find different definitions for Planning. For instance, McCarthy defines planning in [25] as the restricted problem of finding a finite sequence of actions
More informationFirst Order Logic Semantics (3A) Young W. Lim 9/17/17
First Order Logic (3A) Young W. Lim Copyright (c) 2016-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationLogic. Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001
Logic Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001 Last Lecture Games Cont. α-β pruning Outline Games with chance, e.g. Backgammon Logical Agents and thewumpus World
More informationMonitoring the Generation and Execution of Optimal Plans. Christian Fritz
Monitoring the Generation and Execution of Optimal Plans by Christian Fritz A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Computer
More informationAgenda. Artificial Intelligence. Reasoning in the Wumpus World. The Wumpus World
Agenda Artificial Intelligence 10. Propositional Reasoning, Part I: Principles How to Think About What is True or False 1 Introduction Álvaro Torralba Wolfgang Wahlster 2 Propositional Logic 3 Resolution
More informationIntroduction to Arti Intelligence
Introduction to Arti Intelligence cial Lecture 4: Constraint satisfaction problems 1 / 48 Constraint satisfaction problems: Today Exploiting the representation of a state to accelerate search. Backtracking.
More informationFirst-Order Theorem Proving and Vampire. Laura Kovács (Chalmers University of Technology) Andrei Voronkov (The University of Manchester)
First-Order Theorem Proving and Vampire Laura Kovács (Chalmers University of Technology) Andrei Voronkov (The University of Manchester) Outline Introduction First-Order Logic and TPTP Inference Systems
More informationPREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2
PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2 Neil D. Jones DIKU 2005 14 September, 2005 Some slides today new, some based on logic 2004 (Nils Andersen) OUTLINE,
More informationKecerdasan Buatan M. Ali Fauzi
Kecerdasan Buatan M. Ali Fauzi Artificial Intelligence M. Ali Fauzi Logical Agents M. Ali Fauzi In which we design agents that can form representations of the would, use a process of inference to derive
More informationSymbolic Dynamic Programming for First-order POMDPs
Symbolic Dynamic Programming for First-order POMDPs Scott Sanner NICTA & ANU Canberra, Australia scott.sanner@nicta.com.au Kristian Kersting Fraunhofer IAIS Sankt Augustin, Germany kristian.kersting@iais.fraunhofer.de
More informationCOMP2411 Lecture 10: Propositional Logic Programming. Note: This material is not covered in the book. Resolution Applied to Horn Clauses
COMP2411 Lecture 10: Propositional Logic Programming Note: This material is not covered in the book Consider two Horn clauses Resolution Applied to Horn Clauses p p 1... p n and q q 1... q m Suppose these
More informationLogic for Computer Scientists
Logic for Computer Scientists Pascal Hitzler http://www.pascal-hitzler.de CS 499/699 Lecture, Spring Quarter 2010 Wright State University, Dayton, OH, U.S.A. Final version. Contents 1 Propositional Logic
More informationPrinciples of AI Planning
Principles of AI Planning 5. Planning as search: progression and regression Albert-Ludwigs-Universität Freiburg Bernhard Nebel and Robert Mattmüller October 30th, 2013 Introduction Classification Planning
More informationArtificial Intelligence Chapter 7: Logical Agents
Artificial Intelligence Chapter 7: Logical Agents Michael Scherger Department of Computer Science Kent State University February 20, 2006 AI: Chapter 7: Logical Agents 1 Contents Knowledge Based Agents
More informationCS 4700: Foundations of Artificial Intelligence
CS 4700: Foundations of Artificial Intelligence Bart Selman selman@cs.cornell.edu Module: Knowledge, Reasoning, and Planning Part 2 Logical Agents R&N: Chapter 7 1 Illustrative example: Wumpus World (Somewhat
More informationLogic and Inferences
Artificial Intelligence Logic and Inferences Readings: Chapter 7 of Russell & Norvig. Artificial Intelligence p.1/34 Components of Propositional Logic Logic constants: True (1), and False (0) Propositional
More information