Sciweavers

834 search results - page 6 / 167
» Computing Minimal Models, Stable Models, and Answer Sets
Sort
View
78
Voted
CASCON
2004
108views Education» more  CASCON 2004»
14 years 11 months ago
Consistent query answering under inclusion dependencies
For several reasons a database may not satisfy certain integrity constraints (ICs), for example, when it is the result of integrating several independent data sources. However, mo...
Loreto Bravo, Leopoldo E. Bertossi
LPNMR
2007
Springer
15 years 3 months ago
Head-Elementary-Set-Free Logic Programs
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
Martin Gebser, Joohyung Lee, Yuliya Lierler
PADL
2004
Springer
15 years 2 months ago
ASP-PROLOG: A System for Reasoning about Answer Set Programs in Prolog
We present a system (ASP − PROLOG) which provides a tight and well-defined integration of Prolog and Answer Set Programming (ASP). The combined system enhances the expressive po...
Omar El-Khatib, Enrico Pontelli, Tran Cao Son
LPNMR
1997
Springer
15 years 1 months ago
Computing Non-Ground Representations of Stable Models
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Thomas Eiter, James J. Lu, V. S. Subrahmanian
AAAI
2008
14 years 12 months 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