247 search results - page 9 / 50 » Stable models and an alternative logic programming paradigm |
103
click to vote
AI
2001
Springer
15 years 1 months ago
2001
Springer
The stable semantics has become a prime candidate for knowledge representation and reasoning. The rules associated with propositional logic programs and the stable semantics are no...
86
Voted
IJCAI
2007
14 years 11 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 3 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, ...
LPNMR
2001
Springer
15 years 2 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 ...
62
Voted
WLP
2005
Springer
15 years 3 months ago
2005
Springer
Assigning semantics to logic programs via selector generated models (Schwarz 2002/2003) extends several semantics, like the stable, the inflationary, and the stable generated sema...