Introducing possibilistic logic in ILP for dealing with exceptions

In this paper we propose a new formalization of the inductive logic programming (ILP) problem for a better handling of exceptions. It is now encoded in first-order possibilistic logic. This allows us to handle exceptions by means of prioritized rules, thus taking lessons from non-monotonic reasoning...

Full description

Saved in:

Bibliographic Details
Published in:	Artificial intelligence Vol. 171; no. 16; pp. 939 - 950
Main Authors:	Serrurier, Mathieu, Prade, Henri
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.11.2007 Elsevier
Subjects:	Applied sciences Artificial intelligence Computer Science Computer science; control theory; systems Exact sciences and technology Inductive logic programming Learning and adaptive systems Machine Learning Non-monotonic reasoning Possibilistic logic Inductive logic programming Possibilistic logic Non-monotonic reasoning Exception handling Priority Algorithmics Competitive algorithms Circumscription Possibility theory First order logic Simulated annealing Artificial intelligence Mathematical programming
ISSN:	0004-3702, 1872-7921
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!