Download ebooks file Principles and practice of constraint programming 20th international conference

Page 1


Principles and Practice of Constraint

Programming 20th International Conference CP 2014 Lyon France

September 8 12 2014 Proceedings 1st Edition Barry O’Sullivan (Eds.)

Visit to download the full and correct content document: https://textbookfull.com/product/principles-and-practice-of-constraint-programming-20t h-international-conference-cp-2014-lyon-france-september-8-12-2014-proceedings-1s t-edition-barry-osullivan-eds/

More products digital (pdf, epub, mobi) instant download maybe you interests ...

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-ofconstraint-programming-22nd-international-conferencecp-2016-toulouse-france-september-5-9-2016-proceedings-1stedition-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-ofconstraint-programming-25th-international-conferencecp-2019-stamford-ct-usa-september-30-october-4-2019-proceedingsthomas-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-ofconstraint-programming-26th-international-conferencecp-2020-louvain-la-neuve-belgium-september-7-11-2020-proceedingshelmut-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-researchand-development-22nd-international-conference-iccbr-2014-corkireland-september-29-2014-october-1-2014-proceedings-1st-editionluc-lamontagne/

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-scientificcomputing-16th-international-workshop-casc-2014-warsaw-polandseptember-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-andsecurity-33rd-international-conference-safecomp-2014-florenceitaly-september-10-12-2014-proceedings-1st-edition-andreabondavalli/

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-intelligentsystems-third-international-conference-icais-2014-bournemouth-ukseptember-8-10-2014-proceedings-1st-edition-abdelhamidbouchachia-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-modelingmodels-and-reusability-8th-international-conferencesam-2014-valencia-spain-september-29-30-2014-proceedings-1stedition-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-oftimed-systems-12th-international-conferenceformats-2014-florence-italy-september-8-10-2014-proceedings-1stedition-axel-legay/

Principles and Practice of Constraint Programming

20th International Conference, CP 2014 Lyon, France, September 8–12, 2014

Proceedings

LectureNotesinComputerScience8656

CommencedPublicationin1973

FoundingandFormerSeriesEditors: GerhardGoos,JurisHartmanis,andJanvanLeeuwen

EditorialBoard

DavidHutchison LancasterUniversity,UK

TakeoKanade

CarnegieMellonUniversity,Pittsburgh,PA,USA

JosefKittler UniversityofSurrey,Guildford,UK

JonM.Kleinberg

CornellUniversity,Ithaca,NY,USA

AlfredKobsa UniversityofCalifornia,Irvine,CA,USA

FriedemannMattern ETHZurich,Switzerland

JohnC.Mitchell StanfordUniversity,CA,USA

MoniNaor

WeizmannInstituteofScience,Rehovot,Israel

OscarNierstrasz UniversityofBern,Switzerland

C.PanduRangan IndianInstituteofTechnology,Madras,India

BernhardSteffen TUDortmundUniversity,Germany

DemetriTerzopoulos UniversityofCalifornia,LosAngeles,CA,USA

DougTygar UniversityofCalifornia,Berkeley,CA,USA

GerhardWeikum MaxPlanckInstituteforInformatics,Saarbruecken,Germany

BarryO’Sullivan(Ed.)

PrinciplesandPractice ofConstraintProgramming

20thInternationalConference,CP2014

Lyon,France,September8-12,2014

Proceedings

VolumeEditor

BarryO’Sullivan

InsightCentreforDataAnalytics

SchoolofComputerScienceandInformationTechnology UniversityCollegeCork WesternRoad,Cork,Ireland

E-mail:barry.osullivan@insight-centre.org

ISSN0302-9743e-ISSN1611-3349

ISBN978-3-319-10427-0e-ISBN978-3-319-10428-7

DOI10.1007/978-3-319-10428-7

SpringerChamHeidelbergNewYorkDordrechtLondon

LibraryofCongressControlNumber:2014946201

LNCSSublibrary:SL2–ProgrammingandSoftwareEngineering ©SpringerInternationalPublishingSwitzerland2014

Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartof thematerialisconcerned,specificallytherightsoftranslation,reprinting,reuseofillustrations,recitation, broadcasting,reproductiononmicrofilmsorinanyotherphysicalway,andtransmissionorinformation storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodology nowknownorhereafterdeveloped.Exemptedfromthislegalreservationarebriefexcerptsinconnection withreviewsorscholarlyanalysisormaterialsuppliedspecificallyforthepurposeofbeingenteredand executedonacomputersystem,forexclusiveusebythepurchaserofthework.Duplicationofthispublication orpartsthereofispermittedonlyundertheprovisionsoftheCopyrightLawofthePublisher’slocation, inistcurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Permissionsforuse maybeobtainedthroughRightsLinkattheCopyrightClearanceCenter.Violationsareliabletoprosecution undertherespectiveCopyrightLaw.

Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. Whiletheadviceandinformationinthisbookarebelievedtobetrueandaccurateatthedateofpublication, neithertheauthorsnortheeditorsnorthepublishercanacceptanylegalresponsibilityforanyerrorsor omissionsthatmaybemade.Thepublishermakesnowarranty,expressorimplied,withrespecttothe materialcontainedherein.

Typesetting: Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India

Printedonacid-freepaper

SpringerispartofSpringerScience+BusinessMedia(www.springer.com)

Preface

Thisvolumecontainstheproceedingsof the20thInternationalConferenceon thePrinciplesandPracticeofConstraintProgramming(CP2014),whichwas heldinLyon,France,fromSeptember8–12,2014.Acomprehensiveweb-site abouttheconferenceisavailableat http://cp2014.a4cp.org.

TheCPconferenceisthepremierannualinternationalconferenceonconstraintprogramming.Itisconcernedwithallaspectsofcomputingwithconstraints,includingtheory,algorithms,environments,languages,models,systems, andapplicationssuchasdecisionmaking,resourceallocation,scheduling,configuration,planning,etc.TheCPcommunityisverykeentoensureitremainsopen tointerdisciplinaryresearchattheintersectionbetweenconstraintprogramming andrelatedfieldssuchassearch,satisfiability,knowledgerepresentationandreasoning,machinelearning,multi-agentsystems,andoperationsresearch.

TheCP2014programincludedpresentationsofhigh-qualityscientificresearchpapersandapplicationsofconstraintstechnology.Inaddition,forthe firsttime,theprogramincludedajournalpresentationtrackthatwasdesigned toprovideaforumtodiscussimportantresultsintheareaofconstraintprogrammingthatappearedrecentlyinrelevantjournals,buthadnotbeenpreviously presentedatCP,CPAIOR,oranyothermajorAIconference.

ThereviewprocessforCP2014reliedonamulti-tierapproachinvolving aseniorProgramCommittee,dedicatedregularProgramCommitteesforboth themaintechnicalandapplicationtracks,alongwithasetofadditionalreviewersrecruitedbyProgram Committeemembers.Authorschosetosubmiteither longorshortpaperstoeitherthemaintechnicaltrackortheapplicationtrack. Alternatively,authorssubmittingtothejournalpresentationtracksubmitted abstractsforreviewbyadedicatedcommittee.Allsubmissionstothetechnical trackwereassignedtoamemberoftheseniorProgramCommitteeandthree membersoftheProgramCommittee.Allsubmissionstotheapplicationtrack wereassignedtothechairofthattrackandthreemembersofitsProgramCommittee,whichwasthesameapproachadoptedforthejournalpresentationtrack. AuthorsweregivenanopportunitytorespondtoreviewsbeforeadetaileddiscussionwasundertakenattheleveloftheProgramCommittees,overseenby theProgramChair,theseniorProgramCommitteememberortrackchair,as appropriate.

AmeetingoftheseniorProgramCommitteewasheldatUniversityCollege CorkattheendofMay,chairedbytheProgramChair,wherethereviews, authorfeedback,anddiscussionsoneverypaperwerediscussedindetail.The principleunderwhichthesediscussionstookplacewasthatallpapersdeemed tobeofsufficientqualitywereacceptedintotheprogram.Theresultofthiswas thattheacceptancerateforthetechnicaltrackwasalittleover50%whilethe applicationtrackaccepted66%ofpapers.Abstractssubmittedtothejournal

presentationtrackthatsatisfiedtherequirementsforthattrackwereaccepted. Overall,thequalityofsubmissionstotheconferencewasveryhigh,andthe finalprogram,asevidencedbythesepro ceedings,wasexcellent.Weselecteda setofprize-winningpapers,whicharepresentedlaterinthefrontmatterof theproceedings,includingabesttechnicaltrackpaper,abestapplicationtrack paper,abeststudentpaper,andarunner-upbeststudentpaper.

Theconferenceincludedfourinvitedtalksfromdistinguishedscientists:Maria Fox,PatrickProsser,Louis-MartinRousseau,andVijaySaraswat.Abstractsof thesetalksareincludedintheproceedings.Wealsobenefittedfromanexcellent programoftutorialsandworkshops;thesearealsodetailedfurtherinthefront matteroftheseproceedings.

