MULTI-STAGE SEARCH REARRANGEMENT ALGORITHM FOR SOLVING SAT PROBLEM
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Recently,local search method has been successfully applied to solve large scale SAT problem,but it will fail to find solution when an original SAT problem instance is unsatisfiable.MSRA(multi-stage search rearrangement algorithm)is just proposed to overcome the incompleteness of local search method.Properly speaking,MSRA is based on the'separate and conquer"strategy and is the integration of several algorithms While solving the SAT problem,MSRA is more efficient than a single method,such as local search and backtracking method.Since the satisfiability of a SAT problem instance can be estimated by the strength of constrained conditions,the authors could find a more efficient strategy to solve the instance.

    Reference
    Related
    Cited by
Get Citation

刘涛,李国杰.求解SAT问题的分级重排搜索算法.软件学报,1996,7(4):201-210

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:February 21,1995
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063