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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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
Charniak, E., McDermott, D.: Introduction to Artificial Intelligence. Addison-Wesley, Menlo Park (1985)
Console, L., Dupre, T., Torasso, P.: On the relationship between abduction and deduction. Journal of Logic and Computation 2(5), 661–690 (1991)
Dávila, J.A.: Knowledge assimilation in multi-agents system. Master’s thesis, Imperial College, London (September 1994)
Dávila J.A.: A logic-based agent. Technical report, Imperial College, London, (February 1996)
Dávila, J. A.: Agents in Logic Programming. PhD thesis, Imperial College, London (May 1997)
de Kleer, J.: An assumption-based tms. Artificial Intelligence 32 (1986)
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)
Denecker, M., De Schreye, D.: Sldnfa: an abductive procedure for abductive logic programs. The journal of logic programming (1995)
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)
Eshghi, K.: Abductive planning with event calculus. In: Proceedings 5th International Conference on Logic Programming, p. 562 (1988)
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)
Fung, T., Kowalski, R.: The iff proof procedure for abductive logic programming. The Journal of logic programming 33(2), 151–178 (1997)
Fung, T.H.: Abduction by deduction. PhD thesis, Imperial College, London (January 1996)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Kakas, A.C., Kowalski, R., Toni, F.: Abductive logic programming. Journal of Logic and Computation 2(6), 719–770 (1993)
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)
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
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
Kowalski, R., Sergot, M.: A logic-based calculus of events. New Generation Computing 4, 67–95 (1986)
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)
McCarthy, J., Hayes, P.: Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence 4, 463–502 (1969)
Sun Microsystems. Hotjava home page, http://java.sun.com/
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
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)
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)
Poole, D.: Explanation and prediction: an architecture for default and abductive reasoning. Computational Intelligence Journal 5, 97–110 (1989)
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)
Rosenschein, S.J., Kaelbling, L.P.: A situated view of representation and control. Artificial Intelligence 73, 149–173 (1995)
Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice Hall, Englewood Cliffs (1995)
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)
Shanahan, M.: Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia. MIT Press, Cambridge (1997)
Toni, F.: Abductive Logic Programming. PhD thesis, Imperial College, London (July 1995)
van Emden, M., Kowalski, R.: The semantics of predicate logic as a programming language. Journal of the ACM 4(4), 733–742 (1976)
Wetzel, G.: Abductive and Constraint Logic Programming. PhD thesis, Imperial College, London (March 1997)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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