|
ABSTRACT
We investigate logical formalization of the effects of actions in the situation calculus. We propose a formal criterion against which to evaluate theories of deterministic actions. We show how the criterion provides us a formal foundation upon which to tackle the frame problem, as well as its variant in the context of concurrent actions. Our main technical contributions are in formulating a wide class of monotonic causal theories that satisfy the criterion, and showing that each such theory can be reformulated succinctly in circumscription.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
~BAKER, m. B., AND GINSBERG, M. L. 1989. Temporal projection and explanation. In Proceedings' ~of the llth h, ternational Joint Conference on Artificial hztelligence (IJCAI-89). Morgan- ~Kaufmann, San Mateo, Calif., pp. 906-911.
|
| |
3
|
~CLARK, K. L. 1978. Negation as failure. In Logics and Databases, H. Gallaire and J. Minker, eds. ~Plenum Press, New York, pp. 293-322.
|
| |
4
|
~GELFOND, M., L~FSCHrrZ, V., AND RABINOV, A. 1991. What are the limitations of the situation ~calculus? In Working Notes of ttle AAAI Spring Symposium on the Logical Formalizations of ~Comrnonsense (Stanford, Calif.). AAAI Press, Menlo Park, Calif., pp. 59-69.
|
| |
5
|
~GEORGEFF, M. P. 1986. The representation of events in multiagent domains. In Proceedings of ~the 5th National Conference on Artificial Intelligence ( AAAI-86) (Philadelphia, Pa.). AAAI Press, ~Menlo Park, Calif., pp. 70-75.
|
| |
6
|
|
| |
7
|
~HAUGH, B. 1987. Simple causal minimizations for temporal persistence and projection. In ~Proceedings of the 6th National Conference on Artificial Intelhgence (AAAI-87). AAAI Press, ~Menlo Park, Calif., pp. 218-233.
|
| |
8
|
~KAUTZ, H. 1986. The logic of persistence. In Proceedings of the 5th National Conference on ~Artificial Intelligence (AAAI-86). (Philadelphia, Pa.). AAAI Press, Menlo Park, Calif.
|
| |
9
|
~LIFSCHITZ, V. 1985, Computing circumscription. In Proceedings of the 9th International Joint ~Conference on Artificial Intelligence (IJCA1-85). Morgan-Kaufmann, San Mateo, Calif.
|
| |
10
|
~LIFSCHITZ, V. 1986. Pointwise circumscription. In Proceedings of the 5th National Conference on ~Artificial Intelligence (AAAI-86) (Philadelphia, Pa.). AAAI Press, Menlo Park, Calif., pp. ~406-410.
|
| |
11
|
~LIFSCHITZ, V. 1987a. Formal theories of action. In Proceedings of the lOth International Joint ~onference on A~:tificial Intelligence (IJCAI-87). Morgan-Kaufmann, San Mateo, Calif., pp. ~966-972.
|
| |
12
|
|
| |
13
|
|
| |
14
|
~LIFSCH1TZ, V. 1991. Toward a meta-theory of action. In Proceedings of the 2nd International ~Con)~erence on Princtples of Knowledge Representation and Reasoning (KR'91), J. Allen, R. Fikes, ~and E. Sandewall, eds. Morgan-Kaufmann, San Mateo, Calif., pp. 376-386.
|
| |
15
|
|
| |
16
|
~Louh R. 1987. Response to Hanks and McDermott: Temporal evolution of beliefs and beliefs ~about temporal evolution. Cogn. Sct. 11.
|
| |
17
|
|
| |
18
|
~MCCARTHY, J., AND HAYES, P. 1969. Some phdosophical problems from the standpoint of ~artificial intelligence. In Machme Intelligence, vol. 4, B. Meltzer and D. Michie, eds. Edinburgh ~Umversity Press, Edinburgh, England, pp. 463-502.
|
| |
19
|
~MORGENSTERN, L., AND STEIN, L. A. 1988. Why things go wrong: A formal theory of causal ~reasoning. In Proceedings of the 7th Nattonal Conference on Artificial Intelligence (AAAI-88). ~AAAI Press, Menlo Park, Calif. pp. 518-523.
|
| |
20
|
|
 |
21
|
|
| |
22
|
~RE~TER, R. 1978. On closed world data bases. In Logics and Data Bases, H. Gallaire and J. ~Minker, eds. Plenum Press, New York.
|
| |
23
|
~REITER, R. 1982. Circumscription implies predicate completion (sometimes). In Proceedmgs of ~AAAI-82. pp. 418-420.
|
| |
24
|
|
| |
25
|
~SCHUBERT, L. K. 1990. Monotonic solution to the frame problem in the situation calculus: an ~efficient method for worlds with fully specified actions. In Knowledge Representation and ~Defeasible Reasoning, H. Kyberg, R. Loui, and G. Carlson, eds. Kluwer Academic Press, Boston, ~Mass., pp. 23-67.
|
| |
26
|
|
| |
27
|
|
| |
28
|
~W~NSLETT, M. S. 1988. Reasoning about actions using a possible models approach. In Proceed- ~ings of the 7th National Conference on Artificial Intelligence ( AAAI-88). AAAI Press, Menlo Park, ~Calif.
|
REVIEW
"James Delgrande : Reviewer"
The authors investigate formalisms of causal theories of action. A
major difficulty in formulating such theories is in addressing the frame
problem, expressing the commonsense intuition that most
properties remain unaffected by an
more...
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE conference on Design automation
Gwo-Dong Chen
, Daniel D. Gajski
|