Synthesizing and Executing Plans in Knowledge and Action Bases

We study plan synthesis for a variant of Knowledge and Action Bases (KABs). KABs have been recently introduced as a rich, dynamic framework where states are full-fledged description logic (DL) knowledge bases (KBs) whose extensional part is manipulated by actions that can introduce new objects from an infinite domain. We show that, in general, plan existence over KABs is undecidable even under severe restrictions. We then focus on the class of statebounded KABs, for which plan existence is decidable, and we provide sound and complete plan synthesis algorithms, through a novel combination of techniques based on standard planning, DL query answering, and finite-state abstractions. All results hold for any DL with decidable query answering. We finally show that for lightweight DLs, plan synthesis can be compiled into standard ADL planning.

[1]  Hector J. Levesque,et al.  Foundations of a Functional Approach to Knowledge Representation , 1984, Artif. Intell..

[2]  Diego Calvanese,et al.  Verification of relational data-centric dynamic systems with external services , 2012, PODS.

[3]  Piergiorgio Bertoli,et al.  Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection , 2009, J. Artif. Intell. Res..

[4]  Marco Pistore,et al.  Handbook of Knowledge Representation Edited Automated Planning , 2022 .

[5]  Michael Thielscher,et al.  A Fluent Calculus Semantics for ADL with Plan Constraints , 2008, JELIA.

[6]  Diego Calvanese,et al.  Description Logic Knowledge and Action Bases , 2014, J. Artif. Intell. Res..

[7]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[8]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[9]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[10]  Stefan Edelkamp,et al.  Automated Planning: Theory and Practice , 2007, Künstliche Intell..

[11]  Diego Calvanese,et al.  Data Complexity of Query Answering in Description Logics , 2006, Description Logics.

[12]  John F. Sowa,et al.  Knowledge Representation and Reasoning , 2000 .

[13]  Ian Horrocks,et al.  Conjunctive Query Answering for the Description Logic SHIQ , 2007, IJCAI.

[14]  Edwin P. D. Pednault,et al.  ADL and the State-Transition Model of Action , 1994, J. Log. Comput..

[15]  Diego Calvanese,et al.  Data Complexity of Query Answering in Expressive Description Logics via Tableaux , 2008, Journal of Automated Reasoning.

[16]  Diego Calvanese,et al.  EQL-Lite: Effective First-Order Query Processing in Description Logics , 2007, IJCAI.

[17]  Gerhard Lakemeyer,et al.  The logic of knowledge bases , 2000 .

[18]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[19]  Alessio Lomuscio,et al.  Verification of Agent-Based Artifact Systems , 2013, J. Artif. Intell. Res..

[20]  D. Gabbay,et al.  Many-Dimensional Modal Logics: Theory and Applications , 2003 .

[21]  Diego Calvanese,et al.  Ontologies and Databases: The DL-Lite Approach , 2009, Reasoning Web.

[22]  V. S. Subrahmanian,et al.  Complexity, Decidability and Undecidability Results for Domain-Independent Planning , 1995, Artif. Intell..

[23]  Diego Calvanese,et al.  Verification and Synthesis in Description Logic Based Dynamic Systems (Abridged Version) , 2013, AIBP@AI*IA.