Multiagent planning and epistemic logic
|
|
- Jonathan Morris
- 6 years ago
- Views:
Transcription
1 Multiagent planning and epistemic logic Andreas Herzig IRIT, CNRS, Univ. Toulouse, France Journée plénière, prégdr sur les Aspects Formels et Algorithmiques de l IA July 5, / 25
2 Outline 1 Planning: KR vs. ICAPS 2 What s in a planning problem? 3 States and goals: Epistemic Logic 4 Actions and plans: Dynamic Epistemic Logic 2 / 25
3 KR vs. ICAPS: two diverging communities ICAPS KR 2002 France 2004 Canada 2006 UK 2008 Australia 2010 Canada 2012 Brazil Italy 2014 USA Austria 2016 UK South Africa 2018 NL USA where should I publish my paper on action and planning? case when (complex concepts complex models) then submit(kr); when (implemented fast) then submit(icaps) esac 3 / 25
4 KR vs. ICAPS: reasons for the divergence 1 KR: focus on representation which language? which concepts? (action, initial state, goal,... ) which logical form? (arguments,... ) has truth values? (facts do, actions don t) which models? theoretical properties of reasoning problems? plan existence decidable? complexity of decision problems? logic is like a toothbrush 2 ICAPS: focus on fast reasoning methods standardised representation languages (PDDL, PDDL+++,... ) performance on benchmarks? 4 / 25
5 KR vs. ICAPS: soon back together? since 2013: planning goes multiagent workshop Distributed and Multi-Agent ICAPS [Petrick, Geffner, Domshlak, Brafman, Kambhampati, Nebel,... ] since 2011: Dynamic Epistemic Logic goes planning [Bolander, van der Hoek, Wooldridge, Aucher, Schwarzentruber,... ] Dagstuhl workshops on multiagent epistemic planning (2008, 2014, 2017) many new representation problems in particular: reasoning about other agents mental states fundamental in any kind of interaction people who are unable to attribute mental states to others have a lot of difficulties to interact with them counts as a disorder, cf. autism, schizophrenia,... 5 / 25
6 The need for epistemic reasoning in planning 1 single-agent planning uncertainty about initial situation uncertainty about action effects sensing actions (alias knowledge producing actions) contingent/conformant planning 2 multiagent planning initial situation: first-order: I don t know whether p. second-order: I don t know whether you know that p. second-order: I know that you don t know whether p.... goal: first-order: I want to know whether p. second-order: I want to know whether you know that p. second-order: I want you to believe that q.... actions with epistemic effects sensing actions communication actions how to model the agents perception of actions and events? 6 / 25
7 KR vs. ICAPS What s in a planning problem? States and goals: EL Actions and plans: DEL Challenge: robots with theory of mind [Milliez et al. 2014] at step 3, agent Green s beliefs become false colored arrows = beliefs about white book position (red = robot) colored spheres = reachability of an object for an agent / 25
8 representation problems: Problems, problems simple integrations of epistemic and spatial reasoning? model expiry date for knowledge/belief? light in room x is on at T j is in room x (so j believes that the light is on at T) j leaves the room at T+1 at T > T, does j still believe that the light in x is on? higher-order belief revision? to be solved in any application! reasoning problems: epistemic reasoning is difficult at least PSPACE EXPTIME complete if common knowledge/belief involved what are good benchmarks? what is epistemic planning s blocksworld? centralised or decentralised planning? 8 / 25
9 Outline 1 Planning: KR vs. ICAPS 2 What s in a planning problem? 3 States and goals: Epistemic Logic 4 Actions and plans: Dynamic Epistemic Logic 9 / 25
10 What s in a planning problem? planning problem = init, goal, actionlaws 1 logical form of init: proposition proposition = set of possible worlds (states) can be described in various logical languages: propositional logic epistemic logic... classical planning: initial state = complete proposition = a single possible world = a valuation of propositional logic 2 logical form of goal: proposition 3 logical form of actionlaws: action type action type: arm-raising action token: Bruno s raising of his right arm in room 7 of building 007 of Caen IUT on July 5, 2017 at 10:55:55 10 / 25
11 What s in an action? event brought about by an agent [Davidson] proposition that can be phrased agent i sees to it that proposition ϕ is true [Belnap s stit thesis] something that has precondition and effects [AI folklore] precond = proposition effect =? action = precond, effect 11 / 25
12 What s in an action effect? STRIPS actions: effect = conjunction of literals however: an action type is instantiated in different circumstances effects typically depend on these circumstances conditional effects: effect = { condition 1, L 1,1 L 1,m1,..., condition n, L n,1 L n,m1 } example: agent i s action of flipping a switch precond(flip i ) = AtSwitch i effect(flip i ) = { On, On, On, On } 12 / 25
13 Outline 1 Planning: KR vs. ICAPS 2 What s in a planning problem? 3 States and goals: Epistemic Logic 4 Actions and plans: Dynamic Epistemic Logic 13 / 25
14 Epistemic logic: language knowledge explained in terms of possible worlds [Hintikka]: K i ϕ = agent i knows that ϕ = ϕ true in every world that is possible for i BNF: ϕ ::= p ϕ ϕ ϕ K i ϕ where p ranges over Prp and i over Agt 3 possible epistemic attitudes w.r.t. a formula ϕ: K i ϕ K i ϕ K i ϕ K i ϕ 14 / 25
15 Epistemic logic: possible worlds semantics model M = (W, {R i } i Agt, V) with W non-empty set of possible worlds R i W W accessibility relations V : W 2 Prp valuation R i is an equivalence relation (indistinguishability) R i (w) = set of worlds i cannot distinguish from w = set of worlds compatible with i s knowledge truth conditions: M, w p iff... M, w ϕ iff... M, w ϕ ψ iff... M, w K i ϕ iff M, w ϕ for all w R i (w) 15 / 25
16 Epistemic logic: possible worlds semantics muddy children puzzle, initial situation R R R2 12 R 1 (reflexive arrows omitted) M, 12 m 1 m 2 K 1 m 2 K 1 m 1 K 1 m 1 16 / 25
17 Epistemic logic for epistemic planning? can be modeled: init = formula of epistemic logic goal = formula of epistemic logic cannot be expressed: actionlaws 17 / 25
18 Outline 1 Planning: KR vs. ICAPS 2 What s in a planning problem? 3 States and goals: Epistemic Logic 4 Actions and plans: Dynamic Epistemic Logic 18 / 25
19 Muddy children: Episode 1 1 initially, common knowledge that nobody is muddy 2 1 gets muddy but isn t sure; 2 watches 3 2 gets muddy but isn t sure; 1 watches R 2 12 R 1 R 1 R gets muddy = gets muddy = 1 2 R / 25
20 Dynamic epistemic logic DEL idea: model uncertainty about current event by introducing possible events uncertainty about world possible worlds indistinguishability of worlds uncertainty about event possible events indistinguishability of events possible event models distinguish agents who observe from agents who don t N.B.: an agent typically observes only very few events muddy children: event model where 1 plays, 2 watches skip 1 R 1 getsmuddy 1 (reflexive arrows omitted) 20 / 25
21 DEL: event models EM = (E, {S i } i Agt, precond, effect) event model, where E is a nonempty set of events S i E E every S i is an equivalence relation es i f = i perceives occurrence of e as occurrence of f precond : E Fmls effect : E Fmls s.t. effect(e) conjunction of literals (just as in STRIPS) 21 / 25
22 DEL: product construction update world model WM = (W, R, V) by event model EM where WM EM = WM W = {(w, e) W E : M, w precond(e)} (w, e)r i (v, f) iff wr iv and es i f V ((w, e)) = (V(w) \ {p : p negative in effect(e)}) {p : p positive in effect(e)} 22 / 25
23 DEL for epistemic planning? explored since >5 years [Bolander & Anderson 2011]; [Löwe, Pacuit & Witzel 2011]; [Aucher, Maubert & Pinchinat 2014]; [Yu, Li & Wang 2015],... init = formula of multiagent epistemic logic goal = formula of multiagent epistemic logic action type = agent + event model reasoning: not so easy plan existence undecidable in general [Bolander & Anderson 2011]; [Aucher & Bolander 2013]; [Charrier, Maubert & Schwarzentruber 2016] decidable fragments: heavily restricted [Yu, Wen & Liu 2013]; [Bolander et al. 2015],... representation: some problems that seemingly went unnoticed / 25
24 DEL for epistemic planning: problems event models rather describe action tokens actionlaws describe types, not tokens how to describe conditional effects? list all possible cases of perception of the actual event infinitely many conditional effects needed conditional effects of getmuddy(i): (ingarden i, m i ) (ingarden j, K j m i ) (K i ingarden j, K i (K j m i K j m i )) (K j K i ingarden j,... ). (CK i,j ingarden j, CK i,j (K j m i K j m i )) event models with an infinite number of points! even when finite, event models have to be big world models typically grow exponentially when updated 24 / 25
25 Conclusion knowledge representation with DEL event models: art rather than craft practical problems conceptual problems (type vs. token) the other agents observation should be based on information from the possible worlds model, not from the event model edge-conditioned event models [Bolander, 2015] special propositional variable agent i is watching [Bolander et al., JoLLI 2016] part of the state, not part of the action! special propositional variable agent j is watching agent i [Bolander et al., ongoing] j changes her beliefs when j watches i s action j does not change her beliefs when j does not watch i s action 25 / 25
Undecidability in Epistemic Planning
Undecidability in Epistemic Planning Thomas Bolander, DTU Compute, Tech Univ of Denmark Joint work with: Guillaume Aucher, Univ Rennes 1 Bolander: Undecidability in Epistemic Planning p. 1/17 Introduction
More informationTowards Symbolic Factual Change in Dynamic Epistemic Logic
Towards Symbolic Factual Change in Dynamic Epistemic Logic Malvin Gattinger ILLC, Amsterdam July 18th 2017 ESSLLI Student Session Toulouse Are there more red or more blue points? Are there more red or
More informationDynamic Logic of Propositional Assignments and its applications to update, revision and planning
Dynamic Logic of Propositional Assignments and its applications to update, revision and planning Andreas Herzig University of Toulouse, IRIT-CNRS, France Workshop on Planning, Logic and Social Intelligence,
More informationEFP and PG-EFP: Epistemic Forward Search Planners in Multi-Agent Domains
EFP and PG-EFP: Epistemic Forward Search Planners in Multi-Agent Domains Tiep Le Computer Science New Mexico State University Las Cruces, NM 88003, USA tile@cs.nmsu.edu Francesco Fabiano Computer Science
More informationBeliefs in Multiagent Planning: From One Agent to Many
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling Beliefs in Multiagent Planning: From One Agent to Many Filippos Kominis Universitat Pompeu Fabra 08018 Barcelona,
More informationDEL-sequents for Regression and Epistemic Planning
DEL-sequents for Regression and Epistemic Planning Guillaume Aucher To cite this version: Guillaume Aucher. DEL-sequents for Regression and Epistemic Planning. Journal of Applied Non-Classical Logics,
More informationLogics for MAS: a critical overview
Logics for MAS: a critical overview Andreas Herzig CNRS, University of Toulouse, IRIT, France IJCAI 2013, August 9, 2013 1 / 37 Introduction 2 / 37 Introduction Multi-Agent Systems (MAS): agents with imperfect
More informationLogics for multi-agent systems: an overview
Logics for multi-agent systems: an overview Andreas Herzig University of Toulouse and CNRS, IRIT, France EASSS 2014, Chania, 17th July 2014 1 / 40 Introduction course based on an overview paper to appear
More informationA Logic for Reasoning about Counterfactual Emotions
A Logic for Reasoning about Counterfactual Emotions Emiliano Lorini IRIT, Toulouse, France lorini@irit.fr François Schwarzentruber IRIT, Toulouse, France schwarze@irit.fr Abstract The aim of this work
More informationModal Logics. Most applications of modal logic require a refined version of basic modal logic.
Modal Logics Most applications of modal logic require a refined version of basic modal logic. Definition. A set L of formulas of basic modal logic is called a (normal) modal logic if the following closure
More informationHow to share knowledge by gossiping
How to share knowledge by gossiping Andreas Herzig and Faustine Maffre University of Toulouse, IRIT http://www.irit.fr/lilac Abstract. Given n agents each of which has a secret (a fact not known to anybody
More information09 Modal Logic II. CS 3234: Logic and Formal Systems. October 14, Martin Henz and Aquinas Hobor
Martin Henz and Aquinas Hobor October 14, 2010 Generated on Thursday 14 th October, 2010, 11:40 1 Review of Modal Logic 2 3 4 Motivation Syntax and Semantics Valid Formulas wrt Modalities Correspondence
More informationLogics of Rational Agency Lecture 3
Logics of Rational Agency Lecture 3 Eric Pacuit Tilburg Institute for Logic and Philosophy of Science Tilburg Univeristy ai.stanford.edu/~epacuit July 29, 2009 Eric Pacuit: LORI, Lecture 3 1 Plan for the
More informationTry to find a good excuse!
Try to find a good excuse! BRA-2015 (Workshop on Belief Revision and Argumentation) Bernhard Nebel & Moritz Göbelbecker Department of Computer Science Foundations of Artificial Intelligence Finding excuses
More informationChanging Types. Dominik Klein Eric Pacuit. April 24, 2011
Changing Types Dominik Klein Eric Pacuit April 24, 2011 The central thesis of the epistemic program in game theory (Brandenburger, 2007) is that the basic mathematical models of a game situation should
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 informationReasoning Under Uncertainty: Introduction to Probability
Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1 Textbook 6.1 Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1, Slide 1 Lecture Overview 1
More informationLearning to Act: Qualitative Learning of Deterministic Action Models
Learning to Act: Qualitative Learning of Deterministic Action Models Thomas Bolander Nina Gierasimczuk October 8, 2017 Abstract In this paper we study learnability of fully observable, universally applicable
More informationBig Brother Logic: Logical modeling and reasoning about agents equipped with surveillance cameras in the plane
Big Brother Logic: Logical modeling and reasoning about agents equipped with surveillance cameras in the plane Olivier Gasquet, Valentin Goranko, Francois Schwarzentruber June 10, 2014 Abstract We consider
More informationLogic and Artificial Intelligence Lecture 22
Logic and Artificial Intelligence Lecture 22 Eric Pacuit Currently Visiting the Center for Formal Epistemology, CMU Center for Logic and Philosophy of Science Tilburg University ai.stanford.edu/ epacuit
More informationA Strategic Epistemic Logic for Bounded Memory Agents
CNRS, Université de Lorraine, Nancy, France Workshop on Resource Bounded Agents Barcelona 12 August, 2015 Contents 1 Introduction 2 3 4 5 Combining Strategic and Epistemic Reasoning The goal is to develop
More informationControlling probabilistic systems under partial observation an automata and verification perspective
Controlling probabilistic systems under partial observation an automata and verification perspective Nathalie Bertrand, Inria Rennes, France Uncertainty in Computation Workshop October 4th 2016, Simons
More informationDon t Plan for the Unexpected: Planning Based on Plausibility Models
Don t Plan for the Unexpected: Planning Based on Plausibility Models Thomas Bolander, DTU Informatics, Technical University of Denmark Joint work with Mikkel Birkegaard Andersen and Martin Holm Jensen
More informationThe Ceteris Paribus Structure of Logics of Game Forms (Extended Abstract)
The Ceteris Paribus Structure of Logics of Game Forms (Extended Abstract) Davide Grossi University of Liverpool D.Grossi@liverpool.ac.uk Emiliano Lorini IRIT-CNRS, Toulouse University François Schwarzentruber
More informationPrinciples of Knowledge Representation and Reasoning
Principles of Knowledge Representation and Reasoning Modal Logics Bernhard Nebel, Malte Helmert and Stefan Wölfl Albert-Ludwigs-Universität Freiburg May 2 & 6, 2008 Nebel, Helmert, Wölfl (Uni Freiburg)
More informationThe Muddy Children:A logic for public announcement
The Muddy Children: Jesse Technical University of Eindhoven February 10, 2007 The Muddy Children: Outline 1 2 3 4 The Muddy Children: Quincy Prescott Baba: At least one of you is muddy. Quincy: I don t
More informationA Logic for Reasoning about Moral Agents
A Logic for Reasoning about Moral Agents Emiliano Lorini Université de Toulouse, IRIT-CNRS, France July 12, 2013 1/ 71 Logical theories of cognitive agents BDI logics (Cohen & Levesque, 1990, Rao & Georgeff,
More informationCardinal and Ordinal Preferences. Introduction to Logic in Computer Science: Autumn Dinner Plans. Preference Modelling
Cardinal and Ordinal Preferences Introduction to Logic in Computer Science: Autumn 2007 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam A preference structure represents
More informationuse these reduction axioms to reduce both the model checking problem and the satisfiability problem of DEL to the model checking problem and the satis
On the Complexity of Dynamic Epistemic Logic Guillaume Aucher University of Rennes - INRIA guillaume.aucher@irisa.fr François Schwarzentruber ENS Cachan - Brittany extension francois.schwarzentruber@bretagne.enscachan.fr
More informationBetter Eager Than Lazy? How Agent Types Impact the Successfulness of Implicit Coordination
Better Eager Than Lazy? How Agent Types Impact the Successfulness of Implicit Coordination Thomas Bolander DTU Compute Technical University of Denmark tobo@dtu.dk Thorsten Engesser and Robert Mattmüller
More informationWeek 3: Reductions and Completeness
Computational Complexity Theory Summer HSSP 2018 Week 3: Reductions and Completeness Dylan Hendrickson MIT Educational Studies Program 3.1 Reductions Suppose I know how to solve some problem quickly. How
More informationLogic and Social Choice Theory. A Survey. ILLC, University of Amsterdam. November 16, staff.science.uva.
Logic and Social Choice Theory A Survey Eric Pacuit ILLC, University of Amsterdam staff.science.uva.nl/ epacuit epacuit@science.uva.nl November 16, 2007 Setting the Stage: Logic and Games Game Logics Logics
More informationAgreement Theorems from the Perspective of Dynamic-Epistemic Logic
Agreement Theorems from the Perspective of Dynamic-Epistemic Logic Olivier Roy & Cedric Dégremont November 10, 2008 Olivier Roy & Cedric Dégremont: Agreement Theorems & Dynamic-Epistemic Logic, 1 Introduction
More informationMerging Frameworks for Interaction
Merging Frameworks for Interaction Johan van Benthem Tomohiro Hoshi Jelle Gerbrandy Eric Pacuit March 26, 2008 1 Introduction Many logical systems today describe intelligent interacting agents over time.
More informationA Modal Logic of Epistemic Games
Submitted to Games. Pages 1-49. OPEN ACCESS games ISSN 2073-4336 www.mdpi.com/journal/games Article A Modal Logic of Epistemic Games Emiliano Lorini 1, François Schwarzentruber 1 1 Institut de Recherche
More informationDecision Procedures for Satisfiability and Validity in Propositional Logic
Decision Procedures for Satisfiability and Validity in Propositional Logic Meghdad Ghari Institute for Research in Fundamental Sciences (IPM) School of Mathematics-Isfahan Branch Logic Group http://math.ipm.ac.ir/isfahan/logic-group.htm
More informationAction representation and partially observable planning using epistemic logic
Action representation and partially observable planning using epistemic logic Andreas Herzig IRIT/UPS F-31062 Toulouse Cedex France herzig@irit.fr Jerome Lang IRIT/UPS F-31062 Toulouse Cedex France lang@irit.fr
More informationLogic: Propositional Logic Truth Tables
Logic: Propositional Logic Truth Tables Raffaella Bernardi bernardi@inf.unibz.it P.zza Domenicani 3, Room 2.28 Faculty of Computer Science, Free University of Bolzano-Bozen http://www.inf.unibz.it/~bernardi/courses/logic06
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 informationConcurrent Game Structures for Temporal STIT Logic
Concurrent Game Structures for Temporal STIT Logic ABSTRACT Joseph Boudou IRIT Toulouse University Toulouse, France The paper introduces a new semantics for temporal STIT logic the logic of seeing to it
More informationReasoning Under Uncertainty: Introduction to Probability
Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Lecture 23 March 12, 2007 Textbook 9 Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Lecture 23, Slide 1 Lecture Overview
More informationOn the Use of an ATMS for Handling Conflicting Desires
On the Use of an ATMS for Handling Conflicting Desires Leila Amgoud and Claudette Cayrol Institut de Recherche en Informatique de Toulouse 118, route de Narbonne 31062 Toulouse, France {amgoud, ccayrol}@irit.fr
More informationLogic and Discrete Mathematics. Section 3.5 Propositional logical equivalence Negation of propositional formulae
Logic and Discrete Mathematics Section 3.5 Propositional logical equivalence Negation of propositional formulae Slides version: January 2015 Logical equivalence of propositional formulae Propositional
More informationGame Description Language and Dynamic Epistemic Logic Compared
Game Description Language and Dynamic Epistemic Logic Compared Thorsten Engesser 1, Robert Mattmüller 1, Bernhard Nebel 1, Michael Thielscher 1 Faculty of Engineering, University of Freiburg, Germany School
More informationBisimulation for conditional modalities
Bisimulation for conditional modalities Alexandru Baltag and Giovanni Ciná Institute for Logic, Language and Computation, University of Amsterdam March 21, 2016 Abstract We give a general definition of
More informationBelief Revision in Social Networks
Tsinghua University and University of Amsterdam 8-10 July 2015, IRIT, Université Paul Sabatier, Toulouse Outline 1 2 Doxastic influence Finite state automaton Stability and flux Dynamics in the community
More informationWidth and Complexity of Belief Tracking in Non-Deterministic Conformant and Contingent Planning
Width and Complexity of Belief Tracking in Non-Deterministic Conformant and Contingent Planning Blai Bonet Universidad Simón Bolívar Caracas, Venezuela bonet@ldc.usb.ve Hector Geffner ICREA & Universitat
More informationCS 331: Artificial Intelligence Propositional Logic I. Knowledge-based Agents
CS 331: Artificial Intelligence Propositional Logic I 1 Knowledge-based Agents Can represent knowledge And reason with this knowledge How is this different from the knowledge used by problem-specific agents?
More informationKnowledge-based Agents. CS 331: Artificial Intelligence Propositional Logic I. Knowledge-based Agents. Outline. Knowledge-based Agents
Knowledge-based Agents CS 331: Artificial Intelligence Propositional Logic I Can represent knowledge And reason with this knowledge How is this different from the knowledge used by problem-specific agents?
More informationSome Remarks on Alternating Temporal Epistemic Logic
Some Remarks on Alternating Temporal Epistemic Logic Corrected version: July 2003 Wojciech Jamroga Parlevink Group, University of Twente, Netherlands Institute of Mathematics, University of Gdansk, Poland
More informationThe computational complexity of dominance and consistency in CP-nets
The computational complexity of dominance and consistency in CP-nets Judy Goldsmith Dept. of Comp. Sci. University of Kentucky Lexington, KY 40506-0046, USA goldsmit@cs.uky.edu Abstract Jérôme Lang IRIT
More informationArbitrary Announcements in Propositional Belief Revision
Arbitrary Announcements in Propositional Belief Revision Aaron Hunter British Columbia Institute of Technology Burnaby, Canada aaron hunter@bcitca Francois Schwarzentruber ENS Rennes Bruz, France francoisschwarzentruber@ens-rennesfr
More informationSimulation and information: quantifying over epistemic events
Simulation and information: quantifying over epistemic events Hans van Ditmarsch 12 and Tim French 3 1 Computer Science, University of Otago, New Zealand, hans@cs.otago.ac.nz 2 CNRS-IRIT, Université de
More informationProduct Update and Looking Backward
Product Update and Looking Backward Audrey Yap May 21, 2006 Abstract The motivation behind this paper is to look at temporal information in models of BMS product update. That is, it may be useful to look
More informationCapturing Lewis s Elusive Knowledge
Zhaoqing Xu Department of Philosophy, Peking University zhaoqingxu@gmail.com September 22, 2011 1 Introduction 2 Philosophical Background Dretske s Relevant Alternatives Theory Lewis s Elusive Knowledge
More informationModal logics: an introduction
Modal logics: an introduction Valentin Goranko DTU Informatics October 2010 Outline Non-classical logics in AI. Variety of modal logics. Brief historical remarks. Basic generic modal logic: syntax and
More informationKnowable as known after an announcement
RESEARCH REPORT IRIT/RR 2008-2 FR Knowable as known after an announcement Philippe Balbiani 1 Alexandru Baltag 2 Hans van Ditmarsch 1,3 Andreas Herzig 1 Tomohiro Hoshi 4 Tiago de Lima 5 1 Équipe LILAC
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Bernhard Nebel Albert-Ludwigs-Universität Freiburg May 17, 2016
More informationAhmad KARIMI A NON-SELF-REFERENTIAL PARADOX IN EPISTEMIC GAME THEORY
REPORTS ON MATHEMATICAL LOGIC 52 (2017), 45 56 doi:10.4467/20842589rm.17.002.7140 Ahmad KARIMI A NON-SELF-REFERENTIAL PARADOX IN EPISTEMIC GAME THEORY A b s t r a c t. The beliefs of other people about
More informationA Preference Logic With Four Kinds of Preferences
A Preference Logic With Four Kinds of Preferences Zhang Zhizheng and Xing Hancheng School of Computer Science and Engineering, Southeast University No.2 Sipailou, Nanjing, China {seu_zzz; xhc}@seu.edu.cn
More informationCL16, 12th September 2016
CL16, 12th September 2016 for - Soft Outline for - Soft for - Soft The Problem of Anyone who utters: (S) Sherlock Holmes lives in Baker Street would not be objected against by non-philosophers. However:
More informationKnowledge, Strategies, and Know-How
KR 2018, Tempe, AZ, USA Knowledge, Strategies, and Know-How Jia Tao Lafayette College Pavel Naumov Claremont McKenna College http://reasoning.eas.asu.edu/kr2018/ "!! Knowledge, Strategies, Know-How!!?!!
More informationEpistemic Modals and Informational Consequence
Epistemic Modals and Informational Consequence [This is a penultimate draft. Please quote only from the published version. The paper is already available through Online First at http://www.springerlink.com/content/0039-7857]
More informationLogical Agent & Propositional Logic
Logical Agent & Propositional Logic Berlin Chen 2005 References: 1. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Chapter 7 2. S. Russell s teaching materials Introduction The representation
More informationCooperative Epistemic Multi-Agent Planning With Implicit Coordination
Downloaded from orbit.dtu.dk on: Jan 12, 2019 Cooperative Epistemic Multi-Agent Planning With Implicit Coordination Engesser, Thorsten ; Bolander, Thomas; Mattmüller, Robert ; Nebel, Bernhard Published
More informationIntroduction to Temporal Logic. The purpose of temporal logics is to specify properties of dynamic systems. These can be either
Introduction to Temporal Logic The purpose of temporal logics is to specify properties of dynamic systems. These can be either Desired properites. Often liveness properties like In every infinite run action
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 informationReasoning with Probabilities. Eric Pacuit Joshua Sack. Outline. Basic probability logic. Probabilistic Epistemic Logic.
Reasoning with July 28, 2009 Plan for the Course Day 1: Introduction and Background Day 2: s Day 3: Dynamic s Day 4: Reasoning with Day 5: Conclusions and General Issues Probability language Let Φ be a
More informationAutomated Solution of the Riddle of Dracula and Other Puzzles
Automated Solution of the Riddle of Dracula and Other Puzzles László Aszalós IRIT, Universite Paul Sabatier, 118 route de Narbonne F-31062 Toulouse Cedex 4, France, aszalos@irit.fr Abstract. The Door of
More informationTowards Tractable Inference for Resource-Bounded Agents
Towards Tractable Inference for Resource-Bounded Agents Toryn Q. Klassen Sheila A. McIlraith Hector J. Levesque Department of Computer Science University of Toronto Toronto, Ontario, Canada {toryn,sheila,hector}@cs.toronto.edu
More informationKnowledge Based Obligations RUC-ILLC Workshop on Deontic Logic
Knowledge Based Obligations RUC-ILLC Workshop on Deontic Logic Eric Pacuit Stanford University November 9, 2007 Eric Pacuit: Knowledge Based Obligations, RUC-ILLC Workshop on Deontic Logic 1 The Kitty
More informationA tableau-based decision procedure for a branching-time interval temporal logic
A tableau-based decision procedure for a branching-time interval temporal logic Davide Bresolin Angelo Montanari Dipartimento di Matematica e Informatica Università degli Studi di Udine {bresolin, montana}@dimi.uniud.it
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 informationIntroduction to Epistemic Reasoning in Interaction
Introduction to Epistemic Reasoning in Interaction Eric Pacuit Center for Logic and Philosophy of Science Tilburg University ai.stanford.edu/~epacuit December 9, 2009 Eric Pacuit 1 We are interested in
More informationFormalizing knowledge-how
Formalizing knowledge-how Tszyuen Lau & Yanjing Wang Department of Philosophy, Peking University Beijing Normal University November 29, 2014 1 Beyond knowing that 2 Knowledge-how vs. Knowledge-that 3 Our
More informationWhat is DEL good for? Alexandru Baltag. Oxford University
Copenhagen 2010 ESSLLI 1 What is DEL good for? Alexandru Baltag Oxford University Copenhagen 2010 ESSLLI 2 DEL is a Method, Not a Logic! I take Dynamic Epistemic Logic () to refer to a general type of
More informationSchematic Validity in Dynamic Epistemic Logic: Decidability
This paper has been superseded by W. H. Holliday, T. Hoshi, and T. F. Icard, III, Information dynamics and uniform substitution, Synthese, Vol. 190, 2013, 31-55. Schematic Validity in Dynamic Epistemic
More informationModels for Efficient Timed Verification
Models for Efficient Timed Verification François Laroussinie LSV / ENS de Cachan CNRS UMR 8643 Monterey Workshop - Composition of embedded systems Model checking System Properties Formalizing step? ϕ Model
More informationAction Models in Inquisitive Logic
Action Models in Inquisitive Logic MSc Thesis (Afstudeerscriptie) written by Thom van Gessel (born October 10th, 1987 in Apeldoorn, The Netherlands) under the supervision of Dr. Floris Roelofsen and Dr.
More informationOne hundred prisoners and a lightbulb logic and computation
One hundred prisoners and a lightbulb logic and computation Hans van Ditmarsch D. Logic, F. Philosophy University of Sevilla, Spain Email: hvd@us.es Jan van Eijck CWI, Amsterdam & OTS University of Utrecht,
More informationLogic and Artificial Intelligence Lecture 12
Logic and Artificial Intelligence Lecture 12 Eric Pacuit Currently Visiting the Center for Formal Epistemology, CMU Center for Logic and Philosophy of Science Tilburg University ai.stanford.edu/ epacuit
More informationVerifying One Hundred Prisoners and a Lightbulb
Verifying One Hundred Prisoners and a Lightbulb Hans van Ditmarsch *, Jan van Eijck ** and William Wu *** * D. Logic, University of Sevilla, Spain Email: hvd@us.es ** CWI, Amsterdam & OTS, University of
More informationPlanning with epistemic goals
Planning with epistemic goals Yanjing Wang Department of Philosophy, Peking University ISLAMAS, Feb. 3rd 2015 1 / 46 1 Why does knowledge matter? 2 A mixed-blood single-agent framework 3 Multi-agent cases
More informationTo every formula scheme there corresponds a property of R. This relationship helps one to understand the logic being studied.
Modal Logic (2) There appeared to be a correspondence between the validity of Φ Φ and the property that the accessibility relation R is reflexive. The connection between them is that both relied on the
More informationPropositions. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 1
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
More informationSubgoal Semantics in Agent Programming
Subgoal Semantics in Agent Programming M. Birna van Riemsdijk Mehdi Dastani John-Jules Ch. Meyer ICS, Utrecht University, The Netherlands {birna, mehdi, jj}@cs.uu.nl Abstract. This paper investigates the
More informationDescription Logics. Foundations of Propositional Logic. franconi. Enrico Franconi
(1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge
More informationReversed Squares of Opposition in PAL and DEL
Center for Logic and Analytical Philosophy, University of Leuven lorenz.demey@hiw.kuleuven.be SQUARE 2010, Corsica Goal of the talk public announcement logic (PAL), and dynamic epistemic logic (DEL) in
More informationList of errors in and suggested modifications for First-Order Modal Logic Melvin Fitting and Richard L. Mendelsohn August 11, 2013
List of errors in and suggested modifications for First-Order Modal Logic Melvin Fitting and Richard L. Mendelsohn August 11, 2013 James W. Garson has answered a question we raised, in a paper that is
More informationAn Inquisitive Formalization of Interrogative Inquiry
An Inquisitive Formalization of Interrogative Inquiry Yacin Hamami 1 Introduction and motivation The notion of interrogative inquiry refers to the process of knowledge-seeking by questioning [5, 6]. As
More informationCHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS
CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS 1 Language There are several propositional languages that are routinely called classical propositional logic languages. It is due to the functional dependency
More informationConflict-Based Belief Revision Operators in Possibilistic Logic
Conflict-Based Belief Revision Operators in Possibilistic Logic Author Qi, Guilin, Wang, Kewen Published 2012 Conference Title Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence
More informationSTIT is dangerously undecidable
STIT is dangerously undecidable François Schwarzentruber and Caroline Semmling June 2, 2014 Abstract STIT is a potential logical framework to capture responsibility, counterfactual emotions and norms,
More informationMeasures for persuasion dialogs: A preliminary investigation
Measures for persuasion dialogs: A preliminary investigation Leila AMGOUD a,1, Florence DUPIN DE SAINT CYR a a Institut de Recherche en Informatique de Toulouse (IRIT), France Abstract. Persuasion is one
More informationFormal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University
Formal Epistemology: Lecture Notes Horacio Arló-Costa Carnegie Mellon University hcosta@andrew.cmu.edu Bayesian Epistemology Radical probabilism doesn t insists that probabilities be based on certainties;
More informationCompleteness of Online Planners for Partially Observable Deterministic Tasks
Completeness of Online Planners for Partially Observable Deterministic Tasks Blai Bonet Gabriel Formica Melecio Ponte Universidad Simón Boĺıvar, Venezuela ICAPS. Pittsburgh, USA. June 2017. 2 of 18 Motivation
More informationChapter 7 Propositional Satisfiability Techniques
Lecture slides for Automated Planning: Theory and Practice Chapter 7 Propositional Satisfiability Techniques Dana S. Nau CMSC 722, AI Planning University of Maryland, Spring 2008 1 Motivation Propositional
More informationPartial Implication Semantics for Desirable Propositions
Partial Implication Semantics for Desirable Propositions Yi Zhou XiaoPing Chen Department of Computer Science University of Science and Technology of China HeFei, 230026 China zyz@mail.ustc.edu.cn Department
More informationFirst-Degree Entailment
March 5, 2013 Relevance Logics Relevance logics are non-classical logics that try to avoid the paradoxes of material and strict implication: p (q p) p (p q) (p q) (q r) (p p) q p (q q) p (q q) Counterintuitive?
More informationKnowledge about lights along a line
1 Knowledge about lights along a line François SCHWARZENTRUBER Abstract In this article, we are going to talk about spatial situations. Every agent (human, camera etc.) and every proposition (lamp, object,
More information