Skip to main content
SpringerLink
Log in

A Bounded Search Space of Clausal Theories

  • Conference paper
  • First Online:
Book cover Inductive Logic Programming (ILP 1999)

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

Included in the following conference series:

Abstract

In this paper the problem of induction of clausal theories through a search space consisting of theories is studied. We order the search space by an extension of θ-subsumption for theories, and find a least generalization and a greatest specialization of theories. A most specific theory is introduced, and we develop a refinement operator bounded by this theory.

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. H. Arimura. Learning acyclic first-order horn sentences from entailment. In Proc. of ALT-97, LNAI 1316, pp. 432–445. Springer-Verlag, 1997.

    Google Scholar 

  2. M. R. Garey and D. S. Johnson. Computers and Intractability-A Guide to Theory of NP-completeness. Freeman, 1997.

    Google Scholar 

  3. M. Krishna Rao and A. Satter. Learning from entailment of logic programs with local variables. Proc. of ALT-98, LNAI 1501, pp. 143–157. Springer-Verlag, 1998.

    Google Scholar 

  4. P. R. J. van der Laag and S.-H. Nienhuys-Cheng. Existence and nonexistence of complete refinement operators. In Proc. of ECML-94, LNAI 784, pp. 307–322. Springer-Verlag, 1994.

    Google Scholar 

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

    Article  Google Scholar 

  6. S. Muggleton. Completing inverse entailment. In Proc. of ILP-98, LNAI 1446, pp. 245–249. Springer-Verlag, 1998.

    Google Scholar 

  7. S.-H. Nienhuys-Cheng and R. de Wolf. Foundations of Inductive Logic Programming. LNAI 1228. Springer-Verlag, 1997.

    Google Scholar 

  8. G. D. Plotkin. Automatic Methods of Inductive Inference. PhD thesis, Edinburgh University, 1971.

    Google Scholar 

  9. J. C. Reynolds. Transformational systems and the algebraic structure of atomic formulas. In Machine Intelligence, vol. 5, pp. 135–151. Edinburgh University Press, 1970.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, Norwegian University of Science and Technology, N-7491, TRONDHEIM, Norway

    Herman Midelfart

Authors
  1. Herman Midelfart
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Intelligent Systems, Jožef Stefan Institute, Jamova 39, SI-1000, Ljubljana, Slovenia

    Sašo Džeroski

  2. Department of Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, UK

    Peter Flach

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Midelfart, H. (1999). A Bounded Search Space of Clausal Theories. In: Džeroski, S., Flach, P. (eds) Inductive Logic Programming. ILP 1999. Lecture Notes in Computer Science(), vol 1634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48751-4_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-48751-4_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66109-2

  • Online ISBN: 978-3-540-48751-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation