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 条
  • [31] Symmetric Neural Networks and Propositional Logic Satisfiability
    Pinkas, Gadi
    NEURAL COMPUTATION, 1991, 3 (02) : 282 - 291
  • [32] Complexity of the Satisfiability Problem for a Class of Propositional Schemata
    Aravantinos, Vincent
    Caferra, Ricardo
    Peltier, Nicolas
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2010, 6031 : 58 - 69
  • [33] Propositional satisfiability and constraint programming: A comparative survey
    Bordeaux, Lucas
    Hamadi, Youssef
    Zhang, Lintao
    ACM COMPUTING SURVEYS, 2006, 38 (04)
  • [34] A finite state intersection approach to propositional satisfiability
    Castano, Jose M.
    Castano, Rodrigo
    THEORETICAL COMPUTER SCIENCE, 2012, 450 : 92 - 108
  • [35] Substitutional definition of satisfiability in classical propositional logic
    Belov, A
    Stachniak, Z
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, PROCEEDINGS, 2005, 3569 : 31 - 45
  • [36] Planning for Temporally Extended Goals as Propositional Satisfiability
    Mattmueller, Robert
    Rintanen, Jussi
    20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2007, : 1966 - 1971
  • [37] BRANCHING-RULES FOR SATISFIABILITY
    HOOKER, JN
    VINAY, V
    JOURNAL OF AUTOMATED REASONING, 1995, 15 (03) : 359 - 383
  • [38] Modelling and solving temporal reasoning as propositional satisfiability
    Pham, Duc Nghia
    Thornton, John
    Sattar, Abdul
    ARTIFICIAL INTELLIGENCE, 2008, 172 (15) : 1752 - 1782
  • [39] On market-inspired approaches to propositional satisfiability
    Walsh, WE
    Yokoo, M
    Hirayama, K
    Wellman, MP
    ARTIFICIAL INTELLIGENCE, 2003, 144 (1-2) : 125 - 156
  • [40] A propositional satisfiability approach in mining compact rules
    Bakar, AA
    Sulaiman, MN
    Othman, M
    Selamat, MH
    DATA MINING III, 2002, 6 : 197 - 204
12345