Local Consistency in Weighted CSPs and Inference in Max-SAT
From MaRDI portal
Publication:3524230
DOI10.1007/11564751_87zbMath1153.68463MaRDI 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
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Approximate Counting with Deterministic Guarantees for Affinity Computation, Exploiting subproblem optimization in SAT-based maxsat algorithms, A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem, Resolution for Max-SAT, Iterative and core-guided maxsat solving: a survey and assessment, A logical approach to efficient Max-SAT solving, A taxonomy of exact methods for partial Max-SAT, A Preprocessor for Max-SAT Solvers, Exploiting Cycle Structures in Max-SAT