Principles and Practice of Constraint

Programming 20th International Conference CP

2014 Lyon France September 8 12 2014 Proceedings
1st Edition Barry O’Sullivan (Eds.) pdf download
https://textbookfull.com/product/principles-and-practice-of-
constraint-programming-20th-international-conference-
cp-2014-lyon-france-september-8-12-2014-proceedings-1st-edition-
barry-osullivan-eds/

Download more ebook instantly today - get yours now at textbookfull.com

We believe these products will be a great fit for you. Click
the link to download now, or visit textbookfull.com
to discover even more!

Principles and Practice of Constraint Programming 22nd

International Conference CP 2016 Toulouse France
September 5 9 2016 Proceedings 1st Edition Michel
Rueher (Eds.)
https://textbookfull.com/product/principles-and-practice-of-
constraint-programming-22nd-international-conference-
cp-2016-toulouse-france-september-5-9-2016-proceedings-1st-
edition-michel-rueher-eds/

Principles and Practice of Constraint Programming 25th

International Conference CP 2019 Stamford CT USA
September 30 October 4 2019 Proceedings Thomas Schiex

https://textbookfull.com/product/principles-and-practice-of-
constraint-programming-25th-international-conference-
cp-2019-stamford-ct-usa-september-30-october-4-2019-proceedings-
thomas-schiex/

Principles and Practice of Constraint Programming 26th

International Conference CP 2020 Louvain la Neuve
Belgium September 7 11 2020 Proceedings Helmut Simonis

https://textbookfull.com/product/principles-and-practice-of-
constraint-programming-26th-international-conference-
cp-2020-louvain-la-neuve-belgium-september-7-11-2020-proceedings-
helmut-simonis/

Case Based Reasoning Research and Development 22nd

International Conference ICCBR 2014 Cork Ireland
September 29 2014 October 1 2014 Proceedings 1st
Edition Luc Lamontagne
https://textbookfull.com/product/case-based-reasoning-research-
and-development-22nd-international-conference-iccbr-2014-cork-
ireland-september-29-2014-october-1-2014-proceedings-1st-edition-
Computer Algebra in Scientific Computing 16th
International Workshop CASC 2014 Warsaw Poland
September 8 12 2014 Proceedings 1st Edition Vladimir P.
Gerdt
https://textbookfull.com/product/computer-algebra-in-scientific-
computing-16th-international-workshop-casc-2014-warsaw-poland-
september-8-12-2014-proceedings-1st-edition-vladimir-p-gerdt/

Computer Safety Reliability and Security 33rd

International Conference SAFECOMP 2014 Florence Italy
September 10 12 2014 Proceedings 1st Edition Andrea
Bondavalli
https://textbookfull.com/product/computer-safety-reliability-and-
security-33rd-international-conference-safecomp-2014-florence-
italy-september-10-12-2014-proceedings-1st-edition-andrea-
bondavalli/

Adaptive and Intelligent Systems Third International

Conference ICAIS 2014 Bournemouth UK September 8 10
2014 Proceedings 1st Edition Abdelhamid Bouchachia
(Eds.)
https://textbookfull.com/product/adaptive-and-intelligent-
systems-third-international-conference-icais-2014-bournemouth-uk-
september-8-10-2014-proceedings-1st-edition-abdelhamid-
bouchachia-eds/

System Analysis and Modeling Models and Reusability 8th

International Conference SAM 2014 Valencia Spain
September 29 30 2014 Proceedings 1st Edition Daniel
Amyot
https://textbookfull.com/product/system-analysis-and-modeling-
models-and-reusability-8th-international-conference-
sam-2014-valencia-spain-september-29-30-2014-proceedings-1st-
edition-daniel-amyot/

Formal Modeling and Analysis of Timed Systems 12th

International Conference FORMATS 2014 Florence Italy
September 8 10 2014 Proceedings 1st Edition Axel Legay

https://textbookfull.com/product/formal-modeling-and-analysis-of-
timed-systems-12th-international-conference-
formats-2014-florence-italy-september-8-10-2014-proceedings-1st-
 Barry O’Sullivan (Ed.)
LNCS 8656

Principles and Practice

of Constraint Programming
20th International Conference, CP 2014
Lyon, France, September 8–12, 2014
Proceedings

123
Lecture Notes in Computer Science 8656
Commenced Publication in 1973
Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen

Editorial Board
David Hutchison
Lancaster University, UK
Takeo Kanade
Carnegie Mellon University, Pittsburgh, PA, USA
Josef Kittler
University of Surrey, Guildford, UK
Jon M. Kleinberg
Cornell University, Ithaca, NY, USA
Alfred Kobsa
University of California, Irvine, CA, USA
Friedemann Mattern
ETH Zurich, Switzerland
John C. Mitchell
Stanford University, CA, USA
Moni Naor
Weizmann Institute of Science, Rehovot, Israel
Oscar Nierstrasz
University of Bern, Switzerland
C. Pandu Rangan
Indian Institute of Technology, Madras, India
Bernhard Steffen
TU Dortmund University, Germany
Demetri Terzopoulos
University of California, Los Angeles, CA, USA
Doug Tygar
University of California, Berkeley, CA, USA
Gerhard Weikum
Max Planck Institute for Informatics, Saarbruecken, Germany
Barry O’Sullivan (Ed.)

Principles and Practice

of Constraint Programming
20th International Conference, CP 2014
Lyon, France, September 8-12, 2014
Proceedings

13
Volume Editor
Barry O’Sullivan
Insight Centre for Data Analytics
School of Computer Science and Information Technology
University College Cork
Western Road, Cork, Ireland
E-mail: [email protected]

ISSN 0302-9743 e-ISSN 1611-3349

ISBN 978-3-319-10427-0 e-ISBN 978-3-319-10428-7
DOI 10.1007/978-3-319-10428-7
Springer Cham Heidelberg New York Dordrecht London

Library of Congress Control Number: 2014946201

LNCS Sublibrary: SL 2 – Programming and Software Engineering

© Springer International Publishing Switzerland 2014

This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of
the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology
now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection
with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and
executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication
or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location,
in ist current version, and permission for use must always be obtained from Springer. Permissions for use
may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution
under the respective Copyright Law.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
While the advice and information in this book are believed to be true and accurate at the date of publication,
neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or
omissions that may be made. The publisher makes no warranty, express or implied, with respect to the
material contained herein.
Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India
Printed on acid-free paper
Springer is part of Springer Science+Business Media (www.springer.com)
 Preface

This volume contains the proceedings of the 20th International Conference on

the Principles and Practice of Constraint Programming (CP 2014), which was
held in Lyon, France, from September 8–12, 2014. A comprehensive web-site
about the conference is available at http://cp2014.a4cp.org.
The CP conference is the premier annual international conference on con-
straint programming. It is concerned with all aspects of computing with con-
straints, including theory, algorithms, environments, languages, models, systems,
and applications such as decision making, resource allocation, scheduling, config-
uration, planning, etc. The CP community is very keen to ensure it remains open
to interdisciplinary research at the intersection between constraint programming
and related fields such as search, satisfiability, knowledge representation and rea-
soning, machine learning, multi-agent systems, and operations research.
The CP 2014 program included presentations of high-quality scientific re-
search papers and applications of constraints technology. In addition, for the
first time, the program included a journal presentation track that was designed
to provide a forum to discuss important results in the area of constraint program-
ming that appeared recently in relevant journals, but had not been previously
presented at CP, CPAIOR, or any other major AI conference.
The review process for CP 2014 relied on a multi-tier approach involving
a senior Program Committee, dedicated regular Program Committees for both
the main technical and application tracks, along with a set of additional review-
ers recruited by Program Committee members. Authors chose to submit either
long or short papers to either the main technical track or the application track.
Alternatively, authors submitting to the journal presentation track submitted
abstracts for review by a dedicated committee. All submissions to the technical
track were assigned to a member of the senior Program Committee and three
members of the Program Committee. All submissions to the application track
were assigned to the chair of that track and three members of its Program Com-
mittee, which was the same approach adopted for the journal presentation track.
Authors were given an opportunity to respond to reviews before a detailed dis-
cussion was undertaken at the level of the Program Committees, overseen by
the Program Chair, the senior Program Committee member or track chair, as
appropriate.
A meeting of the senior Program Committee was held at University College
Cork at the end of May, chaired by the Program Chair, where the reviews,
author feedback, and discussions on every paper were discussed in detail. The
principle under which these discussions took place was that all papers deemed
to be of sufficient quality were accepted into the program. The result of this was
that the acceptance rate for the technical track was a little over 50% while the
application track accepted 66% of papers. Abstracts submitted to the journal
VI Preface

presentation track that satisfied the requirements for that track were accepted.
Overall, the quality of submissions to the conference was very high, and the
final program, as evidenced by these proceedings, was excellent. We selected a
set of prize-winning papers, which are presented later in the front matter of
the proceedings, including a best technical track paper, a best application track
paper, a best student paper, and a runner-up best student paper.
The conference included four invited talks from distinguished scientists: Maria
Fox, Patrick Prosser, Louis-Martin Rousseau, and Vijay Saraswat. Abstracts of
these talks are included in the proceedings. We also benefitted from an excellent
program of tutorials and workshops; these are also detailed further in the front
matter of these proceedings.
Two elements of the conference program that are not reflected in the pro-
ceedings are the doctoral program and the 20th anniversary celebration. The
doctoral program provided an opportunity for PhD students to meet each other
as well as senior researchers in the field. The focus of the program was on men-
toring students and providing a forum for them to exchange ideas, get feedback
on their research, and benefit from a specially designed tutorial program. To
mark the 20th anniversary of the conference, a special celebratory session at the
conference was organized.
The task of producing an excellent scientific program for a conference like
CP 2014 is a truly international undertaking, involving a large number of people
from around the world. I would like to sincerely thank the members of the senior
Program Committee, who not only took responsibility for overseeing the review-
ing of a number of papers, but also took time out from their busy schedules to
attend a weekend meeting in Cork in May. I would like to thank the members of
the Program Committee, and the additional reviewers they recruited, for provid-
ing high-quality reviews and discussions on each and every paper submitted to
the conference. A special word of thanks goes to the authors of all submissions
to the conference.
I was very fortunate to work with a great team of people who chaired as-
pects of the conference: Mark Wallace (Application Track Chair), Justyna Petke
and Andrea Rendl (Doctoral Program Chairs), Michela Milano (Workshop and
Tutorial Chair), Francesca Rossi (Journal Track Chair), Pascal Van Hentenryck
(20th Anniversary Celebration Chair), and Pierre Schaus (Publicity Chair). A
very special thanks is deserved by Yves Deville and Christine Solnon, the Con-
ference Chairs, who managed all aspects of the local arrangements, logistics,
finances, and sponsorship. They were the very generous hosts of the conference
itself, and provided exceptional hospitality to the delegates.
I would like to thank the Association for Constraint Programming, who en-
trusted the scientific program of the conference to me. It was a huge honour
for me, as well as a career highlight. I would like to thank the many sponsors
who provided generous financial support for the conference. A complete list of
sponsors is provided later in these proceedings. Without the support of these
sponsors the conference would not have been financially viable.
 Preface VII

Finally, on a personal note, I would like to dedicate my work on this confer-

ence and this volume to the memory of my late uncle and godfather, Alan Lee
(August 17, 1942 – November 7, 2013).

September 2014 Barry O’Sullivan

 Prize-Winning Papers

Following the reviewing process and the senior Program Committee (SPC) meet-
ing, a small committee of (S)PC members was established to assist the program
chair in the selection of the best papers from the technical track of the con-
ference. The committee for best technical track paper and best student paper
comprised Nicolas Beldiceanu (TASC(CNRS/Inria), Mines Nantes), Peter Jeav-
ons (University of Oxford), and Ian Miguel (University of St. Andrews). The
best application track paper was recommended by the application track chair,
Mark Wallace (Monash University and Opturion), who worked closely with Hel-
mut Simonis (University College Cork). The best papers for CP 2014 are listed
below. A runner-up was also deemed appropriate in the case of best student
paper.

Best Technical Track Paper

On Broken Triangles
Martin Cooper, Achref El Mouelhi, Cyril Terrioux, and Bruno Zanuttini

Best Application Track Paper

Using CP in Automatic Test Generation
for ABB Robotics’ Paint Control System
Morten Mossige, Arnaud Gotlieb, and Hein Meling

Best Student Paper

On Compiling CNF into Decision-DNNF
Umut Oztok and Adnan Darwiche

Runner-Up Best Student Paper

A Complete Solver for Constraint Games
Thi-Van-Anh Nguyen and Arnaud Lallouet
 Tutorials and Workshops

A feature of the CP 2014 conference program was a set of tutorials and work-
shops. Tutorials were expected to give an in-depth presentation of emerging and
exciting topics that are relevant to a broad swath of the constraint programming
community. On the other hand, the workshops provided an informal venue where
participants were given the opportunity to present, discuss, and brainstorm on
new ideas, technical topics, exciting new application areas, and cross-fertilization
with other domains. The Workshop and Tutorial Chair for CP 2014 was Michela
Milano (University of Bologna) who, with the Program Chair, selected the fol-
lowing tutorials and workshops for inclusion in the conference program. Each
tutorial and workshop was submitted in response to an open call for proposals,
and each was subjected to peer review.

Tutorials
The Past and Future of csplib. org : Why and How to Contribute?
Christopher Jefferson
Automated Reformulation of Constraint Models in Savile Row
Peter Nightingale
Social Choice
Francesca Rossi, Kristen Brent Venable, and Toby Walsh
MiniZinc 2.0
Peter J. Stuckey and Guido Tack

Workshops
ModRef 2014 - the 13th International Workshop on Constraint Modelling and
Reformulation
Carlos Ansótegui
Constraint Programming Meets Verification 2014
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Pierre Flener, Arnaud Gotlieb,
and Justin Pearson
Constraint-Based Methods for Bioinformatics
Simon de Givry and Nicos Angelopoulos
Bridging the Gap Between Theory and Practice in Constraint Solvers
Philippe Jégou, Martin Cooper, Lakhdar Sais, and Bruno Zanuttini
Cloud Computing and Optimization
Jean-Charles Régin and Bertrand Le Cun
 Conference Organization

Conference Chairs
Yves Deville UCLouvain, Belgium
Christine Solnon LIRIS, INSA Lyon/CNRS, France

Program Chair
Barry O’Sullivan University College Cork, Ireland

Application Track Chair

Mark Wallace Monash University and Opturion, Australia

Doctoral Program Chairs

Justyna Petke University College London, UK
Andrea Rendl NICTA and Monash University, Australia

Workshop and Tutorial Chair

Michela Milano University of Bologna, Italy

Journal Track Presentation Chair

Francesca Rossi University of Padova, Italy

20th Anniversary Celebration Chair

Pascal Van Hentenryck NICTA and University of Melbourne, Australia

Publicity Chair
Pierre Schaus UCLouvain, Belgium

Senior Program Committee

J. Christopher Beck University of Toronto, Canada
Nicolas Beldiceanu TASC(CNRS/Inria), Mines Nantes, France
XIV Conference Organization

Christian Bessiere CNRS and University of Montpellier, France

Ken Brown University College Cork, Ireland
Berthe Y. Choueiry University of Nebraska-Lincoln, USA
David Cohen Royal Holloway, University of London, UK
Yves Deville UCLouvain, Belgium
Jimmy Lee The Chinese University of Hong Kong,
SAR China
Ian Miguel University of St. Andrews, UK
Michela Milano University of Bologna, Italy
Barry O’Sullivan University College Cork, Ireland (Chair)
Patrick Prosser Glasgow University, UK
Jean-Charles Régin Université de Nice-Sophia Antipolis, France
Francesca Rossi University of Padova, Italy
Christian Schulte KTH Royal Institute of Technology, Sweden
Helmut Simonis University College Cork, Ireland
Christine Solnon LIRIS, INSA Lyon/CNRS, France
Peter Stuckey NICTA and the University of Melbourne,
Australia
Mark Wallace Monash University and Opturion, Australia
Toby Walsh NICTA and UNSW, Australia

Technical Track Program Committee

Carlos Ansótegui Universitat de Lleida, Spain
Hadrien Cambazard University of Grenoble Alpes, G-SCOP, France
Hubie Chen Universidad del Paı́s Vasco and Ikerbasque,
Spain
Geoffrey Chu NICTA VRL, University of Melbourne,
Australia
Remi Coletta CNRS and University of Montpellier, France
Martin Cooper IRIT, University of Toulouse, France
Rina Dechter University of California at Irvine, USA
Boi Faltings EPFL, Switzerland
Pierre Flener Uppsala University, Sweden
Ian Gent University of St. Andrews, UK
Diarmuid Grimes University College Cork, Ireland
Emmanuel Hebrard LAAS-CNRS, France
Brahim Hnich Izmir University of Economics, Turkey
Peter Jeavons University of Oxford, UK
Philippe Jégou Université d’Aix-Marseille, LSIS, France
Peter Jonsson Linköping University, Sweden
George Katsirelos INRA, Toulouse, France
Zeynep Kiziltan University of Bologna, Italy
Javier Larrosa UPC, Spain
 Conference Organization XV

Christophe Lecoutre Université d’Artois, France

Inês Lynce INESC-ID, IST, Universidade de Lisboa,
Portugal
Felip Manya IIIA-CSIC, Spain
Radu Marinescu IBM Research, Ireland
Christopher Mears Monash University, Australia
Deepak Mehta University College Cork, Ireland
Amnon Meisels Ben-Gurion University, Israel
Pedro Meseguer IIIA-CSIC, Spain
Laurent Michel University of Connecticut, USA
Nina Narodytska University of Toronto, Canada
Alexandre Papadopoulos Université Pierre et Marie Curie (Paris 6),
France
Justin Pearson Uppsala University, Sweden
Gilles Pesant Ecole Polytechnique de Montreal, Canada
Justyna Petke University College London, UK
Luis Quesada University College Cork, Ireland
Claude-Guy Quimper Université Laval, Canada
Andrea Rendl NICTA, Australia
Michel Rueher University of Nice Sophia Antipolis, France
Lakhdar Sais Université d’Artois, France
Pierre Schaus UCLouvain, Belgium
Thomas Schiex INRA Toulouse, France
Kostas Stergiou University of Western Macedonia, Greece
Guido Tack NICTA, Monash University, Australia
Johan Thapper Université Paris-Est, Marne-la-Vallée, France
Michael Trick Carnegie Mellon University, USA
Willem-Jan van Hoeve Carnegie Mellon University, USA
Gerard Verfaillie ONERA, France
Roland Yap National University of Singapore, Singapore
Yuanlin Zhang Texas Tech University, USA
Roie Zivan Ben-Gurion University of the Negev, Israel
Stanislav Zivny University of Oxford, UK

Application Track Program Committee

Theirry Benoist Innovation 24, France
Lucas Bordeaux Microsoft Research, UK
Mats Carlsson SICS, Sweden
Håkan Kjellerstrand Malmo, Sweden
Laurent Perron Google, France
Siddhartha SenGupta Tata Consultancy Services, India
Paul Shaw IBM, France
Helmut Simonis University College Cork, Ireland
XVI Conference Organization

Willem-Jan Van Hoeve Carnegie Mellon University, USA

Mark Wallace Monash University and Opturion, Australia
(Chair)

Journal Presentation Track Program Committee

Christian Bessiere CNRS and University of Montpellier, France
Jimmy Lee The Chinese University of Hong Kong,
SAR China
Patrick Prosser Glasgow University, UK
Francesca Rossi University of Padova, Italy (Chair)
Helmut Simonis University College Cork, Ireland
K. Brent Venable Tulane University, USA
Toby Walsh NICTA and UNSW, Australia

Additional Reviewers
Arbelaez, Alejandro Mairy, Jean-Baptiste
Beyersdorff, Olaf Marques-Silva, Joao
Bistarelli, Stefano Martins, Ruben
Bova, Simone Mauro, Jacopo
Carbonnel, Clément Mengel, Stefan
Cire, Andre Michel, Claude
Davies, Jessica Monette, Jean-Noël
Di Gaspero, Luca Nattaf, Margaux
Duck, Gregory Neveu, Bertrand
Fontaine, Daniel Nightingale, Peter
Gabàs, Joel Okamoto, Steven
Gao, Yong Paparrizou, Anastasia
Gavanelli, Marco Prestwich, Steve
Gay, Steven Pérez, Jorge A.
Grinshpoun, Tal Rollon, Emma
Gutierrez, Julian Roy, Pierre
Gutierrez, Patricia Saint-Guillain, Michael
Hartert, Renaud Schutt, Andreas
Jabbour, Said Siala, Mohamed
Janota, Mikoláš Slivovsky, Friedrich
Kell, Brian Tabary, Sebastien
Leo, Kevin Terrioux, Cyril
Lhomme, Olivier Tjandraatmadja, Christian
Li, Chu-Min Van Gelder, Allen
Li, Wei Vismara, Philippe
Likitvivatanavong, Chavalit Wahbi, Mohamed
Lombardi, Michele Zytnicki, Matthias
 Conference Organization XVII

Sponsors
CP 2014 is very grateful to the following sponsors for their generous support of
the conference.

