Verifying OR-of-ANDs is equivalent to NAND-of-NANDs using SMT solvers

Fuente: Zenodo
Saved in:
Bibliographic Details
Main Authors: Fitzsimmons, Zack, Hassan, Zohair Raza, Hemaspaandra, Edith, Rivero, Carlos R.
Format: Recurso digital
Published: Zenodo 2025
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866902028648710144
author Fitzsimmons, Zack
Hassan, Zohair Raza
Hemaspaandra, Edith
Rivero, Carlos R.
author_facet Fitzsimmons, Zack
Hassan, Zohair Raza
Hemaspaandra, Edith
Rivero, Carlos R.
contents <p>Jupyter notebook to showcase the use of SMT solvers to formalize and verify that an OR-of-ANDs boolean formula can be represented using only NAND gates.</p> <p>GitHub link: <a href="https://github.com/crrivero/FormalMethodsTasting/blob/main/For%20engineers/NAND.ipynb">NAND.ipynb</a></p>
format Recurso digital
id zenodo_https___doi_org_10_5281_zenodo_16969159
institution Zenodo
language
publishDate 2025
publisher Zenodo
record_format zenodo
spellingShingle Verifying OR-of-ANDs is equivalent to NAND-of-NANDs using SMT solvers
Fitzsimmons, Zack
Hassan, Zohair Raza
Hemaspaandra, Edith
Rivero, Carlos R.
<p>Jupyter notebook to showcase the use of SMT solvers to formalize and verify that an OR-of-ANDs boolean formula can be represented using only NAND gates.</p> <p>GitHub link: <a href="https://github.com/crrivero/FormalMethodsTasting/blob/main/For%20engineers/NAND.ipynb">NAND.ipynb</a></p>
title Verifying OR-of-ANDs is equivalent to NAND-of-NANDs using SMT solvers
url https://doi.org/10.5281/zenodo.16969159