Nothing Special   »   [go: up one dir, main page]

Skip to main content

Online Justification for Tabled Logic Programs

  • Conference paper
Logic Programming (ICLP 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2916))

Included in the following conference series:

  • 399 Accesses

Abstract

Justification is the process of computing an evidence for the truth or falsity of an answer to a query in a logic program. There are two well known approaches for computing the evidence: Post-processing based techniques that use tabling engine [3,1] and trace-based techniques such as 4-port debuggers.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.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

Similar content being viewed by others

References

  1. Guo, H.-F., Ramakrishnan, C.R., Ramakrishnan, I.V.: Speculative beats conservative justification. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 150–165. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Ramakrishnan, C., Ramakrishnan, I., Smolka, S.A., Dong, Y., Du, X., Roychoudhury, A., Venkatakrishnan, V.: XMC: A logic-programming-based verification toolset. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 576–580. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Roychoudhury, A., Ramakrishnan, C.R., Ramakrishnan, I.V.: Justifying proofs using memo tables. In: Second International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP), Montreal, Canada, September 2000, pp. 178–189. ACM Press, New York (2000)

    Chapter  Google Scholar 

  4. Specht, G.: Generating explanation trees even for negations in deductive database systems. In: Ducassé, M., Charlier, B.L., Lin, Y.-J., Yalcinalp, U. (eds.) Proceedings of ILPS 1993 Workshop on Logic Programming Environments (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pemmasani, G., Guo, HF., Dong, Y., Ramakrishnan, C.R., Ramakrishnan, I.V. (2003). Online Justification for Tabled Logic Programs. In: Palamidessi, C. (eds) Logic Programming. ICLP 2003. Lecture Notes in Computer Science, vol 2916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24599-5_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24599-5_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20642-2

  • Online ISBN: 978-3-540-24599-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics