A complete adaptive algorithm for propositional satisfiability

DOI10.1016/S0166-218X(02)00385-2zbMath1019.68043MaRDI QIDQ1811072

Antonio Sassano, Renato Bruni

Publication date: 10 June 2003

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

zbMATH Keywords

satisfiabilitybacktrackingsearch frameworks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Uses Software

• SATO
• HeerHugo
• Leibniz

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A continuous approach to inductive inference
• Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
• Branch-and-cut solution of inference problems in propositional logic
• Solving propositional satisfiability problems
• Branching rules for satisfiability
• Implementing the Davis-Putnam method
• Graph-Based Algorithms for Boolean Function Manipulation
• Average Time Analysis of Clause Order Backtracking
• A Complexity Index for Satisfiability Problems
• A Computational Study of Satisfiability Algorithms for Propositional Logic
• GRASP: a search algorithm for propositional satisfiability
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving