Automata can show PSpace results for description logics
DOI10.1016/J.IC.2008.03.006zbMATH Open1149.68073OpenAlexW2111351089WikidataQ57383699 ScholiaQ57383699MaRDI QIDQ948069FDOQ948069
Authors: Franz Baader, Rafael Peñaloza, Jan Hladík 
Publication date: 8 October 2008
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.03.006
Recommendations
Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Logic in artificial intelligence (68T27)
Cites Work
- Modal logic
- Relationships between nondeterministic and deterministic tape complexities
- The Description Logic Handbook
- Attributive concept descriptions with complements
- Automata-theoretic techniques for modal logics of programs
- Terminological reasoning is inherently intractable
- Title not available (Why is that?)
- Optimizing description logic subsumption
- Title not available (Why is that?)
- An overview of tableau algorithms for description logics
- Proof methods for modal and intuitionistic logics
- Title not available (Why is that?)
- How to optimize proof-search in modal logics
- Title not available (Why is that?)
Cited In (7)
- An automata view to goal-directed methods
- Reasoning in fuzzy description logics using automata
- Presburger Büchi tree automata with applications to logics with expressive counting
- Automata-based axiom pinpointing
- PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\)
- Automata-Based Axiom Pinpointing
- The complexity of computing the behaviour of lattice automata on infinite trees
Uses Software
This page was built for publication: Automata can show PSpace results for description logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948069)
