Abstract
Hierarchical Constraint Satisfaction Problems (HCSPs) are at the centre of attention in the fields of computer aided design and user interfaces. Till recently, the algorithms proposed to solve the problems of this class focused only on its small subclasses (like problems with acyclic constraint graph or linear systems). Here we present a new family of hierarchical constraint satisfaction algorithms based on the mechanism of subdefinite models. The main advantage of the proposed algorithms is their applicability to a broad class of problems, including cyclic and non-linear ones.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Narin’yani, A.S.: Subdefiniteness and Basic Means of Knowledge Representation. Computers and Artificial Intelligence, Bratislawa 2(5) (1983) 443–452
Mackworth, A.K.: Consistency in Networks of Relations. Art. Int. 8 (1977) 99–118
Ushakov, D.: Some Formal Aspects of Subdefinite Models. Preprint of A. P. Ershov Institute of Informatics Systems, Novosibirsk 49 (1998) (Also available via http://www.iis.nsk.su/preprints/USHAKOV/PREPRINT/Preprint_eng.html)
Borning, A., Freeman-Benson, B., Wilson, M.: Constraint Hierarchies. Lisp and Symbolic Computation 5 (1992) 223–270
Goguen, J.A., Meseguer, J.: Models and Equality for Logical Programming. LNCS 250 (1987) 1–22
Shvetsov, I., Telerman, V., Ushakov, D.: NeMo+: Object-Oriented Constraint Programming Environment Based on Subdefinite Models. LNCS 1330 (1997) 534–548
Borning, A., Anderson, R., Freeman-Benson, B.: Indigo: A local propagation algorithm for inequality constraints. Proc. 1996 ACM Symp. on User Interface Software and Technology (1996) 129–136
Harvey, W., Stuckey, P.J., Borning, A.: Compiling Constraint Solving Using Projection. LNCS 1330 (1997) 491–505
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ushakov, D. (2001). Hierarchical Constraint Satisfaction Based on Subdefinite Models. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 2001. Lecture Notes in Computer Science, vol 2244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45575-2_42
Download citation
DOI: https://doi.org/10.1007/3-540-45575-2_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43075-9
Online ISBN: 978-3-540-45575-2
eBook Packages: Springer Book Archive