97 search results - page 7 / 20 » Computing Stable and Partial Stable Models of Extended Disju... |
CORR
2002
Springer
13 years 8 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...
LPNMR
2005
Springer
14 years 2 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, ...
EPIA
2005
Springer
14 years 2 months ago
2005
Springer
This paper introduces an original 2-valued semantics for Normal Logic Programs (NLP), which conservatively extends the Stable Model semantics (SM) to all normal programs. The dist...
AMAI
2006
Springer
13 years 8 months ago
2006
Springer
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
LPNMR
1993
Springer
14 years 20 days ago
1993
Springer
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...