| O. Arieli, M. Denecker, B. Van Nu#elen, and M. Bruynooghe. Repairing Inconsistent Databases: A Model-Theoretic Approach. In Decker et al. [37]. |
....K if the distance between I and J is less than or equal to the distance between I and K. Furthermore, in [36] an algorithm for computing repairs is introduced. This algorithm is based on the tableau proof system for the three valued logic used in the framework. A related approach of Arieli et al. [10] introduces executable specifications of repairs using abductive logic programming [65] In both approaches, however, no notion analogous to consistent query answers is proposed, and no complexity analysis is provided. Pradhan [86,87] introduced a logic for reasoning in the presence of ....
O. Arieli, M. Denecker, B. Van Nu#elen, and M. Bruynooghe. Repairing Inconsistent Databases: A Model-Theoretic Approach. In Decker et al. [37].
....K if the distance between I and J is less than or equal to the distance between I and K. Furthermore, in [35] an algorithm for computing repairs is introduced. This algorithm is based on the tableau proof system for the three valued logic used in the framework. A related approach of Arieli et al. [10] introduces executable specifications of repairs using abductive logic programming [64] In both approaches, however, no notion analogous to consistent query answers is proposed and no complexity analysis provided. Pradhan [85,86] introduced a logic for reasoning in the presence of contestations ....
O. Arieli, M. Denecker, B. Van Nu#elen, and M. Bruynooghe. Repairing Inconsistent Databases: A Model-Theoretic Approach. In Decker et al. [36].
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC