Symmetries of Quantified Boolean Formulas

被引:3
|
作者
Kauers, Manuel [1 ]
Seidl, Martina [2 ]
机构
[1] JKU Linz, Inst Algebra, Linz, Austria
[2] JKU Linz, Inst Formal Models & Verificat, Linz, Austria
基金
奥地利科学基金会;
关键词
D O I
10.1007/978-3-319-94144-8_13
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
While symmetries are well understood for Boolean formulas and successfully exploited in practical SAT solving, less is known about symmetries in quantified Boolean formulas (QBF). There are some works introducing adaptions of propositional symmetry breaking techniques, with a theory covering only very specific parts of QBF symmetries. We present a general framework that gives a concise characterization of symmetries of QBF. Our framework naturally incorporates the duality of universal and existential symmetries resulting in a general basis for QBF symmetry breaking.
引用
收藏
页码:199 / 216
页数:18
相关论文
共 50 条
  • [1] On models for quantified Boolean formulas
    Büning, HK
    Zhao, XS
    [J]. LOGIC VERSUS APPROXIMATION: ESSAYS DEDICATED TO MICHAEL M RICHTER ON THE OCCASION OF HIS 65TH BIRTHDAY, 2004, 3075 : 18 - 32
  • [2] Algorithms for quantified Boolean formulas
    Williams, R
    [J]. PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 299 - 307
  • [3] On Boolean models for Quantified Boolean Horn formulas
    Büning, HK
    Subramani, K
    Zhao, XS
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 93 - 104
  • [4] Boolean functions as models for quantified Boolean formulas
    Buening, Hans Kleine
    Subramani, K.
    Zhao, Xishun
    [J]. JOURNAL OF AUTOMATED REASONING, 2007, 39 (01) : 49 - 75
  • [5] Boolean Functions as Models for Quantified Boolean Formulas
    Hans Kleine Büning
    K. Subramani
    Xishun Zhao
    [J]. Journal of Automated Reasoning, 2007, 39 : 49 - 75
  • [6] A Survey on Applications of Quantified Boolean Formulas
    Shukla, Ankit
    Biere, Armin
    Seidl, Martina
    Pulina, Luca
    [J]. 2019 IEEE 31ST INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2019), 2019, : 78 - 84
  • [7] RESOLUTION FOR QUANTIFIED BOOLEAN-FORMULAS
    BUNING, HK
    KARPINSKI, M
    FLOGEL, A
    [J]. INFORMATION AND COMPUTATION, 1995, 117 (01) : 12 - 18
  • [8] Backdoor Sets of Quantified Boolean Formulas
    Samer, Marko
    Szeider, Stefan
    [J]. JOURNAL OF AUTOMATED REASONING, 2009, 42 (01) : 77 - 97
  • [9] Minimal false quantified Boolean formulas
    Buening, Hans Kleine
    Zhao, Xishun
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2006, PROCEEDINGS, 2006, 4121 : 339 - 352
  • [10] Message passing for quantified Boolean formulas
    Zhang, Pan
    Ramezanpour, Abolfazl
    Zdeborova, Lenka
    Zecchina, Riccardo
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2012,