Abstract
Constraint satisfaction is gaining a great deal of attention because many combinatorial problems especially in areas of Artificial Intelligence can be expressed in a natural way as a Constraint Satisfaction Problem (CSP). It is well known that a non-binary CSP can be transformed into an equivalent binary CSP using some of the actual techniques. However, when the CSP is not discrete or the number of constraints is high relative to the number of variables, these techniques become impractical. In this paper, we propose an heuristic called “One face Hyperpolyhedron Heuristic” as an incremental and non-binary CSP solver. This non-binary CSP solver does not increase its temporal complexity with the variable domain size. It carries out the search through a hyperpolyhedron that maintains those solutions that satisfy all metric non-binary temporal constraints. Thus, we can manage more complex and expressive problems with high number of constraints and very large domains.
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
Bacchus F., van Beek P.: On the conversion between non-binary and binary constraint satisfaction problems. In proceeding of AAAI-98, (1998) 311–318
Bessière C., Meseguer P., Freuder E.C., Larrosa J.: On Forward Checking for Non-binary Constraint Satisfaction. In Proc. Principles and Practice of Constraint Programming (CP99), (1999) 88–102
Bessiere C.: Non-Binary Constraints. In Proc. Principles and Practice of Constraint Programming (CP-99), (1999) 24–27
Dechter, R., Meiri, I., Pearl, J.: Temporal Constraint Network, Artificial Intelligence 49, (1991) 61–95
Dechter R.: From Local to Global Consistency, Artificial Intelligence 55, (1992) 87–107
Montanan U.: Networks of constraints: fundamental properties and applications to picture processing. Information Sciences 7. (1974) 95–132
Rossi F., Petrie C., Dhar V.: On the equivalence of constraint satisfaction problems. In proceeding of European Conference of Artificial Intelligence, ECAI-90, (1990) 550–556
Salido M.A., Barber F.: An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm. In Proceedings of Seventh International Conference on Principles and Practice of Constraint Programming (CP2001),(2001)
Salido, M.A., Giret, A., Barber, F.: Realizing a Global Hyperpolyhedron Constraint via LP Techniques. In Proceedings of Joint German/Austrian Conference on Artificial Intelligence (KI-2001). Workshop on New Results in Planning, Scheduling and Design (PUK2001),(2001)
Salido, M.A., Barber, F.: POLYSA: A Polynomial Algorithm for Non-binary Constraint Satisfaction Problems with <= and <>. Technical Report (DSIC-UPV), (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag London
About this paper
Cite this paper
Salido, M.A., Giret, A., Barber, F. (2002). A Non-binary Constraint Satisfaction Solver: the One-Face Hyperpolyhedron Heuristic. In: Bramer, M., Coenen, F., Preece, A. (eds) Research and Development in Intelligent Systems XVIII. Springer, London. https://doi.org/10.1007/978-1-4471-0119-2_24
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0119-2_24
Publisher Name: Springer, London
Print ISBN: 978-1-85233-535-9
Online ISBN: 978-1-4471-0119-2
eBook Packages: Springer Book Archive