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 条
  • [21] Dependent and independent variables in propositional satisfiability
    Giunchiglia, E
    Maratea, M
    Tacchella, A
    LOGICS IN ARTIFICIAL INTELLIGENCE 8TH, 2002, 2424 : 296 - 307
  • [22] Scalable Formula Decomposition for Propositional Satisfiability
    Monnet, Anthony
    Villemaire, Roger
    PROCEEDINGS OF THE THIRD C* CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING 2010 (C3S2E '10), 2010, : 43 - 52
  • [23] Reducing inductive definitions to propositional satisfiability
    Pelov, N
    Ternovska, E
    LOGIC PROGRAMMING, PROCEEDINGS, 2005, 3668 : 221 - 234
  • [24] Strong conflict analysis for propositional satisfiability
    Jin, HoonSang
    Somenzi, Fabio
    2006 DESIGN AUTOMATION AND TEST IN EUROPE, VOLS 1-3, PROCEEDINGS, 2006, : 816 - 821
  • [25] Separating signs in the propositional satisfiability problem
    Hirsch E.A.
    Journal of Mathematical Sciences, 2000, 98 (4) : 442 - 463
  • [26] Answer set programming based on propositional satisfiability
    Giunchiglia, Enrico
    Lierler, Yuliya
    Maratea, Marco
    JOURNAL OF AUTOMATED REASONING, 2006, 36 (04) : 345 - 377
  • [27] Answer set programming based on propositional satisfiability
    Giunchiglia, Enrico
    Lierler, Yuliya
    Maratea, Marco
    Journal of Automated Reasoning, 2006, 36 (04): : 345 - 377
  • [28] What is answer set programming to propositional satisfiability
    Lierler, Yuliya
    CONSTRAINTS, 2017, 22 (03) : 307 - 337
  • [29] Koepke Machines and Satisfiability for Infinitary Propositional Languages
    Carl, Merlin
    Loewe, Benedikt
    Rin, Benjamin G.
    UNVEILING DYNAMICS AND COMPLEXITY, CIE 2017, 2017, 10307 : 187 - 197
  • [30] EXAMINING THE SATISFIABILITY OF THE FORMULAS OF PROPOSITIONAL DYNAMIC LOGIC
    JANOWSKI, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 536 - 536
12345