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 条
  • [41] What is answer set programming to propositional satisfiability
    Yuliya Lierler
    Constraints, 2017, 22 : 307 - 337
  • [42] Combining inference and search for the propositional satisfiability problem
    Drake, L
    Frisch, A
    Walsh, T
    EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS, 2002, : 982 - 982
  • [43] PROPOSITIONAL CALCULI OF TERM SATISFIABILITY AND PROCESS LOGICS
    KNAST, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1985, 208 : 118 - 126
  • [44] Propositional proof systems based on maximum satisfiability
    Bonet, Maria Luisa
    Buss, Sam
    Ignatiev, Alexey
    Morgado, Antonio
    Marques-Silva, Joao
    ARTIFICIAL INTELLIGENCE, 2021, 300
  • [45] On the Satisfiability and Validity Problems in the Propositional Godel Logic
    Guller, Dusan
    COMPUTATIONAL INTELLIGENCE, 2012, 399 : 211 - 227
  • [46] Answer Set Programming Based on Propositional Satisfiability
    Enrico Giunchiglia
    Yuliya Lierler
    Marco Maratea
    Journal of Automated Reasoning, 2006, 36
  • [47] Another look at graph coloring via propositional satisfiability
    Van Gelder, Allen
    DISCRETE APPLIED MATHEMATICS, 2008, 156 (02) : 230 - 243
  • [48] Applications of general exact satisfiability in propositional logic modelling
    Dahllöf, V
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2005, 3452 : 95 - 109
  • [49] A SATISFIABILITY TESTER FOR NON-CLAUSAL PROPOSITIONAL CALCULUS
    VANGELDER, A
    INFORMATION AND COMPUTATION, 1988, 79 (01) : 1 - 21
  • [50] Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability
    Castano, Jose M.
    Castano, Rodrigo
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2011, 6807 : 76 - 87
12345