30 search results - page 4 / 6 » Solving Max-SAT as Weighted CSP |
CP
2007
Springer
13 years 12 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
AAAI
2006
13 years 7 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
IAT
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
AI
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...
DLOG
2011
12 years 9 months ago
2011
Abstract. For a number of problems, such as ontology learning or image labeling, we need to handle uncertainty and inconsistencies in an appropriate way. Fuzzy and Probabilistic De...