On the range of applicability of baker's approach to the frame problem

Authors:
G. Neelakantan Kartha
Affiliations:
Honeywell Technology Center, Minneapolis, Minnesota
Venue:
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Year:
1996

Citing 10
Cited 2

Applications of circumscription to formalizing common-sense knowledge

Artificial Intelligence
Nonmonotonic logic and temporal projection

Artificial Intelligence
Combining logic and differential equations for describing real-world systems

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Nonmonotonic reasoning in the framework of situation calculus

Artificial Intelligence - Special issue on knowledge representation
The frame problem in situation the calculus: a simple solution (sometimes) and a completeness result for goal regression

Artificial intelligence and mathematical theory of computation
Representing actions in logic programming and its applications in database updates

ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Circumscription

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Two counterexamples related to Baker's approach to the frame problem

Artificial Intelligence
Representing incomplete knowledge in abductive logic programming

ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Soundness and completeness theorems for three formalizations of action

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1

Interpolation Properties of Action Logic: Lazy-Formalization to the Frame Problem

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Encoding Solutions of the Frame Problem in Dynamic Logic

LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the range of applicability of Baker's approach to the frame problem using an action language. We show that for temporal projection and deterministic domains, Baker's approach gives the intuitively expected results.