#### Filter Results:

- Full text PDF available (283)

#### Publication Year

1986

2017

- This year (12)
- Last 5 years (101)
- Last 10 years (184)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Pascal Van Hentenryck
- Logic programming
- 1989

- Pascal Van Hentenryck, Yves Deville, Choh-Man Teng
- Artif. Intell.
- 1992

Consistency techniques have been studied extensively in the past as a way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been proposed, originating from Waltz's ltering algorithm [27] and culminating in the optimal algorithm AC-4 of Mohr and Henderson [16]. AC-4 runs in O(ed) in the worst case,… (More)

The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive constraints as in CLP(BNR), complex constraints are manipulated as a whole, enabling more sophisticated narrowing procedures to be applied in the solver. This idea is embodied in a… (More)

- Pascal Van Hentenryck
- IJCAI
- 1997

Many science and engineering applications require the user to find solutions to systems of nonlinear constraints over real numbers or to optimize a nonlinear function subject to nonlinear constraints. This includes applications such the modeling of chemical engineering processes and of electrical circuits, robot kinematics, chemical equil ibrium problems,… (More)

This paper presents Newton, a branch & prune algorithm to nd all isolated solutions of a system of polynomial constraints. Newton can be characterized as a global search method which uses intervals for numerical correctness and for pruning the search space early. The pruning in Newton consists in enforcing at each node of the search tree a unique local… (More)

- Aris Anagnostopoulos, Laurent D. Michel, Pascal Van Hentenryck, Yannis Vergados
- J. Scheduling
- 2006

Automating the scheduling of sport leagues has received considerable attention in recent years, as these applications involve significant revenues and generate challenging combinatorial optimization problems. This paper considers the traveling tournament problem (TTP) which abstracts the salient features of major league baseball (MLB) in the United States.… (More)

Type analysis of Prolog is of primary importance for high-performance compilers, since type information may lead to better indexing and to sophisticated specializations of unification and built-in predicates to name a few. However, these optimizations often require a sophisticated type inference system capable of inferring disjunctive and recursive types… (More)