247 search results - page 8 / 50 » Stable models and an alternative logic programming paradigm |
ASP
2005
Springer
15 years 3 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...
77
Voted
ICLP
2001
Springer
15 years 2 months ago
2001
Springer
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
LPNMR
2007
Springer
15 years 3 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...
AMAI
2008
Springer
14 years 9 months ago
2008
Springer
In a previous paper [BMR01], the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets o...
85
Voted
CORR
2002
Springer
14 years 9 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...