Andrew M . Cheadle Warwick Harvey Andrew J . Sadler Joachim Schimpf

IC-PARC Centre for Planning and Resource Control

Technical Report Ic-Parc-03-1 E S Cl P

SCL P ei A Tutorial Introduction

ion before(task(Si,Di), task(Sj,Dj)) :Si+Di #<= Sj. Conjunction between(X,Y,Z) :X #< Y, Y #< Z. Disjunction (but see below) neighbour(X,Y) :( X #= Y+1 ; Y #= X+1 ). Iteration not_among(X, L) :( foreach(Y,L),param(X) do X #\= Y ). Recursion not_among(X, []). not_among(X, [Y|Ys]) :X #\= Y, not_among(X, Ys). 11.4 Same Problem Different Model There are often many ways of modelling a problem. Consid...

E CL PS e A Tutorial Introduction

ion before(task(Si,Di), task(Sj,Dj)) :Si+Di #<= Sj. Conjunction between(X,Y,Z) :X #< Y, Y #< Z. Disjunction (but see below) neighbour(X,Y) :( X #= Y+1 ; Y #= X+1 ). Iteration not_among(X, L) :( foreach(Y,L),param(X) do X #\= Y ). Recursion not_among(X, []). not_among(X, [Y|Ys]) :X #\= Y, not_among(X, Ys). 11.4 Same Problem Different Model There are often many ways of modelling a problem. Consid...

M.G.: ECLiPSe: A tutorial introduction

ion before(task(Si,Di), task(Sj,Dj)) :Si+Di #<= Sj. Conjunction between(X,Y,Z) :X #< Y, Y #< Z. Disjunction (but see below) neighbour(X,Y) :( X #= Y+1 ; Y #= X+1 ). Iteration not_among(X, L) :( foreach(Y,L),param(X) do X #\= Y ). Recursion not_among(X, []). not_among(X, [Y|Ys]) :X #\= Y, not_among(X, Ys). 11.4 Same Problem Different Model There are often many ways of modelling a problem. Consid...