AIMMS
Artificial Intelligence Journal (Elsevier)
Association for Constraint Programming (ACP)
Association Française pour la Programmation par Contraintes (AFPC)
Cadence
Centre National de la Recherche Scientifique (CNRS), France
Faculté des Sciences et Technologies, Université Lyon 1, France
Graduate School in Computing Science, Belgium (Grascomp)
ICTEAM/UCLouvain, Belgium
INSA Lyon, France
Laboratoire d’Informatique en Image et Systèmes d’information (LIRIS), France
Quintiq
 The Association for Constraint Programming

The Association for Constraint Programming (ACP) aims to promote constraint

programming in every aspect of the scientific world, by encouraging its theoreti-
cal and practical development, its teaching in academic institutions, its adoption
in the industrial world, and its use in applications. The ACP is a non-profit asso-
ciation that uses the funds raised from its events to support activities for the CP
community. Further information about the ACP, its activities, and membership,
is available from its website at http://www.a4cp.org

Executive Committee
The current Executive Committee, which was formed on January 1, 2013, has
the following membership:

Officers
President – Helmut Simonis (elected 2011)
Treasurer – Thomas Schiex (elected 2011)
Secretary – Willem-Jan van Hoeve (elected 2013)
Conference Coordinator – Pierre Flener (elected 2013)

Other Members
Yves Deville (elected 2011)
Guido Tack (elected 2013)
Roland Yap (elected 2011)

Ex-Officio Members
Past President – Barry O’Sullivan
 Table of Contents

Invited Talks
A Modular Architecture for Hybrid Planning with Theories . . . . . . . . . . . 1
Maria Fox

Teaching Constraint Programming . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3

Patrick Prosser

One Problem, Two Structures, Six Solvers, and Ten Years of Personnel
Scheduling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
Louis-Martin Rousseau

Concurrent Constraint Programming Research Programmes – Redux . . . 6

Vijay Saraswat

Best Technical Track Paper

On Broken Triangles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux,
and Bruno Zanuttini

Best Application Track Paper

Using CP in Automatic Test Generation for ABB Robotics’ Paint
Control System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
Morten Mossige, Arnaud Gotlieb, and Hein Meling

Best Student Paper

On Compiling CNF into Decision-DNNF . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
Umut Oztok and Adnan Darwiche

Runner-Up Best Student Paper

A Complete Solver for Constraint Games . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
Thi-Van-Anh Nguyen and Arnaud Lallouet

Technical Track
Encoding Linear Constraints into SAT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
Ignasi Abı́o and Peter J. Stuckey
XXII Table of Contents

Efficient Application of Max-SAT Resolution on Inconsistent Subsets . . . 92

André Abramé and Djamal Habet

Sequential Time Splitting and Bounds Communication for a Portfolio

of Optimization Solvers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 108
Roberto Amadini and Peter J. Stuckey

Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism

Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125
Gilles Audemard, Christophe Lecoutre, Mouny Samy-Modeliar,
Gilles Goncalves, and Daniel Porumbel

Linking Prefixes and Suffixes for Constraints Encoded Using Automata

with Accumulators . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 142
Nicolas Beldiceanu, Mats Carlsson, Pierre Flener,
Marı́a Andreı́na Francisco Rodrı́guez, and Justin Pearson

The Propagation Depth of Local Consistency . . . . . . . . . . . . . . . . . . . . . . . . 158

Christoph Berkholz

The Balance Constraint Family . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 174

Christian Bessiere, Emmanuel Hebrard, George Katsirelos,
Zeynep Kiziltan, Émilie Picard-Cantin, Claude-Guy Quimper,
and Toby Walsh

Experimental Comparison of BTD and Intelligent Backtracking:

Towards an Automatic Per-instance Algorithm Selector . . . . . . . . . . . . . . . 190
Loı̈c Blet, Samba Ndojh Ndiaye, and Christine Solnon

Solving Intensional Weighted CSPs by Incremental Optimization with

BDDs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 207
Miquel Bofill, Miquel Palahı́, Josep Suy, and Mateu Villaret

On Backdoors to Tractable Constraint Languages . . . . . . . . . . . . . . . . . . . . 224

Clément Carbonnel, Martin C. Cooper, and Emmanuel Hebrard

Nested Constraint Programs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 240

Geoffrey Chu and Peter J. Stuckey

Beyond Consistency and Substitutability . . . . . . . . . . . . . . . . . . . . . . . . . . . . 256

Martin C. Cooper

Subexponential Time Complexity of CSP with Global Constraints . . . . . 272

Ronald de Haan, Iyad Kanj, and Stefan Szeider

A New Characterization of Relevant Intervals for Energetic

Reasoning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 289
Alban Derrien and Thierry Petit
 Table of Contents XXIII

A Declarative Paradigm for Robust Cumulative Scheduling . . . . . . . . . . . . 298

Alban Derrien, Thierry Petit, and Stéphane Zampelli

Improving DPOP with Branch Consistency for Solving Distributed

Constraint Optimization Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 307
Ferdinando Fioretto, Tiep Le, William Yeoh, Enrico Pontelli,
and Tran Cao Son

Constraint-Based Lagrangian Relaxation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 324

Daniel Fontaine, Laurent Michel, and Pascal Van Hentenryck

Loop Untangling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 340

Kathryn Francis and Peter J. Stuckey

Discriminating Instance Generation for Automated Constraint Model

Selection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 356
Ian P. Gent, Bilal Syed Hussain, Christopher Jefferson,
Lars Kotthoff, Ian Miguel, Glenna F. Nightingale, and
Peter Nightingale

Aggregating CP-nets with Unfeasible Outcomes . . . . . . . . . . . . . . . . . . . . . . 366

Umberto Grandi, Hang Luo, Nicolas Maudet, and Francesca Rossi

The StockingCost Constraint . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 382

Vinasétan Ratheil Houndji, Pierre Schaus, Laurence Wolsey,
and Yves Deville

Scalable Parallel Numerical CSP Solver . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 398

Daisuke Ishii, Kazuki Yoshizoe, and Toyotaro Suzumura

Tree-Decompositions with Connected Clusters for Solving Constraint

Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 407
Philippe Jégou and Cyril Terrioux

CIP and MIQP Models for the Load Balancing Nurse-to-Patient

Assignment Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 424
Wen-Yang Ku, Thiago Pinheiro, and J. Christopher Beck

On the Erdős Discrepancy Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 440

Ronan Le Bras, Carla P. Gomes, and Bart Selman

Towards Practical Infinite Stream Constraint Programming:

Applications and Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 449
Jasper C.H. Lee and Jimmy H.M. Lee

An Increasing-Nogoods Global Constraint for Symmetry Breaking

During Search . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 465
Jimmy H.M. Lee and Zichen Zhu
XXIV Table of Contents

Memory-Efficient Tree Size Prediction for Depth-First Search

in Graphical Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 481
Levi H.S. Lelis, Lars Otten, and Rina Dechter

Higher-Order Consistencies through GAC on Factor Variables . . . . . . . . . 497

Chavalit Likitvivatanavong, Wei Xia, and Roland H.C. Yap

Incremental QBF Solving . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 514

Florian Lonsing and Uwe Egly

Incremental Cardinality Constraints for MaxSAT . . . . . . . . . . . . . . . . . . . . 531

Ruben Martins, Saurabh Joshi, Vasco Manquinho, and Inês Lynce

Reducing the Branching in a Branch and Bound Algorithm for the

Maximum Clique Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 549
Ciaran McCreesh and Patrick Prosser

Core-Guided MaxSAT with Soft Cardinality Constraints . . . . . . . . . . . . . . 564

Antonio Morgado, Carmine Dodaro, and Joao Marques-Silva

The IntSat Method for Integer Linear Programming . . . . . . . . . . . . . . . . . . 574

Robert Nieuwenhuis

Automatically Improving Constraint Models in Savile Row through

Associative-Commutative Common Subexpression Elimination . . . . . . . . . 590
Peter Nightingale, Özgür Akgün, Ian P. Gent,
Christopher Jefferson, and Ian Miguel

Improving GAC-4 for Table and MDD Constraints . . . . . . . . . . . . . . . . . . . 606

Guillaume Perez and Jean-Charles Régin

Improvement of the Embarrassingly Parallel Search for Data Centers . . . 622

Jean-Charles Régin, Mohamed Rezgui, and Arnaud Malapert

Stochastic MiniZinc . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 636

Andrea Rendl, Guido Tack, and Peter J. Stuckey

Decomposing Utility Functions in Bounded Max-Sum for Distributed

Constraint Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 646
Emma Rollon and Javier Larrosa

Insights into Parallelism with Intensive Knowledge Sharing . . . . . . . . . . . . 655

Ashish Sabharwal and Horst Samulowitz

The Non-overlapping Constraint between Objects Described by

Non-linear Inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 672
Ignacio Salas, Gilles Chabert, and Alexandre Goldsztejn
 Table of Contents XXV

Improving Relational Consistency Algorithms Using Dynamic Relation

Partitioning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 688
Anthony Schneider, Robert J. Woodward, Berthe Y. Choueiry,
and Christian Bessiere

Domain Views for Constraint Programming . . . . . . . . . . . . . . . . . . . . . . . . . 705

Pascal Van Hentenryck and Laurent Michel

Global Constraints in Distributed CSP:

Concurrent GAC and Explanations in ABT . . . . . . . . . . . . . . . . . . . . . . . . . 721
Mohamed Wahbi and Kenneth N. Brown

The Impact of Wireless Communication on Distributed Constraint

Satisfaction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 738
Mohamed Wahbi and Kenneth N. Brown

Adaptive Parameterized Consistency for Non-binary CSPs by Counting

Supports . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 755
Robert J. Woodward, Anthony Schneider, Berthe Y. Choueiry,
and Christian Bessiere

Application Track
Proactive Workload Dispatching on the EURORA Supercomputer . . . . . 765
Andrea Bartolini, Andrea Borghesi, Thomas Bridi,
Michele Lombardi, and Michela Milano

Scheduling B2B Meetings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 781

Miquel Bofill, Joan Espasa, Marc Garcia, Miquel Palahı́,
Josep Suy, and Mateu Villaret

Solving a Judge Assignment Problem Using Conjunctions of Global

Cost Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 797
Simon de Givry, Jimmy H.M. Lee, Ka Lun Leung, and Yu Wai Shum

Worst-Case Scheduling of Software Tasks:

A Constraint Optimization Model to Support Performance
Testing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 813
Stefano Di Alesio, Shiva Nejati, Lionel Briand, and Arnaud Gotlieb

Continuous Casting Scheduling with Constraint Programming . . . . . . . . . 831

Steven Gay, Pierre Schaus, and Vivian De Smedt

Case Study: Constraint Programming in a System Level Synthesis

