Sciweavers

233 search results - page 10 / 47
» Applications of Polytypism in Theorem Proving
Sort
View
JSYML
2007
51views more  JSYML 2007»
14 years 9 months ago
Forcing indestructibility of set-theoretic axioms
Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the L´evy collapse. These show in particul...
Bernhard König
CDC
2010
IEEE
138views Control Systems» more  CDC 2010»
14 years 4 months ago
Consensus in non-commutative spaces
Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. The Lyapunov function used in the early analysis by Tsitsiklis is shown to be the Hi...
Rodolphe Sepulchre, Alain Sarlette, Pierre Rouchon
ECAI
2004
Springer
15 years 2 months ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price
JAR
2010
160views more  JAR 2010»
14 years 8 months ago
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Many theorems involving special functions such as ln, exp and sin can be proved automatically by MetiTarski: a resolution theorem prover modified to call a decision procedure for ...
Behzad Akbarpour, Lawrence C. Paulson
ENTCS
2007
83views more  ENTCS 2007»
14 years 9 months ago
Enhancing Theorem Prover Interfaces with Program Slice Information
This paper proposes an extension to theorem proving interfaces for use with proofdirected debugging and other disproof-based applications. The extension is based around tracking a...
Louise A. Dennis