Different Classes of Graphs to Represent Microstructures for CSPs
- 699 Downloads
The CSP formalism has shown, for many years, its interest for the representation of numerous kinds of problems, and also often provide effective resolution methods in practice. This formalism has also provided a useful framework for the knowledge representation as well as to implement efficient methods for reasoning about knowledge. The data of a CSP are usually expressed in terms of a constraint network. This network is a (constraints) graph when the arity of the constraints is equal to two (binary constraints), or a (constraint) hypergraph in the case of constraints of arbitrary arity, which is generally the case for problems of real life. The study of the structural properties of these networks has made it possible to highlight certain properties, which led to the definition of new tractable classes, but in most cases, they have been defined for the restricted case of binary constraints. So, several representations by graphs have been proposed for the study of constraint hypergraphs to extend the known results to the binary case. Another approach, finer, is interested in the study of the microstructure of CSP, which is defined by graphs. This helped, offering a new theoretical framework to propose other tractable classes.
In this paper, we propose to extend the notion of microstructure to any type of CSP. For this, we propose three kinds of graphs that can take into account the constraints of arbitrary arity. We show how these new theoretical tools can already provide a framework for developing new tractable classes for CSPs. We think that these new representations should be of interest for the community, firstly for the generalization of existing results, but also to obtain original results.
Unable to display preview. Download preview PDF.
- 1.Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier (2006)Google Scholar
- 4.Janssen, P., Jégou, P., Nouguier, B., Vilarem, M.C.: A filtering process for general constraint satisfaction problems: achieving pairwise-consistency using an associated binary representation. In: Proceedings of IEEE Workshop on Tools for Artificial Intelligence, pp. 420–427 (1989)Google Scholar
- 7.Garey, M.R., Johnson, D.S.: Computer and Intractability. Freeman (1979)Google Scholar
- 8.Jégou, P.: Decomposition of Domains Based on the Micro-Structure of Finite Constraint Satisfaction Problems. In: Proceedings of AAAI, pp. 731–736 (1993)Google Scholar
- 13.El Mouelhi, A., Jégou, P., Terrioux, C., Zanuttini, B.: On the Efficiency of Backtracking Algorithms for Binary Constraint Satisfaction Problems. In: ISAIM (January 2012)Google Scholar
- 17.Stergiou, K., Walsh, T.: Encodings of Non-Binary Constraint Satisfaction Problems. In: Proceedings of AAAI, pp. 163–168 (1999)Google Scholar
- 21.Jégou, P.: Contribution à l’étude des problèmes de satisfaction de contraintes: Algorithmes de propagation et de résolution – Propagation de contraintes dans les réseau dynamiques. PhD thesis, Université des Sciences et Techniques du Languedoc (January 1991)Google Scholar
- 22.Peirce, C.S., Hartshorne, C., Weiss, P.: Collected Papers of Charles Sanders Peirce, vol. 3. Harvard University Press (1933)Google Scholar
- 23.Rossi, F., Petrie, C.J., Dhar, V.: On the Equivalence of Constraint Satisfaction Problems. In: Proceedings of ECAI, pp. 550–556 (1990)Google Scholar
- 26.Nadel, B.: Tree Search and Arc Consistency in Constraint-Satisfaction Algorithms. In: Search in Artificial Intelligence, pp. 287–342. Springer (1988)Google Scholar
- 29.Graham, M.H.: On the universal relation. Technical report, University of Toronto (1979)Google Scholar
- 31.El Mouelhi, A., Jégou, P., Terrioux, C.: A Hybrid Tractable Class for Non-Binary CSPs. In: Proceedings of ICTAI (2013)Google Scholar