Twoelementsoftheconferenceprogramthatarenotreflectedintheproceedingsarethedoctoralprogramandthe20thanniversarycelebration.The doctoralprogramprovidedanopportunityforPhDstudentstomeeteachother aswellasseniorresearchersinthefield.Thefocusoftheprogramwasonmentoringstudentsandprovidingaforumforthemtoexchangeideas,getfeedback ontheirresearch,andbenefitfromasp eciallydesignedtutorialprogram.To markthe20thanniversaryoftheconference,aspecialcelebratorysessionatthe conferencewasorganized.

Thetaskofproducinganexcellentscientificprogramforaconferencelike CP2014isatrulyinternationalundertaking,involvingalargenumberofpeople fromaroundtheworld.Iwouldliketosincerelythankthemembersofthesenior ProgramCommittee,whonotonlytookresponsibilityforoverseeingthereviewingofanumberofpapers,butalsotooktimeoutfromtheirbusyschedulesto attendaweekendmeetinginCorkinMay.Iwouldliketothankthemembersof theProgramCommittee,andtheadditionalreviewerstheyrecruited,forprovidinghigh-qualityreviewsanddiscussionsoneachandeverypapersubmittedto theconference.Aspecialwordofthanksgoestotheauthorsofallsubmissions totheconference.

Iwasveryfortunatetoworkwithagreatteamofpeoplewhochairedaspectsoftheconference:MarkWallace(ApplicationTrackChair),JustynaPetke andAndreaRendl(DoctoralProgramChairs),MichelaMilano(Workshopand TutorialChair),FrancescaRossi(JournalTrackChair),PascalVanHentenryck (20thAnniversaryCelebrationChair),andPierreSchaus(PublicityChair).A veryspecialthanksisdeservedbyYvesDevilleandChristineSolnon,theConferenceChairs,whomanagedallaspectsofthelocalarrangements,logistics, finances,andsponsorship.Theyweretheverygeneroushostsoftheconference itself,andprovidedexceptionalhospitalitytothedelegates.

IwouldliketothanktheAssociationforConstraintProgramming,whoentrustedthescientificprogramoftheconferencetome.Itwasahugehonour forme,aswellasacareerhighlight.Iwouldliketothankthemanysponsors whoprovidedgenerousfinancialsupportfortheconference.Acompletelistof sponsorsisprovidedlaterintheseproceedings.Withoutthesupportofthese sponsorstheconferencewouldnothavebeenfinanciallyviable.

Finally,onapersonalnote,Iwouldliketodedicatemyworkonthisconferenceandthisvolumetothememoryofmylateuncleandgodfather,AlanLee (August17,1942–November7,2013).

September2014BarryO’Sullivan

Prize-WinningPapers

FollowingthereviewingprocessandtheseniorProgramCommittee(SPC)meeting,asmallcommitteeof(S)PCmemberswasestablishedtoassisttheprogram chairintheselectionofthebestpapersfromthetechnicaltrackoftheconference.Thecommitteeforbesttechnicaltrackpaperandbeststudentpaper comprisedNicolasBeldiceanu(TASC(CNRS/Inria),MinesNantes),PeterJeavons(UniversityofOxford),andIanMiguel(UniversityofSt.Andrews).The bestapplicationtrackpaperwasrecommendedbytheapplicationtrackchair, MarkWallace(MonashUniversityandOpturion),whoworkedcloselywithHelmutSimonis(UniversityCollegeCork).ThebestpapersforCP2014arelisted below.Arunner-upwasalsodeemedappropriateinthecaseofbeststudent paper.

BestTechnicalTrackPaper

OnBrokenTriangles

MartinCooper,AchrefElMouelhi,CyrilTerrioux,andBrunoZanuttini

BestApplicationTrackPaper

UsingCPinAutomaticTestGeneration forABBRobotics’PaintControlSystem MortenMossige,ArnaudGotlieb,andHeinMeling

BestStudentPaper

OnCompilingCNFintoDecision-DNNF UmutOztokandAdnanDarwiche

ACompleteSolverforConstraintGames Thi-Van-AnhNguyenandArnaudLallouet

TutorialsandWorkshops

AfeatureoftheCP2014conferenceprogramwasasetoftutorialsandworkshops.Tutorialswereexpectedtogivean in-depthpresentationofemergingand excitingtopicsthatarerelevanttoabroadswathoftheconstraintprogramming community.Ontheotherhand,theworkshopsprovidedaninformalvenuewhere participantsweregiventheopportunitytopresent,discuss,andbrainstormon newideas,technicaltopics,excitingnewapplicationareas,andcross-fertilization withotherdomains.TheWorkshopandTutorialChairforCP2014wasMichela Milano(UniversityofBologna)who,withtheProgramChair,selectedthefollowingtutorialsandworkshopsforinclusionintheconferenceprogram.Each tutorialandworkshopwassubmittedinresponsetoanopencallforproposals, andeachwassubjectedtopeerreview.

Tutorials

ThePastandFutureof csplib.org :WhyandHowtoContribute?

ChristopherJefferson

AutomatedReformulationofConstraintModelsinSavileRow

PeterNightingale

SocialChoice

FrancescaRossi,KristenBrentVenable,andTobyWalsh

MiniZinc2.0

PeterJ.StuckeyandGuidoTack

Workshops

ModRef2014-the13thInternationalWorkshoponConstraintModellingand Reformulation

CarlosAns´otegui

ConstraintProgrammingMeetsVerification2014

ParoshAzizAbdulla,MohamedFaouziAtig,PierreFlener,ArnaudGotlieb, andJustinPearson

Constraint-BasedMethodsforBioinformatics

SimondeGivryandNicosAngelopoulos

BridgingtheGapBetweenTheoryandPracticeinConstraintSolvers PhilippeJ´egou,MartinCooper,LakhdarSais,andBrunoZanuttini

CloudComputingandOptimization

Jean-CharlesR´eginandBertrandLeCun

ConferenceOrganization

ConferenceChairs

YvesDevilleUCLouvain,Belgium

ChristineSolnonLIRIS,INSALyon/CNRS,France

ProgramChair

BarryO’SullivanUniversityCollegeCork,Ireland

ApplicationTrackChair

MarkWallaceMonashUniversityandOpturion,Australia

DoctoralProgramChairs

JustynaPetkeUniversityCollegeLondon,UK

AndreaRendlNICTAandMonashUniversity,Australia

WorkshopandTutorialChair

MichelaMilanoUniversityofBologna,Italy

JournalTrackPresentationChair

FrancescaRossiUniversityofPadova,Italy

20thAnniversaryCelebrationChair

PascalVanHentenryckNICTAandUniversityofMelbourne,Australia

PublicityChair

PierreSchausUCLouvain,Belgium

SeniorProgramCommittee

J.ChristopherBeckUniversityofToronto,Canada

NicolasBeldiceanuTASC(CNRS/Inria),MinesNantes,France

ChristianBessiereCNRSandUniversityofMontpellier,France

KenBrownUniversityCollegeCork,Ireland

BertheY.ChoueiryUniversityofNebraska-Lincoln,USA

DavidCohenRoyalHolloway,UniversityofLondon,UK

YvesDevilleUCLouvain,Belgium

JimmyLeeTheChineseUniversityofHongKong, SARChina

IanMiguelUniversityofSt.Andrews,UK

MichelaMilanoUniversityofBologna,Italy

BarryO’SullivanUniversityCollegeCork,Ireland(Chair)

PatrickProsserGlasgowUniversity,UK

Jean-CharlesR´eginUniversit´edeNice-SophiaAntipolis,France

FrancescaRossiUniversityofPadova,Italy

ChristianSchulteKTHRoyalInstituteofTechnology,Sweden

HelmutSimonisUniversityCollegeCork,Ireland

ChristineSolnonLIRIS,INSALyon/CNRS,France

PeterStuckeyNICTAandtheUniversityofMelbourne, Australia

MarkWallaceMonashUniversityandOpturion,Australia

TobyWalshNICTAandUNSW,Australia

TechnicalTrackProgramCommittee

CarlosAns´oteguiUniversitatdeLleida,Spain

HadrienCambazardUniversityofGrenobleAlpes,G-SCOP,France

HubieChenUniversidaddelPa´ısVascoandIkerbasque, Spain

GeoffreyChuNICTAVRL,UniversityofMelbourne, Australia

RemiColettaCNRSandUniversityofMontpellier,France

MartinCooperIRIT,UniversityofToulouse,France

RinaDechterUniversityofCaliforniaatIrvine,USA

BoiFaltingsEPFL,Switzerland

PierreFlenerUppsalaUniversity,Sweden

IanGentUniversityofSt.Andrews,UK

DiarmuidGrimesUniversityCollegeCork,Ireland

EmmanuelHebrardLAAS-CNRS,France

BrahimHnichIzmirUniversityofEconomics,Turkey

PeterJeavonsUniversityofOxford,UK

PhilippeJ´egouUniversit´ed’Aix-Marseille,LSIS,France

PeterJonssonLink¨opingUniversity,Sweden

GeorgeKatsirelosINRA,Toulouse,France

ZeynepKiziltanUniversityofBologna,Italy

JavierLarrosaUPC,Spain

ChristopheLecoutreUniversit´ed’Artois,France

InˆesLynceINESC-ID,IST,UniversidadedeLisboa, Portugal

FelipManyaIIIA-CSIC,Spain

RaduMarinescuIBMResearch,Ireland

ChristopherMearsMonashUniversity,Australia

DeepakMehtaUniversityCollegeCork,Ireland

