Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples

Arindam Mitra, Chitta Baral

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

Over the years the Artificial Intelligence (AI) community has produced several datasets which have given the machine learning algorithms the opportunity to learn various skills across various domains. However, a subclass of these machine learning algorithms that aimed at learning logic programs, namely the Inductive Logic Programming algorithms, have often failed at the task due to the vastness of these datasets. This has impacted the usability of knowledge representation and reasoning techniques in the development of AI systems. In this research, we try to address this scalability issue for the algorithms that learn answer set programs. We present a sound and complete algorithm which takes the input in a slightly different manner and performs an efficient and more user controlled search for a solution. We show via experiments that our algorithm can learn from two popular datasets from machine learning community, namely bAbl (a question answering dataset) and MNIST (a dataset for handwritten digit recognition), which to the best of our knowledge was not previously possible. The system is publicly available at https://goo.gl/KdWAcV.

Original languageEnglish (US)
Pages (from-to)623-637
Number of pages15
JournalTheory and Practice of Logic Programming
Volume18
Issue number3-4
DOIs
StatePublished - Jul 1 2018

Keywords

  • Answer Set Programming
  • Context Dependent Learning
  • Handwritten Digit Recognition
  • Inductive Logic Programming
  • Question Answering

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples'. Together they form a unique fingerprint.

Cite this