Pages that link to "Item:Q4948538"
From MaRDI portal
The following pages link to On the Restraining Power of Guards (Q4948538):
Displaying 50 items.
- Finite satisfiability for guarded fixpoint logic (Q436331) (← links)
- Bisimulation quantifiers and uniform interpolation for guarded first order logic (Q481100) (← links)
- Complexity of hybrid logics over transitive frames (Q631089) (← links)
- First-order temporal verification in practice (Q851137) (← links)
- On the complexity of the two-variable guarded fragment with transitive guards (Q859827) (← links)
- On the complexity of division and set joins in the relational algebra (Q882434) (← links)
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972) (← links)
- Hyperresolution for guarded formulae (Q1404983) (← links)
- Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators (Q1432885) (← links)
- Decidable fragments of first-order temporal logics (Q1591203) (← links)
- Propositional epistemic logics with quantification over agents of knowledge (Q1743999) (← links)
- Guarded fixed point logics and the monadic theory of countable trees. (Q1853504) (← links)
- The finite graph problem for two-way alternating automata. (Q1874281) (← links)
- The guarded fragment with transitive guards (Q1877098) (← links)
- Modal and guarded characterisation theorems over finite transition systems (Q1886323) (← links)
- On logics with two variables (Q1960419) (← links)
- Exploiting forwardness: satisfiability and query-entailment in forward guarded fragment (Q2055791) (← links)
- Logical separability of labeled data examples under ontologies (Q2093388) (← links)
- A simple logic of functional dependence (Q2240545) (← links)
- A prover dealing with nominals, binders, transitivity and relation hierarchies (Q2303237) (← links)
- Propositional epistemic logics with quantification over agents of knowledge (an alternative approach) (Q2323640) (← links)
- A tableau based decision procedure for an expressive fragment of hybrid logic with binders, converse and global modalities (Q2351166) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- Resolution with order and selection for hybrid logics (Q2429982) (← links)
- An event-based fragment of first-order logic over intervals (Q2429992) (← links)
- Guards, bounds, and generalized semantics (Q2567341) (← links)
- Guarded fragments with constants (Q2567342) (← links)
- Deciding regular grammar logics with converse through first-order logic (Q2567343) (← links)
- The semijoin algebra and the guarded fragment (Q2567344) (← links)
- A guarded fragment for abstract state machines (Q2567346) (← links)
- Complexity of monodic guarded fragments over linear and real time (Q2576942) (← links)
- Computational complexity of theories of a binary predicate with a small number of variables (Q2696689) (← links)
- Decidable fragments of first-order modal logics (Q2758067) (← links)
- A Logical Approach to Data-Aware Automated Sequence Generation (Q2889859) (← links)
- Small substructures and decidability issues for first-order logic with two variables (Q2915891) (← links)
- Recent Advances in Datalog$$^\pm $$ (Q2970309) (← links)
- A Tableaux Based Decision Procedure for a Broad Class of Hybrid Formulae with Binders (Q3010363) (← links)
- Combining Theories: The Ackerman and Guarded Fragments (Q3172881) (← links)
- (Q3305347) (← links)
- Querying the Unary Negation Fragment with Regular Path Expressions. (Q3305361) (← links)
- Interpolation for extended modal languages (Q3370762) (← links)
- The two‐variable fragment with counting and equivalence (Q3460527) (← links)
- Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse (Q3541703) (← links)
- Repetitions and permutations of columns in the semijoin algebra (Q3625687) (← links)
- Description Logics (Q3638996) (← links)
- The Range of Modal Logic (Q4531586) (← links)
- SOME MODEL THEORY OF GUARDED NEGATION (Q4647097) (← links)
- Datalog and Its Extensions for Semantic Web Databases (Q4647813) (← links)
- Finite Conformal Hypergraph Covers and Gaifman Cliques in Finite Structures (Q4650305) (← links)
- Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues (Q4911144) (← links)