Results 41 to 50 of about 779,559 (291)
Complexity of ITL model checking: some well-behaved fragments of the interval logic HS
, 2015 Model checking has been successfully used in many computer science fields, including artificial intelligence, theoretical computer science, and databases.
Molinari, A., Montanari, A., Peron, A.
core +1 more source
Specifying and Verifying Properties of Space - Extended Version [PDF]
, 2014 The interplay between process behaviour and spatial aspects of computation has become more and more relevant in Computer Science, especially in the field of collective adaptive systems, but also, more generally, when dealing with systems distributed in ...
Ciancia, Vincenzo +3 more
core +2 more sources
Thin Games with Symmetry and Concurrent Hyland-Ong Games [PDF]
Logical Methods in Computer Science, 2019 We build a cartesian closed category, called Cho, based on event structures. It allows an interpretation of higher-order stateful concurrent programs that is refined and precise: on the one hand it is conservative with respect to standard Hyland-Ong ...
Simon Castellan +2 more
doaj +1 more source
Introduction to Iltis: An Interactive, Web-Based System for Teaching Logic
, 2018 Logic is a foundation for many modern areas of computer science. In artificial intelligence, as a basis of database query languages, as well as in formal software and hardware verification --- modelling scenarios using logical formalisms and inferring ...
Geck, Gaetano +5 more
core +1 more source
The Pebble-Relation Comonad in Finite Model Theory [PDF]
Logical Methods in Computer ScienceThe pebbling comonad, introduced by Abramsky, Dawar and Wang, provides a categorical interpretation for the k-pebble games from finite model theory.
Yoàv Montacute, Nihil Shah
doaj +1 more source
Applicable Mathematics in a Minimal Computational Theory of Sets [PDF]
Logical Methods in Computer Science, 2018 In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.
Arnon Avron, Liron Cohen
doaj +1 more source
Preservation and decomposition theorems for bounded degree structures [PDF]
, 2015 We provide elementary algorithms for two preservation theorems for first-order sentences (FO) on the class \^ad of all finite structures of degree at most d: For each FO-sentence that is preserved under extensions (homomorphisms) on \^ad, a \^ad ...
Harwath, Frederik +2 more
core +2 more sources
Completions of Kleene's second model [PDF]
Logical Methods in Computer ScienceWe investigate completions of partial combinatory algebras (pcas), in particular of Kleene's second model $\mathcal{K}_2$ and generalizations thereof. We consider weak and strong notions of embeddability and completion that have been studied before in ...
Sebastiaan A. Terwijn
doaj +1 more source
Logical consequences. Theory and applications: An introduction. [PDF]
, 2020 2nd edition. The theory of logical consequence is central in modern logic and its applications. However, it is mostly dispersed in an abundance of often difficultly accessible papers, and rarely treated with applications in mind.
Augusto, Luis M.
core
Deciding Equations in the Time Warp Algebra [PDF]
Logical Methods in Computer ScienceJoin-preserving maps on the discrete time scale $\omega^+$, referred to as time warps, have been proposed as graded modalities that can be used to quantify the growth of information in the course of program execution. The set of time warps forms a simple
Sam van Gool +3 more
doaj +1 more source