Sciweavers

9 search results - page 1 / 2
» Inference Rules for High-Order Consistency in Weighted CSP
Sort
View
AAAI
2007
13 years 6 months ago
Inference Rules for High-Order Consistency in Weighted CSP
Recently defined resolution calculi for Max-SAT and signed Max-SAT have provided a logical characterization of the solving techniques applied by Max-SAT and WCSP solvers. In this...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
IJCAI
2007
13 years 6 months ago
The Logic Behind Weighted CSP
We define a translation from Weighted CSP to signed Max-SAT, and a complete resolution-style calculus for solving signed Max-SAT. Based on these results, we then describe an orig...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
CP
2010
Springer
13 years 3 months ago
Local Consistency and SAT-Solvers
In this paper we show that the power of using k-consistency techniques in a constraint problem is precisely captured by using a particular inference rule, which we call positive-hy...
Justyna Petke, Peter Jeavons
CP
2005
Springer
13 years 10 months ago
Local Consistency in Weighted CSPs and Inference in Max-SAT
In this paper we overview our recent work and outline our current line of research: First, we describe the WCSP framework and its related local consistencies. Second, the Max-SAT p...
Federico Heras, Javier Larrosa
ICML
2007
IEEE
14 years 5 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner