Semiring Provenance for Guarded Logics

DOI10.1007/978-3-030-64187-0_3OpenAlexW2997110971MaRDI QIDQ5015965

Erich Grädel, Katrin M. Dannert

Publication date: 10 December 2021

Published in: Hajnal Andréka and István Németi on Unity of Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-64187-0_3

zbMATH Keywords

complexitymodal logicsemiring provenancemodel checking gamesguarded negationguarded logics

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Related Items (1)

On the expressive power of message-passing neural networks as global feature map transformers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modal languages and bounded fragments of predicate logic
• Provenance analysis for logic and games
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Complexity classes between $\Theta _k^P$ and $\Delta _k^P$
• On the Restraining Power of Guards
• Characterizing Definability in Decidable Fixpoint Logics
• The Freedoms of (Guarded) Bisimulation
• Effective Interpolation and Preservation in Guarded Logics
• Querying the Guarded Fragment
• Guarded Negation

This page was built for publication: Semiring Provenance for Guarded Logics