A simulated annealing framework for ILP

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3194, Issue , 2004, Pages 288-304

  Serrurier, Mathieu ^a   Prade, Henri ^a   Richard, Gilles ^a  

^a IRIT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; GENETIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL OPERATORS; ONLINE SEARCHING; SIMULATED ANNEALING; ALGORITHMS;

DETERMINISTIC HEURISTICS; INDUCTIVE LOGIC PROGRAMMING (ILP); META-HEURUSTICS; TOP-DOWN ALGORITHMS; BOTTOM UP; EVALUATION MEASURES; LOCAL OPTIMA; NEIGHBORHOOD RELATION; QUALITY MEASURES; REFINEMENT OPERATORS; SIMULATED ANNEALING ALGORITHMS; TOPDOWN;

LOGIC PROGRAMMING; INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 22944450029     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30109-7_22     Document Type: Conference Paper

References (22)

1. L. Badea. Refinement operator can be (weakly) perfect. In S. Dzeroski and editors P. Flach, editors, Proc. of the 9 th International Conference of Inductive Logic Programming, ILP 1999, number 1634 in LNAI, pages 21-32. Springer, 1999.
2. L. Badea. A refinement operator for theories. In C. Rouveirol and M. Sebag, editors, Proceedings of the 11 th International Conference of Inductive Logic Programming, ILP 2001, pages 1-14. Springer, 2001.
3. I. Bratko. Refining complete hyphotesys in ilp. In S. Dzeroski and editors P. Flach, editors, Proc. of the 9 th International Conference of Inductive Logic Programming, ILP 1999, number 1634 in LNAI, pages 44-55. Springer, 1999.
4. A. Braund and C. Vrain. A genetic algorithm for propositionalization. In C. Rouveirol and M. Sebag, editors, Proceedings of the 11 th International Conference of Inductive Logic Programming, ILP 2001, pages 27-40. Springer, 2001.
5. A. Giordana and F. Neri. Search-intensive concept induction. Evolutionary computation, 3(4):375-416, 1995.
6. A. Giordana and C. Sale. Learning Structured Concepts Using Genetic Algorithms. In D. Sleeman and P. Edwards, editors, the 9th International Workshop on Machine Learning. Morgan Kaufmann, 1992.
7. J. Halpern. An analysis of first-order logics of probability. Artificial Intelligence, 46:310-355, 1990.
8. J. Hekanaho. DOGMA : A GA-Based relational Learning. In ILP98, pages 205-214. Springer, 1998.
9. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220:671-680, 1983.
10. N. Lavrac, P. Flach, and B. Zupan. Rule evaluation measures : a unfifying view. In S. Dzeroski and editors P. Flach, editors, Proc. of the 9 th International Conference of Inductive Logic Programming, ILP 1999, number 1634 in LNAI, pages 174-185. Springer, 1999.
11. S.H. Muggleton. Inverse entailment and Progol. New Generation Computing, 13:245-286, 1995.
12. S.-H. Nienhuys-Cheng and R. de Wolf. Foundations of Inductive Logic Programming. Number 1228 in LNAI. Springer, 1997.
13. J. R. Quinlan. Learning logical definitions from relations. Machine Learning, 5:239-266, 1990.
14. L. De Raedt and M. Bruynooghe. A theory of clausal discovery. In R. Bajcsy, editor, Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93), pages 1058-1063. Morgan Kaufmann, 1993.
15. B.L. Richards and R.J. Mooney. Learning relations by pathfinding. In Proceedings of the AAAI conference, AAAI 1992, pages 50-55, 1992.
16. E. Y. Shapiro. Inductive inference from facts. Research report 193, Yale university, 1981. Reprinted in computational research. J-L. Lassez and G. Plopkin, editors. MIT Press, MA, 1991.
17. T. Sheffer and R. Herbrich. Unbiased learning assessments of learning algorithms. In Proc of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), pages 698-803, 1997.
18. A. Srinivasan, R. King, and S. Muggleton. The role of background knowledge : using a problem from chemistry to examine the performance of an ilp program. Technical Report PRG-TR-08-99, Oxford university Computing Laboratory, Oxford, 1999.
19. A. Tamaddoni-Nezhad and S.H. Muggleton. Searching the subsumption lattice by a genetic algorithm. In J. Cussens and A. Frish, editors, Proceedings of the 10 th International Conference of Inductive Logic Programming, ILP 2000, pages 243-252. Springer, 2000.
20. A. Tamaddoni-Nezhad and S.H. Muggleton. A genetic approach to ilp. In S. Matwin and C. Sammut, editors, Proceedings of the 12 th International Conference of Inductive Logic Programming, ILP 2002, pages 285-300. Springer, 2002.
21. P. R. J. van der Laag. An Analysis of Refinement Operator in Inductive Logic Programming. Ph.d. thesis, Erasmus University Rotterdam, 1995.
22. F. Zelezny, A. Srinivasan, and D. Page. Lattice-search runtime distributions may be heavy-tailed. In S. Matwin and C. Sammut, editors, Proceedings of the 12 th International Conference of Inductive Logic Programming, ILP 2002, pages 333-345. Springer, 2002.