426 search results - page 4 / 86 » Possibilistic Stable Model Computing |
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, ...
120
click to vote
LPNMR
1997
Springer
15 years 3 months ago
1997
Springer
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
111
click to vote
ASP
2001
Springer
15 years 4 months ago
2001
Springer
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
AIMSA
2008
Springer
15 years 6 months ago
2008
Springer
102
click to vote
HIS
2004
15 years 1 months ago
2004
Many researchers have observed that neurons process information in an imprecise manner - if a logical inference emerges from neural computation, it is inexact at best. Thus, there...