 | 2009 |
|---|
| 194 |       | Iván Dotú,
Pascal Van Hentenryck,
Miguel A. Patricio,
Antonio Berlanga,
Jose García,
José M. Molina López:
Real-Time Tabu Search for Video Tracking Association.
CP 2009: 21-34 |
| 193 | | Pascal Van Hentenryck,
Carleton Coffrin,
Boris Gutkovich:
Constraint-Based Local Search for the Automatic Generation of Architectural Tests.
CP 2009: 787-801 |
| 192 | | Justin Yip,
Pascal Van Hentenryck:
Evaluation of Length-Lex Set Variables.
CP 2009: 817-832 |
| 191 | | Laurent Michel,
Martijn Moraal,
Alexander A. Shvartsman,
Elaine L. Sonderegger,
Pascal Van Hentenryck:
Online Selection of Quorum Systems for RAMBO Reconfiguration.
CP 2009: 88-103 |
| 190 | | Laurent D. Michel,
Pascal Van Hentenryck,
Elaine L. Sonderegger,
Alexander A. Shvartsman,
Martijn Moraal:
Bandwidth-Limited Optimal Deployment of Eventually-Serializable Data Services.
CPAIOR 2009: 193-207 |
| 189 | | Pierre Schaus,
Pascal Van Hentenryck,
Jean-Charles Régin:
Scalable Load Balancing in Nurse to Patient Assignment Problems.
CPAIOR 2009: 248-262 |
| 188 | | Pascal Van Hentenryck:
Constraint Programming.
EMO 2009: 3 |
| 187 | | Justin Yip,
Pascal Van Hentenryck:
Length-lex bound consistency for knapsack constraints.
SAC 2009: 1397-1401 |
| 186 | | Pham Quang Dung,
Yves Deville,
Pascal Van Hentenryck:
LS(graph & tree): a local search framework for constraint optimization on graphs and trees.
SAC 2009: 1402-1407 |
| 185 |  | Carleton Coffrin,
Laurent D. Michel,
Alexander A. Shvartsman,
Elaine L. Sonderegger,
Pascal Van Hentenryck:
Optimizing Network Deployment of Formally-Specified Distributed Systems.
SEDE 2009: 230-237 |
| 184 | | Pham Quang Dung,
Yves Deville,
Pascal Van Hentenryck:
A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract)
CoRR abs/0910.1238: (2009) |
| 183 | | Marie Pelleau,
Pascal Van Hentenryck,
Charlotte Truchet:
Sonet Network Design Problems
CoRR abs/0910.1255: (2009) |
| 182 | | Grégoire Dooms,
Pascal Van Hentenryck,
Laurent Michel:
Model-driven visualizations of constraint-based local search.
Constraints 14(3): 294-324 (2009) |
| 181 | | Pierre Flener,
Justin Pearson,
Meinolf Sellmann,
Pascal Van Hentenryck,
Magnus Ågren:
Dynamic structural symmetry breaking for constraint satisfaction problems.
Constraints 14(4): 506-538 (2009) |
| 180 | | Laurent Michel,
Andrew See,
Pascal Van Hentenryck:
Transparent Parallelization of Constraint Programming.
INFORMS Journal on Computing 21(3): 363-382 (2009) |
| 2008 |
|---|
| 179 | | Manuel Cebrián,
Iván Dotú,
Pascal Van Hentenryck,
Peter Clote:
Protein Structure Prediction on the Face Centered Cubic Lattice by Local Search.
AAAI 2008: 241-246 |
| 178 | | Pascal Van Hentenryck,
Justin Yip,
Carmen Gervet,
Grégoire Dooms:
Bound Consistency for Binary Length-Lex Set Constraints.
AAAI 2008: 375-380 |
| 177 | | Hélène Collavizza,
Michel Rueher,
Pascal Van Hentenryck:
CPBPV: A Constraint-Programming Framework for Bounded Program Verification.
CP 2008: 327-341 |
| 176 | | Iván Dotú,
Manuel Cebrián,
Pascal Van Hentenryck,
Peter Clote:
Protein Structure Prediction with Large Neighborhood Constraint Programming Search.
CP 2008: 82-96 |
| 175 | | Luc Mercier,
Pascal Van Hentenryck:
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization.
CPAIOR 2008: 173-187 |
| 174 | | Laurent Michel,
Alexander A. Shvartsman,
Elaine L. Sonderegger,
Pascal Van Hentenryck:
Optimal Deployment of Eventually-Serializable Data Services.
CPAIOR 2008: 188-202 |
| 173 | | Pascal Van Hentenryck,
Laurent Michel:
The Steel Mill Slab Design Problem Revisited.
CPAIOR 2008: 377-381 |
| 172 | | Pascal Van Hentenryck:
30 Years of Constraint Programming.
CPAIOR 2008: 5 |
| 171 | | Grégoire Dooms,
Pascal Van Hentenryck:
Gap Reduction Techniques for Online Stochastic Project Scheduling.
CPAIOR 2008: 66-81 |
| 170 | | Pascal Van Hentenryck:
The Impact of Constraint Programming.
ECAI 2008: 9 |
| 169 | | Hélène Collavizza,
Michel Rueher,
Pascal Van Hentenryck:
CPBVP: A Constraint-Programming Framework for Bounded Program Verification
CoRR abs/0807.2383: (2008) |
| 168 | | Hélène Collavizza,
Michel Rueher,
Pascal Van Hentenryck:
Comparison between CPBPV, ESC/Java, CBMC, Blast, EUREKA and Why for Bounded Program Verification
CoRR abs/0808.1508: (2008) |
| 167 | | Luc Mercier,
Pascal Van Hentenryck:
Edge Finding for Cumulative Scheduling.
INFORMS Journal on Computing 20(1): 143-153 (2008) |
| 2007 |
|---|
| 166 | | Pascal Van Hentenryck,
Laurence A. Wolsey:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings
Springer 2007 |
| 165 | | Russell Bent,
Pascal Van Hentenryck:
Randomized Adaptive Spatial Decoupling for Large-Scale Vehicle Routing with Time Windows.
AAAI 2007: 173-178 |
| 164 | | Irit Katriel,
Meinolf Sellmann,
Eli Upfal,
Pascal Van Hentenryck:
Propagating Knapsack Constraints in Sublinear Time.
AAAI 2007: 231-236 |
| 163 | | Pascal Van Hentenryck,
Yannis Vergados:
Population-Based Simulated Annealing for Traveling Tournaments.
AAAI 2007: 267-271 |
| 162 | | Pascal Van Hentenryck,
Laurent D. Michel:
Synthesis of Constraint-Based Local Search Algorithms from High-Level Models.
AAAI 2007: 273- |
| 161 | | Grégoire Dooms,
Pascal Van Hentenryck,
Laurent Michel:
Model-Driven Visualizations of Constraint-Based Local Search.
CP 2007: 271-285 |
| 160 | | Laurent Michel,
Andrew See,
Pascal Van Hentenryck:
Parallelizing Constraint Programs Transparently.
CP 2007: 514-528 |
| 159 | | Russell Bent,
Pascal Van Hentenryck:
Waiting and Relocation Strategies in Online Stochastic Vehicle Routing.
IJCAI 2007: 1816-1821 |
| 158 | | Luc Mercier,
Pascal Van Hentenryck:
Performance Analysis of Online Anticipatory Algorithms for Large Multistage Stochastic Integer Programs.
IJCAI 2007: 1979-1984 |
| 157 | | Iván Dotú,
Pascal Van Hentenryck:
Scheduling social tournaments locally.
AI Commun. 20(3): 151-162 (2007) |
| 156 | | Carlos Cotta,
Iván Dotú,
Antonio J. Fernández,
Pascal Van Hentenryck:
Local Search-based Hybrid Algorithms for Finding Golomb Rulers.
Constraints 12(3): 263-291 (2007) |
| 155 | | Luc Mercier,
Pascal Van Hentenryck:
Strong polynomiality of resource constraint propagation.
Discrete Optimization 4(3-4): 288-314 (2007) |
| 2006 |
|---|
| 154 | | Pascal Van Hentenryck:
Practical Aspects of Declarative Languages, 8th International Symposium, PADL 2006, Charleston, SC, USA, January 9-10, 2006, Proceedings
Springer 2006 |
| 153 | | Carmen Gervet,
Pascal Van Hentenryck:
Length-Lex Ordering for Set CSPs.
AAAI 2006 |
| 152 | | Laurent Michel,
Andrew See,
Pascal Van Hentenryck:
Distributed Constraint-Based Local Search.
CP 2006: 344-358 |
| 151 | | Laurent Michel,
Andrew See,
Pascal Van Hentenryck:
High-Level Nondeterministic Abstractions in.
CP 2006: 359-374 |
| 150 | | Pascal Van Hentenryck,
Laurent Michel:
Differentiable Invariants.
CP 2006: 604-619 |
| 149 | | Iván Dotú,
Pascal Van Hentenryck:
A Note on Low Autocorrelation Binary Sequences.
CP 2006: 685-689 |
| 148 | | Pierre Flener,
Justin Pearson,
Meinolf Sellmann,
Pascal Van Hentenryck:
Static and Dynamic Structural Symmetry Breaking.
CP 2006: 695-699 |
| 147 | | Pascal Van Hentenryck,
Russell Bent,
Yannis Vergados:
Online Stochastic Reservation Systems.
CPAIOR 2006: 212-227 |
| 146 | | Pascal Van Hentenryck,
Yannis Vergados:
Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling.
CPAIOR 2006: 228-243 |
| 145 | | Carlos Cotta,
Iván Dotú,
Antonio J. Fernández,
Pascal Van Hentenryck:
Scheduling Social Golfers with Memetic Evolutionary Programming.
Hybrid Metaheuristics 2006: 150-161 |
| 144 | | Carlos Cotta,
Iván Dotú,
Antonio J. Fernández,
Pascal Van Hentenryck:
A Memetic Approach to Golomb Rulers.
PPSN 2006: 252-261 |
| 143 | | Russell Bent,
Pascal Van Hentenryck:
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows.
Computers & OR 33: 875-893 (2006) |
| 142 | | Pascal Van Hentenryck,
Laurent Michel:
Nondeterministic Control for Hybrid Search.
Constraints 11(4): 353-373 (2006) |
| 141 | | Aris Anagnostopoulos,
Laurent Michel,
Pascal Van Hentenryck,
Yannis Vergados:
A simulated annealing approach to the traveling tournament problem.
J. Scheduling 9(2): 177-193 (2006) |
| 2005 |
|---|
| 140 | | Russell Bent,
Irit Katriel,
Pascal Van Hentenryck:
Sub-optimality Approximations.
CP 2005: 122-136 |
| 139 | | Irit Katriel,
Pascal Van Hentenryck:
Maintaining Longest Paths in Cyclic Graphs.
CP 2005: 358-372 |
| 138 | | Laurent Michel,
Pascal Van Hentenryck:
Parallel Local Search in Comet.
CP 2005: 430-444 |
| 137 | | Iván Dotú,
Alvaro del Val,
Pascal Van Hentenryck:
Scheduling Social Tournaments.
CP 2005: 845 |
| 136 | | Laurent Michel,
Pascal Van Hentenryck:
The Comet Programming Language and System.
CP 2005: 881-881 |
| 135 | | Iván Dotú,
Pascal Van Hentenryck:
Scheduling Social Golfers Locally.
CPAIOR 2005: 155-167 |
| 134 | | Pascal Van Hentenryck,
Laurent Michel:
Nondeterministic Control for Hybrid Search.
CPAIOR 2005: 380-395 |
| 133 | | Iván Dotú,
Pascal Van Hentenryck:
A simple hybrid evolutionary algorithm for finding Golomb rulers.
Congress on Evolutionary Computation 2005: 2018-2023 |
| 132 | | Russell Bent,
Pascal Van Hentenryck:
Online Stochastic Optimization Without Distributions.
ICAPS 2005: 171-180 |
| 131 | | Pascal Van Hentenryck,
Yannis Vergados:
Minimizing Breaks in Sport Scheduling with Local Search.
ICAPS 2005: 22-29 |
| 130 | | Meinolf Sellmann,
Pascal Van Hentenryck:
Structural Symmetry Breaking.
IJCAI 2005: 298-303 |
| 129 | | Pascal Van Hentenryck,
Pierre Flener,
Justin Pearson,
Magnus Ågren:
Compositional Derivation of Symmetries for Constraint Satisfaction.
SARA 2005: 234-247 |
| 128 | | Pascal Van Hentenryck:
Introduction to the Special Issue on Principles and Practice of Constraint Programming.
Constraints 10(1): 5-5 (2005) |
| 127 | | Pascal Van Hentenryck,
Laurent Michel:
Control Abstractions for Local Search.
Constraints 10(2): 137-157 (2005) |
| 126 | | Irit Katriel,
Laurent Michel,
Pascal Van Hentenryck:
Maintaining Longest Paths Incrementally.
Constraints 10(2): 159-183 (2005) |
| 125 | | Pascal Van Hentenryck,
Laurent Michel,
Liyuan Liu:
Contraint-Based Combinators for Local Search.
Constraints 10(4): 363-384 (2005) |
| 124 | | Laurent Michel,
Pascal Van Hentenryck:
A Modeling Layer for Constraint-Programming Libraries.
INFORMS Journal on Computing 17(4): 389-401 (2005) |
| 123 | | Glencora Borradaile,
Pascal Van Hentenryck:
Safe and tight linear estimators for global optimization.
Math. Program. 102(3): 495-517 (2005) |
| 2004 |
|---|
| 122 | | Russell Bent,
Pascal Van Hentenryck:
Regrets Only! Online Stochastic Optimization under Time Constraints.
AAAI 2004: 501-506 |
| 121 | | Colin Blundell,
Kathi Fisler,
Shriram Krishnamurthi,
Pascal Van Hentenryck:
Parameterized Interfaces for Open System Verification of Product Lines.
ASE 2004: 258-267 |
| 120 | | Russell Bent,
Pascal Van Hentenryck:
Online Stochastic and Robust Optimization.
ASIAN 2004: 286-300 |
| 119 | | Pascal Van Hentenryck,
Laurent Michel,
Liyuan Liu:
Constraint-Based Combinators for Local Search.
CP 2004: 47-61 |
| 118 | | Pascal Van Hentenryck,
Laurent Michel:
Scheduling Abstractions for Local Search.
CPAIOR 2004: 319-334 |
| 117 | | Laurent Michel,
Pascal Van Hentenryck:
Iterative Relaxations for Iterative Flattening in Cumulative Scheduling.
ICAPS 2004: 200-208 |
| 116 | | Russell Bent,
Pascal Van Hentenryck:
The Value of Consensus in Online Stochastic Scheduling.
ICAPS 2004: 219-226 |
| 115 | | Laurent Michel,
Pascal Van Hentenryck:
A decomposition-based implementation of search strategies.
ACM Trans. Comput. Log. 5(2): 351-383 (2004) |
| 114 | | Laurent Michel,
Pascal Van Hentenryck:
A simple tabu search for warehouse location.
European Journal of Operational Research 157(3): 576-591 (2004) |
| 113 | | Aris Anagnostopoulos,
Russell Bent,
Eli Upfal,
Pascal Van Hentenryck:
A simple and deterministic competitive algorithm for online facility location.
Inf. Comput. 194(2): 175-202 (2004) |
| 112 | | Ionut D. Aron,
Pascal Van Hentenryck:
On the complexity of the robust spanning tree problem with interval data.
Oper. Res. Lett. 32(1): 36-40 (2004) |
| 111 | | Russell Bent,
Pascal Van Hentenryck:
Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers.
Operations Research 52(6): 977-987 (2004) |
| 110 | | Russell Bent,
Pascal Van Hentenryck:
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows.
Transportation Science 38(4): 515-530 (2004) |
| 2003 |
|---|
| 109 | | Russell Bent,
Pascal Van Hentenryck:
A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows.
CP 2003: 123-137 |
| 108 | | Laurent Michel,
Pascal Van Hentenryck:
Maintaining Longest Paths Incrementally.
CP 2003: 540-554 |
| 107 | | Pascal Van Hentenryck,
Laurent Michel:
Control Abstractions for Local Search.
CP 2003: 65-80 |
| 106 | | Christian Bessière,
Pascal Van Hentenryck:
To Be or Not to Be ... a Global Constraint.
CP 2003: 789-794 |
| 105 | | Aris Anagnostopoulos,
Laurent Michel,
Pascal Van Hentenryck,
Yannis Vergados:
A Simulated Annealing Approach to the Travelling Tournament Problem.
IJCAI 2003: 1357-1358 |
| 104 | | Russell Bent,
Pascal Van Hentenryck:
Dynamic Vehicle Routing with Stochastic Requests.
IJCAI 2003: 1362-1363 |
| 103 | | Pascal Van Hentenryck,
Pierre Flener,
Justin Pearson,
Magnus Ågren:
Tractable Symmetry Breaking for CSPs with Interchangeable Values.
IJCAI 2003: 277-284 |
| 102 | | Laurent Michel,
Pascal Van Hentenryck:
Comet in Context.
PCK50 2003: 95-107 |
| 2002 |
|---|
| 101 | | Pascal Van Hentenryck:
Principles and Practice of Constraint Programming - CP 2002, 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings
Springer 2002 |
| 100 | | Pascal Van Hentenryck:
Du filtrage optimal à la stabilité parfaite.
JFPLC 2002: 11- |
| 99 | | Laurent Michel,
Pascal Van Hentenryck:
A constraint-based architecture for local search.
OOPSLA 2002: 83-100 |
| 98 | | Ionut D. Aron,
Pascal Van Hentenryck:
A Constraint Satisfaction Approach to the Robust Spanning Tree Problem with Interval Data.
UAI 2002: 18-25 |
| 97 | | Yves Deville,
Micha Janssen,
Pascal Van Hentenryck:
Consistency Techniques in Ordinary Differential Equations.
Constraints 7(3-4): 289-315 (2002) |
| 96 | | Pascal Van Hentenryck:
Constraint and Integer Programming in OPL.
INFORMS Journal on Computing 14(4): 345-372 (2002) |
| 95 | | Baudouin Le Charlier,
Sabina Rossi,
Pascal Van Hentenryck:
Sequence-based abstract interpretation of Prolog.
TPLP 2(1): 25-84 (2002) |
| 94 | | Pascal Van Hentenryck:
Editorial - SAS'97.
Theor. Comput. Sci. 277(1-2): 1-2 (2002) |
| 2001 |
|---|
| 93 | | Micha Janssen,
Pascal Van Hentenryck,
Yves Deville:
Optimal Pruning in Parametric Differential Equations.
CP 2001: 539-553 |
| 92 | | Micha Janssen,
Pascal Van Hentenryck,
Yves Deville:
A Constraint Satisfaction Approach to Parametric Differential Equations.
IJCAI 2001: 297-302 |
| 91 | | Frédéric Benhamou,
Pascal Van Hentenryck:
In honor of Alain Colmerauer's 60th birthday.
TPLP 1(6): 633-635 (2001) |
| 2000 |
|---|
| 90 | | Pascal Van Hentenryck,
Laurent Perron,
Jean-Francois Puget:
Search and strategies in OPL.
ACM Trans. Comput. Log. 1(2): 285-320 (2000) |
| 89 | | Baudouin Le Charlier,
Sabina Rossi,
Pascal Van Hentenryck:
Sequence-Based Abstract Interpretation of Prolog
CoRR cs.LO/0010028: (2000) |
| 88 | | Laurent Michel,
Pascal Van Hentenryck:
Localizer.
Constraints 5(1/2): 43-84 (2000) |
| 87 | | Viswanath Ramachandran,
Pascal Van Hentenryck,
Agostino Cortesi:
Abstract Domains for Reordering CLP(RLin) Programs.
J. Log. Program. 42(3): 217-256 (2000) |
| 86 | | Agostino Cortesi,
Baudouin Le Charlier,
Pascal Van Hentenryck:
Combinations of abstract domains for logic programming: open product and generic pattern construction.
Sci. Comput. Program. 38(1-3): 27-71 (2000) |
| 1999 |
|---|
| 85 | | Micha Janssen,
Yves Deville,
Pascal Van Hentenryck:
Multistep Filtering Operators for Ordinary Differential Equations.
CP 1999: 246-260 |
| 84 | | Pascal Van Hentenryck,
Laurent Michel,
Philippe Laborie,
Wim Nuijten,
Jerome Rogerie:
Combinatorial Optimization in OPL Studio.
EPIA 1999: 1-15 |
| 83 | | Pascal Van Hentenryck:
Localizer: A Modeling Language for Local Search.
JFPLC 1999: 143-144 |
| 82 | | Pascal Van Hentenryck,
Laurent Michel:
OPL Script: Composing and Controlling Models.
New Trends in Constraints 1999: 75-90 |
| 81 | | Pascal Van Hentenryck,
Laurent Michel,
Laurent Perron,
Jean-Charles Régin:
Constraint Programming in OPL.
PPDP 1999: 98-116 |
| 80 | | Yves Deville,
Olivier Barette,
Pascal Van Hentenryck:
Constraint Satisfaction over Connected Row Convex Constraints.
Artif. Intell. 109(1-2): 243-271 (1999) |
| 79 | | Evelina Lamma,
Paola Mello,
Cesare Stefanelli,
Pascal Van Hentenryck:
Exploiting Type Analysis for Unification in a Distributed Environment.
Computers and Artificial Intelligence 18(5): (1999) |
| 78 | | Laurent D. Michel,
Pascal Van Hentenryck:
Localizer: A Modeling Language for Local Search.
INFORMS Journal on Computing 11(1): 1-14 (1999) |
| 1998 |
|---|
| 77 | | Yves Deville,
Micha Janssen,
Pascal Van Hentenryck:
Consistency Techniques in Ordinary Differential Equations.
CP 1998: 162-176 |
| 76 | | Pascal Van Hentenryck:
A Gentle Introduction to NUMERICA.
Artif. Intell. 103(1-2): 209-235 (1998) |
| 75 | | Isabel F. Cruz,
Kim Marriott,
Pascal Van Hentenryck:
Introduction to the Special Issue.
Constraints 3(1): 5-7 (1998) |
| 74 | | Pascal Van Hentenryck,
Vijay A. Saraswat,
Yves Deville:
Design, Implementation, and Evaluation of the Constraint Language cc(FD).
J. Log. Program. 37(1-3): 139-164 (1998) |
| 73 | | Pascal Van Hentenryck,
Laurent Michel,
Frédéric Benhamou:
Newton - Constraint Programming over Nonlinear Constraints.
Sci. Comput. Program. 30(1-2): 83-118 (1998) |
| 1997 |
|---|
| 72 | | Pascal Van Hentenryck:
Static Analysis, 4th International Symposium, SAS '97, Paris, France, September 8-10, 1997, Proceedings
Springer 1997 |
| 71 | | Pascal Van Hentenryck:
A Modeling Language for Constraint Programming.
CP 1997: 1 |
| 70 | | Laurent Michel,
Pascal Van Hentenryck:
Localizer: A Modeling Language for Local Search.
CP 1997: 237-251 |
| 69 | | Evelina Lamma,
Paola Mello,
Cesare Stefanelli,
Pascal Van Hentenryck:
Improving Distributed Unification through Type Analysis.
Euro-Par 1997: 1181-1190 |
| 68 | | Pascal Van Hentenryck:
Numerica: A Modeling Language for Global Optimization.
IJCAI 1997: 1642-1650 |
| 67 | | Yves Deville,
Olivier Barette,
Pascal Van Hentenryck:
Constraint Satisfaction over Connected Row Convex Constraints.
IJCAI (1) 1997: 405-411 |
| 66 | | Vijay A. Saraswat,
Pascal Van Hentenryck:
Introduction to the Special Issue.
Constraints 2(1): 5-6 (1997) |
| 65 | | Pascal Van Hentenryck,
Vijay A. Saraswat:
Constraint Programming: Strategic Directions.
Constraints 2(1): 7-33 (1997) |
| 64 | | Pascal Van Hentenryck:
Constraint Programming for Combinatorial Search Problems.
Constraints 2(1): 99-101 (1997) |
| 63 | | Frédéric Benhamou,
Pascal Van Hentenryck:
Introduction to the Special Issue on Interval Constraints.
Constraints 2(2): 107-112 (1997) |
| 62 | | Laurent Michel,
Pascal Van Hentenryck:
Helios: A Modeling Language for Global Optimization and its Implementation in Newton.
Theor. Comput. Sci. 173(1): 3-48 (1997) |
| 1996 |
|---|
| 61 | | Evelina Lamma,
Paola Mello,
Cesare Stefanelli,
Pascal Van Hentenryck:
Comsumption-based Distributed Unification.
APPIA-GULP-PRODE 1996: 207-218 |
| 60 | | Philippe Refalo,
Pascal Van Hentenryck:
CLP(Rlin) Revised.
JICSLP 1996: 22-36 |
| 59 | | Pascal Van Hentenryck,
Vijay A. Saraswat:
Strategic Directions in Constraint Programming.
ACM Comput. Surv. 28(4): 701-726 (1996) |
| 58 | | Pascal Van Hentenryck:
Constraint Programming for Combinatorial Search Problems.
ACM Comput. Surv. 28(4es): 76 (1996) |
| 57 | | Jean-Louis Imbert,
Pascal Van Hentenryck:
Redundancy Elimination with a Lexicographic Solved Form.
Ann. Math. Artif. Intell. 17(1-2): 85-106 (1996) |
| 56 | | Pascal Van Hentenryck:
In Memoriam: Paris C. Kanellakis.
J. Log. Program. 27(1): 1-3 (1996) |
| 1995 |
|---|
| 55 | | Pascal Van Hentenryck:
Constraint Solving for Combinatorial Search Problems: A Tutorial.
CP 1995: 564-587 |
| 54 | | Baudouin Le Charlier,
Pascal Van Hentenryck:
A generic fixpoint semantics for PROLOG and its application for abstract interpretation.
JFPLC 1995: 113-125 |
| 53 | | Manuvir Das,
Thomas W. Reps,
Pascal Van Hentenryck:
Semantic Foundations of Binding Time Analysis for Imperative Programs.
PEPM 1995: 100-110 |
| 52 | | Viswanath Ramachandran,
Pascal Van Hentenryck:
LSign Reordered
SAS 1995: 330-347 |
| 51 | | Pascal Van Hentenryck,
Viswanath Ramachandran:
Backtracking without Trailing in CLP(R-lin)
ACM Trans. Program. Lang. Syst. 17(4): 635-671 (1995) |
| 50 | | Baudouin Le Charlier,
Pascal Van Hentenryck:
Reexecution in Abstract Interpretation of Prolog
Acta Inf. 32(3): 209-270 (1995) |
| 49 | | Pascal Van Hentenryck,
Agostino Cortesi,
Baudouin Le Charlier:
Type Analysis of Prolog Using Type Graphs.
J. Log. Program. 22(3): 179-209 (1995) |
| 48 | | Pascal Van Hentenryck,
Agostino Cortesi,
Baudouin Le Charlier:
Evaluation of the Domain Prop.
J. Log. Program. 23(3): 237-278 (1995) |
| 1994 |
|---|
| 47 | | Pascal Van Hentenryck,
Vijay A. Saraswat,
Yves Deville:
Design, Implementation, and Evaluation of the Constraint Language cc(FD)
Constraint Programming 1994: 293-316 |
| 46 | | Baudouin Le Charlier,
Sabina Rossi,
Pascal Van Hentenryck:
An Abstract Interpretation Framework for (almost) Full Prolog.
GULP-PRODE (1) 1994: 92-106 |
| 45 | | Pascal Van Hentenryck,
Agostino Cortesi,
Baudouin Le Charlier:
Type Analysis of Prolog Using Type Graphs.
PLDI 1994: 337-348 |
| 44 | | Pascal Van Hentenryck,
Viswanath Ramachandran:
Backtracking without Trailing in CLP(R-lin).
PLDI 1994: 349-360 |
| 43 | | Agostino Cortesi,
Baudouin Le Charlier,
Pascal Van Hentenryck:
Combinations of Abstract Domains for Logic Programming.
POPL 1994: 227-239 |
| 42 | | Frédéric Benhamou,
David A. McAllester,
Pascal Van Hentenryck:
CLP(Intervals) Revisited.
SLP 1994: 124-138 |
| 41 | | Baudouin Le Charlier,
Sabina Rossi,
Pascal Van Hentenryck:
An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut.
SLP 1994: 157-171 |
| 40 | | C. Braem,
Baudouin Le Charlier,
S. Modart,
Pascal Van Hentenryck:
Cardinality Analysis of Prolog.
SLP 1994: 457-471 |
| 39 | | Baudouin Le Charlier,
Pascal Van Hentenryck:
Experimental Evaluation of a Generic Abstract Interpretation Algorithm for PROLOG.
ACM Trans. Program. Lang. Syst. 16(1): 35-101 (1994) |
| 1993 |
|---|
| 38 | | Viswanath Ramachandran,
Pascal Van Hentenryck:
Incremental Algorithms for Constraint Solving and Entailment over Rational Trees.
FSTTCS 1993: 205-217 |
| 37 | | Pascal Van Hentenryck:
Constraint Programming Languages.
ICTAI 1993: 10 |
| 36 | | Baudouin Le Charlier,
Pascal Van Hentenryck:
Groundness Analysis for PROLOG: Implementation and Evaluation of the Domain Prop.
PEPM 1993: 99-110 |
| 35 | | Pascal Van Hentenryck,
Olivier Degimbe,
Baudouin Le Charlier,
Laurent Michel:
The Impact of Granularity in Abstract Interpretation of Prolog.
WSA 1993: 1-14 |
| 34 | | Baudouin Le Charlier,
Olivier Degimbe,
Laurent Michel,
Pascal Van Hentenryck:
Optimization Techniques for General Purpose Fixpoint Algorithms - Practical Efficiency for the Abstract Interpretation of Prolog.
WSA 1993: 15-26 |
| 33 | | Vincent Englebert,
Baudouin Le Charlier,
Didier Roland,
Pascal Van Hentenryck:
Generic Abstract Interpretation Algorithms for Prolog: Two Optimization Techniques and their Experimental Evaluation.
Softw., Pract. Exper. 23(4): 419-459 (1993) |
| 1992 |
|---|
| 32 | | Baudouin Le Charlier,
Pascal Van Hentenryck:
Experimental evaluation of a generic abstract interpretation algorithm for Prolog.
ICCL 1992: 137-146 |
| 31 | | Baudouin Le Charlier,
Pascal Van Hentenryck:
Reexecution in Abstract Interpretation of Prolog.
JICSLP 1992: 750-764 |
| 30 | | Vincent Englebert,
Baudouin Le Charlier,
Didier Roland,
Pascal Van Hentenryck:
Generic Abstract Interpretation Algorithms For Prolog: Tow Optimization Techniques and Their Experimental Evaluation.
PLILP 1992: 310-325 |
| 29 | | Baudouin Le Charlier,
Pascal Van Hentenryck:
On the Design of Generic Abstract Interpretation Frameworks.
WSA 1992: 229-246 |
| 28 | | Pascal Van Hentenryck,
Thomas Graf:
Standard Forms for Rational Linear Arithmetic in Constraint Logic Programming.
Ann. Math. Artif. Intell. 5(2-4): 303-319 (1992) |
| 27 | | Pascal Van Hentenryck,
Yves Deville,
Choh-Man Teng:
A Generic Arc-Consistency Algorithm and its Specializations.
Artif. Intell. 57(2-3): 291-321 (1992) |
| 26 | | Pascal Van Hentenryck,
Helmut Simonis,
Mehmet Dincbas:
Constraint Satisfaction Using Constraint Logic Programming.
Artif. Intell. 58(1-3): 113-159 (1992) |
| 1991 |
|---|
| 25 | | Baudouin Le Charlier,
Kaninda Musumbu,
Pascal Van Hentenryck:
A Generic Abstract Interpretation Algorithm and its Complexity Analysis.
ICLP 1991: 64-78 |
| 24 | | Pascal Van Hentenryck,
Yves Deville:
The Cardinality Operator: A New Logical Connective for Constraint Logic Programming.
ICLP 1991: 745-759 |
| 23 | | Yves Deville,
Pascal Van Hentenryck:
An Efficient Arc Consistency Algorithm for a Class of CSP Problems.
IJCAI 1991: 325-330 |
| 22 | | Jean-Louis Imbert,
Pascal Van Hentenryck:
A propos des redondances dans les systèmes d'inéquations linéaires.
JTASPEFT/WSA 1991: 210-216 |
| 21 | | Pascal Van Hentenryck,
Yves Deville:
Operational Semantics of Constraint Logic Programming over Finite Domains.
PLILP 1991: 395-406 |
| 20 | | Pascal Van Hentenryck,
Yves Deville:
The Cardinality Operator: A New Logical Connective for Constraint Logic Programming.
WCLP 1991: 283-403 |
| 19 | | Jean-Louis Imbert,
Pascal Van Hentenryck:
On the Handling of Disequations in CLP over Linear Rational Arithmetic.
WCLP 1991: 49-71 |
| 18 | | Pascal Van Hentenryck,
Thierry Le Provost:
Incremental Search in Constraint Logic Programming.
New Generation Comput. 9(3/4): 257-276 (1991) |
| 1990 |
|---|
| 17 | | Yves Deville,
Pascal Van Hentenryck:
Construction of CLP Programs.
ALPUK 1990: 112-135 |
| 16 | | Pascal Van Hentenryck:
Incremental Constraint Satisfaction in Logic Programming.
ICLP 1990: 189-202 |
| 15 | | Pascal Van Hentenryck:
Constraint Logic Programming: From Theory to Applications.
NACLP 1990: 841 |
| 14 | | Mehmet Dincbas,
Helmut Simonis,
Pascal Van Hentenryck:
Solving Large Combinatorial Problems in Logic Programming.
J. Log. Program. 8(1): 75-93 (1990) |
| 1989 |
|---|
| 13 | | Pascal Van Hentenryck:
Parallel Constraint Satisfaction in Logic Programming: Preliminary Results of CHIP within PEPSys.
ICLP 1989: 165-180 |
| 12 | | Thomas Graf,
Pascal Van Hentenryck,
Claudine Pradelles,
Laurent Zimmer:
Simulation of Hybrid Circuits in Constraint Logic Programming.
IJCAI 1989: 72-77 |
| 1988 |
|---|
| 11 | | Pascal Van Hentenryck,
Jean-Philippe Carillon:
Generality versus Specificity: An Experience with AI and OR Techniques.
AAAI 1988: 660-664 |
| 10 | | Mehmet Dincbas,
Pascal Van Hentenryck,
Helmut Simonis,
Abderrahmane Aggoun,
Alexander Herold:
The CHIP System: Constraint Handling In Prolog.
CADE 1988: 774-775 |
| 9 | | Mehmet Dincbas,
Helmut Simonis,
Pascal Van Hentenryck:
Solving the Car-Sequencing Problem in Constraint Logic Programming.
ECAI 1988: 290-295 |
| 8 | | Mehmet Dincbas,
Pascal Van Hentenryck,
Helmut Simonis,
Abderrahmane Aggoun,
Thomas Graf,
Françoise Berthier:
The Constraint Logic Programming Language CHIP.
FGCS 1988: 693-702 |
| 7 | | Mehmet Dincbas,
Helmut Simonis,
Pascal Van Hentenryck:
Solving a Cutting-Stock Problem in Constraint Logic Programming.
ICLP/SLP 1988: 42-58 |
| 6 | | Mehmet Dincbas,
Pascal Van Hentenryck,
Helmut Simonis,
Abderrahmane Aggoun,
Thomas Graf:
Applications of CHIP to Industrial and Engineering Problems.
IEA/AIE (Vol. 2) 1988: 885-892 |
| 1987 |
|---|
| 5 | | Pascal Van Hentenryck,
Mehmet Dincbas:
Forward Checking in Logic Programming.
ICLP 1987: 229-256 |
| 4 | | Pascal Van Hentenryck:
A Theoretical Framework for Consistency Techniques in Logic Programming.
IJCAI 1987: 2-8 |
| 3 | | Mehmet Dincbas,
Pascal Van Hentenryck:
Extended Unification Algorithms for the Integration of Functional Programming into Logic Programming.
J. Log. Program. 4(3): 199-227 (1987) |
| 1986 |
|---|
| 2 | | Pascal Van Hentenryck,
Mehmet Dincbas:
Domains in Logic Programming.
AAAI 1986: 759-765 |
| 1 | | Mehmet Dincbas,
Pascal Van Hentenryck:
Algorithmes d'unification étendue pour l'intégration des langages fonctionnels et logiques.
SPLT 1986: 203-232 |
