A SET-THEORETIC APPROACH TO THE LOGICAL INFERENCE IN KNOWLEDGE BASES

I. A. Bessmertny


Read the full article  ';

Abstract

 

The paper concerns to the problem of combinatorial complexity of inference in artificial intelligence applications based on production rules. An approach to speeding up the knowledge acquisition is proposed that specifies
indexing the facts and operations with sets of indices to prune unnecessary facts. In contrast to the most known algorithms that provide pre-collecting facts in nodes of the search tree, the indices exist apart from the rule sets,
that allows disjointing bases of facts and bases of rules logically and physically and to simplify the knowledge base updating. An opportunity of alternation the matching оf rules to set-theoretic operation on tuples of
variables is proven.

Keywords: artificial intelligence, facts indexing, inference

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
Copyright 2001-2024 ©
Scientific and Technical Journal
of Information Technologies, Mechanics and Optics.
All rights reserved.

Яндекс.Метрика