國立虎尾科技大學 |

Principles and Practice of Constraint Programming = 25th International Conference, CP 2019, Stamford, CT, USA, September 30 – October 4, 2019, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Principles and Practice of Constraint Programming/ edited by Thomas Schiex, Simon de Givry.
Reminder of title:	25th International Conference, CP 2019, Stamford, CT, USA, September 30 – October 4, 2019, Proceedings /
other author:	Schiex, Thomas.
Description:	XXVI, 788 p. 831 illus., 179 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Mathematical logic. -
Online resource:	https://doi.org/10.1007/978-3-030-30048-7
ISBN:	9783030300487

Principles and Practice of Constraint Programming = 25th International Conference, CP 2019, Stamford, CT, USA, September 30 – October 4, 2019, Proceedings /
Principles and Practice of Constraint Programming25th International Conference, CP 2019, Stamford, CT, USA, September 30 – October 4, 2019, Proceedings /[electronic resource] :edited by Thomas Schiex, Simon de Givry. - 1st ed. 2019. - XXVI, 788 p. 831 illus., 179 illus. in color.online resource. - Programming and Software Engineering ;11802. - Programming and Software Engineering ;8987.

Technical Track -- Instance Generation via Generator Instances -- Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints -- Exploring Declarative Local-Search Neighbourhoods with Constraint Programming -- Vehicle routing by learning from historical solutions -- On Symbolic Approaches for Computing the Matrix Permanent -- Towards the Characterization of Max-Resolution Transformations of UCSs by UP-Resilience -- Logic-Based Benders Decomposition for Super Solutions: an Application to the Kidney Exchange Problem -- Exploiting Glue Clauses to Design Effective CDCL Branching Heuristics -- Industrial Size Job-Shop Scheduling tackled by Present-Day CP Solvers -- Dual Hashing-based Algorithms for Discrete Integration -- Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search -- A Join-Based Hybrid Parameter for Constraint Satisfaction -- An Incremental SAT-Based Approach to the Graph Colouring Problem -- Constraint-based Techniques in Stochastic Local Search MaxSAT Solving -- Trimming Graphs Using Clausal Proof Optimization -- Improved Job Sequencing Bounds from Decision Diagrams -- Integration of structural constraints into TSP models -- Representing fitness landscapes by valued constraints to understand the complexity of local search -- Estimating the Number of Solutions of Cardinality Constraints through range and roots Decomposition -- Understanding the Empirical Hardness of Random Optimisation Problems -- Guarded Constraint Models Define Treewidth Preserving Reductions -- Automatic Streamlining for Constrained Optimisation -- Compiling Conditional Constraints -- Training Binarized Neural Networks using MIP and CP -- Application Track -- Models for Radiation Therapy Patient Scheduling -- Constraint Programming-based Job Dispatching for Modern HPC Applications -- Scheduling of Mobile Robots using Constraint Programming -- Decomposition and Cut Generation Strategies for Solving Multi-Robot Deployment Problems -- Multi-agent and Parallel CP Track -- An Improved GPU-based SAT Model Counter -- Reducing Bias in Preference Aggregation for Multiagent Soft Constraint Problems -- Testing and Verification Track -- A Cube Distribution Approach to QBF Solving and Certificate Minimization -- Functional Synthesis with Examples -- SolverCheck: Declarative Testing of Constraints -- Encodings for Enumeration-Based Program Synthesis -- Lemma Synthesis for Automating Induction over Algebraic Data Types -- CP and Data Science Track -- Modeling Pattern Set Mining using Boolean Circuits -- Differential Privacy of Hierarchical Census Data: An Optimization Approach -- Generic Constraint-based Block Modeling using Constraint Programming -- Reward Potentials for Planning with Learned Neural Network Transition Models -- Exploiting Counterfactuals for Scalable Stochastic Optimization -- Structure-driven Multiple Constraint Acquisition -- Computational Sustainability Track -- Towards robust scenarios of spatio-temporal renewable energy planning: A GIS-RO approach -- Peak-hour Rail Demand Shifting with Discrete Optimisation -- CP and Life Sciences Track -- Functional significance checking in noisy gene regulatory networks.

This book constitutes the proceedings of the 25th International Conference on Principles and Practice of Constraint Programming, CP 2019, held in Stamford, CT, USA, France, in September/October 2019. The 44 full papers presented in this volume were carefully reviewed and selected from 118 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: technical track; application track; multi-agent and parallel CP track; testing and verification track; CP and data science track; computational sustainability; and CP and life sciences track.

ISBN: 9783030300487

Standard No.: 10.1007/978-3-030-30048-7doiSubjects--Topical Terms:

810627
Mathematical logic.

LC Class. No.: QA8.9-10.3

Dewey Class. No.: 005.131

