Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules

Lecture Notes in Computer Science - Germany
doi 10.1007/bfb0030600
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Tiling Optimizations for Stencil Computations Using Rewrite Rules in Lift

Transactions on Architecture and Code Optimization
HardwareInformation SystemsArchitectureSoftware
2020English

Creation of Parametric Rules to Rewrite Algebraic Expressions in Symbolic Regression

Machine Learning and Data Analysis
2017English

Decision Rules in a Judicial Hierarchy

SSRN Electronic Journal
2004English

Evaluable Functions in the Godel Programming Language: Parsing and Representing Rewrite Rules

2000English

Nondeterministic AND-EXOR Minimisation by Using Rewrite Rules and Simulated Annealing

IEE Proceedings - Computers and Digital Techniques
1999English

Undecidability in the Act . . .

The Undecidable Unconscious: A Journal of Deconstruction and Psychoanalysis
2014English

Reducing Relative Termination to Dependency Pair Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

What Should We Consider When Applying Termination of Resuscitation Rules?

Journal of Thoracic Disease
PulmonaryRespiratory Medicine
2016English

Confluence of Non-Left-Linear TRSs via Relative Termination

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy