The following pages link to (Q4012244):
Displaying 50 items.
- ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching (Q352943) (← links)
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots (Q414848) (← links)
- On finitely-valued fuzzy description logics (Q465589) (← links)
- Algorithms for reasoning in very expressive description logics under infinitely valued Gödel semantics (Q518606) (← links)
- On the failure of the finite model property in some fuzzy description logics (Q549343) (← links)
- A description logic based situation calculus (Q604908) (← links)
- Combining interval-based temporal reasoning with general TBoxes (Q814545) (← links)
- \({\mathcal E}\)-connections of abstract description systems (Q814594) (← links)
- On the undecidability of logics with converse, nominals, recursion and counting (Q814615) (← links)
- Decidability of SHIQ with complex role inclusion axioms (Q814639) (← links)
- Arthur Prior and hybrid logic (Q857663) (← links)
- Symmetric blocking (Q897931) (← links)
- Deciding expressive description logics in the framework of resolution (Q924723) (← links)
- Automata can show PSpace results for description logics (Q948069) (← links)
- A formal framework for description logics with uncertainty (Q962955) (← links)
- A modal perspective on the computational complexity of attribute value grammar (Q1314274) (← links)
- On the expressivity of feature logics with negation, functional uncertainty, and sort equations (Q1314281) (← links)
- Towards automating duality (Q1343394) (← links)
- The complexity of concept languages (Q1363785) (← links)
- Using automata theory for characterizing the semantics of terminological cycles (Q1380409) (← links)
- EXPtime tableaux for ALC (Q1589576) (← links)
- Expressiveness of concept expressions in first-order description logics (Q1606296) (← links)
- A note on a description logic of concept and role typicality for defeasible reasoning over ontologies (Q1632047) (← links)
- Reasoning in fuzzy description logics using automata (Q1677933) (← links)
- On the relationship between fuzzy description logics and many-valued modal logics (Q1726404) (← links)
- Combining deduction and model checking into tableaux and algorithms for converse-PDL. (Q1854371) (← links)
- Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\). (Q1854375) (← links)
- Tractable reasoning via approximation (Q1855213) (← links)
- Adding the power-set to description logics (Q1989328) (← links)
- Enhancing probabilistic model checking with ontologies (Q2065528) (← 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)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog (Q2302291) (← links)
- ExpTime tableaux with global caching for hybrid PDL (Q2303231) (← links)
- A prover dealing with nominals, binders, transitivity and relation hierarchies (Q2303237) (← links)
- \(\mathrm{K}_{\mathrm S}\mathrm{P}\) a resolution-based theorem prover for \({\mathsf{K}}_n\): architecture, refinements, strategies and experiments (Q2303247) (← 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)
- ABox abduction in the description logic \(\mathcal{ALC}\) (Q2429984) (← links)
- Modal definability of first-order formulas with free variables and query answering (Q2446543) (← links)
- A logical framework for privacy-preserving social network publication (Q2447175) (← links)
- Reasoning on UML class diagrams (Q2457652) (← links)
- A tableau decision procedure for \(\mathcal{SHOIQ}\) (Q2462647) (← links)
- The complexity of finite model reasoning in description logics (Q2486582) (← links)
- Ontological aspects of the implementation of norms in agent-based electronic institutions (Q2509084) (← links)
- Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition (Q2817938) (← links)
- Hybrid Logics and Ontology Languages (Q2867944) (← links)
- Decidable Description Logics of Context with Rigid Roles (Q2964450) (← links)
- Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics (Q2964452) (← links)
