Logic programming with abductive reasoning is used during the realization of a data dictionary with a particular methodology. Some methodological steps are represented by means of a set of rules augmented with integrity constraints which capture the presence of incompatible concepts. Explanations for incompatibility can be inferred by exploiting abductive reasoning. To this end a new proposal for the computation of hypotheses in an abductive framework where the theory is a general logic program, is presented. It is based on a suitable manipulation of minimal three-valued models of the logic program. A method to compute three-valued minimal models of a general logic program is given.
EXPLAINING INCOMPATIBILITIES IN DATA DICTIONARY DESIGN THROUGH ABDUCTION / PIRRI ARDIZZONE, Maria Fiora; Clara, Pizzuti. - In: DATA & KNOWLEDGE ENGINEERING. - ISSN 0169-023X. - STAMPA. - 13:2(1994), pp. 101-139. [10.1016/0169-023x(94)90001-9]
EXPLAINING INCOMPATIBILITIES IN DATA DICTIONARY DESIGN THROUGH ABDUCTION
PIRRI ARDIZZONE, Maria Fiora;
1994
Abstract
Logic programming with abductive reasoning is used during the realization of a data dictionary with a particular methodology. Some methodological steps are represented by means of a set of rules augmented with integrity constraints which capture the presence of incompatible concepts. Explanations for incompatibility can be inferred by exploiting abductive reasoning. To this end a new proposal for the computation of hypotheses in an abductive framework where the theory is a general logic program, is presented. It is based on a suitable manipulation of minimal three-valued models of the logic program. A method to compute three-valued minimal models of a general logic program is given.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
