Sciweavers

Share
CADE
2011
Springer
7 years 9 months ago
Exploiting Symmetry in SMT Problems
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...
David Déharbe, Pascal Fontaine, Stephan Mer...
ICLP
2011
Springer
8 years 20 days ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
AIPS
2011
8 years 25 days ago
Scheduling an Aircraft Repair Shop
We address a scheduling problem in the context of military aircraft maintenance where the goal is to meet the aircraft requirements for a number of missions in the presence of bre...
Maliheh Aramon Bajestani, J. Christopher Beck
IAJIT
2011
8 years 4 months ago
A constraint programming based approach to detect ontology inconsistencies
: This paper proposes a constraint programming based approach to handle ontologies consistency, and more precisely user-defined consistencies. In practice, ontologies consistency i...
Moussa Benaissa, Yahia Lebbah
ANOR
2011
214views more  ANOR 2011»
8 years 4 months ago
A hybrid constraint programming approach to the log-truck scheduling problem
Abstract. Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization te...
Nizar El Hachemi, Michel Gendreau, Louis-Martin Ro...
ICAI
2010
8 years 7 months ago
Constraint-Based Dogleg Channel Routing with Via Minimization
- In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP ...
I-Lun Tseng, Huan-Wen Chen, Che-I Lee, Adam Postul...
HEURISTICS
2008
136views more  HEURISTICS 2008»
8 years 7 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
CP
2010
Springer
8 years 7 months ago
A Generic Visualization Platform for CP
In this paper we describe the design and implementation of CP-VIZ, a generic visualization platform for constraint programming. It provides multiple views to show the search tree, ...
Helmut Simonis, Paul Davern, Jacob Feldman, Deepak...
HEURISTICS
2002
146views more  HEURISTICS 2002»
8 years 9 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
ENDM
2000
116views more  ENDM 2000»
8 years 9 months ago
Conceptual Models for Combined Planning and Scheduling
Planning and scheduling attracts an unceasing attention of computer science community. Several research areas like Artificial Intelligence, Operations Research and Constraint Prog...
Roman Barták
books