98 search results - page 1 / 20 » Efficient solution of systems of Boolean equations |
ICCAD
1996
IEEE
13 years 8 months ago
1996
IEEE
This paper describes an algorithm for the efficient solution of large systems of Boolean equations. The algorithm exploits the fact that, in some cases, the composition operation ...
WLP
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
ICLP
2001
Springer
13 years 9 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
DCC
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
CONCUR
2004
Springer
13 years 10 months ago
2004
Springer
Systems (extended abstract) Simona Orzan and Tim A.C. Willemse Department of Mathematics and Computer Science, Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, T...