cluster_search/commit

Removed unused predicates from rdf_cluster.

authorChris Dijkshoorn
Sat Mar 7 14:28:54 2015 +0000
committerChris Dijkshoorn
Sat Mar 7 14:28:54 2015 +0000
commite45a28f1a1e8d850c9f4e98db809db073a00d349
treef4642a9f31967e3f8ba6bb7c8a3fbe3b41fbd60e
parentb5286cdc98a01707390402dec45cbc066d04974d
Diff style: patch stat
diff --git a/lib/cluster_search/rdf_cluster.pl b/lib/cluster_search/rdf_cluster.pl
index 21171ee..978df9f 100644
--- a/lib/cluster_search/rdf_cluster.pl
+++ b/lib/cluster_search/rdf_cluster.pl
@@ -25,7 +25,6 @@
 	  [ search_path/3,      % +Target, +Graph, -Path
 	    search_path/4,      % +Method, +Target, +Graph, -Path
 	    cached_search_path/6, % +Method, +Target, +Graph,
-				%   +CacheIn, -CacheOut, -Path
 	    empty_path_cache/1,	% -Cache
 	    graph_path/5,       % +Target, +Graph, +CacheIn -CacheOut, -Path
 	    schema_path/2,      % +Path, -SchemaPath
@@ -41,7 +40,6 @@
 
 :- use_module(library(semweb/rdf_db)).
 :- use_module(library(semweb/rdfs)).
-:- use_module(library(semweb/rdf_label)).
 :- use_module(library(assoc)).
 :- use_module(library(lists)).
 :- use_module(library(debug)).
@@ -102,67 +100,18 @@ merge_transitive([O1, P, _, P, O3|T0], T) :-
 merge_transitive([O,P|T0], [O,P|T]) :-
 	merge_transitive(T0, T).
 
-/*
-transitive_predicate(P) :-
-	rdfs_subproperty_of(P, iface:broader), !.
-transitive_predicate(P) :-
-	rdfs_subproperty_of(P, iface:narrower), !.
-*/
 transitive_predicate(P) :-
 	rdfs_individual_of(P, owl:'TransitiveProperty'), !.
 
 
-%%	merge_repetition(+PathIn, -PathOut) is det.
-%
-%	Merge repetitive relations in a path.
-
-merge_repetition([], []).
-merge_repetition([One], [One]).
-merge_repetition([O1, P, _, P, O3|T0], [O1,seq(P)|T]) :- !,
-	more_repetition(T0, P, O3, T1, O),
-	merge_repetition([O,T1], T).
-merge_repetition([O,P|T0], [O,P|T]) :-
-	merge_repetition(T0, T).
-
-more_repetition([P,O1|T], P, _, Rest, O) :- !,
-	more_repetition(T, P, O1, Rest, O).
-more_repetition(T, _, O, T, O).
-
 %%	merge_related(+PathIn, -PathOut) is det.
 %
 %	Merge related relations from a path.
 
 merge_related([One], [One]).
-/*
-merge_related([O1, P1, _, P2, O3|T0], T) :-
-	iface_related(P1),
-	iface_related(P2), !,
-	rdf_equal(P, iface:related),
-	merge_related([O1,P,O3|T0], T).
-*/
 merge_related([O,P|T0], [O,P|T]) :-
 	merge_related(T0, T).
 
-/*
-iface_related(P) :-
-	rdfs_subproperty_of(P, iface:broader).
-iface_related(P) :-
-	rdfs_subproperty_of(P, iface:narrower).
-iface_related(P) :-
-	rdfs_subproperty_of(P, iface:related).
-*/
-
-
-%%	remove_label(+PathIn, -PathOut)
-%
-%	Remove matching label part at the end of the Path.
-
-remove_label([S,P,O], [S,P,O]) :- !.
-remove_label(PathIn, PathOut) :-
-	reverse(PathIn, [_,P|Rest]),
-	rdfs_subproperty_of(P, rdfs:label),
-	reverse(Rest, PathOut).
-
 %%	strip_rdf_value(+PathIn, -PathOut)
 %
 %	Remove rdf:value construction from the Path.
@@ -400,32 +349,9 @@ schema_path([V], [Class]) :- !,
 	-> rdf_equal(Class, rdfs:'Literal')
 	;  Class = V  % keep the URI
 	).
-/* schema_path([V, P|T], [Class, AP|Rest]) :-
-	iface_abstract_class(V, Class),
-	iface_abstract_predicate(P, AP),
-	schema_path(T, Rest).
-*/
 
 predicate_schema_path([], []).
 predicate_schema_path([V], [V]).
-/* predicate_schema_path([V, P|T], [V, AP|Rest]) :-
-	iface_abstract_predicate(P, AP),
-	predicate_schema_path(T, Rest).
-*/
-
-
-direct_schema_path([], []).
-direct_schema_path([V], [L]) :- !,
-	(  V = literal(_)
-	-> L='query'
-	;  rdf_label(V,L)
-	).
-/* direct_schema_path([V, P|T], [Class, AP|Rest]) :-
-	iface_abstract_class(V, Class),
-	iface_abstract_predicate(P, AP),
-	direct_schema_path(T, Rest).
-*/
-
 
 %%	partial_schema_path(+InstancePath, -SchemaPath) is det.
 %