Semiring provenance for Büchi games: strategy analysis with absorptive polynomials
From MaRDI portal
Publication:6563045
DOI10.46298/LMCS-20(1:21)2024MaRDI QIDQ6563045
Erich Grädel, Matthias Naaf, Niels Lücking
Publication date: 27 June 2024
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Games involving graphs (91A43) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite model theory and its applications.
- On database query languages for K-relations
- Monadic second-order logic on tree-like structures
- Automata, logics, and infinite games. A guide to current research
- Provenance analysis: a perspective for description logics?
- Provenance analysis for logic and games
- Computing least and greatest fixed points in absorptive semirings
- The mu-calculus and Model Checking
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition
- Defining Winning Strategies in Fixed-Point Logic
- Semiring Provenance for Guarded Logics
- Computer Science Logic
- Semiring provenance for Büchi games: strategy analysis with absorptive polynomials
This page was built for publication: Semiring provenance for Büchi games: strategy analysis with absorptive polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563045)
