Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Constraint Theory, Part III: Inequality and Discrete Relations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Friedman, G.J. ; Northrop Systems Laboratories, Palos Verdes, Calif. ; Leondes, C.T.

Parts I and II of this three-part paper provided the fundamental concepts underlying constraint theory whose goal is the systematic determination of whether a mathematical model and its computations are well posed. In addition to deriving results for the general relation, special relations defined as universal and regular were treated. This concluding part treats two more special relations: inequality and discrete. Employing the axiom of transitivity for inequalities, results relating to the consistency of a mathematical model of inequalities in terms of its model graph are derived. Rules for the simultaneous propagation of four types of constraint, over, point, interval, and slack, through a heterogeneous model graph are established. In contrast to other relation types, discrete relations point constrain every relevant variable, so that finding intrinsic constraint sources is trivial. A general procedure is provided to determine the allowability of requested computations on a discrete model.

Published in:

Systems Science and Cybernetics, IEEE Transactions on  (Volume:5 ,  Issue: 3 )