Springer Science and Business Media LLC

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Towards better heuristics for solving bounded model checking problems
Springer Science and Business Media LLC - Tập 28 - Trang 45-66 - 2022
Anissa Kheireddine, Etienne Renault, Souheib Baarir
This paper presents a new way to improve the performance of the SAT-based bounded model checking problem on sequential and parallel procedures by exploiting relevant information identified through the characteristics of the original problem. This led us to design a new way of building interesting heuristics based on the structure of the underlying problem. The proposed methodology is generic and c... hiện toàn bộ
Constraint models for graceful graphs
Springer Science and Business Media LLC - Tập 15 - Trang 64-92 - 2009
Barbara M. Smith, Jean-François Puget
We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the models applied to different classes of graph is given. The first model seems a natural way to represent the problem, but explores a much larger search tree than the other models. The second model does much less search, by making ... hiện toàn bộ
Explaining the cumulative propagator
Springer Science and Business Media LLC - Tập 16 - Trang 250-282 - 2010
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, Mark G. Wallace
The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal of research has investigated new stronger and faster filtering techniques for cumulative, but still most of these techniques only pay off in limited cases or are not scalable. Recently, the “lazy clause generation” hybrid solving a... hiện toàn bộ
On matrices, automata, and double counting in constraint programming
Springer Science and Business Media LLC - Tập 18 - Trang 108-140 - 2012
Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, Justin Pearson
Matrix models are ubiquitous for constraint problems. Many such problems have a matrix of variables $\mathcal{M}$ , with the same constraint C defined by a finite-state automaton $\mathcal{A}$ on each row of $\mathcal{M}$ and a global cardinality constraint $\mathit{gcc}$ on each column of $\mathcal{M}$ . We give two methods for deriving, by double counting, necessary conditions on the cardinality... hiện toàn bộ
Partial symmetry breaking by local search in the group
Springer Science and Business Media LLC - Tập 17 - Trang 148-171 - 2012
Steve D. Prestwich, Brahim Hnich, Helmut Simonis, Roberto Rossi, S. Armagan Tarim
The presence of symmetry in constraint satisfaction problems can cause a great deal of wasted search effort, and several methods for breaking symmetries have been reported. In this paper we describe a new method called Symmetry Breaking by Nonstationary Optimisation, which interleaves local search in the symmetry group with backtrack search on the constraint problem. It can be tuned to break each ... hiện toàn bộ
Complexity of minimum-size arc-inconsistency explanations
Springer Science and Business Media LLC - Tập 28 - Trang 427-449 - 2023
Christian Bessiere, Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard
Explaining the outcome of programs has become one of the main concerns in AI research. In constraint programming, a user may want the system to explain why a given variable assignment is not feasible or how it came to the conclusion that the problem does not have any solution. One solution to the latter is to return to the user a sequence of simple reasoning steps that lead to inconsistency. Arc c... hiện toàn bộ
Improvements of constraint programming and hybrid methods for scheduling of tests on vehicle prototypes
Springer Science and Business Media LLC - Tập 17 - Trang 172-203 - 2012
Kamol Limtanyakul, Uwe Schwiegelshohn
In the automotive industry, a manufacturer must perform several hundreds of tests on prototypes of a vehicle before starting its mass production. Tests must be allocated to suitable prototypes and ordered to satisfy temporal constraints and various kinds of test dependencies. The manufacturer aims to minimize the number of prototypes required. We present improvements of constraint programming (CP)... hiện toàn bộ
Structural tractability of enumerating CSP solutions
Springer Science and Business Media LLC - Tập 18 Số 1 - Trang 38-74 - 2013
Gianluigi Greco, Francesco Scarcello
Introduction to the Special Issue on Local Search Techniques in Constraint Satisfaction
Springer Science and Business Media LLC - - 2007
Y. Naveh, Andrea Roli
Promoting robust black-box solvers through competitions
Springer Science and Business Media LLC - Tập 15 - Trang 317-326 - 2010
Christophe Lecoutre, Olivier Roussel, M. R. C. van Dongen
This paper presents the experiences of the organizers of the four constraint solver competitions which were held in conjunction with CP in the previous years. The paper mainly focuses on the competitions which were held in 2008 and 2009, outlines the reasons for organizing the competitions, describes how the solvers were evaluated, and presents lessons, observations, and general trends.
Tổng số: 358   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10