Model-theoretic inseparability and modularity of description logic ontologies
TLDR
This paper discusses notions of modules of a TBox based on model-theoretic inseparability and develop algorithms for extracting minimal modules from acyclic TBoxes and provides an experimental evaluation of the module extraction algorithm.About:
This article is published in Artificial Intelligence.The article was published on 2013-10-01 and is currently open access. It has received 84 citations till now. The article focuses on the topics: Description logic & Logical equivalence.read more
Citations
More filters
Journal ArticleDOI
Module extraction in expressive ontology languages via datalog reasoning
TL;DR: This paper proposes a novel approach in which module extraction is reduced to a reasoning problem in datalog, which generalises existing approximations in an elegant way and allows extraction of modules that are tailored to preserve only specific kinds of entailments, and thus are often significantly smaller.
Journal ArticleDOI
A Brief Survey on Forgetting from a Knowledge Representation and Reasoning Perspective
TL;DR: This paper collects and surveys approaches to forgetting in the field of knowledge representation and reasoning, highlighting their roles in diverse tasks of knowledge processing, and elaborating on common techniques.
Proceedings Article
The ultimate guide to forgetting in answer set programming
TL;DR: This work thoroughly examines existing properties and (classes of) operators for forgetting in ASP, drawing a complete picture, which includes many novel (even surprising) results on relations between properties and operators.
Journal ArticleDOI
Query and predicate emptiness in ontology-based data access
TL;DR: This paper determines the computational complexity of query emptiness and predicate emptiness in the EL, DL-Lite, and ALC-families of description logics, investigates the connection to ontology modules, and performs a practical case study to evaluate the new reasoning services.
Book ChapterDOI
Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey
Elena Botoeva,Boris Konev,Carsten Lutz,Vladislav Ryzhikov,Frank Wolter,Michael Zakharyaschev +5 more
TL;DR: In this article, the authors survey results on various notions of inseparability in the context of description logic ontologies, discuss their applications, useful model-theoretic characterizations, algorithms for determining whether two ontologies are inseparable (and, sometimes, for computing the difference between them if they are not), and the computational complexity of this problem.
References
More filters
BookDOI
The Description Logic Handbook: Theory, Implementation and Applications
TL;DR: The Description Logic Handbook as mentioned in this paper provides a thorough account of the subject, covering all aspects of research in this field, namely: theory, implementation, and applications, and can also be used for self-study or as a reference for knowledge representation and artificial intelligence courses.
Journal ArticleDOI
Pellet: A practical OWL-DL reasoner
TL;DR: Pellet is the first sound and complete OWL-DL reasoner with extensive support for reasoning with individuals, user-defined datatypes, and debugging support for ontologies.
Journal ArticleDOI
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
TL;DR: It is shown that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in thesize of the ABox, which is the first result ofPolynomial-time data complexity for query answering over DL knowledge bases.
Web Ontology Language: OWL
TL;DR: This chapter analyses the limitations of RDF Schema and derive requirements for a richer Web Ontology Language, and describes the three-layered architecture of the OWL language.
Proceedings Article
Pushing the EL envelope
TL;DR: This work identifies a set of expressive means that can be added to EL without sacrificing tractability, and shows that basically all other additions of typical DL constructors to EL with GCIs make subsumption intractable, and in most cases even EXPTIME-complete.