Suchergebnisse - Logical Methods in Computer Science e.V

Feasability of Learning Weighted Automata on a Semiring von Daviaud, Laure, Johnson, Marianne

“… Since the seminal work by Angluin and the introduction of the L*-algorithm, active learning of automata by membership and equivalence queries has been …”
Volltext

Exploiting Uncertainty for Querying Inconsistent Description Logics Knowledge Bases von Zese, Riccardo, Lamma, Evelina, Riguzzi, Fabrizio

“… The necessity to manage inconsistency in Description Logics Knowledge Bases (KBs) has come to the fore with the increasing importance gained by the Semantic …”
Volltext

The Identity Problem in the special affine group of $\mathbb{Z}^2 von Dong, Ruiwen

“… We consider semigroup algorithmic problems in the Special Affine group $\mathsf{SA}(2, \mathbb{Z}) = \mathbb{Z}^2 \rtimes \mathsf{SL}(2, \mathbb{Z})$, which is …”
Volltext

Arboreal Categories: An Axiomatic Theory of Resources von 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 …”
Volltext

The categorical contours of the Chomsky-Sch\"utzenberger representation theorem von Melliès, Paul-André, Zeilberger, Noam

“… We develop fibrational perspectives on context-free grammars and on nondeterministic finite-state automata over categories and operads. A generalized CFG is a …”
Volltext

The Shapley Value of Inconsistency Measures for Functional Dependencies von Livshits, Ester, Kimelfeld, Benny

“… Quantifying the inconsistency of a database is motivated by various goals including reliability estimation for new datasets and progress indication in data …”
Volltext

Modalities in homotopy type theory von Rijke, Egbert, Shulman, Michael, Spitters, Bas

“… Univalent homotopy type theory (HoTT) may be seen as a language for the category of $\infty$-groupoids. It is being developed as a new foundation for …”
Volltext

Checkpoint-based rollback recovery in session programming von Mezzina, Claudio Antares, Tiezzi, Francesco, Yoshida, Nobuko

“… To react to unforeseen circumstances or amend abnormal situations in communication-centric systems, programmers are in charge of "undoing" the interactions …”
Volltext

Advanced Model Consistency Restoration with Higher-Order Short-Cut Rules von 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 …”
Volltext

Half-Positional Objectives Recognized by Deterministic B\"uchi Automata von 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 …”
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

text{TT}^{\Box}_{\mathcal C}$: a Family of Extensional Type Theories with Effectful Realizers of Continuity von 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 …”
Volltext

Inapproximability of Unique Games in Fixed-Point Logic with Counting von 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 …”
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

Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features von 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 …”
Volltext

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility von Lin, Anthony W., Majumdar, Rupak

“… Word equations are a crucial element in the theoretical foundation of constraint solving over strings. A word equation relates two words over string variables …”
Volltext

Computing the Density of the Positivity Set for Linear Recurrence Sequences von 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 …”
Volltext

Semiring Provenance for B\"uchi Games: Strategy Analysis with Absorptive Polynomials von 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 …”
Volltext

Varieties of unary-determined distributive $\ell$-magmas and bunched implication algebras von 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 …”
Volltext

Optimizing tree decompositions in MSO von Bojańczyk, Mikołaj, Pilipczuk, Michał

“… The classic algorithm of Bodlaender and Kloks [J. Algorithms, 1996] solves the following problem in linear fixed-parameter time: given a tree decomposition of …”
Volltext