193 search results - page 3 / 39 » On the Progression Semantics and Boundedness of Answer Set P... |
LPNMR
2009
Springer
14 years 9 days ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
ICLP
2009
Springer
14 years 6 months ago
2009
Springer
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
DKE
2010
13 years 5 months ago
2010
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...
ASP
2005
Springer
13 years 11 months ago
2005
Springer
This paper discusses the background, algorithms and implementation techniques to support programmers in ‘debugging’ logic programs under the answer set semantics. We first inv...
AAAI
2008
13 years 8 months ago
2008
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...