Sciweavers

83 search results - page 2 / 17
» Tractable Query Answering over Ontologies with Datalog -
Sort
View
CORR
2011
Springer
144views Education» more  CORR 2011»
13 years 8 days ago
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs
Abstract. We consider the setting of ontological database access, where an Abox is given in form of a relational database D and where a Boolean conjunctive query q has to be evalua...
Georg Gottlob, Thomas Schwentick
ESWS
2010
Springer
13 years 12 months ago
TrOWL: Tractable OWL 2 Reasoning Infrastructure
The Semantic Web movement has led to the publication of thousands of ontologies online. These ontologies present and mediate information and knowledge on the Semantic Web. Tools ex...
Edward Thomas, Jeff Z. Pan, Yuan Ren
AMW
2010
13 years 10 months ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris
DLOG
2011
13 years 1 days ago
On (In)Tractability of OBDA with OWL 2 QL
We show that, although conjunctive queries over OWL 2 QL ontologies are reducible to database queries, no algorithm can construct such a reduction in polynomial time without changi...
Stanislav Kikot, Roman Kontchakov, Michael Zakhary...
IJCAI
2003
13 years 10 months ago
Efficient Execution of Recursive Integration Plans
Information integration systems provide a uniform query interface to a set of sources. One of the key challenges for an information integration system is to provide maximally comp...
Snehal Thakkar, Craig A. Knoblock