Variable independence and resolution paths for quantified boolean formulas

被引：0
|
作者：
Van Gelder, Allen [1 ]
机构：
[1] University of California, Santa Cruz, United States
来源：
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2011年 / 6876 LNCS卷
关键词：
Compilation and indexing terms; Copyright 2024 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Boolean functions
引用
收藏
页码：789 / 803
相关论文
共 50 条
  • [1] RESOLUTION FOR QUANTIFIED BOOLEAN-FORMULAS
    BUNING, HK
    KARPINSKI, M
    FLOGEL, A
    INFORMATION AND COMPUTATION, 1995, 117 (01) : 12 - 18
  • [2] Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
    Buening, Hans Kleine
    Zhao, Xishun
    Bubeck, Uwe
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2009, PROCEEDINGS, 2009, 5584 : 391 - +
  • [3] Clause/term resolution and learning in the evaluation of quantified boolean formulas
    Giunchiglia, Enrico
    Narizzano, Massimo
    Tacchella, Armando
    Journal of Artificial Intelligence Research, 2006, 26 : 371 - 416
  • [4] Clause/term resolution and learning in the evaluation of Quantified Boolean Formulas
    Giunchiglia, Enrico
    Narizzano, Massimo
    Tacchella, Armando
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2006, 26 : 371 - 416
  • [5] On models for quantified Boolean formulas
    Büning, HK
    Zhao, XS
    LOGIC VERSUS APPROXIMATION: ESSAYS DEDICATED TO MICHAEL M RICHTER ON THE OCCASION OF HIS 65TH BIRTHDAY, 2004, 3075 : 18 - 32
  • [6] Symmetries of Quantified Boolean Formulas
    Kauers, Manuel
    Seidl, Martina
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2018, 2018, 10929 : 199 - 216
  • [7] Reasoning with quantified boolean formulas
    Giunchiglia, Enrico
    Marin, Paolo
    Narizzano, Massimo
    Frontiers in Artificial Intelligence and Applications, 2009, 185 (01) : 761 - 780
  • [8] Algorithms for quantified Boolean formulas
    Williams, R
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 299 - 307
  • [9] On Boolean models for Quantified Boolean Horn formulas
    Büning, HK
    Subramani, K
    Zhao, XS
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 93 - 104
  • [10] Boolean Functions as Models for Quantified Boolean Formulas
    Hans Kleine Büning
    K. Subramani
    Xishun Zhao
    Journal of Automated Reasoning, 2007, 39 : 49 - 75
12345