Decomposing SAT problems into connected components

MaRDI QIDQ3429163zbMATH OpenFDO

Authors Armin Biere, Carsten Sinz

Publication date 30 March 2007

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Solving satisfiability using decomposition and the most constrained subproblem
• Decomposing SAT Instances with Pseudo Backbones
• scientific article; zbMATH DE number 1954174
• scientific article; zbMATH DE number 956858
• BerkMin: A fast and robust SAT-solver

Cited in

(7)

• SAT problems with chains of dependent variables
• Visualizing SAT instances and runs of the DPLL algorithm
• Solving satisfiability using decomposition and the most constrained subproblem
• Decomposing SAT Instances with Pseudo Backbones
• Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets
• scientific article; zbMATH DE number 6970794 (Why is no real title available?)
• An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCL

Describes a project that uses

Uses Software

• DPvis
• MiniSat
• Chaff
• BerkMin
• Limmat
• FORCE

This page was built for publication: Decomposing SAT problems into connected components

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