object
metagol
¶
Inductive logic programming (ILP) system based on meta-interpretive learning.
Author: Metagol authors; adapted to Logtalk by Paulo Moura.
Version: 0:24:0
Date: 2019-05-08
Copyright: Copyright 2016 Metagol authors; Copyright 2018-2019 Paulo Moura
License: BSD 3-Clause License
Compilation flags:
static, context_switching_calls
Remarks:
(none)
Inherited public predicates:
Public predicates¶
learn/3
¶
Learns from a set of positive examples and a set of negative examples and returns the learned program.
Compilation flags:
static
Template:
learn(PositiveExamples,NegativeExamples,Program)
Mode and number of proofs:
learn(@list(example),@list(example),-list(term))
- zero_or_more
learn/2
¶
Learns from a set of positive examples and a set of negative examples and pretty prints the learned program.
Compilation flags:
static
Template:
learn(PositiveExamples,NegativeExamples)
Mode and number of proofs:
learn(@list(example),@list(example))
- zero_or_more
learn_seq/2
¶
Learns from a sequence of examples represented as a list of PositiveExamples/NegativeExamples elements and returns the learned program.
Compilation flags:
static
Template:
learn_seq(Examples,Program)
Mode and number of proofs:
learn_seq(@list(example),-list(clause))
- zero_or_one
learn_with_timeout/4
¶
Learns from a set of positive examples and a set of negative examples and returns the learned program.
Compilation flags:
static
Template:
learn_with_timeout(PositiveExamples,NegativeExamples,Program,Timeout)
Mode and number of proofs:
learn_with_timeout(@list(example),@list(example),-list(term),+number)
- zero_or_one
program_to_clauses/2
¶
Converts a learned program into a list of clauses.
Compilation flags:
static
Template:
program_to_clauses(Program,Clauses)
Mode and number of proofs:
program_to_clauses(@list(term),-list(clause))
- one
Private predicates¶
(no local declarations; see entity ancestors if any)