Forgy, C.L. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence (19), 1982. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Documents 51 to 100 Previous 50 Next 50
Semantics for Update Rule Programs and Implementation in a.. - Raschid, Lobo (1991) (1 citation) (Correct)
....future research. Appendix 1 provides a translation from an update rule program to a normal logic program in the first order case. 2. A Syntax for Update Rule Programs In this section we introduce the syntax for specifying update rules. We borrow concepts from the OPS5 production system language [Forg81 and Forg82], as well as the Datalog language with procedural extensions [AbVi90, AbVi91] 2.1. Syntax for Update Rules An update rule consists of (1) the name (2) the antecedent on the left hand side (LHS) also referred to as the body of the rule, 3) the symbol , and (4) the consequent actions, on the ....
Forgy, C.L. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence (19), 1982.
An Overview of Abduction as a General Framework for.. - Menzies (1995) (Correct)
....can exist in multiple worlds. In the case of more than one world, the BEST criteria is applied to select the subset of W which the user wants to see. Numerous BEST s can be found in the literature; e.g. the BEST worlds are the one which contain (i) the most specific proofs (i.e. largest size) [12]; the fewest causes [38] the most number of specific concepts [33] the largest subset of E [29] the largest number of covered outputs [28] the most number of edges that model processes which are familiar to the user [32] the most number of edges that have been used in prior acceptable ....
C.L. Forgy. RETE: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, pages 17--37, 19 1982.
Optimized Rule Condition Testing in Ariel using Gator Networks - Eric Hanson (1995) (2 citations) (Correct)
....an active database system is the mechanism it uses to test rule conditions as the database changes. Tools for artificial intelligence programming known as production systems, such as OPS5 [2] use structures called discrimination networks for rule condition testing. For a number of years, the Rete [3] and TREAT [15] discrimination network algorithms have been used in production system implementations. Variations of TREAT have also been used in the Ariel [4, 6] and DATEX [1] active database projects. The difficulty with the standard Rete and TREAT algorithms is that they do not provide a way to ....
C. L. Forgy. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19:17--37, 1982.
Satisfaction-Oriented Fuzzy Reasoning - Peter Homeier (Correct)
....to a pre set conflict resolution strategy [11] one of these rules is chosen from the activation set and its consequent is executed. This is called firing the rule. Then the cycle repeats. In practice, the process of finding the activated rules is highly optimized using the Rete algorithm [6], 7] This processing does not regard the antecedent and consequent parts of a rule as merged into an homogeneous implication relation; rather it is more of the style of an if statement in a programming language, where if the test is true, the body may then be executed; as evidence of this, the ....
Forgy, C., "Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem," Artificial Intelligence, vol. 19, 1982, pp. 17-37.
Learning First Order Theories - Botta (1994) (1 citation) (Correct)
....to compute the extensional representation of hypotheses. Extensional Theorem Prover Learning Module Relational Database Domain Theory Learned Theory Fig. 1 System architecture. The deduction procedure implements the resolution principle in a bottom up fashion similar to the OPS5 inference engine [9]. Two characteristics of bottom up theorem provers motivated this choice: bottom up methods are generally more efficient than top down ones; moreover, they are complete for stratified programs. This second property allows recursive predicates in the domain theory to be managed. In particular, the ....
Forgy, C.L. "RETE: A Fast Algorithm for the many Pattern/many Object Pattern Match Problem", Artificial Intelligence, 19, 17-37, 1982.
Engineering Knowledge-Based Software for Large Embedded Systems - Bouteldja (1989) (1 citation) (Correct)
No context found.
Forgy C.L. Rete: a fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence 19, 1, 1982, 17-37.
Documents 51 to 100 Previous 50 Next 50
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