Semiring provenance for Büchi games: strategy analysis with absorptive polynomials
From MaRDI portal
Publication:6649515
DOI10.4204/EPTCS.346.5MaRDI QIDQ6649515
Niels Lücking, Matthias Naaf, Erich Grädel
Publication date: 6 December 2024
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?)
- 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
- 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
Related Items (1)
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 Q6649515)
