Explaining incompatibilities in data dictionary design through abduction

Citations of this article
Mendeley users who have this article in their library.
Get full text


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 ofrules 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. © 1994.




Pirri, F., & Pizzuti, C. (1994). Explaining incompatibilities in data dictionary design through abduction. Data and Knowledge Engineering, 13(2), 101–139. https://doi.org/10.1016/0169-023X(94)90001-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free