174 search results - page 13 / 35 » Monotonicity in Calculational Proofs |
JAR
1998
13 years 7 months ago
1998
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
TPHOL
2002
IEEE
14 years 8 days ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
ENTCS
2002
13 years 7 months ago
2002
Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations. Domain reduction is formalized with ch...
PSIVT
2007
Springer
14 years 1 months ago
2007
Springer
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...
WINE
2009
Springer
14 years 1 months ago
2009
Springer
We study the geometrical shape of the partitions of the input space created by the allocation rule of a truthful mechanism for multi-unit auctions with multidimensional types and ...