Sciweavers

75 search results - page 7 / 15
» Reducing Query Answering to Satisfiability in Nonmonotonic L...
Sort
View
DLOG
2008
13 years 9 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
DBPL
2005
Springer
143views Database» more  DBPL 2005»
14 years 28 days ago
Inconsistency Tolerance in P2P Data Integration: An Epistemic Logic Approach
We study peer-to-peer ðP2PÞ data integration, where each peer models an autonomous system that exports data in terms of its own schema, and data interoperation is achieved by me...
Diego Calvanese, Giuseppe De Giacomo, Domenico Lem...
ICLP
2010
Springer
13 years 11 months ago
Dynamic Magic Sets for Disjunctive Datalog Programs
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...
Mario Alviano
DEXA
2007
Springer
131views Database» more  DEXA 2007»
14 years 1 months ago
Improving Semantic Query Answering
The retrieval problem is one of the main reasoning tasks for knowledge base systems. Given a knowledge base K and a concept C, the retrieval problem consists of finding all indivi...
Norbert Kottmann, Thomas Studer
LICS
2009
IEEE
14 years 2 months ago
Trichotomy in the Complexity of Minimal Inference
We study the complexity of the propositional minimal inference problem. Its complexity has been extensively studied before because of its fundamental importance in artificial int...
Arnaud Durand, Miki Hermann, Gustav Nordh