國立虎尾科技大學 |

Principles and Practice of Constraint Programming = 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Principles and Practice of Constraint Programming/ edited by John Hooker.
其他題名:	24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings /
其他作者:	Hooker, John.
面頁冊數:	XXVII, 765 p. 1483 illus., 89 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematical logic. -
電子資源:	https://doi.org/10.1007/978-3-319-98334-9
ISBN:	9783319983349

Principles and Practice of Constraint Programming = 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings /
Principles and Practice of Constraint Programming24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings /[electronic resource] :edited by John Hooker. - 1st ed. 2018. - XXVII, 765 p. 1483 illus., 89 illus. in color.online resource. - Programming and Software Engineering ;11008. - Programming and Software Engineering ;8987.

Main Technical Track -- Automatic Discovery and Exploitation of Promising Subproblems for Tabulation -- Propagating regular membership with dashed strings -- A Constraint-based Encoding for Domain-Independent Temporal Planning -- Decremental Consistency Checking of Temporal Constraints: Algorithms for the Point Algebra and the ORD-Horn Class -- Domain Reduction for Valued Constraints by Generalising Methods from CSP -- Solver-independent Large Neighbourhood Search -- Solution-Based Phase Saving for CP: A Value-Selection Heuristic to Simulate Local Search Behavior in Complete Solvers -- An SMT Approach to Fractional Hypertree Width -- On the non-Degeneracy of Unsatisfiability Proof Graphs produced by SAT Solvers -- Sequential Precede Chain for value symmetry elimination -- An Incremental SAT-Based Approach to Reason Efficiently On Qualitative Constraint Network -- Clause Learning and New Bounds for Graph Coloring -- Portfolio-based algorithm selection for circuit QBFs -- Making Compact-Table Compact -- Approximation Strategies for Incomplete MaxSAT -- A novel graph-based heuristic approach for solving sport scheduling problem -- Augmenting Stream Constraint Programming with Eventuality Conditions -- A Complete Tolerant Algebraic Side-Channel Attack for AES with CP -- Evaluating QBF Solvers: Quantifier Alternations Matter -- The Quantified Valued Constraint Satisfaction Problem -- MLIC: A MaxSAT-Based framework for learning interpretable classification rules -- Objective as a Feature for Robust Search Strategies -- PW-ACBit: Extending Compact-Table to Enforce Pairwise Consistency on Table Constraints -- Automatic Generation and Selection of Streamlined Constraint Models via Monte Carlo Search on a Model Lattice -- Efficient Methods for Constraint Acquisition -- A Circuit Consellmanntraint for Multiple Tours Problems -- Towards Semi-Automatic Learning-based Model Transformation -- Finding solutions by finding inconsistencies -- The Effect of Structural Measures and Merges on SAT Solver Performance -- Learning-Sensitive Backdoors with Restarts -- Applications Track -- Process Plant Layout Optimization: Equipment Allocation -- A Constraint Programming Approach for Solving Patient Transportation Problems -- Unifying Reserve Design Strategies with Graph Theory and Constraint Programming -- Self-Configuring Cost-Sensitive Hierarchical Clustering With Recourse -- CP and Data Science Track -- User's constraints in itemset mining -- On Maximal Frequent Itemsets Mining With Constraints -- A Parallel SAT based Framework for Closed Frequent Itemsets Mining -- Effective Deep Learning for Constraint Satisfaction Problems -- CP and Music Track -- Extending the Capacity of 1/f Noise Generation -- CP and Operations Research Track -- Securely and Automatically Deploying Micro-Services in an Hybrid Cloud Infrastructure -- Improving Energetic Propagations for Cumulative Scheduling -- CP, Optimization, and Power System Management Track -- A Fast and Scalable Algorithm for Scheduling Large Numbers of Devices under Real-Time Pricing -- Multiagent and Parallel CP Track -- Balancing Asymmetry in Max-sum using Split Constraint Factor Graphs -- A Large Neighboring Search Schema for Multi-Agent Optimization -- Distributed constrained search by selfish agents for efficient equilibria -- Testing and Verification Track -- Metamorphic Testing of Constraint Solvers -- Algebraic Fault Attack on SHA Hash Functions using Programmatic SAT Solvers.

This book constitutes the proceedings of the 24th International Conference on Principles and Practice of Constraint Programming, CP 2018, held in Lille, France, in August 2018. The 41 full and 9 short papers presented in this volume were carefully reviewed and selected from 114 submissions. They deal with all aspects of computing with constraints including theory, algorithms, environments, languages, models, systems, and applications such as decision making, resource allocation, scheduling, configuration, and planning. The papers were organized according to the following topics/tracks: main technical track; applications track; CP and data science; CP and music; CP and operations research; CP, optimization and power system management; multiagent and parallel CP; and testing and verification.

ISBN: 9783319983349

Standard No.: 10.1007/978-3-319-98334-9doiSubjects--Topical Terms:

810627
Mathematical logic.

LC Class. No.: QA8.9-10.3

Dewey Class. No.: 005.131

