Abstract
In this paper, we focus on the linguistic-valued logic system with truth-values in the lattice-ordered linguistic truth-valued algebra, then investigate its satisfiability problem and its corresponding Quasi-Horn-clause logic framework, while their soundness and completeness theorems are provided. The present framework reflects the symbolic approach acts by direct reasoning on linguistic truth values, i.e., reasoning with words, and provides a theoretical support for natural-language based reasoning and decision making system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Robinson, J.P.: A machine-oriented logic based on the resolution principle. J. of A.C.M. 12, 23–41 (1965)
Lee, R.C.T.: Fuzzy logic and the resolution principle. Journal of A.C.M. 19, 109–119 (1972)
Liu, X.H., Xiao, H.: Operator fuzzy logic and fuzzy resolution. In: Proc. of the 5th IEEE Inter. Symp. on Multiple-Valued Logic (ISMVL´85), Kingstion, Canada, pp. 68–75. IEEE, Los Alamitos (1985)
Mukaidono, M.: Fuzzy inference of resolution style. In: Yager, R.R. (ed.) Fuzzy Sets and Possibility Theory, pp. 224–231. Pergamon Press, New York (1982)
Dubois, D., Prade, H.: Resolution principle in possibilistic logic. Int. J. of Approximate Reasoning 4(1), 1–21 (1990)
Weigert, T.J., Tsai, J.P., Liu, X.H.: Fuzzy operator logic and fuzzy resolution. Journal of Automated Reasoning 10(1), 59–78 (1993)
Kim, C.S., Kim, D.S., Park, J.S.: A new fuzzy resolution principle based on the antonym. Fuzzy Sets and Systems 113(2), 299–307 (2000)
Morgan, C.G.: Resolution for many-valued logics. Logique et Analyses 19(74-76), 311–339 (1976)
Orlowska, E.: Mechanical proof methods for Post logics. Logique et Analyse 28(110), 173–192 (1985)
Schmitt, P.H.: Computational aspects of three-valued logic. In: Siekmann, J.H. (ed.) 8th International Conference on Automated Deduction. LNCS, vol. 230, pp. 190–198. Springer, Heidelberg (1986)
Hahnle, R.: Automated Deduction in Multiple-Valued Logics. Oxford University Press, Oxford (1993)
Blair, H.A., Subrahamnian, V.S.: Paraconsistent logic programming. Theoretical Computer Science 68, 135–154 (1989)
Kifer, M., Subrahamnian, V.S.: Theory of generalized annotated logic programming and its application. Journal of Logic Programming 12, 335–367 (1992)
Lu, J.J., Henschen, L.J.: The completeness of gp-resolution for annotated logic. Inform. Process. Lett. 44, 135–140 (1992)
Baaz, M., Fermuller, C.G.: Resolution for many valued logics. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol. 624, pp. 107–118. Springer, Heidelberg (1992)
Stachniak, Z.: Resolution Proof Systems: An Algebraic Theory. Kluwer Academic Publishers, Dordrecht (1996)
Lehmke, S.: A resolution-based axiomatisation of ‘bold’ propositional fuzzy logic. In: Dubois, D., Klement, E.P., Prade, H. (eds.) Fuzzy Sets, Logics, and Reasoning about Knowledge, Kluwer Academic Publishers, Dordrecht (1999)
Sofronie-Stokkermans, V.: Chaining techniques for automated theorem proving in finitely-valued logics. In: Proc. of the 2000 ISMVL, Portland, Oregon, pp. 337–344 (2000)
Xu, Y., et al.: α-resolution principle based on lattice-valued propositional logic LP(X). Information Sciences 130, 195–223 (2000)
Xu, Y., et al.: α-Resolution principle based on first-order lattice-valued logic LF(X). Information Sciences 132, 221–239 (2001)
Liu, J., et al.: A resolution-like strategy based on a lattice-valued logic. IEEE Transactions on Fuzzy Systems 11(4), 560–567 (2003)
Goguen, J.A.: The logic of inexact concepts. Synthese 19, 325–373 (1969)
Pavelka, J.: On fuzzy logic I: Many-valued rules of inference, II: Enriched residuated lattices and semantics of propositional calculi, III: Semantical completeness of some many-valued propositional calculi. Zeitschr. F. Math. Logik und Grundlagend. Math., 25: 45-52, 119-134, 447-464 (1979)
Novak, V.: First-order fuzzy logic. Studia Logica 46(1), 87–109 (1982)
Xu, Y., et al.: Lattice-Valued Logic: An Alternative Approach to Treat Fuzziness and Incomparability. Springer, Heidelberg (July 2003)
Xu, Y.: Lattice implication algebras (in Chinese). J. of Southwest Jiaotong Univ. 89(1), 20–27 (1993)
Ho, N.C., Wechler, W.: Hedge algebras: an algebraic approach to structure of sets of linguistic truth values. Fuzzy Sets and Systems 35, 281–293 (1990)
Herrera, F., Martínez, L.: A 2-tuple fuzzy linguistic representation model for computing with words. IEEE Trans. Fuzzy Systems 8(6), 746–752 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Liu, J., Martinez, L., Xu, Y., Lu, Z. (2007). Satisfiability in a Linguistic-Valued Logic and Its Quasi-horn Clause Inference Framework. In: Castillo, O., Melin, P., Ross, O.M., Sepúlveda Cruz, R., Pedrycz, W., Kacprzyk, J. (eds) Theoretical Advances and Applications of Fuzzy Logic and Soft Computing. Advances in Soft Computing, vol 42. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72434-6_64
Download citation
DOI: https://doi.org/10.1007/978-3-540-72434-6_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72433-9
Online ISBN: 978-3-540-72434-6
eBook Packages: EngineeringEngineering (R0)