Logic transformation and coding theory-based frameworks for Boolean satisfiability

D Pradhan

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

1 Citation (Scopus)

Abstract

This paper proposes a new framework to the solution of Boolean Satisfiability. The first approach is based on certain structural analysis using circuit representation. Here, we convert the given CNF into multilevel circuits based on testability-driven transformation and optimization, and then apply a test technique developed by the authors to verify SAT. This test technique is based on the concepts developed by an earlier-proposed verification tool, VERILAT. Certain algebraic coding theory results are then derived that provide a lower bound on the number of solutions to SAT problems. These proposed frameworks have a real potential for providing new theoretical insights.
Translated title of the contributionLogic transformation and coding theory-based frameworks for Boolean satisfiability
Original languageEnglish
Title of host publicationUnknown
PublisherOMNIPRESS
Pages57 - 62
Number of pages5
ISBN (Print)0780382366
Publication statusPublished - Dec 2003

Bibliographical note

Conference Proceedings/Title of Journal: Eighth IEEE International High-Level Design Validation and Test Workshop, 2003.

Fingerprint Dive into the research topics of 'Logic transformation and coding theory-based frameworks for Boolean satisfiability'. Together they form a unique fingerprint.

Cite this