Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming and Nonmonotonic Reasoning

LPNMR 2013: Logic Programming and Nonmonotonic Reasoning pp 530–542Cite as

Justifications for Logic Programming

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8148))

Abstract

Understanding why and how a given answer to a query is generated from a deductive or relational database is fundamental to obtain justifications, assess trust, and detect dependencies on contradictions. Propagating provenance information is a major technique that evolved in the database literature to address the problem, using annotated relations with values from a semiring. The case of positive programs/relational algebra is well-understood but handling negation (or set difference in relational algebra) has not been addressed in its full generality or has deficiencies. The approach defined in this work provides full provenance information for logic programs under the least model, well-founded semantics and answer set semantics, and is related to the major existing notions of justifications for all these logic programming semantics.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brain, M., Gebser, M., Pührer, J., Schaub, T., Tompits, H., Woltran, S.: Debugging ASP programs by means of ASP. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 31–43. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Brain, M., Vos, M.D.: Debugging logic programs under the answer set semantics. In: Proc. of ASP 2005 Workshop. CEUR Workshop Proceedings, vol. 142 (2005)

    Google Scholar 

  3. Damásio, C.V., Pereira, L.M.: Antitonic logic programs. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 379–392. Springer, Heidelberg (2001)

    Google Scholar 

  4. Damásio, C.V., Pereira, L.M.: Monotonic and residuated logic programs. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS (LNAI), vol. 2143, pp. 748–759. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Gebser, M., Pührer, J., Schaub, T., Tompits, H.: A meta-programming technique for debugging answer-set programs. In: AAAI 2008, pp. 448–453. AAAI Press (2008)

    Google Scholar 

  6. Geerts, F., Poggi, A.: On database query languages for K-relations. J. Applied Logic 8(2), 173–185 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gelder, A.V., Ross, K.A., Schlipf, J.S.: The Well-Founded Semantics for General Logic Programs. Journal of the ACM 38(3), 620–650 (1991)

    MATH  Google Scholar 

  8. Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: Proc. of ICLP 1988, pp. 1070–1080. MIT Press (1988)

    Google Scholar 

  9. Green, T.J.: Containment of conjunctive queries on annotated relations. In: Proc. of Database Theory - ICDT 2009, vol. 361, pp. 296–309 (2009)

    Google Scholar 

  10. Green, T.J., Karvounarakis, G., Tannen, V.: Provenance semirings. In: Proc. of PODS 2007, pp. 31–40. ACM, New York (2007)

    Google Scholar 

  11. Janhunen, T.: Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics 16(1-2), 35–86 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lifschitz, V., Razborov, A.: Why are there so many loop formulas? ACM Trans. Comput. Logic 7(2), 261–268 (2006)

    Article  MathSciNet  Google Scholar 

  13. Lin, F., Zhao, J.: On tight logic programs and yet another translation from normal logic programs to propositional logic. In: Proc. of IJCAI 2003, pp. 853–858. Morgan Kaufmann Publishers Inc. (2003)

    Google Scholar 

  14. Meliou, A., Gatterbauer, W., Halpern, J.Y., Koch, C., Moore, K.F., Suciu, D.: Causality in databases. IEEE Data Eng. Bull. 33(3), 59–67 (2010)

    Google Scholar 

  15. Pemmasani, G., Guo, H.-F., Dong, Y., Ramakrishnan, C.R., Ramakrishnan, I.V.: Online justification for tabled logic programs. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol. 2998, pp. 24–38. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  16. Pereira, L.M., Damásio, C.V., Alferes, J.J.: Diagnosis and debugging as contradiction removal. In: Proc. of LPNMR 1993, pp. 316–330 (1993)

    Google Scholar 

  17. Pontelli, E., Son, T.C., El-Khatib, O.: Justifications for logic programs under answer set semantics. TPLP 9(1), 1–56 (2009)

    MathSciNet  MATH  Google Scholar 

  18. Reiter, R., de Kleer, J.: Foundations of assumption-based truth maintenance systems: Preliminary report. In: Proc. of AAAI 1987, pp. 183–189 (1987)

    Google Scholar 

  19. Roychoudhury, A., Ramakrishnan, C.R., Ramakrishnan, I.V.: Justifying proofs using memo tables. In: Proc. of PPDP, pp. 178–189 (2000)

    Google Scholar 

  20. Specht, G.: Generating explanation trees even for negations in deductive database systems. In: Proc. of LPE, pp. 8–13 (1993)

    Google Scholar 

  21. van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. J. ACM 23(4), 733–742 (1976)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CENTRIA, Departamento de Informática Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, 2829-516, Caparica, Portugal

    Carlos Viegas Damásio

  2. Institute of Computer Science, FORTH-ICS, Crete, Greece

    Anastasia Analyti & Grigoris Antoniou

  3. Department of Informatics, University of Huddersfield, Huddersfield, UK

    Grigoris Antoniou

Authors
  1. Carlos Viegas Damásio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anastasia Analyti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Grigoris Antoniou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Corunna, Campus de Elviña s/n, 15071, Corunna, Spain

    Pedro Cabalar

  2. Department of Computer Science, New Mexico State University, 1290 Frenger Mall, SH 123, MSC CS, P.O. Box 30001, 88003, Las Cruces, NM, USA

    Tran Cao Son

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Viegas Damásio, C., Analyti, A., Antoniou, G. (2013). Justifications for Logic Programming. In: Cabalar, P., Son, T.C. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2013. Lecture Notes in Computer Science(), vol 8148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40564-8_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40564-8_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40563-1

  • Online ISBN: 978-3-642-40564-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation