83 search results - page 3 / 17 » Tractable Query Answering over Ontologies with Datalog - |
AAAI
2012
11 years 11 months ago
2012
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
Answering queries over ontologies is an important issue for the Semantic Web. Aggregate queries were widely studied for relational databases but almost no results are known for ag...
ICLP
2010
Springer
14 years 13 days ago
2010
Springer
Abstract. Answer set programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning that allows disjunction in rule heads and nonmonotonic negati...
SEMWEB
2009
Springer
14 years 3 months ago
2009
Springer
We present a query processing procedure for conjunctive queries in distributed ontology systems where a large ontology is divided into ontology fragments that are later distributed...
KR
2010
Springer
14 years 15 days ago
2010
Springer
The DL-Lite family of Description Logics has been designed with the specific goal of allowing for answering complex queries (in particular, conjunctive queries) over ontologies w...