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 条
  • [21] Symmetries of Quantified Boolean Formulas
    Kauers, Manuel
    Seidl, Martina
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2018, 2018, 10929 : 199 - 216
  • [22] 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
  • [23] On the readability of monotone Boolean formulae
    Khaled Elbassioni
    Kazuhisa Makino
    Imran Rauf
    [J]. Journal of Combinatorial Optimization, 2011, 22 : 293 - 304
  • [24] On the readability of monotone Boolean formulae
    Elbassioni, Khaled
    Makino, Kazuhisa
    Rauf, Imran
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 22 (03) : 293 - 304
  • [25] Algorithms for quantified Boolean formulas
    Williams, R
    [J]. PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 299 - 307
  • [26] Planning as Quantified Boolean Formula
    Cashmore, Michael
    Fox, Maria
    Giunchiglia, Enrico
    [J]. 20TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2012), 2012, 242 : 217 - +
  • [27] Testing basic boolean formulae
    Parnas, M
    Ron, D
    Samorodnitsky, A
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2003, 16 (01) : 20 - 46
  • [28] On the robustness of random Boolean formulae
    Mozeika, Alexander
    Saad, David
    Raymond, Jack
    [J]. INTERNATIONAL WORKSHOP ON STATISTICAL-MECHANICAL INFORMATICS 2010 (IW-SMI 2010), 2010, 233
  • [29] On the Readability of Monotone Boolean Formulae
    Elbassioni, Khaled
    Makino, Kazuhisa
    Rauf, Imran
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2009, 5609 : 496 - +
  • [30] On Irrelevant Literals in Pseudo-Boolean Constraint Learning
    Le Berre, Daniel
    Marquis, Pierre
    Mengel, Stefan
    Wallon, Romain
    [J]. PROCEEDINGS OF THE TWENTY-NINTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, : 1148 - 1154
12345