Boolean Propagation Based on Literals for Quantified Boolean Formulae

被引：0
|
作者：
Stephan, Igor [1 ]
机构：
[1] Univ Angers, LERIA, Angers, France
来源：
ECAI 2006, PROCEEDINGS | 2006年 / 141卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
This paper proposes a new set of propagation rules for quantified Boolean formulae based on literals and generated automatically thanks to quantified Boolean formulae certificates. Different decompositions by introduction of existentially quantified variables are discussed in order to construct complete systems. This set of rules is compared with already proposed quantified Boolean propagation rule sets and Stalmarck's method.
引用
收藏
页码：452 / +
页数：2
相关论文
共 50 条
  • [31] A symbolic search based approach for quantified Boolean formulas
    Audemard, G
    Saïs, L
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, PROCEEDINGS, 2005, 3569 : 16 - 30
  • [32] 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
  • [33] DNA-based algorithms for learning Boolean formulae
    Yasubumi Sakakibara
    [J]. Natural Computing, 2003, 2 (2) : 153 - 171
  • [34] Propositional PSPACE reasoning with boolean programs versus quantified Boolean formulas
    Skelley, A
    [J]. AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 1163 - 1175
  • [35] Message passing for quantified Boolean formulas
    Zhang, Pan
    Ramezanpour, Abolfazl
    Zdeborova, Lenka
    Zecchina, Riccardo
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2012,
  • [36] Learning for quantified Boolean logic satisfiability
    Giunchiglia, E
    Narizzano, M
    Tacchella, A
    [J]. EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS, 2002, : 649 - 654
  • [37] Backdoor Sets of Quantified Boolean Formulas
    Marko Samer
    Stefan Szeider
    [J]. Journal of Automated Reasoning, 2009, 42 : 77 - 97
  • [38] 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
  • [39] Quantified Boolean Solving for Achievement Games
    Boucher, Steve
    Villemaire, Roger
    [J]. ADVANCES IN ARTIFICIAL INTELLIGENCE, KI 2021, 2021, 12873 : 30 - 43
  • [40] On Unordered BDDs and Quantified Boolean Formulas
    Janota, Mikolas
    [J]. PROGRESS IN ARTIFICIAL INTELLIGENCE, PT II, 2019, 11805 : 501 - 507
12345