On the public citation graph
TriAL
0 signed · 68 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcss.2001.1805openalex-snapshot
Rewriting of Regular Expressions and Regular Path Queries
inferredcites →https://doi.org/10.1007/978-3-319-25007-6_1openalex-snapshot
SPARQL with Property Paths
inferredcites →https://doi.org/10.1007/978-3-319-46547-0_10openalex-snapshot
Querying Wikidata: Comparing SPARQL, Relational and Graph Databases
inferredcites →https://doi.org/10.1007/978-3-540-31839-2_8openalex-snapshot
Triadic Relations: An Algebra for the Semantic Web
inferredcites →https://doi.org/10.1007/978-3-540-88564-1_5openalex-snapshot
nSPARQL: A Navigational Language for RDF
inferredcites →https://doi.org/10.1007/978-3-642-28472-4_8openalex-snapshot
The Impact of Transitive Closure on the Boolean Expressiveness of Navigational Query Languages on Graphs
inferredcites →https://doi.org/10.1007/978-3-662-07003-1openalex-snapshot
Elements of Finite Model Theory
inferredcites →https://doi.org/10.1007/978-3-662-47666-6_5openalex-snapshot
Provenance Circuits for Trees and Treelike Instances
inferredcites →https://doi.org/10.1007/s00224-016-9676-2openalex-snapshot
Regular Queries on Graph Databases
inferredcites →https://doi.org/10.1016/j.ins.2014.11.031openalex-snapshot
Relative expressive power of navigational querying on graphs
inferredcites →https://doi.org/10.1016/j.websem.2005.06.005openalex-snapshot
LUBM: A benchmark for OWL knowledge base systems
inferredcites →https://doi.org/10.1016/j.websem.2010.01.002openalex-snapshot
nSPARQL: A navigational language for RDF
inferredcites →https://doi.org/10.1017/s1471068402001412openalex-snapshot
Dynamic Logic by David Harel, Dexter Kozen and Jerzy Tiuryn. The MIT Press, Cambridge, Massachusetts. Hardback: ISBN 0–262–08289–6, $50, xv + 459 pages
inferredcites →https://doi.org/10.1080/01969727208548639openalex-snapshot
Further Towards a Triadic Calculus Part 1
inferredcites →https://doi.org/10.1080/11663081.2013.798992openalex-snapshot
On the relation between SPARQL1.1 and Answer Set Programming
inferredcites →https://doi.org/10.1090/coll/041openalex-snapshot
A Formalization of Set Theory without Variables
inferredcites →https://doi.org/10.1109/icde.2011.5767858openalex-snapshot
Adding regular expressions to graph reachability and pattern queries
inferredcites →https://doi.org/10.1109/icdew.2012.31openalex-snapshot
A Comparison of Current Graph Database Models
inferredcites →https://doi.org/10.1109/tkde.2016.2633993openalex-snapshot
gMark: Schema-Driven Generation of Graphs and Queries
inferredcites →https://doi.org/10.1145/1322432.1322433openalex-snapshot
Survey of graph database models
inferredcites →https://doi.org/10.1145/1567274.1567278openalex-snapshot
Semantics and complexity of SPARQL
inferredcites →https://doi.org/10.1145/1938551.1938578openalex-snapshot
Relative expressive power of navigational querying on graphs
inferredcites →https://doi.org/10.1145/1989284.1989312openalex-snapshot
Querying semantic web data with SPARQL
inferredcites →https://doi.org/10.1145/1989323.1989456openalex-snapshot
Datalog and emerging applications
inferredcites →https://doi.org/10.1145/212433.212474openalex-snapshot
On the complexity of bounded-variable queries (extended abstract)
inferredcites →https://doi.org/10.1145/2206869.2206879openalex-snapshot
Query languages for graph databases
inferredcites →https://doi.org/10.1145/2213556.2213573openalex-snapshot
The complexity of evaluating path expressions in SPARQL
inferredcites →https://doi.org/10.1145/2448496.2448513openalex-snapshot
Querying graph databases with XPath
inferredcites →https://doi.org/10.1145/2448496.2448520openalex-snapshot
Schema mappings and data exchange for graph databases
inferredcites →https://doi.org/10.1145/2484425.2484440openalex-snapshot
Benchmarking database systems for social network applications
inferredcites →https://doi.org/10.1145/2594538.2594555openalex-snapshot
Expressive languages for querying the semantic web
inferredcites →https://doi.org/10.1145/303976.303996openalex-snapshot
Rewriting of regular expressions and regular path queries
inferredcites →https://doi.org/10.1145/38713.38749openalex-snapshot
A graphical query language supporting recursion
inferredcites →https://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferredcites →https://doi.org/10.1145/959060.959076openalex-snapshot
Reasoning on regular path queries
inferredcites →https://doi.org/10.1145/962446.962450openalex-snapshot
Monadic datalog and the expressive power of languages for Web information extraction
inferredcites →https://doi.org/10.14778/3402755.3402810openalex-snapshot
Graph data management systems for new application domains
inferredcites →https://doi.org/10.2307/2369451openalex-snapshot
On the Algebra of Logic: A Contribution to the Philosophy of Notation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-33223-5_35openalex-snapshot
HIKE: A Step Beyond Data Exchange
inferred← citeshttps://doi.org/10.1007/978-3-030-59416-9_25openalex-snapshot
Semantic Region Retrieval from Spatial RDF Data
inferred← citeshttps://doi.org/10.1007/978-3-031-11669-8_4openalex-snapshot
Persistence of Fuzzy RDF and Fuzzy RDF Schema
inferred← citeshttps://doi.org/10.1007/s00778-019-00591-8openalex-snapshot
Top-k relevant semantic place retrieval on spatiotemporal RDF data
inferred← citeshttps://doi.org/10.1007/s12065-022-00715-0openalex-snapshot
Research on storage method for fuzzy RDF graph based on Neo4j
inferred← citeshttps://doi.org/10.1007/s12145-021-00574-wopenalex-snapshot
RDF for temporal data management – a survey
inferred← citeshttps://doi.org/10.1007/s13222-019-00312-zopenalex-snapshot
Transforming Heterogeneous Data into Knowledge for Personalized Treatments—A Use Case
inferred← citeshttps://doi.org/10.1016/j.is.2021.101816openalex-snapshot
Practical and comprehensive formalisms for modelling contemporary graph query languages
inferred← citeshttps://doi.org/10.1109/bigdata59044.2023.10386910openalex-snapshot
Ontology-Based Generation of Data Platform Assets
inferred← citeshttps://doi.org/10.1109/iccece54139.2022.9712796openalex-snapshot
An Algebra Supporting Semantic Query for Graph Data Model
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00025openalex-snapshot
Evaluating Complex Queries on Streaming Graphs
inferred← citeshttps://doi.org/10.1145/3365109.3368782openalex-snapshot
A Schema-First Formalism for Labeled Property Graph Databases
inferred← citeshttps://doi.org/10.1145/3709722openalex-snapshot
Schema-Based Query Optimisation for Graph Databases
inferred← citeshttps://doi.org/10.1186/s40537-025-01094-wopenalex-snapshot
Modelling big data platforms as knowledge graphs: the data platform shaper
inferred← citeshttps://doi.org/10.46298/lmcs-17(3:27)2021openalex-snapshot
Modular Path Queries with Arithmetic
inferred← citeshttps://doi.org/10.48550/arxiv.2108.13744openalex-snapshot
The Horn Non-Clausal Class and its Polynomiality
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.