Abstract semantic graph

Known as: 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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1965-2018
024619652018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Based on a simple metric and a simple partial order on term graphs, we develop two infinitary calculi of term graph rewriting. We… (More)
Is this relevant?
2011
2011
Term graph rewriting provides a simple mechanism to finitely represent restricted forms of infinitary term rewriting. The… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Most existing text classification methods (and text mining methods at large) are based on representing the documents using the… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
1999
1999
Wolfram Kahl Universit at der Bundeswehr M unchen, D-85577 Neubiberg, Germany 1 Motivation Programmers of Haskell or ML know… (More)
Is this relevant?
1998
1998
Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the… (More)
  • figure 1
  • figure 2
Is this relevant?
1996
1996
Received 1. Abstract We show that for every term graph in a left-linear but non-orthogonal term graph rewrite system, one can… (More)
Is this relevant?
1996
1996
We introduce term graph narrowing as an approach for solving equations by transformations on term graphs. Term graph narrowing… (More)
Is this relevant?
1995
1995
O. Introduction. In this paper we will discuss in an informM way some aspects of t@rm graph rewriting. We will indicate why this… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1994
1994
Algebraic graph rewriting, which works by first removing the part of the graph to be regarded as garbage, and then gluing in the… (More)
Is this relevant?
1993
1993
Dealing properly with sharing is important for expressing some of the common compiler optimizations as source-to-source… (More)
Is this relevant?