Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Cerna, David M."'
Knowledge refactoring compresses a logic program by introducing new rules. Current approaches struggle to scale to large programs. To overcome this limitation, we introduce a constrained optimisation refactoring approach. Our first key idea is to enc
Externí odkaz:
http://arxiv.org/abs/2408.11530
Autor:
Cerna, David M., Parsert, Julian
We introduce a fragment of second-order unification, referred to as \emph{Second-Order Ground Unification (SOGU)}, with the following properties: (i) only one second-order variable is allowed, and (ii) first-order variables do not occur. We study an
Externí odkaz:
http://arxiv.org/abs/2404.10616
Interest in anti-unification, the dual problem of unification, is on the rise due to applications within the field of software analysis and related areas. For example, anti-unification-based techniques have found uses within clone detection and autom
Externí odkaz:
http://arxiv.org/abs/2310.11136
Autor:
Cerna, David M.
We present a generalization of first-order unification to a term algebra where variable indexing is part of the object language. We exploit variable indexing by associating some sequences of variables ($X_0,\ X_1,\ X_2,\dots$) with a mapping $\sigma$
Externí odkaz:
http://arxiv.org/abs/2306.09152
Autor:
Cerna, David M., Kutsia, Temur
Anti-unification (AU) is a fundamental operation for generalization computation used for inductive inference. It is the dual operation to unification, an operation at the foundation of automated theorem proving. Interest in AU from the AI and related
Externí odkaz:
http://arxiv.org/abs/2302.00277
Autor:
Cerna, David M., Cropper, Andrew
The ability to generalise from a small number of examples is a fundamental challenge in machine learning. To tackle this challenge, we introduce an inductive logic programming (ILP) approach that combines negation and predicate invention. Combining t
Externí odkaz:
http://arxiv.org/abs/2301.07629
Synthesizing large logic programs through symbolic Inductive Logic Programming (ILP) typically requires intermediate definitions. However, cluttering the hypothesis space with intensional predicates typically degrades performance. In contrast, gradie
Externí odkaz:
http://arxiv.org/abs/2208.06652
Autor:
Cerna, David M., Buran, Michal
Generalization techniques have many applications, including template construction, argument generalization, and indexing. Modern interactive provers can exploit advancement in generalization methods over expressive type theories to further develop pr
Externí odkaz:
http://arxiv.org/abs/2207.08918
Autor:
Cerna, David M.
We present a unification problem based on first-order syntactic unification which ask whether every problem in a schematically-defined sequence of unification problems is unifiable, so called loop unification. Alternatively, our problem may be formul
Externí odkaz:
http://arxiv.org/abs/2201.10298
Learning complex programs through inductive logic programming (ILP) remains a formidable challenge. Existing higher-order enabled ILP systems show improved accuracy and learning performance, though remain hampered by the limitations of the underlying
Externí odkaz:
http://arxiv.org/abs/2112.14603