Keith A. Pray - Professional and Academic Site
About Me
·
·
·
LinkedIn Profile Facebook Profile GoodReads Profile
Professional
Academic
Teaching
                                          
Printer Friendly Version
Experiments

Intro ] ackermann-long ] ackermann-short ]
crx-long ] crx-short ] member-long ]
member-short ] ncm-long ] ncm-short ]
qs44-long ] qs44-short ] [ sort-long ]
sort-short ]

data ] [ Up: Report ]

FOIL 6.4   [January 1996]
--------

Relation *elt

Relation *components

Relation sort

Relation *lt

----------
sort:

State (65/4225, 541.4 bits available)

Best literal A=B (2.6 bits)

State (16/65, 173.9 bits available)

	Save clause ending with A=[] (cover 1, accuracy 100%)

	Save not(components(A,C,D)) (1,1 value 6.0)

Best literal A=[] (2.0 bits)

Clause 0: sort(A,B) :- B=[], A=[].

State (64/4224, 534.8 bits available)

Determinate literals
	components(A,C,D)
	components(B,C,D) ->components(B,E,F)

State (64/4096, 534.8 bits available)

Determinate literals
	sort(D,G)

State (64/4096, 534.8 bits available)

Determinate literals
	components(H,C,G)

State (64/4096, 534.8 bits available)

	Save components(B,C,G) (24,64 value 111.5)
	Save components(H,E,F) (24,64 value 111.5)

Best literal B=H (7.6 bits)

State (24/64, 236.6 bits available)

	Save clause ending with D=[] (cover 4, accuracy 100%)

	Save F=[] (4,4 value 24.1)
	Save not(components(D,I,J)) (4,4 value 24.1)
	Save not(components(F,I,J)) (4,4 value 24.1)
	Save A=B (15,32 value 74.7)

Best literal D=[] (5.3 bits)

Clause 1: sort(A,B) :- A=B, components(A,C,D), D=[].

State (60/4220, 508.2 bits available)

Determinate literals
	components(A,C,D)
	components(B,C,D) ->components(B,E,F)

State (60/4092, 508.2 bits available)

Determinate literals
	sort(D,G)

State (60/4092, 508.2 bits available)

Determinate literals
	components(G,H,I)
	components(H,C,G) ->components(J,C,G)

State (60/3840, 508.2 bits available)

Best literal components(F,K,I) (11.3 bits)

State (40/336, 356.5 bits available)

	Save not(lt(K,E)) (40,168 value 162.8)

Best literal lt(E,K) (7.2 bits)

State (40/168, 350.3 bits available)

	Save clause ending with B=J (cover 20, accuracy 100%)

	Save components(B,C,G) (20,20 value 122.3)
	Save components(J,E,F) (20,20 value 122.3)

Best literal B=J (8.3 bits)

Clause 2: sort(A,B) :- components(A,C,D), components(B,C,E), sort(D,E), components(E,F,G), lt(C,F).

State (40/4200, 367.8 bits available)

Determinate literals
	components(A,C,D)
	components(B,C,D) ->components(B,E,F)

State (40/4072, 367.8 bits available)

Determinate literals
	sort(D,G)

State (40/4072, 367.8 bits available)

Determinate literals
	components(G,E,H)
	components(H,C,G) ->components(I,C,G)

State (40/960, 367.8 bits available)

Best literal components(F,C,H) (10.9 bits)

State (20/60, 200.1 bits available)

	Save lt(E,C) (20,40 value 114.3)
	Save not(lt(C,E)) (20,40 value 114.3)

Best literal sort(F,F) (8.8 bits)

State (20/40, 192.3 bits available)

	Save clause ending with not(lt(C,E)) (cover 20, accuracy 100%)

Best literal not(lt(C,E)) (4.6 bits)

Clause 3: sort(A,B) :- components(A,C,D), components(B,E,F), sort(D,G), components(G,E,H), components(F,C,H), sort(F,F), not(lt(C,E)).

State (20/4180, 211.0 bits available)

Determinate literals
	components(A,C,D)
	components(B,C,D) ->components(B,E,F)

State (20/4052, 211.0 bits available)

Determinate literals
	sort(D,G)

State (20/4052, 211.0 bits available)

Determinate literals
	components(G,E,H)
	components(H,C,G) ->components(I,C,G)

State (20/940, 211.0 bits available)

	Save not(lt(C,E)) (20,620 value 55.0)
	Save not(components(J,C,B)) (20,640 value 54.1)
	Save not(components(J,C,F)) (20,640 value 54.1)
	Save not(components(F,C,J)) (20,660 value 53.2)

Best literal lt(E,C) (4.6 bits)

State (20/620, 206.4 bits available)

	Save not(components(J,C,F)) (20,420 value 66.2)
	Save not(components(F,C,J)) (20,440 value 64.9)

Best literal not(components(J,C,B)) (10.9 bits)

State (20/420, 196.5 bits available)

Best literal not(components(F,C,J)) (10.9 bits)

State (20/240, 187.1 bits available)

	Save H<>[] (20,204 value 87.0)
	Save A<>I (14,138 value 62.0)
	Save D<>G (14,138 value 62.0)
	Save not(sort(D,D)) (14,138 value 62.0)

Best literal components(H,J,K) (10.9 bits)

State (20/204, 178.2 bits available)

	Save not(lt(C,J)) (20,120 value 102.2)

Best literal lt(J,C) (6.2 bits)

State (20/120, 174.4 bits available)

	Save D=G (6,36 value 31.4)
	Save sort(D,D) (6,36 value 31.4)
	Save sort(G,D) (6,36 value 31.4)
	Save components(A,C,G) (6,36 value 31.4)

Best literal A=I (8.5 bits)

State (6/36, 39.8 bits available)

Best literal K=[] (6.2 bits)

State (4/24, 15.3 bits available)

Best literal components(L,C,H) (10.7 bits)

State (4/24, 7.6 bits available)

	Save clause ending with sort(L,F) (cover 4, accuracy 100%)

Best literal sort(L,F) (8.7 bits)

Clause 4: sort(A,B) :- components(A,C,D), components(B,E,F), sort(D,G), components(G,E,H), lt(E,C), components(I,C,H), sort(I,F).

Delete clause
	sort(A,B) :- components(A,C,D), components(B,E,F), sort(D,G), components(G,E,H), components(F,C,H), sort(F,F), not(lt(C,E)).

sort([],[]).
sort(A,A) :- components(A,C,[]).
sort(A,B) :- components(A,C,D), components(B,C,E), sort(D,E), components(E,F,G), lt(C,F).
sort(A,B) :- components(A,C,D), components(B,E,F), sort(D,G), components(G,E,H), lt(E,C), components(I,C,H), sort(I,F).

Time 12.2 secs

by: Keith A. Pray
Last Modified: July 4, 2004 9:03 AM
© 2004 - 1975 Keith A. Pray.
All rights reserved.

Current Theme: 

Kapowee Hosted | Kapow Generated in 0.009 second | XHTML | CSS