Sciweavers

977 search results - page 19 / 196
» Logic programming with infinite sets
Sort
View
LPNMR
2007
Springer
14 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
WLP
2007
Springer
14 years 3 months ago
spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics
Answer-set programming (ASP) is an emerging logic-programming paradigm that strictly separates the description of a problem from its solving methods. Despite its semantic elegance,...
Martin Gebser, Jörg Pührer, Torsten Scha...
ICLP
1991
Springer
14 years 1 months ago
{log}: A Logic Programming Language with Finite Sets
An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operati...
Agostino Dovier, Eugenio G. Omodeo, Enrico Pontell...
LPNMR
2004
Springer
14 years 3 months ago
Set Constraints in Logic Programming
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
V. Wiktor Marek, Jeffrey B. Remmel
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 9 months ago
Justifications for Logic Programs under Answer Set Semantics
The paper introduces the notion of off-line justification for Answer Set Programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom w.r.t. a ...
Enrico Pontelli, Tran Cao Son, Omar El-Khatib