NEW WORST-CASE UPPER BOUND FOR COUNTING EXACT SATISFIABILITY

被引：1
|
作者：
Zhou, Junping [1 ]
Su, Weihua [1 ]
Wang, Jianan [1 ]
机构：
[1] NE Normal Univ, Sch Comp Sci, Changchun 130117, Peoples R China
来源：
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | 2014年 / 25卷 / 06期
基金：
中国国家自然科学基金;
关键词：
#XSAT; upper bound; resolution principle; common literals principle; RANDOM CONSTRAINT SATISFACTION; ALGORITHMS; KNAPSACK;
D O I：
10.1142/S0129054114500270
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The counting exact satisfiablity problem (#XSAT) is a problem that computes the number of truth assignments satisfying only one literal in each clause. This paper presents an algorithm that solves the #XSAT problem in O(1.1995(n)), which is faster than the best algorithm running in O(1.2190(n)), where n denotes the number of variables. To increase the efficiency of the algorithm, a new principle, called common literals principle, is addressed to simplify formulae. This allows us to further eliminate literals. In addition, we firstly apply the resolution principles into solving #XSAT problem, and therefore it improves the efficiency of the algorithm further.
引用
收藏
页码：667 / 678
页数：12
相关论文
共 50 条
  • [1] A worst-case time upper bound for counting the number of independent sets
    De Ita, Guillermo
    Lopez-Lopez, Aurelio
    [J]. COMBINATORIAL AND ALGORITHMIC ASPECTS OF NETWORKING, 2007, 4852 : 85 - +
  • [2] A Practical Upper Bound for the Worst-Case Attribution Deviations
    Wang, Fan
    Kong, Adams Wai-Kin
    [J]. 2023 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2023, : 24616 - 24625
  • [3] New worst-case upper bounds for SAT
    Hirsch, EA
    [J]. JOURNAL OF AUTOMATED REASONING, 2000, 24 (04) : 397 - 420
  • [4] New Worst-Case Upper Bounds for SAT
    Edward A. Hirsch
    [J]. Journal of Automated Reasoning, 2000, 24 : 397 - 420
  • [5] Worst-case time bounds for coloring and satisfiability problems
    Feder, T
    Motwani, R
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2002, 45 (02): : 192 - 201
  • [6] Bushiness and a tight worst-case upper bound on the search number of a simple polygon
    Suzuki, I
    Yamashita, M
    Umemoto, H
    Kameda, T
    [J]. INFORMATION PROCESSING LETTERS, 1998, 66 (01) : 49 - 52
  • [7] An upper bound of the worst-case Hankel norm for systems with non-memoryless uncertainty
    Asai, T
    [J]. PROCEEDINGS OF THE 40TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-5, 2001, : 3657 - 3658
  • [8] Improved Worst-Case Response-Time Calculations by Upper-Bound Conditions
    Pollex, Victor
    Kollmann, Steffen
    Albers, Karsten
    Slomka, Frank
    [J]. DATE: 2009 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION, VOLS 1-3, 2009, : 105 - 110
  • [9] New Worst-Case Upper Bound for #2-SAT and #3-SAT with the Number of Clauses as the Parameter
    Zhou, Junping
    Yin, Minghao
    Zhou, Chunguang
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-10), 2010, : 217 - 222
  • [10] The New Worst-Case Scenario
    Lafrance, David
    [J]. JOURNAL AMERICAN WATER WORKS ASSOCIATION, 2011, 103 (05): : 6 - 6
12345