en.unionpedia.org

Rete algorithm, the Glossary

The Rete algorithm (rarely) is a pattern matching algorithm for implementing rule-based systems.^[1]

61 relations: Action selection, Alexander Bogomolny, Algorithm, Artificial Intelligence (journal), Attribute (computing), Backward chaining, Bayesian network, Business analyst, Business rules engine, Carnegie Mellon University, Charles Forgy, CLIPS, Computer memory, Conditional (computer programming), Cycle detection, Daniel P. Miranker, Data type, Decision tree, Directed acyclic graph, Double negation, Drools, Equality (mathematics), Existential quantification, Expert system, Fact, First-order logic, Forward chaining, Fuzzy logic, Hash table, IBM Operational Decision Management, Inference, Inference engine, Jess (programming language), Knowledge base, Linked list, Logical conjunction, Logical connective, Logical truth, Microsoft BizTalk Server, Negation as failure, Object (computer science), OPS5, Pattern matching, Priority queue, Probabilistic logic, Projection (relational algebra), Quantifier (logic), Reason maintenance, Rule of inference, Rule-based system, ... Expand index (11 more) »
Expert systems
Pattern matching

Action selection

Action selection is a way of characterizing the most basic problem of intelligent systems: what to do next.

See Rete algorithm and Action selection

Alexander Bogomolny

Alexander Bogomolny (January 4, 1948 July 7, 2018) was a Soviet-born Israeli-American mathematician.

See Rete algorithm and Alexander Bogomolny

Algorithm

In mathematics and computer science, an algorithm is a finite sequence of mathematically rigorous instructions, typically used to solve a class of specific problems or to perform a computation.

See Rete algorithm and Algorithm

Artificial Intelligence (journal)

Artificial Intelligence is a scientific journal on artificial intelligence research.

See Rete algorithm and Artificial Intelligence (journal)

Attribute (computing)

In computing, an attribute is a specification that defines a property of an object, element, or file.

See Rete algorithm and Attribute (computing)

Backward chaining

Backward chaining (or backward reasoning) is an inference method described colloquially as working backward from the goal. Rete algorithm and backward chaining are expert systems.

See Rete algorithm and Backward chaining

A Bayesian network (also known as a Bayes network, Bayes net, belief network, or decision network) is a probabilistic graphical model that represents a set of variables and their conditional dependencies via a directed acyclic graph (DAG).

See Rete algorithm and Bayesian network

Business analyst

A business analyst (BA) is a person who processes, interprets and documents business processes, products, services and software through analysis of data.

See Rete algorithm and Business analyst

Business rules engine

A business rules engine is a software system that executes one or more business rules in a runtime production environment. Rete algorithm and business rules engine are expert systems.

See Rete algorithm and Business rules engine

Carnegie Mellon University

Carnegie Mellon University (CMU) is a private research university in Pittsburgh, Pennsylvania.

See Rete algorithm and Carnegie Mellon University

Charles Forgy

Charles L. Forgy (born December 12, 1949, in Texas) is an American computer scientist, known for developing the Rete algorithm used in his OPS5 and other production system languages used to build expert systems.

See Rete algorithm and Charles Forgy

CLIPS

CLIPS (C Language Integrated Production System) is a public-domain software tool for building expert systems. Rete algorithm and CLIPS are expert systems.

See Rete algorithm and CLIPS

Computer memory

Computer memory stores information, such as data and programs, for immediate use in the computer.

See Rete algorithm and Computer memory

Conditional (computer programming)

In computer science, conditionals (that is, conditional statements, conditional expressions and conditional constructs) are programming language constructs that perform different computations or actions or return different values depending on the value of a Boolean expression, called a condition.

See Rete algorithm and Conditional (computer programming)

Cycle detection

In computer science, cycle detection or cycle finding is the algorithmic problem of finding a cycle in a sequence of iterated function values.

See Rete algorithm and Cycle detection

Daniel P. Miranker

Daniel P. Miranker is a Full Professor in the Department of Computer Sciences at the University of Texas at Austin.

See Rete algorithm and Daniel P. Miranker

Data type

