Minimal Boolean sum-of-product forms in PROLOG

DOI10.1016/0898-1221(90)90010-HzbMath0728.68071OpenAlexW2078224939MaRDI QIDQ805236

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

PROLOGBoolean expressionsum-of-product formsymbolic computation of the prime implicants

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (2)

A C-version of minimal Boolean sum-of-product forms ⋮ A massive parallel computation in Boolean logic

Cites Work

• Unnamed Item
• Unnamed Item

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