A minimal-state processing search algorithm for satisfiability problems

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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
Title of host publicationProceedings of the IEEE International Conference on Systems, Man and Cybernetics
Pages2769-2774
Number of pages6
Volume4
Publication statusPublished - 2001
Event2001 IEEE International Conference on Systems, Man and Cybernetics - Tucson, AZ, United States
Duration: Oct 7 2001Oct 10 2001

Other

Other2001 IEEE International Conference on Systems, Man and Cybernetics
CountryUnited States
CityTucson, AZ
Period10/7/0110/10/01

Fingerprint

Processing
Approximation algorithms
Cost functions
Computational complexity

Keywords

  • DIMACS
  • Heuristic algorithm
  • MIPS_SAT
  • Optimization
  • SAT

ASJC Scopus subject areas

  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

Funabiki, N., Yokohira, T., Nakanishi, T., Tajima, S., & Higashino, T. (2001). A minimal-state processing search algorithm for satisfiability problems. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (Vol. 4, pp. 2769-2774)

A minimal-state processing search algorithm for satisfiability problems. / Funabiki, Nobuo; Yokohira, Tokumi; Nakanishi, Toru; Tajima, Shigeto; Higashino, Teruo.

Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. Vol. 4 2001. p. 2769-2774.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Funabiki, N, Yokohira, T, Nakanishi, T, Tajima, S & Higashino, T 2001, A minimal-state processing search algorithm for satisfiability problems. in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. vol. 4, pp. 2769-2774, 2001 IEEE International Conference on Systems, Man and Cybernetics, Tucson, AZ, United States, 10/7/01.
Funabiki N, Yokohira T, Nakanishi T, Tajima S, Higashino T. A minimal-state processing search algorithm for satisfiability problems. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. Vol. 4. 2001. p. 2769-2774
Funabiki, Nobuo ; Yokohira, Tokumi ; Nakanishi, Toru ; Tajima, Shigeto ; Higashino, Teruo. / A minimal-state processing search algorithm for satisfiability problems. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics. Vol. 4 2001. pp. 2769-2774
@inproceedings{951fdea377b040f288834a27d7c36922,
title = "A minimal-state processing search algorithm for satisfiability problems",
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.",
keywords = "DIMACS, Heuristic algorithm, MIPS_SAT, Optimization, SAT",
author = "Nobuo Funabiki and Tokumi Yokohira and Toru Nakanishi and Shigeto Tajima and Teruo Higashino",
year = "2001",
language = "English",
volume = "4",
pages = "2769--2774",
booktitle = "Proceedings of the IEEE International Conference on Systems, Man and Cybernetics",

}

TY - GEN

T1 - A minimal-state processing search algorithm for satisfiability problems

AU - Funabiki, Nobuo

AU - Yokohira, Tokumi

AU - Nakanishi, Toru

AU - Tajima, Shigeto

AU - Higashino, Teruo

PY - 2001

Y1 - 2001

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

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

KW - DIMACS

KW - Heuristic algorithm

KW - MIPS_SAT

KW - Optimization

KW - SAT

UR - http://www.scopus.com/inward/record.url?scp=0035719882&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035719882&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0035719882

VL - 4

SP - 2769

EP - 2774

BT - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

ER -