Suchergebnisse - "Logical Methods in Computer Science"

Logical Methods in Computer Science – Erfahrungsbericht über die Gründung einer internationalen Open-Access-Zeitschrift von Wolfgang Thomas, Stefan Milius

“… Logical Methods in Computer Science ist eine wissenschaftsgesteuerte Diamond-Open-Access-Zeitschrift im Gebiet der Theoretischen Informatik. Wir berichten …”
Volltext

Quotienting the delay monad by weak bisimilarity von CHAPMAN, JAMES, UUSTALU, TARMO, VELTRI, NICCOLÒ

“… The delay datatype was introduced by Capretta (Logical Methods in Computer Science, 1(2), article 1, 2005 …”
Volltext

Polynomial time ultrapowers and the consistency of circuit lower bounds von Bydžovský, Jan, Müller, Moritz

“… A polynomial time ultrapower is a structure given by the set of polynomial time computable functions modulo some ultrafilter. They model the universal theory ∀ …”
Volltext

A Mechanised Proof of Gödel’s Incompleteness Theorems Using Nominal Isabelle von Paulson, Lawrence C.

“… (Logical Methods in Computer Science 8 (2:14), 1–35, 2012 ) is shown to scale to a development of this complexity, while de Bruijn indices …”
Volltext

Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width von Campbell, Rutger, Guillon, Bruno, Kante, Mamadou Moustapha, Kim, Eun Jung, Oum, Sang-il

“… [Logical Methods in Computer Science 17(1), 2021] which asserts the equivalence of the two notions on graphs of bounded linear clique-width …”
Volltext

On naturally continuous non-dcpo domains von SAZONOV, VLADIMIR

“… ; Normann and Sazonov 2012 Annals of Pure and Applied Logic 163 (5) 575–603; Sazonov 2007 Logical Methods in Computer Science 3 (3:7) 1–50 …”
Volltext

History-deterministic Timed Automata von Bose, Sougata, Henzinger, Thomas A., Lehtinen, Karoliina, Schewe, Sven, Totzke, Patrick

“… We explore the notion of history-determinism in the context of timed automata (TA) over infinite timed words. History-deterministic (HD) automata are those in …”
Volltext

Shrub-depth: Capturing Height of Dense Graphs von Ganian, Robert, Hliněný, Petr, Nešetřil, Jaroslav, Obdržálek, Jan, de Mendez, Patrice Ossona

“… The recent increase of interest in the graph invariant called tree-depth and in its applications in algorithms and logic on graphs led to a natural question: …”
Volltext

Token Games and History-Deterministic Quantitative-Automata von Boker, Udi, Lehtinen, Karoliina

“… A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved by only considering the prefix of the word read so far. Due to …”
Volltext

Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) von Dudenhefner, Andrej

“… Semi-unification is the combination of first-order unification and first-order matching. The undecidability of semi-unification has been proven by Kfoury, …”
Volltext

Good-for-games $\omega$-Pushdown Automata von Lehtinen, Karoliina, Zimmermann, Martin

“… We introduce good-for-games $\omega$-pushdown automata ($\omega$-GFG-PDA). These are automata whose nondeterminism can be resolved based on the input processed …”
Volltext

Superposition for Lambda-Free Higher-Order Logic von Bentkamp, Alexander, Blanchette, Jasmin, Cruanes, Simon, Waldmann, Uwe

“… We introduce refutationally complete superposition calculi for intentional and extensional clausal $\lambda$-free higher-order logic, two formalisms that allow …”
Volltext

Games Where You Can Play Optimally with Arena-Independent Finite Memory von Bouyer, Patricia, Roux, Stéphane Le, Oualhadj, Youssouf, Randour, Mickael, Vandenhove, Pierre

“… For decades, two-player (antagonistic) games on graphs have been a framework of choice for many important problems in theoretical computer science. A notorious …”
Volltext

Deciding All Behavioral Equivalences at Once: A Game for Linear-Time--Branching-Time Spectroscopy von Bisping, Benjamin, Jansen, David N, Nestmann, Uwe

“… We introduce a generalization of the bisimulation game that finds distinguishing Hennessy-Milner logic formulas from every finitary, subformula-closed language …”
Volltext

Completeness of the ZX-Calculus von Jeandel, Emmanuel, Perdrix, Simon, Vilmart, Renaud

“… The ZX-Calculus is a graphical language for diagrammatic reasoning in quantum mechanics and quantum information theory. It comes equipped with an equational …”
Volltext

The Many-Worlds Calculus von Chardonnet, Kostia, de Visme, Marc, Valiron, Benoît, Vilmart, Renaud

“… In this paper, we explore the interaction between two monoidal structures: a multiplicative one, for the encoding of pairing, and an additive one, for the …”
Volltext

SAT-Inspired Higher-Order Eliminations von Blanchette, Jasmin, Vukmirović, Petar

“… We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques …”
Volltext

Characterising memory in infinite games von Casares, Antonio, Ohlmann, Pierre

“… This paper is concerned with games of infinite duration played over potentially infinite graphs. Recently, Ohlmann (LICS 2022) presented a characterisation of …”
Volltext

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^$ is Even Harder von Fortin, Marie, Kuijer, Louwe B., Totzke, Patrick, Zimmermann, Martin

“… Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most …”
Volltext

Disentangling Parallelism and Interference in Game Semantics von Castellan, Simon, Clairambault, Pierre

“… Game semantics is a denotational semantics presenting compositionally the computational behaviour of various kinds of effectful programs. One of its celebrated …”
Volltext