<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05128648</id>
  <dt>j</dt>
  <an>05128648</an>
  <augroup>
    <au>Luan, Shangmin</au>
    <au>Dai, Guozhong</au>
    <au>Li, Wei</au>
  </augroup>
  <ti>A programmable approach to revising knowledge bases.</ti>
  <so>Sci. China, Ser. F. 48, No. 6, 681-692 (2005).</so>
  <py>2005</py>
  <pu>Science in China Press, Beijing; Springer, Heidelberg</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1360/03yf0327</li>
  </ligroup>
  <abgroup>
    <ab>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.</ab>
    <rv></rv>
  </abgroup>
</item>