IMPUT: An Interactive Learning Tool Based on Program Specialization^☆

Article type: Research Article

Authors: Alexin, Zoltán^{a; *} | Gyimóthy, Tibor^{b; 1} | Boström, Henrik^{c; 2}

Affiliations: [a] Department of Applied Informatics, Jozsef Attila University, Arpad ter 2, H-6720 Szeged, Hungary | [b] Research Group on Artificial Intelligence of the Hungarian Academy of Sciences, Aradi vertanuk tere 1, H-6720 Szeged, Hungary | [c] Department of Computer and Systems Sciences, Stockholm University Electrum 230, 164 40 Kista, Sweden

Correspondence: [*] Corresponding author. E-mail: [email protected].

Note: [☆] This work is supported by grants PHARE TDQM 9305-02/1022 and ESPRIT 20237.

Note: [1] E-mail: [email protected].

Note: [2] E-mail: [email protected].

Abstract: The algorithm SPECTRE specializes logic programs with respect to positive and negative examples by applying the transformation rule unfolding together with clause removal. The method IMPUT presented in this paper gives a modified version of this algorithm by integrating the algorithmic debugging system IDTS with SPECTRE. The main idea of the IMPUT method, is that the identification of a clause to be unfolded has a crucial importance on the effectiveness of the specialization process. The debugging system IDTS is used to identify this buggy clause.

Keywords: Inductive logic programming, Program specialization, Theory revision, Algorithmic debugging

DOI: 10.3233/IDA-1997-1402

Journal: Intelligent Data Analysis, vol. 1, no. 4, pp. 219-244, 1997