Search Results - Logical Methods in Computer Science e.V

Advanced Model Consistency Restoration with Higher-Order Short-Cut Rules by Fritsche, Lars, Kosiol, Jens, Lauer, Alexander, Möller, Adrian, Schürr, Andy

“…Sequential model synchronisation is the task of propagating changes from one model to another correlated one to restore consistency. It is challenging to…”
Get full text

Boolean proportions by Antić, Christian

“…The author has recently introduced an abstract algebraic framework of analogical proportions within the general setting of universal algebra. This paper…”
Get full text

Half-Positional Objectives Recognized by Deterministic B\"uchi Automata by Bouyer, Patricia, Casares, Antonio, Randour, Mickael, Vandenhove, Pierre

“…In two-player games on graphs, the simplest possible strategies are those that can be implemented without any memory. These are called positional strategies…”
Get full text

text{TT}^{\Box}_{\mathcal C}$: a Family of Extensional Type Theories with Effectful Realizers of Continuity by Cohen, Liron, Rahli, Vincent

“…$\text{TT}^{\Box}_{{\mathcal C}}$ is a generic family of effectful, extensional type theories with a forcing interpretation parameterized by modalities. This…”
Get full text

Characteristic Logics for Behavioural Hemimetrics via Fuzzy Lax Extensions by Wild, Paul, Schröder, Lutz

“…In systems involving quantitative data, such as probabilistic, fuzzy, or metric systems, behavioural distances provide a more fine-grained comparison of states…”
Get full text

Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features by Bednarczyk, Bartosz

“…We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics extending ALC. Our…”
Get full text

Inapproximability of Unique Games in Fixed-Point Logic with Counting by Tucker-Foltz, Jamie

“…We study the extent to which it is possible to approximate the optimal value of a Unique Games instance in Fixed-Point Logic with Counting (FPC). Formally, we…”
Get full text

Semiring Provenance for B\"uchi Games: Strategy Analysis with Absorptive Polynomials by Grädel, Erich, Lücking, Niels, Naaf, Matthias

“…This paper presents a case study for the application of semiring semantics for fixed-point formulae to the analysis of strategies in B\"uchi games. Semiring…”
Get full text

Varieties of unary-determined distributive $\ell$-magmas and bunched implication algebras by Alpay, Natanael, Jipsen, Peter, Sugimoto, Melissa

“…A distributive lattice-ordered magma ($d\ell$-magma) $(A,\wedge,\vee,\cdot)$ is a distributive lattice with a binary operation $\cdot$ that preserves joins in…”
Get full text

Arboreal Categories: An Axiomatic Theory of Resources by Abramsky, Samson, Reggio, Luca

“…Game comonads provide a categorical syntax-free approach to finite model theory, and their Eilenberg-Moore coalgebras typically encode important combinatorial…”
Get full text

Robustness against Read Committed for Transaction Templates with Functional Constraints by Vandevoort, Brecht, Ketsman, Bas, Koch, Christoph, Neven, Frank

“…The popular isolation level Multiversion Read Committed (RC) trades some of the strong guarantees of serializability for increased transaction throughput…”
Get full text

Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) by 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,…”
Get full text

Computing the Density of the Positivity Set for Linear Recurrence Sequences by Kelmendi, Edon

“…The set of indices that correspond to the positive entries of a sequence of numbers is called its positivity set. In this paper, we study the density of the…”
Get full text

Computing with Infinite Objects: the Gray Code Case by Spreen, Dieter, Berger, Ulrich

“…Infinite Gray code has been introduced by Tsuiki as a redundancy-free representation of the reals. In applications the signed digit representation is mostly…”
Get full text

Decision problems for linear recurrences involving arbitrary real numbers by Neumann, Eike

“…We study the decidability of the Skolem Problem, the Positivity Problem, and the Ultimate Positivity Problem for linear recurrences with real number initial…”
Get full text

Adding Negation to Lambda Mu by van Bakel, Steffen

“…We present $\cal L$, an extension of Parigot's $\lambda\mu$-calculus by adding negation as a type constructor, together with syntactic constructs that…”
Get full text

Deciding All Behavioral Equivalences at Once: A Game for Linear-Time--Branching-Time Spectroscopy by 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…”
Get full text

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

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

LNL polycategories and doctrines of linear logic by Shulman, Michael

“…We define and study LNL polycategories, which abstract the judgmental structure of classical linear logic with exponentials. Many existing structures can be…”
Get full text

Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties by Kapur, Deepak

“…Algorithms for computing congruence closure of ground equations over uninterpreted symbols and interpreted symbols satisfying associativity and commutativity…”
Get full text