國立虎尾科技大學 |

Principles and Practice of Constraint Programming = 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Principles and Practice of Constraint Programming/ edited by Helmut Simonis.
其他題名:	26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings /
其他作者:	Simonis, Helmut.
面頁冊數:	XV, 972 p. 532 illus., 140 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Simulation and Modeling. -
電子資源:	https://doi.org/10.1007/978-3-030-58475-7
ISBN:	9783030584757

Principles and Practice of Constraint Programming = 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings /
Principles and Practice of Constraint Programming26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings /[electronic resource] :edited by Helmut Simonis. - 1st ed. 2020. - XV, 972 p. 532 illus., 140 illus. in color.online resource. - Programming and Software Engineering ;12333. - Programming and Software Engineering ;8987.

Technical Track -- Dashed strings and the replace(-all) constraint -- Combinatorial Search in CP-Based Iterated Belief Propagation -- Replication-Guided Enumeration of Minimal Unsatisfiable Subsets -- Solving Satisfaction Problems using Large-Neighbourhood Search -- Quantum-accelerated global constraint ltering -- Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local Search -- Tractable Fragments of Temporal Sequences of Topological Information -- Strengthening neighbourhood substitution -- Effective Encodings of Constraint Programming Models to SMT -- Watched Propagation of 0-1 Integer Linear Constraints -- Bounding Linear Programs by Constraint Propagation: Application to Max-SAT -- On Relation Between Constraint Propagation and Block-Coordinate Descent in Linear Programs -- DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees -- Aggregation and Garbage Collection for Online Optimization -- Treewidth-Aware Quantifier Elimination and Expansion for QCSP -- A Time Leap Challenge for SAT-Solving -- Breaking Symmetries with RootClique and LexTopsort -- Towards Faster Reasoners by using Transparent Huge Pages -- The argmax constraint -- A branch-and-bound algorithm to rigorously enclose the round-off errors -- Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems -- Solving the Group Cumulative Scheduling Problem with CPO and ACO -- Phase Transition Behaviour in Knowledge Compilation -- A Faster Exact Algorithm to Count X3SAT Solutions -- Visualizations to Summarize Search Behavior -- Parallelization of TSP solving in CP -- Using Resolution Proofs to Analyse CDCL Solvers -- Large Neighborhood Search for Temperature Control with Demand Response -- Core-Guided Model Reformulation -- Filtering rules for ow time minimization in a Parallel Machine Scheduling Problem -- MaxSAT-Based Postprocessing for Treedepth -- Effective Perturbations for Constraint Solving -- Finding the Hardest Formulas for Resolution -- HADDOCK: A Language and Architecture for Decision Diagram Compilation -- Towards a Generic Interval Solver for Differential-Algebraic CSP -- abstractXOR: A global constraint dedicated to differential cryptanalysis -- In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle Problem -- Application Track -- Leveraging Reinforcement Learning, Constraint Programming and Local Search: A Case Study in Car Manufacturing -- Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming -- Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry -- RobTest: A CP Approach to Generate Maximal Test Trajectories for Industrial Robots -- A Two-Phase Constraint Programming Model for Examination Timetabling at University College Cork -- Exact Approaches to the Multi-Agent Collective Construction Problem -- The Confidence Constraint: A Step Towards Stochastic CP Solvers -- Parity (XOR) Reasoning for the Index Calculus Attack -- Constraint-Based Software Diversification for Efficient Mitigation of Code-Reuse Attacks -- CP and Data Science and Machine Learning -- Pushing data into CP models using Graphical Model Learning and Solving -- Generating Random Logic Programs Using Constraint Programming -- Towards Formal Fairness in Machine Learning -- Verifying Equivalence Properties of Neural Networks with ReLU Activation Functions -- Learning the Satisfiability of Pseudo-Boolean Problem with Graph Neural Networks -- A Machine Learning based Splitting Heuristic for Divide-and-Conquer Solvers -- Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models -- Omissions in Constraint Acquisition -- Computing Optimal Decision Sets with SAT.

This book constitutes the proceedings of the 26th International Conference on Principles and Practice of Constraint Programming, CP 2020, held in Louvain-la-Neuve, Belgium, in September 2020. The conference was held virtually due to the COVID-19 pandemic. The 55 full papers presented in this volume were carefully reviewed and selected from 122 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; and CP and data science and machine learning.

ISBN: 9783030584757

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

669249
Simulation and Modeling.

LC Class. No.: QA8.9-10.3

Dewey Class. No.: 005.131

