The Fellegi-Holt method automatically "corrects" data that fail some predefined requirements. Computer implementations of the method were used in many national statistics agencies but are less used now because they are slow. We recast the method in prepositional logic, and show that many of its results are well-known results in prepositional logic. In particular we show that the Fellegi-Holt method of "edit generation" is essentially the same as a technique for automating logical deduction called resolution. Since modern implementations of resolution are capable of handling large problems efficiently, they might lead to more efficient implementations of the Fellegi-Holt method
AbstractThis paper concerns the question of automated deduction methods for modal logic. A method, c...
Abstract. The increasingly widespread availability of multicore and manycore computers demands new p...
A deductive database scheme consists of a set of base predicate schemes and a set of possibly non H...
The Fellegi-Holt method automatically "corrects" data that fail some predefined requiremen...
Automatic data editing consists of three components: identification of erroneous records, identifica...
Data collected by statistical offices generally contain errors, which have to be corrected before re...
:tb.~tract. Theorem-proving on the computer, using procedures based on the fund~-mental theorem of H...
This work is about a “real-world ” application of automated deduction. The application is the manage...
In a variety of relevant real world problems, tasks of "data mining" and "knowledge discovery" are r...
A general theory of deduction systems is presented. The theory is illustrated with deduction systems...
Part 1. We show that the standard notions of tautology and subsumption can be naturally generalized,...
Research in automated deduction is traditionally focused on the problem of determining the satisfia...
We investigate properties of logic programs that permit refinements in their fixpoint evaluation and...
Proof structures in traditional automatic theorem proving systems are generally designed for ecientl...
The paper is concerned with the problem of automatic detection and correction of erroneous data into...
AbstractThis paper concerns the question of automated deduction methods for modal logic. A method, c...
Abstract. The increasingly widespread availability of multicore and manycore computers demands new p...
A deductive database scheme consists of a set of base predicate schemes and a set of possibly non H...
The Fellegi-Holt method automatically "corrects" data that fail some predefined requiremen...
Automatic data editing consists of three components: identification of erroneous records, identifica...
Data collected by statistical offices generally contain errors, which have to be corrected before re...
:tb.~tract. Theorem-proving on the computer, using procedures based on the fund~-mental theorem of H...
This work is about a “real-world ” application of automated deduction. The application is the manage...
In a variety of relevant real world problems, tasks of "data mining" and "knowledge discovery" are r...
A general theory of deduction systems is presented. The theory is illustrated with deduction systems...
Part 1. We show that the standard notions of tautology and subsumption can be naturally generalized,...
Research in automated deduction is traditionally focused on the problem of determining the satisfia...
We investigate properties of logic programs that permit refinements in their fixpoint evaluation and...
Proof structures in traditional automatic theorem proving systems are generally designed for ecientl...
The paper is concerned with the problem of automatic detection and correction of erroneous data into...
AbstractThis paper concerns the question of automated deduction methods for modal logic. A method, c...
Abstract. The increasingly widespread availability of multicore and manycore computers demands new p...
A deductive database scheme consists of a set of base predicate schemes and a set of possibly non H...