Skip to main content
SpringerLink
Log in
Book cover

International Conference on Inductive Logic Programming

ILP 2002: Inductive Logic Programming pp 182–197Cite as

Using Theory Completion to Learn a Robot Navigation Control Program

  • Conference paper
  • First Online:

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

Abstract

An Event Calculus program to control the navigation of a real robot was generated using Theory Completion techniques. This is an application of ILP in the non-observational predicate learning setting. This work utilized 1) extraction-case abduction; 2) the simultaneous completion of two, mutually related predicates; and 3) positive observations only learning. Given time-trace observations of a robot successfully navigating a model office and other background information, Theory Completion was used to induce navigation control programs in the event calculus. Such programs consisted of many clauses (up to 15) in two mutually related predicates. This application demonstrates that abduction and induction can be combined to effect non-observational multi-predicate learning.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bulitko and Wilkins, 1999. V. V. Bulitko and D. C. Wilkins. Learning to Envision: An Intelligent Agent for Ship Damage Control. In Proceedings of the ACAI’99 conference, Crete, Greece, 1999.

    Google Scholar 

  • De Raedt et al., 1993. Luc De Raedt, Nada Lavrac, and Saso Dzeroski. Multiple predicate learning. In Preceedings of IJCAI 93, p. 1037–1042. 1993.

    Google Scholar 

  • Denecker et al., 1996. Marc Denecker, Kristof Van Belleghem, Guy Duchatelet, Frank Piessens, and Danny De Schreye. A Realistic Experiment in Knowledge Representation in Open Event Calculus: Protocol Specification. In M. Maher, editor, Proceedings of JICSLP’96, the Joint International Conference and Symposium on Logic Programming, p. 170–184. Bonn, Germany, 1996. MIT Press.

    Google Scholar 

  • Esposito et al., 2000. Floriana Esposito, Donato Malerba, and Francesca A. Lisi. Induction of Recursive Theories in the Normal ILP Setting: Issues and Solutions. In J. Cussens and A. Frisch, editors, Inductive Logic Programming: 10th International Conference, p. 93–111. Springer, London, 2000.

    Google Scholar 

  • Flach and Kakas, 2000. Peter A. Flach and Antonis C. Kakas eds. Abduction and Induction: Essays on their Relation and Integration. Applied Logic Series, D. M. Gabbay. Vol. 18. Kluwer Academic Publishers, 2000.

    Google Scholar 

  • Kakas and Michael, 1995. A. C. Kakas and A. Michael. Integrating Abductive and Constraint Logic Programming. In Proceedings of the 12th International Conference on Logic Programming, Japan, 1995.

    Google Scholar 

  • Kakas and Riguzzi, 2000. Antonis C. Kakas and Fabrizio Riguzzi. Abductive Concept Learning. New Generation Computing, 18:243–294, 2000.

    Article  Google Scholar 

  • Klingspor and Morik, 1995. Volker Klingspor and Katharina Morik. Towards Concept Formation Grounded on Perception and Action of a Mobile Robot. In U. Rembold, et al., editors, IAS-4, Proceedings of the 4th International Conference on Intelligent Autonomous Systems, IOS Press, 1995.

    Google Scholar 

  • Kowalski and Sergot, 1986. Robert Kowalski and Marek Sergot. A Logic-based Calculus of Events. New Generation Computing, 4:67–95, 1986.

    Google Scholar 

  • Lorenzo and Otero, 2000. David Lorenzo and Ramon P. Otero. Using a ILP algorithm to learn Logic Programs for Reasoning about Actions. In J. Cussens and A. Frisch, editors, Inductive Logic Programming: Work-in-Progress Reports, p. 163–171. London, 2000.

    Google Scholar 

  • McCarthy, 1959. John McCarthy. Programs with Common Sense. In Proceedings of the Symposium on Mechanisation of Thought Processes, London, 1959. Her Majesty’s Stationery Office.

    Google Scholar 

  • Moyle and Muggleton, 1997. S. Moyle and S. Muggleton. Learning Programs in the Event Calculus. In N. Lavrac and S. Dzeroski, editors, 7th International Workshop, ILP-97, p. 205–212. Prague, 1997. Springer.

    Google Scholar 

  • Moyle, 1999. S. A. Moyle. Learning about Action and Change: An Inductive Logic Programming approach. Technical report, Oxford University Computing Laboratory, University of Oxford, Oxford, 1999.

    Google Scholar 

  • Moyle, 2000. S. A. Moyle. An investigation into Theory Completion techniques in Inductive Logic Programming. Thesis for D Phil, Oxford University Computing Laboratory, University of Oxford, 2000.

    Google Scholar 

  • Muggleton, 1995. S. Muggleton. Inverse Entailment and Progol. New Generation Computing, 13(3 and 4):245–286, 1995.

    Google Scholar 

  • Muggleton, 1996. S. Muggleton. Learning from positive data. In S. Muggleton, editor, Proceedings of the 6th International Workshop on Inductive Logic Programming, p. 225–244. 1996.

    Google Scholar 

  • Muggleton and Bryant, 2000. Stephen Muggleton and Christopher Bryant. Theory Completion Using Inverse Entailment. In J. Cussens and A. Frisch, editors, Inductive Logic Programming: 10th International Conference, p. 130–146. London, 2000. Springer.

    Google Scholar 

  • Charles Sanders Peirce. Elements of logic. In C. Hartshorne and P. Weiss, editors, Collected papers of Charles Sanders Peirce, Harvard University Press, Cambridge, Massachusetts, 1931.

    Google Scholar 

  • Sadri and Kowalski, 1995. Fariba Sadri and Robert Kowalski. Variants of the Event Calculus. In Proceedings of the 12th International Conference on Logic Programming, Japan, 1995.

    Google Scholar 

  • Shanahan, 1989. Murray Shanahan. Prediction is Deduction but Explanation is Abduction. In Preceedings of IJCAI 89, p. 1055–1060. 1989.

    Google Scholar 

  • Shanahan, 1990. Murray Shanahan. Representing Continuous Change in the Event Calculus. In Proceedings of ECAI 90, p. 598–603. 1990.

    Google Scholar 

  • Shanahan, 1997. Murray Shanahan. Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia. MIT Press, 1997.

    Google Scholar 

  • Shanahan, 2000. Murray Shanahan. A Logical Account of the Common Sense Informatic Situation for a Mobile Robot. Electronic Transactions on Artificial Intelligence,, 2000.

    Google Scholar 

  • Srinivasan, 2000. Ashwin Srinivasan, The Aleph Manual 2000, http://web.comlab.ox.ac.uk/oucl/research/areas/machlearn/Aleph/.

  • Sripada, 1995. Suryanarayana M. Sripada. Efficient Implementation of the Event Calculus for Temporal Database Applications. In Proceedings of the 12th International Conference on Logic Programming, Japan, 1995.

    Google Scholar 

  • Yamamoto, 2000. Akihiro Yamamoto. Using abduction for induction based on bottom generalization. In P. A. Flach and A. C. Kakas, editors, Abduction and Induction: Essays on their Relation and Integration, Kluwer Academic Publishers, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Oxford University Computing Laboratory Wolfson Building, Parks Road, OX1 3QD, Oxford, England

    Steve Moyle

Authors
  1. Steve Moyle
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Technology and Engineering, University of Ottawa, 800 King Edward Ave., K1N 6N5, Ottawa, ON, Canada

    Stan Matwin

  2. School of Computer Science and Engineering, University of New South Wales, 2052, Sydney, NSW, Australia

    Claude Sammut

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moyle, S. (2003). Using Theory Completion to Learn a Robot Navigation Control Program. In: Matwin, S., Sammut, C. (eds) Inductive Logic Programming. ILP 2002. Lecture Notes in Computer Science(), vol 2583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36468-4_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-36468-4_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00567-4

  • Online ISBN: 978-3-540-36468-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation