36 search results - page 3 / 8 » Abstract Branching for Quantified Formulas |
CP
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Thanks to its extended expressiveness, the quantified constraint satisfaction problem (QCSP) can be used to model problems that are difficult to express in the standard C...
CADE
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
CSR
2009
Springer
14 years 26 days ago
2009
Springer
Abstract. We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be effici...
AIML
2008
13 years 7 months ago
2008
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...