Inductive Learning for Possibilistic Logic Programs Under Stable Models
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914253439500288 |
|---|---|
| author | Hu, Hongbo Wang, Yisong Huang, Yi Wang, Kewen |
| author_facet | Hu, Hongbo Wang, Yisong Huang, Yi Wang, Kewen |
| contents | Possibilistic logic programs (poss-programs) under stable models are a major variant of answer set programming (ASP). 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_07069 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Inductive Learning for Possibilistic Logic Programs Under Stable Models Hu, Hongbo Wang, Yisong Huang, Yi Wang, Kewen Artificial Intelligence I.2.4 Possibilistic logic programs (poss-programs) under stable models are a major variant of answer set programming (ASP). 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. |
| title | Inductive Learning for Possibilistic Logic Programs Under Stable Models |
| topic | Artificial Intelligence I.2.4 |
| url | https://arxiv.org/abs/2510.07069 |