### 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 language | English |
---|---|

Title of host publication | Proceedings of the IEEE International Conference on Systems, Man and Cybernetics |

Pages | 2769-2774 |

Number of pages | 6 |

Volume | 4 |

Publication status | Published - 2001 |

Event | 2001 IEEE International Conference on Systems, Man and Cybernetics - Tucson, AZ, United States Duration: Oct 7 2001 → Oct 10 2001 |

### Other

Other | 2001 IEEE International Conference on Systems, Man and Cybernetics |
---|---|

Country | United States |

City | Tucson, AZ |

Period | 10/7/01 → 10/10/01 |

### Fingerprint

### Keywords

- DIMACS
- Heuristic algorithm
- MIPS_SAT
- Optimization
- SAT

### ASJC Scopus subject areas

- Hardware and Architecture
- Control and Systems Engineering

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

}

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 -