472 search results - page 26 / 95 » Limiting Negations in Formulas |
ENTCS
2007
13 years 10 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
LOGCOM
2002
13 years 10 months ago
2002
The paper deals with logically definable families of sets (or point-sets) of rational numbers. In particular we are interested whether the families definable over the real line wi...
IFIP
2009
Springer
13 years 8 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
Hawkes processes are used for modeling tick-by-tick variations of a single or of a pair of asset prices. For each asset, two counting processes (with stochastic intensities) are a...
JELIA
2004
Springer
14 years 3 months ago
2004
Springer
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...