Reasoning about action in polynomial time

DOI10.1016/S0004-3702(99)00065-XMaRDI QIDQ1978466zbMATH OpenFDO

Authors M. Bjäreland, Thomas Drakengren

Publication date 4 June 2000

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0004-3702(99)00065-X

zbMATH Keywords

computational complexitylogicreasoning about actiontemporal logic

Mathematics Subject Classification ID

General topics in artificial intelligence (68T01)

Recommendations

• Reasoning about actions in dynamic linear time temporal logic
• scientific article; zbMATH DE number 2243405
• Complexity of Planning in Action Formalisms Based on Description Logics
• The complexity of propositional linear temporal logics
• Reasoning about action. II: The qualification problem

Cites work

• scientific article; zbMATH DE number 1149445 (Why is no real title available?)
• scientific article; zbMATH DE number 774417 (Why is no real title available?)
• Reasoning about action in polynomial time
• Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning

Cited in

(5)

• Reasoning about nondeterministic and concurrent actions: A process algebra approach
• Reasoning about action in polynomial time
• Complexity of Planning in Action Formalisms Based on Description Logics
• An initial study of time complexity in infinite-domain constraint satisfaction
• Point algebras for temporal reasoning: Algorithms and complexity

This page was built for publication: Reasoning about action in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978466)