443 search results - page 6 / 89 » SAT-Based Answer Set Programming |
NMR
2004
Springer
15 years 2 months ago
2004
Springer
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
165
Voted
ICLP
2009
Springer
15 years 10 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...
AUSAI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
WILF
2009
Springer
15 years 4 months ago
2009
Springer
A number of generalizations of answer set programming have been proposed in the literature to deal with vagueness, uncertainty, and partial rule satisfaction. We introduce a unifyi...
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...