Random backtracking in backtrack search algorithms for satisfiability

DOI10.1016/j.dam.2005.10.021zbMath1121.68109OpenAlexW2135112232MaRDI QIDQ2643305

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

Publication date: 23 August 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

randomizationpropositional satisfiabilitybacktrack search algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (4)

The Relation Between Complete and Incomplete Search ⋮ Conditional optimization problems: fractional order case ⋮ Boosting haplotype inference with local search ⋮ A generative power-law search tree model

Uses Software

• SATO
• BerkMin

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonsystematic search and no-good learning
• BerkMin: A fast and robust SAT-solver
• GRASP: a search algorithm for propositional satisfiability
• SATO: An efficient propositional prover
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving

This page was built for publication: Random backtracking in backtrack search algorithms for satisfiability