Abstract
Reinforcing local consistency, in particular arc consistency, has attracted the attention of many researchers due to its preeminent role in efficient CSP (constraint satisfaction problem) solving. Many centralized arc consistency techniques have been proposed for binary constraints. But, only very few reports are available addressing directly to general constraints for centralized framework and not for distributed one. The main contribution of this work consists in proposing a new generalized schema (called GDRAC) for reinforcing arc-consistency on general constraint networks (CNs) in an asynchronous and distributed manner. The experimental comparative evaluations show the high performance of our approach to general constraints.
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.
Similar content being viewed by others
References
Briot, J.P.: Actalk: A Framework for Object-Oriented Concurrent Programming – Design and Experience. In: Proceedings 2nd France-Japan Workshop (OBPDC 1997), 23 pages (1999)
Bessière, C., Freuder, E.C., Régin, J.-C.: Using inference to reduce arc consistency computation. In: Proceedings IJCAI 1995, pp. 592–598 (1995)
Bessière, C., Freuder, E., Régin, J.-C.: Using constraint Metaknowledge to Reduce Arc Consistency Computation. Artificial Intelligence 107, 125–148 (1999)
Bessière, C., Régin, J.-C.: Arc consistency for general constraint networks: preliminary results. In: Proceedings IJCAI 1997, pp. 398–404 (1997)
BenHassine, A., Ghedira, K.: How to Establish Arc-Consistency by Reactive Agents. In: Proceedings of the 15th ECAI 2002, pp. 156–160 (2002)
BenHassine, A., Ghédira, K.: Using Reactive Agents to Establish Arc-Consistency. In: Ishizuka, M., Sattar, A. (eds.) PRICAI 2002. LNCS (LNAI), vol. 2417, pp. 97–107. Springer, Heidelberg (2002)
Dechter, R., Pearl, J.: Tree-Clustering Schemes for Constraint-Processing. In: Proceedings AAAI 1998 (1988)
Lamport, L., Chandy, K.M.: Distributed snapshots: Determining global states of distributed systems. TOCS 3(1), 63–75 (1985)
Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence 8, 99–118 (1977)
Mackworth, A.K.: On reading sketch maps. In: Proceedings IJCAI 1977, pp. 598–606 (1977)
Montanari, U.: NetWorks of Constraints: Fundamental properties and applications to picture processing. Information Sciences 7, 95–132 (1974)
Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artificial Intelligence 28, 225–233 (1986)
Mohr, R., Masini, G.: Good old discrete relaxation. In: Proceedings ECAI 1988, pp. 651–656 (1988)
Regin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings AAAI 1994, pp. 362–367 (1994)
Van Beek, P., Dechter, R.: On the minimality and global consistency of row-convex constraint networks. Journal of the ACM 42(3), 543–561 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hassine, A.B., Ghedira, K., Ho, T.B. (2004). New Distributed Filtering-Consistency Approach to General Networks. In: Orchard, B., Yang, C., Ali, M. (eds) Innovations in Applied Artificial Intelligence. IEA/AIE 2004. Lecture Notes in Computer Science(), vol 3029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24677-0_73
Download citation
DOI: https://doi.org/10.1007/978-3-540-24677-0_73
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22007-7
Online ISBN: 978-3-540-24677-0
eBook Packages: Springer Book Archive