Sciweavers

233 search results - page 14 / 47
» An Existential Locality Theorem
Sort
View
71
Voted
CADE
2010
Springer
14 years 10 months ago
Interpolation and Symbol Elimination in Vampire
It has recently been shown that proofs in which some symbols are colored (e.g. local or split proofs and symbol-eliminating proofs) can be used for a number of applications, such a...
Krystof Hoder, Laura Kovács, Andrei Voronko...
RSA
1998
49views more  RSA 1998»
14 years 9 months ago
Normal approximations of the number of records in geometrically distributed random variables
We establish the asymptotic normality of the number of upper records in a sequence of iid geometric random variables. Large deviations and local limit theorems as well as approxim...
Zhi-Dong Bai, Hsien-Kuei Hwang, Wen-Qi Liang
FOSSACS
2007
Springer
15 years 3 months ago
Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative analogue ...
Franck van Breugel, Babita Sharma, James Worrell
66
Voted
FSTTCS
2006
Springer
15 years 1 months ago
Branching Pushdown Tree Automata
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
Rajeev Alur, Swarat Chaudhuri
JANCL
2008
170views more  JANCL 2008»
14 years 9 months ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko