An overview of backtrack search satisfiability algorithms

DOI10.1023/A:1021264516079zbMath1010.68069OpenAlexW2127309711MaRDI QIDQ1861908

Inês Lynce, João P. Marques-Silva

Publication date: 10 March 2003

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

Full work available at URL: https://doi.org/10.1023/a:1021264516079

zbMATH Keywords

search algorithmssatisfiabilitybacktracking

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items

Partition search for non-binary constraint satisfaction, A unified framework for DPLL(T) + certificates, Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning, Finding kernels or solving SAT, The Complexity of Propositional Proofs, Unnamed Item

Uses Software

• PSATO
• SATO
• Chaff
• DIMACS