語系:
繁體中文
English
說明(常見問題)
圖資館首頁
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Decision proceduresan algorithmic po...
~
Kroening, Daniel.
Decision proceduresan algorithmic point of view /
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Decision proceduresby Daniel Kroening, Ofer Strichman.
其他題名:
an algorithmic point of view /
作者:
Kroening, Daniel.
其他作者:
Strichman, Ofer.
出版者:
Berlin, Heidelberg :Springer Berlin Heidelberg :2016.
面頁冊數:
xxi, 356 p. :ill., digital ;24 cm.
Contained By:
Springer eBooks
標題:
Decision makingMathematical models.
電子資源:
http://dx.doi.org/10.1007/978-3-662-50497-0
ISBN:
9783662504970$q(electronic bk.)
Decision proceduresan algorithmic point of view /
Kroening, Daniel.
Decision procedures
an algorithmic point of view /[electronic resource] :by Daniel Kroening, Ofer Strichman. - 2nd ed. - Berlin, Heidelberg :Springer Berlin Heidelberg :2016. - xxi, 356 p. :ill., digital ;24 cm. - Texts in theoretical computer science. an EATCS series,1862-4499. - Texts in theoretical computer science. an EATCS series..
Introduction and Basic Concepts -- Decision Procedures for Propositional Logic -- From Propositional to Quantifier-Free Theories -- Equalities and Uninterpreted Functions -- Linear Arithmetic -- Bit Vectors -- Arrays -- Pointer Logic -- Quantified Formulas -- Deciding a Combination of Theories -- Propositional Encodings -- Applications in Software Engineering -- SMT-LIB 2.0: A Brief Tutorial -- A C++ Library for Developing Decision Procedures.
A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry. The authors introduce the basic terminology of SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework. Then, in separate chapters, they study decision procedures for propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas. They also study the problem of deciding combined theories based on the Nelson-Oppen procedure. The first edition of this book was adopted as a textbook in courses worldwide. It was published in 2008 and the field now called SMT was then in its infancy, without the standard terminology and canonic algorithms it has now; this second edition reflects these changes. It brings forward the DPLL(T) framework. It also expands the SAT chapter with modern SAT heuristics, and includes a new section about incremental satisfiability, and the related Constraints Satisfaction Problem (CSP) The chapter about quantifiers was expanded with a new section about general quantification using E-matching and a section about Effectively Propositional Reasoning (EPR) The book also includes a new chapter on the application of SMT in industrial software engineering and in computational biology, coauthored by Nikolaj Bjorner and Leonardo de Moura, and Hillel Kugler, respectively. Each chapter includes a detailed bibliography and exercises. Lecturers' slides and a C++ library for rapid prototyping of decision procedures are available from the authors' website.
ISBN: 9783662504970$q(electronic bk.)
Standard No.: 10.1007/978-3-662-50497-0doiSubjects--Topical Terms:
190791
Decision making
--Mathematical models.
LC Class. No.: QA279.4 / .K76 2016
Dewey Class. No.: 519.542
Decision proceduresan algorithmic point of view /
LDR
:03604nmm a2200361 a 4500
001
499801
003
DE-He213
005
20161122130503.0
006
m d
007
cr nn 008maaau
008
170621s2016 gw s 0 eng d
020
$a
9783662504970$q(electronic bk.)
020
$a
9783662504963$q(paper)
024
7
$a
10.1007/978-3-662-50497-0
$2
doi
035
$a
978-3-662-50497-0
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA279.4
$b
.K76 2016
072
7
$a
UY
$2
bicssc
072
7
$a
UYA
$2
bicssc
072
7
$a
COM014000
$2
bisacsh
072
7
$a
COM031000
$2
bisacsh
082
0 4
$a
519.542
$2
23
090
$a
QA279.4
$b
.K93 2016
100
1
$a
Kroening, Daniel.
$3
277571
245
1 0
$a
Decision procedures
$h
[electronic resource] :
$b
an algorithmic point of view /
$c
by Daniel Kroening, Ofer Strichman.
250
$a
2nd ed.
260
$a
Berlin, Heidelberg :
$b
Springer Berlin Heidelberg :
$b
Imprint: Springer,
$c
2016.
300
$a
xxi, 356 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
Texts in theoretical computer science. an EATCS series,
$x
1862-4499
505
0
$a
Introduction and Basic Concepts -- Decision Procedures for Propositional Logic -- From Propositional to Quantifier-Free Theories -- Equalities and Uninterpreted Functions -- Linear Arithmetic -- Bit Vectors -- Arrays -- Pointer Logic -- Quantified Formulas -- Deciding a Combination of Theories -- Propositional Encodings -- Applications in Software Engineering -- SMT-LIB 2.0: A Brief Tutorial -- A C++ Library for Developing Decision Procedures.
520
$a
A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry. The authors introduce the basic terminology of SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework. Then, in separate chapters, they study decision procedures for propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas. They also study the problem of deciding combined theories based on the Nelson-Oppen procedure. The first edition of this book was adopted as a textbook in courses worldwide. It was published in 2008 and the field now called SMT was then in its infancy, without the standard terminology and canonic algorithms it has now; this second edition reflects these changes. It brings forward the DPLL(T) framework. It also expands the SAT chapter with modern SAT heuristics, and includes a new section about incremental satisfiability, and the related Constraints Satisfaction Problem (CSP) The chapter about quantifiers was expanded with a new section about general quantification using E-matching and a section about Effectively Propositional Reasoning (EPR) The book also includes a new chapter on the application of SMT in industrial software engineering and in computational biology, coauthored by Nikolaj Bjorner and Leonardo de Moura, and Hillel Kugler, respectively. Each chapter includes a detailed bibliography and exercises. Lecturers' slides and a C++ library for rapid prototyping of decision procedures are available from the authors' website.
650
0
$a
Decision making
$x
Mathematical models.
$3
190791
650
0
$a
Algorithms.
$3
184661
650
0
$a
Logic, Symbolic and mathematical.
$3
180452
650
1 4
$a
Computer Science.
$3
212513
650
2 4
$a
Theory of Computation.
$3
274475
650
2 4
$a
Software Engineering/Programming and Operating Systems.
$3
273711
650
2 4
$a
Optimization.
$3
274084
700
1
$a
Strichman, Ofer.
$3
277570
710
2
$a
SpringerLink (Online service)
$3
273601
773
0
$t
Springer eBooks
830
0
$a
Texts in theoretical computer science. an EATCS series.
$3
762790
856
4 0
$u
http://dx.doi.org/10.1007/978-3-662-50497-0
950
$a
Computer Science (Springer-11645)
筆 0 讀者評論
全部
電子館藏
館藏
1 筆 • 頁數 1 •
1
條碼號
館藏地
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
000000134166
電子館藏
1圖書
電子書
EB QA279.4 K93 2016
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
多媒體檔案
http://dx.doi.org/10.1007/978-3-662-50497-0
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼
登入