All Fields
Computer Science
Medicine
FAQ
Contact
Sign in
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
0
2
4
6
1965
2018
Related topics
Related topics
21 relations
Abstract syntax
Abstract syntax tree
Common subexpression elimination
Compiler
(More)
Related mentions per year
Related mentions per year
1936-2018
1940
1960
1980
2000
2020
Abstract semantic graph
Iteration
Compiler
Computer science
Intermediate representation
Programming language
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Infinitary Term Graph Rewriting is Simple, Sound and Complete
Patrick Bahr
RTA
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
Modes of Convergence for Term Graph Rewriting
Patrick Bahr
RTA
2011
Term graph rewriting provides a simple mechanism to finitely represent restricted forms of infinitary term rewriting. The…Â
(More)
Is this relevant?
2005
2005
Term Graph Model for Text Classification
Wei Wang
,
Diep Bich Do
,
Xuemin Lin
ADMA
2005
Most existing text classification methods (and text mining methods at large) are based on representing the documents using the…Â
(More)
Is this relevant?
1999
1999
The Term Graph Programming System HOPS
Wolfram Kahl
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
Complete Strategies for Term Graph Narrowing
Annegret Habel
,
Detlef Plump
WADT
1998
Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the…Â
(More)
Is this relevant?
1996
1996
Event Structures and Non-Orthogonal Term Graph Rewriting
David Clark
,
Richard Kennaway
Mathematical Structures in Computer Science
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
Term Graph Narrowing 3
Annegret Habel
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
Term Graph Rewriting
Jan Willem Klop
HOA
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)
Is this relevant?
1994
1994
The Contractum in Algebraic Graph Rewriting
Richard Banach
TAGT
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
Relating graph and term rewriting via Böhm models
Zena M. Ariola
Applicable Algebra in Engineering, Communication…
1993
Dealing properly with sharing is important for expressing some of the common compiler optimizations as source-to-source…Â
(More)
Is this relevant?