Framework . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 846
Shuo Li and Ahmed Hemani
XXVI Table of Contents

Scheduling Agents Using Forecast Call Arrivals at Hydro-Québec’s Call

Centers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 862
Marie Pelleau, Louis-Martin Rousseau, Pierre L’Ecuyer,
Walid Zegal, and Louis Delorme

Deployment of Mobile Wireless Sensor Networks for Crisis Management:

A Constraint-Based Local Search Approach . . . . . . . . . . . . . . . . . . . . . . . . . 870
Cédric Pralet and Charles Lesire

Air Traffic Controller Shift Scheduling by Reduction to CSP, SAT and

SAT-Related Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 886
Mirko Stojadinović

Journal Presentation Track

Optimization Bounds from Binary Decision Diagrams
(Extended Abstract) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 903
David Bergman, Andre A. Ciré, Willem-Jan van Hoeve,
and John N. Hooker

Reformulation Based MaxSAT Robustness (Extended Abstract) . . . . . . . 908

Miquel Bofill, Dı́dac Busquets, and Mateu Villaret

Probabilistic Constraints for Nonlinear Inverse Problems

(Extended Abstract) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 913
Elsa Carvalho, Jorge Cruz, and Pedro Barahona

Multivalued Decision Diagrams for Sequencing Problems

(Extended Abstract) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 918
Andre A. Ciré and Willem-Jan van Hoeve

Robustness and Stability in Constraint Programming under Dynamism

and Uncertainty (Extended Abstract) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 923
Laura Climent, Richard J. Wallace, Miguel A. Salido,
and Federico Barber

Monotone Temporal Planning: Tractability, Extensions and

Applications (Extended Abstract) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 928
Martin C. Cooper, Frédéric Maris, and Pierre Régnier

Anytime AND/OR Depth-First Search for Combinatorial Optimization

(Extended Abstract) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 933
Lars Otten and Rina Dechter

View-Based Propagator Derivation (Extended Abstract) . . . . . . . . . . . . . . 938

Christian Schulte and Guido Tack

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 943

 A Modular Architecture for Hybrid Planning
with Theories

Maria Fox

Dept. Informatics, King’s College London, UK

[email protected]

Planning technology has made huge strides, alongside other combinatorial optimisation
solving technologies, over the past decade. Automated planning systems now exist for
temporal and metric problems, including management of continuous time and concur-
rency, continuous numeric resources and action costs [3,1,2,12,7,8,11,9]. There is an
increasing interest in combining planners with specialised solvers, such as optimisation
alogorithms, to achieve a hybrid form of planning. In this context, the relationship be-
tween planning and model-checking, planning and constraint-solving and planning and
control are all being clarified.
Synergies between different optimisation modelling and solving paradigms can be
exploited to achieve new capabilities and improved performance of solvers. An exam-
ple of this is recent work exploiting the developments in SAT solving, SAT Modulo
Theories, in which atoms can be built from predicates, functions and constants whose
interpretations are provided through external theory modules [10,5]. In planning, ex-
tension to support external modules allows a much richer expression of preconditions
and state variables. A motivation for exploring this idea is that the increased expressive-
ness can allow planners to work with models of application domains using specialised
solvers, necessary for reasoning within those applications, alongside the generic solv-
ing cores developed in the planning community. Since this is a common requirement of
planning applications, it is important to provide clean and well-understood methods for
linking planners to external libraries, choosing heuristics and exchanging constraints.
In this talk we present the Planning Modulo Theories paradigm, first proposed in
2012 [6], describing how the paradigm has been extended to incorporate the latest
advances in temporal planning. We discuss how the use of constraint reasoning can
provide an additional source of powerful solving capabilities within this framework.
In general, constraint solvers prune choices from the search space by inference, while
most modern planners focus on heuristic guidance of the search towards good choices.
Complex interactions in resource-constrained models can be obscure, making heuristic
evaluation of states much more difficult, while at the same time offering more oppor-
tunity for leverage from inference [13]. We consider, with reference to two real appli-
cation domains, how constraint solving can contribute to making planners suitable for
deployment in applications with demanding requirements.
One of the important challenges in extending the capabilities of planners is to con-
tinue to be able to efficiently validate plans and domain models. We will describe how


Thanks to my generous collaborators and co-authors who have contributed to this work.

B. O’Sullivan (Ed.): CP 2014, LNCS 8656, pp. 1–2, 2014.


c Springer International Publishing Switzerland 2014
2 M. Fox

the VAL system [4], developed incrementally over the last 10 years for validation of
plans and domains in the mixed discrete-continuous expressiveness of PDDL+, is now
being extended to cope with richer behaviours encountered in the PMT framework.

References
1. Coles, A., Coles, A., Fox, M., Long, D.: COLIN: Planning with continuous linear numeric
change. Journal of Art. Int. Research 44, 1–96 (2012)
2. Coles, A.I., Fox, M., Long, D., Smith, A.J.: A Hybrid Relaxed Planning Graph-LP
Heuristic for Numeric Planning Domains. In: Proc. 18th Int. Conf. on Automated Planning
and Scheduling (ICAPS) (2008)
3. Coles, A.J., Coles, A.I., Fox, M., Long, D.: Forward-Chaining Partial-Order Planning. In:
Proc. 20th Int. Conf. on Aut. Planning and Scheduling, ICAPS (2010)
4. Fox, M., Howey, R., Long, D.: Validating plans in the context of processes and exoge-
nous events. In: Veloso, M.M., Kambhampati, S. (eds.) Proc. Nat. Conf. on AI, AAAI,
pp. 1151–1156. AAAI Press / The MIT Press (2005)
5. Gao, S., Kong, S., Clarke, E.: Satisfiability Modulo ODEs. In: Proc. Formal Methods in
Computer-Aided Design, FMCAD (2013)
6. Gregory, P., Long, D., Fox, M., Beck, J.C.: Planning Modulo Theories: Extending the Plan-
ning Paradigm. In: Proc. 22nd Int. Conf. on Automated Planning and Scheduling, ICAPS
(2012)
7. Ivankovic, F., Haslum, P., Thiebaux, S., Shivashankar, V., Nau, D.: Optimal planning with
global numerical state constraints. In: Proceedings of 24th Int. Conf. on Aut. Planning and
Scheduling, ICAPS (2014)
8. Lipovetzky, N., Burt, C.N., Pearce, A.R., Stuckey, P.J.: Planning for Mining Operations with
Time and Resource Constraints. In: Proceedings of 24th Int. Conf. on Aut. Planning and
Scheduling, ICAPS (2014)
9. Löhr, J., Eyerich, P., Winkler, S., Nebel, B.: Domain Predictive Control Under Uncertain
Numerical State Information. In: Proc. 23rd Int. Conf. on Automated Planning and Schedul-
ing (ICAPS) (2013)
10. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From
an abstract Davis–Putnam–Logemann–Loveland procedure to DPLL(T). J. ACM 53(6),
937–977 (2006)
11. Ono, M., Williams, B.C., Blackmore, L.: Probabilistic Planning for Continuous Dynamic
Systems under Bounded Risk. Journal of AI Research (JAIR) 46, 511–577 (2013)
12. Penna, G.D., Intrigila, B., Magazzeni, D., Mercorio, F.: Upmurphi: a tool for universal plan-
ning on pddl+ problems. In: Proc. 19th Int. Conf. on Automated Planning and Scheduling
(ICAPS), pp. 19–23 (2009)
13. Vidal, V., Geffner, H.: Branching and pruning: An optimal temporal pocl planner based on
constraint programming. Artif. Intell. 170(3), 298–335 (2006)
 Teaching Constraint Programming

Patrick Prosser

School of Computing Science, University of Glasgow, UK

[email protected]

How do we do research? We start with a question. Then we read books, journal

and conference papers, maybe even speak to people. Then we do our own work,
make our own contribution, maybe coming up with an improved technique or a
greater insight. We then write up our findings, maybe submit this to a conference,
present our work and get feedback, and this results in further research. This is
a feedback loop, open to scrutiny by our peers.
And what about teaching? You teach yourself and become competent. You de-
cide how to teach your subject. You then teach and mark students. You analyze
students’ performance and use this to modify what you teach. You continue to
learn your subject and use this new knowledge to modify your teaching. Again,
there is a feedback loop. But it is a closed loop, in the sense that no one really
gets to critique what you do. If you are teaching Constraint Programming (CP)
it is unlikely that there are many teaching colleagues who can actually evaluate
what you are doing, other than looking at the final exam marks. So you can
wander off topic, away from the target and this can be dangerous.
I am fortunate enough to be allowed to teach CP to final year and masters
students at Glasgow University. I have been doing this for about 10 years. What
I teach and how I teach has evolved over time. I now recognize some things that
I did that were clearly wrong and some things that I did that were really good. I
know that I do not teach in a vacuum, that my students take many other courses.
So I try and identify stuff that I think a Constraint Programmer should know
that is not being taught in other courses. Consequently, my CP course contains
stuff that might be considered unusual. I also expect that there’s stuff that I
should teach but do not.
In my talk I will describe the content of my CP course (the stuff of it), some
things I have done wrong and some things that really work well. I will cover
lecture material, assessed exercises and even exam questions! In essence, I will
open my feedback loop allowing you to give me feedback on what I teach.

Acknowledgments. I would like to thank my students.

B. O’Sullivan (Ed.): CP 2014, LNCS 8656, p. 3, 2014.


c Springer International Publishing Switzerland 2014
 One Problem, Two Structures, Six Solvers,
and Ten Years of Personnel Scheduling

Louis-Martin Rousseau

CIRRELT, École Polytechnique de Montréal, Montréal,

C.P. 6128, succ. Centre-ville, Montréal, H3C 3J7,Canada
[email protected]

The shift-scheduling problem was originally introduced by Edie in 1954 [8] in