Principles and Practice of Constraint Programming = 25th International Conference, CP 2019, Stamford, CT, USA, September 30 – October 4, 2019, Proceedings /
LDR:05590nam a22004095i 4500 001 1014211
003 DE-He213
005 20200703174454.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030300487 $9 978-3-030-30048-7
024 7 $a 10.1007/978-3-030-30048-7 $2 doi
035 $a 978-3-030-30048-7
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 25th International Conference, CP 2019, Stamford, CT, USA, September 30 – October 4, 2019, Proceedings / $c edited by Thomas Schiex, Simon de Givry.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XXVI, 788 p. 831 illus., 179 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 11802
505 0 $a Technical Track -- Instance Generation via Generator Instances -- Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints -- Exploring Declarative Local-Search Neighbourhoods with Constraint Programming -- Vehicle routing by learning from historical solutions -- On Symbolic Approaches for Computing the Matrix Permanent -- Towards the Characterization of Max-Resolution Transformations of UCSs by UP-Resilience -- Logic-Based Benders Decomposition for Super Solutions: an Application to the Kidney Exchange Problem -- Exploiting Glue Clauses to Design Effective CDCL Branching Heuristics -- Industrial Size Job-Shop Scheduling tackled by Present-Day CP Solvers -- Dual Hashing-based Algorithms for Discrete Integration -- Techniques Inspired by Local Search for Incomplete MaxSAT and the Linear Algorithm: Varying Resolution and Solution-Guided Search -- A Join-Based Hybrid Parameter for Constraint Satisfaction -- An Incremental SAT-Based Approach to the Graph Colouring Problem -- Constraint-based Techniques in Stochastic Local Search MaxSAT Solving -- Trimming Graphs Using Clausal Proof Optimization -- Improved Job Sequencing Bounds from Decision Diagrams -- Integration of structural constraints into TSP models -- Representing fitness landscapes by valued constraints to understand the complexity of local search -- Estimating the Number of Solutions of Cardinality Constraints through range and roots Decomposition -- Understanding the Empirical Hardness of Random Optimisation Problems -- Guarded Constraint Models Define Treewidth Preserving Reductions -- Automatic Streamlining for Constrained Optimisation -- Compiling Conditional Constraints -- Training Binarized Neural Networks using MIP and CP -- Application Track -- Models for Radiation Therapy Patient Scheduling -- Constraint Programming-based Job Dispatching for Modern HPC Applications -- Scheduling of Mobile Robots using Constraint Programming -- Decomposition and Cut Generation Strategies for Solving Multi-Robot Deployment Problems -- Multi-agent and Parallel CP Track -- An Improved GPU-based SAT Model Counter -- Reducing Bias in Preference Aggregation for Multiagent Soft Constraint Problems -- Testing and Verification Track -- A Cube Distribution Approach to QBF Solving and Certificate Minimization -- Functional Synthesis with Examples -- SolverCheck: Declarative Testing of Constraints -- Encodings for Enumeration-Based Program Synthesis -- Lemma Synthesis for Automating Induction over Algebraic Data Types -- CP and Data Science Track -- Modeling Pattern Set Mining using Boolean Circuits -- Differential Privacy of Hierarchical Census Data: An Optimization Approach -- Generic Constraint-based Block Modeling using Constraint Programming -- Reward Potentials for Planning with Learned Neural Network Transition Models -- Exploiting Counterfactuals for Scalable Stochastic Optimization -- Structure-driven Multiple Constraint Acquisition -- Computational Sustainability Track -- Towards robust scenarios of spatio-temporal renewable energy planning: A GIS-RO approach -- Peak-hour Rail Demand Shifting with Discrete Optimisation -- CP and Life Sciences Track -- Functional significance checking in noisy gene regulatory networks.
520 $a This book constitutes the proceedings of the 25th International Conference on Principles and Practice of Constraint Programming, CP 2019, held in Stamford, CT, USA, France, in September/October 2019. The 44 full papers presented in this volume were carefully reviewed and selected from 118 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: technical track; application track; multi-agent and parallel CP track; testing and verification track; CP and data science track; computational sustainability; and CP and life sciences track.
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 Arithmetic and logic units, Computer. $3 1255170
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 Arithmetic and Logic Structures. $3 672631
700 1 $a Schiex, Thomas. $e editor. $1 https://orcid.org/0000-0001-6049-3415 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1308437
700 1 $a de Givry, Simon. $e editor. $1 https://orcid.org/0000-0002-2242-0458 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1308438
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030300470
776 0 8 $i Printed edition: $z 9783030300494
830 0 $a Programming and Software Engineering ; $v 8987 $3 1253476
856 4 0 $u https://doi.org/10.1007/978-3-030-30048-7
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)