Theory of Approximate Reasoning in Two-Valued Predicate Logic Based on the Quasi-truth Degrees

Based on the theory of the quasi-truth degrees in two-valued predicate logic, some researches on approximate reasoning are studied in this paper. The relation of the pseudo-metric between first-order formulae and the quasi-truth degrees of first-order formulae is discussed, and it is proved that there is no isolated point in the logic metric space (F, ρ ). Thus the pseudo-metric between first-order formulae is well defined to develop the study about approximate reasoning in the logic metric space (F, ρ ). Then, three different types of approximate reasoning patterns are proposed, and their equivalence under some condition is proved. This work aims at filling in the blanks of approximate reasoning in quantitative predicate logic.

Modeling Trusted Computing

In this paper, a formal approach based on predicate logic is proposed for representing and reasoning of trusted computing models. Predicates are defined to represent the characteristics of the objects and the relationship among these objects in a trusted system according to trusted computing specifications. Inference rules of trusted relation are given too. With the semantics proposed, some trusted computing models are formalized and verified, which shows that Predicate calculus logic provides a general and effective method for modeling and reasoning trusted computing systems.

The question answer system based on natural language understanding

Automatic Question Answer System(QAS)is a kind of high-powered software system based on Internet.Its key technology is the interrelated technology based on natural language understanding,including the construction of knowledge base and corpus,the Word Segmentation and POS Tagging of text,the Grammatical Analysis and Semantic Analysis of sentences etc.This thesis dissertated mainly the denotation of knowledge-information based on semantic network in QAS,the stochastic syntax-parse model named LSF of knowledge-information in QAS,the structure and constitution of QAS.And the LSF model's parameters were exercised,which proved that they were feasible.At the same time,through "the limited-domain QAS" which was exploited for banks by us,these technologies were proved effective and propagable.

A programmable approach to revising knowledge bases

This paper presents a programmable approach to revising knowledge bases consisting of clauses. Some theorems and lemmas are shown in order to give procedures for generating maximally consistent subsets. Then a complete procedure and an incomplete procedure for generating the maximal consistent subsets are presented, and the correctness of the procedures is also shown. Furthermore, a way to implement knowledge base revision is presented, and a prototype system is introduced. Compared with related works, the main characteristic of our approach is that the approach can be implemented by a computer program.

Semantic Description and Verification of Security Policy Based on Ontology

To solve the shortage problem of the semantic descrip- tion scope and verification capability existed in the security policy, a semantic description method for the security policy based on ontology is presented. By defining the basic elements of the security policy, the relationship model between the ontology and the concept of security policy based on the Web ontology language （OWL） is established, so as to construct the semantic description framework of the security policy. Through modeling and reasoning in the Protege, the ontology model of authorization policy is proposed, and the first-order predicate description logic is introduced to the analysis and verification of the model. Results show that the ontology-based semantic description of security policy has better flexibility and practicality.