Sciweavers

24 search results - page 3 / 5
» Disjunctive Bottom Set and Its Computation
Sort
View
AAAI
2004
13 years 8 months ago
SAT-Based Answer Set Programming
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
CORR
2002
Springer
187views Education» more  CORR 2002»
13 years 6 months ago
Answer Sets for Consistent Query Answering in Inconsistent Databases
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki
DKE
2010
167views more  DKE 2010»
13 years 6 months ago
The consistency extractor system: Answer set programs for consistent query answering in databases
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...
Mónica Caniupán Marileo, Leopoldo E....
ANOR
2005
131views more  ANOR 2005»
13 years 6 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas
AI
2005
Springer
13 years 6 months ago
On the consistency of cardinal direction constraints
We present a formal model for qualitative spatial reasoning with cardinal directions utilizing a co-ordinate system. Then, we study the problem of checking the consistency of a se...
Spiros Skiadopoulos, Manolis Koubarakis