Minimal Boolean sum-of-product forms in PROLOG

DOI10.1016/0898-1221(90)90010-HMaRDI QIDQ805236zbMATH OpenOpenAlexFDO

Authors Arun K. Mitra

Publication date 1990

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(90)90010-h

zbMATH Keywords

Boolean expressionPROLOGsum-of-product formsymbolic computation of the prime implicants

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• A C-version of minimal Boolean sum-of-product forms
• scientific article; zbMATH DE number 3950389
• scientific article; zbMATH DE number 3394047
• A minimization method for boolean functions
• scientific article; zbMATH DE number 3894979

Cited in

(7)

• Embedding Boolean expressions into logic programming
• A C-version of minimal Boolean sum-of-product forms
• scientific article; zbMATH DE number 3950389 (Why is no real title available?)
• scientific article; zbMATH DE number 4090839 (Why is no real title available?)
• TOPI—A Special-Purpose Computer for Boolean Analysis and Synthesis
• scientific article; zbMATH DE number 3394047 (Why is no real title available?)
• A massive parallel computation in Boolean logic

This page was built for publication: Minimal Boolean sum-of-product forms in PROLOG

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805236)