Probabilistic consistency boosts MAC and SAC

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 143-148

  Mehta, Deepak ^a   Van Dongen, M R C ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

CONSISTENCY CHECKING; CONSTRAINT PROPAGATION; DE FACTO STANDARD; LEVELS OF CONSISTENCY; LOCAL CONSISTENCY; MAINTAINING ARC CONSISTENCIES; PROBABILISTIC APPROACHES; SINGLETON ARC CONSISTENCY;

ARTIFICIAL INTELLIGENCE; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY; LEARNING ALGORITHMS;

INFERENCE ENGINES;

EID: 69849093489     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. C. Bessière and R. Debruyne. Optimal and suboptimal singleton arc consistency algorithms. In Proceedings of the 19th International Joint Conference on Artificial Intelligence, pages 54-59, 2005.
2. C. Bessière and J.-C. Régin. Refining the basic constraint propagation algorithm. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, pages 309-315, 2001.
3. F. Boussemart, F. Hemery, C. Lecoutre, and L. Saïs. Boosting systematic search by weighting constraints. In Proceedings of the 13th European Conference on Artificial Intelligence, 2004.
4. F. Boussemart, F. Hemery, and C. Lecoutre. Description and representation of the problems selected for the 1st international constraint satisfaction solver competition. In Proceedings of the 2nd International Workshop on Constraint Propagation and Implementation, Volume 2 Solver Competition, 2005.
5. A. Chmeiss and L. Saïs. Constraint satisfaction problems:backtrack search revisited. In Proceedings of the Sixteenth IEEE International Conference on Tools with Artificial Intelligence, pages 252-257, Boca Raton, FL, USA, 2004. IEEE Computer Society.
6. R. Debruyne and C. Bessière. Some practical filtering techniques for the constraint satisfaction problem. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, pages 412-417, 1997.
7. I.P. Gent, E. MacIntyre, P. Prosser, B. Smith, and T. Walsh. Random constraint satisfaction: Flaws and structure. Journal of Constraints, 6(4), 2001.
8. M. Horsch andWHavens. Probabilistic arc consistency: A connection between constraint reasoning and probabilistic reasoning. In 16th Conference on Uncertainity in Artificial Intelligence, 2000.
9. C. Lecoutre and S. Cardon. A greedy approach to establish singleton arc consistency. In Proceedings of the 19th International Joint Conference on Artificial Intelligence, pages 199-204, 2005.
10. A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99-118, 1977.
11. D. Mehta and M.R.C. van Dongen. Maintaining probabilistic arc consistency. In Proceedings of the 2nd InternationalWorkshop on Constraint Propagation and Implementation, pages 49-64, 2005.
12. D. Mehta and M.R.C. van Dongen. Reducing checks and revisions in coarse-grained mac algorithms. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, 2005.
13. P. Prosser, K. Stergiou, and T. Walsh. Singleton consistencies. In Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming, pages 353-368, 2000.
14. rd SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence, pages 227-240. Springer, 2003.