443 search results - page 46 / 89 » SAT-Based Answer Set Programming |
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...
DALT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper we revisit Logic Programming under the answer-set semantics - or Answer-Set Programming - and its extension Evolving Logic Programming, two languages that u...
RULEML
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
SLP
1994
13 years 9 months ago
1994
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...