<s>
Progol	B-Application
is	O
an	O
implementation	O
of	O
inductive	B-Application
logic	I-Application
programming	I-Application
that	O
combines	O
inverse	O
entailment	O
with	O
general-to-specific	O
search	O
through	O
a	O
refinement	O
graph	O
.	O
</s>
<s>
Unlike	O
the	O
searches	O
of	O
Ehud	O
Shapiro	O
's	O
model	O
inference	O
system	O
(	O
MIS	O
)	O
and	O
J	O
.	O
Ross	O
Quinlan	O
's	O
FOIL	B-Application
,	O
Progol	B-Application
's	O
search	O
is	O
efficient	O
and	O
has	O
a	O
provable	O
guarantee	O
of	O
returning	O
a	O
solution	O
having	O
the	O
maximum	O
compression	O
in	O
the	O
search-space	O
.	O
</s>
<s>
To	O
do	O
so	O
it	O
performs	O
an	O
admissible	O
A*	B-Protocol
-like	O
search	O
,	O
guided	O
by	O
compression	O
,	O
over	O
clauses	O
which	O
subsume	O
the	O
most	O
specific	O
clause	O
.	O
</s>
<s>
Progol	B-Application
deals	O
with	O
noisy	O
data	O
by	O
using	O
a	O
compression	O
measure	O
to	O
trade	O
off	O
the	O
description	O
of	O
errors	O
against	O
the	O
hypothesis	O
description	O
length	O
.	O
</s>
<s>
Progol	B-Application
allows	O
arbitrary	O
Prolog	B-Language
programs	O
as	O
background	O
knowledge	O
and	O
arbitrary	O
definite	O
clauses	O
as	O
examples	O
.	O
</s>
<s>
Despite	O
this	O
,	O
benchmarking	O
shows	O
that	O
the	O
efficiency	O
of	O
Progol	B-Application
compares	O
favourably	O
with	O
FOIL	B-Application
.	O
</s>
