Search Results - "Grädel, Erich"
-
1
Semiring Provenance for B\"uchi Games: Strategy Analysis with Absorptive Polynomials
Published in Logical methods in computer science (08-03-2024)“…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
Journal Article -
2
A Finite-Model-Theoretic View on Propositional Proof Complexity
Published in Logical methods in computer science (01-01-2019)“…We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of…”
Get full text
Journal Article -
3
Entanglement and the complexity of directed graphs
Published in Theoretical computer science (07-12-2012)“…Entanglement is a parameter for the complexity of finite directed graphs that measures to what extent the cycles of the graph are intertwined. It is defined by…”
Get full text
Journal Article -
4
Model-checking games for logics of imperfect information
Published in Theoretical computer science (01-07-2013)“…Logics of dependence and independence have semantics that, unlike Tarski semantics, are not based on single assignments (mapping variables to elements of a…”
Get full text
Journal Article -
5
On the Decision Problem for Two-Variable First-Order Logic
Published in The bulletin of symbolic logic (01-03-1997)“…We identify the computational complexity of the satisfiability problem for FO2, the fragment of first-order logic consisting of all relational first-order…”
Get full text
Journal Article -
6
Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence
Published in Annals of pure and applied logic (01-12-2022)“…We study hidden-variable models from quantum mechanics and their abstractions in purely probabilistic and relational frameworks by means of logics of…”
Get full text
Journal Article -
7
Limitations of the invertible-map equivalences
Published in Journal of logic and computation (25-07-2023)“…Abstract This note draws conclusions that arise by combining two recent papers, by Anuj Dawar, Erich Grädel and Wied Pakusa, published at ICALP 2019, and by…”
Get full text
Journal Article -
8
Dependence and Independence
Published in Studia logica (01-04-2013)“…We introduce an atomic formula $\overrightarrow{\mathrm{y}}{\perp }_{\overrightarrow{\mathrm{x}}}\overrightarrow{\mathrm{z}}$ intuitively saying that the…”
Get full text
Journal Article -
9
RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC
Published in The Journal of symbolic logic (01-03-2019)“…Motivated by the search for a logic for polynomial time, we study rank logic (FPR) which extends fixed-point logic with counting (FPC) by operators that…”
Get full text
Journal Article -
10
On the Restraining Power of Guards
Published in The Journal of symbolic logic (01-12-1999)“…Guarded fragments of first-order logic were recently introduced by Andreka, van Benthem and Nemeti; they consist of relational first-order formulae whose…”
Get full text
Journal Article -
11
Separation logic and logics with team semantics
Published in Annals of pure and applied logic (01-12-2022)“…Separation logic is a successful logical system for formal reasoning about programs that mutate their data structures. Team semantics, on the other side, is…”
Get full text
Journal Article -
12
Logics of dependence and independence: The local variants
Published in Journal of logic and computation (22-10-2021)“…Abstract Modern logics of dependence and independence are based on team semantics, which means that formulae are evaluated not on a single assignment of values…”
Get full text
Journal Article -
13
Semiring Provenance for Büchi Games: Strategy Analysis with Absorptive Polynomials
Published in Electronic proceedings in theoretical computer science (17-09-2021)Get full text
Journal Article -
14
Definability of linear equation systems over groups and rings
Published in Logical methods in computer science (14-11-2013)“…Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this…”
Get full text
Journal Article -
15
Model Checking Games for the Quantitative μ-Calculus
Published in Theory of computing systems (01-10-2010)“…We investigate quantitative extensions of modal logic and the modal μ -calculus, and study the question whether the tight connection between logic and games…”
Get full text
Journal Article -
16
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
Published in Electronic proceedings in theoretical computer science (07-10-2012)“…For some time the discrete strategy improvement algorithm due to Jurdzinski and Voge had been considered as a candidate for solving parity games in polynomial…”
Get full text
Journal Article -
17
-
18
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
Published in Theoretical computer science (04-12-2014)“…The problem whether winning regions and wining strategies for parity games can be computed in polynomial time is a major open problem in the field of infinite…”
Get full text
Journal Article -
19
Guarded fixed point logics and the monadic theory of countable trees
Published in Theoretical computer science (09-10-2002)“…Different variants of guarded logics (a powerful generalization of modal logics) are surveyed and an elementary proof for the decidability of guarded fixed…”
Get full text
Journal Article Conference Proceeding -
20
Model-Theoretic Properties of [omega]-Automatic Structures
Published in Theory of computing systems (01-11-2014)“…Issue Title: Theoretical Aspects of Computer Science We investigate structural properties of [omega]-automatic presentations of infinite structures in order to…”
Get full text
Journal Article