--- title: "Reasoning With Incomplete Knowledge in a Resource-Limited Environment: Integrating Reasoning and Knowledge Acquisition" authors: - "Mark S. Fox" doi: "" url: "https://ijcai.org/proceedings/1981/62" pdf: "https://ijcai.org/proceedings/1981/0062.pdf" venue: "Proceedings of the Seventh International Joint Conference on Artificial Intelligence" year: 1981 pages: "313-317" track: "INFERENCE and REASONING" keywords: --- # Reasoning With Incomplete Knowledge in a Resource-Limited Environment: Integrating Reasoning and Knowledge Acquisition Mark S. Fox *Proceedings of the Seventh International Joint Conference on Artificial Intelligence*, pages 313-317. ## Abstract This pdper describes a n a pproa c h t o rea~o~in g with incomplete in f o rmati on in a r eeo ur ce -l1m1t ed env ir o nm e nt. Approaches to dat e either as s ume infini t e r esou r ce s and pn,ceed t o e num er:.l t e a _Jar ge infere n ce space , o r as s um e few r eso ur ces and 1gno re th e missing info rm atio n. Th ey do n ot reason abou t resource co nstraint s and th e inferen c e methods amis sab l e under them. A hear say -II-lik e system 1S desc ri bed wher e each knowledg e source i s _a sepa rat e pr od uc tion sys t em. During rule evalua t1 on, a rule anteceda nt i s evalua t e d usi ng minimal - resour ce methods . A rule antecedant i s eval ua t ed t o. true, false , o r an expected re so ur ce co s t to acq ulr: the info r ma t io n ne cessa ry to complete its eva luat1on. r" r conf li c t resolution chooses a parti a ll y evaluat ed rule, it po s t s a goal asking other . kn o wled ge sou r ces t o provide th e mi ss ing informat1on, s u spen ds th e knowl e d ge sou r ce, and informs t~e knowledge source ' s manager ab o ut th e s uspenslon and l·ng goa l The ma na ger d ec id es wh et heraccompa ny · f th e goa l is worth pu r suing now, the amou nt o resou rc es to apply t o th e task, what knowledge source t o app l y , and when to g ive up . Th e knowledge so ur c;s that a tt em pt th e goa l ca n i mpl eme nt a varie~y o infe re nti al and knowledg e acquisitio n techn1ques. ## Full text ## 1. Introduction The purpose of this paper is to describe a r.wthorl nf reasoning wi th incomplete inforrn:~ticn in rule-based systems . .ln particular it describes how an "expc? rt program" can gracefully integrate the dynamic acquisition of knowledge with its reasontn<J process. The integration process allows the system to reason about the most appropriate methods for acquiring knewledge. The primary representation of knowledge in rule-based systems is the production rule (Newell & Simon, 1972; Davis & K.ing , 1975). A production rule is of the form: ## Antecedent --> Consequent The antecedent can be any expression which if true upon evaluation results in the evaluation (execution) of the consequent. The antecedent is classically a pattern to be matched against data in memory, but can be as complex as a first ·order predicate expression or an arbitrary LISP expression. A basic assumption in rule-based systems is that the antecedent is a total ·function which evaluates to true or false. In a rule system where the antecedent is a pattern to be matched. the assumption holds; the pattern matches something in memory or it does not. But the failure of a match can arise from two sources, either the pattern does not exist in memory (is absolutely or temporally false) , or memory lacks sufficient information to determine truth or falsity, i.e., the knowledge base is incomplete. In the latter case, an unsuccessful match should be interpreted as "I don't know" instead of false. While not new. this problem has many names such as pot ti e~ l - matchtn(J (Hayes·Rotlt , 1978), p:utial · information inferencing (Joshi. 19/8), and backvtard chaining (Shottliffe. 1975) . More generally, it is the problem of reasoning with incomplete information. In a rule-based system the control system evaluates each rule antecedent and chooses one rule from those that are true. But it is often the case that pattern antecedents partially match memory, and for predicate antecedents a subset of predicates evaluate to true while others are not disprovable. The question is: "What rule should be chosen to execute?" Previous solutions to this problem fall into a continuum where one end uses maximal knowledge but requires large amounts of resources to learn, infer or acquire the missing information, while the other end uses little knowledge and minimal resources. In particular , the backward chaining of Mycin (Shortliffe, 1976) does a complete search of the rule space looking for rules which may provide the missing information required to evaluate an antecedent. Klahr (1978) reduces the search cost of Mycin's backward chaining by utilizing rule abstractions to .:>ian the backward chaining of rules. Abstraction reduces the information available. In both these approaches, the rules determine what information is relevant and the method of acquisition. Joshi (1978) decreases the cost of choosing a rule even further by not searching for the missing information. Instead, a partial match metric based on specificity and certainty is derived and the highest valued rule is chosen. McDermott (1978) deals with partial-matches by creating a separate rule for each sub·pattern of the an tecedent which is of use to tho problem·solving. Rosenberg (197!)) augments the Planner system with meta·thcorems t11at propose alttJrnate ways of supporting a goal when existing theorems fail. Mostow (1977) has proposed the specif ication of how. what , why and when information for each rule, to guide in the selection of rules and thP. gathering of information of discrimination amongst them. In all these approaches. the more resources expended. the more complete the search, the more certain is the outcome. The important questions here are: what is the level of certainty required by the problem-solving, and what is the (resource) cost of reducing uncertainty? ## 2. Reasoning with Incomplete Knowledge in a Resource-Limited Environment Reasoning, problem-solving, and learning have all been characterized as heuristic search. In the more interesting domains, the search space is so large that it cannot be completely searched, hence many of the problems center around reducing the size of the search space. Not being able to circumnavigate the search space is basically a resource limitation, e.g. , time and space. Under such circumstances, reasoning programs must efliciently assign and use resources to solve a problem. Hence, rule-based systems when faced with the inability to evaluate an antecedent, must balance adequacy of peformance against resource limitations. Lena! et al. (1979) have discussed the problem of reasoning m resource limitP.d envi ronments under the name of cognitive economy. and Lena! (1976) has used the schema ol assigning time slices to rules to limit resource expenditures. For example, if there exists a rule of the following form: - IF (X E Vertebrata) THEN ..... and X in this case is a lion, then there are a number of ways of evaluating the antecedent "X is a member of Vertebrata" : 1. Is X equal to Vertebrata? 2. Search the is-a hierarchy of the knowledge base. Lion --> Panthera --> Felidue --> Carnivora --> Mamalia -->Vertebrata. 3. Look for other inference rules that may provide the answer. 4. Match the Lion schema against the Vertebrata schema. 5. Ask the human sitting at the terminal whether it is true. 6. Assume it's true and retract if it leaJs to inconsistent results. This example raises a variety problems that can be found in almost any domain. There are many algorithms (methods) ava ilable for answering a question including lc::arnin!J and knowledge acquisition methods. Some rP.qUire only a few resources such as the equality check. some require potenti'llly a lot of resources such as the is-a search and the pattern match, while others require non-replenishable resources. For example, if a system can ask the user questions, then it is in the best interests of the system not to ask the user too many questions because he may become annoyed and provide fewer and less accurate answers. When faced with one or more rules whose antecedent connot be evaluated, the reasoning system must address the following problem~: - Should it continue to work at evaluating thO:! antecedent? - How many resources should be expended in evaluation? - What methods should be chosen to evaluate the antecedent? ## 3. Meta-Evaluation: Resource Limited Evaluation The KS system of Fox (1981a) is a discovery system which reasons with incomplete information. A simplified view of its program architecture is a distributed set of Hearsay-It -like syst<o:ms (Erman e::t al. . 1980). That is, there are depa rtments where E:>ach d.)partment has employee knowleriuc ~ourccs and a manaqer knowlcrlgc source. Departments can form llierarch1es or hderarchies with communication channels ond ~hared dota spaces. Each knowledge source is a rule-based system with access to a global knowledge base. When a knowledge source is executing, each of its visible rules are meta -evaluated. Meta­ evaluation attempts to evaluate an antecedent using minimal resources. If it cannot evaluate the antecedent successfully, it assigns to the rule an expected cost lor successfully evaluating the rule using other methods. The conflict resolution algorithm for the knowledge source then chooses a rule based on specificity, relation to the knowledge source's goal, number of parts evaluated , and expected cost (if not successfully evaluated) . If the antecedent of the rule chosen was evaluated successfully, then its consequent is evaluated and the process begins again. If the antecedent was assigned an expected cost , then the knowledge source is suspended and the portions of the rule not evaluated are placed as goals in the knowledge base for other knowledge sources to evaluate. Other knowledge sources' preconditions fire and instantiate them. Each knowledge source provides different methods at different costs. The manager knowledge source makes the decision as to which knowledge source to assign the task, and how many resources it will expend . A knowledge source may run out of resources before it finishes, leaving it to the manager to assign more resources or to assign the task (goal) to another employee. Once the antecedent is linally evaluatc:rl . the suspPm1f;d knowl~d~1 e 30urc..: 13 a·:1a"-ened and p::1::.so: d the value by the manaaer . Proc<:s:>ing of the l<.nowledge source continues. ## 4. Meta·Evaluation: An Example A rule antecedent in the KS system c<Jn be any arbitrary lisp expression but includes existential and universal quantification as a basic knowledge base search mechanism. To simplify matters, we will assume a single department with a manager and three employees: 1. CONSPEC: knowledge source that creates new schemata via specialization (figure 4-1) 1 . 2. INTROSPEC: primary inference knowledge source. 3. OUEST ASK: knowledge source that acquires knowledge by asking the user a question. 1 The schema depicted in figure 4-1 has the following form: A schema definition is surrounded by double braces "{ { <schema del> }} " . A schema is composed of multiple views. each which is surrounded by single braces"{ (view type> <viewed schema> <view slols> } " Each view has a sel of slots defined (inherited) in that vtew. Each SLOT. which is printed as SMALL CAPITALS. has a set of facets printed in italics . One of the facets is a the valu8 of the SLOT . When only the value facet has a filler . the SLOT and the filler are pnnted without naming the facet. A schema also has slots that are ondependent of its views . They are printed separately. Each slot can act as a b1 - d~rectional inheritance relation. Slots that act as inheritance relations are pnnted in the view format. See (Fox, 1981a, 1981b} for more information. ``` {{ Conspec { IS-A Employee }} MANAGER: Example-Manager WINDOW: Restriction: (SET (TYPE is-a rule)) Value : Rl R2 STATE: Restriction: (OR rule-block mail-block cnmpleted failed ready) Value: ready PRECONOITION: restriction: (SET (TYPE is-a capability)) BUDGET: SPACES: MAIL· BOX: SUSPENDED-RULE: } ``` Figure 4-1: CONSPEC Schema CON SPEC has two rules in its rule sei (figure 4-2). Rule R1 's antecedent tests whether X is a member of VERTEBRATA . Rule R2 is similar to R1 but has been specialized by the added condition "similar" which tests whether X's color is similar to the color of X's environment. For this example, X is bound to the schema LION. ``` {{ R1 {IS-A Rule }} {{ R2 ANTECEDENT: (X E VERTEBRATA) CONSEQUENT: .. . } {IS-A Rule }} ANTEDEDENT : (XC VERTEBRATA) AND (X.Color IS-SIMILAR-TO (X.Environment).Color) CONSEQUENT: ... } ``` Figure 4· 2: CONSPEC Visible Rules ## 4.1. Low-Cost Evaluation The first phase of rule meta-evaluation is low-cost evaluation of functions in rule antecedents. For each function in the antecedent, there exists a schema in the knowledge base that defines how it is evaluated. Th~se function schemata come in three flavors: 1. Low-cost Function: uses bounded, small set of resources during execuiion. Contains the code to be executed. 2. l!arw/Jie -co~t f-'unction: uses variable set of resources (possibly unbounded) in evaluation. Search based functions (e.g., there-e:<ists) are of this type. This schema contains the expected -cost of evaluation information and the goal name to be assigned to the function. 3. Multi-Function: a function that can be evaluated in more than one way, some low-cost and others variable-cost. An example is set membership E. The schema contains the low-cost functions and the expected-cost and goal name of the variable-cost approach. If the function is low-cost then the code in the schema is executed. If the function is variable-cost, then the expected-cost for evaluation and the name of the goal to attach to the function is returned. If the function is a multi-function then 'the low-cost functions are evaluated until one succeeds. If none succeed, then the expected cost and goal name is returned. We will assume that in this example, there is enough information to answer rule R2's color test, but none of the low­ cost function tests for the multi -function E succeed (figure 4-3). The first low-cost function E-equal uses equality to test membership, but LION,. VERTEBRATA so it fails. The second low­ cost function E-depth3, searches to depth 3 up the IS-A hierarchy (Lion --> Panthera --> Felidue --> Carnivora), and also fails. Hence, the expected cost of (seconds 30) is returned lor E along ``` {{ E }} {IS-A Multi-Function LOW-COST-FUNCTION: E-equal E-depth3 EXPECTED-COST: (seconds 30) GOAL-NAME: E-goal} Figure 4-3: E Multi-Function ``` with theE-GOAL name to be assigned to the antecedent if the rule is chosen by conflict resolution. ## 4.2. Conflict Resolution The rules R 1 and R2 cannot be evaluated since lion and vertebrata are more than 3 levels apart; thus for each rule, the expected-cost of (seconds 30) is returned. The conflict resolution system looks at the two rules and chooses R2 for three reasons: 1) R2 is more specific than R 1, 2) answering R2 will also answer R1 , and 3) R2 has more subparts successfully matched than R1 . Cost, specificity, evaluability, and relation to employee's goal are used to choose a rule. ## 4.3. Goal Posting and Assignment Each department has associated with it one or more sections of the knowledge base called spaces. Each employee's precondition is keyed to one or more of these spaces. If the chosen rule has an expected cost associated with it, the knowledge source is suspended (figure 4-5) and the unevaluated functions are posted in the department 's goal space as schemata with the goal-names assigned and a state attribute of POSTED (figure 4-6). All the other "imerested" employees then test the goal against their precondition (apply the contents of the test slot ``` { { lion {IS-A Panthera COLOR: tan ENVIRONMENT: Grassland } }} {{Grassland {IS-A Place COLOR: brown, green, tan} }} ``` Figure 4-4: Lion and Grassland Schemata in Memory in each of the c;.~pability schen·:~la that f·ll the precodition :,lot) and if tru.e inform the m:~naacr of thGi r opplcability. In thi ::; case. both the INTROSPEC and OUEST ASK employees fire and inform the manager that they can (possibly) evaluate the E-GOAL. The manager then compares the possible approaches offered by the employees. INTROSPEC (figure 4-7) would use more resources than OUEST ASK (figure 4-8) but the factor o\_f bothering the human user is considered, lowering the overall utility of OUESTASK. INTHOSPEC is chosen, assigned resources based on availability and expected cost and what are available, and is initiated. The state of the E·GOAL schema in the goal space is changed from POSTED to ASSIGNED (figure 4-9) . ``` {{ Conspec { IS-A Employee }} MANAGER: Example-Manager WINDOW: R1 R2 STATE: suspended SUSPENDED-RULE: R2 GOAL: E-goal-1} Figure 4-5: Suspended CONSPEC Schema ``` ``` {{ C- goal-1 {IS-A Goal }} GOAL: E-GOAL PARAMETERS: lion Vertebrata SUSPfNDED-KS: Conspec RULE: R2 STATE: posted EXP[CTED-COST: (seconds 30) RESULT: CONTRACTED· KS: BUDGET: (seconds 50) ATTEMPTS : } ``` Figure 4-6: Posted E·GOAL ## 4 .4 . Goal Satisfaction The INTROSPEC employee tries a variety of methods available in its rule set to solve the goal For each at-tempt thar fails, it records on the goal schema the attempt cype and the amount and type of resources consumed (figure 4-1 0). This information is used by the system to update function schemata expected-costs and by the manager to decide what to do next if the employee fails at its task. If INTROSPEC succeeds, it changes the state of the goal ``` { { lntrospec {IS-A Employee }} MANAGER : Example-Manager STATE: ready PRECONDITION: {IS-A Capability GOAL: E-GOAL } TEST: E·GOAL·TEST-INTROSPEC APPROACH: E-Match-Rule-Set cosT: (seconds 25) } ``` Figure 4· 7: lntrospec Schema schema to EVALUATED, informs the manager, and ends. The manager activates (puts in the ready queue) the suspended employee. If INTROSPEC fails or runs out of resources, the manager is informed and decides whether to continue persuing the goal , what resources to expend. and to whom they should be assigned. In this case, if INTROSPEC fails, OUEST ASK is initiated and the user is queried as to whether a lion is a vertebrata. ``` { { Ou es t a~k { IS· A Employee }} MANAGER: Example-Manager STATE: ready PRECONDITION: { IS·A Capability GOAL: E·GOAL TEST: E ·GOAL· TEST·OUESTASK APPROACH: €-question cosr : (questions 5)} ``` Figure 4-8: Questask Schema ## 5. Observations. and Conclusions We described an approach for reasoning with incomplete knowledge in a rule-based system which integrates reasoning and knowledge acquisition . Simply, it attempts to evaluate a rule's antecedent using resource-miserly methods. If these fail, then it posts the antecedent as a goal for evaluation by other knowledge sources in the system. This approach has several strengths: 1. antecedents are quickly evaluated when the ``` { { ..: -go;:~t-1 { IS·A Goal }} GOAL: €- GOAL SUSPENDED-KS: Conspec RULE: R2 STATE: assigned EXPECTED-COST: (seconds 30) RESULT: CONTRACTfD· KS: lntrospeC BUDGET : (seconds 50) ATTEMPTS: } ``` Figure 4-9: Assigned E·GOAL information to answer it exists. The cost of meta­ evaluation at this point is the cost of interpreting the function's schema. Small for a LOW·COST FUNCTION, more expensive for a MULTI -FUNCTION. 2. When information is incomplete a variety of methods can be brought to bear on evaluating the antecedent. These methods require various amounts of resources. 3. The choice of method to apply is left to the manager knowledge source which has a more global view of ``` {{ ··fdtempt · t {IS A Goat -Attempt KS: lntrospec }} METHOD: E·Match-Rule-Set COST : (SeCOI')dS 20) REASON: } Figure 4 -10: E -Goal Attempt by lntrospec Knowledge Source ``` the problem, hence can intelligently choose the best approach and the resources to assign 2 . 4. Even if an antecedent cannot be evaluated, the manager or an employee can force it to be true or false. In essence, creating an hypothesis, requiring dependency analysis capabilities (london, 1978; Doyle, 1979). 5. The manager can postpone evaluating an antecedent to work on more important problems. 2 The problem of at,fention focussing (Hayes-Roth & Lesser. 1977) relies on good heuristics for choosing amongst alternatives, and a language for describing knowledge source capabilities (Lesser, 198?; Fox, 1979b). Will!.:- tl ll c; :;[!pi n.;cll pr:Jvidt'S 9'<·ato:r ccmtrol of th.-, ::pplic:at1on of inferc · ncc~ :md kno1·: f<cd<)P ;'!CCJII:51th)ll rnet110<1·3 in fli ii:1<J in missinq mformation requiru J by reason1nQ. it incurs two types of expenses. The first . is the added cost of rule meta-evaluation . For each function in the antecedent, the corresponding schema must be accessed and interpretted according to its type: low· cost. variable, or multi . Hence. there is a\_ per function constant overhead. In the KS system, the cost of interpretation has been removed . Each functional schema is both a declarative and procedural representation that can be executed directly without interpretive overhead (Fox, 1979a; 1981a). Hence. meta­ evaluation costs are negligable. The second expense is the increased complexity of the manager 's rules to handle task selection. employee selection and resource assignment. Research in perceptual tasks such as speech vision (e.g., Hearsay-11) has shown the need for such capabilities when dealing with complex and uncertain data. ## 6. Acknowledgements I would like to thank Herb Simon, John McDermott and J aimie Carbonell for their criticisms of earlier versions of this paper. ## 7. References - Davis R., aml J. King, (1975). "An Overview of Production Systems," Technic.al n~port STAN-CS-75· 524, Memo AIM-271, Stanford CA: Stanford University, Computer Science Department. - Doyle J., (1979), "A Truth Maintenance System", Artificial Intelligence, Vol. 12, No.3. - Erman L.D., F. Hayes-Roth, V.R. Lesser, and D.R. Reddy, (1980), "The Hearsay·ll Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty", Computing Surveys, Vol . 12, No. 2, June 1980, pp. 213-253. - Fox M.S., (1978), "Knowledge Structuring: An Overview" , Proc. of the 2nd Cont. of the Canadian Society for Computational Studies of Intelligence, Toronto, Ontario, pp. 146-155. - Fox M.S., (1979a), "On Inheritance in Representation" , Proceedings International Joint Conferenc;e Intelligence, Tokyo Japan. Knowledge of the Sheth on Artificial - Fox M.S. , (1979b), "Organization Structuring: Designing Large, Complex Software", Technical Report CMU· CS· '{9-155, Computer Science Department, Carnegie-Mellon University, Pittsburgh, PA. - Fox M.S.. (1981a), "Knowledge Slructuring: Knowl.:dge Accomodation and Discovery U~ing Specialization and Plonnin ;~". (rh.D. Thesi:;) , Computer Science Department, Carnegie­ Mellon University, Pittsburgh PA, In preparation. - Fox M.S., (1981b), '.'SAL: Schema Representation Language", Technical Report, The Robotics Institute, Carnegie-Mellon University, Pittsburgh, PA, in preparation. - Hayes-Roth F., (1977), The role of partial and best matches in knowledge systems, In Waterman and Hayes­ Roth (Eds.), Pattern directed inference systems. N.Y.: Academic press. - Hayes-Roth F., and V. Lesser, (1977), "Focus of Attention in the HEARSAY-II Speech Understand System," Ei.flh tnt. J2in.t QQnt. 2n Arjtificjal Intelligence. Cambridge, MA, Aug. 1977. - Joshi, Aravind K., (1978), "Some Extensions of a System for Jnference on Partial Information", In Pattern· Directed Inference Systems, D. Waterman and F. Hayes-Roth (Ed.), NY: Academic Press. - Klahr, Philip, (1978), "Planning Techniques for Rule Selection in Deductive Question-Answering" , In Pattern­ Directed Inference Systems, D. Waterman and F. Hayes-Roth (Ed.), NY: Academic Press. - Lenat, D.B., (1976). "1-.M: An J\rtilir.ial lnl ~lligenr.e Approach to Discove1y in M·-tth<,matlcs u~ Heuristic Search." (Pn.D. Thc:o i ~ ) Computer Science D<lpt., Stanford Univc::1::;ity. - Lenat D.B., F. Hayes-Roth, and P. Klahr, (1979), "Cognitive Economy in Artificial Intelligence Systems", Proceedings ol the SixJh Annual Conference on Artificial lntel/ig·ence, pp. 531 -6, Tokyo Japan. - London P.E., (197-8), "Dependency Networks as a Representation for Modelling in General Problem Solvers" , Ph.D. Thesis, Technical Report TR-698, NSG7253, , University of Maryland, College Park MD, Sept. 1978. - McDermott J., (1979), "ANA: An Assimilating and Accomodating Production System", Technical Report, Computer Science Department, Carnegie­ Mellon University, Pittsburgh, PA. - Mostow D.J., (1977), "A Revised Architecture for Rule-based Systems" , Sigart Newsletter, No. 63, June 1977, pp. 85-6. - Newell A., and H.A. Simon, (1972), Hum~n Problem Solving , Englewood Cliffs, N.J.: Prentice Hall. - Rosenberg S., (1979), "Reasoning in Incomplete Domains" , Proceedings of the Sixth International Joint c ,,,,J,.mnce ()fl At lill r: ial llll t! lllf]<'I·Ge, Tokyo Japa11, pp. 73':>· 737. - Shortlillc E.H .. (19/G), Cumputet- IJ<nt:u M£·dic<JI Con~;ultatio11s: MYCIN, New York: American Elsevier. This research was sponsored by the Defense Advan~ Resear~: Projects Agency (DOD), ARPA Order No. 3597, monitored by Air Force Avionics Laboratory under Contract F33615-78-C-1551. The views and conclusions contained in this document are those of the authors and should not .be inte~ret~ as representing the official policies, either expressed or 1mplied, of the Defense Advanced Research Projects Agency or the US Government. ## References 1. Davis R., aml J. King, (1975). " An Overview of Production Systems," Technic.al n~port STAN-CS-75• 524, Memo AIM -271, Stanford CA: Stanford University, Computer Science Department. 2. Doyle J., (1979), " A Truth Maintenance System", Artificial Intelligence, Vol. 12, No.3. 3. Erman L.D., F. Hayes-Roth, V.R. Lesser, and D.R. Reddy, (1980), "The Hearsay•ll Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty", Computing Surveys, Vol. 12, No. 2, June 1980, pp. 213-253. 4. Fox M.S., (1978), " Knowledge Structuring: An Overview" , Proc. of the 2nd Cont. of the Canadian Society for Computational Studies of Intelligence, Toronto, Ontario, pp. 146-155. 5. Fox M.S., (1979a), "On Inheritance in Representation" , Proceedings International Joint Conferenc;e Intelligence, Tokyo Japan. Knowledge of the Sheth on Artificial Fox M.S. , (1979b), "Organization Structuring: Designing Large, Complex Software", Technical Report CMU• CS• '{9-155, Computer Science Department, Carnegie-Mellon University, Pittsburgh, PA. 6. Fox M.S.. (1981a), "K nowledge Slructuring : Knowl.:dge Accomodation and Discovery U~ing Specialization and Plonnin ;~". (rh.D. Thesi:;) , Computer Science Department, Carnegie- Mellon University, Pittsburgh PA, In preparation. 7. Fox M.S., (1981b), ' .' SAL: Schema Representation Language", Technical Report, The Robotics Institute, Carnegie-Mellon University, Pittsburgh , PA, in preparation. 8. Hayes-Roth F., (1977), The role of partial and best matches in knowledge systems, In Waterman and Hayes- Roth (Eds.), Pattern directed inference systems. N.Y.: Academic press. 9. Hayes-Roth F., and V. Lesser, (1977), "Focus of Attention in the HEARSAY-II Speech Understand System," Ei.flh tnt. J2in.t QQnt. 2n Arjtificjal Intelligence. Cambridge, MA, Aug. 1977. 10. Joshi, Aravind K., (1978), "Some Extensions of a System for Jnference on Partial Information", In Pattern • Direc ted Inference Systems, D. Waterman and F. Hayes-Roth (Ed.), NY: Academic Press. 11. Klahr, Philip, (1978), " Planning Techniques for Rule Selection in Deductive Question-Answering" , In Pattern - Directed Inference Systems, D. Waterman and F. Hayes-Roth (Ed.), NY: Academic Press. 12. Lenat, D.B., (1976). " 1-.M: An J\rtilir.ial lnl ~llig enr.e Approac h to Discove1y in M•-tth<,matlcs u~ Heuristic Search ." (Pn .D. Thc:o i ~) Computer Science D• 737. 19. Shortlill c E.H .. (19/G), Cumputet-IJ