Computational Sustainability is a new emerging research field withthe overall goal of studying and providing solutions to computational problems for balancing environmental, economic, and societal needs for a sustain...
详细信息
constraintprogramming can definitely be seen as a model-driven paradigm. the users write programs for modeling problems. these programs are mapped to executable models to calculate the solutions. this paper focuses o...
详细信息
作者：
Sulzmann, MartinLam, Edmund S. L.Programming
Logics and Semantics Group IT University of Copenhagen Rued Langgaards Vej 7 2300 Copenhagen S Denmark School of Computing
National University of Singapore S16 Level 5 3 Science Drive 2 Singapore 117543 Singapore
Multi-set constraint rewriting allows for a highly parallel computational model and has been used in a multitude of application domains such as constraint solving, agent specification etc. Rewriting steps can be appli...
详细信息
the proceedings contain 97 papers. the special focus in this conference is on principles and practice of constraintprogramming. the topics include: constraints in program analysis and verification;algorithmic adventu...
ISBN:
(纸本)3540232419
the proceedings contain 97 papers. the special focus in this conference is on principles and practice of constraintprogramming. the topics include: constraints in program analysis and verification;algorithmic adventures at the interface of computer science, statistical physics, and combinatorics;challenges for constraintprogramming in networking;consistency and random constraint satisfaction models with a high constraint tightness;statistical regimes across constrainedness regions;unary resource constraint with optional activities;backtrack-free search for real-time constraint satisfaction;deriving filtering algorithms from constraint checkers;leveraging the learning power of examples in automated constraint acquisition;disjoint, partition and intersection constraints for set and multiset variables;decomposition and learning for a hard real time task allocation problem;quantified constraint satisfaction and 2-semilattice polymorphisms;heuristic selection for stochastic search optimization;a complete characterization of complexity for Boolean constraint optimization problems;bounding the resource availability of partially ordered events with constant resource impact;a domain consistency algorithm for the stretch constraint;counting-based look-ahead schemes for constraint satisfaction;completable partial solutions in constraintprogramming and constraint-based scheduling;global constraints for integer and set value precedence;constraint satisfaction in semi-structured data graphs;strategies for global optimization of temporal preferences;propagation guided large neighborhood search;generating robust partial order schedules;improved bound computation in presence of several clique constraints;controllability of soft temporal constraint problems and solving non-clausal formulas with DPLL search.
the proceedings contain 25 papers. the topics discussed include: order-sorted dependency pairs;macros for context-free grammars;inferring precise polymorphic type dependencies in logic programs;a type system for safe ...
ISBN:
(纸本)9781605581170
the proceedings contain 25 papers. the topics discussed include: order-sorted dependency pairs;macros for context-free grammars;inferring precise polymorphic type dependencies in logic programs;a type system for safe memory management and its proof of correctness;programming with proofs and explicit contexts;towards execution time estimation in abstract machine-based languages;similarity-based reasoning in qualified logic programming;classifying integrity checking methods with regard to inconsistency tolerance;comprehending finite maps for algorithmic debugging of higher-order functional programs;parallel execution of multi-set constraint rewrite rules;a rewriting framework for the composition of access control policies;global difference constraint propagation for finite domain solvers;and dynamic variable elimination during propagation solving.
constraint propagation solvers interleave propagation (removing impossible values from variables domains) with search. Propagation is performed by executing propagators (removing values) implementing constraints (defi...
详细信息
this paper presents a computational model for the cooperation of constraint domains, based on a generic constraint Functional Logic programming (CFLP) Scheme and designed to support declarative programming with functi...
详细信息
Difference constraints of the form x - y ≤ d are well studied, with efficient algorithms for satisfaction and implication, because of their connection to shortest paths. Finite domain propagation algorithms however d...
详细信息
constraintprogramming often involves global constraints, for which various custom filtering algorithms have been published. this work Presents a semi-automatic generation of CHR solvers for the subset of global const...
详细信息
ISBN:
(纸本)9783540859574
constraintprogramming often involves global constraints, for which various custom filtering algorithms have been published. this work Presents a semi-automatic generation of CHR solvers for the subset of global constraints defineable by specific automata. the generation is hissed on a constraint logic program modelling an automaton and an improved version of the Prim-Miner algorithm. the solvers only need to be generated once and achieve are-consistency for over 40 global constraints.
When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear equations both with and without coefficients? Constrai...
详细信息
ISBN:
(纸本)9783540859574
When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear equations both with and without coefficients? constraint variants are ubiquitous: implementing them requires considerable effort but yields better performance. this paper shows how to use variable views to derive perfect propagator variants: derived propagators inherit essential properties such as correctness and domain and bounds completeness.
暂无评论