<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2013-06-02 16:27:23Boolean algebra Conjunctive normal form Disjunctive normal form Implicant Decision list IP FO Time complexity Boolean satisfiability problem Theoretical computer science Computational complexity theory Mathematics |
| RESEARCHCONTRIBUTIONS Artificial Intelligence and Language ProcessingDocID: 1p0xt - View Document |
| Microsoft Word - PiecewiseLinCombined32.docDocID: 1ayS9 - View Document |
| Qualitative Comparative Analysis A Discussion of Interpretations G. Rohwer January 2008DocID: 18ZNf - View Document |
| Artificial Intelligence in Medicine – 254 Using Boolean reasoning to anonymize databases Aleksander Øhrn a,*, Lucila Ohno-Machado b,1 a Knowledge Systems Group, Department of Computer and Information ScDocID: 18eAK - View Document |
| Improved SAT-Based Boolean Matching Using Implicants for LUT-Based FPGAs Jason Cong and Kirill Minkovich Computer Science Department University of California, Los Angeles Los Angeles, CA 90095, USADocID: ETVP - View Document |