Sciweavers

3690 search results - page 33 / 738
» Computation with classical sequents
Sort
View
ENTCS
2011
129views more  ENTCS 2011»
13 years 5 months ago
Specifying Proof Systems in Linear Logic with Subexponentials
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logic’s finer control on structural rules, i...
Vivek Nigam, Elaine Pimentel, Giselle Reis

Book
385views
15 years 9 months ago
3D Model Recognition From Stereoscopic Cues
A classic computer vision book.
J.E. W. Mayhew, J.P. Frisby
CSL
2000
Springer
13 years 10 months ago
On the Computational Interpretation of Negation
Abstract. We investigate the possibility of giving a computational interpretation of an involutive negation in classical natural deduction. We first show why this cannot be simply ...
Michel Parigot
LICS
2008
IEEE
14 years 5 months ago
Cut Elimination for Monomial MALL Proof Nets
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
Olivier Laurent, Roberto Maieli
KR
2010
Springer
14 years 3 months ago
Modelling Combinatorial Auctions in Linear Logic
We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resource-sensitive nature, linear l...
Daniele Porello, Ulle Endriss