Tractability of Theory Patching

03/01/1998
by   S. Argamon-Engelson, et al.
0

In this paper we consider the problem of `theory patching', in which we are given a domain theory, some of whose components are indicated to be possibly flawed, and a set of labeled training examples for the domain concept. The theory patching problem is to revise only the indicated components of the theory, such that the resulting theory correctly classifies all the training examples. Theory patching is thus a type of theory revision in which revisions are made to individual components of the theory. Our concern in this paper is to determine for which classes of logical domain theories the theory patching problem is tractable. We consider both propositional and first-order domain theories, and show that the theory patching problem is equivalent to that of determining what information contained in a theory is `stable' regardless of what revisions might be performed to the theory. We show that determining stability is tractable if the input theory satisfies two conditions: that revisions to each theory component have monotonic effects on the classification of examples, and that theory components act independently in the classification of examples in the theory. We also show how the concepts introduced can be used to determine the soundness and completeness of particular theory patching algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2021

An Equational Logical Framework for Type Theories

A wide range of intuitionistic type theories may be presented as equatio...
research
05/25/2023

What is a Theory ?

Deduction modulo is a way to express a theory using computation rules in...
research
03/09/2023

A conservativity result for homotopy elementary types in dependent type theory

We prove a conservativity result for extensional type theories over prop...
research
12/02/2020

Tractable Combinations of Theories via Sampling

For a first-order theory T, the Constraint Satisfaction Problem of T is ...
research
03/17/2016

Predicate Gradual Logic and Linguistics

There are several major proposals for treating donkey anaphora such as d...
research
03/09/2000

On the tractable counting of theory models and its application to belief revision and truth maintenance

We introduced decomposable negation normal form (DNNF) recently as a tra...
research
06/21/2017

The Theory is Predictive, but is it Complete? An Application to Human Perception of Randomness

When we test a theory using data, it is common to focus on correctness: ...

Please sign up or login with your details

Forgot password? Click here to reset