|
|||||
|
|
An algorithm to compute maximal contractions for Horn clauses |
|
| Authors: | LUO Jie & LI Wei State Key Laboratory of Software Development Environment School of Computer Science Technology Beihang University Beijing China |
| Affiliation: | LUO Jie & LI Wei State Key Laboratory of Software Development Environment,School of Computer Science and Technology,Beihang University,Beijing 100191,China |
| Abstract: | In the theory of belief revision, the computation of all maximal subsets (maximal contractions) of a formula set with respect to a set of facts is one of the key problems. In this paper, we try to solve this problem by studying the algorithm to compute all maximal contractions for Horn clauses. First, we point out and prove the conversion relationship between minimal inconsistent subsets of union of the formula set and the set of facts and maximal contractions of the formula set with respect to the set of f... |
| Keywords: | maximal contraction minimal inconsistent set minimal subtraction Horn clause |
| 本文献已被 CNKI 维普 等数据库收录！ | |