Coping with exceptions in multiclass ILP problems using possibilistic logic

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 1761-1762

  Serrurier, Mathieu ^a   Prade, Henri ^a  

^a IRIT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC LEVELS; DEFAULT REASONING; FIRST-ORDER; MULTI-CLASS PROBLEMS; OPTIMIZATION PROBLEMS; POSSIBILISTIC LOGIC;

ARTIFICIAL INTELLIGENCE;

INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 55349098995     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. D. Dubois, J. Lang, and H. Prade. Possibilistic logic. In D. Gabbay et al., editor, Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pages 439-513. Oxford University Press, 1994.
2. J. U. Kietz. Learnability of description logic programs. In S. Matwin and C. Sammut, editors, Proceedings of the 12th Inter. Conference of Inductive Logic Programming, ILP 2002, pages 117-132. Springer, 2002.
3. R. Mooney and M. E. Califf. Induction of first-order decision lists: results on learning the past tense of english verbs. Journal of Artificial Intelligence Research, 3:1-24, 1995.
4. M. Serrurier, H. Prade, and G. Richard. A simulated annealing framework for ilp. In R. Camacho, R. King, and A. Srinivasan, editors, Proceedings of ILP 2004, pages 288-304. LNAI 3194, Springer, 2004.