Skip to main content

An abductive proof procedure for conditional logic programming

  • Conference paper
  • First Online:
Practical Reasoning (FAPR 1996)

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

Included in the following conference series:

  • 134 Accesses

Abstract

We develop an abductive extension of the hypothetical language CondLP + within the argumentation framework. The language supports hypothetical updates together with integrity constraints, and it makes use of a revision mechanism to restore consistency when an update violates some integrity constraint. We introduce a semantics for the language based on the notion of admissible solution, and we define an abductive proof procedure to compute them. The language can be used to perform several types of defeasible reasoning. We discuss how the revision policy of the language can be modified to perform different types of reasoning, like reasoning about actions.

This work has been partially supported by ESPRIT Basic Research Project 6471, Medlar II.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. C. Baral, S. Kraus, J. Minker, V. S. Subrahmanian. Combining knowledge bases consisting of first-order theories. J. Automated Reasoning, vol.8, n.1, pp. 45–71, 1992.

    Google Scholar 

  2. M. Baldoni, L.Giordano, and A. Martelli. A multimodal logic to define modules in logic programming. In Proc. 1993 International Logic Programming Symposium, pages 473–487, Vancouver, 1993.

    Google Scholar 

  3. L. Cholvy. Proving theorems in a multi-source environment. In Proc. IJCAI-93, pages 66–71, Chambery, 1993.

    Google Scholar 

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

    Google Scholar 

  5. 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 

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

    Google Scholar 

  7. L. Fariñas del Cerro and A. Herzig. An automated modal logic for elementary changes. In P. Smets et al., editor, Non-standard Logics for Automated Reasoning. Academic Press, 1988.

    Google Scholar 

  8. D. M. Gabbay and N. Reyle. NProlog: An extension of Prolog with hypothetical implications.I. Journal of Logic Programming, (4):319–355, 1984.

    Article  Google Scholar 

  9. D. Gabbay, L. Giordano, A. Martelli, and N. Olivetti. Conditional logic programming. In Proc. 11th ICLP, Santa Margherita Ligure, pages 272–289, 1994.

    Google Scholar 

  10. Dov Gabbay, Laura Giordano, Alberto Martelli, and Nicola Olivetti. Hypothetical updates, priority and inconsistency in a logic programming language. In Proc. LPNMR-95, LNAI 928, pages 203–216, 1995.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  13. N. Leone and P. Rullo. Ordered logic programming with sets. J. of Logic and Computation, 3(6):621–642, 1993.

    Google Scholar 

  14. S. Naqvi and F. Rossi. Reasoning in inconsistent databases. In Proc. of the 1990 North American Conf. on Logic Programming, pages 255–272, 1990.

    Google Scholar 

  15. L.M. Pereira, J.J. Alferes, J.N. Aparicio Contradiction Removal within the Well Founded Semantics. Proc. LPNMR-91, (1991) 105–119.

    Google Scholar 

  16. L.M. Pereira, C.V. Damasio, J.J. Alferes Diagnosis and Debugging as Contradiction Removal. Proc. LPNMR-93, (1993) 316–330.

    Google Scholar 

  17. F. Toni and A. Kakas. Computing the acceptability semantics. In Proc. LPNMR-95, pages 401–415, 1995.

    Google Scholar 

  18. M. Winslett. Updating Logical Databases. Cambridge University Press, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dov M. Gabbay Hans Jürgen Ohlbach

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giordano, L., Martelli, A., Sapino, M.L. (1996). An abductive proof procedure for conditional logic programming. In: Gabbay, D.M., Ohlbach, H.J. (eds) Practical Reasoning. FAPR 1996. Lecture Notes in Computer Science, vol 1085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61313-7_76

Download citation

  • DOI: https://doi.org/10.1007/3-540-61313-7_76

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61313-8

  • Online ISBN: 978-3-540-68454-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics