154 search results - page 7 / 31 » Proof Complexity of Non-classical Logics |
JCST
2010
13 years 2 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
MKM
2009
Springer
14 years 1 months ago
2009
Springer
This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Autexier [4] on ¯λµ˜µ, a calculus introduced by Curien and Herbelin [5,6]. Jus...
CADE
2005
Springer
14 years 7 months ago
2005
Springer
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
LATIN
2004
Springer
14 years 23 days ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...