TRAINING EXAMPLES:
EXAMPLE No. 1 OBJECT 1 odd(1) =. true
EXAMPLE No. 2 OBJECT 1 odd(3) =. true
EXAMPLE No. 3 OBJECT 1 odd(5) =. true
EXAMPLE No. 4 OBJECT 1 odd(7) =. true
EXAMPLE No. 5 OBJECT 1 odd(9) =. true
EXAMPLE No. 6 OBJECT 1 odd(11) =. true
EXAMPLE No. 7 OBJECT 1 odd(13) =. true
EXAMPLE No. 8 OBJECT 1 odd(15) =. true
EXAMPLE No. 9 OBJECT 1 odd(17) =. true
EXAMPLE No. 10 OBJECT 1 odd(19) =. true
EXAMPLE No. 11 OBJECT 1 even(0) =. true
EXAMPLE No. 12 OBJECT 1 even(2) =. true
EXAMPLE No. 13 OBJECT 1 even(4) =. true
EXAMPLE No. 14 OBJECT 1 even(6) =. true
EXAMPLE No. 15 OBJECT 1 even(8) =. true
EXAMPLE No. 16 OBJECT 1 even(10) =. true
EXAMPLE No. 17 OBJECT 1 even(12) =. true
EXAMPLE No. 18 OBJECT 1 even(14) =. true
EXAMPLE No. 19 OBJECT 1 even(16) =. true
EXAMPLE No. 20 OBJECT 1 even(18) =. true
EXAMPLE No. 21 OBJECT 1 odd(0) =. false
EXAMPLE No. 22 OBJECT 1 odd(2) =. false
EXAMPLE No. 23 OBJECT 1 odd(4) =. false
EXAMPLE No. 24 OBJECT 1 odd(6) =. false
EXAMPLE No. 25 OBJECT 1 odd(8) =. false
EXAMPLE No. 26 OBJECT 1 odd(10) =. false
EXAMPLE No. 27 OBJECT 1 odd(12) =. false
EXAMPLE No. 28 OBJECT 1 odd(14) =. false
EXAMPLE No. 29 OBJECT 1 odd(16) =. false
EXAMPLE No. 30 OBJECT 1 odd(18) =. false
EXAMPLE No. 31 OBJECT 1 even(1) =. false
EXAMPLE No. 32 OBJECT 1 even(3) =. false
EXAMPLE No. 33 OBJECT 1 even(5) =. false
EXAMPLE No. 34 OBJECT 1 even(7) =. false
EXAMPLE No. 35 OBJECT 1 even(9) =. false
EXAMPLE No. 36 OBJECT 1 even(11) =. false
EXAMPLE No. 37 OBJECT 1 even(13) =. false
EXAMPLE No. 38 OBJECT 1 even(15) =. false
EXAMPLE No. 39 OBJECT 1 even(17) =. false
EXAMPLE No. 40 OBJECT 1 even(19) =. false
SEED: object no. 1 for Concept odd(_3106550) =. true
SEED: object no. 1 for Concept even(_3106562) =. true
================ Parallel Conquer for Concepts
================ [odd(_3106550) =. true,even(_3106562) =. true]
---------------------- Specialization Step No. 1 ----------------------
Clauses for the concept: odd(_3106550) =. true
PS_RULE: 3
Pos. ex. covered: [[1,[1,2,3,4,5,6,7,8,9,10]]]
Neg. ex. covered: [[1,[22,23,24,25,26,27,28,29,30]]]
odd(X1) =. true :-
succ(X2,X1) =. true.
PS_RULE: 4
Pos. ex. covered: [[1,[1,2,3,4,5,6,7,8,9]]]
Neg. ex. covered: [[1,[21,22,23,24,25,26,27,28,29,30]]]
odd(X1) =. true :-
succ(X1,X2) =. true.
Clauses for the concept: even(_3106562) =. true
PS_RULE: 5
Pos. ex. covered: [[1,[11]]]
Neg. ex. covered: [[1,[]]]
even(X1) =. true :-
zero(X1) =. true.
PS_RULE: 6
Pos. ex. covered: [[1,[11,12,13,14,15,16,17,18,19,20]]]
Neg. ex. covered: [[1,[31,32,33,34,35,36,37,38,39]]]
even(X1) =. true :-
succ(X1,X2) =. true.
PS_RULE: 7
Pos. ex. covered: [[1,[12,13,14,15,16,17,18,19,20]]]
Neg. ex. covered: [[1,[31,32,33,34,35,36,37,38,39,40]]]
even(X1) =. true :-
succ(X2,X1) =. true.
RULE CONSISTENT AND RANGE-RESTRICTED: 5
even(X1) =. true :-
zero(X1) =. true.
select_ps_rule
NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,5) cov(9,3) cov(9,6) cov(10,4) cov(10,7)
BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,5) cov(9,3) cov(9,6) cov(10,4) cov(10,7)
POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(10,3) cov(10,6) cov(9,4) cov(9,7) cov(1,5)
BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(10,3) cov(10,6) cov(9,4) cov(9,7) cov(1,5)
In find_best
POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(1,5)
BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(1,5)
find_best/1 took 0.001 sec.
**********************************************
CLAUSE 1 ADDED TO THE LOGIC THEORY
even(X1) =. true :-
zero(X1) =. true.
**********************************************
example(11,1,even(0) =. true,[pos])
The learned theory covers 1/20 examples of concepts to be learned.
SEED: object no. 1 for Concept odd(_3106550) =. true
SEED: object no. 1 for Concept even(_3106562) =. true
================ Parallel Conquer for Concepts
================ [odd(_3106550) =. true,even(_3106562) =. true]
---------------------- Specialization Step No. 1 ----------------------
Clauses for the concept: odd(_3106550) =. true
PS_RULE: 10
Pos. ex. covered: [[1,[1,2,3,4,5,6,7,8,9,10]]]
Neg. ex. covered: [[1,[22,23,24,25,26,27,28,29,30]]]
odd(X1) =. true :-
succ(X2,X1) =. true.
PS_RULE: 11
Pos. ex. covered: [[1,[1,2,3,4,5,6,7,8,9]]]
Neg. ex. covered: [[1,[21,22,23,24,25,26,27,28,29,30]]]
odd(X1) =. true :-
succ(X1,X2) =. true.
Clauses for the concept: even(_3106562) =. true
PS_RULE: 12
Pos. ex. covered: [[1,[12,13,14,15,16,17,18,19,20]]]
Neg. ex. covered: [[1,[31,32,33,34,35,36,37,38,39,40]]]
even(X1) =. true :-
succ(X2,X1) =. true.
PS_RULE: 13
Pos. ex. covered: [[1,[12,13,14,15,16,17,18,19,20]]]
Neg. ex. covered: [[1,[31,32,33,34,35,36,37,38,39]]]
even(X1) =. true :-
succ(X1,X2) =. true.
select_ps_rule
NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(9,10) cov(9,13) cov(10,11) cov(10,12)
BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(9,10) cov(9,13) cov(10,11) cov(10,12)
POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(10,10) cov(9,11) cov(9,12) cov(9,13)
BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(10,10) cov(9,11) cov(9,12) cov(9,13)
---------------------- Specialization Step No. 2 ----------------------
Clauses for the concept: odd(_3106550) =. true
PS_RULE: 14
Pos. ex. covered: [[1,[1]]]
Neg. ex. covered: [[1,[]]]
odd(X1) =. true :-
succ(X2,X1) =. true,
even(X2) =. true.
PS_RULE: 15
Pos. ex. covered: [[1,[1]]]
Neg. ex. covered: [[1,[]]]
odd(X1) =. true :-
succ(X2,X1) =. true,
zero(X2) =. true.
PS_RULE: 16
Pos. ex. covered: [[1,[1,2,3,4,5,6,7,8,9]]]
Neg. ex. covered: [[1,[22,23,24,25,26,27,28,29,30]]]
odd(X1) =. true :-
succ(X2,X1) =. true,
succ(X1,X3) =. true.
PS_RULE: 17
Pos. ex. covered: [[1,[2,3,4,5,6,7,8,9,10]]]
Neg. ex. covered: [[1,[22,23,24,25,26,27,28,29,30]]]
odd(X1) =. true :-
succ(X2,X1) =. true,
succ(X3,X2) =. true.
PS_RULE: 18
Pos. ex. covered: [[1,[1,2,3,4,5,6,7,8,9]]]
Neg. ex. covered: [[1,[21,22,23,24,25,26,27,28,29]]]
odd(X1) =. true :-
succ(X1,X2) =. true,
succ(X2,X3) =. true.
Clauses for the concept: even(_3106562) =. true
PS_RULE: 19
Pos. ex. covered: [[1,[12,13,14,15,16,17,18,19,20]]]
Neg. ex. covered: [[1,[32,33,34,35,36,37,38,39,40]]]
even(X1) =. true :-
succ(X2,X1) =. true,
succ(X3,X2) =. true.
PS_RULE: 20
Pos. ex. covered: [[1,[12,13,14,15,16,17,18,19,20]]]
Neg. ex. covered: [[1,[31,32,33,34,35,36,37,38,39]]]
even(X1) =. true :-
succ(X2,X1) =. true,
succ(X1,X3) =. true.
PS_RULE: 21
Pos. ex. covered: [[1,[12,13,14,15,16,17,18,19]]]
Neg. ex. covered: [[1,[31,32,33,34,35,36,37,38,39]]]
even(X1) =. true :-
succ(X1,X2) =. true,
succ(X2,X3) =. true.
RULE CONSISTENT AND RANGE-RESTRICTED: 14
odd(X1) =. true :-
succ(X2,X1) =. true,
even(X2) =. true.
RULE CONSISTENT AND RANGE-RESTRICTED: 15
odd(X1) =. true :-
succ(X2,X1) =. true,
zero(X2) =. true.
select_ps_rule
NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,14) cov(0,15) cov(9,16) cov(9,17) cov(9,18) cov(9,19) cov(9,20)
cov(9,21)
BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,14) cov(0,15) cov(9,16) cov(9,17) cov(9,18) cov(9,19) cov(9,20)
cov(9,21)
POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(9,16) cov(9,17) cov(9,18) cov(9,19) cov(9,20) cov(8,21) cov(1,14)
cov(1,15)
BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(9,16) cov(9,17) cov(9,18) cov(9,19) cov(9,20)
In find_best
POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(1,14) poscov(1,15)
BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(1,14) poscov(1,15)
find_best/1 took 0.001 sec.
**********************************************
CLAUSE 2 ADDED TO THE LOGIC THEORY
odd(X1) =. true :-
succ(X2,X1) =. true,
even(X2) =. true.
**********************************************
example(1,1,odd(1) =. true,[pos])
The learned theory covers 2/20 examples of concepts to be learned.
SEED: object no. 1 for Concept odd(_3106550) =. true
SEED: object no. 1 for Concept even(_3106562) =. true
================ Parallel Conquer for Concepts
================ [odd(_3106550) =. true,even(_3106562) =. true]
---------------------- Specialization Step No. 1 ----------------------
Clauses for the concept: odd(_3106550) =. true
PS_RULE: 24
Pos. ex. covered: [[1,[2,3,4,5,6,7,8,9,10]]]
Neg. ex. covered: [[1,[22,23,24,25,26,27,28,29,30]]]
odd(X1) =. true :-
succ(X2,X1) =. true.
PS_RULE: 25
Pos. ex. covered: [[1,[2,3,4,5,6,7,8,9]]]
Neg. ex. covered: [[1,[21,22,23,24,25,26,27,28,29,30]]]
odd(X1) =. true :-
succ(X1,X2) =. true.
Clauses for the concept: even(_3106562) =. true
PS_RULE: 26
Pos. ex. covered: [[1,[12,13,14,15,16,17,18,19,20]]]
Neg. ex. covered: [[1,[31,32,33,34,35,36,37,38,39,40]]]
even(X1) =. true :-
succ(X2,X1) =. true.
PS_RULE: 27
Pos. ex. covered: [[1,[12,13,14,15,16,17,18,19,20]]]
Neg. ex. covered: [[1,[31,32,33,34,35,36,37,38,39]]]
even(X1) =. true :-
succ(X1,X2) =. true.
select_ps_rule
NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(9,24) cov(9,27) cov(10,25) cov(10,26)
BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(9,24) cov(9,27) cov(10,25) cov(10,26)
POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(9,24) cov(9,26) cov(9,27) cov(8,25)
BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(9,24) cov(9,26) cov(9,27) cov(8,25)
---------------------- Specialization Step No. 2 ----------------------
Clauses for the concept: odd(_3106550) =. true
PS_RULE: 28
Pos. ex. covered: [[1,[2,3,4,5,6,7,8,9,10]]]
Neg. ex. covered: [[1,[22,23,24,25,26,27,28,29,30]]]
odd(X1) =. true :-
succ(X2,X1) =. true,
succ(X3,X2) =. true.
PS_RULE: 29
Pos. ex. covered: [[1,[2,3,4,5,6,7,8,9]]]
Neg. ex. covered: [[1,[22,23,24,25,26,27,28,29,30]]]
odd(X1) =. true :-
succ(X2,X1) =. true,
succ(X1,X3) =. true.
PS_RULE: 30
Pos. ex. covered: [[1,[2,3,4,5,6,7,8,9]]]
Neg. ex. covered: [[1,[21,22,23,24,25,26,27,28,29]]]
odd(X1) =. true :-
succ(X1,X2) =. true,
succ(X2,X3) =. true.
Clauses for the concept: even(_3106562) =. true
PS_RULE: 31
Pos. ex. covered: [[1,[12]]]
Neg. ex. covered: [[1,[]]]
even(X1) =. true :-
succ(X2,X1) =. true,
odd(X2) =. true.
PS_RULE: 32
Pos. ex. covered: [[1,[12,13,14,15,16,17,18,19,20]]]
Neg. ex. covered: [[1,[32,33,34,35,36,37,38,39,40]]]
even(X1) =. true :-
succ(X2,X1) =. true,
succ(X3,X2) =. true.
PS_RULE: 33
Pos. ex. covered: [[1,[12,13,14,15,16,17,18,19,20]]]
Neg. ex. covered: [[1,[31,32,33,34,35,36,37,38,39]]]
even(X1) =. true :-
succ(X2,X1) =. true,
succ(X1,X3) =. true.
PS_RULE: 34
Pos. ex. covered: [[1,[12,13,14,15,16,17,18,19]]]
Neg. ex. covered: [[1,[31,32,33,34,35,36,37,38,39]]]
even(X1) =. true :-
succ(X1,X2) =. true,
succ(X2,X3) =. true.
RULE CONSISTENT AND RANGE-RESTRICTED: 31
even(X1) =. true :-
succ(X2,X1) =. true,
odd(X2) =. true.
select_ps_rule
NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,31) cov(9,28) cov(9,29) cov(9,30) cov(9,32) cov(9,33) cov(9,34)
BEST NEGATIVES COVERED: cov(No. examples covered, No. clause)
cov(0,31) cov(9,28) cov(9,29) cov(9,30) cov(9,32) cov(9,33) cov(9,34)
POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(9,28) cov(9,32) cov(9,33) cov(8,29) cov(8,30) cov(8,34) cov(1,31)
BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
cov(9,28) cov(9,32) cov(9,33) cov(8,29) cov(8,30) cov(8,34)
In find_best
POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(1,31)
BEST POSITIVES COVERED: cov(No. examples covered, No. clause)
poscov(1,31)
find_best/1 took 0.001 sec.
**********************************************
CLAUSE 3 ADDED TO THE LOGIC THEORY
even(X1) =. true :-
succ(X2,X1) =. true,
odd(X2) =. true.
**********************************************
example(10,1,odd(19) =. true,[pos])
example(20,1,even(18) =. true,[pos])
example(9,1,odd(17) =. true,[pos])
example(19,1,even(16) =. true,[pos])
example(8,1,odd(15) =. true,[pos])
example(18,1,even(14) =. true,[pos])
example(7,1,odd(13) =. true,[pos])
example(17,1,even(12) =. true,[pos])
example(6,1,odd(11) =. true,[pos])
example(16,1,even(10) =. true,[pos])
example(5,1,odd(9) =. true,[pos])
example(15,1,even(8) =. true,[pos])
example(4,1,odd(7) =. true,[pos])
example(14,1,even(6) =. true,[pos])
example(3,1,odd(5) =. true,[pos])
example(13,1,even(4) =. true,[pos])
example(2,1,odd(3) =. true,[pos])
example(12,1,even(2) =. true,[pos])
The learned theory covers 20/20 examples of concepts to be learned.
The Concept odd(_3106550) =. true is learned.
The Concept even(_3106562) =. true is learned.
End of the learning process
The learning process took 1.602 s.
Top