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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Aspvall, M. F. Plass, and R. E. Tarjan. A linear-time algorithm for testingthe truth of certain quantified Boolean formulas. Information Processing Letters, 8(3):121–123, 1979.
R. I. Brafman. Reachability, relevance, resolution, and the planning as satisfiability approach. In IJCAI’99, Proc. 16th International Joint Conference on Artificial Intelligence, pages 2010–2016, 1999.
R. I. Brafman. A simplifier for propositional formulas with many binary clauses. In IJCAI’01, Proc. 17th International Joint Conference on Artificial Intelligence, 2001.
M. Buro and H. Kleine Büning. Report on a sat competition. Bulletin of the European Association for Theoretical Computer Science, 49:143–151, 1993.
T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, 1991.
J. Crawford. Compact. Available from http://www.cirl.uoregon.edu/.crawford, 1996.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394–397, 1962.
R. Dechter and I. Rish. Directional resolution: The Davis-Putnam procedure, revisited. In KR’94, Proc. 4th International Conference on Principles of Knowledge Representation and Reasoning, pages 134–145. Morgan Kaufmann, 1994.
A. del Val. On 2-SAT and Renamable Horn. In AAAI’2000, Proc. 17th (U.S.) National Conference on Artificial Intelligence, pages 279–284. AAAI Press/MIT Press, 2000.
S. Even, A. Itai, and A. Shamir. On the complexity of timetable and multicommodity flow problems. SIAM Journal of Computing, 5(4):691–703, 1976.
I. Gent and T. Walsh. The search for satisfaction. Technical report, APES Research Group, 1999.
T. Larrabee. Test pattern generation using boolean satisfiability. IEEE Transactions on Computer-Aided Design, pages 4–15, 1992.
Chu Min Li and Abulagan. Heuristics based on unit propagation for satisfiability problems. In IJCAI’97, Proc. 15th International Joint Conference on Artificial Intelligence, 1997.
D. G. Mitchell, B. Selman, and H. J. Levesque. Hard and easy distributions of sat problems. In AAAI’92, Proc. 10th (U.S.) National Conference on Artificial Intelligence, pages 459–465, 1992.
E. Nuutila and E. Soisalon-Soininen. On finding the strongly connected components in a directed graph. Information Processing Letters, 49:9–14, 1993.
D. Pretolani. Satisfiability and Hypergraphs. PhD thesis, Universitá di Pisa, 1993.
R. E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal of Computing, 1:146–160, 1972.
A. van Gelder and Y.K. Tsuji. Satisfiability testing with more reasoning and less guessing. In D.S. Johnson and M. Trick, editors, Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge. American Mathematical Society, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
del Val, A. (2001). Simplifying Binary Propositional Theories into Connected Components Twice as Fast. In: Nieuwenhuis, R., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2001. Lecture Notes in Computer Science(), vol 2250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45653-8_27
Download citation
DOI: https://doi.org/10.1007/3-540-45653-8_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42957-9
Online ISBN: 978-3-540-45653-7
eBook Packages: Springer Book Archive