✦ LIBER ✦

Constraint logic programming for examination timetabling

✍ Scribed by P Boizumault; Y Delon; L Peridy

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 978 KB
Volume: 26
Category: Article
ISSN: 0743-1066
DOI: 10.1016/0743-1066(95)00100-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Temporal Annotated Constraint Logic Prog

Temporal Annotated Constraint Logic Programming

✍ THOM FRÜHWIRTH 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 712 KB

We introduce a family of logics and associated programming languages for representing and reasoning about time. The family is conceptually simple while allowing for different models of time. Formulae can be labelled with temporal information using annotations. In this way we avoid the proliferation

ACLP: Abductive Constraint Logic Program

ACLP: Abductive Constraint Logic Programming

✍ A.C. Kakas; A. Michael; C. Mourlas 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 349 KB

This paper presents the framework of Abductive Constraint Logic Programming (ACLP), which integrates Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP). In ACLP, the task of abduction is supported and enhanced by its non-trivial integration with constraint solving. This integra

An active-constraint logic for non-linea

An active-constraint logic for non-linear programming

✍ Alok Das; Eugene M. Cliff; Henry J. Kelley 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 775 KB

Constraint logic programming: Applicatio

Constraint logic programming: Applications and implications

✍ Yousri El Fattah 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 716 KB

Experiments in reactive constraint logic

Experiments in reactive constraint logic programming

✍ Francois Fages; Julian Fowler; Thierry Sola 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 872 KB

In this paper we study a reactive extension of constraint logic programming (CLP). Our primary concerns are search problems in a dynamic environment, where interactions with the user (e.g. in interactive multi-criteria optimization problems) or interactions with the physical world (e.g. in time evol

Constraint Satisfaction in Distributed C

Constraint Satisfaction in Distributed Concurrent Logic Programming

✍ HO-FUNG LEUNG; KEITH L. CLARK 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 602 KB

In constraint logic programming, unification is replaced by more general constraint satisfaction. To support constraint solving in a committed-choice concurrent logic programming language, the constraint solver also needs to determine the status of the 'ask'-constraints with respect to the current c