Results 51 to 60 of about 1,803,872 (361)

How big is BCI fragment of BCK logic [PDF]

Journal of Logic and Computation, 2011
We investigate quantitative properties of BCI and BCK logics. The first part of the article compares the number of formulas provable in BCI versus BCK logics. We consider formulas built on implication and a fixed set of k variables.
Katarzyna Grygiel, P. Idziak, M. Zaionc
semanticscholar   +1 more source

BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance

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, W. Penczek, M. Szreter, B. Wozna, A. Zbrzezny   +4 more
semanticscholar   +1 more source

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

On decidability of a fragment of intuitionistic predicate logic

Lietuvos Matematikos Rinkinys, 1999
There is not abstract.
Jolanta Kaušilaitė , Regimantas Pliuškevičius   +1 more
doaj   +3 more sources

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

Decidable fragments of many-sorted logic [PDF]

Journal of Symbolic Computation, 2007
AbstractMany natural specifications use types. We investigate the decidability of fragments of many-sorted first-order logic. We identified some decidable fragments and illustrated their usefulness by formalizing specifications considered in the literature. Often the intended interpretations of specifications are finite.
Mooly Sagiv, Aharon Abadi, Alexander Rabinovich   +2 more
openaire   +3 more sources

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

A Decidable Fragment of Separation Logic

Foundations of Software Technology and Theoretical Computer Science, 2004
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the stylized form of reasoning done in example program proofs. The fragment includes a predicate for describing linked list segments (a kind of reachability or transitive ...
Josh Berdine, Cristiano Calcagno, P. O'Hearn   +2 more
semanticscholar   +4 more sources

Covering and separation for logical fragments with modular predicates [PDF]

Logical Methods in Computer Science, 2019
For every class $\mathscr{C}$ of word languages, one may associate a decision problem called $\mathscr{C}$-separation. Given two regular languages, it asks whether there exists a third language in $\mathscr{C}$ containing the first language, while being ...
Thomas Place, Varun Ramanathan, Pascal Weil   +2 more
doaj   +1 more source

Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras [PDF]

, 2015
Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor.
Enqvist, Sebastian, Seifan, Fatemeh, Venema, Yde   +2 more
core   +3 more sources