Tractable Closed World Reasoning with Updates

Abstract Closed world reasoning is the process of inferring that a logical sentence is false based on its absence from a knowledge base, or the inability to derive it. Previous work on circumscription, autoepistemic logic, and database theory has explored logical axiomatizations of closed world reasoning, and investigated computational tractability for propositional theories. Work in planning has traditionally made the closed world assumption but has avoided closed world reasoning. We take a middle position, and describe a tractable method for closed world reasoning over the schematized theories of action used by planning algorithms such as NONLIN, TWEAK, and UCPOP. We show the method to be both sound and tractable, and incorporate it into the XII planner [Golden et al. , 1994]. Experiments utilizing our softbot (software robot) demonstrate that the method can substantially improve its performance by eliminating redundant information gathering.

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

[2]  Matthew L. Ginsberg.  A Circumscriptive Theorem Prover , 1989, Artif. Intell..

[3]  Yoav Shoham,et al.  Deriving properties of belief update from theories of action , 1992, IJCAI.

[4]  Oren Etzioni,et al.  Planning with Incomplete Information in the UNIX Domain , 1993 .

[5]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[6]  Oren Etzioni,et al.  Building Softbots for UNIX (Preliminary Report) , 1992 .

[7]  Arthur M. Keller,et al.  On the Use of an Extended Relational Model to Handle Changing Incomplete Information , 1985, IEEE Transactions on Software Engineering.

[8]  Illah R. Nourbakhsh,et al.  Time-Saving Tips for Problem Solving with Incomplete Information , 1993, AAAI.

[9]  Alex Borgidaz,et al.  CLASSIC to Pra ti e : Knowledge Representation Theory Meets Reality , 1992 .

[10]  Milind Tambe,et al.  Eliminating Expensive Chunks by Restricting Expressiveness , 1989, IJCAI.

[11]  Oren Etzioni,et al.  A Structural Theory of Explanation-Based Learning , 1993, Artif. Intell..

[12]  Marco Schaerf,et al.  A Survey of Complexity Results for Nonmonotonic Logics , 1993, J. Log. Program..

[13]  Austin Tate,et al.  Generating Project Networks , 1977, IJCAI.

[14]  Oren Etzioni,et al.  Intelligence without Robots: A Reply to Brooks , 1993, AI Mag..

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

[16]  Alvaro del Val.  Computing Knowledge Base Updates , 1992, KR.

[17]  Mark A. Peot,et al.  Conditional nonlinear planning , 1992 .

[18]  David E. Smith,et al.  Reasoning About Action I: A Possible Worlds Approach , 1987, Artif. Intell..

[19]  Michael A. Taitslin,et al.  A Logic for Data Description , 1989, Logic at Botik.

[20]  Christos H. Papadimitriou,et al.  Games against nature , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[21]  Hirofumi Katsuno,et al.  On the Difference between Updating a Knowledge Base and Revising It , 1991, KR.

[22]  Oren Etzioni,et al.  An Approach to Planning with Incomplete Information , 1992, KR.

[23]  E. Pednault.  Toward a mathematical theory of plan synthesis , 1987 .

[24]  Matthew L. Ginsberg,et al.  Readings in Nonmonotonic Reasoning , 1987, AAAI 1987.

[25]  Daniel S. Weld.  An Introduction to Least Commitment Planning , 1994, AI Mag..

[26]  Edwin P. D. Pednault,et al.  Synthesizing plans that contain actions with context‐dependent effects 1 , 1988, Comput. Intell..

[27]  Hector J. Levesque,et al.  All I Know: A Study in Autoepistemic Logic , 1990, Artif. Intell..

[28]  Georg Gottlob,et al.  On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals , 1992, Artif. Intell..

[29]  Vladimir Lifschitz,et al.  Closed-World Databases and Circumscription , 1987, Artif. Intell..

[30]  Richard B. Segal.  Softbots as Testbeds for Machine Learning , 1992 .

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

[32]  Maria Gini,et al.  Deferred Planning and Sensor Use , 1990 .

[33]  Ernest Davis,et al.  Representations of commonsense knowledge , 2014, notThenot Morgan Kaufmann series in representation and reasoning.

[34]  Maria Gini,et al.  An empirical study of sensing and defaulting in planning , 1992 .

[35]  Sam Steel,et al.  Integrating Planning, Execution and Monitoring , 1988, AAAI.

[36]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[37]  Ernest Davis.  Inferring Ignorance from the Locality of Visual Perception , 1988, AAAI.

[38]  Raymond Reiter,et al.  Circumscription Implies Predicate Completion (Sometimes) , 1982, AAAI.

[39]  David E. Smith.  Finding All of the Solutions to a Problem , 1983, AAAI.

[40]  Johan de Kleer,et al.  A Minimality Maintenance System , 1992, KR.

[41]  Kurt Konolige,et al.  Circumscriptive Ignorance , 1982, AAAI.

[42]  Robert C. Moore.  A Formal Theory of Knowledge and Action , 1984 .

[43]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..