Relational learning: Hard problems and phase transitions

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

Volumn 1792, Issue , 2000, Pages 178-189

  Botta, M ^a   Giordana, A ^b   Saitta, L ^b   Sebag, M ^c  

^a UNIVERSITY OF TURIN   (Italy)

^b UNIVERSITY OF EASTERN PIEDMONT   (Italy)

^c LABORATOIRE DE MÉCANIQUE DES SOLIDES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LEARNING SYSTEMS;

ARTIFICIAL PROBLEMS; CRITICAL FACTORS; CRITICAL VALUE; HARD PROBLEMS; MATCHING PROBLEMS; RELATIONAL LEARNING; TARGET CONCEPT; TRANSITION REGIONS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 77952005203     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (19)

1. Anglano C., Giordana A., Lo Bello G., and Saitta L. (1997). “A Network Genetic Algorithm for Concept Learning”. In Proc. 7th Int. Conf. on Genetic Algorithms (East Lansing, MI), pp. 434-441.
2. Anglano C., Giordana A., Lo Bello G., and Saitta L. (1998). “An Experimental Evaluation of Coevolutive Concept Learning”. In Proc. 15th Int. Conf. on Machine Learning (Madison, WI), pp. 19-27.
3. Cheeseman P., Kanefsky B., and Taylor W.M. (1991). “Where the Really Hard Problems Are”. In Proc. 12th Int. Joint Conf on Artificial Intelligence (Sidney, Australia), pp. 331-337.
4. Crawford J.M., and Auton L.D. (1996). “Experimental Results on the Crossover Point in Random 3-SAT”. Artificial Intelligence, 81, 31-58.
5. Freeman J.W. (1996). “Hard Random 3-SAT Problems and the Davis-Putnam Procedure”. Artificial Intelligence, 81, 183-198.
6. Gent I.P., and Walsh T. (1996). “The TSP Phase Transition”. Artificial Intelligence, 88, 349-358.
7. Giordana A., Neri F., Saitta L., and Botta M. (1998). “Integrating Multiple Learning Strategies in First Order Logics”. Machine Learning, 27, 209-240.
8. Giordana A., and Saitta L. (1998). “Phase Transition in Learning with FOL Languages”, TR 97-25, Dipartimento di Informatica, Università di Torino.
9. Giordana A., Saitta L., and Botta M. (1999). "An Experimental Study of Phase Transitions in Matching", in Proc. 16th Int. Joint Conf. on Artificial Intelligence, (Stockholm, Sweden), pp. 1198-1203.
10. Holte R.C., Acker L.E., and Porter B.W. (1989). "Concept learning and the problem of small disjuncts". In Proc. 11th Int. Joint Conf. On Artificial Intelligence (Detroit, MI), pp. 813-818.
11. Hogg T. (1996). “Refining the Phase Transition in Combinatorial Search”. Artificial Intelligence, 81, 127-154.
12. Hogg T., Huberman B.A., and Williams C.P. (Eds.) (1996). Artificial Intelligence, Special Issue on Frontiers in Problem Solving: Phase Transitions and Complexity, 81 (1-2).
13. Prosser P. (1996). “An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems”. Artificial Intelligence, 81, 81-110.
14. Quinlan R.J. (1990). "Learning Logical Definitions from Relations", Machine Learning, 5, 239-266.
15. Sebag M., and Rouveirol C. (1997). “Tractable Induction and Classification in FOL”. In Proc. 15th Int. Joint Conf. on Artificial Intelligence (Nagoya, Japan), pp. 888-892.
16. Selman B., and Kirkpatrick S. (1996). “Critical Behavior in the Computational Cost of Satisfiability Testing”. Artificial Intelligence, 81, 273-296.
17. Smith B.M., and Dyer M.E. (1996). “Locating the Phase Transition in Binary Constraint Satisfaction Problems”. Artificial Intelligence, 81, 155-181.
18. Williams C.P., Hogg T. (1994). “Exploiting the Deep Structure of Constraint Problems”. Artificial Intelligence, 70, 73-117.
19. Zhang W., and Korf R.E. (1996). “A Study of Complexity Transition on the Asymmetric Travelling Salesman Problem”. Artificial Intelligence, 81, 223-239.