Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Andrew Cropper"'
Autor:
Joshua S. Rule, Steven T. Piantadosi, Andrew Cropper, Kevin Ellis, Maxwell Nye, Joshua B. Tenenbaum
Publikováno v:
Nature Communications, Vol 15, Iss 1, Pp 1-16 (2024)
Abstract Throughout their lives, humans seem to learn a variety of rules for things like applying category labels, following procedures, and explaining causal relationships. These rules are often algorithmically rich but are nonetheless acquired with
Externí odkaz:
https://doaj.org/article/95ebeef2ed6c4cfbadf7273793a67684
Publikováno v:
AAAI
A key feature of inductive logic programming (ILP) is its ability to learn first-order programs, which are intrinsically more expressive than propositional programs. In this paper, we introduce ILP techniques to learn higher-order programs. We implem
Autor:
Andrew Cropper
Publikováno v:
AAAI
Most program induction approaches require predefined, often hand-engineered, background knowledge (BK). To overcome this limitation, we explore methods to automatically acquire BK through multi-task learning. In this approach, a learner adds learned
Autor:
Rolf Morel, Andrew Cropper
We describe an inductive logic programming (ILP) approach called learning from failures. In this approach, an ILP system (the learner) decomposes the learning problem into three separate stages: generate, test, and constrain. In the generate stage, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e36aeb46de3d248d40c31d866d22bdeb
https://doi.org/10.1007/s10994-020-05934-z
https://doi.org/10.1007/s10994-020-05934-z
Autor:
Céline Hocquette, Andrew Cropper
A magic value in a program is a constant symbol that is essential for the execution of the program but has no clear explanation for its choice. Learning programs with magic values is difficult for existing program synthesis approaches. To overcome th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a4c3d7ab8db5eacbc2d49ec0a884fd1
Inductive logic programming (ILP) is a form of logic-based machine learning. The goal is to induce a hypothesis (a logic program) that generalises given training examples. As ILP turns 30, we review the last decade of research. We focus on (i) new me
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c01d0da902c62139b3c6b7fe90a0dcb
Autor:
Andrew Cropper, Sophie Tourret
Publikováno v:
Logics in Artificial Intelligence-16th European Conference, JELIA 2019, Rende, Italy, May 7-11, 2019, Proceedings
Logics in Artificial Intelligence-16th European Conference, JELIA 2019, Rende, Italy, May 7-11, 2019, Proceedings, pp.259-276, 2019, ⟨10.1007/978-3-030-19570-0_17⟩
LNCS, LNAI, JELIA
JELIA 2019-European Conference on Logics in Artificial Intelligence
JELIA 2019-European Conference on Logics in Artificial Intelligence, May 2019, Rende, Italy. pp.259-276, ⟨10.1007/978-3-030-19570-0_17⟩
Logics in Artificial Intelligence ISBN: 9783030195694
JELIA
Logics in Artificial Intelligence-16th European Conference, JELIA 2019, Rende, Italy, May 7-11, 2019, Proceedings, pp.259-276, 2019, ⟨10.1007/978-3-030-19570-0_17⟩
LNCS, LNAI, JELIA
JELIA 2019-European Conference on Logics in Artificial Intelligence
JELIA 2019-European Conference on Logics in Artificial Intelligence, May 2019, Rende, Italy. pp.259-276, ⟨10.1007/978-3-030-19570-0_17⟩
Logics in Artificial Intelligence ISBN: 9783030195694
JELIA
International audience; ()[0000−0002−6070−796X] and Andrew Cropper 2[0000−0002−4543−7199] Abstract. We present the derivation reduction problem for SLD-resolution, the undecidable problem of finding a finite subset of a set of clauses fro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1200222a7f1ff1819496be86550c0e92
https://hal.archives-ouvertes.fr/hal-02988015/file/jelia2019tc.pdf
https://hal.archives-ouvertes.fr/hal-02988015/file/jelia2019tc.pdf
Autor:
Andrew Cropper, Sebastijan Dumančić
Inductive logic programming (ILP) is a form of machine learning. The goal of ILP is to induce a hypothesis (a set of logical rules) that generalises training examples. As ILP turns 30, we provide a new introduction to the field. We introduce the nece
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f59b1ca352aa819cf5d56355d338622b
http://arxiv.org/abs/2008.07912
http://arxiv.org/abs/2008.07912
Autor:
Andrew Cropper, Sebastijan Dumancic
Publikováno v:
IJCAI
A major challenge in inductive logic programming (ILP) is learning large programs. We argue that a key limitation of existing systems is that they use entailment to guide the hypothesis search. This approach is limited because entailment is a binary
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d4fbbcb1e4b44b34bcb16dd19f2918b
http://arxiv.org/abs/2004.09855
http://arxiv.org/abs/2004.09855
A key feature of inductive logic programming (ILP) is its ability to learn first-order programs, which are intrinsically more expressive than propositional programs. In this paper, we introduce techniques to learn higher-order programs. Specifically,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::79a046eee7415532e7967a60599a9039
https://doi.org/10.1007/s10994-019-05862-7
https://doi.org/10.1007/s10994-019-05862-7