Skip to main navigation Skip to search Skip to main content

On strategies for solving boolean satisfiability problems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

The paper deals with one of the most important problems of modern digital systems verification and design - Boolean satisfiability checking. The work analyzes different strategies for SAT solving evaluations. The approach is based on FUDASAT algorithm that employs commonsense reasoning methodology. Problems of variables selection, conflicts analyses and clauses set extensions are discussed. The presented methodology is exemplified on various benchmarks' evaluations. Basing on the results of practical experiments a set of navigation rules, controlling Boolean satisfiablity checking process, are formulated. Finally, the author summarizes the benefits of the proposed SAT solving technique.

Original languageEnglish
Title of host publication2012 International Conference on Signals and Electronic Systems, ICSES 2012 - The Conference Proceedings
DOIs
Publication statusPublished - 2012
Event2012 International Conference on Signals and Electronic Systems, ICSES 2012 - Wroclaw, Poland
Duration: 18 Sept 201221 Sept 2012

Publication series

Name2012 International Conference on Signals and Electronic Systems, ICSES 2012 - The Conference Proceedings

Conference

Conference2012 International Conference on Signals and Electronic Systems, ICSES 2012
Country/TerritoryPoland
CityWroclaw
Period18/09/1221/09/12

ASJC Scopus subject areas

  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'On strategies for solving boolean satisfiability problems'. Together they form a unique fingerprint.

Cite this