<--- Back to Details
First PageDocument Content
Boolean algebra / Formal methods / Theoretical computer science / Implicant / Disjunctive normal form / IP / Lambda calculus / Vector space / Boolean satisfiability problem / Bayesian network
Date: 2011-07-13 14:33:31
Boolean algebra
Formal methods
Theoretical computer science
Implicant
Disjunctive normal form
IP
Lambda calculus
Vector space
Boolean satisfiability problem
Bayesian network

RESEARCHCONTRIBUTIONS Artificial Intelligence and Language Processing

Add to Reading List

Source URL: aml.media.mit.edu

Download Document from Source Website

File Size: 787,49 KB

Share Document on Facebook

Similar Documents

Boolean algebra / Formal methods / Theoretical computer science / Implicant / Disjunctive normal form / IP / Lambda calculus / Vector space / Boolean satisfiability problem / Bayesian network

RESEARCHCONTRIBUTIONS Artificial Intelligence and Language Processing

DocID: 1p0xt - View Document

Implicant / Binary decision diagram / Function / Polynomial / Vector space / Constructible universe / Mathematics / Algebra / Boolean algebra

Microsoft Word - PiecewiseLinCombined32.doc

DocID: 1ayS9 - View Document

Elementary mathematics / Boolean algebra / Statistical models / Randomness / Stochastic process / Qualitative comparative analysis / Implicant / Differential equation / Regression analysis / Statistics / Mathematics / Econometrics

Qualitative Comparative Analysis A Discussion of Interpretations G. Rohwer January 2008

DocID: 18ZNf - View Document

XK / Structure / Boolean algebra / Implicant / Vehicle Identification Number

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 Sc

DocID: 18eAK - View Document

Mathematical logic / Implicant / Lookup table / Canonical form / Boolean satisfiability problem / Conjunctive normal form / Binary decision diagram / Truth table / Boolean function / Boolean algebra / Theoretical computer science / Mathematics

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, USA

DocID: ETVP - View Document