Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2015, Article ID 327390, 12 pages
http://dx.doi.org/10.1155/2015/327390
Research Article

A Modern Syllogistic Method in Intuitionistic Fuzzy Logic with Realistic Tautology

1Department of Electrical and Computer Engineering, Faculty of Engineering, King Abdulaziz University, P.O. Box 80204, Jeddah 21589, Saudi Arabia
2Department of Biomedical and Systems Engineering, Cairo University, Giza 12613, Egypt

Received 9 May 2015; Accepted 27 July 2015

Academic Editor: Guilong Liu

Copyright © 2015 Ali Muhammad Rushdi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. A. Robinson, “A machine-oriented logic based on the resolution principle,” Journal of the ACM, vol. 12, no. 1, pp. 23–41, 1965. View at Publisher · View at Google Scholar · View at MathSciNet
  2. R. C. Lee, “Fuzzy logic and the resolution principle,” Journal of the Association for Computing Machinery, vol. 19, no. 1, pp. 109–119, 1972. View at Publisher · View at Google Scholar · View at MathSciNet
  3. M. Mukaidono, Fuzzy Inference of Resolution Style, Pergamon Press, New York, NY, USA, 1982.
  4. M. Mukaidono, Z. Shen, and L. Ding, “Fuzzy prolog,” in Proceedings of the 2nd IFSA World Congress, pp. 844–847, Tokyo, Japan, July 1987.
  5. Z. Shen, L. Ding, and M. Mukaidono, “A theoretical framework of fuzzy prolog machine,” in Fuzzy Computing, pp. 89–100, 1988. View at Google Scholar
  6. Z. Shen, L. Ding, and M. Mukaidono, “Fuzzy resolution principle,” in Proceedings of the 18th International Symposium on Multiple-Valued Logic, pp. 210–215, IEEE, Palma de Mallorca, Spain, May 1988. View at Publisher · View at Google Scholar
  7. C. S. Kim, S. J. Lee, S. C. Park, and D. S. Kim, “Fuzzy hyper-resolution: a semantic inference rule with fuzzy concepts,” Korea Fuzzy Mathematics and Systems Society, vol. 3, no. 1, 1993. View at Google Scholar
  8. C. Kim, S. Park, D. Kim, and S. Lee, “A fuzzy hyper-resolution using compensatory operators,” Journal of the Korea Information Science Society, vol. 21, no. 9, pp. 520–527, 1994. View at Google Scholar
  9. C. S. Kim, D. S. Kim, and J. S. Park, “A new fuzzy resolution principle based on the antonym,” Fuzzy Sets and Systems, vol. 113, no. 2, pp. 299–307, 2000. View at Publisher · View at Google Scholar · View at MathSciNet
  10. B. R. Gaines, “Foundations of fuzzy reasoning,” International Journal of Man-Machine Studies, vol. 8, no. 6, pp. 623–668, 1976. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. Y. Tsukamoto, “An approach to fuzzy reasoning method,” in Advances in Fuzzy Set Theory and Applications, vol. 137, p. 149, Elsevier Science, 1979. View at Google Scholar
  12. M. Mizumoto and H.-J. Zimmermann, “Comparison of fuzzy reasoning methods,” Fuzzy Sets and Systems, vol. 8, no. 3, pp. 253–283, 1982. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. D. Dubois and H. Prade, “Fuzzy logics and the generalized modus ponens revisited,” Cybernetics and Systems, vol. 15, no. 3-4, pp. 293–331, 1984. View at Publisher · View at Google Scholar · View at MathSciNet
  14. P. Magrez and P. Smets, “Fuzzy modus ponens: a new model suitable for applications in knowledge-based systems,” International Journal of Intelligent Systems, vol. 4, no. 2, pp. 181–200, 1989. View at Publisher · View at Google Scholar · View at Scopus
  15. H. Takagi and I. Hayashi, “NN-driven fuzzy reasoning,” International Journal of Approximate Reasoning, vol. 5, no. 3, pp. 191–212, 1991. View at Publisher · View at Google Scholar · View at Scopus
  16. H. Hellendoorn, “The generalized modus ponens considered as a fuzzy relation,” Fuzzy Sets and Systems, vol. 46, no. 1, pp. 29–48, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. K. Demirli and I. B. Turksen, “A review of implications and the generalized modus ponens,” in Proceedings of the 3rd IEEE Conference on Fuzzy Systems. IEEE World Congress on Computational Intelligence, pp. 1440–1445, IEEE, Orlando, Fla, USA, June 1994. View at Publisher · View at Google Scholar
  18. J. C. Fodor and T. Keresztfalvi, “Nonstandard conjunctions and implications in fuzzy logic,” International Journal of Approximate Reasoning, vol. 12, no. 2, pp. 69–84, 1995. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. O. Cordón, M. J. Del Jesus, and F. Herrera, “A proposal on reasoning methods in fuzzy rule-based classification systems,” International Journal of Approximate Reasoning, vol. 20, no. 1, pp. 21–45, 1999. View at Publisher · View at Google Scholar · View at Scopus
  20. R. R. Yager, “On global requirements for implication operators in fuzzy modus ponens,” Fuzzy Sets and Systems, vol. 106, no. 1, pp. 3–10, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  21. J. Liu, D. Ruan, Y. Xu, and Z. Song, “A resolution-like strategy based on a lattice-valued logic,” IEEE Transactions on Fuzzy Systems, vol. 11, no. 4, pp. 560–567, 2003. View at Publisher · View at Google Scholar · View at Scopus
  22. C. Igel and K.-H. Temme, “The chaining syllogism in fuzzy logic,” IEEE Transactions on Fuzzy Systems, vol. 12, no. 6, pp. 849–853, 2004. View at Publisher · View at Google Scholar · View at Scopus
  23. J. Tick and J. Fodor, “Fuzzy implications and inference processes,” in Proceedings of the 3rd International Conference on Computational Cybernetics (ICCC '05), pp. 105–109, IEEE, April 2005. View at Publisher · View at Google Scholar
  24. A. Blake, Canonical expressions in boolean algebra [Ph.D. thesis], Department of Mathematics, University of Chicago, Chicago, Ill, USA, 1937.
  25. F. M. Brown, Boolean Reasoning: The Logic of Boolean Equations, Kluwer Academic Publishers, Boston, Mass, USA, 1990. View at Publisher · View at Google Scholar · View at MathSciNet
  26. J. Gregg, Ones and Zeros: Understanding Boolean Algebra, Digital Circuits, and the Logic of Sets, Wiley-IEEE Press, 1998.
  27. A. M. Rushdi and A. S. Al-Shehri, “Logical reasoning and its supporting role in the service of security and justice,” Journal of Security Studies, vol. 11, no. 22, pp. 115–153, 2002. View at Google Scholar
  28. A. M. Rushdi and O. M. Ba-Rukab, “Some engineering applications of the modern syllogistic method,” SEC7 Paper 226, 2007. View at Google Scholar
  29. A. M. Rushdi, “The modern syllogistic method as a tool for engineering problem solving,” Journal of Qassim University: Engineering and Computer Sciences, vol. 1, no. 1, pp. 57–70, 2008. View at Google Scholar
  30. A. M. Rushdi and O. M. Barukab, “An exposition of the modern syllogistic method of propositional logic,” Umm Al-Qura University Journal: Engineering and Architecture, vol. 1, no. 1, pp. 17–49, 2009. View at Google Scholar
  31. A. M. Rushdi and O. M. Ba-Rukab, “Powerful features of the modern syllogistic method of propositional logic,” Journal of Mathematics and Statistics, vol. 4, no. 3, pp. 186–193, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. A. M. A. Rushdi and O. M. Ba-Rukab, “Switching-algebraic analysis of relational databases,” Journal of Mathematics and Statistics, vol. 10, no. 2, pp. 231–243, 2014. View at Publisher · View at Google Scholar · View at Scopus
  33. A. M. Rushdi and O. M. BaRukab, “Map derivation of the closures for dependency and attribute sets and all candidate keys for a relational database,” Journal of King Abdulaziz University: Engineering Sciences, vol. 25, no. 2, pp. 3–33, 2014. View at Google Scholar
  34. C. L. Chang and R. C. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973. View at MathSciNet
  35. M. Davis and H. Putnam, “A computing procedure for quantification theory,” Journal of the ACM, vol. 7, no. 3, pp. 201–215, 1960. View at Publisher · View at Google Scholar · View at MathSciNet
  36. I. Copi and C. Cohen, Introduction to Logic, Pearson Prentice-Hall, Upper Saddle River, NJ, USA, 14th edition, 2010.
  37. V. Klenk, Understanding Symbolic Logic, Prentice-Hall, Englewood Cliffs, NJ, USA, 4th edition, 2013.
  38. K. Atanassov, “Two variants of intuitionistic fuzzy propositional calculus,” Tech. Rep. IM-MFAIS-5-88, 1988. View at Google Scholar
  39. T. Ciftcibasi and D. Altunay, “Fuzzy propositional logic and two-sided (intuitionistic) fuzzy propositions,” in Proceedings of the 5th IEEE International Conference on Fuzzy Systems, vol. 1, pp. 432–438, IEEE, September 1996. View at Scopus
  40. K. Atanassov and G. Gargov, “Elements of intuitionistic fuzzy logic. Part I,” Fuzzy Sets and Systems, vol. 95, no. 1, pp. 39–52, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  41. K. T. Atanassov, Intuitionistic Fuzzy Sets, Springer, Berlin, Germany, 1999.
  42. C. Cornelis, G. Deschrijver, and E. E. Kerre, “Classification of intuitionistic fuzzy implicators: an algebraic approach,” in Proceedings of the 6th Joint Conference on Information Sciences (JCIS '02), pp. 105–108, March 2002. View at Scopus
  43. K. Atanassov, “On eight new intuitionistic fuzzy implications,” in Proceedings of the 3rd International IEEE Conference on Intelligent Systems (IS '06), pp. 4–6, London, UK, September 2006.
  44. L. Atanassova, “A new intuitionistic fuzzy implication,” Cybernetics and Information Technologies, vol. 9, no. 2, pp. 21–25, 2009. View at Google Scholar · View at MathSciNet
  45. K. T. Atanassov, “On intuitionistic fuzzy negations and law for excluded middle,” in Proceedings of the IEEE International Conference on Intelligent Systems (IS '10), pp. 266–269, July 2010. View at Publisher · View at Google Scholar · View at Scopus
  46. S.-P. Wan and D.-F. Li, “Atanassov's intuitionistic fuzzy programming method for heterogeneous multiattribute group decision making with atanassov's intuitionistic fuzzy truth degrees,” IEEE Transactions on Fuzzy Systems, vol. 22, no. 2, pp. 300–312, 2014. View at Publisher · View at Google Scholar · View at Scopus
  47. J.-Q. Wang and H.-Y. Zhang, “Multicriteria decision-making approach based on atanassov's intuitionistic fuzzy sets with incomplete certain information on weights,” IEEE Transactions on Fuzzy Systems, vol. 21, no. 3, pp. 510–515, 2013. View at Publisher · View at Google Scholar · View at Scopus
  48. E. I. Papageorgiou and D. K. Iakovidis, “Intuitionistic fuzzy cognitive maps,” IEEE Transactions on Fuzzy Systems, vol. 21, no. 2, pp. 342–354, 2013. View at Publisher · View at Google Scholar · View at Scopus
  49. L. Zadeh, “Fuzzy set,” Information and Control, vol. 8, pp. 338–353, 1965. View at Google Scholar
  50. L. A. Zadeh, “Fuzzy algorithms,” Information and Control, vol. 12, no. 2, pp. 94–102, 1968. View at Publisher · View at Google Scholar
  51. P. N. Marinos, “Fuzzy logic and its application to switching systems,” IEEE Transactions on Computers, vol. 18, no. 4, pp. 343–348, 1969. View at Publisher · View at Google Scholar
  52. R. C. Lee and C.-l. Chang, “Some properties of fuzzy logic,” Information and Computation, vol. 19, pp. 417–431, 1971. View at Google Scholar · View at MathSciNet
  53. L. A. Zadeh, “Fuzzy logic,” Computer, vol. 21, no. 4, pp. 83–93, 1988. View at Publisher · View at Google Scholar · View at Scopus
  54. G. J. Klir and T. A. Folger, Fuzzy Sets, Uncertainty, and Information, Prentice Hall, Englewood Cliffs, NJ, USA, 1988. View at MathSciNet
  55. T. J. Ross, Fuzzy Logic with Engineering Applications, John Wiley & Sons, Chichester, UK, 2010. View at Publisher · View at Google Scholar
  56. S. Muroga, Logic Design and Switching Theory, John Wiley & Sons, 1979. View at MathSciNet
  57. P. Tison, “Generalization of consensus theory and application to the minimization of boolean functions,” IEEE Transactions on Electronic Computers, vol. 16, no. 4, pp. 446–456, 1967. View at Publisher · View at Google Scholar
  58. R. B. Cutler, K. Kinoshita, and S. Muroga, Exposition of Tison's Method to Derive All Prime Implicants and All Irredundant Disjunctive Forms for a Given Switching Function, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Ill, USA, 1979.
  59. M. Loui and G. Bilardi, “The correctness of Tison's method for generating prime implicants,” Tech. Rep., DTIC, 1982. View at Google Scholar
  60. G. J. Klir and M. A. Marin, “New considerations in teaching switching theory,” IEEE Transactions on Education, vol. 12, no. 4, pp. 257–261, 1969. View at Google Scholar · View at Scopus
  61. D. Kalish and R. Montague, Logic. Techniques of Formal Reasoning, Harcourt Brace Jovanovich, New York, NY, USA, 1964.
  62. A. M. Rushdi, M. Zarouan, T. M. Alshehri, and M. A. Rushdi, “The incremental version of the modern syllogistic method,” Journal of King Abdulaziz University: Engineering Sciences, vol. 26, no. 2, 2015. View at Google Scholar
  63. A. M. Rushdi, T. M. Alshehri, M. Zarouan, and M. A. Rushdi, “Utilization of the modern syllogistic method in the exploration of hidden aspects in engineering ethical dilemmas,” Journal of King Abdulaziz University: Computers and Information Technology, vol. 2, no. 2, 2015. View at Google Scholar
  64. A. M. Rushdi and H. A. Al-Yahya, “Derivation of the complete sum of a switching function with the aid of the variable entered karnaugh map,” Journal of King Saud University, vol. 13, no. 2, pp. 239–269, 2000. View at Google Scholar
  65. A. M. A. Rushdi and H. M. Albarakati, “The inverse problem for Boolean equations,” Journal of Computer Science, vol. 8, no. 12, pp. 2098–2105, 2012. View at Publisher · View at Google Scholar · View at Scopus
  66. A. Kean and G. Tsiknis, “An incremental method for generating prime implicants/implicates,” Journal of Symbolic Computation, vol. 9, no. 2, pp. 185–206, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  67. A. M. A. Rushdi and H. M. Albarakati, “Construction of general subsumptive solutions of Boolean equations via complete-sum derivation,” Journal of Mathematics and Statistics, vol. 10, no. 2, pp. 155–168, 2014. View at Publisher · View at Google Scholar · View at Scopus
  68. J. R. Slagle, C. L. Chang, and R. C. Lee, “A new algorithm for generating prime implicants,” IEEE Transactions on Computers, vol. C-19, no. 4, pp. 304–310, 1970. View at Google Scholar · View at MathSciNet
  69. H. R. Hwa, “A method for generating prime implicants of a boolean expression,” IEEE Transactions on Computers, vol. 23, no. 6, pp. 637–641, 1974. View at Google Scholar · View at MathSciNet
  70. B. Reusch, “Generation of prime implicants from subfunctions and a unifying approach to the covering problem,” IEEE Transactions on Computers, vol. 100, no. 9, pp. 924–930, 1975. View at Google Scholar · View at MathSciNet
  71. O. Coudert and J. Madre, “A new method to compute prime and essential prime implicants of boolean functions,” in Advanced Research in VLSI and Parallel Systems, T. Knight and J. Savage, Eds., pp. 113–128, MIT Press, 1992. View at Google Scholar
  72. A. M. Rushdi and H. A. Al-Yahya, “A boolean minimization procedure using the variable-entered karnaugh map and the generalized consensus concept,” International Journal of Electronics, vol. 87, no. 7, pp. 769–794, 2000. View at Publisher · View at Google Scholar · View at Scopus
  73. A. Rushdi, “Prime-implicant extraction with the aid of the variable-entered karnaugh map,” Umm Al-Qura University Journal: Science, Medicine and Engineering, vol. 13, no. 1, pp. 53–74, 2001. View at Google Scholar
  74. G. Alexe, S. Alexe, Y. Crama, S. Foldes, P. L. Hammer, and B. Simeone, “Consensus algorithms for the generation of all maximal bicliques,” Discrete Applied Mathematics, vol. 145, no. 1, pp. 11–21, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  75. D. Ślęzak, “Association reducts: boolean representation,” in Rough Sets and Knowledge Technology, vol. 4062 of Lecture Notes in Computer Science, pp. 305–312, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar
  76. Z. Pawlak and A. Skowron, “Rough sets and boolean reasoning,” Information Sciences, vol. 177, no. 1, pp. 41–73, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  77. Y. Crama and P. L. Hammer, Boolean Functions: Theory, Algorithms, and Applications, vol. 142, Cambridge University Press, Cambridge, UK, 2011.