Results 31 to 40 of about 1,821,618 (323)
Decision procedure for a fragment of dynamic logic
Lietuvos Matematikos Rinkinys, 2001 There is not abstract.
Aida Pliuškevičienė
doaj +3 more sources
MALL proof equivalence is Logspace-complete, via binary decision diagrams [PDF]
, 2015 Proof equivalence in a logic is the problem of deciding whether two proofs are equivalent modulo a set of permutation of rules that reflects the commutative conversions of its cut-elimination procedure. As such, it is related to the question of proofnets:
Bagnol, Marc
core +3 more sources
Using Program Synthesis for Program Analysis [PDF]
, 2015 In this paper, we identify a fragment of second-order logic with restricted quantification that is expressive enough to capture numerous static analysis problems (e.g.
David, Cristina +2 more
core +3 more sources
Negational Fragment of Intuitionistic Control Logic [PDF]
, 2014 We investigate properties of monadic purely negational fragment of Intuitionistic Control Logic (ICL). This logic arises from Intuitionistic Propositional Logic (IPL) by extending language of IPL by additional new constant for falsum.
Glenszczyk, Anna
core +3 more sources
Control of Mobile Robots Using Barrier Functions Under Temporal Logic Specifications [PDF]
IEEE Transactions on robotics, 2019 In this article, we propose a framework for the control of mobile robots subject to temporal logic specifications using barrier functions. Complex task specifications can be conveniently encoded using linear temporal logic.
Mohit Srinivasan, S. Coogan
semanticscholar +1 more source
Weighted First-Order Model Counting in the Two-Variable Fragment With Counting Quantifiers [PDF]
Journal of Artificial Intelligence Research, 2020 It is known due to the work of Van den Broeck, Meert and Darwiche that weighted first-order model counting (WFOMC) in the two-variable fragment of first-order logic can be solved in time polynomial in the number of domain elements.
Ondřej Kuželka
semanticscholar +1 more source
A Probabilistic Temporal Logic with Frequency Operators and Its Model Checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL) are often used to describe specifications of probabilistic properties for discrete time and continuous time, respectively.
Takashi Tomita +2 more
doaj +1 more source
Autonomous Agents and Multi-Agent Systems, 2014 The paper deals with symbolic approaches to bounded model checking (BMC) for the existential fragment of linear temporal logic extended with the epistemic component (ELTLK), interpreted over interleaved interpreted systems.
Artur Meski +4 more
semanticscholar +1 more source
From formulas to cirquents in computability logic [PDF]
Logical Methods in Computer Science, 2011 Computability logic (CoL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently introduced semantical platform and ambitious program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic ...
Giorgi Japaridze
doaj +1 more source
One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity
Bulletin of the Section of Logic, 2021 Bilinear Logic of Lambek amounts to Noncommutative MALL of Abrusci. Lambek proves the cut–elimination theorem for a one-sided (in fact, left-sided) sequent system for this logic.
Paweł Płaczek
doaj +1 more source