Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 134950, 7 pages
http://dx.doi.org/10.1155/2015/134950
Research Article

A Max-Term Counting Based Knowledge Inconsistency Checking Strategy and Inconsistency Measure Calculation of Fuzzy Knowledge Based Systems

School of Computer Science and Technology, Henan Polytechnic University, No. 2001, ShiJi Avenue, Jiaozuo 454000, China

Received 27 April 2015; Revised 21 July 2015; Accepted 4 August 2015

Academic Editor: Miguel A. Salido

Copyright © 2015 Hui-lai Zhi. 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. E. Birnbaum and E. L. Lozinskii, “Consistent subsets of inconsistent systems: structure and behaviour,” Journal of Experimental & Theoretical Artificial Intelligence, vol. 15, no. 1, pp. 25–46, 2003. View at Publisher · View at Google Scholar · View at Scopus
  2. Z. Sun, Z. Zhang, and H. Wang, “Consistency and error analysis of prior-knowledge-based kernel regression,” Neurocomputing, vol. 74, no. 17, pp. 3476–3485, 2011. View at Publisher · View at Google Scholar · View at Scopus
  3. J. Ramírez and A. de Antonio, “Checking the consistency of a hybrid knowledge base system,” Knowledge-Based Systems, vol. 20, no. 3, pp. 225–237, 2007. View at Publisher · View at Google Scholar · View at Scopus
  4. A. Felfernig, G. Friedrich, D. Jannach, and M. Stumptner, “Consistency-based diagnosis of configuration knowledge bases,” Artificial Intelligence, vol. 152, no. 2, pp. 213–234, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  5. J. Bailey and P. J. Stuckey, “Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization,” in Proceedings of the 7th International Symposium on Practical Aspects of Declarative Languages (PADL '05), pp. 174–186, January 2005. View at Scopus
  6. M. H. Liffiton, M. D. Moffitt, M. E. Pollack, and K. A. Sakallah, “Identifying conflicts in overconstrained temporal problems,” in Proceedings of the 19th International Joint Conference on Artificial Intelligence, pp. 205–211, August 2005. View at Scopus
  7. R. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, E. R. Miller and J. W. Thatcher, Eds., pp. 85–103, Plenum Press, New York, NY, USA, 1972. View at Google Scholar
  8. I. Shah, “A hybrid algorithm for finding minimal unsatisfiable subsets in over-constrained CSPs,” International Journal of Intelligent Systems, vol. 26, no. 11, pp. 1023–1048, 2011. View at Publisher · View at Google Scholar · View at Scopus
  9. I. Shah, “Direct algorithms for finding minimal unsatisfiable subsets in over-constrained CSPs,” International Journal on Artificial Intelligence Tools, vol. 20, no. 1, pp. 53–91, 2011. View at Publisher · View at Google Scholar · View at Scopus
  10. A. Felfernig, M. Schubert, and C. Zehentner, “An efficient diagnosis algorithm for inconsistent constraint sets,” Artificial Intelligence for Engineering Design, Analysis and Manufacturing, vol. 26, no. 1, pp. 53–62, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. R. Malouf, “Maximal consistent subsets,” Computational Linguistics, vol. 33, no. 2, pp. 153–160, 2007. View at Publisher · View at Google Scholar · View at Scopus
  12. E. Di Rosa, E. Giunchiglia, and M. Maratea, “Solving satisfiability problems with preferences,” Constraints, vol. 15, no. 4, pp. 485–515, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  13. M. H. Liffiton and K. A. Sakallah, “Algorithms for computing minimal unsatisfiable subsets of constraints,” Journal of Automated Reasoning, vol. 40, no. 1, pp. 1–33, 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. K. McAreavey, W. Liu, and P. Miller, “Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases,” International Journal of Approximate Reasoning, vol. 55, no. 8, pp. 1659–1693, 2014. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. K. Mu, Z. Jin, W. Liu, D. Zowghi, and B. Wei, “Measuring the significance of inconsistency in the viewpoints framework,” Science of Computer Programming, vol. 78, no. 9, pp. 1572–1599, 2013. View at Publisher · View at Google Scholar · View at Scopus
  16. M. H. Liffiton, A. Previti, A. Malik, and J. Marques-Silva, “Fast, flexible MUS enumeration,” Constraints, 2015. View at Publisher · View at Google Scholar
  17. J. Bailey and P. J. Stuckey, “Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization,” in Proceedings of the 7th International Symposium on Practical Aspects of Declarative Languages (PADL '05), vol. 3350, pp. 174–186, January 2005. View at Scopus
  18. R. T. Stern, M. Kalech, A. Feldman, and G. M. Provan, “Exploring the duality in conflict-directed model-based diagnosis,” in Proceedings of the 26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference (AAAI '12), pp. 828–834, July 2012. View at Scopus
  19. R. Bird and R. Hinze, “Functional pearl: trouble shared is trouble halved,” in Proceedings of the ACM SIGPLAN Workshop on Haskell, pp. 1–6, Uppsala, Sweden, 2003.
  20. J. A. Navarro and A. Voronkov, “Generation of hard non-clausal random satisfiability problems,” in Proceedings of the 20th National Conference on Artificial Intelligence, pp. 436–442, July 2005. View at Scopus
  21. M. L. Fredman and L. Khachiyan, “On the complexity of dualization of monotone disjunctive normal forms,” Journal of Algorithms, vol. 21, no. 3, pp. 618–628, 1996. View at Publisher · View at Google Scholar · View at Scopus
  22. D. Gunopulos, R. Khardon, H. Mannila, S. Saluja, H. Toivonen, and R. S. Sharma, “Discovering all most specific sentences,” ACM Transactions on Database Systems, vol. 28, no. 2, pp. 140–174, 2003. View at Publisher · View at Google Scholar · View at Scopus
  23. E. Sanchez, Approximate Reasoning in Intelligent Systems, Decision and Control, Pergamon Press, 1st edition, 1987.
  24. J. Lang, “Possibilistic logic: complexity and algorithms,” in Handbook of Defeasible Reasoning and Uncertainty Management Systems, D. M. Gabby, P. Semts, J. Kohlas, and S. Moral, Eds., pp. 179–220, Springer, 1997. View at Google Scholar