In computer science and computer programming, a data type (or simply type) is a collection or grouping of data values, usually specified by a set of possible values, a set of allowed operations on these values, and/or a representation of these values as machine types.

See Rete algorithm and Data type

Decision tree

A decision tree is a decision support hierarchical model that uses a tree-like model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility.

See Rete algorithm and Decision tree

Directed acyclic graph

In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles.

See Rete algorithm and Directed acyclic graph

Double negation

In propositional logic, the double negation of a statement states that "it is not the case that the statement is not true".

See Rete algorithm and Double negation

Drools

Drools is a business rule management system (BRMS) with a forward and backward chaining inference-based rules engine, more correctly known as a production rule system, using an enhanced implementation of the Rete algorithm.

See Rete algorithm and Drools

Equality (mathematics)

In mathematics, equality is a relationship between two quantities or, more generally, two mathematical expressions, asserting that the quantities have the same value, or that the expressions represent the same mathematical object.

See Rete algorithm and Equality (mathematics)

Existential quantification

In predicate logic, an existential quantification is a type of quantifier, a logical constant which is interpreted as "there exists", "there is at least one", or "for some".

See Rete algorithm and Existential quantification

Expert system

In artificial intelligence (AI), an expert system is a computer system emulating the decision-making ability of a human expert. Rete algorithm and expert system are expert systems.

See Rete algorithm and Expert system

Fact

A fact is a true datum about one or more aspects of a circumstance.

See Rete algorithm and Fact

First-order logic

First-order logic—also called predicate logic, predicate calculus, quantificational logic—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science.

See Rete algorithm and First-order logic

Forward chaining

Forward chaining (or forward reasoning) is one of the two main methods of reasoning when using an inference engine and can be described logically as repeated application of modus ponens. Rete algorithm and forward chaining are expert systems.

See Rete algorithm and Forward chaining

Fuzzy logic

Fuzzy logic is a form of many-valued logic in which the truth value of variables may be any real number between 0 and 1.

See Rete algorithm and Fuzzy logic

Hash table

In computing, a hash table is a data structure often used to implement the map (a.k.a. dictionary or associative array) abstract data type.

See Rete algorithm and Hash table

IBM Operational Decision Management

IBM Operational Decision Manager (ODM) is IBM's Business Rule Management System (BRMS).

See Rete algorithm and IBM Operational Decision Management

Inference

Inferences are steps in reasoning, moving from premises to logical consequences; etymologically, the word infer means to "carry forward".

See Rete algorithm and Inference

Inference engine

In the field of artificial intelligence, an inference engine is a software component of an intelligent system that applies logical rules to the knowledge base to deduce new information. Rete algorithm and inference engine are expert systems.

See Rete algorithm and Inference engine

Jess (programming language)

Jess is a rule engine for the Java computing platform, written in the Java programming language. Rete algorithm and Jess (programming language) are expert systems.

See Rete algorithm and Jess (programming language)

Knowledge base

In computer science, a knowledge base (KB) is a set of sentences, each sentence given in a knowledge representation language, with interfaces to tell new sentences and to ask questions about what is known, where either of these interfaces might use inference.

See Rete algorithm and Knowledge base

Linked list

In computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory.

See Rete algorithm and Linked list

Logical conjunction

In logic, mathematics and linguistics, and (\wedge) is the truth-functional operator of conjunction or logical conjunction.

See Rete algorithm and Logical conjunction

Logical connective

In logic, a logical connective (also called a logical operator, sentential connective, or sentential operator) is a logical constant.

See Rete algorithm and Logical connective

Logical truth

Logical truth is one of the most fundamental concepts in logic.

See Rete algorithm and Logical truth

Microsoft BizTalk Server

Microsoft BizTalk Server is an inter-organizational middleware system (IOMS) that automates business processes through the use of adapters which are tailored to communicate with different software systems used in an enterprise.

See Rete algorithm and Microsoft BizTalk Server

Negation as failure

Negation as failure (NAF, for short) is a non-monotonic inference rule in logic programming, used to derive \mathrm~p (i.e. that p is assumed not to hold) from failure to derive p. Note that \mathrm ~p can be different from the statement \neg p of the logical negation of p, depending on the completeness of the inference algorithm and thus also on the formal logic system.

