L. Brownston, R. Farrell, E. Kant, and N. Martin. Programming Expert Systems in OPS5. Addison-Wesley, Reading, Massachusetts, 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....are matched against working memory. In the recognize stage all rules that can fire are considered to be in conflict and a conflict resolution strategy is employed to rank or order them. Commonly used conflict resolution strategies are lexicographic analysis (LEX) and means ends analysis (MEA) [17, 18]. Both strategies place a premium on the time recency of facts which match a rule s antecedent when determining what rule to fire next. They give preference to rules whose antecedent (partially) matches the most recently asserted facts. In Figure 4 we show 4 rules in the FuzzyCLIPS format. The ....

....of rule3. In FuzzyShell rule1 and rule2 will fire before rule3. This was accomplished by a modification to the underlying pattern matching structure or the Rete network [19] The Rete network is a fast pattern matching facility which is commonly used to speed up rule firing in production systems [17, 19, 18]. To be fair, it must be noted that when using FuzzyClips version 6.04a [1] after rule3 fires rule2 will fire. Since rule2 modifies a fact that is used by rule3, rule3 will fire again. The end result is a set of facts in working memory that look slightly di#erent than if rule1 and rule2 had fired ....

L. Browstone, R. Farrell, E. Kant, and N. Martin. Programming Expert Systems in OPS5. Addison-Wesley, Reading, MA, 1985.

....elc. This paper describes file enhauccmenls made, to tim LKB system [6] in order to support linking ol lexical entries to their translation equivalents. The orgauisation of Ihe paper is as follows: Section 2 presents the motivations and formalisation of tlinks (for translation links ) Section 3 deals with TGE (Tlinks Generation Environment) the way we propose to help in constructing lexical liukages semi automatically from LKB data and bilingual dictionaries [13] 8] loaded in the LDB (Lexical Data Base) environment [5] Section 4 shows tile LiSt of TOE I This researcher has been ....

