Courserequirements
1. Decideaproblemtobesolvedandconsultits
appropriatenesswiththeteacher.
2. Solvetheproblem.Theoutputforcoursecredit
consistsof
code inSICStus Prologwithaconstraintmodel
exampledata
documentation withthefollowingsections
–
–
–
•
•
•
•
precise(formal)descriptionoftheproblem
completeabstractdescriptionoftheconstraintmodel
“usermanual”– howtoruntheprogram
resultsofexperiments(differentmodels,differentsearch
strategies,differentdata)
PartialDigestProblem
DNA is cut at several locations by an application
of enzyme. We know distances between all the
cuts and we look for the exact positions of the
cuts. Propose a constraint model to solve the
problem.
Examplesofproblems
•
•
•
•
•
•
•
•
•
Pathfindingformultipleagents
Pathfindingforacleaningrobot
generalschedulingwithunaryresources(JSSP)
dinnerpartyproblem
socialgolferproblem
peaceablearmiesofqueens
openstacksproblem
2Dproteinfolding
…
DoubleDigestProblem
AssumethatDNAiscutbyanenzymeandweknow
distancesbetweenneighboringpointsai – ai-1.Now
adifferentenzymecutsDNAatdifferentpointsbj
andagainweknowthedistancesbi – bi-1.Finally,
bothenzymesareappliedtogetherandDNAiscut
inallpointsai andbi sowegetpointsci andagain,
weknowthedistancesci – ci-1 (notethatsome
pointsai andbj myoverlapsothenumberofpoints
ck maybesmallerthanthesumofthenumbersof
pointsai andbj).Fromthemultisets ofdistancesΔa,
Δb,andΔc,findtheallthecuttingpointsai,bj,ck.