Skip to main content

Expressive Power of Safe First-Order Logical Decision Trees

  • Conference paper
  • 909 Accesses

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

Abstract

This paper characterizes the expressive power of a subclass of first-order logical decision trees (FOLDTs) as a fragment of first-order logic. Specifically, using safe FOLDTs one can express precisely the boolean combinations of safe existential sentences.

Keywords

  • Free Variable
  • Expressive Power
  • Inductive Logic Programming
  • Relation Symbol
  • Boolean Combination

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, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

  1. Blockeel, H., De Raedt, L.: Top-down induction of first-order logical decision trees. Artificial Intelligence 101, 285–297 (1998)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Blockeel, H., Dehaspe, L., Ramon, J., Struyf, J., Van Assche, A., Vens, C., Fierens, D.: The ace data mining system (2008)

    Google Scholar 

  3. Blockeel, H., Dehaspe, L., Demoen, B., Janssens, G., Ramon, J., Vandecasteele, H.: Improving the efficiency of inductive logic programming through the use of query packs. Journal of Artificial Intelligence Research 16, 135–166 (2002), https://lirias.kuleuven.be/handle/123456789/123799

    MATH  Google Scholar 

  4. Chandra, A., Harel, D.: Structure and complexity of relational queries. Journal of Computer and System Sciences 25(1), 99–128 (1982)

    CrossRef  MATH  Google Scholar 

  5. De Raedt, L.: Logical and Relational Learning. Cognitive Technologies. Springer (2008)

    Google Scholar 

  6. Martin, É., Sharma, A., Stephan, F.: A General Theory of Deduction, Induction, and Learning. In: Jantke, K.P., Shinohara, A. (eds.) DS 2001. LNCS (LNAI), vol. 2226, pp. 228–242. Springer, Heidelberg (2001)

    CrossRef  Google Scholar 

  7. Ohsherson, D., Weinstein, S.: Identification in the limit of first order structures. Journal of Philiosophical Logic 15, 55–81 (1986)

    Google Scholar 

  8. Osherson, D., Stob, M., Weinstein, S.: A universal inductive inference machine. The Journal of Symbolic Logic 56, 661–672 (1991)

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Terwijn, S.: Learning and computing in the limit. In: Logic Colloquium 2002. Lect. Notes Log., vol. 27, pp. 349–359. Assoc. Symbol. Logic, La Jolla (2006)

    Google Scholar 

  10. Ullman, J.: Principles of Database and Knowledge-Base Systems, vol. I. Computer Science Press (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gillis, J.J.M., Van den Bussche, J. (2012). Expressive Power of Safe First-Order Logical Decision Trees. In: Muggleton, S.H., Tamaddoni-Nezhad, A., Lisi, F.A. (eds) Inductive Logic Programming. ILP 2011. Lecture Notes in Computer Science(), vol 7207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31951-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31951-8_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31950-1

  • Online ISBN: 978-3-642-31951-8

  • eBook Packages: Computer ScienceComputer Science (R0)