Characterizing Propagation Methods for Boolean Satisfiability

DOI10.1007/11814948_31MaRDI QIDQ5756574zbMATH OpenOpenAlexFDO

Authors Eric I. Hsu, Sheila A. McIlraith

Publication date 4 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11814948_31

Mathematics Subject Classification ID

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

Recommendations

• Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
• scientific article; zbMATH DE number 1903342
• scientific article; zbMATH DE number 2090309
• A satisfiability procedure for quantified Boolean formulae
• scientific article; zbMATH DE number 1982200
• On the structure of Boolean satisfiability
• Survey propagation: An algorithm for satisfiability
• A Computational Study of Satisfiability Algorithms for Propositional Logic
• Satisfiability-based algorithms for Boolean optimization

Cited in

(7)

• scientific article; zbMATH DE number 1696820 (Why is no real title available?)
• Survey propagation: An algorithm for satisfiability
• Theory and Applications of Satisfiability Testing
• On the interpolation between product-based message passing heuristics for SAT
• Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
• Convergence of warning propagation algorithms for random satisfiable instances
• Leveraging belief propagation, backtrack search, and statistics for model counting

Describes a project that uses

Uses Software

• Walksat

This page was built for publication: Characterizing Propagation Methods for Boolean Satisfiability

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