290 search results - page 25 / 58 » Theorem Proving Using Lazy Proof Explication |
109
click to vote
JCT
2010
14 years 6 months ago
2010
Let M be a matroid representable over a (partial) field and B a matrix representable over a sub-partial field . We say that B confines M to if, whenever a -representation matrix ...
ASE
2006
14 years 11 months ago
2006
The structured programming literature provides methods and a wealth of heuristic knowledge for guiding the construction of provably correct imperative programs. We investigate the...
111
click to vote
CADE
2005
Springer
16 years 1 days ago
2005
Springer
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
JCT
2007
14 years 11 months ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
CORR
2011
Springer
14 years 6 months ago
2011
Springer
A recent theorem of Bissacot, et al. proved using results about the cluster expansion in statistical mechanics extends the Lov´asz Local Lemma by weakening the conditions under w...