AmnonMeiselsBen-GurionUniversity,Israel

PedroMeseguerIIIA-CSIC,Spain

LaurentMichelUniversityofConnecticut,USA

NinaNarodytskaUniversityofToronto,Canada

AlexandrePapadopoulosUniversit´ePierreetMarieCurie(Paris6), France

JustinPearsonUppsalaUniversity,Sweden

GillesPesantEcolePolytechniquedeMontreal,Canada

JustynaPetkeUniversityCollegeLondon,UK

LuisQuesadaUniversityCollegeCork,Ireland

Claude-GuyQuimperUniversit´eLaval,Canada

AndreaRendlNICTA,Australia

MichelRueherUniversityofNiceSophiaAntipolis,France

LakhdarSaisUniversit´ed’Artois,France

PierreSchausUCLouvain,Belgium

ThomasSchiexINRAToulouse,France

KostasStergiouUniversityofWesternMacedonia,Greece

GuidoTackNICTA,MonashUniversity,Australia

JohanThapperUniversit´eParis-Est,Marne-la-Vall´ee,France

MichaelTrickCarnegieMellonUniversity,USA

Willem-JanvanHoeveCarnegieMellonUniversity,USA GerardVerfaillieONERA,France

RolandYapNationalUniversityofSingapore,Singapore

YuanlinZhangTexasTechUniversity,USA

RoieZivanBen-GurionUniversityoftheNegev,Israel

StanislavZivnyUniversityofOxford,UK

ApplicationTrackProgramCommittee

TheirryBenoistInnovation24,France

LucasBordeauxMicrosoftResearch,UK

MatsCarlssonSICS,Sweden

H˚akanKjellerstrandMalmo,Sweden

LaurentPerronGoogle,France

SiddharthaSenGuptaTataConsultancyServices,India

PaulShawIBM,France

HelmutSimonisUniversityCollegeCork,Ireland

XVIConferenceOrganization

Willem-JanVanHoeveCarnegieMellonUniversity,USA MarkWallaceMonashUniversityandOpturion,Australia (Chair)

JournalPresentationTrackProgramCommittee

ChristianBessiereCNRSandUniversityofMontpellier,France

JimmyLeeTheChineseUniversityofHongKong, SARChina

PatrickProsserGlasgowUniversity,UK

FrancescaRossiUniversity ofPadova,Italy(Chair)

HelmutSimonisUniversityCollegeCork,Ireland K.BrentVenableTulaneUniversity,USA TobyWalshNICTAandUNSW,Australia

AdditionalReviewers

Arbelaez,Alejandro Beyersdorff,Olaf Bistarelli,Stefano Bova,Simone Carbonnel,Cl´ement Cire,Andre Davies,Jessica DiGaspero,Luca Duck,Gregory Fontaine,Daniel Gab`as,Joel Gao,Yong

Gavanelli,Marco Gay,Steven Grinshpoun,Tal Gutierrez,Julian Gutierrez,Patricia Hartert,Renaud Jabbour,Said Janota,Mikol´aˇ s Kell,Brian Leo,Kevin Lhomme,Olivier Li,Chu-Min Li,Wei

Likitvivatanavong,Chavalit Lombardi,Michele

Mairy,Jean-Baptiste Marques-Silva,Joao Martins,Ruben Mauro,Jacopo Mengel,Stefan Michel,Claude Monette,Jean-No¨el Nattaf,Margaux Neveu,Bertrand Nightingale,Peter Okamoto,Steven Paparrizou,Anastasia Prestwich,Steve P´erez,JorgeA. Rollon,Emma Roy,Pierre Saint-Guillain,Michael Schutt,Andreas Siala,Mohamed Slivovsky,Friedrich Tabary,Sebastien Terrioux,Cyril Tjandraatmadja,Christian VanGelder,Allen Vismara,Philippe Wahbi,Mohamed Zytnicki,Matthias

Sponsors

CP2014isverygratefultothefollowingsponsorsfortheirgeneroussupportof theconference.

AIMMS

ArtificialIntelligence Journal(Elsevier)

AssociationforConstraintProgramming(ACP)

AssociationFran¸caisepourlaProgrammationparContraintes(AFPC) Cadence

CentreNationaldelaRechercheScientifique(CNRS),France

Facult´edesSciencesetTechnologies,Universit´eLyon1,France GraduateSchoolinComputingScience,Belgium(Grascomp)

ICTEAM/UCLouvain,Belgium

INSALyon,France

Laboratoired’InformatiqueenImageetSyst`emesd’information(LIRIS),France Quintiq

TheAssociationforConstraintProgramming

TheAssociationforConstraintProgramming(ACP)aimstopromoteconstraint programmingineveryaspectofthescientificworld,byencouragingitstheoreticalandpracticaldevelopment,itsteachinginacademicinstitutions,itsadoption intheindustrialworld,anditsuseinapplications.TheACPisanon-profitassociationthatusesthefundsraisedfromitseventstosupportactivitiesfortheCP community.FurtherinformationabouttheACP,itsactivities,andmembership, isavailablefromitswebsiteat http://www.a4cp.org

ExecutiveCommittee

ThecurrentExecutiveCommittee,whichwasformedonJanuary1,2013,has thefollowingmembership:

Officers

President–HelmutSimonis(elected2011)

Treasurer–ThomasSchiex(elected2011)

Secretary–Willem-JanvanHoeve(elected2013)

ConferenceCoordinator–PierreFlener(elected2013)

OtherMembers

YvesDeville(elected2011)

GuidoTack(elected2013) RolandYap(elected2011)

Ex-OfficioMembers

PastPresident–BarryO’Sullivan

andBrunoZanuttini

EfficientApplicationofMax-SATResolutiononInconsistentSubsets 92 Andr´eAbram´eandDjamalHabet

SequentialTimeSplittingandBoundsCommunicationforaPortfolio ofOptimizationSolvers 108 RobertoAmadiniandPeterJ.Stuckey

Scoring-BasedNeighborhoodDominancefortheSubgraphIsomorphism Problem ........................................................ 125

GillesAudemard,ChristopheLecoutre,MounySamy-Modeliar, GillesGoncalves,andDanielPorumbel

LinkingPrefixesandSuffixesforConstraintsEncodedUsingAutomata withAccumulators ...............................................

NicolasBeldiceanu,MatsCarlsson,PierreFlener, Mar´ıaAndre´ınaFranciscoRodr´ıguez,andJustinPearson

ChristophBerkholz

TheBalanceConstraintFamily ....................................

ChristianBessiere,EmmanuelHebrard,GeorgeKatsirelos, ZeynepKiziltan, ´ EmiliePicard-Cantin,Claude-GuyQuimper, andTobyWalsh

ExperimentalComparisonofBTDandIntelligentBacktracking: TowardsanAutomaticPer-instanceAlgorithmSelector ............... 190 Lo¨ıcBlet,SambaNdojhNdiaye,andChristineSolnon

SolvingIntensionalWeightedCSPsbyIncrementalOptimizationwith BDDs

MiquelBofill,MiquelPalah´ı,JosepSuy,andMateuVillaret

Cl´ementCarbonnel,MartinC.Cooper,andEmmanuelHebrard NestedConstraintPrograms .......................................

GeoffreyChuandPeterJ.Stuckey BeyondConsistencyandSubstitutability

MartinC.Cooper

SubexponentialTimeComplexityofCSPwithGlobalConstraints 272 RonalddeHaan,IyadKanj,andStefanSzeider

ANewCharacterizationofRelevantIntervalsforEnergetic

AlbanDerrienandThierryPetit

ADeclarativeParadigmforRobustCumulativeScheduling

AlbanDerrien,ThierryPetit,andSt´ephaneZampelli

ImprovingDPOPwithBranchConsistencyforSolvingDistributed ConstraintOptimizationProblems 307 FerdinandoFioretto,TiepLe,WilliamYeoh,EnricoPontelli, andTranCaoSon

DanielFontaine,LaurentMichel,andPascalVanHentenryck

KathrynFrancisandPeterJ.Stuckey

IanP.Gent,BilalSyedHussain,ChristopherJefferson, LarsKotthoff,IanMiguel,GlennaF.Nightingale,and PeterNightingale

UmbertoGrandi,HangLuo,NicolasMaudet,andFrancescaRossi

Vinas´etanRatheilHoundji,PierreSchaus,LaurenceWolsey, andYvesDeville

398 DaisukeIshii,KazukiYoshizoe,andToyotaroSuzumura Tree-DecompositionswithConnectedClustersforSolvingConstraint

PhilippeJ´egouandCyrilTerrioux

CIPandMIQPModelsfortheLoadBalancingNurse-to-Patient

Wen-YangKu,ThiagoPinheiro,andJ.ChristopherBeck

RonanLeBras,CarlaP.Gomes,andBartSelman

TowardsPracticalInfiniteStreamConstraintProgramming:

JasperC.H.LeeandJimmyH.M.Lee

AnIncreasing-NogoodsGlobalConstraintforSymmetryBreaking

JimmyH.M.LeeandZichenZhu

Memory-EfficientTreeSizePredictionforDepth-FirstSearch

LeviH.S.Lelis,LarsOtten,andRinaDechter

Higher-OrderConsistenciesthroughGAConFactorVariables

