174 search results - page 10 / 35 » Monotonicity in Calculational Proofs |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
AIIA
1999
Springer
13 years 11 months ago
1999
Springer
In this paper we show how to extend KEM, a tableau-like proof system for normal modal logic, in order to deal with classes of non-normal modal logics, such as monotonic and regular...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restri...
BSL
2008
13 years 7 months ago
2008
Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingle nu...
FROCOS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We discuss a pragmatic approach to integrate computer algebra into proof planning. It is based on the idea to separate computation and veri cation and can thereby exploit...