On the public citation graph

Graph grammars and logic programming

0 signed · 36 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-17162-2_139openalex-snapshot

A categorical unification algorithm

inferredcites →https://doi.org/10.1007/3-540-17945-3_8openalex-snapshot

Term graph rewriting

inferredcites →https://doi.org/10.1007/3-540-18771-5openalex-snapshot

Graph-Grammars and Their Application to Computer Science

inferredcites →https://doi.org/10.1007/3-540-18771-5_40openalex-snapshot

Tutorial introduction to the algebraic approach of graph grammars

inferredcites →https://doi.org/10.1007/3-540-18771-5_72openalex-snapshot

Graph rewriting with unification and composition

inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot

Categories for the Working Mathematician

inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot

Foundations of Logic Programming

inferredcites →https://doi.org/10.1007/bf01692060openalex-snapshot

Graph expressions and graph rewritings

inferredcites →https://doi.org/10.1007/bfb0000094openalex-snapshot

Graph-Grammars and Their Application to Computer Science

inferredcites →https://doi.org/10.1007/bfb0000099openalex-snapshot

Aspects of concurrency in graph grammars

inferredcites →https://doi.org/10.1007/bfb0017372openalex-snapshot

Graph Grammars and Their Application to Computer Science

inferredcites →https://doi.org/10.1007/bfb0017408openalex-snapshot

Graph rewriting in some categories of partial morphisms

inferredcites →https://doi.org/10.1007/bfb0025713openalex-snapshot

Graph-Grammars and Their Application to Computer Science and Biology

inferredcites →https://doi.org/10.1016/0304-3975(84)90021-5openalex-snapshot

On graph rewritings

inferredcites →https://doi.org/10.1016/0304-3975(87)90079-xopenalex-snapshot

On “on graph rewritings”

inferredcites →https://doi.org/10.1016/0304-3975(89)90070-4openalex-snapshot

Declarative modeling of the operational behavior of logic languages

inferredcites →https://doi.org/10.1016/b978-0-12-046370-1.50012-7openalex-snapshot

What Is Unification?

inferredcites →https://doi.org/10.1016/s0019-9958(84)80021-2openalex-snapshot

A synchronization logic: Axiomatics and formal semantics of generalized horn clauses

inferredcites →https://doi.org/10.1017/s0960129500001353openalex-snapshot

Parallelism and concurrency in high-level replacement systems

inferredcites →https://doi.org/10.1109/swat.1973.11openalex-snapshot

Graph-grammars: An algebraic approach

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-53982-4_16openalex-snapshot

Logic programming as hypergraph Rewriting

inferred← citeshttps://doi.org/10.1007/3-540-57787-4_8openalex-snapshot

Jungle rewriting: An abstract description of a lazy narrowing machine

inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_2openalex-snapshot

Ugo Montanari and Graph Transformation

inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_37openalex-snapshot

Representation and Execution of a Graph Grammar in Prolog

inferred← citeshttps://doi.org/10.1007/bf03036461openalex-snapshot

A kernel language for programmed rewriting of (hyper)graphs

inferred← citeshttps://doi.org/10.1007/bfb0013469openalex-snapshot

An algebra of graphs and graph rewriting

inferred← citeshttps://doi.org/10.1007/bfb0013816openalex-snapshot

High-level-replacement systems for equational algebraic specifications

inferred← citeshttps://doi.org/10.1007/bfb0017395openalex-snapshot

From graph grammars to high level replacement systems

inferred← citeshttps://doi.org/10.1016/0304-3975(93)90063-yopenalex-snapshot

Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming

inferred← citeshttps://doi.org/10.1016/0304-3975(93)90069-6openalex-snapshot

Graph rewriting for a partial ordering semantics of concurrent constraint programming

inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80050-9openalex-snapshot

The translation power of top-down tree-to-graph transducers

inferred← citeshttps://doi.org/10.1016/s0167-6423(98)00023-9openalex-snapshot

Graph transformation for specification and programming

inferred← citeshttps://doi.org/10.1017/s0960129500001353openalex-snapshot

Parallelism and concurrency in high-level replacement systems

inferred← citeshttps://doi.org/10.1109/21.328912openalex-snapshot

Graph-grammar assistance for automated generation of influence diagrams

inferred← citeshttps://doi.org/10.1109/32.748921openalex-snapshot

Trace-based load characterization for generating performance software models

inferred← citeshttps://doi.org/10.1142/9789812814951_0007openalex-snapshot

DESCRIBING SYSTEMS OF PROCESSES BY MEANS OF HIGH-LEVEL REPLACEMENT

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.