504 search results - page 70 / 101 » The Complexity of Symmetry-Breaking Formulas |
CADE
2006
Springer
14 years 10 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
LICS
2009
IEEE
14 years 4 months ago
2009
IEEE
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
SAT
2009
Springer
14 years 4 months ago
2009
Springer
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable f...
ICDE
2007
IEEE
14 years 4 months ago
2007
IEEE
Moving objects databases (MOD) have been receiving increasing attention from the database community in recent years, mainly due to the wide variety of applications that technology...
WDAG
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...