Pages that link to "Item:Q877890"

The following pages link to A tableau algorithm for description logics with concrete domains and general TBoxes (Q877890):

Displaying 18 items.

• Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints (Q269503) (← links)
• Querying incomplete information in RDF with SPARQL (Q286403) (← links)
• Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
• An algebraic view on p-admissible concrete domains for lightweight description logics (Q2055793) (← links)
• Using model theory to find decidable and tractable description logics with concrete domains (Q2090131) (← links)
• Description logics with concrete domains and general concept inclusions revisited (Q2096462) (← links)
• Collective singleton-based consistency for qualitative constraint networks: theory and practice (Q2334596) (← links)
• Reasoning over Vague Concepts (Q2814378) (← links)
• Tableaux with Global Caching for Checking Satisfiability of a Knowledge Base in the Description Logic $\mathcal{SH}$ (Q3052749) (← links)
• (Q3408128) (← links)
• Generalized Qualitative Spatio-Temporal Reasoning: Complexity and Tableau Method (Q3455761) (← links)
• A General Tableau Method for Deciding Description Logics, Modal Logics and Related First-Order Fragments (Q3541702) (← links)
• (Q4539598) (← links)
• (Q4576256) (← links)
• Matching in the Description Logic FL0 with respect to General TBoxes (Q5222946) (← links)
• Efficient TBox Reasoning with Value Restrictions using the <i>wer</i> Reasoner (Q6063879) (← links)
• Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
• First steps towards taming description logics with strings (Q6545544) (← links)