Termination of Order-Sorted Rewriting with Non-minimal Signatures
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we extend the Gnaedig's results[2], [3]on termination of order-sorted rewriting. Gnaedig required a condition for order-sorted signatures, called minimality, for the termination proof. We get rid of this restriction by introducing a transformation from a TRS with an arbitrary order-sorted signature to another TRS with a minimal signature, and proving that this transformation preserves termination.
- 社団法人電子情報通信学会の論文
- 1998-08-25
著者
-
Kawabe Yoshinobu
Ntt Corp. Atsugi‐shi Jpn
-
Kawabe Yoshinobu
Ntt Communication Science Laboratories Ntt Corporation
-
Kawabe Yoshinobu
Ntt Communication Science Labs.
-
Kawabe Yoshinobu
Ntt Communication Science Labs
-
ISHII Naohiro
Department of Intelligence and Computer Science, Nagoya Institute of Technology
-
Ishii Naohiro
Department Of Intelligence And Computer Science Nagoya Institute Of Technology
-
Ishii Naohiro
Department Of Electrical Engineering And Computer Science Nagoya Institute Of Technology
関連論文
- The Completeness of Order-Sorted Term Rewriting Systems Is Preserved by Currying
- An Energy-Efficient Initialization Protocol for Wireless Sensor Networks with No Collision Detection
- Termination of Order-Sorted Rewriting with Non-minimal Signatures
- Accuracy of the Minimum Time Estimate for Programs on Heterogeneous Machines
- A Lookahead Heuristic for Heterogeneous Multiprocessor Scheduling with Communication Costs (Special Issue on Parallel and Distributed Supercomputing)
- An Improved Increase over the Minimum Execution Time of a Parallel Program
- Name Creation Implements Restriction in the π-Calculus
- On Backward-Style Anonymity Verification
- An Adversary Model for Simulation-Based Anonymity Proof
- An Efficient Method for Computing All Reducts
- A Hybrid Method of Feature Subset Selection
- Improving Performance of the k-Nearest Neighbor Classifier by Combining Feature Selection with Feature Weighting
- Speeding up String Searching Algorithms for Nonuniform Texts
- On Relationships between Decomposable Programs and Rule Commutative Programs
- Efficient Evaluation of One-directional Cycle-recursive Formulas
- Verifying Trace Equivalence of a Shared-Memory-Style Communication System(Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
- A Performance Measure for the Scheduling of Typed Task Systems with Communication Costs
- Decomposable Programs Revised
- Determining Feature Weight of Pattern Classification by Using Rough Genetic Algorithm and Fuzzy Similarity Measure
- Fast On-line String Searching
- Reliability of a Mobile Communication System with Network Congestion
- Modularity of Confluence in Order-Sorted Term Rewriting Systems
- Optimizing Linear Recursive Formulas by Detaching Isolated Variables