Sciweavers

3658 search results - page 34 / 732
» The logic of proofs, semantically
Sort
View
APAL
2008
80views more  APAL 2008»
13 years 9 months ago
A quantified logic of evidence
A propositional logic of explicit proofs, LP, was introduced in [2], completing a project begun long ago by G
Melvin Fitting
WOLLIC
2009
Springer
14 years 3 months ago
Classic-Like Analytic Tableaux for Finite-Valued Logics
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
Carlos Caleiro, João Marcos
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 9 months ago
The craft of model making: PSPACE bounds for non-iterative modal logics
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
Lutz Schröder, Dirk Pattinson
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
14 years 9 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin