Hybrid methods that combine constraint programming with mathematical programming make essential use of continuous relaxations for global constraints. We state a relaxation for the cumulative constraint. In particular ...
详细信息
We consider the problem of Mutually Orthogonal Latin Squares and propose two algorithms which integrate Integer programming (IP) and Constraint programming (CP). their behaviour is examined and compared to traditional...
详细信息
the aim of this paper is to demonstrate that CP could be abetter candidate than MIP for solving the master problem within a Benders decomposition approach. Our demonstration is based on a case study of a workforce sch...
详细信息
the proceedings contain 83 papers. the special focus in this conference is on Innovative Applications and Posters. the topics include: Reduced cost-based ranking for generating promising subproblems;integrating constr...
ISBN:
(纸本)3540441204
the proceedings contain 83 papers. the special focus in this conference is on Innovative Applications and Posters. the topics include: Reduced cost-based ranking for generating promising subproblems;integrating constraint and integer programming for the orthogonal latin squares problem;on optimal correction of inconsistent linear constraints;temporal planning through mixed integer programming;a new multi-resource cumulatives constraint with negative heights;global constraints for lexicographic orderings;a global filtering algorithm for handling systems of quadratic equations and inequations;amplification of search performance through randomization of heuristics;computing the envelope for stepwise-constant resource allocations;local probing applied to scheduling;recovering and exploiting structural knowledge from CNF formulas;towards a symmetric treatment of satisfaction and conflicts in quantified boolean formula evaluation;accelerating random walks;scaling and probabilistic smoothing;learning and solving soft temporal constraints;opportunistic specialization in russian doll search;range-based algorithm for max-CSP;resolution complexity of random constraints;constraint satisfaction, bounded treewidth, and finite-variable logics;determining the number of solutions to binary CSP instances;consistency checking for qualitative spatial reasoning with cardinal directions;open constraint satisfaction;arc-consistency for quantified constraints;secure distributed constraint satisfaction;partial symmetry breaking;symmetry breaking revisited;breaking row and column symmetries in matrix models;inferring constraint types in constraint programming;controlling embedded systems by reasoning about hidden state;the adaptive constraint engine;indexical-based solver learning;restart policies with dependence among runs and on the edge of planning and scheduling.
the proceedings contain 19 papers. the special focus in this conference is on Database programming Languages. the topics include: Typechecking for semistructured data;optimization properties for classes of conjunctive...
ISBN:
(纸本)9783540440802
the proceedings contain 19 papers. the special focus in this conference is on Database programming Languages. the topics include: Typechecking for semistructured data;optimization properties for classes of conjunctive regular path queries;view-based query answering and query containment over semistructured data;model-checking based data retrieval;implementation and a case study;attribute metadata for relational OLAP and data mining;on monotone data mining languages;reasoning about keys for xml;a tree algebra for XML;a rule-based querying and updating language for XML;linear approximation of semi-algebraic spatial databases using transitive closure logic, in arbitrary dimension;a theory of spatio-temporal database queries;an application-specific database;model theory for generic schema management;view serializable updates of concurrent index structures;a flexible query language for xml and relational databases;querying an entity-relationship db to obtain xml documents;optimising active database rules by partial evaluation and abstract interpretation and simulation of advanced transaction models using GOLOG.
Capturing constraint structure is critical in Constraint programming to support the configuration and adaptation of domain filtering algorithms. To this end, we propose a software model couplinga relational constraint...
详细信息
作者：
Havelund, KRosu, GNASA
Ames Res Ctr Adv Comp Sci Res Inst Automated Software Engn Grp Moffett Field CA 94035 USA NASA
Ames Res Ctr Kestrel Technol Moffett Field CA 94035 USA
the problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software. An algorithm which takes a past ...
详细信息
ISBN:
(纸本)3540434194
the problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software. An algorithm which takes a past time LTL formula and generates an efficient dynamic programming algorithm is presented. the generated algorithm tests whether the formula is satisfied by a finite trace of events given as input and runs in linear time, its constant depending on the size of the LTL formula. the memory needed is constant, also depending on the size of the formula. Further optimizations of the algorithm are suggested. Past time operators suitable for writing succinct specifications are introduced and shown definitionally equivalent to the standard operators. this work is part of the PathExployer project, the objective of which it is to construct a flexible framework for monitoring and analyzing program executions.
the time required for a backtracking search procedure to solve a problem can be minimized by employing randomized restart procedures. To date, researchers designing restart policies have relied on the simplifying assu...
详细信息
programming complex embedded systems involves reasoning through intricate system interactions along paths between sensors, actuators and control processors. this is a time-consuming and error-prone process. Furthermor...
详细信息
Temporal planning is an important problem, as in many real world planning domains actions have different durations and the goals should be achieved by a specified deadline, or as soon as possible. this paper presents ...
详细信息
暂无评论