Submodularity-Based Decomposing for Valued CSP (original) (raw)
Related papers
A submodular-based decomposition strategy for valued CSPs
A decomposition method for valued CSPs
Domain permutation reduction for Valued CSPs
2011
Valued Constraint Satisfaction Problems: Hard and Easy Problems
1995
Domain Reduction for Valued Constraints by Generalising Methods from CSP
Principles and Practice of Constraint Programming, 2018
Binarisation for Valued Constraint Satisfaction Problems
SIAM Journal on Discrete Mathematics, 2017
Soft Directional Substitutable based Decompositions for MOVCSP
In Proceedings of the 10th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-485-5, pages 218-225. , 2021
Hybrid tractability of valued constraint problems
Artificial Intelligence, 2011
Eliminating redundancy in CSPs through merging and subsumption of domain values
ACM SIGAPP Applied Computing Review, 2013
Hybrid Tractable Classes of Constraint Problems
2017
High-Order Consistency in Valued Constraint Satisfaction
Constraints, 2005
Variable Elimination in Binary CSPs (Extended Abstract)
2020
Reformulating constraint satisfaction problems to improve scalability
2007
On the encoding of constraint satisfaction problems with 0/1 variables
2001
Artificial Intelligence, 2016
A Decomposition Technique for Max-CSP
European Conference on Artificial Intelligence, 2008
A characterisation of the complexity of forbidding subproblems in binary max-CSP
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012
A Decomposition Technique for Solving {Max-CSP}
2008
The approximability of MAX CSP with fixed-value constraints
Journal of the ACM, 2008
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
Cyclic consistency: A local reduction operation for binary valued constraints
Artificial Intelligence, 2004
A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems
Lecture Notes in Computer Science
Tractability in constraint satisfaction problems: a survey
Constraints, 2015
Exploiting the Structure of Constraint Satisfaction Problems by Interchangeability
2001
A comparison of structural CSP decomposition methods
Artificial Intelligence, 2000
A Study of Encodings of Constraint Satisfaction Problems with 0/1 Variables
CoLogNet Publications, 2002
Adaptive and Opportunistic Exploitation of Tree-Decompositions for Weighted CSPs
2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI), 2017
Lexicographically-Ordered Constraint Satisfaction Problems
Constraints, 2010
A filtering technique to achieve 2-consistency in constraint satisfaction problems
2012