Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Abstract semantic graph

Known as: ASG, Term graph 
In computer science, an abstract semantic graph (ASG) or term graph is a form of abstract syntax in which an expression of a formal or programming… Expand
Wikipedia

Related topics

Related topics

21 relations
Abstract syntaxAbstract syntax treeCommon subexpression eliminationCompiler
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
From Infinitary Term Rewriting to Cyclic Term Graph Rewriting and back
��������� � �� ���������� Cyclic term graph rewriting has been shown to be adequate for simulating certain forms of infinitary… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Temporality in Link Prediction: Understanding Social Complexity
This article describes research into the discovery and modelling of emergent temporal phenomena in social networks. It summarizes… Expand
  • table 1
  • table 2
  • table 3
  • figure 2
  • table 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)
LEO-II is a standalone, resolution-based higher-order theorem prover designed for effective cooperation with specialist provers… Expand
  • figure 1
  • figure 2
Is this relevant?
2003
2003
Term Graph Rewriting for the pi-Calculus
We propose a graphical implementation for (possibly) recursive processes of the π-calculus, encoding each process into a term… Expand
Is this relevant?
2002
2002
Coalgebraic Monads
This paper introduces coalgebraic monads as a unified model of term algebras covering fundamental examples such as initial… Expand
Is this relevant?
1993
1993
The adequacy of term graph rewriting for simulating term rewriting
 
Is this relevant?
1990
1990
Redex Capturing in Term Graph Rewriting
Term graphs are a natural generalization of terms in which structure sharing is allowed. Structure sharing makes term graph… Expand
Is this relevant?
1990
1990
Graph Rewriting in Some Categories of Partial Morphisms
  • Richard Kennaway
  • Graph-Grammars and Their Application to Computer…
  • 1990
    • Corpus ID: 9281577
We present a definition of term graph rewriting as the taking of a pushout in a category of partial morphisms, adapting the… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 8
Is this relevant?
1989
1989
A dichromatic polynomial for weighted graphs and link polynomials
A dichromatic polynomial for weighted graphs is presented. The Kauffman bracket of a signed graph, an invariant inspired by the… Expand
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1985
1985
Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
On etablit des conditions d'existence de circuits hamiltoniens dans des graphes, basees sur les degres des sommets et on formule… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE