95 search results - page 6 / 19 » The Complexity of Conjunctive Query Answering in Expressive ... |
DLOG
2007
13 years 10 months ago
2007
Abstract. Conjunctive query answering is an important DL reasoning task. Although this task is by now quite well-understood, tight complexity bounds for conjunctive query answering...
PVLDB
2010
13 years 6 months ago
2010
Ontology-based data access is a powerful form of extending database technology, where a classical extensional database (EDB) is enhanced by an ontology that generates new intensio...
SEMWEB
2009
Springer
14 years 5 days ago
2009
Springer
Scalable query answering over Description Logic (DL) based ontologies plays an important role for the success of the Semantic Web. Towards tackling the scalability problem, we prop...
AAAI
2012
11 years 10 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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
An answer to a query has a well-defined lineage expression (alternatively called how-provenance) that explains how the answer was derived. Recent work has also shown how to comput...