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
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
Blockeel, H., De Raedt, L.: Top-down induction of first-order logical decision trees. Artificial Intelligence 101, 285–297 (1998)
Blockeel, H., Dehaspe, L., Ramon, J., Struyf, J., Van Assche, A., Vens, C., Fierens, D.: The ace data mining system (2008)
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
Chandra, A., Harel, D.: Structure and complexity of relational queries. Journal of Computer and System Sciences 25(1), 99–128 (1982)
De Raedt, L.: Logical and Relational Learning. Cognitive Technologies. Springer (2008)
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)
Ohsherson, D., Weinstein, S.: Identification in the limit of first order structures. Journal of Philiosophical Logic 15, 55–81 (1986)
Osherson, D., Stob, M., Weinstein, S.: A universal inductive inference machine. The Journal of Symbolic Logic 56, 661–672 (1991)
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)
Ullman, J.: Principles of Database and Knowledge-Base Systems, vol. I. Computer Science Press (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)
