start-ver=1.4
cd-journal=joma
no-vol=4
cd-vols=
no-issue=
article-no=
start-page=2769
end-page=2774
dt-received=
dt-revised=
dt-accepted=
dt-pub-year=2001
dt-pub=200110
dt-online=
en-article=
kn-article=
en-subject=
kn-subject=
en-title=
kn-title=A minimal-state processing search algorithm for satisfiability problems
en-subtitle=
kn-subtitle=
en-abstract=
kn-abstract=<p>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</p>

en-copyright=
kn-copyright=

en-aut-name=FunabikiNobuo
en-aut-sei=Funabiki
en-aut-mei=Nobuo
kn-aut-name=
kn-aut-sei=
kn-aut-mei=
aut-affil-num=1
ORCID=

en-aut-name=YokohiraTokumi
en-aut-sei=Yokohira
en-aut-mei=Tokumi
kn-aut-name=
kn-aut-sei=
kn-aut-mei=
aut-affil-num=2
ORCID=

en-aut-name=NakanishiToru
en-aut-sei=Nakanishi
en-aut-mei=Toru
kn-aut-name=
kn-aut-sei=
kn-aut-mei=
aut-affil-num=3
ORCID=

en-aut-name=TajimaShigeto
en-aut-sei=Tajima
en-aut-mei=Shigeto
kn-aut-name=
kn-aut-sei=
kn-aut-mei=
aut-affil-num=4
ORCID=

en-aut-name=HigashinoTeruo
en-aut-sei=Higashino
en-aut-mei=Teruo
kn-aut-name=
kn-aut-sei=
kn-aut-mei=
aut-affil-num=5
ORCID=

affil-num=1
en-affil=
kn-affil=Okayama University

affil-num=2
en-affil=
kn-affil=Okayama University

affil-num=3
en-affil=
kn-affil=Okayama University

affil-num=4
en-affil=
kn-affil=Osaka University

affil-num=5
en-affil=
kn-affil=Osaka University, Osaka
en-keyword=SAT
kn-keyword=SAT
en-keyword=heuristic algorithm
kn-keyword=heuristic algorithm
en-keyword=optimization
kn-keyword=optimization
en-keyword=DIMACS
kn-keyword=DIMACS
en-keyword=   MIPS_SAT.
kn-keyword=   MIPS_SAT.
END