5 search results - page 1 / 1 » A competitive and cooperative approach to propositional sati... |
DAM
2006
13 years 5 months ago
2006
COMBINATORICS
2004
13 years 4 months ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
ITSSA
2006
13 years 4 months ago
2006
: Stakeholder search is a general framework for an extension to the improving on the competition approach paradigm for cooperative search that allows for additional individual goal...
AAAI
2000
13 years 6 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
CP
2006
Springer
13 years 8 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...