.... of Ihe paper is as follows: Section 2 presents the motivations and formalisation of tlinks (for translation links ) Section 3 deals with TGE (Tlinks Generation Environment) the way we propose to help in constructing lexical liukages semi automatically from LKB data and bilingual dictionaries [13] 8] loaded in the LDB (Lexical Data Base) environment [5] Section 4 shows tile LiSt of TOE I This researcher has been snported by tt .grant of the Departament d Ensenyament tf Genera[itttt tie Cctttthmyti. DOCG 1491. 2 This researcher has been snporled by o grater q the Ministerio de ....

[Article contains additional citation context not shown here]

Brownston L., F,'m'ell R., Kant, E., Martin N., Programming Expert Systems in OPSS. AddisonWesley. 1986.

....which the two systems co operate. In addition, we show how bottom up programming benefits from the support provided. In our discussion, we focus on rule based bottom up inference systems written in OPS5. The OPS family of programming languages is inextricably connected with bottom up programming, [Brownston et al. 1985; Neiman Martin, 1986; Forgy, 1991] This family of languages already has a long standing history, yet many of today s production systems are still being built using an OPS language. The success of these languages can be attributed to a large extent to the matching algorithm incorporated, ....

L. Brownston, R. Farrell, E. Kant and N. Martin (1985). Program- ming Expert Systems in OPS5, Addison-Wesley, Reading, Massachusetts.

....such as M;N ; to denote multisets. 3 Objects and Specificity In this section we approach the main notions of this paper, viz. objects and specificity. Let f be an n ary function symbol and t i , 1 i n , be terms. In the terminology of frame based or production systems like OPS5 [10], f denotes a slot and the t i denote fillers. For example, when modeling a movable object we may wish to specify its location with the help of a unary function symbol at such that at (3) denotes that the object is at location 3 ; when modeling a Chinese vase, we may wish to specify that it is ....

L. Brownston, R. Farrell, E. Kant, and N. Martin. Programming Expert Systems in OPS5. Addison-Wesley, 1985.

....the sense that this algorithm classi es a condition element as an entity and then looks at its tests, type and joinability. 4 Results This approach of transforming OPS5 Production System programs and then executing them has been implemented and tested using four wellknown OPS5 PS programs, MAB [4], WALTZ [8] RUBIK 5 and MAPPER [11] Table 2 presents a break down of the objects generated by the transformation of these programs. The behaviour of these PS programs at run time have been analysed in detail in [7] and a summary of the performance of this approach using three strategies ....

L. Brownston, R. Farrell, E. Kant, and N. Martin. Programming Expert Systems in OPS5. Addison Wesley, Reading, Mass., 1985.

....system code The answer may include compile time weaving and altering the run time interpretation process. 5. Aspect Oriented Languages To return to Tzilla s question, what s an aspect oriented language Let us consider some possibilities: Rule based systems. Rule based systems like OPS 5 [4] or, to a lesser extent, Prolog are programming with purely dynamically quantified statements. Each rule says, whenever the condition is true, do the corresponding action. 7 If we all programmed with rules, we wouldn t have AOP discussions. We would just talk about how rules that expressed ....

Brownston, L., Farrell, R., Kant, E. and Martin, N. Programming Expert Systems in OPS5. Reading, Massachusetts: Addison-Wesley, 1985.

.... explicit delete and insert operations are gaining more and more attention (e.g. AV90, AV91a, NK88, MW88] Such computations arise not only in databases with so called active features (e.g. Esw76, BC79, SHP88, dMS88, MD89, Han89, HJ91, Wid91] but also in production rule systems (e.g. OPS5 [BFKM85], RDL1 [dMS88] However, little is known about the optimization of such computations. The main known technique is seminaive, or differential, computation (see [BR86] However, it applies only to relations that are used monotonically. The technique presented here can be viewed as a generalization ....

L. Brownston, R. Farrel, E. Kant, and N. Martin. Programming Expert Systems in OPS5. Addison Wesley, 1985.

....of the atomized knowledge, require considerable effort in establishing context for each atomic knowledge element [4] and demand circumlocutions and idioms to obtain conventional control patterns such as loops and conditionals. Prominent examples of rule languages include Prolog [5] and OPS5 [6]. Almost every multiparadigm AI tool has some form of a rule language. Because rules have some of the semantics of if then else expressions, rules can be run (chained) either in a forward or backward direction. Forward chaining requires following all the consequences of an assertion. That is, ....

L. Brownston, R. Farrell, E. Kant and N. Martin, Programming Expert Systems in OPS5, Addison-Wesley, Reading, Massachusetts (1985).

....conflict set is empty, the inference engine stops inferencing and reports the failure to the user. If the conflict set is not empty and contains more than one rule, the inference engine selects one rule from the conflict set by applying one or more of the following conflict resolution strategies[20]. ffl Specificity ordering : if there are two rules and the condition part of one rule is more specific than the other, discard the latter. ffl Rule ordering : if there are many rules, choose the first rule. ffl Recency ordering : if there are many rules, choose the most (or least) recently ....

....the host must compare a fact element with a group of related rules and facts. Thus, the size of the group can be important in that the comparison time depends on the number of data in the group. One of the major characteristics of the rule based programming environment is modularity and hierarchy [20]. These stem from the fact that the structure of human knowledge can be modeled in a modular and hierarchical structure such as a tree, where each node represents a module which is composed of a small number of rules and facts. In this tree (from a high level view point) checking whether an ....

L. Brownston, R. Farrell, E. Kant, and N. Martin, Programming Expert Systems in OPS5, (Addison-Wesley, Mass., 1985), Ch.1.

....the conflict set is empty, the inference engine stops inferencing and reports the failure to the user. If the conflict set is not empty and contains more than one rule, the inference engine selects one rule from the conflict set by applying a conflict resolution strategy such as the Rule ordering [18]. 3. Act : The inference engine fires the selected rule by executing its action. Since the current facts are changed by the fired rule, it is important to check whether the changes agree with predefined goals. If the goals are satisfied, the inference engine stops inferencing and reports results ....

....of the action variable means to drive. Next, we discuss the scalibility problem where the given knowledge base (rules and facts) size exceeds the capacity of a given optical implementation. In RBS, this scalibility problem is solved by taking advantage of the modular characteristic of the RBS[18]. This characteristic stems from the fact that the structure of human knowledge can be modeled in a modular and hierarchical structure. Thus, if the size of the given knowledge base is greater than the size of the available hardware, the problem should be partitioned into a set of subproblems ....

L. Brownston, R. Farrell, E. Kant, and N. Martin, Programming Expert Systems in OPS5, (Addison-Wesley, Mass., 1985), Ch.1.

....to the system, and subsequently reordered or modified. Existing rule engines did not appear to be appropriate for our needs, and thus we designed our own. As will become apparent in the following discussion, we required numerous capabilities not available in typical rule systems (such as OPS5 [BFKM85] Starburst s Query Rewrite rule engine incorporates the following features: 1. Rules of Arbitrary Complexity: Rules in our engine are pairs of functions in a procedural language such as C: a condition function, which does an arbitrary check and sets a flag TRUE or FALSE, and an action ....

L. Brownston, R. Farrell, E. Kant, and N. Martin. Programming Expert Systems in OPS5. Addison-Wesley Publishing Co., 1985.

....Rule 4 languages have promised to maintain the nice properties of relational languages, such as simplicity and theoretical foundation, while adding inferential features. Rule languages can be based on logical paradigm such as Datalog like language [22, 18] or on production one such as OPS5 [17]. Researches on rule languages started with logic languages and have resulted in a comprehensive theoretical framework to study declarative query languages. Production languages for databases still do not have a theoretical framework even if some languages and systems have been developed, for ....

L. Brownston, R. Farrell, E. Kant, and N. Martin. Programming Expert Systems in OPS5. Addison-Wesley, 1985.

.... empirical work includes ( Davis and Lenat [12] Rada [30] Rada [31] Politakis [33] G insberg [19] The literature on refinemen t of expert system s written in Prolog and OPS5 is h igh ly relevan t when a numeric mechan ism for uncertain reason ing is not used ( Shapiro [33] Brownston et al. [6]) Select other window and hit enter to continue. ## ## 6 As argued in ( Valtorta [40; 41] it is unrealistic to expect experts to judge the correctness of single ru le strengths when a rule is presen ted to them in isolation . This is independent of the seman tics ( or lack thereof) of ....

Brownston , L., R . Farrell, E. Kan t, and N . Martin . Programming Expert Systems in OPS5. Reading, Massachusetts: Addison-Wesley, 1985.

....are dealt with. 2 Architecture of the system IFS 2. 1 General characteristics The IFS system is a hybrid system enabling a frame based knowledge representation relying on the IMKA standard proposal for frames ( 19] and a rule based knowledge deduction in a setting inspired by the OPS5 system([3]) Frames and rules are extended to enable dealing with uncertain knowledge. Three approaches to uncertainty processing are supported in the system: the algebraic approach ( 11] 12] the approach based on the theory of evidence ( 11] 13] and the fuzzy set approach ( 28] The possibility to ....

L. Brownston, R. Farrel, E. Kant, and N. Martin. Programming Expert Systems in OPS5, 1985.

....core of our poster presentation. 2 Basic IFS concepts and their implementation The IFS system is a hybrid system enabling a frame based knowledge representation relying on the IMKA standard proposal for frames ( 3] and a rule based knowledge deduction in a setting inspired by the OPS5 system([1]) The integration of the factual knowledge, rule base and inference mechanism is in the IFS system performed by means of the object oriented paradigm. Consequently, all frames, slots and relations, as well as rules, sets of rules and all aspects of the inference process are viewed as particular ....

L. Brownston, R. Farrel, E. Kant, and N. Martin. Programming Expert Systems in OPS5, 1985.

....SEISD environment and was mainly motivated by the need of providing a flexible and open way of defining tlink formation mechanisms. The core of TGE is PRE (production rules environment) a rule oriented general purpose interpreter [2] PRE follows the philosophy of most Production Rules Systems [3] but is deeply adapted to Natural Language applications. PRE offers a powerful (according to both expressiveness and performance) rule application mechanism and provides the possibilities of defining higher level mechanisms, as rulesets (allowing inheritance capabilities) and of choice among ....

Brownston L., Farrell R., Kant, E., Martin N., Programming Expert Systems in OPS5. AddisonWesley. 1986.

....3. Act. Adapt the working memory according to the actions defined in the RHS of the selected rule, perhaps adding a new item or deleting an old one. 4. Goto (1) for further 3 phase match conflict resolution act cycles. There are many advantages in production systems (Barr Feigenbaum 1981; Brownston et al. 1985; Wu 1990) such as expressibility, modularity, uniformity and naturalness, but there are also several significant disadvantages inherent in the formalism (Wu 1990) We summarize these below: 1.1 Low efficiency In the basic forward chaining algorithm, each 3 phase matching conflict ....

....how many cycles are needed for each problem solving. General production system matching is still NP hard and existing rule based programming can not abolish combinatorial explosion in nature (Jackson 1990) although in practical applications, the conflict resolution strategies, such as LEX and MEA (Brownston et al. 1985) employed in OPS5, are hoped to choose rules that lead to a reasonable solution. Efficiency is still an important consideration in rule based production systems since they may be expected to exhibit high performance in interactive domains or realtime domains. 1.2 Lack of flexibility in expressing ....

Brownston, L., Farrell, R., Kant, E., and Martin, N. 1985. Programming Expert Systems in OPS5. Addison-Wesley.

....attack is successful. When the system halts, then the history of rule firings can give an attack strategy. Until then, nothing can be said about the given attack. In fact, in some cases, the search space is infinite and the system does not even halt. Longley et al. use a rule based system, OPS5 [9]. This system uses rules to transform goals into subgoals, and this process is continually refined until a concrete attack strategy is reached. In a later work [43] Longley and Rigby present a PROLOG implementation of their rule based scheme. The attacker is modeled using a search tree. The root ....

L. Brownston and E. Kant. Programming Expert Systems in OPS5. Addison Wesley, 1985.

....Finally, we describe the extraction of rule schemata from rules in Section 5. 2 Rule Schema Rule Body: A 2 Level Representation 2. 1 The syntax The grammar used in rule schema rule body is that of (factor, value) pairs as opposed to (object, attribute, value) triples in OPS5 like languages [Brownston et al. 85] Definition 1. A factor, which has a similar meaning to an attribute in M.1, EXPERT and KES [Harmon King 85] is a name involved in a domain expertise. It can be a logical assertion, a discrete set variable or a continuous numeric variable. Definition 2. A rule schema has a rule like ....

L. Brownston, R. Farrell, E. Kant & N. Martin, Programming Expert Systems in OPS5, Addison-Wesley, 1985.

....is executed (i.e. the rule is triggered) when the condition becomes true. We believe that CA rules are more suitable for integration in a query language, since they are more declarative. CA rules make physical events implicit, just as a query language makes database navigation implicit. OPS5 [Bro85] and Ariel [Han92] have similar rule semantics. Unlike those systems, the condition in an AMOS rule can refer to derived AMOSQL functions (which correspond to views) Data can be passed from the condition to the action of each rule by using shared query variables. By quantifying query variables ....

Brownston L., Farell R., Kant E., Martin A., Programming Expert Systems in OPS5, Addison-Wesley, Reading Mass., 1986.

No context found.

L. Brownston, R. Farrell, E. Kant, and N. Martin. Programming Expert Systems in OPS5. Addison-Wesley, Reading, Massachusetts, 1985.

No context found.

L. Brownston, R. Farrell, E. Kant, and N. Martin. Programming Expert Systems in OPS5. Addison-Wesley, Reading, Massachusetts, 1985.

No context found.

Brownston, Lee, et al. Programming Expert Systems in OPS5 Addison-Wesley Publishing Company, Inc. 1985.

No context found.

Brownston, L., Farrell, R., Kant, L. and Martin N. Programming Expert Systems in OPS5. Addison Wesley, 1985.

No context found.

Brownston, Lee; et al.: Programming Expert Systems in OPS5. Addison-Wesley Publishing Co. Inc., 1985.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC