References
- Lin F. On strongest necessary and weakest sufficient conditions In: A. G. Cohn, F. Giunchighia, B. Saleman (Eds.) Principles of Knowledge Representation and Reasoning Pub. Morgan Kauffmann San francisco (2000) pp. 167–175
- Coudert O. Madre J. Implicit and incremental computation of primes and essential primes of Boolean functions In: Proceedings of the 29th ACM/IEEE Design Automation Conferation (1992) pp. 36–39
- Coudert O. Madre J. A new graph based prime computation technique In: T. Sasao (Ed.) Logic Synthesis and Optimization Kluwer Academic Publishers (1993) pp. 33–58
- de Kleer J. An improved incremental algorithm for computing prime implicants In: Proceedings of AAAI-92 San Jose CA (1992) pp. 780–785
- del Val A. Tractable databases: how to make propositional unit resolution complete through compilation In: Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning Bonn (1994) pp. 551–561
- Jackson P. Pais J. Computing prime implicants In: Proceedings of the 10th International Conference on Automated Deduction Kaiserslautern, Germany, July, Lecture Notes in Artificial Intelligence 449 Springer-Verlag (1990) pp. 543–557
- Jackson P. Computing prime implicants incrementally In: Proceedings of the 11th International Conference on Automated Deduction Saratoga Springs, NY, June, Lecture Notes in Artificial Intelligence 607 Springer-Verlag (1992) pp. 253–267
- Marquis P. Knowledge compilation using theory prime implicates In: Proceedings of IJCAI (1995) pp. 837–843
- Ngair T. A new algorithm for incremental prime implicate generation In: Proceedings of IJCAI-93 Chambery France (1993)
- Ramesh , A. , Becker , G. and Murray , N. V. (1997) . CNF and DNF considered harmful for computing prime implicants/implicates . J. Autom. Reasoning , 18 ( 3 ) : 337 – 356 .
- Shiny , K. and Pujari , A. K. (1998) . Computations of prime implicants using matrix and paths . J. Logic Comput. , 8 : 135 – 145 .
- Strzemecki , T. (1992) . Polynomial-time algorithm for generation of prime implicants . Journal Complexity , 8 : 37 – 63 .
- Singh , A. (1999) . Computing prime implicants via transversal clauses . Int. J. Comput. Math. , 70 : 417 – 427 .
- Nelson , R. J. (1997) . Simplest normal truth functions . J. Symbolic Logic , 20 : 105 – 108 .