object
metagol¶
Inductive logic programming (ILP) system based on meta-interpretive learning.
Author: Metagol authors; adapted to Logtalk by Paulo Moura.
Version: 0.24
Date: 2019/5/8
Copyright: Copyright 2016 Metagol authors; Copyright 2018-2019 Paulo Moura
License: BSD 3-Clause License
Compilation flags:
static, context_switching_callsPublic interface¶
learn/3¶
Learns from a set of positive examples and a set of negative examples and returns the learned program.
Compilation flags:
staticTemplate:
learn(PositiveExamples,NegativeExamples,Program)Mode and number of proofs:
learn(@list(example),@list(example),-list(term)) - zero_or_morelearn/2¶
Learns from a set of positive examples and a set of negative examples and pretty prints the learned program.
Compilation flags:
staticTemplate:
learn(PositiveExamples,NegativeExamples)Mode and number of proofs:
learn(@list(example),@list(example)) - zero_or_morelearn_seq/2¶
Learns from a sequence of examples represented as a list of PositiveExamples/NegativeExamples elements and returns the learned program.
Compilation flags:
staticTemplate:
learn_seq(Examples,Program)Mode and number of proofs:
learn_seq(@list(example),-list(clause)) - zero_or_onelearn_with_timeout/4¶
Learns from a set of positive examples and a set of negative examples and returns the learned program.
Compilation flags:
staticTemplate:
learn_with_timeout(PositiveExamples,NegativeExamples,Program,Timeout)Mode and number of proofs:
learn_with_timeout(@list(example),@list(example),-list(term),+number) - zero_or_oneprogram_to_clauses/2¶
Converts a learned program into a list of clauses.
Compilation flags:
staticTemplate:
program_to_clauses(Program,Clauses)Mode and number of proofs:
program_to_clauses(@list(term),-list(clause)) - onepprint/1¶
Pretty prints a learned program.
Compilation flags:
staticTemplate:
pprint(Program)Mode and number of proofs:
pprint(@list(term)) - onetimeout/1¶
Compilation flags:
dynamicPrivate predicates¶
(see related entities)
Operators¶
(none)
Remarks¶
(none)