Open World Planning in the Situation Calculus

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 754-760

  Finzi, Alberto ^a   Pirri, Fiora ^a   Reiter, Ray ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE REPRESENTATION;

APPLICATIONS DOMAINS; AXIOMATI-SATION; DOMAIN-SPECIFIC INFORMATION; FORWARD REASONING; INITIAL SITUATION; OPEN WORLD; PRIME IMPLICATE; SEARCH SPACES; SITUATION CALCULUS; THEOREM PROVERS;

THEOREM PROVING;

EID: 85158144259     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Bacchus, F., and Kabanza, F. 1996. Planning for temporally extended goals. In Proceedings of the National Conference on Artificial Intelligence (AAAI'96), 1215-1222.
2. Bacchus, F., and Kabanza, F. 2000. Using temporal logics to express search control knowledge for planning. Artificial Intelligence 116(1-2):123-191.
3. Bayardo, R., and Schrag, R. 1997. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the National Conference on Artificial Intelligence (AAAI'97), 203-208.
4. Blum, A., and Furst, M. 1997. Fast planning through planning graph analysis. Artificial Intelligence 90(1-2):281-300.
5. Cimatti, A., and Roveri, M. 1999. Conformant planning via model checking. In Biundo, S., ed., Proc. ECP99: European Conference on Planning. Springer-Verlag.
6. de Giacomo, G.; Iocchi, L.; Nardi, D.; and Rosati, R. 1997. Planning with sensing for a mobile robot. In Preprints of the Fourth European Conf. on Planning, 158-170.
7. de Kleer, J. 1992. An improved incremental algorithm for generating prime implicates. In Proceedings of the National Conference on Artificial Intelligence (AAAI'92), 780-785.
8. Golden, K.; Etzioni, O.; and Weld, D. 1994. Omnipotence without omniscience: Efficient sensor management for planning. In Proceedings of the National Conference on Artificial Intelligence (AAAI'94), 1048-1054.
9. Green, C. 1969. Theorem proving by resolution as a basis for question-answering systems. In Meltzer, B., and Michie, D., eds., Machine Intelligence 4. New York: American Elsevier. 183-205.
10. Kautz, H., and Selman, B. 1996. Pushing the envelope: Planning, propositional logic and stochastic search. In Proceedings of the National Conference on Artificial Intelligence (AAAI'96), 1194-1201.
11. Levesque, H.; Reiter, R.; Lespérance, Y.; Lin, F.; and Scherl, R. 1997. GOLOG: a logic programming language for dynamic domains. J. of Logic Programming, Special Issue on Actions 31(1-3):59-83.
12. Levesque, H. 1996. What is planning in the presence of sensing? In Proceedings of the National Conference on Artificial Intelligence (AAAI'96), 1139-1146.
13. Lin, F., and Reiter, R. 1994. State constraints revisited. J. of Logic and Computation, special issue on actions and processes 4:655-678.
14. Lin, F., and Reiter, R. 1997. How to progress a database. Artificial Intelligence 92:131-167.
15. McCarthy, J. 1963. Situations, actions and causal laws. Technical report, Stanford University. Reprinted in Semantic Information Processing (M. Minsky ed.), MIT Press, Cambridge, Mass., 1968, pp. 410-417.
16. Pirri, F., and Reiter, R. 1999. Some contributions to the metatheory of the situation calculus. Journal of the ACM 46(3):261-325.
17. Quine, W. 1959. On cores and prime implicants of truth functions. American Math. Monthly 66:755-760.
18. Reiter, R. 1991. The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression. In Lifschitz, V., ed., Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy. San Diego, CA: Academic Press. 359-380.
19. Reiter, R. 1999. Knowledge in Action: Logical Foundations for Describing and Implementing Dynamical Systems. In preparation. Draft available at http://www.cs.toronto.edu/c̃ogrobo/.
20. Rintanen, J. 1999. Constructing conditional plans by a theorem-prover. Journal of Artificial Intelligence Research 10:323-352.
21. Smith, D., and Weld, D. 1998. Conformant graphplan. In Proceedings of the National Conference on Artificial Intelligence (AAAI'98), 889-896. AAAI Press/MIT Press.