A complete adaptive algorithm for propositional satisfiability

DOI10.1016/S0166-218X(02)00385-2MaRDI QIDQ1811072zbMATH OpenFDO

Authors Renato Bruni, Antonio Sassano

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)

Recommendations

• scientific article; zbMATH DE number 1113999
• Branching rules for satisfiability
• A Computational Study of Satisfiability Algorithms for Propositional Logic
• Solving propositional satisfiability problems
• Approximating minimal unsatisfiable subformulae by means of adaptive core search

Cites work

• scientific article; zbMATH DE number 6118223 (Why is no real title available?)
• scientific article; zbMATH DE number 3568056 (Why is no real title available?)
• scientific article; zbMATH DE number 1324220 (Why is no real title available?)
• scientific article; zbMATH DE number 2080329 (Why is no real title available?)
• scientific article; zbMATH DE number 1380573 (Why is no real title available?)
• scientific article; zbMATH DE number 939919 (Why is no real title available?)
• scientific article; zbMATH DE number 776082 (Why is no real title available?)
• scientific article; zbMATH DE number 956856 (Why is no real title available?)
• scientific article; zbMATH DE number 956858 (Why is no real title available?)
• scientific article; zbMATH DE number 956860 (Why is no real title available?)
• scientific article; zbMATH DE number 956861 (Why is no real title available?)
• scientific article; zbMATH DE number 956865 (Why is no real title available?)
• A Complexity Index for Satisfiability Problems
• A Computational Study of Satisfiability Algorithms for Propositional Logic
• A Computing Procedure for Quantification Theory
• A continuous approach to inductive inference
• A machine program for theorem-proving
• Average Time Analysis of Clause Order Backtracking
• Branch-and-cut solution of inference problems in propositional logic
• Branching rules for satisfiability
• GRASP: a search algorithm for propositional satisfiability
• Graph-Based Algorithms for Boolean Function Manipulation
• Implementing the Davis-Putnam method
• Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
• Relaxations of the satisfiability problem using semidefinite programming
• SAT2000. Highlights of satisfiability research in the year 2000. 3rd international workshop, September 1998
• Solving propositional satisfiability problems
• The propositional formula checker HeerHugo

Cited in

(5)

• A self-adaptive multi-engine solver for quantified Boolean formulas
• A weight-balanced branching rule for SAT
• Adaptive Constraint Satisfaction: The Quickest First Principle
• Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning
• Theory and Applications of Satisfiability Testing

Describes a project that uses

Uses Software

• Leibniz
• HeerHugo
• SATO

This page was built for publication: A complete adaptive algorithm for propositional satisfiability

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