scientific article; zbMATH DE number 6902582
From MaRDI portal
Publication:4576256
Recommendations
- A tableau algorithm for description logics with concrete domains and general TBoxes
- Using model theory to find decidable and tractable description logics with concrete domains
- Reasoning About Actions Using Description Logics with General TBoxes
- scientific article; zbMATH DE number 2196595
- Description logics with concrete domains and general concept inclusions revisited
- Decidability of circumscribed description logics revisited
- A Decidable Constructive Description Logic
- scientific article; zbMATH DE number 2090284
- scientific article; zbMATH DE number 1980942
- Consequence-based and fixed-parameter tractable reasoning in description logics
Cited in
(13)- An algebraic view on p-admissible concrete domains for lightweight description logics
- Using model theory to find decidable and tractable description logics with concrete domains
- Description logics with concrete domains and general concept inclusions revisited
- scientific article; zbMATH DE number 1765661 (Why is no real title available?)
- Matching in the Description Logic FL0 with respect to General TBoxes
- Automated Reasoning with Analytic Tableaux and Related Methods
- Efficient TBox Reasoning with Value Restrictions using the wer Reasoner
- First steps towards taming description logics with strings
- Reasoning in OWL 2 EL with hierarchical concrete domains
- Concrete domains meet expressive cardinality restrictions in description logics
- Constraint automata on infinite data trees: from \(\mathrm{CTL}(\mathbb{Z})/\mathrm{CTL}^*(\mathbb{Z})\) to decision procedures
- Constraint automata on infinite data trees: from CTL\((\mathbb{Z})\text{CTL}^*(\mathbb{Z})\) to decision procedures
- A tableau algorithm for description logics with concrete domains and general TBoxes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576256)