Theory revision with queries: horn, read-once, and parity formulas

  • Authors:

  • Judy Goldsmith;Robert H. Sloan;Balázs Szörényi;György Turán

  • Affiliations:

  • Computer Science Department, University of Kentucky, Lexington, KY;Department of Computer Science, University of Illinois at Chicago, Chicago, IL;Hungarian Academy of Sciences and University of Szeged, Research Group on Artifical Intelligence, Aradi vértanúk tere 1, H-6720 Szeged, Hungary;Hungarian Academy of Science and University of Szeged, Research Group on Artifical Intelligence, Aradi vértanúk tere 1, H-6720 Szeged, Hungary and Dept. of Math., Stats., and Comp. Sci., ...

  • Venue:
  • Artificial Intelligence
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

A theory, in this context, is a Boolean formula; it is used to classify instances, or truth assignments. Theories can model real-world phenomena, and can do so more or less correctly. The theory revision, or concept revision, problem is to correct a given, roughly correct concept. This problem is considered here in the model of learning with equivalence and membership queries. A revision algorithm is considered efficient if the number of queries it makes is polynomial in the revision distance between the initial theory and the target theory, and polylogarithmic in the number of variables and the size of the initial theory. The revision distance is the minimal number of syntactic revision operations, such as the deletion or addition of literals, needed to obtain the target theory from the initial theory. Efficient revision algorithms are given for Horn formulas and read-once formulas, where revision operators are restricted to deletions of variables or clauses, and for parity formulas, where revision operators include both deletions and additions of variables. We also show that the query complexity of the read-once revision algorithm is near-optimal.