Trie Based Subsumption and Improving the pi-Trie Algorithm
نویسندگان
چکیده
An algorithm that stores the prime implicates of a propositional logical formula in a trie was developed in [10]. In this paper, an improved version of that pi-trie algorithm is presented. It achieves its speedup primarily by significantly decreasing subsumption testing. Preliminary experiments indicate the new algorithm to be substantially faster and the trie based subsumption tests to be considerably more efficient than the clause by clause approach originally employed.
منابع مشابه
Computing prime implicates by pruning the search space and accelerating subsumption
The prime implicate trie (pi-trie) of a logical formula is a tree whose branches are labeled with the prime implicates of the formula. An algorithm that builds the pi-trie from a logical formula was introduced in [12]; it builds the trie recursively and makes extensive use of subsumption testing. A more efficient version in which the use of subsumption is reduced is presented in this paper. The...
متن کاملPrime Implicate Tries
The prime implicate trie (pi-trie) of a logical formula is a tree whose branches are labeled with the prime implicates of the formula. The technology of reduced implicate tries is employed to analyze the structure of pi-tries. Appropriate lemmas and theorems are proved, and an algorithm that builds the pi-trie from a logical formula is developed. Preliminary experimental results are presented.
متن کاملA Set Intersection Algorithm Via x-Fast Trie
This paper proposes a simple intersection algorithm for two sorted integer sequences . Our algorithm is designed based on x-fast trie since it provides efficient find and successor operators. We present that our algorithm outperforms skip list based algorithm when one of the sets to be intersected is relatively ‘dense’ while the other one is (relatively) ‘sparse’. Finally, we propose some possi...
متن کاملImproving and Analyzing LC-Trie Performance for IP-Address Lookup
IP-address lookup is a key processing function of Internet routers. The lookup is challenging because it needs to perform a longest prefix match. In this paper, we present our modifications to an efficient lookup algorithm, the LC-trie, based on a technique called prefix transformation. Thereafter, the LC-trie’s performance is analyzed for both the original and our modified algorithm using real...
متن کاملHierarchical trie packet classification algorithm based on expectation-maximization clustering
With the development of computer network bandwidth, packet classification algorithms which are able to deal with large-scale rule sets are in urgent need. Among the existing algorithms, researches on packet classification algorithms based on hierarchical trie have become an important packet classification research branch because of their widely practical use. Although hierarchical trie is benef...
متن کامل