Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,276,249 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
2011
2011
From Infinitary Term Rewriting to Cyclic Term Graph Rewriting and back
P. Bahr
2011
Corpus ID: 124508650
��������� � �� ���������� Cyclic term graph rewriting has been shown to be adequate for simulating certain forms of infinitary…
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
2007
2007
CTGE-ILP: Correlative Term Graph-Based Extended ILP
Bo Liu
International Conference on Semantics, Knowledge…
2007
Corpus ID: 41478391
Now it is much more prevalent to mine complex data in the fields of data mining and the main methods include the experience and…
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
1998
1998
Modular Aspects of Term Graph Rewriting
M. K. Rao
Theoretical Computer Science
1998
Corpus ID: 206058120
1997
1997
A study of two graph rewriting formalisms: Interaction Nets and MONSTR
R. Banach
,
G. A. Papadopoulos
Journal of Programming Languages
1997
Corpus ID: 2862442
Two superficially similar graph rewriting formalisms, Interaction Nets and MONSTR, are studied. Interaction Nets come from…
Expand
1997
1997
Polynomial Time Inductive Inference of Regular Term Tree Languages from Positive Data
Satoshi Matsumoto
,
Yukiko Hayashi
,
Takayoshi Shoudai
International Conference on Algorithmic Learning…
1997
Corpus ID: 24227157
Term graphs are a kind of hypergraphs such that arbitrary graphs can be put to the place of their hyperedges. Each hyperedge in a…
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
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
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE