Decomposable Programs Revised
スポンサーリンク
概要
- 論文の詳細を見る
Program decomposition is a program optimization technique for multiple linearly recursive programs in deductive databases. It decomposes an original program into a set of subprograms that have small arities and share no recursive predicates. 2D-decomposable programs generalize some previously proposed decomposable programs, including one-sided recursions ;separable recursions ; right-, left-, and mixed-linear recursions ; and generalized separable recursions. This paper revises the concept of 2D-decomposability, and proposes two larger program classes based on detailed analysis and classification of the arguments of the recursive predicate. We prove that the proposed program classes are decomposable to some extent.
- 一般社団法人情報処理学会の論文
- 1997-01-15
著者
-
Liu Zhibin
Department Of Intelligence And Computer Science Nagoya Institute Of Technology
-
Du Xiaoyong
Department Of Intelligence And Computer Science Nagoya Institute Of Technology
-
ISILUT NAOHTRO
Department of Intelligence and Computer Science, Nagoya Institute of Technology
-
Isilut Naohtro
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
- 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
- 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
- Optimizing Linear Recursive Formulas by Detaching Isolated Variables