Newsgroups: comp.constraints
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!godot.cc.duq.edu!news.duke.edu!news.mathworks.com!news.kei.com!nntp.coast.net!howland.reston.ans.net!psinntp!psinntp!psinntp!uknet!newsfeed.ed.ac.uk!dcs.ed.ac.uk!flugga.dcs.ed.ac.uk!jbs
From: jbs@dcs.ed.ac.uk (Joshua Singer)
Subject: A question about cuts and constraints in CLP.
X-Nntp-Posting-Host: flugga.dcs.ed.ac.uk
Message-ID: <Dqozp2.1xu.0.staffin.dcs.ed.ac.uk@dcs.ed.ac.uk>
Sender: jbs@flugga.dcs.ed.ac.uk (Joshua Singer)
Organization: Department of Computer Science, University of Edinburgh
X-Newsreader: xrn 8.00
Date: Tue, 30 Apr 1996 20:31:47 GMT
Lines: 14

This is a technical question concerning how cut (!) is handled in
Constraint Logic Programming. I would be very grateful if anyone can
provide references or explicit answers.

In classical Logic Programming, whether or not a goal is redone after
a cut depends on the variable bindings in the goal.

Since constraints in CLP are the correlates of variable bindings, how
does this affect the operation of cut?

Many thanks in advance

Josh S.

