Amanote Research

Amanote Research

    RegisterSign In

Simplification Orders for Term Graph Rewriting

Lecture Notes in Computer Science - Germany
doi 10.1007/bfb0029989
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 1997

Authors
Detlef Plump
Publisher

Springer Berlin Heidelberg


Related search

Critical Pairs in Term Graph Rewriting

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Term-Graph Rewriting via Explicit Paths

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Foreword: Special Issue on Term and Graph Rewriting

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2018English

Congruences for Contextual Graph-Rewriting

BRICS Report Series
2004English

Shape Simplification Through Graph Sparsification

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Context Term Calculus for Rewriting Systems

PROBLEMS IN PROGRAMMING
2018English

Attributed Graph Rewriting for Complex Event Processing Self-Management

ACM Transactions on Autonomous and Adaptive Systems
ControlSystems EngineeringComputer ScienceSoftware
2016English

Strategic Port Graph Rewriting: An Interactive Modelling Framework

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2018English

Matrix Interpretations for Proving Termination of Term Rewriting

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy