Sciweavers

611 search results - page 46 / 123
» The Cardinality Matrix Constraint
Sort
View
ICLP
2007
Springer
15 years 3 months ago
Generic Tableaux for Answer Set Programming
Abstract. We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs....
Martin Gebser, Torsten Schaub
EDBT
1992
ACM
79views Database» more  EDBT 1992»
15 years 1 months ago
Theoretical Aspects of Schema Merging
A general technique for merging database schemas is developed that has a number of advantages over existing techniques, the most important of which is that schemas are placed in a...
Peter Buneman, Susan B. Davidson, Anthony Kosky
EDBT
2009
ACM
145views Database» more  EDBT 2009»
15 years 1 months ago
Interactive query refinement
We investigate the problem of refining SQL queries to satisfy cardinality constraints on the query result. This has applications to the many/few answers problems often faced by da...
Chaitanya Mishra, Nick Koudas
AAAI
2008
15 years 1 days ago
A Reductive Semantics for Counting and Choice in Answer Set Programming
In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions...
Joohyung Lee, Vladimir Lifschitz, Ravi Palla
DEXAW
2006
IEEE
139views Database» more  DEXAW 2006»
14 years 11 months ago
Consistent Query Answering By Minimal-Size Repairs
A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering is the problem of computing from D the answers to a query that are consist...
Andrei Lopatenko, Leopoldo E. Bertossi