Action Logic Programs — How to Specify Strategic Behavior in Dynamic Domains Using Logical Rules

[1]  Hector J. Levesque,et al.  On the Semantics of Deliberation in IndiGolog — from Theory to Implementation , 2002, Annals of Mathematics and Artificial Intelligence.

[2]  M. Dummett.  Elements of Intuitionism , 2000 .

[3]  L. E. J. Brouwer,et al.  Over de Grondslagen der Wiskunde , 2009 .

[4]  Alfonso Gerevini,et al.  Preferences and soft constraints in PDDL3 , 2006 .

[5]  Hector J. Levesque,et al.  GOLOG: A Logic Programming Language for Dynamic Domains , 1997, J. Log. Program..

[6]  Erik T. Mueller,et al.  Commonsense Reasoning , 2006, Qualitative Representations.

[7]  Greg Restall,et al.  An Introduction to Substructural Logics , 2000 .

[8]  Marianne Winslett,et al.  Updating logical databases , 1990, Cambridge tracts in theoretical computer science.

[9]  Vladimir Lifschitz,et al.  ON THE SEMANTICS OF STRIPS , 1987 .

[10]  S. Vassos.  A Reasoning Module for Long-lived Cognitive Agents , 2009 .

[11]  Stephan Schiffel,et al.  A Declarative Agent Programming Language Based on Action Theories , 2009, FroCoS.

[12]  Michael Thielscher,et al.  From Situation Calculus to Fluent Calculus: State Update Axioms as a Solution to the Inferential Frame Problem , 1999, Artif. Intell..

[13]  William F. Clocksin,et al.  Programming in Prolog , 1981, Springer Berlin Heidelberg.

[14]  Carlo Zaniolo,et al.  Nonmonotonic reasoning in LDL , 2000 .

[15]  Yarden Katz,et al.  Pellet: A practical OWL-DL reasoner , 2007, J. Web Semant..

[16]  Gottlob Frege,et al.  Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens , 1879 .

[17]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[18]  Carsten Lutz,et al.  Updating Description Logic ABoxes , 2006, KR.

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

[20]  Hector J. Levesque,et al.  ConGolog, a concurrent programming language based on the situation calculus , 2000, Artif. Intell..

[21]  Dirk van Dalen,et al.  Logic and structure , 1980 .

[22]  Andreas Herzig,et al.  Metatheory of actions: Beyond consistency , 2006, Artif. Intell..

[23]  Stephan Schiffel,et al.  Fluxplayer: A Successful General Game Player , 2007, AAAI.

[24]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[25]  R. Smullyan.  First-Order Logic , 1968 .

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

[27]  Fangzhen Lin,et al.  How to Progress a Database II: The STRIPS Connection , 1995, IJCAI.

[28]  Hector J. Levesque,et al.  On ability to autonomously execute agent programs with sensing , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[29]  Patrick Doherty,et al.  The PMA and Relativizing Minimal Change for Action Update , 1998, Fundam. Informaticae.

[30]  Michael Thielscher.  Reasoning about Actions with CHRs and Finite Domain Constraints , 2002, ICLP.

[31]  Michael Thielscher,et al.  Putting ABox Updates into Action , 2009, FroCoS.

[32]  John Alan Robinson.  Computational Logic: Memories of the Past and Challenges for the Future , 2000, Computational Logic.

[33]  Fangzhen Lin,et al.  How to Progress a Database , 1997, Artif. Intell..

[34]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[35]  Marianne Winslett,et al.  Reasoning about Action Using a Possible Models Approach , 1988, AAAI.

[36]  Murray Shanahan,et al.  An abductive event calculus planner , 2000, J. Log. Program..

[37]  Stefan Schlobach,et al.  Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies , 2003, IJCAI.

[38]  Raymond Reiter,et al.  Some contributions to the metatheory of the situation calculus , 1999, JACM.

[39]  Peter Baumgartner,et al.  Computing Answers with Model Elimination , 1997, Artif. Intell..

[40]  Wolfgang Bibel,et al.  Let's Plan It Deductively! , 1997, IJCAI.

