Abstract
Chapter 5 discusses the general issue of constraint propagation through a connected model graph of regular relations. A detailed procedure for determining model consistency and computational allowability in such a model is introduced. In addition, techniques to detect overlapping BNSs, relieving over- and under-constraint, expanding resultant constraint domains, and processing computational requests made on a model are demonstrated. Finally, Section 5.8 provides a constraint theory toolkit to employ the rules and theorems in an orderly manner,and which can find BNSs trillions of times faster than brute force approaches.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Friedman, G.: Constraint Theory Applied to Mathematical Model Consistency and Computational Allowability, PhD Dissertation, University of California at Los Angeles. University Microfilms, Inc, Ann Arbor (1967)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Friedman, G.J., Phan, P. (2017). Model Consistency and Computational Allowability. In: Constraint Theory. IFSR International Series in Systems Science and Systems Engineering, vol 23. Springer, Cham. https://doi.org/10.1007/978-3-319-54792-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-54792-3_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-54791-6
Online ISBN: 978-3-319-54792-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)