Transforming Quantified Boolean Formulas Using Biclique Covers

被引:0
|
作者
Kullmann, Oliver [1 ]
Shukla, Ankit [2 ]
机构
[1] Swansea Univ, Swansea, W Glam, Wales
[2] Johannes Kepler Univ Linz, Linz, Austria
基金
英国工程与自然科学研究理事会;
关键词
QBF solving; DQBF; 2QCNF; biclique cover problem; conflict graph; preprocessing; Horn clause-sets; minimal unsatisfiability; MINIMAL UNSATISFIABILITY;
D O I
10.1007/978-3-031-30820-8_23
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We introduce the global conflict graph of DQCNFs (dependency quantified conjunctive normal forms), recording clashes between clauses on such universal variables on which all existential variables depend (called "global variables"). The biclique covers of this graph correspond to the eligible clause-slices of the DQCNF which consider only the global variables. We show that all such slices yield satisfiability-equivalent variations. This opens the possibility to realise this slice using as few global variables as possible. We give basic theoretical results and first supporting experimental data.
引用
收藏
页码:372 / 390
页数:19
相关论文
共 50 条
  • [1] On models for quantified Boolean formulas
    Büning, HK
    Zhao, XS
    LOGIC VERSUS APPROXIMATION: ESSAYS DEDICATED TO MICHAEL M RICHTER ON THE OCCASION OF HIS 65TH BIRTHDAY, 2004, 3075 : 18 - 32
  • [2] Symmetries of Quantified Boolean Formulas
    Kauers, Manuel
    Seidl, Martina
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2018, 2018, 10929 : 199 - 216
  • [3] Reasoning with quantified boolean formulas
    Giunchiglia, Enrico
    Marin, Paolo
    Narizzano, Massimo
    Frontiers in Artificial Intelligence and Applications, 2009, 185 (01) : 761 - 780
  • [4] Algorithms for quantified Boolean formulas
    Williams, R
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 299 - 307
  • [5] On Boolean models for Quantified Boolean Horn formulas
    Büning, HK
    Subramani, K
    Zhao, XS
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 93 - 104
  • [6] Boolean Functions as Models for Quantified Boolean Formulas
    Hans Kleine Büning
    K. Subramani
    Xishun Zhao
    Journal of Automated Reasoning, 2007, 39 : 49 - 75
  • [7] Boolean functions as models for quantified Boolean formulas
    Buening, Hans Kleine
    Subramani, K.
    Zhao, Xishun
    JOURNAL OF AUTOMATED REASONING, 2007, 39 (01) : 49 - 75
  • [8] Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas
    Egly, Uwe
    Woltran, Stefan
    COMPUTATIONAL MODELS OF ARGUMENT, 2006, 144 : 133 - 144
  • [9] A Survey on Applications of Quantified Boolean Formulas
    Shukla, Ankit
    Biere, Armin
    Seidl, Martina
    Pulina, Luca
    2019 IEEE 31ST INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2019), 2019, : 78 - 84
  • [10] RESOLUTION FOR QUANTIFIED BOOLEAN-FORMULAS
    BUNING, HK
    KARPINSKI, M
    FLOGEL, A
    INFORMATION AND COMPUTATION, 1995, 117 (01) : 12 - 18