Complexity of Planning in Action Formalisms Based on Description Logics

DOI10.1007/978-3-540-75560-9_30zbMATH Open1137.68594OpenAlexW1585688349MaRDI QIDQ3498484FDOQ3498484

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Relationships between nondeterministic and deterministic tape complexities
• The computational complexity of propositional STRIPS planning
• Title not available (Why is that?)
• Terminological reasoning is inherently intractable
• Reasoning About Actions Using Description Logics with General TBoxes
• SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
• Complexity, decidability and undecidability results for domain-independent planning

Cited In (14)

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

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)