Combining Horn rules and description logics in CARIN
Reads0
Chats0
TLDR
It is shown that in general, the reasoning problem for recursive carin - A LCNR knowledge bases is undecidable, and the constructors of ALCNR causing the undecidability is identified.About:
This article is published in Artificial Intelligence.The article was published on 1998-09-01 and is currently open access. It has received 401 citations till now. The article focuses on the topics: Knowledge representation and reasoning & Description logic.read more
Citations
More filters
Proceedings ArticleDOI
Data integration: a theoretical perspective
TL;DR: The tutorial is focused on some of the theoretical issues that are relevant for data integration: modeling a data integration application, processing queries in data integration, dealing with inconsistent data sources, and reasoning on queries.
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.
Proceedings ArticleDOI
Data integration: the teenage years
Journal ArticleDOI
Query Answering for OWL-DL with rules
TL;DR: A decidable combination of OWL-DL and function-free Horn rules where rules are required to be DL-safe: each variable in the rule is required to occur in a non-DL-atom in therule body.
Journal ArticleDOI
The DL-lite family and relations
TL;DR: This article carries out a thorough and systematic investigation of inference in extensions of the original DL-Lite logics along five axes, by adding the Boolean connectives and number restrictions to concept constructs and adopting or dropping the unique name assumption.
References
More filters
Book ChapterDOI
Datalog and Description Logics: Expressive Power
TL;DR: It is shown that relatively simple hybrid languages are able to define all finite structures expressed by skolemized universally quantified second-order formulae with some constraints on the quantified predicates.
Journal ArticleDOI
The implication and finite implication problems for typed template dependencies
TL;DR: It is shown that the implication and the finite implication problems for this class are unsolvable, and an immediate corollary is that this class has no universe-bounded formal system for either implication or finite implication.
Proceedings ArticleDOI
The inference problem for template dependencies
Yuri Gurevich,Harry R. Lewis +1 more
TL;DR: It is here shown that the inference problem for template dependencies is undecidable, that is, there can be no algorithm for determining whether a given dependency is a logical consequence of a given finite set of dependencies.
Proceedings Article
A principled approach to reasoning about the specificity of rules
TL;DR: An implemented pattern classification algorithm is described that improves the efficiency of the search process by deducing implicit conditions logically implied by a pattern and by reducing the search space using subsumption relationships between predicates.
Book ChapterDOI
Combining Terminological and Rule-based Reasoning for Abstraction Processes
Philipp Hanschke,Knut Hinkelmann +1 more
TL;DR: The paper demonstrates the relevance of these issues in an analysis of a mechanical engineering application and suggests an integration of a forward-chaining rule system with a terminological logic as a solution to these problems.