Sound and efficient closed-world reasoning for planning

Artificial Intelligence

Volumn 89, Issue 1-2, 1997, Pages 113-148

  Etzioni, Oren ^a   Golden, Keith ^a   Weld, Daniel S ^a  

^a University of Washington   (United States)

Author keywords

Circumscription; Closed world reasoning; Database updates; Incomplete information; Information gathering; Logic of knowledge; Planning; Softbot

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; EFFICIENCY; FORMAL LOGIC; INFORMATION RETRIEVAL; KNOWLEDGE REPRESENTATION;

PLANNING ALGORITHMS;

PLANNING;

EID: 0030684971     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(96)00026-4     Document Type: Article

References (51)

1. J. Ambros-Ingerson and S. Steel, Integrating planning, execution, and monitoring, in: Proceedings AAAI-88, St. Paul, MN (1988) 735-740.
2. R.J. Brachman, "Reducing" CLASSIC to practice: knowledge representation theory meets reality, in: Proceedings Third International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA (1992).
3. D. Brill, LOOM Reference Manual, USC-ISI, Westlake Village, CA, version 1.4 edition (1991).
4. M. Cadoli and M. Schaerf, A survey of complexity results for non-monotonic logics, J. Logic Program. 17 (1993) 127-160.
5. D. Chapman, Planning for conjunctive goals, Artif. Intell. 32 (1987) 333-377.
6. K.L. Clark, Negation as failure, in: H. Gallaire and J. Minker, eds., Logic and Data Bases (Plenum, New York, 1978) 293-322.
7. A. del Val, Computing knowledge base updates, in: Proceedings Third International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA (1992) 740-750.
8. A. del Val and Y. Shoham, Deriving properties of belief update from theories of action (II), in: Proceedings IJCAI-93, Chambery (1993) 732-737.
9. T. Eiter and G. Gottlob, On the complexity of propositional knowledge base revision, updates, and counterfactuals, Artif. Intell. 57 (1992) 227-270.
10. C. Elkan, A decision procedure for conjunctive query disjointness, in: Proceedings ACM Symposium on Principles of Database Systems (1989) 134-139.
11. C. Elkan, Independence of logic database queries and updates, in: Proceedings ACM Symposium on Principles of Database Systems (1990) 154-160.
12. D. Etherington, Reasoning with Incomplete Information (Morgan Kaufmann, Los Altos, CA, 1988).
13. D. Etherington, S. Kraus and D. Perlis, Nonmonotonicity and the scope of reasoning: preliminary report, in: Proceedings AAAI-90, Boston, MA (1990) 600-607.
14. O. Etzioni, Intelligence without robots: a reply to Brooks, AI Mag. 14 (4) (1993); also available via anonymous FTP from pub/etzioni/sof tbots/atcs.washington.edu.
15. O. Etzioni, K. Golden and D. Weld, Tractable closed-world reasoning with updates, in: Proceedings Fourth International Conference on Principles of Knowledge Representation and Reasoning, Bonn (1994) 178-189.
16. O. Etzioni, S. Hanks, D. Weld, D. Draper, N. Lesh and M. Williamson, An approach to planning with incomplete information, in: Proceedings Third International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA (1992); also available via FTP from pub/ai/at ftp.cs.washington.edu.
17. O. Etzioni and N. Lesh, Planning with incomplete information in the UNIX domain, in: Working Notes of the AAAI Spring Symposium: Foundations of Automatic Planning: The Classical Approach and Beyond (AAAI Press, Menlo Park, CA, 1993) 24-28.
18. O. Etzioni, N. Lesh and R. Segal, Building softbots for UNIX (preliminary report), Tech. Rept. 93-09-01, University of Washington, Seattle, WA (1993); also available via anonymous FTP from pub/etzioni/softbots/atcs.washington.edu.
19. O. Etzioni and D. Weld, A softbot-based interface to the Internet, Commun. ACM 37 (7) (1994) 72-76; also see http://www.cs.washington.edu/research/softbots.
20. M. Genesereth and I. Nourbakhsh, Time-saving tips for problem solving with incomplete information, in: Proceedings AAAI-93, Washington, DC (1993) 724-730.
21. M.L. Ginsberg, A circumscriptive theorem prover, Artif. Intell. 39 (1989) 209-230.
22. M.L. Ginsberg and D.E. Smith, Reasoning about action I: a possible worlds approach, Artif. Intell. 35 (1988) 165-196.
23. K. Golden, O. Etzioni and D. Weld, Omnipotence without omniscience: sensor management in planning, in: Proceedings AAAI-94, Seattle, WA (1994) 1048-1054.
24. K. Golden, O. Etzioni and D. Weld, Planning with execution and incomplete information. Tech. Rept. 96-01-09, Department of Computer Science and Engineering, University of Washington, Seattle, WA (1996); also available via FTP from pub/ai/atftp.cs.washington.edu.
25. G. Grahne, The problem of incomplete information in relational databases, in: Lecture Notes in Computer Science 554 (Springer, New York, 1991).
26. H. Katsuno and A. Mendelzon, On the difference between updating a knowledge base and revising it, in: Proceedings Second International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA (1991) 387-394.
27. A. Keller and M. Wilkins, On the use of an extended relational model to handle changing incomplete information, IEEE Trans. Sofrw. Eng. 11 (1985) 620-633.
28. K. Konolige, Circumscriptive ignorance, in: Proceedings AAAI-82, Pittsburgh, PA (1982) 202-204.
29. R. Kowalski, Logic for data description, in: H. Gallaire and J. Minker, eds., Logic and Data Bases (Plenum, New York, 1978) 77-103.
30. K. Krebsbach, D. Olawsky and M. Gini, An empirical study of sensing and defaulting in planning, in: Proceedings 1st International Conference on AI Planning Systems (1992) 136-144.
31. H.J. Levesque, All I know: a study in autoepistemic logic, Artif. Intell. 42 (1990) 263-309.
32. A. Levy, Queries, updates, and LCW, Personal communication, 1994.
33. A. Levy and Y. Sagiv, Queries independent of updates, in: Proceedings 19th VLDB Conference (1993).
34. V. Lifschitz, Closed-world databases and circumscription, Artif. Intell. 27 (1985) 229-235.
35. J. McCarthy, Circumscription - a form of non-monotonic reasoning, Artif. Intell. 13 (1980) 27-39.
36. R. Moore, A formal theory of knowledge and action, in: J. Hobbs and R. Moore, eds., Formal Theories of the Commonsense World (Ablex, Norwood, NJ, 1985).
37. A. Motro, Integrity = validity + completeness, TODS 14 (1989) 480-502.
38. D. Olawsky and M. Gini, Deferred planning and sensor use, in: Proceedings of DARPA Workshop on Innovative Approaches to Planning, Scheduling, and Control (1990).
39. C. Papadimitriou, Games against nature, J. Comput. Syst. Sci. 31 (1985) 288-301.
40. E. Pednault, ADL: exploring the middle ground between STRIPS and the situation calculus, in: Proceedings First International Conference on Principles of Knowledge Representation and Reasoning, Toronto, Ont. (1989) 324-332.
41. J.S. Penberthy and D. Weld, UCPOP: a sound, complete, partial order planner for ADL, in: Proceedings Third International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA (1992) 103-114; also available via FTP from pub/ai/atftp.cs.washington.edu.
42. M. Peot and D. Smith, Conditional nonlinear planning, in: Proceedings 1st International Conference on AI Planning Systems (1992) 189-197.
43. O. Raiman and J. de Kleer, A minimality maintenance system, in: Proceedings Third International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA (1992) 532-538.
44. R. Reiter, On closed world databases, in: H. Gallaire and J. Minker, eds., Logic and Data Bases (Plenum, New York, 1978) 55-76; reprinted in: M.L. Ginsberg, ed., Readings in Nonmonotonic Reasoning (Morgan Kaufmann, San Mateo, CA, 1987).
45. R. Reiter, On closed world databases, in: H. Gallaire and J. Minker, eds., Logic and Data Bases (Plenum, New York, 1978) 55-76; reprinted in: M.L. Ginsberg, ed., Readings in Nonmonotonic Reasoning (Morgan Kaufmann, San Mateo, CA, 1987).
46. R. Reiter, Circumscription implies predicate completion (sometimes), in: Proceedings AAAI-82, Pittsburgh, PA (1982) 418-420.
47. D. Smith, Finding all of the solutions to a problem, in: Proceedings AAAI-83, Washington, DC (1983) 373-377.
48. A. Tate, Generating project networks, in: Proceedings IJCAI-77, Cambridge, MA (1977) 888-893.
49. D. Weld, An introduction to least-commitment planning, AI Mag. (1994) 27-61; also available via FTP from pub/aiatftp.cs.washington.edu.
50. M. Winslett, Reasoning about action using a possible models approach, in: Proceedings AAAI-88, St. Paul, MN (1988) 89.
51. M. Winslett, Updating Logical Databases (Cambridge University Press, Cambridge, 1990).