Results 1 to 10 of about 1,385,742 (229)
Representations of Stream Processors Using Nested Fixed Points [PDF]
Logical Methods in Computer Science, 2009 We define representations of continuous functions on infinite streams of discrete values, both in the case of discrete-valued functions, and in the case of stream-valued functions.
Neil Ghani +2 more
doaj +1 more source
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations [PDF]
Logical Methods in Computer Science, 2008 Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilistic automata.
Lijun Zhang +3 more
doaj +1 more source
On the Complexity of Equivalence and Minimisation for Q-weighted Automata [PDF]
Logical Methods in Computer Science, 2013 This paper is concerned with the computational complexity of equivalence and minimisation for automata with transition weights in the field Q of rational numbers.
Stefan Kiefer +4 more
doaj +1 more source
Tractable Combinations of Temporal CSPs [PDF]
Logical Methods in Computer Science, 2022 The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T.
Manuel Bodirsky +2 more
doaj +1 more source
Barriers in Concurrent Separation Logic: Now With Tool Support! [PDF]
Logical Methods in Computer Science, 2012 We develop and prove sound a concurrent separation logic for Pthreads-style barriers. Although Pthreads barriers are widely used in systems, and separation logic is widely used for verification, there has not been any effort to combine the two.
Aquinas Hobor, Cristian Gherghina
doaj +1 more source
Bootstrapping Inductive and Coinductive Types in HasCASL [PDF]
Logical Methods in Computer Science, 2008 We discuss the treatment of initial datatypes and final process types in the wide-spectrum language HasCASL. In particular, we present specifications that illustrate how datatypes and process types arise as bootstrapped concepts using HasCASL's type ...
Lutz Schröder
doaj +1 more source
Logical Methods in Computer Science, 2018 We introduce ologisms. They generate from ologs by extending their logical expressivity, from the possibility of considering constraints of equational nature only to the possibility of considering constraints of syllogistic nature, in addition.
Ruggero Pagnan
doaj +1 more source
Frontiers in Plant Science, 2023 Fungal infections adversely influence the production and quality of seeds. Previously, Fusarium solani was reported as the causal agent of roselle (Hibiscus sabdariffa L.) seed rot. This study was designed to evaluate the effect of F. solani infection on
Aminallah Tahmasebi +4 more
doaj +1 more source
Logics for Unranked Trees: An Overview [PDF]
Logical Methods in Computer Science, 2006 Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing ...
Leonid Libkin
doaj +1 more source
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems [PDF]
Logical Methods in Computer Science, 2020 The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.
Manuel Bodirsky, Johannes Greiner
doaj +1 more source