the context of scheduling highway toll booth operators. It was solved a short
time later, by Georges Dantzig [6], using a set covering formulation. However,
the Multi-Activity Shift Scheduling (MASSP) version of that problem, where
one not only needs to schedule when employees are working or resting, but more
precisely, what activity they are performing, still remains a challenge. During
this invited lecture, we will recall the turning points of this 60-year journey,
focusing particularly on the efforts of the last decade to solve MASSPs.
The first breakthrough came from Constraint Programming (CP), with the
introduction of the Regular Language Membership Constraint [13,1], which en-
abled us to specify shift regulations through Deterministic Finite Automata.
Two years later, the Context-free Grammar Constraint [15,18] was introduced,
shortly followed by both a decomposed formulation [16] and incremental filter-
ing algorithm [11]. From these constraints it is possible to identify two network
structures (paths in a layered directed acyclic graph for Regular and hyper-paths
in a hyper-graph for Grammar ).
Using these graph structures, Mixed Integer Programming (MIP) models were
initially proposed [3] to address the MASSP. Thanks to Orbital Shrinking [9],
a new MIP formulation [4], and hybrid CP-MIP branch and bound [17] were
proposed which allowed us to solve these models more efficiently.
Dynamic Programming (DP) algorithms were also developed to optimize (find
the shortest paths and hyper-paths) for both Regular and Grammar given that
marginal costs are associated with performing certain activities at a given time.
These costs can be estimated manually during a Large Neighbourhood Search
(LNS) [14] or obtained through dual values in the context of a Branch-and-Price
approach [7,5]. Finally Lazy-Clause Generation (LCG) within CP [10] has shown
to produce very good results for a subset of the benchmark originally introduced
in [7].
From a practical point of view, the concepts of [5] were implemented into
commercial software (Planora), while the models using the decomposition of
Regular were used in case studies involving a major fashion retailer [2] and
Hydro Québec’s large call center [12].

B. O’Sullivan (Ed.): CP 2014, LNCS 8656, pp. 4–5, 2014.


c Springer International Publishing Switzerland 2014
 Ten Years of Personnel Scheduling 5

References
1. Beldiceanu, N., Carlsson, M., Petit, T.: Deriving filtering algorithms from con-
straint checkers. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 107–122.
Springer, Heidelberg (2004)
2. Chapados, N., Joliveau, M., L‘Ecuyer, P., Rousseau, L.M.: Retail Store
Scheduling for Profit. European Journal of Operations Research (2014),
doi:10.1016/j.ejor.2014.05.033
3. Côté, M.C., Gendron, B., Quimper, C.G., Rousseau, L.M.: Formal languages for
integer programming modeling of shift scheduling problems. Constraints 16(1),
54–76 (2011)
4. Côté, M.C., Gendron, B., Rousseau, L.M.: Grammar-based integer programming
models for multiactivity shift scheduling. Management Science 57(1), 151–163
(2011)
5. Côté, M.C., Gendron, B., Rousseau, L.M.: Grammar-based column generation
for personalized multi-activity shift scheduling. INFORMS Journal on Comput-
ing 25(3), 461–474 (2013)
6. Dantzig, G.: A comment on Edie’s traffic delay at toll booths. Journal of the
Operations Research Society of America 2, 339–341 (1954)
7. Demassey, S., Pesant, G., Rousseau, L.M.: A cost-regular based hybrid column
generation approach. Constraints 11(4), 315–333 (2006)
8. Edie, L.: Traffic delays at toll booths. Journal of the Operations Research Society
of America 2, 107–138 (1954)
9. Fischetti, M., Liberti, L.: Orbital shrinking. In: Mahjoub, A.R., Markakis, V.,
Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol. 7422, pp. 48–58. Springer,
Heidelberg (2012)
10. Gange, G., Stuckey, P.J., Van Hentenryck, P.: Explaining Propagators for Edge-
Valued Decision Diagrams. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp.
340–355. Springer, Heidelberg (2013)
11. Kadioglu, S., Sellmann, M.: Grammar constraints. Constraints 15(1), 117–144
(2010)
12. Pelleau, M., Rousseau, L.-M., L’Ecuyer, P., Zegal, W., Delorme, L.: Scheduling of
Agents from Forecasted Future Call Arrivals at Hydro-Québec’ s Call Centers. In:
Principles and Practice of Constraint Programming, CP 2013, Springer, Heidelberg
(2014)
13. Pesant, G.: A regular language membership constraint for finite sequences of vari-
ables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482–495. Springer,
Heidelberg (2004)
14. Quimper, C.G., Rousseau, L.M.: A large neighbourhood search approach to the
multi-activity shift scheduling problem. Journal of Heuristics 16(3), 373–392 (2010)
15. Quimper, C.G., Walsh, T.: Global grammar constraints. In: Benhamou, F. (ed.)
CP 2006. LNCS, vol. 4204, pp. 751–755. Springer, Heidelberg (2006)
16. Quimper, C.G., Walsh, T.: Decomposing global grammar constraints. In: Bessière,
C. (ed.) CP 2007. LNCS, vol. 4741, pp. 590–604. Springer, Heidelberg (2007)
17. Salvagnin, D., Walsh, T.: A hybrid MIP/CP approach for multi-activity shift
scheduling. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 633–646. Springer,
Heidelberg (2012)
18. Sellmann, M.: The theory of grammar constraints. In: Benhamou, F. (ed.) CP
2006. LNCS, vol. 4204, pp. 530–544. Springer, Heidelberg (2006)
Exploring the Variety of Random
Documents with Different Content
had ceased to share personally in these ceremonies (as e.g. under
the Roman emperors who did not live in Egypt at all), the
inscriptions still sometimes speak in the old-fashioned style as
though the monarch had duly performed his part. An inscription
along the foot of the wall in Hall D states that 'His Majesty in his
proper person, with his hand on the wooden peg and holding the
line in his grasp, along with the goddess Safekh, is to be found
beside his measuring-instrument to determine the four corners of
the temple at Edfu'. This N. and S. axis divides the entire building
into a right and a left (or W. and E.) half, reckoned from Room I (p.
252), which occupies the exact centre of the rear-wall of the temple,
and is named in the inscriptions 'divider of the middle'. All the walls
and rooms to the right of this line (as we look S.) are described in
the inscrip 
 Temple. EDFU 23. Route. 249 tioTis as lying on tlio right or
\V. side, aiul all to the loft as lying on the l(Mt or E. side. The Pylon-
Portal (PI. G) forms a worthy introduction to the temple, flanked on
either side by a tower with sloping walls, abont 100 ft. high. This is
usually named "j? ^\ j \ Mahet, i.e. 'portal-building', 'entrance-hall',
in the inscriptions, a designation which is not unfrequently employed
to include the entire gatehouse and the two towers, though the
most usual term for the entire entrance- structure ^was 1 / y=Y \
Bekhen, i.e. 'tower", 'watch-tower'. This passage was formerly
closed with a massive door with two wings. The entire lofty
gatehouse is covered from top to bottom and on all sides with reliefs
and inscriptions, amongst which, especially on the right and left, the
colossal Figure of the King (Neos Dionysus) is conspicuous, smiting
his foes, whom he holds by the hair, in presence of Horus and
Hathor. In two rows, above, the king appears praying and offering
sacrifices before the gods of Edfu. — Below, on the left (W.) pylon,
the king and queen conduct a procession of representatives of the
districts that yield gold, silver, other metals, precious stones,
cosmetics, etc., and furnish them to the temple. On the front of the
pylon towers are four wide incisions, two on each side of the central
portal. These were intended to support the huge copper-mounted
wooden poles with gilded tips, which are illustrated in Vol. I., p. 168.
One of the lower marginal inscriptions states that these poles were
intended at Edfu to avert the storms of heaven, and that they were
adorned with gay flags at the top. The pitch-dark lower Pylon
Chambers on each side are entered from the court by doors to the
right and left of the portal, and from each of them an easy Staircase
of 242 steps in 14 flights ascends to the rintforms of the towers. One
of the towers should certainly be ascended, in spite of the numerous
steps. The view from the top is unusually attractive, commanding
not only the most imposing survey of the temple-buildings, biit also
ranging over the surrounding country. The plain through which the
Nile ^flows, with its verdant crops and its villages fringed with palms
and mimosas, framed by the desert-mountains in the distance,
presents a scene of surprising beauty, especially when seen under
the evening liglit that renders the Egyptian landscape so wonderfully
distinct. The Fore -Court (PI. F), which is bounded in front by the
pylons, at the bark by the hypostyle hall (PI. E), and on the right
and left by the great girdle-wall, is a spacious court, paved with
broad flags, and surrounded on its E., W., and S. sides with a
covered colonnade of 32 coluu)7is. The inscriptions call it variously
 250 Route 23. EDFU Horus^Vsekht uten or court of the
