#### Filter Results:

- Full text PDF available (79)

#### Publication Year

1992

2017

- This year (2)
- Last 5 years (47)
- Last 10 years (92)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Lucas Bordeaux, Eric Monfroy
- CP
- 2002

The generalization of the satisfiability problem with arbitrary quantifiers is a challenging problem of both theoretical and practical relevance. Being PSPACE-complete, it provides a canonical model for solving other PSPACE tasks which naturally arise in AI. Effective SAT-based solvers have been designed very recently for the special case of boolean… (More)

- Eric Monfroy, Nacer Boudjlida, +4 authors Mark Wallace
- 1996

- Thom W. Frühwirth, Alexander Herold, +4 authors Mark Wallace
- Logic Programming Summer School
- 1992

Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativity of logic programming with the e ciency of constraint solving. New application areas, amongst them many di erent classes of combinatorial search problems such as scheduling, planning or resource allocation can now be solved, which were intractable for logic… (More)

- Krzysztof R. Apt, Eric Monfroy
- CP
- 1999

We study here constraint satisfaction problems that are based on predefined, explicitly given finite constraints. To solve them we propose a notion of rule consistency that can be expressed in terms of rules derived from the explicit representation of the initial constraints. This notion of local consistency is weaker than arc consistency for constraints of… (More)

- B. Crawford, M. Aranda, C. Castro, E. Monfroy
- 2008 Third International Conference on…
- 2008

In constraint programming, enumeration strategies are crucial for resolution performances. In this work, we model the known NP-complete problems Latin Square, Magic Square and Sudoku as a constraint satisfaction problems. We solve them with constraint programming comparing the performance of different variable and value selection heuristics in its… (More)

- Krzysztof R. Apt, Eric Monfroy
- TPLP
- 2001

We study here a natural situation when constraint programming can be entirely reduced to rule-based programming. To this end we explain first how one can compute on constraint satisfaction problems using rules represented by simple first-order formulas. Then we consider constraint satisfaction problems that are based on predefined, explicitly given… (More)

- Carlos Castro, Eric Monfroy, Christian Figueroa, Rafael Meneses
- MICAI
- 2005

- Lucas Bordeaux, Eric Monfroy, Frédéric Benhamou
- IJCAI
- 2001

kB-consistencies form the class of strong consistencies used in interval constraint programming. We survey, prove, and give theoretical motivations to some technical improvements to a naive kBconsistency algorithm. Our contribution is twofold: on the one hand, we introduce an optimal 3Bconsistency algorithm whose time-complexity of O(mdn) improves the known… (More)

- Christophe Ringeissen, Eric Monfroy
- New Trends in Constraints
- 1999

Set covering problem is the model for many important industrial applications. In this paper, we solve some benchmarks of this problem with ant colony optimization algorithms using a new transition rule. A look-ahead mechanism was incorporated to check constraint consistency in ant computing. Computational results are presented showing the advantages to use… (More)