License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICLP.2018.2
URN: urn:nbn:de:0030-drops-98685
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9868/
Go to the corresponding OASIcs Volume Portal

Shakerin, Farhad ; Gupta, Gopal

Cumulative Scoring-Based Induction of Default Theories

pdf-format:
OASIcs-ICLP-2018-2.pdf (0.5 MB)

Abstract

Significant research has been conducted in recent years to extend Inductive Logic Programming (ILP) methods to induce a more expressive class of logic programs such as answer set programs. The methods proposed perform an exhaustive search for the correct hypothesis. Thus, they are sound but not scalable to real-life datasets. Lack of scalability and inability to deal with noisy data in real-life datasets restricts their applicability. In contrast, top-down ILP algorithms such as FOIL, can easily guide the search using heuristics and tolerate noise. They also scale up very well, due to the greedy nature of search for best hypothesis. However, in some cases despite having ample positive and negative examples, heuristics fail to direct the search in the correct direction. In this paper, we introduce the FOLD 2.0 algorithm - an enhanced version of our recently developed algorithm called FOLD. Our original FOLD algorithm automates the inductive learning of default theories. The enhancements presented here preserve the greedy nature of hypothesis search during clause specialization. These enhancements also avoid being stuck in local optima - a major pitfall of FOIL-like algorithms. Experiments that we report in this paper, suggest a significant improvement in terms of accuracy and expressiveness of the class of induced hypotheses. To the best of our knowledge, our FOLD 2.0 algorithm is the first heuristic based, scalable, and noise-resilient ILP system to induce answer set programs.

BibTeX - Entry

@InProceedings{shakerin_et_al:OASIcs:2018:9868,
  author =	{Farhad Shakerin and Gopal Gupta},
  title =	{{Cumulative Scoring-Based Induction of Default Theories}},
  booktitle =	{Technical Communications of the 34th International  Conference on Logic Programming (ICLP 2018)},
  pages =	{2:1--2:15},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-090-3},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{64},
  editor =	{Alessandro Dal Palu' and Paul Tarau and Neda Saeedloei and Paul Fodor},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9868},
  URN =		{urn:nbn:de:0030-drops-98685},
  doi =		{10.4230/OASIcs.ICLP.2018.2},
  annote =	{Keywords: Inductive Logic Programming, Negation As Failure, Answer Set Programming, Default reasoning, Machine learning}
}

Keywords: Inductive Logic Programming, Negation As Failure, Answer Set Programming, Default reasoning, Machine learning
Collection: Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)
Issue Date: 2018
Date of publication: 19.11.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI