An overview of tableau algorithms for description logics
From MaRDI portal
Recommendations
Cited in
(59)- A new methodology for developing deduction methods
- Modal logics, description logics and arithmetic reasoning
- Automated deduction techniques for classification in description logic systems
- A polynomial space construction of tree-like models for logics with local chains of modal connectives
- ExpTime tableaux with global caching for hybrid PDL
- Blocking and other enhancements for bottom-up model generation methods
- On the decidability status of fuzzy \(\mathcal {A}\mathcal {L}\mathcal {C}\) with general concept inclusions
- Formally verified tableau-based reasoners for a description logic
- HermiT: an OWL 2 reasoner
- Computing the least common subsumer w.r.t. a background terminology
- Reasoning on UML class diagrams
- Optimizing terminological reasoning for expressive description logics
- A tableau decision procedure for \(\mathcal{SHOIQ}\)
- A hybrid reasoning system for terminologies and first-order clauses in knowledge bases
- scientific article; zbMATH DE number 1612535 (Why is no real title available?)
- scientific article; zbMATH DE number 1612540 (Why is no real title available?)
- Hybrid logics and ontology languages
- Converse-PDL with regular inclusion axioms: a framework for MAS logics
- A conceptual framework for secrecy-preserving reasoning in knowledge bases
- Reasoning in expressive description logics under infinitely valued Gödel semantics
- Experimental analysis of some computation rules in a simple parallel reasoning system for the \(\mathcal{ALC}\) description logic
- On the proof theory of \({\mathcal{ALC}}\)
- On the undecidability of fuzzy description logics with GCIs and product t-norm
- Coupling tableau algorithms for expressive description logics with completion-based saturation procedures
- scientific article; zbMATH DE number 5674817 (Why is no real title available?)
- A Modal Supervaluation Description Logic for Characterization of Vague Concepts: its semantics and a tableau algorithm for it
- Modal tableau systems with blocking and congruence closure
- ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching
- PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\)
- Extending Carin to the Description Logics of the $\mathcal{SH}$ Family
- A General Tableau Method for Deciding Description Logics, Modal Logics and Related First-Order Fragments
- Automata-Based Axiom Pinpointing
- Individual Reuse in Description Logic Reasoning
- Ontology Integration Using ε-Connections
- Description Logics
- Ontologies and Databases: The DL-Lite Approach
- Combining description logics, description graphs, and rules
- Reasoning About Objects Using a Tableau Method
- A description logic with transitive and inverse roles and role hierarchies
- scientific article; zbMATH DE number 1149436 (Why is no real title available?)
- scientific article; zbMATH DE number 1980942 (Why is no real title available?)
- scientific article; zbMATH DE number 2063024 (Why is no real title available?)
- A sequent calculus for reasoning in four-valued description logics
- Consistency reasoning in lattice-based fuzzy description logics
- Consequence-based and fixed-parameter tractable reasoning in description logics
- Probabilistic DL reasoning with pinpointing formulas: a Prolog-based approach
- A tableau decision procedure for \(\mathcal{ALC}\) with monotonic modal operators and constant domains
- A tableau algorithm for reasoning about concepts and similarity
- A Tableau Calculus for Regular Grammar Logics with Converse
- Using tableau to decide description logics with full role negation and identity
- Efficient TBox Reasoning with Value Restrictions using the wer Reasoner
- An Optimized KE-Tableau-Based System for Reasoning in the Description Logic $${\mathcal {DL}}_{{\mathbf {D}}}^{4,\!\times }$$
- Algebraic tableau reasoning for the description logic \(\mathcal{SHOQ}\)
- Lightweight hybrid tableaux
- Automata-based axiom pinpointing
- ExpTime tableau decision procedures for regular grammar logics with converse
- Representing ontologies using description logics, description graphs, and rules
- Data complexity of query answering in expressive description logics via tableaux
- Automata can show PSpace results for description logics
This page was built for publication: An overview of tableau algorithms for description logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955620)
