Abstract
Resolution principle is the rule of inference at the basis of most procedures for automated reasoning both in classic logic and possibilistic logic. In these procedures, deduction starts by inferring new clauses by resolution, and goes on until the empty clause is generated or consistency of the set of clauses is proven, e.g. because no new clauses can be generated. Theorem proving using extension rule is a novel approach for reasoning in classic logic advanced by us recently. The key idea is to use the inverse of resolution and to use the inclusion-exclusion principle to circumvent the problem of space complexity. In this paper, we proposed a possibilistic extension of “extension rule”, which we called possibilistic extension rule. We showed that it outperformed possibilistic resolution-based method in some cases. And it is potentially a complementary method to possibilistic resolution rule.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dubois, D., Prade, H.: Necessity measures and the resolution principle. IEEE Trans. On Sys., Man and Cyber. 17, 474–478 (1987)
Dubois, D., Prade, H.: Resolution Principles in possibilistic logic. Int. Journal of Approximate Reasoning 4(1), 1–21 (1990)
Dubois, D., Lang, J., Prade, H.: Fuzzy sets in approximate reasoning-Part 2: logical approaches. Fuzzy sets and systems 40, 203–244 (1991)
Lin, H., Sun, J., Zhang, J.: Theorem Proving Based On Extension Rule. Journal of Automated Reasoning 31(1), 11–21 (2003)
Lin, H., Sun, J.: Knowledge Compilation Using Extension Rule. Journal of Automated Reasoning 32(2), 93–102 (2004)
Benferhat, S., Prade, H.: Compiling possibilistic knowledge bases. In: Proceedings of ECAI 2006 (2006)
Cayrol, D., Dubois, D., Prade, H.: Practical model-based diagnosis with qualitative possibilistic uncertainty. In: Proceedings of UAI 1995, pp. 68–76 (1995)
Dubois, D., et al.: Qualitative decision theory with preference relations and comparative uncertainty: An axiomatic approach. Artificial Intelligence 148, 219–260 (2003)
Selman, B., Kautz, H.A.: Knowledge compilation using Horn approximation. In: Proceedings of AAAI-1991, pp. 904–909. AAAI Press, Menlo Park (1991)
del Val, A.: Tractable databases: How to make propositional unit resolution complete through compilation. In: Doyle, J., Sandewall, E., Torasso, P. (eds.) Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, pp. 551–561 (1994)
Schrag, R.: Compilation for critically constrained knowledge bases. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pp. 510–515. AAAI Press, Menlo Park (1996)
Marquis, P.: Knowledge compilation using theory prime implicates. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), pp. 837–843 (1995)
del Val, A.: On some tractable classes in deduction and abduction. Artificial Intelligence 116, 297–313 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Minghao, Y., Sun, J. (2007). Extension or Resolution: A Novel Approach for Reasoning in Possibilistic Logic. In: Melin, P., Castillo, O., Ramírez, E.G., Kacprzyk, J., Pedrycz, W. (eds) Analysis and Design of Intelligent Systems using Soft Computing Techniques. Advances in Soft Computing, vol 41. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72432-2_61
Download citation
DOI: https://doi.org/10.1007/978-3-540-72432-2_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72431-5
Online ISBN: 978-3-540-72432-2
eBook Packages: EngineeringEngineering (R0)