Cites work
- Characterizing definability in decidable fixpoint logics
- Complexity classes between $\Theta _k^P$ and $\Delta _k^P$
- Effective interpolation and preservation in guarded logics
- Guarded negation
- scientific article; zbMATH DE number 1346360 (Why is no real title available?)
- scientific article; zbMATH DE number 1059246 (Why is no real title available?)
- scientific article; zbMATH DE number 757645 (Why is no real title available?)
- Modal languages and bounded fragments of predicate logic
- Modal logic
- On the Restraining Power of Guards
- Provenance analysis for logic and games
- Querying the Guarded Fragment
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- The freedoms of (guarded) bisimulation
Cited in
(7)- On the expressive power of message-passing neural networks as global feature map transformers
- scientific article; zbMATH DE number 6215728 (Why is no real title available?)
- Semiring provenance for Büchi games: strategy analysis with absorptive polynomials
- Semiring provenance for Büchi games: strategy analysis with absorptive polynomials
- Semiring provenance for fixed-point logic
- Ehrenfeucht-Fraïssé games in semiring semantics
- Provenance analysis and semiring semantics for first-order logic
This page was built for publication: Semiring Provenance for Guarded Logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5015965)