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 条
  • [31] A multi-engine solver for quantified Boolean formulas
    Pulina, Luca
    Tacchella, Armando
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2007, 2007, 4741 : 574 - 589
  • [32] Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas
    Egly, Uwe
    Woltran, Stefan
    [J]. COMPUTATIONAL MODELS OF ARGUMENT, 2006, 144 : 133 - 144
  • [33] Transforming Quantified Boolean Formulas Using Biclique Covers
    Kullmann, Oliver
    Shukla, Ankit
    [J]. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT II, TACAS 2023, 2023, 13994 : 372 - 390
  • [34] Variable independence and resolution paths for quantified boolean formulas
    Van Gelder, Allen
    [J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011, 6876 LNCS : 789 - 803
  • [35] SAT based BDD solver for Quantified Boolean Formulas
    Audemard, G
    Saïs, L
    [J]. ICTAI 2004: 16TH IEEE INTERNATIONALCONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, : 82 - 89
  • [36] A Duality-Aware Calculus for Quantified Boolean Formulas
    Fazekas, Katalin
    Seidl, Martina
    Biere, Armin
    [J]. PROCEEDINGS OF 2016 18TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC), 2016, : 181 - 186
  • [37] Comparing different prenexing strategies for quantified Boolean formulas
    Egly, U
    Seidl, M
    Tompits, H
    Woltran, S
    Zolda, M
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 214 - 228
  • [38] Partial Witnesses from Preprocessed Quantified Boolean Formulas
    Seidl, Martina
    Koenighofer, Robert
    [J]. 2014 DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION (DATE), 2014,
  • [39] Short proofs for some symmetric Quantified Boolean Formulas
    Kauers, Manuel
    Seidl, Martina
    [J]. INFORMATION PROCESSING LETTERS, 2018, 140 : 4 - 7
  • [40] Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
    Buening, Hans Kleine
    Zhao, Xishun
    Bubeck, Uwe
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2009, PROCEEDINGS, 2009, 5584 : 391 - +