Trie Based Subsumption and Improving the pi-Trie Algorithm | Zendy

Andrew Matusiewicz | Zendy; Neil V. Murray | Zendy; Erik Rosenthal | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Trie Based Subsumption and Improving the pi-Trie Algorithm

Author(s) -

Andrew Matusiewicz,

Neil V. Murray,

Erik Rosenthal

Publication year - 2018

Publication title -

epic series in computing

Language(s) - English

Resource type - Conference proceedings

ISSN - 2398-7340

DOI - 10.29007/q7h3

Subject(s) - trie , speedup , computer science , algorithm , prime (order theory) , mathematics , data structure , parallel computing , combinatorics , programming language

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research