Simplifying Binary Propositional Theories into Connected Components Twice as Fast

Authors:
Alvaro del Val
Affiliations:
-
Venue:
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Year:
2001

Citing 7
Cited 2

Introduction to algorithms

Introduction to algorithms
On finding the strongly connected components in a directed graph

Information Processing Letters
A machine program for theorem-proving

Communications of the ACM
On 2-SAT and Renamable Horn

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Heuristics based on unit propagation for satisfiability problems

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Reachability, relevance, resolution and the planning as satisfiability approach

IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
A simplifier for propositional formulas with many binary clauses

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

JaCk-SAT: a new parallel scheme to solve the satisfiability problem (SAT) based on join-and-check

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Efficient CNF simplification based on binary implication graphs

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Binary propositional theories, composed of clauses with at most two literals, are one of the most interesting tractable subclasses of the satisfiability problem. We present two hybrid simplification algorithms for binary theories, which combine the unit-resolution-based 2SAT algorithm BinSat [9] with refined versions of the classical strongly connected components (SCC) algorithm of [1]. We show empirically that the algorithms are considerably faster than other SCC-based algorithms, and have greater simplifying power, as they combine detection of entailed literals with identification of SCCs, i.e. sets of equivalent literals. By developing faster simplification algorithms we hope to contribute to attempts to integrate simplification of binary theories within the search phase of general SAT solvers.