Results 251 to 260 of about 823,326 (291)
Some of the next articles are maybe not open access.
Communications of the ACM, 2010
A novel approach to computational logic is reaching maturity, opening up opening up new vistas in programming languages, proof nets, and security applications.
openaire +1 more source
A novel approach to computational logic is reaching maturity, opening up opening up new vistas in programming languages, proof nets, and security applications.
openaire +1 more source
Linear Logic for Non-Linear Storytelling
2010Whilst narrative representations have played a prominent role in AI research, there has been a renewed interest in the topic with the development of interactive narratives. A typical approach aims at generating narratives from baseline action representations, most often using planning techniques.
Bosser A.-G., Cavazza M., Champagnat R.
openaire +1 more source
A new deconstructive logic: linear logic
Journal of Symbolic Logic, 1997AbstractThe main concern of this paper is the design of a noetherian and confluent normalization for LK2 (that is, classical second order predicate logic presented as a sequent calculus).The method we present is powerful: since it allows us to recover as fragments formalisms as seemingly different as Girard's LC and Parigot's λμ, FD ([10, 12, 32, 36]),
Schellinx, H., Danos, V., Joinet, J.-B.
openaire +3 more sources
2018
Linear logic was introduced by Jean-Yves Girard in 1987. Like classical logic it satisfies the law of the excluded middle and the principle of double negation, but, unlike classical logic, it has non-degenerate models. Models of logics are often given only at the level of provability, in that they provide denotations of formulas.
openaire +1 more source
Linear logic was introduced by Jean-Yves Girard in 1987. Like classical logic it satisfies the law of the excluded middle and the principle of double negation, but, unlike classical logic, it has non-degenerate models. Models of logics are often given only at the level of provability, in that they provide denotations of formulas.
openaire +1 more source
Journal of Logic and Computation, 1994
The multiplicative fragment of linear logic is studied with the aim to simulate parallel computations. A translation is defined which transforms proofs of this formalism into communicating sequential processes (CSP). This translation is determined by a step-by-step correspondence between the cut-elimination process and the CSP execution. In section 3 a
openaire +1 more source
The multiplicative fragment of linear logic is studied with the aim to simulate parallel computations. A translation is defined which transforms proofs of this formalism into communicating sequential processes (CSP). This translation is determined by a step-by-step correspondence between the cut-elimination process and the CSP execution. In section 3 a
openaire +1 more source
Modal Logic, Linear Logic, Optimal Lambda-Reduction
1999The paper will maintain and justify the following thesis: A purist approach to modal proof-theory may have some (applied) benefits for the efficient reduction of lambda-terms, an important problem in the implementation of functional programming languages.
GUERRINI S., MARTINI S., MASINI, Andrea
openaire +2 more sources
Quantum logic and linear logic
International Journal of Theoretical Physics, 1994By tradition, the subject of quantum logic is the lattices of closed subspaces of Hilbert spaces or, more abstractly, orthomodular lattices. \textit{D. J. Foulis} showed in Can. J. Math. 17, 40-51 (1965; Zbl 0146.029) that an orthomodular lattice can be coordinatized by a Baer \(*\)- semigroup. On the other hand, \textit{C. J. Mulvey} [Rend. Circ. Math.
openaire +2 more sources
Linear Logic and Intuitionistic Logic
Revue internationale de philosophie, 2004Dans cet article je presente les fondements de la logique intuitioniste basee sur la logique lineair. Traditionnellement, la logique intuitioniste est concideree comme etant en disaccord avec les lois fondamentales de la logique classique sur la dualite, comme le tiers-exclu, les lois de Morgan, l'elimination de la double negation, etc.
openaire +1 more source
1993
Abstract In this tutorial we present a very elementary introduction to linear logic, consisting of a description of the system, a sketch of cut-elimination, a discussion of the relationship with intuitionistic logic (embedding theorems), a sketch of completeness for algebraic semantics, and some remarks on the computational ...
openaire +2 more sources
Abstract In this tutorial we present a very elementary introduction to linear logic, consisting of a description of the system, a sketch of cut-elimination, a discussion of the relationship with intuitionistic logic (embedding theorems), a sketch of completeness for algebraic semantics, and some remarks on the computational ...
openaire +2 more sources
IEEE Transactions on Electronic Computers, 1961
Techniques are developed for the logical design of magnetic core circuits to produce arbitrary single-output combinational switching functions. The approach is based on the relationship of a single magnetic core circuit to a linearly separable switching function.
openaire +1 more source
Techniques are developed for the logical design of magnetic core circuits to produce arbitrary single-output combinational switching functions. The approach is based on the relationship of a single magnetic core circuit to a linearly separable switching function.
openaire +1 more source

