Solving Intensional Weighted CSPs by Incremental Optimization with BDDs
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 207-223
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- A Modular Approach to MaxSAT Modulo Theories2013
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theoriesConstraints, 2012
- Solving constraint satisfaction problems with SAT modulo theoriesConstraints, 2012
- Satisfiability Modulo the Theory of Costs: Foundations and ApplicationsLecture Notes in Computer Science, 2010
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing2009
- Z3: An Efficient SMT Solver2008
- Soft Constraints2006
- Solving weighted CSP by maintaining arc consistencyArtificial Intelligence, 2004
- Pseudo-Boolean optimizationDiscrete Applied Mathematics, 2002
- Partial constraint satisfactionArtificial Intelligence, 1992