[41]  Alexander Borgida,et al.  On the Relative Expressiveness of Description Logics and Predicate Logics , 1996, Artif. Intell..

[42]  Jean-Yves Girard,et al.  Locus Solum: From the rules of logic to the logic of rules , 2001, Mathematical Structures in Computer Science.

[43]  Krzysztof R. Apt,et al.  From logic programming to Prolog , 1996, Prentice Hall International series in computer science.

[44]  Mark Witkowski,et al.  High-Level Robot Control through Logic , 2000, ATAL.

[45]  Maja Milicic.  Action, Time and Space in Description Logics , 2008 .

[46]  Rafael Peñaloza,et al.  Automata-Based Axiom Pinpointing , 2010, Journal of Automated Reasoning.

[47]  Michael Thielscher,et al.  Reasoning robots - the art and science of programming robotic agents , 2005, Applied logic series.

[48]  Hector J. Levesque,et al.  What Is Planning in the Presence of Sensing? , 1996, AAAI/IAAI, Vol. 2.

[49]  Hector J. Levesque,et al.  On the Progression of Situation Calculus Basic Action Theories: Resolving a 10-year-old Conjecture , 2008, AAAI.

[50]  Gerhard Lakemeyer,et al.  Semantics for a useful fragment of the situation calculus , 2005, IJCAI.

[51]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[52]  Michael Wooldridge,et al.  Programming Multi-Agent Systems in AgentSpeak using Jason (Wiley Series in Agent Technology) , 2007 .

[53]  Stephan Tobies,et al.  Complexity results and practical algorithms for logics in knowledge representation , 2001, ArXiv.

[54]  Murray Shanahan,et al.  A Logic-Based Formulation of Active Visual Perception , 2004, KR.

[55]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[56]  Michael Thielscher,et al.  A unifying action calculus , 2011, Artif. Intell..

[57]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[58]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[59]  Hector J. Levesque,et al.  Tractable Reasoning with Incomplete First-Order Knowledge in Dynamic Systems with Context-Dependent Actions , 2005, IJCAI.

[60]  Ian Horrocks,et al.  Reasoning Support for Expressive Ontology Languages Using a Theorem Prover , 2006, FoIKS.

[61]  Andrea Schaerf,et al.  Reasoning with Individuals in Concept Languages , 1993, Data Knowl. Eng..

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

[63]  Franz Baader,et al.  Integrating Description Logics and Action Formalisms: First Results , 2005, Description Logics.

[64]  M. de Rijke,et al.  From Description to Hybrid Logics, and Back , 2000, Advances in Modal Logic.

[65]  Michael Thielscher,et al.  Under Consideration for Publication in Theory and Practice of Logic Programming Flux: a Logic Programming Method for Reasoning Agents , 2003 .

[66]  Slim Abdennadher,et al.  Essentials of Constraint Programming , 2010, Cognitive Technologies.

[67]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[68]  Michael Thielscher,et al.  Representing the Knowledge of a Robot , 2000, KR.

[69]  Peter B. Andrews.  An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.

[70]  Gerhard Lakemeyer,et al.  A Semantics for ADL as Progression in the Situation Calculus , 2006 .

[71]  Frank van Harmelen,et al.  Handbook of Knowledge Representation , 2008, Handbook of Knowledge Representation.

[72]  Gerhard Lakemeyer,et al.  A Logic of Limited Belief for Reasoning with Disjunctive Information , 2004, KR.

[73]  Richard J. Waldinger.  Whatever Happened to Deductive Question Answering? , 2007, LPAR.

[74]  Boris Motik,et al.  A Resolution-Based Decision Procedure for SHOIQ , 2006, IJCAR.

[75]  Francesco Savelli,et al.  Existential assertions and quantum levels on the tree of the situation calculus , 2006, Artif. Intell..

[76]  Gert Smolka,et al.  Spartacus: A Tableau Prover for Hybrid Logic , 2010, Electron. Notes Theor. Comput. Sci..

[77]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

[78]  Michael J. Maher,et al.  The Semantics of Constraint Logic Programs , 1998, J. Log. Program..