ChavalitLikitvivatanavong,WeiXia,andRolandH.C.Yap

FlorianLonsingandUweEgly

RubenMartins,SaurabhJoshi,VascoManquinho,andInˆesLynce

ReducingtheBranchinginaBranchandBoundAlgorithmforthe

CiaranMcCreeshandPatrickProsser

AntonioMorgado,CarmineDodaro,andJoaoMarques-Silva

RobertNieuwenhuis

AutomaticallyImprovingConstraintModelsinSavileRowthrough Associative-CommutativeCommonSubexpressionElimination

PeterNightingale, ¨ Ozg¨urAkg¨un,IanP.Gent, ChristopherJefferson,andIanMiguel

GuillaumePerezandJean-CharlesR´egin

Jean-CharlesR´egin,MohamedRezgui,andArnaudMalapert

AndreaRendl,GuidoTack,andPeterJ.Stuckey

DecomposingUtilityFunctionsinBoundedMax-SumforDistributed ConstraintOptimization

EmmaRollonandJavierLarrosa InsightsintoParallelismwithIntensiveKnowledgeSharing

AshishSabharwalandHorstSamulowitz

TheNon-overlappingConstraintbetweenObjectsDescribedby Non-linearInequalities ............................................

IgnacioSalas,GillesChabert,andAlexandreGoldsztejn

ImprovingRelationalConsistencyAlgorithmsUsingDynamicRelation Partitioning 688

AnthonySchneider,RobertJ.Woodward,BertheY.Choueiry, andChristianBessiere

DomainViewsforConstraintProgramming 705

PascalVanHentenryckandLaurentMichel

GlobalConstraintsinDistributedCSP: ConcurrentGACandExplanationsinABT ......................... 721

MohamedWahbiandKennethN.Brown

TheImpactofWirelessCommunicationonDistributedConstraint Satisfaction ..................................................... 738

MohamedWahbiandKennethN.Brown

AdaptiveParameterizedConsistencyforNon-binaryCSPsbyCounting Supports 755

RobertJ.Woodward,AnthonySchneider,BertheY.Choueiry, andChristianBessiere

ApplicationTrack

ProactiveWorkloadDispatchingontheEURORASupercomputer 765

AndreaBartolini,AndreaBorghesi,ThomasBridi, MicheleLombardi,andMichelaMilano

SchedulingB2BMeetings ......................................... 781

MiquelBofill,JoanEspasa,MarcGarcia,MiquelPalah´ı, JosepSuy,andMateuVillaret

SolvingaJudgeAssignmentProblemUsingConjunctionsofGlobal CostFunctions .................................................. 797

SimondeGivry,JimmyH.M.Lee,KaLunLeung,andYuWaiShum

Worst-CaseSchedulingofSoftwareTasks: AConstraintOptimizationModeltoSupportPerformance Testing 813

StefanoDiAlesio,ShivaNejati,LionelBriand,andArnaudGotlieb

ContinuousCastingSchedulingwithConstraintProgramming 831 StevenGay,PierreSchaus,andVivianDeSmedt

CaseStudy:ConstraintProgramminginaSystemLevelSynthesis Framework ...................................................... 846

ShuoLiandAhmedHemani

SchedulingAgentsUsingForecastCallArrivalsatHydro-Qu´ebec’sCall Centers 862

MariePelleau,Louis-MartinRousseau,PierreL’Ecuyer, WalidZegal,andLouisDelorme

DeploymentofMobileWirelessSensorNetworksforCrisisManagement: AConstraint-BasedLocalSearchApproach ......................... 870

C´edricPraletandCharlesLesire

AirTrafficControllerShiftSchedulingbyReductiontoCSP,SATand SAT-RelatedProblems ........................................... 886

MirkoStojadinovi´ c

JournalPresentationTrack

OptimizationBoundsfromBinaryDecisionDiagrams (ExtendedAbstract) 903

DavidBergman,AndreA.Cir´e,Willem-JanvanHoeve, andJohnN.Hooker

ReformulationBasedMaxSATRobustness(ExtendedAbstract) 908

MiquelBofill,D´ıdacBusquets,andMateuVillaret

ProbabilisticConstraintsforNonlinearInverseProblems (ExtendedAbstract) ............................................. 913

ElsaCarvalho,JorgeCruz,andPedroBarahona

MultivaluedDecisionDiagramsforSequencingProblems (ExtendedAbstract) ............................................. 918

AndreA.Cir´eandWillem-JanvanHoeve

RobustnessandStabilityinConstraintProgrammingunderDynamism andUncertainty(ExtendedAbstract) .............................. 923

LauraCliment,RichardJ.Wallace,MiguelA.Salido, andFedericoBarber

MonotoneTemporalPlanning:Tractability,Extensionsand Applications(ExtendedAbstract) 928

MartinC.Cooper,Fr´ed´ericMaris,andPierreR´egnier

AnytimeAND/ORDepth-FirstSearchforCombinatorialOptimization (ExtendedAbstract) 933

LarsOttenandRinaDechter

View-BasedPropagatorDerivation(ExtendedAbstract) .............. 938

ChristianSchulteandGuidoTack

AModularArchitectureforHybridPlanning withTheories

Dept.Informatics,King’sCollegeLondon,UK maria.fox@kcl.ac.uk

Planningtechnologyhasmadehugestrides,alongsideothercombinatorialoptimisation solvingtechnologies,overthepastdecade.Automatedplanningsystemsnowexistfor temporalandmetricproblems,includingmanagementofcontinuoustimeandconcurrency,continuousnumericresourcesandactioncosts[3,1,2,12,7,8,11,9].Thereisan increasinginterestincombiningplannerswithspecialisedsolvers,suchasoptimisation alogorithms,toachieveahybridformofplanning.Inthiscontext,therelationshipbetweenplanningandmodel-checking,planningandconstraint-solvingandplanningand controlareallbeingclarified.

Synergiesbetweendifferentoptimisationmodellingandsolvingparadigmscanbe exploitedtoachievenewcapabilitiesandimprovedperformanceofsolvers.AnexampleofthisisrecentworkexploitingthedevelopmentsinSATsolving,SATModulo Theories,inwhichatomscanbebuiltfrompredicates,functionsandconstantswhose interpretationsareprovidedthroughexternaltheorymodules[10,5].Inplanning,extensiontosupportexternalmodulesallows amuchricherexpressionofpreconditions andstatevariables.Amotivationforexploringthisideaisthattheincreasedexpressivenesscanallowplannerstoworkwithmodelsofapplicationdomainsusingspecialised solvers,necessaryforreasoningwithinthoseapplications,alongsidethegenericsolvingcoresdevelopedintheplanningcommunity.Sincethisisacommonrequirementof planningapplications,itisimportanttoprovidecleanandwell-understoodmethodsfor linkingplannerstoexternallibraries,choosingheuristicsandexchangingconstraints.

InthistalkwepresentthePlanningModuloTheoriesparadigm,firstproposedin 2012[6],describinghowtheparadigmhasbeenextendedtoincorporatethelatest advancesintemporalplanning.Wediscusshowtheuseofconstraintreasoningcan provideanadditionalsourceofpowerfulsolvingcapabilitieswithinthisframework. Ingeneral,constraintsolversprunechoicesfromthesearchspacebyinference,while mostmodernplannersfocusonheuristicguidanceofthesearchtowardsgoodchoices. Complexinteractionsinresource-constrainedmodelscanbeobscure,makingheuristic evaluationofstatesmuchmoredifficult,whileatthesametimeofferingmoreopportunityforleveragefrominference[13].Weconsider,withreferencetotworealapplicationdomains,howconstraintsolvingcancontributetomakingplannerssuitablefor deploymentinapplications withdemandingrequirements.

Oneoftheimportantchallengesinextendingthecapabilitiesofplannersistocontinuetobeabletoefficientlyvalidateplansanddomainmodels.Wewilldescribehow

Thankstomygenerouscollaboratorsandco-authorswhohavecontributedtothiswork.

B.O’Sullivan(Ed.):CP2014,LNCS8656,pp.1–2,2014.

c SpringerInternationalPublishingSwitzerland2014

theVALsystem[4],developedincrementallyoverthelast10yearsforvalidationof plansanddomainsinthemixeddiscrete-continuousexpressivenessofPDDL+,isnow beingextendedtocopewithricherbehavioursencounteredinthePMTframework.

References

1.Coles,A.,Coles,A.,Fox,M.,Long,D.:COLIN:Planningwithcontinuouslinearnumeric change.JournalofArt.Int.Research44,1–96(2012)

2.Coles,A.I.,Fox,M.,Long,D.,Smith,A.J.:AHybridRelaxedPlanningGraph-LP HeuristicforNumericPlanningDomains.In:Proc.18thInt.Conf.onAutomatedPlanning andScheduling(ICAPS)(2008)

3.Coles,A.J.,Coles,A.I.,Fox,M.,Long,D.:Forward-ChainingPartial-OrderPlanning.In: Proc.20thInt.Conf.onAut.PlanningandScheduling,ICAPS(2010)

4.Fox,M.,Howey,R.,Long,D.:Validatingplansinthecontextofprocessesandexogenousevents.In:Veloso,M.M.,Kambhampati,S.(eds.)Proc.Nat.Conf.onAI,AAAI, pp.1151–1156.AAAIPress/TheMITPress(2005)

