Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Path Logics for Querying Graphs: Combining Expressiveness and Efficiency: Label: en
Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results: Label: en
Finite Open-World Query Answering with Number Restrictions: Label: en
The Complexity of Boundedness for Guarded Logics: Label: en
The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable: Label: en
Improved Algorithms for One-Pair and k-Pair Streett Objectives: Label: en
Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives: Label: en
Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes: Label: en
The Parallel Intensionally Fully Abstract Games Model of PCF: Label: en
Nondeterminism in Game Semantics via Sheaves: Label: en
Star Height via Games: Label: en
Separating Regular Languages with Two Quantifiers Alternations: Label: en
Distributed Graph Automata: Label: en
Branching Bisimilarity on Normed BPA Is EXPTIME-Complete: Label: en
Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME: Label: en
Bisimilarity in Fresh-Register Automata: Label: en
On the Relative Usefulness of Fireballs: Label: en
Polarised Intermediate Representation of Lambda Calculus with Sums: Label: en
Programs for Cheap!: Label: en
Game Semantics for Type Soundness: Label: en
A Cubical Approach to Synthetic Homotopy Theory: Label: en
Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets: Label: en
Petri Automata for Kleene Allegories: Label: en
Demystifying Reachability in Vector Addition Systems: Label: en
Long-Run Average Behaviour of Probabilistic Vector Addition Systems: Label: en
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete: Label: en
Recent Developments in Quantitative Information Flow (Invited Tutorial): Label: en
Higher-Order Model Checking: An Overview: Label: en
Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow: Label: en
A Unifying Approach to the Gamma Question: Label: en
A Diagrammatic Axiomatisation for Qubit Entanglement: Label: en
Parallelism and Synchronization in an Infinitary Context: Label: en
Hyper Natural Deduction: Label: en
Regularity Preserving but Not Reflecting Encodings: Label: en
Feedback Turing Computability, and Turing Computability as Feedback: Label: en
Extending ALCQIO with Trees: Label: en
One Context Unification Problems Solvable in Polynomial Time: Label: en
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy: Label: en
Locally Finite Constraint Satisfaction Problems: Label: en
From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP: Label: en
Domains of Commutative C*-Subalgebras: Label: en
Descriptive Set Theory in the Category of Represented Spaces: Label: en
Extensions of Domain Maps in Differential and Integral Calculus: Label: en
Varieties of Languages in a Category: Label: en
A Fibrational Account of Local States: Label: en
A Complete Axiomatization of MSO on Infinite Trees: Label: en
Interpolation with Decidable Fixpoint Logics: Label: en
Defining Winning Strategies in Fixed-Point Logic: Label: en
Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras: Label: en
PDL Is the Bisimulation-Invariant Fragment of Weak Chain Logic: Label: en