Creation of Abstract Syntax for Declarative Logic Programming
Marco alberti and Marco Gavanelli and Evelina Lamma
Journal of Data Processing, Vol. 14, No. 1, 2024.
DOI: https://doi.org/10.6025/jdp/2024/14/1/1-10
Link: https://www.dline.info/jdp/fulltext/v14n1/jdpv14n1_1.pdf
Abstract:
Abductive logic programming is a logical representation of abductive reasoning. Most ALP frameworks express domain-specific logical relationships that the abductive answers must satisfy. A priori, the integrity constraints are known. However, for some applications (e.g., Interactive Abduction Logic Programming, Multi-Agent Interactions, Contracting), it is reasonable to loosen this assumption so that the abductive reasoning process starts incompletely aware of the integrity constraints and continues without restarting when a new integrity constraint is known. In the present paper, we provide an abstract syntax for the declarative logic programming of abductive logic, with the addition of integrity constraint during the process of abductive reasoning, an operational implementation with formal termination, good and completeness properties, and an implementation based on SCIFF language and proof procedure.