arXiv (OAI Expanded)
open access
Expressive Power of Property Graph Constraint Languages
We present the first principled and systematic study of the expressive power of property graph constraint languages, focused on the recent PG-Keys language, set to inform the upcoming revision of the GQL standard. To this end, we position PG-Keys within the broader landscape of existing formalisms.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Flexible and Expressive Typed Path Patterns for GQL#336032
- The Semantic Elevation Operator and the Closure of the Undecidable Class under Preservation#998862
- Rewriting Ontology-Mediated Property Graph Queries into GQL#471324
- Syntax-driven Incremental Program Verification of Matching Logic Properties#267716
- Automated Termination Proving : contributions to Graph Rewriting via Extended Weighted Type Graphs and Morphism Counting#370840
Record · ID 1084152
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive