Guiding the search in the NO region of the phase transition problem with a partial subsumption test

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4212 LNAI, Issue , 2006, Pages 817-824

  Wieczorek, Samuel ^a   Bisson, Gilles ^b   Gordon, Mirta B ^b  

^a CEA GRENOBLE   (France)

^b Laboratoire Leibniz   (France)

Author keywords

CSP; Inductive logic programming; Partial subsumption; Phase transition; Similarity index; subsumption

Indexed keywords

COMPUTATION THEORY; LOGIC PROGRAMMING; PHASE TRANSITIONS; PROBLEM ORIENTED LANGUAGES;

INDUCTIVE LOGIC PROGRAMMING; PARTIAL SUBSUMPTION TEST; SIMILARITY INDEX; Θ-SUBSUMPTION;

SEARCH ENGINES;

EID: 33750313241     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11871842_84     Document Type: Conference Paper

References (18)

1. Arias M., Khardon R., Maloberti J.: Learning horn expressions with LOGAN-H. Technical report 2005-4 of the Department of Computer Science, Tufts University (2005)
2. Bisson G.: Learning in FOL with a similarity measure. In Proceeding of 10th AAAI Conference, San-Jose. (1992) 82-87
3. Bisson G.: Why and how to define a similarity measure for object-based representation systems. Proceedings of 2nd international conference on building and sharing very large-scale knowledge bases (KBKS). IOS press. Enschede (NL). (1995), 236-246
4. Botta M., Saitta L., Sebag M.: Relational learning as search in a critical region. Journal of Machine Learning research, 4 (2003) 431-463.
5. Costa V. S., Srinivasan A., Camacho, R., Blockeel H., Demoen B., Janssens G., Struyf J., Vandecastaele H., Van Laer, W.: Query transformations for improving the efficiency of ilp systems. Machine Learning Research, 4 (2003) 465-491
6. Giordana A., Saitta L.: Phase transitions in relational learning. Machine Learning 41 (2000) 17-25
7. Gottlob G., Fermüller C. G.: Removing redundancy from a clause. Artificial Intelligence, 61(2) (1993) 263-289
8. Hirata K.: On condensation of a clause. In Horvath T. and Yamamoto A., Eds, Proceedings of the 15th Int. Conf. on Inductive Logic Programming, LNAI, Springer-Verlag (2003) 164-179
9. Hogg T., Huberman B. A., Williams C. P.: Eds, Artificial Intelligence: Special Issue on Frontiers in Problem Solving: Phase Transition and Complexity, Elsevier 81 (1996) 1-2
10. Hogg T.: Refining the phase transition in combinatorial search. Artificial Intelligence, 81 (1996) 127-154
11. Khardon R.: Learning function-free horn expressions. Machine Learning, 37(3) (1999) 241-275
12. Maloberti J.: Improving Inductive Logic Programming with Constraint Satisfaction Techniques: Applications to Frequent Query Discovery. PhD thesis, LRI, Université d'Orsay (2005)
13. Maloberti J., Sebag M.: Fast theta-subsumption with constraint satisfaction algorithms. Machine Learning, 55(2) (2004) 137-174
14. Minton S., Philips A., Johnston M. D., Laird P.: Minimizing conflicts: A heuristic repair method for constraint-satisfaction and scheduling problems. Journal of Artificial Intelligence Research, 1 (1993) 1-15
15. Muggleton S., De Raedt L.: Inductive logic programming: Theory and methods. Journal of Logic Programming, 19 (1994) 629-679
16. Presser P.: An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81 (1996) 81-109
17. Plotkin G.: A note on inductive generalization. Machine Intelligence, 5 (1970)
18. Smith B. M., Dyer M. E.: Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81 (1996) 155-181