Abstract
A novel inductive logic programming system, called Classic’cl is presented. Classic’cl integrates several settings for learning, in particular learning from interpretations and learning from satisfiability. Within these settings, it addresses descriptive and probabilistic modeling tasks. As such, Classic’cl (C-armr, cLAudien, icl-S(S)at, ICl, and CLlpad) integrates several well-known inductive logic programming systems such as Claudien, Warmr (and its extension C-armr), ICL, ICL-SAT, and LLPAD. We report on the implementation, the integration issues as well as on some experiments that compare Classic’cl with some of its predecessors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blockeel, H., De Raedt, L.: Top-down induction of first order logical decision trees. AI 101(1-2), 285–297 (1998)
Blockeel, H., Dehaspe, B., Demoen, L., Janssens, G.: Improving the efficiency of inductive logic programming through the use of query packs. JAIR 16, 135–166 (2002)
Blockeel, H., Dehaspe, L., Ramon, J., Struyf, J.: Ace - a combined system
De Raedt, L.: Logical settings for concept-learning. AI 95(1), 187–201 (1997)
De Raedt, L., Dehaspe, L.: Clausal discovery. Machine Learning 26, 99–146 (1997)
De Raedt, L., Ramon, J.: Condensed representations for inductive logic programming. In: KR 2004, pp. 438–446 (2004)
De Raedt, L., Van Laer, W.: Inductive constraint logic. In: Zeugmann, T., Shinohara, T., Jantke, K.P. (eds.) ALT 1995. LNCS, vol. 997. Springer, Heidelberg (1995)
Dehaspe, L.: Frequent Pattern Discovery in First-Order Logic. K. U. Leuven (December 1998)
Kersting, K.K., Raiko, T., Kramer, S., De Raedt, L.: Towards discovering structural signatures of protein folds based on logical hidden markov models. In: PSB 2003, pp. 192–203 (2003)
King, R.D., Muggleton, S., Srinivasan, A., Sternberg, M.J.E.: Structure-activity relationships derived by machine learning: The use of atoms and their bond connectivities to predict mutagenicity by inductive logic programming. PNAS 93, 438–442 (1996)
Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery 1 (1997)
Muggleton, S.: Inverse entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming 13(3-4), 245–286 (1995)
Muggleton, S., De Raedt, L.: Inductive logic programming: Theory and methods. Journal of Logic programming 17(20), 629–679 (1994)
Muggleton, S., King, R.D., Sternberg, M.J.E.: Protein secondary structure prediction using logic. In: Muggleton, S. (ed.) ILP 1992, pp. 228–259 (1992) Report ICOT TM-1182
Riguzzi, F.: Learning logic programs with annotated disjunctions. In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS (LNAI), vol. 3194, pp. 270–287. Springer, Heidelberg (2004)
Srinivasan, A.: The aleph manual
Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. Technical report cw386, K.U. Leuven (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stolle, C., Karwath, A., De Raedt, L. (2005). CLASSIC’CL: An Integrated ILP System. In: Hoffmann, A., Motoda, H., Scheffer, T. (eds) Discovery Science. DS 2005. Lecture Notes in Computer Science(), vol 3735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11563983_31
Download citation
DOI: https://doi.org/10.1007/11563983_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29230-2
Online ISBN: 978-3-540-31698-5
eBook Packages: Computer ScienceComputer Science (R0)