We employ the narrowing-based execution mechanism of the functional logic programming language Curry in order to automatically generate a system of test cases for glass-box testing of Curry programs. the test cases fo...
详细信息
Precise constraint satisfaction modeling requires specific knowledge acquired from multiple past cases. We address this issue with a general branch-and-bound algorithm that learns the parameters of a given global cons...
详细信息
ISBN:
(纸本)9783319661582;9783319661575
Precise constraint satisfaction modeling requires specific knowledge acquired from multiple past cases. We address this issue with a general branch-and-bound algorithm that learns the parameters of a given global constraint from a small set of positive solutions. the idea is to cleverly explore the possible combinations taken by the constraint's parameters without explicitly enumerating all combinations. We apply our method to learn parameters of global constraints used in timetabling problems such as Sequence and SubsetFocus. the later constraint is our adaptation of the constraint Focus to timetabling problems.
How do we do research?We start with a question. then we read books, journal and conference papers, maybe even speak to people. then we do our own work, make our own contribution, maybe coming up with an improved techn...
详细信息
ISBN:
(纸本)9783319104287;9783319104270
How do we do research?We start with a question. then we read books, journal and conference papers, maybe even speak to people. then we do our own work, make our own contribution, maybe coming up with an improved technique or a greater *** then write up our findings, maybe submit this to a conference, present our work and get feedback, and this results in further research. this is a feedback loop, open to scrutiny by our peers.
We introduce a new method for solving systems of linear inequalities over the rationals-the conflict resolution method. the method successively refines an initial assignment withthe help of newly derived constraints ...
详细信息
ISBN:
(纸本)9783642042430
We introduce a new method for solving systems of linear inequalities over the rationals-the conflict resolution method. the method successively refines an initial assignment withthe help of newly derived constraints until either the assignment becomes a solution of the system or a trivially unsatisfiable constraint is derived. We show that this method is correct and terminating. Our experimental results show that conflict resolution outperforms the Fourier-Motzkin method and the Chernikov algorithm, in some cases by orders of magnitude.
the aim of this paper is to model and mine patterns combining several local patterns (n-ary patterns). First, the user expresses his/her query under constraints involving n-ary patterns. Second, a constraint solver ge...
详细信息
ISBN:
(纸本)9783642153952
the aim of this paper is to model and mine patterns combining several local patterns (n-ary patterns). First, the user expresses his/her query under constraints involving n-ary patterns. Second, a constraint solver generates the correct and complete set of solutions. this approach enables to model in a flexible way sets of constraints combining several local patterns and it leads to discover patterns of higher level. Experiments show the feasibility and the interest of our approach.
We prove that hull consistency for a system of equations or inequalities can be achieved in polynomial time providing that the underlying functions are monotone with respect to each variable. this result holds includi...
详细信息
ISBN:
(纸本)9783642042430
We prove that hull consistency for a system of equations or inequalities can be achieved in polynomial time providing that the underlying functions are monotone with respect to each variable. this result holds including when variables have multiple occurrences in the expressions of the functions, which is usually a pitfall for interval-based contractors. For a given constraint, an optimal contractor can thus I)e enforced quickly under monotonicity and the practical significance of this theoretical result is illustrated on a simple example.
COMET is an object-oriented language supporting a constraint-based architecture for local search through declarative and search components. this paper proposes three novel and lightweight control abstractions for the ...
详细信息
ISBN:
(纸本)3540202021
COMET is an object-oriented language supporting a constraint-based architecture for local search through declarative and search components. this paper proposes three novel and lightweight control abstractions for the search component, significantly enhancing the compositionality, modularity, and reuse of COMET programs. these abstractions, which includes events and checkpoints, rely on first-class closures as the enabling technology. they are especially useful for expressing, in a modular way, heuristic and meta-heuristics, unions of heterogeneous neighborhoods, and sequential composition of neighborhoods.
Local branching is a general purpose heuristic search method successfully used in Mixed Integer programming (MIP). We propose its integration and extension in constraintprogramming (CP).
ISBN:
(纸本)9783540749691
Local branching is a general purpose heuristic search method successfully used in Mixed Integer programming (MIP). We propose its integration and extension in constraintprogramming (CP).
constraintprogramming is a powerful programming paradigm with a great impact on a number of important areas such as logic programming [45], concurrent programming [42], artificial intelligence [12], and combinatorial...
详细信息
ISBN:
(纸本)3540462678
constraintprogramming is a powerful programming paradigm with a great impact on a number of important areas such as logic programming [45], concurrent programming [42], artificial intelligence [12], and combinatorial optimization [46]. We believe that constraintprogramming is also a rich source of many challenging algorithmic problems, and co-operations between the constraintprogramming and the algorithms communities could be beneficial to both areas.
暂无评论