4586 search results - page 1 / 918 » Computing stable models in parallel |
ASP
2001
Springer
13 years 9 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...
CONCUR
2006
Springer
13 years 8 months ago
2006
Springer
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...
ICDCS
2007
IEEE
13 years 8 months ago
2007
IEEE
We consider a model for decentralized collaborative networks that is based on stable matching theory. This model is applied to systems with a global ranking utility function, whic...
NMELP
1994
13 years 8 months ago
1994
In Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics dened originally by Gelfond and Lifschitz G...
AAAI
1990
13 years 5 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...