Complexity of Planning in Action Formalisms Based on Description Logics
From MaRDI portal
Publication:3498484
DOI10.1007/978-3-540-75560-9_30zbMath1137.68594OpenAlexW1585688349MaRDI QIDQ3498484
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
Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
A family of dynamic description logics for representing and reasoning about actions ⋮ A description logic based situation calculus ⋮ Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
Cites Work
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
- The computational complexity of propositional STRIPS planning
- Complexity, decidability and undecidability results for domain-independent planning
- Relationships between nondeterministic and deterministic tape complexities
- Terminological reasoning is inherently intractable
- Reasoning About Actions Using Description Logics with General TBoxes
- Unnamed Item
- Unnamed Item
This page was built for publication: Complexity of Planning in Action Formalisms Based on Description Logics
