Reasoning about effects of concurrent actions

Journal of Logic Programming

Volumn 31, Issue 1-3, 1997, Pages 85-117

  Baral, Chitta ^a   Gelfond, Michael ^b  

^a University of Texas at El Paso   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; FINITE AUTOMATA; FORMAL LOGIC; KNOWLEDGE BASED SYSTEMS; LOGIC PROGRAMMING;

CONCURRENT ACTIONS; REASONING; SITUATION CALCULUS;

FORMAL LANGUAGES;

EID: 0031125506     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(96)00140-9     Document Type: Article

References (55)

1. Alferes, J., Li, R., and Pereira, L., Concurrent Actions and Changes in the Situation Calculus, in: H. Geffner (ed.), Proceedings of IBERAMIA 94, 1994, pp. 93-104.
2. Apt, K. and Bezem, M., Acyclic Programs, in: D. Warren and P. Szeredi (eds.), Logic Programming: Proceedings of the Seventh International Conference, 1990, pp. 617-633.
3. Apt, K. and Bezem, M., Acyclic Programs New Generation Computing 9(3/4):335-365 (1991).
4. Baker, A., Nonmonotonic Reasoning in the Framework of Situation Calculus. Artificial Intelligence 49:5-23 (1991).
5. Ben-Eliyahu, R. and Palopoli, L., Reasoning with Minimal Models: Efficient Algorithms and Applications, in: Proceedings of KR 94, 1994, pp. 39-50.
6. Baral, C. and Gelfond, M., Representing Concurrent Actions in Extended Logic Programming, in: Proceedings of the 13th International Joint Conference on Artificial Intelligence, Chambery, France, 1993, pp. 866-871.
7. Baral, C. and Gelfond, M., Logic Programming and Knowledge Representation, Journal of Logic Programming 19 20:73-148 (1994).
8. Baral, C. and Gelfond, M., Representing Actions: Laws, Observations and Hypothesis Journal of Logic Programming 31:201-243 (1997).
9. Cavedon, L., Continuity, Consistency, and Completeness Properties for Logic Programs, in: G. Levi and M. Martelli (eds.), Logic Programming: Proceedings of the Sixth International Conference, 1989, pp. 571-584.
10. Clark, K., Negation as Failure, in: H. Gallaire and J. Minker (eds.), Logic and Data Bases, Plenum Press, New York, 1978, pp. 293-322.
11. Denecker, M. and De Schreye, D., Representing Incomplete Knowledge in Abductive Logic Programming, in: Proceedings of International Logic Programming Symposium 93, Vancouver, 1993, pp. 147-164.
12. Dix, J., Classifying Semantics of Logic Programs, in: Proceedings of International Workshop in Logic Programming and Non-monotonic Reasoning, Washington, DC, 1991, pp. 166-180.
13. Dung, P., Representing Actions in Logic Programming and Its Application in Database Updates, in: D. S. Warren (ed.), Proceedings of International Conference on Logic Programming, 1993, pp. 222-238.
14. Eshghi, K. and Kowalski, R., Abduction Compared with Negation as Failure, in: G. Levi and M. Martelli (eds.), Logic Programming: Proceedings of the Sixth International Conference, 1989, pp. 234-255.
15. Elkan, C., Reasoning about Action in First-Order Logic Maintenance Systems, in: Proceedings of the Ninth Biennial Conference of the Canadian Society for Computational Studies of Intelligence, 1992.
16. Evans, C., Negation-as-Failure as an Approach to the Hanks and McDermott Problem, in: Proceedings of the Second International Symposium on Artificial Intelligence, 1989.
17. Gelfond, M., Logic Programming and Reasoning with Incomplete Information, Annals of Mathematics and Artificial Intelligence 12:19-46 (1994).
18. Gelfond, M. and Lifschitz, V., The Stable Model Semantics for Logic Programming, in: R. Kowalski and K. Bowen (eds.), Logic Programming: Proceedings of the Fifth International Conference and Symposium, 1988, pp. 1070-1080.
19. Gelfond, M. and Lifschitz, V., Logic Programs with Classical Negation, in: D. Warren and P. Szeredi (eds.), Logic Programming: Proceedings of the Seventh International Conference, 1990, pp. 579-597.
20. Gelfond, M. and Lifschitz, V., Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing 365-387 (1991).
21. Gelfond, M. and Lifschitz, V., Representing Actions in Extended Logic Programs, in: Joint International Conference and Symposium on Logic Programming, 1992, pp. 559-573.
22. Gelfond, M., Lifschitz, V., and Rabinov, A., What Are the Limitations of the Situation Calculus?, in: R. Boyer (ed.), Automated Reasoning: Essays in Honor of Woody Bledsoe, Kluwer Academic, Dordrecht, 1992.
23. Holldobler, S. and Thielscher, M., Actions and Specificity, in: D. Miller (ed.), Proceedings of ICLP-93, 1993, pp. 164-180.
24. Inoue, K., Extended Logic Programs with Default Assumptions, in: Proceedings of International Conference on Logic Programming, 1991.
25. Kartha, G., Soundness and Completeness Theorems for Three Formalizations of Action, in: International Joint Conference in Artificial Intelligence 93, 1993, pp. 724-729.
26. Kartha, G. and Lifschitz, V., Actions with Indirect Effects (preliminary report), in: Proceedings of KR, 1994, pp. 341-350.
27. [LLL] Lesperance, Y., Levesque, H., and Lin, F., A Formalization of Ability and Knowing How that Avoids the Frame Problem, Unpublished manuscript.
28. Lobo, J., Minker, J., and Rajasekar, A., Foundations of Disjunctive Logic Programming, MIT Press, 1992.
29. Lin, F. and Reiter, R., How to Progress a Database II: The STRIPS Connection, in: Proceedings of the IJCAI, 1995, pp. 2001-2007.
30. Lin, F. and Reiter, R., How to Progress a Database (and Why) I: Logical Foundations, in: Proceedings of KR94, 1994, pp. 425-436.
31. Lin, F. and Shoham, Y., Provably Correct Theories of Actions: Preliminary Report, in: Proceedings of AAAI-91, 1991.
32. Lin, F. and Shoham, Y., Concurrent Actions in the Situation Calculus, in: Proceedings of AAAI 92, 1992, pp. 590-595.
33. [LT] Lifschitz, V. and Turner, H., Splitting a Logic Program, in: Proceedings of ICLP 94, 1994, pp. 23-38.
34. Lifschitz, V. and Turner, H., From Disjunctive Programs to Abduction, Unpublished manuscript.
35. McCarthy, J., Programs with Common Sense, in: Proceedings of the Teddington Conference on the Mechanization of Thought Processes, Her Majesty's Stationery Office, London, 1959, pp. 75-91.
36. McCarthy, J., Applications of Circumscription to Formalizing Common Sense Knowledge, Artificial Intelligence 26(3):89-116 (1986).
37. McCarthy, J. and Hayes, P., Some Philosophical Problems from the Standpoint of Artificial Intelligence in: B. Meltzer and D. Michie (eds.), Machine Intelligence, Edinburgh University Press, Edinburgh, 1969, Vol. 4, pp. 463-502.
38. Miller, R., Situation Calculus Specifications for Event Calculus Logic Programs, in: W. Marek, A. Nerode, and M. Truszynski (eds.), Proceedings of the Third International Conference on Logic Programming and Non-monotonic Reasoning, 1995, pp. 217-230.
39. Pereira, L., Caires, L., and Alferes, J., Classical Negation in Logic Programs, in: 7 Simposio Brasiliero de Inteligencia Artificial, 1990.
40. Pednault, E., ADL: Exploring the Middle Ground between STRIPS and the Situation Calculus, in: R. Brachman, H. Levesque, and R. Reiter (eds.), Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning, 1989, pp. 324-332.
41. Pinto, J., Temporal Reasoning in the Situation Calculus, Ph.D. Thesis, Department of Computer Science, University of Toronto, Feb. 1994.
42. Pinto, J. and Reiter, R., Temporal Reasoning in Logic Programming: A Case for the Situation Calculus, in: Proceedings of 10th International Conference in Logic Programming, Hungary, 1993, pp. 203-221.
43. Przymusinski, T., Perfect Model Semantics, in: R. Kowalski and K. Bowen (eds.), Logic Programming: Proceedings of the Fifth International Conference and Symposium, 1988, pp. 1081-1096.
44. Przymusinski, T., Stationary Semantics for Disjunctive Logic Programs and Deductive Databases, in: North American Conference on Logic Programming, 1990, pp. 40-62.
45. Pearce, D. and Wagner, G., Reasoning with Negative Information 1 - Strong Negation in Logic Programming, Technical Report, Gruppe fur Logic, Wissentheorie and Information, Freie Universitat Berlin, 1989.
46. Reiter, R., The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression, in: V. Lifschitz (ed.), Artificial Intelligence and Mathematical Theory of Computation, Academic Press, 1991, pp. 359-380.
47. Reiter, R., Formalizing Database Evolution in the Situation Calculus, in: Proceedings of the International Conference on Fifth Generation Computer Systems, 1992, pp. 600-609.
48. Reiter, R., Proving Properties of States in the Situation Calculus, Artificial Intelligence 64:337-351 (1993).
49. Sandewall, E., Features and Fluents: A Systematic Approach to the Representation of Knowledge about Dynamical Systems, Technical Report, Institutionen for datavetenskap, Universitetet och Tekniska hogskolan i Linkoping, Sweden, 1992.
50. Sandewall, E., The Range of Applicability of Some Non-Monotonie Logics for Strict Inertia, Journal of Logic and Computation 4(5):581-616 (1994).
51. Scherl, R. and Levesque, H., The Frame Problem and Knowledge Producing Actions, in: AAAI 93, 1993, pp. 689-695.
52. Thielscher, M., An Analysis of Systematic Approaches to Reasoning about Actions and Change, Unpublished manuscript, 1994.
53. Turner, H., Signed Logic Programs, in: Proceedings of ISLP, 1994, pp. 61-75.
54. Watson, R., An Inference Engine for Epistemic Specifications, M.S Thesis, Department of Computer Science, University of Texas at El Paso. 1994.
55. Warren, D. S. and Chen, W., Query Evaluation under Well-Founded Semantics, in: Proceedings of PODS 93, 1993.