Using execution logs for improving pseudo-Boolean propagation

DOI10.1016/J.ARTINT.2025.104470MaRDI QIDQ6847313zbMATH OpenFDO

Authors Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Rui Zhao

Publication date 9 March 2026

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2025.104470

zbMATH Keywords

implementation-level detailspseudo-Boolean solvingSAT

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites work

• Cache conscious data structures for Boolean satisfiability solvers
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
• Computer Aided Verification
• Evaluating CDCL variable scoring schemes
• scientific article; zbMATH DE number 5139167 (Why is no real title available?)
• scientific article; zbMATH DE number 5510691 (Why is no real title available?)
• scientific article; zbMATH DE number 2243370 (Why is no real title available?)
• Improving resource-unaware SAT solvers
• Iterative and core-guided maxsat solving: a survey and assessment
• Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
• On Solving the Partial MAX-SAT Problem
• On the complexity of cutting-plane proofs
• On the power of clause-learning SAT solvers as resolution engines
• Optimal implementation of watched literals and more general techniques
• SAT-Based Model Checking
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• Speeding up pseudo-Boolean propagation
• The intractability of resolution
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing

This page was built for publication: Using execution logs for improving pseudo-Boolean propagation

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