5.Gao,S.,Kong,S.,Clarke,E.:SatisfiabilityModuloODEs.In:Proc.FormalMethodsin Computer-AidedDesign,FMCAD(2013)

6.Gregory,P.,Long,D.,Fox,M.,Beck,J.C.:PlanningModuloTheories:ExtendingthePlanningParadigm.In:Proc.22ndInt.Conf.onAutomatedPlanningandScheduling,ICAPS (2012)

7.Ivankovic,F.,Haslum,P.,Thiebaux,S.,Shivashankar,V.,Nau,D.:Optimalplanningwith globalnumericalstateconstraints.In:Proceedingsof24thInt.Conf.onAut.Planningand Scheduling,ICAPS(2014)

8.Lipovetzky,N.,Burt,C.N.,Pearce,A.R.,Stuckey,P.J.:PlanningforMiningOperationswith TimeandResourceConstraints.In:Proceedingsof24thInt.Conf.onAut.Planningand Scheduling,ICAPS(2014)

9.L¨ohr,J.,Eyerich,P.,Winkler,S.,Nebel,B.:DomainPredictiveControlUnderUncertain NumericalStateInformation.In:Proc.23rdInt.Conf.onAutomatedPlanningandScheduling(ICAPS)(2013)

10.Nieuwenhuis,R.,Oliveras,A.,Tinelli,C.:SolvingSATandSATModuloTheories:From anabstractDavis–Putnam–Logemann–LovelandproceduretoDPLL(T).J.ACM53(6), 937–977(2006)

11.Ono,M.,Williams,B.C.,Blackmore,L.:ProbabilisticPlanningforContinuousDynamic SystemsunderBoundedRisk.JournalofAIResearch(JAIR)46,511–577(2013)

12.Penna,G.D.,Intrigila,B.,Magazzeni,D.,Mercorio,F.:Upmurphi:atoolforuniversalplanningonpddl+problems.In:Proc.19thInt.Conf.onAutomatedPlanningandScheduling (ICAPS),pp.19–23(2009)

13.Vidal,V.,Geffner,H.:Branchingandpruning:Anoptimaltemporalpoclplannerbasedon constraintprogramming.Artif.Intell.170(3),298–335(2006)

TeachingConstraintProgramming

SchoolofComputingScience,UniversityofGlasgow,UK pat@dcs.gla.ac.uk

Howdowedoresearch?Westartwithaquestion.Thenwereadbooks,journal andconferencepapers,maybeevenspeaktopeople.Thenwedoourownwork, makeourowncontribution,maybecomingupwithanimprovedtechniqueora greaterinsight.Wethenwriteupourfindings,maybesubmitthistoaconference, presentourworkandgetfeedback,andthisresultsinfurtherresearch.Thisis afeedbackloop,opentoscrutinybyourpeers.

Andwhataboutteaching? You teachyourselfandbecomecompetent. You decidehowtoteachyoursubject. You thenteachandmarkstudents. You analyze students’performanceandusethistomodifywhatyouteach. You continueto learnyoursubjectandusethisnewknowledgetomodifyyourteaching.Again, thereisafeedbackloop.Butitisaclosedloop,inthesensethatnoonereally getstocritiquewhat you do.IfyouareteachingConstraintProgramming(CP) itisunlikelythattherearemanyteachingcolleagueswhocanactuallyevaluate whatyouaredoing,otherthanlookingatthefinalexammarks.Soyoucan wanderofftopic,awayfromthetargetandthiscanbedangerous.

IamfortunateenoughtobeallowedtoteachCPtofinalyearandmasters studentsatGlasgowUniversity.Ihavebeendoingthisforabout10years.What IteachandhowIteachhasevolvedover time.Inowrecognizesomethingsthat IdidthatwereclearlywrongandsomethingsthatIdidthatwerereallygood.I knowthatIdonotteachinavacuum,thatmystudentstakemanyothercourses. SoItryandidentify stuff thatIthinkaConstraintProgrammershouldknow thatisnotbeingtaughtinothercourses.Consequently,myCPcoursecontains stuff thatmightbeconsideredunusual.Ialsoexpectthatthere’s stuff thatI shouldteachbutdonot.

InmytalkIwilldescribethecontentofmyCPcourse(thestuffofit),some thingsIhavedonewrongandsomethingsthatreallyworkwell.Iwillcover lecturematerial,assessedexercisesandevenexamquestions!Inessence,Iwill openmyfeedbackloopallowing you togive me feedbackonwhatIteach.

Acknowledgments. Iwouldliketothankmystudents. B.O’Sullivan(Ed.):CP2014,LNCS8656,p.3,2014.

OneProblem,TwoStructures,SixSolvers, andTenYearsofPersonnelScheduling

CIRRELT, ´ EcolePolytechniquedeMontr´eal,Montr´eal, C.P.6128,succ.Centre-ville,Montr´eal,H3C3J7,Canada louis-martin.rousseau@polymtl.ca

Theshift-schedulingproblemwasoriginallyintroducedbyEdiein1954[8]in thecontextofschedulinghighwaytollboothoperators.Itwassolvedashort timelater,byGeorgesDantzig[6],usingasetcoveringformulation.However, theMulti-ActivityShiftScheduling(MASSP)versionofthatproblem,where onenotonlyneedstoschedulewhenemployeesareworkingorresting,butmore precisely,whatactivitytheyareperforming,stillremainsachallenge.During thisinvitedlecture,wewillrecalltheturningpointsofthis60-yearjourney, focusingparticularlyontheeffortsofthelastdecadetosolveMASSPs.

ThefirstbreakthroughcamefromConstraintProgramming(CP),withthe introductionoftheRegularLanguageMembershipConstraint[13,1],whichenabledustospecifyshiftregulationsthroughDeterministicFiniteAutomata. Twoyearslater,theContext-freeGrammarConstraint[15,18]wasintroduced, shortlyfollowedbybothadecomposedformulation[16]andincrementalfilteringalgorithm[11].Fromtheseconstraintsitispossibletoidentifytwonetwork structures(pathsinalayereddirectedacyclicgraphfor Regular andhyper-paths inahyper-graphfor Grammar ).

Usingthesegraphstructures,MixedIntegerProgramming(MIP)modelswere initiallyproposed[3]toaddresstheMASSP.ThankstoOrbitalShrinking[9], anewMIPformulation[4],andhybridCP-MIPbranchandbound[17]were proposedwhichallowedustosolvethesemodelsmoreefficiently.

DynamicProgramming(DP)algorithmswerealsodevelopedtooptimize(find theshortestpathsandhyper-paths)forboth Regular and Grammar giventhat marginalcostsareassociatedwithperformingcertainactivitiesatagiventime. ThesecostscanbeestimatedmanuallyduringaLargeNeighbourhoodSearch (LNS)[14]orobtainedthroughdualvaluesinthecontextofaBranch-and-Price approach[7,5].FinallyLazy-ClauseGeneration(LCG)withinCP[10]hasshown toproduceverygoodresultsforasubsetofthebenchmarkoriginallyintroduced in[7].

Fromapracticalpointofview,theconceptsof[5]wereimplementedinto commercialsoftware(Planora ),whilethemodelsusingthedecompositionof Regular wereusedincasestudiesinvolvingamajorfashionretailer[2]and HydroQu´ebec’slargecallcenter[12].

References

1.Beldiceanu,N.,Carlsson,M.,Petit,T.:Derivingfilteringalgorithmsfromconstraintcheckers.In:Wallace,M.(ed.)CP2004.LNCS,vol.3258,pp.107–122. Springer,Heidelberg(2004)

2.Chapados,N.,Joliveau,M.,L‘Ecuyer,P.,Rousseau,L.M.:RetailStore SchedulingforProfit.EuropeanJournalofOperationsResearch(2014), doi:10.1016/j.ejor.2014.05.033

3.Cˆot´e,M.C.,Gendron,B.,Quimper,C.G.,Rousseau,L.M.:Formallanguagesfor integerprogrammingmodelingofshiftschedulingproblems.Constraints16(1), 54–76(2011)

4.Cˆot´e,M.C.,Gendron,B.,Rousseau,L.M.:Grammar-basedintegerprogramming modelsformultiactivityshiftscheduling.ManagementScience57(1),151–163 (2011)

5.Cˆot´e,M.C.,Gendron,B.,Rousseau,L.M.:Grammar-basedcolumngeneration forpersonalizedmulti-activityshiftscheduling.INFORMSJournalonComputing25(3),461–474(2013)

6.Dantzig,G.:AcommentonEdie’strafficdelayattollbooths.Journalofthe OperationsResearchSocietyofAmerica2,339–341(1954)

7.Demassey,S.,Pesant,G.,Rousseau,L.M.:Acost-regularbasedhybridcolumn generationapproach.Constraints11(4),315–333(2006)

8.Edie,L.:Trafficdelaysattollbooths.JournaloftheOperationsResearchSociety ofAmerica2,107–138(1954)

9.Fischetti,M.,Liberti,L.:Orbitalshrinking.In:Mahjoub,A.R.,Markakis,V., Milis,I.,Paschos,V.T.(eds.)ISCO2012.LNCS,vol.7422,pp.48–58.Springer, Heidelberg(2012)

