scientific article; zbMATH DE number 1341606
From MaRDI portal
Publication:4263155
zbMATH Open0937.03011MaRDI QIDQ4263155FDOQ4263155
Publication date: 22 September 1999
Title of this publication is not available (Why is that?)
Recommendations
decidabilitytree model propertyguarded logic\(\mu\)-calculusautomata-theoretic methodguarded fixed point logicmonadic theory of countable trees
Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)
Cited In (26)
- Guarded fixed point logics and the monadic theory of countable trees.
- Introduction to Guarded Logics
- Complexity of monodic guarded fragments over linear and real time
- Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments
- Axiomatizing the monodic fragment of first-order temporal logic
- Deciding regular grammar logics with converse through first-order logic
- Limited approximate bisimulations and the corresponding rough approximations
- Title not available (Why is that?)
- Relating Structure and Power: Comonadic Semantics for Computational Resources
- Title not available (Why is that?)
- Back and forth between guarded and modal logics
- First-Order Resolution Methods for Modal Logics
- Hyperresolution for guarded formulae
- Combining Theories: The Ackerman and Guarded Fragments
- Deciding the guarded fragments by resolution
- Decision procedures for BDI logics
- Bisimulation quantifiers and uniform interpolation for guarded first order logic
- Whither semantics?
- Guarded Negation
- Guards, bounds, and generalized semantics
- Title not available (Why is that?)
- The semijoin algebra and the guarded fragment
- Automata for Guarded Fixed Point Logics
- Guarded quantification in least fixed point logic
- Reasoning formally about database queries and updates
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263155)
