On finding minimal-models using DPLL-based SAT solver

Norihide Shikada, Kiyonori Taniguchi, Ryuzo Hasegawa, Hiroshi Fujita, Miyuki Koshimura

Research output: Contribution to journalArticle

Abstract

We present a method to find minimal models using a SAT solver based on DPLL (Davis-Putnam-Logeman-Loveland) procedure. The algorithm of the method is described together with its correctness proof. A DPLL-based SAT solver outperforms MM-MGTP, a theorem prover of first-order logic which is adapted to finding minimal models, in solving SAT instances of the Random category in the standard SAT benchmarks. Still it is much slower than MM-MGTP in solving many other SAT instances. This is mainly due to its inappropriate strategies for model search. It remains to be solved how we can determine the order of decision variables appropriately.

Original languageEnglish
Pages (from-to)81-86
Number of pages6
JournalResearch Reports on Information Science and Electrical Engineering of Kyushu University
Volume12
Issue number2
Publication statusPublished - Sep 1 2007

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

On finding minimal-models using DPLL-based SAT solver. / Shikada, Norihide; Taniguchi, Kiyonori; Hasegawa, Ryuzo; Fujita, Hiroshi; Koshimura, Miyuki.

In: Research Reports on Information Science and Electrical Engineering of Kyushu University, Vol. 12, No. 2, 01.09.2007, p. 81-86.

Research output: Contribution to journalArticle

@article{42d08263156141e79de02c0d3eb2a1f9,
title = "On finding minimal-models using DPLL-based SAT solver",
abstract = "We present a method to find minimal models using a SAT solver based on DPLL (Davis-Putnam-Logeman-Loveland) procedure. The algorithm of the method is described together with its correctness proof. A DPLL-based SAT solver outperforms MM-MGTP, a theorem prover of first-order logic which is adapted to finding minimal models, in solving SAT instances of the Random category in the standard SAT benchmarks. Still it is much slower than MM-MGTP in solving many other SAT instances. This is mainly due to its inappropriate strategies for model search. It remains to be solved how we can determine the order of decision variables appropriately.",
author = "Norihide Shikada and Kiyonori Taniguchi and Ryuzo Hasegawa and Hiroshi Fujita and Miyuki Koshimura",
year = "2007",
month = "9",
day = "1",
language = "English",
volume = "12",
pages = "81--86",
journal = "Research Reports on Information Science and Electrical Engineering of Kyushu University",
issn = "1342-3819",
publisher = "Kyushu University, Faculty of Science",
number = "2",

}

TY - JOUR

T1 - On finding minimal-models using DPLL-based SAT solver

AU - Shikada, Norihide

AU - Taniguchi, Kiyonori

AU - Hasegawa, Ryuzo

AU - Fujita, Hiroshi

AU - Koshimura, Miyuki

PY - 2007/9/1

Y1 - 2007/9/1

N2 - We present a method to find minimal models using a SAT solver based on DPLL (Davis-Putnam-Logeman-Loveland) procedure. The algorithm of the method is described together with its correctness proof. A DPLL-based SAT solver outperforms MM-MGTP, a theorem prover of first-order logic which is adapted to finding minimal models, in solving SAT instances of the Random category in the standard SAT benchmarks. Still it is much slower than MM-MGTP in solving many other SAT instances. This is mainly due to its inappropriate strategies for model search. It remains to be solved how we can determine the order of decision variables appropriately.

AB - We present a method to find minimal models using a SAT solver based on DPLL (Davis-Putnam-Logeman-Loveland) procedure. The algorithm of the method is described together with its correctness proof. A DPLL-based SAT solver outperforms MM-MGTP, a theorem prover of first-order logic which is adapted to finding minimal models, in solving SAT instances of the Random category in the standard SAT benchmarks. Still it is much slower than MM-MGTP in solving many other SAT instances. This is mainly due to its inappropriate strategies for model search. It remains to be solved how we can determine the order of decision variables appropriately.

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

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

M3 - Article

AN - SCOPUS:36249015934

VL - 12

SP - 81

EP - 86

JO - Research Reports on Information Science and Electrical Engineering of Kyushu University

JF - Research Reports on Information Science and Electrical Engineering of Kyushu University

SN - 1342-3819

IS - 2

ER -