Some Results on the Completeness of Approximation Based Reasoning

Authors:
Cao Son Tran;Enrico Pontelli
Affiliations:
Knowledge representation, Logic, and Advanced Programming Laboratory Computer Science Department, New Mexico State University, Las Cruces, USA NM 88003;Knowledge representation, Logic, and Advanced Programming Laboratory Computer Science Department, New Mexico State University, Las Cruces, USA NM 88003
Venue:
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Year:
2008

Citing 6
Cited 1

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
Computational complexity of planning and approximate planning in the presence of incompleteness

Artificial Intelligence
Formalizing sensing actions—a transition function based approach

Artificial Intelligence
Diagnostic reasoning with A-Prolog

Theory and Practice of 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
Tractable reasoning with incomplete first-order knowledge in dynamic systems with context-dependent actions

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

Approximation of action theories and its application to conformant planning

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two results relating the completeness condition of the 0-approximation for two formalisms: the action description language ${\mathcal A}$ and the situation calculus. The first result suggests that the condition for the situation calculus formalism implies the condition for the action language formalism. The second result indicates that an action theory in ${\mathcal A}$ can sometimes be simplified to an equivalent action theory whose completeness condition is weaker than the original theory for certain queries.