See Rete algorithm and Negation as failure

Object (computer science)

In computer science, an object is a programming element that has state, has associated operations and is accessed via an identifier.

See Rete algorithm and Object (computer science)

OPS5

OPS5 is a rule-based or production system computer language, notable as the first such language to be used in a successful expert system, the R1/XCON system used to configure VAX computers.

See Rete algorithm and OPS5

Pattern matching

In computer science, pattern matching is the act of checking a given sequence of tokens for the presence of the constituents of some pattern.

See Rete algorithm and Pattern matching

Priority queue

In computer science, a priority queue is an abstract data type similar to a regular queue or stack abstract data type.

See Rete algorithm and Priority queue

Probabilistic logic

Probabilistic logic (also probability logic and probabilistic reasoning) involves the use of probability and logic to deal with uncertain situations.

See Rete algorithm and Probabilistic logic

Projection (relational algebra)

In relational algebra, a projection is a unary operation written as \Pi_(R), where R is a relation and a_1,...,a_n are attribute names.

See Rete algorithm and Projection (relational algebra)

Quantifier (logic)

In logic, a quantifier is an operator that specifies how many individuals in the domain of discourse satisfy an open formula.

See Rete algorithm and Quantifier (logic)

Reason maintenance

Reason maintenanceDoyle, J., 1983.

See Rete algorithm and Reason maintenance

Rule of inference

In philosophy of logic and logic, a rule of inference, inference rule or transformation rule is a logical form consisting of a function which takes premises, analyzes their syntax, and returns a conclusion (or conclusions).

See Rete algorithm and Rule of inference

Rule-based system

In computer science, a rule-based system is a computer system in which domain-specific knowledge is represented in the form of rules and general-purpose reasoning is used to solve problems in the domain.

See Rete algorithm and Rule-based system

Selection (relational algebra)

In relational algebra, a selection (sometimes called a restriction in reference to E.F. Codd's 1970 paper and not, contrary to a popular belief, to avoid confusion with SQL's use of SELECT, since Codd's article predates the existence of SQL) is a unary operation that denotes a subset of a relation.

See Rete algorithm and Selection (relational algebra)

Soar (cognitive architecture)

Soar is a cognitive architecture, originally created by John Laird, Allen Newell, and Paul Rosenbloom at Carnegie Mellon University.

See Rete algorithm and Soar (cognitive architecture)

Software development

Software development is the process used to create software.

See Rete algorithm and Software development

Table (database)

In a database, a table is a collection of related data organized in table format; consisting of columns and rows.

See Rete algorithm and Table (database)

Tree (data structure)

In computer science, a tree is a widely used abstract data type that represents a hierarchical tree structure with a set of connected nodes.

See Rete algorithm and Tree (data structure)

Trie

In computer science, a trie, also called digital tree or prefix tree, is a type of ''k''-ary search tree, a tree data structure used for locating specific keys from within a set.

See Rete algorithm and Trie

Tuple

In mathematics, a tuple is a finite sequence or ordered list of numbers or, more generally, mathematical objects, which are called the elements of the tuple.

See Rete algorithm and Tuple

Universal quantification

In mathematical logic, a universal quantification is a type of quantifier, a logical constant which is interpreted as "given any", "for all", or "for any".

See Rete algorithm and Universal quantification

Variable (mathematics)

In mathematics, a variable (from Latin variabilis, "changeable") is a symbol that represents a mathematical object.

See Rete algorithm and Variable (mathematics)

Vertex (graph theory)

In discrete mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices).

See Rete algorithm and Vertex (graph theory)

XML

Extensible Markup Language (XML) is a markup language and file format for storing, transmitting, and reconstructing arbitrary data.

See Rete algorithm and XML

References

[1] https://en.wikipedia.org/wiki/Rete_algorithm

Also known as Rete II, Rete network, Rete resolution algorithm, Rete2, ReteOO.

, Selection (relational algebra), Soar (cognitive architecture), Software development, Table (database), Tree (data structure), Trie, Tuple, Universal quantification, Variable (mathematics), Vertex (graph theory), XML.

Rete algorithm, the Glossary

Table of Contents

See also

Expert systems

Pattern matching

References