Sciweavers

1818 search results - page 87 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
ECAI
2004
Springer
14 years 19 days ago
Lakatos-Style Automated Theorem Modification
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
Simon Colton, Alison Pease
AIML
2008
13 years 10 months ago
Valentini's cut-elimination for provability logic resolved
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
Rajeev Goré, Revantha Ramanayake
IANDC
2010
141views more  IANDC 2010»
13 years 7 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner
PLPV
2011
ACM
12 years 11 months ago
Local actions for a curry-style operational semantics
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
Gordon Stewart, Andrew W. Appel
POPL
2012
ACM
12 years 4 months ago
Resource-sensitive synchronization inference by abduction
We present an analysis which takes as its input a sequential program, augmented with annotations indicating potential parallelization opportunities, and a sequential proof, writte...
Matko Botincan, Mike Dodds, Suresh Jagannathan