the proceedings contain 55 papers. the special focus in this conference is on principles and practice of constraintprogramming. the topics include: Bounding Linear Programs by constraint Propagation: Application to M...
ISBN:
(纸本)9783030584740
the proceedings contain 55 papers. the special focus in this conference is on principles and practice of constraintprogramming. the topics include: 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;Combinatorial Search in cp-Based Iterated Belief Propagation;certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems;phase Transition Behavior 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;core-Guided Model Reformulation;filtering Rules for Flow Time Minimization in a Parallel Machine Scheduling Problem;MaxSAT-Based Postprocessing for Treedepth;perturbing Branching Heuristics in constraint Solving;replication-Guided Enumeration of Minimal Unsatisfiable Subsets;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;large Neighborhood Search for Temperature Control with Demand Response;Solving the Group Cumulative Scheduling Problem withcpO and ACO;a Branch-and-bound Algorithm to Rigorously Enclose the Round-Off Errors;computing the Local Aromaticity of Benzenoids thanks to constraintprogramming;strengthening Neighbourhood Substitution.
principles and practice of constraintprogramming--cp98 : 4thinternationalconference, cp98, Pisa, Italy, October 26-30, 1998 : Proceedings by cp98 (1998 : Pisa, Italy); Maher, Michael, 1959-; Puget, Jean-Francois; p...
详细信息
principles and practice of constraintprogramming--cp98 : 4thinternationalconference, cp98, Pisa, Italy, October 26-30, 1998 : Proceedings by cp98 (1998 : Pisa, Italy); Maher, Michael, 1959-; Puget, Jean-Francois; published by Berlin ; New York : Springer
the proceedings contain 14 papers. the topics discussed include: configuration of heterogeneous agent fleet: a preliminary generic model;challenges in automotive hardware-software co-configuration;prospective and retr...
the proceedings contain 14 papers. the topics discussed include: configuration of heterogeneous agent fleet: a preliminary generic model;challenges in automotive hardware-software co-configuration;prospective and retrospective approaches to integrate life cycle assessment in configurators: a multiple case study in the construction industry;premises, challenges and suggestions for modelling building knowledge using the configuration paradigm;requirements and architectures for green configuration;developing an algorithm selector for green configuration in scheduling problems;instance configuration for sustainable job shop scheduling;product visualization in configurators: laying the foundations for a comparative description;and using answer set programming for assigning tasks to computing nodes.
the argmax function returns the index of the (first copy of the) maximum value occuring in a list of values. argmax is important in models where we choose a characteristic value based on a seperate criteria, and for m...
详细信息
We introduce the Confidence constraint, a chance constraintthat ensures, with probability, that a set of variables are no smaller than random variables for which the probability distribution is given. this constraint...
详细信息
Domain reduction is an essential tool for solving the constraint satisfaction problem (CSP). In the binary CSP, neighbourhood substitution consists in eliminating a value if there exists another value which can be sub...
详细信息
Dashed strings are a formalism for modelling the domain of string variables when solving combinatorial problems with string constraints. In this work we focus on (variants of) the Replace constraint, which aims to fin...
详细信息
In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some domain D, and by computing a validity domain for ...
详细信息
ISBN:
(纸本)9783642042430
In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some domain D, and by computing a validity domain for the variables rather than a truth value for the formula. this allows us to define a continuous degree of satisfaction for a temporal logic formula ill a, given structure, opening up the field of model-checking to optimization. We illustrate this approach with reverse engineering problems coming from systems biology, and provide some performance figures oil parameter optimization problems with respect to temporal logic specifications.
暂无评论