10.Gange,G.,Stuckey,P.J.,VanHentenryck,P.:ExplainingPropagatorsforEdgeValuedDecisionDiagrams.In:Schulte,C.(ed.)CP2013.LNCS,vol.8124,pp. 340–355.Springer,Heidelberg(2013)

11.Kadioglu,S.,Sellmann,M.:Grammarconstraints.Constraints15(1),117–144 (2010)

12.Pelleau,M.,Rousseau,L.-M.,L’Ecuyer,P.,Zegal,W.,Delorme,L.:Schedulingof AgentsfromForecastedFutureCallArrivalsatHydro-Qu´ebec’sCallCenters.In: PrinciplesandPracticeofConstraintProgramming,CP2013,Springer,Heidelberg (2014)

13.Pesant,G.:Aregularlanguagemembershipconstraintforfinitesequencesofvariables.In:Wallace,M.(ed.)CP2004.LNCS,vol.3258,pp.482–495.Springer, Heidelberg(2004)

14.Quimper,C.G.,Rousseau,L.M.:Alargeneighbourhoodsearchapproachtothe multi-activityshiftschedulingproblem.JournalofHeuristics16(3),373–392(2010)

15.Quimper,C.G.,Walsh,T.:Globalgrammarconstraints.In:Benhamou,F.(ed.) CP2006.LNCS,vol.4204,pp.751–755.Springer,Heidelberg(2006)

