Inference machine

from Wikipedia, the free encyclopedia

An inference engine (lehnübersetzt from the English inference engine ), and Rule Interpreter , and inference engine , called is part of a knowledge-based system, which derives by the processing of knowledge from the knowledge base given new statements. The inference machine and the knowledge base are thus the two central components of a knowledge-based system .

Classic inference rules

The inference engine applies various so-called inference rules to the facts of the knowledge base. An often used rule is e.g. B. the modus ponens : Here, the two statements A -> B and A conclude that B is correct. From the two statements "When the daffodils bloom, it is spring." And "The daffodils bloom" one can deduce that it is spring.

Another important rule of inference is the and-elimination: Here, the truth of a conjunction is deduced from the truth of its individual parts. From the statement “she ate an ice cream with cream”, the two statements “she ate an ice cream” and “she ate cream” can be derived with the help of the and elimination.

Proof by resolution

The application of the inference rules outlined above does not guarantee that all statements that can be derived from the knowledge base will be found in every possible case. However, this requirement is met by the resolution .

Forward and backward chaining

For many applications, using resolution is too inefficient. One option is to use forward chaining and backward chaining . Both algorithms require that the statements of the knowledge base are available as Horn's formula . A Horn formula is a disjunction of literals, at most one of which is positive (i.e. no negation).

swell

  1. ↑ Computer Based Marketing : The Handbook for Marketing Informatics - published in 2013 by Matthias Meyer , Hajo Hippner and Klaus D. Wilde ; there (on page 323) also with: "... consist of an inference engine (rule interpreter), [...]. In addition to the predicate logic, which provides the formal apparatus for understanding the interrelationships as well as the necessary solution methods, there are [...] "
  2. ↑ Dictionary of microelectronics and microcomputer technology with explanations ... - published in 2013 by Yvonne H Attiyate and Raymond Shah ; there (on page 434) u. a. with: "Inference machine f , inference machine f [artificial intelligence]"
  3. ↑ Christoph Beierle, Gabriele Kern-Isberner: Methods of knowledge-based systems. Basics, algorithms, applications. 5th, revised and expanded edition, Springer Vieweg, 2014, ISBN 978-3-8348-1896-6 .
  4. ^ Stuart Russell, Peter Norvig: Artificial Intelligence. A modern approach. Third Edition, Pearson, 2016, ISBN 0-13-604259-7 , pp.250.
  5. ^ Stuart Russell, Peter Norvig: Artificial Intelligence. A modern approach. Third Edition, Pearson, 2016, ISBN 0-13-604259-7 , pp.256.

literature

• Christoph Beierle, Gabriele Kern-Isberner: Methods of knowledge-based systems. Basics, algorithms, applications. 5th, revised and expanded edition, Springer Vieweg, 2014, ISBN 978-3-8348-1896-6 .
• Stuart Russell, Peter Norvig: Artificial Intelligence. A modern approach. Third Edition, Pearson, 2016, ISBN 0-13-604259-7 .