N-tuple algebra-based probabilistic logic
Boris Alexandrovich Kulik · Journal of Computer and Systems Sciences International · 2007
The concept of “probabilistic logic” known in artificial intelligence needs a more through substantiation. A new approach to constructing probabilistic logic based on the n -tuple algebra developed by the author is proposed. A brief introduction is given to the n -tuple algebra and its properties that provide efficient paralleling of algorithms for solving problems of logical analysis of systems in computer implementation are generalized. Methods for solving direct and inverse problems of probabilistic simulation of logical systems are considered.