Skip to main content
Conference Proceedings

Expressive power of safe first-order logical decision trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7207 LNAI 160-172
DOI: 10.1007/978-3-642-31951-8_17
0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Gillis, J. J. M., & Van Den Bussche, J. (2012). Expressive power of safe first-order logical decision trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7207 LNAI, pp. 160–172). https://doi.org/10.1007/978-3-642-31951-8_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free