%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:15 +0100 GMT
%    
% Selection : Author: Martin_Henz
%




@InProceedings{Henz:1996,
      AUTHOR = {Henz, Martin},
      TITLE = {Don't Be Puzzled!},
      YEAR = {1996},
      BOOKTITLE = {Workshop on Constraint Programming Applications: An Inventory and Taxonomy. In conjunction with the 2nd International Conference on Principles and Practice of Constraint Programming (CP '96), August 19},
      ADDRESS = {Cambridge, Massachusetts, USA},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/puzzle96.ps.gz},
      ABSTRACT = {This paper is about how to solve a class of puzzles, called self-referential quizzes (	extitsrq), with constraint programming. An 	extitsrq is a sequence of multiple choice questions that are about the puzzle itself. 	extitsrqs are an attractive pastime, when they provide the possibility of drawing non-trivial conclusions on the way to the solution. We introduce a typical 	extitsrq, and represent it as a propositional satisfiability problem. Its straightforward clausal representation is too big for effective treatment using standard methods. Instead, we solve it with finite domain constraint programming. For this application of constraint programming, support of logic connectives such as conjunction and disjunction is crucial. With their small problem descriptions, 	extitsrqs are ideal candidates for benchmarks covering the implementation of 0/1 variables in constraint programming languages.},
      ANNOTE = {COLIURL : Henz:1996:DP.pdf Henz:1996:DP.ps}
}

@PhdThesis{Henz:1997,
      AUTHOR = {Henz, Martin},
      TITLE = {Objects in Oz},
      YEAR = {1997},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Fachbereich Informatik},
      ABSTRACT = {The programming language Oz integrates the paradigms of imperative, functional and concurrent constraint programming in a computational framework of unprecedented breadth, featuring stateful programming through cells, lexically scoped higher-order programming, and explicit concurrency synchronized by logic variables. Object-oriented programming is another paradigm that provides a set of concepts useful in software practice. In this thesis we address the question how object-oriented programming can be suitably supported in Oz. As a lexically scoped higher-order language, Oz can express a wide range of object-oriented concepts. We present a simple yet expressive object system, demonstrate its usability and outline an efficient implementation. A central aspect of Oz is its support for concurrent computation. We examine the impact of concurrency on the design of an object system and explore the use of objects in concurrent programming.}
}

@Book{Henz:1997_1,
      AUTHOR = {Henz, Martin},
      TITLE = {Objects for Concurrent Constraint Programming},
      YEAR = {1997},
      VOLUME = {426},
      SERIES = {The Kluwer International Series in Engineering and Computer Science},
      ADDRESS = {Boston},
      PUBLISHER = {Kluwer Acdemic Publishers},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Diss-Henz.ps.gz},
      ANNOTE = {COLIURL : Henz:1997:OCC.pdf Henz:1997:OCC.ps}
}

@Misc{Henz:1998,
      AUTHOR = {Henz, Martin},
      TITLE = {Scheduling a Major College Basketball Conference - Revisited},
      YEAR = {1998},
      ABSTRACT = {Nemhauser and Trick presented the problem of finding a timetable for the 1997/98 Atlantic Coast Conference (ACC) in basketball. Their solution, found with a combination of integer programming and exhaustive enumeration, was accepted by the ACC. Finite-domain constraint programming is another programming technique that can be used for solving combinatorial search problems such as sport timetabling. This paper presents a solution of round robin tournament planning based on finite-domain constraint programming. The approach yields a dramatic performance improvement, which makes an integrated interactive software solution feasible.}
}

