Renaming Methods for Set of Clauses Using Bit Sequences.
Saved in:
| Title: | Renaming Methods for Set of Clauses Using Bit Sequences. |
|---|---|
| Authors: | Nishioka, Hiroaki1 |
| Source: | Systems & Computers in Japan. 12/1/94, Vol. 25 Issue 14, p49-57. 9p. |
| Subjects: | Horn clauses, Heuristic programming, Computer programming, Logic programming, Computer science, Computer systems |
| Abstract: | Renaming, which is a process to convert a set of clauses to a set of Horn clauses, has been derived by heuristic methods. Recently, Nishioka [5-8] devised a renaming method based on 0-1 programming and other methods. Those methods indicate how to execute a systematic renaming, but complex algorithms are required, such as the 0-1 programming or matrix operations. In this paper, the bit sequence is defined according to each predicate symbol contained in the set of clauses. It is shown that by executing the bit sequence operations based on such definition, all renamings to convert the set of clauses to the Horn set can be derived based on the result of operation. In contrast to the past renaming methods, the proposed method is an efficient method of computation which can derive all renamings simultaneously in parallel. Another advantage of the proposed methods is that no special processing system is required, since the renaming can be derived based only on the combination of the parallel bit operations among the bit sequences. In other words, the computation among the bit sequences. In other words, the computation can be executed using any programming language that can handled the operations among bit sequences. It should also be pointed out that the number of operations needed in the renaming can easily be determined. [ABSTRACT FROM AUTHOR] |
| Copyright of Systems & Computers in Japan is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
