140 search results - page 9 / 28 » Stable Models and Non-Determinism in Logic Programs with Neg... |
114
click to vote
ASP
2005
Springer
15 years 5 months ago
2005
Springer
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
102
click to vote
ICLP
2001
Springer
15 years 4 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
92
Voted
BIRTHDAY
2010
Springer
15 years 23 days 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...
101
click to vote
LPNMR
2007
Springer
15 years 5 months ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
94
Voted
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...