113 search results - page 3 / 23 » Solving Boolean Equations Using ROSOP Forms |
CONCUR
2008
Springer
14 years 19 days ago
2008
Springer
The concept of invariance for Parameterised Boolean Equation Systems (PBESs) is studied in greater detail. We identify an issue with the associated theory and fix this problem by p...
EUROPAR
2003
Springer
14 years 4 months ago
2003
Springer
An implementation of a parallel ScaLAPACK-style solver for the general Sylvester equation, op(A)X −Xop(B) = C, where op(A) denotes A or its transpose AT , is presented. The paral...
DATE
2009
IEEE
14 years 5 months ago
2009
IEEE
Boolean satisfiability (SAT) solving has become an enabling technology with wide-ranging applications in numerous disciplines. These applications tend to be most naturally encode...
DLT
2003
14 years 7 days ago
2003
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
SAT
2004
Springer
14 years 4 months ago
2004
Springer
Despite the widespread use and study of Boolean satisfiability for a diverse range of problem domains, encoding of problems is usually given to general propositional logic with li...