Spaces of theories with ideal refinement operators

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 527-532

  Fanizzi, Nicola ^a   Ferilli, Stefano ^a   Di Mauro, Nicola ^a   Basile, Teresa M A ^a  

^a UNIVERSITY OF BARI   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

LOGICAL IMPLICATIONS; NON-EXISTENCE; OBJECT IDENTITY; REFINEMENT OPERATORS; RELATIONAL LEARNING; SEARCH SPACES;

ARTIFICIAL INTELLIGENCE;

EID: 40249105616     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. L. Badea and M. Stanciu. Refinement operators can be (weakly) perfect. In S. Dzeroski and P. Flach, editors, Proceedings of the 9th International Workshop on Inductive Logic Programming, volume 1634 of LNAI, pages 21-32. Springer, 1999.
2. L. Badea. A refinement operator for theories. In C. Rouveirol and M. Sebag, editors, Proceedings of the IIth International Workshop on Inductive Logic Programming, volume 2157 of LNAI, pages 1-14. Springer, 2001.
3. H. Bostrom and L. Asker. Combining divide-and-conquer and separate-and-conquer for efficient and effective rule induction. In S. Dzeroski and P. Flach, editors, Proceedings of the 9th International Workshop on Inductive Logic Programming, volume 1634 of LNAI, pages 33-43. Springer, 1999.
4. Bratko. Refining complete hypotheses in ILP. In S. Dzeroski and P. Flach, editors, Proceedings of the 9th International Workshop on Inductive Logic Programming, volume 1634 of LNAI, pages 44-55. Springer, 1999.
5. W. Buntine. Generalized subsumption and its application to induction and redundancy. Artificial Intelligence, 36(2): 149-176, 1988. (Pubitemid 18655802)
6. L. De Raedt, N. Lavrac, and S. Dzeroski. Multiple predicate learning. In R. Bajcsy, editor, Proceedings of the 13th International Joint Conference on Artificial Intelligence, volume 2, pages 1037-1043. Morgan Kaufmann, 1993.
7. F. Esposito, G. Semeraro, N. Fanizzi, and S. Ferilli. Multistrategy theory revision: Induction and abduction in INTHELEX. Machine Learning, 38(1/2): 133-156, 2000. (Pubitemid 30576118)
8. F. Esposito, N. Fanizzi, S. Ferilli, and G. Semeraro. A generalization model based on OIimplication for ideal theory refinement. Fundamenta Informaticae, 47:15-33, 2001. (Pubitemid 33084531)
9. F. Esposito, N. Fanizzi, S. Ferilli, and G. Semeraro. OI-implication: Soundness and refutation completeness. In B. Nebel, editor, Proceedings of the 17th International Joint Conference on Artificial Intelligence, pages 847-852, 2001.
10. N. Fanizzi and S. Ferilli. Minimal generalizations under OI-implication. In M.-S. Hacid, Z. Ras, D. Zighed, and Y. Kodratoff, editors, Proceedings of the 13 th International Symposium on Methodologies for Intelligent Systems, volume 2366 of LNAL Springer, 2002.
11. J. Fiirnkranz. Separate-and-conquer rule learning. Artificial Intelligence, 13(1):3-54, 1999.
12. G. Gottlob. Subsumption and implication. Information Processing Letters, 24(2): 109-111, 1987.
13. H. Midelfart. A bounded search space of clausal theories. In S. Dzeroski and P. Flach, editors, Proceedings of the 9th International Workshop on Inductive Logic Programming, volume 1634 of LNAI, pages 210-221. Springer, 1999.
14. T.M. Mitchell. Generalization as search. Artificial Intelligence, 18:203-226, 1982.
15. S.H. Muggleton. Inverse entailment and Progol. New Generation Computing, 13:245-286, 1995.
16. S.-H. Nienhuys-Cheng and R. de Wolf. Foundations of Inductive Logic Programming, volume 1228 of LNAI. Springer, 1997.
17. G.D. Plotkin. A fiirther note on inductive generalization. Machine Intelligence, 6:101-121, 1971.
18. J.R. Quinlan. Learning logical definitions from relations. Machine Learning, 5:239-266, 1990.
19. R. Reiter. Equality and domain closure in first order databases. Journal of ACM, 27:235-249, 1980. (Pubitemid 11428843)
20. A. Srinivasan. The Aleph manual. Technical report, Oxford University Computing Laboratory, 2002. http://www.comlab.ox.ac.uk/oucl/research/areas/ machlearn/Aleph.