Results 1 to 10 of about 823,326 (291)
Parametric Linear Dynamic Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear Dynamic Logic (LDL) by temporal operators equipped with parameters that bound their scope.
Peter Faymonville, Martin Zimmermann
doaj +16 more sources
Bulletin of the Section of Logic, 2023 A many-valued modal logic, called linear abelian modal logic \(\rm {\mathbf{LK(A)}}\) is introduced as an extension of the abelian modal logic \(\rm \mathbf{K(A)}\). Abelian modal logic \(\rm \mathbf{K(A)}\) is the minimal modal extension of the logic of
Hamzeh Mohammadi
doaj +3 more sources
Visibly Linear Dynamic Logic [PDF]
Theoretical Computer Science, 2015 We introduce Visibly Linear Dynamic Logic (VLDL), which extends Linear Temporal Logic (LTL) by temporal operators that are guarded by visibly pushdown languages over finite words.
Weinert, Alexander, Zimmermann, Martin
core +9 more sources
Taking Linear Logic Apart [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Process calculi based on logic, such as πDILL and CP, provide a foundation for deadlock-free concurrent programming. However, in previous work, there is a mismatch between the rules for constructing proofs and the term constructors of the π-calculus: the
Wen Kokke +2 more
doaj +7 more sources
Random Logic Programs: Linear Model [PDF]
Theory and Practice of Logic Programming, 2014 This paper proposes a model, the linear model, for randomly generating logic programs with low density of rules and investigates statistical properties of such random logic programs. It is mathematically shown that the average number of answer sets for a
Mu, Kedian, Wang, Kewen, Wen, Lian
core +5 more sources
A note on the expressive power of linear orders [PDF]
Logical Methods in Computer Science, 2011 This article shows that there exist two particular linear orders such that first-order logic with these two linear orders has the same expressive power as first-order logic with the Bit-predicate FO(Bit). As a corollary we obtain that there also exists a
Thomas Schwentick, Nicole Schweikardt
doaj +5 more sources
Two-Variable Logic with Two Order Relations [PDF]
Logical Methods in Computer Science, 2012 It is shown that the finite satisfiability problem for two-variable logic over structures with one total preorder relation, its induced successor relation, one linear order relation and some further unary relations is EXPSPACE-complete.
Thomas Schwentick, Thomas Zeume
doaj +3 more sources
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 +3 more sources
Formal Model of IDS Based on BDI Logic
Mathematics, 2021 Computer network security is an important aspect of computer science. Many researchers are trying to increase security using different methods, technologies, or tools.
Ján Perháč +3 more
doaj +1 more source
Towards Races in Linear Logic [PDF]
Logical Methods in Computer Science, 2020 Process calculi based in logic, such as $\pi$DILL and CP, provide a foundation for deadlock-free concurrent programming, but exclude non-determinism and races.
Wen Kokke +2 more
doaj +1 more source