Local Consistency in Weighted CSPs and Inference in Max-SAT

DOI10.1007/11564751_87zbMath1153.68463OpenAlexW1584049867MaRDI QIDQ3524230

Javier Larrosa, Federico Heras

Publication date: 9 September 2008

Published in: Principles and Practice of Constraint Programming - CP 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11564751_87

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (12)

A logical approach to efficient Max-SAT solving ⋮ A Preprocessor for Max-SAT Solvers ⋮ Virtual pairwise consistency in cost function networks ⋮ Approximate Counting with Deterministic Guarantees for Affinity Computation ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ Exploiting subproblem optimization in SAT-based maxsat algorithms ⋮ A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem ⋮ Exploiting Cycle Structures in Max-SAT ⋮ Resolution for Max-SAT ⋮ ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver ⋮ Iterative and core-guided maxsat solving: a survey and assessment ⋮ A proof builder for Max-SAT

This page was built for publication: Local Consistency in Weighted CSPs and Inference in Max-SAT