1174 search results - page 78 / 235 » Derivation of Characteristic Formulae |
134
click to vote
LICS
2007
IEEE
16 years 12 days ago
2007
IEEE
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
135
click to vote
CSL
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
136
click to vote
FMCAD
2007
Springer
16 years 8 days ago
2007
Springer
— Craig interpolants are often used to approximate inductive invariants of transition systems. Arithmetic relationships between numeric variables require word-level interpolants,...
173
click to vote
PAIRING
2007
Springer
16 years 7 days ago
2007
Springer
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
140
click to vote
QEST
2006
IEEE
16 years 3 days ago
2006
IEEE
Normalizing constant recurrence equations play an important role in the exact analysis of load-independent (LI) product-form queueing networks. However, they have not been extende...