113 search results - page 9 / 23 » Solving Boolean Equations Using ROSOP Forms |
125
click to vote
CPAIOR
2010
Springer
14 years 8 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
73
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
ACTA
2006
14 years 10 months ago
2006
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
80
Voted
CDC
2008
IEEE
15 years 3 days ago
2008
IEEE
Open channel flow is traditionally described by hyperbolic conservation laws (the Saint-Venant equations), that can be controlled using boundary conditions. For horizontal friction...
CADE
2003
Springer
15 years 10 months ago
2003
Springer
If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the d...