Although the World Wide Web has of late become an important source to consult for the meaning of words, a number of technical terms related to high technology are not found on the Web. This paper describes a method to produce an encyclopedic dictionary for high-tech terms from patent information. We used a collection of unexamined patent applications published by the Japanese Patent Office as a...

Abstract relational reasoning is a core component of human thinking. While abstract relations are understood using a wide variety of methods, the formal algebraic equation is among the most powerful and general mechanisms for representing relational statements. It has often been assumed that the means by which expressions represent relations are purely semantic, and are encoded in an abstract s...

We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L,R, τ, σ) such that L and R are termgraphs representing the left-hand and the right-hand sides of the rule, τ is a mapping from the nodes of L to those of R and σ is a partial function from nodes of R to nodes of L. τ describes how incident edges of the nodes in L are co...

We consider a number of problems which arise when performing term rewriting in algebraic speciications with each operator having an evaluation strategy for its arguments. Each problem is illustrated with an OBJ3 example. We propose a solution developed for the evaluation of functional modules in the Maude interpreter which is based on maintaining an invariant on the term graph by copying subgra...

From September 12th to 17th, 2010, the Dagstuhl Seminar 10371 “Dynamic Maps ” was held in Schloss Dagstuhl – Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this...

O. Introduction. In this paper we will discuss in an informM way some aspects of t@rm graph rewriting. We will indicate why this subject falls in the scope of higher-order rewriting, and thus in the scope of the present workshop. Our discussion will be loosely structured by a numbered sequence of keywords and phrases, thereby following a talk given at the workshop. In the theory of rewriting, t...

We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L,R, τ, σ) such that L and R are termgraphs representing the left-hand and the right-hand sides of the rule, τ is a mapping from the nodes of L to those of R and σ is a partial function from nodes of R to nodes of L. τ describes how incident edges of the nodes in L are co...

The suspending semantic model for the execution of the MONSTR generalised term graph rewriting language is defined. This is the canonical operational semantic model for the MONSTR language. Its correctness with respect to DACTL semantics is discussed, and a number of general theorems on the soundness of suspending executions with respect to DACTL semantics are proved. General theorems are prove...

We review the concept of term graph narrowing as an approach for solving equations by transformations on term graphs. Term graph narrowing combines term graph rewriting with rst-order term uni cation. This mechanism is complete for all term rewriting systems over which term graph rewriting is normalizing and conuent. This includes, in particular, all convergent term rewriting systems. Completen...

Previous studies have investigated the differences between concrete concepts and abstract concepts. Nevertheless there’s still no research probing emotional words to that font. The concepts behind emotional words have both affective and cognitive components, hence emotional concepts might have unique pattern of semantic properties. The present study then strives to compare the semantic properti...