Linear Response Time for Implicate and Implicant Queries ? Technical Report SUNYA-CS-0801 January , 2008

@inproceedings{Murray2008LinearRT,
  title={Linear Response Time for Implicate and Implicant Queries ? Technical Report SUNYA-CS-0801 January , 2008},
  author={Neil V. Murray and Erik Rosenthal},
  year={2008}
}
The reduced implicate trie , introduced in [38], is a data structure that may be used as a target language for knowledge compilation. It has the property that a query can be processed in time li ear in the size of the query , regardless of the size of the compiled knowledge base. This data structure can be used with propositional databases, where a query… CONTINUE READING