Sciweavers

290 search results - page 19 / 58
» Theorem Proving Using Lazy Proof Explication
Sort
View
ENTCS
2006
143views more  ENTCS 2006»
14 years 9 months ago
Hiproofs: A Hierarchical Notion of Proof Tree
Motivated by the concerns of theorem-proving, we generalise the notion of proof tree to that of hierarchical proof tree. Hierarchical trees extend ordinary trees by adding partial...
Ewen Denney, John Power, Konstantinos Tourlas
CADE
2005
Springer
15 years 9 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison
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
ICFP
2006
ACM
15 years 9 months ago
Modular development of certified program verifiers with a proof assistant
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
Adam J. Chlipala
APAL
2005
154views more  APAL 2005»
14 years 9 months ago
A Sahlqvist theorem for distributive modal logic
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
Mai Gehrke, Hideo Nagahashi, Yde Venema