Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Non-monotonic Extensions of Logic Programming

NMELP 1996: Non-Monotonic Extensions of Logic Programming pp 132–150Cite as

An abductive proof procedure for reasoning about actions in modal logic programming

  • Applications
  • Conference paper
  • First Online:

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

Abstract

In this paper we propose a modal approach for reasoning about actions in a logic programming framework. We introduce a modal language which makes use of abductive assumptions to deal with persistency, and provides a solution to the ramification problem, by allowing one-way “causal rules” to be defined among fluents.

We define the abductive semantics of the language and a goal directed abductive proof procedure to compute abductive solutions for a goal from a given domain description. Both the semantics and the procedure are defined within the argumentation framework. In particular, we focus on a specific semantics, which is essentially an extension of Dung's admissibility semantics to a modal setting. The proof procedure is proved to be sound with respect to this semantics.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Baldoni, L.Giordano, and A.Martelli. A multimodal logic to define modules in logic programming. In Proc. ILPS'93, pages 473–487, Vancouver, 1993.

    Google Scholar 

  2. M. Baldoni, L.Giordano, and A.Martelli. A framework for modal logic programming. to appear in Proc. JICSLP'96, 1996.

    Google Scholar 

  3. A. Bondarenko, F. Toni, R. A. Kowalski. An assumption based framework for non-monotonic reasoning. in Proc. 2nd Int. Workshop on Logic Programming and Non-monotonic Reasoning, 1993.

    Google Scholar 

  4. G. Brewka and J. Hertzberg. How to do things with worlds: on formalizing action and plans. In J. Logic and Computation, vol. 3, no.5, pages 517–532, 1993.

    Google Scholar 

  5. G. De Giacomo, M. Lenzerini. PDL-based framework for reasoning about actions. In LNAI 992, pages 103–114, 1995.

    Google Scholar 

  6. M. Denecker, L. Missiaen, M. Bruynooghe. Temporal Reasoning with Abductive Event Calculus. In Proc. ECAI-92, pages 384–388, Vienna, 1992.

    Google Scholar 

  7. M. Denecker, D. De Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. In Proc. ILPS'93, pages 147–163, Vancouver, 1993.

    Google Scholar 

  8. P. M. Dung. Negations as hypotheses: an abductive foundation for logic programming. In Proc. ICLP'91, pages 3–17, 1991.

    Google Scholar 

  9. P. M. Dung. On the acceptability of arguments and its fundamental role in non-monotonic reasoning and logic programming. In Proc. IJCAI93, pages 852–857, 1993.

    Google Scholar 

  10. P. M. Dung. Representing Actions in Logic Programming and its Applications to Database Updates. In Proc. ICLP'93, pages 222–238, Budapest, 1993.

    Google Scholar 

  11. K. Eshghi and R. Kowalski. Abduction compared with negation by failure. In Proc. 6th ICLP'89, pages 234–254, Lisbon, 1989.

    Google Scholar 

  12. L. Fariñas del Cerro and A. Herzig. Interference logic=conditional logic+frame axiom. In Int. J. of Intelligent Systems, 9(1):119–130, 1994.

    Google Scholar 

  13. L. Giordano, A. Martelli and M.L. Sapino. An abductive proof procedure for Conditional Logic Programming. In Proc. FAPR'96, LNAI 1085, pages 231–245, 1996.

    Google Scholar 

  14. L. Giordano and A. Martelli. Reasoning about actions in modal logic programming. Technical Report, 1996.

    Google Scholar 

  15. M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In Fifth International Conference and Symposium on Logic Programming, pages 1070–1080, Seattle, 1988.

    Google Scholar 

  16. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Proc. ICLP'90, pages 579–597, Jerusalem, 1990.

    Google Scholar 

  17. M. Gelfond and V. Lifschitz. Representing Action and Change by Logic Programs. In J. Logic Programming, pages 301–321, 1993.

    Google Scholar 

  18. D. Harel. First order dynamic logic in Extensions of Classical Logic, Handbook of Philosophical Logic II, pp. 497–604, 1984.

    Google Scholar 

  19. G.N. Kartha and V. Lifschitz. Actions with Indirect Effects (Preliminary Report). In Proc. KR'94, pages 341–350, 1995.

    Google Scholar 

  20. A.C. Kakas, P. Mancarella, P.M. Dung. The acceptability semantics for logic programs. In Proc. 11th ICLP'94, Santa Margherita Ligure, pages 504–519, 1994.

    Google Scholar 

  21. R. Li and L.M. Pereira. Temporal Reasoning with Abductive Logic Programming. In Proc. ECAI'96, pages 13–17, 1996.

    Google Scholar 

  22. R. Li and L.M. Pereira. Representing and Reasoning about Concurrent Actions with Abductive Logic Programs. To appear in Annals of Mathematics and AI, Special Issue for Gelfondfest, 1996.

    Google Scholar 

  23. F. Lin. Embracing Causality in Specifying the Indirect Effects of Actions. In Proc. IJCAI'95, pages 1985–1991, 1995.

    Google Scholar 

  24. N. McCain and H. Turner. A Causal Theory of Ramifications and Qualifications. In Proc. IJCAI'95, pages 1978–1984, 1995.

    Google Scholar 

  25. L. M. Pereira, J. N. Apanicio and J. J. Alferes. Non-Monotonic Reasoning with Logic Programming, In J. of Logic Programming, 17, pages 227–263, 1993.

    Article  Google Scholar 

  26. T. C. Przymusinski. Extended stable semantics for normal and disjunctive programs. in Proc. ICLP90 Conference, pp. 459–477, 1990.

    Google Scholar 

  27. E. Sandewall. Feature and Fluents, Oxford University Press, 1994.

    Google Scholar 

  28. C. Schwind. A Logic Based Framework for Action Theories. In Proc. TSLLC, Jean-Jacques Levy and Zurab Khasidashvil (eds.), to appear in CSLI-series Stanford,USA, 1996.

    Google Scholar 

  29. M. Thielscher. Ramification and Causality. To appear in Artificial Intelligence, 1996.

    Google Scholar 

  30. F. Toni and A. Kakas. Computing the acceptability semantics. In LNAI 928, pages 401–415, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Universitá di Torino, C.so Svizzera 185, 10149, Torino, Italy

    Matteo Baldoni, Laura Giordano, Alberto Martelli & Viviana Patti

Authors
  1. Matteo Baldoni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laura Giordano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alberto Martelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Viviana Patti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jürgen Dix Luís Moniz Pereira Teodor C. Przymusinski

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baldoni, M., Giordano, L., Martelli, A., Patti, V. (1997). An abductive proof procedure for reasoning about actions in modal logic programming. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds) Non-Monotonic Extensions of Logic Programming. NMELP 1996. Lecture Notes in Computer Science, vol 1216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023805

Download citation

  • DOI: https://doi.org/10.1007/BFb0023805

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62843-9

  • Online ISBN: 978-3-540-68702-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation