Learnability of description logic programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2583, Issue , 2003, Pages 117-132

  Kietz, Jörg Uwe ^a  

^a Kdlabs AG   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

DATA DESCRIPTION; FORMAL LANGUAGES; LOGIC PROGRAMMING; METADATA; NUMERICAL METHODS;

DATALOG; DESCRIPTION LOGIC; DESCRIPTION LOGIC PROGRAMS; LEARNABILITY; LITERALS; NUMERICAL CONSTRAINTS; PRE-PROCESSING METHOD; RULE LEARNING;

INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 7044240764     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36468-4_8     Document Type: Conference Paper

References (28)

1. [Baader and Küsters, 1998] Baader, F. and R. Küsters: 1998, 'Computing the least common subsumer and the most specific concept in the presence of cyclic ALNconcept descriptions'. In: O. Herzog and A. Günter (eds.): Proceedings of the 22nd Annual German Conference on Artificial Intelligence, KI-98. pp. 129-140, Springer- Verlag.
2. [Baader and Sattler, 2000] Baader, F. and U. Sattler: 2000, 'Tableau Algorithms for Description Logics'. In: R. Dyckhoff (ed.): Proceedings of the International Conference on Automated Reasoning with Tableaux and Related Methods (Tableaux 2000). pp. 1-18, Springer-Verlag.
3. [Borgida, 1996] Borgida, A.: 1996, 'On the relative expressiveness of description logics and predicate logics'. Artificial Intelligence 82, 353-367.
4. [Brachman and Schmolze, 1985] Brachman, R. J. and J. G. Schmolze: 1985, 'An Overview of the KL-ONE Knowledge Representation System'. Cognitive Science 9(2), 171-216.
5. [Cohen and Page, 1995] Cohen, W. and C. Page: 1995, 'Polynomial Learnability and Inductive Logic Programming: Methods and Results'. New Generation Computing, Special issue on Inductive Logic Programming 13(3-4), 369-410.
6. [Cohen, 1995] Cohen, W. W.: 1995, 'Pac-Learning non-recursive Prolog Clauses'. Artificial Intelligence 79, 1-38.
7. [Cohen et al., 1992] Cohen, W. W., A. Borgida, and H. Hirsh: 1992, 'Computing Least Common Subsumers in Description Logic'. In: Proc. of the 10th National Conference on Artificial Intelligence. San Jose, California, MIT-Press.
8. [Cohen and Hirsh, 1994] Cohen, W. W. and H. Hirsh: 1994, 'The Learnability of Description Logics with Equality Constraints'. Machine Learning 17, 169-199.
9. [Donini et al., 1991] Donini, F., M. Lenzerini, C. Nardi, and W. Nutt: 1991, 'Tractable Concept Languages'. In: Proc. IJCAI-91. pp. 458-463.
10. [Džeroski and Dolsak, 1992] Džeroski, S. and B. Dolsak: 1992, 'A Comparision of Relation Learning Algorithms on the Problem of Finite Element Mesh Design'. In: Proc. of the ISEEK Workshop. Ljubljana, Slovenia.
11. [Frazier and Pitt, 1994] Frazier, M. and L. Pitt: 1994, 'Classic Learning'. In: Proc. of the 7th Annual ACM Conference on Computational Learning Theory. pp. 23-34.
12. [Goasdoué et al. 2001] Goasdoué, F. C. Rouveirol, and V. Ventos, 2001, 'Optimized Coverage Test for Learning in Carin-ALN'. Technical report, L.R.I, C.N.R.S and Université Paris Sud. Work in progress.
13. [Helft, 1989] Helft, N.: 1989, 'Induction as nonmonotonic inference'. In: Proceedings of the 1st International Conference on Knowledge Representation and Reasoning.
14. [Kietz, 1996] Kietz, J.-U.: 1996, 'Induktive Analyse Relationaler Daten'. Ph.D. thesis, Technical University Berlin. (in german).
15. [Kietz, 2002] Kietz, J.-U.: 2002, 'Learnability of Description Logic Programs (Extended Version)'. Technical report, http://www.kietz.ch/.
16. [Kietz and Džeroski, 1994] Kietz, J.-U. and S. Džeroski: 1994, 'Inductive Logic Programming and Learnability'. SIGART Bulletin 5(1).
17. [Kietz and Lübbe, 1994] Kietz, J.-U. and M. Lübbe: 1994, 'An Efficient Subsumption Algorithm for Inductive Logic Programming'. In: Proc. of the Eleventh International Conference on Machine Learning (ML94).
18. [Kietz and Morik, 1994] Kietz, J.-U. and K. Morik: 1994, 'A polynomial approach to the constructive Induction of Structural Knowledge'. Machine Learning 14(2), 193-217.
19. [Krogel and Wrobel, 2001] Krogel, M. A. and S. Wrobel: 2001, 'Transformation-based Learning Using Mulirelational Aggregation'. In: Proc. Elenth International Conference on Inductive Logic Programming, ILP'2001. Berlin, New York, Springer Verlag.
20. [Levy and Rouset, 1998] Levy, A. Y. and M.-C. Rouset: 1998, 'Combining horn rules and description logic in Carin'. Artificial Intelligence 104, 165-209.
21. [Muggleton, 1995] Muggleton, S. H.: 1995, 'Inverse Entailment and Progol'. New Generation Computing 13.
22. [Muggleton and Feng, 1992] Muggleton, S. H. and C. Feng: 1992, 'Efficient induction of logic programs'. In: S. H. Muggleton (ed.): Inductive Logic Programming. Academic Press.
23. [Nebel, 1990a] Nebel, B.: 1990a, Reasoning and Revision in Hybrid Representation Systems. New York: Springer.
24. [Nebel, 1990b] Nebel, B.: 1990b, 'Terminological reasoning is inherently intractable'. Artificial Intelligence 43, 235-249.
25. [Plotkin, 1970] Plotkin, G. D.: 1970, 'A note on inductive generalization'. In: B. Meltzer and D. Michie (eds.): Machine Intelligence, Vol. 5. American Elsevier, Chapt. 8, pp. 153 - 163.
26. [Quinlan and Cameron-Jones, 1993] Quinlan, R. and R. M. Cameron-Jones: 1993, 'FOIL: A Midterm Report'. In: P. Brazdil (ed.): Proceedings of the Sixth European Conference on Machine Leaning (ECML-93). Berlin, Heidelberg, pp. 3-20, Springer Verlag.
27. [Rouveirol and Ventos, 2000] Rouveirol, C. and V. Ventos: 2000, 'Towards learning in Carin-ALN'. In: J. Cussens and A. M. Frisch (eds.): Proc. Tenth International Conference on Inductive Logic Programming, ILP'2000. Berlin, Springer Verlag.
28. [Sebag and Rouveirol, 1996] Sebag, M. and C. Rouveirol: 1996, 'Constraint Inductive Logic Programming'. In: L. de Raedt (ed.): Advances in ILP. IOS Press.