Skip to main content
SpringerLink
Log in

Answers that Have Integrity

  • Conference paper
Semantics in Data and Knowledge Bases (SDKB 2010)

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

Included in the following conference series:

Abstract

Answers to queries in possibly inconsistent databases may not have integrity. We formalize ‘has integrity’ on the basis of a definition of ‘causes’. A cause of an answer is a minimal excerpt of the database that explains why the answer has been given. An answer has integrity if one of its causes does not overlap with any cause of integrity violation.

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Arenas, M., Bertossi, L., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proc. 18th PODS, pp. 68–79. ACM Press, New York (1999)

    Google Scholar 

  2. Bertossi, L., Hunter, A., Schaub, T.: Introduction to inconsistency tolerance. In: Bertossi, L., Hunter, A., Schaub, T. (eds.) Inconsistency Tolerance. LNCS, vol. 3300, pp. 1–14. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Chakravarthy, S., Grant, J., Minker, J.: Logic-based approach to semantic query optimization. ACM TODS 15(2), 162–207 (1990)

    Article  Google Scholar 

  4. Chomicki, J.: Consistent Query Answering: Five Easy Pieces. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 1–17. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  5. Clark, K.: Negation as Failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293–322. Plenum Press, New York (1978)

    Chapter  Google Scholar 

  6. Decker, H.: Toward a Uniform Cause-Based Approach to Inconsistency-Tolerant Database Semantics. In: Meersman, R., Dillon, T., Herrero, P. (eds.) OTM 2010. LNCS, vol. 6427, pp. 983–998. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Decker, H.: Basic causes for the Inconsistency Tolerance of Query Answering and Integrity Checking. In: Proc. 21st DEXA Workshop, pp. 318–322. IEEE CPS, Los Alamitos (2010)

    Google Scholar 

  8. Decker, H.: Some Notes on Knowledge Assimilation in Deductive Databases. In: Kifer, M., Voronkov, A., Freitag, B., Decker, H. (eds.) Dagstuhl Seminar 1997, DYNAMICS 1997, and ILPS-WS 1997. LNCS, vol. 1472, pp. 249–286. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Decker, H.: On Explanations in Deductive Databases. In: Proc. 3rd Workshop on Foundations of Models and Languages for Data and Objects, vol. 91/3, pp. 173–185. Inst.f.Informatik, Tech.Univ.Clausthal, Informatik-Bericht (1991)

    Google Scholar 

  10. Decker, H., Martinenghi, D.: Inconsistency-tolerant Integrity Checking. Transactions of Knowledge and Data Engineering 23(2), 218–234 (2011)

    Article  Google Scholar 

  11. Decker, H., Martinenghi, D.: Modeling, Measuring and Monitoring the Quality of Information. In: Heuser, C.A., Pernul, G. (eds.) ER 2009. LNCS, vol. 5833, pp. 212–221. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  12. Denecker, M., Kakas, A.: Abduction in Logic Programming. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2407, pp. 402–436. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Dung, P., Kowalski, R., Toni, F.: Dialectic proof procedures for assumption-based admissible argumentation. Artif. Intell. 170(2), 114–159 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Fung, T., Kowalski, R.: The IFF proof procedure for abductive logic programming. J. Logic Programming 33(2), 151–165 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  15. Hinrichs, T., Kao, J., Genesereth, M.: Inconsistency-Tolerant Reasoning with Classical Logic and Large Databases. In: Proc. 8th SARA, pp. 105–112. AAAI Press, Menlo Park (2009)

    Google Scholar 

  16. Kakas, A., Kowalski, R., Toni, F.: The role of abduction in logic programming. In: Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, pp. 235–324. Oxford University Press, Oxford (1998)

    Google Scholar 

  17. Kakas, A., Mancarella, P.: Database Updates through Abduction. In: Proc. 16th VLDB, pp. 650–661. Morgan Kaufmann, San Francisco (1990)

    Google Scholar 

  18. Kowalski, R.: Predicate Logic as a Programming Language. In: Proc. 6th IFIP, pp. 569–574. North-Holland, Amsterdam (1974)

    Google Scholar 

  19. Liebowitz, J.: Handbook of Applied Expert Systems. CRC Press, Boca Raton (1998)

    MATH  Google Scholar 

  20. Lifschitz, V.: What is Answer Set Computing? In: Proc. 23rd AAAI, pp. 1594–1597 (2008)

    Google Scholar 

  21. Lloyd, J.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987)

    Book  MATH  Google Scholar 

  22. Mancarella, P., Terreni, G., Sadri, F., Toni, F., Endriss, U.: The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments. TPLP 9(6), 691–750 (2009)

    MathSciNet  MATH  Google Scholar 

  23. Reiter, R.: On closed world data bases. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 119–140. Plenum Press, New York (1978)

    Google Scholar 

  24. Toni, F., Kowalski, R.: Reduction of abductive logic programs to normal logic programs. In: Proc. 12th ICLP, pp. 367–381. MIT Press, Cambridge (1995)

    Google Scholar 

  25. Williams, M.-A.: Applications of Belief Revision. In: Kifer, M., Voronkov, A., Freitag, B., Decker, H. (eds.) Dagstuhl Seminar 1997, DYNAMICS 1997, and ILPS-WS 1997. LNCS, vol. 1472, pp. 287–316. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto Tecnológico de Informática, Universidad Politécnica de Valencia, Spain

    Hendrik Decker

Authors
  1. Hendrik Decker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Software Competence Center Hagenberg and Johannes-Keppler-University Linz, Softwarepark 21, 4232, Hagenberg, Austria

    Klaus-Dieter Schewe

  2. Department of Computer Science, Christian-Albrechts-University Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Decker, H. (2011). Answers that Have Integrity. In: Schewe, KD., Thalheim, B. (eds) Semantics in Data and Knowledge Bases. SDKB 2010. Lecture Notes in Computer Science, vol 6834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23441-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23441-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23440-8

  • Online ISBN: 978-3-642-23441-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation