Skip to main content
SpringerLink
Log in

OPENLOG: A Logic Programming Language Based on Abduction

  • Conference paper
Principles and Practice of Declarative Programming (PPDP 1999)

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

Abstract

In this paper, we introduce a programming language for an abductive reasoner. We propose the syntax for an imperative language in the usual manner and its semantics as a mapping from the language statements to an abductive logic program. The design is such that any semantics for abductive logic programs could be taken as the basic semantics for the programming language that we propose. In this way, we build upon existing formalizations of abductive reasoning and abductive logic programming. One innovative aspect of this work is that the agent processing and executing OPENLOG programs will stay open to the environment and will allow for changes in its environment and assimilation of new information generated by these changes.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allen, J.F.: Temporal reasoning and planning. In: Allen, J.F., Kautz, H., Pelavin, R., Tenenberg, J. (eds.) Reasoning About Plans. Morgan Kauffmann Publishers, Inc., San Mateo (1991) ISBN 1-55860-137-6

    Google Scholar 

  2. Charniak, E., McDermott, D.: Introduction to Artificial Intelligence. Addison-Wesley, Menlo Park (1985)

    MATH  Google Scholar 

  3. Console, L., Dupre, T., Torasso, P.: On the relationship between abduction and deduction. Journal of Logic and Computation 2(5), 661–690 (1991)

    Article  Google Scholar 

  4. Dávila, J.A.: Knowledge assimilation in multi-agents system. Master’s thesis, Imperial College, London (September 1994)

    Google Scholar 

  5. Dávila J.A.: A logic-based agent. Technical report, Imperial College, London, (February 1996)

    Google Scholar 

  6. Dávila, J. A.: Agents in Logic Programming. PhD thesis, Imperial College, London (May 1997)

    Google Scholar 

  7. de Kleer, J.: An assumption-based tms. Artificial Intelligence 32 (1986)

    Google Scholar 

  8. Dean, T., Boddy, M.: An analysis of time-dependent planning. In: AAAI 1988: The Seventh National Conference on AI, Saint Paul, Minnesota, August 1988, vol. 1 (1988)

    Google Scholar 

  9. Denecker, M., De Schreye, D.: Sldnfa: an abductive procedure for abductive logic programs. The journal of logic programming (1995)

    Google Scholar 

  10. Eshghi, K., Kowalski, R.: Abduction compare with negation as failure. In: Levi, G., Martelli, M. (eds.) Proceedings of the International Conference on Logic Programming, Lisbon, Portugal, pp. 234–255. MIT Press, Cambridge (1989)

    Google Scholar 

  11. Eshghi, K.: Abductive planning with event calculus. In: Proceedings 5th International Conference on Logic Programming, p. 562 (1988)

    Google Scholar 

  12. Evans, C.A.: Negation as failure as an approach to the Hanks and McDermott problem. In: Cantu-Ortiz, F.J. (ed.) Proc. 2nd. International Symposium on Artificial Intelligence, Monterrey, Mexico. McGraw-Hill, New York (1989)

    Google Scholar 

  13. Fung, T., Kowalski, R.: The iff proof procedure for abductive logic programming. The Journal of logic programming 33(2), 151–178 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  14. Fung, T.H.: Abduction by deduction. PhD thesis, Imperial College, London (January 1996)

    Google Scholar 

  15. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  16. Kakas, A.C., Kowalski, R., Toni, F.: Abductive logic programming. Journal of Logic and Computation 2(6), 719–770 (1993)

    Article  MathSciNet  Google Scholar 

  17. Kakas, A.C., Mancarella, P.: Abductive logic programming. In: Marek, W., Nerode, A., Pedreschi, D., Subrahmanian, V.S. (eds.) Proc. NACLP Workshop on Non-monotonic Reasoning and Logic Programming, Austin, Texas (1990)

    Google Scholar 

  18. Kowalski, R.: Using metalogic to reconcile reactive with rational agents. In: Apt, K., Turini, F. (eds.) Meta-Logics and Logic Programming. MIT Press, Cambridge (1995), Also at, http://www-p.doc.ic.ac.uk/UserPages/staff/rak/recon-abst.html

  19. Kowalski, R., Sadri, F.: The situation calculus and event calculus compared. In: Bruynooghe, M. (ed.) Proc. International Logic Programming Symposium, pp. 539–553. MIT Press, Cambridge (1994), also at, http://www-Ip.doc.ic.ac.uk/UserPages/staff/fs/ilps94.html

  20. Kowalski, R., Sergot, M.: A logic-based calculus of events. New Generation Computing 4, 67–95 (1986)

    Article  Google Scholar 

  21. Levesque, H., Reiter, R., Lespérance, Y., Fangzhen, L., Scherl, R.B.: Golog: A logic programming language for dynamic domains. The Journal of Logic Programming 31, 59–84 (1997)

    Article  MATH  Google Scholar 

  22. McCarthy, J., Hayes, P.: Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence 4, 463–502 (1969)

    MATH  Google Scholar 

  23. Sun Microsystems. Hotjava home page, http://java.sun.com/

  24. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  25. Missiaen, L., Bruynooghe, M., Denecker, M.: Chica an abductive planning system based on event calculus. Journal of Logic and Computation 5(5), 579–602 (1995)

    Article  MATH  Google Scholar 

  26. Pereira, F.C.N., Warren, D.H.D.: Definite clause grammars for language analysis-a survey of the formalism and a comparison with augmented transition networks. Artificial Intelligence 13, 231–278 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  27. Poole, D.: Explanation and prediction: an architecture for default and abductive reasoning. Computational Intelligence Journal 5, 97–110 (1989)

    Article  Google Scholar 

  28. Poole, D.: Logic programming for robot control. In: Mellish, C.S. (ed.) Proc. International Joint Conference on Artificial Intelligence, San Mateo, California, pp. 150–157. Morgan Kaufmann Publishers, Inc., San Francisco (1995)

    Google Scholar 

  29. Rosenschein, S.J., Kaelbling, L.P.: A situated view of representation and control. Artificial Intelligence 73, 149–173 (1995)

    Article  Google Scholar 

  30. Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice Hall, Englewood Cliffs (1995)

    MATH  Google Scholar 

  31. Shanahan, M.: Prediction is deduction but explanation is abduction. In: Sridharan, N.S. (ed.) Proc. International Joint Conference on Artificial Intelligence, pp. 1055–1060. Morgan Kaufmann, Detroit (1989)

    Google Scholar 

  32. Shanahan, M.: Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia. MIT Press, Cambridge (1997)

    Google Scholar 

  33. Toni, F.: Abductive Logic Programming. PhD thesis, Imperial College, London (July 1995)

    Google Scholar 

  34. van Emden, M., Kowalski, R.: The semantics of predicate logic as a programming language. Journal of the ACM 4(4), 733–742 (1976)

    Article  Google Scholar 

  35. Wetzel, G.: Abductive and Constraint Logic Programming. PhD thesis, Imperial College, London (March 1997)

    Google Scholar 

  36. Wetzel, G., Kowalski, R., Toni, F.: A theorem-proving approach to clp. In: Krall, A., Geske, U. (eds.) Workshop Logische Program-mierung, number 270, GMD-Studien, September 1995, vol.270, pp. 63–72 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centro de Simulación y Modelos (CESIMO), Universidad de Los Andes, Mérida, Venezuela

    Jacinto A. Dávila

Authors
  1. Jacinto A. Dávila
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Digital Technology Center and Dept of CS, University of Minnesota,  

    Gopalan Nadathur

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dávila, J.A. (1999). OPENLOG: A Logic Programming Language Based on Abduction. In: Nadathur, G. (eds) Principles and Practice of Declarative Programming. PPDP 1999. Lecture Notes in Computer Science, vol 1702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10704567_17

Download citation

  • DOI: https://doi.org/10.1007/10704567_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66540-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation