A complete adaptive algorithm for propositional satisfiability

DOI10.1016/S0166-218X(02)00385-2zbMATH Open1019.68043MaRDI QIDQ1811072FDOQ1811072

Authors: Renato Bruni, Antonio Sassano 

Publication date: 10 June 2003

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

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

zbMATH Keywords

satisfiabilitybacktrackingsearch frameworks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Graph-Based Algorithms for Boolean Function Manipulation
• GRASP: a search algorithm for propositional satisfiability
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Implementing the Davis-Putnam method
• Title not available (Why is that?)
• Title not available (Why is that?)
• Branch-and-cut solution of inference problems in propositional logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Branching rules for satisfiability
• Solving propositional satisfiability problems
• Title not available (Why is that?)
• SAT2000. Highlights of satisfiability research in the year 2000. 3rd international workshop, September 1998
• Relaxations of the satisfiability problem using semidefinite programming
• A Computational Study of Satisfiability Algorithms for Propositional Logic
• A Complexity Index for Satisfiability Problems
• A continuous approach to inductive inference
• Title not available (Why is that?)
• Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Average Time Analysis of Clause Order Backtracking
• Title not available (Why is that?)
• The propositional formula checker HeerHugo
• Title not available (Why is that?)

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

Uses Software

• SATO
• HeerHugo
• Leibniz

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)