Sciweavers

1410 search results - page 47 / 282
» Proving theorems by reuse
Sort
View
CADE
2006
Springer
14 years 10 months ago
Automatic Construction and Verification of Isotopy Invariants
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
Volker Sorge, Andreas Meier, Roy L. McCasland, Sim...
JCT
2010
98views more  JCT 2010»
13 years 4 months ago
Lifts of matroid representations over partial fields
There exist several theorems which state that when a matroid is representable over distinct fields 1,..., k, it is also representable over other fields. We prove a theorem, the Li...
Rudi Pendavingh, Stefan H. M. van Zwam
JCT
2010
79views more  JCT 2010»
13 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
IJCAI
1997
13 years 11 months ago
Automation of Diagrammatic Reasoning
Theoremsin automated theorem proving are usually proved by logical formal proofs. However,there is a subset of problems which humanscan prove in a different wayby the use of geome...
Mateja Jamnik, Alan Bundy, Ian Green
ATVA
2004
Springer
138views Hardware» more  ATVA 2004»
14 years 1 months ago
Providing Automated Verification in HOL Using MDGs
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
Tarek Mhamdi, Sofiène Tahar