36 search results - page 2 / 8 » Abstract Branching for Quantified Formulas |
CADE
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
TR
2010
12 years 12 months ago
2010
Abstract--We quantify the closeness of the approximation between two high-level probabilistic models of cascading failure. In one model called CASCADE, failing components successiv...
CADE
2008
Springer
14 years 5 months ago
2008
Springer
Abstract. This paper presents verified quantifier elimination procedures for dense linear orders (DLO), for real and for integer linear arithmetic. The DLO procedures are new. All ...
CONCUR
2006
Springer
13 years 7 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
JCT
2011
13 years 7 days ago
2011
Abstract. Based on the ideas in [CKP], we introduce the weighted analogue of the branching rule for the classical hook length formula, and give two proofs of this result. The firs...