Language:
English
繁體中文
Help
圖資館首頁
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Bridging constraint satisfaction and...
~
Petke, Justyna.
Bridging constraint satisfaction and Boolean satisfiability
Record Type:
Electronic resources : Monograph/item
Title/Author:
Bridging constraint satisfaction and Boolean satisfiabilityby Justyna Petke.
Author:
Petke, Justyna.
Published:
Cham :Springer International Publishing :2015.
Description:
xi, 113 p. :ill., digital ;24 cm.
Contained By:
Springer eBooks
Subject:
Constraints (Artificial intelligence)
Online resource:
http://dx.doi.org/10.1007/978-3-319-21810-6
ISBN:
9783319218106$q(electronic bk.)
Bridging constraint satisfaction and Boolean satisfiability
Petke, Justyna.
Bridging constraint satisfaction and Boolean satisfiability
[electronic resource] /by Justyna Petke. - Cham :Springer International Publishing :2015. - xi, 113 p. :ill., digital ;24 cm. - Artificial intelligence: foundations, theory, and algorithms,2365-3051. - Artificial intelligence: foundations, theory, and algorithms..
Introduction -- Background -- Solver Performance on Tractable CSPs: Empirical Evaluation -- SAT Encodings -- From CSP to SAT: Width Restrictions -- From CSP to SAT: Language Restrictions -- SAT Encodings of a Classical Problem: A Case Study -- Conclusions.
This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretical reasons for choosing a particular SAT encoding for several important classes of CSP instances. Boolean satisfiability and constraint satisfaction emerged independently as new fields of computer science, and different solving techniques have become standard for problem solving in the two areas. Even though any propositional formula (SAT) can be viewed as an instance of the general constraint satisfaction problem (CSP), the implications of this connection have only been studied in the last few years. The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.
ISBN: 9783319218106$q(electronic bk.)
Standard No.: 10.1007/978-3-319-21810-6doiSubjects--Topical Terms:
239341
Constraints (Artificial intelligence)
LC Class. No.: QA267.7
Dewey Class. No.: 511.3
Bridging constraint satisfaction and Boolean satisfiability
LDR
:02230nmm a2200337 a 4500
001
474962
003
DE-He213
005
20160324170411.0
006
m d
007
cr nn 008maaau
008
160420s2015 gw s 0 eng d
020
$a
9783319218106$q(electronic bk.)
020
$a
9783319218090$q(paper)
024
7
$a
10.1007/978-3-319-21810-6
$2
doi
035
$a
978-3-319-21810-6
040
$a
GP
$c
GP
041
0
$a
eng
050
4
$a
QA267.7
072
7
$a
UYQ
$2
bicssc
072
7
$a
TJFM1
$2
bicssc
072
7
$a
COM004000
$2
bisacsh
082
0 4
$a
511.3
$2
23
090
$a
QA267.7
$b
.P491 2015
100
1
$a
Petke, Justyna.
$3
729040
245
1 0
$a
Bridging constraint satisfaction and Boolean satisfiability
$h
[electronic resource] /
$c
by Justyna Petke.
260
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2015.
300
$a
xi, 113 p. :
$b
ill., digital ;
$c
24 cm.
490
1
$a
Artificial intelligence: foundations, theory, and algorithms,
$x
2365-3051
505
0
$a
Introduction -- Background -- Solver Performance on Tractable CSPs: Empirical Evaluation -- SAT Encodings -- From CSP to SAT: Width Restrictions -- From CSP to SAT: Language Restrictions -- SAT Encodings of a Classical Problem: A Case Study -- Conclusions.
520
$a
This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretical reasons for choosing a particular SAT encoding for several important classes of CSP instances. Boolean satisfiability and constraint satisfaction emerged independently as new fields of computer science, and different solving techniques have become standard for problem solving in the two areas. Even though any propositional formula (SAT) can be viewed as an instance of the general constraint satisfaction problem (CSP), the implications of this connection have only been studied in the last few years. The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.
650
0
$a
Constraints (Artificial intelligence)
$3
239341
650
0
$a
Algebra, Boolean.
$3
272553
650
1 4
$a
Computer Science.
$3
212513
650
2 4
$a
Artificial Intelligence (incl. Robotics)
$3
252959
650
2 4
$a
Theory of Computation.
$3
274475
710
2
$a
SpringerLink (Online service)
$3
273601
773
0
$t
Springer eBooks
830
0
$a
Artificial intelligence: foundations, theory, and algorithms.
$3
729041
856
4 0
$u
http://dx.doi.org/10.1007/978-3-319-21810-6
950
$a
Computer Science (Springer-11645)
based on 0 review(s)
ALL
電子館藏
Items
1 records • Pages 1 •
1
Inventory Number
Location Name
Item Class
Material type
Call number
Usage Class
Loan Status
No. of reservations
Opac note
Attachments
000000119084
電子館藏
1圖書
電子書
EB QA267.7 P491 2015
一般使用(Normal)
On shelf
0
1 records • Pages 1 •
1
Multimedia
Multimedia file
http://dx.doi.org/10.1007/978-3-319-21810-6
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login