Sciweavers

1818 search results - page 41 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
FM
2003
Springer
109views Formal Methods» more  FM 2003»
14 years 2 months ago
Certifying and Synthesizing Membership Equational Proofs
As the systems we have to specify and verify become larger and more complex, there is a mounting need to combine different tools and decision procedures to accomplish large proof ...
Grigore Rosu, Steven Eker, Patrick Lincoln, Jos&ea...
TABLEAUX
1997
Springer
14 years 28 days ago
Free Variable Tableaux for Propositional Modal Logics
Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariabl...
Bernhard Beckert, Rajeev Goré
ENTCS
2008
75views more  ENTCS 2008»
13 years 8 months ago
Focusing the Inverse Method for LF: A Preliminary Report
In this paper, we describe a proof-theoretic foundation for bottom-up logic programming based on uniform proofs in the setting of the logical framework LF. We present a forward un...
Brigitte Pientka, Xi Li, Florent Pompigne
CONCUR
1998
Springer
14 years 1 months ago
Automata and Coinduction (An Exercise in Coalgebra)
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of universal coalgebr...
Jan J. M. M. Rutten
LPAR
2007
Springer
14 years 2 months ago
Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
Roberto Maieli