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 条
  • [41] Multiplication Complexity Optimization based on Quantified Boolean Formulas
    Zhu, Jun
    Pan, Hongyang
    Chu, Zhufei
    2024 INTERNATIONAL SYMPOSIUM OF ELECTRONICS DESIGN AUTOMATION, ISEDA 2024, 2024, : 332 - 336
  • [42] SAT based BDD solver for Quantified Boolean Formulas
    Audemard, G
    Saïs, L
    ICTAI 2004: 16TH IEEE INTERNATIONALCONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, : 82 - 89
  • [43] Partial Witnesses from Preprocessed Quantified Boolean Formulas
    Seidl, Martina
    Koenighofer, Robert
    2014 DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION (DATE), 2014,
  • [44] Comparing different prenexing strategies for quantified Boolean formulas
    Egly, U
    Seidl, M
    Tompits, H
    Woltran, S
    Zolda, M
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 214 - 228
  • [45] A Duality-Aware Calculus for Quantified Boolean Formulas
    Fazekas, Katalin
    Seidl, Martina
    Biere, Armin
    PROCEEDINGS OF 2016 18TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC), 2016, : 181 - 186
  • [46] Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
    Buening, Hans Kleine
    Zhao, Xishun
    Bubeck, Uwe
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2009, PROCEEDINGS, 2009, 5584 : 391 - +
  • [47] Short proofs for some symmetric Quantified Boolean Formulas
    Kauers, Manuel
    Seidl, Martina
    INFORMATION PROCESSING LETTERS, 2018, 140 : 4 - 7
  • [48] Fully dynamic quasi-biclique edge covers via boolean matrix factorizations
    Miettinen, P. (pauli.miettinen@mpi-inf.mpg.de), 2013, Association for Computing Machinery, 2 Penn Plaza, Suite 701, New York, NY 10121-0701, United States
  • [49] Clause/term resolution and learning in the evaluation of quantified boolean formulas
    Giunchiglia, Enrico
    Narizzano, Massimo
    Tacchella, Armando
    Journal of Artificial Intelligence Research, 2006, 26 : 371 - 416
  • [50] Primal and Dual Encoding from Applications into Quantified Boolean Formulas
    Van Gelder, Allen
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2013, 2013, 8124 : 694 - 707