Skip to main navigation Skip to search Skip to main content

Selection of search strategies for solving 3-SAT problems

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

The paper concerns the problem of Boolean satisfiability checking, which is recognized as one of the most important issues in the field of modern digital electronic system verification and design. The paper analyzes different strategies and scenarios of the proving process, and presents a modified and extended version of the author's FUDASAT algorithm. The original FUDASAT methodology is an intuitive approach that employs a commonsense reasoning methodology. The main objective of the work is to investigate the SAT-solving process and try to formulate a set of rules controlling the reasoning process of the FUDASAT inference engine. In comparison with the author's previous works, the paper introduces new mechanisms: hypergraph analysis, multiple variable assignments and search space pruning algorithms. The approach considers only 3-SAT class functions, although a generalization of the method is discussed as well. The presented approach has been tested on various benchmarks and compared with the original pure FUDASAT algorithm as well as with other algorithms known from the literature. Finally, the benefits of the proposed SAT solving technique are summarized.

Original languageEnglish
Pages (from-to)283-297
Number of pages15
JournalInternational Journal of Applied Mathematics and Computer Science
Volume24
Issue number2
DOIs
Publication statusPublished - 1 Jun 2014

Keywords

  • Boolean satisfiability
  • CNF
  • Formal verification
  • SAT solving

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Engineering (miscellaneous)
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Selection of search strategies for solving 3-SAT problems'. Together they form a unique fingerprint.

Cite this