Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,930,752 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
21 relations
Abstract syntax
Abstract syntax tree
Common subexpression elimination
Compiler
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
RCFGED: Retrospective Coarse and Fine-Grained Event Detection from Online News
Chen Zhang
,
Hao Wang
,
Wei Wang
,
Fanjiang Xu
IEEE International Conference on Systems, Man and…
2015
Corpus ID: 11082297
Recently, Retrospective Event Detection attracts much attention. Most researches focus on detecting coarse-grained events or…
Expand
2012
2012
Employing document dependency in blog search
Mostafa Keikha
,
F. Crestani
,
Mark James Carman
J. Assoc. Inf. Sci. Technol.
2012
Corpus ID: 10417875
The goal in blog search is to rank blogs according to their recurrent relevance to the topic of the query. State-of-the-art…
Expand
2011
2011
From Infinitary Term Rewriting to Cyclic Term Graph Rewriting and back
R. Echahed
2011
Corpus ID: 22698212
This volume contains the proceedings of the Sixth International Workshop on Computing with Terms and Graphs (TERMGRAPH 2011). The…
Expand
2005
2005
Changing Labels in the Double-Pushout Approach Can Be Treated Categorically
H. Schneider
Formal Methods in Software and Systems Modeling
2005
Corpus ID: 11576917
In the double-pushout approach to graph transformations, most authors assume the left-hand side to be injective, since the…
Expand
2004
2004
PARALLEL TERM GRAPH REWRITING AND CONCURRENT LOGIC PROGRAMS
2004
Corpus ID: 28959871
General term graph rewriting is a powerful computational model, suitable for implementing a wide variety of declarative language…
Expand
1995
1995
CPO models for in nite term rewriting ?
A. Corradini
,
Fabio GadducciUniversit
1995
Corpus ID: 14966087
Innnite terms in universal algebras are a well-known topic since the seminal work of the ADJ group 1]. The recent interest in the…
Expand
1995
1995
Uniication, Rewriting, and Narrowing on Term Graphs 1
A. Habel
1995
Corpus ID: 15042564
The concept of graph substitution recently introduced by the authors is applied to term graphs, yielding a uniform framework for…
Expand
1994
1994
JALPA: a functinal modular programming language with dynamic optimization based on term graph rewriting
H. Yamanaka
1994
Corpus ID: 63237971
This paper describes the modularization mechanisms and semantics of our JALPA language, which is based on a category of graphs…
Expand
1993
1993
A lattice for the abstract interpretation of term graph rewriting systems
É. Goubault
,
C. Hankin
1993
Corpus ID: 115176672
1992
1992
Graph Rewriting and Copying
E. Barendsen
,
Sjaak Smetsersy
1992
Corpus ID: 18244143
Graph rewrite systems play an important role in the implementation of functional programming languages. This paper focusses on…
Expand