Results 31 to 40 of about 823,326 (291)
Model Checking Linear Logic Specifications [PDF]
The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications.
Bozzano, M., Delzanno, G., Martelli, M.
core +1 more source
On noncommutative extensions of linear logic [PDF]
Pomset logic introduced by Retor\'e is an extension of linear logic with a self-dual noncommutative connective. The logic is defined by means of proof-nets, rather than a sequent calculus.
Sergey Slavnov
doaj +1 more source
Elimination of network intrusions via a resource oriented BDI architecture
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]
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]
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
Generalized Connectives for Multiplicative Linear Logic [PDF]
In this paper we investigate the notion of generalized connective for multiplicative linear logic. We introduce a notion of orthogonality for partitions of a finite set and we study the family of connectives which can be described by two orthogonal sets ...
Acclavio, Matteo, Maieli, Roberto
core +3 more sources
Backdoors for Linear Temporal Logic [PDF]
In the present paper, we introduce the backdoor set approach into the field of temporal logic for the global fragment of linear temporal logic. We study the parameterized complexity of the satisfiability problem parameterized by the size of the backdoor.
Meier, A. +3 more
openaire +6 more sources
Making first order linear logic a generating grammar [PDF]
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]
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
Sequent Systems for Consequence Relations of Cyclic Linear Logics
Linear 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

