Heuristic Based Induction of Answer Set Programs, From Default theories to Combinatorial problems

Significant research has been conducted in recent years to extend Inductive Logic Programming (ILP) methods to induce Answer Set Programs (ASP). These methods perform an exhaustive search for the correct hypothesis by encoding an ILP problem instance as an ASP program. Exhaustive search, however, results in loss of scalability. In addition, the language bias employed in these methods is overly restrictive too. In this paper we extend our previous work on learning stratified answer set programs that have a single stable model to learning arbitrary (i.e., non-stratified) ones with multiple stable models. Our extended algorithm is a greedy FOIL-like algorithm, capable of inducing non-monotonic logic programs, examples of which includes programs for combinatorial problems such as graph-coloring and N-queens. To the best of our knowledge, this is the first heuristic-based ILP algorithm to induce answer set programs with multiple stable models.

[1]  Usama M. Fayyad,et al.  Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning , 1993, IJCAI.

[2]  Jignesh M. Patel,et al.  QuickFOIL: Scalable Inductive Logic Programming , 2014, Proc. VLDB Endow..

[3]  Krysia Broda,et al.  Inductive Learning of Answer Set Programs , 2014, JELIA.

[4]  Ramón P. Otero,et al.  Induction of Stable Models , 2001, ILP.

[5]  Chiaki Sakama,et al.  Induction from answer sets in nonmonotonic logic programs , 2005, TOCL.

[6]  Vítor Santos Costa,et al.  Inductive Logic Programming , 2013, Lecture Notes in Computer Science.

[7]  Gopal Gupta,et al.  Computing Stable Models of Normal Logic Programs Without Grounding , 2017, ArXiv.

[8]  Oliver Ray,et al.  Nonmonotonic abductive inductive learning , 2009, J. Appl. Log..

[9]  Stephen Muggleton,et al.  Inverse entailment and progol , 1995, New Generation Computing.

[10]  Tianqi Chen,et al.  XGBoost: A Scalable Tree Boosting System , 2016, KDD.

[11]  Chiaki Sakama,et al.  Brave induction: a logical framework for learning from incomplete information , 2009, Machine Learning.

[12]  Gordon Plotkin,et al.  A Further Note on Inductive Generalization , 2008 .

[13]  Martin Gebser,et al.  Conflict-driven answer set solving: From theory to practice , 2012, Artif. Intell..

[14]  Michael Gelfond,et al.  Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach , 2014 .

[15]  J. Ross Quinlan,et al.  Learning logical definitions from relations , 1990, Machine Learning.

[16]  Gopal Gupta,et al.  A new algorithm to automate inductive learning of default theories* , 2017, Theory and Practice of Logic Programming.

[17]  Ashwin Srinivasan,et al.  Distinguishing Exceptions From Noise in Non-Monotonic Learning , 1992 .

[18]  Alessandra Russo,et al.  Inductive Logic Programming in Answer Set Programming , 2011, ILP.

[19]  Stephen Muggleton,et al.  Theory Completion Using Inverse Entailment , 2000, ILP.

[20]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[21]  Peter A. Flach,et al.  Abduction and Induction in Artificial Intelligence , 2009, J. Appl. Log..

[22]  Jennifer Seitzer,et al.  Stable ILP : Exploring the Added Expressivity of Negation in the Background Knowledge , 1997 .