Correct Reasoning

In this paper we propose an extension of Answer Set Programming (ASP) by non-Herbrand functions, i.e. functions over non-Herbrand domains. Introducing support for such functions allows for an economic and natural representation of certain kinds of knowledge that are comparatively cumbersome to represent in ASP. The key difference between our approach and other techniques for the support of non-Herbrand functions is that our extension is more “conservative” from a knowledge representation perspective. In fact, we purposefully designed the new language so that (1) the representation of relations is fully retained; (2) the representation of knowledge using non-Herbrand functions follows in a natural way from the typical ASP strategies; (3) the semantics is an extension of the the semantics of ASP from [9], allowing for a comparatively simple incorporation of various extensions of ASP such as weak constraints, probabilistic constructs and consistency-restoring rules.

[1]  Riccardo Rosati,et al.  DL+log: Tight Integration of Description Logics and Disjunctive Datalog , 2006, KR.

[2]  Michael Thielscher,et al.  Introduction to the Fluent Calculus , 1998, Electron. Trans. Artif. Intell..

[3]  Gerhard Lakemeyer,et al.  Cognitive Robotics , 2008, Handbook of Knowledge Representation.

[4]  José Júlio Alferes,et al.  Declarative Semantics for the Rule Interchange Format Production Rule Dialect , 2010, SEMWEB.

[5]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[6]  Hudson Turner,et al.  Causal Theories of Action and Change , 1997, AAAI/IAAI.

[7]  Enrico Giunchiglia,et al.  Nonmonotonic causal theories , 2004, Artif. Intell..

[8]  Cristina Feier,et al.  D3.3 Complexity and Optimization of Combinations of Rules and Ontologies , 2011 .

[9]  Jos de Bruijn,et al.  Quantified Equilibrium Logic and Hybrid Rules , 2007, RR.

[10]  Enrico Giunchiglia,et al.  Dependent Fluents , 1995, IJCAI.

[11]  Murray Shanahan,et al.  The Event Calculus in Classical Logic - Alternative Axiomatisations , 1999, Electron. Trans. Artif. Intell..

[12]  Vladimir Lifschitz,et al.  Representing Transition Systems by Logic Programs , 1999, LPNMR.

[13]  Michael Gelfond,et al.  Action Languages , 1998, Electron. Trans. Artif. Intell..

[14]  Hans Tompits,et al.  A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming , 2005, IJCAI.

[15]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[16]  Vladimir Lifschitz,et al.  Action Languages, Answer Sets, and Planning , 1999, The Logic Programming Paradigm.

[17]  M. Gelfond,et al.  Yet Another Modular Action Language , 2009 .

[18]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[19]  J. McCarthy.  Situations, Actions, and Causal Laws , 1963 .

[20]  Michael Kifer,et al.  Formalizing Production Systems with Rule-Based Ontologies , 2012, FoIKS.

[21]  Hugo Liu,et al.  ConceptNet — A Practical Commonsense Reasoning Tool-Kit , 2004 .

[22]  Vladimir Lifschitz,et al.  Answer Set Programming , 2019 .

[23]  Erik Sandewall,et al.  Cognitive Robotics Logic and its Metatheory: Features and Fluents Revisited , 1998, Electron. Trans. Artif. Intell..

[24]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[25]  Hudson Turner,et al.  Representing Actions in Logic Programs and Default Theories: A Situation Calculus Approach , 1997, J. Log. Program..

[26]  Hans Tompits,et al.  Combining answer set programming with description logics for the Semantic Web , 2004, Artif. Intell..

[27]  Leslie Pack Kaelbling,et al.  Hierarchical Planning in the Now , 2010, Bridging the Gap Between Task and Motion Planning.

[28]  Jean-Claude Latombe,et al.  Integrating task and PRM motion planning : Dealing with many infeasible motion planning queries , 2009 .

[29]  Hudson Turner,et al.  A Causal Theory of Ramifications and Qualifications , 1995, IJCAI.

[30]  Pedro Cabalar,et al.  Loop Formulas for Splitable Temporal Logic Programs , 2011, LPNMR.

[31]  Hector J. Levesque,et al.  Foundations for the Situation Calculus , 1998, Electron. Trans. Artif. Intell..

