In this paper we consider the problem of answering queries using views, with or without ontological constraints, which is important for data integration, query optimization, and d...
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
Consistent query answering is the term commonly used for the problem of answering queries on databases that violate certain integrity constraints. We address this problem for univ...
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...