A New Branching Heuristic for Propositional Satisfiability

被引：0
|
作者：
Zhao, Yujuan [1 ]
Song, Zhenming [1 ]
机构：
[1] Southwest Jiaotong Univ, Sch Math, Chengdu 611756, Sichuan, Peoples R China
来源：
2016 INTERNATIONAL CONFERENCE ON FUZZY THEORY AND ITS APPLICATIONS (IFUZZY) | 2016年
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A new algorithm of selecting branch variable is proposed,which is based on the research of propositional satisfiability algorithm. Firstly, the clause set is divided into three groups according to the length of the clause. Secondly,considering the relationship between the clause and literal dynamically and a heuristic function is defined,whose purpose is that literal has maximum function value will be selected. Examples show that the new algorithm can reduce the unnecessary search space,,then the efficiency of the whole solving is improved effectively.
引用
收藏
页数：3
相关论文
共 50 条
  • [1] Heuristic-based backtracking for propositional satisfiability
    Bhalla, A
    Lynce, I
    de Sousa, JT
    Marques-Silva, J
    PROGRESS IN ARTIFICIAL INTELLIGENCE-B, 2003, 2902 : 116 - 130
  • [2] Heuristic-based backtracking relaxation for propositional satisfiability
    Bhalla, Ateet
    Lynce, Ines
    De Sousa, Jose T.
    Marques-Silva, Joao
    JOURNAL OF AUTOMATED REASONING, 2005, 35 (1-3) : 3 - 24
  • [3] Heuristic-Based Backtracking Relaxation for Propositional Satisfiability
    Ateet Bhalla
    Inês Lynce
    José T. de Sousa
    João Marques-Silva
    Journal of Automated Reasoning, 2005, 35 : 3 - 24
  • [4] Heuristic-based backtracking relaxation for propositional satisfiability
    Bhalla, Ateet
    Lynce, Inês
    De Sousa, José T.
    Marques-Silva, João
    Journal of Automated Reasoning, 2005, 35 (1-3): : 3 - 24
  • [5] A NEW ALGORITHM FOR THE PROPOSITIONAL SATISFIABILITY PROBLEM
    GALLO, G
    PRETOLANI, D
    DISCRETE APPLIED MATHEMATICS, 1995, 60 (1-3) : 159 - 179
  • [6] From propositional satisfiability to satisfiability modulo theories
    Sheini, Hossein M.
    Sakallah, Karem A.
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2006, PROCEEDINGS, 2006, 4121 : 1 - 9
  • [7] SATISFIABILITY PROBLEMS FOR PROPOSITIONAL CALCULI
    LEWIS, HR
    MATHEMATICAL SYSTEMS THEORY, 1979, 13 (01): : 45 - 53
  • [8] Branching rules for satisfiability
    Hooker, JN
    Vinay, V
    FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 1994, 880 : 426 - 437
  • [9] Branching rules for satisfiability
    1600, Kluwer Academic Publishers, Dordrecht, Netherlands (15):
  • [10] A competitive and cooperative approach to propositional satisfiability
    Inoue, Katsumi
    Soh, Takehide
    Ueda, Seiji
    Sasaura, Yoshito
    Banbara, Mutsunori
    Tamura, Naoyuki
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (16) : 2291 - 2306
12345