Beyond satisfiability: Extensions and applications

被引:0
|
作者
Shankar, Natarajan [1 ]
机构
[1] SRI Int, Comp Sci Lab, Menlo Pk, CA 94025 USA
关键词
boolean satisfiability; satisfiability modulo theories; decision procedures; automated theorem proving;
D O I
10.1007/978-1-4020-6254-4_17
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Satisfiability procedures are used to check if a formula representing a constraint has a solution. They are gaining popularity as core engines for a number of applications. These procedures can be adapted for uses beyond testing satisfiability. We describe the underlying ideas and enumerate some of the applications and extensions of satisfiability procedures for verification, test generation, planning, and scheduling.
引用
收藏
页码:213 / 225
页数:13
相关论文
共 50 条
  • [1] Boolean Satisfiability: Solvers and Extensions
    Weissenbacher, Georg
    Subramanyan, Pramod
    Malik, Sharad
    SOFTWARE SYSTEMS SAFETY, 2014, 36 : 223 - 278
  • [2] Transition of Consistency and Satisfiability under Language Extensions
    Schloeder, Julian J.
    Koepke, Peter
    FORMALIZED MATHEMATICS, 2012, 20 (03): : 193 - 197
  • [3] BEYOND ACTOR-OBSERVER DIFFERENCES IN PERSPECTIVE - EXTENSIONS AND APPLICATIONS
    FARR, R
    ANDERSON, A
    BULLETIN OF THE BRITISH PSYCHOLOGICAL SOCIETY, 1983, 36 (MAY): : A56 - A56
  • [4] Satisfiability Checking: Theory and Applications
    Abraham, Erika
    Kremer, Gereon
    SOFTWARE ENGINEERING AND FORMAL METHODS: 14TH INTERNATIONAL CONFERENCE, SEFM 2016, 2016, 9763 : 9 - 23
  • [5] Nanosheet Extensions and Beyond
    Tu, Chien-Te
    Liu, Yi-Chun
    Chen, Yu-Rui
    Huang, Bo-Wei
    Cheng, Chun-Yi
    Liu, C. W.
    2023 INTERNATIONAL VLSI SYMPOSIUM ON TECHNOLOGY, SYSTEMS AND APPLICATIONS, VLSI-TSA/VLSI-DAT, 2023,
  • [6] Beyond boolean SAT: Satisfiability Modulo Theories
    Cimatti, Alessandro
    WODES' 08: PROCEEDINGS OF THE 9TH INTERNATIONAL WORKSHOP ON DISCRETE EVENT SYSTEMS, 2008, : 68 - 73
  • [7] Satisfiability Modulo Theories: Introduction and Applications
    De Moura, Leonardo
    Bjorner, Nikolaj
    COMMUNICATIONS OF THE ACM, 2011, 54 (09) : 69 - 77
  • [8] SIMPLIFICATION IN A SATISFIABILITY CHECKER FOR VLSI APPLICATIONS
    VLACH, F
    JOURNAL OF AUTOMATED REASONING, 1993, 10 (01) : 115 - 136
  • [9] Propositional satisfiability: Techniques, algorithms and applications
    Lynce, Ines
    AI COMMUNICATIONS, 2006, 19 (02) : 187 - 189
  • [10] Gap theorems for robust satisfiability: Boolean CSPs and beyond
    Ham, Lucy
    THEORETICAL COMPUTER SCIENCE, 2017, 676 : 69 - 91