An Introduction to Description Logic
From MaRDI portal
Publication:2974769
DOI10.1017/9781139025355zbMath1373.68002OpenAlexW4244275182WikidataQ59410604 ScholiaQ59410604MaRDI QIDQ2974769
Franz Baader, Uli Sattler, Carsten Lutz, Ian Horrocks
Publication date: 11 April 2017
Full work available at URL: https://doi.org/10.1017/9781139025355
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Logic in artificial intelligence (68T27) Knowledge representation (68T30)
Related Items (55)
Towards World Identification in Description Logics ⋮ Combining event calculus and description logic reasoning via logic programming ⋮ A note on a description logic of concept and role typicality for defeasible reasoning over ontologies ⋮ A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) ⋮ An Occurrence Description Logic ⋮ A tetrachotomy of ontology-mediated queries with a covering axiom ⋮ Unnamed Item ⋮ Querying the Unary Negation Fragment with Regular Path Expressions. ⋮ Optimal fixed-premise repairs of \(\mathcal{E}\mathcal{L}\) TBoxes ⋮ The Probabilistic Description Logic ⋮ Completing the Picture: Complexity of Graded Modal Logics with Converse ⋮ Efficient TBox Reasoning with Value Restrictions using the wer Reasoner ⋮ Temporal Minimal-World Query Answering over Sparse ABoxes ⋮ Answer Counting under Guarded TGDs ⋮ The notion of abstraction in ontology-based data management ⋮ Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions ⋮ Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies ⋮ Mining ℰℒ⊥ Bases with Adaptable Role Depth ⋮ Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments ⋮ Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests ⋮ Extending the description logic \(\mathcal{EL}\) with threshold concepts induced by concept measures ⋮ Presburger Büchi tree automata with applications to logics with expressive counting ⋮ Combining UML and ontology: an exploratory survey ⋮ A short introduction to SHACL for logicians ⋮ Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics ⋮ Pay-as-you-go consequence-based reasoning for the description logic \(\mathcal{SROIQ} \) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Statistical \(\mathcal{EL}\) is \textsc{ExpTime}-complete ⋮ Consistent query answering for primary keys in Datalog ⋮ Conjunctive query pattern structures: a relational database model for formal concept analysis ⋮ Most specific consequences in the description logic \(\mathcal{E} \mathcal{L} \) ⋮ Unnamed Item ⋮ Exploiting forwardness: satisfiability and query-entailment in forward guarded fragment ⋮ An algebraic view on p-admissible concrete domains for lightweight description logics ⋮ ReAD: AD-based modular ontology classification ⋮ Finding good proofs for description logic entailments using recursive quality measures ⋮ Computing optimal repairs of quantified ABoxes w.r.t. static \(\mathcal{EL}\) TBoxes ⋮ The Fusemate logic programming system ⋮ KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS ⋮ Enhancing probabilistic model checking with ontologies ⋮ \texttt{OWL2Vec}*: embedding of OWL ontologies ⋮ Strong inconsistency ⋮ An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,׆ ⋮ Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols ⋮ Using model theory to find decidable and tractable description logics with concrete domains ⋮ Towards Contingent World Descriptions in Description Logics ⋮ Logical separability of labeled data examples under ontologies ⋮ Deciding the word problem for ground identities with commutative and extensional symbols ⋮ Description logics with concrete domains and general concept inclusions revisited ⋮ Connection-minimal abduction in \(\mathcal{EL}\) via translation to FOL ⋮ Evonne: interactive proof visualization for description logics (system description) ⋮ Actions over core-closed knowledge bases ⋮ First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries ⋮ Omitting types theorem in hybrid dynamic first-order logic with rigid symbols
This page was built for publication: An Introduction to Description Logic
