A complete adaptive algorithm for propositional satisfiability

Authors:
Renato Bruni;Antonio Sassano
Affiliations:
Dipartimento di Informatica e Sistemistica, Università di Roma 'La Sapienza', Via Buonarroti 12, I-00185 Rome, Italy;Dipartimento di Informatica e Sistemistica, Università di Roma 'La Sapienza', Via Buonarroti 12, I-00185 Rome, Italy
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 10
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
A continuous approach to inductive inference

Mathematical Programming: Series A and B
A Complexity Index for Satisfiability Problems

SIAM Journal on Computing
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993

Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)
Using CSP look-back techniques to solve real-world SAT instances

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Quantified Score

Hi-index	0.04

Visualization

Abstract

An approach to propositional satisfiability using an adaptive procedure is described. Its main feature is a new branching rule, which is able to identify, at an early stage, hard sub-formulae. Such branching rule is based on a simple and easy computable criterion, whose merit function is updated by a learning mechanism, and guides the exploration of a clause-based branching tree. Completeness is guaranteed. Moreover, a new search technique named core search is used to speed-up the above procedure while preserving completeness. This is inspired by the well-known approaches of row and column generation used in mathematical programming. Encouraging computational results and comparisons are presented.