Expressive reasoning about action in nondeterministic polynomial time

Authors:
Thomas Drakengren;Marcus Bjareland
Affiliations:
-;Dept of Comp and Info Science, Linkoping University, Linkoping, Sweden
Venue:
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Year:
1999

Citing 4
Cited 0

Representing action: indeterminacy and ramifications

Artificial Intelligence
A really temporal logic

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Reasoning about action in polynomial time

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
A causal theory of ramifications and qualifications

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

The rapid development of efficient heuristics for deciding satisfiability for propositional logic motivates thorough investigations of the usability of NP-complete problems in general. In this paper we introduce a logic of action and change which is expressive in the sense that it can represent most propositional benchmark examples in the literature, and some new examples involving parallel composition of actions, and actions that may or may not be executed. We prove that satisfiability of a scenario in this logic is NP-complete, and that it subsumes an NP-complete logic (which in turn includes a nontrivial polynomial-time fragment) previously introduced by Drakengren and Bjareland.