426 search results - page 5 / 86 » Possibilistic Stable Model Computing |
MFCS
1994
Springer
13 years 11 months ago
1994
Springer
AMAI
2008
Springer
13 years 7 months ago
2008
Springer
The paper studies the relationship between logic programs with the stable model semantics and difference logic recently considered in the Satisfiability Modulo Theories framework....
ALDT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...
LPNMR
2001
Springer
14 years 2 days ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
ICLP
2001
Springer
14 years 3 days 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...