The Research Of Non-revision Method For Propositional Beliefs

The representation and reasoning of Knowledge is considered to be one of the most important research content, in these studies, logic plays an important role. The typical behavior of cognitive intelligence is logical reasoning, but in the process of reasoning, the inconsistent beliefs generated by different reasons made the contradiction appeared in the knowledge base. In order to carry on maintaining the coordination of different types of knowledege base has important significance in promoting the research of artificial intelligence, especially based on the knowledege reasoning.The main idea of nonmonotonic logic is reasoning in the case of incomplete knowledge. It has revised the contradiction which is caused by adding new knowledge and maitained the coordination of knowledge base. However, revising the existing knowledge always appears such situation that the system lost some hoped conclusion which can be deduced. Aiming at above problems, professor AnshengDeng came up with non-revision method overcoming the shortcomings of belief revision. The superiority of this method is that we can not only get the unique result set but also when using this method in the classical logic, it presents nice properties such as consistency, closure and extensionality and so on. The main idea of this paper is to extend the application of belief non-revision method and make this method be more general.(1) The grammatical form of assumptions are limited to a set of AND-OR sentences in propositional logic; the extension of assumptions are constructed by generalized resolution method, and proves that the extension of assumptions satisfy nice properties such as consistency, closure and extensionality and so on.(2) This paper has a research on the epistemic process of AND-OR sentences in propositional logic. Firstly, the epistemic process is defined in AND-OR assumption; secondly, provide the conditions of how to judeg the epistemic process is convergent. At last, it prove that the the epistemic process of the extension of assumption is convergent.(3) Completing the experiment of arithmetic of reasoning. Firstly, completing the arithmetic of resolution set according to the process of reasoning which is carried out by generalized resolution method. Secondly, completing the arithmetic of conclusion set according to the defination of assumption’s extension. Finally, integrating them to the whole reasoning arithmetic.This paper will extend the application of non-revision beliefs method which is based on the AND-OR sentences of propositional logic, and it has a breakthrough on the restriction of belief’s grammatical form. At the same time, the application of the generalized resolution can make a more nature description on issues.