Computational reasoning based on complemented distributive lattices
Computational reasoning is a practical description of computational logic. In this paper, a new concrete computational reasoning method based on complemented distributive lattices is proposed. Based on some logical operators, an inclusion degree on complemented distributive lattices is defined, which is employed to define the truth degree. Some basic properties of the truth mapping are examined. Then a kind of reasoning by computing in the framework of complemented distributive lattices is developed. The potential value of dealing with knowledge acquisition is expected in future.
computational reasoning lattice inclusion degree implication operator