Solving satisfiability using decomposition and the most constrained subproblem

MaRDI QIDQ2741535zbMATH OpenFDO

Authors Eyal Amir, Sheila A. McIlraith

Publication date 24 September 2001

zbMATH Keywords

decompositionSAT-solving procedures

Mathematics Subject Classification ID

Decomposition methods (49M27) Combinatorial optimization (90C27)

Recommendations

• Decomposing SAT problems into connected components
• scientific article; zbMATH DE number 956858
• Solving propositional satisfiability problems
• The unreasonable effectiveness of alternation-based satisfiabiity algorithms
• Solving Satisfiability with Less Searching

Cited in

(8)

• The unreasonable effectiveness of alternation-based satisfiabiity algorithms
• Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition
• Decomposing SAT Instances with Pseudo Backbones
• Decomposing SAT problems into connected components
• Complexity and Algorithms for Well-Structured k-SAT Instances
• Satisfiability, branch-width and Tseitin tautologies
• Recent Advances in Constraints
• Symbolic techniques in satisfiability solving

This page was built for publication: Solving satisfiability using decomposition and the most constrained subproblem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2741535)