Skip to main content
SpringerLink
Log in

On the Decidability and Complexity of Identity Knowledge Representation

  • Conference paper
Database Systems for Advanced Applications (DASFAA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7238))

Included in the following conference series:

Abstract

Identity knowledge is the knowledge that relates to various aspects of the identification of real-world objects. It can be acquired through the process of identifying objects from a knowledge management point of view. In this paper we present a simple yet expressive framework for representing identity knowledge. Knowledge patterns, as the building blocks of the framework, have the capability of capturing identity knowledge at an arbitrary level of abstraction. However, the combined use of pattern formula and pattern relation in knowledge patterns may yield disjunction and a restricted form of negation. We thus investigate the containment problem of knowledge patterns to find a decision procedure for containment and equivalence between knowledge patterns. Our result shows that the containment problem for knowledge patterns is not only decidable but also tractable.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Credit where credit is due. Nature 462(7275), 825 (2009)

    Google Scholar 

  2. Fischer Identity as a Service. Architecture Overview for Client Organizations. White paper, Fischer International Identity (2009)

    Google Scholar 

  3. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)

    Google Scholar 

  4. Aho, A., Sagiv, Y., Ullman, J.: Equivalences among relational expressions. SIAM Journal on Computing 8, 218 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  5. Aho, A.V., Ullman, J.D.: Universality of data retrieval languages. In: Proceedings of Principles of Programming Languages, pp. 110–119. ACM (1979)

    Google Scholar 

  6. Arasu, A., Chaudhuri, S., Kaushik, R.: Transformation-based framework for record matching. In: Proceedings of the 2008 IEEE 24th International Conference on Data Engineering, pp. 40–49. IEEE Computer Society (2008)

    Google Scholar 

  7. Arasu, A., Kaushik, R.: A grammar-based entity representation framework for data cleaning. In: Proceedings of the 35th SIGMOD International Conference on Management of Data, SIGMOD 2009, pp. 233–244. ACM (2009)

    Google Scholar 

  8. Baader, F.: Logic-Based Knowledge Representation. In: Veloso, M.M., Wooldridge, M.J. (eds.) Artificial Intelligence Today. LNCS (LNAI), vol. 1600, pp. 13–41. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. Bhattacharya, I., Getoor, L.: Deduplication and group detection using links. In: Proceedings of the 2004 ACM SIGKDD Workshop on Link Analysis and Group Detection (2004)

    Google Scholar 

  10. Bhattacharya, I., Getoor, L.: Iterative record linkage for cleaning and integration. In: Proceedings of the 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, DMKD 2004, pp. 11–18. ACM (2004)

    Google Scholar 

  11. Calvanese, D., De Giacomo, G., Vardi, M.Y.: Decidable containment of recursive queries. Theor. Comput. Sci. 336, 33–56 (2005)

    Article  MATH  Google Scholar 

  12. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, STOC 1977, pp. 77–90. ACM (1977)

    Google Scholar 

  13. Donini, F., Lenzerini, M., Nardi, D., Schaerf, A.: Reasoning in description logics. Principles of Knowledge Representation, 191–236 (1996)

    Google Scholar 

  14. Fellegi, I., Sunter, A.: A theory for record linkage. Journal of the American Statistical Association 64(328), 1183–1210 (1969)

    Article  Google Scholar 

  15. Klug, A.: On conjunctive queries containing inequalities. J. ACM 35, 146–160 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  16. Leclère, M., Mugnier, M.-L.: Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 404–418. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Levy, A.Y., Rousset, M.-C.: Verification of knowledge bases based on containment checking. Artif. Intell. 101, 227–250 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  18. Nash, A., Ludäscher, B.: Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 422–440. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Newcombe, H., Kennedy, J., Axford, S., James, A.: Automatic linkage of vital records. Science 130(3381), 954–959 (1959)

    Article  Google Scholar 

  20. Pasula, H., Marthi, B., Milch, B., Russell, S., Shpitser, I.: Identity uncertainty and citation matching. In: NIPS. MIT Press (2003)

    Google Scholar 

  21. Sagiv, Y., Yannakakis, M.: Equivalences among relational expressions with the union and difference operators. Journal of the ACM 27, 633–655 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  22. Sarawagi, S., Bhamidipaty, A.: Interactive deduplication using active learning. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2002, pp. 269–278. ACM (2002)

    Google Scholar 

  23. Shmueli, O.: Equivalence of datalog queries is undecidable. J. Log. Program. 15, 231–241 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  24. Singla, P., Domingos, P.: Object Identification with Attribute-Mediated Dependences. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol. 3721, pp. 297–308. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  25. Tejada, S., Knoblock, C.A., Minton, S.: Learning object identification rules for information integration. Information Systems 26 (2001)

    Article  Google Scholar 

  26. Ullman, J.D.: Information integration using logical views. Theor. Comput. Sci. 239, 189–210 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  27. Vardi, M.: The complexity of relational query languages. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp. 137–146. ACM (1982)

    Google Scholar 

  28. Wei, F., Lausen, G.: Containment of Conjunctive Queries with Safe Negation. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 346–360. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software Competence Center, Hagenberg and Johannes-Kepler-University, Linz, Austria

    Klaus-Dieter Schewe

  2. Department of Information Science, University of Otago, Dunedin, New Zealand

    Qing Wang

Authors
  1. Klaus-Dieter Schewe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science and Engineering, Seoul National University, Gwanak-ro, Gwanak-gu, 151747, Seoul, South Korea

    Sang-goo Lee

  2. Computer School, Wuhan University, Luo-jia-shan, Wuchang, 430081, Wuhan, Hubei Province, China

    Zhiyong Peng

  3. School of Information Technology and Electrical Engineering, University of Queensland, QLD 4072, Brisbane, Australia

    Xiaofang Zhou

  4. Department of Computer Science, Kangwon National University, 192-1, Hyoja2-Dong, Chuncheon, 200701, Kangwon, South Korea

    Yang-Sae Moon

  5. Institute for Computer Science and Business Information, University of Duisburg-Essen, Schützenbahn 70, 45117, Essen, Germany

    Rainer Unland

  6. School of Information and Communication Engineering, Chungbuk National University, 52 Naesudong-ro, Heungdeok-gu, Cheongju, 4072, Chungbuk, South Korea

    Jaesoo Yoo

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schewe, KD., Wang, Q. (2012). On the Decidability and Complexity of Identity Knowledge Representation. In: Lee, Sg., Peng, Z., Zhou, X., Moon, YS., Unland, R., Yoo, J. (eds) Database Systems for Advanced Applications. DASFAA 2012. Lecture Notes in Computer Science, vol 7238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29038-1_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29038-1_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29037-4

  • Online ISBN: 978-3-642-29038-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation