Using the Bottom Clause and Mode Declarations on FOL Theory Revision from Examples

  • Authors:
  • Ana Luísa Duboc;Aline Paes;Gerson Zaverucha

  • Affiliations:
  • Department of Systems Engineering and Computer Science - COPPE, Federal University of Rio de Janeiro (UFRJ), Brazil;Department of Systems Engineering and Computer Science - COPPE, Federal University of Rio de Janeiro (UFRJ), Brazil;Department of Systems Engineering and Computer Science - COPPE, Federal University of Rio de Janeiro (UFRJ), Brazil

  • Venue:
  • ILP '08 Proceedings of the 18th international conference on Inductive Logic Programming
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

Theory revision systems are designed to improve the accuracy of an initial theory, producing more accurate and comprehensible theories than purely inductive methods. Such systems search for points where examples are misclassified and modify them using revision operators. This includes trying to add antecedents in clauses usually generated in a top-down approach, considering all the literals of the knowledge base. This leads to a huge search space which dominates the cost of the revision process. ILP Mode Directed Inverse Entailment systems restrict the search for antecedents to the literals of the bottom clause. In this work the bottom clause and modes declarations are introduced to improve the efficiency of theory revision antecedent addition. Experimental results compared to FORTE revision system show that the runtime of the revision process is on average three orders of magnitude faster, and generate more comprehensible theories without decreasing the accuracy. Moreover, the proposed theory revision approach significantly improves predictive accuracy over theories generated by Aleph system.