A minimal-state processing search algorithm for satisfiability problems

Nobuo Funabiki, Tokumi Yokohira, Toru Nakanishi, Shigeto Tajima, Teruo Higashino

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The satisfiability problem (SAT) is a typical NP-complete problem where a wide range of applications has been studied. Given a set of variables U and a set of clauses C, the goal of SAT is to find a truth assignment to variables in U such that every clause in C is satisfied if it exits, or to derive the infeasibility otherwise. This paper presents an approximation algorithm called a minimal-state processing search algorithm for SAT (MIPS_SAT). MIPS_SAT repeatedly transits minimal states in terms of the cost function for searching a solution through a construction stage and a refinement stage. The first stage greedily generates an initial state composed of as many satisfied clauses as possible. The second stage iteratively seeks a solution while keeping state minimality. The performance of MIPS_SAT is verified through solving DIMACS benchmark instances.

Original languageEnglish
Pages (from-to)2769-2774
Number of pages6
JournalProceedings of the IEEE International Conference on Systems, Man and Cybernetics
Volume4
DOIs
Publication statusPublished - Jan 1 2001

    Fingerprint

Keywords

  • DIMACS
  • Heuristic algorithm
  • MIPS_SAT
  • Optimization
  • SAT

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Hardware and Architecture

Cite this