Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014 (2014), Article ID 702326, 15 pages
http://dx.doi.org/10.1155/2014/702326
Research Article

Optimised ExpTime Tableaux for over Finite Residuated Lattices

College of Mechatronics Engineering and Automation, National University of Defense Technology, Changsha 410073, China

Received 25 June 2013; Accepted 16 December 2013; Published 7 April 2014

Academic Editor: Hector Pomares

Copyright © 2014 Jian Huang 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. F. Bobillo and U. Straccia, “Reasoning with the finitely many-valued Łukasiewicz fuzzy description logic SROIQ,” Information Sciences, vol. 181, no. 4, pp. 758–778, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. U. Straccia, “Description logics over lattices,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 14, no. 1, pp. 1–16, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. S. Borgwardt and R. Peñaloza, “Description logics over lattices with multi-valued ontologies,” in Proceedings of the 22nd International Joint Conference on Artificial Intelligence, vol. 2, pp. 768–773, AAAI Press, 2011.
  4. S. Borgwardt and R. Peñaloza, “Fuzzy ontologies over lattices with t-norms,” in Proceedings of the 24th International Workshop on Description Logics (DL '11), CEUR Electronic Workshop Proceedings, 2011.
  5. S. Borgwardt and R. Peñaloza, “A tableau algorithm for fuzzy description logics over residuated de morgan lattices,” in Proceedings of the 6th International Conference on Web Reasoning and Rule Systems (RR '12), M. Krötzsch and U. Straccia, Eds., vol. 7497 of Lecture Notes in Computer Science, pp. 9–24, Springer, 2012.
  6. S. Borgwardt and R. Peñaloza, “Finite lattices do not make reasoning in 𝒜𝒞 harder,” in URSW, pp. 51–62, 2011. View at Google Scholar
  7. P. Hájek, “Making fuzzy description logic more general,” Fuzzy Sets and Systems, vol. 154, no. 1, pp. 1–15, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. P. Hájek, “On witnessed models in fuzzy logic. III. Witnessed Gödel logics,” Mathematical Logic Quarterly, vol. 56, no. 2, pp. 171–174, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. U. Straccia, “Reasoning within fuzzy description logics,” Journal of Artificial Intelligence Research, vol. 14, pp. 137–166, 2001. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. G. Stoilos, G. Stamou, J. Pan, N. Simou, and V. Tzouvaras, “Reasoning with the fuzzy description logic f-𝒮𝒩: theory, practice and applications,” in Uncertainty Reasoning For the Semantic Web I, pp. 262–281, 2008. View at Google Scholar
  11. G. Stoilos, G. Stamou, J. Z. Pan, V. Tzouvaras, and I. Horrocks, “Reasoning with very expressive fuzzy description logics,” Journal of Artificial Intelligence Research, vol. 30, no. 5, pp. 273–320, 2007. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. G. J. Klir and B. Yuan, Fuzzy Sets and Fuzzy Logic, Prentice Hall, Upper Saddle River, NJ, USA, 1995. View at MathSciNet
  13. I. Horrocks, U. Sattler, and S. Tobies, “Reasoning with individuals for the description logic SHIQ,” in Proceedings of the 17th International Conference on Automated Deduction (CADE '00), D. McAllester, Ed., vol. 1831 of Lecture Notes in Computer Science, pp. 482–496, Springer, 2000.
  14. S. Tobies, “Complexity results and practical algorithms for logics in knowledge representation,” Journal of Artificial Intelligence Research, vol. 12, pp. 199–217, 2000. View at Google Scholar
  15. F. Bou, M. Cerami, and F. Esteva, “Finite-valued lukasiewicz moda logic is pspace-complete,” in Proceedings of the 22nd International Joint Conference On Artificial Intelligence (IJCAI '11), vol. 2, pp. 774–779, AAAI Press, 2011.
  16. V. Haarslev, H. I. Pai, and N. Shiri, Optimizing Tableau Reasoning in Alc Extended with Uncertainty, 2008.
  17. N. Simou, T. Mailis, G. Stoilos, and G. Stamou, “Optimization techniques for fuzzy description logics,” in Proceedings of the International Workshop on Description Logics (DL '10), pp. 244–254, 2010.
  18. D. Tsarkov, I. Horrocks, and P. F. Patel-Schneider, “Optimizing terminological reasoning for expressive description logics,” Journal of Automated Reasoning, vol. 39, no. 3, pp. 277–316, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. D. Tsarkov and I. Horrocks, “Efficient reasoning with range and domain constraints,” in Proceedings of the Description Logic Workshop (DL '04), vol. 104, pp. 41–50, 2004.
  20. I. Horrocks, U. Hustadt, U. Sattler, and R. Schmidt, “Computational modal logic,” in Handbook of Modal Logic, P. Blackburn, J. van Benthem, and F. Wolter, Eds., chapter 4, pp. 181–245, Elsevier, 2006. View at Google Scholar
  21. A. B. Baker, Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results [Ph.D. thesis], University of Oregon, Eugene, Ore, USA, 1995, UMI Order no. GAX95-29049.
  22. F. Oppacher and E. Suen, “HARP: a tableau-based theorem prover,” Journal of Automated Reasoning, vol. 4, no. 1, pp. 69–100, 1988. View at Publisher · View at Google Scholar · View at MathSciNet
  23. R. Goré and L. Postniece, “An experimental evaluation of global caching for 𝒜𝒞 (system description),” in Automated Reasoning, pp. 299–305, 2008. View at Google Scholar
  24. D. Tsarkov and I. Horrocks, “Ordering heuristics for description logic reasoning,” in Proceedings of the 19th International Joint Conference on Artificial Intelligence, pp. 609–614, 2005.
  25. P. Balsiger, A. Heuerding, and S. Schwendimann, “A benchmark method for the propositional modal logics K, KT, S4,” Journal of Automated Reasoning, vol. 24, no. 3, pp. 297–317, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  26. L. A. Nguyen, “An efficient tableau prover using global caching for the description logic 𝒜𝒞,” Fundamenta Informaticae, vol. 93, no. 1–3, pp. 273–288, 2009. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  27. F. M. Donini and F. Massacci, “EXPtime tableaux for 𝒜𝒞,” Artificial Intelligence, vol. 124, no. 1, pp. 87–138, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  28. R. Goré and L. A. Nguyen, “Optimised exptime tableaux for 𝒜𝒞 using sound global caching, propagation and cutoffs,” 2007, http://www.mimuw.edu.pl/~nguyen/papers.
  29. A. Steigmiller, T. Liebig, and B. Glimm, “Extended caching, backjumping and merging for expressive description logics,” in Automated Reasoning, vol. 7364 of Lecture Notes in Computer Science, pp. 514–529, Springer, Heidelberg, Germany, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet