60 search results - page 6 / 12 » The Connectivity of Boolean Satisfiability: Computational an... |
ATVA
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functio...
SAT
2009
Springer
14 years 1 months ago
2009
Springer
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
ATVA
2007
Springer
14 years 27 days ago
2007
Springer
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
CPAIOR
2010
Springer
13 years 4 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...
SIGMOD
2007
ACM
14 years 6 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...