Revising First-Order Logic Theories from Examples Through Stochastic Local Search
暂无分享,去创建一个
[1] Ivan Bratko,et al. Refining Complete Hypotheses in ILP , 1999, ILP.
[2] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[3] Stephen Muggleton,et al. Inverse entailment and progol , 1995, New Generation Computing.
[4] Ashwin Srinivasan,et al. Carcinogenesis Predictions Using ILP , 1997, ILP.
[5] Raymond J. Mooney,et al. Automated refinement of first-order horn-clause domain theories , 2005, Machine Learning.
[6] Luc De Raedt,et al. Phase Transitions and Stochastic Local Search in k-Term DNF Learning , 2002, ECML.
[7] Prasad Tadepalli,et al. Learning Decision Rules by Randomized Iterative Local Search , 2002, ICML.
[8] Ashwin Srinivasan,et al. ILP Through Propositionalization and Stochastic k-Term DNF Learning , 2007, ILP.
[9] Ashwin Srinivasan,et al. Relating chemical activity to structure: An examination of ILP successes , 1995, New Generation Computing.
[10] De Raedt,et al. Advances in Inductive Logic Programming , 1996 .
[11] Ashwin Srinivasan,et al. Theories for Mutagenicity: A Study in First-Order and Feature-Based Induction , 1996, Artif. Intell..
[12] Ashwin Srinivasan,et al. Randomised restarted search in ILP , 2006, Machine Learning.
[13] Bart Selman,et al. Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.