Revision of logical theories

  • Giovanni Semeraro
  • Floriana Esposito
  • Nicola Fanizzi
  • Donato Malerba
Conference paper

DOI: 10.1007/3-540-60437-5_36

Part of the Lecture Notes in Computer Science book series (LNCS, volume 992)
Cite this paper as:
Semeraro G., Esposito F., Fanizzi N., Malerba D. (1995) Revision of logical theories. In: Gori M., Soda G. (eds) Topics in Artificial Intelligence. AI*IA 1995. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence), vol 992. Springer, Berlin, Heidelberg

Abstract

This paper presents a system for revising hierarchical first-order logical theories, called INCR/H. It incorporates two refinement operators, one for generalizing clauses which do not cover positive examples, and the other one for specializing the inconsistent hypotheses inductively generated by any system that learns logical theories from positive and negative examples. The generalizing operator is inspired from Hayes-Roth and McDermott's Interference matching, while the specializing operator is completely novel. Both of them perform a search in the space of logical clauses and take advantage of the structure of this set. The main characteristic of the system consists of the capability of autonomously performing a representation change, that allows INCR/H to extend the search to the space of clauses with negated literals in the body (program clauses) when no correct theories exist in the space of definite clauses. Experimental results in the area of electronic document classification show that INCR/H is able to cope effectively and efficiently with this real-world learning task.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Giovanni Semeraro
    • 1
  • Floriana Esposito
    • 1
  • Nicola Fanizzi
    • 1
  • Donato Malerba
    • 1
  1. 1.Dipartimento di InformaticaUniversità degli Studi di BariBariItaly

Personalised recommendations