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 facts. Second, we prove a necessary condition of a set of Horn clauses to be minimal inconsistent. Then, based on these two conclusions, we propose an interactive algorithm to enumerate all minimal inconsistent subsets of a given set of Horn clauses and a second algorithm to compute maximal contractions from these minimal inconsistent subsets. Finally, we proposed an interactive algorithm to compute maximal contractions for Horn clauses by composing the above two algorithms.
Similar content being viewed by others
References
Li W. A logical framework for evolution of specifications. In: programming languages and systems—ESOP’94. LNCS 788, Berlin: Springer-Verlag, 1994. 394–408
Li W. R-calculus: an inference system for belief revision. Comput J, 2007, 50: 378–390
Li W. Mathematical Logic — Foundations For Information Science. Basel: Birkhäuser Verlag, 2010
Gallier J H. Logic for Computer Science: Foundations of Automatic Theorem Proving. New York: Harper & Row, 1986
Delgrande J P. Horn Clause Belief Change: Contraction Functions. In: Proc KR 2008. Menlo Park: AAAI Press, 2008. 156–165
Booth R, Meyer T, Varzinczak I J. Next steps in propositional Horn contraction. In: Proc IJCAI 2009. Menlo Park: AAAI Press, 2009. 702–707
Alchourrón C E, Gärdenfors R, Makinson D. On the logic of theory change: partial meet contraction and revision functions. J Symbolic Logic, 1985, 50: 510–530
Gärdenfors P. Knowledge in Flux. Modeling the Dynamics of Epistemic States. Cambridge: The MIT Press, 1988
Gärdenfors P, Makinson D. Revisions of Knowledge Systems Using Epistemic Entrenchment. In: Second Conference on Theoretical Aspects of Reasoning about Knowledge, San Francisco: Morgan Kaufmann Publishers Inc., 1988. 83–95
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Luo, J., Li, W. An algorithm to compute maximal contractions for Horn clauses. Sci. China Inf. Sci. 54, 244–257 (2011). https://doi.org/10.1007/s11432-010-4172-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-010-4172-9