16.Quimper,C.G.,Walsh,T.:Decomposingglobalgrammarconstraints.In:Bessi`ere, C.(ed.)CP2007.LNCS,vol.4741,pp.590–604.Springer,Heidelberg(2007)

17.Salvagnin,D.,Walsh,T.:AhybridMIP/CPapproachformulti-activityshift scheduling.In:Milano,M.(ed.)CP2012.LNCS,vol.7514,pp.633–646.Springer, Heidelberg(2012)

18.Sellmann,M.:Thetheoryofgrammarconstraints.In:Benhamou,F.(ed.)CP 2006.LNCS,vol.4204,pp.530–544.Springer,Heidelberg(2006)

ConcurrentConstraintProgrammingResearch Programmes–Redux

IBMTJWatsonResearchCenter,Yorktown,Heights,NY,USA

AtthefirstPPCPconferencein1995,Iwashonoredtobeoneoftheinvitedspeakers. Twentyconferenceslater,muchhaschangedinthecomputationalworld.Wehaveseen thepenetrationoftheInternetineveryaspectofhumanlife;theestablishmentofthe multi-coreera;thearrivalofpetaflophighperformancecomputing;theriseofbigdata, analyticsandmachinelearning;andtheemergenceoftheplanet-widecomputer(the “cloud”).

Withthisbackdrop,wereviewthemanydevelopmentsinCCPoverthelasttwenty years,andrevisitthecoreideabehindthisframework:theuseofconstraintsforcommunicationandcontrolinconcurrentprogramminglanguages.Surprisingly,inthisage ofconcurrencyandbigdata,theseideasremainfoundational.CCPremainsthepremierframeworkfordeterminateconcurrency.Bysupportingthenotionofconcurrent compositionasintersectionofsetsof(constraint)storesratherthanshufflingofsetsof interleavedstoresequences,itoffersinterestingnewideas(declarativedebugging[9,1], diagnosis[7])todealwiththeproblemofdebuggingconcurrentprogramsrunningon tensofthousandsofcores.Interestingly,theseideasworkeveninthepresenceofglobal non-monotonicchange(andhencesupport“constraintimperativeprogramming”[8]); thisisaccomplishedbyintroducingatempor almodalityinaprincipledfashion[15] andusingsoftconstraints[2].

Concretely,wereviewthegoalsoftheC10project,beingstartedincollaborationbetweenresearchersatIBMTJWatsonandmanyuniversitiesworld-wide.C10isintended foruseintheareasofconstraint-solving,probabilisticprogramming,machinelearning, andbigdataanalytics.Itisapure,declarative,implicitlyconcurrent,statically-typed, object-oriented,timed,probabilistic[11,10]realizationoftheCCPframework.C10is intendedtobecompiledtothehigh-performance,multi-node,concurrentprogramming languageX10[5],butdoesnotitselfhaveanyexplicitconcurrencyordistributionconstructs.C10permitsrecursivequeriesagainsttheconstraintstore(basedon[12]),thus subsumingpure(constraint)logicprogramming.Itproposesnewindexicals(cf[17]), includingset-formingoperationsthatmakeiteasytowriteadhocqueriesoverlarge datasets.Itexploitsrandomvariables([11,10])torepresentvariousprobabilisticgraphicalmodels(Bayesiannetworks,Markovnetworks,probabilisticCPnets[4,6])directly asprograms.

WeexpectC10tobringintofocusseveralimplementationchallenges.Besidesthe traditionalchallengesofimplicitparallelism(staticallyanddynamicallychunkingfinegrainedparallelismintosizesadequateforefficientexploitationontoday’smulti-core architectures,[16]),C10requiresthedevelopmentofefficient,incrementalconstraint queryproceduresovertheconstraintstore(cfquerycompilationchallengesof[3,13]). Itrequirestheintegrationofmultiple,efficient,probabilisticinferenceproceduresinto

B.O’Sullivan(Ed.):CP2014,LNCS8656,pp.6–8,2014.

c SpringerInternationalPublishingSwitzerland2014

therun-time.Basedonthequerybeingasked,themodel,andthetrainingdataavailable, therightcombinationofinferenceprocedurestousemayhavetobedetermineddynamically(e.g.usingideasfromworkonautomaticalgorithmconfigurationandselection procedures[14]).

References

1.Ajiro,Y.,Ueda,K.:Kima:AnAutomatedErrorCorrectionSystemforConcurrentLogic Programs.AutomatedSoftwareEngg.9(1),67–94(2002)

2.Bistarelli,S.,Montanari,U.,Rossi,F.:SoftConcurrentConstraintProgramming.ACMTrans. Comput.Logic7(3),563–589(2006)

3.Boag,S.,Chamberlin,D.,Fernandez,M.,Florescu,D.,Robie,J.,Simeon,J.:XQuery1.0:An XMLQueryLanguage.Technicalreport,W3C(2003), http://www.w3.org/TR/xquery

4.Boutilier,C.,Brafman,R.I.,Domshlak,C.,Hoos,H.H.,Poole,D.:CP-nets:AToolforRepresentingandReasoningwithConditionalCeterisParibusPreferenceStatements.J.Artif. Int.Res.21(1),135–191(2004)

5.Charles,P.,Grothoff,C.,Saraswat,V.,Donawa,C.,Kielstra,A.,Ebcioglu,K.,vonPraun, C.,Sarkar,V.:X10:anObject-OrientedApproachtoNon-uniformClusterComputing.SIGPLANNot.40(10),519–538(2005)

6.Cornelio,C.,Goldsmith,J.,Mattei,N.,Rossi,F.,Venable,K.B.:UpdatesandUncertainityin CP-nets.In:ProceedingsoftheAustralianConferenceonArtificialIntelligence,pp.301–312 (2013)

7.Falaschi,M.,Olarte,C.,Palamidessi,C.,Valencia,F.:DeclarativeDiagnosisofTemporalConcurrentConstraintPrograms.In:Dahl,V.,Niemel¨a,I.(eds.)ICLP2007.LNCS, vol.4670,pp.271–285.Springer,Heidelberg(2007)

8.Freeman-Benson,B.N.:Kaleidoscope:MixingObjects,Constraints,andImperativeProgramming.In:ProceedingsoftheEuropeanConferenceonObject-orientedProgramming onObject-orientedProgrammingSystems,Languages,andApplications,OOPSLA/ECOOP 1990,pp.77–88.ACM,NewYork(1990)

9.Fromherz,M.P.J.:TowardsDeclarativeDebuggingofConcurrentConstraintPrograms.In: Fritzson,P.A.(ed.)AADEBUG1993.LNCS,vol.749,pp.88–100.Springer,Heidelberg (1993)

10.Gupta,V.,Jagadeesan,R.,Panangaden,P.:StochasticProcessesasConcurrentConstraint Programs.In:Proceedingsofthe26thACMSIGPLAN-SIGACTonPrinciplesofProgrammingLanguages,POPL1999,SanAntonio,TX,January20-22,pp.189–202.ACMPress, NewYork(1999)

11.Gupta,V.,Jagadeesan,R.,Saraswat,V.:ProbabilisticConcurrentConstraintProgramming. In:Mazurkiewicz,A.,Winkowski,J.(eds.)CONCUR1997.LNCS,vol.1243,pp.1–4. Springer,Heidelberg(1997)

12.Jagadeesan,R.,Nadathur,G.,Saraswat,V.:TestingConcurrentSystems:anInterpretation ofIntuitionisticLogic.In:Sarukkai,S.,Sen,S.(eds.)FSTTCS2005.LNCS,vol.3821,pp. 517–528.Springer,Heidelberg(2005)

13.Khatchadourian,S.,Consens,M.,Sim´eon,J.:Chuql:ProcessingXMLwithXQueryUsing Hadoop.In:Proceedingsofthe2011ConferenceoftheCenterforAdvancedStudieson CollaborativeResearch,CASCON2011,Riverton,NJ,USA,pp.74–83.IBMCorp.(2011)

14.Kothoff,L.,Malitsky,Y.,O’Sullivan,B.:AdvancesinAlgorithmSelectionandConfiguration forConstraintSolvingandSatisfiability.In:Tutorial atIJCAI2013(2013)

15.Saraswat,V.,Jagadeesan,R.,Gupta,V.:TimedDefaultConcurrentConstraintProgramming. JournalofSymbolicComputation22(5-6),475–520(1996);Extendedabstractappearedin theProceedingsofthe22ndACMSymposiumonPrinciplesofProgrammingLanguages, SanFrancisco(January1995)

16.Ueda,K.,Morita,M.:ModedFlatGHCandItsMessage-orientedImplementationTechnique. NewGen.Comput.13(1),3–43(1994)

17.vanHentenryck,P.,Deville,Y.,Saraswat,V.:Design,ImplementationandEvaluationofthe ConstraintLanguagecc(FD).JournalofLogicProgramming37(1-3),139–164(1998)

Another random document with no related content on Scribd:

The Project Gutenberg eBook of Modern houseplans for everybody

This ebook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this ebook or online at www.gutenberg.org. If you are not located in the United States, you will have to check the laws of the country where you are located before using this eBook.

Title: Modern house-plans for everybody

Release date: August 7, 2022 [eBook #68706]

Language: English

Original publication: United States: Orange Judd Company, 1900

Credits: Charlene Taylor and the Online Distributed Proofreading Team at https://www.pgdp.net (This file was produced from images generously made available by The Internet Archive)

START OF THE PROJECT GUTENBERG EBOOK MODERN HOUSE-PLANS FOR EVERYBODY ***

Transcriber’s Note: Illustrations have been moved to the end of each chapter

Modern HOUSE-PLANS For Everybody

FOR VILLAGE AND COUNTRY RESIDENCES

COSTING FROM TWO HUNDRED AND FIFTY DOLLARS TO EIGHT THOUSAND DOLLARS Including Full Descriptions and Estimates in Detail of Materials, Labor, Cost and Many Practical Suggestions

New York ORANGE JUDD COMPANY

1900 Copyright, ORANGE JUDD COMPANY, 1900

PREFACE.

In the modernized and revised edition of “House-Plans for Everybody,” but little attempt has been made to change the text or floor plans, as these are standard features requiring no revision. In the matter of outward dress, however, nearly all the elevations have been redrawn, with special regard to modern ideas and tastes, and in this respect it is specially new and commendable. The author has been guided in this work by many years’ experience, in planning and superintending the erection of country buildings, and has selected, from an extensive aggregation of original designs in his possession, such examples as seemed best to serve for purposes of simplicity, comfort, and economy All the matters here presented are purely practical—well calculated to assist such as are contemplating the erection of either a village or country house. The plans embrace almost every variety of arrangement and style—each one is accompanied with a detailed description of its conveniences and construction—and its cost is shown by careful estimates, made to correspond with a uniform standard of prices, at present rates. To builders, this work will be valuable as a handbook of reference, to aid them when applied to for suggestions, either in the projection of new dwellings, or in the alteration of old ones, saving much time, study and calculations. The estimates of cost have been found correct as to totals, in the neighborhood of New York, and in many other localities builders have offered to duplicate the structures for the figures given.

DESIGN NO. I.

, $250.

Accommodations for Beginners in House-Keeping, with Limited Means. Arranged as the Wing of a future Main House. First Steps. 9

DESIGN NO. II.

, $450.

Approximating the Cheapest Construction. Roofs must not be slighted. Their Relative Cost. Suggestions as to Inside Linings. 12

DESIGN NO. III.

, $550.

Effect of Angles and Vertical Lines. New form of Radiator, with Designs and Description. A Durable Wash for rough work. 17

DESIGN NO. IV.

, $550.

Adapted to an Eastern Frontage. Good accommodations for a small family. May have a Vestibule in Piazza. Exterior Plastering. 22

DESIGN NO. V.

, $650.

Little required to build a comfortable home. Saving by use of regular sizes of Sash, Doors, etc. Novelty Siding. Gutters. Desirability, and Cost of Hanging Sash. 26

DESIGN NO. VI.

, $700.

Providing for future Enlargement. Framework below the First Floor. Section of Frame, with Description. Cornice. 33

DESIGN NO. VII.

, $750.

Fair Expression of Purpose. Best Results from Location. Outside Plastering. Stearate of Lime. Formula for Making. 39

DESIGN NO. VIII.

, $800.

Enlargement of Design No. 1. Best use of the Space. Short Spans, and Bridging of Beams. Suggestions as to Location. 44

DESIGN NO. IX.

, $1,000.

Cosy and Homelike. Style Determined by the Form of Roof. Modes of Plastering. Advantages of the One-coat work. 49

DESIGN NO. X.

, $1,100.

Adapted to a Twenty-five Foot Lot. Trim Outline. No Waste in Materials. Pitch of Roofs. Ventilator and Scuttle combined. 54

DESIGN NO. XI.

, $1,600.

Practical Experience Valuable in Planning. Conventional Requirements. A Fifth House. Section of Outside Wall, and Description. 62

DESIGN NO. XII.

, $1,700.

Important Features in Exterior. Care in Foundations. Regular versus Balloon Framing. Painting. 69

DESIGN NO. XIII.

, $2,000.

For thickly settled localities. Enlivened Dressing. Purpose of Ornament. Bracing of Frame. Taste in Painting. 76

DESIGN NO. XIV.

, $2,000.

Conforming to a Declivity Outlines of Grounds Tower-like Corner, Supported by a Column Weight of Slate, and Tin 82

DESIGN NO. XV.

, $2,000.

Extended Area of Ground Floor Requirements for Shade Preparations for Severe Weather Food Department 86

DESIGN NO. XVI.

, $2,100.

Pointed Style in harmony with rural surroundings Earth Finish around Foundation Exhausting poisonous vapors from cellars 92

DESIGN NO. XVII.

, $2,200.

The most Economical Form High Foundations Surrounding Grades Bridging Beams Stairs Why Contractors differ Who qualified to estimate 98

DESIGN NO. XVIII.

, $2,200.

Style adapted to Middle and Southern States Tower Verandas Windows extending to the Floor Ventilation 105

DESIGN NO. XIX.

, $2,500.

Balance in Outlines Site Cellar, how sweetened Plant Window, with Contents Reflected Drudgery of Housework 111

DESIGN NO. XX.

, $2,600.

Suited to a Southern Climate Double Front May face any point of Compass Detailed Estimate of Windows and Doors 115

DESIGN NO. XXI.

, $2,600.

Economical and Practical Size and Shape Direction to Face Hight above Ground —Cause of Decay in Principal Timbers — Paving instead of flooring Shed 120

DESIGN NO. XXII.

, $2,800.

Advantages of Square Form —Rounded Roof Outlines —New Modification of Mansard Roof —Front Hall Dispensed with — Chimneys to Save Heat. 128

DESIGN NO. XXIII.

, $2,800.

Suited to the Wants of Professional Men —Outlines and Dress — Good Taste.—Rule for Projections.—Slate.—Estimate in Detail for Plastering. 134

DESIGN NO. XXIV.

, $2,800.

Questions Involved in Locations.—Distance from the Street to Build. Seeming Growth of the Earth. Superintending Construction. Points. 140

DESIGN NO. XXV.

- , $2,800.

Rustic and Substantial. Front and Rear Finish. Construction. Confined Sewage. Prices of Building Materials. 147

DESIGN NO. XXVI.

, $2,900.

External Features.—Spreading out.—Direction to Face.—An Auxiliary Apartment. Building a Section at a Time. Reducing the Cost. 152

DESIGN NO. XXVII.

, $2,900.

Solid, Independent, and Homelike.—Vines and Creepers for Decoration. Manner of Building Corners, with Designs and Description. 158

DESIGN NO. XXVIII.

, $3,000.

Suburban Cottage, with Modern Improvements. High Foundations. Large Rooms. Platform Stairs. Low-down Grates. Coal-lift. 164

DESIGN NO. XXIX.

, $3,100.

Summer Residence, with Principal Rooms in the Rear. Parlor and Piazza for Use together. Well, How Constructed. 171

DESIGN NO. XXX.

, $3,300.

Indestructible Covering. Design Showing Method of Construction, with Description. Economical Plumbing. 175

DESIGN NO. XXXI.

, $3,700.

Residence or Parsonage. Three Elevations. Nearly Square Ground-Plan. Arranged Similar to Double House. 180

DESIGN NO. XXXII.

, $4,000.

Double Front. Bay Windows. Circular Window Heads. Preventing drafts. Fire-place Heaters. Plumber’s Work in Detail. 187

DESIGN NO. XXXIII.

, $4,000.

Compact Outline. Vestibule Doors. Vertical Side Walls in Mansard Roof. Design of Frame, with Description. 196

DESIGN NO. XXXIV.

, $4,750.

Perspective View. Physicians’ Office. Laboratory. Water Reservoir. Fountain. Heaters and Grates. 203

DESIGN NO. XXXV.

, $4,000.

Mansard Roofs. Variety. Conservatory. Roofing Materials foreign 205

to each other. Furnace.

DESIGN NO. XXXVI.

, $5,000.

Hooded Style. Main Entrance from two directions. Position of Kitchen Wing. Conservatory. Beam Filling. 209

DESIGN NO. XXXVII.

, $7,000.

Outlines determined by location. Irregularities. Pleasantest Apartments. Arches. Concrete Floors. Parquet Floors. 214

DESIGN NO. XXXVIII.

, $8,000.

Perspective View. Modern Improvements. Five Story Tower. Dormer Windows. School Room. Remarks on Style. 220

DESIGN NO. XXXIX.

, $6,000.

Building in Blocks. What is Saved. Overcoming many objections. Preserving their identity as Cottages. Deafening Partitions. 227

DESIGN NO. XL.

, $10,000.

Residence. Corner-Stone. Observatory. Desirability. Imposing and animated. Full Specifications of Plumber’s Work. 232

DESIGN I.

A COTTAGE, COSTING $250.

This plan was designed for a simple cottage, with sufficient accommodations for beginners in housekeeping with limited means. It is arranged as the Wing of a larger house to be erected in the future, as indicated in the dotted sketch adjoining the ground-plan. (The building, with the proposed enlargements complete, are given in Design VIII.) To a certain extent, one’s dwelling is an index of his character. Any effort at building expresses the owner’s ability, taste, and purpose. Every industrious man, starting in life, has a right, and should be encouraged, to anticipate prosperity, as the sure reward of honest worth; and he may, with propriety, give emphasis to such anticipations in every step, and with every blow struck. His dwelling may well express the progressive character, rather than a conclusive result. Beginning a home by starting with a room or two, as present means will allow, and increasing its dimensions as can be afforded, without the precarious aid of the money-lender, is honest, independent, and best provides against the ever-changing vicissitudes of life. The first step towards building is the preparation of plans. These should be sufficiently comprehensive to embrace all probable requirements. If only a small beginning is intended, it should be made to exhibit some degree of completeness, and be arranged to conform with the proposed future enlargements without serious alterations.... E, (fig. 1).—In view of the relation this structure is to bear to a proposed main house, and to allow for the grading likely to be required in the ultimate completion of the whole, the foundation is made to show four feet above the ground. Such elevation adds to the prominence and good appearance of the building, and relieves the interior from the dampness likely to result from a closer contact with the soil. The style is simple, neat, and favorable for the using of ordinary materials and methods of construction.... I, (fig. 2).—Hight of ceiling, 9 feet. The entire

floor space is utilized in the three convenient divisions—a Livingroom, Bedroom, and a Large Pantry—with no chimney-breast, or stairway to interfere. Each room is pleasantly lighted, and the larger one has outside entrances front and rear. With a favorable location, the living-room may be made a very cheerful apartment.... C.—For economy, and in prospect of a future enlargement, that shall include ample cellars, such excavations are omitted for this building. The Foundations are brick piers, extending in the earth below the reach of frost, and 4 feet above, and the intermediate spaces are close-boarded, making an inclosure useful for many purposes. If desired, a sort of temporary cellar may be made, by deepening the central portion of this inclosure a foot or two, and banking the loose earth against the inside of the boarding. The Framework and other parts are substantially constructed, of materials as indicated in the appended estimate. The Chimney rests on the central partition (which is strengthened by the central pier of the foundation), and has two flues, with metal thimbles in the bottom of each—one to receive the stove-pipe from the living-room, and the other to serve as a ventilator for the bedroom. All of the materials are intended to be of merchantable quality. The siding, flooring, and casings are mill-dressed. The sizes of the sash are 2 ft. 8 in. × 5 ft. 2 in., and of the doors, 2 ft. 8 in. × 6 ft. 8 in., all 1¼ in. thick, and may be found ready-made, and seasoned, in the stock of any regular dealer.... In the following estimate, the item of $20, for carpenter’s labor, may seem very little. This amount is allowed for preparing the building ready for the plasterer, and is entered in this manner for convenience in making the calculations. Adding to the above amount the cost of such labor in the “completed” parts, will make a total of $50.

E, cost of materials and labor:

1,000 bricks, laid, at $12 per M. $12.00

124 yards plastering, at 20c. per yard. 24.80

636 ft. of timber, at $15 per M. 9.54

2 sills, 4 × 6 in. 18 ft. long.

1 girder, 4 × 6 in. 18 ft. long.

2 sills, 4 × 6 in. 16 ft. long.

9 beams, 3 × 6 in. 16 ft. long.

4 posts, 4 × 6 in. 10 ft. long.

14 ceiling boards, 2 × 4 in. 16 ft. long.

75 wall-strips, 2 × 4 × 13, at 11c. each. 8.25

98 siding, 9½ inches, at 25c, each. 24.50 Cornice materials. 6.00

50 shingling lath, at 5c. each. 2.50

6 shingling planks, at 20c. each. 1.20

12 bunches shingles, at $1.25 per bunch. 15.00

36 flooring, 9½ in., at 25c. 9.00

7 windows, complete, at $6. 42.00

4 doors, complete, at $5. 20.00

2 stoops and closets, complete. 20.00 Nails, $4; painting, $14; carting, $5. 23.00 Carpenter’s labor, not included above. 20.00

Incidentals. 12.21

Total cost. $250.00

Fig. 1. .

2

Fig

DESIGN II.

COUNTRY COTTAGE, COSTING $450 TO $550.

This plan of an inexpensive country dwelling is adapted to the wants of many people whose circumstances will not admit of a larger outlay. It was originally prepared and published in response to many calls for very low-priced country houses, “some as cheap as lumber and nails can make them.” The present one approximates that point, and will aid in devising others.... T E are given for the same ground-plan; the first (fig. 3) is for a one-story house of the simplest design, with an entrance door, a neat porch, and two windows in front. The rear is arranged similarly. The roof is conspicuous, in keeping with its importance. No matter how cheaply one proposes to build a house, it is essential not to slight the roof. A roof fit for a one-story cottage would answer equally well on a threestory house, so that relatively the cost of this part becomes greater, as the other parts become reduced and cheapened.... GP, (fig. 4).—The accommodations are quite sufficient for a small family, consisting of three rooms, two lobbies, a kitchen-pantry, and a clothes-press. The Lobbies protect the rooms from direct contact with the outside doors. The Living-room is large, and accessible alike from each entrance; it has windows front and rear, and is convenient to the pantry; one entire side is unbroken, giving additional space for furniture, etc. The Pantry is shelved on two sides, and has a sash opening from the rear lobby, receiving light through the head-light over the rear entrance door. The front Bedroom is of good size— large enough to be used as a sitting-room; it adjoins the rear bedroom, and a clothes-press, and has a window facing the road. The rear Bedroom is the most retired, and has a window looking to the rear. The Press or closet is shelved and hooked in the usual manner. The door between the bedrooms might be dispensed with, but its convenience more than repays its cost.... C. The Foundations are of common stone and mortar, laid in trenches,

so as not to be affected by frost, and show 1½ feet above ground. The supports for the central partitions are stone piers, 4 feet apart. The Chimneys are of hard brick and mortar, passing through the first story in two flues, but joined together beneath the roof, and finished above as a single chimney. All the timber of the exterior frame is of 4 × 6-inch spruce. The sills are laid flatways on the foundation, and the upright frame-work stands upon them. The beams are of 1¼ × 8-inch spruce planks; they are notched 4 inches, to fit on the sill, and bear on the foundation, and are nailed to the studding and sills, binding the whole together The ceiling-strips are of 1¼ × 5-inch spruce, resting on the ties, and nailed to the studding. The rafters are 2 × 4inch wall-strips. All beams, studding, and rafters, are placed 16 inches apart from centers. The siding is of 10-inch dressed pine. The roof is covered with 18-inch pine shingles, laid on 1¼ × 2-inch shingling-lath. The porch-frame is of dressed and cornered timber, and is roofed with shingles on flooring laid face down. The flooring is 1⅛ × 9-inch spruce “milled.” The interior is plainly cased: for doors and windows, 3¼ inches wide; base, 6 inches; chair-back in the living-room, 3 inches; all beveled. All sashes and doors are 1¼ inch thick. The interior side-walls and ceilings are white-sand finished, on brown mortar and seasoned lath. Many efforts have been made to devise something cheaper than plastering for the inside lining of walls, but no substitute has yet been found to equal it in cheapness or durability. Plastering, as usually prepared and applied, conduces to the healthfulness of any apartment, emits no odor of mouldiness, has no attraction or harbor for vermin, is impervious to air, and a non-conductor of sound. Where linings of thin wood or paper are used, it is necessary to deafen the partitions and ceilings, otherwise they will be noisy. Sound made in any one part will reverberate through the house with drum-like suggestiveness. Most of such materials absorb moisture rapidly from the atmosphere, and when at any distance from the house-fires, so as not to be warmed and dried, the moisture is retained in them. This is especially the case in chambers and closets. Rather than seek a substitute for plastering, it is better to extend its use, and, where practicable, apply it as an outside covering, as well as for inside linings, as described for Design VI. The S E, (fig. 5,) shows an enlargement

Turn static files into dynamic content formats.

Create a flipbook
Issuu converts static files into: digital portfolios, online yearbooks, online catalogs, digital photo albums and more. Sign up and create your flipbook.