Inductive Learning for Possibilistic Logic Programs Under Stable Models

doi:10.1017/S1471068425100355

Inductive Learning for Possibilistic Logic Programs Under Stable Models

2025-12-01

0

OA

AI

DOI：10.1017/S1471068425100355

Original

Original request for help

Save

Abstract

En 中文

Possibilistic logic programs (poss-programs) under stable models are a major variant of answer set programming. While its semantics (possibilistic stable models) and properties have been well investigated, the problem of inductive reasoning has not been investigated yet. This paper presents an approach to extracting poss-programs from a background program and examples (parts of intended possibilistic stable models). To this end, the notion of induction tasks is first formally defined, its properties are investigated and two algorithms ilpsm and ilpsmmin for computing induction solutions are presented. An implementation of ilpsmmin is also provided and experimental results show that when inputs are ordinary logic programs, the prototype outperforms a major inductive learning system for normal logic programs from stable models on the datasets that are randomly generated.

Keywords:

stable models

possibilistic logic programs

inductive logic programming

Inductive Learning for Possibilistic Logic Programs Under Stable Models

Abstract

Journal

Organization