248 search results - page 7 / 50 » On the existence of stable models of non-stratified logic pr... |
CORR
2002
Springer
14 years 11 months ago
2002
Springer
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
104
click to vote
IJCAI
2007
15 years 1 months ago
2007
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
LPNMR
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
106
click to vote
LPNMR
2001
Springer
15 years 4 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
117
click to vote
WLP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...