Principles and Practice of Constraint Programming = 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings /
LDR:05980nam a22004095i 4500 001 1023494
003 DE-He213
005 20200906213550.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030584757 $9 978-3-030-58475-7
024 7 $a 10.1007/978-3-030-58475-7 $2 doi
035 $a 978-3-030-58475-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 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings / $c edited by Helmut Simonis.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XV, 972 p. 532 illus., 140 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 12333
505 0 $a Technical Track -- Dashed strings and the replace(-all) constraint -- Combinatorial Search in CP-Based Iterated Belief Propagation -- Replication-Guided Enumeration of Minimal Unsatisfiable Subsets -- Solving Satisfaction Problems using Large-Neighbourhood Search -- Quantum-accelerated global constraint ltering -- Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local Search -- Tractable Fragments of Temporal Sequences of Topological Information -- Strengthening neighbourhood substitution -- Effective Encodings of Constraint Programming Models to SMT -- Watched Propagation of 0-1 Integer Linear Constraints -- Bounding Linear Programs by Constraint Propagation: Application to Max-SAT -- On Relation Between Constraint Propagation and Block-Coordinate Descent in Linear Programs -- DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees -- Aggregation and Garbage Collection for Online Optimization -- Treewidth-Aware Quantifier Elimination and Expansion for QCSP -- A Time Leap Challenge for SAT-Solving -- Breaking Symmetries with RootClique and LexTopsort -- Towards Faster Reasoners by using Transparent Huge Pages -- The argmax constraint -- A branch-and-bound algorithm to rigorously enclose the round-off errors -- Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems -- Solving the Group Cumulative Scheduling Problem with CPO and ACO -- Phase Transition Behaviour in Knowledge Compilation -- A Faster Exact Algorithm to Count X3SAT Solutions -- Visualizations to Summarize Search Behavior -- Parallelization of TSP solving in CP -- Using Resolution Proofs to Analyse CDCL Solvers -- Large Neighborhood Search for Temperature Control with Demand Response -- Core-Guided Model Reformulation -- Filtering rules for ow time minimization in a Parallel Machine Scheduling Problem -- MaxSAT-Based Postprocessing for Treedepth -- Effective Perturbations for Constraint Solving -- Finding the Hardest Formulas for Resolution -- HADDOCK: A Language and Architecture for Decision Diagram Compilation -- Towards a Generic Interval Solver for Differential-Algebraic CSP -- abstractXOR: A global constraint dedicated to differential cryptanalysis -- In Pursuit of an Efficient SAT Encoding for the Hamiltonian Cycle Problem -- Application Track -- Leveraging Reinforcement Learning, Constraint Programming and Local Search: A Case Study in Car Manufacturing -- Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming -- Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry -- RobTest: A CP Approach to Generate Maximal Test Trajectories for Industrial Robots -- A Two-Phase Constraint Programming Model for Examination Timetabling at University College Cork -- Exact Approaches to the Multi-Agent Collective Construction Problem -- The Confidence Constraint: A Step Towards Stochastic CP Solvers -- Parity (XOR) Reasoning for the Index Calculus Attack -- Constraint-Based Software Diversification for Efficient Mitigation of Code-Reuse Attacks -- CP and Data Science and Machine Learning -- Pushing data into CP models using Graphical Model Learning and Solving -- Generating Random Logic Programs Using Constraint Programming -- Towards Formal Fairness in Machine Learning -- Verifying Equivalence Properties of Neural Networks with ReLU Activation Functions -- Learning the Satisfiability of Pseudo-Boolean Problem with Graph Neural Networks -- A Machine Learning based Splitting Heuristic for Divide-and-Conquer Solvers -- Theoretical and Experimental Results for Planning with Learned Binarized Neural Network Transition Models -- Omissions in Constraint Acquisition -- Computing Optimal Decision Sets with SAT.
520 $a This book constitutes the proceedings of the 26th International Conference on Principles and Practice of Constraint Programming, CP 2020, held in Louvain-la-Neuve, Belgium, in September 2020. The conference was held virtually due to the COVID-19 pandemic. The 55 full papers presented in this volume were carefully reviewed and selected from 122 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; and CP and data science and machine learning.
650 2 4 $a Simulation and Modeling. $3 669249
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 669780
650 2 4 $a Artificial Intelligence. $3 646849
650 1 4 $a Mathematical Logic and Formal Languages. $3 670059
650 0 $a Computer simulation. $3 560190
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Software engineering. $3 562952
650 0 $a Artificial intelligence. $3 559380
650 0 $a Mathematical logic. $2 bicssc $3 810627
700 1 $a Simonis, Helmut. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1319445
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030584740
776 0 8 $i Printed edition: $z 9783030584764
830 0 $a Programming and Software Engineering ; $v 8987 $3 1253476
856 4 0 $u https://doi.org/10.1007/978-3-030-58475-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)