Reasoning about action in polynomial time

Authors:
Thomas Drakengren;Marcus Bjareland
Affiliations:
Department of Computer and Information Science, Linkoping University, Linkoping, Sweden;Department of Computer and Information Science, Linkoping University, Linkoping, Sweden
Venue:
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Year:
1997

Citing 7
Cited 2

Temporal reasoning with constraints on fluents and events

AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Features and fluents (vol. 1): the representation of knowledge about dynamical systems

Features and fluents (vol. 1): the representation of knowledge about dynamical systems
A really temporal logic

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Eight maximal tractable subclasses of Allen's algebra with metric time

Journal of Artificial Intelligence Research
Dependent fluents

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
A linear-programming approach to temporal reasoning

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Maximal tractable subclasses of Allen's interval algebra: preliminary report

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Expressive reasoning about action in nondeterministic polynomial time

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Causal theories of action: a computational core

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although many formalisms for reasoning about action exist, surprisingly few approaches have taken computational complexity into consideration. The contributions of this paper are the following: a temporal logic with a restriction for which deciding satisfiability is tractable, a tractable extension for reasoning about action, and NP-completeness results for the unrestricted problems. Many interesting reasoning problems can be modelled, involving nondeterminism, concurrency and memory of actions. The reasoning process is proved to be sound and complete.