A tableau algorithm for description logics with concrete domains and general TBoxes
DOI10.1007/S10817-006-9049-7zbMATH Open1113.68090OpenAlexW1975503364MaRDI QIDQ877890FDOQ877890
Authors: Carsten Lutz, Maja Miličić 
Publication date: 4 May 2007
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-006-9049-7
Recommendations
Knowledge representation (68T30) Logic in artificial intelligence (68T27) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)
Cites Work
- Title not available (Why is that?)
- Maintaining knowledge about temporal intervals
- Title not available (Why is that?)
- Many-dimensional modal logics: theory and applications
- Reasoning about temporal relations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combining interval-based temporal reasoning with general TBoxes
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- Title not available (Why is that?)
- Attributive concept descriptions with complements
- A description logic with transitive and inverse roles and role hierarchies
- Optimizing description logic subsumption
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mechanizing Mathematical Reasoning
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modal Logics of Topological Relations
- PSpace Reasoning with the Description Logic ALCF(D)
- Automated Reasoning with Analytic Tableaux and Related Methods
- Title not available (Why is that?)
Cited In (20)
- A General Tableau Method for Deciding Description Logics, Modal Logics and Related First-Order Fragments
- Efficient TBox Reasoning with Value Restrictions using the wer Reasoner
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
- Matching in the Description Logic FL0 with respect to General TBoxes
- Querying incomplete information in RDF with SPARQL
- Title not available (Why is that?)
- Automated Reasoning with Analytic Tableaux and Related Methods
- Constants and finite unary relations in qualitative constraint reasoning
- Reasoning over vague concepts
- Collective singleton-based consistency for qualitative constraint networks: theory and practice
- Solving infinite-domain CSPs using the patchwork property
- Title not available (Why is that?)
- An algebraic view on p-admissible concrete domains for lightweight description logics
- Description logics with concrete domains and general concept inclusions revisited
- Using model theory to find decidable and tractable description logics with concrete domains
- Title not available (Why is that?)
- Generalized qualitative spatio-temporal reasoning: complexity and tableau method
- A tableau algorithm for reasoning about concepts and similarity
- Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic $\mathcal{SH}$
- First steps towards taming description logics with strings
Uses Software
This page was built for publication: A tableau algorithm for description logics with concrete domains and general TBoxes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877890)
