Strategies in combined learning via logic programs

Machine Learning

Volumn 38, Issue 1, 2000, Pages 63-87

  Lamma, Evelina ^a   Riguzzi, Fabrizio ^a   Pereira, Luís Moniz ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSIDADE NOVA DE LISBOA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; KNOWLEDGE REPRESENTATION; LEARNING ALGORITHMS; LOGIC PROGRAMMING; SET THEORY;

COMBINED LEARNING; CONTRADICTION HANDLING; EXPLICIT NEGATION; MULTI STRATEGY LEARNING; NON MONOTONIC LEARNING;

LEARNING SYSTEMS;

EID: 0033906996     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1007681906490     Document Type: Article

References (47)

1. Alferes, J. J. Damásio, C. V., & Pereira, L. M. (1994). SLX - A top-down derivation procedure for programs with explicit negation. In M. Bruynooghe, (Ed.), Proc. Int. Symp. on Logic Programming. The MIT Press.
2. Alferes, J. J. & Pereira, L. M. (1996). Reasoning with logic programming, LNAI (Vol. 1111). Springer-Verlag.
3. Alferes, J. J., Pereira, L. M., & Przymusinski, T. C. (1998). "Classical" negation in non-monotonic reasoning and logic programming. Journal of Automated Reasoning, 20, 107-142.
4. Bain, M. & Muggleton, S. (1992). Non-monotonic learning. In S. Muggleton, (Ed.), Inductive logic programming (pp. 145-161). Academic Press.
5. Baral, C. & Gelfond, M. (1994). Logic programming and knowledge representation. Journal of logic programming, 79(20), 73-148.
6. Chan, P. & Stolfo, S. (1993). Meta-learning for multistrategy and parallel learning. Proceedings of the 2nd International Workshop on Multistrategy Learning (pp. 150-165).
7. Damásio, C. V., Nejdl, W., & Pereira, L. M. (1994). REVISE: An extended logic programming system for revising knowledge bases. In J. Doyle, E. Sandewall & P. Torasso, (Eds.), Knowledge representation and reasoning (pp. 607-618). Morgan Kaufmann.
8. Damásio, C. V. & Pereira, L. M. (1997). Abduction on 3-valued extended logic programs. In V. W. Marek, A. Nerode & M. Trusczynski, (Eds.), Logic Programming and Non-Monotonic Reasoning - Proc. of 3rd International Conference LPNMR'95. LNAI (Vol. 925, pp. 29-42). Germany: Springer-Verlag.
9. Damásio, C. V & Pereira, L. M. (1998). A survey on paraconsistent semantics for extended logic programs. In D. Gabbay & P. Smets, (Eds.), Handbook of defeasible reasoning and uncertainty management systems (Vol. 2, pp. 241-320). Kluwer Academic Publishers.
10. De Raedt, L. (1992). Interactive theory revision: an inductive logic programming approach. Academic Press.
11. De Raedt, L., Bleken, E., Coget, V., Ghil, C., Swennen, B., & Bruynooghe, M. (1993). Learning to survive. Proceedings of the 2nd International Workshop on Multistrategy Learning (pp. 92-106).
12. De Raedt, L. & Bruynooghe, M. (1989). Towards friendly concept-learners. Proceedings of the 11th International Joint Conference on Artificial Intelligence (pp. 849-856). Morgan Kaufmann.
13. De Raedt, L. & Bruynooghe, M. (1990). On negation and three-valued logic in interactive concept learning. Proceedings of the 9th European Conference on Artificial Intelligence.
14. De Raedt, L. & Bruynooghe, M. (1992). Interactive concept learning and constructive induction by analogy. Machine Learning, 8(2), 107-150.
15. Dix, J. (1995). A classification-theory of semantics of normal logic programs: I & II. Fundamenta Informaticae, XXII(3), 227-255, 257-288.
16. Dix, J., Pereira, L. M., & Przymusinski, T. (1997). Prolegomena to logic programming and non-monotonic reasoning. In J. Dix, L. M. Pereira & T. Przymusinski, (Eds.), Non-Monotonie Extensions of Logic Programming -Selected papers from NMELP'96. LNAI (Vol. 1216, pp. 1-36). Germany: Springer-Verlag.
17. Drobnic, M. & Gams, M. (1993). Multistrategy learning: An analytical approach. Proceedings of the 2nd International Workshop on Multistrategy Learning (pp. 31-41).
18. Džeroski, S. (1991). Handling noise in inductive logic programming. Master's Thesis, Faculty of Electrical Engineering and Computer Science, University of Ljubljana.
19. Esposito, F., Ferilli, S., Lamma, E., Mello, P., Milano, M., Riguzzi, F., & Semeraro, G. (submitted for publication). Cooperation of abduction and induction in logic programming. In P. A. Flach & A. C. Kakas (Eds.), Abductive and inductive reasoning, pure and applied logic. Kluwer.
20. Gelfond, M. & Lifschitz, V (1988). The stable model semantics for logic programming. In R. Kowalski & K. A. Bowen (Eds.), Proceedings of the 5th Int. Conf. on Logic Programming (pp. 1070-1080) MIT Press.
21. Gelfond, M. & Lifschitz, V. (1990). Logic programs with classical negation. Proceedings of the 7th International Conference on Logic Programming ICLP90 (pp. 579-597). The MIT Press.
22. Gordon, D. & Perlis, D. (1989). Explicitly biased generalization. Computational Intelligence, 5(2), 67-81.
23. Greiner, R., Grove, A. J., & Roth, D. (1996). Learning active classifiers. Proceedings of the Thirteenth International Conference on Machine Learning (ICML96).
24. Inoue, K. (submitted for publication). Learning abductive and nonmonotonic logic programs. In P. A. Flach & A. C. Kakas, (Eds.), Abductive and inductive reasoning, pure and applied logic. Kluwer.
25. Inoue, K. & Kudoh, Y. (1997). Learning extended logic programs. Proceedings of the 15th International Joint Conference on Artificial Intelligence (pp. 176-181). Morgan Kaufmann.
26. Jenkins, W. (1993). Intelog: A framework for multistrategy learning. Proceedings of the 2nd International Workshop on Multistrategy Learning (pp. 58-65).
27. Lamma, E., Riguzzi, F., & Pereira, L. M. (1988). Learning in a three-valued setting. Proceedings of the Fourth International Workshop on Multistrategy Learning.
28. Lamma, E., Riguzzi, F., & Pereira, L. M. (1999). Agents learning in a three-valued setting. Technical Report, DEIS - University of Bologna.
29. Lamma, E., Riguzzi, F., & Pereira, L. M. (to appear). Strategies in combined learning via logic programs. Machine Learning.
30. Lapointe, S. & Matwin, S. (1992). Sub-unification: A tool for efficient induction of recursive programs. In D. Sleeman & P. Edwards, (Eds.), Proceedings of the 9th International Workshop on Machine Learning (pp. 273-281). Morgan Kaufmann.
31. Lavrač, N. & Džeroski, S. (1994). Inductive Logic Programming: Techniques and Applications. Ellis Horwood.
32. Leite, J. A. & Pereira, L. M. (1998). Generalizing updates: from models to programs. In J. Dix, L. M. Pereira, & T. C. Przymusinski, (Eds.), Collected Papers from Workshop on Logic Programming and Knowledge Representation LPKR'97 LNAI (Vol. 1471) Springer-Verlag.
33. Michalski, R. (1973). Discovery classification rules using variable-valued logic system VL1. Proceedings of the Third International Conference on Artificial Intelligence (pp. 162-172). Stanford University.
34. Michalski, R. (1984). A theory and methodology of inductive learning. In R. Michalski, J. Carbonell & T. Mitchell, (Eds.), Machine Learning - an artificial intelligence approach (Vol. 1, pp. 83-134). Springer-Verlag.
35. Muggleton, S. (1995). Inverse entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming, 13(3/4), 245-286.
36. Muggleton, S. & Buntine, W. (1992). Machine invention of first-order predicates by inverting resolution. In S. Muggleton, (Ed.), Inductive Logic programming (pp. 261-280). Academic Press.
37. Muggleton, S. & Feng, C. (1990). Efficient induction of logic programs. Proceedings of the 1st Conference on Algorithmic Learning Theory, Ohmsma, Tokyo, Japan (pp. 368-381).
38. Pazzani, M. J., Merz, C., Murphy, P., Ali, K., Hume, T., & Brunk, C. (1994). Reducingmisclassificationcosts. Proceedings of the Eleventh International Conference on Machine Learning (ML94) (pp. 217-225).
39. Pereira, L. M. & Alferes, J. J. (1992). Well founded semantics for logic programs with explicit negation. Proceedings of the European Conference on Artificial Intelligenece ECAI92 (pp. 102-106). John Wiley and Sons.
40. Plotkin, G. (1970). A note on inductive generalization. Machine Intelligence (Vol. 5, pp. 153-163). Edinburgh University Press.
41. Provost, F. J. & Fawcett, T. (1997). Analysis and visualization of classifier performance: Comparison under imprecise class and cost distribution. Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD97). AAAI Press.
42. Quinlan, J. (1990). Learning logical definitions from relations. Machine Learning, 5, 239-266.
43. Quinlan, J. R. (1993). C4.5: Programs for Machine Learning. San Mateo, CA: Morgan Kaufmann.
44. Reiter, R. (1978). On closed-word data bases. In H. Gallaire & J. Minker, (Eds.), Logic and data bases (pp. 55-76). Plenum Press.
45. Sagonas, K. F., Swift, T., Warren, D. S., Freire, J., & Rao, P. (1997). The XSB Programmer's Manual Version 1.7.1.
46. Van Gelder, A., Ross, K. A., & Schlipf, J. S. (1991). The well-founded semantics for general logic programs. Journal of the ACM, 38(3), 620-650.
47. Vere, S. A. (1975). Induction of concepts in the predicate calculus. Proceedings of the Fourth International Joint Conference on Artificial Intelligence (UCAI75) (pp. 281-287).