Efficient data structures for backtrack search SAT solvers

DOI10.1007/S10472-005-0425-5MaRDI QIDQ1777399zbMATH OpenOpenAlexFDO

Authors Inês Lynce, Joao Marques-Silva

Publication date 13 May 2005

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://eprints.soton.ac.uk/262209/1/jpms-amai05.pdf

zbMATH Keywords

propositional satisfiabilitybacktrack search

Mathematics Subject Classification ID

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

Recommendations

• Cache conscious data structures for Boolean satisfiability solvers
• Theory and Applications of Satisfiability Testing
• An overview of backtrack search satisfiability algorithms
• scientific article; zbMATH DE number 2090309
• scientific article; zbMATH DE number 1903342

Cites work

• scientific article; zbMATH DE number 2080328 (Why is no real title available?)
• scientific article; zbMATH DE number 2080337 (Why is no real title available?)
• scientific article; zbMATH DE number 956865 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Implementing the Davis-Putnam method
• SATO: An efficient propositional prover
• The propositional formula checker HeerHugo

Cited in

(11)

• Cache conscious data structures for Boolean satisfiability solvers
• Propositional SAT solving
• scientific article; zbMATH DE number 7301717 (Why is no real title available?)
• Solving d-SAT via Backdoors to Small Treewidth
• Formal Methods in Computer-Aided Design
• Optimal implementation of watched literals and more general techniques
• DPLL+ROBDD derivation applied to inversion of some cryptographic functions
• Implementing efficient All solutions SAT solvers
• Theory and Applications of Satisfiability Testing
• An overview of parallel SAT solving
• Theory and Applications of Satisfiability Testing

Describes a project that uses

Uses Software

• SATO
• Chaff
• DIMACS
• HeerHugo

This page was built for publication: Efficient data structures for backtrack search SAT solvers

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