KR
2010
Springer
13 years 10 months ago
2010
Springer
In this paper, we propose a progression semantics for firstorder answer set programs. Based on this new semantics, we are able to define the notion of boundedness for answer set p...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We show that global constraints on finite domains like alldifferent can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reform...
AAAI
2010
14 years 29 days ago
2010
An answer set program with variables is first-order definable on finite structures if the set of its finite answer sets can be captured by a first-order sentence, otherwise this p...
LPNMR
2009
Springer
14 years 7 months 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...
LOPSTR
2009
Springer
14 years 7 months ago
2009
Springer
Answer Set Programming (ASP) is a powerful paradigm of logic programming for non-monotonic reasoning. However, the restriction of “grounded range-restricted function-free normal ...