Sciweavers

4099 search results - page 7 / 820
» A Framework for Interactive Proof
Sort
View
JAR
2010
123views more  JAR 2010»
14 years 8 months ago
A Framework for Proof Systems
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...
Vivek Nigam, Dale Miller
TYPES
1995
Springer
15 years 1 months ago
A Natural Deduction Approach to Dynamic Logic
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
Furio Honsell, Marino Miculan
ASM
2008
ASM
14 years 11 months ago
Model Based Refinement and the Tools of Tomorrow
The ingredients of typical model based development via refinement are re-examined, and some well known frameworks are reviewed in that light, drawing out commonalities and differen...
Richard Banach
FOCS
1990
IEEE
15 years 1 months ago
Algebraic Methods for Interactive Proof Systems
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...
Carsten Lund, Lance Fortnow, Howard J. Karloff, No...
86
Voted
SAT
2010
Springer
125views Hardware» more  SAT 2010»
15 years 1 months ago
Two Techniques for Minimizing Resolution Proofs
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
Scott Cotton