Principles and Practice of Constraint Programming = 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings /
LDR:05751nam a22004095i 4500 001 988647
003 DE-He213
005 20200703060633.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783319983349 $9 978-3-319-98334-9
024 7 $a 10.1007/978-3-319-98334-9 $2 doi
035 $a 978-3-319-98334-9
050 4 $a QA8.9-10.3
072 7 $a UYA $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.131 $2 23
245 1 0 $a Principles and Practice of Constraint Programming $h [electronic resource] : $b 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings / $c edited by John Hooker.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a XXVII, 765 p. 1483 illus., 89 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Programming and Software Engineering ; $v 11008
505 0 $a Main Technical Track -- Automatic Discovery and Exploitation of Promising Subproblems for Tabulation -- Propagating regular membership with dashed strings -- A Constraint-based Encoding for Domain-Independent Temporal Planning -- Decremental Consistency Checking of Temporal Constraints: Algorithms for the Point Algebra and the ORD-Horn Class -- Domain Reduction for Valued Constraints by Generalising Methods from CSP -- Solver-independent Large Neighbourhood Search -- Solution-Based Phase Saving for CP: A Value-Selection Heuristic to Simulate Local Search Behavior in Complete Solvers -- An SMT Approach to Fractional Hypertree Width -- On the non-Degeneracy of Unsatisfiability Proof Graphs produced by SAT Solvers -- Sequential Precede Chain for value symmetry elimination -- An Incremental SAT-Based Approach to Reason Efficiently On Qualitative Constraint Network -- Clause Learning and New Bounds for Graph Coloring -- Portfolio-based algorithm selection for circuit QBFs -- Making Compact-Table Compact -- Approximation Strategies for Incomplete MaxSAT -- A novel graph-based heuristic approach for solving sport scheduling problem -- Augmenting Stream Constraint Programming with Eventuality Conditions -- A Complete Tolerant Algebraic Side-Channel Attack for AES with CP -- Evaluating QBF Solvers: Quantifier Alternations Matter -- The Quantified Valued Constraint Satisfaction Problem -- MLIC: A MaxSAT-Based framework for learning interpretable classification rules -- Objective as a Feature for Robust Search Strategies -- PW-ACBit: Extending Compact-Table to Enforce Pairwise Consistency on Table Constraints -- Automatic Generation and Selection of Streamlined Constraint Models via Monte Carlo Search on a Model Lattice -- Efficient Methods for Constraint Acquisition -- A Circuit Consellmanntraint for Multiple Tours Problems -- Towards Semi-Automatic Learning-based Model Transformation -- Finding solutions by finding inconsistencies -- The Effect of Structural Measures and Merges on SAT Solver Performance -- Learning-Sensitive Backdoors with Restarts -- Applications Track -- Process Plant Layout Optimization: Equipment Allocation -- A Constraint Programming Approach for Solving Patient Transportation Problems -- Unifying Reserve Design Strategies with Graph Theory and Constraint Programming -- Self-Configuring Cost-Sensitive Hierarchical Clustering With Recourse -- CP and Data Science Track -- User's constraints in itemset mining -- On Maximal Frequent Itemsets Mining With Constraints -- A Parallel SAT based Framework for Closed Frequent Itemsets Mining -- Effective Deep Learning for Constraint Satisfaction Problems -- CP and Music Track -- Extending the Capacity of 1/f Noise Generation -- CP and Operations Research Track -- Securely and Automatically Deploying Micro-Services in an Hybrid Cloud Infrastructure -- Improving Energetic Propagations for Cumulative Scheduling -- CP, Optimization, and Power System Management Track -- A Fast and Scalable Algorithm for Scheduling Large Numbers of Devices under Real-Time Pricing -- Multiagent and Parallel CP Track -- Balancing Asymmetry in Max-sum using Split Constraint Factor Graphs -- A Large Neighboring Search Schema for Multi-Agent Optimization -- Distributed constrained search by selfish agents for efficient equilibria -- Testing and Verification Track -- Metamorphic Testing of Constraint Solvers -- Algebraic Fault Attack on SHA Hash Functions using Programmatic SAT Solvers.
520 $a This book constitutes the proceedings of the 24th International Conference on Principles and Practice of Constraint Programming, CP 2018, held in Lille, France, in August 2018. The 41 full and 9 short papers presented in this volume were carefully reviewed and selected from 114 submissions. They deal with all aspects of computing with constraints including theory, algorithms, environments, languages, models, systems, and applications such as decision making, resource allocation, scheduling, configuration, and planning. The papers were organized according to the following topics/tracks: main technical track; applications track; CP and data science; CP and music; CP and operations research; CP, optimization and power system management; multiagent and parallel CP; and testing and verification.
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Artificial intelligence. $3 559380
650 0 $a Software engineering. $3 562952
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer organization. $3 596298
650 1 4 $a Mathematical Logic and Formal Languages. $3 670059
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 669780
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Computer Systems Organization and Communication Networks. $3 669309
700 1 $a Hooker, John. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 898476
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319983332
776 0 8 $i Printed edition: $z 9783319983356
830 0 $a Programming and Software Engineering ; $v 8987 $3 1253476
856 4 0 $u https://doi.org/10.1007/978-3-319-98334-9
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)