An overview of backtrack search satisfiability algorithms

DOI10.1023/A:1021264516079zbMATH Open1010.68069OpenAlexW2127309711MaRDI QIDQ1861908FDOQ1861908

Inês Lynce, Joao 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

satisfiabilitybacktrackingsearch algorithms

Mathematics Subject Classification ID

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

Cited In (11)

• The Complexity of Propositional Proofs
• Finding kernels or solving SAT
• A sufficient condition for backtrack-bounded search
• Heuristic-based backtracking relaxation for propositional satisfiability
• Random backtracking in backtrack search algorithms for satisfiability
• A unified framework for DPLL(T) + certificates
• Title not available (Why is that?)
• Partition search for non-binary constraint satisfaction
• Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning
• Title not available (Why is that?)
• An exercise in transformational programming: Backtracking and Branch-and- Bound

Uses Software

• PSATO
• SATO
• Chaff
• DIMACS

This page was built for publication: An overview of backtrack search satisfiability algorithms

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