Sciweavers

120 search results - page 22 / 24
» Disjunctive Logic Programming and Autoepistemic Logic
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
POPL
2010
ACM
14 years 4 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies
ICLP
1987
Springer
13 years 10 months ago
Near-Horn PROLOG
The Near-Horn Prolog procedures have been proposed as e ective procedures in the area of disjunctive logic programming, an extension of logic programming to the ( rstorder) non-Ho...
Donald W. Loveland
KI
2004
Springer
14 years 13 days ago
Model Based Deduction for Database Schema Reasoning
Abstract. We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query re...
Peter Baumgartner, Ulrich Furbach, Margret Gro&szl...