Computational Complexity of Hypothesis Assembly

Computational Complexity of Hypothesis Assembly
Dean A l l e m a n g , Michael C. Tanner, T o m Bylander, John Josephson
Laboratory for A r t i f i c i a l Intelligence Research
Department of Computer Science
The Ohio State University
ABSTRACT
w o r l d concepts o f a b d u c t i o n . I n p a r t i c u l a r , w e w i l l e x a m i n e
a system called R E D , based u p o n t h i s a p p r o a c h , w h i c h per-
T h e p r o b l e m of finding a best e x p l a n a t i o n of a set of
f o r m s a n t i b o d y i d e n t i f i c a t i o n i n t h e d o m a i n o f r e d b l o o d cell
d a t a has been a t o p i c o f m u c h i n t e r e s t i n A r t i f i c i a l I n t e l l i -
t y p i n g , as d e s c r i b e d in ( J o s e p h s o n 1984), (Josephson 1985)
gence. I n t h i s p a p e r w e present a n a p p r o a c h t o t h i s p r o b l e m
a n d ( S m i t h 1985), a n d show h o w t h e general m a t h e m a t i c a l
b y h y p o t h e s i s assembly. W e present t h i s a p p r o a c h f o r m a l l y
s o t h a t w e can e x a m i n e t h e t i m e c o m p l e x i t y a n d correctness
results r e s p o n d t o questions t h a t have been raised ( M o s t o w
1985) a b o u t its c o m p l e x i t y .
of the algorithms. We then examine a system i m p l e m e n t e d
I I . Mathematical Idealization of Abduction
using this approach, w h i c h performs red blood a n t i b o d y
identification.
W e use t h i s d o m a i n t o e x a m i n e t h e r a m i -
fications of t h e a s s u m p t i o n s of t h e f o r m a l m o d e l in a real
Definitions
w o r l d s i t u a t i o n . W e also b r i e f l y c o m p a r e t h i s a p p r o a c h t o
I n o r d e r t o m o t i v a t e t h e f o l l o w i n g d e f i n i t i o n s , w e w i l l ex-
o t h e r assembly approaches i n t e r m s o f t i m e c o m p l e x i t y a n d
amine briefly the d o m a i n of the current i m p l e m e n t a t i o n of
reliance o n a s s u m p t i o n s .
R E D , t h e d o m a i n o f b l o o d b a n k a n t i b o d y analysis. T h e p r i m a r y d a t a consists o f results o f several l a b tests o n b l o o d
samples. T h e b l o o d b a n k technologist k n o w s how antibod-
I.
Introduction
T h e p r o b l e m o f a b d u c t i v e reasoning (as p r o p o s e d b y
t h e p h i l o s o p h e r C.S. Peirce) has been a t o p i c of m u c h recent
i n t e r e s t i n A r t i f i c i a l I n t e l l i g e n c e ( M i l l e r 1982, Reggia 1983,
C h a r n i a k 1985).
T h e general task faced b y a n a b d u c t i v e
reasoning s y s t e m is to find the best e x p l a n a t i o n of a set
of d a t a or o b s e r v a t i o n s , i.e., t h e best w a y to a c c o u n t for a
set o f d a t a .
M o s t o f the w o r k i n A r t i f i c i a l I n t e l l i g e n c e i n
t h i s area has focused on a specific k i n d of a b d u c t i o n , w h i c h
we call h y p o t h e s i s assembly. T h e h y p o t h e s i s assembly task
assumes as g i v e n a set of hypotheses w i t h some k n o w l e d g e
a b o u t w h a t sorts o f d a t a each can account f o r , a n d f i n d s
t h e subset of these hypotheses t h a t best a c c o u n t s for t h e
problem data.
A t t h e O h i o State L a b o r a t o r y for A r t i f i c i a l
ies can account for various reactions. T h e l a b tests have t h e
p r o p e r t y t h a t if a n t i b o d y A accounts for some r e a c t i o n r,
a n d a n t i b o d y B a c c o u n t s for r e a c t i o n q, t h e n t h e presence
of b o t h a n t i b o d i e s A a n d B accounts for b o t h r e a c t i o n s r
a n d q.
T h i s p r o p e r t y of a d o m a i n w i l l be referred to as
independence
of h y p o t h e s e s .
M o r e f o r m a l l y , we define a d o m a i n for h y p o t h e s i s ass e m b l y as a t h e t r i p l e (H, M , e ) , w h e r e H is a finite set
of hypotheses,
M
is
a
finite
set
of manifestations,
is a m a p f r o m subsets of H to subsets of M.
t e r p r e t e d as t h e
and
c
e(S) is i n -
explanatory power of a set of h y p o t h e s e s ,
a n d is t h e set of m a n i f e s t a t i o n s for w h i c h those h y p o t h e ses can a c c o u n t .
subset Mo
M.
An assembly p r o b l e m is specified by a
Mo is i n t e r p r e t e d as t h e set of o b s e r v e d
m a n i f e s t a t i o n s 1 . I n these t e r m s , w e have
I n t e l l i g e n c e , Josephson e t . a l . (1985) have been d e v e l o p i n g
The
a n a p p r o a c h for a b d u c t i o n based u p o n h y p o t h e s i s assembly.
Independence
Assumption:
If S a n d T are subsets of H, t h e n
In this paper we will begin by presenting a m a t h e m a t i cal i d e a l i z a t i o n o f t h i s a p p r o a c h . F r o m t h i s w e w i l l analyze
t h e c o m p l e x i t y a n d correctness o f t h e a l g o r i t h m . T h e n w e
w i l l e x a m i n e h o w w e l l t h i s i d e a l i z a t i o n m a t c h e s w i t h real
T h i s w o r k has been s u p p o r t e d b y t h e N a t i o n a l L i b r a r y o f M e d i c i n e u n d e r g r a n t L M - 0 4 2 9 8 , t h e N a t i o n a l Science F o u n d a t i o n t h r o u g h a G r a d u a t e F e l l o w s h i p , a n d t h e
Defense A d v a n c e d Research P r o j e c t s A g e n c y , R A D C cont r a c t F 3 0 6 0 2 - 8 5 - C - 0 0 1 0 . C o m p u t e r facilities were e n h a n c e d
t h r o u g h gifts f r o m Xerox C o r p o r a t i o n .
1112
REASONING
A l t h o u g h m a n y d o m a i n s satisfy t h e i n d e p e n d e n c e ass u m p t i o n , w e w i s h t o s t r e n g t h e n o u r result b y r e p l a c i n g
1
In w h a t f o l l o w s , we w i l l use t h e n o t a t i o n e(S) w h e r e we
should, strictly speaking, write
of e(S) to t h e o b s e r v e d m a n i f e s t a t i o n s .
for the restriction
the independence assumption with two assumptions, which
when taken together are weaker than the independence assumption.
The
Monotonicity
Assumption:
If 5 and T are subsets of H,
Clearly any domain that satisfies the independence assumption also satisfies the monotonicity assumption.
The
Accountability Assumption
For a hypothesis
it is possible to know what
manifestations h can account for. Formally, the function
ing, hypothesis collection, parsimony and critique.
The input to the algorithm is the set of observed manifestations, Mo- The output is a set of hypotheses that
constitute a 'best' explanation of the data.
The screening phase determines plausibilities (i.e.,
prima facie likelihoods) for the veracity of the hypotheses.
Hypotheses with very low plausibilities are ruled out for
further consideration. In this discussion we wish to examine and analyze the assembly phases of the algorithm, so
we will omit a description of the screening phase. When
we discuss applications, we will see one way to accomplish
screening.
The collection phase works in the following way:
Let
be a domain for hypothesis assembly; let
be a problem in that domain.
M ' , H' and m are variables in the following algorithm.
can be computed as easily as e (polynomial calls to e).
Notice that if the independence assumption holds, then
so the accountability assumption holds.
Central to the success of any hypothesis assembly algorithm is the following assumption:
The
Let M' = Mo be the observed manifestations (the manifestations to be explained).
Let H' be the empty set (working set of hypotheses).
Until A/' is empty, do the following:
Let m be the most salient hypothesis in M'.
Find the most plausible hypothesis h that offers
to account for m, i.e.,
(H)
Adjoin h to H'.
f
Compute the reactions accounted for by " ' .
is the set of mani-
Computability Assumption:
festations yet to be explained.
For any subset 5 of H, e(S) can be computed.
Clearly the complexity of this computation is central
to the complexity of the assembly task, since it is difficult
to ask for a set of hypotheses that accounts for some set of
manifestations if it is difficult to compute what is accounted
for by a set of hypotheses. In cases in which independence
holds, this computation can be done in linear time by simply having a table that tabulates e for each individual hypothesis, so that e(5) can be computed by taking the union
of e(s) for s
This has allowed the current RED mechanism, the set covering algorithm of Reggia (Reggia 1983),
and Internist (Miller 1982) to safely ignore the complexity
of the computation of e. In fact, the incremental nature of
all these algorithms allows them to compute e(S) in constant time, since the usual case is that some set T is to
be extended with another hypothesis s, with e(T) already
known, so that the computation of e
can be done
by simply looking up e({s}). For the complexity analysis
which follows, we will assume an oracle for the function e,
that is, we make the calculations counting one step for each
evaluation of e.
B . D e s c r i p t i o n o f t h e h y p o t h e s i s assembly
algorithm
We now describe the algorithm for abduction by hypothesis assembly. The algorithm has four phases; screen-
The set H' is the assembled explanation of the observed
manifestations.
The parsimony phase works in the following way:
For each hypothesis h in H' (the working hypothesis set),
starting from the least plausible to the most plausible, do
the following:
then h is superfluous, so set
H' is now a parsimonious set of hypotheses, that is, it
has no redundant parts. Note that this does not guarantee
that H' is a complete explanation of least cardinality.
The critique phase determines whether a hypothesis is
essential to the explanation, that is, there is no way to account for the observed data without using that hypothesis.
This phase works as follows:
For each hypothesis h in H' do the following:
Set G :=
Repeat the collection algorithm
(above) using G as working hypothesis, with hypothesis h marked as unusable.
Allemang, Tanner, Bylander, and Joaephaon
1113
If collection completes (that is, there is a composite hypothesis that does not use h which explains
A/o), then h is not essential.
If collection fails to complete, then hypothesis h
is essential.
C, Complexity of the Assembly mechanism
We begin by analyzing the time complexity of the assembly
phase.
The collection algorithm can be analyzed as follows:
Let h be the number of hypotheses that were not ruled
out; let m be the number of manifestations observed.
For each manifestation, we select a hypothesis that offers to explain that manifestation, and evaluate the resulting composite. There are m such manifestations, and selection of a hypothesis takes at most h calls to the oracle a (for
a linear search). The computation of M'\e(H') can be done
in O ( m l o g m ) steps (sort both sets, and merge the results).
Thus, the complexity of this step is
Each time a new hypothesis is added to the working
composite hypothesis H', it is necessary to evaluate e ( H ' ) ,
so there are 0(m) calls to the oracle e.
Next we analyze the parsimony algorithm:
At most h hypotheses are considered for redundancy,
so there are 0(h) calls to the oracle e. At each such step,
we must compare the explained set of manifestations to the
observed set, that can be done in time 0(m log m) (first
sort both sets, then compare elementwise), so the entire
complexity is 0 ( / i m l o g m ) .
Notice that this algorithm does not guarantee that we
have found a compound hypothesis of smallest size that
accounts for the observed data. This problem, which is
the task of the Reggia et. al. set covering program (Reggia 1983), can be shown to be NP-complete (reduction to
vertex cover). This algorithm simply guarantees that the
parsimonious solution has no proper subset that is also a
solution.
Now we analyze the critic for essential hypotheses:
The critic takes each of the hypotheses in the working hypothesis and marks it as unusable, then repeats the
assembly algorithm. There are at most h hypotheses in
the composite hypothesis, so this is at most h times the
complexity of assembly, that is,
D. Correctness of the a l g o r i t h m
That the collection mechanism produces a composite
hypothesis that accounts for all of the observed findings
(provided, of course, that such a collection exists) is obvious from the loop condition. It is also clear that the critique
1114
REASONING
algorithm will find all indispensable hypotheses, and all hypotheses deemed to be essential are in fact indispensable.
The parsimony algorithm needs some justification.
We say that a composite hypothesis is a parsimonious
explanation of some findings if no proper subset of it can
account for those findings. The parsimony mechanism ensures that there is no single hypothesis that can be excluded
from the composite without losing the capability of explaining some finding. It is possible to construct a domain in
which a composite hypothesis has a proper subset that can
account for all findings (that is, the composite hypothesis is
not parsimonious), yet no single hypothesis is by itself redundant (that is, there is no hypothesis such that it alone
can be removed without losing explanatory power). If the
monotonicity assumption is true, this can not happen.
Suppose that 5 is a non-parsimonious composite hypothesis. Then for some subset R of S,
So for all r
r is itself redundant, that is, the RED
mechanism will find a redundant hypothesis in 5. Hence
we conclude that if 5 is not parsimonious, then RED will
eliminate some hypothesis from it.
I I I . A d a p t i n g the formal model t o real-world
abduction
A. The Abductive Answer
An abductive problem solver applied to actual problems
tries to produce a best explanation for the observed data.
Unfortunately, there is no hard and fast rule for demonstrating that a particular explanation is best. Human problem solvers argue about whether one explanation is better
than another. Hence the best we can do to argue that the
answer given by this algorithm is best is to list the features
which recommend it.
The answer given by this approach is guaranteed to
cover all the data. Every observation will be explained.
The answer will be parsimonious in the sense that it
will have no superfluous parts. It is not necessarily the
smallest answer, i.e., the answer with the least parts.
The answer will be plausible, since more plausible hypotheses are preferred over less plausible ones. The algo-
rithm prefers a large number of plausible hypotheses over
a smaller number of less plausible ones. The algorithm will
identify essential hypotheses, so when part of the answer is
provably correct, the algorithm determines this.
Again, we cannot prove that such an answer is a 'best'
explanation in any given situation, these are just the points
by which one could argue for this answer. In the long run,
the best answer is the one that is in fact the true situation.
So now let us examine an application of this method to an
actual domain.
B. A R e a l - W o r l d a p p l i c a t i o n Red blood antibody identification
1. Description of the domain
One of the jobs done by a blood-bank technologist is
to identify antibodies in a patient's serum to antigens that
might appear on red blood cells. This is typically done by
combining samples of patient serum with red blood cells
that contain certain antigens. Some of these combinations
will show reactions, others will not. The presence of certain
antibodies in the patient serum will account for certain reactions. The reactions are additive in the sense that if the
presence of one antibody explains one reaction, and presence of another antibody explains another, then the presence of both antibodies explains both reactions. If both
antibodies can account for a weak result in some reaction,
then the presence of both can account for a strong result
in that reaction. Also, some pairs of antibodies cannot occur together. The task of the pathologist is to decide what
antibodies are present, given a certain reaction pattern.
2. Satisfaction of Assumptions
We now examine how well this task meets the assumptions of the formal model presented in the first part of this
paper.
Computabtlity of e- The pattern of antigens appearing
on the test cells is available in table form. This information determines which antibodies account for any of the
reactions. More detailed knowledge of the chemistry of the
reactions allows us to build a table to tell the strengths of
the reactions.
Independence - The additive nature of the reactions
means that for separate reactions, the independence assumption is met. Since the model does not allow for parts
of manifestations to be explained, we cannot really say that
the additivity of reaction strengths is included in the independence assumption.
Mono tonicity - If we view a weak result for some reaction as a separate result from a strong result for the same
reaction, then we can say that the phenomenon of additive
reaction strengths satisfies the monotonicity assumption.
That is, each antibody alone explains the manifestation of
'weak reaction'. Together, they can explain either a 'weak
reaction', or a 'strong reaction'.
Accountability - Since the domain nearly satisfies the
independence assumption, it is not surprising that we can
calculate a nearly as easily as we can in the independent situation. That is, if an antibody can account for any strength
result for some reaction, then it can potentially contribute
to an explanation of any other strength result for that reaction.
Incompatibility of Hypotheses - Implicit in the formal
model is the assumption that any collection of hypotheses
is possible. This domain has a restriction that invalidates
this assumption. It can be shown that hypothesis collection
in general under such a constraint is an NP-complete problem (see appendix). There are two reasons why this is not a
problem in this domain. One is that the collection problem
is not exponential in the number of hypotheses, or even the
number of hypotheses left after screening, but in the number of incompatible pairs remaining after screening. This
tends to be quite a small number. Also, since the screening rates hypotheses by plausibility, the algorithm is likely
to stumble upon the correct answer early in the collection
process.
3. Implementation
The algorithm for this domain is presently implemented as follows:
Screening - this phase is done by a hierarchical classification system similar to the M D X system (Chandra 1983).
Collection - this phase is done as in the text, with the
exception that when a hypothesis is to be entered that is
incompatible with some hypothesis already in the collection, the conflict is resolved by throwing out the hypothesis
which is already in the set. A check is made for loops each
time a hypothesis conflict arises. This is, in the worst case,
a most plausible-first, brute force search. The computa
tions of e and a are done from a table of singleton values;
since the independence assumption holds (almost), we can
compute the value of e of a set from the value of c at each
element.
Parsimony and Critique
These phases are done as
described in the text.
The collection and parsimony phases are repeated, using the essential hypotheses as a starting point.
This algorithm matches the one in the text, except for
the problem of incompatible hypotheses. So, with that exception (that was discussed above), the time complexity of
the RED algorithm is polynomial in the number of antibodies and reactions.
4. Availability of Knowledge
We have seen that in the blood typing domain that the
assumptions required by this model are easily satisfied. We
now examine these assumptions to estimate how likely it is
that they will extend to yet other domains.
Without the computabtlity of e, it would be impossible to evaluate whether an answer constituted a complete
Allamang, Tanntr, Bylandar, and Joaaphaon
1115
explanation, much less to construct such an answer. Many
existing abduction systems (e.g. Set-covering model (Reg
gia 1983) and Internist (Miller 1982)) depend strongly upon
this assumption.
The independence assumption makes computations
easy, since we only need to know values of e for singleton
sets. Diagnostic domains are likely to satisfy this assumption, since devices are often decomposable into independent parts, and hypotheses about these parts are often
independent. The set covering model (Reggia 1983) relies
strongly on this assumption. Internist (Miller 1982) relies on this, but it would only take a simple change to Internist to cope with more unruly domains, provided that
they satisfy the monotonicity and accountability assumptions.
The monotonicity assumption is weaker than the independence assumption, hence is more likely to hold. It
allows for some interaction of hypotheses, so long as no
manifestations are canceled.
The accountability assumption is also weaker than independence, so is more likely to hold. This simply requires
that we know to what manifestations a hypothesis can contribute.
In a more unruly domain, in which the monotonicity
assumption fails to hold, that is, when several hypotheses
together fail to account for data that some of them do separately (e.g., due to subtractive interactions between the
hypotheses), all of these assembly techniques will have difficulty. It can be shown that certain types of subtractive interaction problems are NP-complete In such cases, it may
be fruitful to find different knowledge so that the problem
is no longer one of assembly. One approach along this line
is A B E L , a system described in ( P A T I L , 1982), which attempts to make this problem tractable by making use of
elaborate causal structures.
Conclusion
An important characteristic of problems that are dealt
with in Artificial Intelligence is that domain knowledge is
necessary to make the computations feasible. If an approach is to be widely applicable, it is necessary to know
what knowledge is necessary to ensure that the approach
will yield correct answers in a reasonable time.
In this paper, we have constructed a formal model
of the approach to abductive reasoning illustrated by the
RED system. From this model, we have identified when
the available knowledge will allow application of this approach. Under the assumption that the knowledge is of this
form (that is, it satisfies the assumptions of monotonicity,
accountability and computability), we have demonstrated
the tractability and correctness of the computation.
Appendix I
Proofs of theorems
N P - C o m p l e t e n e s s o f t h e Reggia a l g o r i t h m
After Reggia (1983) (using the notational conventions of
this paper), we have the following definitions:
a diagnostic problem is a 4-tuple (H/, A/, C, M0).
H, hi are finite sets of hypotheses and manifestations
respectively,
the 'observed manifestations'.
For a subset
, we write e(S) for the set
An Explanation for a diagnostic problem is a set , _
H such that
for any
s.t.
We wish to show that given a diagnostic problem, finding an explanation is NP-complete. We give a reduction
from minimal node cover.
Minimum node cover: Given a graph
a set
of smallest cardinality s.t.
endpoint in V.
, find
has an
We form a diagnostic problem from the graph G as
follows:
Set
Clearly an explanation of this diagnostic problem is
also a cover of the graph (7, of minimum cardinality. Also
clearly this transformation is polynomial in the size of G.
N P - c o m p l e t e n e s s o f h y p o t h e s i s assembly
w i t h Incompatible Hypotheses
An hypothesis assembly problem under constraints
of incompatible hypotheses can be specified as a 5-tuple
( H , A / , C \ / , A f u ) , where
H and A/ are finite sets of hypotheses and manifestations respectively,
C is a relation,
a table for computing e,
/ is a set of unordered pairs of elements of H,
and
For a subset
for the set
The interpretation of these sets is that H is a set of hypotheses that can account for certain manifestations in A/,
_
, . - x . e(h) means that h can account for m.
means than hypotheses h and h2 are incom-patible. Mo is the se
plete explanation is a set
such that
__
and such that there is no pair
1116
REASONING
We prove NP-completeness of t h i s p r o b l e m by reduc-
2. E.
Charniak and
D.
M c D e r m o t t , Introduction
to
Artifi-
cial Intelligence, A d d i s o n Wesley, 1985.
t i o n f r o m 3 S A T ( G a r e y 1979).
3 S A T : G i v e n a statement in p r o p o s i t i o n a l calculus in
d i s j u n c t i v e n o r m a l f o r m , i n w h i c h each t e r m has a t most
3. M.
three f a c t o r s , f i n d an assignment of the variables t h a t makes
ity, W. H. F r e e m a n a n d C o m p a n y , New Y o r k , 1979.
Garey and
D.
Johnson,
Computers
and Intractabil-
the s t a t e m e n t have value ' T r u e ' .
We f o r m an hypothesis assembly p r o b l e m f r o m a 3 S A T
4 . Josephson, J . R.; T a n n e r , M . C , S m i t h , J . W . ; Svir-
p r o b l e m by m a p p i n g factors in a 3S AT p r o b l e m to h y p o t h e -
bely, J . R.; S t r o h m , P., " R e d : I n t e g r a t i n g Generic Tasks
ses a n d m a p p i n g terms to m a n i f e s t a t i o n s as follows:
to I d e n t i f y R e d - C e l l A n t i b o d i e s . "
L e t P be a s t a t e m e n t in p r o p o s i t i o n a l calculus in dis-
Systems
j u n c t i v e n o r m a l f o r m , where each t e r m has at most three
October
f a c t o r s . Let
{
}
in
Government
24-25,
In Proc.
Symposium,
The Expert
McLean,
Virginia,
1985.
be the variables used in P, let
5 . J . R . Josephson, B . C h a n d r a s e k a r a n and J . W . S m i t h ,
t be t h e n u m b e r of t e r m s in P.
We now c o n s t r u c t an instance of the h y p o t h e s i s as-
" A s s e m b l i n g t h e Best E x p l a n a t i o n . "
s e m b l y p r o b l e m under i n c o m p a t i b i l i t y c o n s t r a i n t s w i t h 2 n
the
IEEE
hypotheses a n d t m a n i f e s t a t i o n s .
Systems.
Workshop
on
Principles
In Proceedings of
of Knowledge-Based
D e n v e r , C o l o r a d o , December 1984, pp.185-190.
6. M i l l e r , R.A., Pople, H.E. Jr. and Myers, J . D . ,
" I N T E R N I S T - I , an experimental computer-based
diagnostic c o n s u l t a n t for general i n t e r n a l m e d i c i n e . "
New
England
Journal
of
Medicine
V o l . 3 0 7 ( 1 9 8 2 ) , p p . 468-476.
7 . J . M o s t o w , " I E E E W o r k s h o p o n Principles o f
If we f i n d a c o m p l e t e e x p l a n a t i o n S for this p r o b l e m ,
t h e n w e c l a i m t h a t the assignment
K n o w l e d g e Based Systems:
A Personal R e v i e w " , SIGART
Newsletter 92, A p r i l 1985, p.
25.
8. R. S. P a t i l , P. Szolovits, a n d W. B. S c h w a r t z , " M o d eling K n o w l e d g e o f the P a t i e n t i n Acid-Base a n d Electrolyte
w i l l be a s o l u t i o n to P.
d i s o r d e r s " , in
For any J,
with
since '
so°
u
i i
s
True, and
e ( h 1 ) , we h a v e , f r o m the c o n s t r u c t i o n of C ( a n d
hence, e), t h a t u 1 is a factor in the jth t e r m of P, hence the
jth t e r m of P has value T r u e .
In
Proceedings
a n d hence u 1 is False, and since m ;
Medicine,
P.
we have t h a t
t e r m of P has value T r u e .
Since every t e r m of P has value T r u e , so does P.
A s i m i l a r a r g u m e n t shows t h a t there exists a v a l i d ass e m b l y c o r r e s p o n d i n g t o each satisfying assignment.
C l e a r l y t h e c o n s t r u c t i o n of this p r o b l e m f r o m P is a
d e t e r m i n i s t i c p o l y n o m i a l process. Also it is clear t h a t c o m plete e x p l a n a t i o n c o n s t r u c t i o n under i n c o m p a t i b i l i t y cons t r a i n t s is N P , so hypothesis assembly w i t h i n c o m p a t i b l e
h y p o t h e s e s is N P - c o m p l e t e .
International
1973,
pp.
Joint
Conference
on
147-152.
10. J . R e g g i a , " D i a g n o s t i c E x p e r t Systems Based o n
a
, is a f a c t o r in the jth t e r m of P, hence again t h e jtk
of the
Artificial Intelligence.
Set
Covering Model."
Machine Studies.
U
m
9. H. Pople, " O n the Mechanization of Abductive Logic."
Case
-i
Artificial Intelligence
Szolovits, e d . , W e s t v i e w Press, 1982, p p . 191-226.
International Journal of Man-
N o v e m b e r 1983, p p .
437-460.
11. J . W . S m i t h , " R E D : A Classificatory and A b d u c t i v e
E x p e r t S y s t e m . " P h D T h e s i s , O h i o State U n i v e r s i t y , L a b o r a t o r y for A r t i f i c i a l Intelligence Research, D e p a r t m e n t
o f C o m p u t e r Science, O h i o State U n i v e r s i t y , C o l u m b u s ,
O h i o , 1985.
12. J . W . S m i t h , J . R . Josephson, M . C T a n n e r , J . R . Svirb e l y , P . S t r o h m , " P r o b l e m S o l v i n g i n R e d Cell A n t i b o d y
I d e n t i f i c a t i o n : R E D ' s P e r f o r m a n c e o n 2 0 cases," T e c h n i c a l R e p o r t , L a b o r a t o r y for A r t i f i c i a l Intelligence Research, D e p a r t m e n t o f C o m p u t e r a n d I n f o r m a t i o n Science, O h i o State U n i v e r s i t y , C o l u m b u s , O h i o , 1986.
References
1 . B . C h a n d r a s e k a r a n a n d S . M i t t a l , " ' c o n c e p t u a l Repr e s e n t a t i o n o f M e d i c a l K n o w l e d g e for Diagnosis b y C o m puter:
M D X a n d R e l a t e d S y s t e m s " , In Advances in Compu-
ters, M . Y o v i t s , E d . A c a d e m i c Press, 1983, p p . 217-293.
Allemang, Tanner, Bylander, and Joaephaon
1117