Shallow lazy proofs

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that delaying fully-expansive proof reconstruction for non-interactive decision procedures can result in a more efficient work-flow. In contrast with earlier work, our approach to postponed proof does not require making deep changes to the theorem prover. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Amjad, H. (2005). Shallow lazy proofs. In Lecture Notes in Computer Science (Vol. 3603, pp. 35–49). Springer Verlag. https://doi.org/10.1007/11541868_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free