Trie Based Subsumption and Improving the pi-Trie Algorithm

10 pages•Published: May 16, 2012

Andrew Matusiewicz, Neil Murray and Erik Rosenthal

Abstract

An algorithm that stores the prime implicates of a logical formula in a trie was developed in [Matusiewicz et.al. 2009]. 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.

Keyphrases: prime implicates, subsumption, tries

In: Renate A. Schmidt, Stephan Schulz and Boris Konev (editors). PAAR-2010: Proceedings of the 2nd Workshop on Practical Aspects of Automated Reasoning, vol 9, pages 74-83.

Links:	https://easychair.org/publications/paper/dJs
	https://doi.org/10.29007/q7h3

BibTeX entry

@inproceedings{PAAR-2010:Trie_Based_Subsumption_Improving,
  author    = {Andrew Matusiewicz and Neil Murray and Erik Rosenthal},
  title     = {Trie Based Subsumption and Improving the pi-Trie Algorithm},
  booktitle = {PAAR-2010: Proceedings of the 2nd Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Renate A. Schmidt and Stephan Schulz and Boris Konev},
  series    = {EPiC Series in Computing},
  volume    = {9},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/dJs},
  doi       = {10.29007/q7h3},
  pages     = {74-83},
  year      = {2012}}

Download PDF Open PDF in browser