Coping with exceptions in multiclass ILP problems using possibilistic logic

Authors:
Mathieu Serrurier;Henri Prade
Affiliations:
UPS, IRIT, Toulouse, France;UPS, IRIT, Toulouse, France
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 3
Cited 2

Possibilistic logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Induction of first-order decision lists: results on learning the past tense of English verbs

Journal of Artificial Intelligence Research
Learnability of description logic programs

ILP'02 Proceedings of the 12th international conference on Inductive logic programming

Introducing possibilistic logic in ILP for dealing with exceptions

Artificial Intelligence
Improving inductive logic programming by using simulated annealing

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The handling of exceptions in multiclass problems is a tricky issue in inductive logic programming (ILP). In this paper we propose a new formalization of the ILP problem which accounts for default reasoning, and is encoded with first-order possibilistic logic. We show that this formalization allows us to handle rules with exceptions, and to prevent an example to be classified in more than one class. The possibilistic logic view of ILP problem, can be easily handled at the algorithmic level as an optimization problem.