DROPS

Document

DOI: 10.4230/OASIcs.ICLP.2018.2

Cumulative Scoring-Based Induction of Default Theories

Authors: Farhad Shakerin and Gopal Gupta

Published in: OASIcs, Volume 64, Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)

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.

Cite as

Farhad Shakerin and Gopal Gupta. Cumulative Scoring-Based Induction of Default Theories. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 2:1-2:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{shakerin_et_al:OASIcs.ICLP.2018.2,
  author =	{Shakerin, Farhad and Gupta, Gopal},
  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 =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-090-3},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{64},
  editor =	{Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.2},
  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}
}

Document

DOI: 10.4230/LIPIcs.ICLP.2010.212

Timed Definite Clause Omega-Grammars

Authors: Neda Saeedloei and Gopal Gupta

Published in: LIPIcs, Volume 7, Technical Communications of the 26th International Conference on Logic Programming (2010)

Abstract

We propose timed context-free grammars (TCFGs) and show how parsers for such grammars can be developed using definite clause grammars (DCGs) coupled with constraints over reals (CLP(R)). Timed context-free grammars describe timed context-free languages (TCFLs). We next extend timed context-free grammars to timed context-free omega-grammars (omega-TCFGs for brevity) and incorporate co-inductive logic programming in DCGs to obtain parsers for them. Timed context-free omega-grammars describe timed context-free languages containing infinite-sized words, and are a generalization of timed omega-regular languages recognized by timed automata. We show a practical application of omega-TCFGs to the well-known generalized railroad crossing problem.

Cite as

Neda Saeedloei and Gopal Gupta. Timed Definite Clause Omega-Grammars. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 212-221, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{saeedloei_et_al:LIPIcs.ICLP.2010.212,
  author =	{Saeedloei, Neda and Gupta, Gopal},
  title =	{{Timed Definite Clause Omega-Grammars}},
  booktitle =	{Technical Communications of the 26th International Conference on Logic Programming},
  pages =	{212--221},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-17-0},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{7},
  editor =	{Hermenegildo, Manuel and Schaub, Torsten},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2010.212},
  URN =		{urn:nbn:de:0030-drops-25994},
  doi =		{10.4230/LIPIcs.ICLP.2010.212},
  annote =	{Keywords: Constraint Logic Programming over reals, Co-induction, Context-Free Grammars, Omega-Grammars}
}

Search Results

Documents authored by Gupta, Gopal

Cumulative Scoring-Based Induction of Default Theories

Abstract

Cite as

Timed Definite Clause Omega-Grammars

Abstract

Cite as

Thanks for your feedback!

Could not send message