426 search results - page 2 / 86 » Possibilistic Stable Model Computing |
AAAI
1990
13 years 6 months ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
STACS
2012
Springer
12 years 9 days ago
2012
Springer
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
ISIPTA
1999
IEEE
13 years 9 months ago
1999
IEEE
We consider discrete possibilistic systems for which the available information is given by one-step transition possibilities and initial possibilities. These systems can be repres...
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
ICLP
1999
Springer
13 years 9 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...