Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT
- 9 October 2007
- book chapter
- Published by Springer Nature
- p. 605-619
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Solving Max-SAT as Weighted CSPLecture Notes in Computer Science, 2003
- Search pruning techniques in SAT-based branch-and-bound algorithms for the binate covering problemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2002
- Hypertree Decompositions and Tractable QueriesJournal of Computer and System Sciences, 2002
- Decomposable negation normal formJournal of the ACM, 2001
- Recursive conditioningArtificial Intelligence, 2001
- Bucket elimination: A unifying framework for reasoningArtificial Intelligence, 1999
- Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and ComparisonConstraints, 1999
- Pattern DatabasesComputational Intelligence, 1998
- New ideas for solving covering problems1995
- Enhancement schemes for constraint processing: Backjumping, learning, and cutset decompositionArtificial Intelligence, 1990