[32]  Michael Fink,et al.  HEX Programs with Action Atoms , 2010, ICLP.

[33]  Gregory D. Hager,et al.  Sampling-Based Motion and Symbolic Action Planning with geometric and differential constraints , 2010, 2010 IEEE International Conference on Robotics and Automation.

[34]  Enrico Giunchiglia,et al.  An Action Language Based on Causal Explanation: Preliminary Report , 1998, AAAI/IAAI.

[35]  Marek J. Sergot,et al.  A logic-based calculus of events , 1989, New Generation Computing.

[36]  Michael Gelfond,et al.  Representing Actions in Extended Logic Programming , 1992, JICSLP.

[37]  Vladimir Lifschitz,et al.  Two components of an action language , 1997, Annals of Mathematics and Artificial Intelligence.

[38]  Tansel Uras,et al.  Applications of AI planning in genome rearrangement and in multi-robot systems , 2011 .

[39]  Kadir Haspalamutgil,et al.  Multi-robot systems in cognitive factories: representation, reasoning, execution and monitoring , 2011 .

[40]  Marius Thomas Lindauer,et al.  Potassco: The Potsdam Answer Set Solving Collection , 2011, AI Commun..

[41]  Chitta Baral,et al.  Knowledge-Based Integrative Framework for Hypothesis Formation in Biochemical Networks , 2005, DILS.

[42]  Tran Cao Son,et al.  Formalizing sensing actions A transition function based approach , 2001, Artif. Intell..

[43]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[44]  Chitta Baral,et al.  Issues in Reasoning about Interaction Networks in Cells: Necessity of Event Ordering Knowledge , 2005, AAAI.

[45]  Werner Nutt,et al.  Combining Production Systems and Ontologies , 2011, RR.

[46]  Vladimir Lifschitz,et al.  A Modular Action Description Language , 2006, AAAI.

[47]  Michael Gelfond,et al.  Representing Action and Change by Logic Programs , 1993, J. Log. Program..

[48]  Vladimir Lifschitz,et al.  Actions with Indirect Effects (Preliminary Report) , 1994, KR.

[49]  Chitta Baral,et al.  Reasoning about non-immediate triggers in biological networks , 2008, Annals of Mathematics and Artificial Intelligence.

[50]  Philipp Obermeier,et al.  Processing RIF and OWL2RL within DLVHEX , 2010, RR.

[51]  Enrico Giunchiglia,et al.  Representing Action: Indeterminacy and Ramifications , 1997, Artif. Intell..

[52]  Wolfgang Faber,et al.  Semantics and complexity of recursive aggregates in answer set programming , 2011, Artif. Intell..

[53]  Pavlos Peppas,et al.  Handbook of Knowledge Representation Edited Belief Revision Pavlos Peppas 8.1 Introduction , 2022 .

[54]  Pedro Cabalar,et al.  STeLP - A Tool for Temporal Answer Set Programming , 2011, LPNMR.

[55]  Boris Motik,et al.  Reconciling description logics and rules , 2010, JACM.

[56]  Marina De Vos,et al.  AQL: A Query Language for Action Domains Modelled Using Answer Set Programming , 2009, LPNMR.

[57]  Enrico Franconi,et al.  Generalized Ontology-Based Production Systems , 2012, KR.

[58]  Martin Gebser,et al.  Engineering an Incremental ASP Solver , 2008, ICLP.

[59]  Chitta Baral,et al.  Hypothesizing about signaling networks , 2009, J. Appl. Log..

[60]  N. McCain.  Causality in commonsense reasoning about actions , 1997 .

[61]  Charles L. Forgy,et al.  Rete: A Fast Algorithm for the Many Patterns/Many Objects Match Problem , 1982, Artif. Intell..

[62]  Rachid Alami,et al.  aSyMov: A Planner That Deals with Intricate Symbolic and Geometric Problems , 2003, ISRR.

[63]  Erik Sandewall.  Features and fluents : representation of knowledge about dynamical systems , 1994 .

[64]  Stuart J. Russell,et al.  Combined Task and Motion Planning for Mobile Manipulation , 2010, ICAPS.