offerings, usekht khii en Sa-Hor or rourt of the appearance of the
protecting Horus, usekht en bekhen or court of the pylons, and
usekht en tesnefru Ra-Khuti or court of the sacred boat of the god of
the sun-mountain. Ptolemy X. Soter 11. is named in the marginal
inscriptions as the builder and finisher of this court, in harmony with
the great inscription on the W. girdle-wall. The lower marginal
inscription on Wall a of the court says of this king: 'He has built the
Court of the Appearance of the protecting Horus (usekht kha en Sa-
Horj, the lord of the gods, as a copy of the building of the sun-
mountain -nith the god of the sun-mountain, completed in his
building in excellent work in good sandstone; otlerings are made to
his divine image in it\ An inscription on the opposite wall (fl. b) says
of the same king, that he built the Court of UOerings (usekht utent)
'iu order to sacrifice to the sun-god thrice a day\ Detailed
information is given in the inscriptions as to the size of this fore-
court, the height and thickness of its walls, the number and shape of
the columns, and the side-doors and main-portal. The length is
repeatedly given as 90 Egyptian ells, the breadth as 80, the height
of the walls as 20, and their thickness as 5 ; measurements, which
taking the ell as 1^/4 ft. correspond tolerably closely with
measurements made on the spot (length 155 ft., breadth 138 ft.,
height of wall a4V2 ft-, thickness 81/2 ft.). The number of the
'columns, the great ones, erected in it' is correctly given as 32; their
beauty and strength is extolled; and the capitals and shafts minutely
described. The doors are also described in order, details being
sometimes given as to whether they had one or two wings, of what
wood they were made, and whether they opened inwards or
outwards. Besides the four side-doors of the court and the main
portal between the pylons, the two doors leading from the court to
the gate-towers are also described, as well as the door (PI. d) in the
N. half of the H girdle-wall and another smaller door, nearer the N.
end of the same wall, leading to the Temple-Well. The Back of this
court, forms, as has already been remarked, the front of the Temple
Proper, which differs but slightly from the temple of Denderah. Here,
as at Denderah, the first chamber is a — Hypostyle Hall (PI. E), open
in front. The roof is borne by 18 columns, while at Denderah there
are 24; and the two small chapels in front have nothing
corresponding to them at Denderah. The chapel to the left as we
enter is called '-^-' Patua, i.e. 'incense-cliamber', and was used by
the monarch, in his capacity as high-priest, when performing the
ceremonies of purifying himself on his entrance into the temple, with
holy water and incense. The small room on the right was called
cr~I3 c=^!£=i , Pa-hotep (?), ie. 'room of the written rolls' and
appears from the inscriptions to have been used to contain all the
WTitten documents referring to the temple-service : 'many boxes
with papyrus-rolls (hotepu) and great leather-rolls (aru-uru-en-
mesek)'. A very interesting Cataloyue on the walls of this room gives
the names of the books pre 
The text on this page is estimated to be only 26.45%
accurate

Temple. EDFU. 2-5. Route. 251 served here. — A Side-door

(PI. c.) in the E. -wall of the hypostyle admits to the open passage
between the temple and the girdle-wall. The Ceiling of this hall, -
which, like that at Denderah, is named Khent, 'the front room' or
Khent ur, 'the great antechamber', is completely covered with
astronomical representations. To the left are the tirst six Hours of
yight, to the right the second six (ChampoUioii, ilon. U. pp. 123
seq.). Above the duor to the following Hall D is a curious
representation. The Swi Disc appears with the hgure of a crowned
beetle ascending from the hori/.on into a boat g"ided hy Ilor mai
and Hur khent khrud. Xext the sun, on the left, is £koth, on the right
iSeitK and also Apheni (AnubisJ, Mat^ and Uaihur. lu an attitude ot
worship, at the sides, are Four Reuses; to the right the eye and ear
tie sight and hearing), to the left taste (symbolized by a tongue) and
reason At the top of this wall is a long astronomical frieze, l-irst
appear' figures of the 3(3 ^liecani\ at the end of which are the chief
constellations of the S. t^Orion and the Sothis Cow or S.nus) and of
the >.. (the buTs leg fettered by Ape), then come the Planets the
Slair m,h the Fourteen i^teps of the waxing moon, the gods
corresponding to thoise lunar days, representatives of the C^O Days
of tne Month the Gods o.r the 12 Months, and linally tliree Female
Figures with raised hands tOn the A »'all of this hall, on either side
of the door to Hall U, are scenes from the Founding of the Temple by
the king similar to those at Denderah. They are continued along the
W. wall of the hall. Next, as at Uen.lerah, follow three Prosekos
Halls, with their side-chambers, and here also the first of these, the
Hai or Festal Hall (PI. D) is much the largest. This hall is the only
one of the three that has columns, of which there are 12 arranged in
three rows, while the corresponding hall at Denderah had only 6
columns. The side-chambers, however, are more numerous
atDenderah, where there were six, three on each side, while here
there are but four, viz the Laboratory (PI. xvii) and a I'assage Room
(PL xviii) in front of it, on the W. side, and on the E. side another
tassage Room (PI. xix), in the S. wall of which is a door leading to a
Corner Room (PI. xxi). The next of the prosekos halls is the Hall of
the Altar (PI. C), with two side-chambers (PL xiv on the W. and PL
XVI on the E.J, whence we reach the two great staircases leading to
the roof of the temple. Both the structure of the staircases and their
plastic adornment closely resemble those at Denderah. From the
third and last Prosekos hall, the 'Hall of the Centre or of the 'Repoae
of the Uods (Pi. BJ, we enter on the right the two connected -Rooms
for the Offering of what is necessary (PL xii & xiii), and on the left
the 'Room of Khem (PL xij. We now reach the Sekos Booms. The
Sanrtunry (PL A) in the centre is, like the sanctuary at Denderah,
surrounded on all sides but the front by a Corridor (PL e), from
which U) Side-Chambers open (PL i-vi on the left or W., vii-x on the
right or E. side). Un the inside wall of the corridor, i.e. on the outside
of the sanctuary, are represented the gods of the districts or nomes.
— All these rooms, their size and use, their plastic decorations, the
painting , gilding , etc. are fully described in the inscriptions and in
the reliefs. t See Brugsch, MonumenU de TKgypte, plates vii-x.
 252 Route 23. EDFU. HorusTwo important and specially
instructive Inscriptions describe the various rooms in order in the
course of a summary review. Une of these forms the lower marginal
inscription on the outside of the E. girdle-wall ;t the other is on the
outside of the W. wall of the temple proper. t+ The inscriptions at
Edfu begin their account of the diflerent rooms with Room I., at the
centre of the rear-wall of the temple, which they name 'Divider of
the Jliddle' (comp. p. 248). Thence they proceed to the rooms lying
to the right and left, and then to the Adytum (PI. A) and the
Prosekos rooms in front of it. Those who desire to follow the
description in order begin at Room I. Of this e.g. it is said : 'The
apartment Mesen (No. i) is in its (the temple's) centre as the chief
apartment, with the great throne of the dispenser of rays ; the
goddess Ma is with him, as Hathor the great, in his shrine, the very
secret place, in it (i.e. the room), whose breadth is S'/s ells and its
"depth ir'^/s. Its wall is painted with the cycle of the gods of the
true Mesen-chamber, their forms according to their prototypes'. The
word Mesen means here probably dwelling of the helpers of Horus.
In the second inscription this room is also named Ha ken., 'chamber
of the victor', and it is stated that 'the figure of the protecting Horus,
in his noble shape as a perching hawk, an ell high, with the scourge
(is there to be seen). The goddess Sla is before him ; she does not
separate herself from him, who is ever united with her. As Hathor,
the great, she is with him in the shrine within the mysterious cella of
dark granite'. Room II. is named 'the right chamber' and the "west
chamber' or 'dedicated to the god of the west' (Osiris); Room III,
'the chamber of the great' (Osiris); Room IV, 'the inner-room of the
tomb-chamber'. These three are the Osiris Rooms. Room V is called
the 'room of the throne of the gods' ; Room VI, the 'cloth-chamber';
then on the E. side. Room VII, -the Sebek-chamber' of the moon-
god Khunsu; Koom Vin, the sanctuary of Hathor ; and Room IX, the
'throne-room of Ra'. Of Room X we read ; 'the Room of the Spreader
0/ Wings (No. x) contains on its E. wall the divine image of the
lionheaded goddess of the north, and of the cycle of gods, that
watch over Osiris. There is the god Shu as the representative of the
X. wind, inflating his nostrils, as is his wont in the kingdom of
eternity (i.e. the under-world), and the lion-headed goddess Tefnut,
as the representative of devouring fire, in the act of burning his
(Osiris' s) enemies, as she does it in the place that is the goal of
millions (another name for the underworld). There also are the
goddess Ment, daughter of the sun, with her backward glance, and
the great Sekhet-Artemis, the mistress of the goddesses of
vengeance'. The Adytum or Holy of Holies (PI. A) is next described:
'The room of the great throne (i.e. the adytum) in the centre, round
which the passage runs, is in ells lO-'/s + '/s by iO'/s. A door leading
into the passage is found on its right and on its left side, in order to
reach the closed rooms lying round it. The sacred boat of Tesneferu
the brightcoloured and his sacred shrine are placed there; his great
cella, of dark granite, it is a wonder to behold it'. This Cella of dark
granite, erected by King Xectanebus, stands to this day in the
adytum (p. 24(3). With reference to the Staircases the inscription
states that the E. stair was ascended on Xew Year's Day, in order to
unite the god with his soul, and that the W. stair was ascended to
oiler sacrifice in the morning. Of the D007-S in Hall D the inscription
says: 'The door upon its W. side is for the bringing of refreshing
water, and that on its E. side for the bringing of meat-offerings'. We
now betake ourselves to the passage round the temple proper (PI.
H). Special attention should be bestowed on the inscriptions and
reliefs on the inside of the W. Girdle-wall (PI. f f), representing t
Published by Dumichen and Brussch in the ^evptische Zeitschrift for
1873 and 1875. ft Published by Dumichen in his Tempelinschriften,
plates 91-94, and De Rouge, in his Edfou, <4-77.
The text on this page is estimated to be only 29.75%
accurate

Temple. EDFU. 23. Route. 253 tho contests of the god

Ilorus with his enemies who are depicted as crocodiles and
hippopotami. Perhaps the overthrow of the foes of King Ptolemy X.
Soter II. is symbolically represented in these compositions. The
cartouches on this wall probably belong to this king; one of them
contains the name of Pti/?m/.
 254 Route 2d. EL-H6SH. From Edfu the Egyptian
government. They also have a language of their own. Their domain
extends to the Red Sea. It is therefore necessary hefore beginning
this desert-expedition fl' '2 day; camel and tent necessary) to secure
the protection of the shekh of the 'Ahahdeh. — The route leads
through a sandstone region, with many small seyal-acacias. Passing
a (4 hrs.) Well and then the Tomb of a saint, we reach the (3 \i.xs.')
First Station on the desert-route, consisting of two rectangular
spaces 45-50 ft. long surrounded by walls. The Second Station, on
the route leading to the Red Sea (comp. R. 6, p. 78], is 6 hrs. farther
on. TSfear it lies the temple, heautifullv situated at the foot of an
isolated hill. The road to Ko.^er (p 771 diverges to the N., at a valley
planted with acacias. The Temple was discovered in 1816 hy
Cailliaud, on his first journey to the mines of Mt. Zabdrah, where he.
found old emerald-mines instead of the sulphur that he expected. It
is ahout 40 ft. long, and the front portion is occupied by a Vestibule,
about 22 ft. wide, with 4 columns, of which the first pair form the
entrance. The representaticms here are familiar to us from other
Egyptian temples. King Seti I. appears before Ammon-Ra, who
hands to him the sword of victory. 'He smites the princes of the
miserable Kush' (Ethiopia). Behind Ammon are 10 names of fettered
tribes. Ammon spealvs : 'Receive the sword, Oh King, lord of the
peoples, to smite down the princes of Kush and to cut oft their
heads. Fear of thee penetrates their limbs like Sekhet in her wrath.'
On the other wall the king appears before Horhehet (Hiit1, once
more smiting his foes. — At the rear-wall of this vestibule and in two
niches to the right and left of the entrance to the next hall are Osiris
Statues. The next Hall, about I6V2 ft. square, is, like the back-wall of
the preceding, entirely hewn out of the rock. It contains 4 pillars. At
the back are three niches each with a triad of gods; in the centre is
Ramenma (Seti I.) himself. The interesting Inscriptions here record,
among other things, that the king came hither in the 9th year of his
reign on his way to the gold-mines, accompanied bv a large retinue
and by architects, and caused wells to be sunk, etc. — On an
adjoining rock are three steles. On one of these is the goddess Aasit
on horseback, with a shield in her left hand ; the second is dedicated
to the official entrusted by Seti with the sinking of the well ; and on
the third is the kneeling ligure of Ani, king's son of Ku.sh and
commander of the Mazai (police). Higher up on the rock are figures
of gazelles, Greek graffiti, and the prfenomen of Amenhotep III.
preceded by the statement: 'made by prince Mermes'. Farther along
the E. hank (12 M. from Edfii^ on the mountainslopes approaching
close to the river near the hill es-Serdg, are the pictiiresqxie remains
of an ancient 'Arab fortress with a mosque. This is sometimes
identifled with the ancient Thmuis, which, however, more probably
lay farther to the S. Near the village of el-Hosh beside the Gebel Abu
Shegah, on the W. bank, a great number of inscriptions and
drawings of very various dates have been found scratched on the
rocks. The oldest King's Name met with is that of an Usertesen (12th
Dyn.), but most of the devices are of a very much later date. Greek
names are not wanting, and most of the inscriptions appear to have
been carved by masons who worked in the large quarries, which are
still to be found bej;ide _the village of el-H6sh. The signature of a
builder's foreman, Amam, and numerous stonemasons' marksj , J Q
J > Bi Xi seem to support this conclusion. We here find girafies,
horses, gazelles, boats, lighters, etc., closely resembling those at
Wfldi Mokatteb (Vol. I., P- W3); and there is also the picture of a
man with an ox, an elephant, an ostrich, and a capitally executed
dog. Among E,jyplian Names are those of Amenhotep, Asarhotep,
The text on this page is estimated to be only 28.25%
accurate

to Gebd SUiikh. GEBEL SILSILEH. 24. Route. 255 a military

colonel ^'^ 1.^ I, Kab Ranseneb, overseer of the temple of Koptos,
and Kebtan, overseer of granaries. In few cases, unfortunately, are
the reians mentioned in which they were written. The Oreeks
generally wrote merely their nnmcs, some of them sugfrestinf; a
Christian date, e.g. TTAXOYMIO? (Pachuraiosl, FTETROS (Petros).
We also find a 4>IL'i^/MON (Philemoni, EYEHO? (Euenos), and
other names, besids which not more than the common to
Jtpocx'JvTjjjia, an act of reverence or worship, stood. The
inscriptions are found for miles, scratched on the rocks and crags of
the low hills skirting the river; they are most numerous to the i^. of
the villasje.f A little to the ^'^. are several Oreel- Inscriptions, first
discovered hy A. C. Harris. These date from the 11th year of the
emperor Antoninus Pius (149 A.D.), and record that a master-
engineer (apyiixTjyavixo?") quarried huge blocks of 11 ells tl6 U.) for
the gate (it'jXT)) of Apollo fat EdfuV). On the W. bank, V4 hr. above
el-Hosh and about 3 4 hr. below Silsileh, is a gorge known as Shatt
er-Reg&,l, 'Shore of the Men', or e.
 256 Route 24. GEBEL SILSILEH. From Edfu preferred
sandstone to limestone and even to the harder hut more easily
disintegrating granite. For suhstructures, however, and for walls
surrounded with earth -they wisely gave the preference to
limestone. — The hills on the two hanks of the river approach so
close together at Gehel Silsileh that they have justly heen compared
to the pillars of a .gigantic [gateway. The legend of the chain that
once harred the passage of the river here is prohably pure invention,
taking its rise from the Coptic name of the city of quarries, which in
the hieroglyphics isn amed Pa Ipiennu. The later Egyptians n.imed
the town "XoA 'XoA '•«. saepes, daustrum, harrier, probably in
reference to the gorge of the river. The Romans, who maintained a
garrison here, converted the T'el fel of the Egyptians into Silsili ,
which was confounded by the Arabs with Silsileh, the Arabic for
'chain'. The people, seeking meanings for every name and preferring
those that come in the guise of a legend, thereupon invented the
story of a chain, that once barred the gorge at Gebel Silsileh. By and
by the very place where this mythical chain had been fastened came
to be pointed out. The dhahabiyehs generally halt in the very midst
of the monuments. We turn first to the N., ascend a well-beaten
track, and then gradually descend the rocky hill. On the slope beside
the river are some tomb-like Recesses , belonging to officials of the
18th Dyn., with the names of Tutmes III. and his sister Hatasu over
the entrance. In one of these, the surface of which is divided into
squares, some of the figures are sketched but left unfinished.
Farther on is a cave with a painted ceiling. Beside it are inscriptions
of the time of Ramses III., builder of Medinet Habu, who is
represented before Ammon, Mutli, and Klninsu. There is also a larger
memorial tablet of the 21st year of Sheshenk I. (22nd Dyn.).
Sheshenk had commanded his architect Horemsat to quarry stones
at Silsileh for the gateway erected by the king on the S. side of the
first court of the temple of Ammon at Karnak. Immediately to the N.
is a Stele bearing various conventional phrases and dating from
Ramses V. ( I ^ ), whose name seldom occurs \ AAAAAAy on the
monuments. Finally we reach the broad facade of the shallow ' —
*Rock Chapel (Speos), wliich may be reckoned among the most
important monuments in the Nile valley, on account of its reliefs and
inscriptions. This chapel, hewn in the rock close to the summit of a
hill, dates froni the 18th Dyn. In front are five doorways, separated
from each other by pillars at varying distance, and crowned with the
astragal and concave cornice. Numerous gods are named in it.
Sebek, who forms a triad with Ammon-Ra and Muth, takes the first
place; Ptah of Memphis is also mentioned. King Horns is here spoken
of as the beloved of the Anka-t (Onka), 'Mistress of Asia', and this
Egyptian-Phffinician goddess is represented with a head-dress,
elsewhere only found on the heads of Asiatic warriors. Ihe Interior
consists of a broad hut shallow vaulted chamber, at the hack of
which is an oblong room. All the walls are covered with carving and
inscriptions. On the S. wall is the Urseus goddess, olferiug the breast
to the infant king Horus, while above her head hovers the vulture of
 to Gebel SilsHeh. GEBEL SILSILEH. 24. Route. 257 Hebent.
On the back-wall, to our left as we enter, King Horus is depicfed
returning in triumph from his campaign in Kthiopia. This "Belief, of
great artistic value, shows the Pharaoh seated on his throne which is
borne by 12 nobles adorned with feathers. The throne has lions' feet
and its back also consists of lions. The king wears the war-helmet
and carries the statf of empire in his left hand. Behind and before
him are court-officials, warding off the sun's rays with the lontc-
handled fiabellum. The Kherheb precedes the litter, offering incense,
and" a train ot captured Ethiopians is led along by the victor.
Vanquished blacks are lying on the ground and others are being
rapidly marched off by Egyptian soldiers. Above the captives are the
words: 'Leading of the captives of the miserable Kush by Horus, king
of Upper and Lower Egypt, etc. His majesty came out of the land of
Kush (Ethiopia) with the" booty which his sword had made, as his
father Ammon had commanded him'. Before the priests, who stand
in a reverential attitude, is written: 'The good god approaches, he
celebrates his victory over the great ones of all lands. When he
grasps the bow in his right hand he is like the lord of Thebes (i.e.
Month, the god of war), as king of the strength of heroes. Above the
prisoners is the inscription: 'Hail tu thee, king of Egypt, sun of the
barbarians! Ihy name is extolled in the land of the Ethiopians. Thy
battle-cry resounds over their seats. Thy heroic strength, O thou
perfect prince, converts the alien lands into tombs. Pharaoh, long life
and health, <> my sun-god' (Shu). Farther to the right and also on
the back-wall is a recess with King Siptah Khuenra before Ammon,
with Bai , an oflicial (overseer of the whole land). Next is a Stele of
Panehesi, of the second year of Merenptah I. and his consort
Astnefert; then a stele of the time of Ramses I., and upon it the first
tablet of the Festival instituted by the king's son Khaemus in honour
of his father Ramses U. The first tablet dates from the 80th year, the
second from the aith, the third from the 37th, and the fourth from
the 40th. Beside the pillar is the small Sanctuary of Ramses II. To
the left of the entrance is King Horus (who built the sanctuary),
before Harmachis and the goddess Jusas, and the same king before
Ammon-Ra and Muth. At the back of the very dark recess is a god,
with three forms on each side. Numerous figures of gods. To the
right of the entrance to the sanctuary is a reproduction of the
Festival Stele mentioned above. Adjoining is the stele of the high-
priest Moi, who instituted a festival in the third vear of Jlerenptah I.
Farther on is another Festival Stele, with Ramses II. before
Harmachis and Muth, Ptah, and Sebek. The date is the same as on
the preceding, but the marshal of the festival is here the Erpa Ha
(prince) and mayor Shai. The same official appears also in the same
stele of the A6th year of Ramses II. as marshal of the 6th festival in
the whole land (Khaemus had probably died in the interval). The
numerous reliefs above and below the five doors and in the recesses
outside should also be noticed. (Jver the central door: King
Z^orMS,^ here called the beloved of Ammon and Muth, of Khnum,
of Abu, and of Ank, mistress of Sati (Asia). Over the second door
(from the left) : Ramses I//, with the commander of his cavalry.
Between the fourth and fifth this king presents Ma to Anhur. Last
relief on the right: Ramses II. brings Ma to Ptah in his shrine and to
Sehek. Within the adjacent fifth door is the small chapel of Pa war (
a5\ nV ), in which Ramses 11. appears with his consort Astnefert
and a princess (Bainut aant) before Ptah and Xefertum. There is also
a small figure of Khaemus. On the inside of the front wall is a
Hieratic Inscription of the 6th year of Ramses UI., containing a
command to Sitemheb, overseer of the palace, to build in the house
of eternity in the W. of Thebes (i.e. the tomb of Ramses III. in Biban
el-Jli;liik. The number uf workmen under him (2000), ships (40), and
boats (4) arc detailed. Two other hieratic Jnscriptions, of a similar
purport, are to be found on the central doorway, to the right and
left. Baedekek's Vppcr Egypt. 17
 258 Route 24. GEBEL SILSILEH. From Edfii The
*MoNUMENTS TO THE SouTH are as interesting as those just
described, from which they are reached in about 1/4 hr. The route
leads to the S., sometimes skirting the river-bank, sometimes leading
through the ancient quarries. We first reach Two Cliambers^ with
the openings facing the river, and recesses at the back. At the first
are two, and at the second are three unnamed sitting statues, hewn
out of the rock. The chambers belonged to officials of Tutmes III.,
whose name occurs over the entrance along with those of Ammon
Harmachis and Sebek. The first cave belonged to Khem nekht,
overseer of granaries, who is here represented along with his wife.
The second, to the N., belonged to the mayor Amatu and his wife,
and contains a series of figures. To the S. occurs the name of
Amenhotep II. A ^ ^ ^ ^" l^^ieperu-, with two small Steles in bad
preservation on the left, and two others, better preserved, on the
right. Farther to the S. near the river is a brightly painted Cave, with
painted ceiling. A relief here depicts Amonemhat, a high priest of
Ammon (probably, from his name, under the 12th Dyn.) sacrificing to
his parents and those of his wife Mimi. The guides point out large
square holes in the lofty rocks as having been iised to fasten the
above-mentioned mythical chain of Silsileh. Skirting the bushy river-
bank we presently reach three Inscribed Tablets, offering a
picturesque appearance as seen from the Nile. Two of them,
adorned with concave cornices and with doors, lie close beside each
other. The architrave is borne by sculptured bud-columns, the shafts
of which represented stems of plants bound together by a band.
Both of these brightly painted facades act as frames for large Steles,
placed at the back of small chapels about 6 ft. deep. That to the S.
(left) was erected by Ramses II. in the first year of his reign, that to
the N. (right) by Merenptah I. (Hotep-hi-ma) in his first year. Each is
formed of three parts. At the top is the triad to which it was
dedicated, next is a Hijmn to the Nile, and below is a list of
sacrifices. In the one case the divine triad consists of Ammon, Muth,
and Khunsu, the chief triad of Upper Egypt, in the other ofRa
Harmachis, Ptah, and Hapi, recalling Lower Egypt. A third, similar
Stele, dating from the 6th year of Ramses III., is to be seen on an
isolated rock to the right. All are more or less damaged; but a
restoration of the text, which is the same on all three, with a few
trifling variations, is rendered possible by collation. L. stern has
published a German Translation of the corrected inscription on the
stele of the first year of Ramses II. (the oldest and best given
preserved), with a collation of the other two. A few extracts are here
from this thrice-repeated HNmn to the Nile, the god to whom Egypt
owed her verv origin, and upon whom she was dependent for the
conditions of continued existence from year to year. Similar hymns to
the same god have come downi to us in "a papyrus from the hand of
Anna, one of the most famous authors of the period of the Pharaohs
; and these are clearly connected with the hymn now before us. The
inscription begins: 'In the
 to Gehel SilsUeh. GEBEL SILSILEII. 2d. Route. 259 1st }oar,
on the 10th Epiphi, in the reign of His Majesty etc. . . .
RamscsMianmn, who loves the Nile, the father of the gods, his
creator. Long may he live, possessing lirmness and might, eternally.
Long live the beneficent god, the Nile that loves the primseval
waters (JVim), the father of the gods, who form the cycle of the nine
deities, which belong to the floods, the blessing, the abundance, the
support of Egypt, who blesses all the world with life by his rich
abundance, who is dignified in his course and distributes blessings
with his fingers. The elect are rejoiced at his approach. Thou art one
that hast created thyself, and no man knows whence thou art. On
the day that thou comest out of thy surroundings, all the world
rejoices. Thou art a lord of many fishes and gifts, who bestowest
nourishment upon Egypt. Even the nine deities know not whence
thou art. Thou art their life. Therefore when thou approaches! they
redouble their offerings ; they furnish the altars richly and raise their
voices in exultation when thou appearest. Thou metest rich measure
to us, to nourish the elect, like Ra when he ruled this land. Strong
and wakeful is he at all times, to seek nourishment for the living, to
make the corn abundant like the sand of the seashore, and to load
the granaries with gifts. Behold, therefore His Majesty sought how
he might e.xalt the father of all gods, the prince and ruler of the
flood, and meditated like the god Tebuti (Thoth) to find out what
was adequate to his love (i.e. how he might give most adequate
expression to his love). No king has done so since thy time, < >h Ra
' And His Blajesty spoke : 'Whereas the Nile nourishes the world, and
blessing and abundance follow upon his rising, and behold each one
lives in his dwelling, enriched through his command ; and seeing
that I know what stands in the bookstore that is preserved in the
library; therefore when the Nile comes forth from his two sources,
then let the offerings to the gods be increased; but if the holy
stream is at Silsileh ( \£r Khe \\ D ^ at the right time. King Ramses
U. will redouble the ofierings to it there . This king appointed two
festivals to be kept at Silsileh in honour of the Nile, as the following
portion of the inscription records. One was to be observed at the
beginning of its gradual rise (the 15th Epiphi), the other on the 15th
Thoth, when the rapid rise set in. L. Stern compares these
appropriately to the two main festivals of the modern Egyptians, the
Night of the Drop, and the Cutting of the Dam, which arc also two
months apart (Vol. I., p. 23y). Merenptah I. and Hamses III.
confirmed the grants made by Ramses II. for the purposes of these
festivals, and erected the abovementioned steles in commemoration
of the fact. The nature ol' the grants (sacrificial bread and cakes,
antelopes, beef, veal , six kinds of wine, honey, oil, beer, milk,
essences, etc.) is recorded in the lists below the inscriptions, from
which we also learn that the king offered fowls to the river-gods and
as much corn as a granary could contain to Ammon of Thebes. —
The side -walls of the two chapels are also occupied with scenes of
.sacrifice and worship. Various opinions have been expressed as to
the reason of the special reverence p;iid to the Nile at this particular
defile. The narrows of Silsileli were perhaps difficult or even
impossible to pass in earliest antiquity, and so probably canie to be
regarded as the second entrance of the river into Egypt, the first
being at the cataract at Assuan. This is the more probable as Kora
Ombo was certainly reckoned as belonging to Nubia. Between the
above-mentioned chapels of itamses 11. and Merenptah, is a small
Stele erected by tlie mayor Punehe^i (p. Ibl), who appears here
along with a son of the king accompanying the king before Aminon.
The prayer i.s addressed not only to Amnion, but also to the 'holy
water' {\n\x ab, see above) and to the god Sebek. 17* nnu-t|, j
 2G0 Route 25. KOM OMBO. A few paces farther to the S.,
and at a lower level than the steles, is a small Chapel, which in spite
of its very ruinous condition, we can recognize as having been
founded by the great builder Seti I. The inscriptions on the stele are
completely obliterated. — To the right of this chapel is a carefully
hewn but empty Recess, and in the same cliff but facing N. in the
direction of the two steles, is a Tablet of a chief-priest of Ammon
named Roi, who here appears with Merenptah I. before the god. The
Quarries on the W. bank of the Nile are of enormous size, but few
traces of inscriptions are now to be found. An Inscription of
Amenhotep III., however, records the transport of stones by the Kile
for a temple of Ptah (at Memphis?). There are two Posts of the time
of Setil. , a.ni Demotic Inscriptions from Eoman times. An unfinished
colossal Sphinx, nearly opposite the usual landingplace of the
dhahabiyehs, is also not without interest. Even if all the monuments
of Egypt had disappeared, these huge quarries would serve as a
proof that building operations of unsurpassed extent had once been
carried on here. The town of Khennu appears to have stood here,
not on the E. bank. A few unimportant ruins may he traced.
According to papyri now in Turin, the residence of the kings of the
12th L)yn., the Amenemhas and Usertesens, was transferred to
K7iennn. Under the 19th and 20th Dyn. this town possessed a
University. A papyrus, now in the British Museum, contains a
warning to the students of this institution against excessive beer-
drinking and idleness. 25. From Gebel Silsileh to Koin Ombo. Comp.
the Map at p. 98. 15 M. (391/2 M. from Edfu). Kom Ombo is a
/steamer Station, at which the three-weeks tourist-steamer halts 1/2
hr., the four-weeks steamer 1 hr., both on the upward voyage ; while
the mail-steamer passes a night here on the downward voyage. The
mountains recede from the river immediately above the defile of
Gebel Silsileh (p. 255), giving space to the desert which appears
grey on the Arabian side and yellow on the Libyan side. The narrow
cultivable strip is tilled by peasants of a distinctly darker complexion
than the fellahin of the Thebaid. Both land and people approach
gradually nearer to the Nubian type. At the village of Meniyeh (E.
bank) we enter the E. branch of the stream, which here forms the
island of Munsuriyeh, with a village of the same name. OntheW.
bank of the Nile, opposite the lower end of this island, lies Ahu
Mangar, where Arcelin claims to have discovered stone implements
in a deposit of gravel containing marine mussels, which was overlaid
by more recent deposits of the river. On a hill on theE. bank next
appears the beautiful *Temple of Kom Ombo, conspicuous from a
considerable distance. Somewhat nearer the river is another temple,
now almost entirely destroyed. The double door of the hypostyle of
the higher temple presents an
 ROM OMBO, 25. Route. 261 imposing appearance; but the
nearer we approach the temple, the more clearly we perceive that
the stream has already washed away the pylons and colonnade, and
that in no long time the whole of the handsome building will be
undermined, like the temple of Kau el-Kebir (p. 48). Large fragments
of the building are even now to be seen suiik beneath the stream,
near its edge. On one of these is the dedication inscription,
recording that the building had been founded as 'a work to endure
for eternity'. The liigh-lying ruins of Kom Ombo are especially
picturesque by the light of the full moon. A single glance is enough
to reveal to the practised eye that a comparatively late monument
lies before the traveller. Ptolemy VIl. Philometor founded the temple
: ( X Vrfi ij3 %M }\ * ^^ neteru pir ptah kheper sotep en amon ar
ma ra, Epiphanes son of the gods, begotten by Ptah, chosen by
Ammon, making the truth of Ra. Euergetes II., Ptolemy XIII. Neos
Dionysus, his wife Cleopatra V., and at a later date Tiberius enlarged
the building. It belonged to the Egyptian town ptm^ (I (1 Nuhi
(Coptic Mbo), called by the Greeks Ombos, as capital of the district
Omhites, which formerly was part of the Nubian nomos, while from
the Egyptian Nubi they formed the names Unbi-Ombi and Omboi
("Op.jjot). It would be a ereat error to dispute, in face of the present
building, the existence of an earlier temple on this site. A gateway
which existed on the E. side of the girdle-wall down to 1870 showed
on its jamhs the ligure of Tutmes III., huilder of the temple, which
was named Pa Sehek (temple of the crocodile-headed Sehek) in the
inscription of Ramaka beneath. According to Champollion the door-
posts were provided by one of the Ptolemies with a new lintel ; the
old lintel, dating from Tutmes in., was found on the river-bank in
1883 by Maspero, along with a door-post bearing the name of
Amenhotep I., and a block of stone with the cartouche of Bamses
the Great. The old temple of Tutmes HI. probably faced the east.
Corresponding to the double diAdsion of this temple, tsvo different
triads were especially worshipped within it. The chief of the first was
Sebek-1'a with the crocodile-head, along mth whom were Hathor
and Khunsu ; at the head of the second was Har-war. the elder
Horus (Arueris ), with whom were associated Tasentnefert (the good
sister) and her son Pinebtati, lord of both lands. The entire left half
of the temple was dedicated to the triad of Arueris, the right half to
that of Sebek. The coins of Ombos display a warrior, with a lance in
one hand and a crocodile in the other; figures which represent Horus
and Sebek in the Roman style. The 'memory of the worship of the
two divine brothers in the same temple seems to have lingered in
the following legend, related to the writer by a boatman at Kom
Ombo. 'Once upon a time two brothers reigned as princes of Ombo.
One was wicked and strong, the other was good. The latter, who
loved his
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade

Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.

Let us accompany you on the journey of exploring knowledge and

personal growth!

textbookfull.com