[79]  Grigoris Antoniou,et al.  Nonmonotonic reasoning , 1997 .

[80]  J. Benthem,et al.  Higher-Order Logic , 2001 .

[81]  Wolfgang Bibel.  A deductive solution for plan generation , 2009, New Generation Computing.

[82]  Raymond Reiter,et al.  The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression , 1991, Artificial and Mathematical Theory of Computation.

[83]  Wilfrid Hodges,et al.  A Shorter Model Theory , 1997 .

[84]  Murray Shanahan,et al.  A Logical Account of Perception Incorporating Feedback and Expectation , 2002, KR.

[85]  Joseph Y. Halpern.  A Computing Research Repository , 1998, D Lib Mag..

[86]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[87]  Maarten Marx,et al.  A Road-Map on Complexity for Hybrid Logics , 1999, CSL.

[88]  Hector J. Levesque,et al.  Knowledge, action, and the frame problem , 2003, Artif. Intell..

[89]  Gerhard Lakemeyer,et al.  Situations, Si! Situation Terms, No! , 2004, KR.

[90]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[91]  John G. Gibbons.  Knowledge in Action , 2001 .

[92]  S. Shapiro,et al.  Foundations Without Foundationalism: A Case for Second-Order Logic. , 1994 .

[93]  A Tractability Result for Reasoning with Incomplete First-Order Knowledge Bases , 2003, IJCAI.

[94]  Davide Ancona,et al.  Languages for Programming BDI-style Agents: an Overview , 2005, WOA.

[95]  Steffen Hölldobler,et al.  A new deductive approach to planning , 1989, New Generation Computing.

[96]  Michael R. Genesereth,et al.  General Game Playing: Overview of the AAAI Competition , 2005, AI Mag..

[97]  Michael Thielscher,et al.  Integrating Action Calculi and Description Logics , 2007, KI.

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

[99]  Thom W. Frühwirth,et al.  Theory and Practice of Constraint Handling Rules , 1998, J. Log. Program..

[100]  Renate A. Schmidt,et al.  Using Tableau to Decide Expressive Description Logics with Role Negation , 2007, ISWC/ASWC.

[101]  Hannes Strass,et al.  Simple Default Reasoning in Theories of Action , 2009, Australasian Conference on Artificial Intelligence.

[102]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[103]  Richard A. O'Keefe,et al.  The Craft of Prolog , 1990 .

[104]  Murray Shanahan,et al.  A Circumscriptive Calculus of Events , 1995, Artif. Intell..

[105]  Joseph R. Shoenfield,et al.  Mathematical logic , 1967 .

[106]  Hector J. Levesque.  A Completeness Result for Reasoning with Incomplete First-Order Knowledge Bases , 1998, KR.

[107]  Christoph Weidenbach,et al.  Computing Small Clause Normal Forms , 2001, Handbook of Automated Reasoning.

[108]  Gerhard Lakemeyer,et al.  A Situation-Calculus Semantics for an Expressive Fragment of PDDL , 2007, AAAI.

[109]  Cordell Green.  Theorem-Proving by Resolution as a Basis for Question-Answering Systems , 2010 .

[110]  Zohar Manna,et al.  How to clear a block: A theory of plans , 2004, Journal of Automated Reasoning.

[111]  Sebastian Sardina,et al.  Deliberation in agent programming languages , 2005 .

[112]  Gerhard Lakemeyer,et al.  Towards an Integration of Golog and Planning , 2007, IJCAI.

[113]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[114]  Murray Shanahan,et al.  Some Alternative Formulations of the Event Calculus , 2002, Computational Logic: Logic Programming and Beyond.

[115]  Michael Thielscher,et al.  Inferring Implicit State Knowledge and Plans with Sensing Actions , 2001, KI/ÖGAI.

[116]  Ian Pratt-Hartmann.  Complexity of the Two-Variable Fragment with Counting Quantifiers , 2005, J. Log. Lang. Inf..

[117]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[118]  Robert F. Stärk.  A Direct Proof for the Completeness of SLD-Resolution , 1989, CSL.