Revising first-order logic theories from examples through stochastic local search

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

Volumn 4894 LNAI, Issue , 2008, Pages 200-210

  Paes, Aline ^a   Zaverucha, Gerson ^a   Santos Costa, Vitor ^b  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b UNIVERSITY OF PORTO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COST EFFECTIVENESS; LEARNING SYSTEMS; RANDOM PROCESSES; SET THEORY; USER INTERFACES;

RUNTIME PERFORMANCE; SEARCH STRATEGIES; STOCHASTIC LOCAL SEARCH;

FORMAL LOGIC;

EID: 40249096014     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78469-2_21     Document Type: Conference Paper

References (15)

1. Bratko, I.: Refining complete hypotheses in ILP. In: Džeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol. 1634, pp. 44-55. Springer, Heidelberg (1999)
2. Chishohn, M., Tadepalli, P.: Learning decision rules by randomized iterative local search. In: Proc. of the 19th ICML, pp. 75-82 (2002)
3. King, R.D., Sternberg, M.J.E., Srinivasan, A.: Relating chemical activity to structure: An examination of ILP successes. New Generation Computing 13(3-4), 411-433 (1995)
4. Muggleton, S.: Inverse entailment and Progol. New Generation Computing 13, 245-286 (1995)
5. Paes, A., Železný, F., Zaverucha, G., Page, D., Srinivasan, A.: ILP through propositionalization and stochastic k-term DNF learning. In: Muggleton, S., Otero, R., Tamaddoni-Nezhad, A. (eds.) ILP 2006. LNCS (LNAI), vol 4455, pp. 379-393. Springer, Heidelberg (2007)
6. Paes, A., Zaverucha, G., Costa, V.S.: Further results on revising first-order theories through Stochastic Local Search. In: Technical report, Federal University of Rio de Janeiro (2007)
7. Richards, B.L., Mooney, R.J.: Automated refinement of first-order Horn-clause domain theories. Machine Learning 19(2), 95-131 (1995)
8. Rückert, U., Kramer, S.: Stochastic local search in k-term DNF learning. In: Proc. of the 20th ICML, pp. 648-655 (2003)
9. Selman, B., Kautz, H.A., Cohen, B.: Local search strategies for satisfiability testing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26, 521-532 (1996)
10. Selman, B., Levesque, H.J., Mitchell, D.G.: A. new method for solving hard satisfiability problems. In: Proc. of the 10th AAAI, pp. 440-446 (1992)
11. Srinivasan, A.: The Aleph Manual (2001)
12. Srinivasan, A., King, R.D., Muggleton, S., Sternberg, M.J.E.: Carcinogenesis predictions using ILP. In: Džeroski, S., Lavrač, N. (eds.) ILP 1997. LNCS, vol. 1297, pp. 273-287. Springer, Heidelberg (1997)
13. Srinivasan, A., Muggleton, S., Sternberg, M.J.E., King, R.D.: Theories for mutagenicity: A study in first-order and feature-based induction. Artificial Intelligence 85(1-2), 277-299 (1996)
14. Železný, F., Srinivasan, A., Page, D.: Randomised restarted search in ILP. Machine Learning 64(1-3), 183-208 (2006)
15. Wrobel, S.: First-order theory refinement. In: De Raedt, L. (ed.) Advances in Inductive Logic Programming, pp. 14-33. IOS Press, Amsterdam (1996)