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
来源
TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT II, TACAS 2023 | 2023年 / 13994卷
基金
英国工程与自然科学研究理事会;
关键词
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 条
  • [21] Solving advanced reasoning tasks using quantified Boolean formulas
    Egly, U
    Eiter, T
    Tompits, H
    Woltran, S
    SEVENTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-2001) / TWELFTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-2000), 2000, : 417 - 422
  • [22] Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas
    Diller, Martin
    Wallner, Johannes Peter
    Woltran, Stefan
    COMPUTATIONAL MODELS OF ARGUMENT, 2014, 266 : 241 - 252
  • [23] Reasoning in abstract dialectical frameworks using quantified Boolean formulas
    Diller, Martin
    Wallner, Johannes Peter
    Woltran, Stefan
    ARGUMENT & COMPUTATION, 2015, 6 (02) : 149 - 177
  • [24] Looking algebraically at tractable quantified Boolean formulas
    Chen, HB
    Dalmau, V
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2005, 3542 : 71 - 79
  • [25] Computing Smallest MUSes of Quantified Boolean Formulas
    Niskanen, Andreas
    Mustonen, Jere
    Berg, Jeremias
    Jarvisalo, Matti
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, LPNMR 2022, 2022, 13416 : 301 - 314
  • [26] A Dichotomy Theorem for Learning Quantified Boolean Formulas
    Víictor Dalmau
    Machine Learning, 1999, 35 : 207 - 224
  • [27] Abstract Solvers for Quantified Boolean Formulas and their Applications
    Brochenin, Remi
    Maratea, Marco
    AI*IA 2015: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2015, 9336 : 205 - 217
  • [28] A Structural Approach to Reasoning with Quantified Boolean Formulas
    Pulina, Luca
    Tacchella, Armando
    21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 596 - 602
  • [29] Extracting Certificates from Quantified Boolean Formulas
    Benedetti, Marco
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 47 - 53
  • [30] Moving Definition Variables in Quantified Boolean Formulas
    Reeves, Joseph E.
    Heule, Marijn J. H.
    Bryant, Randal E.
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2022, PT I, 2022, 13243 : 462 - 479