Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,088,621 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.
2017
2017
Learning of Primitive Formal Systems Defining Labelled Ordered Tree Languages via Queries
Tomoyuki Uchida
,
Satoshi Matsumoto
,
Takayoshi Shoudai
,
Yusuke Suzuki
,
T. Miyahara
International Conference on Inductive Logic…
2017
Corpus ID: 4809199
A formal graph system (FGS) is a logic programming system that directly manipulates graphs by dealing with term graph patterns…
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
2006
2006
Fact extraction, querying and visualization of large C++ code bases
F. Boerboom
,
A. Janßen
2006
Corpus ID: 262260335
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
1999
1999
Tile Transition Systems as Structured Coalgebras
A. Corradini
,
R. Heckel
,
U. Montanari
International Symposium on Fundamentals of…
1999
Corpus ID: 14451749
The aim of this paper is to investigate the relation between two models of concurrent systems: tile rewrite systems and…
Expand
1998
1998
Interally Typed Second-Order Term Graphs
Wolfram Kahl
International Workshop on Graph-Theoretic…
1998
Corpus ID: 134770
We present a typing concept for second-order term graphsthat doesnot consider the types as an external add-on, but as an integral…
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
1995
1995
Simple gap termination for term graph rewriting systems(Theory of Rewriting Systems and Its Applications)
Mizuhito Ogawa
1995
Corpus ID: 18582734
This paper proves the extension of Kruskal-Friedman theorem, which is an extension of the ordinary Kruskal's theorem with gap…
Expand
1993
1993
A lattice for the abstract interpretation of term graph rewriting systems
É. Goubault
,
C. Hankin
1993
Corpus ID: 115176672