Improving SAT algorithms by using search pruning techniques

DOI10.1007/3-540-45578-7_71MaRDI QIDQ4475702zbMATH OpenFDO

Authors Inês Lynce, Joao Marques-Silva

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390770.htm

Mathematics Subject Classification ID

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

Recommendations

• An overview of backtrack search satisfiability algorithms
• Stochastic systematic search algorithms for satisfiability
• Evaluating search heuristics and optimization techniques in propositional satisfiability
• The effect of nogood recording in DPLL-CBJ SAT algorithms
• Automatic generation of implied clauses for SAT

Cited in

(5)

• An overview of backtrack search satisfiability algorithms
• Improvements to Hybrid Incremental SAT Algorithms
• Simulating circuit-level simplifications on CNF
• Improving Saddleback Search: A Lesson in Algorithm Design
• The effect of nogood recording in DPLL-CBJ SAT algorithms

This page was built for publication: Improving SAT algorithms by using search pruning techniques

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