scispace - formally typeset
Open AccessJournal ArticleDOI

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
Journal ArticleDOI

Answering queries using views: A KRDB perspective for the semantic Web

TL;DR: A first step towards the long-term vision of the Semantic Web is investigated by studying the problem of answering queries posed through a mediated ontology to multiple information sources whose content is described as views over the ontology relations.
Book ChapterDOI

Reasoning and Query Answering in Description Logics

TL;DR: This lecture discusses the knowledge modeling capabilities of some of the most prominent DLs, including expressive ones, and presents some DL reasoning services, and gives an overview of the computational complexity landscape.
Book ChapterDOI

Scalable End-User Access to Big Data

TL;DR: In this paper, the turnaround time for information requests is in the range of days, possibly weeks, due to the involvement of the IT personnel in the process of processing information requests.
Journal ArticleDOI

Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!

TL;DR: This work presents a decidability result for entailment of unions of conjunctive queries in the DL ALCHOIQb that contains all three problematic constructors simultaneously and believes that the presented results will pave the way for further progress towards conj unctive query entailment decision procedures for the Description Logics underlying the OWL standards.
Book ChapterDOI

First order paths in ordered trees

TL;DR: In this article, the authors give sufficient conditions on XPath-like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled tree is definable in that XPath language.
References
More filters

Lecture Notes in Artificial Intelligence

P. Brezillon, +1 more
TL;DR: The topics in LNAI include automated reasoning, automated programming, algorithms, knowledge representation, agent-based systems, intelligent systems, expert systems, machine learning, natural-language processing, machine vision, robotics, search systems, knowledge discovery, data mining, and related programming languages.
Book

Principles of database and knowledge-base systems

TL;DR: This book goes into the details of database conception and use, it tells you everything on relational databases from theory to the actual used algorithms.
Journal ArticleDOI

Attributive concept descriptions with complements

TL;DR: It is shown that deciding coherence and subsumption of such descriptions are PSPACE-complete problems that can be decided with linear space.
Proceedings ArticleDOI

Semistructured data

TL;DR: A number of issues surrounding semistructured data are covered: finding a concise formulation, building a sufficiently expressive language for querying and transformation, and optimizat,ion problems.
Book

Foundations of deductive databases and logic programming

TL;DR: This book discusses Negation in Logic Programming, a Theory of Declarative Knowledge, and its Applications in Deductive Databases and Implementation, as well as other topics.
Related Papers (5)