More theory revision with queries (extended abstract)

Judy Goldsmith, Robert H. Sloan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Given a Boolean formula that is not quite right, how does one fix it? That is, if a given formula differs from an unknown target formula, what is the complexity of revising the given formula? The tools available for determining the revisions are queries to membership and equivalence oracles, namely, questions of the form: "Is this an instance of the target formula," and "Is this hypothesis equivalent to the target formula?" In the latter case, if the answer is "No," the oracle returns an instance that is true for exactly one of the hypothesis and the target. For Horn sentences that require only deletion revisions, a revision algorithm is given that is polynomial in the number of clauses of the formula and the minimum number of deletions needed. For 2-term monotone DNF formulas, a revision algorithm is given that is polynomial in the minimum number of necessary deletions and additions and the logarithm of the number of variables. Previous work addressed deletion-only revisions to 2-term unate DNF formulas.

Original languageEnglish
Title of host publicationProceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000
Pages441-448
Number of pages8
DOIs
StatePublished - 2000
Event32nd Annual ACM Symposium on Theory of Computing, STOC 2000 - Portland, OR, United States
Duration: May 21 2000May 23 2000

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference32nd Annual ACM Symposium on Theory of Computing, STOC 2000
Country/TerritoryUnited States
CityPortland, OR
Period5/21/005/23/00

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'More theory revision with queries (extended abstract)'. Together they form a unique fingerprint.

Cite this