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 条
  • [1] Encoding quantified CSPs as quantified Boolean formulae
    Gent, IP
    Nightingale, P
    Rowley, A
    [J]. ECAI 2004: 16TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 110 : 176 - 180
  • [2] Symmetry Breaking in Quantified Boolean Formulae
    Audemard, Gilles
    Jabbour, Said
    Sais, Lakhdar
    [J]. 20TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2007, : 2262 - 2267
  • [3] A satisfiability procedure for quantified Boolean formulae
    Plaisted, DA
    Biere, A
    Zhu, YS
    [J]. DISCRETE APPLIED MATHEMATICS, 2003, 130 (02) : 291 - 328
  • [4] An algorithm to evaluate quantified Boolean formulae
    Cadoli, M
    Giovanardi, A
    Schaerf, M
    [J]. FIFTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-98) AND TENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICAL INTELLIGENCE (IAAI-98) - PROCEEDINGS, 1998, : 262 - 267
  • [5] Improvements to the evaluation of quantified Boolean formulae
    Rintanen, J
    [J]. IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2, 1999, : 1192 - 1197
  • [6] Using Autarky to Evaluate Quantified Boolean Formulae
    Ruehmkorf, Jens
    [J]. PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON ADVANCED ENGINEERING COMPUTING AND APPLICATIONS IN SCIENCES (ADVCOMP 2010), 2010, : 154 - 159
  • [7] A distributed algorithm to evaluate quantified Boolean formulae
    Feldmann, R
    Monien, B
    Schamberger, S
    [J]. SEVENTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-2001) / TWELFTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-2000), 2000, : 285 - 290
  • [8] Encoding deductive argumentation in quantified Boolean formulae
    Besnard, Philippe
    Hunter, Anthony
    Woltran, Stefan
    [J]. ARTIFICIAL INTELLIGENCE, 2009, 173 (15) : 1406 - 1423
  • [9] From (Quantified) Boolean Formulae to Answer Set Programming
    Stephan, Igor
    Da Mota, Benoit
    Nicolas, Pascal
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 2009, 19 (04) : 565 - 590
  • [10] Paraconsistent preferential reasoning by signed quantified Boolean formulae
    Arieli, O
    [J]. ECAI 2004: 16TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 110 : 773 - 777
12345