Beyond satisfiability: Extensions and applications

被引：0
|
作者：
Shankar, Natarajan [1 ]
机构：
[1] SRI Int, Comp Sci Lab, Menlo Pk, CA 94025 USA
来源：
NEXT GENERATION DESIGN AND VERIFICATION METHODOLOGIES FOR DISTRIBUTED EMBEDDED CONTROL SYSTEMS | 2007年
关键词：
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 条
12345