@InProceedings{Henz_et_al:1996,
      AUTHOR = {Henz, Martin and Lauer, Stefan and Zimmermann, Detlev},
      TITLE = {COMPOzE - Intention-Based Music Composition through Constraint Programming},
      YEAR = {1996},
      BOOKTITLE = {8th IEEE International Conference on Tools with Artificial Intelligence (ICTAI '96), November 16-19},
      PAGES = {118-121},
      EDITOR = {Society, IEEE Computer},
      ADDRESS = {Toulouse, France},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/COMPOzE96.ps.gz},
      ABSTRACT = {The goal of this work is to derive four-voice music pieces from given musical plans, which describe the harmonic flow and the intentions of a desired composition. We developed the experimentation platform COMPOzE for intention-based composition. COMPOzE is based on constraint programming over finite domains of integers. We argue that constraint programming provides a suitable technology for this task and that the libraries and tools available for the constraint programming system Oz effectively support the implementation of COMPOzE. This work links the research areas of of automatic music composition on one hand and finite domain constraint programming on the other, and contributes the tool COMPOzE, which practically demonstrates the potential of constraint programming to open up new areas of application for automatic music composition.},
      ANNOTE = {COLIURL : Henz:1996:CIB.pdf Henz:1996:CIB.ps}
}

@InProceedings{Henz_Müller:2000,
      AUTHOR = {Henz, Martin and Müller, Tobias},
      TITLE = {An Overview of Finite Domain Constraint Programming},
      YEAR = {2000},
      BOOKTITLE = {5th Conference of the Association of Asia-Pacific Operations Research Societies (APORS '00), July 5-7},
      ADDRESS = {Singapore, Republic of Singapore},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/amai2000.ps.gz},
      ABSTRACT = {In recent years, the repertoire of available techniques for solving combinatorial problems has seen a significant addition: constraint programming. Constraint programming is best seen as a framework for combining software components to achieve problem-specific solvers. The strength of constraint programming depends on the synergy that can be achieved between these components. In this tutorial introduction, we give an overview of constraint programming for solving combinatorial problems.},
      ANNOTE = {COLIURL : Henz:2000:OFD.pdf Henz:2000:OFD.ps}
}

@InProceedings{Henz_et_al:1999,
      AUTHOR = {Henz, Martin and Müller, Tobias and Boon Ng, Ka},
      TITLE = {Figaro: Yet another Constraint Programming Library},
      YEAR = {1999},
      BOOKTITLE = {Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, December 1},
      ADDRESS = {Las Cruces, New Mexico, USA},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/figaro-parimplws99.ps.gz},
      ABSTRACT = {Existing libraries and languages for finite domain constraint programming usually have depth-first search (with branch and bound) built-in as the only search algorithm. Exceptions are the languages CLAIRE and Oz, which support the programming of different search algorithms through special purpose programming language constructs. The goal of this work is to make abstractions for programming search algorithms available in a language-independent setting by using the concept of a room. Figaro is an experimentation platform being designed to study non-standard search algorithms, different memory policies for search (trailing vs copying), consistency algorithms, failure handling and support for modeling. Figaro is conceived as a C++ library providing abstractions based on the concept of a room. This paper focuses on the use and implementation of such abstractions for investigating programmable search algorithms and memory policies in a C++ constraint programming library.},
      ANNOTE = {COLIURL : Henz:1999:FYA.ps}
}

@Article{Henz_Würtz:1996,
      AUTHOR = {Henz, Martin and Würtz, Jörg},
      TITLE = {Constraint-Based Time Tabling - A Case Study},
      YEAR = {1996},
      JOURNAL = {Applied Artificial Intelligence},
      VOLUME = {10},
      NUMBER = {5},
      PAGES = {439-453},
      ABSTRACT = {In this paper, we concentrate on a typical scheduling problem: the computation of a time table for a German college. Like many other scheduling problems, this problem contains a variety of complex constraints and necessitates special-purpose search strategies. Techniques from Operations Research and traditional constraint logic programming are not able to express these constraints and search strategies on a sufficiently high level of abstraction. We show that the higher-order concurrent constraint language Oz provides this high-level expressivity, and can serve as a useful programming tool for college time tabling.}
}

@InProceedings{Ng_et_al:2000,
      AUTHOR = {Ng, Ka Boon and Choi, Chiu Wo and Henz, Martin and Müller, Tobias},
      TITLE = {GIFT: A Generic Interface for Reusing Filtering Algorithms},
      YEAR = {2000},
      BOOKTITLE = {Workshop on Techniques for Implementing Constraint Programming Systems (TRICS), September},
      PAGES = {86-100},
      EDITOR = {Beldiceanu, N. and Harvey, W. and Henz, Martin and Laburthe, F. and Monfroy, E. and Müller, Tobias and Perron, L. and Schulte, Christian},
      ADDRESS = {Singapore},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/KaboonChoiHenzMueller00a.ps.gz},
      ABSTRACT = {Many different constraint programming (CP) systems exist today. For each CP system, there are many different filtering algorithms. Researchers and developers usually choose a CP system of their choice to implement their filtering algorithms. To use these filtering algorithms on another system, we have to port the code over. This situation is clearly not desirable. In this paper, we propose a generic C++ interface for writing filtering algorithms called GIFT (Generic Interface for FilTers). By providing the generic interface on different CP systems, we can reuse any filtering algorithms easily. A case study on reusing scheduling filtering algorithms between Mozart and Figaro further highlights the feasibility of this approach.},
      ANNOTE = {COLIURL : Ng:2000:GGI.pdf Ng:2000:GGI.ps}
}

@InProceedings{Ng_et_al:2000,
      AUTHOR = {Ng, Ka Boon and Choi, Chiu Wo and Henz, Martin and Müller, Tobias},
      TITLE = {GIFT: A Generic Interface for Reusing Filtering Algorithms},
      YEAR = {2000},
      BOOKTITLE = {Workshop on Techniques for Implementing Constraint Programming Systems (TRICS), September},
      PAGES = {86-100},
      EDITOR = {Beldiceanu, N. and Harvey, W. and Henz, Martin and Laburthe, F. and Monfroy, E. and Müller, Tobias and Perron, L. and Schulte, Christian},
      ADDRESS = {Singapore},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/KaboonChoiHenzMueller00a.ps.gz},
      ABSTRACT = {Many different constraint programming (CP) systems exist today. For each CP system, there are many different filtering algorithms. Researchers and developers usually choose a CP system of their choice to implement their filtering algorithms. To use these filtering algorithms on another system, we have to port the code over. This situation is clearly not desirable. In this paper, we propose a generic C++ interface for writing filtering algorithms called GIFT (Generic Interface for FilTers). By providing the generic interface on different CP systems, we can reuse any filtering algorithms easily. A case study on reusing scheduling filtering algorithms between Mozart and Figaro further highlights the feasibility of this approach.},
      ANNOTE = {COLIURL : Ng:2000:GGI.pdf Ng:2000:GGI.ps}
}