Abstract
This paper proposes a revision algorithm based on decomposition. A set of decomposing rules are presented to analyze the satisfiability of propositions. It is proved that the satisfiability of a given set is equivalent to whether there exists a consistent leaf on its decomposition tree. Based on these rules, a deductive decomposing function \( Div \) is given, and it can calculate all consistent leaves of a decomposition tree. A revision algorithm based on the decomposing function is proposed, which can calculate maximal contractions for given sets. The algorithm has a complexity of \( O(2^{n} m), \) and the decomposition-based tactic improves the efficiency of the algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alchourron C, Gardenfors P, Makinson D (1985) On the logic of theory change: partial meet contraction and revision functions. J Symb Log 50(2):510–530
Katsuno H, Mendelzon AO (1989) A unified view of propositional knowledge base updates, vol 3(8). In: Proceedings of the 11th international joint conference on artificial intelligence, Morgan Kaufmann Publishers, Burlington, pp 1413–1419
Dalal M (1988) Investigations into a theory of knowledge base revision: preliminary report, vol 2(2). In: Proceedings of the seventh national conference on artificial intelligence, AAAI Press, Cambridge, pp 475–479
Nebel B (1991) Belief revision and default reasoning: syntax -based approaches, vol 8(4). In: Proceedings of the second international conference on principles of knowledge representation and reasoning, Cambridge, pp 417–428
Li W (1994) A logical framework for evolution of specifications, vol 7(3). In: Proceedings of the 5th European symposium on programming, Springer, Edinburgh, pp 394–408
Luo J, Li W (2011) An algorithm to computer maximal contractions for Horn clauses. Sci China Ser F: Inf Sci 52(2):244–257
Jiang D, Lou Y, Ji Y (2010) A revision approach based on assignment equivalence classes, vol 7(3). In: Proceedings of the second international workshop on intelligent systems and applications, Wuhan, pp 1199–1202
Acknowledgments
Supported by the SKLSDE Project (Grant No. SKLDE-2011ZX-22)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this paper
Cite this paper
Jiang, D.C., Lou, Y.H. (2013). A Revision Approach Based on Decomposition. In: Zhong, Z. (eds) Proceedings of the International Conference on Information Engineering and Applications (IEA) 2012. Lecture Notes in Electrical Engineering, vol 217. Springer, London. https://doi.org/10.1007/978-1-4471-4850-0_44
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4850-0_44
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4849-4
Online ISBN: 978-1-4471-4850-0
eBook Packages: EngineeringEngineering (R0)