Pages that link to "Item:Q4487262"

The following pages link to Practical reasoning for very expressive description logics (Q4487262):

Displaying 35 items.

• Tractable approximate deduction for OWL (Q274420) (← links)
• Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies (Q286087) (← links)
• ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching (Q352943) (← links)
• PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\) (Q352965) (← links)
• Algorithms for reasoning in very expressive description logics under infinitely valued Gödel semantics (Q518606) (← links)
• \({\mathcal E}\)-connections of abstract description systems (Q814594) (← links)
• On the undecidability of logics with converse, nominals, recursion and counting (Q814615) (← links)
• Semantic characterization of rational closure: from propositional logic to description logics (Q898736) (← links)
• Deciding expressive description logics in the framework of resolution (Q924723) (← links)
• Fuzzy description logics with general t-norms and datatypes (Q1043321) (← links)
• EXPtime tableaux for ALC (Q1589576) (← links)
• A loop-free decision procedure for modal propositional logics K4, S4 and S5 (Q2271187) (← links)
• Blocking and other enhancements for bottom-up model generation methods (Q2303239) (← links)
• Computing the least common subsumer w.r.t. a background terminology (Q2372193) (← links)
• Deciding unifiability and computing local unifiers in the description logic \(\mathcal{EL}\) without top constructor (Q2374390) (← links)
• A universal approach to guarantee data privacy (Q2392012) (← links)
• Reasoning in description logics by a reduction to disjunctive datalog (Q2462648) (← links)
• Decidable Description Logics of Context with Rigid Roles (Q2964450) (← links)
• Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics (Q2964452) (← links)
• The two‐variable fragment with counting and equivalence (Q3460527) (← links)
• How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited (Q3498475) (← links)
• Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse (Q3541703) (← links)
• Foundations of Onto-Relational Learning (Q3543274) (← links)
• Inductive Logic Programming in Databases: From <scp>Datalog</scp> to (Q3577712) (← links)
• Ontology Integration Using ε-Connections (Q3631364) (← links)
• Composing Modular Ontologies with Distributed Description Logics (Q3631365) (← links)
• A Correspondence between Temporal Description Logics (Q3643271) (← links)
• BDD-based decision procedures for the modal logic K ★ (Q3647260) (← links)
• Reasoning and Query Answering in Description Logics (Q4647812) (← links)
• Reasoning with Uncertain and Inconsistent OWL Ontologies (Q4647816) (← links)
• Unification in the Description Logic $\mathcal{EL}$ without the Top Concept (Q5200016) (← links)
• Automated Reasoning in $\mathcal{ALCQ}$ via SMT (Q5200031) (← links)
• LINEAR TIME IN HYPERSEQUENT FRAMEWORK (Q5346691) (← links)
• Towards World Identification in Description Logics (Q5882770) (← links)
• Semantic web (Q6602270) (← links)