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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Artificial intelligence Ročník 171; číslo 16; s. 939 - 950
Hlavní autoři:	Serrurier, Mathieu, Prade, Henri
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.11.2007 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!