Results 21 to 30 of about 82,622 (268)
Linear logical approximations [PDF]
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation, 2009 The abstract interpretation of programs relates the exact semantics of a programming language to an approximate semantics that can be effectively computed. We show that, by specifying operational semantics in a bottom-up, linear logic programming language -- a technique we call "substructural operational semantics" (SSOS) -- manifestly sound program ...
Robert J. Simmons, Frank Pfenning
openaire +1 more source
A linear logic framework for multimodal logics
Mathematical Structures in Computer Science, 2022 AbstractOne of the most fundamental properties of a proof system is analyticity, expressing the fact that a proof of a given formula F only uses subformulas of F. In sequent calculus, this property is usually proved by showing that the $\mathsf{cut}$ rule is admissible, i.e., the introduction of the auxiliary lemma H in the reasoning “if H follows ...
Xavier, Bruno +2 more
openaire +4 more sources
Elimination of network intrusions via a resource oriented BDI architecture
Open Computer Science, 2018 We propose a resource-oriented architecture of a rational agent for a network intrusion detection system. This architecture describes the behavior of a rational agent after detection of unwanted network activities.
Perháč Ján +2 more
doaj +1 more source
The succinctness of first-order logic on linear orders [PDF]
Logical Methods in Computer Science, 2005 Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of (approximately) the ...
Martin Grohe, Nicole Schweikardt
doaj +1 more source
The ILLTP Library for Intuitionistic Linear Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Benchmarking automated theorem proving (ATP) systems using standardized problem sets is a well-established method for measuring their performance. However, the availability of such libraries for non-classical logics is very limited.
Carlos Olarte +3 more
doaj +1 more source
Making first order linear logic a generating grammar [PDF]
Logical Methods in Computer Science, 2023 It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type calculus (ETTC)
Sergey Slavnov
doaj +1 more source
Categorical Proof Theory of Co-Intuitionistic Linear Logic [PDF]
Logical Methods in Computer Science, 2014 To provide a categorical semantics for co-intuitionistic logic one has to face the fact, noted by Tristan Crolard, that the definition of co-exponents as adjuncts of coproducts does not work in the category Set, where coproducts are disjoint unions ...
Gianluigi Bellin
doaj +1 more source
Indexed linear logic and higher-order model checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 In recent work, Kobayashi observed that the acceptance by an alternating tree automaton A of an infinite tree T generated by a higher-order recursion scheme G may be formulated as the typability of the recursion scheme G in an appropriate intersection ...
Charles Grellois, Paul-André Melliès
doaj +1 more source
Sequent Systems for Consequence Relations of Cyclic Linear Logics
Bulletin of the Section of LogicLinear Logic is a versatile framework with diverse applications in computer science and mathematics. One intriguing fragment of Linear Logic is Multiplicative-Additive Linear Logic (MALL), which forms the exponential-free component of the larger ...
Paweł Płaczek
doaj +1 more source
Taylor expansion in linear logic is invertible [PDF]
Logical Methods in Computer Science, 2018 Each Multiplicative Exponential Linear Logic (MELL) proof-net can be expanded into a differential net, which is its Taylor expansion. We prove that two different MELL proof-nets have two different Taylor expansions.
Daniel de Carvalho
doaj +1 more source