Lazy Clause Generation is a powerful approach to reducing search in constraintprogramming. this is achieved by recording sets of domain restrictions that previously led to failure as new clausal propagators called no...
详细信息
We propose a framework for computing upper bounds on the optimal value of the (maximization version of) Weighted CSP (WCSP) using super-reparametrizations, which are changes of the weights that keep or increase the WC...
详细信息
A constraint language Γ has non-redundancy f(n) if every instance of CSP(Γ) with n variables contains at most f(n) non-redundant constraints. If Γ has maximum arity r then it has non-redundancy O(nr), but there are...
详细信息
the Virtual Arc Consistency (VAC) algorithm by Cooper et al. is a soft local consistency technique that computes, in linear space, a bound on the basic LP relaxation of the Weighted CSP (WCSP). We generalize this tech...
详细信息
Block-coordinate descent (BCD) is a popular method in large-scale optimization. Unfortunately, its fixed points are not global optima even for convex problems. A succinct characterization of convex problems optimally ...
详细信息
the proceedings contain 20 papers. the topics discussed include: ethical issues in data management;programming by examples: applications, algorithms, and ambiguity resolution;environments and the complexity of abstrac...
ISBN:
(纸本)9781450352918
the proceedings contain 20 papers. the topics discussed include: ethical issues in data management;programming by examples: applications, algorithms, and ambiguity resolution;environments and the complexity of abstract machines;conditional narrowing modulo SMT and axioms;attribute grammars with set attributes and global constraints as a unifying framework for planning domain models;shrink fast correctly!;function definitions for compound values in object-oriented languages;verifiable semantic difference languages;theory learning with symmetry breaking;copattern-matchings and first-class observations in OCaml, with a macro;practical evaluation of the lasp programming model at large scale - an experience report;selective unification in constraint logic programming;causally consistent reversible choreographies: a monitors-as-memories approach;machine fusion: merging merges, more or less;alpha-renaming of higher-order meta-expressions;characterization of strong normalizability for a sequent lambda calculus with co-control;defunctionalisation as modular closure conversion;a core calculus for provenance for provenance inspection;and expressive and strongly type-safe code generation.
Multi-objective problems are frequent in the real world. In general they involve several incomparable objectives and the goal is to find a set of Pareto optimal solutions, i.e. solutions that are incomparable two by t...
详细信息
Column generation is a state-of-the-art method for optimally solving difficult large-scale optimization problems such as airline crew assignment. We show how to apply column generation even if those problems have comp...
详细信息
Bounded fractional hypertree width is the most general known structural property that guarantees polynomial-time solvability of the constraint satisfaction problem. Fichte et al. (cp 2018) presented a robust and ...
详细信息
One of the most powerful techniques for solving centralized constraint satisfaction problems (CSPs) consists of maintaining local consistency during backtrack search (e.g. [11]). Yet, no work has been reported on such...
详细信息
暂无评论