(Enter summary)
Abstract: it Constraintpropagierung und Heuristiken
zur Variablen- und Wertauswahl kombiniert. Dieses Verfahren basiert auf dem
Constraintloser von Sicstus Prolog. Die Variablenauswahl hat das erst kurzlich vorgeschlagene
Prinzip e(n) zur Grundlage, das dynamisch in eines derjenigen Teilprobleme
verzweigt, fur die eine maximale Anzahl von Losungen erwartet wird. Die Wertauswahl
basiert auf der nur selten verwendeten Heuristik prom, die dynamisch in eines
derjenigen Teilprobleme verzweigt, die die Anzahl... (Update)
Context of citations to this paper: More
.... On the other hand, there is evidence that maintaining arc consistency is necessary to solve the larger and the harder problems eciently [24, 85, 71]. Whether the performance of our solver is sucient to solve a whole university timetabling problem depends on the structure of...
Cited by: More
Rule-Based Constraint Programming: Theory and Practice - Abdennadher (2001)
(Correct)
Active bibliography (related documents): More All
0.2: Representing School Timetabling in a Disjunctive - Logic Programming Language
(Correct)
0.2: Representing School Timetabling in a Disjunctive Logic.. - Faber, Leone, Pfeifer (1998)
(Correct)
0.0: University Timetabling using Constraint Logic Programming - Goltz, Matzke (1999)
(Correct)
Similar documents based on text: More All
0.6: An Implementation of the Programming Language DML in Java: Runtime .. - Simon (2000)
(Correct)
0.6: An Implementation of the Programming Language DML in Java: Compiler - Walter (1999)
(Correct)
0.6: Formal Specification of a Voice Communication System used in Air.. - Hörl (1999)
(Correct)
BibTeX entry: (Update)
M. Marte. Constraint-based grammar school timetabling { A case study. Diplomarbeit, Lehr- und Forschungseinheit fur Programmierund Modellierungssprachen, Institut fur Informatik, Ludwig-MaximiliansUniversit at Munchen, 1998. http://citeseer.ist.psu.edu/marte98constraintbased.html More
@misc{ marte98constraintbased,
author = "M. Marte",
title = "Constraint-based grammar school timetabling { A case study",
text = "M. Marte. Constraint-based grammar school timetabling { A case study. Diplomarbeit,
Lehr- und Forschungseinheit fur Programmierund Modellierungssprachen, Institut
fur Informatik, Ludwig-MaximiliansUniversit at Munchen, 1998.",
year = "1998",
url = "citeseer.ist.psu.edu/marte98constraintbased.html" }
Citations (may not include all citations):
96
Lisp and Symbolic Computation (context) - Borning, Freeman-Benson et al. - 1992
74
Constraint solving over semirings
- Bistarelli, Montanari et al. - 1995 DBLP
61
Extending CHIP in order to solve complex scheduling and plac.. (context) - Aggoun, Beldiceanu - 1992
54
An open-ended finite domain constraint solver
- Carlsson, Ottosson et al. - 1997 ACM DBLP
34
Mac and combined heuristics: Two reasons to forsake fc
- Bessiere, Regin - 1996
28
Cumulative scheduling with task intervals
- Caseau, Laburthe - 1996 DBLP
18
Structuring graphical paradigms in TkGofer
- Claessen, Vullinghs et al. - 1997 ACM DBLP
17
Constraint logic programming for examination timetabling (context) - Boizumault, Delon et al. - 1996
4
Constraintbasierte Stundenplanung fur Universitaten (context) - Abdennadher, Marte - 1998
Documents on the same site (http://www.pms.informatik.uni-muenchen.de/publikationen/index.html): More
A Deduction Method Complete for Refutation and Finite.. - Bry, Torge (1998)
(Correct)
A Confluence Test for Concurrent Constraint Programs - Abdennadher, Frühwirth.. (1995)
(Correct)
Problem Solving with Model-Generation Approaches based on.. - Eisinger, Geisler (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC