Efficient data structures for backtrack search SAT solvers

DOI10.1007/s10472-005-0425-5zbMath1099.68025OpenAlexW4231793453MaRDI QIDQ1777399

Inês Lynce, João P. 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

backtrack searchpropositional satisfiability

Mathematics Subject Classification ID

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

Related Items (4)

Propositional SAT Solving ⋮ An overview of parallel SAT solving ⋮ DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions ⋮ Unnamed Item

Uses Software

• SATO
• Chaff
• DIMACS
• HeerHugo

Cites Work

• SATO: An efficient propositional prover
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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