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 complet...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.展开更多
The paper presents an extension multi-laye r p erceptron model that is capable of representing and reasoning propositional know ledge base. An extended version of propositional calculus is developed, and its some prop...The paper presents an extension multi-laye r p erceptron model that is capable of representing and reasoning propositional know ledge base. An extended version of propositional calculus is developed, and its some properties is discussed. Formulas of the extended calculus can be expressed in the extension multi-layer perceptron. Naturally, semantic deduction of prop ositional knowledge base can be implement by the extension multi-layer perceptr on, and by learning, an unknown formula set can be found.展开更多
This paper gives an outline of knowledge base revision and some recently presented complexity results about propositional knowledge base revision. Different methods for revising propositional knowledge baize have been...This paper gives an outline of knowledge base revision and some recently presented complexity results about propositional knowledge base revision. Different methods for revising propositional knowledge baize have been proposed recently by several researchers, but all methods are intractable in the general case. For practical application, this paper presents a revision method for special case, and gives its corresponding polynomial algorithm.展开更多
基金This work was supposed by the National Fundamental Research 973 Program of China(Grand No．2002CB312103)； the National Natural Science Foundation of China(Grant Nos．60033020，70371052)．
文摘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.
文摘The paper presents an extension multi-laye r p erceptron model that is capable of representing and reasoning propositional know ledge base. An extended version of propositional calculus is developed, and its some properties is discussed. Formulas of the extended calculus can be expressed in the extension multi-layer perceptron. Naturally, semantic deduction of prop ositional knowledge base can be implement by the extension multi-layer perceptr on, and by learning, an unknown formula set can be found.
文摘This paper gives an outline of knowledge base revision and some recently presented complexity results about propositional knowledge base revision. Different methods for revising propositional knowledge baize have been proposed recently by several researchers, but all methods are intractable in the general case. For practical application, this paper presents a revision method for special case, and gives its corresponding polynomial algorithm.
