A heuristic in rules-based systems

The aim of this paper is to present a probability measure associated to the set of complex formulas of P (set of single logic propositions), CP. This probability measure will be used in the construction of heuristic algorithms in artificial intelligence problems. Throughout this work it will be seen how knowledge base systems (KBS) act when they receive incomplete information. Calculation of KBS inconsistent entries will also be assessed. A nonmonotonic reasoning system is involved in the approximate reasoning system studied in the present project.

[1]  Fahiem Bacchus,et al.  Representing and reasoning with probabilistic knowledge , 1988 .

[2]  John R. Hayes,et al.  The Complete Problem Solver , 1981 .

[3]  Nils J. Nilsson,et al.  Probabilistic Logic * , 2022 .

[4]  Henrik Legind Larsen,et al.  Modeling in the design of a KBS validation system , 1991, Int. J. Intell. Syst..

[5]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[6]  Donald W. Barnes,et al.  An Algebraic Introduction to Mathematical Logic , 1975 .