Learning efficient logic programs
Sign Up to like & getrecommendations! Published in 2018 at "Machine Learning"
DOI: 10.1007/s10994-018-5712-6
Abstract: When machine learning programs from data, we ideally want to learn efficient rather than inefficient programs. However, existing inductive logic programming (ILP) techniques cannot distinguish between the efficiencies of programs, such as permutation sort (n!)… read more here.
Keywords: machine learning; efficient logic; learning efficient; minimal cost ... See more keywords
Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs
Sign Up to like & getrecommendations! Published in 2018 at "Theory and Practice of Logic Programming"
DOI: 10.1017/s1471068418000108
Abstract: Abstract We define a novel, extensional, three-valued semantics for higher-order logic programs with negation. The new semantics is based on interpreting the types of the source language as three-valued Fitting-monotonic functions at all levels of… read more here.
Keywords: higher order; semantics higher; logic programs; order logic ... See more keywords
Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective
Sign Up to like & getrecommendations! Published in 2022 at "Theory and Practice of Logic Programming"
DOI: 10.1017/s1471068422000242
Abstract: Abstract Logic Programs with Ordered Disjunction (LPODs) extend classical logic programs with the capability of expressing preferential disjunctions in the heads of program rules. The initial semantics of LPODs, although simple and quite intuitive, is… read more here.
Keywords: semantics; strong equivalence; equivalence; programs ordered ... See more keywords