Boolean Satisfiability: Theory and Engineering

被引：36
|
作者：
Vardi, Moshe Y.
机构：
来源：
COMMUNICATIONS OF THE ACM | 2014年 / 57卷 / 03期
关键词：
D O I：
10.1145/2578043
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：5 / 5
页数：1
相关论文
共 50 条
  • [1] Generalizing Boolean satisfiability II: Theory
    Dixon, HE
    Ginsberg, ML
    Luks, EM
    Parkes, AJ
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2004, 22 : 481 - 534
  • [2] The Satisfiability Problem for Boolean Set Theory with a Choice Correspondence
    Cantone, Domenico
    Giarlotta, Alfio
    Watson, Stephen
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2017, (256): : 61 - 75
  • [3] Engineering the development of quantum programs: Application to the Boolean satisfiability problem
    Alonso, Diego
    Sanchez, Pedro
    Sanchez-Rubio, Francisco
    [J]. ADVANCES IN ENGINEERING SOFTWARE, 2022, 173
  • [4] Symmetry in Boolean Satisfiability
    Aloul, Fadi A.
    [J]. SYMMETRY-BASEL, 2010, 2 (02): : 1121 - 1134
  • [5] Stochastic Boolean satisfiability
    Littman, ML
    Majercik, SM
    Pitassi, T
    [J]. JOURNAL OF AUTOMATED REASONING, 2001, 27 (03) : 251 - 296
  • [6] Stochastic Boolean Satisfiability
    Michael L. Littman
    Stephen M. Majercik
    Toniann Pitassi
    [J]. Journal of Automated Reasoning, 2001, 27 : 251 - 296
  • [7] Applying UCT to Boolean Satisfiability
    Previti, Alessandro
    Ramanujan, Raghuram
    Schaerf, Marco
    Selman, Bart
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2011, 2011, 6695 : 373 - 374
  • [8] Boolean Satisfiability: Solvers and Extensions
    Weissenbacher, Georg
    Subramanyan, Pramod
    Malik, Sharad
    [J]. SOFTWARE SYSTEMS SAFETY, 2014, 36 : 223 - 278
  • [9] Resolution for Stochastic Boolean Satisfiability
    Teige, Tino
    Fraenzle, Martin
    [J]. LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, 2010, 6397 : 625 - 639
  • [10] Fault tolerant boolean satisfiability
    Roy, Amitabha
    [J]. Journal of Artificial Intelligence Research, 1600, 25 : 503 - 527
12345