Efficient Query Processing with Reduced Implicate Tries

citation_journal_title=ACM Comput. Surv.; citation_title=Symbolic boolean manipulation with ordered binary decision diagrams; citation_author=R.E. Bryant; citation_volume=24; citation_issue=3; citation_publication_date=1992; citation_pages=293-318; citation_doi=10.1145/136035.136043; citation_id=CR1 citation_journal_title=AI Commun.; citation_title=A survey on knowledge compilation; citation_author=M. Cadoli, F.M. Donini; citation_volume=10; citation_publication_date=1997; citation_pages=137-150; citation_id=CR2 Coudert, O., Madre, J.: Implicit and incremental computation of primes and essential implicant primes of boolean functions. In: Proceedings of the 29th ACM/IEEE Design Automation Conference, pp. 36–39. (1992) citation_title=Compiling devices: a structure-based approach; citation_inbook_title=Proceedings, International Conference on Principles of Knowledge Representation and Reasoning (KR98); citation_publication_date=1998; citation_pages=156-166; citation_id=CR4; citation_author=A. Darwiche; citation_publisher=Morgan-Kaufmann citation_journal_title=J. Assoc. Comput. Mach.; citation_title=Decomposable negation normal form; citation_author=A. Darwiche; citation_volume=48; citation_issue=4; citation_publication_date=2001; citation_pages=608-647; citation_id=CR5 de Kleer, J.: An improved incremental algorithm for computing prime implicants. In: Proceedings of AAAI-92, pp. 780–785. San Jose, CA (1992) citation_title=Building Problem Solvers; citation_publication_date=1993; citation_id=CR7; citation_author=K.D. Forbus; citation_author=J. Kleer; citation_publisher=MIT citation_journal_title=J. Autom. Reason.; citation_title=Knowledge compilation using the extension rule; citation_author=L. Hai, S. Jigui; citation_volume=32; citation_issue=2; citation_publication_date=2004; citation_pages=93-102; citation_doi=10.1023/B:JARS.0000029959.45572.44; citation_id=CR8 citation_title=Normal forms for knowledge dompilation; citation_inbook_title=Proceedings of the International Symposium on Methodologies for Intelligent Systems, (ISMIS ‘05); citation_publication_date=2005; citation_pages=304-313; citation_id=CR9; citation_author=R. Hähnle; citation_author=N.V. Murray; citation_author=E. Rosenthal; citation_publisher=Springer citation_title=Computing prime implicants; citation_inbook_title=Proceedings of the 10th International Conference on Automated Deductions, Kaiserslautern, Germany, July 1990. Lecture Notes in Artificial Intelligence, vol. 449; citation_publication_date=1990; citation_pages=543-557; citation_id=CR10; citation_author=P. Jackson; citation_author=J. Pais; citation_publisher=Springer citation_title=Computing prime implicants incrementally; citation_inbook_title=Proceedings of the 11th International Conference on Automated Deduction, Saratoga Springs, NY, June 1992. Lecture Notes in Artificial Intelligence, vol. 607; citation_publication_date=1992; citation_pages=253-267; citation_id=CR11; citation_author=P. Jackson; citation_publisher=Springer Kautz, H., Selman, B.: A general framework for knowledge compilation. In: Proceedings of the International Workshop on Processing Declarative Knowledge (PDK). Kaiserslautern, Germany (1991) citation_journal_title=J. Symb. Comput.; citation_title=An incremental method for generating prime implicants/implicates; citation_author=A. Kean, G. Tsiknis; citation_volume=9; citation_publication_date=1990; citation_pages=185-206; citation_doi=10.1016/S0747-7171(08)80029-6; citation_id=CR13 citation_journal_title=Comput. Intell.; citation_title=Assumption based reasoning and clause management systems; citation_author=A. Kean, G. Tsiknis; citation_volume=8; citation_issue=1; citation_publication_date=1992; citation_pages=1-24; citation_id=CR14 citation_title=Knowledge compilation using theory prime implicates; citation_inbook_title=Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI); citation_publication_date=1995; citation_pages=837-843; citation_id=CR15; citation_author=P. Marquis; citation_publisher=Morgan-Kaufmann citation_journal_title=J. Assoc. Comput. Mach.; citation_title=PATRICIA – practical algorithm to retrieve information coded in alphanumeric; citation_author=D.R. Morrison; citation_volume=15; citation_issue=4; citation_publication_date=1968; citation_pages=514–34; citation_id=CR16 citation_journal_title=J. Assoc. Comput. Mach.; citation_title=Dissolution: making paths vanish; citation_author=N.V. Murray, E. Rosenthal; citation_volume=40; citation_issue=3; citation_publication_date=1993; citation_pages=504-535; citation_id=CR17 citation_title=Duality in knowledge compilation techniques; citation_inbook_title=Proceedings of the International Symposium on Methodologies for Intelligent Systems (ISMIS ‘05). Lecture Notes in Artificial Intelligence, vol. 3488; citation_publication_date=2005; citation_pages=182-190; citation_id=CR18; citation_author=N.V. Murray; citation_author=E. Rosenthal; citation_publisher=Springer citation_title=Efficient query processing with compiled knowledge bases; citation_inbook_title=Proceedings of the International Conference TABLEAUX 2005 – Analytic Tableaux and Related Methods, Koblenz, Germany, September 2005. Lecture Notes in Artificial Intelligence, vol. 3702; citation_publication_date=2005; citation_pages=231-244; citation_id=CR19; citation_author=N.V. Murray; citation_author=E. Rosenthal; citation_publisher=Springer citation_title=Tableaux, path dissolution, and decomposable negation normal form for knowledge compilation; citation_inbook_title=Proceedings of the International Conference TABLEAUX 2003 – Analytic Tableaux and Related Methods, Rome, Italy, September 2003. Lecture Notes in Artificial Intelligence, vol. 2796; citation_publication_date=2003; citation_pages=165-180; citation_id=CR20; citation_author=N.V. Murray; citation_author=E. Rosenthal; citation_publisher=Springer Ngair, T.: A new algorithm for incremental prime implicate generation. In: Proceedings of IJCAI-93. Chambery, France (1993) citation_journal_title=Artif. Intell.; citation_title=An algorithm to compute circumscription; citation_author=T.C. Przymusinski; citation_volume=38; citation_publication_date=1989; citation_pages=49-73; citation_doi=10.1016/0004-3702(89)90067-2; citation_id=CR22 citation_journal_title=J. Autom. Reason.; citation_title=CNF and DNF considered harmful for computing prime implicants/implicates; citation_author=A. Ramesh, G. Becker, N.V. Murray; citation_volume=18; citation_issue=3; citation_publication_date=1997; citation_pages=337-356; citation_doi=10.1023/A:1005721905269; citation_id=CR23 citation_journal_title=Expert Syst. Appl.; citation_title=An application of non-clausal deduction in diagnosis; citation_author=A. Ramesh, N.V. Murray; citation_volume=12; citation_issue=1; citation_publication_date=1997; citation_pages=119-126; citation_doi=10.1016/S0957-4174(96)00086-3; citation_id=CR24 citation_journal_title=Artif. Intell.; citation_title=A theory of diagnosis from first principles; citation_author=R. Reiter; citation_volume=32; citation_publication_date=1987; citation_pages=57-95; citation_doi=10.1016/0004-3702(87)90062-2; citation_id=CR25 citation_journal_title=J. Assoc. Comput. Mach.; citation_title=Knowledge compilation and theory approximation; citation_author=B. Selman, H. Kautz; citation_volume=43; citation_issue=2; citation_publication_date=1996; citation_pages=193-224; citation_id=CR26 citation_journal_title=IEEE Trans. Comput.; citation_title=A new algorithm for generating prime implicants; citation_author=J.R. Slagle, C.L. Chang, R.C.T. Lee; citation_volume=C-19; citation_issue=4; citation_publication_date=1970; citation_pages=304-310; citation_id=CR27 citation_journal_title=J. Complex.; citation_title=Polynomial-time algorithm for generation of prime implicants; citation_author=T. Strzemecki; citation_volume=8; citation_publication_date=1992; citation_pages=37-63; citation_doi=10.1016/0885-064X(92)90033-8; citation_id=CR28