Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!cbosgd!ucbvax!MCC.COM!AI.PETRIE
From: AI.PETRIE@MCC.COM.UUCP
Newsgroups: comp.ai.digest
Subject: Constraint Satisfaction Query
Message-ID: <12352219379.61.AI.PETRIE@MCC.COM>
Date: Fri, 20-Nov-87 18:27:35 EST
Article-I.D.: MCC.12352219379.61.AI.PETRIE
Posted: Fri Nov 20 18:27:35 1987
Date-Received: Wed, 25-Nov-87 21:57:35 EST
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: Petrie@MCC.com
Distribution: world
Organization: The ARPA Internet
Lines: 9
Approved: ailist@kl.sri.com


Does someone know a pointer to software and algorithms that relax
constraints and reason about which to relax first?  In particular,
does anyone know of a linear programming system which does not
satisfy all constraints and which allows a partial ordering on the
satisfaction of the constraints? 


-------