Introducing possibilistic logic in ILP for dealing with exceptions

Artificial Intelligence

Volumn 171, Issue 16-17, 2007, Pages 939-950

  Serrurier, Mathieu ^a   Prade, Henri ^a  

^a IRIT   (France)

Author keywords

Inductive logic programming; Non monotonic reasoning; Possibilistic logic

Indexed keywords

ALGORITHMS; DECISION TABLES; OPTIMIZATION; PROBLEM SOLVING;

NON-MONOTONIC REASONING; POSSIBILISTIC LOGIC;

LOGIC PROGRAMMING;

EID: 35448952961     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2007.04.016     Document Type: Article

References (34)

1. Muggleton S., and Raedt L.D. Inductive logic programming: Theory and methods. New Generation Computing 19 20 (1994) 629-680
2. Muggleton S. Inverse entailment and Progol. New Generation Computing 13 (1995) 245-286
3. Khardon R. Learning Horn expressions with LogAn-H. Proceedings of the 7th International Conference on Machine Learning, ICML '00 (2000), Morgan Kaufmann Publishers Inc. 471-478
4. A. Srinivasan, The aleph manual, Tech. rep., Oxford University Computing Laboratory, Oxford, 2000
5. S. Benferhat, D. Dubois, H. Prade, Representing default rules in possibilistic logic, in: Proceedings of the 11th International Conference of on Principles of Knowledge Representation and Reasoning KR92, 1992, pp. 673-684
6. Dubois D., Lang J., and Prade H. Possibilistic logic. In: D.G., et al. (Ed). Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3 (1994), Oxford University Press 439-513
7. Rivest R.L. Learning decision lists. Machine Learning 2 (1987) 229-246
8. Khardon R. Learning to take actions. Machine Learning 35 (1999) 57-90
9. Califf M.E. Efficient and effective induction of first order decision lists. In: Matwin S., and Sammut C. (Eds). Proceedings of the 12th International Conference of Inductive Logic Programming, ILP 2002 (2002), Springer 17-31
10. Bain M., and Muggleton S.H. Non-monotonic learning. In: Hayes J.E., Michie D., and Tyugu E. (Eds). Machine Intelligence 12 (1991), Oxford University Press, Oxford 105-119
11. A. Srinivasan, S.M.M. Bain, Distinguishing exceptions from noise in non-monotonic learning, in: S. Muggleton (Ed.), Proceedings of the 2nd International Workshop on Inductive Logic Programming, 1992
12. Wrobel S. On the proper definition of minimality in specialization and theory revision. Machine Learning: ECML-93. European Conference on Machine Learning, Proceedings vol. 667 (1993), Springer 65-82
13. Martin L., and Vrain C. A three-valued framework for the induction of general logic programs. In: De Raedt L. (Ed). Advances in Inductive Logic Programming (1996), IOS Press 219-235
14. E. Lamma, F. Riguzzi, L.M. Pereira, Learning three-valued logic programs, in: S. Dzeroski, P. Flach (Eds.), ILP-99 Late-Breaking Papers, 1999, pp. 30-35
15. C. Sakama, Nonmonotonic inductive logic programming, in: 6th International Conference on Logic Programming and Nonmonotonic Reasoning, vol. 2173, 2001, pp. 62-79
16. M. Serrurier, H. Prade, Coping with exceptions in multiclass ILP problems using possibilistic logic, in: Proc of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05), 2005, pp. 1761-1764
17. M. Serrurier, H. Prade, Gérer les exceptions en programmation logique inductive multiclasse avec la logique possibiliste, in: 15ème Congrès Francophone AFRIF-AFIA de Reconnaissance des Formes et d'Intelligence Artificielle, RFIA'06, tours, France, 2006
18. Blockeel H., Raedt L.D., Jacobs N., and Demoen B. Scaling up inductive logic programming by learning from interpretations. Data Mining and Knowledge Discovery 3 (1999) 59-93
19. Benferhat S., Dubois D., and Prade H. Possibilistic and standard probabilistic semantics of conditional knowledge bases. Journal of Logic and Computation 9 6 (1999) 873-895
20. Serrurier M., Prade H., and Richard G. A simulated annealing framework for ILP. In: Camacho R., King R., and Srinivasan A. (Eds). Proceedings of ILP 2004. Lecture Notes in Artificial Intelligence vol. 3194 (2004), Springer 288-304
21. Lin S. Computer solutions of the traveling salesman problem. Bell System Technical Journal 44 (1965) 2245-2269
22. S. Muggleton, W. Buntine, Machine invention of first order predicates by inverting resolution, in: Proceedings of the Fifth International Conference on Machine Learning (ICML 88), 1988, pp. 339-351
23. Dietterich T.G., and Bakiri G. Solving multiclass learning problems by error-correcting output codes. Journal of Artificial Intelligence Research 2 (1995) 263-286
24. Eineborg M., and Boström H. Classifying uncovered examples by rule stretching. In: Rouveirol C., and Sebag M. (Eds). Proceedings of the 11th International Conference on Inductive Logic Programming. Lecture Notes in Artificial Intelligence vol. 2157 (2001), Springer 41-50
25. S. Sinthupinyo, C. Nattee, T. Okada, B. Kijsirikul, Combining partial rules and winnow algorithm: results on classification of dopamine antagonist molecules, in: Proceedings of the 3rd International Workshop on Active Mining, 2004, pp. 83-92
26. De Raedt L., and Kersting K. Probabilistic logic learning. SIGKDD Explor. Newsl. 5 1 (2003) 31-48
27. Snow P. Diverse confidence levels in a probabilistic semantics for conditional logics. Artif. Intell. 113 1-2 (1999) 269-279
28. T. Horvath, P. Vojtas, GAP-rule discovery for graded classification, in: Working Notes of the ECML/PKDD 04 Workshop on Advances in Inductive Rule Learning, 2004
29. Serrurier M., and Prade H. Possibilistic inductive logic programming. In: Godo L. (Ed). Proceedings of European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'05). Barcelona. Lecture Notes in Artificial Intelligence vol. 3571 (2005), Springer, Berlin Heidelberg 675-686
30. Ferri C., Flach P., and Hernandez-Orallo J. Learning decision trees using the area under the roc curve. In: Sammut C. (Ed). Proceedings of the Nineteenth International Conference on Machine Learning (ICML 2002) (2002), Morgan Kaufmann 139-146
31. A. Srinivasan, R. King, S. Muggleton, The role of background knowledge: using a problem from chemistry to examine the performance of an ILP program, Tech. Rep. PRG-TR-08-99, Oxford University Computing Laboratory, Oxford, 1999
32. H. Lodhi, S. Muggleton, Is mutagenesis still challenging, in: ILP-05 Late-Breaking Papers, 2005, pp. 35-40
33. 13C NMR spectra. In: Muggleton S. (Ed). Proceedings of the 6th International Workshop on Inductive Logic Programming. Lecture Notes in Artificial Intelligence vol. 1314 (1996), Springer 41-54
34. Kietz J.U. Learnability of description logic programs. In: Matwin S., and Sammut C. (Eds). Proceedings of the 12th Inter. Conference of Inductive Logic Programming, ILP 2002 (2002), Springer 117-132