The difference all-difference makes

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1999, Pages 414-419

  Stergiou, Kostas ^a   Walsh, Toby ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARC-CONSISTENCY; BINARY REPRESENTATIONS; COMPLETION PROBLEM; LEVELS OF CONSISTENCY; NON-BINARY CONSTRAINTS; QUASIGROUP; SEARCH ALGORITHMS; THEORETICAL AND EXPERIMENTAL;

ARTIFICIAL INTELLIGENCE; LEARNING ALGORITHMS;

INVERSE PROBLEMS;

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

References (17)

1. F. Bacchus and P. van Beek. On the conversion between non-binary and binary constraint satisfaction problems. In Proc. ofAAAI-98, pages 311-318.1998.
2. R. Debruyne and C. Bessiere. Some practicable filtering techniques for the constraint satisfaction problem. In Proc. ofIJCAI-97, pages 412-417. 1997.
3. R. Dechter. On the expressiveness of networks with hidden variables. In Proc. of AAA1-90, pages 555-562.1990.
4. Masayuki Fujita, John Slaney, and Frank Bennett. Automatic generation of some results in finite algebra. In Proc. ofIJCAI-93, pages 52-57. 1993.
5. J. Gaschnig. Performance measurement and analysis of certain search algorithms. Tech. rep. CMU-CS-79-124, Carnegie-Mellon University, 1979. PhD thesis.
6. C. Gomes and B. Selman. Problem structure in the presence of perturbations. In Proc. of AAAJ-97, pages 221-226. 1997.
7. C. Gomes, B. Selman, and N. Crato. Heavy-tailed distributions in combinatorial search. In G. Smolka, editor, Proc. ofCP97, pages 121-135. 1997.
8. G. Kondrak and P. van Beek. A Theoretical Evaluation of Selected Backtracking Algorithms. Artificial Intelligence, 89:365-387,1997. (Pubitemid 127412238)
9. W. McCune. A Davis-Putnam Program and its Application to Finite First-Order Model Search: Quasi-group Existence Problems. Tech. Rep. ANL/MCS-TM-194, Argonne National Laboratory, 1994.
10. P. Meseguer and T. Walsh. Interleaved and discrepancy based search. In Proc. ofECAI-98. Wiley, 1998.
11. R. Mohr and G. Masini. Good old discrete relaxation. In Proc. of ECAI-88, pages 651-656, 1988.
12. J-C. Regin. A filtering algorithm for constraints of difference in CSPs. In Proc. ofAAAI-94, pages 362-367. 1994.
13. J. Slaney. FINDER, Finite Domain Enumerator: Notes and Guide. Tech. Rep. TR-ARP-1/92, Australian National University, 1992.
14. T. Walsh. Search in a small world. In Proc. IJCAI-99, 1999.
15. D.J. Watts and S.H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440-442,1998. (Pubitemid 28292183)
16. H. Zhang and Stickel M. Implementing the Davis-Putnam Algorithm by Tries. Tech. rep., University of Iowa, 1994.
17. J. Zhang and H. Zhang. SEM: a System for Enumerating Models. In Proc. of 1JCA1-95, pages 298-303, 1995.