Results 261 to 270 of about 3,702,791 (303)
Some of the next articles are maybe not open access.
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.
Anne-Gwenn Bosser +2 more
openaire +2 more sources
Mathematical Structures in Computer Science, 2002
This paper describes a family of logics whose categorical semantics is based on functors with structure rather than on categories with structure. This allows the consideration of logics that contain possibly distinct logical subsystems whose interactions are mediated by functorial mappings. For example, within one unified framework, we shall be able
Richard Blute +2 more
openaire +2 more sources
This paper describes a family of logics whose categorical semantics is based on functors with structure rather than on categories with structure. This allows the consideration of logics that contain possibly distinct logical subsystems whose interactions are mediated by functorial mappings. For example, within one unified framework, we shall be able
Richard Blute +2 more
openaire +2 more sources
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
Studia Logica, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
International Journal of Foundations of Computer Science, 2023
We introduce a weighted linear dynamic logic (weighted LDL for short) and show the expressive equivalence of its formulas to weighted rational expressions. This adds a new characterization for recognizable series to the fundamental Schützenberger theorem. Surprisingly, the equivalence does not require any restriction to our weighted LDL.
Manfred Droste +2 more
openaire +1 more source
We introduce a weighted linear dynamic logic (weighted LDL for short) and show the expressive equivalence of its formulas to weighted rational expressions. This adds a new characterization for recognizable series to the fundamental Schützenberger theorem. Surprisingly, the equivalence does not require any restriction to our weighted LDL.
Manfred Droste +2 more
openaire +1 more source
Mathematical Logic Quarterly, 2014
We define a special family of Brouwerian logics determined by linearly ordered frames. Then we prove that all logics of this family have the finite model property and are Kripke complete.
openaire +1 more source
We define a special family of Brouwerian logics determined by linearly ordered frames. Then we prove that all logics of this family have the finite model property and are Kripke complete.
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 +3 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 +3 more sources
Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226), 2002
Interaction nets provide a graphical paradigm of computation based on net rewriting. By encoding the cut-elimination process of linear logic they have proved successful in understanding the dynamics of reduction in the /spl lambda/-calculus. G. Gonthier et al.
openaire +2 more sources
Interaction nets provide a graphical paradigm of computation based on net rewriting. By encoding the cut-elimination process of linear logic they have proved successful in understanding the dynamics of reduction in the /spl lambda/-calculus. G. Gonthier et al.
openaire +2 more sources
Linear proofs and linear logic
2005In [3] a modification of the Connection Method [2] called Linear Proofs was introduced which constituted a new logical approach to plan generation. Inspired by this idea in [7] a similar approach based on Linear Logic was presented. The present paper analyses the relationship of these two approaches and shows to which extent they are equivalent and ...
openaire +1 more source