Logic transformation and coding theory-based frameworks for Boolean satisfiability

D Pradhan

Logic transformation and coding theory-based frameworks for Boolean satisfiability

D Pradhan

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 contribution	Logic transformation and coding theory-based frameworks for Boolean satisfiability
Original language	English
Title of host publication	Unknown
Publisher	OMNIPRESS
Pages	57 - 62
Number of pages	5
ISBN (Print)	0780382366
Publication status	Published - Dec 2003

Bibliographical note

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

Access to Document

http://www.cs.bris.ac.uk/Publications/pub_info.jsp?id=2000299

Handle.net

Persistent link

Cite this

@inproceedings{7a77b95ed6ac45d6a07210d733c3f25b,

title = "Logic transformation and coding theory-based frameworks for Boolean satisfiability",

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. ",

author = "D Pradhan",

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

year = "2003",

month = dec,

language = "English",

isbn = "0780382366",

pages = "57 -- 62",

booktitle = "Unknown",

publisher = "OMNIPRESS",

}

TY - GEN

T1 - Logic transformation and coding theory-based frameworks for Boolean satisfiability

AU - Pradhan, D

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

PY - 2003/12

Y1 - 2003/12

N2 - 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.

AB - 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.

M3 - Conference Contribution (Conference Proceeding)

SN - 0780382366

SP - 57

EP - 62

BT - Unknown

PB - OMNIPRESS

ER -

Logic transformation and coding theory-based frameworks for Boolean satisfiability

Abstract

Bibliographical note

Access to Document

Handle.net

Fingerprint

Cite this