Sciweavers

491 search results - page 47 / 99
» An Interpolating Theorem Prover
Sort
View
ENTCS
2007
101views more  ENTCS 2007»
13 years 8 months ago
Compressing Propositional Refutations
We report initial results on shortening propositional resolution refutation proofs. This has an application in speeding up deductive reconstruction (in theorem provers) of large p...
Hasan Amjad
CADE
2004
Springer
14 years 9 months ago
Automatic Generation of Classification Theorems for Finite Algebras
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...
CADE
2002
Springer
14 years 9 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
TYPES
1994
Springer
14 years 23 days ago
A Concrete Final Coalgebra Theorem for ZF Set Theory
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
Lawrence C. Paulson
JCST
2010
189views more  JCST 2010»
13 years 3 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar