Sciweavers

290 search results - page 25 / 58
» Theorem Proving Using Lazy Proof Explication
Sort
View
JCT
2010
79views more  JCT 2010»
14 years 4 months ago
Confinement of matroid representations to subsets of partial fields
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 ...
Rudi Pendavingh, Stefan H. M. van Zwam
85
Voted
ASE
2006
122views more  ASE 2006»
14 years 9 months ago
Combining Proof Plans with Partial Order Planning for Imperative Program Synthesis
The structured programming literature provides methods and a wealth of heuristic knowledge for guiding the construction of provably correct imperative programs. We investigate the...
Andrew Ireland, Jamie Stark
95
Voted
CADE
2005
Springer
15 years 9 months ago
Reflecting Proofs in First-Order Logic with Equality
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...
Evelyne Contejean, Pierre Corbineau
JCT
2007
111views more  JCT 2007»
14 years 9 months ago
Removing even crossings
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...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
CORR
2011
Springer
137views Education» more  CORR 2011»
14 years 4 months ago
An improvement of the Moser-Tardos algorithmic local lemma
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...
Wesley Pegden