Skip to main content

Tabling in Abduction and Updating

  • Chapter
  • First Online:
Programming Machine Ethics

Part of the book series: Studies in Applied Philosophy, Epistemology and Rational Ethics ((SAPERE,volume 26))

  • 727 Accesses

Abstract

In the individual realm part of this book, we are addressing the interplay amongst appropriate LP features to represent moral facets and to reason about them. One such interplay is between LP abduction and updating, both supported with tabling mechanisms. In this chapter, we propose novel approaches for employing tabling in abduction and updating—separately—viz., tabling abductive solutions in contextual abduction and the incremental tabling of fluents for LP updating. These two individual approaches form the components for their subsequent joint tabling technique when combining LP abduction and updating, to be discussed in detail in Chap. 7. The new techniques introduced here, as well as their later joint combination, are general for normal logic programs, and not specific to morality applications. That is, they are of interest in themselves and may be applicable to other domains.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 119.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    The set of abducibles in an abductive context is represented in the sequel using the usual Prolog list notation.

  2. 2.

    See [3] for the Well-Founded Semantics of generalized logic programs and [6] for the Well-Founded Semantics of dynamic logic programs.

References

  1. Alferes, J.J., Brogi, A., Leite, J.A., Pereira, L.M.: Evolving logic programs. In: Proceedings of the European Conference on Artificial Intelligence (JELIA 2002), LNCS, vol. 2424, pp. 50–61. Springer (2002)

    Google Scholar 

  2. Alferes, J.J., Leite, J.A., Pereira, L.M., Przymusinska, H., Przymusinski, T.: Dynamic updates of non-monotonic knowledge bases. J. Log. Progr. 45(1–3), 43–70 (2000)

    Article  Google Scholar 

  3. Alferes, J.J., Pereira, L.M., Przymusinski, T., Przymusinska, H., Quaresma, P.: Preliminary exploration on actions as updates. In: Proceeding of the Joint Conference on Declarative Programming (AGP 1999) (1999)

    Google Scholar 

  4. Alferes, J.J., Pereira, L.M., Swift, T.: Abduction in well-founded semantics and generalized stable models via tabled dual programs. Theory Pract. Log. Progr. 4(4), 383–428 (2004)

    Article  Google Scholar 

  5. Alferes, J.J., Pereira, L.M., Swift, T.: Abdual meta-interpreter. Available from http://www.cs.sunysb.edu/~tswift/interpreters.html (2004)

  6. Banti, F., Alferes, J.J., Brogi, A.: Well founded semantics for logic program updates. In: Proceeding of the 9th Ibero-American Conference on Artificial Intelligence (IBERAMIA), LNCS, vol. 3315, pp. 397–407 (2004)

    Google Scholar 

  7. Eichberg, M., Kahl, M., Saha, D., Mezini, M., Ostermann, K.: Automatic incrementalization of prolog based static analyses. In: Proceedings of the 9th International Symposium on Practical Aspects of Declarative Languages (PADL), LNCS, vol. 4354, pp. 109–123. Springer (2007)

    Google Scholar 

  8. Kowalski, R., Sadri, F.: Abductive logic programming agents with destructive databases. Ann. Math. Artif. Intell. 62(1), 129–158 (2011)

    Article  Google Scholar 

  9. Pereira, L.M., Damásio, C.V., Alferes, J.J.: Debugging by diagnosing assumptions. In: Automatic Algorithmic Debugging, LNCS, vol. 749, pp. 58–74. Springer (1993)

    Google Scholar 

  10. Pereira, L.M., Damásio, C.V., Alferes, J.J.: Diagnosis and debugging as contradiction removal in logic programs. In: Progress in Artificial Intelligence, LNAI, vol. 727, pp. 183–197. Springer (1993)

    Google Scholar 

  11. Poole, D.L.: A logical framework for default reasoning. Artif. Intell. 36(1), 27–47 (1988)

    Article  Google Scholar 

  12. Saha, D.: Incremental evaluation of tabled logic programs. Ph.D. thesis, SUNY Stony Brook (2006)

    Google Scholar 

  13. Saha, D., Ramakrishnan, C.R.: Incremental and demand-driven points-to analysis using logic programming. In: Proceedings of the 7th ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming (PPDP), pp. 117–128. ACM (2005)

    Google Scholar 

  14. Saha, D., Ramakrishnan, C.R.: A local algorithm for incremental evaluation of tabled logic programs. In: Proceedings of the 22nd International Conference on Logic Programming (ICLP), LNCS, vol. 4079, pp. 56–71. Springer (2006)

    Google Scholar 

  15. Saptawijaya, A., Pereira, L.M.: Program updating by incremental and answer subsumption tabling. In: Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), LNCS, vol. 8148, pp. 479–484. Springer (2013)

    Google Scholar 

  16. Saptawijaya, A., Pereira, L.M.: Towards practical tabled abduction usable in decision making. In: Proceedings of the 5th KES International Conference on Intelligent Decision Technologies (IDT), Frontiers of Artificial Intelligence and Applications (FAIA). IOS Press (2013)

    Google Scholar 

  17. Saptawijaya, A., Pereira, L.M.: Tabdual: a tabled abduction system for logic programs. IfCoLog J. Log. Appl. 2(1), 69–123 (2015)

    Google Scholar 

  18. Swift, T.: Tabling for non-monotonic programming. Ann. Math. Artif. Intell. 25(3–4), 201–240 (1999)

    Article  Google Scholar 

  19. Swift, T.: Incremental tabling in support of knowledge representation and resoning. Theory Pract. Log. Progr. 14(4–5), 553–567 (2014)

    Article  Google Scholar 

  20. Swift, T., Warren, D.S.: Tabling with answer subsumption: Implementation, applications and performance. In: JELIA 2010, LNCS, vol. 6341, pp. 300–312. Springer (2010)

    Google Scholar 

  21. Swift, T., Warren, D.S.: XSB: extending Prolog with tabled logic programming. Theory Pract. Log. Progr. 12(1–2), 157–187 (2012)

    Google Scholar 

  22. Swift, T., Warren, D.S., Sagonas, K., Freire, J., Rao, P., Cui, B., Johnson, E., de Castro, L., Marques, R.F., Saha, D., Dawson, S., Kifer, M.: The XSB System Version 3.6.x Volume 1: Programmer’s Manual (2015)

    Google Scholar 

  23. Warren, D.: Interning ground terms in XSB. In: Colloquium on Implementation of Constraint and Logic Programming Systems (CICLOPS 2013) (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Luís Moniz Pereira .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Pereira, L.M., Saptawijaya, A. (2016). Tabling in Abduction and Updating. In: Programming Machine Ethics. Studies in Applied Philosophy, Epistemology and Rational Ethics, vol 26. Springer, Cham. https://doi.org/10.1007/978-3-319-29354-7_5

Download citation

Publish with us

Policies and ethics