Complexity of Planning in Action Formalisms Based on Description Logics

DOI10.1007/978-3-540-75560-9_30MaRDI QIDQ3498484zbMATH OpenOpenAlexFDO

Authors Maja Miličić

Publication date 15 May 2008

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75560-9_30

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)

Recommendations

• Reasoning About Actions Using Description Logics with General TBoxes
• scientific article; zbMATH DE number 1249651
• scientific article; zbMATH DE number 67474
• Reasoning about action in polynomial time
• Initial steps towards a family of regular-like plan description logics

Cites work

• scientific article; zbMATH DE number 1936671 (Why is no real title available?)
• scientific article; zbMATH DE number 1820675 (Why is no real title available?)
• Complexity, decidability and undecidability results for domain-independent planning
• Reasoning About Actions Using Description Logics with General TBoxes
• Relationships between nondeterministic and deterministic tape complexities
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• Terminological reasoning is inherently intractable
• The computational complexity of propositional STRIPS planning

Cited in

(14)

• Initial steps towards a family of regular-like plan description logics
• How to Do Things with Worlds: on Formalizing Actions and Plans
• Applying the mu-calculus in planning and reasoning about action
• scientific article; zbMATH DE number 1759374 (Why is no real title available?)
• Complexity, decidability and undecidability results for domain-independent planning
• Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
• AI*IA 2005: Advances in Artificial Intelligence
• Reasoning about action in polynomial time
• Declarative formalization of reasoning strategies: A case study on heuristic nonlinear planning
• Possibilistic Planning Using Description Logics: A First Step
• A family of dynamic description logics for representing and reasoning about actions
• A description logic based situation calculus
• Decision-Theoretic Planning with Fuzzy Notions in GOLOG
• Reasoning About Actions Using Description Logics with General TBoxes

This page was built for publication: Complexity of Planning in Action Formalisms Based on Description Logics

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