Sciweavers

113 search results - page 1 / 23
» Solving Boolean Equations Using ROSOP Forms
Sort
View
ENTCS
2008
110views more  ENTCS 2008»
13 years 9 months ago
A New Proposal Of Quasi-Solved Form For Equality Constraint Solving
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
Javier Álvez, Paqui Lucio
CATS
2006
13 years 10 months ago
Boolean equation solving as graph traversal
We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by iteratively approximating until a fixed ...
Brian Herlihy, Peter Schachte, Harald Sønde...
FOIKS
2006
Springer
14 years 1 months ago
Equational Constraint Solving Via a Restricted Form of Universal Quantification
Abstract. In this paper, we present a syntactic method for solving firstorder equational constraints over term algebras. The presented method exploits a novel notion of quasi-solve...
Javier Álvez, Paqui Lucio
WLP
2004
Springer
14 years 2 months ago
Solving Alternating Boolean Equation Systems in Answer Set Programming
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...
Misa Keinänen, Ilkka Niemelä