Abstract
We present a method for specifying and implementing algorithms for Boolean logic problems. It is formally grounded in relational algebra. Specifications are written in first-order set theory and then transformed systematically into relation-algebraic forms which can be executed directly in RelView, a computer system for the manipulation of relations and relational programming. Our method yields programs that are correct by construction. It is illustrated by some examples.
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
Asahiro, Y., Iwama, K., Miyano, E.: Random generation of test instances with controlled attributes. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring, and Satisfiability: The Second DIMACS Implementation Challenge. DIMACS Series on Discr. Math. and Theoret. Comput. Sci. vol. 26, pp. 377–394 (1996)
Behnke, R., et al.: RelView — A system for calculation with relations and relational programming. In: Astesiano, E. (ed.) ETAPS 1998 and FASE 1998. LNCS, vol. 1382, pp. 318–321. Springer, Heidelberg (1998)
Bryant, R.E.: Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Comp. Surveys 24, 293–318 (1992)
Crawford, J.M., Auton, L.D.: Experimental results on the crossover point in random 3SAT. Artificial Intelligence 81, 59–80 (1996)
Dantsin, E., Hirsch, E.A.: Algorithms for SAT and upper bounds of their complexity. Electr. Coll. Comp. Compl., Rep. 12 (2001), http://www.eccc.uni-trier.de/eccc
Hoos, H.H., Stützle, T.: SATLIB: An online resource for research on Sat. In: Gent, I.P., van Maaren, H., Walsh, T. (eds.) SAT 2000, pp. 283–292. IOS Press, Amsterdam (2000)
Hromkovic, J.: Algorithms for hard problems. In: Introduction to combinatorial optimization, randomization, approximation, and heuristics. EATCS Texts in Theoret. Comput. Sci., Springer, Heidelberg (2001)
Huth, M.R.A., Ryan, M.D.: Logic in computer science. Cambr. Univ. Press (2000)
Leoniuk, B.: ROBDD-based implementation of relational algebra with applications (in German). Ph.D. thesis, Inst. für Inf. und Prak. Math., Univ. Kiel (2001)
Lind-Nielson, J.: BuDDy, a binary decision diagram package, version 2.2. Techn. Univ. of Denmark (2003), http://www.itu.dk/research/buddy
Milanese, U.: On the implementation of a ROBDD-based tool for the manipulation and visualization of relations (in German). Ph.D. thesis, Inst. für Inf. und Prak. Math., Univ. Kiel (2003)
Purdam, P.: A survey of average time analysis of satisfiability algorithms. J. of Inf. Processing 13, 449–455 (1990)
Schmidt, G., Ströhlein, T.: Relations and graphs. In: Discrete Mathematics for Computer Scientists. EATCS Monographs on Theoret. Comput. Sci., Springer, Heidelberg (1993)
Somenzi, F.: CUDD: CU decision diagram package, release 2.3.1. Univ. of Colorado at Boulder (2001), http://www.vlsi.colorado.edu/~fabio/CUDD
Tarski, A.: On the calculus of relations. J. Symbolic Logic 6, 73–89 (1941)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berghammer, R., Milanese, U. (2006). Relational Approach to Boolean Logic Problems. In: MacCaull, W., Winter, M., Düntsch, I. (eds) Relational Methods in Computer Science. RelMiCS 2005. Lecture Notes in Computer Science, vol 3929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11734673_4
Download citation
DOI: https://doi.org/10.1007/11734673_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33339-5
Online ISBN: 978-3-540-33340-1
eBook Packages: Computer ScienceComputer Science (R0)