The following pages link to The Description Logic Handbook (Q5309957):
Displaying 50 items.
- Extracting unsatisfiable cores for LTL via temporal resolution (Q266863) (← links)
- Tractable extensions of the description logic \({\mathcal{EL}}\) with numerical datatypes (Q438566) (← links)
- Consistency reasoning in lattice-based fuzzy description logics (Q465592) (← links)
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions (Q477206) (← links)
- Consequence-based and fixed-parameter tractable reasoning in description logics (Q490523) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- From description-logic programs to multi-context systems (Q516031) (← links)
- Algorithms for reasoning in very expressive description logics under infinitely valued Gödel semantics (Q518606) (← links)
- Semantic decision making using ontology-based soft sets (Q552135) (← links)
- A description logic based situation calculus (Q604908) (← links)
- Interval-valued intuitionistic fuzzy soft sets and their properties (Q611388) (← links)
- Algebraic tableau reasoning for the description logic \(\mathcal{SHOQ}\) (Q631080) (← links)
- Local closed world reasoning with description logics under the well-founded semantics (Q646502) (← links)
- Semantic operations of multiple soft sets under conflict (Q660826) (← links)
- Tractability and intractability of controlled languages for data access (Q692195) (← links)
- Cut-free Gentzen calculus for multimodal CK (Q764259) (← links)
- The loop formula based semantics of description logic programs (Q764312) (← links)
- Representing ontologies using description logics, description graphs, and rules (Q840831) (← links)
- On updates of hybrid knowledge bases composed of ontologies and rules (Q900304) (← links)
- Automata can show PSpace results for description logics (Q948069) (← links)
- The logicist manifesto: At long last let logic-based artificial intelligence become a field unto itself (Q959049) (← links)
- Extending soft sets with description logics (Q980132) (← links)
- Deciding inseparability and conservative extensions in the description logic (Q1041590) (← links)
- Problems of constructing intelligent systems. Levels of intelligence (Q1616247) (← links)
- A note on a description logic of concept and role typicality for defeasible reasoning over ontologies (Q1632047) (← links)
- OWL reasoning: subsumption test hardness and modularity (Q1655485) (← links)
- Three-valued semantics for hybrid MKNF knowledge bases revisited (Q1677437) (← links)
- Reasoning in fuzzy description logics using automata (Q1677933) (← links)
- The complexity of fuzzy \(\mathcal{EL}\) under the Łukasiewicz t-norm (Q1679661) (← links)
- Approximate classification with web ontologies through evidential terminological trees and forests (Q1687300) (← links)
- The OWL reasoner evaluation (ORE) 2015 competition report (Q1694573) (← links)
- Reactive multi-context systems: heterogeneous reasoning in dynamic environments (Q1748467) (← links)
- Concept learning in description logics using refinement operators (Q1959551) (← links)
- Adding the power-set to description logics (Q1989328) (← links)
- A logic for diffusion in social networks (Q2018607) (← links)
- Fudge: fuzzy ontology building with consensuated fuzzy datatypes (Q2035314) (← links)
- Representation, analysis, and extraction of knowledge from unstructured natural language texts (Q2044053) (← links)
- ReAD: AD-based modular ontology classification (Q2055795) (← links)
- Tractable reasoning using logic programs with intensional concepts (Q2055806) (← links)
- Memory-limited model-based diagnosis (Q2124447) (← links)
- On the KLM properties of a fuzzy DL with typicality (Q2146055) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- Open-world probabilistic databases: semantics, algorithms, complexity (Q2238646) (← links)
- Contextual rational closure for defeasible \(\mathcal{ALC} \) (Q2278101) (← links)
- Problems of constructing intelligent systems. Knowledge representation (Q2281345) (← links)
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog (Q2302291) (← links)
- A formal model of semantic computing (Q2318288) (← links)
- Maintenance of datalog materialisations revisited (Q2321273) (← links)
- A PSpace algorithm for acyclic epistemic DL \(\mathcal{ALCS}5_m\) (Q2323444) (← links)
- Typicalities and probabilities of exceptions in nonmotonic description logics (Q2329599) (← links)