First-order strong progression for local-effect basic action theories

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2008, Pages 662-671

  Vassos, Stavros ^a   Lakemeyer, Gerhard ^b   Levesque, Hector J ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS;

BASIC ACTIONS; FIRST ORDER; LOCAL EFFECTS; SECOND-ORDER LOGIC; SITUATION CALCULUS; SLIGHT VARIANT;

KNOWLEDGE REPRESENTATION;

EID: 77953695647     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Ackermann, W. 1935. Untersuchung ̈uber das eliminationsproblem der mathematischen logik. Mathematische Annalen 110:390-413.
2. Claßen, J.; Eyerich, P.; Lakemeyer, G.; and Nebel, B. 2007. Towards an integration of Golog and planning. In Veloso, M. M., ed., Proc. of IJCAI-07, 1846-1851.
3. Doherty, P.; Lukaszewicz, W.; and Szałas, A. 2001. Computing strongest necessary and weakest sufficient conditions of first-order formulas. In Proc. of IJCAI-01, 145- 151.
4. Fikes, R., and Nilsson, N. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2:189-208.
5. Hindriks, K. V.; De Boer, F. S.; Van der Hoek, W.; and Meyer, J.-J. C. 1999. Agent programming in 3APL. Autonomous Agents and Multi-Agent Systems 2(4):357-401.
6. Lakemeyer, G., and Levesque, H. J. 2004. Situations, si! situation terms, no! In Dubois, D.; Welty, C. A.; and Williams, M.-A., eds., Proc. of KR-04, 516-526.
7. Levesque, H. J.; Reiter, R.; Lesṕerance, Y.; Lin, F.; and Scherl, R. B. 1997. Golog: A logic programming language for dynamic domains. Journal of Logic Programming 31(1-3):59-83.
8. Lin, F., and Reiter, R. 1997. How to progress a database. Artificial Intelligence 92(1-2):131-167.
9. Lin, F. 2004. Discovering state invariants. In Dubois, D.; Welty, C. A.; and Williams, M.-A., eds., Proc. of KR-04, 536-544. AAAI Press.
10. Liu, Y., and Levesque, H. J. 2005. Tractable reasoning with incomplete first-order knowledge in dynamic systems with context-dependent actions. In Veloso, M. M., and Kambhampati, S., eds., Proc. of IJCAI-05, 639-644.
11. McCarthy, J., and Hayes, P. J. 1969. Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence 4:463-502.
12. Nonnengart, A.; Ohlbach, H. J.; and Szalas, A. 1999. Elimination of predicate quantifiers. In Ohlbach, H. J., and Reyle, U., eds., Logic, Language and Reasoning. Essays in Honor of Dov Gabbay. Kluwer. 159-181.
13. Reiter, R. 2001. Knowledge in Action. Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press.
14. Shirazi, A., and Amir, E. 2005. First-order logical filtering. In Veloso, M. M., and Kambhampati, S., eds., Proc. of IJCAI-05, 589-595.
15. Shoham, Y. 1993. Agent-oriented programming. Artificial Intelligence 60(1):51-92.
16. Thielscher, M. 1999. From situation calculus to fluent calculus: State update axioms as a solution to the inferential frame problem. Artificial Intelligence 111(1-2):277-299.
17. Vassos, S., and Levesque, H. 2007. Progression of situation calculus action theories with incomplete information. In Veloso, M. M., ed., Proc. of IJCAI-07, 2024-2029.
18. Vassos, S., and Levesque, H. 2008. On the progression of situation calculus basic action theories: Resolving a 10- year-old conjecture. In Proc. AAAI-08. (To appear).