Learning by Answer Sets

This paper presents a novel application of answer set programming to concept learning in nonmonotonic logic programs. Given an extended logic program as a background theory, we introduce techniques for inducing new rules using answer sets of the program. The produced new rules explain positive/negative examples in the context of inductive logic programming. The result of this paper combines techniques of two important fields of logic programming in the context of nonmonotonic inductive logic programming.

• Type: Conference
• Year: 2001
• Where: ASP
• Authors: Chiaki Sakama
• Keywords: ASP 2001, Automated Reasoning, Inductive Logic Programming, Logic Program, Nonmonotonic Logic Programs