Generalizing Programs vis Subsumption

In this paper we present a class of operators for Machine Learning based on Logic Programming which represents a characterization of the subsumption relation in the following sense: The clause C 1 subsumes the clause C 2 iff C 1 can be reached from C 2 by applying these operators. We give a formalization of the closeness among clauses based on these operators and an algorithm to compute it as well as a bound for a quick estimation. We extend the operator to programs and we also get a characterization of the subsumption between programs. Finally, a weak metric is presented to compute the closeness among programs based on subsumption.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Alan Hutchinson,et al.  Metrics on Terms and Clauses , 1997, ECML.

[3]  Shan-Hwei Nienhuys-Cheng.  Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept , 1997, ILP.

[4]  Shan-Hwei Nienhuys-Cheng,et al.  Completeness and Properness of Refinement Operators in Inductive Logic Programming , 1998, J. Log. Program..

[5]  Michael J. Maher.  Equivalences of Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[6]  Manfred Schmidt-Schauß.  Implication of Clauses is Undecidable , 1988, Theor. Comput. Sci..

[7]  José A. Alonso-Jiménez,et al.  A Topological Study of the Upward Refinement Operators in ILP , 2000, ILP Work-in-progress reports.

[8]  P. Laird.  Learning from Good and Bad Data , 1988 .

[9]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[10]  José Antonio Alonso Jiménez,et al.  A Topological Study of the Upward Refinement Operators on ILP , 2000 .

[11]  Ehud Shapiro,et al.  Inductive Inference of Theories from Facts , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[12]  Gerhard Widmer,et al.  Machine Learning: ECML-97 , 1997, Lecture Notes in Computer Science.

[13]  Maurice Bruynooghe,et al.  A Framework for Defining Distances Between First-Order Logic Objects , 1998, ILP.

[14]  R. Lowen.  Approach Spaces: The Missing Link in the Topology-Uniformity-Metric Triad , 1997 .