| 1 | | % (c) 2009-2026 Lehrstuhl fuer Softwaretechnik und Programmiersprachen, |
| 2 | | % Heinrich Heine Universitaet Duesseldorf |
| 3 | | % This software is licenced under EPL 1.0 (http://www.eclipse.org/org/documents/epl-v10.html) |
| 4 | | |
| 5 | | |
| 6 | | :- module(custom_explicit_sets,[is_set_value/2, |
| 7 | | is_custom_explicit_set/1, is_custom_explicit_set/2, is_custom_explicit_set_nonvar/1, |
| 8 | | %equal_explicit_sets/2, |
| 9 | | equal_explicit_sets_wf/3, |
| 10 | | not_equal_explicit_sets_wf/3, |
| 11 | | equality_explicit_sets_wf/4, same_texpr_body/2, same_closure/2, |
| 12 | | is_empty_explicit_set/1, is_empty_explicit_set_wf/2, is_empty_closure_wf/4, |
| 13 | | is_non_empty_explicit_set/1, is_non_empty_explicit_set_wf/2, |
| 14 | | is_non_empty_closure_wf/4, |
| 15 | | test_empty_explicit_set_wf/3, test_empty_closure_wf/5, |
| 16 | | is_definitely_maximal_set/1, |
| 17 | | explicit_set_cardinality/2, explicit_set_cardinality_wf/3, |
| 18 | | explicit_set_cardinality_for_wf/2, |
| 19 | | card_for_specific_custom_set/3, % only succeeds if we can compute it efficiently |
| 20 | | card_for_specific_closure/4, |
| 21 | | efficient_card_for_set/3, % same, but also for lists |
| 22 | | quick_custom_explicit_set_approximate_size/2, |
| 23 | | avl_approximate_size/2, avl_approximate_size/3, |
| 24 | | is_infinite_explicit_set/1, is_infinite_closure/3, |
| 25 | | is_infinite_global_set/2, is_simple_infinite_set/1, |
| 26 | | dont_expand_this_explicit_set/1, dont_expand_this_explicit_set/2, |
| 27 | | dont_expand_symbolic_explicit_set/1, |
| 28 | | definitely_expand_this_explicit_set/1, |
| 29 | | is_infinite_or_very_large_explicit_set/1, |
| 30 | | is_infinite_or_very_large_explicit_set/2, |
| 31 | | is_cartesian_product_closure/3, |
| 32 | | expand_custom_set/2, expand_custom_set_wf/4, |
| 33 | | try_expand_custom_set/2, try_expand_custom_set_with_catch/3, |
| 34 | | try_expand_custom_set_wf/4, |
| 35 | | expand_custom_set_to_list/2, expand_custom_set_to_list/4, |
| 36 | | expand_custom_set_to_list_wf/5, |
| 37 | | try_expand_custom_set_to_list_wf/5, |
| 38 | | expand_custom_set_to_list_no_dups_wf/5, |
| 39 | | expand_custom_set_to_list_gg/4, |
| 40 | | try_expand_custom_set_to_list/4, |
| 41 | | expand_interval_closure_to_avl/3, |
| 42 | | expand_custom_set_to_list_now/2, |
| 43 | | expand_closure_to_avl_or_list/6, |
| 44 | | expand_closure_to_list/7, |
| 45 | | expand_only_custom_closure_global/4, %try_expand_only_custom_closure_global/2, |
| 46 | | expand_and_convert_to_avl_set/4, |
| 47 | | ord_list_to_avlset_direct/3, sorted_ground_normalised_list_to_avlset/3, |
| 48 | | try_expand_and_convert_to_avl/2, convert_to_avl/2, |
| 49 | | should_be_converted_to_avl_from_lists/1, should_be_converted_to_avl/1, |
| 50 | | try_expand_and_convert_to_avl_with_check/3, |
| 51 | | try_expand_and_convert_to_avl_with_check/4, |
| 52 | | try_expand_and_convert_to_avl_unless_large_wf/3, |
| 53 | | %try_expand_and_convert_to_avl_unless_large_wf/3, |
| 54 | | try_expand_and_convert_to_avl_if_smaller_than/3, |
| 55 | | is_small_specific_custom_set/2, |
| 56 | | quick_propagation_element_information/4, |
| 57 | | element_of_custom_set/2, element_of_custom_set_wf/3, |
| 58 | | element_of_closure/5, |
| 59 | | check_element_of_function_closure/6, |
| 60 | | not_element_of_custom_set_wf/3, |
| 61 | | membership_custom_set/3, membership_custom_set_wf/4, membership_avl_set_wf/4, |
| 62 | | quick_test_avl_membership/3, |
| 63 | | lazy_check_elements_of_closure/6, |
| 64 | | |
| 65 | | is_efficient_custom_set/1, |
| 66 | | remove_minimum_element_custom_set/3, |
| 67 | | |
| 68 | | is_maximal_global_set/1, quick_is_definitely_maximal_set/1, |
| 69 | | quick_definitely_maximal_set_avl/1, |
| 70 | | is_one_element_custom_set/2, singleton_set/2, construct_singleton_avl_set/2, |
| 71 | | is_one_element_avl/2, |
| 72 | | construct_one_element_custom_set/2, |
| 73 | | avl_is_interval/3, |
| 74 | | |
| 75 | | %closure0_for_explicit_set/2, |
| 76 | | closure1_for_explicit_set/2, closure1_for_explicit_set_from/3, |
| 77 | | check_in_domain_of_avlset_wf/3, check_unique_in_domain_of_avlset/2, |
| 78 | | domain_of_explicit_set_wf/3, range_of_explicit_set_wf/3, |
| 79 | | is_avl_partial_function/1, is_not_avl_partial_function/2, |
| 80 | | is_avl_total_function_over_domain/2, |
| 81 | | quick_definitely_maximal_total_function_avl/1, |
| 82 | | is_avl_relation/1, |
| 83 | | is_avl_relation_over_domain/3, |
| 84 | | is_avl_relation_over_range/3, |
| 85 | | is_not_avl_relation_over_domain_range/4, is_not_avl_relation_over_range/3, |
| 86 | | is_avl_sequence/1, safe_is_avl_sequence/1, |
| 87 | | get_avl_sequence/2, |
| 88 | | is_injective_avl_relation/2, |
| 89 | | invert_explicit_set/2, union_of_explicit_set/3, |
| 90 | | union_generalized_explicit_set/3, |
| 91 | | difference_of_explicit_set_wf/4, |
| 92 | | intersection_of_explicit_set_wf/4, intersection_with_interval_closure/3, |
| 93 | | disjoint_intervals_with_inf/4, |
| 94 | | image_for_id_closure/3, image_for_explicit_set/4, |
| 95 | | rel_composition_for_explicit_set/3, |
| 96 | | element_can_be_added_or_removed_to_avl/1, |
| 97 | | add_element_to_explicit_set_wf/4, remove_element_from_explicit_set/3, |
| 98 | | delete_element_from_explicit_set/3, |
| 99 | | at_most_one_match_possible/3, |
| 100 | | apply_to_avl_set/5, try_apply_to_avl_set_wf/4, |
| 101 | | min_of_explicit_set_wf/3, max_of_explicit_set_wf/3, |
| 102 | | sum_or_mul_of_explicit_set/3, |
| 103 | | %sum_of_range_custom_explicit_set/2, mul_of_range_custom_explicit_set/2, |
| 104 | | domain_restriction_explicit_set_wf/4, |
| 105 | | range_restriction_explicit_set_wf/4, |
| 106 | | domain_subtraction_explicit_set_wf/4, |
| 107 | | range_subtraction_explicit_set_wf/4, |
| 108 | | override_pair_explicit_set/4, |
| 109 | | direct_product_explicit_set/3, |
| 110 | | override_custom_explicit_set_wf/4, |
| 111 | | symbolic_functionality_check_closure/2, symbolic_injectivity_check_closure/2, |
| 112 | | |
| 113 | | subset_of_explicit_set/4, not_subset_of_explicit_set/4, |
| 114 | | test_subset_of_explicit_set/5, |
| 115 | | |
| 116 | | conc_custom_explicit_set/2, |
| 117 | | prefix_of_custom_explicit_set/4, suffix_of_custom_explicit_set/4, |
| 118 | | concat_custom_explicit_set/4, prepend_custom_explicit_set/3, |
| 119 | | append_custom_explicit_set/4, |
| 120 | | tail_sequence_custom_explicit_set/5, |
| 121 | | last_sequence_explicit_set/2, %first_sequence_explicit_set/2, |
| 122 | | front_sequence_custom_explicit_set/3, |
| 123 | | reverse_custom_explicit_set/2, |
| 124 | | size_of_custom_explicit_set/3, |
| 125 | | |
| 126 | | get_first_avl_elements/4, |
| 127 | | construct_avl_from_lists/2, construct_avl_from_lists_wf/3, |
| 128 | | equal_avl_tree/2, |
| 129 | | check_avl_in_interval/3, check_interval_in_custom_set/4, |
| 130 | | check_avl_subset/2, |
| 131 | | construct_closure/4, is_closure/4, % from closures |
| 132 | | construct_member_closure/5, % from closures |
| 133 | | |
| 134 | | construct_interval_closure/3, |
| 135 | | is_interval_closure/3, % checks if we have a finite interval closure Low..Up (but bounds can be variables) |
| 136 | | is_interval_closure/5, |
| 137 | | is_interval_closure_or_integerset/3, is_interval_closure_or_integerset/4, |
| 138 | | is_interval_with_integer_bounds/3, % checks that bounds are known |
| 139 | | |
| 140 | | is_powerset_closure/3, |
| 141 | | |
| 142 | | dom_range_for_specific_closure/5, |
| 143 | | dom_for_specific_closure/4, |
| 144 | | dom_for_lambda_closure/2, |
| 145 | | portray_custom_explicit_set/1, |
| 146 | | closure_occurs_check/4 |
| 147 | | ]). |
| 148 | | |
| 149 | | :- meta_predicate call_card_for_relations(-,-,0). |
| 150 | | |
| 151 | | :- use_module(error_manager). |
| 152 | | :- use_module(self_check). |
| 153 | | :- use_module(preferences,[get_preference/2]). |
| 154 | | :- use_module(library(avl)). |
| 155 | | :- use_module(kernel_waitflags). |
| 156 | | :- use_module(kernel_tools). |
| 157 | | :- use_module(delay). |
| 158 | | :- use_module(tools). |
| 159 | | :- use_module(avl_tools). |
| 160 | | :- use_module(library(clpfd)). |
| 161 | | |
| 162 | | :- use_module(module_information,[module_info/2]). |
| 163 | | :- module_info(group,kernel). |
| 164 | | :- module_info(description,'This module provides customised operations for the custom explicit set representations of ProB (closures, avl_sets and global_sets).'). |
| 165 | | |
| 166 | | :- use_module(tools_printing,[print_term_summary/1, print_error/1]). |
| 167 | | :- use_module(preferences,[preference/2]). |
| 168 | | :- use_module(kernel_objects,[equal_object/2, equal_object/3]). |
| 169 | | :- use_module(kernel_freetypes,[enumerate_freetype_wf/4,freetype_cardinality/2, |
| 170 | | is_infinite_freetype/1, is_empty_freetype/1, |
| 171 | | is_non_empty_freetype/1, test_empty_freetype/2]). |
| 172 | | |
| 173 | | :- use_module(clpfd_interface,[try_post_constraint/1, clpfd_reify_inlist/4]). |
| 174 | | :- use_module(closures). |
| 175 | | :- use_module(performance_messages). |
| 176 | | :- use_module(b_compiler). |
| 177 | | :- use_module(btypechecker,[couplise_list/2, unify_types_strict/2, merge_types/3]). |
| 178 | | |
| 179 | | :- load_files(library(system), [when(compile_time), imports([environ/2])]). |
| 180 | | |
| 181 | | /* These meta_predicate declarations do not seem to have the right effect; |
| 182 | | the predicates below return code, they do not get passed code |
| 183 | | :- meta_predicate card_for_specific_custom_set(*,*,0). |
| 184 | | :- meta_predicate card_for_specific_closure(*,*,0). |
| 185 | | :- meta_predicate is_a_relation(*,*,*,*,*,*,0). |
| 186 | | :- meta_predicate subset_of_explicit_set(*,*,0,*). |
| 187 | | :- meta_predicate not_subset_of_explicit_set(*,*,0,*). |
| 188 | | */ |
| 189 | | |
| 190 | | construct_avl_from_lists(S,Res) :- |
| 191 | | (convert_to_avl(S,CS) -> true ; print(convert_to_avl_failed(S,CS)),nl,CS=S), |
| 192 | | Res = CS. |
| 193 | | |
| 194 | | % version with WF to see call stack in case of virtual time-outs due to expansions |
| 195 | | construct_avl_from_lists_wf(S,Res,WF) :- |
| 196 | | (convert_to_avl_wf(S,CS,WF) -> true ; print(convert_to_avl_wf_failed(S,CS)),nl,CS=S), |
| 197 | | Res = CS. |
| 198 | | |
| 199 | | :- use_module(tools,[safe_sort/3]). |
| 200 | | :- block normalised_list_to_avl_when_ground(-,?). |
| 201 | | normalised_list_to_avl_when_ground(S,R) :- % call if you are not sure that S will be ground; e.g. after closure expansion |
| 202 | | ground_value_check(S,GS), |
| 203 | | blocking_normalised_list_to_avl(GS,S,R). |
| 204 | | :- block blocking_normalised_list_to_avl(-,?,?). |
| 205 | | blocking_normalised_list_to_avl(_,S,R) :- normalised_list_to_avl(S,R). |
| 206 | | |
| 207 | | normalised_list_to_avl(S,R) :- safe_sort(normalised_list_to_avl,S,SS), |
| 208 | | ord_list_to_avlset_direct(SS,AVL,normalised_list_to_avl), |
| 209 | | equal_object(AVL,R). % due to co-routine, R can now be instantiated |
| 210 | | |
| 211 | | %set_to_avl(List,R) :- empty_avl(A), add_to_avl(List,A,AR), R=avl_set(AR). |
| 212 | | add_to_avl([],R,R). |
| 213 | | add_to_avl([H|T],AVL,AVLOUT) :- avl_store(H,AVL,true,AVL1), |
| 214 | | add_to_avl(T,AVL1,AVLOUT). |
| 215 | | |
| 216 | | |
| 217 | | % get only the first x elements of an AVL tree |
| 218 | | get_first_avl_elements(empty,_,R,all) :- !,R=[]. |
| 219 | | get_first_avl_elements(AVL,X,FirstXEls,CutOff) :- |
| 220 | | avl_min(AVL,Min), get_first_els(X,Min,AVL,FirstXEls,CutOff). |
| 221 | | |
| 222 | | get_first_els(X,_,_AVL,R,CutOff) :- X<1,!,R=[], CutOff=not_all. |
| 223 | | get_first_els(X,Cur,AVL,[Cur|T],CutOff) :- |
| 224 | | (avl_next(Cur,AVL,Nxt) -> X1 is X-1,get_first_els(X1,Nxt,AVL,T,CutOff) |
| 225 | | ; T=[],CutOff=all). |
| 226 | | |
| 227 | | %expand_and_try_convert_to_avl(C,R) :- is_closure(C,_,_,_), expand_custom_set(C,EC), expand_and_convert_to_avl |
| 228 | | %expand_and_convert_to_avl(C,R) :- convert_to_avl(C,R). |
| 229 | | |
| 230 | | /* convert all list data-values (with all-sub-values) into avl-form */ |
| 231 | | /* assumption: the value is ground when convert_to_avl is called */ |
| 232 | | |
| 233 | | :- load_files(library(system), [when(compile_time), imports([environ/2])]). |
| 234 | | :- if(environ(prob_safe_mode,true)). |
| 235 | | convert_to_avl(X,R) :- \+ ground_value(X), !, add_error(convert_to_avl,'Non-ground argument: ',convert_to_avl(X,R)), R=X. |
| 236 | | :- endif. |
| 237 | | convert_to_avl(X,R) :- var(X), !, add_error(convert_to_avl,'Variable argument: ',convert_to_avl(X,R)), R=X. |
| 238 | ? | convert_to_avl(Term,R) :- no_conversion_necessary(Term),!, |
| 239 | | R=Term. |
| 240 | | convert_to_avl(closure(P,T,B),R) :- !, |
| 241 | | R=closure(P,T,B). |
| 242 | | convert_to_avl(avl_set(A),R) :- !,(A==empty -> add_warning(convert_to_avl,'Emtpy avl_set'), R=[] |
| 243 | | ; R=avl_set(A)). |
| 244 | | convert_to_avl((A,B),(CA,CB)) :- !,convert_to_avl(A,CA), convert_to_avl(B,CB). |
| 245 | | convert_to_avl(freetype(X),R) :- !, R=freetype(X). |
| 246 | | convert_to_avl(freeval(ID,Case,Value),R) :- !, R=freeval(ID,Case,CValue),convert_to_avl(Value,CValue). |
| 247 | | convert_to_avl(rec(Fields),R) :- !, convert_fields(Fields,CFields), R=rec(CFields). |
| 248 | | convert_to_avl(global_set(GS),R) :- !, R=global_set(GS). |
| 249 | | convert_to_avl([H|T],R) :- !, convert_cons_to_avl_inside_set_wf(H,T,R,no_wf_available). |
| 250 | | %convert_to_avl(abort(X),_R) :- print(deprecetated_convert_to_avl(abort(X))),nl,!, fail. |
| 251 | | convert_to_avl(X,R) :- add_internal_error('Unknown term: ',convert_to_avl(X,R)), R=X. |
| 252 | | |
| 253 | | % pass WF for call stack in case of expansions TODO: complete |
| 254 | | convert_to_avl_wf((A,B),(CA,CB),WF) :- !,convert_to_avl_wf(A,CA,WF), convert_to_avl_wf(B,CB,WF). |
| 255 | | convert_to_avl_wf([H|T],R,WF) :- !, convert_cons_to_avl_inside_set_wf(H,T,R,WF). |
| 256 | | convert_to_avl_wf(X,R,_) :- convert_to_avl(X,R). |
| 257 | | |
| 258 | | convert_fields(Var,R) :- var(Var),!, |
| 259 | | add_internal_error('Var arg: ',convert_fields(Var,R)),fail. |
| 260 | | convert_fields([],[]). |
| 261 | | convert_fields([field(FieldName,Value)|T],[field(FieldName,CValue)|CT]) :- |
| 262 | | convert_to_avl_inside_set(Value,CValue), |
| 263 | | convert_fields(T,CT). |
| 264 | | |
| 265 | | l_convert_to_avl_wf(Var,_,WF) :- var(Var),!, |
| 266 | | add_warning_wf(l_convert_to_avl_wf,'Cannot expand variable to avl: ',Var,unknown,WF), |
| 267 | | fail. |
| 268 | | l_convert_to_avl_wf([],[],_). |
| 269 | | l_convert_to_avl_wf(avl_set(A),R,WF) :- |
| 270 | | expand_custom_set_wf(avl_set(A),ES,l_convert_to_avl,WF), |
| 271 | | l_convert_to_avl_wf(ES,R,WF). |
| 272 | | l_convert_to_avl_wf(closure(P,T,B),R,WF) :- |
| 273 | | expand_custom_set_wf(closure(P,T,B),ES,l_convert_to_avl,WF), |
| 274 | | l_convert_to_avl_wf(ES,R,WF). |
| 275 | | l_convert_to_avl_wf([H|T],[CH-true|CT],WF) :- |
| 276 | | convert_to_avl_inside_set_wf(H,CH,WF), l_convert_to_avl_wf(T,CT,WF). |
| 277 | | |
| 278 | | :- assert_must_succeed((X=(fd(1,'Name'),fd(2,'Name')), |
| 279 | | custom_explicit_sets:convert_to_avl_inside_set(X,R), R==X)). |
| 280 | | |
| 281 | | convert_to_avl_inside_set(Var,R) :- var(Var),!, |
| 282 | | add_internal_error('Var arg: ',convert_to_avl_inside_set(Var,R)),fail. |
| 283 | | :- if(environ(prob_safe_mode,true)). |
| 284 | | convert_to_avl_inside_set(fd(A,T),R) :- var(A),!, |
| 285 | | add_error(convert_to_avl,'Non-ground FD-Term: ',convert_to_avl_inside_set(fd(A,T),R)), R=fd(A,T). |
| 286 | | convert_to_avl_inside_set(int(X),R) :- var(X),!, |
| 287 | | add_error(convert_to_avl,'Non-ground integer: ',convert_to_avl_inside_set(int(X),R)), R=int(X). |
| 288 | | convert_to_avl_inside_set(string(X),R) :- var(X),!, |
| 289 | | add_error(convert_to_avl,'Non-ground string: ',convert_to_avl_inside_set(string(X),R)), R=string(X). |
| 290 | | convert_to_avl_inside_set(term(X),R) :- (var(X) ; X=floating(F), var(F)), !, |
| 291 | | add_error(convert_to_avl,'Non-ground term: ',convert_to_avl_inside_set(term(X),R)), R=term(X). |
| 292 | | :- endif. |
| 293 | ? | convert_to_avl_inside_set(Term,R) :- no_conversion_necessary(Term),!,R=Term. |
| 294 | | convert_to_avl_inside_set(closure(P,T,B),R) :- !, |
| 295 | | % inside a set, closures need to be expanded to check against other elements |
| 296 | | expand_closure_to_avl_wf(P,T,B,R,no_wf_available). |
| 297 | | %convert_to_avl_inside_set(closure_x(_P,_T,_B,E),R) :- !, convert_to_avl_inside_set(E,R). |
| 298 | | convert_to_avl_inside_set(avl_set(A),R) :- !, normalise_avl_set(A,R). %AVL's inside other AVL's need to be normalised ! |
| 299 | | convert_to_avl_inside_set((A,B),(CA,CB)) :- !,convert_to_avl_inside_set(A,CA), convert_to_avl_inside_set(B,CB). |
| 300 | | convert_to_avl_inside_set(freetype(X),R) :- !, |
| 301 | | expand_custom_set(freetype(X),EC,check), convert_to_avl_inside_set(EC,R). |
| 302 | | convert_to_avl_inside_set(freeval(ID,Case,Value),R) :- !, |
| 303 | | R=freeval(ID,Case,CValue),convert_to_avl_inside_set(Value,CValue). |
| 304 | | convert_to_avl_inside_set(rec(Fields),R) :- !, convert_fields(Fields,CFields), R=rec(CFields). |
| 305 | | convert_to_avl_inside_set(global_set(GS),R) :- !, |
| 306 | | % first check if GS infinite integer set: in this case do not expand; there can be no confusion with finite avl_sets |
| 307 | | (is_infinite_global_set(GS,_) -> R = global_set(GS) |
| 308 | | ; expand_only_custom_closure_global(global_set(GS),EC,check,no_wf_available), convert_to_avl_inside_set(EC,R)). |
| 309 | | convert_to_avl_inside_set([H|T],R) :- !,convert_cons_to_avl_inside_set_wf(H,T,R,no_wf_available). |
| 310 | | convert_to_avl_inside_set(X,R) :- |
| 311 | | add_internal_error('Unknown or non-ground argument: ',convert_to_avl_inside_set(X,R)), |
| 312 | | fail. |
| 313 | | |
| 314 | ? | convert_to_avl_inside_set_wf(Term,R,_WF) :- no_conversion_necessary(Term),!,R=Term. |
| 315 | | convert_to_avl_inside_set_wf(closure(P,T,B),R,WF) :- !, |
| 316 | | expand_closure_to_avl_wf(P,T,B,R,WF). % inside a set, closures need to be expanded to check against other elements |
| 317 | | convert_to_avl_inside_set_wf((A,B),(CA,CB),WF) :- !, |
| 318 | | convert_to_avl_inside_set_wf(A,CA,WF), convert_to_avl_inside_set_wf(B,CB,WF). |
| 319 | | convert_to_avl_inside_set_wf([H|T],R,WF) :- !,convert_cons_to_avl_inside_set_wf(H,T,R,WF). |
| 320 | | convert_to_avl_inside_set_wf(V,CV,_WF) :- % use version without WF; TO DO: adapt fully |
| 321 | | convert_to_avl_inside_set(V,CV). |
| 322 | | |
| 323 | | % true when we have a simple value that does not need to be converted for use within an avl_set: |
| 324 | | no_conversion_necessary([]). |
| 325 | | no_conversion_necessary(pred_false). /* bool_false */ |
| 326 | | no_conversion_necessary(pred_true). /* bool_true */ |
| 327 | | no_conversion_necessary(fd(FD,_)) :- nonvar(FD). |
| 328 | | no_conversion_necessary(int(I)) :- nonvar(I). |
| 329 | | no_conversion_necessary(string(S)) :- nonvar(S). |
| 330 | ? | no_conversion_necessary(term(T)) :- nonvar(T), no_conversion_nec_term(T). |
| 331 | | |
| 332 | | no_conversion_nec_term(floating(T)) :- nonvar(T). |
| 333 | | no_conversion_nec_term(T) :- atom(T). |
| 334 | | |
| 335 | | normalise_avl_set(A,R) :- A=node(_,_,0,empty,empty), !,R=avl_set(A). |
| 336 | | normalise_avl_set(A,R) :- |
| 337 | | avl_to_list(A,L), |
| 338 | | ord_list_to_avlset_direct(L,R,convert_to_avl_inside_set). %AVL's inside other AVL's need to be normalised ! |
| 339 | | |
| 340 | | convert_cons_to_avl_inside_set_wf(H,T,R,WF) :- T==[], !, |
| 341 | | convert_to_avl_inside_set_wf(H,CH,WF), |
| 342 | | R = avl_set(node(CH,true,0,empty,empty)). |
| 343 | | convert_cons_to_avl_inside_set_wf(H,T,R,WF) :- l_convert_to_avl_wf([H|T],S,WF), |
| 344 | | sort(S,SS), |
| 345 | | ord_list_to_avlset_direct(SS,R,convert_to_avl_inside_set). |
| 346 | | |
| 347 | | construct_singleton_avl_set(Val,avl_set(node(Val,true,0,empty,empty))). |
| 348 | | |
| 349 | | |
| 350 | | is_set_value(X,Origin) :- var(X), !,print(is_set_value(Origin)),nl,fail. |
| 351 | | is_set_value([],_) :- !. |
| 352 | | is_set_value([_|_],_) :- !. |
| 353 | | is_set_value(X,_) :- is_custom_explicit_set(X). |
| 354 | | |
| 355 | | is_custom_explicit_set(X,Origin) :- var(X), !,print(var_is_custom_explicit_set(Origin)),nl,fail. |
| 356 | | is_custom_explicit_set(X,_) :- is_custom_explicit_set(X). |
| 357 | | |
| 358 | | is_custom_explicit_set(X) :- var(X), !,print(var_is_custom_explicit_set),nl,fail. |
| 359 | | is_custom_explicit_set(global_set(_)). |
| 360 | | is_custom_explicit_set(freetype(_)). |
| 361 | | %is_custom_explicit_set(integer_global_set(_)). |
| 362 | | is_custom_explicit_set(avl_set(_)). |
| 363 | | is_custom_explicit_set(closure(_Parameters,_PT,_Cond)). |
| 364 | | |
| 365 | | % use if you know the argument to be nonvar |
| 366 | | is_custom_explicit_set_nonvar(global_set(_)). |
| 367 | | is_custom_explicit_set_nonvar(freetype(_)). |
| 368 | | is_custom_explicit_set_nonvar(avl_set(_)). |
| 369 | | is_custom_explicit_set_nonvar(closure(_Parameters,_PT,_Cond)). |
| 370 | | |
| 371 | | %:- assert_must_succeed(( custom_explicit_sets:portray_custom_explicit_set(avl_set(empty)) )). % now generates error |
| 372 | | :- use_module(translate,[translate_bvalue/2]). |
| 373 | | portray_custom_explicit_set(S) :- translate_bvalue(S,A), format(A,[]),nl. |
| 374 | | |
| 375 | | /* a predicate to check equality of two custom explicit sets */ |
| 376 | | |
| 377 | | %equal_explicit_sets(A,B) :- equal_explicit_sets_wf(A,B,no_wf_available). |
| 378 | | |
| 379 | | %equal_explicit_sets(X,Y) :- print_term_summary(equal_explicit_sets(X,Y)),fail. |
| 380 | | :- block equal_explicit_sets_wf(-,?,?), equal_explicit_sets_wf(?,-,?). |
| 381 | ? | equal_explicit_sets_wf(A,B,WF) :- equal_explicit_sets4(A,B,allow_expansion,WF). |
| 382 | | |
| 383 | | equal_explicit_sets4(global_set(X),global_set(Y),_,_WF) :- !,X=Y. |
| 384 | | equal_explicit_sets4(global_set(B),avl_set(A),E,WF) :- !,equal_explicit_sets4(avl_set(A),global_set(B),E,WF). |
| 385 | | equal_explicit_sets4(freetype(X),freetype(Y),_,_WF) :- !,X=Y. |
| 386 | | equal_explicit_sets4(avl_set(A),avl_set(B),_,_WF) :- !, |
| 387 | | equal_avl_tree(A,B). % alternatively, we could normalise avl_trees and only store normalised versions |
| 388 | | equal_explicit_sets4(avl_set(A),I2,_,_WF) :- |
| 389 | | is_interval_closure_or_integerset(I2,L2,U2,Finite2),!, % also covers I2=global_set(...) |
| 390 | | Finite2=finite, % only a finite interval can be equal to an AVL set |
| 391 | | avl_equal_to_interval(A,L2,U2). |
| 392 | | equal_explicit_sets4(avl_set(A),global_set(B),_,WF) :- \+ b_global_sets:b_integer_set(B), !, % integersets dealt with above |
| 393 | | explicit_set_cardinality_wf(global_set(B),Card,WF), |
| 394 | | is_finite_card(Card), % Card \= inf as avl_set must be finite |
| 395 | | explicit_set_cardinality_wf(avl_set(A),Card,WF). /* the sets must be identical as global_set contains all values */ |
| 396 | | equal_explicit_sets4(avl_set(A),CPB,_,WF) :- |
| 397 | | is_cartesian_product_closure(CPB,B1,B2),!, |
| 398 | | decompose_avl_set_into_cartesian_product_wf(A,A1,A2,WF), |
| 399 | | kernel_objects:equal_object_wf(A1,B1,equal_explicit_sets4,WF), |
| 400 | | kernel_objects:equal_object_wf(A2,B2,equal_explicit_sets4,WF). |
| 401 | ? | equal_explicit_sets4(closure(P,T,B),avl_set(A),E,WF) :- !, equal_explicit_sets4(avl_set(A),closure(P,T,B),E,WF). |
| 402 | | equal_explicit_sets4(I1,I2,_,_WF) :- is_interval_closure_or_integerset(I1,L1,U1,Finite1), |
| 403 | | is_interval_closure_or_integerset(I2,L2,U2,Finite2), !, |
| 404 | | Finite1=Finite2, % either both finite or infinite |
| 405 | | L1=L2, U1=U2. |
| 406 | | equal_explicit_sets4(CPA,CPB,_,WF) :- |
| 407 | ? | is_cartesian_product_closure(CPA,A1,A2), |
| 408 | | is_cartesian_product_closure(CPB,B1,B2),!, |
| 409 | | equal_cartesian_product_wf(A1,A2,B1,B2,WF). |
| 410 | | % what if both subset or relations or functions ... closure: TO DO: add support |
| 411 | | equal_explicit_sets4(S1,S2,_,WF) :- |
| 412 | | is_not_member_value_closure_or_integerset(S1,TYPE,MS1), |
| 413 | | is_not_member_value_closure_or_integerset(S2,TYPE,MS2), |
| 414 | | !, |
| 415 | | kernel_objects:equal_object_wf(MS1,MS2,equal_explicit_sets4,WF). |
| 416 | | equal_explicit_sets4(closure(P1,T1,B1),closure(P2,T2,B2),_,_WF) :- |
| 417 | | same_closure_body(P1,T1,B1,P2,T2,B2),!. |
| 418 | | %equal_explicit_sets4(X,Y) :- X==Y,!. |
| 419 | | equal_explicit_sets4(Set1,Set2,allow_expansion,WF) :- |
| 420 | | %kernel_objects:test_finite_set_wf(Set1,F1,WF), kernel_objects:test_finite_set_wf(Set2,F2,WF), equal_expansions(F1,F2,Set1,Set2) |
| 421 | | card_for_specific_custom_set(Set1,Card1,Code1), % TO DO: do not throw info away if Set2 cannot be determined |
| 422 | | card_for_specific_custom_set(Set2,Card2,Code2), |
| 423 | | !, |
| 424 | ? | call(Code1), call(Code2), |
| 425 | | % TO DO: if one of the two sets is infinite, then it would be enough to know that the other is not infinite for failure without expansion |
| 426 | | equal_expansions(Card1,Card2,Set1,Set2,WF). |
| 427 | | equal_explicit_sets4(Set1,Set2,allow_expansion,WF) :- equal_expansions(0,0,Set1,Set2,WF). |
| 428 | | |
| 429 | | |
| 430 | | % detect e.g. when one closure has seq(Type) and the other one set(integer,Type) |
| 431 | | same_types([],[]). |
| 432 | | same_types([H1|T1],[H2|T2]) :- unify_types_strict(H1,H2), same_types(T1,T2). |
| 433 | | |
| 434 | | :- block equal_expansions(-,?,?,?,?). |
| 435 | | equal_expansions(F1,F2,Set1,Set2,WF) :- (number(F1);number(F2)),!, |
| 436 | | % NOTE: sometimes we get inf for finite but very large sets |
| 437 | | F1=F2, % unify; can propagate info back to closure; e.g. prj2(BOOL,NAT) = prj2(BOOL,0..n) |
| 438 | | equal_expansions2(F1,F2,Set1,Set2,WF). |
| 439 | | equal_expansions(F1,F2,Set1,Set2,WF) :- |
| 440 | | equal_expansions2(F1,F2,Set1,Set2,WF). |
| 441 | | |
| 442 | | :- block equal_expansions2(-,?,?,?,?), equal_expansions2(?,-,?,?,?). |
| 443 | | %equal_expansions(0,0,avl_set(A),closure(P,T,B)) :- check_subset ?? in both directions ? |
| 444 | | %equal_expansions2(inf,inf,Set1,Set2,WF) :- WF \= no_wf_available, !, % symbolic treatment |
| 445 | | equal_expansions2(F,F,Set1,Set2,WF) :- |
| 446 | | % only expand if both sets have same cardinality |
| 447 | | % print_term_summary(equal_expansions3(F,Set1,Set2)),nl, |
| 448 | | equal_expansions3(F,Set1,Set2,WF). |
| 449 | | |
| 450 | | % TO DO: check if this brings something: |
| 451 | | %equal_expansions3(avl_set(A),closure(P,T,B),_WF) :- !, |
| 452 | | % expand_closure_to_avl_or_list(P,T,B,E2,check), % in case E2 is avl_set; we can use equal_avl_tree |
| 453 | | % ((nonvar(E2),E2=avl_set(B2)) |
| 454 | | % -> print(eql_avl),nl, print_term_summary(equal_avl_tree(A,B2)),nl, equal_avl_tree(A,B2) |
| 455 | | % ; print(eql_non_avl),nl,equal_object(avl_set(A),E2,equal_expansions3) |
| 456 | | % ). |
| 457 | | %:- use_module(library(lists),[perm2/4]). |
| 458 | | %equal_expansions3(F,Set1,Set2,_WF) :- number(F), F>100, % test with: {{},{TRUE},{FALSE},{TRUE,FALSE}} = /*@symbolic */ {x|x<:BOOL} or |
| 459 | | % {x|x<:POW(BOOL*BOOL) & (x={} or card(x)>0)} = /*@symbolic */ {x|x<:POW(BOOL*BOOL)} 26 sec -> 14 sec |
| 460 | | % case does not seem to appear very often |
| 461 | | % perm2(Set1,Set2,avl_set(_),Set), |
| 462 | | % is_definitely_maximal_set(Set), |
| 463 | | %Set2 is maximal and has the same cardinality as F, hence Set1 must be identical to Set2 |
| 464 | | % !, |
| 465 | | % debug_println(9,equal_to_maximal_closure(F)). |
| 466 | | equal_expansions3(F,Set1,Set2,WF) :- |
| 467 | ? | get_identity_as_equivalence(F,Set1,Set2,EQUIV), |
| 468 | | !,% translate:print_bexpr(EQUIV),nl, |
| 469 | | opt_push_wait_flag_call_stack_info(WF,b_operator_call(equal,[Set1,Set2],unknown),WF2), |
| 470 | | copy_wf_start(WF2,equal_expansions,CWF), |
| 471 | | b_test_boolean_expression(EQUIV,[],[],CWF), |
| 472 | | copy_wf_finish(WF2,CWF). |
| 473 | | % Alternative could be, if difference were to be fully treated symbolically: |
| 474 | | % difference_of_explicit_set_wf(Set1,Set2,R12,WF), difference_of_explicit_set_wf(Set2,Set1,R21,WF), |
| 475 | | % kernel_objects:empty_set_wf(R12,WF), kernel_objects:empty_set_wf(R21,WF). |
| 476 | | equal_expansions3(_,Set1,Set2,WF) :- |
| 477 | | expand_custom_set_wf(Set1,E1,equal_expansions1,WF), |
| 478 | | expand_custom_set_wf(Set2,E2,equal_expansions2,WF), |
| 479 | | E1=E2. /* ensure that ordering and normalization is same for all representations ! */ |
| 480 | | |
| 481 | | |
| 482 | | :- use_module(bsyntaxtree, [create_forall/3]). |
| 483 | | :- use_module(b_ast_cleanup, [clean_up/3]). |
| 484 | | get_identity_as_equivalence(F,Set1,Set2,CleanedEQUIV) :- |
| 485 | | (F=inf %; is_infinite_explicit_set(Set1) ; is_infinite_explicit_set(Set2) |
| 486 | | ; Set1 \= avl_set(_),Set2 \= avl_set(_), % if one of the two sets is an AVL Set: better compute the other set explicitly instead of using this symbolic treatment |
| 487 | | (dont_expand_this_explicit_set(Set1,100000) ; |
| 488 | | dont_expand_this_explicit_set(Set2,100000) |
| 489 | | ) |
| 490 | | % avl_test check for test 1081; TO DO: instead of test try to expand set and if this leads to enum warning use symbolic check |
| 491 | | ), |
| 492 | ? | get_identity_as_equivalence_aux(Set1,Set2,EQUIV), |
| 493 | | clean_up(EQUIV,[],CleanedEQUIV). |
| 494 | | % can be useful to replace x : {v|P(v)} --> x:P(x) (remove_member_comprehension) and reuse predicates, see 2483 |
| 495 | | get_identity_as_equivalence_aux(Set1,Set2,EQUIV) :- |
| 496 | ? | kernel_objects:infer_value_type(Set1,S1Type), |
| 497 | ? | kernel_objects:infer_value_type(Set2,S2Type), |
| 498 | | merge_types(S1Type,S2Type,SType), |
| 499 | | is_set_type(SType,Type), |
| 500 | | % Construct: !x.(x:Set1 <=> x:Set2) ?? see test 2009 |
| 501 | | get_pos_infos_for_explicit_set(Set1,I1), |
| 502 | | get_pos_infos_for_explicit_set(Set2,I2), |
| 503 | | I12 = I1, % we could merge position_info; but two sets could be very far apart |
| 504 | | TID = b(identifier('_equality_sets_'),Type,[]), |
| 505 | | Mem1 = b(member(TID,b(value(Set1),SType,I1)),pred,I1), |
| 506 | | Mem2 = b(member(TID,b(value(Set2),SType,I2)),pred,I2), |
| 507 | | Body1 = b(equivalence(Mem1,Mem2),pred,I12), |
| 508 | | create_forall([TID],Body1,EQUIV). |
| 509 | | %translate:print_bexpr(EQUIV),nl. |
| 510 | | |
| 511 | | :- use_module(bsyntaxtree, [get_texpr_pos/2]). |
| 512 | | get_pos_infos_for_explicit_set(closure(_,_,Body),[Pos]) :- get_texpr_pos(Body,Pos),!. |
| 513 | | get_pos_infos_for_explicit_set(_,[]). |
| 514 | | |
| 515 | | :- use_module(kernel_equality,[eq_atomic/4, equality_objects/3, |
| 516 | | equality_objects_wf_no_enum/4, equality_objects_with_type_wf/5]). |
| 517 | | /* maybe rewrite equal_explicit_sets and not_... to use this to avoid maintaining multiple versions */ |
| 518 | | equality_explicit_sets_wf(global_set(X),global_set(Y),R,_WF) :- !, eq_atomic(X,Y,set,R). |
| 519 | | equality_explicit_sets_wf(global_set(B),avl_set(A),R,WF) :- !,equality_explicit_sets_wf(avl_set(A),global_set(B),R,WF). |
| 520 | | equality_explicit_sets_wf(freetype(X),freetype(Y),R,_) :- !, eq_atomic(X,Y,set,R). |
| 521 | | equality_explicit_sets_wf(avl_set(A),avl_set(B),R,_) :- !, |
| 522 | | (equal_avl_tree(A,B) -> R=pred_true ; R=pred_false). % alternatively, we could normalise avl_trees and only store normalised versions |
| 523 | | equality_explicit_sets_wf(avl_set(A),I2,R,WF) :- is_interval_closure_or_integerset(I2,L2,U2),!, |
| 524 | | % also covers I2=global_set(...) |
| 525 | | avl_equality_to_interval(A,L2,U2,R,WF). |
| 526 | | equality_explicit_sets_wf(avl_set(A),global_set(B),R,WF) :- \+ b_global_sets:b_integer_set(B), !, |
| 527 | | explicit_set_cardinality_wf(global_set(B),Card,WF), |
| 528 | | (is_finite_card(Card), % Card \= inf, %as avl_set must be finite |
| 529 | | explicit_set_cardinality_wf(avl_set(A),Card,WF) |
| 530 | | -> R=pred_true /* the sets must be identical as global_set contains all values */ |
| 531 | | ; R=pred_false). |
| 532 | | equality_explicit_sets_wf(avl_set(A),CPB,R,WF) :- |
| 533 | | is_cartesian_product_closure(CPB,B1,B2),!, |
| 534 | | if(decompose_avl_set_into_cartesian_product_wf(A,A1,A2,WF), % should not produce pending co-routines |
| 535 | | equality_cartesian_product_wf(A1,A2,B1,B2,R,WF), |
| 536 | | R=pred_false % no cartesian product can be equal to this avl_set |
| 537 | | ). |
| 538 | | equality_explicit_sets_wf(closure(P,T,B),avl_set(A),R,WF) :- !, |
| 539 | | equality_explicit_sets_wf(avl_set(A),closure(P,T,B),R,WF). |
| 540 | | equality_explicit_sets_wf(I1,I2,R,WF) :- is_interval_closure_or_integerset(I1,L1,U1,Finite1), |
| 541 | | is_interval_closure_or_integerset(I2,L2,U2,Finite2), !, |
| 542 | | (Finite1=Finite2 -> equality_objects_wf_no_enum((int(L1),int(U1)),(int(L2),int(U2)),R,WF) |
| 543 | | ; R = pred_false). |
| 544 | | equality_explicit_sets_wf(CPA,CPB,R,WF) :- |
| 545 | | is_cartesian_product_closure(CPA,A1,A2), is_cartesian_product_closure(CPB,B1,B2),!, |
| 546 | | equality_cartesian_product_wf(A1,A2,B1,B2,R,WF). |
| 547 | | equality_explicit_sets_wf(S1,S2,R,WF) :- |
| 548 | | is_not_member_value_closure_or_integerset(S1,TYPE,MS1), |
| 549 | | is_not_member_value_closure_or_integerset(S2,TYPE,MS2),!, |
| 550 | | equality_objects_with_type_wf(TYPE,MS1,MS2,R,WF). |
| 551 | | equality_explicit_sets_wf(closure(P,T,B),closure(P,T,B2),R,_) :- |
| 552 | | same_texpr_body(B,B2),!,R=pred_true. |
| 553 | | equality_explicit_sets_wf(Set1,Set2,R,WF) :- |
| 554 | | Set1 \= [_|_], Set2 \= [_|_], % below we check for avl_set; i.e., useful are only closure/3, global_set/1, ... |
| 555 | ? | get_identity_as_equivalence(unknown,Set1,Set2,EQUIV),!, |
| 556 | | opt_push_wait_flag_call_stack_info(WF,b_operator_call(equal,[Set1,Set2],unknown),WF2), |
| 557 | | copy_wf_start(WF2,equal_expansions,CWF), |
| 558 | | % EQUIV is a universal quantification, usually over an infinite domain |
| 559 | | b_interpreter_check:b_force_check_boolean_expression(EQUIV,[],[],CWF,R), % we know EQUIV cannot be reified |
| 560 | | copy_wf_finish(WF2,CWF). |
| 561 | | % TO DO: add complement sets, |
| 562 | | |
| 563 | | /* Cartesian Product Comparison */ |
| 564 | | :- use_module(kernel_equality,[empty_cartesian_product_wf/4]). |
| 565 | | % A1*A2 = B1*B2 <=> (((A1={} or A2={}) & (B1={} or B2={})) or (A1=B1 & A2=B2)) |
| 566 | | equal_cartesian_product_wf(A1,A2,B1,B2,WF) :- |
| 567 | | equality_cartesian_product_wf(A1,A2,B1,B2,pred_true,WF). |
| 568 | | not_equal_cartesian_product_wf(A1,A2,B1,B2,WF) :- |
| 569 | | equality_cartesian_product_wf(A1,A2,B1,B2,pred_false,WF). |
| 570 | | |
| 571 | | equality_cartesian_product_wf(A1,A2,B1,B2,R,_WF) :- |
| 572 | | nonvar(A1), A1=closure(P,T,BdyA1), |
| 573 | | nonvar(B1), B1=closure(P,T,BdyB1), |
| 574 | | nonvar(A2), A2=closure(P2,T2,BdyA2), |
| 575 | | nonvar(B2), B2=closure(P2,T2,BdyB2), |
| 576 | | % they have the same names; probably we are comparing identical values (e.g., in bvisual2) |
| 577 | | same_texpr_body(BdyA1,BdyB1), |
| 578 | | % note: we cannot simply call equality of A2 and B2 as cartesian products can be empty, see test 2072 |
| 579 | | same_texpr_body(BdyA2,BdyB2), |
| 580 | | !, |
| 581 | | R=pred_true. |
| 582 | | equality_cartesian_product_wf(A1,A2,B1,B2,R,WF) :- |
| 583 | | empty_cartesian_product_wf(A1,A2,EmptyA,WF), |
| 584 | | equality_cart_product2(EmptyA,A1,A2,B1,B2,R,WF). |
| 585 | | :- block equality_cart_product2(-, ?,?,?,?,?,?). |
| 586 | | equality_cart_product2(pred_true,_,_,B1,B2,R,WF) :- empty_cartesian_product_wf(B1,B2,R,WF). |
| 587 | | equality_cart_product2(pred_false,A1,A2,B1,B2,R,WF) :- equality_objects_wf_no_enum((A1,A2),(B1,B2),R,WF). |
| 588 | | |
| 589 | | /* COMPARING AVL-SET with INTERVAL */ |
| 590 | | |
| 591 | | % check if an avl tree is equal to an interval range |
| 592 | | avl_equal_to_interval(_A,L2,U2) :- |
| 593 | | infinite_interval(L2,U2),!,fail. % otherwise infinite & avl_set is finite |
| 594 | | % we can now assume L2, U2 are numbers (but could not yet be instantiated) |
| 595 | | avl_equal_to_interval(A,L2,U2) :- |
| 596 | | avl_min(A,int(L2)), avl_max(A,int(U2)), |
| 597 | | Card is 1+U2-L2, |
| 598 | | explicit_set_cardinality(avl_set(A),Card). % sets are equal: same size + same lower & upper bound |
| 599 | | |
| 600 | | avl_not_equal_to_interval(A,L2,U2,WF) :- avl_equality_to_interval(A,L2,U2,pred_false,WF). |
| 601 | | |
| 602 | | avl_equality_to_interval(_A,L2,U2,R,_WF) :- |
| 603 | | infinite_interval(L2,U2),!,R=pred_false. % interval infinite & avl_set is finite |
| 604 | | % we can now assume L2, U2 are numbers (but could not yet be instantiated) |
| 605 | | avl_equality_to_interval(A,L2,U2,R,WF) :- |
| 606 | | avl_min(A,int(AL)), avl_max(A,int(AU)), |
| 607 | | Card is 1+AU-AL, |
| 608 | | explicit_set_cardinality_wf(avl_set(A),ACard,WF), |
| 609 | | equality_objects_wf_no_enum((int(ACard),(int(AL),int(AU))), |
| 610 | | (int(Card),(int(L2),int(U2))),R,WF). |
| 611 | | % sets are equal if same size + same lower & upper bound |
| 612 | | |
| 613 | | /* COMPARING TWO CLOSURES */ |
| 614 | | |
| 615 | | % a variation of equal_explicit_sets which tries not expand and just compares two closures |
| 616 | | |
| 617 | | same_closure(I1,I2) :- |
| 618 | | is_interval_closure_or_integerset(I1,L1,U1,Finite1), |
| 619 | | is_interval_closure_or_integerset(I2,L2,U2,Finite2), !, |
| 620 | | Finite1=Finite2, |
| 621 | | L1=L2, U1=U2. |
| 622 | | same_closure(CPA,CPB) :- |
| 623 | | is_cartesian_product_closure(CPA,A1,A2), |
| 624 | | is_cartesian_product_closure(CPB,B1,B2),!, |
| 625 | | equal_cartesian_product_wf(A1,A2,B1,B2,no_wf_available). % could be expensive |
| 626 | | same_closure(S1,S2) :- |
| 627 | | is_not_member_value_closure_or_integerset(S1,TYPE,MS1), |
| 628 | | is_not_member_value_closure_or_integerset(S2,TYPE,MS2), |
| 629 | | !, |
| 630 | | kernel_objects:equal_object(MS1,MS2,same_closure). % could be expensive |
| 631 | | same_closure(closure(P1,T1,B1),closure(P2,T2,B2)) :- same_closure_body_with_parameter_renaming(P1,T1,B1,P2,T2,B2). |
| 632 | | |
| 633 | | same_closure_body(P,T1, B1, P,T2,B2) :- |
| 634 | | same_types(T1,T2), |
| 635 | | same_texpr_body(B1,B2). |
| 636 | | |
| 637 | | % a version of same_closure_body which allows renaming of the parameters |
| 638 | | same_closure_body_with_parameter_renaming(P1,T1, B1, P2,T2,B2) :- |
| 639 | | same_types(T1,T2), |
| 640 | | create_renaming(P1,P2,Renaming), |
| 641 | | % TO DO: pass Renaming in AVL tree and rename on the fly |
| 642 | | rename_bt(B2,Renaming,RenamedB2), |
| 643 | | same_texpr_body(B1,RenamedB2). |
| 644 | | |
| 645 | | create_renaming([],[],[]). |
| 646 | | create_renaming([ID|T1],[ID|T2],TR) :- !, create_renaming(T1,T2,TR). |
| 647 | | create_renaming([ID1|T1],[ID2|T2],[rename(ID2,ID1)|TR]) :- |
| 648 | | create_renaming(T1,T2,TR). |
| 649 | | |
| 650 | | |
| 651 | | % check if two wrapped expressions are equal (modulo associated Info, e.g. source loc info) |
| 652 | | % and checking inserted values for equality (sometimes storing a closure will convert small inner closures into AVL sets) |
| 653 | | same_texpr_body(E1,E2) :- empty_avl(E),same_texpr_body(E1,E,E2). |
| 654 | | same_texpr_body(b(E1,Type1,_),AVL,b(E2,Type2,_)) :- |
| 655 | | unify_types_strict(Type1,Type2), % check in principle redundant |
| 656 | | same_texpr2(E1,AVL,E2). |
| 657 | | |
| 658 | | :- use_module(value_persistance,[cache_is_activated/0]). |
| 659 | | :- use_module(bsyntaxtree,[safe_syntaxelement_det/5, is_set_type/2,get_texpr_ids/2, |
| 660 | | get_texpr_expr/2, get_negated_operator_expr/2]). |
| 661 | | same_texpr2(value(V1),AVL,RHS) :- !,same_texpr_value2(RHS,AVL,V1). |
| 662 | | same_texpr2(LHS,AVL,value(V2)) :- !,same_texpr_value2(LHS,AVL,V2). |
| 663 | | same_texpr2(lazy_let_expr(ID,LHS,RHS),AVL,lazy_let_expr(ID2,LHS2,RHS2)) :- !, |
| 664 | | same_texpr_body(LHS,AVL,LHS2), |
| 665 | | avl_store(ID,AVL,ID2,NewAVL), |
| 666 | | same_texpr_body(RHS,NewAVL,RHS2). |
| 667 | | same_texpr2(lazy_let_pred(ID,LHS,RHS),AVL,lazy_let_pred(ID2,LHS2,RHS2)) :- !, |
| 668 | | same_texpr_body(LHS,AVL,LHS2), |
| 669 | | avl_store(ID,AVL,ID2,NewAVL), |
| 670 | | same_texpr_body(RHS,NewAVL,RHS2). |
| 671 | | same_texpr2(lazy_lookup(ID1), AVL,lazy_lookup(ID2)) :- !, avl_fetch(ID1,AVL,ID2). |
| 672 | | same_texpr2(E1,AVL,E2) :- % Should we only enable this for same_closure_body_with_parameter_renaming? |
| 673 | | quantifier_construct(E1,Functor,TParas1,Body1), |
| 674 | | quantifier_construct(E2,Functor,TParas2,Body2), |
| 675 | | !, |
| 676 | | same_quantified_expression(TParas1,Body1,AVL,TParas2,Body2). |
| 677 | | same_texpr2(assertion_expression(Pred,MsgStr,EXPR),AVL,assertion_expression(Pred2,MsgStr2,EXPR2)) :- !, |
| 678 | | (MsgStr==MsgStr2 -> true |
| 679 | | ; cache_is_activated, |
| 680 | | debug_println(19,ignoring_difference_in_assertion_msg(MsgStr,MsgStr2))), |
| 681 | | % difference can happen when constant was computed in other context, |
| 682 | | % e.g, when cache_is_activated with different position info (with and wo file info, see Debug_6min_zone_du_PAS) |
| 683 | | % Value-wise MsgStr cannot make a difference; only makes a difference in error message when expr not WD |
| 684 | | same_texpr_body(Pred,AVL,Pred2), |
| 685 | | same_texpr_body(EXPR,AVL,EXPR2). |
| 686 | | same_texpr2(E1,AVL,E2) :- |
| 687 | | functor(E1,F,Arity), |
| 688 | | functor(E2,F,Arity),!, |
| 689 | | safe_syntaxelement_det(E1,Subs1,_Names1,_List1,Constant1), |
| 690 | | safe_syntaxelement_det(E2,Subs2,_Names2,_List2,Constant2), |
| 691 | | Constant2==Constant1, |
| 692 | | same_sub_expressions(Subs1,AVL,Subs2). |
| 693 | | same_texpr2(E1,AVL,E2) :- same_texpr_with_rewrite(E1,AVL,E2),!. |
| 694 | | same_texpr2(E1,AVL,E2) :- same_texpr_with_rewrite(E2,AVL,E1). |
| 695 | | %same_texpr2(E1,_,E2) :- |
| 696 | | % functor(E1,F1,Arity1), |
| 697 | | % functor(E2,F2,Arity2), print(not_eq(F1,Arity1,F2,Arity2)),nl, print(E1),nl, print(E2),nl,nl,fail. |
| 698 | | % some differences: assertion_expression/3 and function/2, ... |
| 699 | | |
| 700 | | % some rewrite rules from ast_cleanup; but we cannot replicate all rules here |
| 701 | | same_texpr_with_rewrite(negation(TE1),AVL,E2) :- |
| 702 | | get_negated_operator_expr(b(E2,pred,[]),NegE2),!, |
| 703 | | get_texpr_expr(TE1,E1), |
| 704 | | same_texpr2(E1,AVL,NegE2). |
| 705 | | same_texpr_with_rewrite(member(X1,b(value(Set1),_,_)),AVL,equal(X2,b(El2,_,_))) :- |
| 706 | | singleton_set(Set1,El1), !, |
| 707 | | % X : {El} <===> X = El ; required for JSON trace replay of test 1491 |
| 708 | | same_texpr_body(X1,X2), |
| 709 | | same_texpr_value2(El2,AVL,El1). |
| 710 | | same_texpr_with_rewrite(not_member(X1,b(value(Set1),_,_)),AVL,not_equal(X2,b(El2,_,_))) :- |
| 711 | | singleton_set(Set1,El1), !, |
| 712 | | % X /: {El} <===> X /= El ; required for JSON trace replay of test 1491 |
| 713 | | same_texpr_body(X1,X2), |
| 714 | | same_texpr_value2(El2,AVL,El1). |
| 715 | | |
| 716 | | % constructs with local quantified parameters: |
| 717 | | quantifier_construct(comprehension_set(TParas,Body),comprehension_set,TParas,Body). |
| 718 | | quantifier_construct(exists(TParas,Body),exists,TParas,Body). |
| 719 | | quantifier_construct(forall(TParas,LHS,RHS),forall,TParas,Body) :- |
| 720 | | Body = b(implication(LHS,RHS),pred,[]). |
| 721 | | % TODO?: SIGMA, PI, UNION, INTER |
| 722 | | |
| 723 | | :- use_module(bsyntaxtree,[split_names_and_types/3]). |
| 724 | | same_quantified_expression(TParas1,Body1,AVL,TParas2,Body2) :- |
| 725 | | split_names_and_types(TParas1,P1,T1), |
| 726 | | split_names_and_types(TParas2,P2,T2), |
| 727 | | same_types(T1,T2), |
| 728 | | create_renaming(P1,P2,Renaming), |
| 729 | | rename_bt(Body2,Renaming,RenamedB2), % TODO: store renaming in AVL and lookup on the fly |
| 730 | | same_texpr_body(Body1,AVL,RenamedB2). |
| 731 | | |
| 732 | | same_texpr_value2(E2,_,V2) :- var(V2),!,V2==E2. |
| 733 | | same_texpr_value2(interval(Min,Max),_,avl_set(A)) :- !, % occurs in JSON trace replay for test 268 |
| 734 | | avl_equal_to_interval(A,Min,Max). % TODO: also compare the other way around above; only apply if Card not too large? |
| 735 | | same_texpr_value2(value(V2),_,V1) :- !, |
| 736 | | same_value_inside_closure(V1,V2). |
| 737 | | %(same_value_inside_closure(V1,V2) -> true ; print(not_eq_vals(V1,V2)),nl,fail). |
| 738 | | same_texpr_value2(comprehension_set(Paras,B2),AVL,closure(P,_,B1)) :- !, |
| 739 | | get_texpr_ids(Paras,P),!, |
| 740 | | same_texpr_body(B1,AVL,B2). |
| 741 | | same_texpr_value2(cartesian_product(TB1,TB2),AVL,V1) :- |
| 742 | | decompose_value_into_cartesian_product(V1,A1,A2), !, |
| 743 | | %print(cart(A1,A2)),nl, |
| 744 | | get_texpr_expr(TB1,B1), |
| 745 | | same_texpr_value2(B1,AVL,A1), |
| 746 | | get_texpr_expr(TB2,B2), |
| 747 | | same_texpr_value2(B2,AVL,A2). |
| 748 | | same_texpr_value2(StaticExpr,_,int(Nr)) :- number(Nr), |
| 749 | | b_ast_cleanup:pre_compute_static_int_expression(StaticExpr,Nr),!. |
| 750 | | % TO DO: maybe also check if both sides can be evaluated |
| 751 | | % TO DO: move pre_compute_static_int_expression to another module |
| 752 | | same_texpr_value2(E2,AVL,V1) :- rewrite_value(V1,E2,NewE1),!, |
| 753 | | same_texpr2(NewE1,AVL,E2). |
| 754 | | %same_texpr_value2(E1,_,E2) :- |
| 755 | | % functor(E1,F1,Arity1), |
| 756 | | % functor(E2,F2,Arity2), print(not_eq_val(F1,Arity1,F2,Arity2)),nl, fail,print(E1),nl, print(E2),nl,nl,fail. |
| 757 | | |
| 758 | | decompose_value_into_cartesian_product(avl_set(A),A1,A2) :- !, |
| 759 | | decompose_avl_set_into_cartesian_product_wf(A,A1,A2,no_wf_available). |
| 760 | | decompose_value_into_cartesian_product(Closure,A1,A2) :- is_cartesian_product_closure(Closure,A1,A2). |
| 761 | | |
| 762 | | |
| 763 | | % rewrite values back to AST nodes |
| 764 | | rewrite_value(value(V),OtherVal,New) :- nonvar(V), |
| 765 | | rewrite_value_aux(V,OtherVal,New). |
| 766 | | %rewrite_value(function(Lambda,Argument),assertion_expression(_,_,_),assertion_expression(Cond,Msg,Expr)) :- b_ast_cleanup:rewrite_function_application(Lambda,Argument,[],assertion_expression(Cond,Msg,Expr)). |
| 767 | | rewrite_value_aux(closure(P,T,B),_,Set) :- |
| 768 | | is_member_closure(P,T,B,_,Set). % TO DO: ensure that ast_cleanup does not generate useless member closures ? |
| 769 | | rewrite_value_aux(global_set(GS),_,AST) :- |
| 770 | | rewrite_glob_set(GS,AST). |
| 771 | | rewrite_value_aux(avl_set(A),interval(_,_),interval(TLow,TUp)) :- |
| 772 | | avl_equal_to_interval(A,Low,Up), |
| 773 | | TLow = b(integer(Low),integer,[]), TUp = b(integer(Up),integer,[]). |
| 774 | | rewrite_value_aux(int(A),integer(_),integer(A)) :- number(A). |
| 775 | | rewrite_value_aux(pred_true,_,boolean_true). |
| 776 | | rewrite_value_aux(pred_false,_,boolean_false). |
| 777 | | rewrite_value_aux(string(A),integer(_),string(A)) :- % value(string(A)) rewritten to AST node string(A) |
| 778 | | atom(A). |
| 779 | | |
| 780 | | |
| 781 | | rewrite_glob_set('REAL',real_set). |
| 782 | | rewrite_glob_set('FLOAT',float_set). |
| 783 | | rewrite_glob_set('STRING',string_set). |
| 784 | | rewrite_glob_set(I,integer_set(I)) :- |
| 785 | | kernel_objects:integer_global_set(I). |
| 786 | | |
| 787 | | allow_expansion(avl_set(_),closure(P,T,B)) :- |
| 788 | | is_small_specific_custom_set(closure(P,T,B),100). |
| 789 | | allow_expansion(closure(P,T,B),avl_set(_)) :- |
| 790 | | is_small_specific_custom_set(closure(P,T,B),100). |
| 791 | | |
| 792 | | same_sub_expressions([],_,[]). |
| 793 | | same_sub_expressions([H1|T1],AVL,[H2|T2]) :- |
| 794 | | same_texpr_body(H1,AVL,H2), |
| 795 | | same_sub_expressions(T1,AVL,T2). |
| 796 | | |
| 797 | | same_value_inside_closure(V1,V2) :- var(V1),!, V1==V2. |
| 798 | | same_value_inside_closure(_,V2) :- var(V2),!,fail. |
| 799 | | same_value_inside_closure(rec(Fields1),rec(Fields2)) :- !, |
| 800 | | % sets of records come in this form: struct(b(value(rec(FIELDS)),record(_),_)) |
| 801 | | same_fields_inside_closure(Fields1,Fields2). |
| 802 | | same_value_inside_closure(V1,V2) :- |
| 803 | | % we could attempt this only if the outer closure was large/infinite ?? |
| 804 | | is_custom_explicit_set(V1), is_custom_explicit_set(V2), |
| 805 | | !, |
| 806 | | (allow_expansion(V1,V2) -> EXP=allow_expansion ; EXP = no_expansion), |
| 807 | | equal_explicit_sets4(V1,V2,EXP,no_wf_available). % usually only sets compiled differently inside closures |
| 808 | | same_value_inside_closure([H1|T1],avl_set(A2)) :- !, % relevant for JSON trace replay for test 1263 |
| 809 | | try_convert_to_avl([H1|T1],V1), V1=avl_set(A1), |
| 810 | | equal_avl_tree(A1,A2). |
| 811 | | same_value_inside_closure(avl_set(A2),[H1|T1]) :- !, |
| 812 | | try_convert_to_avl([H1|T1],V1), V1=avl_set(A1), |
| 813 | | equal_avl_tree(A1,A2). |
| 814 | | same_value_inside_closure(V1,V2) :- V1==V2. |
| 815 | | |
| 816 | | same_fields_inside_closure(V1,V2) :- var(V1),!, V1==V2. |
| 817 | | same_fields_inside_closure(_,V2) :- var(V2),!,fail. |
| 818 | | same_fields_inside_closure([],[]). |
| 819 | | same_fields_inside_closure([field(Name,V1)|T1],[field(Name,V2)|T2]) :- |
| 820 | | same_value_inside_closure(V1,V2), |
| 821 | | same_fields_inside_closure(T1,T2). |
| 822 | | |
| 823 | | /* |
| 824 | | same_texpr_body_debug(H1,H2) :- |
| 825 | | (same_texpr_body(H1,H2) -> true |
| 826 | | ; print('FAIL: '),nl, |
| 827 | | translate:print_bexpr(H1),nl, translate:print_bexpr(H2),nl, print(H1),nl, print(H2),nl, fail). */ |
| 828 | | |
| 829 | | %test(Y2,Z2) :- empty_avl(X), avl_store(1,X,2,Y), avl_store(2,X,3,Z), |
| 830 | | % avl_store(2,Y,3,Y2), avl_store(1,Z,2,Z2), equal_avl_tree(Y2,Z2). |
| 831 | | |
| 832 | | %equal_avl_tree(A,B) :- avl_min(A,Min), avl_min(B,Min), cmp(Min,A,B). |
| 833 | | %cmp(El,A,B) :- |
| 834 | | % (avl_next(El,A,Nxt) -> (avl_next(El,B,Nxt), cmp(Nxt,A,B)) |
| 835 | | % ; \+ avl_next(El,B,Nxt) ). |
| 836 | | |
| 837 | | % The following is faster than using avl_next |
| 838 | | equal_avl_tree(A,B) :- |
| 839 | | % statistics(walltime,[WT1,_]),if(equal_avl_tree2(A,B),true,(statistics(walltime,[_,W]),print(wall(W)),nl)). |
| 840 | | %equal_avl_tree2(A,B) :- |
| 841 | | avl_min(A,Min), |
| 842 | | !, |
| 843 | | avl_min(B,Min), |
| 844 | | avl_max(A,Max), avl_max(B,Max), |
| 845 | | % maybe also check avl_height +/- factor of 1.4405 (page 460, Knuth 3) ? but it seems this would trigger only extremely rarely |
| 846 | | %avl_height(A,H1), avl_height(A,H2), log(check(Min,Max,H1,H2)), |
| 847 | | avl_domain(A,L), avl_domain(B,L). |
| 848 | | equal_avl_tree(empty,_) :- !, format(user_error,'*** Warning: empty AVL tree in equal_avl_tree~n',[]). |
| 849 | | equal_avl_tree(A,B) :- add_internal_error('Illegal AVL tree: ',equal_avl_tree(A,B)),fail. |
| 850 | | |
| 851 | | /* a predicate to check equality of two custom explicit sets */ |
| 852 | | |
| 853 | | % TO DO: deal with second set being a variable with kernel_cardinality_attr attribute |
| 854 | | :- block not_equal_explicit_sets_wf(-,?,?), not_equal_explicit_sets_wf(?,-,?). |
| 855 | | not_equal_explicit_sets_wf(global_set(X),global_set(Y),_) :- !,dif(X,Y). |
| 856 | | not_equal_explicit_sets_wf(global_set(B),avl_set(A),WF) :- !, |
| 857 | | \+ equal_explicit_sets4(avl_set(A),global_set(B),allow_expansion,WF). |
| 858 | | not_equal_explicit_sets_wf(freetype(X),freetype(Y),_) :- !,dif(X,Y). |
| 859 | | not_equal_explicit_sets_wf(avl_set(A),avl_set(B),_) :- !, |
| 860 | | \+ equal_avl_tree(A,B). |
| 861 | | %not_equal_explicit_sets_wf(X,Y,_) :- X==Y,!,fail. |
| 862 | | not_equal_explicit_sets_wf(avl_set(A),I2,WF) :- is_interval_closure_or_integerset(I2,L2,U2),!, % also covers I2=global_set(...) |
| 863 | | avl_not_equal_to_interval(A,L2,U2,WF). |
| 864 | | not_equal_explicit_sets_wf(avl_set(A),global_set(B),WF) :- !, |
| 865 | | \+ equal_explicit_sets4(avl_set(A),global_set(B),allow_expansion,WF). |
| 866 | | not_equal_explicit_sets_wf(avl_set(A),CPB,WF) :- |
| 867 | | is_cartesian_product_closure(CPB,B1,B2),!, |
| 868 | | if(decompose_avl_set_into_cartesian_product_wf(A,A1,A2,WF), % should not produce pending co-routines, but better safe |
| 869 | | kernel_objects:not_equal_object_wf((A1,A2),(B1,B2),WF), |
| 870 | | true % no cartesian product can be equal to this avl_set |
| 871 | | ). |
| 872 | | not_equal_explicit_sets_wf(closure(P,T,B),avl_set(A),WF) :- !, |
| 873 | | not_equal_explicit_sets_wf(avl_set(A),closure(P,T,B),WF). |
| 874 | | not_equal_explicit_sets_wf(I1,I2,_) :- is_interval_closure_or_integerset(I1,L1,U1,Finite1), |
| 875 | | is_interval_closure_or_integerset(I2,L2,U2,Finite2), !, |
| 876 | | dif((Finite1,L1,U1),(Finite2,L2,U2)). % maybe we should call not_equal_objects on integers (not on inf values)? |
| 877 | | not_equal_explicit_sets_wf(CPA,CPB,WF) :- |
| 878 | | is_cartesian_product_closure(CPA,A1,A2), is_cartesian_product_closure(CPB,B1,B2),!, |
| 879 | | not_equal_cartesian_product_wf(A1,A2,B1,B2,WF). |
| 880 | | not_equal_explicit_sets_wf(S1,S2,WF) :- |
| 881 | | is_not_member_value_closure_or_integerset(S1,TYPE,MS1), |
| 882 | | is_not_member_value_closure_or_integerset(S2,TYPE,MS2),!, |
| 883 | | kernel_objects:not_equal_object_wf(MS1,MS2,WF). |
| 884 | | not_equal_explicit_sets_wf(closure(P,T,B),closure(P,T,B2),_) :- |
| 885 | | same_texpr_body(B,B2),!,fail. |
| 886 | | % TO DO: maybe support interval & avl_set comparison |
| 887 | | not_equal_explicit_sets_wf(Set1,Set2,WF) :- |
| 888 | | card_for_specific_custom_set(Set1,Card1,Code1), card_for_specific_custom_set(Set2,Card2,Code2), |
| 889 | | call(Code1), call(Code2),!, |
| 890 | | not_equal_expansions(Card1,Card2,Set1,Set2,WF). |
| 891 | | not_equal_explicit_sets_wf(Set1,Set2,WF) :- not_equal_expansions(0,0,Set1,Set2,WF). |
| 892 | | |
| 893 | | |
| 894 | | :- block not_equal_expansions(-,?,?,?,?), not_equal_expansions(?,-,?,?,?). |
| 895 | | not_equal_expansions(F1,F2,_,_,_) :- F1 \= F2,!. % sets guaranteed to be different |
| 896 | | not_equal_expansions(F,F,Set1,Set2,WF) :- |
| 897 | ? | get_identity_as_equivalence(F,Set1,Set2,EQUIV), |
| 898 | | !, %write(not),nl,translate:print_bexpr(EQUIV),nl, |
| 899 | | opt_push_wait_flag_call_stack_info(WF,b_operator_call(equal,[Set1,Set2],unknown),WF2), |
| 900 | | copy_wf_start(WF2,equal_expansions,CWF), |
| 901 | | b_not_test_boolean_expression(EQUIV,[],[],CWF), |
| 902 | | copy_wf_finish(WF2,CWF). |
| 903 | | not_equal_expansions(F,F,Set1,Set2,WF) :- |
| 904 | | % only expand if both sets have same cardinality |
| 905 | | expand_custom_set_wf(Set1,E1,not_equal_expansions1,WF), |
| 906 | | expand_custom_set_wf(Set2,E2,not_equal_expansions2,WF), |
| 907 | | dif(E1,E2). /* TO DO: ensure that ordering and normalization is same for all representations ! */ |
| 908 | | |
| 909 | | |
| 910 | | |
| 911 | | |
| 912 | | :- use_module(b_global_sets,[b_empty_global_set/1, b_non_empty_global_set/1, b_global_set_cardinality/2]). |
| 913 | | is_empty_explicit_set_wf(closure(P,T,B),WF) :- !, |
| 914 | | is_empty_closure_wf(P,T,B,WF). |
| 915 | | is_empty_explicit_set_wf(S,_WF) :- is_empty_explicit_set(S). |
| 916 | | |
| 917 | | % with WF we can delay computing Card; see test 1272 / card({x|x:1..10 & x*x<i}) = 0 & i>1 |
| 918 | | % TO DO: ideally we could just write this: is_empty_closure_wf(P,T,B,WF) :- closure_cardinality(P,T,B,0,WF). ; but empty_set / not_exists optimisation not triggered in closure_cardinality (yet); would avoid duplicate code |
| 919 | | is_empty_closure_wf(P,T,B,WF) :- |
| 920 | | is_lambda_value_domain_closure(P,T,B, DomainValue,_Expr),!, |
| 921 | | kernel_objects:empty_set_wf(DomainValue,WF). |
| 922 | | is_empty_closure_wf(P,T,B,WF) :- is_cartesian_product_closure_aux(P,T,B,A1,A2),!, |
| 923 | | very_approximate_cardinality(A1,C1,WF), |
| 924 | | very_approximate_cardinality(A2,C2,WF), |
| 925 | | blocking_safe_mul(C1,C2,0). |
| 926 | | is_empty_closure_wf(P,T,B,_WF) :- |
| 927 | | card_for_specific_closure2(P,T,B,CC,Code), |
| 928 | | !, |
| 929 | | call(Code),CC=0. |
| 930 | | is_empty_closure_wf(P,T,Body,WF) :- |
| 931 | | WF \== no_wf_available, % only do this if we have a WF store; see comments for closure_cardinality ; code relevant for test 1272; card({x|x:1..10 & x*x<i}) = 0 & i>1 |
| 932 | | \+ ground_bexpr(Body), % otherwise better to use not_test_exists below (e.g., Bosch v6 Codespeed benchmark) |
| 933 | | b_interpreter_check:reify_closure_with_small_cardinality(P,T,Body, WF, ReifiedList), |
| 934 | | !, |
| 935 | | domain(ReifiedList,0,1), |
| 936 | | sum(ReifiedList,'#=',0). |
| 937 | | is_empty_closure_wf(P,T,B,WF) :- |
| 938 | | get_recursive_identifier_of_closure_body(B,TRID),!, |
| 939 | | def_get_texpr_id(TRID,RID), |
| 940 | | gen_typed_ids(P,T,TypedParas), |
| 941 | | % now add Recursive ID's value to local state: |
| 942 | | b_interpreter:b_not_test_exists(TypedParas,B,[used_ids([RID])],[bind(RID,closure(P,T,B))],[],no_compile,WF). |
| 943 | | is_empty_closure_wf(P,T,B,WF) :- !, % try and check that not(#(P).(B)); i.e., there is no solution for the Body B; solves tests 1542, detecting that {x|x>100 & x mod 102 = 2} = {} is false |
| 944 | | gen_typed_ids(P,T,TypedParas), |
| 945 | | b_interpreter:b_not_test_exists(TypedParas,B,[used_ids([])],[],[],no_compile,WF). % used_ids are empty, as all variables already compiled into values |
| 946 | | |
| 947 | | % very_approximate_cardinality: only required to return 0 for empty set, and number or inf for non-empty set, tested in 1893 |
| 948 | | :- block very_approximate_cardinality(-,?,?). |
| 949 | | very_approximate_cardinality(avl_set(A),C,_) :- !, (A=empty -> print(empty_avl),nl,C=0 ; C=1). |
| 950 | | very_approximate_cardinality([],C,_) :- !, C=0. |
| 951 | | very_approximate_cardinality([_|_],C,_) :- !, C=1. |
| 952 | | very_approximate_cardinality(Set,C,WF) :- kernel_objects:cardinality_as_int_wf(Set,int(C),WF). |
| 953 | | % TO DO: maybe call is_empty_closure or similar for closures |
| 954 | | |
| 955 | | gen_typed_ids([],[],R) :- !, R=[]. |
| 956 | | gen_typed_ids([ID|IT],[Type|TT],[b(identifier(ID),Type,[])|TTT]) :- !, |
| 957 | | % TO DO: add Info field from outer set comprehension |
| 958 | | gen_typed_ids(IT,TT,TTT). |
| 959 | | gen_typed_ids(I,T,TI) :- add_internal_error('Call failed: ',gen_typed_ids(I,T,TI)),fail. |
| 960 | | |
| 961 | | % version with WF can also deal with closures via exists ! |
| 962 | | is_empty_explicit_set(global_set(GS)) :- !, b_empty_global_set(GS). |
| 963 | | is_empty_explicit_set(freetype(ID)) :- !, is_empty_freetype(ID). |
| 964 | | is_empty_explicit_set(avl_set(A)) :- !, |
| 965 | | (var(A) -> add_warning(is_empty_explicit_set,'Variable avl_set') |
| 966 | | ; empty_avl(A), add_warning(is_empty_explicit_set,'Empty avl_set') |
| 967 | | ). |
| 968 | | is_empty_explicit_set(C) :- card_for_specific_closure(C,CC,Code),!,call(Code),CC=0. |
| 969 | | is_empty_explicit_set(ES) :- expand_custom_set(ES,[],is_empty_explicit_set). |
| 970 | | |
| 971 | | |
| 972 | | is_non_empty_explicit_set(CS) :- is_non_empty_explicit_set_wf(CS,no_wf_available). |
| 973 | | |
| 974 | | is_non_empty_explicit_set_wf(global_set(GS),_WF) :- !, b_non_empty_global_set(GS). |
| 975 | | is_non_empty_explicit_set_wf(freetype(ID),_WF) :- !, is_non_empty_freetype(ID). |
| 976 | | is_non_empty_explicit_set_wf(avl_set(A),_WF) :- !, |
| 977 | | (empty_avl(A) -> print('### Warning: empty avl_set (2)'),nl,fail |
| 978 | | ; true). |
| 979 | | is_non_empty_explicit_set_wf(closure(P,T,B),WF) :- !, is_non_empty_closure_wf(P,T,B,WF). |
| 980 | | %is_non_empty_explicit_set_wf(ES,_WF) :- expand_custom_set(ES,[_|_],is_non_empty_explicit_set). |
| 981 | | |
| 982 | | |
| 983 | | % TO DO: this code is a bit redundant with is_empty_closure_wf |
| 984 | | is_non_empty_closure_wf(P,T,B,WF) :- |
| 985 | | is_lambda_value_domain_closure(P,T,B, DomainValue,_Expr),!, |
| 986 | | kernel_objects:not_empty_set_wf(DomainValue,WF). |
| 987 | | is_non_empty_closure_wf(P,T,B,WF) :- is_cartesian_product_closure_aux(P,T,B,A1,A2),!, |
| 988 | | very_approximate_cardinality(A1,C1,WF), |
| 989 | | very_approximate_cardinality(A2,C2,WF), |
| 990 | | blocking_safe_mul(C1,C2,CC),gt0(CC). |
| 991 | | is_non_empty_closure_wf(P,T,B,_WF) :- |
| 992 | | card_for_specific_closure2(P,T,B,CC,Code),!,call(Code),gt0(CC). |
| 993 | | % TO DO: reify_closure_with_small_cardinality |
| 994 | | is_non_empty_closure_wf(P,T,B,WF) :- WF \== no_wf_available, |
| 995 | ? | get_recursive_identifier_of_closure_body(B,TRID),!, |
| 996 | | def_get_texpr_id(TRID,RID), |
| 997 | | gen_typed_ids(P,T,TypedParas), |
| 998 | | % now add Recursive ID's value to local state: |
| 999 | | b_interpreter:b_test_exists(TypedParas,B,[used_ids([RID])],[bind(RID,closure(P,T,B))],[],WF). |
| 1000 | | is_non_empty_closure_wf(P,T,B,WF) :- WF \== no_wf_available, |
| 1001 | | % otherwise enumeration of test_exists will behave strangely; leading to enumeration warnings,... [TO DO: ensure we always have a WF or fix this below ?] |
| 1002 | | % try and check that not(#(P).(B)); i.e., there is no solution for the Body B; solves tests 1542; test 1146 also triggers this code |
| 1003 | | (debug_mode(off) -> true ; print(non_empty_closure_test(P)),nl, translate:print_bexpr(B),nl), |
| 1004 | | gen_typed_ids(P,T,TypedParas), |
| 1005 | | !, |
| 1006 | | b_interpreter:b_test_exists(TypedParas,B,[used_ids([])],[],[],WF). % used_ids are empty, as all variables already compiled into values |
| 1007 | | % some rules for set_subtraction, ... closures ?? if left part infinite and right part finite it must be infinite |
| 1008 | | is_non_empty_closure_wf(P,T,B,WF) :- |
| 1009 | | expand_custom_set_wf(closure(P,T,B),[_|_],is_non_empty_closure_wf,WF). |
| 1010 | | |
| 1011 | | |
| 1012 | | % TO DO: expand cart / reify and use for pf_test |
| 1013 | | test_empty_closure_wf(P,T,B,Res,WF) :- |
| 1014 | | is_lambda_value_domain_closure(P,T,B, DomainValue,_Expr),!, |
| 1015 | | kernel_equality:empty_set_test_wf(DomainValue,Res,WF). |
| 1016 | | %test_empty_closure_wf(P,T,B,WF) :- is_cartesian_product_closure_aux(P,T,B,A1,A2),!, |
| 1017 | | test_empty_closure_wf(P,T,B,Res,_WF) :- |
| 1018 | | card_for_specific_closure2(P,T,B,CC,Code),!,call(Code),leq0(CC,Res). |
| 1019 | | test_empty_closure_wf(P,T,B,Res,WF) :- |
| 1020 | | \+ is_memoization_closure(P,T,B,_MemoID), |
| 1021 | | preferences:preference(use_closure_expansion_memoization,false), |
| 1022 | | !, |
| 1023 | | bexpr_variables(B,ClosureWaitVars), |
| 1024 | | % this does not perform a few optimisations of expand_normal closure: |
| 1025 | | % memoization, stored_memo_expansion, is_closure1_value_closure, is_lambda_closure |
| 1026 | | % print(test_empty_closure_wf),nl, translate:print_bexpr(B),nl, |
| 1027 | | when((ground(ClosureWaitVars) ; nonvar(Res)), |
| 1028 | | test_empty_closure_wf2(P,T,B,Res,WF)). |
| 1029 | | test_empty_closure_wf(P,T,B,Res,WF) :- % print(expand_test(P)),nl, |
| 1030 | | % was expand_custom_set_wf(closure(P,T,B),ExpES,test_empty_closure_wf,WF), in turn calls expand_closure_to_list |
| 1031 | | expand_normal_closure(P,T,B,ExpES,_CDone,check(test_empty_closure_wf),WF), |
| 1032 | | kernel_equality:empty_set_test_wf(ExpES,Res,WF). |
| 1033 | | % /*@symbolic */ {x|x:1..100000000 & x mod 22=1} = x & (x={} <=> B=TRUE) |
| 1034 | | |
| 1035 | | test_empty_closure_wf2(P,T,B,Res,WF) :- |
| 1036 | | Res == pred_true,!, |
| 1037 | | is_empty_closure_wf(P,T,B,WF). |
| 1038 | | test_empty_closure_wf2(P,T,B,Res,WF) :- Res == pred_false,!, |
| 1039 | | is_non_empty_closure_wf(P,T,B,WF). |
| 1040 | | test_empty_closure_wf2(P,T,B,Res,WF) :- |
| 1041 | | (is_empty_closure_now(P,T,B,WF) % we need to force expansion here to be able to use local cut -> |
| 1042 | | % expand_normal_closure would now also expand the closure; |
| 1043 | | -> Res=pred_true |
| 1044 | | ; Res=pred_false). |
| 1045 | | |
| 1046 | | % check if closure now; ground everything except WFE |
| 1047 | | is_empty_closure_now(P,T,B,OuterWF) :- |
| 1048 | | create_inner_wait_flags(OuterWF,is_empty_closure_now,WF), |
| 1049 | | debug_opt_push_wait_flag_call_stack_info(WF, |
| 1050 | | external_call('Check if empty set',[closure(P,T,B)],unknown),WF2), |
| 1051 | | is_empty_closure_wf(P,T,B,WF2), |
| 1052 | | ground_inner_wait_flags(WF2). % does not ground WFE in case WD errors are pending |
| 1053 | | |
| 1054 | | :- block leq0(-,?). |
| 1055 | | leq0(inf,Res) :- !, Res=pred_false. |
| 1056 | | leq0(inf_overflow,Res) :- !, Res=pred_false. |
| 1057 | | leq0(CC,Res) :- (CC>0 -> Res=pred_false ; Res=pred_true). |
| 1058 | | |
| 1059 | | test_empty_explicit_set_wf(V,Res,_) :- var(V),!, |
| 1060 | | add_internal_error('Illegal call: ',test_empty_explicit_set(V,Res,_)),fail. |
| 1061 | | test_empty_explicit_set_wf(global_set(GS),Res,_WF) :- !, |
| 1062 | | (b_empty_global_set(GS) -> Res=pred_true ; Res=pred_false). |
| 1063 | | test_empty_explicit_set_wf(freetype(ID),Res,_WF) :- !, test_empty_freetype(ID,Res). |
| 1064 | | test_empty_explicit_set_wf(avl_set(A),Res,_WF) :- !, |
| 1065 | | (var(A) -> add_warning(test_empty_explicit_set_wf,'Variable avl_set'), Res=pred_true |
| 1066 | | ; empty_avl(A), add_warning(test_empty_explicit_set_wf,'Empty avl_set'), Res = pred_true |
| 1067 | | ; Res=pred_false). |
| 1068 | | test_empty_explicit_set_wf(closure(P,T,B),Res,WF) :- !, |
| 1069 | | test_empty_closure_wf(P,T,B,Res,WF). |
| 1070 | | test_empty_explicit_set_wf(ES,Res,WF) :- |
| 1071 | | expand_custom_set(ES,ExpES,test_empty_explicit_set), |
| 1072 | | kernel_equality:empty_set_test_wf(ExpES,Res,WF). |
| 1073 | | |
| 1074 | | :- block gt0(-). |
| 1075 | | gt0(CC) :- (CC=inf -> true ; CC=inf_overflow -> true ; CC>0). |
| 1076 | | |
| 1077 | | % a version to compute cardinality for |
| 1078 | | explicit_set_cardinality_for_wf(closure(P,T,B),Card) :- |
| 1079 | | (is_symbolic_closure_or_symbolic_mode(P,T,B) ; \+ ground_bexpr(B)), |
| 1080 | | !, |
| 1081 | | Card = inf. % assume card is infinite for WF computation; it may be finite! |
| 1082 | | %explicit_set_cardinality_for_wf(avl_set(AVL),Size) :- !, quick_avl_approximate_size(AVL,Size). |
| 1083 | | explicit_set_cardinality_for_wf(CS,Card) :- card_for_specific_custom_set(CS,Card,Code),!, |
| 1084 | | on_enumeration_warning(call(Code),Card=inf). % see test 1519 for relevance |
| 1085 | | explicit_set_cardinality_for_wf(_,inf). % assume card is infinite for WF computation; it may be finite! |
| 1086 | | % TO DO: maybe never expand closures here !? -> closure_cardinality can expand closure !!!!!! |
| 1087 | | %explicit_set_cardinality_for_wf(CS,Card) :- |
| 1088 | | % on_enumeration_warning( |
| 1089 | | % explicit_set_cardinality(CS,Card), |
| 1090 | | % (debug_println(assuming_inf_card_for_wf), % see test 1519 for relevance |
| 1091 | | % Card = inf)). % assume card is infinite for WF computation; it may be finite! |
| 1092 | | |
| 1093 | | explicit_set_cardinality(CS,Card) :- |
| 1094 | | % init_wait_flags(WF,[explicit_set_cardinality]), % there are a few checks for no_wf_available below |
| 1095 | | explicit_set_cardinality_wf(CS,Card,no_wf_available). |
| 1096 | | % ground_wait_flags(WF). |
| 1097 | | |
| 1098 | | explicit_set_cardinality_wf(global_set(GS),Card,_) :- !,b_global_set_cardinality(GS,Card). |
| 1099 | | explicit_set_cardinality_wf(freetype(GS),Card,_WF) :- !, freetype_cardinality(GS,Card). |
| 1100 | | explicit_set_cardinality_wf(avl_set(S),Card,_WF) :- !,avl_size(S,Card). |
| 1101 | ? | explicit_set_cardinality_wf(closure(P,T,B),Card,WF) :- closure_cardinality(P,T,B,Card,WF). |
| 1102 | | |
| 1103 | | closure_cardinality(P,T,B,Card,WF) :- |
| 1104 | | is_lambda_value_domain_closure(P,T,B, DomainValue,_Expr),!, |
| 1105 | | kernel_objects:cardinality_as_int_wf(DomainValue,int(Card),WF). % always compute it; card_for_specific_closure will only compute it if it can be done efficiently |
| 1106 | | closure_cardinality(P,T,B,Card,WF) :- is_cartesian_product_closure_aux(P,T,B,A1,A2),!, |
| 1107 | | kernel_objects:cardinality_as_int_wf(A1,int(C1),WF), |
| 1108 | | kernel_objects:cardinality_as_int_wf(A2,int(C2),WF), |
| 1109 | | blocking_safe_mul(C1,C2,Card). |
| 1110 | | % TO DO: card_for_specific_closure2 calls is_lambda_value_domain_closure and is_cartesian_product_closure_aux again ! |
| 1111 | | closure_cardinality(P,T,B,Card,_WF) :- |
| 1112 | | card_for_specific_closure2(P,T,B,CC,Code), |
| 1113 | | !, |
| 1114 | | call(Code),Card=CC. |
| 1115 | | closure_cardinality(P,T,Body,Card,WF) :- |
| 1116 | | (WF == no_wf_available -> CBody=Body |
| 1117 | ? | ; b_compiler:b_compile(Body,P,[],[],CBody) |
| 1118 | | ), |
| 1119 | | % reify will work better if we used b_compiler:compile so that more sets can be detected as small |
| 1120 | | closure_cardinality2(P,T,CBody,Card,WF). |
| 1121 | | closure_cardinality2(P,T,Body,Card,WF) :- |
| 1122 | | WF \== no_wf_available, % only do this if we have a WF store |
| 1123 | ? | if(b_interpreter_check:reify_closure_with_small_cardinality(P,T,Body, WF, ReifiedList), |
| 1124 | | true, |
| 1125 | | (perfmessagecall(reify,reification_of_closure_for_card_failed(P),translate:print_bexpr(Body),Body),fail)), |
| 1126 | | !, |
| 1127 | | domain(ReifiedList,0,1), |
| 1128 | | sum(ReifiedList,'#=',Card), |
| 1129 | | % in this case we know card to be finite ! TO DO: ensure that check_finite propagates Card variable |
| 1130 | | debug_println(9,reified_cardinality_sum(ReifiedList,Card)). % fd_dom(Card,Dom),print(dom(Card,Dom)),nl. |
| 1131 | | % should we add a special check if Card=0 ? usually Card not instantiated at this point ! |
| 1132 | | %closure_cardinality(P,T,B,Card,WF) :- Card==0, %is_symbolic_closure(P,T,B), |
| 1133 | | % !, is_empty_closure_wf(P,T,B,WF). |
| 1134 | | closure_cardinality2(P,T,B,Card,WF) :- |
| 1135 | | % TO DO: bexpr_variables(ClosureBody,ClosureWaitVars) and wait until those are bound; if Card = 0 -> empty_set; we can try to reifiy again |
| 1136 | | expand_custom_set_wf(closure(P,T,B),Expansion,closure_cardinality,WF), |
| 1137 | | my_length(Expansion,0,Card). |
| 1138 | | |
| 1139 | | :- block my_length(-,?,?). |
| 1140 | | my_length([],A,A). |
| 1141 | | my_length([_|T],A,R) :- A1 is A+1, my_length(T,A1,R). |
| 1142 | | |
| 1143 | | % compute domain and range for specific relations; |
| 1144 | | % not the closure is total over the domain and surjective over the range |
| 1145 | | % WARNING: this should never enumerate on its own, it is often called with |
| 1146 | | % a cut straight after it; if some enumeration happens then only first solution |
| 1147 | | % will be pursued (e.g., cond_assign_eq_obj) |
| 1148 | | dom_range_for_specific_closure([],[],[],function(bijection),_WF). |
| 1149 | | dom_range_for_specific_closure(closure(P,T,Pred),Domain,Range,Functionality,WF) :- |
| 1150 | | dom_range_for_specific_closure2(P,T,Pred, Domain,Range,dom_and_range,Functionality,WF). |
| 1151 | | |
| 1152 | | dom_range_for_specific_closure2(Par,Typ,Body, Domain,Range,Required,Functionality,WF) :- |
| 1153 | | is_member_closure(Par,Typ,Body,TYPE,SET), |
| 1154 | | dom_range_for_member_closure(SET,TYPE,Domain,Range,Required,Functionality,WF),!. |
| 1155 | | dom_range_for_specific_closure2(Par,Typ,Body, DOMAIN,RANGE,_,Functionality,WF) :- |
| 1156 | | is_cartesian_product_closure_aux(Par,Typ,Body,SET1,SET2),!, |
| 1157 | | (singleton_set(SET2,_) % checks nonvar |
| 1158 | | -> Functionality = function(total) % function if card(SET2)=1 |
| 1159 | | ; Functionality=relation), |
| 1160 | | kernel_equality:empty_set_test_wf(SET1,EqRes1,WF), |
| 1161 | | cond_assign_eq_obj_wf(EqRes1,RANGE,[],SET2,WF), % if SET1=[] then Range=[] |
| 1162 | | kernel_equality:empty_set_test_wf(SET2,EqRes2,WF), |
| 1163 | | cond_assign_eq_obj_wf(EqRes2,DOMAIN,[],SET1,WF). %if SET2=[] then Domain=[] |
| 1164 | | dom_range_for_specific_closure2(Par,Typ,Body, DomainRange,DomainRange,_,function(bijection),_WF) :- |
| 1165 | | is_id_closure_over(Par,Typ,Body,DomainRange,_). |
| 1166 | | |
| 1167 | | |
| 1168 | | dom_range_for_member_closure(identity(b(value(SET1),ST1,_)),_SEQT,SET1,SET1,_,function(bijection),_) :- |
| 1169 | | is_set_type(ST1,_). /* _SEQT=id(T1) */ |
| 1170 | | dom_range_for_member_closure(closure(V),_SEQT,Domain,Range,Required,Functionality,WF) :- % closure1 transitive closure |
| 1171 | | % rx : A <-> B <=> closure1(rx) : A <-> B means we can simply remove closure1(.) wrapper |
| 1172 | | V = b(value(VAL),_,_), nonvar(VAL), |
| 1173 | | %write(peel_clos1_dom_range(Required)),nl, tools_printing:print_term_summary(closure(V)),nl, |
| 1174 | | (VAL = closure(P,T,B) |
| 1175 | | -> dom_range_for_specific_closure2(P,T,B,Domain,Range,Required,Functionality,WF) |
| 1176 | | ; Functionality = relation, % we do not know if this is going to be a function |
| 1177 | | (Required=domain_only -> true ; range_of_explicit_set_wf(VAL,Range,WF)), |
| 1178 | | (Required=range_only -> true ; domain_of_explicit_set_wf(VAL,Domain,WF)) |
| 1179 | | ). |
| 1180 | | |
| 1181 | | % not sure if we need this: memoized functions are infinite usually and range can never be computed anyway |
| 1182 | | %dom_range_for_member_closure(Expr,_,Domain,Range,Func) :- |
| 1183 | | % expand_memoize_stored_function_reference(Expr,ExpandedValue), |
| 1184 | | % dom_range_for_specific_closure(ExpandedValue,Domain,Range,Func,no_wf_available). |
| 1185 | | |
| 1186 | | :- block cond_assign_eq_obj_wf(-,?,?,?,?). |
| 1187 | | %cond_assign_eq_obj_wf(PTF,R,A,B,_) :- var(PTF), add_error(cond_assign_eq_obj,'block declaration bug warning: ',cond_assign_eq_obj(PTF,R,A,B)),fail. % comment in to detect if affected by block declaration bug |
| 1188 | | cond_assign_eq_obj_wf(pred_true,Res,A,_,WF) :- equal_object_wf(Res,A,cond_assign_eq_obj_wf_1,WF). |
| 1189 | | cond_assign_eq_obj_wf(pred_false,Res,_,B,WF) :- equal_object_wf(Res,B,cond_assign_eq_obj_wf_2,WF). |
| 1190 | | |
| 1191 | | is_cartesian_product_closure(closure(Par,Typ,Body),SET1,SET2) :- |
| 1192 | ? | is_cartesian_product_closure_aux(Par,Typ,Body,SET1,SET2). |
| 1193 | | is_cartesian_product_closure_aux(Par,Types,b(truth,pred,Info),SET1,SET2) :- Par=[_,_|_],!, |
| 1194 | | append(LPar,[RParID],Par), append(LTypes,[RType],Types), |
| 1195 | | construct_closure_if_necessary(LPar,LTypes,b(truth,pred,Info),SET1), |
| 1196 | | construct_closure_if_necessary([RParID],[RType],b(truth,pred,Info),SET2). |
| 1197 | | is_cartesian_product_closure_aux(Par,Types,Body,SET1,SET2) :- Par=[_,_|_],!, |
| 1198 | | append(LPar,[RParID],Par), append(LTypes,[RType],Types),!, |
| 1199 | | split_conjunct(Body,[RParID], RConjL, LPar, LConjL), |
| 1200 | | bsyntaxtree:conjunct_predicates(RConjL,RConj), bsyntaxtree:conjunct_predicates(LConjL,LConj), |
| 1201 | | construct_closure_if_necessary(LPar,LTypes,LConj,SET1), |
| 1202 | | construct_closure_if_necessary([RParID],[RType],RConj,SET2). |
| 1203 | | is_cartesian_product_closure_aux(Par,Typ,Body,SET1,SET2) :- |
| 1204 | | SET = cartesian_product(b(value(SET1),ST1,_), b(value(SET2),ST2,_)), |
| 1205 | | is_member_closure(Par,Typ,Body,couple(T1m,T2m),SET), |
| 1206 | | is_set_type(ST1,T1),unify_types_strict(T1,T1m), |
| 1207 | | is_set_type(ST2,T2),unify_types_strict(T2,T2m),!. |
| 1208 | | %is_cartesian_product_closure_aux([ID1,ID2],[T1,T2],FBody,SET1,SET2) :- % is this not redundant wrt split ?? |
| 1209 | | % % a closure of the form {ID1,ID2|ID1 : SET1 & ID2 : SET2} ; |
| 1210 | | % % can get generated when computing domain symbolically of lambda abstraction |
| 1211 | | % FBody = b(Body,pred,_), |
| 1212 | | % is_cartesian_product_body(Body,ID1,ID2,T1,T2,SET1,SET2). % ,print(cart_res(SET1,SET2)),nl. |
| 1213 | | |
| 1214 | | % try and split conjunct into two disjoint parts (for detecting cartesian products) |
| 1215 | | % on the specified variables |
| 1216 | | % fails if it cannot be done |
| 1217 | | split_conjunct(b(PRED,pred,Info),Vars1,C1,Vars2,C2) :- |
| 1218 | | split_conjunct_aux(PRED,Info,Vars1,C1,Vars2,C2). |
| 1219 | | split_conjunct_aux(truth,_Info,_Vars1,C1,_Vars2,C2) :- !,C1=[],C2=[]. |
| 1220 | | split_conjunct_aux(conjunct(A,B),_Info,Vars1,C1,Vars2,C2) :- !, % TO DO: use DCG |
| 1221 | | split_conjunct(B,Vars1,CB1,Vars2,CB2), !, % Note: conjunct_predicates will create inner conjunct in A and atomic Expression in B |
| 1222 | | split_conjunct(A,Vars1,CA1,Vars2,CA2),!, |
| 1223 | | append(CA1,CB1,C1), append(CA2,CB2,C2). |
| 1224 | | split_conjunct_aux(E,Info,Vars1,C1,_Vars2,C2) :- unique_id_comparison(E,ID),!, |
| 1225 | | (member(ID,Vars1) -> C1=[b(E,pred,Info)], C2=[] ; C1=[], C2=[b(E,pred,Info)]). |
| 1226 | | |
| 1227 | | unique_id_comparison(less(b(L,_,_),b(R,_,_)), ID) :- unique_id_comparison_aux(L,R,ID). |
| 1228 | | unique_id_comparison(less_equal(b(L,_,_),b(R,_,_)), ID) :- unique_id_comparison_aux(L,R,ID). |
| 1229 | | unique_id_comparison(greater(b(L,_,_),b(R,_,_)), ID) :- unique_id_comparison_aux(L,R,ID). |
| 1230 | | unique_id_comparison(greater_equal(b(L,_,_),b(R,_,_)), ID) :- unique_id_comparison_aux(L,R,ID). |
| 1231 | | unique_id_comparison(member(b(identifier(ID),_,_),b(V,_,_)), ID) :- explicit_value(V). |
| 1232 | | unique_id_comparison(subset(b(identifier(ID),_,_),b(V,_,_)), ID) :- explicit_value(V). |
| 1233 | | unique_id_comparison(equal(b(L,_,_),b(R,_,_)), ID) :- unique_id_comparison_aux(L,R,ID). % means we also detect something like %x.(x : INTEGER|0) as cartesian product |
| 1234 | | % what about not_equal |
| 1235 | | |
| 1236 | | unique_id_comparison_aux(identifier(ID),V,ID) :- !,explicit_value(V). |
| 1237 | | unique_id_comparison_aux(V,identifier(ID),ID) :- explicit_value(V). |
| 1238 | | |
| 1239 | | explicit_value(value(_)) :- !. |
| 1240 | | explicit_value(integer(_)) :- !. |
| 1241 | | explicit_value(unary_minus(TV)) :- !, explicit_tvalue(TV). |
| 1242 | | explicit_value(interval(TV1,TV2)) :- !, |
| 1243 | | explicit_tvalue(TV1), explicit_tvalue(TV2). |
| 1244 | | explicit_value(seq(B)) :- !, explicit_tvalue(B). % usually encoded as values by b_compile |
| 1245 | | explicit_value(seq1(B)) :- !, explicit_tvalue(B). |
| 1246 | | explicit_value(iseq(B)) :- !, explicit_tvalue(B). |
| 1247 | | explicit_value(iseq1(B)) :- !, explicit_tvalue(B). |
| 1248 | | explicit_value(struct(B)) :- !, explicit_tvalue(B). |
| 1249 | | explicit_value(rec(Fields)) :- !, |
| 1250 | | explicit_tfields(Fields). % triggered in test 2274, 2358, 1983, 2388, 2275, 2484 |
| 1251 | | explicit_value(fin_subset(A)) :- !, explicit_tvalue(A). |
| 1252 | | explicit_value(fin1_subset(A)) :- !, explicit_tvalue(A). |
| 1253 | | explicit_value(pow_subset(A)) :- !, explicit_tvalue(A). |
| 1254 | | explicit_value(pow1_subset(A)) :- !, explicit_tvalue(A). |
| 1255 | | explicit_value(cartesian_product(A,B)) :- !, explicit_tvalue(A),explicit_tvalue(B). |
| 1256 | | explicit_value(total_bijection(A,B)) :- !, explicit_tvalue(A),explicit_tvalue(B). % see test 1897 for cases below |
| 1257 | | explicit_value(total_injection(A,B)) :- !, explicit_tvalue(A),explicit_tvalue(B). |
| 1258 | | explicit_value(total_function(A,B)) :- !, explicit_tvalue(A),explicit_tvalue(B). |
| 1259 | | explicit_value(total_surjection(A,B)) :- !, explicit_tvalue(A),explicit_tvalue(B). |
| 1260 | | explicit_value(partial_function(A,B)) :- !, explicit_tvalue(A),explicit_tvalue(B). |
| 1261 | | explicit_value(partial_injection(A,B)) :- !, explicit_tvalue(A),explicit_tvalue(B). |
| 1262 | | explicit_value(partial_surjection(A,B)) :- !, explicit_tvalue(A),explicit_tvalue(B). |
| 1263 | | explicit_value(relations(A,B)) :- !, explicit_tvalue(A),explicit_tvalue(B). |
| 1264 | | explicit_value(total_relation(A,B)) :- !, explicit_tvalue(A),explicit_tvalue(B). |
| 1265 | | explicit_value(surjection_relation(A,B)) :- !, explicit_tvalue(A),explicit_tvalue(B). |
| 1266 | | explicit_value(total_surjection_relation(A,B)) :- !, explicit_tvalue(A),explicit_tvalue(B). |
| 1267 | | explicit_value(real_set) :- !. |
| 1268 | | explicit_value(string_set) :- !. |
| 1269 | | |
| 1270 | | explicit_tvalue(b(B,_,_)) :- !, explicit_value(B). |
| 1271 | | |
| 1272 | | explicit_tfields(V) :- var(V),!,fail. |
| 1273 | | explicit_tfields([]). |
| 1274 | | explicit_tfields([field(N,V)|T]) :- ground(N),explicit_tvalue(V),explicit_tfields(T). |
| 1275 | | |
| 1276 | | % conjunct_predicates([CA1,CB1],C1), |
| 1277 | | % conjunct_predicates([CA2,CB2],C2). |
| 1278 | | |
| 1279 | | /* ********* |
| 1280 | | is_cartesian_product_body(conjunct(A,B),ID1,ID2,_T1,_T2,SET1,SET2) :- !, |
| 1281 | | member_pred_value(A,CID1,CSET1), |
| 1282 | | member_pred_value(B,CID2,CSET2), |
| 1283 | | (ID1=CID1,ID2=CID2,SET1=CSET1,SET2=CSET2 ; ID1=CID2,ID2=CID1,SET1=CSET2,SET2=CSET1). |
| 1284 | | is_cartesian_product_body(A,ID1,ID2,T1,T2,SET1,SET2) :- |
| 1285 | | member_pred_value2(A,AID,ASET), |
| 1286 | | ( AID=ID1 -> SET1=ASET, construct_closure_if_necessary([ID2],[T2],b(truth,pred,[]),SET2) |
| 1287 | | ; AID=ID2 -> SET2=ASET, construct_closure_if_necessary([ID1],[T1],b(truth,pred,[]),SET1)). |
| 1288 | | |
| 1289 | | member_pred_value(b(B,pred,_), ID,VAL) :- print(member_pred_value2(B,ID,VAL)),nl, |
| 1290 | | member_pred_value2(B,ID,VAL). |
| 1291 | | member_pred_value2(member(b(identifier(ID),_CT1,_),b(value(VAL),_SCT1,_)), ID,VAL). %_SCT1 = set(CT1) |
| 1292 | | */ |
| 1293 | | |
| 1294 | | % check if we have POW(SET1) or SET1<->SET2 (equiv. to POW(SET1*SET2)) |
| 1295 | | is_full_powerset_or_relations_or_struct_closure(closure(Par,Typ,Body),SUBSETS) :- |
| 1296 | | %TYPE = set(T), |
| 1297 | | is_member_closure(Par,Typ,Body,TYPE,SET), |
| 1298 | | is_full_powset_aux(SET,TYPE,SUBSETS). |
| 1299 | | |
| 1300 | | :- use_module(library(lists),[maplist/3, maplist/4]). |
| 1301 | | is_full_powset_aux(pow_subset(b(value(SET1),set(T1),_)),set(T1),[SET1]). |
| 1302 | | is_full_powset_aux(relations(S1,S2),set(couple(T1,T2)),[SET1,SET2]) :- |
| 1303 | | S1 = b(value(SET1),set(T1),_), S2 = b(value(SET2),set(T2),_). |
| 1304 | | is_full_powset_aux(struct(b(value(rec(FIELDS)),record(_),_)),record(_),FieldValueSets) :- |
| 1305 | | maplist(get_field_val,FIELDS,FieldValueSets). |
| 1306 | | |
| 1307 | | get_field_val(field(_,Val),Val). |
| 1308 | | |
| 1309 | | %[field(duration,global_set('INTEGER')),field(rhythm,global_set('INTEGER')),field(slot,avl_set(...))] |
| 1310 | | |
| 1311 | | is_powerset_closure(closure(Par,Typ,Body),PType,Subset) :- |
| 1312 | | is_member_closure(Par,Typ,Body,TYPE,SET), |
| 1313 | | is_set_type(TYPE,T), |
| 1314 | | nonvar(SET), |
| 1315 | | is_powset_aux(SET,PType,b(VS,set(T),_)), % should never be seq(.) type |
| 1316 | | nonvar(VS), VS = value(Subset). %,print(powerset(Subset)),nl. |
| 1317 | | is_powset_aux(pow_subset(A),pow,A). |
| 1318 | | is_powset_aux(pow1_subset(A),pow1,A). |
| 1319 | | is_powset_aux(fin_subset(A),fin,A). |
| 1320 | | is_powset_aux(fin1_subset(A),fin1,A). |
| 1321 | | |
| 1322 | | % group together closures which can be treated like cartesian products in the sense that: |
| 1323 | | % Closure is empty if either Set1 or Set2 (could also be empty in other conditions though) |
| 1324 | | % Closure is subset of other Closure if same Constructor and both sets are subsets |
| 1325 | | /* is_cartesian_product_like_closure(Closure,Constructor,Set1,Set2) :- |
| 1326 | | is_cartesian_product_closure(Closure,S11,S12),!, |
| 1327 | | Constructor = cartesian_product,Set1=S11,Set2=S12. |
| 1328 | | is_cartesian_product_like_closure(closure(Par,Typ,Body),Constructor,Set1,Set2) :- |
| 1329 | | is_member_closure(Par,Typ,Body,TYPE,SET), |
| 1330 | | is_cart_like_relation(SET,Constructor,b(value(Set1),set(_T1),_), b(value(Set1),set(_T2),_)). |
| 1331 | | is_cart_like_relation(relations(A,B),relations,A,B). |
| 1332 | | is_cart_like_relation(partial_function(A,B),partial_function,A,B). |
| 1333 | | is_cart_like_relation(partial_injection(A,B),partial_injection,A,B). */ |
| 1334 | | |
| 1335 | | % (closure([_zzzz_unary],[set(couple(integer,string))],b(member(b(identifier(_zzzz_unary),set(couple(integer,string)),[]),b(relations(b(value(global_set(INTEGER)),set(integer),[]),b(value(global_set(STRING)),set(string),[])),set(set(couple(integer,string))),[])),pred,[]))) |
| 1336 | | % 1 1 Fail: custom_explicit_sets:is_powset_aux(relations(b(value(global_set('INTEGER')),set(integer),[]),b(value(global_set('STRING')),set(string),[])),couple(integer,string),_19584) ? |
| 1337 | | |
| 1338 | | % card_for_specific_custom_set(+Set,-Cardinality,-CodeToComputeCardinality) |
| 1339 | | % succeeds if card can be computed efficiently |
| 1340 | | card_for_specific_custom_set(CS,C,Cd) :- var(CS),!, |
| 1341 | | add_internal_error('Internal error: var ',card_for_specific_custom_set(CS,C,Cd)),fail. |
| 1342 | | card_for_specific_custom_set(global_set(GS),Card,true) :- !, b_global_set_cardinality(GS,Card). |
| 1343 | | card_for_specific_custom_set(freetype(Id),Card,true) :- !, freetype_cardinality(Id,Card). |
| 1344 | | card_for_specific_custom_set(avl_set(S),Card,true) :- !,avl_size(S,Card). |
| 1345 | | card_for_specific_custom_set(closure(P,T,B),Card,CodeToComputeCard) :- |
| 1346 | | card_for_specific_closure3(_,P,T,B,Card,CodeToComputeCard). |
| 1347 | | |
| 1348 | | card_for_specific_closure(closure(P,T,Pred),Card,CodeToComputeCard) :- |
| 1349 | | card_for_specific_closure3(_ClosureKind,P,T,Pred,Card,CodeToComputeCard). |
| 1350 | | card_for_specific_closure(closure(P,T,Pred),ClosureKind,Card,CodeToComputeCard) :- |
| 1351 | | card_for_specific_closure3(ClosureKind,P,T,Pred,Card,CodeToComputeCard). |
| 1352 | | |
| 1353 | | :- use_module(bsyntaxtree,[is_truth/1]). |
| 1354 | | card_for_specific_closure2(Par,Typ,Body, Card,Code) :- |
| 1355 | | card_for_specific_closure3(_ClosureKind,Par,Typ,Body, Card,Code). |
| 1356 | | |
| 1357 | | % first argument for debugging purposes or filtering |
| 1358 | | card_for_specific_closure3(special_closure,Par,Typ,Body, Card,Code) :- |
| 1359 | | is_special_infinite_closure(Par,Typ,Body),!,Card=inf, Code=true. |
| 1360 | | card_for_specific_closure3(truth_closure,_,Types,Body,Card,Code) :- is_truth(Body),!, |
| 1361 | | % TO DO: also treat multiple parameters |
| 1362 | | couplise_list(Types,Type), |
| 1363 | | Code=kernel_objects:max_cardinality(Type,Card). |
| 1364 | | card_for_specific_closure3(interval_closure,Par,Typ,Body, Card,Code) :- |
| 1365 | ? | is_geq_leq_interval_closure(Par,Typ,Body,Low,Up), !, |
| 1366 | | card_of_interval_inf(Low,Up,Card), |
| 1367 | | Code=true. % should we return card_of_interval_inf as code ? |
| 1368 | | % TO DO: deal with non-infinite not_member_closures, prj1, prj2, id, ... |
| 1369 | | card_for_specific_closure3(lambda_closure,Par,Typ,Body, Card,Code) :- |
| 1370 | | is_lambda_value_domain_closure(Par,Typ,Body, DomainValue,_Expr),!, nonvar(DomainValue), |
| 1371 | | efficient_card_for_set(DomainValue,Card,Code). |
| 1372 | | card_for_specific_closure3(cartesian_product,Par,Typ,Body, Card,Code) :- |
| 1373 | | is_cartesian_product_closure_aux(Par,Typ,Body,A1,A2),!, nonvar(A1), nonvar(A2), |
| 1374 | | efficient_card_for_set(A1,Card1,Code1), |
| 1375 | | efficient_card_for_set(A2,Card2,Code2), |
| 1376 | | Code = (Code1,Code2, custom_explicit_sets:blocking_safe_mul(Card1,Card2,Card)). |
| 1377 | | card_for_specific_closure3(member_closure,Par,Typ,Body, Card,Code) :- |
| 1378 | | is_member_closure(Par,Typ,Body,TYPE,SET), |
| 1379 | | nonvar(SET),!, |
| 1380 | | card_for_member_closure(SET,TYPE,Card,Code). |
| 1381 | | % Note: _ExprInfo could have: contains_wd_condition, |
| 1382 | | % but if lambda is well-defined we compute the correct card ; if not then card is not well-defined anyway |
| 1383 | | % maybe we should check contains_wd_condition produce a warning msg ? |
| 1384 | | |
| 1385 | | % inner values can sometimes be a list, e.g., [pred_true,pred_false] for BOOL |
| 1386 | | efficient_card_for_set(VAR,_,_) :- var(VAR),!,fail. |
| 1387 | | efficient_card_for_set([],Card,Code) :- !, Card=0,Code=true. |
| 1388 | | efficient_card_for_set([_|T],Card,Code) :- known_length(T,1,C), !, Card = C, Code=true. |
| 1389 | | efficient_card_for_set(CS,Card,Code) :- card_for_specific_custom_set(CS,Card,Code). |
| 1390 | | known_length(X,_,_) :- var(X),!,fail. |
| 1391 | | known_length([],A,A). |
| 1392 | | known_length([_|T],A,R) :- A1 is A+1, known_length(T,A1,R). |
| 1393 | | known_length(avl_set(S),Acc,Res) :- avl_size(S,Card), |
| 1394 | | Res is Acc+Card. |
| 1395 | | % TO DO: also support closures |
| 1396 | | |
| 1397 | | card_for_member_closure(parallel_product(b(value(A1),ST1,_),b(value(A2),ST1,_)),_T,Card,CodeToComputeCard) :- !, |
| 1398 | | nonvar(A1), nonvar(A2), |
| 1399 | | efficient_card_for_set(A1,Card1,Code1), |
| 1400 | | CodeToComputeCard = (Code1,Code2, custom_explicit_sets:blocking_safe_mul(Card1,Card2,Card)), |
| 1401 | | % cardinality computed like for cartesian_product. |
| 1402 | | efficient_card_for_set(A2,Card2,Code2). |
| 1403 | | card_for_member_closure(seq(b(Value,ST1,_)),_SEQT,Card,CodeToComputeCard) :- !, /* _SEQT=seq(T1) */ |
| 1404 | | is_set_type(ST1,_T1), |
| 1405 | | get_cart_product_of_values(Value,ListOfSets), % accept a value or cartesian product of values |
| 1406 | | CodeToComputeCard = custom_explicit_sets:seq_card_of_cart_product(ListOfSets,1,Card). % Card is 1 or inf |
| 1407 | | card_for_member_closure(seq1(b(Value,ST1,_)),_SEQT,Card,CodeToComputeCard) :- !, /* _SEQT=seq1(T1) */ |
| 1408 | | is_set_type(ST1,_T1), |
| 1409 | | get_cart_product_of_values(Value,ListOfSets), % accept a value or cartesian product of values |
| 1410 | | CodeToComputeCard = custom_explicit_sets:seq_card_of_cart_product(ListOfSets,0,Card). % Card is 0 or inf |
| 1411 | | card_for_member_closure(perm(b(value(SET1),ST1,_)),_SEQT,Card,CodeToComputeCard) :- !, /* _SEQT=perm(T1) */ |
| 1412 | | is_set_type(ST1,_T1), |
| 1413 | | CodeToComputeCard = (kernel_objects:cardinality_as_int(SET1,int(SCard)), |
| 1414 | | custom_explicit_sets:blocking_factorial(SCard,Card)). |
| 1415 | | card_for_member_closure(iseq(b(value(SET1),ST1,_)),_SEQT,Card,CodeToComputeCard) :- !, /* _SEQT=iseq(T1) */ |
| 1416 | | is_set_type(ST1,_T1), |
| 1417 | | CodeToComputeCard = (kernel_objects:cardinality_as_int(SET1,int(SCard)), |
| 1418 | | kernel_card_arithmetic:blocking_nr_iseq(SCard,Card)). |
| 1419 | | card_for_member_closure(iseq1(b(value(SET1),ST1,_)),_SEQT,Card,CodeToComputeCard) :- !, /* _SEQT=iseq1(T1) */ |
| 1420 | | is_set_type(ST1,_T1), |
| 1421 | | CodeToComputeCard = (kernel_objects:cardinality_as_int(SET1,int(SCard)), |
| 1422 | | kernel_card_arithmetic:blocking_nr_iseq1(SCard,Card)). |
| 1423 | | card_for_member_closure(identity(b(value(SET1),ST1,_)),_SEQT,Card,CodeToComputeCard) :- !, /* _SEQT=id(T1) */ |
| 1424 | | is_set_type(ST1,_T1), |
| 1425 | | CodeToComputeCard = |
| 1426 | | kernel_objects:cardinality_as_int(SET1,int(Card)). |
| 1427 | | card_for_member_closure(struct(b(RecVal,record(_FieldSetTypes),_)), record(_FieldTypes), % set of records |
| 1428 | | Card,CodeToComputeCard) :- |
| 1429 | | !, |
| 1430 | | (RecVal=value(RECF), nonvar(RECF), RECF=rec(FIELDS) % value has been computed: |
| 1431 | | -> CodeToComputeCard = custom_explicit_sets:get_field_cardinality(FIELDS,Card) |
| 1432 | | ; RecVal = rec(TypedFields), % we still have a typed AST |
| 1433 | | maplist(get_field_val_type,TypedFields,Exprs,Types), |
| 1434 | | l_card_for_member_closure(Exprs,Types,Card, CodeToComputeCard) |
| 1435 | | ). |
| 1436 | | card_for_member_closure(value(Value), _Type, Card,CodeToComputeCard) :- !, |
| 1437 | | % we have a closure of the type {x|x:S}; equivalent to S |
| 1438 | | (nonvar(Value), |
| 1439 | | Value=closure(P,T,B) |
| 1440 | | -> % cardinality_as_int may expand it ! is bad if e.g. we called this code to check if a closure is infinite |
| 1441 | | card_for_specific_closure2(P,T,B,Card,CodeToComputeCard) % will not expand, but fail if cannot be computed |
| 1442 | | % TO DO: provide an argument: precise_or_efficient |
| 1443 | | ; CodeToComputeCard = kernel_objects:cardinality_as_int(Value,int(Card)) |
| 1444 | | ). |
| 1445 | | %card_for_member_closure(comprehension_set(TP,B), _Type, Card,CodeToComputeCard) :- !, % clause does not seem necessary |
| 1446 | | % split_names_and_types(TP,P,T), % what if Body reads variables; b_compile should have removed them?? |
| 1447 | | % card_for_specific_closure3(_ClosureKind,P,T,B,Card,CodeToComputeCard). |
| 1448 | | % now dealt with separately above: card_for_member_closure(cartesian_product(b(value(SET1),set(T1),_), b(value(SET2),set(T2),_)), |
| 1449 | | % couple(T1,T2), Card,CodeToComputeCard) :- !, |
| 1450 | | % CodeToComputeCard = |
| 1451 | | % (kernel_objects:cardinality_as_int(SET1,int(SCard1)), |
| 1452 | | % kernel_objects:cardinality_as_int(SET2,int(SCard2)), |
| 1453 | | % custom_explicit_sets:blocking_safe_mul(SCard1,SCard2,Card) ). |
| 1454 | | card_for_member_closure(POW,TYPE, Card,CodeToComputeCard) :- |
| 1455 | | (POW = pow_subset(b(value(SET),TYPE,_)) ; |
| 1456 | | POW = fin_subset(b(value(SET),TYPE,_))),!, |
| 1457 | | CodeToComputeCard = |
| 1458 | | (kernel_objects:cardinality_as_int(SET,int(SCard)), |
| 1459 | | custom_explicit_sets:blocking_safe_pow2(SCard,Card) |
| 1460 | | ). |
| 1461 | | card_for_member_closure(POW,TYPE, Card,CodeToComputeCard) :- |
| 1462 | | (POW = pow1_subset(b(value(SET),TYPE,_)) ; |
| 1463 | | POW = fin1_subset(b(value(SET),TYPE,_))),!, |
| 1464 | | CodeToComputeCard = |
| 1465 | | (kernel_objects:cardinality_as_int(SET,int(SCard)), |
| 1466 | | custom_explicit_sets:blocking_safe_pow2(SCard,C1), |
| 1467 | | custom_explicit_sets:safe_dec(C1,Card) |
| 1468 | | ). |
| 1469 | | card_for_member_closure(RELEXPR,SType, Card,CodeToComputeCard) :- |
| 1470 | | is_set_type(SType,couple(T1,T2)), |
| 1471 | | is_a_relation(RELEXPR, b(value(DOM),set(T1),_), |
| 1472 | | b(value(RAN),set(T2),_), DCard,RCard,Card,RELCODE),!, |
| 1473 | | CodeToComputeCard = |
| 1474 | | ( |
| 1475 | | kernel_objects:cardinality_as_int(DOM,int(DCard)), |
| 1476 | | kernel_objects:cardinality_as_int(RAN,int(RCard)), |
| 1477 | | custom_explicit_sets:call_card_for_relations(DCard,RCard,RELCODE) |
| 1478 | | ). |
| 1479 | | card_for_member_closure(BODY, integer, Card,CodeToComputeCard) :- |
| 1480 | | is_interval_with_integer_bounds(BODY,Low,Up),!, |
| 1481 | | CodeToComputeCard = custom_explicit_sets:card_of_interval_inf(Low,Up,Card). |
| 1482 | | %card_for_member_closure(BODY, Type, Card,CodeToComputeCard) :- print(try_card(BODY,Type)),nl,fail. |
| 1483 | | % TO DO: add maybe other common closures ? simple value closure |
| 1484 | | % also: what if subexpressions are not of value() type ? |
| 1485 | | |
| 1486 | | :- public call_card_for_relations/3. |
| 1487 | | :- block call_card_for_relations(-,?,?), call_card_for_relations(?,-,?). |
| 1488 | | call_card_for_relations(_,_,RELCODE) :- call(RELCODE). |
| 1489 | | |
| 1490 | | get_field_val_type(field(_F1,b(Expr1,Type1,_)),Expr1,Type1). |
| 1491 | | |
| 1492 | | l_card_for_member_closure([Expr1],[Type1],Card,CodeToComputeCard) :- !, |
| 1493 | | card_for_member_closure(Expr1,Type1,Card, CodeToComputeCard). |
| 1494 | | l_card_for_member_closure([Expr1|ET],[Type1|TT],Card,CodeToComputeCard) :- |
| 1495 | | CodeToComputeCard = (Code1,Code2, custom_explicit_sets:blocking_safe_mul(Card1,Card2,Card)), |
| 1496 | | card_for_member_closure(Expr1,Type1,Card1, Code1), |
| 1497 | | l_card_for_member_closure(ET,TT,Card2,Code2). |
| 1498 | | |
| 1499 | | :- public safe_dec/2. % used in card_for_member_closure |
| 1500 | | :- block safe_dec(-,?). |
| 1501 | | safe_dec(inf,R) :- !, R=inf. |
| 1502 | | safe_dec(inf_overflow,R) :- !, R=inf_overflow. |
| 1503 | | safe_dec(X,R) :- R is X-1. |
| 1504 | | |
| 1505 | | :- use_module(kernel_equality,[empty_set_test/2]). |
| 1506 | | :- public seq_card/3. % used in card_for_member_closure |
| 1507 | | :- block seq_card(-,?,?). |
| 1508 | | seq_card([],EmptyVal,R) :- !,R=EmptyVal. |
| 1509 | | seq_card([_|_],_,R) :- !,R=inf. |
| 1510 | | seq_card(X,EmptyVal,Res) :- empty_set_test(X,EqRes), |
| 1511 | | set_card_or_inf(EqRes,EmptyVal,Res). |
| 1512 | | |
| 1513 | | :- block set_card_or_inf(-,?,?). |
| 1514 | | set_card_or_inf(pred_true,Nr,Nr). |
| 1515 | | set_card_or_inf(pred_false,_,inf). |
| 1516 | | % card(seq({n|n>10 & (n mod 20=3 & n mod 20 = 4) })) |
| 1517 | | |
| 1518 | | % for list [S1,S2,...,Sn] of sets we compute |
| 1519 | | % cardinality of seq(1)( S1 ** S2 ... ** Sn) to be either 0/1 (if one set is empty) or inf (if all sets are non-empty) |
| 1520 | | :- public seq_card_of_cart_product/3. % used in card_for_member_closure |
| 1521 | | seq_card_of_cart_product([Set],EmptyCard,Res) :- !, |
| 1522 | | seq_card(Set,EmptyCard,Res). |
| 1523 | | seq_card_of_cart_product([Set1|T],EmptyCard,Res) :- |
| 1524 | | seq_card(Set1,EmptyCard,Res1), |
| 1525 | | (Res1==EmptyCard -> Res=Res1 |
| 1526 | | ; combine_card(Res1,Res2,Res), |
| 1527 | | seq_card_of_cart_product([Set1|T],EmptyCard,Res2) |
| 1528 | | ). |
| 1529 | | |
| 1530 | | % combine cardinalities of either 0/1 and inf |
| 1531 | | :- block combine_card(-,-,?). |
| 1532 | | combine_card(X,Y,R) :- X==inf,!,R=Y. |
| 1533 | | combine_card(X,Y,R) :- Y==inf,!,R=X. |
| 1534 | | combine_card(X,_,R) :- integer(X),!,R=X. |
| 1535 | | combine_card(_,R,R). |
| 1536 | | |
| 1537 | | get_cart_product_of_values(Value,ListOfSetValues) :- get_cart_product_of_values(Value,ListOfSetValues,[]). %write(get_cart(ListOfSetValues)),nl,nl. |
| 1538 | | % check if something is a value or a cartesian product of values |
| 1539 | | % the result will be used for emptyness check and should NOT be used to compute the cardinality |
| 1540 | | get_cart_product_of_values(value(SET)) --> !, [SET]. |
| 1541 | | get_cart_product_of_values(cartesian_product(A,B)) --> !, |
| 1542 | | tcart_product_of_values(A), tcart_product_of_values(B). |
| 1543 | | get_cart_product_of_values(pow_subset(_)) --> !, [ [] ]. % create some non-empty set; POW({}) is not empty |
| 1544 | | get_cart_product_of_values(fin_subset(_)) --> !, [ [] ]. % ditto |
| 1545 | | get_cart_product_of_values(seq(_)) --> !, [ [] ]. % ditto |
| 1546 | | get_cart_product_of_values(iseq(_)) --> !,[ [] ]. % ditto |
| 1547 | | get_cart_product_of_values(pow1_subset(A)) --> !, tcart_product_of_values(A). % POW1(S)={} <=> S={} |
| 1548 | | get_cart_product_of_values(fin1_subset(A)) --> !, tcart_product_of_values(A). % FIN1(S)={} <=> S={} |
| 1549 | | get_cart_product_of_values(seq1(A)) --> !, tcart_product_of_values(A). % seq1(S)={} <=> S={} |
| 1550 | | get_cart_product_of_values(iseq1(A)) --> !, tcart_product_of_values(A). % iseq1(S)={} <=> S={} |
| 1551 | | %get_cart_product_of_values(X) --> {functor(X,F,N), write(uncov_get_cart(F,N)),nl,fail}. |
| 1552 | | % TODO: records,relations,... |
| 1553 | | |
| 1554 | | tcart_product_of_values(b(E,_,_)) --> get_cart_product_of_values(E). |
| 1555 | | |
| 1556 | | |
| 1557 | | |
| 1558 | | :- public get_field_cardinality/2. % used in card_for_member_closure |
| 1559 | | get_field_cardinality([],1). |
| 1560 | | get_field_cardinality([field(_Name,Value)|T],ResCard) :- |
| 1561 | | kernel_objects:cardinality_as_int(Value,int(SCard1)), |
| 1562 | | get_field_cardinality(T,RestCard), blocking_safe_mul(SCard1,RestCard,ResCard). |
| 1563 | | |
| 1564 | | :- use_module(kernel_card_arithmetic). |
| 1565 | | |
| 1566 | | :- block blocking_safe_mul(-,-,?). |
| 1567 | | blocking_safe_mul(A,B,R) :- |
| 1568 | | ( A==0 -> R=0 |
| 1569 | | ; B==0 -> R=0 |
| 1570 | | ; A==1 -> R=B |
| 1571 | | ; B==1 -> R=A |
| 1572 | | ; blocking_safe_mul2(A,B,R) ). |
| 1573 | | |
| 1574 | | :- block blocking_safe_mul2(-,?,?), blocking_safe_mul2(?,-,?). |
| 1575 | | blocking_safe_mul2(A,B,Res) :- |
| 1576 | | (safe_mul(A,B,AB) -> Res=AB |
| 1577 | | ; add_warning(blocking_safe_mul2,'Call failed: ',blocking_safe_mul2(A,B,Res)), |
| 1578 | | % could happen for something like prj2(BOOL,NAT) = prj2(BOOL,0..n) |
| 1579 | | fail). |
| 1580 | | |
| 1581 | | :- public blocking_safe_pow2/2. % used in card_for_member_closure above |
| 1582 | | :- block blocking_safe_pow2(-,?). |
| 1583 | | blocking_safe_pow2(A,Res) :- |
| 1584 | | (safe_pow2(A,A2) -> Res=A2 |
| 1585 | | ; add_warning(blocking_safe_pow2,'Call failed: ',safe_pow2(A,Res)),fail). |
| 1586 | | |
| 1587 | | |
| 1588 | | |
| 1589 | | |
| 1590 | | :- assert_must_succeed((custom_explicit_sets:card_for_specific_closure2(['_zzzz_binary'],[integer], |
| 1591 | | b(member(b(identifier('_zzzz_binary'),integer,[generated]), |
| 1592 | | b(interval(b(value(int(1)),integer,[]),b(value(int(10)),integer,[])),set(integer),[])),pred,[]),R,C), |
| 1593 | | call(C), |
| 1594 | | R=10)). |
| 1595 | | |
| 1596 | | %! is_interval_closure_or_integerset(+I,-L,-U) |
| 1597 | | is_interval_closure_or_integerset(Var,_,_) :- var(Var),!,fail. |
| 1598 | | is_interval_closure_or_integerset(global_set(X),Low,Up) :- !, get_integer_set_interval(X,Low,Up). |
| 1599 | | is_interval_closure_or_integerset(Set,El,El) :- singleton_set(Set,ELX), |
| 1600 | | nonvar(ELX), ELX=int(El),!. % new, useful?? |
| 1601 | | is_interval_closure_or_integerset(closure(P,T,B),Low,Up) :- |
| 1602 | ? | (is_geq_leq_interval_closure(P,T,B,Low,Up) -> true ; is_interval_closure(P,T,B,Low,Up)). |
| 1603 | | |
| 1604 | | % with an additional argument to know if the set is finite or infinite: |
| 1605 | | is_interval_closure_or_integerset(Set,Low,Up,Finite) :- |
| 1606 | | is_interval_closure_or_integerset(Set,Low,Up), |
| 1607 | | % if we obtain Low, Up as variables then these must be finite numbers; they cannot stand for inf |
| 1608 | | (infinite_interval(Low,Up) -> Finite=infinite ; Finite=finite). |
| 1609 | | |
| 1610 | | |
| 1611 | | get_integer_set_interval('NAT',0,MAXINT) :- (preferences:preference(maxint,MAXINT)->true). |
| 1612 | | get_integer_set_interval('NAT1',1,MAXINT) :- (preferences:preference(maxint,MAXINT)->true). |
| 1613 | | get_integer_set_interval('INT',MININT,MAXINT) :- |
| 1614 | | ((preferences:preference(maxint,MAXINT),preferences:preference(minint,MININT))->true). |
| 1615 | | get_integer_set_interval('NATURAL',0,inf). |
| 1616 | | get_integer_set_interval('NATURAL1',1,inf). |
| 1617 | | get_integer_set_interval('INTEGER',minus_inf,inf). |
| 1618 | | % TO DO: add minus_inf to kernel_objects ! |
| 1619 | | |
| 1620 | | :- block geq_inf(-,?), geq_inf(?,-). |
| 1621 | | geq_inf(inf,_) :- !. |
| 1622 | | geq_inf(minus_inf,B) :- !, B=minus_inf. |
| 1623 | | geq_inf(_,minus_inf) :- !. |
| 1624 | | geq_inf(A,inf) :- !, A=inf. |
| 1625 | | geq_inf(inf_overflow,_) :- !. |
| 1626 | | geq_inf(A,inf_overflow) :- !, A=inf_overflow. |
| 1627 | | geq_inf(A,B) :- A >= B. |
| 1628 | | |
| 1629 | | :- block minimum_with_inf(-,-,?). |
| 1630 | | % in the first three cases we can determine outcome without knowing both args |
| 1631 | | minimum_with_inf(A,B,R) :- (A==minus_inf ; B==minus_inf),!,R=minus_inf. |
| 1632 | | minimum_with_inf(A,B,R) :- A==inf,!,R=B. |
| 1633 | | minimum_with_inf(A,B,R) :- B==inf,!,R=A. |
| 1634 | | minimum_with_inf(A,B,R) :- minimum_with_inf1(A,B,R), geq_inf(A,R), geq_inf(B,R). |
| 1635 | | :- block minimum_with_inf1(-,?,?), minimum_with_inf1(?,-,?). |
| 1636 | | minimum_with_inf1(minus_inf,_,R) :- !, R=minus_inf. |
| 1637 | | minimum_with_inf1(_,minus_inf,R) :- !, R=minus_inf. |
| 1638 | | minimum_with_inf1(inf,B,R) :- !, R=B. |
| 1639 | | minimum_with_inf1(A,inf,R) :- !, R=A. |
| 1640 | | minimum_with_inf1(inf_overflow,B,R) :- !, R=B. |
| 1641 | | minimum_with_inf1(A,inf_overflow,R) :- !, R=A. |
| 1642 | | minimum_with_inf1(A,B,R) :- (A<B -> R=A ; R=B). |
| 1643 | | |
| 1644 | | :- block maximum_with_inf(-,-,?). |
| 1645 | | % in the first three cases we can determine outcome without knowing both args |
| 1646 | | maximum_with_inf(A,B,R) :- (A==inf ; B==inf),!,R=inf. |
| 1647 | | maximum_with_inf(A,B,R) :- A==minus_inf,!,R=B. |
| 1648 | | maximum_with_inf(A,B,R) :- B==minus_inf,!,R=A. |
| 1649 | | maximum_with_inf(A,B,R) :- maximum_with_inf1(A,B,R), geq_inf(R,A), geq_inf(R,B). |
| 1650 | | :- block maximum_with_inf1(-,?,?), maximum_with_inf1(?,-,?). |
| 1651 | | maximum_with_inf1(inf,_,R) :- !, R=inf. |
| 1652 | | maximum_with_inf1(_,inf,R) :- !, R=inf. |
| 1653 | | maximum_with_inf1(minus_inf,B,R) :- !, R=B. |
| 1654 | | maximum_with_inf1(A,minus_inf,R) :- !, R=A. |
| 1655 | | maximum_with_inf1(inf_overflow,_,R) :- !, R=inf_overflow. |
| 1656 | | maximum_with_inf1(_,inf_overflow,R) :- !, R=inf_overflow. |
| 1657 | | maximum_with_inf1(A,B,R) :- (A>B -> R=A ; R=B). |
| 1658 | | |
| 1659 | | /* utilities for detecting interval closures */ |
| 1660 | | construct_interval_closure(Low,Up,Res) :- (Low==inf;Up==minus_inf),!,Res=[]. |
| 1661 | | construct_interval_closure(Low,Up,Res) :- number(Low),number(Up), Low>Up,!,Res=[]. |
| 1662 | | construct_interval_closure(Low,Up,Res) :- Up==inf,!, |
| 1663 | | ( Low==0 -> Res = global_set('NATURAL') |
| 1664 | | ; Low==1 -> Res = global_set('NATURAL1') |
| 1665 | | ; Low==minus_inf -> Res = global_set('INTEGER') |
| 1666 | | ; Low==inf -> Res = [] |
| 1667 | | ; construct_greater_equal_closure(Low,Res) |
| 1668 | | ). |
| 1669 | | construct_interval_closure(Low,Up,Res) :- Low==minus_inf,!, |
| 1670 | | construct_less_equal_closure(Up,Res). |
| 1671 | | construct_interval_closure(Low,Up,Res) :- Low==Up,!, |
| 1672 | | (number(Low) -> construct_one_element_custom_set(int(Low),Res) |
| 1673 | | ; Res = [int(Low)]). |
| 1674 | | construct_interval_closure(Low,Up,Res) :- |
| 1675 | | construct_interval_set(Low,Up,Set), |
| 1676 | | construct_member_closure('_zzzz_unary',integer,[],Set,Res). |
| 1677 | | |
| 1678 | | transform_global_sets_into_closure(closure(P,T,B),closure(P,T,B)). |
| 1679 | | transform_global_sets_into_closure(global_set(X),Res) :- |
| 1680 | | transform_global_set_into_closure_aux(X,Res). |
| 1681 | | transform_global_set_into_closure_aux('NATURAL',Res) :- |
| 1682 | | construct_greater_equal_closure(0,Res). |
| 1683 | | transform_global_set_into_closure_aux('NATURAL1',Res) :- |
| 1684 | | construct_greater_equal_closure(1,Res). |
| 1685 | | % TO DO: add INTEGER |
| 1686 | | |
| 1687 | | |
| 1688 | | |
| 1689 | | is_geq_leq_interval_closure([Par],[integer],b(Body,pred,Span),Low,Up) :- |
| 1690 | | (var(Par) |
| 1691 | | -> add_internal_error('Non-ground closure: ',closure([Par],[integer],b(Body,pred,Span))),fail |
| 1692 | ? | ; get_geq_leq_bounds(Body,Par,Low,Up)). |
| 1693 | | |
| 1694 | | infinite_interval(Low,Up) :- (Low==minus_inf -> true ; Up==inf). |
| 1695 | | |
| 1696 | | :- assert_must_succeed((card_of_interval_inf(1,10,10))). |
| 1697 | | :- assert_must_succeed((card_of_interval_inf(1,inf,R),R==inf)). |
| 1698 | | :- assert_must_succeed((card_of_interval_inf(_,inf,R),R==inf)). |
| 1699 | | :- assert_must_succeed((card_of_interval_inf(minus_inf,0,R),R==inf)). |
| 1700 | | :- assert_must_succeed((card_of_interval_inf(minus_inf,_,R),R==inf)). |
| 1701 | | :- assert_must_succeed((card_of_interval_inf(minus_inf,inf,R),R==inf)). |
| 1702 | | :- assert_must_succeed((card_of_interval_inf(2,2,R), R==1)). |
| 1703 | | :- assert_must_succeed((card_of_interval_inf(12,2,R), R==0)). |
| 1704 | | :- assert_must_succeed((card_of_interval_inf(2,B,10), B==11)). |
| 1705 | | :- assert_must_succeed((card_of_interval_inf(A,12,10), A==3)). |
| 1706 | | :- assert_must_succeed((card_of_interval_inf(A,12,0), A=222)). |
| 1707 | | :- assert_must_succeed((card_of_interval_inf(12,B,0), B=11)). |
| 1708 | | :- assert_must_fail((card_of_interval_inf(A,12,0), A=12)). |
| 1709 | | % compute cardinality of interval; allow bounds to be inf and minus_inf (but if so, they must be bound straightaway) |
| 1710 | | card_of_interval_inf(A,B,Card) :- |
| 1711 | ? | at_least_two_vars(A,B,Card), % initially this will usually be true, if only one variable we can compute result |
| 1712 | | preferences:preference(use_clpfd_solver,true), |
| 1713 | | !, |
| 1714 | | clpfd_interface:post_constraint(Card #= max(0,1+B-A),custom_explicit_sets:block_card_of_interval_inf(A,B,Card)). |
| 1715 | | card_of_interval_inf(A,B,Card) :- A==minus_inf,!, |
| 1716 | | (B==minus_inf -> add_internal_error('Illegal call: ',card_of_interval_inf(A,B,Card)) ; true), |
| 1717 | | Card=inf. |
| 1718 | | card_of_interval_inf(A,B,Card) :- B==inf,!, |
| 1719 | | (A==inf -> add_internal_error('Illegal call: ',card_of_interval_inf(A,B,Card)) ; true), |
| 1720 | | Card=inf. |
| 1721 | | card_of_interval_inf(A,B,Card) :- block_card_of_interval_inf(A,B,Card). |
| 1722 | | |
| 1723 | ? | at_least_two_vars(A,B,C) :- var(A),!,(var(B) -> not_infinite_bound(C) ; number(B),var(C)). |
| 1724 | | at_least_two_vars(A,B,C) :- number(A), var(B),var(C). |
| 1725 | | not_infinite_bound(A) :- (var(A) ; number(A)). % inf can only appear immediately, not for variables |
| 1726 | | |
| 1727 | | :- block block_card_of_interval_inf(-,?,-),block_card_of_interval_inf(?,-,-). |
| 1728 | | block_card_of_interval_inf(A,_,Card) :- A==minus_inf,!, Card=inf. |
| 1729 | | block_card_of_interval_inf(_,B,Card) :- B==inf,!, Card=inf. |
| 1730 | | block_card_of_interval_inf(From,To,Card) :- number(From),number(To),!, |
| 1731 | | (From>To -> Card=0 ; Card is (To-From)+1). |
| 1732 | | block_card_of_interval_inf(A,B,C) :- number(C),!, number_card_of_interval_inf_aux(C,A,B). |
| 1733 | | block_card_of_interval_inf(A,B,C) :- C==inf,!, |
| 1734 | | % probably this should systematically fail; if A and B are not inf/minus_inf now they will never be |
| 1735 | | print(infinite_interval_requested(A,B,C)),nl, |
| 1736 | | when((nonvar(A),nonvar(B)), block_card_of_interval_inf(A,B,C)). |
| 1737 | | block_card_of_interval_inf(A,B,C) :- add_internal_error('Illegal call: ',card_of_interval_inf(A,B,C)). |
| 1738 | | :- use_module(inf_arith,[block_inf_greater/2]). |
| 1739 | | number_card_of_interval_inf_aux(0,A,B) :- !, % empty interval |
| 1740 | | % if A and B are variables then they will not become inf later ?? |
| 1741 | | % inf can only be set directly for sets such as {x|x>4} or NATURAL1 |
| 1742 | | (((var(A);number(A)),(var(B);number(B))) |
| 1743 | | % hence we can use ordinary comparison (with CLPFD) here |
| 1744 | | -> kernel_objects:less_than_direct(B,A) |
| 1745 | | % TO DO: we could do this even if both A and B are variables !! ex : {n,m|n..m = {} & m..100={} & 103..n={}} |
| 1746 | | ; block_inf_greater(A,B)). |
| 1747 | | %number_card_of_interval_inf_aux(Card,From,B) :- number(From),!, B is (From+Card)-1. |
| 1748 | | %number_card_of_interval_inf_aux(Card,A,To) :- number(To),!, A is 1+To-Card. |
| 1749 | | number_card_of_interval_inf_aux(Card,A,B) :- |
| 1750 | | Card>0, C1 is Card-1, |
| 1751 | | kernel_objects:int_minus(int(B),int(A),int(C1)). |
| 1752 | | |
| 1753 | | |
| 1754 | | get_geq_leq_bounds(conjunct(b(LEFT,pred,_),b(RIGHT,pred,_)), Par,Low,Up) :- |
| 1755 | ? | get_geq_leq_bounds(LEFT,Par,From1,To1), |
| 1756 | ? | get_geq_leq_bounds(RIGHT,Par,From2,To2), |
| 1757 | | intersect_intervals_with_inf(From1,To1,From2,To2,Low,Up). |
| 1758 | | get_geq_leq_bounds(member(b(identifier(Par),integer,_), |
| 1759 | | b(Value,set(integer),_)),Par,Low,Up) :- |
| 1760 | | get_value_bounds(Value,Low,Up). |
| 1761 | ? | get_geq_leq_bounds(greater_equal(b(A,_,_),b(B,_,_)),Par,Low,Up) :- get_bounds2(greater_equal,A,B,Par,Low,Up). |
| 1762 | ? | get_geq_leq_bounds( less_equal(b(A,_,_),b(B,_,_)),Par,Low,Up) :- get_bounds2(less_equal,A,B,Par,Low,Up). |
| 1763 | ? | get_geq_leq_bounds( greater(b(A,_,_),b(B,_,_)),Par,Low,Up) :- get_bounds2(greater,A,B,Par,Low,Up). |
| 1764 | | get_geq_leq_bounds( less(b(A,_,_),b(B,_,_)),Par,Low,Up) :- get_bounds2(less,A,B,Par,Low,Up). |
| 1765 | | |
| 1766 | | get_value_bounds(value(GS),Low,Up) :- is_interval_closure_or_integerset(GS,Low,Up). % recursive call |
| 1767 | | % nonvar(GS), GS=global_set(ISET), get_integer_set_interval(ISET,Low,Up). |
| 1768 | | get_value_bounds(interval(b(TLow,_,_),b(TUp,_,_)),Low,Up) :- |
| 1769 | | integer_value(TLow,Low), |
| 1770 | | integer_value(TUp,Up). |
| 1771 | | |
| 1772 | | get_bounds2(greater_equal,identifier(Par),V,Par,X,inf) :- integer_value(V,X). |
| 1773 | | get_bounds2(greater_equal,V,identifier(Par),Par,minus_inf,X) :- integer_value(V,X). |
| 1774 | | get_bounds2(less_equal,identifier(Par),V,Par,minus_inf,X) :- integer_value(V,X). |
| 1775 | | get_bounds2(less_equal,V,identifier(Par),Par,X,inf) :- integer_value(V,X). |
| 1776 | | get_bounds2(greater,identifier(Par),V,Par,X1,inf) :- integer_value(V,X), kernel_objects:int_plus(int(X),int(1),int(X1)). %, X1 is X+1. |
| 1777 | | get_bounds2(greater,V,identifier(Par),Par,minus_inf,X1) :- integer_value(V,X), kernel_objects:int_minus(int(X),int(1),int(X1)). %X1 is X-1. |
| 1778 | | get_bounds2(less,V,identifier(Par),Par,X1,inf) :- integer_value(V,X), kernel_objects:int_plus(int(X),int(1),int(X1)). %X1 is X+1. |
| 1779 | | get_bounds2(less,identifier(Par),V,Par,minus_inf,X1) :- integer_value(V,X), |
| 1780 | | kernel_objects:int_minus(int(X),int(1),int(X1)). %X1 is X-1. |
| 1781 | | % to do: add negation thereof ?? |
| 1782 | | |
| 1783 | | integer_value(V,_) :- var(V),!, print(var_integer_value(V)),nl,fail. |
| 1784 | | integer_value(integer(X),R) :- !, R=X. |
| 1785 | | integer_value(unary_minus(b(X,_,_)),R) :- !, integer_value(X,RM), |
| 1786 | | number(RM), % if RM is not a number we could setup CLPFD constraint ?! |
| 1787 | | R is -(RM). |
| 1788 | | integer_value(minus(b(X,_,_),b(Y,_,_)),R) :- !, % some AST compilation rules generate X-1, X+1 ... |
| 1789 | | integer_value(X,RMX), |
| 1790 | | integer_value(Y,RMY), |
| 1791 | | kernel_objects:int_minus(int(RMX),int(RMY),int(R)). |
| 1792 | | integer_value(plus(b(X,_,_),b(Y,_,_)),R) :- !, % some AST compilation rules generate X-1, X+1 ... |
| 1793 | | integer_value(X,RMX), |
| 1794 | | integer_value(Y,RMY), |
| 1795 | | kernel_objects:int_plus(int(RMX),int(RMY),int(R)). |
| 1796 | | integer_value(value(V),R) :- !, V=int(R). |
| 1797 | | |
| 1798 | | is_interval_closure(closure(Par,[integer],Pred),Low,Up) :- |
| 1799 | | is_interval_closure_aux(Par,Pred,Low,Up). |
| 1800 | | is_interval_closure(Par,[integer],Pred,Low,Up) :- |
| 1801 | | is_interval_closure_aux(Par,Pred,Low,Up). |
| 1802 | | is_interval_closure_aux(Par,Pred,Low,Up) :- |
| 1803 | | is_member_closure(Par,[integer],Pred,integer,Set), |
| 1804 | | is_interval_with_integer_bounds(Set,Low,Up). |
| 1805 | | %is_interval_closure(closure_x(Par,[integer],Pred,_),Low,Up) :- |
| 1806 | | % is_interval_closure(closure(Par,[integer],Pred),Low,Up). |
| 1807 | | |
| 1808 | | is_interval_closure_body(Body,ID,Low,Up) :- |
| 1809 | | is_member_closure([ID],[integer],Body,integer,Set),!, |
| 1810 | | is_interval_with_integer_bounds(Set,Low,Up). |
| 1811 | | is_interval_closure_body(Body,ID,Low,Up) :- |
| 1812 | ? | is_geq_leq_interval_closure([ID],[integer],Body,Low,Up), |
| 1813 | | number(Low), number(Up). |
| 1814 | | |
| 1815 | | :- use_module(bsyntaxtree,[get_texpr_info/2,get_texpr_id/2]). |
| 1816 | | % do a single check if we have interval, member or not-member closure, avoiding redundant checking |
| 1817 | | % TO DO: move this and related predicates to closures module ? |
| 1818 | | is_special_closure(_Ids,_Types,Pred,Result) :- |
| 1819 | | get_texpr_info(Pred,Info),memberchk(prob_annotation(recursive(RId)),Info),!, |
| 1820 | | Result = recursive_special_closure(RId). |
| 1821 | | is_special_closure(Ids,Types,Pred,Result) :- |
| 1822 | ? | is_memoization_closure(Ids,Types,Pred,MemoID),!, |
| 1823 | | Result = memoization_closure(MemoID). |
| 1824 | | is_special_closure([ID],[TYPE],b(PRED,_,_), Result) :- |
| 1825 | | ( closures:is_member_closure_aux(PRED, ID,TYPE,SET) -> |
| 1826 | | ( (TYPE=integer, is_interval_with_integer_bounds(SET,Low,Up)) -> |
| 1827 | | Result = interval(Low,Up) |
| 1828 | | ; Result = member_closure(ID,TYPE,SET)) |
| 1829 | | ; closures:is_not_member_closure_aux(PRED,ID,TYPE,SET) -> |
| 1830 | | Result = not_member_closure(ID,TYPE,SET) |
| 1831 | ? | ; (TYPE=integer,get_geq_leq_bounds(PRED,ID,Low,Up),number(Low), number(Up)) -> |
| 1832 | | Result = interval(Low,Up) |
| 1833 | | ). |
| 1834 | | |
| 1835 | | |
| 1836 | | construct_interval_set(Low,Up,Res) :- |
| 1837 | | Res = interval(b(value(int(Low)),integer,[]), |
| 1838 | | b(value(int(Up)), integer,[])). |
| 1839 | | is_interval_with_integer_bounds(X,L,U) :- var(X),!, |
| 1840 | | add_internal_error('var arg: ',is_interval_with_integer_bounds(X,L,U)),fail. |
| 1841 | | is_interval_with_integer_bounds(interval(b(TLOW,integer,_),b(TUP, integer,_)),Low,Up) :- |
| 1842 | | integer_value(TLOW,Low), integer_value(TUP,Up). |
| 1843 | | |
| 1844 | | |
| 1845 | | is_a_relation(relations(Domain,Range),Domain,Range,DCard,RCard,Card,Code) :- %% '<->' |
| 1846 | | Code = (kernel_card_arithmetic:safe_mul(DCard,RCard,Exp), kernel_card_arithmetic:safe_pow2(Exp,Card)). |
| 1847 | | is_a_relation(partial_function(Domain,Range),Domain,Range,DCard,RCard,Card,Code) :- %% '+->' |
| 1848 | | Code = (kernel_card_arithmetic:safe_add_card(RCard,1,R1),kernel_card_arithmetic:safe_pown(R1,DCard,Card)). |
| 1849 | | is_a_relation(total_function(Domain,Range),Domain,Range,DCard,RCard,Card,Code) :- %% '-->' |
| 1850 | | Code = (kernel_card_arithmetic:safe_pown(RCard,DCard,Card)). |
| 1851 | | is_a_relation(partial_bijection(Domain,Range),Domain,Range,DCard,RCard,Card,Code) :- %% '>+>>' |
| 1852 | | Code = (kernel_card_arithmetic:partial_bijection_card(DCard,RCard,Card)). |
| 1853 | | is_a_relation(total_bijection(Domain,Range),Domain,Range,DCard,RCard,Card,Code) :- %% '>->>' |
| 1854 | | Code = (kernel_card_arithmetic:total_bijection_card(DCard,RCard,Card)). |
| 1855 | | is_a_relation(total_injection(Domain,Range),Domain,Range,DCard,RCard,Card,Code) :- %% '>->' |
| 1856 | | Code = (kernel_card_arithmetic:blocking_factorial_k(RCard,DCard,Card)). |
| 1857 | | is_a_relation(partial_injection(Domain,Range),Domain,Range,DCard,RCard,Card,Code) :- %% '>+>' |
| 1858 | | Code = (kernel_card_arithmetic:partial_injection_card(DCard,RCard,Card)). |
| 1859 | | is_a_relation(total_surjection(Domain,Range),Domain,Range,DCard,RCard,Card,Code) :- %% '-->>' |
| 1860 | | Code = (kernel_card_arithmetic:total_surjection_card(DCard,RCard,Card)). |
| 1861 | | is_a_relation(partial_surjection(Domain,Range),Domain,Range,DCard,RCard,Card,Code) :- %% '+->>' |
| 1862 | | Code = (kernel_card_arithmetic:partial_surjection_card(DCard,RCard,Card)). |
| 1863 | | is_a_relation(total_relation(Domain,Range),Domain,Range,DCard,RCard,Card,Code) :- %% '<<->' |
| 1864 | | Code = (kernel_card_arithmetic:total_relation_card(DCard,RCard,Card)). |
| 1865 | | is_a_relation(surjection_relation(Domain,Range),Domain,Range,DCard,RCard,Card,Code) :- %% '<->>' |
| 1866 | | % just swap args: card(A<->>B) = card(B<<->A) |
| 1867 | | Code = (kernel_card_arithmetic:total_relation_card(RCard,DCard,Card)). |
| 1868 | | % TO DO: total_surjection_relation <<->> |
| 1869 | | |
| 1870 | | |
| 1871 | | |
| 1872 | | :- use_module(b_global_sets,[infinite_global_set/1]). |
| 1873 | | |
| 1874 | | :- block is_infinite_global_set(-,?). |
| 1875 | | is_infinite_global_set('NATURAL',integer). |
| 1876 | | is_infinite_global_set('NATURAL1',integer). |
| 1877 | | is_infinite_global_set('INTEGER',integer). |
| 1878 | | is_infinite_global_set('FLOAT',real). |
| 1879 | | is_infinite_global_set('REAL',real). |
| 1880 | | is_infinite_global_set('STRING',string). |
| 1881 | | is_infinite_global_set(G,global(G)) :- infinite_global_set(G). |
| 1882 | | |
| 1883 | | %is_finite_integer_global_set('NAT'). |
| 1884 | | %is_finite_integer_global_set('NAT1'). |
| 1885 | | %is_finite_integer_global_set('INT'). |
| 1886 | | |
| 1887 | | % detects (certain) infinite explict sets |
| 1888 | | is_infinite_explicit_set(X) :- var(X),!, add_internal_error(is_infinite_explicit_set,var(X)),fail. |
| 1889 | ? | is_infinite_explicit_set(global_set(X)) :- is_infinite_global_set(X,_). |
| 1890 | | is_infinite_explicit_set(freetype(X)) :- is_infinite_freetype(X). |
| 1891 | | is_infinite_explicit_set(closure(Par,T,Body)) :- is_infinite_closure(Par,T,Body). |
| 1892 | | |
| 1893 | | % detect some closure that we should definitely expand; even in SYMBOLIC mode or for ABSTRACT_CONSTANTS |
| 1894 | | definitely_expand_this_explicit_set(Var) :- var(Var),!,fail. |
| 1895 | | definitely_expand_this_explicit_set(closure(P,T,B)) :- |
| 1896 | | (B = b(Body,_,_), definitely_expand(Body,P) -> true |
| 1897 | | ; is_interval_closure(P,T,B,Low,Up), do_expand_interval(Low,Up)). |
| 1898 | | % some lambda functions have small domain, but are very complicated to compute (test 1078, 1376) |
| 1899 | | % hence the following is not sufficient: |
| 1900 | | % ;is_small_specific_custom_set(closure(P,T,B),100), print(exp(T)),nl,translate:print_bexpr(B),nl,fail). |
| 1901 | | |
| 1902 | | :- use_module(bsyntaxtree,[occurs_in_expr/2]). |
| 1903 | | definitely_expand(Body,_) :- avl_mem_construct(Body,_). |
| 1904 | | definitely_expand(exists(ExistsTIDs,Body),P) :- P = [ID], |
| 1905 | | % detect AVL projection expressions like {res|#y.(y:AVL & res=Expr(y))} % test 1101 |
| 1906 | | Body = b(conjunct(b(Mem,pred,_),Eq),pred,_), |
| 1907 | | Eq = b(equal(EqA,EqB),pred,_), |
| 1908 | | avl_mem_construct(Mem,LHS), |
| 1909 | | tlhs_uses_exists(LHS,ExistsTIDs,[]), |
| 1910 | | ( get_texpr_id(EqA,ID) -> \+ occurs_in_expr(ID,EqB) |
| 1911 | | ; get_texpr_id(EqB,ID) -> \+ occurs_in_expr(ID,EqA) ). % we assign to set compr. ID |
| 1912 | | % example where ID occurs in other expression: {v|#w.(w : (1 .. 10) & v = (v + w) - 2)}; test 2516 |
| 1913 | | |
| 1914 | | tlhs_uses_exists(b(E,_,_)) --> lhs_uses_exists(E). |
| 1915 | ? | lhs_uses_exists(identifier(EID),In,Out) :-!, select(TEID,In,Out), |
| 1916 | | get_texpr_id(TEID,EID),!. % TODO: we could allow using an identifier twice |
| 1917 | | lhs_uses_exists(value(V)) --> {nonvar(V), simple_value(V), ground_value(V)}. |
| 1918 | | lhs_uses_exists(couple(A,B)) --> tlhs_uses_exists(A), tlhs_uses_exists(B). |
| 1919 | | lhs_uses_exists(boolean_true) --> []. |
| 1920 | | lhs_uses_exists(boolean_false) --> []. |
| 1921 | | lhs_uses_exists(empty_set) --> []. |
| 1922 | | lhs_uses_exists(empty_sequence) --> []. |
| 1923 | | lhs_uses_exists(integer(_)) --> []. |
| 1924 | | lhs_uses_exists(real(_)) --> []. |
| 1925 | | lhs_uses_exists(string(_)) --> []. |
| 1926 | | |
| 1927 | | avl_mem_construct(member(LHS,RHS),LHS) :- RHS = b(value(V),_,_), nonvar(V), |
| 1928 | | (V=avl_set(_) -> true |
| 1929 | | ; is_interval_closure_or_integerset(V,L,U), integer(L), integer(U), U-L < 1000 |
| 1930 | | ). |
| 1931 | | |
| 1932 | | % dont_expand_this_explicit_set with default limit (20000) |
| 1933 | | dont_expand_this_explicit_set(closure(P,T,B)) :- !, |
| 1934 | | dont_expand_this_closure(P,T,B). |
| 1935 | | dont_expand_this_explicit_set(S) :- |
| 1936 | | is_infinite_or_very_large_explicit_set(S). |
| 1937 | | |
| 1938 | | % dont_expand_this_explicit_set with extra limit argument: |
| 1939 | | dont_expand_this_explicit_set(closure(P,T,B),Limit) :- !, dont_expand_this_closure(P,T,B,Limit). |
| 1940 | | dont_expand_this_explicit_set(S,_) :- is_infinite_or_very_large_explicit_set(S). |
| 1941 | | |
| 1942 | | % true if we have a closure / global_set that should not be expanded |
| 1943 | | % TO DO: we could detect finite (is_lambda_value_domain_closure) closures which contain infinite elements such as %p.(p : BOOL|%t.(t : NATURAL|t .. t + 7)) |
| 1944 | | dont_expand_symbolic_explicit_set(closure(P,T,B)) :- !, |
| 1945 | | dont_expand_this_closure(P,T,B). |
| 1946 | | dont_expand_symbolic_explicit_set(avl_set(_)) :- !, |
| 1947 | | fail. % already expanded |
| 1948 | | dont_expand_symbolic_explicit_set(S) :- |
| 1949 | | is_infinite_or_very_large_explicit_set(S). |
| 1950 | | |
| 1951 | | |
| 1952 | | dont_expand_this_closure(P,T,B) :- |
| 1953 | | get_preference(comprehension_set_symbolic_limit,Limit), % Default 20000 |
| 1954 | | dont_expand_this_closure(P,T,B,Limit). % % increase limit in Data valid mode? |
| 1955 | | |
| 1956 | | dont_expand_this_closure(_P,_T,b(_,_,INFO),_Limit) :- |
| 1957 | ? | member(prob_annotation(KIND),INFO), |
| 1958 | | (KIND = 'SYMBOLIC' -> ! % cf is_symbolic_closure in closures |
| 1959 | | ; KIND = 'FORCE' -> !, fail). % was wrapped in FORCE external_function |
| 1960 | | dont_expand_this_closure(P,T,B,_Limit) :- |
| 1961 | | is_interval_closure_or_integerset(closure(P,T,B),Low,Up), !, |
| 1962 | | % interval closures are quite efficient for certain manipulations |
| 1963 | | (number(Low), number(Up) |
| 1964 | | -> dont_expand_interval(Low,Up) |
| 1965 | | ; true % we have a closure with inf/minus_inf or variables as bounds; in both cases keep the closure |
| 1966 | | ). |
| 1967 | | dont_expand_this_closure(P,T,B,Limit) :- |
| 1968 | | is_infinite_or_very_large_closure(P,T,B,Limit). |
| 1969 | | %% TODO: also prevent expansion of things like ff = %x.(x:STRING & REGEX_MATCH(x,"[a-z]+")=TRUE|TRUE) |
| 1970 | | |
| 1971 | | % do not automatically expand these intervals |
| 1972 | | dont_expand_interval(Low,Up) :- |
| 1973 | | Up+1-Low > 100. % another magic constant ; which value to choose ?? |
| 1974 | | do_expand_interval(Low,Up) :- Up+1-Low =< 100. |
| 1975 | | |
| 1976 | | is_converted_lambda_closure(_P,_T,b(_,_,INFO)) :- |
| 1977 | ? | member(prob_annotation('LAMBDA'),INFO). |
| 1978 | | |
| 1979 | | is_symbolic_closure_or_symbolic_mode(P,T,B) :- |
| 1980 | ? | (is_symbolic_closure(P,T,B) -> true |
| 1981 | | ; preference(convert_comprehension_sets_into_closures,true) |
| 1982 | | % by default suppose closures should be dealt with symbolically |
| 1983 | | ). |
| 1984 | | /* |
| 1985 | | % check both LAMBDA + not RECURSIVE |
| 1986 | | is_converted_non_recursive_lambda_closure(_,_,b(_,_,INFO)) :- is_conv_lambda_nonrec(INFO). |
| 1987 | | is_conv_lambda_nonrec([prob_annotation(A)|T]) :- !, |
| 1988 | | (A='LAMBDA' -> \+ memberchk(prob_annotation('RECURSIVE'),T) |
| 1989 | | ; A\='RECURSIVE' -> is_conv_lambda_nonrec(T)). |
| 1990 | | is_conv_lambda_nonrec([_|T]) :- is_conv_lambda_nonrec(T). */ |
| 1991 | | |
| 1992 | | |
| 1993 | | |
| 1994 | | % a set that is so large that expanding it would probably cause problems |
| 1995 | | is_infinite_or_very_large_explicit_set(S) :- |
| 1996 | | get_preference(comprehension_set_symbolic_limit,Limit), % Default 20000 |
| 1997 | | is_infinite_or_very_large_explicit_set(S,Limit). % increase limit in Data valid mode? |
| 1998 | | |
| 1999 | | :- use_module(inf_arith,[infgreater/2]). |
| 2000 | | |
| 2001 | | is_infinite_or_very_large_explicit_set(X,_) :- var(X),!,print(var_is_infinite_check(X)),nl,fail. |
| 2002 | | is_infinite_or_very_large_explicit_set(closure(P,T,B),Limit) :- !, |
| 2003 | | % treat closure separately here; some special rules |
| 2004 | | is_infinite_or_very_large_closure(P,T,B,Limit). |
| 2005 | | is_infinite_or_very_large_explicit_set(avl_set(A),Limit) :- !, % we could compute log and use avl_height_less_than |
| 2006 | | quick_avl_approximate_size(A,Size), Size >= Limit. |
| 2007 | | is_infinite_or_very_large_explicit_set(X,Limit) :- % closures are checked above |
| 2008 | | explicit_set_cardinality(X,Card), |
| 2009 | | nonvar(Card),infgreater(Card,Limit). |
| 2010 | | |
| 2011 | | |
| 2012 | | is_very_large_or_symbolic_closure(P,T,B,Limit) :- |
| 2013 | ? | (is_symbolic_closure(P,T,B) -> true ; is_infinite_or_very_large_closure(P,T,B,Limit)). |
| 2014 | | :- use_module(bsyntaxtree,[is_a_disjunct/3]). |
| 2015 | | is_infinite_or_very_large_closure(P,T,B,Limit) :- |
| 2016 | | is_a_disjunct(B,D1,D2), % Assumption: there is no card_for_specific_closure code for disjuncts |
| 2017 | | !, |
| 2018 | | (is_infinite_or_very_large_closure(P,T,D1,Limit) -> true |
| 2019 | | ; is_infinite_or_very_large_closure(P,T,D2,Limit)). |
| 2020 | | is_infinite_or_very_large_closure(Par,T,Body,Limit) :- |
| 2021 | | is_closure1_value_closure(Par,T,Body,VAL),!, |
| 2022 | | nonvar(VAL), % it could still be large or infinite |
| 2023 | | (Limit>1 -> NLimit is Limit/2 ; NLimit = Limit), % reduce limit as closure1 usually blows up |
| 2024 | | is_infinite_or_very_large_explicit_set(VAL,NLimit). |
| 2025 | | is_infinite_or_very_large_closure(P,T,B,Limit) :- |
| 2026 | | card_for_specific_closure3(Kind,P,T,B,Card,Code), |
| 2027 | ? | on_enumeration_warning(call(Code), |
| 2028 | | (debug_println(9,cannot_expand_specific_closure_for_card(Kind,Limit)), |
| 2029 | | % see test 1519 for relevance |
| 2030 | | Card=inf)), % assume it is large |
| 2031 | | !, |
| 2032 | | nonvar(Card),infgreater(Card,Limit), |
| 2033 | | perfmessages_bexpr(symbolic_closure,['Cardinality ',Card,' greater than limit ',Limit,' for '],B). |
| 2034 | | |
| 2035 | | |
| 2036 | | is_infinite_or_symbolic_closure(P,T,B) :- |
| 2037 | ? | (is_symbolic_closure(P,T,B) -> true ; is_infinite_closure(P,T,B)). |
| 2038 | | is_infinite_closure(P,T,B) :- |
| 2039 | | is_a_disjunct(B,D1,D2), % Assumption: there is no card_for_specific_closure code for disjuncts |
| 2040 | | !, |
| 2041 | | (is_infinite_closure(P,T,D1) -> true ; is_infinite_closure(P,T,D2)). |
| 2042 | | is_infinite_closure(Par,T,Body) :- |
| 2043 | | is_closure1_value_closure(Par,T,Body,VAL),!, % TO DO: also check if closure1 is large this way |
| 2044 | | nonvar(VAL), % if var: it could still be infinite !! TO DO fix |
| 2045 | | is_infinite_explicit_set(VAL). |
| 2046 | | is_infinite_closure(Par,T,Body) :- |
| 2047 | | card_for_specific_closure(closure(Par,T,Body),Card,Code), |
| 2048 | ? | call(Code), % TO DO: catch enumeration exceptions (see is_infinite_or_very_large_closure above) |
| 2049 | | Card == inf. % TODO: instantiate inf before to avoid computing huge numbers |
| 2050 | | |
| 2051 | | |
| 2052 | | :- use_module(memoization,[compute_memo_hash/2, get_stored_memo_expansion/3, store_memo_expansion/3]). |
| 2053 | | /* transitive closure */ |
| 2054 | | closure1_for_explicit_set(avl_set(A),Res) :- |
| 2055 | | preferences:preference(use_closure_expansion_memoization,true),!, |
| 2056 | | compute_memo_hash(closure1_for_explicit_set(A),Hash), |
| 2057 | | (get_stored_memo_expansion(Hash,closure1_for_explicit_set(A),StoredResult) |
| 2058 | | -> Res = StoredResult |
| 2059 | | ; closure1_for_explicit_set_direct(avl_set(A),Result), |
| 2060 | | store_memo_expansion(Hash,closure1_for_explicit_set(A),Result), |
| 2061 | | Res = Result |
| 2062 | | ). |
| 2063 | | closure1_for_explicit_set(avl_set(A),Res) :- closure1_for_explicit_set_direct(avl_set(A),Res). |
| 2064 | | |
| 2065 | | % sometimes faster, but can also be considerably slower: |
| 2066 | | %:- use_module(extrasrc(avl_ugraphs),[avl_transitive_closure/2]). |
| 2067 | | %closure1_for_explicit_set_direct(avl_set(A),Res) :- |
| 2068 | | % avl_transitive_closure(A,TC), |
| 2069 | | % construct_avl_set(TC,Res). |
| 2070 | | closure1_for_explicit_set_direct(avl_set(A),Res) :- |
| 2071 | | avl_domain(A,AList), |
| 2072 | | iterate_closure(AList,A,A,IterationRes), |
| 2073 | | construct_avl_set(IterationRes,Res). |
| 2074 | | |
| 2075 | | /* transitive closure starting from some initial set */ |
| 2076 | | /* not sure if we should do this: |
| 2077 | | closure1_for_explicit_set_from(avl_set(A),StartFrom,Res) :- |
| 2078 | | preferences:preference(use_closure_expansion_memoization,true), |
| 2079 | | compute_memo_hash(closure1_for_explicit_set(A),Hash), |
| 2080 | | stored_expansion(Hash,closure1_for_explicit_set(A),StoredResult),!, |
| 2081 | | domain_restriction_explicit_set(StartFrom,StoredResult,Res). */ |
| 2082 | | % StartFrom can be avl_set(empty) |
| 2083 | | closure1_for_explicit_set_from(avl_set(A),StartFrom,Res) :- |
| 2084 | | avl_domain(A,AList), |
| 2085 | | filter_start_relation(AList,StartFrom,FAList), |
| 2086 | | (FAList = [] -> Res=[] |
| 2087 | | ; convert_to_avl(FAList,avl_set(Start)), |
| 2088 | | iterate_closure(FAList,A,Start,IterationRes), |
| 2089 | | construct_avl_set(IterationRes,Res)). |
| 2090 | | filter_start_relation([],_,[]). |
| 2091 | | filter_start_relation([(X,Y)|T],StartSet,Res) :- |
| 2092 | ? | (element_of_custom_set(X,StartSet) -> Res = [(X,Y)|RT] ; Res=RT), |
| 2093 | | filter_start_relation(T,StartSet,RT). |
| 2094 | | |
| 2095 | | iterate_closure([],_,Res,Res). |
| 2096 | | iterate_closure([(X,Y)|T],InitialRelation,Relation,Res) :- |
| 2097 | | %(Key = (X,Y) -> true ; add_error_and_fail(iterate_closure,'Not a relation element: ',Key)), |
| 2098 | | add_tuples(X,Y,InitialRelation,Relation,NewRelation,AddedTuples), |
| 2099 | | % better: do added tuples straight away ? |
| 2100 | | iterate_closure(T,InitialRelation,NewRelation,NewRelation2), |
| 2101 | | iterate_closure(AddedTuples,InitialRelation,NewRelation2,Res). |
| 2102 | | |
| 2103 | | add_tuples(X,Y,AVL,AVLClosureSoFar,Res,NewTuples) :- |
| 2104 | | findall((X,Z), (avl_fetch_pair(Y,AVL,Z), %ok instead of safe_avl_member((Y,Z),AVL),; Y in AVL form, Z var |
| 2105 | | %Y \= Z, % self-loops are already in initial AVLClosure, this will never add a new pair |
| 2106 | | % if we use AVLClosureSoFar instead of AVL: considerably slower |
| 2107 | | \+ avl_fetch((X,Z),AVLClosureSoFar)), NewTuples), |
| 2108 | | add_to_avl(NewTuples,AVLClosureSoFar,Res). |
| 2109 | | |
| 2110 | | :- use_module(bsyntaxtree,[create_negation/2]). |
| 2111 | | % SUBSET_OF <: |
| 2112 | | % subset_of_explicit_set: returns code to be executed if this subset check can be done in an optimized way |
| 2113 | | % TO DO: add strict_subset <<: + more cases, e.g., interval & avl_set, ... |
| 2114 | | % interval & interval already handled in check_subset_of_global_sets |
| 2115 | | subset_of_explicit_set(AVL,Closure,Code,_WF) :- nonvar(AVL),AVL=avl_set(A), |
| 2116 | | is_interval_closure_or_integerset(Closure,Low,Up),!, |
| 2117 | | Code=custom_explicit_sets:check_avl_in_interval(A,Low,Up). |
| 2118 | | subset_of_explicit_set(Closure,CS,Code,WF) :- nonvar(CS), is_custom_explicit_set(CS), |
| 2119 | | is_interval_closure_or_integerset(Closure,Low,Up),!, |
| 2120 | | Code=custom_explicit_sets:check_interval_in_custom_set(Low,Up,CS,WF). |
| 2121 | | subset_of_explicit_set(AVL1,AVL2,Code,_WF) :- |
| 2122 | | nonvar(AVL1),AVL1=avl_set(A1), nonvar(AVL2),AVL2=avl_set(A2),!, |
| 2123 | | Code = custom_explicit_sets:check_avl_subset(A1,A2). |
| 2124 | | subset_of_explicit_set(C1,AVL2,Code,_WF) :- nonvar(C1), |
| 2125 | | simple_finite_set(AVL2), |
| 2126 | | is_simple_infinite_set(C1),!, % infinite set cannot be subset of finite one |
| 2127 | | Code = fail. |
| 2128 | | subset_of_explicit_set(C1,C2,Code,WF) :- nonvar(C1), |
| 2129 | | is_cartesian_product_closure(C1,S11,S12),!, |
| 2130 | | ((S11==[] ; S12==[]) -> Code=true /* we always have a subset */ |
| 2131 | | ; is_definitely_not_empty(S11), |
| 2132 | | is_definitely_not_empty(S12), % only use optimisation if we know S11, S12 to be non-empty |
| 2133 | | nonvar(C2), is_cartesian_product_closure(C2,S21,S22), |
| 2134 | | Code = (kernel_objects:check_subset_of_wf(S11,S21,WF), |
| 2135 | | kernel_objects:check_subset_of_wf(S12,S22,WF) ) |
| 2136 | | ). |
| 2137 | | subset_of_explicit_set(Set1,Set2,Code,WF) :- |
| 2138 | | nonvar(Set2),is_cartesian_product_closure(Set2,S21,S22),!, |
| 2139 | | % TO DO: maybe don't do this if Set1 is avl_set ?? |
| 2140 | | debug_println(9,'Applying C <: S21*S22 <=> C : S21 <-> S22'), |
| 2141 | | Code = bsets_clp:relation_over_wf(Set1,S21,S22,WF). |
| 2142 | | subset_of_explicit_set(C1,C2,Code,WF) :- nonvar(C1), nonvar(C2), |
| 2143 | | is_powerset_closure(C1,Constructor1,Set1), |
| 2144 | | is_powerset_closure(C2,Constructor2,Set2), |
| 2145 | | subset_constructor(Constructor1,Constructor2,R), |
| 2146 | | !, |
| 2147 | | Code = (R=pred_true, kernel_objects:check_subset_of_wf(Set1,Set2,WF)). |
| 2148 | | subset_of_explicit_set(Set1,Set2,Code,WF) :- |
| 2149 | | AllowRegularClosure=false, |
| 2150 | | symbolic_subset_of_explicit_set(Set1,Set2,AllowRegularClosure,Code,WF). |
| 2151 | | |
| 2152 | | symbolic_subset_of_explicit_set(Set1,Set2,AllowRegularClosure,Code,WF) :- |
| 2153 | | %print_term_summary(subset(Set1,Set2)),nl, |
| 2154 | | get_subset_counter_example_closure(Set1,Set2,NewP,NewT,NewB,AllowRegularClosure,DefResult), |
| 2155 | | % {x|P1} <: {x|P2} <=> {x|P1 & not(P2)}={} |
| 2156 | | !, %translate:print_bexpr(NewB),nl, |
| 2157 | | (DefResult==definitely_non_empty -> Code = fail |
| 2158 | | ; clean_up(NewB,[],CNewB), % can be useful to apply remove_member_comprehension |
| 2159 | | Code = custom_explicit_sets:is_empty_closure_wf(NewP,NewT,CNewB,WF)). |
| 2160 | | |
| 2161 | | % get closure representing the counter examples to Set1 <: Set2: i.e. elements in Set1 and not in Set2 |
| 2162 | | % used for symbolic treatment of subset, not_subset and test_subset |
| 2163 | | % note: in case this fails subset_test1 will expand Set1 |
| 2164 | | % DefiniteResultFlag may return the information that the generated closure is definitely not empty |
| 2165 | | % AllowRegularClosure=false means it will only be applied for symbolic or infinite closures |
| 2166 | | get_subset_counter_example_closure(Set1,Set2,NewP,NewT,NewB,AllowRegularClosure,DefiniteResultFlag) :- |
| 2167 | | get_closure(Set1,P1,T1,B1), |
| 2168 | | get_subset_counter_aux(P1,T1,B1,Set2,NewP,NewT,NewB,AllowRegularClosure,DefiniteResultFlag). |
| 2169 | | |
| 2170 | | get_subset_counter_aux(P1,T1,B1,Set2,NewP,NewT,NewB,AllowRegularClosure,DefRes) :- |
| 2171 | | nonvar(Set2), is_definitely_finite(Set2), !, |
| 2172 | | create_couple_term(P1,T1,P1Couple), % can currently still fail for more than 2 args |
| 2173 | | (is_infinite_closure(P1,T1,B1) |
| 2174 | | -> DefRes=definitely_non_empty % there are definitely counter examples as Set2 is finite |
| 2175 | | ; AllowRegularClosure=true -> DefRes = unknown |
| 2176 | ? | ; is_symbolic_closure(P1,T1,B1) -> DefRes=unknown |
| 2177 | | ), |
| 2178 | | NewP=P1, NewT=T1, |
| 2179 | | % {x|P1} <: {a1,...} <=> {x|P1 & x /: {a1,...}}={} |
| 2180 | | get_texpr_type(P1Couple,CoupleType1), |
| 2181 | | VSet2 = b(value(Set2),set(CoupleType1),[]), |
| 2182 | | create_texpr(not_member(P1Couple,VSet2),pred,[],NegPred2), |
| 2183 | | conjunct_predicates([B1,NegPred2],NewB). |
| 2184 | | get_subset_counter_aux(P1,T1,B1,Set2,NewP,NewT,NewB,AllowRegularClosure,unknown) :- |
| 2185 | | get_closure(Set2,P2,T2,B2), |
| 2186 | | (AllowRegularClosure=true -> true |
| 2187 | | ; is_infinite_or_symbolic_closure(P1,T1,B1) -> true |
| 2188 | | % should we also allow ?? |
| 2189 | | % ; is_symbolic_closure(P2,T2,B2) |
| 2190 | | ), |
| 2191 | | % not necessary maybe as subset_test1 only expands Set1 |
| 2192 | | % {x|P1} <: {x|P2} <=> {x|P1 & not(P2)}={} |
| 2193 | | unify_closure_predicates(P1,T1,B1, P2,T2,B2 , NewP,NewT, NewB1,NewB2), |
| 2194 | | create_negation(NewB2,NegNewB2), |
| 2195 | | bsyntaxtree:conjunct_predicates([NewB1,NegNewB2],NewB). |
| 2196 | | |
| 2197 | | |
| 2198 | | % get_closure or infinite global set: |
| 2199 | | get_closure(V,_,_,_) :- var(V),!,fail. |
| 2200 | | get_closure(closure(P,T,B),P,T,B). |
| 2201 | | get_closure(global_set(G),P,T,B) :- is_infinite_global_set(G,Type),!, |
| 2202 | | ID = '_zzzz_unary', |
| 2203 | | TID = b(identifier(ID),Type,[]), |
| 2204 | | TSet = b(value(global_set(G)),set(Type),[]), |
| 2205 | | P = [ID], T=[Type], B= b(member(TID,TSet),pred,[prob_annotation('SYMBOLIC')]). |
| 2206 | | |
| 2207 | | |
| 2208 | | subset_constructor(X,X,R) :- !,R=pred_true. |
| 2209 | | subset_constructor(fin1,_,R) :- !,R=pred_true. |
| 2210 | | subset_constructor(fin,pow,R) :- !,R=pred_true. |
| 2211 | | subset_constructor(X,Y,R) :- strict_subset_constructor(X,Y),!,R=pred_true. |
| 2212 | | subset_constructor(X,Y,R) :- strict_subset_constructor(Y,X),!,R=pred_false. |
| 2213 | | % pow1,fin1 ; pow,fin ; and pow1,fin only ok if type infinite |
| 2214 | | strict_subset_constructor(pow1,pow). |
| 2215 | | strict_subset_constructor(fin1,fin). |
| 2216 | | |
| 2217 | | % more rules for <->, +->, ... |
| 2218 | | % what if same closure: then we also know it is a subset |
| 2219 | | |
| 2220 | | % to be completed: |
| 2221 | | % code that instantiates R to subset or not_subset, may have to delay |
| 2222 | | test_subset_of_explicit_set(Set1,_,_,_,_) :- var(Set1),!,fail. |
| 2223 | | test_subset_of_explicit_set(avl_set(A),Closure,R,WF,Code) :- |
| 2224 | | is_interval_closure_or_integerset(Closure,Low,Up),!, |
| 2225 | | Code=custom_explicit_sets:test_avl_in_interval(A,Low,Up,R,WF). |
| 2226 | | test_subset_of_explicit_set(_,Set2,_,_,_) :- var(Set2),!,fail. |
| 2227 | | test_subset_of_explicit_set(avl_set(A1),avl_set(A2),R,_WF,Code) :- |
| 2228 | | Code = (custom_explicit_sets:check_avl_subset(A1,A2) -> R=pred_true ; R=pred_false). |
| 2229 | | test_subset_of_explicit_set(global_set(G),Set2,R,_WF,Code) :- |
| 2230 | ? | is_infinite_global_set(G,_), % TODO: we could extend this to other infinite sets |
| 2231 | | is_definitely_finite(Set2), !, |
| 2232 | | Code =(R=pred_false). |
| 2233 | | test_subset_of_explicit_set(Set1,Set2,Res,WF,Code) :- |
| 2234 | | AllowRegular=false, |
| 2235 | | get_subset_counter_example_closure(Set1,Set2,NewP,NewT,NewB,AllowRegular,DefResult), |
| 2236 | | % {x|P1} <: {x|P2} <=> {x|P1 & not(P2)}={} |
| 2237 | | !, |
| 2238 | | (DefResult==definitely_non_empty -> Code = (Res=pred_false) |
| 2239 | | ; Code = custom_explicit_sets:test_empty_closure_wf(NewP,NewT,NewB,Res,WF) |
| 2240 | | ). |
| 2241 | | % TO DO: add is_cartesian_product_closure case |
| 2242 | | is_definitely_finite([]). |
| 2243 | | is_definitely_finite(avl_set(_)). |
| 2244 | | |
| 2245 | | :- use_module(kernel_equality,[test_interval_subset_wf/6]). |
| 2246 | | |
| 2247 | | :- public test_avl_in_interval/5. % used in test_subset_of_explicit_set |
| 2248 | | % see also check_avl_in_interval(A,Low,Up), check_avl_not_in_interval(A,Low,Up). |
| 2249 | | test_avl_in_interval(A,Low2,Up2,Res,WF) :- |
| 2250 | | avl_min(A,int(Min)), % not needed if Low2==minus_inf |
| 2251 | | avl_max(A,int(Max)), % not needed if Up2==inf |
| 2252 | | test_interval_subset_wf(Min,Max,Low2,Up2,Res,WF). |
| 2253 | | |
| 2254 | | % ---------------------- |
| 2255 | | |
| 2256 | | is_definitely_not_empty(X) :- nonvar(X), |
| 2257 | | (X=[_|_] -> true |
| 2258 | | ; is_custom_explicit_set(X), is_non_empty_explicit_set(X)). |
| 2259 | | |
| 2260 | | % check if defnitely not empty and provide a witness |
| 2261 | | is_definitely_not_empty_with_witness(X,El) :- nonvar(X), |
| 2262 | | get_witness_element(X,El). |
| 2263 | | get_witness_element([H|_],H). |
| 2264 | | get_witness_element(avl_set(node(H,_True,_,_,_)),H). |
| 2265 | | % TO DO: add global_set(GS),... |
| 2266 | | |
| 2267 | | check_avl_subset(A1,A2) :- avl_max(A1,Max1), avl_max(A2,Max2), |
| 2268 | | Max1@>Max2,!, % then A1 cannot be subset of A2 |
| 2269 | | fail. |
| 2270 | | check_avl_subset(A1,A2) :- |
| 2271 | | avl_min(A1,Cur1), avl_min(A2,Cur2), |
| 2272 | | check_avl_subset_loop(Cur1,A1,Cur2,A2). |
| 2273 | | check_avl_subset_loop(Cur1,AVL1,Cur2,AVL2) :- |
| 2274 | | (Cur1 @> Cur2 -> avl_next(Cur2,AVL2,NC2), check_avl_subset_loop(Cur1,AVL1,NC2,AVL2) |
| 2275 | | ; Cur1=Cur2 -> (avl_next(Cur1,AVL1,NC1) |
| 2276 | | -> avl_next(Cur2,AVL2,NC2), |
| 2277 | | check_avl_subset_loop(NC1,AVL1,NC2,AVL2) |
| 2278 | | ; true /* all objects of AVL1 inspected */) |
| 2279 | | ). |
| 2280 | | |
| 2281 | | % check A <: Low..Up |
| 2282 | | check_avl_in_interval(A,Low,Up) :- % does not have to delay: if we have minus_inf & inf they will be known straightaway |
| 2283 | | (Low==minus_inf -> true |
| 2284 | | ; avl_min(A,Min), kernel_objects:less_than_equal(int(Low),Min)), |
| 2285 | | (Up==inf -> true |
| 2286 | | ; avl_max(A,Max), kernel_objects:less_than_equal(Max,int(Up))). |
| 2287 | | |
| 2288 | | % some experiments: |
| 2289 | | % 1..x <: {1,2,3,5} & x>1 & !y.(y>x & y<10 => 1..y /<: {1,2,3,5}) |
| 2290 | | % {ss | ss <: 0..0 & ss /= {} & ss=0..max(ss)} |
| 2291 | | % {ss | ss <: 0..0 & ss /= {} & ss=min(ss)..max(ss)} // does not work yet |
| 2292 | | % x..x+1 <: {0,2,3,5} |
| 2293 | | % x..x+2 <: {0,2,3,5} // does not work yet |
| 2294 | | % r = {x|x:1..400 & x mod 3/=0} & res={v|v:0..1300 & v..v+1 <: r} |
| 2295 | | % check Low..Up <: Avl |
| 2296 | | |
| 2297 | | check_interval_in_custom_set(Low,Up,CS,WF) :- |
| 2298 | | Low \== minus_inf, |
| 2299 | | Up \== inf, |
| 2300 | | b_interpreter_check:check_arithmetic_operator('<=',Low,Up,LeqRes), |
| 2301 | | (var(LeqRes) -> get_binary_choice_wait_flag_exp_backoff(16,check_interval_in_custom_set,WF,WF2) ; true), |
| 2302 | ? | check_interval_in_custom_set_aux(LeqRes,Low,Up,CS,WF2). |
| 2303 | | |
| 2304 | | :- block check_interval_in_custom_set_aux(-,?,?,?,-). |
| 2305 | | check_interval_in_custom_set_aux(pred_true,Low,Up,CS,_WF2) :- |
| 2306 | ? | element_of_custom_set_wf(int(Low),CS,WF), |
| 2307 | ? | element_of_custom_set_wf(int(Up),CS,WF), |
| 2308 | ? | interval_in_avl_block(Low,Up,CS,WF). |
| 2309 | | check_interval_in_custom_set_aux(pred_false,_Low,_Up,_CS,_WF2). % Interval is empty; but infinitely many solutions for Low and Up exist in principle |
| 2310 | | |
| 2311 | | :- block interval_in_avl_block(-,?,?,?), interval_in_avl_block(?,-,?,?). |
| 2312 | | interval_in_avl_block(Low,Up,CS,WF) :- |
| 2313 | ? | Low1 is Low+1, interval_in_avl_loop(Low1,Up,CS,WF). |
| 2314 | | interval_in_avl_loop(Low,Up,_CS,_WF) :- Low>=Up,!. % Lower bound and upper bound already checked |
| 2315 | | interval_in_avl_loop(Low,Up,CS,WF) :- |
| 2316 | ? | element_of_custom_set_wf(int(Low),CS,WF), L1 is Low+1, |
| 2317 | ? | interval_in_avl_loop(L1,Up,CS,WF). |
| 2318 | | |
| 2319 | | |
| 2320 | | :- public not_check_avl_subset/2. % used in not_subset_of_explicit_set_aux |
| 2321 | | not_check_avl_subset(A1,A2) :- \+ check_avl_subset(A1,A2). |
| 2322 | | |
| 2323 | | not_subset_of_explicit_set(S1,S2,Code,WF) :- nonvar(S1), |
| 2324 | ? | not_subset_of_explicit_set_aux(S1,S2,Code,WF). |
| 2325 | | not_subset_of_explicit_set_aux(avl_set(A),Closure,Code,_WF) :- |
| 2326 | | is_interval_closure_or_integerset(Closure,Low,Up),!, |
| 2327 | | Code=custom_explicit_sets:check_avl_not_in_interval(A,Low,Up). |
| 2328 | | not_subset_of_explicit_set_aux(avl_set(A1),AVL2,Code,_WF) :- |
| 2329 | | nonvar(AVL2),AVL2=avl_set(A2), |
| 2330 | | Code = custom_explicit_sets:not_check_avl_subset(A1,A2). |
| 2331 | | not_subset_of_explicit_set_aux(CS,AVL,Code,_WF) :- |
| 2332 | ? | is_simple_infinite_set(CS), |
| 2333 | | % TO DO: provide code for interval/NAT/INT /<: AVL |
| 2334 | | simple_finite_set(AVL), |
| 2335 | | !, |
| 2336 | | Code = true. % G cannot be subset of finite set |
| 2337 | | not_subset_of_explicit_set_aux(C1,C2,Code,WF) :- is_cartesian_product_closure(C1,S11,S12), |
| 2338 | | ((S11==[] ; S12==[]) -> Code=fail /* we always have a subset */ |
| 2339 | | ; is_definitely_not_empty(S11), |
| 2340 | | is_definitely_not_empty(S12), % only use optimisation if we know S11, S12 to be non-empty |
| 2341 | | nonvar(C2), is_cartesian_product_closure(C2,S21,S22), |
| 2342 | | Code = (kernel_objects:not_both_subset_of(S11,S12, S21,S22, WF)) |
| 2343 | | ), !. |
| 2344 | | not_subset_of_explicit_set_aux(C1,C2,Code,WF) :- nonvar(C2), |
| 2345 | | is_powerset_closure(C1,Constructor1,Set1), |
| 2346 | | is_powerset_closure(C2,Constructor2,Set2), |
| 2347 | | subset_constructor(Constructor1,Constructor2,R),!, |
| 2348 | | Code = (R=pred_false -> true ; kernel_objects:not_subset_of_wf(Set1,Set2,WF)). |
| 2349 | | not_subset_of_explicit_set_aux(Set1,Set2,Code,WF) :- |
| 2350 | | AllowRegular=false, |
| 2351 | | get_subset_counter_example_closure(Set1,Set2,NewP,NewT,NewB,AllowRegular,DefResult), |
| 2352 | | % {x|P1} <: {x|P2} <=> {x|P1 & not(P2)}={} |
| 2353 | | !, |
| 2354 | | (DefResult==definitely_non_empty -> Code = true |
| 2355 | | ; Code = custom_explicit_sets:is_non_empty_closure_wf(NewP,NewT,NewB,WF) |
| 2356 | | ). |
| 2357 | | |
| 2358 | | |
| 2359 | | :- public check_avl_not_in_interval/3. % used in not_subset_of_explicit_set_aux |
| 2360 | | :- block check_avl_not_in_interval(?,-,?). % TO DO: use non-blocking version, minus_inf, and inf set directly |
| 2361 | | check_avl_not_in_interval(A,Low,Up) :- avl_min(A,int(Min)), |
| 2362 | | check_avl_not_in_interval4(Low,Up,A,Min). |
| 2363 | | |
| 2364 | | check_avl_not_in_interval4(Low,_Up,_A,Min) :- Low \== minus_inf, Min < Low,!. |
| 2365 | | check_avl_not_in_interval4(_Low,Up,A,_Min) :- |
| 2366 | | Up \== inf, avl_max(A,Max), |
| 2367 | | kernel_objects:less_than(int(Up),Max). % Up could still be a variable |
| 2368 | | |
| 2369 | | |
| 2370 | | % checks for simple infinite sets, without Cartesian Product, ... decomposition |
| 2371 | ? | is_simple_infinite_set(global_set(X)) :- !, is_infinite_global_set(X,_). |
| 2372 | | is_simple_infinite_set(CS) :- is_interval_closure_or_integerset(CS,Low,Up), infinite_interval(Low,Up). |
| 2373 | | |
| 2374 | | simple_finite_set(AVL) :- nonvar(AVL), (AVL=avl_set(_) -> true ; AVL = []). |
| 2375 | | |
| 2376 | | % IMAGE [.] |
| 2377 | | image_for_id_closure(closure(Par,Types,Body),Set,Res) :- |
| 2378 | | is_full_id_closure(Par,Types,Body),!, |
| 2379 | | Res=Set. |
| 2380 | | |
| 2381 | | image_for_explicit_set(closure(Par,Types,Body),Set,Res,WF) :- |
| 2382 | | image_for_closure(Par,Types,Body,Set,Res,WF). |
| 2383 | | image_for_explicit_set(avl_set(A),Set,Res,WF) :- nonvar(Set), |
| 2384 | | image_for_explicit_avl_set(A,Set,Res,WF). |
| 2385 | | |
| 2386 | | |
| 2387 | | image_for_closure(Par,Types,Body,Set,Res,_WF) :- |
| 2388 | | is_id_closure_over(Par,Types,Body,ID_Domain,Full),!, |
| 2389 | | (Full=true -> Res=Set ; kernel_objects:intersection(ID_Domain,Set,Res)). |
| 2390 | | % infinite function case dealt with in image1 in bsets_clp |
| 2391 | | % TO DO: other closure(); Maybe special case if Set is an interval ? |
| 2392 | | image_for_closure(Par,Types,Body,Set,Res,WF) :- |
| 2393 | | is_closure1_value_closure(Par,Types,Body,VAL), % TODO: also detect reflexive closure, iteration (iterate(rel,k)) |
| 2394 | | % compute closure1(VAL)[Set] |
| 2395 | | bsets_clp:image_for_closure1_wf(VAL,Set,Res,WF). |
| 2396 | | |
| 2397 | | is_closure1_value_closure(Par,Types,Body,VAL) :- |
| 2398 | | is_member_closure(Par,Types,Body,couple(A,A),MemSET), nonvar(MemSET), |
| 2399 | | MemSET = closure(V), % this is the closure1 B operator ! |
| 2400 | | nonvar(V), V=b(value(VAL),_,_). |
| 2401 | | |
| 2402 | | image_for_explicit_avl_set(A,Set,Res,_WF) :- % Set is nonvar |
| 2403 | | is_interval_closure_or_integerset(Set,From1,To1),!, |
| 2404 | | % Note: if From1, To1 not yet known we will block and not revert to other image calculation code |
| 2405 | | % Important e.g. for performance of San Juan (AdaptedBModelPropCheck/acs_as_env_cfg_ipart.mch) |
| 2406 | | %we used to check for: ground(From1),ground(To1), |
| 2407 | | interval_image_for_explicit_avl_set(From1,To1,A,Set,Res). |
| 2408 | | image_for_explicit_avl_set(A,Set,Res,WF) :- |
| 2409 | | \+ bsets_clp:keep_symbolic(Set), % in this case we fall back to treatment in bsets_clp (image1) |
| 2410 | | expand_custom_set_to_list_gg(Set,ESet,GG,image_for_explicit_avl_set), |
| 2411 | | empty_avl(Empty), |
| 2412 | | (GG=guaranteed_ground -> image_explicit_ground(ESet,A,Empty,Res,WF) |
| 2413 | | ; image_explicit(ESet,A,Empty,Res,WF)). |
| 2414 | | |
| 2415 | | :- block interval_image_for_explicit_avl_set(-,?,?,?,?), |
| 2416 | | interval_image_for_explicit_avl_set(?,-,?,?,?). |
| 2417 | | interval_image_for_explicit_avl_set(From1,To1,_A,_Set,Res) :- |
| 2418 | | number(From1), number(To1), From1>To1,!, |
| 2419 | | kernel_objects:empty_set(Res). |
| 2420 | | interval_image_for_explicit_avl_set(From1,To1,A,_Set,Res) :- |
| 2421 | | findall(Image-true, avl_image_interval(From1,To1, A,Image),ImageList), |
| 2422 | | normalised_list_to_avl(ImageList,ImageAvl), |
| 2423 | ? | equal_object(ImageAvl,Res). |
| 2424 | | |
| 2425 | | |
| 2426 | | %! singleton_set(+Set,-Element). |
| 2427 | | singleton_set(X,_) :- var(X),!,fail. |
| 2428 | | singleton_set([H|T],R) :- T==[], R=H. |
| 2429 | | singleton_set(avl_set(node(Y,_,_,empty,empty)),Y). % same as is_one_element_custom_set |
| 2430 | | |
| 2431 | | is_one_element_custom_set(avl_set(node(Y,_,_,empty,empty)),Y). |
| 2432 | | is_one_element_avl(node(Y,_,_,empty,empty),Y). |
| 2433 | | |
| 2434 | | % requires El to be ground |
| 2435 | | construct_one_element_custom_set(El,avl_set(AVL)) :- |
| 2436 | | empty_avl(E),avl_store(El,E,true,AVL). |
| 2437 | | |
| 2438 | | construct_avl_set(Avl,Res) :- empty_avl(Avl) -> Res = [] ; Res = avl_set(Avl). |
| 2439 | | |
| 2440 | | :- block image_explicit(-,?,?,?,?). |
| 2441 | | image_explicit([],_,Acc,Res,WF) :- !, |
| 2442 | | construct_avl_set(Acc,AVLS), |
| 2443 | ? | kernel_objects:equal_object_wf(Res,AVLS,image_explicit,WF). |
| 2444 | | image_explicit([D1|T],AVLRelation,In,Out,WF) :- !, |
| 2445 | | ground_value_check(D1,G1), |
| 2446 | | ((var(T);T==[]) % TO DO: see below, make propagation also interesting in other circumstances |
| 2447 | | -> must_be_in_domain_check(G1,D1,T,AVLRelation,In,Out,WF) |
| 2448 | | ; true), |
| 2449 | | image_explicit_aux(G1,D1,AVLRelation,T,In,Out,WF). |
| 2450 | | image_explicit(Set,_,_,_,_) :- add_error_and_fail(image_explicit,'Unknown set: ',Set). |
| 2451 | | |
| 2452 | | % a version of image_explicit where the list is guaranteed to be ground |
| 2453 | | image_explicit_ground([],_,Acc,Res,WF) :- !, |
| 2454 | | construct_avl_set(Acc,AVLS), |
| 2455 | | kernel_objects:equal_object_wf(Res,AVLS,image_explicit,WF). |
| 2456 | | image_explicit_ground([D1|T],AVLRelation,In,Out,WF) :- !, |
| 2457 | | image_explicit_aux_ground(D1,AVLRelation,T,In,Out,WF). |
| 2458 | | image_explicit_ground(Set,_,_,_,_) :- add_error_and_fail(image_explicit_ground,'Unknown set: ',Set). |
| 2459 | | |
| 2460 | | :- block must_be_in_domain_check(-,?,?,?,?,-,?), |
| 2461 | | must_be_in_domain_check(-,?,-,?,?,?,?). |
| 2462 | | % if result requires at least one more element, then D must be in domain of Relation |
| 2463 | | % ensures that we get a domain for j in x = {1|->2,2|->4, 4|->8} & x[{j}]={8} |
| 2464 | | % we could even propagate using inverse of AVLRelation ?! |
| 2465 | | must_be_in_domain_check(GroundD,D,T,AVLRelation,In,Out,WF) :- |
| 2466 | | T==[], % apart from D, there are no more elements to be added |
| 2467 | | var(GroundD), % otherwise we already have a value for D |
| 2468 | | delta_witness(In,Out,Witness), % obtain at least one value that D must map to |
| 2469 | | !, |
| 2470 | | quick_propagation_element_information(avl_set(AVLRelation),(D,Witness),WF,_). % Witness avoids pending co-routines |
| 2471 | | % TO DO: we could check that *all* elements of Out have this value |
| 2472 | | % TO DO: below we could check that In is a subset of Out; e.g., for x = %i.(i:1..10|i+i) & x[{5,j,k}]={16,11}; we could also check that Out is subset of range of relation |
| 2473 | | must_be_in_domain_check(_,_D,_T,_,_In,_Out,_). % :- print(must_be(D,T,In,Out)),nl. |
| 2474 | | |
| 2475 | | % provide, if possible, a witness element in Out not in In |
| 2476 | | delta_witness(In,Out,_Witness) :- (var(In) ; var(Out)),!,fail. |
| 2477 | | %delta_witness(empty,Out,Witness) :- is_definitely_not_empty_with_witness(Out,Witness). |
| 2478 | | delta_witness(In,Out,Witness) :- |
| 2479 | | is_custom_explicit_set(Out,delta_witness), |
| 2480 | | difference_of_explicit_set(Out,avl_set(In),Diff), % could be expensive to compute !? delay ? print(delta(Diff)),nl, |
| 2481 | | is_definitely_not_empty_with_witness(Diff,Witness). |
| 2482 | | |
| 2483 | | |
| 2484 | | :- block image_explicit_aux(-,?,?, ?,?,?,?). % we know that D1 is ground |
| 2485 | | image_explicit_aux(_,D1,AVLRelation,T,In,Out,WF) :- |
| 2486 | | all_images(D1,AVLRelation,NewImages), % compute AVLRelation[{D1}] |
| 2487 | | add_to_avl(NewImages,In,In2), |
| 2488 | ? | image_explicit(T,AVLRelation,In2,Out,WF). |
| 2489 | | image_explicit_aux_ground(D1,AVLRelation,T,In,Out,WF) :- |
| 2490 | | all_images(D1,AVLRelation,NewImages), % compute AVLRelation[{D1}] |
| 2491 | | add_to_avl(NewImages,In,In2), |
| 2492 | | image_explicit_ground(T,AVLRelation,In2,Out,WF). |
| 2493 | | |
| 2494 | | all_images(From,AVLRelation,Images) :- |
| 2495 | | findall(AY,avl_member_pair_arg1_ground(From,AY,AVLRelation),Images). |
| 2496 | | % we know that From is ground and AY free variable |
| 2497 | | |
| 2498 | | |
| 2499 | | % compute relational composition ( ; ) if second arg is an AVL set |
| 2500 | | % TO DO: add support for infinite closures; avoid expanding them [currently handled by symbolic composition in bsets_clp] |
| 2501 | | rel_composition_for_explicit_set(Rel1,Rel2,Comp) :- nonvar(Rel2), |
| 2502 | | Rel2=avl_set(A2), % TO DO: see if we can maybe convert Rel2 to AVL ? |
| 2503 | | % \+ bsets_clp:keep_symbolic(Rel1), check already done in bsets |
| 2504 | | expand_custom_set_to_list_gg(Rel1,Relation1,GG,rel_composition_for_explicit_set), |
| 2505 | | empty_avl(In), |
| 2506 | | (GG=guaranteed_ground |
| 2507 | | -> rel_avl_compose2_ground(Relation1,A2,In,Comp) |
| 2508 | | ; rel_avl_compose2(Relation1,A2,In,Comp)). |
| 2509 | | |
| 2510 | | :- block rel_avl_compose2(-,?,?,?). |
| 2511 | | rel_avl_compose2([],_,In,Res) :- construct_avl_set(In,A), |
| 2512 | ? | equal_object(Res,A,rel_avl_compose2). % as we delay; we need to use equal_object at the end |
| 2513 | | rel_avl_compose2([(X,Y)|T],A2,In,Out) :- |
| 2514 | | when((ground(X),ground(Y)), |
| 2515 | | (all_image_pairs_ground(X,Y,A2,ImagePairs), |
| 2516 | | add_to_avl(ImagePairs,In,In2), |
| 2517 | | rel_avl_compose2(T,A2,In2,Out))). |
| 2518 | | |
| 2519 | | % a version where argument is guaranteed to be ground; no when-ground checks |
| 2520 | | rel_avl_compose2_ground([],_,In,Res) :- construct_avl_set(In,A), |
| 2521 | | equal_object(Res,A,rel_avl_compose2). % as we delay; we need to use equal_object at the end |
| 2522 | | rel_avl_compose2_ground([(X,Y)|T],A2,In,Out) :- |
| 2523 | | all_image_pairs_ground(X,Y,A2,ImagePairs), |
| 2524 | | add_to_avl(ImagePairs,In,In2), |
| 2525 | | rel_avl_compose2_ground(T,A2,In2,Out). |
| 2526 | | |
| 2527 | | all_image_pairs_ground(From,To,AVLRelation,ImagePairs) :- |
| 2528 | | findall((From,AY),avl_member_pair_arg1_ground(To,AY,AVLRelation),ImagePairs). |
| 2529 | | % To: already in AVL format; AY is variable -> we could use avl_fetch_pair directly : findall((From,AY),avl_fetch_pair(To,AVLRelation,AY),ImagePairs). |
| 2530 | | |
| 2531 | | /* succeeds if it can compute domain by some clever way */ |
| 2532 | | domain_of_explicit_set_wf(global_set(GS),_R,_) :- !, |
| 2533 | | add_error_and_fail(domain_of_explicit_set_wf,'Cannot compute domain of global set: ',GS). |
| 2534 | | domain_of_explicit_set_wf(freetype(GS),_R,_) :- !, |
| 2535 | | add_error_and_fail(domain_of_explicit_set_wf,'Cannot compute domain of freetype: ',GS). |
| 2536 | | domain_of_explicit_set_wf(avl_set(A),Res,_) :- !, |
| 2537 | | domain_of_avl_set(A,Res). |
| 2538 | | domain_of_explicit_set_wf(C,R,WF) :- dom_for_specific_closure(C,Dom,_,WF),!, |
| 2539 | | Dom=R. |
| 2540 | | domain_of_explicit_set_wf(C,R,_) :- |
| 2541 | ? | dom_symbolic(C,CC),!, |
| 2542 | | R=CC. |
| 2543 | | domain_of_explicit_set_wf(closure(P,T,B),Res,WF) :- |
| 2544 | | % does not seem to be reached, as dom_symbolic now seems to cover all cases |
| 2545 | | expand_custom_set_wf(closure(P,T,B),EC,domain_of_explicit_set,WF), |
| 2546 | | domain_of_list_blocking(EC,R), |
| 2547 | | normalised_list_to_avl_when_ground(R,Res). |
| 2548 | | |
| 2549 | | % avl tree is a relation with an integer domain |
| 2550 | | %avl_integer_domain(node((int(_From),_KeyTo),_True,_,_L,_R)). |
| 2551 | | |
| 2552 | | % the first clause is in principle faster |
| 2553 | | % but we don't gain time compared to treatment in second clause; we just avoid building up the domain list |
| 2554 | | %domain_of_avl_set(A,Res) :- avl_integer_domain(A), |
| 2555 | | % \+ avl_tools:avl_height_less_than(A,10), % try and detect interval if height >= 10 |
| 2556 | | % avl_is_pf_with_interval_domain(A,First,Last),!, |
| 2557 | | % construct_interval_closure(First,Last,Res). |
| 2558 | | domain_of_avl_set(A,Res) :- |
| 2559 | | avl_domain(A,EC), % -> expand_custom_set(avl_set(A),EC), |
| 2560 | | domain_of_sorted_list(EC,SizeRes,R), % size of list can be smaller than A if we have a relation |
| 2561 | | (SizeRes=size_res(Size,int(Last)), R=[int(First)-true|_], |
| 2562 | | Size>1000, |
| 2563 | | Size is Last+1-First % we have an interval; quite common that we have functions with intervals as domain |
| 2564 | | -> debug_println(19,constructing_interval_for_domain(First,Last)), |
| 2565 | | construct_interval_closure(First,Last,Res) |
| 2566 | | ; ord_list_to_avlset(R,Res,domain) |
| 2567 | | ). |
| 2568 | | |
| 2569 | | % check if an AVL tree represents a function with an interval domain |
| 2570 | | %avl_is_pf_with_interval_domain(AVL,Min,Max) :- |
| 2571 | | % avl_min(AVL,(int(Min),_)),avl_max(AVL,(int(Max),_)), |
| 2572 | | % Size is 1+Max-Min, avl_size_possible(AVL,Size), |
| 2573 | | % is_avl_partial_function(AVL), |
| 2574 | | % % now check real size |
| 2575 | | % avl_size(AVL,Size). |
| 2576 | | |
| 2577 | | % check if an avl represents a set of integers: |
| 2578 | | avl_integer_set(node(int(_TOP),_True,_,_L,_R)). |
| 2579 | | |
| 2580 | | % check if an avl set is an interval: |
| 2581 | | avl_is_interval(AVL,Min,Max) :- |
| 2582 | | avl_integer_set(AVL), |
| 2583 | | avl_min(AVL,int(Min)),avl_max(AVL,int(Max)), |
| 2584 | | Size is 1+Max-Min, |
| 2585 | | avl_size_possible(AVL,Size), |
| 2586 | | avl_size(AVL,Size). |
| 2587 | | |
| 2588 | | |
| 2589 | | |
| 2590 | | :- use_module(bsyntaxtree,[create_typed_id/3]). |
| 2591 | | dom_symbolic(closure(Paras,Types,Pred), Res) :- |
| 2592 | | expand_pair_closure(Paras,Types,Pred,[X,Y],[TX,TY],NewPred), |
| 2593 | | !, % single argument which is a pair |
| 2594 | | % simply call code for range ; inverting arguments |
| 2595 | | bsyntaxtree:check_used_ids_in_ast(Pred), |
| 2596 | | bsyntaxtree:check_used_ids_in_ast(NewPred), |
| 2597 | | ran_symbolic_closure(Y,[X],TY,[TX],NewPred,Res). |
| 2598 | | dom_symbolic(closure(Paras,Types,Pred), Res) :- |
| 2599 | | append(Xs,[Y],Paras), Xs \= [], |
| 2600 | | append(TXs,[TY],Types), |
| 2601 | | % simply call code for range ; inverting arguments |
| 2602 | | ran_symbolic_closure(Y,Xs,TY,TXs,Pred,Res). |
| 2603 | | % TO DO: allow computation if Paras is a single argument and more than pair |
| 2604 | | |
| 2605 | | % just computes domain: it can also be successful for lambda closures |
| 2606 | | dom_for_specific_closure(closure(P,T,Pred),Domain,Functionality,WF) :- |
| 2607 | | dom_for_specific_closure_aux(P,T,Pred,Domain,Functionality,WF). |
| 2608 | | dom_for_specific_closure_aux(P,T,Pred,Domain,Functionality,_WF) :- |
| 2609 | | is_lambda_value_domain_closure(P,T,Pred, DomainValue,Expr), |
| 2610 | | (preference(find_abort_values,full) -> bsyntaxtree:always_well_defined_or_disprover_mode(Expr) |
| 2611 | | ; true), |
| 2612 | | % Warning: this will lead to dom(%x.(x:1..3|1/0)) = 1..3 to be true; discarding WD condition |
| 2613 | | % this is not as bad as {1|->2}(0) = 3 to be silently failing though; hence only done if TRY_FIND_ABORT = full |
| 2614 | | !, |
| 2615 | | Domain=DomainValue, |
| 2616 | | Functionality=function(total). |
| 2617 | | %dom_for_specific_closure_aux([ID],[Type],Pred,Domain,Functionality,_WF) :- Functionality=relation, |
| 2618 | | % Pred = b(exists(Paras,ClosurePred),pred,Info1), |
| 2619 | | % % dom({res|#(paras).(.... & res= domVal|->ran)}) = {res|#(paras).(.... & res= domVal)} |
| 2620 | | % closures:select_equality(ClosurePred,ID,RHSExpr,Type,Info,RestPred), |
| 2621 | | % RHSExpr = couple(DomValue,_), |
| 2622 | | % closures:does_not_occur_in(ID,RestPred), |
| 2623 | | % Type = couple(DomT,_), |
| 2624 | | % TID = b(identifier(ID),DomT,[]), |
| 2625 | | % % safe_create_texpr |
| 2626 | | % conjunct_predicates([RestPred,b(equal(TID,DomValue),pred,[])],NewClosurePred), |
| 2627 | | % NewPred = b(exists(Paras,NewClosurePred),pred,Info1), |
| 2628 | | % Domain = closure([ID],[DomT],NewPred). |
| 2629 | | dom_for_specific_closure_aux(P,T,Pred,Domain,Functionality,WF) :- |
| 2630 | | dom_range_for_specific_closure2(P,T,Pred, Domain,_Range,domain_only,Functionality,WF). |
| 2631 | | %TO DO treat overwrite closure dom(F1<+F2) = dom(F1) \/ dom(F2) |
| 2632 | | |
| 2633 | | dom_for_lambda_closure(closure(P,T,Pred),Domain) :- |
| 2634 | | is_lambda_value_domain_closure(P,T,Pred, DomainValue,_Expr), |
| 2635 | | Domain=DomainValue. |
| 2636 | | |
| 2637 | | % TO DO: add total functions |
| 2638 | | %dom_for_specific_closure2([F],[T], |
| 2639 | | % b(member(b(identifier(F),T,_), b(total_function(value(A),B),set(couple(DOM,RAN)),_)), pred,_) , |
| 2640 | | % A). |
| 2641 | | |
| 2642 | | :- block domain_of_list_blocking(-,?). |
| 2643 | | % the list will be sorted according to the term ordering for (_,_); hence it will |
| 2644 | | % already be sorted for the projection onto the first element |
| 2645 | | % maybe the speed difference is not worth it ?? |
| 2646 | | domain_of_list_blocking([],[]). |
| 2647 | | domain_of_list_blocking([(A,_B)|T],[A-true|DT]) :- domain_blocking_aux(T,A,DT). |
| 2648 | | :- block domain_blocking_aux(-,?,?). |
| 2649 | | domain_blocking_aux([],_,[]). |
| 2650 | | domain_blocking_aux([(A,_B)|T],Prev,Res) :- |
| 2651 | | compare(Comp,A,Prev), |
| 2652 | | (Comp = '=' |
| 2653 | | -> domain_blocking_aux(T,Prev,Res) |
| 2654 | | ; Res = [A-true|DT], |
| 2655 | | (Comp = '<' -> add_error_fail(custom_explicit_sets,'Domain list not_sorted: ',(A,Prev)) ; true), |
| 2656 | | domain_blocking_aux(T,A,DT) ). |
| 2657 | | |
| 2658 | | % and now a non-blocking version: |
| 2659 | | domain_of_sorted_list([],size_res(0,'$none'),[]). |
| 2660 | | domain_of_sorted_list([(A,_B)|T],Size,[A-true|DT]) :- domain_aux(T,A,DT,1,Size). |
| 2661 | | |
| 2662 | | % TO DO: count length and determine when we have an interval |
| 2663 | | domain_aux([],Prev,[],Acc,size_res(Acc,Prev)). |
| 2664 | | domain_aux([(A,_B)|T],Prev,Res,SizeAcc,Size) :- SA1 is SizeAcc+1, |
| 2665 | | compare(Comp,A,Prev), |
| 2666 | | (Comp = '=' |
| 2667 | | -> domain_aux(T,Prev,Res,SA1,Size) |
| 2668 | | ; Res = [A-true|DT], |
| 2669 | | (Comp = '<' -> add_error_fail(custom_explicit_sets,'Domain list not_sorted: ',(A,Prev)) ; true), |
| 2670 | | domain_aux(T,A,DT,SA1,Size) ). |
| 2671 | | |
| 2672 | | /* succeeds if it can compute domain by some clever way */ |
| 2673 | | range_of_explicit_set_wf(global_set(GS),_R,_) :- !, |
| 2674 | | add_error_and_fail(range_of_explicit_set_wf,'Cannot compute domain of global set: ',GS). |
| 2675 | | range_of_explicit_set_wf(freetype(GS),_R,_) :- !, |
| 2676 | | add_error_and_fail(range_of_explicit_set_wf,'Cannot compute domain of freetype: ',GS). |
| 2677 | | range_of_explicit_set_wf(avl_set(A),Res,_) :- !, |
| 2678 | | avl_domain(A,EC), % -> expand_custom_set(avl_set(A),EC), |
| 2679 | | range(EC,R), |
| 2680 | | normalised_list_to_avl(R,Res). |
| 2681 | | range_of_explicit_set_wf(C,R,WF) :- |
| 2682 | | ran_for_specific_closure(C,Ran,WF),!, |
| 2683 | | Ran=R. |
| 2684 | | range_of_explicit_set_wf(C,R,_) :- |
| 2685 | | ran_symbolic(C,CC),!, |
| 2686 | | R=CC. |
| 2687 | | range_of_explicit_set_wf(closure(P,T,B),Res,WF) :- |
| 2688 | | expand_custom_set_wf(closure(P,T,B),EC,range_of_explicit_set_wf,WF), |
| 2689 | | % TO DO: it would be more useful here to directly just expand the projection onto the last component of P |
| 2690 | | range_blocking(EC,R), |
| 2691 | | normalised_list_to_avl_when_ground(R,Res). |
| 2692 | | |
| 2693 | | % TO DO: in future it is maybe better to add an in_range_wf kernel predicate |
| 2694 | | ran_symbolic(closure(Paras,Types,Pred), Res) :- |
| 2695 | ? | (is_memoization_closure(Paras,Types,Pred,_) |
| 2696 | | -> !,fail % memoization closures can never be dealt with symbolically; we need expansion |
| 2697 | | ; true), |
| 2698 | | expand_pair_closure(Paras,Types,Pred,[Y,X],[TY,TX],NewPred),!, |
| 2699 | | % following test (1541) works with this: 2 : ran({y|#(x).(y = x |-> x + 2 & x : NATURAL)}) |
| 2700 | | ran_symbolic_closure(Y,[X],TY,[TX],NewPred,Res). %, print('res: '),translate:print_bvalue(Res),nl. |
| 2701 | | ran_symbolic(closure([Y,X],[TY,TX],Pred), Res) :- |
| 2702 | | ran_symbolic_closure(Y,[X],TY,[TX],Pred,Res). |
| 2703 | | % TO DO: treat closures with more arguments: we need to quantify Y1,...Yn [Y1,...,Yn,X] |
| 2704 | | |
| 2705 | | % Replace single Identifier YX of type pair by pair (Y,X) where Y,X are (fresh) variables not occuring in Pred |
| 2706 | | % example: {y| #(x).(y = x |-> x + 2 & x : NATURAL)} --> {y__1,y__2|#(x).(y__1 |-> y__2 = x |-> x + 2 & x : NATURAL)} |
| 2707 | | expand_pair_closure([YX],[TYX],Pred,[Y,X],[TY,TX],NewPred) :- TYX = couple(TY,TX), |
| 2708 | | % Replace single ID YX of type pair by pair (Y,X) where Y,X are (fresh) variables not occuring in Pred |
| 2709 | | % example: {y| #(x).(y = x |-> x + 2 & x : NATURAL)} --> {y__1,y__2|#(x).(y__1 |-> y__2 = x |-> x + 2 & x : NATURAL)} |
| 2710 | | % following test (1541) works with this: 2 : ran({y|#(x).(y = x |-> x + 2 & x : NATURAL)}) |
| 2711 | | gensym:gensym(YX,Y),gensym:gensym(YX,X), |
| 2712 | | create_typed_id(Y,TY,YTID), create_typed_id(X,TX,XTID), |
| 2713 | | Pair = b(couple(YTID,XTID),TYX,[]), |
| 2714 | | bsyntaxtree:replace_id_by_expr(Pred,YX,Pair,NewPred). |
| 2715 | | |
| 2716 | | :- use_module(bsyntaxtree,[create_exists_opt_liftable/3]). |
| 2717 | | %:- use_module(bsyntaxtree,[add_texpr_info_if_new/3]). |
| 2718 | | ran_symbolic_closure(Y,Xs,TY,TXs,Pred,Res) :- |
| 2719 | | % create closure for {Xs | #Y.(Pred)} where Pred uses Y|->Xs |
| 2720 | | rename_ran_ids(Xs,Pred,[],XIDs,Pred2), |
| 2721 | | create_typed_id(Y,TY,YTID), |
| 2722 | | create_exists_opt_liftable([YTID],Pred2,Exists), % Y is liftable as the source is a closure with all ids |
| 2723 | | %bsyntaxtree:check_used_ids_in_ast(Exists), |
| 2724 | | %bsyntaxtree:create_exists_opt([YTID],[Pred2],Exists), %or |
| 2725 | | %b_interpreter_components:create_and_simplify_exists([YTID],Pred2,Exists), |
| 2726 | | %bsyntaxtree:add_texpr_info_if_new(Exists,allow_to_lift_exists,Exists2), % leads to pending co-routines in self_checks for bsets for apply_to; |
| 2727 | | % Reason: the tests ground only det WF; without lifting the exists is fully evaluated (and its waitflags with prio 2 and higher grounded) as the wait arguments are ground; with lifting only the det WF is grounded leading to pending coroutines |
| 2728 | | Res = closure(XIDs,TXs,Exists). |
| 2729 | | |
| 2730 | | |
| 2731 | | |
| 2732 | | :- use_module(library(lists),[select/3]). |
| 2733 | | |
| 2734 | | % rename lambda_results : |
| 2735 | | rename_ran_ids([],Pred,_,[],Pred). |
| 2736 | | rename_ran_ids([X|TX],Pred,Acc,[XID|TTX],Pred2) :- |
| 2737 | | % in case X is _lambda_result_ we need to rename it as it then would not get enumerated ! |
| 2738 | | (X == '_lambda_result_' |
| 2739 | | -> get_fresh_id('_was_lambda_result_',TX,Acc,XID), |
| 2740 | | % we could remove lambda_result info field, but it will no longer match new id anyway |
| 2741 | | rename_bt(Pred,[rename(X,XID)],Pred2), |
| 2742 | | TTX=TX |
| 2743 | | % TODO: maybe we should also remove the prob_annotation('LAMBDA-EQUALITY') info inside Pred for the ids and equality !? |
| 2744 | | ; XID = X, rename_ran_ids(TX,Pred,[X|Acc],TTX,Pred2) |
| 2745 | | ). |
| 2746 | | |
| 2747 | | :- use_module(b_ast_cleanup,[get_unique_id/2]). |
| 2748 | | get_fresh_id(ID,List1,List2,Res) :- nonmember(ID,List1), nonmember(ID,List2),!, Res=ID. |
| 2749 | | get_fresh_id(ID,_,_,FRESHID) :- nl,print('*** VARIABLE_CLASH PREVENTED: '), print(ID),nl, |
| 2750 | | get_unique_id(ID,FRESHID). |
| 2751 | | |
| 2752 | | :- block range_blocking(-,?). |
| 2753 | | range_blocking([],[]). |
| 2754 | | range_blocking([(_A,B)|T],[B-true|DT]) :- range_blocking(T,DT). |
| 2755 | | % and a non-blocking version: |
| 2756 | | range([],[]). |
| 2757 | | range([(_A,B)|T],[B-true|DT]) :- range(T,DT). |
| 2758 | | |
| 2759 | | ran_for_specific_closure(closure(P,T,Pred),Range,WF) :- |
| 2760 | | dom_range_for_specific_closure2(P,T,Pred, _Domain,Range,range_only,_Functionality,WF). |
| 2761 | | %ran_for_specific_closure(closure_x(P,T,Pred,_Exp),Card,_) :- ran_for_specific_closure2(P,T,Pred,Card). |
| 2762 | | |
| 2763 | | :- use_module(bsyntaxtree,[conjunct_predicates/2, disjunct_predicates/2, create_typed_id/3, get_texpr_type/2]). |
| 2764 | | override_custom_explicit_set_wf(R,S,Res,WF) :- /* R <+ S */ |
| 2765 | | nonvar(R),override_custom_explicit_set_aux(R,S,Res,WF). |
| 2766 | | override_custom_explicit_set_aux(CL,Rel2,Res,_WF) :- |
| 2767 | | CL=closure(P0,T,B0), |
| 2768 | | ( preference(convert_comprehension_sets_into_closures,true), % cf keep_symbolic in bsets_clp |
| 2769 | | (var(Rel2) -> true |
| 2770 | | ; Rel2 \= avl_set(_)) % if Rel2 is avl_set then maybe better to compute explicitly; unless infinite |
| 2771 | | ; quick_size_check_larger_than(Rel2,Size2,133) -> |
| 2772 | | % if we have a large AVL set; then allow expansion up to a larger limit; cf machine 670_002.mch |
| 2773 | | % a lot of machines use A*B*C <+ {....} to more compactly define large explicit sets |
| 2774 | | (Size2=inf -> Limit = 200000 |
| 2775 | | ; Limit is min(200000,Size2*150)), |
| 2776 | | dont_expand_this_closure(P0,T,B0,Limit) |
| 2777 | | ; dont_expand_this_closure(P0,T,B0) % use default limit and checks for symbolic closure |
| 2778 | | ), |
| 2779 | | !, |
| 2780 | | rename_ran_ids(P0,B0,[],P,B), % any '_lambda_result_' id is no longer guaranteed to be assigned a value in all cases |
| 2781 | | NewClosure=closure(P,T,NewBody), |
| 2782 | | % B <+ Rel2 ---> NewBody = P:Rel2 or (prj1(P) /: dom(Rel2) & B) |
| 2783 | | % TODO better? : %x.(x:Domain|IF x:dom(SFF) THEN SFF(x) ELSE DEFAULT)? |
| 2784 | | generate_typed_id_pairs(P,T,NestedPairs), |
| 2785 | | get_texpr_type(NestedPairs,PairsType), |
| 2786 | | RelPairsType = set(PairsType), |
| 2787 | | ValS = b(value(Rel2),RelPairsType,[]), |
| 2788 | | MemS = b(member(NestedPairs,ValS),pred,[]), % P:Rel2 |
| 2789 | | get_prj1(NestedPairs,DomExpr), |
| 2790 | | get_texpr_type(DomExpr,DomType), |
| 2791 | | Domain = b(domain(ValS),set(DomType),[]), % TO DO: perform some optimisations like dom(%x.(P|E)) --> {x|P} |
| 2792 | | %bsets_clp:domain_wf(Rel2,DomainOfRel2,WF), Domain = b(value(DomainOfRel2),DomType,[]), % this DOES NOT work for 1619, 1706 where override is used for infinite functions |
| 2793 | | NotMemDomS = b(not_member(DomExpr,Domain),pred,[]), % prj1(P) /: dom(Rel2) |
| 2794 | | conjunct_predicates([NotMemDomS,B],RHS), |
| 2795 | | disjunct_predicates([MemS,RHS],NewBody), |
| 2796 | | %print(override),nl, bsyntaxtree:check_used_ids_in_ast(NewBody), |
| 2797 | | mark_closure_as_symbolic(NewClosure,Res). |
| 2798 | | % TO DO: add a case where for second set we have: dont_expand_this_closure |
| 2799 | | override_custom_explicit_set_aux(R,S,Res,WF) :- |
| 2800 | | is_custom_explicit_set(R,override_custom_explicit_set), |
| 2801 | | nonvar(S), is_custom_explicit_set(S,override_custom_explicit_set), |
| 2802 | | %% hit_profiler:add_profile_hit(override(R,S),3), %% |
| 2803 | | override_custom_explicit_set2(R,S,Res,WF). |
| 2804 | | |
| 2805 | | override_custom_explicit_set2(R,S,Res,_WF) :- is_one_element_custom_set(S,(X,Y)), |
| 2806 | | override_pair_explicit_set(R,X,Y,NewR),!, % override pair only succeeds for avl_set |
| 2807 | | Res=NewR. |
| 2808 | | % TO DO: if R is very large and S relatively small : iterate by calling override_pair_explicit_set |
| 2809 | | override_custom_explicit_set2(R,S,Res,WF) :- |
| 2810 | | \+ dont_expand_this_explicit_set(S), % see test 2564 |
| 2811 | | expand_custom_set_wf(R,ER,override_custom_explicit_set_aux1,WF), |
| 2812 | | expand_custom_set_wf(S,ES,override_custom_explicit_set_aux2,WF), |
| 2813 | | override_list(ER,ES,LRes,Done), |
| 2814 | | finish_restriction(Done,LRes,Res). |
| 2815 | | |
| 2816 | | quick_size_check_larger_than(Set,Size,Limit) :- |
| 2817 | | quick_custom_explicit_set_approximate_size(Set,Size), |
| 2818 | | (is_inf_or_overflow_card(Size) -> true ; Size > Limit). |
| 2819 | | get_prj1(b(couple(DomExpr,_),_,_),Prj1) :- !, Prj1 = DomExpr. |
| 2820 | | get_prj1(BE,b(first_of_pair(BE),DT,[])) :- % some closures have a single identifier; we need to apply prj1 |
| 2821 | | BE = b(_E,couple(DT,_RT),_I). |
| 2822 | | |
| 2823 | | % translate a parameter name and type list into a nested-pair value |
| 2824 | | generate_typed_id_pairs([ID|IT],[Type|TT],Res) :- create_typed_id(ID,Type,TypedID), |
| 2825 | | conv2(IT,TT,TypedID,Res). |
| 2826 | | conv2([],[],X,X). |
| 2827 | | conv2([ID|IT],[Type|TT],Acc,Res) :- create_typed_id(ID,Type,TypedID), |
| 2828 | | get_texpr_type(Acc,AccType), |
| 2829 | | Couple = b(couple(Acc,TypedID),couple(AccType,Type),[]), |
| 2830 | | conv2(IT,TT,Couple,Res). |
| 2831 | | |
| 2832 | | :- block override_list(-,?,?,?), override_list(?,-,?,?). |
| 2833 | | override_list([],S,Res,Done) :- !, copy_to_true_list(S,Res,Done). |
| 2834 | | override_list(R,[],Res,Done) :- !, copy_to_true_list(R,Res,Done). |
| 2835 | | override_list([(From1,To1)|T1],[(From2,To2)|T2],Res,Done) :- |
| 2836 | | (From1 @< From2 |
| 2837 | | -> Res = [(From1,To1)-true|TR], override_list(T1,[(From2,To2)|T2],TR,Done) |
| 2838 | | ; From2 @< From1 |
| 2839 | | -> Res = [(From2,To2)-true|TR], override_list([(From1,To1)|T1],T2,TR,Done) |
| 2840 | | ; override_list(T1,[(From2,To2)|T2],Res,Done)). |
| 2841 | | |
| 2842 | | :- block copy_to_true_list(-,?,?). |
| 2843 | | % add -true to get lists that can be converted to avl |
| 2844 | | copy_to_true_list([],[],true). |
| 2845 | | copy_to_true_list([H|T],[H-true|CT],Done) :- copy_to_true_list(T,CT,Done). |
| 2846 | | |
| 2847 | | :- use_module(closures,[get_domain_range_for_closure_types/3]). |
| 2848 | | % compute a closure with the functionality violations of a closure |
| 2849 | | symbolic_functionality_check_closure(closure(P,T,B),closure([DID,ID1,ID2],[DomType,RanType,RanType],Body)) :- |
| 2850 | | % construct {d,z_,z__| (d,z_):R & (d,z__):R & z_\= z__} |
| 2851 | | generate_typed_id_pairs(P,T,NestedPairs), |
| 2852 | | get_texpr_type(NestedPairs,PairsType), |
| 2853 | | RelPairsType = set(PairsType), |
| 2854 | | TRel = b(value(closure(P,T,B)),RelPairsType,[]), |
| 2855 | | DID = '_domain', ID1 = '_zzzz_unary', ID2 = '_zzzz_binary', |
| 2856 | | TDID = b(identifier(DID),DomType,[]), |
| 2857 | | TID1 = b(identifier(ID1),RanType,[]), |
| 2858 | | TID2 = b(identifier(ID2),RanType,[]), |
| 2859 | | Mem1 = b(member( b(couple(TDID,TID1),PairsType,[]),TRel),pred,[]), |
| 2860 | | Mem2 = b(member( b(couple(TDID,TID2),PairsType,[]),TRel),pred,[]), |
| 2861 | | get_domain_range_for_closure_types(T,DomType,RanType), |
| 2862 | | NeqRan = b(not_equal(TID1,TID2), pred, []), |
| 2863 | | conjunct_predicates([Mem1,Mem2,NeqRan],Body), |
| 2864 | | bsyntaxtree:check_used_ids_in_ast(Body). |
| 2865 | | %bsyntaxtree:check_ast(Body). |
| 2866 | | |
| 2867 | | % compute a closure with the injectivity violations of a closure |
| 2868 | | symbolic_injectivity_check_closure(closure(P,T,B),closure([RID,ID1,ID2],[RanType,DomType,DomType],Body)) :- |
| 2869 | | % construct {r,z_,z__| (z_,r):R & (z__,r):R & z_\= z__} |
| 2870 | | generate_typed_id_pairs(P,T,NestedPairs), |
| 2871 | | get_texpr_type(NestedPairs,PairsType), |
| 2872 | | RelPairsType = set(PairsType), |
| 2873 | | TRel = b(value(closure(P,T,B)),RelPairsType,[]), % what if closure body B has WD condition? |
| 2874 | | RID = '_range', ID1 = '_zzzz_unary', ID2 = '_zzzz_binary', |
| 2875 | | TRID = b(identifier(RID),RanType,[]), |
| 2876 | | TID1 = b(identifier(ID1),DomType,[]), |
| 2877 | | TID2 = b(identifier(ID2),DomType,[]), |
| 2878 | | Mem1 = b(member( b(couple(TID1,TRID),PairsType,[]),TRel),pred,[]), |
| 2879 | | Mem2 = b(member( b(couple(TID2,TRID),PairsType,[]),TRel),pred,[]), |
| 2880 | | get_domain_range_for_closure_types(T,DomType,RanType), |
| 2881 | | NeqRan = b(not_equal(TID1,TID2), pred, []), |
| 2882 | | conjunct_predicates([Mem1,Mem2,NeqRan],Body), |
| 2883 | | bsyntaxtree:check_used_ids_in_ast(Body). |
| 2884 | | %bsyntaxtree:check_ast(Body). |
| 2885 | | |
| 2886 | | % ------------------------- |
| 2887 | | |
| 2888 | | |
| 2889 | | % check whether we have a partial function |
| 2890 | | is_avl_partial_function(empty) :- !. |
| 2891 | | is_avl_partial_function(node((KeyFrom,_KeyTo),_True,_,L,R)) :- !, |
| 2892 | | is_avl_partial_function2(L,'$$MIN$$',KeyFrom), |
| 2893 | | is_avl_partial_function2(R,KeyFrom,'$$MAX$$'). |
| 2894 | | is_avl_partial_function(X) :- add_internal_error('Not avl_set or relation: ',is_avl_partial_function(X)),fail. |
| 2895 | | |
| 2896 | | % we traverse the tree from top to bottom, keeping track of possible upper- and lower-bounds |
| 2897 | | % if any value matches the upper or lower bound, the we do not have a partial function |
| 2898 | | is_avl_partial_function2(empty,_,_). |
| 2899 | | is_avl_partial_function2(node((KeyFrom,_KeyTo),_True,_,L,R),ParentFrom,ParentTo) :- |
| 2900 | | KeyFrom \= ParentFrom, KeyFrom \= ParentTo, |
| 2901 | | is_avl_partial_function2(L,ParentFrom,KeyFrom), |
| 2902 | | is_avl_partial_function2(R,KeyFrom,ParentTo). |
| 2903 | | |
| 2904 | | % the dual of the above, returning a counter example |
| 2905 | | is_not_avl_partial_function(node((KeyFrom,_KeyTo),_True,_,L,R),DuplicateKey) :- !, |
| 2906 | | (is_not_avl_partial_function2(L,'$$MIN$$',KeyFrom,DuplicateKey) -> true |
| 2907 | | ; is_not_avl_partial_function2(R,KeyFrom,'$$MAX$$',DuplicateKey)). |
| 2908 | | is_not_avl_partial_function2(node((KeyFrom,_KeyTo),_True,_,L,R),ParentFrom,ParentTo,DuplicateKey) :- |
| 2909 | | ( KeyFrom = ParentFrom -> DuplicateKey=KeyFrom |
| 2910 | | ; KeyFrom = ParentTo -> DuplicateKey=KeyFrom |
| 2911 | | ; is_not_avl_partial_function2(L,ParentFrom,KeyFrom,DuplicateKey) -> true |
| 2912 | | ; is_not_avl_partial_function2(R,KeyFrom,ParentTo,DuplicateKey) -> true). |
| 2913 | | |
| 2914 | | |
| 2915 | | % check whether we have a function which is total over a given domain; both as AVL sets |
| 2916 | | is_avl_total_function_over_domain(empty,empty) :- !. |
| 2917 | | is_avl_total_function_over_domain(AVLFun,AVLDom) :- |
| 2918 | | avl_domain(AVLFun,FunList), |
| 2919 | | avl_domain(AVLDom,DomList), |
| 2920 | | is_avl_total_fun2(FunList,DomList). |
| 2921 | | |
| 2922 | | is_avl_total_fun2([],[]). |
| 2923 | | is_avl_total_fun2([(From,_To)|FT],[From|DomT]) :- is_avl_total_fun2(FT,DomT). |
| 2924 | | |
| 2925 | | |
| 2926 | | %not_is_avl_partial_function(AVLF) :- \+ is_avl_partial_function(AVLF). |
| 2927 | | |
| 2928 | | :- use_module(kernel_equality,[membership_test_wf/4]). |
| 2929 | | % check whether an AVL Relation is not over a specific domain & range |
| 2930 | | is_not_avl_relation_over_domain_range(AVLRel,Domain,Range,WF) :- AVLRel \= empty, |
| 2931 | | avl_min_pair(AVLRel,RFrom,RTo), |
| 2932 | | membership_test_wf(Domain,RFrom,MemRes,WF), |
| 2933 | | is_not_avl_rel_dom1(MemRes,RFrom,RTo,AVLRel,Domain,Range,WF). |
| 2934 | | |
| 2935 | | :- block is_not_avl_rel_dom1(-, ?,?,?,?,?,?). |
| 2936 | | is_not_avl_rel_dom1(pred_false,_,_,_,_,_,_WF). |
| 2937 | | is_not_avl_rel_dom1(pred_true,RFrom,RTo,AVLRel,Domain,Range,WF) :- |
| 2938 | | membership_test_wf(Range,RTo,MemRes,WF), |
| 2939 | | is_not_avl_rel_dom2(MemRes,RFrom,RTo,AVLRel,Domain,Range,WF). |
| 2940 | | |
| 2941 | | :- block is_not_avl_rel_dom2(-, ?,?,?,?,?,?). |
| 2942 | | is_not_avl_rel_dom2(pred_false,_,_,_,_,_,_WF). |
| 2943 | | is_not_avl_rel_dom2(pred_true,RFrom,RTo,AVLRel,Domain,Range,WF) :- |
| 2944 | | avl_next((RFrom,RTo),AVLRel,(RFrom2,RTo2)), |
| 2945 | | membership_test_wf(Domain,RFrom2,MemRes,WF), |
| 2946 | | is_not_avl_rel_dom1(MemRes,RFrom2,RTo2,AVLRel,Domain,Range,WF). |
| 2947 | | |
| 2948 | | % check whether an AVL Relation is not over a specific range |
| 2949 | | is_not_avl_relation_over_range(AVLRel,Range,WF) :- AVLRel \= empty, |
| 2950 | | avl_min_pair(AVLRel,RFrom,RTo), |
| 2951 | | membership_test_wf(Range,RTo,MemRes,WF), |
| 2952 | | is_not_avl_rel_ran2(MemRes,RFrom,RTo,AVLRel,Range,WF). |
| 2953 | | |
| 2954 | | :- block is_not_avl_rel_ran2(-, ?,?,?,?,?). |
| 2955 | | is_not_avl_rel_ran2(pred_false,_,_,_,_,_WF). |
| 2956 | | is_not_avl_rel_ran2(pred_true,RFrom,RTo,AVLRel,Range,WF) :- |
| 2957 | | avl_next((RFrom,RTo),AVLRel,(RFrom2,RTo2)), |
| 2958 | | kernel_equality:membership_test_wf(Range,RTo2,MemRes,WF), |
| 2959 | | is_not_avl_rel_ran2(MemRes,RFrom2,RTo2,AVLRel,Range,WF). |
| 2960 | | |
| 2961 | | % check whether we have a relation |
| 2962 | | is_avl_relation(node((_KeyFrom,_KeyTo),_True,_,_,_)). |
| 2963 | | |
| 2964 | | % check whether a Relation has all its range elments in a certain Range (not necessarily AVL) |
| 2965 | | % TO DO: if Domain is an interval: we could take avl_min and avl_max and rely on lexicographic ordering |
| 2966 | | is_avl_relation_over_domain(AVL,IntervalClosure,_WF) :- |
| 2967 | | is_interval_closure_or_integerset(IntervalClosure,Low,Up),!, |
| 2968 | | ((avl_min(AVL,(int(ALow),_)), avl_max(AVL,(int(AUp),_))) |
| 2969 | | -> cs_greater_than_equal(ALow,Low), cs_greater_than_equal(Up,AUp) %,print(ok),nl |
| 2970 | | ; (AVL=empty -> true ; add_error_and_fail(is_avl_relation_over_domain,'Not a relation with integer domain: ',AVL))). |
| 2971 | | is_avl_relation_over_domain(_,Domain,_) :- |
| 2972 | | quick_is_definitely_maximal_set(Domain),!. |
| 2973 | | %is_definitely_maximal_set(Domain),!. |
| 2974 | ? | is_avl_relation_over_domain(AVL,Domain,WF) :- is_avl_relation_over_domain2(AVL,Domain,WF). |
| 2975 | | is_avl_relation_over_domain2(empty,_,_). |
| 2976 | | is_avl_relation_over_domain2(node((KeyFrom,_KeyTo),_,_,L,R), Domain,WF) :- |
| 2977 | ? | is_avl_relation_over_domain2(L, Domain,WF), |
| 2978 | ? | is_avl_relation_over_domain2(R, Domain,WF), |
| 2979 | ? | kernel_objects:check_element_of_wf(KeyFrom,Domain,WF). |
| 2980 | | |
| 2981 | | % : faster to check than is_definitely_maximal_set |
| 2982 | | quick_is_definitely_maximal_set(X) :- nonvar(X), |
| 2983 | | quick_is_definitely_maximal_set_aux(X). |
| 2984 | | quick_is_definitely_maximal_set_aux(global_set(GS)) :- |
| 2985 | | nonvar(GS),is_maximal_global_set(GS). |
| 2986 | | quick_is_definitely_maximal_set_aux(avl_set(AVL)) :- |
| 2987 | | quick_definitely_maximal_set_avl(AVL). |
| 2988 | | |
| 2989 | | % check whether a Relation has all its range elments in a certain Range (not necessarily AVL) |
| 2990 | | |
| 2991 | | |
| 2992 | | |
| 2993 | | is_avl_relation_over_range(empty,_,_) :- !. |
| 2994 | | is_avl_relation_over_range(_,Range,_) :- |
| 2995 | | %quick_is_definitely_maximal_set(Range), |
| 2996 | | is_definitely_maximal_set(Range), |
| 2997 | | !. |
| 2998 | ? | is_avl_relation_over_range(AVL,Range,WF) :- is_avl_relation_over_range2(AVL,Range,WF). |
| 2999 | | |
| 3000 | | is_avl_relation_over_range2(empty,_,_). |
| 3001 | | is_avl_relation_over_range2(node((_KeyFrom,KeyTo),_,_,L,R), Range,WF) :- |
| 3002 | ? | is_avl_relation_over_range(L, Range,WF), |
| 3003 | ? | kernel_objects:check_element_of_wf(KeyTo,Range,WF), |
| 3004 | ? | is_avl_relation_over_range2(R, Range,WF). |
| 3005 | | |
| 3006 | | % safe version of is_avl_sequence, does not throw error when type cannot be a sequence |
| 3007 | | safe_is_avl_sequence(empty) :- !. |
| 3008 | | safe_is_avl_sequence(node((int(KeyFrom),_KeyTo),_True,_,L,R)) :- !, |
| 3009 | | is_avl_sequence2(L,0,KeyFrom), |
| 3010 | | is_avl_sequence2(R,KeyFrom,'$$MAX$$'). |
| 3011 | | |
| 3012 | | is_avl_sequence(empty) :- !. |
| 3013 | | is_avl_sequence(node((int(KeyFrom),_KeyTo),_True,_,L,R)) :- !, |
| 3014 | | is_avl_sequence2(L,0,KeyFrom), |
| 3015 | | is_avl_sequence2(R,KeyFrom,'$$MAX$$'). |
| 3016 | | is_avl_sequence(X) :- add_error_and_fail(is_avl_sequence,'Not avl_set or sequence: ',X). |
| 3017 | | |
| 3018 | | % we traverse the tree from top to bottom, keeping track of possible upper- and lower-bounds |
| 3019 | | % if any value matches the upper or lower bound, then we do not have a partial function |
| 3020 | | is_avl_sequence2(empty,X,Y) :- |
| 3021 | | (Y=='$$MAX$$' -> true ; Y is X+1). % otherwise there is a gap in the sequence |
| 3022 | | is_avl_sequence2(node((int(KeyFrom),_KeyTo),_,_,L,R),ParentFrom,ParentTo) :- |
| 3023 | | KeyFrom > ParentFrom, KeyFrom \= ParentTo, |
| 3024 | | is_avl_sequence2(L,ParentFrom,KeyFrom), |
| 3025 | | is_avl_sequence2(R,KeyFrom,ParentTo). |
| 3026 | | |
| 3027 | | % for performance: it is not worthwhile to make a version that checks that |
| 3028 | | % we have a sequence over a range using a single traversal |
| 3029 | | |
| 3030 | | |
| 3031 | | % get avl_sequence elements as sorted list (without indices) |
| 3032 | | % used by external function REPLACE |
| 3033 | | get_avl_sequence(AVL,SeqList) :- |
| 3034 | | get_avl_sequence_dcg(AVL,SeqList,[]). |
| 3035 | | |
| 3036 | | get_avl_sequence_dcg(empty) --> []. |
| 3037 | | get_avl_sequence_dcg(node((int(_),SeqEl),_True,_,L,R)) --> |
| 3038 | | get_avl_sequence_dcg(L), |
| 3039 | | [SeqEl], |
| 3040 | | get_avl_sequence_dcg(R). |
| 3041 | | |
| 3042 | | |
| 3043 | | % --------------------------- |
| 3044 | | prefix_of_custom_explicit_set(avl_set(A),MinIndex,Result,WF) :- |
| 3045 | | size_of_avl_sequence(A,Size,WF), |
| 3046 | | (MinIndex > Size |
| 3047 | | -> add_wd_error('index larger than size of sequence in prefix_sequence (/|\\)! ', '>'(MinIndex,Size),WF) |
| 3048 | | % ; MinIndex = 0 -> Result = [] % case already treated in bsets_clp |
| 3049 | | ; MinIndex = Size -> Result=avl_set(A) |
| 3050 | | ; prefix_of_custom_explicit_set2(A,MinIndex,OrdList,[]), |
| 3051 | | ord_list_to_avlset(OrdList,Result,prefix_of_custom_explicit_set) |
| 3052 | | ). |
| 3053 | | prefix_of_custom_explicit_set2(empty,_MaxIndex) --> {true}. |
| 3054 | | prefix_of_custom_explicit_set2(node((int(KeyFrom),KeyTo),_True,_,L,R),MaxIndex) --> |
| 3055 | | ({KeyFrom = MaxIndex} |
| 3056 | | -> prefix_of_custom_explicit_set2(L,MaxIndex), [((int(KeyFrom),KeyTo)-true)] |
| 3057 | | ; {KeyFrom > MaxIndex} -> prefix_of_custom_explicit_set2(L,MaxIndex) |
| 3058 | | ; prefix_of_custom_explicit_set2(L,MaxIndex), [((int(KeyFrom),KeyTo)-true)], |
| 3059 | | prefix_of_custom_explicit_set2(R,MaxIndex) |
| 3060 | | ). |
| 3061 | | |
| 3062 | | % size is only well-defined for sequences: |
| 3063 | | size_of_custom_explicit_set(avl_set(AVL),int(Size),WF) :- size_of_avl_sequence(AVL,Size,WF). |
| 3064 | | size_of_custom_explicit_set(closure(P,T,B),Res,WF) :- |
| 3065 | | is_lambda_value_domain_closure(P,T,B, DomainValue,_Expr), |
| 3066 | | kernel_cardinality_attr:finite_cardinality_as_int_wf(DomainValue,Res,WF). |
| 3067 | | |
| 3068 | | size_of_avl_sequence(AVL,Size,WF) :- |
| 3069 | | avl_min_pair(AVL,int(One),_), One =\= 1, |
| 3070 | | !, |
| 3071 | | avl_size(AVL,Sz), |
| 3072 | | add_wd_error('Applying size to a value which is not a sequence (minimum index is not 1)',b(value(avl_set(AVL)),seq(any),[]),WF), |
| 3073 | | Size=Sz. % other calls to size_of_avl_sequence currently expect a value |
| 3074 | | size_of_avl_sequence(AVL,Size,WF) :- |
| 3075 | | \+ preference(find_abort_values,false), |
| 3076 | | \+ is_avl_sequence(AVL), |
| 3077 | | !, |
| 3078 | | avl_size(AVL,Sz), |
| 3079 | | add_wd_error('Applying size to a value which is not a sequence',b(value(avl_set(AVL)),seq(any),[]),WF), |
| 3080 | | Size=Sz. % other calls to size_of_avl_sequence currently expect a value |
| 3081 | | size_of_avl_sequence(AVL,Size,WF) :- |
| 3082 | | avl_max_pair(AVL,int(Sz),_), |
| 3083 | | avl_height(AVL,H), % we cannot compute the height together with max; we need the longest path! |
| 3084 | | get_min_max_card(H,MinSize,MaxSize), |
| 3085 | | %avl_size(AVL,Real),format('AVL SeqSize: ~w, height: ~w, real size:~w, min: ~w, max: ~w~n',[Sz,H,Real,MinSize,MaxSize]), |
| 3086 | | (Sz > MaxSize |
| 3087 | | -> add_wd_error('Applying size to a value which is not a sequence (maximum index too large)',b(value(avl_set(AVL)),seq(any),[]),WF), |
| 3088 | | avl_size(AVL,Size) |
| 3089 | | % triggered by e.g. size({0|->1,0|->2,1|->3}) or size({0|->1,1|->2,3|->3,1|->22,1|->23,1|->24,1|->25,1|->26}) |
| 3090 | | ; Sz < MinSize |
| 3091 | | -> add_wd_error('Applying size to a value which is not a sequence (maximum index too small)',b(value(avl_set(AVL)),seq(any),[]),WF), |
| 3092 | | avl_size(AVL,Size) |
| 3093 | | % triggered by e.g. size([0,2,2,2] |> {2}) |
| 3094 | | ; Size=Sz). |
| 3095 | | |
| 3096 | | get_min_max_card(Height,MinCard,MaxCard) :- |
| 3097 | | % page 460, Knuth 3: The height of a balanced tree with N internal nodes always lies between lg(N+1) and 1.4405 lg(N+2) - 0.3277 |
| 3098 | | MaxCard is 2^Height - 1, |
| 3099 | | % 1.618034 is golden ration phi 0.5(1+sqrt(5)) , 2.236068 is sqrt(5) |
| 3100 | | % proof in Knuth uses fact: N > phi^(h+2)/sqrt(5) - 2 |
| 3101 | | MinCard is ceiling((1.61803398875**(Height+2)) / 2.2360679775 - 2). |
| 3102 | | |
| 3103 | | % check if a candidate size is possible given height: |
| 3104 | | avl_size_possible(AVL,SizeCandidate) :- |
| 3105 | | avl_height(AVL,Height), % TO DO: restrict to something like log2 of Height |
| 3106 | | get_min_max_card(Height,MinCard,MaxCard), |
| 3107 | | MinCard =< SizeCandidate, |
| 3108 | | SizeCandidate =< MaxCard. |
| 3109 | | |
| 3110 | | |
| 3111 | | suffix_of_custom_explicit_set(avl_set(A),MinIndex,Result,WF) :- |
| 3112 | | size_of_avl_sequence(A,Size,WF), |
| 3113 | | (MinIndex > Size |
| 3114 | | -> add_wd_error('index larger than size of sequence in suffix_sequence (\\|/)! ', '>'(MinIndex,Size),WF) |
| 3115 | | % ; MinIndex = 0 -> Result = avl_set(A) % case already treated in bsets_clp |
| 3116 | | ; MinIndex = Size -> Result=[] |
| 3117 | | ; suffix_of_custom_explicit_set2(A,MinIndex,OrdList,[]), |
| 3118 | | ord_list_to_avlset(OrdList,Result,suffix_of_custom_explicit_set) |
| 3119 | | ). |
| 3120 | | suffix_of_custom_explicit_set2(empty,_MinIndex) --> {true}. |
| 3121 | | suffix_of_custom_explicit_set2(node((int(KeyFrom),KeyTo),_True,_,L,R),MinIndex) --> |
| 3122 | | ({KeyFrom =< MinIndex} -> suffix_of_custom_explicit_set2(R,MinIndex) |
| 3123 | | ; {ShiftedKeyFrom is KeyFrom-MinIndex}, |
| 3124 | | ({KeyFrom =:= MinIndex+1} |
| 3125 | | -> {true} ; suffix_of_custom_explicit_set2(L,MinIndex)), |
| 3126 | | [((int(ShiftedKeyFrom),KeyTo)-true)], |
| 3127 | | suffix_of_custom_explicit_set2(R,MinIndex) |
| 3128 | | ). |
| 3129 | | |
| 3130 | | shift_avl_sequence_to_ord_list(AVL,Offset,ShiftedOrdList) :- |
| 3131 | | avl_to_list(AVL,List),shift_seq(List,Offset,ShiftedOrdList). |
| 3132 | | % it does not seem to be worth to use avl_to_list_dcg_offset or a variation thereof |
| 3133 | | % it is not really slower to do two traversals (avl_to_list and shift_seq) |
| 3134 | | |
| 3135 | | shift_seq([],_,[]). |
| 3136 | | shift_seq([(int(I),Val)-true|T],Offset,[(int(NI),Val)-true|ST]) :- NI is I+Offset, |
| 3137 | | shift_seq(T,Offset,ST). |
| 3138 | | |
| 3139 | | :- use_module(debug). |
| 3140 | | concat_custom_explicit_set(avl_set(S1),Seq2,Res,WF) :- nonvar(Seq2), Seq2=avl_set(S2), |
| 3141 | | size_of_avl_sequence(S1,Size1,WF), |
| 3142 | | shift_avl_sequence_to_ord_list(S2,Size1,OL2), |
| 3143 | | % if OL2 is small we could use avl_store like in append_custom_explicit_set |
| 3144 | | %avl_to_list(S1,OL1), |
| 3145 | | avl_to_list_dcg(S1,NewOrdList,OL2), % use OL2 rather than [] as tail |
| 3146 | | %append(OL1,OL2,NewOrdList), % we could avoid traversing OL1 again by doing a custom avl_to_list/3 which specifies tail |
| 3147 | | ord_list_to_avlset(NewOrdList,Res,concat). % , print_term_summary(res_concat(Res)). |
| 3148 | | |
| 3149 | | % a DCG version of avl_to_list; allows to call it with something else than [] as tail |
| 3150 | | avl_to_list_dcg(empty) --> []. |
| 3151 | | avl_to_list_dcg(node(Key,Val,_,L,R)) --> |
| 3152 | | avl_to_list_dcg(L), [(Key-Val)], |
| 3153 | | avl_to_list_dcg(R). |
| 3154 | | |
| 3155 | | /* conc: concatenation of sequence of sequences (general_concat) */ |
| 3156 | | conc_custom_explicit_set(avl_set(AVL),Res) :- |
| 3157 | | avl_min_pair(AVL,int(ONE),First), |
| 3158 | | conc2_cs(First,ONE,AVL,0,NewOrdList), |
| 3159 | | ord_list_to_avlset(NewOrdList,Res,conc). |
| 3160 | | |
| 3161 | | conc2_cs(Seq,NrSeq,AVL,Offset,OrdList) :- |
| 3162 | | add_seq(Seq,Offset,OrdList,NewOffset,TailOrd), |
| 3163 | | (avl_next((int(NrSeq),Seq),AVL,(int(N2),Seq2)) |
| 3164 | | -> conc2_cs(Seq2,N2,AVL,NewOffset,TailOrd) |
| 3165 | | ; TailOrd=[]). |
| 3166 | | |
| 3167 | | add_seq([],Offset,OrdRes,NewOffset,TailOrdRes) :- NewOffset=Offset, TailOrdRes=OrdRes. |
| 3168 | | add_seq(avl_set(ASeq),Offset,OrdRes,NewOffset,TailOrd) :- |
| 3169 | | avl_to_list_dcg_offset(ASeq,Offset,NrEls,OrdRes,TailOrd), NewOffset is Offset+NrEls. |
| 3170 | | |
| 3171 | | % a version of avl_to_list for sequences which autmatically adds an offset |
| 3172 | | avl_to_list_dcg_offset(empty,_,0) --> []. |
| 3173 | | avl_to_list_dcg_offset(node((int(Idx),El),Val,_,L,R),Offset,NrEls) --> |
| 3174 | | {NIdx is Idx+Offset}, |
| 3175 | | avl_to_list_dcg_offset(L,Offset,N1), |
| 3176 | | [((int(NIdx),El)-Val)], |
| 3177 | | avl_to_list_dcg_offset(R,Offset,N2), {NrEls is N1+N2+1}. |
| 3178 | | |
| 3179 | | prepend_custom_explicit_set(avl_set(S1),ObjectToPrepend,Res) :- |
| 3180 | | %hit_profiler:add_profile_hit(prepend_custom_explicit_set(avl_set(S1),ObjectToPrepend,Res)), |
| 3181 | | element_can_be_added_or_removed_to_avl(ObjectToPrepend), |
| 3182 | | shift_avl_sequence_to_ord_list(S1,1,OL1), |
| 3183 | | ord_list_to_avlset([(int(1),ObjectToPrepend)-true|OL1],Res). |
| 3184 | | |
| 3185 | | append_custom_explicit_set(avl_set(S1),ObjectToAppend,Res,WF) :- |
| 3186 | | element_can_be_added_or_removed_to_avl(ObjectToAppend), % implies that ObjectToAppend is ground |
| 3187 | | size_of_avl_sequence(S1,Size1,WF), NewSize is Size1+1, |
| 3188 | | add_ground_element_to_explicit_set_wf(avl_set(S1),(int(NewSize),ObjectToAppend),Res,WF). |
| 3189 | | |
| 3190 | | % compute tail of a sequence and also return first element |
| 3191 | | tail_sequence_custom_explicit_set(avl_set(S1),First,Res,Span,WF) :- |
| 3192 | | shift_avl_sequence_to_ord_list(S1,-1,NewOrdList), |
| 3193 | | (NewOrdList = [(int(0),First)-true|TailOL] -> ord_list_to_avlset(TailOL,Res) |
| 3194 | | ; add_wd_error_span('tail argument is not a sequence!', avl_set(S1),Span,WF) |
| 3195 | | % add_error_fail(tail_sequence,'tail applied to ', NewOrdList)) |
| 3196 | | ). |
| 3197 | | last_sequence_explicit_set(avl_set(AVL),Last) :- |
| 3198 | | avl_max_pair(AVL,int(_Sz),Last). |
| 3199 | | % TO DO: we could compute height of the path to max H, then check that Sz is in 2**(H-1)+1 .. 2**(H+1)-1 ? |
| 3200 | | %first_sequence_explicit_set(avl_set(AVL),First) :- % not used anymore; apply_to used instead |
| 3201 | | % avl_min_pair(AVL,int(_One),First). |
| 3202 | | |
| 3203 | | % compute front and return last element at the same time |
| 3204 | | front_sequence_custom_explicit_set(avl_set(AVL),Last,Res) :- |
| 3205 | | avl_max_pair(AVL,int(Size),Last), |
| 3206 | | direct_remove_element_from_avl(AVL, (int(Size),Last), Res). % we know Last is already in AVL-converted format |
| 3207 | | |
| 3208 | | |
| 3209 | | reverse_custom_explicit_set(avl_set(AVL),Res) :- |
| 3210 | | avl_to_list_dcg_offset(AVL,0,Size,List,[]), |
| 3211 | | S1 is Size+1, |
| 3212 | | reverse_list(List,S1,[],RevList), |
| 3213 | | ord_list_to_avl(RevList,RevAVL), |
| 3214 | | Res=avl_set(RevAVL). |
| 3215 | | |
| 3216 | | reverse_list([],_,Acc,Acc). |
| 3217 | | reverse_list([(int(Idx),El)-V|T],S1,Acc,Res) :- |
| 3218 | | NewIdx is S1 - Idx, |
| 3219 | | reverse_list(T,S1,[(int(NewIdx),El)-V|Acc],Res). |
| 3220 | | |
| 3221 | | % check if a relation is injective ; compute range at the same time; note AVL can be empty |
| 3222 | | is_injective_avl_relation(AVL,RangeRes) :- |
| 3223 | | avl_domain(AVL,ElList), |
| 3224 | | empty_avl(EmptyAcc), |
| 3225 | | is_avl_inj_list(ElList,EmptyAcc,Range), |
| 3226 | | construct_avl_set(Range,RangeRes). |
| 3227 | | |
| 3228 | | is_avl_inj_list([],Range,Range). |
| 3229 | | is_avl_inj_list([(_From,To)|T],InRange,OutRange) :- |
| 3230 | | (avl_fetch(To,InRange) -> fail /* this is not an injection; a range element is repeated */ |
| 3231 | | ; avl_store(To,InRange,true,InRange1), |
| 3232 | | is_avl_inj_list(T,InRange1,OutRange) |
| 3233 | | ). |
| 3234 | | |
| 3235 | | % Example predicates that work with code below: |
| 3236 | | % card(id((1..1000)*(1..1000))~)=1000*1000 |
| 3237 | | % card(((1..1000)*(1..1000))~)=1000*1000 |
| 3238 | | invert_explicit_set(global_set(GS),_R) :- !, |
| 3239 | | add_error_and_fail(invert_explicit_set,'Cannot compute inverse of global set: ',GS). |
| 3240 | | invert_explicit_set(freetype(GS),_R) :- !, |
| 3241 | | add_error_and_fail(invert_explicit_set,'Cannot compute inverse of freetype: ',GS). |
| 3242 | | invert_explicit_set(closure([P1,P2],[T1,T2],Clo),R) :- !, |
| 3243 | | % TODO: also invert closures with single argument or more arguments |
| 3244 | | % e.g., {a,b,c|a=1 & b=1 &c:1..10}~ = {c,ab|ab=(1,1) & c:1..10} |
| 3245 | | R = closure([P2,P1],[T2,T1],Clo). |
| 3246 | | invert_explicit_set(closure([P1],[T1],Clo),R) :- |
| 3247 | | is_member_closure_with_info([P1],[T1],Clo,_Type,Info,MEM), |
| 3248 | | invert_member_predicate(MEM,T1,InvMEM,InvT1),!, |
| 3249 | | construct_member_closure(P1,InvT1,Info,InvMEM,R). |
| 3250 | | invert_explicit_set(C,AVL) :- expand_custom_set(C,EC,invert_explicit_set), %% convert to AVL ? |
| 3251 | | inv_and_norm(EC,AVL). |
| 3252 | | |
| 3253 | | invert_member_predicate(cartesian_product(A,B),couple(TA,TB), |
| 3254 | | cartesian_product(B,A),couple(TB,TA)). |
| 3255 | | invert_member_predicate(identity(A),TA,identity(A),TA). |
| 3256 | | |
| 3257 | | |
| 3258 | | :- block inv_and_norm(-,?). |
| 3259 | | inv_and_norm(EC,AVL) :- inv(EC,R,Done), norm(Done,R,AVL). |
| 3260 | | |
| 3261 | | :- block norm(-,?,?). |
| 3262 | | norm(_,R,AVL) :- normalised_list_to_avl(R,AVL). |
| 3263 | | |
| 3264 | | :- block inv(-,?,?). |
| 3265 | | inv([],[],done). |
| 3266 | | inv([(A,B)|T],[(B,A)-true|DT],Done) :- inv(T,DT,Done). |
| 3267 | | |
| 3268 | | |
| 3269 | | |
| 3270 | | % checks whether a ground value is in the domain of an AVL relation |
| 3271 | | check_in_domain_of_avlset_wf(X,AVL,_WF) :- |
| 3272 | | convert_to_avl_inside_set(X,AX),!, |
| 3273 | ? | (avl_fetch_pair(AX,AVL,_) -> true ; fail). |
| 3274 | | check_in_domain_of_avlset_wf(X,AVL,WF) :- |
| 3275 | | print('### could not convert arg for check_in_domain_of_avlset'),nl, |
| 3276 | | print(X),nl, |
| 3277 | | safe_flex_avl_member_default_wf((X,_),AVL,WF). |
| 3278 | | |
| 3279 | | % checks whether a ground value is in the domain of an AVL relation and has only one solution |
| 3280 | | check_unique_in_domain_of_avlset(X,AVL) :- convert_to_avl_inside_set(X,AX),!, |
| 3281 | | avl_fetch_pair(AX,AVL,AY1),!, |
| 3282 | | (avl_fetch_pair(AX,AVL,AY2), AY1 \= AY2 -> fail |
| 3283 | | ; true). |
| 3284 | | |
| 3285 | | |
| 3286 | | % utility to check if for a value there is at most one matching element in an AVL set |
| 3287 | | % optimized for function application |
| 3288 | | at_most_one_match_possible(Element,AVL,Matches) :- nonvar(Element), |
| 3289 | | Element=(Index,_Rest), % Function Application; TO DO: does this cover all func. appl ? |
| 3290 | | element_can_be_added_or_removed_to_avl(Index), |
| 3291 | | convert_to_avl_inside_set(Index,AX), % is ground and normalised ? |
| 3292 | | % TO DO: check AVL size ? Check other patterns ? |
| 3293 | | findall((AX,Match),avl_tools:avl_fetch_pair(AX,AVL,Match),Matches), |
| 3294 | | Matches \= [_,_|_]. |
| 3295 | | |
| 3296 | | |
| 3297 | | |
| 3298 | | apply_to_avl_set(A,X,Y,Span,WF) :- |
| 3299 | | ground_value_check(X,GroundX), |
| 3300 | ? | apply_to_avl_set_aux(A,X,Y,GroundX,Span,WF). |
| 3301 | | |
| 3302 | | apply_to_avl_set_aux(A,X,Y,GroundX,Span,WF) :- nonvar(GroundX),!, |
| 3303 | | apply_check_tuple(X,Y,A,Span,WF). % we could call apply_check_tuple_ground to avoid one ground test |
| 3304 | | % We know that A is a function: we can deterministically apply if X is ground; |
| 3305 | | % if Y is ground this is only the cases for injective functions |
| 3306 | | apply_to_avl_set_aux(A,X,Y,GroundX,Span,WF) :- |
| 3307 | | %(preference(data_validation_mode,true); % we now reduce priority of backpropagation below |
| 3308 | | \+ preference(find_abort_values,false), |
| 3309 | | % do not try inverse propagation onto argument X of function application A(X) = Y |
| 3310 | | !, |
| 3311 | | avl_approximate_size(A,3,ApproxSizeA), |
| 3312 | | apply_check_tuple_delay(X,Y,A,ApproxSizeA,Span,WF,GroundX,_,_). |
| 3313 | | apply_to_avl_set_aux(A,X,Y,GroundX,Span,WF) :- |
| 3314 | | ground_value_check(Y,GroundY), |
| 3315 | | avl_approximate_size(A,3,ApproxSizeA), % exact size for height <= 3; approximate size above |
| 3316 | | (ApproxSizeA < 4 -> SPrio=ApproxSizeA ; SPrio is ApproxSizeA * 10), % magic number; ideally we want X or Y to be known beforehand; if none are known we may miss WD errors and may enumerate useless intermediate variables |
| 3317 | | get_bounded_wait_flag(SPrio,apply_to_explicit(X,Y),WF,WF1), % this only makes sense if X is a domain variable to be enumerated |
| 3318 | | %propagate_avl_element_information((X,Y),A,ApproxSizeA,WF), % could be done; but would prevent WD problems from being detected |
| 3319 | | % this waitflag is used when neither X nor Y are ground; |
| 3320 | | % quite often not much is gained by enumerating possible values; unless X or Y are constrained or trigger other computations |
| 3321 | | % WSz is 10*ApproxSizeA, % magic value |
| 3322 | | %(ApproxSizeA > 100 -> InversePrioSize = 4 |
| 3323 | | % ; avl_range_size_and_propagate_element_info(A,X,Y,RSize), InversePrioSize is ApproxSizeA // RSize), % we could probably compute the exact worst case with the same complexity |
| 3324 | | % delay_get_wait_flag(GroundY,GroundX,WF1,InversePrioSize,apply_to_explicit_inverse(X,Y),WF,WF2), |
| 3325 | | %(ApproxSizeA<4000 -> propagate_apply(X,Y,A,ApproxSizeA,WF,GroundX,GroundY) ; true), |
| 3326 | ? | apply_check_tuple_delay(X,Y,A,ApproxSizeA,Span,WF,GroundX,WF1,GroundY), |
| 3327 | | (preference(use_clpfd_solver,false) -> true |
| 3328 | | % should we also check: preference(find_abort_values,true)? |
| 3329 | | ; get_wait_flag0(WF,WF0), |
| 3330 | ? | propagate_apply(X,Y,A,ApproxSizeA,WF,WF0,GroundX,WF1,GroundY)). |
| 3331 | | |
| 3332 | | :- block propagate_apply(?,?,?,?,?,-,?,?,?). |
| 3333 | | propagate_apply(X,Y,AVL,ApproxSizeA,WF,_,GroundX,WF1,GroundY) :- |
| 3334 | | var(GroundX), var(WF1), var(GroundY), |
| 3335 | | (preference(disprover_mode,true) |
| 3336 | | -> XX=X % this will also instantiate X and prevent finding WD errors |
| 3337 | | ; (ApproxSizeA<128 -> true |
| 3338 | | ; preference(solver_strength,SS), ApproxSizeA < 128+SS*100), % up until 4000 it may make sense to constrain Y |
| 3339 | | preference(data_validation_mode,false), % note: this can slow down ProB, e.g., test 1105; hence allow disabling it |
| 3340 | | preference(find_abort_values,false), % TO DO: v = %x.(x:1..20|x+x) & {y,z|y<4 & z=v(y) & (y:{-1,2})} =res: no WD ERROR found |
| 3341 | | propagate_value(X,XX) % only instantiate X, propagation only makes sense for propagate_avl_element_information_small, as otherwise only X will be bounded |
| 3342 | | ), |
| 3343 | | !, |
| 3344 | ? | propagate_avl_element_information_direct((XX,Y),AVL,ApproxSizeA,WF). |
| 3345 | | propagate_apply(_,_,_,_,_,_,_,_,_). |
| 3346 | | |
| 3347 | | % only propagate in one direction to allow to find WD errors but also prevent pending co-routines/constraints |
| 3348 | | :- block propagate_value(-,?). |
| 3349 | | propagate_value(int(X),R) :- !, |
| 3350 | | ( |
| 3351 | | %%integer(X) -> R=int(X) ; % relevant for SWI 8.5.10 and older where fd_set fails for integers, see test 788; should be fixed in next release |
| 3352 | | propagate_fd_dom(X,RX), R=int(RX), propagate_atomic_value(X,RX) |
| 3353 | | ). |
| 3354 | | propagate_value(fd(X,T),R) :- !, |
| 3355 | | ( |
| 3356 | | %%integer(X) -> R=fd(X,T) ; % for SWI 8.5.10 and older, see above |
| 3357 | | propagate_fd_dom(X,RX), R=fd(RX,T), propagate_atomic_value(X,RX) |
| 3358 | | ). |
| 3359 | | propagate_value((X1,X2),R) :- !, R=(RX1,RX2), propagate_value(X1,RX1), propagate_value(X2,RX2). |
| 3360 | | propagate_value(pred_true,R) :- !, if(R=pred_true,true,debug_println(9,function_arg_outside_domain(pred_true))). |
| 3361 | | propagate_value(pred_false,R) :- !, if(R=pred_false,true,debug_println(9,function_arg_outside_domain(pred_false))). |
| 3362 | | propagate_value(string(X),R) :- !, R=string(RX),propagate_atomic_value(X,RX). |
| 3363 | | propagate_value(X,RX) :- equal_object(X,RX). % TO DO: get rid of this: this propagates and prevents finding WD errors |
| 3364 | | :- block propagate_atomic_value(-,?). |
| 3365 | | propagate_atomic_value(X,Y) :- |
| 3366 | | if(X=Y,true,debug_println(9,function_arg_outside_domain(X))). |
| 3367 | | |
| 3368 | | %propagate_fd_dom(X,RX) :- integer(X),!,RX=X. % relevant for SWI 8.5.10 and older where fd_set fails for integers |
| 3369 | | propagate_fd_dom(X,RX) :- fd_set(X,Dom),in_set(RX,Dom). |
| 3370 | | |
| 3371 | | |
| 3372 | | /* |
| 3373 | | :- block propagate_apply(-,?,?,?,?,-,-). |
| 3374 | | % call propagate as soon as we know something about the function argument and we do not propgagate completely using GroundX/Y anyway |
| 3375 | | propagate_apply(X,Y,AVL,Size,WF,GroundX,GroundY) :- print(prop_apply(Size,GroundX,GroundY,X,Y)),nl, |
| 3376 | | (nonvar(GroundX) -> true ; nonvar(GroundY) -> true |
| 3377 | | ; propagate_avl_element_information((X,Y),AVL,Size,WF)). |
| 3378 | | |
| 3379 | | % get the waitflag when first WF set and other two not |
| 3380 | | :- block delay_get_wait_flag(-,-,-,?,?,?,?). |
| 3381 | | delay_get_wait_flag(_,WF1,WF2, _,_,_,_) :- (nonvar(WF1);nonvar(WF2)),!. % DO NOTHING |
| 3382 | | delay_get_wait_flag(_,_,_,Prio,Info,WF,WF2) :- get_wait_flag(Prio,Info,WF,WF2). |
| 3383 | | */ |
| 3384 | | |
| 3385 | | :- block apply_check_tuple_delay(?,?,?, ?,?,?, -,-,-). |
| 3386 | | apply_check_tuple_delay(X,Y,AVL,_ApproxSizeA,Span,WF,GroundX,WF1,_) :- |
| 3387 | | (nonvar(GroundX);nonvar(WF1)),!, |
| 3388 | ? | apply_check_tuple(X,Y,AVL,Span,WF). |
| 3389 | | apply_check_tuple_delay(X,Y,AVL,ApproxSizeA,Span,WF,_GroundX,_WF1,_GroundY) :- |
| 3390 | | % Y is ground; try to do an inverse function lookup |
| 3391 | | inverse_apply_ok(Y,X,AVL,ApproxSizeA,Span), |
| 3392 | | !, |
| 3393 | | % print(inverse_apply(Y,X,ApproxSizeA,_GroundX)),nl, |
| 3394 | | inverse_get_possible_values(X,Y,AVL,Res), |
| 3395 | | Res=avl_set(InvAVL), % if empty set : we fail |
| 3396 | | (preference(data_validation_mode,true), |
| 3397 | | avl_approximate_size(InvAVL,10,ApproxSize), |
| 3398 | | ApproxSize>1 |
| 3399 | | -> A2 is (ApproxSize*15*ApproxSize)//ApproxSizeA, % used to be A2 is ApproxSize*100, |
| 3400 | | A22 is max(A2,ApproxSize), |
| 3401 | | (get_inversion_penalty(Span) |
| 3402 | | -> A23 is A22 * 100 %, add_message(f,'Inversion Penalty: ',Y:A22,Span) |
| 3403 | | ; A23=A22), |
| 3404 | | % give lower priority for backwards propagation, upto 15 times if no reduction from backwards propagation |
| 3405 | | % but also take into account how much we reduce the size by inverting |
| 3406 | | % relevant for, e.g., Machines_perf_0111/Thales_All/rule_OPS_SDS_3940.mch |
| 3407 | | % or rule_OPS_SDS_6496 -> 15 instead of 150 improves performance |
| 3408 | | get_bounded_wait_flag(A23,element_of_avl_inverse_apply_ok(X),WF,WF2), |
| 3409 | | % does not call propagate_avl_element_information(X,InvAVL,ApproxSize,WF) or avl_to_table |
| 3410 | | element_of_avl_set_wf3(X,InvAVL,ApproxSize,WF2,WF) % TODO: pass GroundX |
| 3411 | | %apply_check_tuple_delay(X,Y,AVL,ApproxSizeA,Span,WF,GroundX,WF1,_) % now wait on WF1 or GroundX |
| 3412 | ? | ; element_of_avl_set_wf(InvAVL,X,WF) |
| 3413 | | ). |
| 3414 | | apply_check_tuple_delay(X,Y,AVL,ApproxSizeA,Span,WF,GroundX,WF1,_GroundY) :- |
| 3415 | | apply_check_tuple_delay(X,Y,AVL,ApproxSizeA,Span,WF,GroundX,WF1,_). % now wait on WF1 or GroundX |
| 3416 | | |
| 3417 | | % check if the function call was annotated as not suitable for backwards inverse function lookup propagation |
| 3418 | | get_inversion_penalty(span_predicate(b(_Function,_,Info),_LS,_S)) :- !, |
| 3419 | | get_inversion_penalty(Info). |
| 3420 | | get_inversion_penalty(Info) :- |
| 3421 | | member(prob_annotation('INVERSION_PENALTY'),Info). |
| 3422 | | |
| 3423 | | inverse_get_possible_values(X,Y,AVL,Res) :- |
| 3424 | | get_template(X,XX,_), |
| 3425 | | copy_term(XX,XX_Copy), % avoid that findall instantiates X |
| 3426 | | % TODO: copy_value_term similar to ground_value to avoid traversing avl_sets; but usually X is not a set |
| 3427 | | findall(XX_Copy, safe_avl_member_default((XX_Copy,Y),AVL), PossibleValues), |
| 3428 | | PossibleValues \= [], % fail straightaway |
| 3429 | | sort(PossibleValues,SPV), |
| 3430 | | % length(SPV,Len),print(inverse_image(Y,Len)),nl, print_term_summary(apply_check_tuple_delay(X,Y,AVL)),nl, |
| 3431 | | convert_to_avl(SPV,Res). |
| 3432 | | |
| 3433 | | % is it ok to compute inverse ? only makes sense if AVL tree not too big and quite functional |
| 3434 | | inverse_apply_ok(pred_true,_,_AVL,ApproxSizeA,_) :- !, % only two values possible, probably half of AVL will be returned |
| 3435 | | ApproxSizeA < 1023. % corresponds to avl_height < 10 |
| 3436 | | inverse_apply_ok(pred_false,_,_AVL,ApproxSizeA,_) :- !,ApproxSizeA < 1023. |
| 3437 | | % TO DO: other small types, such as fd(_,_) |
| 3438 | | inverse_apply_ok(_,_,_AVL,ApproxSizeA,_) :- ApproxSizeA < 255,!. |
| 3439 | | inverse_apply_ok(_,X,_AVL,ApproxSizeA,Span) :- ApproxSizeA < 65535, % corresponds Height < 16 |
| 3440 | | (preference(data_validation_mode,true) -> |
| 3441 | | (preference(solver_strength,SS), ApproxSizeA < 16383+SS -> true |
| 3442 | | ; perfmessage(inverse,'Function call not inverted (increase SOLVER_STRENGTH to enable this), approximate function size: ',ApproxSizeA,Span), |
| 3443 | | fail |
| 3444 | | ) |
| 3445 | | ; true), |
| 3446 | | quick_non_ground_check(X). |
| 3447 | | %inverse_apply_ok(_,_,_,_). |
| 3448 | | |
| 3449 | | % sometimes the ground_value_check co-routine hasn't grounded GroundX yet ! so do a quick check |
| 3450 | | quick_non_ground_check(X) :- var(X),!. |
| 3451 | | quick_non_ground_check([]) :- !,fail. |
| 3452 | | quick_non_ground_check(avl_set(_)) :- !,fail. |
| 3453 | | quick_non_ground_check(pred_true) :- !,fail. |
| 3454 | | quick_non_ground_check(pred_false) :- !,fail. |
| 3455 | | quick_non_ground_check(int(X)) :- !,var(X). |
| 3456 | | quick_non_ground_check(string(X)) :- !,var(X). |
| 3457 | | quick_non_ground_check(fd(X,T)) :- !,(var(X) ; var(T)). |
| 3458 | | quick_non_ground_check((A,B)) :- !, (quick_non_ground_check(A) -> true ; quick_non_ground_check(B)). |
| 3459 | | quick_non_ground_check(_). % assume it is non ground |
| 3460 | | |
| 3461 | | |
| 3462 | | |
| 3463 | | % apply_check_tuple is allowed to enumerate: either X is ground or Y is ground |
| 3464 | | apply_check_tuple(X,Y,A,Span,WF) :- |
| 3465 | | ground_value(X), |
| 3466 | | convert_to_avl_inside_set_wf(X,AX,WF),!, % we can do optimized lookup + checking in one go |
| 3467 | | % (but avl_apply only does partial check) |
| 3468 | | avl_apply(AX,A,XY,Span,WF), |
| 3469 | ? | kernel_objects:equal_object_wf(XY,Y,apply_check_tuple,WF). |
| 3470 | | :- if(environ(no_wd_checking, true)). |
| 3471 | | apply_check_tuple(X,Y,A,_Span,WF) :- safe_avl_member_default_wf((X,Y),A,WF). |
| 3472 | | :- else. |
| 3473 | | apply_check_tuple(X,Y,A,_Span,WF) :- preferences:preference(find_abort_values,false), !, |
| 3474 | | safe_flex_avl_member_default_wf((X,Y),A,WF). % will do a ground check again for X in flexible_decompose_index |
| 3475 | | apply_check_tuple(X,Y,A,Span,WF) :- !, |
| 3476 | | if(safe_flex_avl_member_default_wf((X,XY),A,WF), % does not detect abort errors if X unbound |
| 3477 | | kernel_objects:equal_object_wf(XY,Y,apply_check_tuple_avl,WF), |
| 3478 | | add_wd_error_span('function applied outside of domain (#4): ','@fun'(X,avl_set(A)),Span,WF)). |
| 3479 | | :- endif. |
| 3480 | | |
| 3481 | | |
| 3482 | | % ------------------------------------------ |
| 3483 | | |
| 3484 | | |
| 3485 | | :- use_module(b_global_sets,[b_type2_set/2]). |
| 3486 | | :- use_module(bsyntaxtree,[rename_bt/3]). |
| 3487 | | union_of_explicit_set(global_set(GS),_,R) :- is_maximal_global_set(GS), !, |
| 3488 | | R= global_set(GS). /* global_set is already maximal */ |
| 3489 | | union_of_explicit_set(freetype(GS),_,R) :- !, R= freetype(GS). /* freetype is already maximal */ |
| 3490 | | union_of_explicit_set(closure(P,T,B),_,R) :- is_definitely_maximal_closure(P,T,B), !, |
| 3491 | | R= closure(P,T,B). /* global_set is already maximal */ |
| 3492 | | union_of_explicit_set(_,S2,R) :- is_definitely_maximal_set(S2),!, % will also look at AVL set |
| 3493 | | R=S2. |
| 3494 | | union_of_explicit_set(S1,S2,R) :- nonvar(S2), S2 = [], !, R=S1. |
| 3495 | | union_of_explicit_set(S1,S2,_) :- (var(S1);var(S2)),!,fail. % then we cannot compute it here |
| 3496 | | union_of_explicit_set(S2,S1,R) :- |
| 3497 | | is_not_member_value_closure(S1,TYPE,MS1), nonvar(MS1), is_efficient_custom_set(MS1), |
| 3498 | | % also works if S2 is complement closure |
| 3499 | | difference_of_explicit_set(MS1,S2,Diff),!, |
| 3500 | | construct_complement_closure_if_necessary(Diff,TYPE,R). |
| 3501 | | union_of_explicit_set(avl_set(A1),S2,R) :- !, union_of_avl_set(S2,A1,R). |
| 3502 | | union_of_explicit_set(S1,S2,R) :- |
| 3503 | | is_not_member_value_closure(S1,TYPE,MS1), nonvar(MS1), is_efficient_custom_set(MS1), |
| 3504 | | difference_of_explicit_set(MS1,S2,Diff),!, |
| 3505 | | construct_complement_closure_if_necessary(Diff,TYPE,R). |
| 3506 | | union_of_explicit_set(S1,avl_set(A2),R) :- !, union_of_avl_set(S1,A2,R). |
| 3507 | | union_of_explicit_set(I1,I2,R) :- is_interval_closure_or_integerset(I1,From1,To1), ground(From1), ground(To1), |
| 3508 | | is_interval_closure_or_integerset(I2,From2,To2), ground(From2), ground(To2), |
| 3509 | | !, |
| 3510 | | (union_of_interval(From1,To1,From2,To2,FromRes,ToRes) |
| 3511 | | -> construct_interval_closure(FromRes,ToRes,R) |
| 3512 | | ; small_enough_for_expansion(From1,To1),small_enough_for_expansion(From2,To2) -> |
| 3513 | | % do not attempt union_of_closure below |
| 3514 | | expand_interval_closure_to_avl(From1,To1,R1), R1=avl_set(A1), % empty interval already dealt with above !? |
| 3515 | | expand_interval_closure_to_avl(From2,To2,R2), R2=avl_set(A2), % Note: unification after call as expand_interval calls equal_object (which gets confused by partially instantiated avl_set(_)) |
| 3516 | | union_of_avl(A1,A2,ARes),R=avl_set(ARes) /* AVL not normalised */ |
| 3517 | | ; transform_global_sets_into_closure(I1,closure(Par,T,Body)), |
| 3518 | | union_of_closure(I2,Par,T,Body,R) |
| 3519 | | ). |
| 3520 | | union_of_explicit_set(closure(P,T,B),C2,Res) :- |
| 3521 | | union_of_closure(C2,P,T,B,Res). |
| 3522 | | |
| 3523 | | small_enough_for_expansion(From1,To1) :- number(To1), number(From1), To1-From1<250. |
| 3524 | | |
| 3525 | | :- use_module(bsyntaxtree,[extract_info/2, extract_info_wo_used_ids/2, extract_info/3, rename_bt/3, replace_id_by_expr/4]). |
| 3526 | | |
| 3527 | | union_of_closure(global_set(X),P,T,B,Res) :- !, transform_global_sets_into_closure(global_set(X),C), |
| 3528 | | union_of_closure(C,P,T,B,Res). |
| 3529 | | union_of_closure(closure(P2,T2,B2),P,T,B,Res) :- !, |
| 3530 | | % T2 should be equal to T, module seq(_) <-> set(couple(integer,_)) |
| 3531 | | unify_closure_predicates(P,T,B, P2,T2,B2 , NewP,NewT, NewB1,NewB2), |
| 3532 | | debug:debug_println(9,union_of_two_closures(P,P2,NewP,NewT)), |
| 3533 | | extract_info(B,B2,NewInfo), |
| 3534 | | construct_disjunct(NewB1,NewB2,Disj), |
| 3535 | | Res = closure(NewP,NewT,b(Disj,pred,NewInfo)). |
| 3536 | | |
| 3537 | | % rename predicates of two closures so that they work on common closure parameter ids |
| 3538 | | % and can then be either joined by conjunction or disjunction |
| 3539 | | unify_closure_predicates(P,T,B, P2,T2,B2 , NewP,NewT, NewB1,NewB2) :- |
| 3540 | | length(P,Len1), length(P2,Len2), |
| 3541 | | (Len1=Len2 |
| 3542 | | -> generate_renaming_list(P,P2,RL), |
| 3543 | | rename_bt(B2,RL,NewB2), |
| 3544 | | NewP=P, NewT=T, NewB1 = B |
| 3545 | | ; Len1 < Len2 -> unify_clos_lt(P,T,B, P2,T2,B2 , NewP,NewT, NewB1,NewB2) |
| 3546 | | ; unify_clos_lt(P2,T2,B2, P,T,B , NewP,NewT, NewB2,NewB1) % inverted the predicate |
| 3547 | | ). |
| 3548 | | |
| 3549 | | % TO DO: generalize: currently only works for single identifier on left |
| 3550 | | % but works for id(NATURAL) \/ %x.(x<0|-x) or abs = id(NATURAL) \/ %x.(x<0|-x) & abs(2)=a2 & abs(-2)=am2 |
| 3551 | | unify_clos_lt([ID1],[couple(_,_)],B, P2,T2,B2 , NewP,NewT, NewB1,NewB2) :- |
| 3552 | | rename_lambda_result_id(P2,B2,P3,B3), |
| 3553 | | create_couple_term(P3,T2,Pair), |
| 3554 | | replace_id_by_expr(B,ID1,Pair,NewB1), |
| 3555 | | NewP=P3, NewT=T2, NewB2=B3. |
| 3556 | | |
| 3557 | | % _lambda_result_ id is not enumerated, hence we have to avoid inserting such ids into NewB1 as part of the pPair |
| 3558 | | rename_lambda_result_id(['_lambda_result_',ID2],B2,[FRESHID,ID2],B3) :- !,get_unique_id('_RANGE_',FRESHID), |
| 3559 | | rename_bt(B2,[rename('_lambda_result_',FRESHID)],B3). |
| 3560 | | rename_lambda_result_id([ID1,'_lambda_result_'],B2,[ID1,FRESHID],B3) :- !,get_unique_id('_RANGE_',FRESHID), |
| 3561 | | rename_bt(B2,[rename('_lambda_result_',FRESHID)],B3). |
| 3562 | | rename_lambda_result_id(P2,B2,P2,B2). |
| 3563 | | |
| 3564 | | % translate a list of atomic ids and a list of types into a couple-term |
| 3565 | | create_couple_term([ID1],[T1],Res) :- !, |
| 3566 | | create_texpr(identifier(ID1),T1,[],Res). |
| 3567 | | create_couple_term([ID1,ID2],[T1,T2],Res) :- |
| 3568 | | bsyntaxtree:create_couple(b(identifier(ID1),T1,[]),b(identifier(ID2),T2,[]),Res). |
| 3569 | | % TODO: extend for more than two args |
| 3570 | | |
| 3571 | | generate_renaming_list([],[],[]). |
| 3572 | | generate_renaming_list([ID|T],[ID2|T2],RL) :- |
| 3573 | | (ID==ID2 -> generate_renaming_list(T,T2,RL) |
| 3574 | | ; RL = [rename(ID2,ID)|RL2], |
| 3575 | | generate_renaming_list(T,T2,RL2)). |
| 3576 | | |
| 3577 | | |
| 3578 | | % a more clever way of constructing a disjunct; factor out common prefixes |
| 3579 | | % (A & B1) or (A1 & B2) <=> A1 & (B1 or B2) |
| 3580 | | % TO DO: we should try and get the leftmost basic conjunct ! |
| 3581 | | /* construct_disjunct(b(conjunct(A1,A2),pred,IA), b(conjunct(B1,B2),pred,_IB), Res) :- |
| 3582 | | |
| 3583 | | print('TRY DISJUNCT FACTOR: '), translate:print_bexpr(A1),nl, |
| 3584 | | translate:print_bexpr(B1),nl, |
| 3585 | | same_texpr_body(A1,B1),!, |
| 3586 | | print('DISJUNCT FACTOR: '), translate:print_bexpr(A1),nl, |
| 3587 | | Res = conjunct(A1,b(Disj,pred,IA)), |
| 3588 | | construct_disjunct(A2,B2,Disj). |
| 3589 | | */ |
| 3590 | | construct_disjunct(A,B,disjunct(A,B)). |
| 3591 | | |
| 3592 | | % TO DO: quick_check if AVL A1 is maximal ? |
| 3593 | | union_of_avl_set(avl_set(A2),A1,R) :- !, union_of_avl(A1,A2,ARes), R=avl_set(ARes). /* AVL not normalised */ |
| 3594 | | union_of_avl_set(I2,A1,R) :- is_interval_closure_or_integerset(I2,From2,To2), !, |
| 3595 | | ground(From2), ground(To2), % we can only compute it if bounds known |
| 3596 | | (avl_min(A1,int(Min)), low_border(From2,Min,FromRes), avl_max(A1,int(Max)), up_border(To2,Max,ToRes) |
| 3597 | | -> /* AVL contained (almost) in Interval */ |
| 3598 | | construct_interval_closure(FromRes,ToRes,R) |
| 3599 | | ; \+ small_interval(From2,To2) -> |
| 3600 | | transform_global_sets_into_closure(I2,closure(Par,T,Body)), % we may have something like NATURAL1,... |
| 3601 | | union_of_avl_set_with_closure(Par,T,Body,A1,R) |
| 3602 | | ; expand_and_convert_to_avl_set(I2,A2,union_of_avl_set,'? \\/ ARG'), % can generate ARel=empty; will fail if not possible to convert |
| 3603 | | union_of_avl(A1,A2,ARes), R=avl_set(ARes) |
| 3604 | | ). |
| 3605 | | union_of_avl_set(closure(Par,T,Body),A1,Res) :- is_infinite_or_symbolic_closure(Par,T,Body),!, |
| 3606 | | % TO DO: what if we are in SYMBOLIC mode and the type of T is infinite; maybe we should also keep the union symbolic ?? (cf Ticket/Georghe1) |
| 3607 | | union_of_avl_set_with_closure(Par,T,Body,A1,Res). |
| 3608 | | union_of_avl_set(S2,A1,Res) :- |
| 3609 | | S2 \= freetype(_), |
| 3610 | | ground_value(S2), % could be a closure |
| 3611 | | !, |
| 3612 | | (try_expand_and_convert_to_avl_set(S2,A2,union) |
| 3613 | | -> union_of_avl(A1,A2,ARes), Res=avl_set(ARes) /* AVL not normalised */ |
| 3614 | | ; S2=closure(Par,T,Body), |
| 3615 | | union_of_avl_set_with_closure(Par,T,Body,A1,Res)). |
| 3616 | | |
| 3617 | | try_expand_and_convert_to_avl_set(S2,A2,Source) :- |
| 3618 | | % false: do not add enumeration warning events as errors |
| 3619 | | catch_enumeration_warning_exceptions(expand_and_convert_to_avl_set(S2,A2,Source,''),fail,false,ignore(Source)). |
| 3620 | | |
| 3621 | | % try expanding to list, but catch enumeration warnings and fail if they do occur |
| 3622 | | % used by override(...) |
| 3623 | | %try_expand_custom_set_to_list(CS,_,_,_) :- nonvar(CS),CS=global_set(GS),is_infinite_global_set(GS,_), |
| 3624 | | % !, |
| 3625 | | % fail. |
| 3626 | | try_expand_custom_set_to_list(CS,_,_,_) :- nonvar(CS), |
| 3627 | | (is_symbolic_closure(CS) ; is_infinite_explicit_set(CS)), |
| 3628 | | !, % we could also check is_symbolic_closure |
| 3629 | | fail. |
| 3630 | | try_expand_custom_set_to_list(CS,List,Done,Source) :- |
| 3631 | | % false: do not add enumeration warning events as errors |
| 3632 | | catch_enumeration_warning_exceptions(expand_custom_set_to_list(CS,List,Done,Source),fail,false,ignore(Source)). |
| 3633 | | |
| 3634 | | |
| 3635 | | small_interval(From,To) :- number(From), number(To), To-From < 10000. |
| 3636 | | |
| 3637 | | union_of_avl_set_with_closure(Par,T,Body,A1,Res) :- |
| 3638 | | Body = b(_,BodyT,_), |
| 3639 | | setup_typed_ids(Par,T,TypedPar), |
| 3640 | | couplise_list(TypedPar,TypedCPar), |
| 3641 | | generate_couple_types(TypedCPar,ParExpr,ParType), |
| 3642 | | debug:debug_println(9,union_of_avl_and_infinite_closure(Par,T,BodyT)), |
| 3643 | | BodyAvl = b(member(ParExpr,b(value(avl_set(A1)),set(ParType),[])),pred,[]), |
| 3644 | | extract_info_wo_used_ids(Body,NewInfo), |
| 3645 | | Res = closure(Par,T,b(disjunct(BodyAvl,Body),pred,NewInfo)). |
| 3646 | | % mark_closure_as_symbolic(closure(Par,T,b(disjunct(BodyAvl,Body),pred,NewInfo)),Res). |
| 3647 | | |
| 3648 | | low_border(Low,AVLMin,R) :- geq_inf(AVLMin,Low),!,R=Low. |
| 3649 | | low_border(Low,AVLMin,R) :- number(Low),AVLMin is Low-1,R=AVLMin. % extend lower border by one |
| 3650 | | up_border(Up,AVLMax,R) :- geq_inf(Up,AVLMax),!,R=Up. |
| 3651 | | up_border(Up,AVLMax,R) :- number(Up),AVLMax is Up+1,R=AVLMax. % extend upper border by one |
| 3652 | | |
| 3653 | | |
| 3654 | | setup_typed_ids([],[],[]). |
| 3655 | | setup_typed_ids([ID|TI],[Type|TT],[b(identifier(ID),Type,[])|BT]) :- setup_typed_ids(TI,TT,BT). |
| 3656 | | |
| 3657 | | generate_couple_types(couple(A,B),b(couple(TA,TB),Type,[]),Type) :- !, Type = couple(TTA,TTB), |
| 3658 | | generate_couple_types(A,TA,TTA), |
| 3659 | | generate_couple_types(B,TB,TTB). |
| 3660 | | generate_couple_types(b(X,T,I),b(X,T,I),T). |
| 3661 | | |
| 3662 | | |
| 3663 | | % try to see if two intervals can be unioned into a new interval |
| 3664 | | union_of_interval(F1,T1,F2,T2,FR,TR) :- |
| 3665 | | geq_inf(F2,F1), geq_inf(T1,T2),!,FR=F1,TR=T1. % interval [F2,T2] contained in [F1,T1] |
| 3666 | | union_of_interval(F2,T2,F1,T1,FR,TR) :- geq_inf(F2,F1), geq_inf(T1,T2),!,FR=F1,TR=T1. % see above |
| 3667 | | union_of_interval(F1,T1,F2,T2,FR,TR) :- number(F2), |
| 3668 | | geq_inf(F2,F1), number(T1),T11 is T1+1,geq_inf(T11,F2), geq_inf(T2,F2),!,FR=F1,TR=T2. % intervals can be joined |
| 3669 | | union_of_interval(F2,T2,F1,T1,FR,TR) :- number(F2), |
| 3670 | | geq_inf(F2,F1), number(T1),T11 is T1+1,geq_inf(T11,F2), geq_inf(T2,F2),!,FR=F1,TR=T2. % see above |
| 3671 | | |
| 3672 | | :- use_module(library(ordsets),[ord_union/3]). |
| 3673 | | union_of_avl(A1,A2,ARes) :- |
| 3674 | | avl_height(A2,Sz2), |
| 3675 | | (Sz2 < 2 % we have something like Set := Set \/ {x}; no need to compute height of A1 |
| 3676 | | -> union_of_avl1(A1,99999,A2,Sz2,ARes) |
| 3677 | | ; avl_height(A1,Sz1), % TODO: we could call avl_height_less_than or avl_height_compare |
| 3678 | | (Sz1<Sz2 -> union_of_avl1(A2,Sz2,A1,Sz1,ARes) ; union_of_avl1(A1,Sz1,A2,Sz2,ARes)) |
| 3679 | | ). |
| 3680 | | union_of_avl1(A1,Sz1,A2,Sz2,ARes) :- Sz2>2, Sz1 =< Sz2+3, % difference not too big; Sz2 at least a certain size |
| 3681 | | !, |
| 3682 | | avl_to_list(A2,List2), % get all members |
| 3683 | | avl_to_list(A1,List1), |
| 3684 | | ord_union(List1,List2,L12), |
| 3685 | | ord_list_to_avl(L12,ARes). |
| 3686 | | union_of_avl1(A1,_Sz1,A2,_Sz2,ARes) :- % this version is better when A2 is small compared to A1 |
| 3687 | | avl_domain(A2,List2), % get all members |
| 3688 | | add_to_avl(List2,A1,ARes). |
| 3689 | | |
| 3690 | | :- use_module(library(lists),[reverse/2]). |
| 3691 | | % a custom version for union(A) where A is AVL set; avoid converting/expanding accumulators and computing avl_height |
| 3692 | | % runtime of e.g., UNION(x).(x:1000..1514|0..x) 0.65 sec or UNION(n).(n:10000..10010|UNION(x).(x:n..n+1000|n..x)) 4.8 sec is considerably smaller with this version |
| 3693 | | union_generalized_explicit_set(avl_set(SetsOfSets),Res,WF) :- |
| 3694 | | expand_custom_set_to_list_wf(avl_set(SetsOfSets),ESetsOfSets,_,union_generalized_wf,WF), |
| 3695 | | % length(ESetsOfSets,Len),print(union_gen(Len)),nl, |
| 3696 | | (ESetsOfSets=[OneSet] |
| 3697 | | -> Res=OneSet % avoid converting to list and back to Avl |
| 3698 | | ; reverse(ESetsOfSets,RESetsOfSets), % be sure to insert larger values first, so that ord_union has less work to do below; useful if you have many small singleton sets, for example union(ran(%x.(x : 1 .. 10000|{x * x}))) 2.37 secs --> 0.15 secs |
| 3699 | | % note: dom({r,x|x:1..50000 & r:{x*x}}) is still 3 times faster |
| 3700 | | union_of_avls(RESetsOfSets,[],Res)). |
| 3701 | | |
| 3702 | | % take the union of a list of avl_sets |
| 3703 | | union_of_avls([],Acc,Res) :- ord_list_to_avl(Acc,ARes), construct_avl_set(ARes,Res). |
| 3704 | | union_of_avls([H|T],Acc,Res) :- |
| 3705 | | union_of_avl_with_acc(H,Acc,NewAcc), |
| 3706 | | union_of_avls(T,NewAcc,Res). |
| 3707 | | |
| 3708 | | union_of_avl_with_acc(avl_set(H),Acc,NewAcc) :- !, |
| 3709 | | avl_to_list(H,HList), |
| 3710 | | ord_union(Acc,HList,NewAcc). |
| 3711 | | union_of_avl_with_acc([],Acc,Res) :- !,Res=Acc. |
| 3712 | | % other custom sets should normally not appear, we obtain the list as elements stored in an avl_set |
| 3713 | | union_of_avl_with_acc(G,_,_) :- add_internal_error('Uncovered element: ',union_of_avl_with_acc(G,_,_)),fail. |
| 3714 | | |
| 3715 | | |
| 3716 | | |
| 3717 | | % TO DO: there are no rules for is_not_member_value_closure for intersection below |
| 3718 | | intersection_of_explicit_set_wf(global_set(GS),S2,R,_WF) :- is_maximal_global_set(GS), !, R=S2. |
| 3719 | | intersection_of_explicit_set_wf(freetype(_GS),S2,R,_WF) :- !, R=S2. |
| 3720 | | intersection_of_explicit_set_wf(_,S2,_,_WF) :- var(S2),!,fail. % code below may instantiate S2 |
| 3721 | | intersection_of_explicit_set_wf(S1,S2,R,_WF) :- is_definitely_maximal_set(S2), !, R=S1. |
| 3722 | | intersection_of_explicit_set_wf(_S1,[],R,_WF) :-!, R=[]. |
| 3723 | | intersection_of_explicit_set_wf(avl_set(A1),I2,R,_WF) :- |
| 3724 | | is_interval_closure_or_integerset(I2,From1,To1), |
| 3725 | | !, |
| 3726 | | intersect_avl_interval(A1,From1,To1,R). |
| 3727 | | intersection_of_explicit_set_wf(I1,I2,R,_WF) :- |
| 3728 | | intersection_with_interval_closure(I1,I2,R),!. |
| 3729 | | intersection_of_explicit_set_wf(S1,S2,R,_WF) :- |
| 3730 | | get_avl_sets(S1,S2,A1,A2), |
| 3731 | | !, % if too large: better to apply normal intersection code ? |
| 3732 | | % if one of the args is an interval this is already caught in kernel_objects calling intersection_with_interval_closure; see SetIntersectionBig.mch |
| 3733 | | avl_domain(A1,ES), % A1 has the smaller height; important for e.g. SetIntersectionBig2.mch |
| 3734 | | inter2(ES,A2,IRes), |
| 3735 | | ord_list_to_avlset(IRes,R,intersection). % we have generated the elements in the right order already |
| 3736 | | intersection_of_explicit_set_wf(Set1,Set2,R,WF) :- |
| 3737 | | transform_global_sets_into_closure(Set1,closure(P1,T1,B1)), |
| 3738 | | transform_global_sets_into_closure(Set2,closure(P2,T2,B2)), |
| 3739 | | % gets called, e.g., for {x|x /: NATURAL1} /\ NATURAL1 |
| 3740 | | unify_closure_predicates(P1,T1,B1, P2,T2,B2 , NewP,NewT, NewB1,NewB2), |
| 3741 | | debug:debug_println(9,intersection_of_two_closures(P1,P2,NewP,NewT)), |
| 3742 | | conjunct_predicates([NewB1,NewB2],BI), |
| 3743 | | % create a conjunction: can be much more efficient than seperately expanding; |
| 3744 | | % also works well if one of the closures is infinite |
| 3745 | | C = closure(NewP,NewT,BI), |
| 3746 | | expand_custom_set_wf(C,R,intersection_of_explicit_set_wf,WF). % we could keep it symbolic; maybe use SYMBOLIC pref |
| 3747 | | % to do: also use above for closure and AVL set with member(P,value(avl_set(A))) |
| 3748 | | % we could also apply the same principle to difference_of_explicit_set |
| 3749 | | % currently we enable intersection to be treated symbolically (not_symbolic_binary(intersection) commented out) |
| 3750 | | % This means the above clause for intersection_of_explicit_set_wf is less useful |
| 3751 | | % a special case; just for interval closures |
| 3752 | | intersection_with_interval_closure(I1,I2,R) :- |
| 3753 | | is_interval_closure_or_integerset(I1,From1,To1), nonvar(I2), |
| 3754 | | intersection_with_interval_closure_aux(I2,From1,To1,R). |
| 3755 | | intersection_with_interval_closure(avl_set(A1),I2,R) :- |
| 3756 | | is_interval_closure_or_integerset(I2,From1,To1), |
| 3757 | | !, |
| 3758 | | intersect_avl_interval(A1,From1,To1,R). |
| 3759 | | |
| 3760 | | % try and get AVL sets from two args; first AVL set is smaller one according to height |
| 3761 | | get_avl_sets(avl_set(A1),S2,AA1,AA2) :- nonvar(S2), S2=avl_set(A2), |
| 3762 | ? | (avl_height_compare(A1,A2,R), R=lt |
| 3763 | | -> (AA1,AA2)=(A1,A2) |
| 3764 | | ; (AA1,AA2)=(A2,A1)). |
| 3765 | | %get_avl_sets(S1,S2,AA1,AA2) :- nonvar(S2),S2=avl_set(A2), get_avl_set_arg(S1,A1), |
| 3766 | | % (avl_height_compare(A1,A2,R),R=gt -> (AA1,AA2)=(A2,A1) ; (AA1,AA2)=(A1,A2)). |
| 3767 | | |
| 3768 | | |
| 3769 | | %intersection_with_interval_closure_aux(avl_set(A),... |
| 3770 | | intersection_with_interval_closure_aux(I2,From1,To1,R) :- |
| 3771 | | is_interval_closure_or_integerset(I2,From2,To2),!, |
| 3772 | | intersect_intervals_with_inf(From1,To1,From2,To2,FromRes,ToRes), |
| 3773 | | construct_interval_closure(FromRes,ToRes,R). |
| 3774 | | % (is_interval_closure_or_integerset(R,F,T) -> print(ok(F,T)),nl ; print(ko),nl). |
| 3775 | | intersection_with_interval_closure_aux(avl_set(A2),From1,To1,R) :- |
| 3776 | | intersect_avl_interval(A2,From1,To1,R). |
| 3777 | | |
| 3778 | | % intersect avl with interval |
| 3779 | | % TO DO: expand interval if small (or small intersection with AVL) and use avl intersection |
| 3780 | | intersect_avl_interval(_,From2,To2,_) :- (var(From2) ; var(To2)),!,fail. |
| 3781 | | intersect_avl_interval(A1,From2,To2,R) :- avl_min(A1,int(Min)), |
| 3782 | | geq_inf(Min,From2), |
| 3783 | | geq_inf(To2,Min), avl_max(A1,int(Max)), |
| 3784 | | geq_inf(To2,Max), |
| 3785 | | % AVL fully contained in interval; no need to expand to list and back again |
| 3786 | | !, |
| 3787 | | construct_avl_set(A1,R). |
| 3788 | | intersect_avl_interval(A1,From2,To2,R) :- |
| 3789 | | avl_domain(A1,ES), |
| 3790 | | inter_interval(ES,From2,To2,IRes), |
| 3791 | | ord_list_to_avlset(IRes,R,intersect_avl_interval). |
| 3792 | | |
| 3793 | | inter_interval([],_,_, []). |
| 3794 | | inter_interval([IH|T],From2,To2, Res) :- IH = int(H), |
| 3795 | | (geq_inf(To2,H) -> |
| 3796 | | (geq_inf(H,From2) -> Res = [IH-true|Res2] ; Res = Res2), |
| 3797 | | inter_interval(T,From2,To2,Res2) |
| 3798 | | ; Res = [] % we have exceeded the upper limit of the interval |
| 3799 | | ). |
| 3800 | | |
| 3801 | | intersect_intervals_with_inf(From1,To1,From2,To2,FromRes,ToRes) :- |
| 3802 | | minimum_with_inf(To1,To2,ToRes), |
| 3803 | | maximum_with_inf(From1,From2,FromRes). |
| 3804 | | |
| 3805 | | % check if two intervals are disjoint |
| 3806 | | disjoint_intervals_with_inf(From1,To1,From2,To2) :- |
| 3807 | | intersect_intervals_with_inf(From1,To1,From2,To2,Low,Up), |
| 3808 | | number(Up), number(Low), Low > Up. |
| 3809 | | |
| 3810 | | inter2([],_, []). |
| 3811 | | inter2([H|T],A1, Res) :- |
| 3812 | | (avl_fetch(H,A1) -> Res = [H-true|Res2] ; Res = Res2), inter2(T,A1,Res2). |
| 3813 | | |
| 3814 | | ord_list_to_avlset(OL,R) :- ord_list_to_avlset(OL,R,unknown). |
| 3815 | | ord_list_to_avlset(OrdList,Res,Origin) :- |
| 3816 | | % assumes that we have generated the elements in the right order already |
| 3817 | | (OrdList=[] -> Res=[] |
| 3818 | | ; check_sorted(OrdList,Origin), |
| 3819 | | ord_list_to_avl(OrdList,ARes), Res=avl_set(ARes)). |
| 3820 | | |
| 3821 | | % a version which accepts a list of values without -true |
| 3822 | | % values have to be ground and already converted for use in avl_set |
| 3823 | | sorted_ground_normalised_list_to_avlset(List,Res,PP) :- |
| 3824 | | add_true_to_list(List,LT), |
| 3825 | | ord_list_to_avlset_direct(LT,Res,PP). |
| 3826 | | |
| 3827 | | add_true_to_list([],[]). |
| 3828 | | add_true_to_list([H|T],[H-true|TT]) :- add_true_to_list(T,TT). |
| 3829 | | |
| 3830 | | % the same, but without checking sorted (only use if you are really sure the list is sorted) |
| 3831 | | ord_list_to_avlset_direct([],[],_). |
| 3832 | | ord_list_to_avlset_direct([H|T],Res,_):- |
| 3833 | | (T==[] -> H=Key-Val, Res = avl_set(node(Key,Val,0,empty,empty)) % slightly faster than calling ord_list_to_avl |
| 3834 | | ; ord_list_to_avl([H|T],ARes), Res = avl_set(ARes)). |
| 3835 | | |
| 3836 | | check_sorted([],_) :- !. |
| 3837 | | check_sorted([H-_|T],Origin) :- !, check_sorted2(T,H,Origin). |
| 3838 | | check_sorted(X,Origin) :- add_error_and_fail(ord_list_to_avlset,'Not a list of -/2 pairs: ',Origin:X). |
| 3839 | | |
| 3840 | | check_sorted2([],_,_) :- !. |
| 3841 | | check_sorted2([H-_|T],PH,Origin) :- PH @< H,!, check_sorted2(T,H,Origin). |
| 3842 | | check_sorted2(X,Prev,Origin) :- |
| 3843 | | add_error_and_fail(ord_list_to_avlset,'Not a sorted list of -/2 pairs: ',Origin:(X,Prev)). |
| 3844 | | |
| 3845 | | % ------------------ |
| 3846 | | |
| 3847 | | :- use_module(kernel_freetypes,[is_maximal_freetype/1]). |
| 3848 | | is_definitely_maximal_set(S) :- nonvar(S), |
| 3849 | | is_definitely_maximal_set2(S). |
| 3850 | | is_definitely_maximal_set2(freetype(ID)) :- is_maximal_freetype(ID). |
| 3851 | | is_definitely_maximal_set2(global_set(GS)) :- is_maximal_global_set(GS). |
| 3852 | | is_definitely_maximal_set2(closure(P,T,B)) :- is_definitely_maximal_closure(P,T,B). |
| 3853 | | is_definitely_maximal_set2(avl_set(S)) :- quick_definitely_maximal_set_avl(S). |
| 3854 | | is_definitely_maximal_set2([H|T]) :- nonvar(H), is_definitely_maximal_list(H,T). %, nl,print(maximal(H,T)),nl,nl. |
| 3855 | | %H==pred_true, T == [pred_false]. % for some reason BOOL is sometimes presented this way |
| 3856 | | is_definitely_maximal_set2(empty) :- % detect unwrapped AVL sets |
| 3857 | | add_internal_error('Not a set: ',is_definitely_maximal_set2(empty)),fail. |
| 3858 | | is_definitely_maximal_set2(node(A,B,C,D,E)) :- |
| 3859 | | add_internal_error('Not a set: ',is_definitely_maximal_set2(node(A,B,C,D,E))),fail. |
| 3860 | | |
| 3861 | | is_definitely_maximal_list(pred_true,T) :- nonvar(T), T=[_|_]. % |
| 3862 | | is_definitely_maximal_list(pred_false,T) :- nonvar(T), T=[_|_].% |
| 3863 | | is_definitely_maximal_list(fd(_,Type),T) :- nonvar(T),b_global_set_cardinality(Type,Card), |
| 3864 | | % check if we have the same number of elements as the type: then the set must me maximal |
| 3865 | | length_at_least(T,Card). |
| 3866 | | % We could try and and also treat pairs |
| 3867 | | |
| 3868 | | length_at_least(1,_) :- !. % we have already removed 1 element; T can be nil |
| 3869 | | length_at_least(N,T) :- nonvar(T), T=[_|TT], N1 is N-1, length_at_least(N1,TT). |
| 3870 | | |
| 3871 | | is_definitely_maximal_closure(_,_,b(truth,_Pred,_)) :- !. |
| 3872 | | is_definitely_maximal_closure(P,T,B) :- is_cartesian_product_closure_aux(P,T,B,S1,S2),!, |
| 3873 | | is_definitely_maximal_set(S1),is_definitely_maximal_set(S2). |
| 3874 | | is_definitely_maximal_closure(P,T,B) :- |
| 3875 | | is_full_powerset_or_relations_or_struct_closure(closure(P,T,B),Sets), |
| 3876 | | l_is_definitely_maximal_set(Sets). |
| 3877 | | |
| 3878 | | l_is_definitely_maximal_set([]). |
| 3879 | | l_is_definitely_maximal_set([H|T]) :- is_definitely_maximal_set(H), l_is_definitely_maximal_set(T). |
| 3880 | | |
| 3881 | | % check if we have an AVL tree covering all elements of the underlying type |
| 3882 | | quick_definitely_maximal_set_avl(AVL) :- |
| 3883 | | AVL=node(El,_True,_,_Left,_Right), |
| 3884 | | quick_definitely_maximal_set_avl_aux(El,AVL). |
| 3885 | | quick_definitely_maximal_set_avl_aux(El,AVL) :- |
| 3886 | | try_get_finite_max_card_from_ground_value(El,Card), |
| 3887 | | % this could fail if El contains empty sets ! |
| 3888 | | % also: it must fail if Card is infinite (no avl_set can be maximal) |
| 3889 | | (Card < 1000 -> true |
| 3890 | | ; preferences:preference(solver_strength,SS), Card < 1000+SS*100 |
| 3891 | | ), % otherwise too expensive a check avl_size |
| 3892 | | quick_avl_approximate_size(AVL,MaxSize), |
| 3893 | | MaxSize >= Card, % otherwise no sense in computing avl_size, which is linear in size of AVL |
| 3894 | | avl_size(AVL,Size), |
| 3895 | | %(MaxSize>=Size -> print(ok(Size,all(Card))),nl ; print('**** ERROR: '), print(Size),nl,trace), |
| 3896 | | Size=Card. |
| 3897 | | |
| 3898 | | % check if we have an AVL function with domain covering all elements of the underlying type |
| 3899 | | quick_definitely_maximal_total_function_avl(AVL) :- |
| 3900 | | AVL=node(El,_True,_,_Left,_Right), |
| 3901 | | El=(DomEl,_), |
| 3902 | | quick_definitely_maximal_set_avl_aux(DomEl,AVL), % the size is exactly the size of the domain |
| 3903 | | is_avl_partial_function(AVL). |
| 3904 | | |
| 3905 | | % ---------------------- |
| 3906 | | % set_subtraction / |
| 3907 | | difference_of_explicit_set(S1,S2,R) :- |
| 3908 | | difference_of_explicit_set_wf(S1,S2,R,no_wf_available). |
| 3909 | | % this is called with first argument nonvar (for set_subtraction operator): |
| 3910 | | difference_of_explicit_set_wf(_S1,S2,R,_) :- |
| 3911 | | is_definitely_maximal_set(S2), !, R=[]. |
| 3912 | | difference_of_explicit_set_wf(S1,S2,R,_) :- nonvar(S2), S2=[],!, R=S1. |
| 3913 | | difference_of_explicit_set_wf(S1,S2,R,_) :- |
| 3914 | | %nonvar(S1), |
| 3915 | ? | is_very_large_maximal_global_set(S1,Type), !, % TO DO: also for freetype ? cartesian products,... |
| 3916 | | /* we have a complement-set */ |
| 3917 | | complement_set(S2,Type,R). |
| 3918 | | difference_of_explicit_set_wf(S1,S2,Result,_) :- |
| 3919 | | is_not_member_value_closure(S1,Type,MS1), |
| 3920 | | nonvar(MS1), is_custom_explicit_set(MS1,difference_of_explicit_set_wf),!, |
| 3921 | | union_complement_set(MS1,S2,Type,Result). |
| 3922 | | difference_of_explicit_set_wf(_,S2,_,_) :- var(S2), !, fail. % then we cannot do anything below |
| 3923 | | difference_of_explicit_set_wf(S1,S2,R,WF) :- |
| 3924 | | is_not_member_value_closure(S2,_Type,MS2), nonvar(MS2), |
| 3925 | | intersection_of_explicit_set_wf(MS2,S1,R,WF),!. |
| 3926 | | difference_of_explicit_set_wf(I1,I2,R,_) :- |
| 3927 | | is_interval_closure_or_integerset(I1,From1,To1), |
| 3928 | | is_interval_closure_or_integerset(I2,From2,To2), |
| 3929 | | difference_interval(From1,To1,From2,To2,FromRes,ToRes), |
| 3930 | | % TO DO: also treat case when difference yields two disjoint intervals |
| 3931 | | % i.e., do not fail and forget info about interval bounds in case we cannot compute difference as a an interval, e.g., INT - {0} |
| 3932 | | !, |
| 3933 | | construct_interval_closure(FromRes,ToRes,R). |
| 3934 | | difference_of_explicit_set_wf(avl_set(A1),S2,R,WF) :- |
| 3935 | | (S2=avl_set(A2) ; |
| 3936 | | ground_value(S2), expand_and_convert_to_avl_set_unless_very_large(S2,A2,WF)),!, |
| 3937 | | avl_height(A2,H2), |
| 3938 | | %avl_min(A1,Min1),avl_max(A1,Max1), avl_min(A2,Min2),avl_max(A2,Max2), avl_height(A1,H1),nl,print(diff(avl(H1,Min1,Max1),avl(H2,Min2,Max2))),nl, |
| 3939 | | avl_height(A1,H1), |
| 3940 | | ((H2<2 -> true ; H1 > H2+1) % then it is more efficient to expand A2 and remove the A2 elements from A1; |
| 3941 | | % note that difference_of_explicit_set2 now also sometimes expands both: |
| 3942 | | % exact threshold when it is beneficial: difference_of_explicit_set2/3 |
| 3943 | | % for {x|x:1..200000 & x mod 2 = 0} - {y|y:2500..29010 & y mod 2 = 0} -> 150 ms vs 80 ms avl(17,int(2),int(200000)),avl(14,int(2500),int(29010) |
| 3944 | | % {x|x:1..200000 & x mod 2 = 0} - {y|y:2500..59010 & y mod 2 = 0} -> 180 ms vs 80 ms avl(17,int(2),int(200000)),avl(15,int(2500),int(59010)) |
| 3945 | | % {x|x:1..200000 & x mod 2 = 0} - {y|y:500..159010 & y mod 2 = 0} -> 180 ms vs 250 ms avl(17,int(2),int(200000)),avl(17,int(500),int(159010)) |
| 3946 | | -> expand_custom_set_to_sorted_list(S2,ES,_,difference_of_explicit_set1,WF), |
| 3947 | | difference_of_explicit_set3(ES,A1,R) |
| 3948 | | ; expand_custom_set_to_sorted_list(avl_set(A1),ES,Done,difference_of_explicit_set2,WF), |
| 3949 | | difference_of_explicit_set2(ES,H1,A2,H2,R,Done)). |
| 3950 | | difference_of_explicit_set_wf(S1,S2,R,WF) :- |
| 3951 | | (S2=avl_set(A2) ; |
| 3952 | | ground_value(S2), expand_and_convert_to_avl_set_unless_very_large(S2,A2,WF)),!, |
| 3953 | | avl_height(A2,A2Height), |
| 3954 | | difference_with_avl(S1,A2,A2Height,R,WF). |
| 3955 | | % to do: we could detect same_texpr_body for two closures and return R=[] |
| 3956 | | |
| 3957 | | :- use_module(avl_tools,[avl_approximate_size_from_height/2]). |
| 3958 | | :- use_module(bsyntaxtree,[safe_create_texpr/4, create_texpr/4, conjunct_predicates/2, mark_bexpr_as_symbolic/2]). |
| 3959 | | difference_with_avl(S1,A2,A2Height,R,_) :- |
| 3960 | | is_closure_or_integer_set(S1,[ID],[T],B), |
| 3961 | | % check if the first argument is infinite; then do the difference set symbolically |
| 3962 | | % this could supersed the complement set construction and be generalised to other sets apart from avl_sets as A2 |
| 3963 | | avl_approximate_size_from_height(A2Height,A2Size), |
| 3964 | | Limit is max(A2Size*10,1000000), % if A2 is more than 10% size of S1, probably better to compute difference explicitly |
| 3965 | | is_very_large_or_symbolic_closure([ID],[T],B,Limit), |
| 3966 | | !, % TO DO: also allow multiple identifiers |
| 3967 | | create_texpr(identifier(ID),T,[],TID), |
| 3968 | | create_texpr(value(avl_set(A2)),set(T),[],A2Value), |
| 3969 | | create_texpr(not_member(TID,A2Value),pred,[],NotMemA2), |
| 3970 | | conjunct_predicates([B,NotMemA2],NewBody), |
| 3971 | | mark_bexpr_as_symbolic(NewBody,NewBodyS), |
| 3972 | | R = closure([ID],[T],NewBodyS). |
| 3973 | | difference_with_avl(S1,A2,A2Height,R,WF) :- |
| 3974 | | (nonvar(S1),S1=avl_set(A1) -> avl_height(A1,H1) ; H1=unknown), |
| 3975 | | expand_custom_set_to_sorted_list(S1,ES,Done,difference_of_explicit_set3,WF), |
| 3976 | | difference_of_explicit_set2(ES,H1,A2,A2Height,R,Done). |
| 3977 | | |
| 3978 | | |
| 3979 | | % construct complement of a set |
| 3980 | | union_complement_set(S1,S2,Type,Result) :- |
| 3981 | | ground_value_check(S2,G2), |
| 3982 | | when(nonvar(G2),union_complement_set2(S1,S2,Type,Result)). |
| 3983 | | union_complement_set2(S1,S2,Type,Result) :- |
| 3984 | | union_of_explicit_set(S1,S2,S12), |
| 3985 | | construct_complement_closure_if_necessary(S12,Type,R), |
| 3986 | | kernel_objects:equal_object(R,Result,union_complement_set2). |
| 3987 | | |
| 3988 | | % construct complement of a set |
| 3989 | | complement_set(S2,Type,Result) :- |
| 3990 | | ground_value_check(S2,G2), |
| 3991 | | when(nonvar(G2),complement_set2(S2,Type,Result)). |
| 3992 | | complement_set2(S2,Type,Result) :- |
| 3993 | | is_not_member_value_closure(S2,Type,MS2),!, % complement of complement |
| 3994 | | kernel_objects:equal_object(MS2,Result,complement_set2). |
| 3995 | | complement_set2(S2,Type,Result) :- |
| 3996 | | try_expand_and_convert_to_avl_with_check(S2,ExpandedS2,difference_complement_set), |
| 3997 | | construct_complement_closure_if_necessary(ExpandedS2,Type,R), |
| 3998 | | kernel_objects:equal_object(R,Result,complement_set2). |
| 3999 | | |
| 4000 | | :- block construct_complement_closure_if_necessary(-,?,?). |
| 4001 | | construct_complement_closure_if_necessary(Set,TYPE,R) :- |
| 4002 | | (Set=[] -> b_type2_set(TYPE,R) |
| 4003 | | ; is_not_member_value_closure(Set,TYPE,MS) -> R=MS % complement of complement |
| 4004 | | ; construct_complement_closure(Set,TYPE,R)). |
| 4005 | | |
| 4006 | | % succeeds if difference of two intervals is also an interval |
| 4007 | | % SourceLow..SourceUp \ DiffLow..DiffUp |
| 4008 | | :- assert_must_succeed(custom_explicit_sets:difference_interval(1,10,9,11,1,8)). |
| 4009 | | :- assert_must_succeed(custom_explicit_sets:difference_interval(1,10,9,inf,1,8)). |
| 4010 | | :- assert_must_succeed(custom_explicit_sets:difference_interval(1,10,10,12,1,9)). |
| 4011 | | :- assert_must_succeed(custom_explicit_sets:difference_interval(1,10,11,12,1,10)). |
| 4012 | | :- assert_must_succeed(custom_explicit_sets:difference_interval(1,10,12,13,1,10)). |
| 4013 | | :- assert_must_succeed(custom_explicit_sets:difference_interval(1,10,11,inf,1,10)). |
| 4014 | | :- assert_must_succeed(custom_explicit_sets:difference_interval(1,inf,11,inf,1,10)). |
| 4015 | | % :- assert_must_succeed(custom_explicit_sets:difference_interval(1,10,9,8,1,10)). % 9..8 empty not detected |
| 4016 | | :- assert_must_succeed(custom_explicit_sets:difference_interval(1,10,1,8,9,10)). |
| 4017 | | :- assert_must_succeed(custom_explicit_sets:difference_interval(1,10,1,10,11,10)). % empty |
| 4018 | | :- assert_must_succeed(custom_explicit_sets:difference_interval(1,10,1,inf,inf,10)). |
| 4019 | | :- assert_must_succeed(custom_explicit_sets:difference_interval(3,10,1,2,3,10)). |
| 4020 | | :- assert_must_succeed(custom_explicit_sets:difference_interval(3,inf,1,2,3,inf)). |
| 4021 | | :- assert_must_succeed(custom_explicit_sets:difference_interval(3,10,1,3,4,10)). |
| 4022 | | :- assert_must_succeed(custom_explicit_sets:difference_interval(3,10,1,9,10,10)). |
| 4023 | | :- assert_must_succeed(custom_explicit_sets:difference_interval(3,10,1,10,11,10)). |
| 4024 | | difference_interval(SourceLow,SourceUp,DiffLow,DiffUp,ResLow,ResUp) :- |
| 4025 | | (nonvar(SourceLow),nonvar(DiffLow),nonvar(DiffUp), |
| 4026 | | geq_inf(SourceLow,DiffLow) |
| 4027 | | -> % DiffLow is to left of SourceLow |
| 4028 | | inc(DiffUp,D1), |
| 4029 | | maximum_with_inf(D1,SourceLow,ResLow), |
| 4030 | | ResUp=SourceUp % also works if SourceUp is a variable |
| 4031 | | ; nonvar(DiffUp),nonvar(SourceUp),nonvar(DiffLow), |
| 4032 | | geq_inf(DiffUp,SourceUp) |
| 4033 | | -> % DiffUp is to right of SourceUp |
| 4034 | | ResLow=SourceLow, % also works if SourceLow is a variable |
| 4035 | | dec(DiffLow,D1), |
| 4036 | | minimum_with_inf(SourceUp,D1,ResUp)). |
| 4037 | | |
| 4038 | | inc(N,R) :- N==inf,!,R=inf. |
| 4039 | | inc(N,N1) :- N1 is N+1. |
| 4040 | | dec(N,R) :- N==inf,!,R=inf. |
| 4041 | | dec(N,N1) :- N1 is N-1. |
| 4042 | | |
| 4043 | | :- use_module(library(ordsets), [ord_subtract/3]). |
| 4044 | | :- block difference_of_explicit_set2(?,?,?,?,?,-). |
| 4045 | | difference_of_explicit_set2(ES,A1Height,A2,A2Height,R,_) :- |
| 4046 | | (number(A1Height), A1Height+4 >= A2Height -> true |
| 4047 | | ; A2Height < 5 |
| 4048 | | ; Limit is 2**(A2Height-4), |
| 4049 | | length_larger_than(ES,Limit) |
| 4050 | | % TO DO: we could try and pass sizes from specific closures to this predicate |
| 4051 | | ), |
| 4052 | | % A1 is not much larger than A2, then it is probably faster to use ord_subtract on expanded A2 |
| 4053 | | % {x|x mod 2 =0 & x:1..10000} - {y|y mod 3 =0 & y : 1..200000} : still more efficient with ord_subtract |
| 4054 | | !, |
| 4055 | | avl_domain(A2,A2Expanded), |
| 4056 | | ord_subtract(ES,A2Expanded,OrdRes), |
| 4057 | | sorted_ground_normalised_list_to_avlset(OrdRes,AVL,difference_of_explicit_set2), |
| 4058 | | equal_object(AVL,R). |
| 4059 | | difference_of_explicit_set2(ES,_A1Height,A2,_A2Height,R,_) :- |
| 4060 | | avl_min(A2,Min), |
| 4061 | | diff1(ES,Min,A2,IRes), |
| 4062 | | ord_list_to_avlset(IRes,AVL,difference), % we have generated the elements in the right order already |
| 4063 | | equal_object(AVL,R). % due to delays in expansion the result could be instantiated |
| 4064 | | |
| 4065 | | |
| 4066 | | length_larger_than([_|T],Limit) :- |
| 4067 | | (Limit<1 -> true |
| 4068 | | ; L1 is Limit-1, length_larger_than(T,L1)). |
| 4069 | | |
| 4070 | | diff1([],_, _,[]). |
| 4071 | | diff1([H|T],Min,A1, Res) :- |
| 4072 | | (H @< Min -> Res = [H-true|Res2],diff1(T,Min,A1,Res2) |
| 4073 | | ; diff2([H|T],A1,Res)).% TO DO: compute avl_max |
| 4074 | | |
| 4075 | | diff2([],_, []). |
| 4076 | | diff2([H|T],A1, Res) :- |
| 4077 | | (avl_fetch(H,A1) -> Res = Res2 ; Res = [H-true|Res2]), diff2(T,A1,Res2). |
| 4078 | | |
| 4079 | | % another version to be used when second set small in comparison to first set |
| 4080 | | difference_of_explicit_set3([],A1,Res) :- construct_avl_set(A1,AVL), |
| 4081 | | equal_object(AVL,Res). % due to delay in expansion, Res could now be instantiated |
| 4082 | | difference_of_explicit_set3([H|T],A1,ARes) :- |
| 4083 | | (avl_delete(H,A1,_True,A2) -> true ; A2=A1), |
| 4084 | | difference_of_explicit_set3(T,A2,ARes). |
| 4085 | | |
| 4086 | | % ------------------------- |
| 4087 | | |
| 4088 | | % a version of add_element_to_explicit_set where we have already done the groundness check |
| 4089 | | add_ground_element_to_explicit_set_wf(avl_set(A),Element,R,WF) :- !, |
| 4090 | | convert_to_avl_inside_set_wf(Element,AEl,WF), |
| 4091 | | avl_store(AEl,A,true,A2),!,R=avl_set(A2). |
| 4092 | | add_ground_element_to_explicit_set_wf(Set,Element,R,WF) :- |
| 4093 | | add_element_to_explicit_set_wf(Set,Element,R,WF). |
| 4094 | | |
| 4095 | | add_element_to_explicit_set_wf(global_set(GS),_,R,_) :- is_maximal_global_set(GS), !, R=global_set(GS). |
| 4096 | | add_element_to_explicit_set_wf(freetype(ID),_,R,_) :- is_maximal_freetype(ID),!, R=freetype(ID). |
| 4097 | | add_element_to_explicit_set_wf(avl_set(A),Element,R,WF) :- |
| 4098 | | ground_value(Element), %% was element_can_be_added_or_removed_to_avl(Element), |
| 4099 | | convert_to_avl_inside_set_wf(Element,AEl,WF), |
| 4100 | | avl_store(AEl,A,true,A2),!,R=avl_set(A2). /* AVL not normalised */ |
| 4101 | | /* do we need to add support for (special) closures ?? |
| 4102 | | add_element_to_explicit_set_wf(Clos,Element,R,_) :- nonvar(Element),Element=int(X), nonvar(X), |
| 4103 | | is_interval_closure_or_integerset(Clos,Low,Up), ground(Low), ground(Up), |
| 4104 | | union_of_interval(X,X,Low,Up,FromRes,ToRes), |
| 4105 | | !, |
| 4106 | | construct_interval_closure(FromRes,ToRes,R). |
| 4107 | | % not-member closure not dealt with here |
| 4108 | | */ |
| 4109 | | |
| 4110 | | element_can_be_added_or_removed_to_avl(Element) :- |
| 4111 | | ground_value(Element), |
| 4112 | | does_not_contain_closure(Element). |
| 4113 | | ground_element_can_be_added_or_removed_to_avl(Element) :- /* use if you know the element to be ground */ |
| 4114 | | does_not_contain_closure(Element). |
| 4115 | | |
| 4116 | | % does not contain closure or infinite other sets |
| 4117 | | does_not_contain_closure([]). |
| 4118 | | does_not_contain_closure([H|T]) :- |
| 4119 | | (simple_value(H) -> true /* TO DO: check if we could have a closure at the end ?? */ |
| 4120 | | ; does_not_contain_closure(H),list_does_not_contain_closure(T)). |
| 4121 | | does_not_contain_closure(fd(_,_)). |
| 4122 | | does_not_contain_closure(pred_true /* bool_true */). |
| 4123 | | does_not_contain_closure(pred_false /* bool_false */). |
| 4124 | | does_not_contain_closure(int(_)). |
| 4125 | | does_not_contain_closure(string(_)). |
| 4126 | | does_not_contain_closure(term(_)). % real/floating number |
| 4127 | | does_not_contain_closure((X,Y)) :- does_not_contain_closure(X), does_not_contain_closure(Y). |
| 4128 | | does_not_contain_closure(avl_set(_)). |
| 4129 | | does_not_contain_closure(global_set(G)) :- \+ is_infinite_global_set(G,_). |
| 4130 | | %does_not_contain_closure(freetype(_)). |
| 4131 | | does_not_contain_closure(freeval(_,_,Value)) :- does_not_contain_closure(Value). |
| 4132 | | does_not_contain_closure(rec(Fields)) :- does_not_contain_closure_fields(Fields). |
| 4133 | | |
| 4134 | | does_not_contain_closure_fields([]). |
| 4135 | | does_not_contain_closure_fields([field(_,Val)|T]) :- does_not_contain_closure(Val), |
| 4136 | | does_not_contain_closure_fields(T). |
| 4137 | | |
| 4138 | | list_does_not_contain_closure([]). |
| 4139 | | list_does_not_contain_closure([H|T]) :- |
| 4140 | | does_not_contain_closure(H),list_does_not_contain_closure(T). |
| 4141 | | list_does_not_contain_closure(avl_set(_)). |
| 4142 | | list_does_not_contain_closure(global_set(G)) :- \+ is_infinite_global_set(G,_). |
| 4143 | | |
| 4144 | | simple_value(fd(_,_)). |
| 4145 | | simple_value(pred_true /* bool_true */). |
| 4146 | | simple_value(pred_false /* bool_false */). |
| 4147 | | simple_value(int(_)). |
| 4148 | | simple_value((A,B)) :- simple_value(A), simple_value(B). |
| 4149 | | simple_value(string(_)). |
| 4150 | | |
| 4151 | | |
| 4152 | | % a version of the above which throws error if element cannot be added |
| 4153 | | % assumes element_can_be_added_or_removed_to_avl has been checked |
| 4154 | | remove_element_from_explicit_set(avl_set(A),Element,R) :- |
| 4155 | | element_can_be_added_or_removed_to_avl(Element), % remove check? |
| 4156 | | convert_to_avl_inside_set(Element,AEl), !, |
| 4157 | | direct_remove_element_from_avl(A,AEl,R). |
| 4158 | | remove_element_from_explicit_set(ES,Element,R) :- |
| 4159 | | add_internal_error('Cannot remove element from explicit set:',remove_element_from_explicit_set(ES,Element,R)). |
| 4160 | | |
| 4161 | | direct_remove_element_from_avl(A,AEl,R) :- |
| 4162 | | avl_delete(AEl,A,_True,A2), |
| 4163 | | construct_avl_set(A2,R). /* AVL not normalised */ |
| 4164 | | |
| 4165 | | /* same as remove but element can be absent */ |
| 4166 | | delete_element_from_explicit_set(avl_set(A),Element,R) :- |
| 4167 | | element_can_be_added_or_removed_to_avl(Element), |
| 4168 | | convert_to_avl_inside_set(Element,AEl), !, |
| 4169 | | (avl_delete(AEl,A,_True,A2) |
| 4170 | | -> construct_avl_set(A2,R) |
| 4171 | | ; R = avl_set(A) |
| 4172 | | ). /* AVL not normalised */ |
| 4173 | | |
| 4174 | | is_maximal_global_set(GS) :- is_maximal_global_set(GS,_Type). |
| 4175 | | is_maximal_global_set(GS,_) :- var(GS),!,fail. |
| 4176 | | is_maximal_global_set('INTEGER',Type) :- !, Type=integer. |
| 4177 | | is_maximal_global_set('REAL',Type) :- !, Type=real. |
| 4178 | | is_maximal_global_set('FLOAT',_) :- !, fail. |
| 4179 | | is_maximal_global_set('STRING',Type) :- !, Type=string. |
| 4180 | | is_maximal_global_set(GS,global(GS)) :- |
| 4181 | | \+ kernel_objects:integer_global_set(GS). |
| 4182 | | |
| 4183 | | % To do: maybe get rid of all complement set code; add in_difference_set as symbolic binary operator |
| 4184 | | %is_very_large_maximal_global_set(X,_) :- print(very(X)),nl,fail. |
| 4185 | | is_very_large_maximal_global_set(closure(P,T,B),Type) :- is_definitely_maximal_closure(P,T,B), |
| 4186 | | couplise_list(T,Type). |
| 4187 | | is_very_large_maximal_global_set(global_set('INTEGER'),integer). |
| 4188 | | is_very_large_maximal_global_set(global_set('STRING'),string). |
| 4189 | | is_very_large_maximal_global_set(global_set('REAL'),string). |
| 4190 | | is_very_large_maximal_global_set(freetype(ID),freetype(ID)) :- is_infinite_freetype(ID). |
| 4191 | | |
| 4192 | | |
| 4193 | | |
| 4194 | | remove_minimum_element_custom_set(avl_set(S),X,RES) :- !, |
| 4195 | | avl_del_min(S,X,_True,Res0), |
| 4196 | | (empty_avl(Res0) -> RES=[] ; RES = avl_set(Res0)). |
| 4197 | | %remove_minimum_element_custom_set(closure(P,T,B),X,RES) :- |
| 4198 | | % is_interval_closure_or_integerset(Clos,Low,Up),!, |
| 4199 | | % X = Low, TO DO: construct new interval closure |
| 4200 | | remove_minimum_element_custom_set(CS,X,RES) :- |
| 4201 | | expand_custom_set_to_list(CS,ECS,Done,remove_minimum_element_custom_set), |
| 4202 | | remove_minimum_element_custom_set2(ECS,X,RES,Done). |
| 4203 | | |
| 4204 | | :- block remove_minimum_element_custom_set2(?,?,?,-). |
| 4205 | | % wait until Done: otherwise the Tail of the list could be instantiated by somebody else; interfering with expand_custom_set_to_list |
| 4206 | | remove_minimum_element_custom_set2([H|T],X,RES,_) :- equal_object((H,T),(X,RES)). |
| 4207 | | |
| 4208 | | |
| 4209 | | min_of_explicit_set_wf(avl_set(S),Min,_) :- !, avl_min(S,Min). |
| 4210 | | min_of_explicit_set_wf(Clos,Min,WF) :- |
| 4211 | | is_interval_closure_or_integerset(Clos,Low,Up), |
| 4212 | | (Low == minus_inf |
| 4213 | | -> add_wd_error('minimum of unbounded infinite set not defined:',Clos,WF) |
| 4214 | | ; cs_greater_than_equal(Up,Low), |
| 4215 | | Min=int(Low)). |
| 4216 | | |
| 4217 | | cs_greater_than_equal(X,Y) :- |
| 4218 | | ((X==inf;Y==minus_inf) -> true ; kernel_objects:less_than_equal_direct(Y,X)). |
| 4219 | | |
| 4220 | | |
| 4221 | | max_of_explicit_set_wf(avl_set(S),Max,_) :- !,avl_max(S,Max). |
| 4222 | | max_of_explicit_set_wf(Clos,Max,WF) :- |
| 4223 | | is_interval_closure_or_integerset(Clos,Low,Up), |
| 4224 | | (Up==inf |
| 4225 | | -> add_wd_error('maximum of unbounded infinite set not defined:',Clos,WF) |
| 4226 | | ; cs_greater_than_equal(Up,Low), |
| 4227 | | Max=int(Up)). |
| 4228 | | |
| 4229 | | % ------------- SIGMA/PI -------------- |
| 4230 | | |
| 4231 | | % compute sum or product of an integer set: |
| 4232 | | sum_or_mul_of_explicit_set(avl_set(S),SUMorMUL,Result) :- |
| 4233 | | avl_domain(S,Dom), |
| 4234 | | (SUMorMUL=sum -> simple_sum_list(Dom,0,R) ; simple_mul_list(Dom,1,R)), |
| 4235 | | Result = int(R). |
| 4236 | | sum_or_mul_of_explicit_set(CS,SUMorMUL,Result) :- SUMorMUL == sum, |
| 4237 | | is_interval_closure(CS,Low,Up), |
| 4238 | | sum_interval(Low,Up,Result), |
| 4239 | | sum_interval_clpfd_prop(Low,Up,Result). |
| 4240 | | |
| 4241 | | :- block sum_interval(-,?,?), sum_interval(?,-,?). |
| 4242 | | sum_interval(Low,Up,_) :- (\+ number(Low) ; \+ number(Up)),!, |
| 4243 | | add_error(sum_interval,'Cannot compute sum of interval: ',Low:Up),fail. |
| 4244 | | sum_interval(Low,Up,Result) :- Low>Up,!, Result=int(0). |
| 4245 | | sum_interval(Low,Up,Result) :- |
| 4246 | | R is ((1+Up-Low)*(Low+Up)) // 2, % generalisation of Gauss formula k*(k+1)//2 |
| 4247 | | Result = int(R). |
| 4248 | | |
| 4249 | | sum_interval_clpfd_prop(Low,Up,Result) :- |
| 4250 | | preferences:preference(use_clpfd_solver,true), Result=int(R), |
| 4251 | | var(R), % we haven't computed the result yet; the bounds are not known; set up constraint propagation rules |
| 4252 | | !, |
| 4253 | | try_post_constraint((Low #>= 0) #=> (R #> 0)), % we could provide better bounds here for negative numbers |
| 4254 | | try_post_constraint(((Low #=< Up) #\/ (R #\= 0)) #=> (R #= ((1+Up-Low)*(Low+Up))//2)), |
| 4255 | | try_post_constraint((Low #> Up) #=> (R #= 0)). |
| 4256 | | % not working yet: x = SIGMA(i).(i:-3..n|i) & x=0 & n< -1 |
| 4257 | | sum_interval_clpfd_prop(_,_,_). |
| 4258 | | |
| 4259 | | simple_sum_list([],A,A). |
| 4260 | | simple_sum_list([int(H)|T],Acc,R) :- NA is Acc+H, simple_sum_list(T,NA,R). |
| 4261 | | simple_mul_list([],A,A). |
| 4262 | | simple_mul_list([int(H)|T],Acc,R) :- NA is Acc*H, simple_mul_list(T,NA,R). |
| 4263 | | |
| 4264 | | |
| 4265 | | /* |
| 4266 | | direct_product_symbolic(S,R,Res) :- % NOT YET FINISHED |
| 4267 | | nonvar(S), S=closure(PS,[T1,TS2],RS), |
| 4268 | | nonvar(R), R=closure(PR,[T1,TR1],RR), |
| 4269 | | is_lambda_value_domain_closure(PS,TS,RS, SDomainValue,SExpr), |
| 4270 | | is_lambda_value_domain_closure(PR,TR,RR, RDomainValue,RExpr), |
| 4271 | | construct_closure(['zzz','_lambda_result_'],[T1,couple(TR1,TR2)], |
| 4272 | | member(zzz,SDomainValue) , member(zzz,RDomainValue), eq(lambda,pair(SExpr,RExpr))). |
| 4273 | | */ |
| 4274 | | |
| 4275 | | % we assume that try_expand_and_convert_to_avl_unless_very_large already called on arguments |
| 4276 | | direct_product_explicit_set(S,R,Res) :- |
| 4277 | | nonvar(R), %is_custom_explicit_set(R,direct_product), |
| 4278 | | nonvar(S), %is_custom_explicit_set(S,direct_product), |
| 4279 | | direct_product_explicit_set_aux(S,R,Res). |
| 4280 | | %direct_product_explicit_set_aux(S,R,Res) :- (S = closure(_,_,_) ; R = closure(_,_,_)), |
| 4281 | | % print_term_summary(direct_product_explicit_set_aux(S,R,Res)),nl, |
| 4282 | | % % TO DO: generate closure |
| 4283 | | % fail. |
| 4284 | | direct_product_explicit_set_aux(avl_set(AS),avl_set(AR),Res) :- |
| 4285 | | % the expansion guarantees that we have the lists ES and ER then in sorted order |
| 4286 | | avl_domain(AS,ES), % -> expand_custom_set(avl_set(AS),ES), |
| 4287 | | avl_domain(AR,ER), % -> expand_custom_set(avl_set(AR),ER), |
| 4288 | | direct_product3(ES,ER,DPList), |
| 4289 | | ord_list_to_avlset(DPList,DPAVL,direct_product), % is it really ordered ? findall must also return things ordered! |
| 4290 | | equal_object(DPAVL,Res,direct_product_explicit_set). |
| 4291 | | |
| 4292 | | direct_product3([],_Rel2,[]). |
| 4293 | | direct_product3([(From,To1)|T1],Rel2,Res) :- |
| 4294 | | get_next_mapped_to_eq(T1,From,TTo,Tail1), ToList1 = [To1|TTo], |
| 4295 | | get_next_mapped_to(Rel2,From,ToList2,Tail2), |
| 4296 | | calc_direct_product(ToList1,From,ToList2,Res,Rest), |
| 4297 | | (Tail2=[] -> Rest=[] ; direct_product3(Tail1,Tail2,Rest)). |
| 4298 | | |
| 4299 | | % get all elements which map to From, supposing that the list is sorted & we have already had a match |
| 4300 | | get_next_mapped_to_eq([],_,[],[]). |
| 4301 | | get_next_mapped_to_eq([(From2,To2)|T],From,Result,Tail) :- |
| 4302 | | (From=From2 -> Result = [To2|RR], get_next_mapped_to_eq(T,From,RR,Tail) |
| 4303 | | ; Result = [], Tail = [(From2,To2)|T] |
| 4304 | | ). |
| 4305 | | |
| 4306 | | % get all elements which map to From, supposing the list is sorted |
| 4307 | | get_next_mapped_to([],_,[],[]). |
| 4308 | | get_next_mapped_to([(From2,To2)|T],From,Result,Tail) :- |
| 4309 | | (From=From2 -> Result = [To2|RR], get_next_mapped_to_eq(T,From,RR,Tail) |
| 4310 | | ; From2 @> From -> Result = [], Tail = [(From2,To2)|T] |
| 4311 | | ; get_next_mapped_to(T,From,Result,Tail) |
| 4312 | | ). |
| 4313 | | |
| 4314 | | calc_direct_product([],_From,_,Tail,Tail). |
| 4315 | | calc_direct_product([To1|T1],From,To2List,Result,Tail) :- |
| 4316 | | findall((From,(To1,To2))-true,member(To2,To2List),Result,ResResult), |
| 4317 | | calc_direct_product(T1,From,To2List,ResResult,Tail). |
| 4318 | | |
| 4319 | | % TO DO: maybe also add a special rule for infinite R such as event_b_identity ? |
| 4320 | | domain_restriction_explicit_set_wf(S,R,Res,WF) :- /* S <| R */ |
| 4321 | | nonvar(R), |
| 4322 | | (nonvar(S),is_one_element_custom_set(S,El),R \= closure(_,_,_) -> |
| 4323 | | domain_restrict_singleton_element(El,R,Res) |
| 4324 | | ; restriction_explicit_set_wf(S,R,Res,domain,pred_true,WF)). |
| 4325 | | domain_subtraction_explicit_set_wf(S,R,Res,WF) :- /* S <<| R */ |
| 4326 | | (nonvar(S),is_one_element_custom_set(S,El), nonvar(R), R=avl_set(AVL) -> |
| 4327 | | avl_domain_subtraction_singleton(AVL,El,ARes), |
| 4328 | | construct_avl_set(ARes,Res) % TO DO: use this also when S is small and R large |
| 4329 | | ; restriction_explicit_set_wf(S,R,Res,domain,pred_false,WF)). |
| 4330 | | range_restriction_explicit_set_wf(R,S,Res,WF) :- /* R |> S */ |
| 4331 | | restriction_explicit_set_wf(S,R,Res,range,pred_true,WF). |
| 4332 | | range_subtraction_explicit_set_wf(R,S,Res,WF) :- /* R |>> S */ |
| 4333 | | restriction_explicit_set_wf(S,R,Res,range,pred_false,WF). |
| 4334 | | |
| 4335 | | |
| 4336 | | domain_restrict_singleton_element(El,R,Res) :- /* {El} <| R ; TO DO maybe apply this technique for "small" sets as well */ |
| 4337 | | nonvar(R), is_custom_explicit_set(R,domain_restrict_singleton_element), |
| 4338 | | expand_and_convert_to_avl_set(R,AR,domain_restrict_singleton_element,''), % can generate ARel=empty; will fail if not possible to convert |
| 4339 | | findall((El,Z)-true, avl_fetch_pair(El,AR,Z), RTuples), |
| 4340 | | ord_list_to_avlset(RTuples,Res,domain_restrict_singleton_element). |
| 4341 | | |
| 4342 | | restriction_explicit_set_wf(Set,Rel,Res,_RanOrDom,AddWhen,WF) :- Set==[],!, |
| 4343 | | (AddWhen=pred_false |
| 4344 | | -> equal_object_wf(Rel,Res,restriction_explicit_set_wf,WF) % {} <<| Rel = Rel |>> {} = Rel |
| 4345 | | ; kernel_objects:empty_set_wf(Res,WF) |
| 4346 | | ). |
| 4347 | | restriction_explicit_set_wf(Set,Rel,Res,_RanOrDom,AddWhen,WF) :- is_definitely_maximal_set(Set),!, |
| 4348 | | (AddWhen=pred_true |
| 4349 | | -> equal_object_wf(Rel,Res,restriction_explicit_set_wf,WF) % TYPE <| Rel = Rel |> TYPE = Rel |
| 4350 | | ; kernel_objects:empty_set_wf(Res,WF) |
| 4351 | | ). |
| 4352 | | restriction_explicit_set_wf(_,Rel,_,_,_,_) :- var(Rel),!,fail. |
| 4353 | | restriction_explicit_set_wf(Set,closure(Paras,Types,Body),Res,RanOrDom,AddWhen,WF) :- |
| 4354 | | % perform symbolic treatment by adding restriction predicate to Body |
| 4355 | | !, |
| 4356 | | (RanOrDom=domain |
| 4357 | | -> get_domain_id_or_expr(Paras,Types,TID,TT) |
| 4358 | | ; get_range_id_or_expr(Paras,Types,TID,TT) |
| 4359 | | ), |
| 4360 | | TSet=b(value(Set),set(TT),[]), |
| 4361 | | (AddWhen = pred_true |
| 4362 | | -> PRED = member(TID,TSet) |
| 4363 | | ; PRED = not_member(TID,TSet) ), |
| 4364 | | conjunct_predicates([b(PRED,pred,[]),Body],NewBody), |
| 4365 | | % translate:print_bexpr(NewBody),nl, |
| 4366 | | try_expand_and_convert_to_avl_with_catch_wf(closure(Paras,Types,NewBody),Res,restriction_explicit_set_wf,WF). |
| 4367 | | restriction_explicit_set_wf(Set,Rel,Res,RanOrDom,AddWhen,WF) :- |
| 4368 | | is_custom_explicit_set(Rel,restriction_explicit_set_wf), |
| 4369 | | expand_and_convert_to_avl_set(Rel,ARel,restriction_explicit_set_wf,''), % can generate ARel=empty; will fail if not possible to convert |
| 4370 | | avl_domain(ARel,ERel), % -> expand_custom_set(avl_set(ARel),ERel), |
| 4371 | | %try_expand_and_convert_to_avl_unless_large_wf(Set,ES,WF), |
| 4372 | | (nonvar(Set),Set=avl_set(AVLS) |
| 4373 | | -> restrict2_avl(ERel,AVLS,DRes,RanOrDom,AddWhen,Done) |
| 4374 | | ; restrict2(ERel,Set,DRes,RanOrDom,AddWhen,Done,WF) |
| 4375 | | ), |
| 4376 | | finish_restriction(Done,DRes,Res). |
| 4377 | | |
| 4378 | | % extract domain expression for domain restriction/subtraction predicate: |
| 4379 | | get_domain_id_or_expr([DR],[couple(TD,TR)], PRJ1, TD) :- !, % special case: just one parameter in closure |
| 4380 | | TID = b(identifier(DR),couple(TD,TR),[]), |
| 4381 | | PRJ1 = b(first_of_pair(TID),TD,[]). |
| 4382 | | get_domain_id_or_expr([D1|Paras],[TD1|Types],Expr,Type) :- |
| 4383 | | get_dom_couple_aux(Paras,Types, b(identifier(D1),TD1,[]), TD1, Expr,Type). |
| 4384 | | |
| 4385 | | get_dom_couple_aux([_RangeID],[_], AccExpr, AccType, Expr, Type) :- !, Expr=AccExpr, Type=AccType. |
| 4386 | | get_dom_couple_aux([D2|TParas],[TD2|Types], AccExpr, AccType, Expr, Type) :- |
| 4387 | | TID2 = b(identifier(D2),TD2,[]), |
| 4388 | | NewAccType = couple(AccType,TD2), |
| 4389 | | NewAcc = b(couple(AccExpr,TID2),NewAccType,[]), |
| 4390 | | get_dom_couple_aux(TParas,Types,NewAcc,NewAccType,Expr,Type). |
| 4391 | | |
| 4392 | | :- use_module(library(lists),[last/2]). |
| 4393 | | % extract range expression for range restriction/subtraction predicate: |
| 4394 | | get_range_id_or_expr( [DR],[CType], PRJ2, TR) :- !, % special case: just one parameter in closure |
| 4395 | | CType = couple(TD,TR), |
| 4396 | | TID = b(identifier(DR),CType,[]), |
| 4397 | | PRJ2 = b(second_of_pair(TID),TD,[]). |
| 4398 | | get_range_id_or_expr( [_|Paras],[_|Types], b(identifier(R),TR,[]), TR) :- |
| 4399 | | last(Paras,R), last(Types,TR). |
| 4400 | | |
| 4401 | | :- block finish_restriction(-,?,?). |
| 4402 | | finish_restriction(_,DRes,Res) :- |
| 4403 | | ord_list_to_avlset(DRes,Restriction,restriction), |
| 4404 | | equal_object(Restriction,Res,finish_restriction). % as we may block below: we need to use equal_object |
| 4405 | | |
| 4406 | | restrict2([],_,[],_,_,done,_WF). |
| 4407 | | restrict2([(From,To)|T],S,Res,RanOrDom,AddWhen,Done,WF) :- |
| 4408 | | (RanOrDom==domain -> El=From ; El=To), |
| 4409 | | kernel_equality:membership_test_wf(S,El,MemRes,WF), % TO DO: WF Version !! |
| 4410 | | /* this only makes sense once we have the full result as argument: |
| 4411 | | (nonvar(MemRes) -> true % it is already decided |
| 4412 | | ; AddWhen=pred_true -> kernel_equality:membership_test_wf(Res,(From,To),MemRes,WF) |
| 4413 | | ; kernel_equality:membership_test_wf(Res,(From,To),InResult,WF), bool_pred:negate(InResult,MemRes) |
| 4414 | | ), */ |
| 4415 | | restrict3(MemRes,From,To,T,S,Res,RanOrDom,AddWhen,Done,WF). |
| 4416 | | :- block restrict3(-, ?,?, ?,?,?, ?,?,?,?). |
| 4417 | | restrict3(MemRes, From,To, T,S,Res, RanOrDom,AddWhen,Done,WF) :- |
| 4418 | | (AddWhen=MemRes -> Res = [(From,To)-true|TRes] |
| 4419 | | ; Res=TRes), |
| 4420 | | restrict2(T,S,TRes,RanOrDom,AddWhen,Done,WF). |
| 4421 | | |
| 4422 | | % optimised version when second set is also an AVL tree: less blocking,... |
| 4423 | | restrict2_avl([],_,[],_,_,done). |
| 4424 | | restrict2_avl([(From,To)|T],AVLS,Res,RanOrDom,AddWhen,Done) :- |
| 4425 | | fetch(RanOrDom,From,To,AVLS,MemRes), |
| 4426 | | (AddWhen=MemRes -> Res = [(From,To)-true|TRes] |
| 4427 | | ; Res=TRes), |
| 4428 | | restrict2_avl(T,AVLS,TRes,RanOrDom,AddWhen,Done). |
| 4429 | | |
| 4430 | | fetch(domain,El,_,AVLS,MemRes) :- (avl_fetch(El,AVLS) -> MemRes=pred_true ; MemRes = pred_false). |
| 4431 | | fetch(range,_,El,AVLS,MemRes) :- (avl_fetch(El,AVLS) -> MemRes=pred_true ; MemRes = pred_false). |
| 4432 | | |
| 4433 | | % override R(X) := Y |
| 4434 | | override_pair_explicit_set(avl_set(S),X,Y,avl_set(NewAVL)) :- element_can_be_added_or_removed_to_avl(X), |
| 4435 | | element_can_be_added_or_removed_to_avl(Y), |
| 4436 | | convert_to_avl_inside_set(X,AX), |
| 4437 | | convert_to_avl_inside_set(Y,AY), |
| 4438 | | avl_domain_subtraction_singleton(S,AX,AVL2), |
| 4439 | | avl_store((AX,AY), AVL2, true, NewAVL). |
| 4440 | | |
| 4441 | | avl_domain_subtraction_singleton(AVL,AX,NewAVL) :- |
| 4442 | | avl_delete_pair(AX,AVL,_True,AVL2), |
| 4443 | | !, % recurse, in case we have multiple entries |
| 4444 | | % this recursion could be avoided if we know AVL to be a function |
| 4445 | | avl_domain_subtraction_singleton(AVL2,AX,NewAVL). |
| 4446 | | avl_domain_subtraction_singleton(AVL,_,AVL). |
| 4447 | | |
| 4448 | | % try and decompose an AVL set into a cartesian product |
| 4449 | | % AVL = Set1 * Set2 |
| 4450 | | % much faster e.g. for let xx = ((1..10)*(3..1000)\/ {0}*(3..1000)) and then xx = AA*BB |
| 4451 | | % should not produce pending co-routines |
| 4452 | | decompose_avl_set_into_cartesian_product_wf(AVL,DomainSet,RangeSet,WF) :- |
| 4453 | | avl_domain(AVL,Expansion), |
| 4454 | | decompose_cart(Expansion,'$none',DomainList,[],RangeList), |
| 4455 | | construct_avl_from_lists_wf(DomainList,DomainSet,WF), |
| 4456 | | construct_avl_from_lists_wf(RangeList,RangeSet,WF). |
| 4457 | | |
| 4458 | | decompose_cart([],_,[],[],_). |
| 4459 | | decompose_cart([(A,B)|T],Prev,Domain,Range,FullRange) :- |
| 4460 | | (A=Prev |
| 4461 | | -> Range = [B|TRange], |
| 4462 | | decompose_cart(T,Prev,Domain,TRange,FullRange) |
| 4463 | | ; Domain = [A|TDom], Range=[], |
| 4464 | | FullRange = [B|TRange], |
| 4465 | | decompose_cart(T,A,TDom,TRange,FullRange) |
| 4466 | | ). |
| 4467 | | |
| 4468 | | /* --------- */ |
| 4469 | | /* EXPANSION */ |
| 4470 | | /* --------- */ |
| 4471 | | |
| 4472 | | :- use_module(b_global_sets,[all_elements_of_type_wf/3, all_elements_of_type_rand_wf/3]). |
| 4473 | | :- use_module(kernel_freetypes,[expand_freetype/3]). |
| 4474 | | |
| 4475 | | expand_custom_set(X,R) :- expand_custom_set_wf(X,R,expand_custom_set,no_wf_available). |
| 4476 | | expand_custom_set(X,R,Src) :- expand_custom_set_wf(X,R,Src,no_wf_available). |
| 4477 | | expand_custom_set_wf(X,R,Source,WF) :- var(X), !, |
| 4478 | | add_error_and_fail(expand_custom_set_wf, 'Variable as argument: ',expand_custom_set_wf(X,R,Source,WF)). |
| 4479 | | expand_custom_set_wf(global_set(GS),ExpandedSet,_,WF) :- !, |
| 4480 | | all_elements_of_type_wf(GS,ExpandedSet,WF). % they are generated in order |
| 4481 | | expand_custom_set_wf(freetype(GS),ValueList,_,WF) :- !, |
| 4482 | | expand_freetype(GS,ValueList,WF). |
| 4483 | | expand_custom_set_wf(avl_set(AVL),ExpandedSet,_,_) :- !, |
| 4484 | | avl_domain(AVL,ExpandedSet). |
| 4485 | | expand_custom_set_wf(closure(Parameters,PTypes,Cond),Res,Source,WF) :- !, |
| 4486 | | expand_closure_to_list(Parameters,PTypes,Cond,Res,_Done,Source,WF). |
| 4487 | | %wait_try_expand_custom_set(Res1,Res). % could be in AVL form; no longer the case ! |
| 4488 | | expand_custom_set_wf(Set,_,Source,_) :- |
| 4489 | | add_error_and_fail(expand_custom_set(Source),'Cannot expand custom set: ',Set). |
| 4490 | | |
| 4491 | | |
| 4492 | | |
| 4493 | | %try_expand_only_custom_closure_global(X,Y) :- |
| 4494 | | % (var(X) -> X=Y ; expand_only_custom_closure_global(X,Y,check)). |
| 4495 | | |
| 4496 | | expand_only_custom_closure_global(X,R,C,_WF) :- var(X), !, |
| 4497 | | add_error_and_fail(expand_only_custom_closure_global, 'Variable as argument: ',expand_only_custom_closure_global(X,R,C)). |
| 4498 | | expand_only_custom_closure_global(global_set(GS),ExpandedSet,_,WF) :- !,all_elements_of_type_wf(GS,ExpandedSet,WF). |
| 4499 | | expand_only_custom_closure_global(freetype(GS),ExpandedSet,_,_WF) :- !,ExpandedSet=freetype(GS). |
| 4500 | | expand_only_custom_closure_global(avl_set(AVL),ExpandedSet,_,_WF) :- !, ExpandedSet=avl_set(AVL). |
| 4501 | | expand_only_custom_closure_global(closure(Parameters,PTypes,Cond),Res,CheckTimeOuts,WF) :- !, |
| 4502 | | (Res==[] -> is_empty_explicit_set(closure(Parameters,PTypes,Cond)) % TO DO: think about other special cases |
| 4503 | | ; expand_closure_to_avl_or_list(Parameters,PTypes,Cond,Res,CheckTimeOuts,WF)). |
| 4504 | | expand_only_custom_closure_global(Set,Set,_CheckTimeOuts,_WF). |
| 4505 | | %:- add_error_and_fail(expand_only_custom_closure_global,'Cannot expand custom set: ',Set). |
| 4506 | | |
| 4507 | | |
| 4508 | | try_expand_custom_set_with_catch(CS,Expansion,PP) :- |
| 4509 | | on_enumeration_warning(try_expand_custom_set_wf(CS,Expansion,PP,no_wf_available), |
| 4510 | | Expansion=CS). |
| 4511 | | |
| 4512 | | try_expand_custom_set(CS,Expansion) :- |
| 4513 | | try_expand_custom_set_wf(CS,Expansion,try_expand_custom_set,no_wf_available). |
| 4514 | | |
| 4515 | | |
| 4516 | | try_expand_custom_set_wf(CS,Res,_,_) :- var(CS),!,Res=CS. |
| 4517 | | try_expand_custom_set_wf([],Res,_,_) :- !, Res=[]. |
| 4518 | | try_expand_custom_set_wf([H|T],Res,_,_) :- !, Res=[H|T]. |
| 4519 | | try_expand_custom_set_wf(CS,Res,Src,WF) :- |
| 4520 | | expand_custom_set_wf(CS,Res,Src,WF). % will generate error message for illegal sets |
| 4521 | | |
| 4522 | | |
| 4523 | | :- assert_must_succeed((expand_custom_set_to_list(closure(['_zzzz_unit_tests'], |
| 4524 | | [couple(integer,integer)], |
| 4525 | | b(member(b(identifier('_zzzz_unit_tests'),couple(integer,integer),[generated]), |
| 4526 | | b(value([(int(1),int(22))]),set(couple(integer,integer)),[])),pred,[])),R),R==[(int(1),int(22))])). |
| 4527 | | |
| 4528 | | expand_custom_set_to_list(CS,List) :- expand_custom_set_to_list(CS,List,_Done,unknown). |
| 4529 | | |
| 4530 | | % a version of expansion which returns guaranteed_ground if the List is guaranteed to be ground |
| 4531 | | expand_custom_set_to_list_gg(CS,List,GuaranteedGround,_PP) :- |
| 4532 | | nonvar(CS), CS=avl_set(AVL), var(List), |
| 4533 | | !, |
| 4534 | | GuaranteedGround = guaranteed_ground, |
| 4535 | | avl_domain(AVL,List). |
| 4536 | | expand_custom_set_to_list_gg(CS,List,not_guaranteed_ground,PP) :- |
| 4537 | | expand_custom_set_to_list(CS,List,_Done,PP). |
| 4538 | | |
| 4539 | | % a version where the expansion should happen straightaway and should not block: |
| 4540 | | expand_custom_set_to_list_now(CS,List) :- expand_custom_set_to_list(CS,List,Done,unknown), |
| 4541 | | (Done==true -> true ; print_error(expand_custom_set_to_list_not_done(CS,List))). |
| 4542 | | |
| 4543 | | :- block expand_custom_set_to_sorted_list(-,-,?,?,?). |
| 4544 | | % sorts the resulting list if needed |
| 4545 | | % due to random enumeration |
| 4546 | | expand_custom_set_to_sorted_list(From,To,Done,Source,WF) :- |
| 4547 | | expand_custom_set_to_list(From,UnsortedTo,Done,Source), |
| 4548 | | (get_preference(randomise_enumeration_order,true) |
| 4549 | | -> sort_when_done(Done,UnsortedTo,To,WF) ; UnsortedTo = To). |
| 4550 | | |
| 4551 | | :- block sort_when_done(-,?,?,?). |
| 4552 | | sort_when_done(_,Unsorted,Res,WF) :- sort(Unsorted,Sorted), |
| 4553 | | equal_object_wf(Sorted,Res,sort_when_done,WF). |
| 4554 | | |
| 4555 | | expand_custom_set_to_list(From,To,Done,Source) :- |
| 4556 | | expand_custom_set_to_list_wf(From,To,Done,Source,no_wf_available). |
| 4557 | | |
| 4558 | | :- use_module(kernel_objects,[equal_object_wf/4]). |
| 4559 | | |
| 4560 | | % try expand custom set to list; on enumeration warning set Done to enumeration_warning |
| 4561 | | try_expand_custom_set_to_list_wf(From,To,Done,Source,WF) :- |
| 4562 | | on_enumeration_warning(expand_custom_set_to_list_wf(From,To,Done,Source,WF), |
| 4563 | | (Done=enumeration_warning)). |
| 4564 | | |
| 4565 | | expand_custom_set_to_list_wf(From,To,Done,Source,WF) :- |
| 4566 | | expand_custom_set_to_list_k_wf(From,To,Done,_Kind,Source,WF). |
| 4567 | | |
| 4568 | | % a variation of expand_custom_set_to_list which also checks that there are no duplicates in the list |
| 4569 | | expand_custom_set_to_list_no_dups_wf(From,To,Done,Source,WF) :- |
| 4570 | | expand_custom_set_to_list_k_wf(From,To,Done,Kind,Source,WF), |
| 4571 | | check_dups(Kind,To,WF). |
| 4572 | | |
| 4573 | | :- block check_dups(-,?,?). |
| 4574 | | check_dups(unsorted_list,List,WF) :- !, |
| 4575 | | kernel_objects:check_no_duplicates_in_list(List,[],WF). |
| 4576 | | check_dups(_,_,_). |
| 4577 | | |
| 4578 | | % warn if duplicates in list; to do: use in prob_safe mode |
| 4579 | | %:- block warn_dups(-,?,?,?). |
| 4580 | | %warn_dups(unsorted_list,List,Src,WF) :- !, |
| 4581 | | % kernel_objects:warn_if_duplicates_in_list(List,Src,WF). |
| 4582 | | %warn_dups(_,_,_,_). |
| 4583 | | |
| 4584 | | |
| 4585 | | |
| 4586 | | :- block expand_custom_set_to_list_k_wf(-,-,?,?,?,?). |
| 4587 | | % ensures that the output is a pure list; the list skeleton should not be instantiated by anybody else |
| 4588 | | expand_custom_set_to_list_k_wf(From,To,Done,Kind,Source,WF) :- |
| 4589 | | (var(From) -> |
| 4590 | | (is_list_skeleton(To) |
| 4591 | | -> equal_object_wf(To,From,Source,WF), Done=true, Kind=unsorted_list |
| 4592 | ? | ; expand_custom_set_to_list2(To,From,Done,Kind,Source,WF)) |
| 4593 | | ; var(To),is_list_skeleton(From) |
| 4594 | | -> To=From, Done=true, Kind=unsorted_list % equal_object_wf will also to a Prolog unification |
| 4595 | | ; expand_custom_set_to_list2(From,To,Done,Kind,Source,WF)). |
| 4596 | | |
| 4597 | | expand_custom_set_to_list2([],ExpandedSet,Done,Kind,_Source,WF) :- !, |
| 4598 | ? | equal_object_wf([],ExpandedSet,expand_custom_set_to_list2,WF),Done=true,Kind=empty_set. |
| 4599 | | expand_custom_set_to_list2([H|T],ExpandedSet,Done,Kind,Source,WF) :- !, Kind=unsorted_list, |
| 4600 | ? | equal_object_wf([H|ET],ExpandedSet,expand_custom_set_to_list2,WF), |
| 4601 | ? | expand_custom_set_to_list3(T,ET,Done,Source,WF). |
| 4602 | | expand_custom_set_to_list2(global_set(GS),ExpandedSet,Done,Kind,_Source,WF) :- !, |
| 4603 | | all_elements_of_type_rand_wf(GS,R,WF), |
| 4604 | | check_list(R,expand_custom_set_to_list2), |
| 4605 | | equal_object_wf(R,ExpandedSet,expand_custom_set_to_list2,WF),Done=true,Kind=sorted_list. |
| 4606 | | expand_custom_set_to_list2(avl_set(AVL),ExpandedSet,Done,Kind,_Source,WF) :- !, |
| 4607 | | avl_domain(AVL,R), |
| 4608 | ? | equal_object_wf(R,ExpandedSet,expand_custom_set_to_list2,WF), Done=true,Kind=sorted_list. |
| 4609 | | expand_custom_set_to_list2(closure(Parameters,PTypes,Cond),ExpandedSet,Done,Kind,Source,WF) :- !, |
| 4610 | | expand_closure_to_list(Parameters,PTypes,Cond,ExpandedSet,Done,Source,WF), |
| 4611 | | Kind=sorted_list. |
| 4612 | | %assign_expand_result(CDone,Res,ExpandedSet,Done). |
| 4613 | | expand_custom_set_to_list2(freetype(ID),ExpandedSet,Done,Kind,_Source,WF) :- !, |
| 4614 | | expand_freetype(ID,R,WF), |
| 4615 | | equal_object_wf(R,ExpandedSet,expand_custom_set_to_list2,WF), |
| 4616 | | Done=true,Kind=sorted_list. |
| 4617 | | % missing avl_set wrapper: |
| 4618 | | expand_custom_set_to_list2(node(A,B,C,D,E),ExpandedSet,Done,Kind,Source,WF) :- !, |
| 4619 | | add_internal_error('Illegal argument: ',expand_custom_set_to_list2(node(A,B,C,D,E),ExpandedSet,Done,Source)), |
| 4620 | | expand_custom_set_to_list2(avl_set(node(A,B,C,D,E)),ExpandedSet,Done,Kind,Source,WF). |
| 4621 | | expand_custom_set_to_list2(E,ES,Done,Kind,Source,WF) :- |
| 4622 | | add_internal_error('Illegal argument: ',expand_custom_set_to_list2(E,ES,Done,Kind,Source,WF)),fail. |
| 4623 | | |
| 4624 | | :- block expand_custom_set_to_list3(-,-,?,?,?). % we are no longer sure which was From and which is To |
| 4625 | | expand_custom_set_to_list3(From,To,Done,Source,WF) :- |
| 4626 | ? | (var(From) -> expand_custom_set_to_list2(To,From,Done,_,Source,WF) ; |
| 4627 | ? | expand_custom_set_to_list2(From,To,Done,_,Source,WF)). |
| 4628 | | |
| 4629 | | |
| 4630 | | is_list_skeleton(X) :- var(X),!,fail. |
| 4631 | | is_list_skeleton([]). |
| 4632 | | is_list_skeleton([_|T]) :- is_list_skeleton(T). |
| 4633 | | |
| 4634 | | % true if it is more efficient to keep this, rather than expand into list |
| 4635 | | is_efficient_custom_set(avl_set(_)). |
| 4636 | | is_efficient_custom_set(closure(P,T,B)) :- |
| 4637 | | (is_interval_closure(closure(P,T,B),_,_) -> true ; is_infinite_or_symbolic_closure(P,T,B)). |
| 4638 | | is_efficient_custom_set(global_set(X)) :- is_infinite_global_set(X,_). |
| 4639 | | is_efficient_custom_set(freetype(_)). |
| 4640 | | |
| 4641 | | % tries to expand & convert to avl_set; fails if not possible: NOTE: also generates empty AVL |
| 4642 | | expand_and_convert_to_avl_set(R,AER,Origin,Source) :- |
| 4643 | | try_expand_and_convert_to_avl(R,ER,Origin,Source), |
| 4644 | | nonvar(ER),(ER==[] -> AER=empty ; ER=avl_set(AER)). |
| 4645 | | |
| 4646 | | |
| 4647 | | expand_and_convert_to_avl_set_unless_very_large(R,AER,WF) :- |
| 4648 | | try_expand_and_convert_to_avl_unless_very_large_wf(R,ER,WF), |
| 4649 | | nonvar(ER),(ER==[] -> AER=empty ; ER=avl_set(AER)). |
| 4650 | | |
| 4651 | | |
| 4652 | | % similar to unless_large version, but will only expand if it is guaranteed to be small |
| 4653 | | |
| 4654 | | try_expand_and_convert_to_avl_if_smaller_than(freetype(GS),Res,_) :- !, Res = freetype(GS). |
| 4655 | | try_expand_and_convert_to_avl_if_smaller_than([H|T],Res,_) :- !, try_expand_and_convert_to_avl([H|T],Res). |
| 4656 | | try_expand_and_convert_to_avl_if_smaller_than(avl_set(A),Res,_) :- !, Res=avl_set(A). |
| 4657 | | try_expand_and_convert_to_avl_if_smaller_than(CS,Res,Limit) :- |
| 4658 | | (is_small_specific_custom_set(CS,Limit) |
| 4659 | | -> try_expand_and_convert_to_avl(CS,Res,try_expand_and_convert_to_avl_if_smaller_than,'') |
| 4660 | | ; Res = CS % TO DO: maybe look at cardinality of types and determine max. cardinality |
| 4661 | | ). |
| 4662 | | is_small_specific_custom_set(CS,Limit) :- card_for_specific_custom_set(CS,Card,Code), |
| 4663 | | call(Code), is_finite_card(Card), Card<Limit. |
| 4664 | | get_card_for_specific_custom_set(CS,Card) :- |
| 4665 | | card_for_specific_custom_set(CS,Card,Code), |
| 4666 | ? | call(Code), ground(Card). |
| 4667 | | |
| 4668 | | try_expand_and_convert_to_avl_unless_very_large_wf(CS,Res,WF) :- |
| 4669 | | try_expand_and_convert_to_avl_unless_large_wf(CS,Res,10000,WF). |
| 4670 | | |
| 4671 | | try_expand_and_convert_to_avl_unless_large_wf(CS,Res,WF) :- |
| 4672 | | try_expand_and_convert_to_avl_unless_large_wf(CS,Res,2000,WF). |
| 4673 | | |
| 4674 | | try_expand_and_convert_to_avl_unless_large_wf(CS,Res,_,_WF) :- var(CS), !, CS=Res. |
| 4675 | | try_expand_and_convert_to_avl_unless_large_wf(global_set(GS),Res,_,_WF) :- !, Res = global_set(GS). |
| 4676 | | try_expand_and_convert_to_avl_unless_large_wf(freetype(GS),Res,_,_WF) :- !, Res = freetype(GS). |
| 4677 | | %try_expand_and_convert_to_avl_unless_large_wf(CS,Res,_WF) :- is_interval_closure(CS,Low,Up),!, |
| 4678 | | % ((ground(Low),ground(Up),Size is 1+Up-Low, Size<2000) |
| 4679 | | %% -> try_expand_and_convert_to_avl(CS,Res) |
| 4680 | | % ; Res = CS |
| 4681 | | % ). |
| 4682 | | try_expand_and_convert_to_avl_unless_large_wf(closure(P,T,B),Res,Limit,_WF) :- |
| 4683 | | is_very_large_or_symbolic_closure(P,T,B,Limit),!, % is explicitly marked as SYMBOLIC |
| 4684 | | Res=closure(P,T,B). |
| 4685 | | try_expand_and_convert_to_avl_unless_large_wf(CS,Res,_Limit,WF) :- |
| 4686 | | % TO DO: check if maybe we cannot determine card explicitly, but have a large lower-bound |
| 4687 | | try_expand_and_convert_to_avl_wf(CS,Res,try_expand_and_convert_to_avl_unless_large,'',WF). |
| 4688 | | |
| 4689 | | |
| 4690 | | |
| 4691 | | % calls try_expand_and_convert_to_avl and returns original value if enumeration warning occured |
| 4692 | | try_expand_and_convert_to_avl_with_catch_wf(CS,Res,Origin,WF) :- |
| 4693 | | on_enumeration_warning(try_expand_and_convert_to_avl_wf(CS,Res,Origin,'',WF), |
| 4694 | | Res=CS). |
| 4695 | | |
| 4696 | | /* tries to generate an avl-structure, if possible */ |
| 4697 | | try_expand_and_convert_to_avl(CS,Res) :- |
| 4698 | | try_expand_and_convert_to_avl_wf(CS,Res,try_expand_and_convert_to_avl,'',no_wf_available). |
| 4699 | | |
| 4700 | | try_expand_and_convert_to_avl(CS,Res,Origin,Source) :- |
| 4701 | | try_expand_and_convert_to_avl_wf(CS,Res,Origin,Source,no_wf_available). |
| 4702 | | |
| 4703 | | try_expand_and_convert_to_avl_wf(CS,Res,_,_,_WF) :- var(CS), !, CS=Res. |
| 4704 | | try_expand_and_convert_to_avl_wf(avl_set(A),R,_,_,_WF) :- !, R=avl_set(A). |
| 4705 | | try_expand_and_convert_to_avl_wf([],R,_,_,_WF) :- !, R=[]. |
| 4706 | | try_expand_and_convert_to_avl_wf([H|T],R,_,_,WF) :- !, try_convert_to_avl_wf([H|T],R,WF). |
| 4707 | | try_expand_and_convert_to_avl_wf(closure(P,T,B),Res,Origin,_Source,WF) :- !, |
| 4708 | | debug_opt_push_wait_flag_call_stack_info(WF, |
| 4709 | | external_call('TRY EXPANDING',[closure(P,T,B)],unknown),WF2), |
| 4710 | | expand_only_custom_closure_global(closure(P,T,B),Expansion,check(Origin),WF2), |
| 4711 | | try_convert_to_avl_wf(Expansion,Res,WF). |
| 4712 | | try_expand_and_convert_to_avl_wf(CS,Res,Origin,_Source,WF) :- |
| 4713 | | (\+ is_custom_explicit_set(CS,try_expand_and_convert_to_avl_wf) |
| 4714 | | -> Expansion = CS |
| 4715 | | ; expand_only_custom_closure_global(CS,Expansion,check(Origin),WF) |
| 4716 | | ), |
| 4717 | | try_convert_to_avl_wf(Expansion,Res,WF). |
| 4718 | | |
| 4719 | | try_convert_to_avl(Expansion,Res) :- |
| 4720 | | (should_be_converted_to_avl_from_lists(Expansion) -> construct_avl_from_lists(Expansion,Res) ; Res=Expansion). |
| 4721 | | try_convert_to_avl_wf(Expansion,Res,WF) :- |
| 4722 | | (should_be_converted_to_avl_from_lists(Expansion) -> construct_avl_from_lists_wf(Expansion,Res,WF) ; Res=Expansion). |
| 4723 | | |
| 4724 | | should_be_converted_to_avl_from_lists(Value) :- var(Value),!,fail. |
| 4725 | | should_be_converted_to_avl_from_lists(Value) :- |
| 4726 | | \+ is_custom_explicit_set(Value,should_be_converted_to_avl_from_lists), % already avl_set, global_set or closure |
| 4727 | ? | \+ do_not_convert_aux(Value), |
| 4728 | | ground_value(Value). |
| 4729 | | |
| 4730 | | do_not_convert_aux(V) :- var(V),!. |
| 4731 | | do_not_convert_aux((A,B)) :- !, |
| 4732 | | (do_not_convert_aux(A) -> true ; do_not_convert_aux(B)). |
| 4733 | | do_not_convert_aux([H|T]) :- !, % do not convert a set containing a symbolic closure |
| 4734 | ? | (var(T) -> true ; do_not_convert_aux(H)). |
| 4735 | | do_not_convert_aux(rec(Fields)) :- !, |
| 4736 | | (var(Fields) -> true |
| 4737 | ? | ; member(field(_,V),Fields), do_not_convert_aux(V) -> true). |
| 4738 | | do_not_convert_aux(H) :- |
| 4739 | ? | is_symbolic_closure(H). |
| 4740 | | |
| 4741 | | should_be_converted_to_avl(Value) :- %preference(use_avl_trees_for_sets,true), |
| 4742 | | ground_value(Value). |
| 4743 | | |
| 4744 | | try_expand_and_convert_to_avl_with_check(CS,Res,Origin) :- |
| 4745 | | try_expand_and_convert_to_avl_with_check(CS,Res,do_not_keep_intervals,Origin). |
| 4746 | | |
| 4747 | | try_expand_and_convert_to_avl_with_check(CS,Res,_,_Origin) :- var(CS),!, Res = CS. |
| 4748 | | try_expand_and_convert_to_avl_with_check([],Res,_,_Origin) :- !, Res=[]. |
| 4749 | | try_expand_and_convert_to_avl_with_check(avl_set(A),Res,_,_Origin) :- !, Res=avl_set(A). |
| 4750 | | try_expand_and_convert_to_avl_with_check([H|T],Res,_,Origin) :- !, try_expand_and_convert_to_avl([H|T],Res,Origin,''). |
| 4751 | | %try_expand_and_convert_to_avl_with_check(CS,Res,_Origin) :- |
| 4752 | | % \+ is_custom_explicit_set(CS,try_expand_and_convert_to_avl),!, Res = CS. |
| 4753 | | try_expand_and_convert_to_avl_with_check(CS,Res,KeepIntervals,_Origin) :- |
| 4754 | | is_interval_closure(CS,Low,Up), |
| 4755 | | (var(Low) -> true ; var(Up) -> true % better keep this symbolic as we may be able to do constraint propagation |
| 4756 | | ; KeepIntervals=keep_intervals(Size) -> Up-Low >= Size |
| 4757 | | ), |
| 4758 | | !, % TO DO: see if we should do this check in try_expand_and_convert_to_avl above instead |
| 4759 | | Res=CS. |
| 4760 | | try_expand_and_convert_to_avl_with_check(CS,Res,_,Origin) :- |
| 4761 | ? | get_card_for_specific_custom_set(CS,Size), % TO DO: avoid checking for special closures twice (below in try_expand_and_convert_to_avl ?) |
| 4762 | | !, |
| 4763 | | try_expconv_to_avl_with_size(Size,CS,Res,Origin). |
| 4764 | | try_expand_and_convert_to_avl_with_check(CS,Res,_,Origin) :- |
| 4765 | | try_expand_and_convert_to_avl(CS,Res,Origin,''). |
| 4766 | | |
| 4767 | | try_expconv_to_avl_with_size(inf,CS,Res,Origin) :- !, |
| 4768 | | debug_format(9,'### Not expanding infinite set~n### ORIGIN: ~w~n',[Origin]), |
| 4769 | | Res=CS. |
| 4770 | | try_expconv_to_avl_with_size(inf_overflow,CS,Res,Origin) :- !, |
| 4771 | | debug_format(9,'### Not expanding very large set~n### ORIGIN: ~w~n',[Origin]), |
| 4772 | | Res=CS. |
| 4773 | | try_expconv_to_avl_with_size(Size,CS,Res,Origin) :- Size>=10000000, !, |
| 4774 | | /* will probably never terminate */ |
| 4775 | | debug_format(9,'### Not expanding very large set with cardinality ~w~n### ORIGIN: ~w~n',[Size,Origin]), |
| 4776 | | Res=CS. |
| 4777 | | try_expconv_to_avl_with_size(Size,CS,Res,Origin) :- Size>=50000, !, |
| 4778 | | print('### WARNING: expanding very large comprehension set, size = '), print(Size),nl, |
| 4779 | | print('### ORIGIN: '), print(Origin),nl, |
| 4780 | | try_expand_and_convert_to_avl(CS,Res,Origin,''). |
| 4781 | | try_expconv_to_avl_with_size(_Size,CS,Res,Origin) :- |
| 4782 | | try_expand_and_convert_to_avl(CS,Res,Origin,''). |
| 4783 | | |
| 4784 | | /* underlying assumption for var case: if G is a global set: we get back the |
| 4785 | | global_set tag immediately: no need to use when to wait; |
| 4786 | | better: ensure that b_compute_expression always returns a nonvar term */ |
| 4787 | | |
| 4788 | | |
| 4789 | | :- assert_must_succeed((custom_explicit_sets:try_expand_custom_set(closure([xx],[integer],b(falsity,pred,[])),R),R = [])). |
| 4790 | | :- assert_must_succeed((custom_explicit_sets:test_closure(X),custom_explicit_sets:expand_custom_set(X,EX), |
| 4791 | | EX = [(fd(1,'Name'),_),(fd(3,'Name'),_)])). |
| 4792 | | |
| 4793 | | test_closure(X) :- X = closure(['_zzzz_binary'],[couple(global('Name'),set(global('Name')))], |
| 4794 | | b(member(b(identifier('_zzzz_binary'),couple(global('Name'),set(global('Name'))),[generated]), |
| 4795 | | b(cartesian_product(b(value([fd(1,'Name'),fd(3,'Name')]),set(global('Name')),[]), |
| 4796 | | b(value([[fd(2,'Name'),fd(3,'Name')]]),set(set(global('Name'))),[])), |
| 4797 | | set(couple(global('Name'),set(global('Name')))),[])),pred,[])). |
| 4798 | | |
| 4799 | | |
| 4800 | | /* --------- */ |
| 4801 | | /* ELEMENT_OF */ |
| 4802 | | /* --------- */ |
| 4803 | | |
| 4804 | | |
| 4805 | | /* A function that instantiates last argument when membership test can be decided */ |
| 4806 | | |
| 4807 | | membership_custom_set(CS,X,R) :- print(warning_deprecated_non_wf_version(CS,X,R)),nl, |
| 4808 | | membership_custom_set_wf(CS,X,R,_WF). |
| 4809 | | |
| 4810 | | membership_custom_set_wf(avl_set(A),X,R,WF) :- !, membership_avl_set_wf(A,X,R,WF). |
| 4811 | | membership_custom_set_wf(freetype(_GS),_X,R,_WF) :- !, R=pred_true. % should be covered by clause above |
| 4812 | | membership_custom_set_wf(CS,X,R,WF) :- R==pred_true,!, element_of_custom_set_wf(X,CS,WF). |
| 4813 | | membership_custom_set_wf(CS,X,R,WF) :- R==pred_false,!, not_element_of_custom_set_wf(X,CS,WF). |
| 4814 | | membership_custom_set_wf(CS,_X,R,_WF) :- |
| 4815 | | is_definitely_maximal_set(CS),!, |
| 4816 | | R=pred_true. |
| 4817 | | membership_custom_set_wf(closure(Par,Types,Body),X,R,WF) :- !, |
| 4818 | | closure_membership_wf(X,Par,Types,Body,R,WF). |
| 4819 | | %membership_custom_set_wf(CS,X,R,WF) :- is_one_element_custom_set(CS,Y),!, % only succeeds for AVL |
| 4820 | | % kernel_equality:equality_objects_wf_no_enumr(X,Y,R,WF). |
| 4821 | | membership_custom_set_wf(global_set(GS),X,R,WF) :- !, |
| 4822 | | membership_global_set(GS,X,R,WF). |
| 4823 | | membership_custom_set_wf(CS,X,R,WF) :- |
| 4824 | | add_internal_error('Illegal custom set: ',membership_custom_set_wf(CS,X,R,WF)),fail. |
| 4825 | | |
| 4826 | | membership_avl_set_wf(A,X,R,WF) :- R==pred_true,!, element_of_avl_set_wf(A,X,WF). |
| 4827 | | membership_avl_set_wf(A,X,R,WF) :- R==pred_false,!, not_element_of_custom_set_wf(X,avl_set(A),WF). |
| 4828 | | membership_avl_set_wf(A,X,R,WF) :- is_one_element_avl(A,Y),!, |
| 4829 | | kernel_equality:equality_objects_wf_no_enum(X,Y,R,WF). |
| 4830 | | membership_avl_set_wf(A,_X,R,_WF) :- |
| 4831 | | quick_definitely_maximal_set_avl(A),!, |
| 4832 | | R=pred_true. |
| 4833 | | membership_avl_set_wf(A,X,R,WF) :- reify_avl_membership(A,X,R,FullReification), |
| 4834 | | (FullReification==true |
| 4835 | | -> true %print_term_summary(full_reification(A,X,R)),nl,nl %% did slow down e.g. Bosch Deadlock v9, seems no longer the case |
| 4836 | | ; when((ground(X);nonvar(R)),membership_avl_set_wf2(A,X,R,WF))). |
| 4837 | | |
| 4838 | ? | membership_avl_set_wf2(A,X,R,WF) :- R==pred_true,!, element_of_avl_set_wf(A,X,WF). |
| 4839 | | membership_avl_set_wf2(A,X,R,WF) :- R==pred_false,!, not_element_of_custom_set_wf(X,avl_set(A),WF). |
| 4840 | | membership_avl_set_wf2(AVL,X,R,_WF) :- |
| 4841 | | ground_element_can_be_added_or_removed_to_avl(X), !, |
| 4842 | ? | (safe_avl_member(X,AVL) %safe_avl_member_ground(X,AVL) |
| 4843 | | -> R=pred_true ; R=pred_false). |
| 4844 | | membership_avl_set_wf2(AVL,X,Res,WF) :- % X is ground but cannot be added |
| 4845 | | (Res \== pred_false, element_of_avl_set_wf(AVL,X,WF), Res=pred_true |
| 4846 | | ; |
| 4847 | | Res \== pred_true, not_element_of_custom_set_wf(X,avl_set(AVL),WF), Res=pred_false). |
| 4848 | | |
| 4849 | | membership_global_set(GS,_X,R,_WF) :- is_maximal_global_set(GS),!, |
| 4850 | | R=pred_true. |
| 4851 | | membership_global_set(GS,X,R,WF) :- ground(X),!, |
| 4852 | | (element_of_global_set_wf(X,GS,WF) -> R=pred_true ; R=pred_false). |
| 4853 | | membership_global_set(GS,X,R,_WF) :- get_integer_set_interval(GS,Low,Up),!, |
| 4854 | | membership_interval(X,Low,Up,R). |
| 4855 | | membership_global_set(GS,X,R,WF) :- % this case should probably never apply |
| 4856 | | (GS=='FLOAT' -> true % currently it actually is also treated like REAL |
| 4857 | | ; print(uncovered_membership(GS,X,R,WF)),nl), |
| 4858 | | when(ground(X), (element_of_global_set_wf(X,GS,WF) -> R=pred_true ; R=pred_false)). |
| 4859 | | |
| 4860 | | membership_interval(X,Low,Up,Res) :- nonvar(Up),Up=inf,!,X=int(IX), |
| 4861 | | b_interpreter_check:check_arithmetic_operator('<=',Low,IX,Res). |
| 4862 | | membership_interval(X,Low,Up,Res) :- kernel_equality:in_nat_range_test(X,int(Low),int(Up),Res). |
| 4863 | | |
| 4864 | | :- use_module(bool_pred). |
| 4865 | | closure_membership_wf(X,[ZZZZ],[integer],CondClosure,Res,_WF) :- |
| 4866 | ? | is_interval_closure_body(CondClosure,ZZZZ,LOW,UP),!, |
| 4867 | | kernel_equality:in_nat_range_test(X,int(LOW),int(UP),Res). |
| 4868 | | % TO DO: deal with open intervals 0..inf ... |
| 4869 | | closure_membership_wf(X,Par,Types,Body,Res,WF) :- |
| 4870 | | is_member_closure(Par,Types,Body,_Type,VAL), |
| 4871 | | (VAL=value(_) ; VAL = cartesian_product(b(value(A),_,_),b(value(B),_,_))),!, |
| 4872 | | (VAL=value(Set) |
| 4873 | | -> kernel_objects:membership_test_wf(Set,X,Res,WF) |
| 4874 | | ; kernel_equality:cartesian_pair_test_wf(X,A,B,Res,WF)). |
| 4875 | | closure_membership_wf(X,Par,Typ,Body,Res,WF) :- |
| 4876 | | is_not_member_closure(Par,Typ,Body,_Type,value(Set)),!, |
| 4877 | | bool_pred:negate(ResXSet,Res), % was kernel_equality:inv_mem_obj(ResXSet,Res), |
| 4878 | | kernel_objects:membership_test_wf(Set,X,ResXSet,WF). |
| 4879 | | % TO DO: if closure = POW closure -> translate into subset_test pow_subset |
| 4880 | | % TO DO: support a few other closures related to symbolic unary/binary operators: closure1, POW(..), ... ? |
| 4881 | | % TO DO: expand if set is small |
| 4882 | | closure_membership_wf(X,Par,Types,Body,Res,WF) :- ground_value(X),!, |
| 4883 | | closure_membership_ground_wf(X,closure(Par,Types,Body),Res,WF). |
| 4884 | | closure_membership_wf(X,Par,Types,Body,Res,WF) :- |
| 4885 | | CS = closure(Par,Types,Body), |
| 4886 | | is_small_specific_custom_set(CS,100), |
| 4887 | | try_expand_and_convert_to_avl_wf(CS,Expanded,closure_membership_wf,'',WF), |
| 4888 | | nonvar(Expanded), Expanded=avl_set(_), |
| 4889 | | !, |
| 4890 | | membership_custom_set_wf(Expanded,X,Res,WF). |
| 4891 | | closure_membership_wf(X,Par,Types,Body,Res,WF) :- |
| 4892 | | Body \= b(member(_,_),_,_), % otherwise we may have an infinite loop; b_check_boolean_expression will generate a closure which will call closure_membership_wf again; TO DO: refine to allow certain memberships to go through |
| 4893 | | get_texpr_info(Body,BodyInfo), |
| 4894 | | \+ member(prob_annotation(recursive(_RID)),BodyInfo), % otherwise we can get errors as recursive identifier _RID needs to be added to local state ! (test 1151 fails otherwise) |
| 4895 | | % TO DO: add recursive parameter below in set_up_typed_localstate2; + in which other circumstances do we need to set up recursion identifier ! |
| 4896 | | % Try reifiyng the body |
| 4897 | | NegationContext=positive, |
| 4898 | | copy_wf_start(WF,closure_membership_wf,CWF), |
| 4899 | | b_interpreter:set_up_typed_localstate2(Par,Types,BodyInfo,ParValues,TypedVals,[],State,NegationContext), |
| 4900 | | %couplise_list(Types,XType), |
| 4901 | | convert_list_into_pairs(ParValues,SingleParValue), |
| 4902 | | kernel_objects:equal_object(X,SingleParValue,closure_membership_wf), |
| 4903 | | b_interpreter_check:b_check_boolean_expression(Body,[],State,CWF,PredRes), |
| 4904 | | !, |
| 4905 | | (debug_mode(on) -> print('REIFICATION of closure: '), translate:print_bexpr(Body),nl, print(pred_res(X,PredRes)),nl ; true), |
| 4906 | | b_enumerate:b_tighter_enumerate_all_values(TypedVals,WF), % not necessary ?? as X should get enumerated |
| 4907 | | Res=PredRes, |
| 4908 | | copy_wf_finish(WF,CWF). |
| 4909 | | closure_membership_wf(X,Par,Types,Body,Res,WF) :- |
| 4910 | | when( (ground(X);nonvar(Res)), %% |
| 4911 | | % used to be ground(X), % with (ground(X);nonvar(Res)), test 292 failed {x,t|t : BOOL & (x : POW(1024 .. 1025) & bool(x : POW(NATURAL1)) = t)} = {{} |-> TRUE,{1024} |-> TRUE,{1024,1025} |-> TRUE,{1025} |-> TRUE} and test 1088 failed |
| 4912 | | closure_membership_ground_wf(X,closure(Par,Types,Body),Res,WF)). |
| 4913 | | |
| 4914 | | closure_membership_ground_wf(X,CS,Res,WF) :- nonvar(Res),!, |
| 4915 | | % this optimization is checked in test 1452 |
| 4916 | | (Res==pred_true -> element_of_custom_set_wf(X,CS,WF) ; not_element_of_custom_set_wf(X,CS,WF)). |
| 4917 | | closure_membership_ground_wf(X,CS,Res,WF) :- |
| 4918 | | % to ensure that we leave no choice point behind we have to force full evaluation of element/not_element calls: |
| 4919 | | % hence we do not call element_of_custom_set_wf or not_element_of_custom_set_wf below !! |
| 4920 | | kernel_waitflags:get_idle_wait_flag(closure_membership_ground_wf,WF,LWF), % enable other triggered co-routines to fire first; some maybe much more efficient to deal with than closure expansion; |
| 4921 | | % used to be important for test 1146, but this is no longer the case |
| 4922 | | %term_variables(CS,Vars),print(closure_membership_ground_wf_aux(LWF,vars(Vars),CS)),nl, |
| 4923 | | ground_value_check(CS,CSGr), |
| 4924 | | %when((nonvar(LWF),(nonvar(CSGr);nonvar(Res))),closure_membership_ground_wf_aux(X,CS,Res)). |
| 4925 | | block_closure_membership_ground_wf_aux(X,CS,Res,CSGr,LWF,WF). % Note: wrong block in commit 332cb17487017d819e9140427b1017a3045b3685 caused problem for test 1162 |
| 4926 | | |
| 4927 | | :- block block_closure_membership_ground_wf_aux(?,?,?,?,-,?), |
| 4928 | | block_closure_membership_ground_wf_aux(?,?,-,-,?,?). |
| 4929 | | block_closure_membership_ground_wf_aux(X,CS,Res, _,_,WF) :- |
| 4930 | ? | closure_membership_ground_wf_aux(X,CS,Res,WF). |
| 4931 | | |
| 4932 | | % X & CS are ground or Res is known |
| 4933 | | closure_membership_ground_wf_aux(X,CS,Res,WF) :- Res==pred_true,!, |
| 4934 | ? | element_of_custom_set_wf(X,CS,WF). |
| 4935 | | closure_membership_ground_wf_aux(X,CS,Res,WF) :- Res==pred_false,!, |
| 4936 | ? | not_element_of_custom_set_wf(X,CS,WF). |
| 4937 | | closure_membership_ground_wf_aux(X,CS,Res,_WF) :- |
| 4938 | | % we know that X is a ground value and CS is ground: we can determine completely whether X is element of CS or not |
| 4939 | ? | if(element_of_custom_set(X,CS),Res=pred_true, Res=pred_false). |
| 4940 | | /* used to be: (Res \== pred_false, element_of_custom_set(X,CS), Res=pred_true |
| 4941 | | ; Res \== pred_true, not_element_of_custom_set(X,CS), Res=pred_false)). |
| 4942 | | */ |
| 4943 | | |
| 4944 | | |
| 4945 | | |
| 4946 | | :- use_module(kernel_objects,[element_of_global_set/2,element_of_global_set_wf/3]). |
| 4947 | | element_of_custom_set_wf(X,CS,WF) :- |
| 4948 | ? | element_of_custom_set_wf2(CS,X,WF). %, print(check_ok(X)),nl. |
| 4949 | | |
| 4950 | | element_of_custom_set_wf2(node(A,B,C,D,E),X,WF) :- |
| 4951 | | add_internal_error('Unwrapped avl_set: ',element_of_custom_set_wf2(node(A,B,C,D,E),X,WF)),fail. |
| 4952 | | element_of_custom_set_wf2(global_set(GS),X,WF) :- element_of_global_set_wf(X,GS,WF). |
| 4953 | | element_of_custom_set_wf2(freetype(ID),X,WF) :- |
| 4954 | | (is_maximal_freetype(ID) -> true |
| 4955 | | ; add_internal_error('Uncovered case: ',element_of_custom_set_wf2(freetype(ID),X,WF)) |
| 4956 | | ). % we assume freetypes to be maximal ! |
| 4957 | ? | element_of_custom_set_wf2(avl_set(AVL),X,WF) :- element_of_avl_set_wf(AVL,X,WF). |
| 4958 | | element_of_custom_set_wf2(closure(Parameters,PT,Cond),X,WF) :- |
| 4959 | ? | element_of_closure(X,Parameters,PT,Cond,WF). |
| 4960 | | |
| 4961 | | element_of_avl_set_wf(node(Y,_,_,empty,empty),X,WF) :- !, |
| 4962 | ? | kernel_objects:equal_object_wf(X,Y,element_of_custom_set_wf2,WF). |
| 4963 | ? | element_of_avl_set_wf(AVL,X,_WF) :- ground_value(X),!, safe_avl_member(X,AVL). %safe_avl_member_ground(X,AVL). |
| 4964 | | element_of_avl_set_wf(AVL,X,WF) :- |
| 4965 | | avl_approximate_size(AVL,10,ApproxSize), |
| 4966 | ? | element_of_avl_set_wf(AVL,ApproxSize,X,WF). |
| 4967 | | |
| 4968 | | :- use_module(clpfd_tables). |
| 4969 | | |
| 4970 | | element_of_avl_set_wf(AVL,ApproxSize,X,WF) :- |
| 4971 | | % first check if worthwhile to attempt table treatment |
| 4972 | | % after fixing table/2 bug runtimes have slowed down and test 1753 became much slower |
| 4973 | | % for test 1753 a threshold of < 63 would be ideal; but test 1716 requires size 91 |
| 4974 | | % TODO: re-evaluate when SICStus 4.8 available |
| 4975 | | preferences:preference(use_clpfd_solver,true), |
| 4976 | | preferences:preference(solver_strength,SS), |
| 4977 | | ApproxSize < 100+SS, |
| 4978 | | (var(X) -> true |
| 4979 | | ; X = (X1,_X2) -> (ground_value(X1) -> ApproxSize < 10+SS ; true) |
| 4980 | | ; X=rec(_) -> true |
| 4981 | | %; X=int(_) -> true ; X=fd(_,_) -> true % for scalar values we already use in_fd_value_list_wf via avl_fd_value_check |
| 4982 | | ), |
| 4983 | | can_translate_avl_to_table(AVL,SkeletonType), |
| 4984 | | !, |
| 4985 | ? | check_element_of_avl_with_table(X,SkeletonType,AVL,WF). |
| 4986 | | element_of_avl_set_wf(AVL,ApproxSize,X,WF) :- |
| 4987 | ? | propagate_avl_element_information(X,AVL,ApproxSize,WF), %translate:translate_bvalue(avl_set(AVL),SS), |
| 4988 | | get_bounded_wait_flag(ApproxSize,element_of_avl(X),WF,WF1), |
| 4989 | ? | element_of_avl_set_wf3(X,AVL,ApproxSize,WF1,WF). |
| 4990 | | |
| 4991 | | |
| 4992 | | % compute an approximate size (small sets are computed exactly) |
| 4993 | | avl_approximate_size(AVL,Size) :- avl_approximate_size(AVL,10,Size). |
| 4994 | | |
| 4995 | | avl_approximate_size(AVL,HeightBound,Size) :- var(AVL),!, |
| 4996 | | add_internal_error('AVL Set is variable: ', avl_approximate_size(AVL,HeightBound,Size)), |
| 4997 | | Size=1000000. |
| 4998 | | avl_approximate_size(AVL,HeightBound,Size) :- % when the AVL gets too large; not so important that we have a precise estimation anyway |
| 4999 | | % so: save some time and just compute height |
| 5000 | | avl_height(AVL,Height), |
| 5001 | | (Height>HeightBound |
| 5002 | | -> Size is floor(2**Height-1) |
| 5003 | | ; avl_size(AVL,Size)). |
| 5004 | | |
| 5005 | | :- block element_of_avl_set_wf3(-,?,?,-,?). |
| 5006 | | element_of_avl_set_wf3(X,AVL,_ApproxSize,_WF1,_WF) :- var(X), !, |
| 5007 | ? | safe_avl_member(X,AVL). |
| 5008 | | % TO DO: if randomise_enumeration_order is true then choose elements in random order |
| 5009 | | element_of_avl_set_wf3((X,Y),AVL,ApproxSize,WF1,WF) :- !, |
| 5010 | | ground_value_check(X,GrX), % as soon as X is ground we can efficiently find possible values for Y |
| 5011 | | % TODO: it could be that X is also a pair or a record with first field known; |
| 5012 | | % see flexible_decompose_index and safe_flex_avl_member_default_wf |
| 5013 | ? | block_couple_element_of_avl_set_grX_wf1(X,Y,AVL,ApproxSize,GrX,WF1,WF). |
| 5014 | | element_of_avl_set_wf3(X,AVL,_ApproxSize,WF1,_WF) :- |
| 5015 | | ground_value_check(X,GrX), |
| 5016 | ? | safe_avl_member_block(X,AVL,GrX,WF1). |
| 5017 | | |
| 5018 | | :- block safe_avl_member_block(?,?,-,-). |
| 5019 | | safe_avl_member_block(X,AVL,_,_) :- |
| 5020 | ? | safe_avl_member(X,AVL). |
| 5021 | | |
| 5022 | | % --------------------------------------------------- |
| 5023 | | |
| 5024 | | |
| 5025 | | :- block block_couple_element_of_avl_set_grX_wf1(?, - ,?,?,-,-,?). |
| 5026 | | block_couple_element_of_avl_set_grX_wf1(X,Y,AVL,ApproxSize,GrX,WF1,WF) :- |
| 5027 | | var(GrX), var(WF1), |
| 5028 | | !, |
| 5029 | | % we know the result Y but not yet fully the input value X |
| 5030 | | (ApproxSize < 129 % TO DO: improve this; unify with inverse_apply_ok(Y,X,AVL,ApproxSize) ? |
| 5031 | | -> ground_value_check(Y,GrY) % wait until Y is fully known |
| 5032 | | ; (preference(solver_strength,SS), ApproxSize < 129+SS) |
| 5033 | | -> ground_value_check(Y,GrY) |
| 5034 | | % TO DO: we could look at avl_min and avl_max and estimate spread of range keys |
| 5035 | | ; cond_perfmessage([data_validation_mode/false],no_inverse_avl_lookup(ApproxSize,Y)) % do not bind GrY; we wait until GrX or WF1 is bound |
| 5036 | | ), |
| 5037 | ? | block_couple_element_of_avl_set_grX_grY_wf1(X,Y,AVL,ApproxSize,GrX,GrY,WF1,WF). |
| 5038 | | block_couple_element_of_avl_set_grX_wf1(X,Y,AVL,_ApproxSize,GrX,WF1,WF) :- |
| 5039 | ? | couple_element_of_avl_set(X,Y,AVL,GrX,WF1,WF). |
| 5040 | | |
| 5041 | | :- block block_couple_element_of_avl_set_grX_grY_wf1(?,?,?,?, -,-,-,?). |
| 5042 | | block_couple_element_of_avl_set_grX_grY_wf1(X,Y,AVL,_ApproxSize, GrX,_GrY,WF1,WF) :- |
| 5043 | | var(GrX), var(WF1), % i.e., Y is known |
| 5044 | | % we know the result Y but not yet fully the input value X |
| 5045 | | %inverse_apply_ok(Y,X,AVL,ApproxSize), |
| 5046 | | !, |
| 5047 | | inverse_get_possible_values(X,Y,AVL,Res), |
| 5048 | | Res = avl_set(InvAVL), |
| 5049 | ? | element_of_avl_set_wf(InvAVL,X,WF). |
| 5050 | | block_couple_element_of_avl_set_grX_grY_wf1(X,Y,AVL,_ApproxSize,GrX,_GrY,WF1,WF) :- |
| 5051 | ? | couple_element_of_avl_set(X,Y,AVL,GrX,WF1,WF). |
| 5052 | | |
| 5053 | | |
| 5054 | | % special treatment for relations: if the first component is known: then we can check how many images there are |
| 5055 | | couple_element_of_avl_set(X,Y,AVL,GrX,WF1,WF) :- |
| 5056 | | nonvar(WF1), var(GrX), %\+ground(X), |
| 5057 | | !, |
| 5058 | ? | safe_flex_avl_member_default_wf((X,Y),AVL,WF). |
| 5059 | | couple_element_of_avl_set(X,Y,AVLRelation,_GrX,_,WF) :- % X must be ground |
| 5060 | | get_template(Y,TY,_ToUnifyAfter), % was copy_term(Y,CY) but could cause issues with closures with variables |
| 5061 | | copy_term(TY,CY), % avoid that we instantiate Y and trigger co-routines |
| 5062 | | findall(CY,avl_member_pair_arg1_ground(X,CY,AVLRelation),Images), |
| 5063 | | Images \= [], |
| 5064 | | construct_avl_from_lists_wf(Images,AVL,WF), |
| 5065 | ? | element_of_custom_set_wf2(AVL,Y,WF). % will set up waitflag if necessary |
| 5066 | | |
| 5067 | | % a version of safe_avl_member_default_wf which tries to flexibly find a usable index into the AVL first |
| 5068 | | % it checks if a value can be decomposed into a ground index and the rest of a value |
| 5069 | | % it also works for records indexing on first field |
| 5070 | | % see tests 2351, 2353, 1966; |
| 5071 | | safe_flex_avl_member_default_wf(Element,AVL,WF) :- |
| 5072 | | \+ avl_height_less_than(AVL,4), % AVL tree large enough for indexing; check not necessary?; see test 2287 |
| 5073 | | flexible_decompose_index(Element,Key,Rest1,Path),!, % TODO: if fails: perfmessage |
| 5074 | | % see Machine_Nov25/RVF428_MSTE_FOLIO.mch where this optimisation is very useful |
| 5075 | | avl_fetch_with_flexible_index(Key, Path, AVL ,Rest2), |
| 5076 | | kernel_objects:equal_object_wf(Rest1,Rest2,avl_fetch_with_flexible_index,WF). |
| 5077 | | safe_flex_avl_member_default_wf(Element,AVL,WF) :- |
| 5078 | ? | safe_avl_member_default_wf(Element,AVL,WF). |
| 5079 | | |
| 5080 | | % set Res -> pred_true or pred_false if membership can be decided early |
| 5081 | | % interval closures already dealt with by closure_membership |
| 5082 | | % maximal sets are also already dealt with by membership_custom_set |
| 5083 | | reify_avl_membership(AVL,Element,Res,FullReification) :- |
| 5084 | | is_avl_simple_set(AVL,Type), |
| 5085 | | preferences:preference(use_clpfd_solver,true), % to do: require maybe only for integer type !? |
| 5086 | | \+ ground_value(Element), |
| 5087 | | !, |
| 5088 | | reify_avl_mem2(Type,Element,AVL,Res,FullReification). |
| 5089 | | reify_avl_membership(_,_,_,false). |
| 5090 | | |
| 5091 | | |
| 5092 | | is_avl_simple_set(node(El,_True,_,_,_),Type) :- simple_type(El,Type). |
| 5093 | | simple_type(int(_),integer). |
| 5094 | | simple_type(fd(_,GS),global(GS)). |
| 5095 | | |
| 5096 | | |
| 5097 | | reify_avl_mem2(integer,int(El),AVL,Res,FullReification) :- |
| 5098 | | avl_min(AVL,int(Min)), avl_max(AVL,int(Max)), |
| 5099 | | (reify_integer_avl_mem(AVL,Min,Max) % reify if AVL small enough |
| 5100 | | -> avl_domain(AVL,R),project_avl_domain_on_fd(R,FDList), |
| 5101 | | clpfd_reify_inlist(El,FDList,FDRes,Posted), |
| 5102 | | propagate_fd_membership(FDRes,Res,inlist(El,FDList)), |
| 5103 | | FullReification=Posted |
| 5104 | | ; clpfd_interface:try_post_constraint((El in Min..Max) #<=> FDRes), |
| 5105 | | propagate_not_membership(FDRes,Res,int(El,Min,Max)), |
| 5106 | | FullReification=false |
| 5107 | | ). |
| 5108 | | % this could also be enabled with CLPFD = FALSE ?? no overflows are possible |
| 5109 | | reify_avl_mem2(global(GS),fd(El,GS),AVL,Res,FullReification) :- |
| 5110 | | avl_domain(AVL,R),project_avl_domain_on_fd(R,FDList), |
| 5111 | | b_global_sets:b_get_fd_type_bounds(GS,Low,Up), |
| 5112 | | (is_full_fdlist(FDList,Low,Up) |
| 5113 | | -> Res=pred_true, % all the values are in the list; it must be a member |
| 5114 | | % normally this should also be detected by clpfd_reify_inlist, unless no constraint was set up for El |
| 5115 | | % it seems to have an effect for test 426: probcli examples/EventBPrologPackages/SSF/Bepi_Soton/M1_mch.eventb -cbc all -strict -p CLPFD TRUE -p SMT TRUE -strict -p STRICT_RAISE_WARNINGS TRUE |
| 5116 | | FullReification=true |
| 5117 | | ; clpfd_reify_inlist(El,FDList,FDRes,Posted), |
| 5118 | | propagate_fd_membership(FDRes,Res,inlist(El,FDList)), |
| 5119 | | FullReification=Posted |
| 5120 | | ). |
| 5121 | | %reify_avl_mem2(global(GS),fd(El,GS),AVL,Res) :- |
| 5122 | | % avl_min(AVL,fd(Min,GS)), avl_max(AVL,fd(Max,GS)), |
| 5123 | | % clpfd_interface:try_post_constraint((El in Min..Max) #<=> FDRes), |
| 5124 | | % propagate_not_membership(FDRes,Res,fd(El,GS,Min,Max)). |
| 5125 | | |
| 5126 | | % assumes list is sorted |
| 5127 | | is_full_fdlist(List,Low,Up) :- integer(Up), is_full_fdlist2(List,Low,Up). |
| 5128 | | is_full_fdlist2([],Low,Up) :- Low>Up. |
| 5129 | | is_full_fdlist2([Low|T],Low,Up) :- L1 is Low+1, is_full_fdlist2(T,L1,Up). |
| 5130 | | |
| 5131 | | % check if avl small enough to call clpfd_reify_inlist |
| 5132 | | reify_integer_avl_mem(_AVL,Min,Max) :- MaxSizeM1 is Max-Min, MaxSizeM1 =< 20,!. |
| 5133 | | reify_integer_avl_mem(AVL,_Min,_Max) :- avl_height_less_than_with_solver_strength(AVL,5). |
| 5134 | | |
| 5135 | | |
| 5136 | | |
| 5137 | | project_avl_domain_on_fd([],[]). |
| 5138 | | project_avl_domain_on_fd([H|T],[PH|PT]) :- project_avl_domain(H,PH), project_avl_domain_on_fd(T,PT). |
| 5139 | | project_avl_domain(int(X),X). |
| 5140 | | project_avl_domain(fd(X,_),X). |
| 5141 | | |
| 5142 | | |
| 5143 | | :- block propagate_fd_membership(-,-,?). |
| 5144 | | % if we make it propagate_fd_membership(-,-?) Bosch examples becomes much slower ? |
| 5145 | | % Indeed: membership_custom_set will already force membership or non-membership ! |
| 5146 | | %propagate_fd_membership(X,M,Info) :- var(X),!, print(propagate_fd(X,M,Info)),nl, (M=pred_true ->X=1 ; X=0). |
| 5147 | | propagate_fd_membership(1,pred_true,_Info). |
| 5148 | | propagate_fd_membership(0,pred_false,_Info). |
| 5149 | | |
| 5150 | | :- block propagate_not_membership(-,?,?). |
| 5151 | | propagate_not_membership(1,_,_). % there could be elements in the interval which are not in the set |
| 5152 | | propagate_not_membership(0,Res,_Info) :- |
| 5153 | | Res=pred_false. |
| 5154 | | |
| 5155 | | % ----------------- |
| 5156 | | |
| 5157 | | % fails if not possible to quickly compute approximate size |
| 5158 | | quick_custom_explicit_set_approximate_size(V,_) :- var(V),!,fail. |
| 5159 | | quick_custom_explicit_set_approximate_size(avl_set(AVL),Size) :- !, |
| 5160 | | quick_avl_approximate_size(AVL,Size). |
| 5161 | | quick_custom_explicit_set_approximate_size(CS,Size) :- |
| 5162 | | card_for_specific_custom_set(CS,Size,Code), |
| 5163 | | on_enumeration_warning(call(Code),fail), |
| 5164 | | atomic(Size). % inf or number; sometimes card_for_specific_custom_set can return a variable |
| 5165 | | |
| 5166 | | :- use_module(clpfd_lists,[try_get_fd_value_list/4, get_fd_value/3, in_fd_value_list_wf/4]). |
| 5167 | | % a membership propagation, but only done if it can be done quickly |
| 5168 | | |
| 5169 | | |
| 5170 | | % quick_propagation_element_information(Set, Element, WF, PossiblyCompiledSet) |
| 5171 | | % use last element for next iteration if you call quick_propagation_element_information in a loop |
| 5172 | | :- block quick_propagation_element_information(-,?,?,?). |
| 5173 | | quick_propagation_element_information(Set,_El,_,R) :- |
| 5174 | | preferences:preference(use_clpfd_solver,false), |
| 5175 | | !, R=Set. |
| 5176 | | quick_propagation_element_information(avl_set(AVL),Element,WF,NewSet) :- !, |
| 5177 | | quick_avl_approximate_size(AVL,Size), |
| 5178 | | NewSet=avl_set_with_size(AVL,Size), |
| 5179 | | propagate_avl_element_information_direct(Element,AVL,Size,WF). |
| 5180 | | quick_propagation_element_information(avl_set_with_size(AVL,Size),Element,WF,NewSet) :- !, |
| 5181 | | NewSet = avl_set_with_size(AVL,Size), |
| 5182 | | propagate_avl_element_information_direct(Element,AVL,Size,WF). |
| 5183 | | quick_propagation_element_information(closure(P,T,B),Element,WF,NewSet) :- !, |
| 5184 | | NewSet = closure(P,T,B), |
| 5185 | | element_of_closure(Element,P,T,B,WF). |
| 5186 | | quick_propagation_element_information(fd_value_list(FDList,GroundList,Type),El,WF,NewSet) :- !, |
| 5187 | | NewSet = fd_value_list(FDList,GroundList,Type), |
| 5188 | | get_fd_value(Type,El,ElFD), |
| 5189 | | in_fd_value_list_wf(GroundList,ElFD,FDList,WF). |
| 5190 | | quick_propagation_element_information(Set,El,WF,NewSet) :- |
| 5191 | ? | try_get_fd_value_list(Set,Type,FDList,GroundList),!, |
| 5192 | | FDList \= [], % if list is empty membership fails |
| 5193 | | NewSet = fd_value_list(FDList,GroundList,Type), |
| 5194 | | % clpfd_inlist requires list of integers as second argument |
| 5195 | ? | get_fd_value(Type,El,ElFD), |
| 5196 | | % We could apply filter_non_matching_elements here |
| 5197 | | in_fd_value_list_wf(GroundList,ElFD,FDList,WF). |
| 5198 | | quick_propagation_element_information(Set,_,_,Set). |
| 5199 | | |
| 5200 | | % ----------------- |
| 5201 | | |
| 5202 | | % infer information about an element of an AVL set |
| 5203 | | propagate_avl_element_information(Element,AVL,Size,WF) :- |
| 5204 | | (preferences:preference(use_clpfd_solver,true) |
| 5205 | ? | -> propagate_avl_element_information_direct(Element,AVL,Size,WF) |
| 5206 | | ; true). |
| 5207 | | |
| 5208 | | propagate_avl_element_information_direct(Element,AVL,Size,WF) :- |
| 5209 | | (Size<100 -> %30 which magic constant to use here; use larger value in SMT mode ? |
| 5210 | ? | propagate_avl_element_information_small(Element,AVL,WF) |
| 5211 | | ; is_avl_fd_index_set(AVL,Type) -> |
| 5212 | | propagate_avl_element_information_large(Type,Element,AVL), |
| 5213 | | (Size < 4000, nonvar(Element), Element = (_,_) % another magic constant |
| 5214 | | -> Prio is Size // 60, |
| 5215 | | get_wait_flag(Prio,propagate_avl_element_information(Element),WF,LWF), |
| 5216 | | propagate_avl_el_large_block(Element,AVL,WF,LWF) % will do precise propagation |
| 5217 | | ; true) |
| 5218 | | ; true). |
| 5219 | | % TO DO: we could call in_nat_range_wf; this way it would also work in non-CLPFD mode |
| 5220 | | |
| 5221 | | :- block propagate_avl_el_large_block(?,?,?,-). |
| 5222 | | propagate_avl_el_large_block((A,B),_,_,_) :- |
| 5223 | | (ground(A); ground_value(B)), % in first: case we will apply AVL set ; in second case probably no benefit as propagate_avl_element_information_large already propagated first element |
| 5224 | | !. |
| 5225 | | propagate_avl_el_large_block(Element,AVL,WF,_LWF) :- |
| 5226 | | % TO DO: maybe look if we should not use clpfd_list, but only upper & lower bound |
| 5227 | | propagate_avl_element_information_small(Element,AVL,WF). % will do precise propagation. |
| 5228 | | |
| 5229 | | :- use_module(clpfd_lists,[avl_fd_value_check/4]). |
| 5230 | | :- use_module(clpfd_interface,[catch_and_ignore_clpfd_overflow/2]). |
| 5231 | | propagate_avl_element_information_small(Element,AVL,WF) :- |
| 5232 | ? | catch_and_ignore_clpfd_overflow(propagate_avl_element_information_small, % relevant test e.g. 1708 (with used_ids_defined_by_equality) |
| 5233 | | avl_fd_value_check(AVL,Element,WF,_FullyChecked)). |
| 5234 | | |
| 5235 | | propagate_avl_element_information_large(Type,El,AVL) :- |
| 5236 | | avl_min(AVL,Min), avl_max(AVL,Max), |
| 5237 | | % if Size small enough and smaller than Max-Min we call clpfd_inlist on domain |
| 5238 | | % Note: overflows should be caught below; we could check that Min/Max are within CLPFD range |
| 5239 | | couple_prj1_in_range(Type,El,Min,Max). |
| 5240 | | |
| 5241 | | couple_prj1_in_range(integer,int(El),int(Min),int(Max)) :- clpfd_interface:clpfd_inrange(El,Min,Max). |
| 5242 | | couple_prj1_in_range(global(GS),fd(El,GS),fd(Min,GS),fd(Max,GS)) :- clpfd_interface:clpfd_inrange(El,Min,Max). |
| 5243 | | couple_prj1_in_range(couple_prj1(T),(El,_),(Min,_),(Max,_)) :- couple_prj1_in_range(T,El,Min,Max). |
| 5244 | | couple_prj1_in_range(rec_first_field(Name,T),rec([field(Name,El)|TF]), |
| 5245 | | rec([field(Name,Min)|TMin]),rec([field(Name,Max)|_])) :- |
| 5246 | | (var(TF) |
| 5247 | | -> copy_field_names(TMin,TF) % if Fields not yet instantiated: copy over all fields |
| 5248 | | ; true), |
| 5249 | | couple_prj1_in_range(T,El,Min,Max). |
| 5250 | | |
| 5251 | | copy_field_names([],[]). |
| 5252 | | copy_field_names([field(N,_)|T],[field(N,_)|CT]) :- copy_field_names(T,CT). |
| 5253 | | |
| 5254 | | % check if the first component of the AVL elements of a type such that we can propagate FD information |
| 5255 | | is_avl_fd_index_set(node(El,_True,_,_,_),Type) :- |
| 5256 | | simple_index_type(El,Type). |
| 5257 | | simple_index_type((El,_),couple_prj1(T)) :- simple_index_type(El,T). |
| 5258 | | simple_index_type(int(_),integer). |
| 5259 | | simple_index_type(fd(_,GS),global(GS)). |
| 5260 | | simple_index_type(rec(Fields),rec_first_field(Name,T)) :- nonvar(Fields), |
| 5261 | | Fields = [field(Name,El)|_], |
| 5262 | | simple_index_type(El,T). |
| 5263 | | %simple_index_type((int(_),_),couple_integer). |
| 5264 | | %simple_index_type(((int(_),_),_),couple_couple_integer). |
| 5265 | | %simple_index_type((fd(_,GS),_),couple_global(GS)). |
| 5266 | | |
| 5267 | | |
| 5268 | | /* avoid instantiating non-normalised with normalised values leading to failure */ |
| 5269 | | :- assert_must_succeed((X=(fd(1,'Name'),fd(2,'Name')), A=node(X,true,0,empty,empty), |
| 5270 | | custom_explicit_sets:safe_avl_member(X,A) )). |
| 5271 | | |
| 5272 | ? | safe_avl_member(X,AVL) :- var(X), !, my_avl_member(X,AVL). |
| 5273 | | %safe_avl_member(Value,AVL) :- decompose_index(Value,Key,RestVal), avl_fetch_indexed(Value,Key,RestVal,AVL). |
| 5274 | | %safe_avl_member(X,AVL) :- ground_value(X), convert_to_avl_inside_set(X,AX), !, avl_fetch(AX,AVL). |
| 5275 | ? | safe_avl_member(X,AVL) :- safe_flex_avl_member_default_wf(X,AVL,no_wf_available). |
| 5276 | | |
| 5277 | | |
| 5278 | | % a version of safe_avl_member where the first argument is guaranteed to be ground |
| 5279 | | % somehow using this seems to slow-down evaluation for vesg_Dec12; Caching ?? |
| 5280 | | %safe_avl_member_ground(X,AVL) :- |
| 5281 | | % convert_to_avl_inside_set(X,AX), !, avl_fetch(AX,AVL). |
| 5282 | | %safe_avl_member_ground((X,Y),AVL) :- !, avl_member_pair_arg1_ground(X,Y,AVL). |
| 5283 | | %safe_avl_member_ground(X,AVL) :- safe_avl_member_default_wf(X,AVL,no_wf_available). |
| 5284 | | |
| 5285 | | |
| 5286 | | % can be used to try and lookup a function value without creating WD errors, ... |
| 5287 | | % used in b_compiler to compile function applications |
| 5288 | | try_apply_to_avl_set_wf(X,Y,AVL,WF) :- ground_value(X), |
| 5289 | ? | avl_member_pair_arg1_ground_wf(X,Y,AVL,WF). |
| 5290 | | |
| 5291 | | % we know X is ground; typically Y is a free variable and it is used within a findall: |
| 5292 | | avl_member_pair_arg1_ground(X,Y,AVL) :- |
| 5293 | ? | avl_member_pair_arg1_ground_wf(X,Y,AVL,no_wf_available). |
| 5294 | | |
| 5295 | | avl_member_pair_arg1_ground_wf(X,Y,AVL,WF) :- convert_to_avl_inside_set(X,AX), !, |
| 5296 | | get_template(Y,RY,ToUnifyAfter), |
| 5297 | ? | avl_fetch_pair(AX,AVL,RY), % see flexible_decompose_index, safe_flex_avl_member_default_wf |
| 5298 | | unify_after_wf(ToUnifyAfter,WF). |
| 5299 | | avl_member_pair_arg1_ground_wf(X,Y,AVL,_WF) :- |
| 5300 | | safe_avl_member_default((X,Y),AVL). |
| 5301 | | |
| 5302 | | safe_avl_member_default(X,AVL) :- |
| 5303 | ? | safe_avl_member_default_wf(X,AVL,no_wf_available). |
| 5304 | | safe_avl_member_default_wf(X,AVL,WF) :- % statistics(runtime,_), |
| 5305 | | get_template(X,Template,ToUnifyAfter), |
| 5306 | ? | my_avl_member(Template,AVL), |
| 5307 | | % statistics(runtime,[_,T2]), print(avl_member(Template,T2)),nl, |
| 5308 | ? | unify_after_wf(ToUnifyAfter,WF). % kernel_objects:equal_object(Template,X)). |
| 5309 | | |
| 5310 | | unify_after_wf([],_). |
| 5311 | ? | unify_after_wf([A/B|T],WF) :- kernel_objects:equal_object_wf(A,B,unify_after,WF), |
| 5312 | ? | unify_after_wf(T,WF). |
| 5313 | | |
| 5314 | | |
| 5315 | | |
| 5316 | | get_template(A,R,ToUnifyAfter) :- |
| 5317 | | (var(A) -> ToUnifyAfter=[A/R] |
| 5318 | | ; get_template2(A,R,ToUnifyAfter) -> true |
| 5319 | | ; add_internal_error('Could_not_get_template: ',get_template(A,R,_))). |
| 5320 | | |
| 5321 | | get_template2((A,B),(TA,TB),ToUnifyAfter) :- get_template(A,TA,ToUnifyAfter1), get_template(B,TB,ToUnifyAfter2), |
| 5322 | | append(ToUnifyAfter1,ToUnifyAfter2,ToUnifyAfter). % TO DO: use DifferenceLists / DCG |
| 5323 | | get_template2(int(X),int(X),[]). |
| 5324 | | get_template2(fd(A,B),fd(A,B),[]). |
| 5325 | | get_template2([],[],[]). |
| 5326 | | get_template2(pred_false /* bool_false */,pred_false /* bool_false */,[]). |
| 5327 | | get_template2(pred_true /* bool_true */,pred_true /* bool_true */,[]). |
| 5328 | | get_template2([H|T],R,ToUnifyAfter) :- |
| 5329 | | (ground_value(H),ground_value(T) |
| 5330 | | -> convert_to_avl_inside_set([H|T],R),ToUnifyAfter=[] |
| 5331 | | ; ToUnifyAfter=[[H|T]/R]). |
| 5332 | | % ; R=avl_set(A), ToUnifyAfter=[[H|T]/avl_set(A)]). |
| 5333 | | get_template2(closure(P,T,B),R,[]) :- ground_value(closure(P,T,B)), |
| 5334 | | expand_closure_to_avl_wf(P,T,B,R,no_wf_available),!. |
| 5335 | | get_template2(closure(P,T,B),AVL_OR_EMPTY_OR_GS,[closure(P,T,B)/AVL_OR_EMPTY_OR_GS]). % closure could be empty or an infinite global set ? |
| 5336 | | %get_template2(closure_x(_,_,_),_AVL_OR_EMPTY). |
| 5337 | | get_template2(avl_set(A),avl_set(NA),[]) :- convert_to_avl_inside_set(avl_set(A),avl_set(NA)). % do we need to normalise here ?? |
| 5338 | | get_template2(string(X),string(X),[]). |
| 5339 | | get_template2(term(X),term(X),[]). |
| 5340 | | get_template2(freetype(X),R,[]) :- convert_to_avl_inside_set(freetype(X),R). |
| 5341 | | get_template2(rec(Fields),rec(TFields),ToUnifyAfter) :- get_fields_template(Fields,TFields,ToUnifyAfter). |
| 5342 | | get_template2(freeval(ID,Case,Value),freeval(ID,Case,TValue),ToUnifyAfter) :- get_template(Value,TValue,ToUnifyAfter). |
| 5343 | | get_template2(global_set(GS),R,[]) :- convert_to_avl_inside_set(global_set(GS),R). |
| 5344 | | |
| 5345 | | |
| 5346 | | get_fields_template(A,R,[rec(A)/rec(R)]) :- var(A),!. |
| 5347 | | get_fields_template([],[],ToUnifyAfter) :- !, ToUnifyAfter=[]. |
| 5348 | | get_fields_template([field(Name,Val)|T],[field(Name,TVal)|TT],ToUnifyAfter) :- nonvar(Name),!, |
| 5349 | | get_template(Val,TVal,ToUnifyAfter1), |
| 5350 | | get_fields_template(T,TT,ToUnifyAfter2), append(ToUnifyAfter1,ToUnifyAfter2,ToUnifyAfter). |
| 5351 | | get_fields_template(A,R,[rec(A)/rec(R)]). |
| 5352 | | |
| 5353 | | |
| 5354 | | % succeed if we can decide membership of an avl_set on the spot |
| 5355 | | quick_test_avl_membership(AVL,X,Res) :- |
| 5356 | | element_can_be_added_or_removed_to_avl(X), |
| 5357 | | convert_to_avl_inside_set(X,AX), |
| 5358 | | (avl_fetch(AX,AVL) -> Res=pred_true ; Res=pred_false). |
| 5359 | | |
| 5360 | | % --------------------- |
| 5361 | | |
| 5362 | | % a dispatch predicate |
| 5363 | | my_avl_member(Key,AVL) :- |
| 5364 | | (preferences:preference(randomise_enumeration_order,true) |
| 5365 | ? | -> random_avl_member(Key,AVL) ; avl_member_opt(Key,AVL)). |
| 5366 | | :- use_module(library(random),[random/3]). |
| 5367 | ? | random_avl_member(Key,AVL) :- avl_height(AVL,Height), H1 is Height+1, random_avl_member(Key,H1,AVL). |
| 5368 | | % TO DO: make more intelligent; this is not really a very uniform way of randomly enumerating an AVL set (e.g., Key never occurs between L and R) |
| 5369 | | random_avl_member(Key, H, node(K,_,_,L,R)) :- |
| 5370 | | random(1,H,1), !, H1 is H-1, |
| 5371 | ? | (Key=K ; random_avl_member(Key,H1,L) ; random_avl_member(Key,H1,R)). |
| 5372 | | random_avl_member(Key, H, node(K,_,_,L,R)) :- random(1,3,1), !, H1 is H-1, |
| 5373 | ? | (random_avl_member(Key,H1,L) ; random_avl_member(Key,H1,R) ; Key=K). |
| 5374 | | random_avl_member(Key, H, node(K,_,_,L,R)) :- H1 is H-1, |
| 5375 | ? | (random_avl_member(Key,H1,R) ; random_avl_member(Key,H1,L) ; Key=K). |
| 5376 | | |
| 5377 | | % a variation of avl_member from library(avl) which tries to avoid leaving choice points behind |
| 5378 | | avl_member_opt(Key, node(K,_,_,L,R)) :- |
| 5379 | ? | ( avl_member_opt(Key, L) |
| 5380 | | ; R=empty -> Key = K % avoid trailing choice_point |
| 5381 | ? | ; (Key=K ; avl_member_opt(Key, R)) |
| 5382 | | ). |
| 5383 | | |
| 5384 | | % --------------------- |
| 5385 | | |
| 5386 | | :- use_module(kernel_objects,[check_element_of_wf/3,not_element_of_wf/3]). |
| 5387 | | :- use_module(memoization,[element_of_memoization_closure/6]). |
| 5388 | | element_of_special_closure(interval(LOW,UP),X,WF,_,_,_) :- !, |
| 5389 | | %hit_profiler:add_profile_hit(in_nat_range(X,LOW,UP,CondClosure)), |
| 5390 | ? | kernel_objects:in_nat_range_wf(X,int(LOW),int(UP),WF). |
| 5391 | | element_of_special_closure(member_closure(_ID,_Type,VAL),X,WF,_,_,_) :- |
| 5392 | | (VAL=value(_) ; VAL = cartesian_product(b(value(A),_,_),b(value(B),_,_))),!, |
| 5393 | | %hit_profiler:add_profile_hit(in_member_closure(X,Par,Typ,Body)), |
| 5394 | | (VAL=value(Set) -> check_element_of_wf(X,Set,WF) |
| 5395 | | ; X=(XA,XB), |
| 5396 | ? | kernel_objects:check_element_of_wf(XA,A,WF), |
| 5397 | ? | kernel_objects:check_element_of_wf(XB,B,WF)). |
| 5398 | | element_of_special_closure(not_member_closure(_ID,_Type,value(Set)),X,WF,_,_,_) :- !, |
| 5399 | | %hit_profiler:add_profile_hit(in_not_member_closure(X,Par,Typ,Set)), |
| 5400 | | not_element_of_wf(X,Set,WF). |
| 5401 | | % we used to have to add enumerator, as not_element_of does not instantiate; e.g. relevant when doing X :: GS - {y} |
| 5402 | | % This is no longer required |
| 5403 | | % see test 6 (../prob_examples/public_examples/B/FeatureChecks/NotMemberCheck.mch) |
| 5404 | | element_of_special_closure(recursive_special_closure(RId),X,WF,Parameters,PT,CondClosure) :- !, |
| 5405 | | add_recursive_parameter(Parameters,PT,X,RId,CondClosure,NewParameters,NewPT,Value,WF), |
| 5406 | | element_of_normal_closure(Value,NewParameters,NewPT,CondClosure,WF). |
| 5407 | | element_of_special_closure(memoization_closure(MemoID),X,WF,P,T,B) :- !, |
| 5408 | | element_of_memoization_closure(MemoID,X,WF,P,T,B). |
| 5409 | | element_of_special_closure(_,X,WF,Parameters,PT,CondClosure) :- |
| 5410 | | % none of the special cases above apply after all |
| 5411 | ? | element_of_normal_closure(X,Parameters,PT,CondClosure,WF). |
| 5412 | | |
| 5413 | | :- block element_of_closure(?,-,?,?,?), element_of_closure(?,?,?,-,?). |
| 5414 | | % element_of_closure(X,Para,T,Body,_WF): check if X is a member of closure(Para,T,Body) |
| 5415 | | element_of_closure(X,Parameters,PT,CondClosure,WF) :- |
| 5416 | | is_special_closure(Parameters,PT,CondClosure, SpecialClosure),!, |
| 5417 | | %print_term_summary(element_of_special_closure(SpecialClosure,X,WF,Parameters,PT,CondClosure)), trace_in_debug_mode, |
| 5418 | ? | element_of_special_closure(SpecialClosure,X,WF,Parameters,PT,CondClosure). |
| 5419 | | element_of_closure(X,Parameters,PT,CondClosure,WF) :- |
| 5420 | | %print_term_summary(element_of_normal_closure(X,Parameters,PT,CondClosure,WF)), trace_in_debug_mode, |
| 5421 | ? | element_of_normal_closure(X,Parameters,PT,CondClosure,WF). |
| 5422 | | element_of_normal_closure(X,Parameters,PT,CondClosure,WF) :- |
| 5423 | | %hit_profiler:add_profile_hit(element_of_closure(X,Parameters,PT,CondClosure)), |
| 5424 | | same_length(Parameters,ParValues), |
| 5425 | | convert_list_into_pairs(ParValues,X), |
| 5426 | ? | b_test_closure_wo_enum(Parameters,PT,CondClosure,ParValues,WF). |
| 5427 | | |
| 5428 | | :- use_module(store,[set_up_localstate/4]). |
| 5429 | | :- block b_test_closure_wo_enum(?,?,-,?,?). |
| 5430 | | b_test_closure_wo_enum(Parameters,ParameterTypes,ClosurePred,ParValues,WF) :- |
| 5431 | | % same_length(Parameters,ParValues), % not necessary |
| 5432 | | set_up_localstate(Parameters,ParValues,[],LocalState), |
| 5433 | ? | b_enumerate:b_type_values_in_store(Parameters,ParameterTypes,LocalState), |
| 5434 | | copy_wf_start(WF,b_test_closure_wo_enum(Parameters),InnerWF), |
| 5435 | | % avoid that WF0 actions triggered before we have had a chance to traverse the expression |
| 5436 | ? | b_test_boolean_expression(ClosurePred,LocalState,[],InnerWF), |
| 5437 | ? | copy_wf_finish(WF,InnerWF). |
| 5438 | | |
| 5439 | | % recursive identifier to list of parameters with body as value |
| 5440 | | % NewValue is the Value that should be checked for membership in the adapted closure; it has one argument more |
| 5441 | | add_recursive_parameter(Parameters,Types,Value,TId,CondClosure,NewParameters,NewTypes,NewValue,WF) :- |
| 5442 | | TId = b(identifier(RId),SetType,_), % unification replaces: get_texpr_id(TId,RId), get_texpr_type(TId,SetType), |
| 5443 | | append(Parameters,[RId],NewParameters), |
| 5444 | | append(Types,[SetType],NewTypes), |
| 5445 | | %tools_printing:print_term_summary(recursion(Value)),nl, |
| 5446 | | % TO DO check some variant decreases |
| 5447 | | (kernel_waitflags:pending_abort_error(WF) |
| 5448 | | -> NewValue = (_,_) % prevent further expansion of recursion, in case WD error in recursive function |
| 5449 | | % TO DO: detect whether WD error occurs within recursive function, |
| 5450 | | % indeed, the expansion of the recursive function could be unrelated to WD error and be important to detect inconsistency which prevents WD error: e.g., 1/x=res & recfun(x) \= 0 |
| 5451 | | ,debug_println(19,stopping_recursion_due_to_wd_error) |
| 5452 | | ; NewValue = (Value,closure(Parameters,Types,CondClosure)) |
| 5453 | | ). |
| 5454 | | |
| 5455 | | |
| 5456 | | % same as above, but without a waitflag |
| 5457 | ? | element_of_custom_set(X,CS) :- element_of_custom_set2(CS,X). |
| 5458 | | |
| 5459 | | element_of_custom_set2(global_set(GS),X) :- !,element_of_global_set(X,GS). |
| 5460 | | element_of_custom_set2(freetype(ID),_) :- is_maximal_freetype(ID),!. % freetypes are always maximal at the moment |
| 5461 | | element_of_custom_set2(avl_set(AVL),X) :- !, |
| 5462 | ? | safe_avl_member(X,AVL). |
| 5463 | | element_of_custom_set2(CS,X) :- init_wait_flags(WF,[element_of_custom_set2]), |
| 5464 | ? | element_of_custom_set_wf2(CS,X,WF), |
| 5465 | ? | ground_wait_flags(WF). |
| 5466 | | |
| 5467 | | % --------------- |
| 5468 | | |
| 5469 | | % function application for closure |
| 5470 | | |
| 5471 | | % same as check_element_of_wf but does not wait on Y: |
| 5472 | | % should also work for relation ?? |
| 5473 | | |
| 5474 | | check_element_of_function_closure(X,Y,Parameters,PT,CondClosure,WF) :- |
| 5475 | | is_special_closure(Parameters,PT,CondClosure, SpecialClosure),!, % this covers recursive closures |
| 5476 | | element_of_special_closure(SpecialClosure,(X,Y),WF,Parameters,PT,CondClosure). |
| 5477 | | check_element_of_function_closure(X,Y, P,T,ClosureBody, WF) :- |
| 5478 | | % affects test 1312, unless we add s:seq(0..9) before calling num |
| 5479 | | % a special rule which tries and avoid enumerating solutions to arguments of function application |
| 5480 | | % usually a function application will either be given all arguments or maybe be used in inverse |
| 5481 | ? | is_converted_lambda_closure(P,T,ClosureBody), %is_converted_non_recursive_lambda_closure(P,T,ClosureBody), |
| 5482 | | % TO DO: also make this work for recursive closures by adding recursive args (see e.g. test 1302) |
| 5483 | | is_lambda_closure(P,T,ClosureBody, OtherIDs, OtherTypes, DomainPred, EXPR), |
| 5484 | | (debug:debug_level_active_for(4) -> |
| 5485 | | print('Apply Fun : '), translate:print_bexpr(DomainPred), print(' | '), translate:print_bexpr(EXPR),nl, |
| 5486 | | get_texpr_info(ClosureBody,I), print(info(I,WF)),nl, |
| 5487 | | print_term_summary((X,Y)),nl %,trace |
| 5488 | | ; true), |
| 5489 | | !, |
| 5490 | | % alternative: annotate X,Y as inner variable ? |
| 5491 | | get_texpr_info(ClosureBody,BInfo), |
| 5492 | | b_interpreter:set_up_typed_localstate2(OtherIDs,OtherTypes,BInfo,ParValues,_TypedVals,[],LocalState,positive), |
| 5493 | | convert_list_into_pairs(ParValues,SingleParValue), |
| 5494 | | kernel_objects:equal_object_wf(X,SingleParValue,check_element_of_function_closure,WF), |
| 5495 | | (is_truth(DomainPred) -> true |
| 5496 | | ; init_wait_flags(InnerWF,[check_element_of_function_closure]), |
| 5497 | | %copy_wf01e_wait_flags(WF,InnerWF), % we could delay copying WF0 until after test_boolean_expression of DomainPred ? |
| 5498 | | b_test_boolean_expression(DomainPred,LocalState,[],InnerWF), |
| 5499 | | get_wait_flag0(WF,WF0), get_wait_flag0(InnerWF,WF0), % was: ground_wait_flag0(InnerWF), but this can result in inner WF0 being set when outer is not yet set; see test 1948 |
| 5500 | | ground_value_check(X,GrX), |
| 5501 | | (nonvar(GrX) -> copy_waitflag_store(InnerWF,WF) % block would trigger already |
| 5502 | | ; ground_value_check(Y,GrY), |
| 5503 | | (nonvar(GrY) -> copy_waitflag_store(InnerWF,WF) % block would trigger already |
| 5504 | | ; get_last_wait_flag(check_element_of_function_closure(OtherIDs),WF,LastWF), |
| 5505 | | block_copy_waitflag_store(InnerWF,WF,GrX,GrY,LastWF) |
| 5506 | | ) |
| 5507 | | ) |
| 5508 | | ), |
| 5509 | | b_interpreter:b_compute_expression(EXPR,LocalState,[],Y,WF). |
| 5510 | | check_element_of_function_closure(X,Y, P,T,ClosureBody, WF) :- |
| 5511 | | element_of_normal_closure((X,Y),P,T,ClosureBody,WF). |
| 5512 | | % we could memoize on X here if /*@symbolic-memo */ pragma used and closure has special ID associated with it |
| 5513 | | |
| 5514 | | :- block block_copy_waitflag_store(?,?,-,-,-). |
| 5515 | | block_copy_waitflag_store(InnerWF,WF,_GrX,_GrY,_LWF) :- |
| 5516 | | % copy waitflags from InnerWF store to WF |
| 5517 | | copy_waitflag_store(InnerWF,WF). |
| 5518 | | |
| 5519 | | /* -------------- */ |
| 5520 | | /* NOT_ELEMENT_OF */ |
| 5521 | | /* -------------- */ |
| 5522 | | |
| 5523 | | :- use_module(kernel_objects,[not_element_of_global_set/2]). |
| 5524 | | |
| 5525 | | not_element_of_custom_set_wf(X,CS,WF) :- |
| 5526 | ? | not_element_of_custom_set_wf2(CS,X,WF). |
| 5527 | | |
| 5528 | | not_element_of_custom_set_wf2(global_set(GS),X,_WF) :- not_element_of_global_set(X,GS). |
| 5529 | | not_element_of_custom_set_wf2(freetype(_),_,_) :- !,fail. % TO DO: what if we have List(1..3) ? can that occur ?? |
| 5530 | | not_element_of_custom_set_wf2(avl_set(node(Y,_,_,empty,empty)),X,WF) :- !, |
| 5531 | | % X /: {Y} <=> X /= Y |
| 5532 | ? | kernel_objects:not_equal_object_wf(X,Y,WF). % improve if X is ground |
| 5533 | | not_element_of_custom_set_wf2(avl_set(AVL),X,_WF) :- !, |
| 5534 | | ground_value_check(X,GrX), |
| 5535 | ? | propagate_avl_not_element_information(X,GrX,AVL), |
| 5536 | | not_element_of_avl_set_block(GrX,X,AVL). |
| 5537 | | not_element_of_custom_set_wf2(closure(Parameters,PT,Cond),X,WF) :- |
| 5538 | ? | closure_not_member(X,Parameters,PT,Cond,WF). |
| 5539 | | |
| 5540 | | :- block not_element_of_avl_set_block(-,?,?). |
| 5541 | | not_element_of_avl_set_block(_,X,AVL) :- |
| 5542 | | convert_to_avl_inside_set(X,CX), |
| 5543 | | \+ avl_fetch(CX,AVL). %% IMPROVE ?? |
| 5544 | | |
| 5545 | | propagate_avl_not_element_information(_,GrEl,_) :- nonvar(GrEl),!. |
| 5546 | | propagate_avl_not_element_information(Element,_,AVL) :- preferences:preference(use_clpfd_solver,true), |
| 5547 | | is_avl_simple_set(AVL,Type), % integer or global(GS) \+ground(Element) , |
| 5548 | | ((Type=integer -> avl_height_less_than_with_solver_strength(AVL,6) % 16-31 elements - was: avl_size<20 |
| 5549 | | ; true) |
| 5550 | | -> !, |
| 5551 | ? | propagate_avl_not_element_information3(Type,Element,AVL) % uses clpfd_not_inlist |
| 5552 | | ; Type=integer, avl_height_less_than_with_solver_strength(AVL,15), |
| 5553 | | avl_is_interval(AVL,Min,Max) |
| 5554 | | -> !, |
| 5555 | | kernel_objects:not_in_nat_range(Element,int(Min),int(Max)) % WF not used anyway in _wf version |
| 5556 | | ). |
| 5557 | | propagate_avl_not_element_information(_Element,_,AVL) :- |
| 5558 | | quick_definitely_maximal_set_avl(AVL), |
| 5559 | | !, % we require something not to be an element of the full set; impossible |
| 5560 | | fail. |
| 5561 | | % to do: check if all but one element is in set |
| 5562 | | propagate_avl_not_element_information(_,_,_). |
| 5563 | | |
| 5564 | | avl_height_less_than_with_solver_strength(AVL,Limit) :- preference(solver_strength,SS), |
| 5565 | | RealLimit is Limit + SS/100, |
| 5566 | | avl_height_less_than(AVL,RealLimit). |
| 5567 | | |
| 5568 | | % try and compute a small finite cardinality for a ground value; fail if not possible |
| 5569 | | try_get_finite_max_card_from_ground_value(pred_true,2). |
| 5570 | | try_get_finite_max_card_from_ground_value(pred_false,2). |
| 5571 | | try_get_finite_max_card_from_ground_value(fd(_,Type),Card) :- |
| 5572 | | b_global_sets:b_fd_card(Type,Card), integer(Card). |
| 5573 | | try_get_finite_max_card_from_ground_value((A,B),Card) :- |
| 5574 | | try_get_finite_max_card_from_ground_value(A,CA), |
| 5575 | | try_get_finite_max_card_from_ground_value(B,CB), |
| 5576 | | Card is CA*CB, |
| 5577 | | Card < 20000. |
| 5578 | | try_get_finite_max_card_from_ground_value(rec(Fields),Card) :- |
| 5579 | | try_get_finite_max_card_from_fields(Fields,Card). |
| 5580 | | try_get_finite_max_card_from_ground_value(freeval(FreetypeId,_CaseId,_EArgs),Card) :- |
| 5581 | | freetype_cardinality(FreetypeId,Card), number(Card), Card < 20000. |
| 5582 | | try_get_finite_max_card_from_ground_value(avl_set(node(El,_True,_,_,_)),Card) :- |
| 5583 | | try_get_finite_max_card_from_ground_value(El,CEl), |
| 5584 | | CEl < 16, |
| 5585 | | safe_pow2(CEl,Card). |
| 5586 | | % int(_), term(floating(_)), string(_) are all infinite |
| 5587 | | |
| 5588 | | try_get_finite_max_card_from_fields([],1). |
| 5589 | | try_get_finite_max_card_from_fields([field(_,A)|TF],Card) :- |
| 5590 | | try_get_finite_max_card_from_ground_value(A,CA), |
| 5591 | | try_get_finite_max_card_from_fields(TF,CB), |
| 5592 | | Card is CA*CB, |
| 5593 | | Card < 20000. |
| 5594 | | |
| 5595 | | :- use_module(b_global_sets,[get_global_type_value/3]). |
| 5596 | | propagate_avl_not_element_information3(integer,int(El),AVL) :- |
| 5597 | | avl_domain(AVL,R),project_avl_domain_on_fd(R,FDList), |
| 5598 | | clpfd_interface:clpfd_not_inlist(El,FDList). |
| 5599 | | propagate_avl_not_element_information3(global(GS),FD,AVL) :- |
| 5600 | | get_global_type_value(FD,GS,El), % sets up the FD constraint if var; maybe we can detect inconsistency straightaway below |
| 5601 | | avl_domain(AVL,R),project_avl_domain_on_fd(R,FDList), % maybe we can compute directly the complement ? |
| 5602 | ? | clpfd_interface:clpfd_not_inlist(El,FDList). |
| 5603 | | |
| 5604 | | |
| 5605 | | :- block closure_not_member(?,-,?,?,?). |
| 5606 | | %, closure_not_member(-,?,?,?,?). /* El is unlikely to be instantiated by not_element_of test , but test 6 requires commenting out block declaration */ |
| 5607 | | |
| 5608 | | closure_not_member(X,Parameters,Types,Body,WF) :- |
| 5609 | | is_special_closure(Parameters,Types,Body,SpecialClosure),!, |
| 5610 | ? | not_element_of_special_closure(SpecialClosure,X,WF,Parameters,Types,Body). |
| 5611 | | closure_not_member(El,Parameters,PT,Cond,WF) :- |
| 5612 | | normal_closure_not_member(El,Parameters,PT,Cond,WF). |
| 5613 | | |
| 5614 | | :- use_module(memoization,[not_element_of_memoization_closure/6]). |
| 5615 | | not_element_of_special_closure(interval(LOW,UP),X,_WF,_Parameters,_Types,_Body) :- |
| 5616 | ? | !,kernel_objects:not_in_nat_range(X,int(LOW),int(UP)). |
| 5617 | | not_element_of_special_closure(member_closure(_ID,_Type,VAL),X,WF,_Parameters,_Types,_Body) :- |
| 5618 | | ( VAL = value(_) |
| 5619 | | ; VAL = cartesian_product(b(value(A),_,_),b(value(B),_,_))),!, |
| 5620 | | %hit_profiler:add_profile_hit(member(X,Par,Typ,Body)), |
| 5621 | | ( VAL=value(Set) -> kernel_objects:not_element_of_wf(X,Set,WF) |
| 5622 | ? | ; kernel_objects:not_is_cartesian_pair(X,A,B,WF)). |
| 5623 | | not_element_of_special_closure(not_member_closure(_ID,_Type,value(Set)),X,WF,_Parameters,_Types,_Body) :- |
| 5624 | ? | !,kernel_objects:check_element_of_wf(X,Set,WF). |
| 5625 | | not_element_of_special_closure(memoization_closure(MemoID),X,WF,P,T,B) :- !, |
| 5626 | | not_element_of_memoization_closure(MemoID,X,WF,P,T,B). |
| 5627 | | not_element_of_special_closure(recursive_special_closure(RId),X,WF,Parameters,Types,Body) :- |
| 5628 | | !, |
| 5629 | | add_recursive_parameter(Parameters,Types,X,RId,Body,NewParameters,NewPT,Value,WF), |
| 5630 | | normal_closure_not_member(Value,NewParameters,NewPT,Body,WF). |
| 5631 | | |
| 5632 | | not_element_of_special_closure(SC,_X,_WF,Parameters,Types,Body) :- |
| 5633 | | SC \= interval(_,_), |
| 5634 | | SC \= not_member_closure(_,_,_), |
| 5635 | | is_definitely_maximal_closure(Parameters,Types,Body), |
| 5636 | | !, |
| 5637 | | fail. |
| 5638 | | not_element_of_special_closure(_,X,WF,Parameters,Types,Body) :- |
| 5639 | | % falling back to normal test |
| 5640 | ? | normal_closure_not_member(X,Parameters,Types,Body,WF). |
| 5641 | | |
| 5642 | | :- use_module(library(lists),[same_length/2]). |
| 5643 | | |
| 5644 | | normal_closure_not_member(El,Parameters,PT,Cond,WF) :- |
| 5645 | | %hit_profiler:add_profile_hit(closure_not_member(El,Parameters,PT,Cond,WF)), |
| 5646 | | same_length(Parameters,ParValues), |
| 5647 | | convert_list_into_pairs(ParValues,El), |
| 5648 | ? | b_not_test_closure_wf(Parameters,PT,Cond,ParValues,WF). |
| 5649 | | |
| 5650 | | |
| 5651 | | |
| 5652 | | |
| 5653 | | /* -------------------------- */ |
| 5654 | | /* VARIOUS CLOSURE PREDICATES */ |
| 5655 | | /* -------------------------- */ |
| 5656 | | |
| 5657 | | |
| 5658 | | :- use_module(tools,[convert_list_into_pairs/2]). |
| 5659 | | :- use_module(b_interpreter,[b_test_boolean_expression/4, b_not_test_boolean_expression/4]). |
| 5660 | | :- use_module(b_enumerate). |
| 5661 | | |
| 5662 | | :- assert_pre(custom_explicit_sets:expand_closure_to_list(_,_,ClosureBody,_Result,_Done,_,_WF), |
| 5663 | | (nonvar(ClosureBody), |
| 5664 | | bsyntaxtree:check_if_typed_predicate(ClosureBody))). |
| 5665 | | :- assert_post(custom_explicit_sets:expand_closure_to_list(_,_,_,Result,_Done,_,_WF), |
| 5666 | | b_interpreter:value_type(Result)). |
| 5667 | | |
| 5668 | | :- block expand_interval_closure_to_avl(-,?,?), expand_interval_closure_to_avl(?,-,?). |
| 5669 | | expand_interval_closure_to_avl(Low,Up,Result) :- |
| 5670 | | Delta is Up-Low, |
| 5671 | | (Delta>9999 -> perfmessage(expanding_interval(Low,Up)) ; true), |
| 5672 | | construct_interval_ord_list(Low,Up,OL), |
| 5673 | | ord_list_to_avlset_direct(OL,ARes,expand_interval), |
| 5674 | | equal_object(ARes,Result,expand_interval_closure_to_avl). |
| 5675 | | construct_interval_ord_list(Low,Up,Res) :- |
| 5676 | | (Low>Up -> Res = [] |
| 5677 | | ; Res = [int(Low)-true|T], L1 is Low+1, construct_interval_ord_list(L1,Up,T) |
| 5678 | | ). |
| 5679 | | |
| 5680 | | :- block expand_interval_closure_to_list(-,?,?,?), expand_interval_closure_to_list(?,-,?,?). |
| 5681 | | expand_interval_closure_to_list(Low,Up,Result,Done) :- |
| 5682 | | construct_interval_list(Low,Up,OL), |
| 5683 | | equal_object(OL,Result,expand_interval_closure_to_list), |
| 5684 | | Done=true. |
| 5685 | | construct_interval_list(Low,Up,Res) :- |
| 5686 | | (Low>Up -> Res = [] |
| 5687 | | ; Res = [int(Low)|T], L1 is Low+1, construct_interval_list(L1,Up,T) |
| 5688 | | ). |
| 5689 | | |
| 5690 | | expand_closure_to_list([X],[integer],Body,Result,Done,_,_) :- |
| 5691 | ? | is_interval_closure_body(Body,X,Low,Up),!, |
| 5692 | | expand_interval_closure_to_list(Low,Up,Result,Done). |
| 5693 | | expand_closure_to_list(Par,Types,Body,Result,Done,Source,WF) :- |
| 5694 | | expand_normal_closure(Par,Types,Body,CResult,CDone,expand_closure_to_list(Source),WF), |
| 5695 | | expand_if_avl(CResult,Result,CDone,Done,Source), |
| 5696 | | lazy_check_elements_of_closure(Result,CDone, Par,Types,Body,WF). |
| 5697 | | |
| 5698 | | % Note: does slow down test 1306 (91ms mc time becomes 918 ms) |
| 5699 | | % as long as a closure has not been fully expanded, lazily check elements |
| 5700 | | % that are instantiated from the outside satisfy the closure predicate |
| 5701 | | % Note: this can also instantiate unknown values used inside the closure body |
| 5702 | | lazy_check_elements_of_closure(Result,CDone, Par,Types,Body,WF) :- |
| 5703 | | (WF==no_wf_available -> true |
| 5704 | | ; lazy_check_elements6(Result,CDone, Par,Types,Body,WF), |
| 5705 | | propagate_closure_body_value_set(Par,Types,Body,Result,CDone,WF) |
| 5706 | | ). |
| 5707 | | % TODO: check if closure is a non-ground projection-member closure and check elements |
| 5708 | | :- block lazy_check_elements6(-,-, ?,?,?,?). |
| 5709 | | lazy_check_elements6(_Result,CDone, _Par,_Types,_Body,_WF) :- nonvar(CDone),!. |
| 5710 | | lazy_check_elements6([H|T],CDone, Par,Types,Body,WF) :- !, |
| 5711 | ? | element_of_closure(H,Par,Types,Body,WF), |
| 5712 | ? | lazy_check_elements6(T,CDone, Par,Types,Body,WF). |
| 5713 | | lazy_check_elements6(avl_set(A),_CDone, Par,Types,Body,WF) :- !, |
| 5714 | | avl_max(A,X), |
| 5715 | | element_of_closure(X,Par,Types,Body,WF). |
| 5716 | | % TO DO: also check avl_min or even all elements ? |
| 5717 | | lazy_check_elements6(_,_,_,_,_,_). |
| 5718 | | |
| 5719 | | :- use_module(probsrc(bsyntaxtree),[create_typed_ids/3]). |
| 5720 | | % lazy check elements from non-var closure body against a result |
| 5721 | | % for example if we have {x| TRUE |-> x : Value } = Result and Value is not-ground, |
| 5722 | | % we can check that for all elements TRUE|->x of Value the corresponding x is in Result, see test 2466 |
| 5723 | | % slows down test 1987 |
| 5724 | | :- block propagate_closure_body_value_set(?,?,?,-,-,?). |
| 5725 | | % we delay until the result is known, possibly in SMT mode it could be useful to propagate earlier |
| 5726 | | propagate_closure_body_value_set(ParIDs,Types,Body,Result,CDone,WF) :- |
| 5727 | | var(CDone), % the closure has not yet been fully expanded |
| 5728 | | % check if this closure can profit from set membership propagation: |
| 5729 | | b_interpreter:is_for_all_set_membership_predicate2(Body,ParIDs,ParIDs,UnmatchedIDs,Set,_Pattern,_ParValues,_), |
| 5730 | | UnmatchedIDs=[], |
| 5731 | | Set = b(value(_Value),_,_), % check that the set is a value; it must be non-ground, otherwise CDone would be true |
| 5732 | | create_couple_term(ParIDs,Types,CoupleTerm), |
| 5733 | | SetTerm=b(value(Result),any,[]), |
| 5734 | | safe_create_texpr(member(CoupleTerm,SetTerm),pred,[],RHS), |
| 5735 | | create_typed_ids(ParIDs,Types,TIDs), |
| 5736 | | !, |
| 5737 | | propagate_closure_body_for_all(TIDs,Body,RHS,Result,CDone,WF). |
| 5738 | | propagate_closure_body_value_set(_,_,_,_,_,_WF). |
| 5739 | | |
| 5740 | | :- block propagate_closure_body_for_all(?,?,?,-,-,?). |
| 5741 | | propagate_closure_body_for_all(TIDs,Body,RHS,_,CDone,WF) :- var(CDone),!, |
| 5742 | | add_debug_message(closure,'Propagating from closure body to result: ',Body,Body), |
| 5743 | | Infos=[], |
| 5744 | | b_interpreter:b_for_all(TIDs,Infos,Body,RHS,[],[],WF). |
| 5745 | | propagate_closure_body_for_all(_,_,_,_Result,_CDone,_WF). % propagation not required; closure expanded, cf test 1987 |
| 5746 | | |
| 5747 | | %check_valid_avl(AVL,Origin) :- |
| 5748 | | % (nonvar(AVL) -> true |
| 5749 | | % ; add_internal_error('Var avl_set: ', check_valid_avl(AVL,Origin)),fail). |
| 5750 | | |
| 5751 | | :- block expand_if_avl(?,?,-,?,?). |
| 5752 | | expand_if_avl(avl_set(S),Result,_,Done,Source) :- !, % we could transmit a flag to expand_normal_closure so that transform_result_into_set does not expand to avl |
| 5753 | ? | expand_custom_set_to_list2(avl_set(S),Result,Done,_,expand_if_avl(Source),no_wf_available). |
| 5754 | | expand_if_avl(Res,Result,_,Done,Source) :- check_list(Res,expand_if_avl(Source)), |
| 5755 | | equal_object(Res,Result), Done=true. |
| 5756 | | |
| 5757 | | check_list(Res,_) :- nonvar(Res), is_list(Res),!. |
| 5758 | | check_list(Res,Src) :- add_error(Src,'Could not expand to list: ',Res). |
| 5759 | | is_list([]). is_list([_|_]). |
| 5760 | | |
| 5761 | | expand_closure_to_avl_or_list([X],[integer],Body,Result,_CheckTimeouts,_WF) :- |
| 5762 | ? | is_interval_closure_body(Body,X,Low,Up),!, |
| 5763 | | expand_interval_closure_to_avl(Low,Up,Result). |
| 5764 | | %expand_closure_to_avl_or_list(P,T,Body,Result,_WF) :- is_member_closure(P,T,Body,TS,Set), |
| 5765 | | % print(expand_member_closure(P,T,Body,TS,Set)),nl,fail. |
| 5766 | | expand_closure_to_avl_or_list(Par,Types,Body,Result,CheckTimeouts,WF) :- |
| 5767 | | expand_normal_closure(Par,Types,Body,CResult,_Done,CheckTimeouts,WF), |
| 5768 | | kernel_objects:equal_object(Result,CResult,expand_closure_to_avl_or_list). % may convert to AVL, should we wait for _Done? |
| 5769 | | |
| 5770 | | |
| 5771 | | % use WF just for call stack messages; we should not delay creating result |
| 5772 | | expand_closure_to_avl_wf([X],[integer],Body,Result,_WF) :- |
| 5773 | | is_interval_closure_body(Body,X,Low,Up),!, |
| 5774 | | expand_interval_closure_to_avl(Low,Up,Result). % we could pass WF |
| 5775 | | expand_closure_to_avl_wf(Par,Types,Body,Result,WF) :- |
| 5776 | | expand_normal_closure(Par,Types,Body,S,Done,check(expand_closure_to_avl),WF), |
| 5777 | | (ground_value(S) % ground value is sufficient to proceed; we do not need to check Done |
| 5778 | | -> convert_to_avl_inside_set(S,R),equal_object(R,Result,expand_closure_to_avl) |
| 5779 | | ; print(cannot_convert_closure_value_to_avl(closure(Par,Types),done(Done))),nl, |
| 5780 | | translate:print_bexpr(Body),nl,trace, |
| 5781 | | fail). |
| 5782 | | |
| 5783 | | |
| 5784 | | % possible values for CheckTimeouts: check, check_no_inf, no_check, ... |
| 5785 | | % Note: we no longer check is_infinite_explicit_set(closure(Parameters,ParameterTypes,ClosureBody)) |
| 5786 | | % and no longer raise add_closure_warning(Source,Parameters,ParameterTypes,ClosureBody,'### WARNING: expanding infinite comprehension set: ') |
| 5787 | | % and no longer use preference warn_when_expanding_infinite_closures |
| 5788 | | % this is relevant for e.g., test 1291 |
| 5789 | | expand_normal_closure(Parameters,ParameterTypes,ClosureBody,Result,Done,CheckTimeouts,WF) :- |
| 5790 | | expand_normal_closure_memo(CheckTimeouts,Parameters,ParameterTypes,ClosureBody,Result,Done,WF). |
| 5791 | | |
| 5792 | | :- public add_closure_warning_wf/6. |
| 5793 | | add_closure_warning_wf(Source,Parameters,_ParameterTypes,_ClosureBody,_MSG,_WF) :- |
| 5794 | | preference(provide_trace_information,false),preference(strict_raise_warnings,false),!, |
| 5795 | | format('### TIME-OUT raised during closure expansion (~w,~w).~n### set TRACE_INFO preference to TRUE for more details.~n',[Parameters,Source]). |
| 5796 | | add_closure_warning_wf(Source,Parameters,ParameterTypes,ClosureBody,MSG,WF) :- |
| 5797 | | (debug_mode(on) -> Limit = 2500, AvlLim=10 ; Limit = 500, AvlLim=5), |
| 5798 | | preferences:temporary_set_preference(expand_avl_upto,AvlLim,CHNG), |
| 5799 | | call_cleanup(translate:translate_bvalue_with_limit(closure(Parameters,ParameterTypes,ClosureBody),Limit,CT), |
| 5800 | | preferences:reset_temporary_preference(expand_avl_upto,CHNG)), |
| 5801 | | bsyntaxtree:get_texpr_info(ClosureBody,Infos), |
| 5802 | | add_warning_wf(Source,MSG,CT,Infos,WF), debug_print(19,'! infos: '), debug_println(Infos). %,trace. |
| 5803 | | |
| 5804 | | |
| 5805 | | :- use_module(memoization,[is_memoization_closure/4,get_complete_memoization_expansion/6]). |
| 5806 | | |
| 5807 | | % a version of closure expansion which memoizes its results; stored_expansion needs to be cleared when new machine loaded |
| 5808 | | expand_normal_closure_memo(CHECK,Parameters,ParameterTypes,ClosureBody,FullResult,Done,WF) :- |
| 5809 | ? | is_memoization_closure(Parameters,ParameterTypes,ClosureBody,MemoID), |
| 5810 | | !, Span=ClosureBody, |
| 5811 | | % MemoID can be a variable |
| 5812 | | (var(MemoID) -> perfmessage(CHECK,'Getting full value of a memoized function',ClosureBody) ; true), |
| 5813 | | get_complete_memoization_expansion(MemoID,FullResult,Done,Span,expand_normal_closure_memo(CHECK),WF). |
| 5814 | | expand_normal_closure_memo(CHECK,Parameters,ParameterTypes,ClosureBody,FullResult,Done,WF) :- |
| 5815 | | preferences:preference(use_closure_expansion_memoization,false),!, |
| 5816 | | expand_normal_closure1(CHECK,Parameters,ParameterTypes,ClosureBody,FullResult,Done,WF). |
| 5817 | | expand_normal_closure_memo(CHECK,Parameters,ParameterTypes,ClosureBody,FullResult,Done,WF) :- |
| 5818 | | % maybe we should only memo when ClosureWaitVars are ground ? |
| 5819 | | MemoLookupTerm = closure(Parameters,ParameterTypes,ClosureBody), |
| 5820 | | compute_memo_hash(MemoLookupTerm,Hash), |
| 5821 | | % idea: maybe store expansion only on second hit ? |
| 5822 | | (get_stored_memo_expansion(Hash,MemoLookupTerm,StoredResult) |
| 5823 | | -> %print_term_summary(reusing_expansion(Hash,Parameters,ParameterTypes,ClosureBody,StoredResult)),nl, |
| 5824 | | UPV=StoredResult, %state_packing:unpack_value(StoredResult,UPV), |
| 5825 | | FullResult = UPV, Done=true |
| 5826 | | ; %statistics(runtime,[T1,_]), %% |
| 5827 | | expand_normal_closure1(CHECK,Parameters,ParameterTypes,ClosureBody,FullResult,Done,WF), |
| 5828 | | %statistics(runtime,[T2,_]), Time is T2-T1, store_memo_computation_time(Hash,Time), |
| 5829 | | (Done==true/* ,T2-T1>0*/ |
| 5830 | | -> PackedValue=FullResult, %state_packing:pack_value(FullResult,PackedValue), |
| 5831 | | store_memo_expansion(Hash,MemoLookupTerm,PackedValue) |
| 5832 | | ; true) |
| 5833 | | ). |
| 5834 | | |
| 5835 | | expand_normal_closure1(CHECK,Parameters,ParameterTypes,ClosureBody,FullResult,Done,WF) :- |
| 5836 | | preference(provide_trace_information,false),!, |
| 5837 | | expand_normal_closure2(CHECK,Parameters,ParameterTypes,ClosureBody,FullResult,Done,WF). |
| 5838 | | expand_normal_closure1(CHECK,Parameters,ParameterTypes,ClosureBody,FullResult,Done,WF) :- |
| 5839 | | get_texpr_info(ClosureBody,Info), |
| 5840 | | push_wait_flag_call_stack_info(WF, |
| 5841 | | quantifier_call(comprehension_set(all_solutions),Parameters,[],Info),WF2), |
| 5842 | | expand_normal_closure2(CHECK,Parameters,ParameterTypes,ClosureBody,FullResult,Done,WF2). |
| 5843 | | |
| 5844 | | |
| 5845 | | expand_normal_closure2(_CHECK,Parameters,ParameterTypes,ClosureBody,FullResult,Done,WF) :- |
| 5846 | | % TO DO: add more symbolic member closures who have expression computation code |
| 5847 | | is_closure1_value_closure(Parameters,ParameterTypes,ClosureBody,VAL),!, |
| 5848 | | bsets_clp:relational_trans_closure_wf(VAL,FullResult,WF), |
| 5849 | | ground_value_check(FullResult,FRGr), |
| 5850 | | when(nonvar(FRGr),Done=true). |
| 5851 | | expand_normal_closure2(CHECK,Parameters,ParameterTypes,ClosureBody,FullResult,Done,WF) :- |
| 5852 | | % special treatment for lambda closures: Advantage: we don't have to wait for variables in EXPR body of closure |
| 5853 | | % Disadvantage: EXPR only gets evaluated after a solution has been found for args: can mean repeated computations ! |
| 5854 | | % (cf pas_as_env_inv_cv_sui, negated version of !(cv_i).(cv_i : t_cv_pas => closure(%cv_o2.((...|>> {cv_i} : t_cv_pas <-> t_cv_pas) ASSERTION |
| 5855 | | % Advantage: it can solve constraints such as f = %x.(x:1..10|x+y) & f(5)=1005 (finding y without enumeration); see test 1168 |
| 5856 | | \+ preferences:preference(use_smt_mode,false), |
| 5857 | | is_lambda_closure(Parameters,ParameterTypes,ClosureBody, OtherIDs,OtherTypes, DomainPred, EXPR), |
| 5858 | | \+ ground_bexpr(EXPR), % if EXPR is ground, there is nothing to be gained by special treatment here |
| 5859 | | WF \= no_wf_available, % otherwise we may have to enumerate EXPR result leading to choice points, e.g. in phase 0 |
| 5860 | | !, |
| 5861 | | bexpr_variables(DomainPred,ClosureWaitVars), |
| 5862 | | (CHECK=no_check -> TIMEOUTCODE = true ; |
| 5863 | | TIMEOUTCODE = add_closure_warning_wf(CHECK,Parameters,ParameterTypes,ClosureBody, |
| 5864 | | 'TIME-OUT occurred while ProB was expanding: ',WF)), |
| 5865 | | (CHECK=check_no_inf -> VIRTUALTIMEOUTCODE=true ; VIRTUALTIMEOUTCODE=TIMEOUTCODE), |
| 5866 | | delay_setof_check_wf( ParTuple, |
| 5867 | | (custom_explicit_sets:b_test_closure(OtherIDs,OtherTypes,DomainPred,OtherValues,all_solutions,WF), |
| 5868 | | convert_list_into_pairs(OtherValues,ParTuple) |
| 5869 | | % TO DO: compile EXPR when we start expanding the closure: to avoid repeated re-computation of expressions for every instance |
| 5870 | | ), |
| 5871 | | Result, ClosureWaitVars, __Done, |
| 5872 | | TIMEOUTCODE,VIRTUALTIMEOUTCODE,WF,DomainPred), |
| 5873 | | (WF = no_wf_available |
| 5874 | | -> init_wait_flags(WF1,[expansion_context(lambda_function_result,Parameters)]) |
| 5875 | | ; WF1=WF |
| 5876 | | ), |
| 5877 | | evaluate_result_expr(Result,EXPR,OtherIDs,EvResult,EvDone,WF1), |
| 5878 | | when(nonvar(EvDone),( |
| 5879 | | (WF = no_wf_available -> ground_wait_flags(WF1) ; true), |
| 5880 | | kernel_objects:equal_object_wf(EvResult,FullResult,expand_normal_closure2,WF), |
| 5881 | | Done=true)). |
| 5882 | | expand_normal_closure2(no_check,Parameters,ParameterTypes,ClosureBody,Result,Done,WF) :- !, |
| 5883 | | expand_normal_closure_direct(Parameters,ParameterTypes,ClosureBody,Result,Done,WF). |
| 5884 | | expand_normal_closure2(CHECK,Parameters,ParameterTypes,ClosureBody,Result,Done,WF) :- |
| 5885 | | bexpr_variables(ClosureBody,ClosureWaitVars), |
| 5886 | | TIMEOUTCODE = add_closure_warning_wf(CHECK,Parameters,ParameterTypes,ClosureBody, |
| 5887 | | 'TIME-OUT occurred while ProB was expanding: ',WF), |
| 5888 | | (CHECK=check_no_inf -> VIRTUALTIMEOUTCODE=true ; VIRTUALTIMEOUTCODE=TIMEOUTCODE), |
| 5889 | | % Note: delay_setof_check_wf will throw enumeration warning for virtual timeouts, after VIRTUALTIMEOUTCODE |
| 5890 | | delay_setof_check_wf( ParTuple, |
| 5891 | | custom_explicit_sets:test_closure_and_convert(Parameters,ParameterTypes,ClosureBody, ParTuple,WF), |
| 5892 | | Result, ClosureWaitVars, Done, TIMEOUTCODE, VIRTUALTIMEOUTCODE,WF,ClosureBody). |
| 5893 | | |
| 5894 | | expand_normal_closure_direct(Parameters,ParameterTypes,ClosureBody,Result,Done,WF) :- |
| 5895 | | bexpr_variables(ClosureBody,ClosureWaitVars), |
| 5896 | | Span = ClosureBody, |
| 5897 | | delay_setof_wf( ParTuple, |
| 5898 | | % TO DO: refresh waitflag in outer WF store to let pending code run to completion and avoid spurious WD errors ? |
| 5899 | | custom_explicit_sets:test_closure_and_convert(Parameters,ParameterTypes,ClosureBody, ParTuple,WF), |
| 5900 | | Result, ClosureWaitVars, Done,WF, Span). |
| 5901 | | |
| 5902 | | |
| 5903 | | |
| 5904 | | :- block evaluate_result_expr(-,?,?,?,?,?). |
| 5905 | | evaluate_result_expr(avl_set(AVL),EXPR,OtherIDs,Res,Done,WF) :- |
| 5906 | | avl_domain(AVL,R), |
| 5907 | | evaluate_result_expr(R,EXPR,OtherIDs,Res,Done,WF). |
| 5908 | | evaluate_result_expr([],_EXPR,_OtherIDs,[],Done,_WF) :- |
| 5909 | | %ground_wait_flags(WF), |
| 5910 | | Done=true. |
| 5911 | | evaluate_result_expr([ParTuple|T],EXPR,OtherIDs,[FullTuple|ET],Done,WF) :- |
| 5912 | | % same_length(OtherIDs,ParValues), % not necessary |
| 5913 | | set_up_localstate(OtherIDs,ParValues,[],LocalState), |
| 5914 | | convert_list_into_pairs(ParValues,ParTuple), % bind values in ParTuple to LocalState |
| 5915 | | b_interpreter:b_compute_expression(EXPR,LocalState,[],EXPRVALUE,WF), |
| 5916 | | append(ParValues,[EXPRVALUE],FullValues), |
| 5917 | | convert_list_into_pairs(FullValues,FullTuple), |
| 5918 | | evaluate_result_expr(T,EXPR,OtherIDs,ET,Done,WF). |
| 5919 | | |
| 5920 | | :- use_module(bsyntaxtree,[split_names_and_types/3]). |
| 5921 | | :- use_module(probsrc(bsyntaxtree), [def_get_texpr_id/2]). |
| 5922 | | %:- use_module(library(lists),[prefix_length/3, suffix_length/3]). |
| 5923 | | % test a closure and convert into pairs; assume we want all solutions |
| 5924 | | test_closure_and_convert(Parameters,ParameterTypes,ClosureBody, ParTuple, WF) :- |
| 5925 | | is_recursive_closure(Parameters,ParameterTypes,ClosureBody), |
| 5926 | | get_recursive_identifier_of_closure_body(ClosureBody,TRID),!, |
| 5927 | | def_get_texpr_id(TRID,RID), get_texpr_type(TRID,RType), |
| 5928 | | %print(test_recursion(RID)),nl, translate:nested_print_bexpr(ClosureBody),nl, |
| 5929 | | RecVal = closure(Parameters,ParameterTypes,ClosureBody), % Recursive Value added to parameters |
| 5930 | | same_length(Parameters,ParValues), |
| 5931 | | reset_closure_solution_counter(Parameters), |
| 5932 | | b_test_closure([RID|Parameters],[RType|ParameterTypes],ClosureBody,[RecVal|ParValues],all_solutions,WF), |
| 5933 | | convert_sol_list_into_pairs(ParValues,Parameters,ParTuple). % convert tuple without recursive value to ParTuple |
| 5934 | | test_closure_and_convert(Parameters,ParameterTypes,b(exists(EParAndTypes,ClosureBody),pred,OuterInfo), ParTuple, WF) :- |
| 5935 | | % Motivation: enumerating Parameters can be quite inefficient |
| 5936 | | % if for example we have something like {x|#y.(y:SmallSet & x=f(y))} |
| 5937 | | % Problem: the existential quantifier will be delayed until the Parameters are instantiated ! |
| 5938 | | % relevant test: 1162 |
| 5939 | | % Note: this is duplicating to some extent the code in b_test_exists_wo_expansion |
| 5940 | | % However, here we can also apply lambda_closure optimisation in b_test_closure below, this is |
| 5941 | | % relevant for private_examples/2023/.../rule_FICHIER_MRGATKSAATPAR_RVF219_MRGA_DE.mch |
| 5942 | ? | exists_should_be_lifted(Parameters,ParameterTypes,OuterInfo,ClosureBody), |
| 5943 | | split_names_and_types(EParAndTypes,EPar,ETypes), |
| 5944 | | !, |
| 5945 | | % print(' Lifting existential quantifier (i.e., enumerating paras with closure paras): '), print(EPar),nl, |
| 5946 | | % print(outer_paras(Parameters)),nl, |
| 5947 | | % append Parameters at end; in case we have a lambda function |
| 5948 | | append(EPar,Parameters,FullPar), length(Parameters,NrParas), |
| 5949 | | append(ETypes,ParameterTypes,FullTypes), |
| 5950 | | length(EPar,NrExistsParas), |
| 5951 | | length(IrrelevantParas,NrExistsParas), length(Suffix,NrParas), |
| 5952 | | append(IrrelevantParas,Suffix,FullParList), |
| 5953 | | copy_identifier_infos(OuterInfo,ClosureBody,ClosureBody2), |
| 5954 | | reset_closure_solution_counter(Parameters), |
| 5955 | | % bsyntaxtree:check_used_ids_in_ast(ClosureBody2), |
| 5956 | ? | b_test_closure(FullPar,FullTypes,ClosureBody2, FullParList,all_solutions,WF), |
| 5957 | | convert_sol_list_into_pairs(Suffix,Parameters,ParTuple). |
| 5958 | | test_closure_and_convert(Parameters,ParameterTypes,ClosureBody, ParTuple, WF) :- |
| 5959 | | reset_closure_solution_counter(Parameters), |
| 5960 | | % print(test),nl, translate:nested_print_bexpr(ClosureBody),nl, |
| 5961 | | length(Parameters,Len), length(ParValues,Len), |
| 5962 | | %(annotate_exists(Parameters,ParameterTypes,ClosureBody,Body2) -> true ; Body2=ClosureBody), |
| 5963 | ? | b_test_closure(Parameters,ParameterTypes,ClosureBody,ParValues,all_solutions,WF), |
| 5964 | | convert_sol_list_into_pairs(ParValues,Parameters,ParTuple). % ,print(solution(ParTuple)),nl,nl. |
| 5965 | | |
| 5966 | | % Lifting existential quantifier was previously done here, but was duplicating code in b_test_exists_wo_expansion |
| 5967 | | % we now simply generate the allow_to_lift_exists annotation here and let b_test_exists_wo_expansion do its job |
| 5968 | | %annotate_exists(Parameters,ParameterTypes, |
| 5969 | | % b(exists(EParAndTypes,ClosureBody),pred,OuterInfo), |
| 5970 | | % b(exists(EParAndTypes,ClosureBody),pred,[allow_to_lift_exists|OuterInfo])) :- |
| 5971 | | % exists_should_be_lifted(Parameters,ParameterTypes,OuterInfo,ClosureBody). |
| 5972 | | |
| 5973 | | % check if a top-level exists with body ExistsClosureBody should be lifted |
| 5974 | | % within a closure with paras Parameters of type ParameterTypes: |
| 5975 | | exists_should_be_lifted(Parameters,ParameterTypes,OuterInfo,ExistsClosureBody) :- |
| 5976 | | (Parameters == ['_was_lambda_result_'] % here we are quite sure that we gain by this optimisation |
| 5977 | ? | ; member(allow_to_lift_exists,OuterInfo) % parameters were originally from a set comprehension, |
| 5978 | | % see test 306: in this case existential quantifier is lifted in b_interpreter anyway; |
| 5979 | | % Note we counter the rewrite ran({x1,...xn|P}) ---> {xn| #(x1,...).(P)} and similarly for dom({...}) |
| 5980 | | ; ExistsClosureBody = b(member(_,_),_,_) % we have a simple projection closure |
| 5981 | | % TO DO: maybe support other ones as well |
| 5982 | ? | ; basic_type_list_cardinality(ParameterTypes,Card), |
| 5983 | | (Card=inf -> true ; Card=inf_overflow -> true ; Card>10000) % geq_inf(Card,10001) |
| 5984 | | % if here are only a few parameter values: do not lift existential quantified variables |
| 5985 | | ). |
| 5986 | | |
| 5987 | | % we need to copy important infos about the outer Parameters to ClosureBody |
| 5988 | | copy_identifier_infos(Info,b(InnerPred,T,II),b(InnerPred,T,II2)) :- |
| 5989 | | findall(I,identifier_info(I,Info),ToCopy), |
| 5990 | | append(ToCopy,II,II2). |
| 5991 | | identifier_info(I,Info) :- I=prob_annotation('DO_NOT_ENUMERATE'(ID)), |
| 5992 | ? | member(I,Info), ID \= '$$NONE$$'. |
| 5993 | | |
| 5994 | | convert_sol_list_into_pairs(ParaValues,Parameters,ParTuple) :- |
| 5995 | | convert_list_into_pairs(ParaValues,ParTuple), |
| 5996 | | update_closure_solution_counter(Parameters,ParTuple). |
| 5997 | | |
| 5998 | | :- if(environ(prob_debug_flag,true)). |
| 5999 | | :- dynamic closure_solution_counter/3. |
| 6000 | | % debugging long expansions of comprehension_set / closures |
| 6001 | | reset_closure_solution_counter(Parameters) :- retractall(closure_solution_counter(Parameters,_,_)). |
| 6002 | | |
| 6003 | | update_closure_solution_counter(Parameters,ParTuple) :- |
| 6004 | | retract(closure_solution_counter(Parameters,OldCount,OldTime)),!, |
| 6005 | | statistics(walltime,[W2,_]), Delta is W2-OldTime, |
| 6006 | | NewCount is OldCount+1, |
| 6007 | | ((Delta > 5000 ; NewCount mod 1000 =:= 0) |
| 6008 | | -> format('--> Solution ~w for expansion of closure ~w (delta ~w ms): ',[NewCount,Parameters,Delta]), |
| 6009 | | translate:print_bvalue(ParTuple),nl, |
| 6010 | | assert(closure_solution_counter(Parameters,NewCount,W2)) |
| 6011 | | ; assert(closure_solution_counter(Parameters,NewCount,OldTime)) |
| 6012 | | ). |
| 6013 | | update_closure_solution_counter(Parameters,_ParTuple) :- |
| 6014 | | statistics(walltime,[W2,_]), |
| 6015 | | assert(closure_solution_counter(Parameters,1,W2)). |
| 6016 | | :- else. |
| 6017 | | reset_closure_solution_counter(_). |
| 6018 | | update_closure_solution_counter(_,_). |
| 6019 | | :- endif. |
| 6020 | | |
| 6021 | | |
| 6022 | | |
| 6023 | | % compute cardinality of a list of basic types |
| 6024 | | basic_type_list_cardinality([],1). |
| 6025 | | basic_type_list_cardinality([BasicType|T],Res) :- |
| 6026 | | basic_type_list_cardinality(T,TCard), |
| 6027 | | (TCard=inf -> Res=inf |
| 6028 | ? | ; kernel_objects:max_cardinality(BasicType,Card), |
| 6029 | | safe_mul(Card,TCard,Res) |
| 6030 | | ). |
| 6031 | | |
| 6032 | | % for lambda closures we can set up a second waitflag for the expression and only ground it when body enumeration finished |
| 6033 | | % idea is to avoid perturbation of constraint solving of main closure predicate by lambda expression, see test 1737 |
| 6034 | | % something like %(x,y).(x:1..200 & y:1..100 & y+x<259 & y*x>10|(y+x*x+y) mod 100) is faster |
| 6035 | | % this is slower : %(x,y).(x:1..200 & y:1..100 |(y+x*x+y)) |
| 6036 | | % currently this slows down test 1336 |
| 6037 | | :- block b_test_closure(?,?,-,?,?,?). |
| 6038 | | b_test_closure(Parameters,ParameterTypes,ClosureBody, FullParValues, NegationContext, OuterWF) :- |
| 6039 | | (preference(data_validation_mode,true) |
| 6040 | | -> true % avoids ineraction between domain and range expression enumeration; see |
| 6041 | | % private_examples/ClearSy/2019_May/perf_3264/rule_186.mch or |
| 6042 | | % computation of 631 ic___DMI_MRGATKSAAT___Parametre_Identifiant_indices_function in rule_FICHIER_MRGATKSAATPAR_RVF219_MRGA_DE.mch |
| 6043 | | % however, as b_optimize below does *not* evaluate nested set comprehensions, there can be a slowdown: |
| 6044 | | % the nested set comprehension gets re-evaluated for every soluiton of the lambda parameters ! |
| 6045 | | % this was the case of private_examples/ClearSy/2019_Nov/rule_Regle_31C_0005/rule.mch before using SORT |
| 6046 | | ; \+ preferences:preference(use_smt_mode,false)), % TO DO: enable in normal mode when performance of 1336 fixed |
| 6047 | | % print(test_closure(Parameters,FullParValues)),nl, |
| 6048 | | is_lambda_closure(Parameters,ParameterTypes,ClosureBody, OtherIDs,OtherTypes, DomainPred, EXPR), |
| 6049 | | % TO DO: detect not only equalities at end, but any equality which is irrelevant for the rest |
| 6050 | | % nl,print(lambda_closure(OtherIDs)),nl, translate:print_bexpr(EXPR),nl, |
| 6051 | | append(ParValues,[LambdaResult],FullParValues), |
| 6052 | | !, |
| 6053 | | get_texpr_info(ClosureBody,BInfo), |
| 6054 | ? | b_interpreter:set_up_typed_localstate2(OtherIDs,OtherTypes,BInfo,ParValues,TypedVals,[],LocalState,NegationContext), |
| 6055 | | simplify_span(ClosureBody,BSpan), % sometimes BInfo no longer contains a position info, but first_sub_expr does |
| 6056 | | init_quantifier_wait_flag(OuterWF,comprehension_set(NegationContext),OtherIDs,ParValues,BSpan,WF), |
| 6057 | ? | b_test_boolean_expression(DomainPred,LocalState,[],WF), |
| 6058 | | %print('PRED: '),translate:print_bexpr(ClosureBody),nl, |
| 6059 | | b_tighter_enumerate_values_in_ctxt(TypedVals,DomainPred,WF), % also does: project_away_useless_enumeration_values |
| 6060 | | init_quantifier_wait_flag(OuterWF,comprehension_set(NegationContext),OtherIDs,ParValues,BSpan,WF2), |
| 6061 | | b_compiler:b_optimize(EXPR,[],LocalState,[],CEXPR,WF), % already pre-compile lookup, without constraint processing; is not sufficient for test 1336 |
| 6062 | ? | ground_wait_flags(WF), % TODO: also call ground inner WF in context |
| 6063 | | b_interpreter:b_compute_expression(CEXPR,LocalState,[],LambdaResult,WF2), |
| 6064 | | ground_inner_wait_flags_in_context(NegationContext,WF2). |
| 6065 | | b_test_closure(Parameters,ParameterTypes,ClosureBody,ParValues,NegationContext, OuterWF) :- |
| 6066 | | % tools:print_bt_message(b_test_closure_testing_closure(Parameters,ParValues)), %% |
| 6067 | | get_texpr_info(ClosureBody,BInfo), |
| 6068 | ? | b_interpreter:set_up_typed_localstate2(Parameters,ParameterTypes,BInfo, |
| 6069 | | ParValues,TypedVals,[],LocalState,NegationContext), |
| 6070 | | % print_message(b_interpreter:b_test_boolean_expression(ClosureBody,LocalState,[],WF)), |
| 6071 | | simplify_span(ClosureBody,BSpan), % sometimes BInfo no longer contains a position info, but first_sub_expr does |
| 6072 | | init_quantifier_wait_flag(OuterWF,comprehension_set(NegationContext),Parameters,ParValues,BSpan,WF), |
| 6073 | | %external_functions:observe_parameters(Parameters,LocalState), %% |
| 6074 | ? | b_test_boolean_expression(ClosureBody,LocalState,[],WF), |
| 6075 | | % tools:print_bt_message(tested_bool_expr), translate:print_bexpr(ClosureBody),nl, |
| 6076 | | b_enumerate:b_tighter_enumerate_values_in_ctxt(TypedVals,ClosureBody,WF), % also detects useless enumeration ids |
| 6077 | ? | ground_inner_wait_flags_in_context(NegationContext,WF). |
| 6078 | | |
| 6079 | | |
| 6080 | | |
| 6081 | | :- block b_not_test_closure_wf(?,?,?,-,?). |
| 6082 | | b_not_test_closure_wf(Parameters,ParameterTypes,Closure,ParValues,WF) :- |
| 6083 | | % same_length(Parameters,ParValues), % not necessary |
| 6084 | | set_up_localstate(Parameters,ParValues,[],LocalState), |
| 6085 | | b_enumerate:b_type_values_in_store(Parameters,ParameterTypes,LocalState), |
| 6086 | ? | b_not_test_boolean_expression(Closure,LocalState,[],WF), |
| 6087 | | get_last_wait_flag(b_not_test_closure_wf(Parameters),WF,WF2), |
| 6088 | | get_texpr_info(Closure,Infos), |
| 6089 | | b_not_test_closure_enum(Parameters,ParameterTypes,Infos,LocalState,WF,WF2). |
| 6090 | | |
| 6091 | | :- block b_not_test_closure_enum(-,?,?,?,?,?). |
| 6092 | | b_not_test_closure_enum(Parameters,ParameterTypes,Infos,LocalState,WF,WF2) :- |
| 6093 | | b_enumerate:b_extract_typedvalc(Parameters,ParameterTypes,Infos,LocalState,TypedVals), |
| 6094 | | (var(WF2) -> ground_typedvals_check(TypedVals,GrVals) ; true), |
| 6095 | | b_not_test_closure_enum_aux(GrVals,WF2,TypedVals,WF). |
| 6096 | | |
| 6097 | | :- block b_not_test_closure_enum_aux(-,-,?,?). |
| 6098 | | b_not_test_closure_enum_aux(_,_,TypedVals,WF) :- |
| 6099 | | b_enumerate:b_tighter_enumerate_all_values(TypedVals,WF). |
| 6100 | | % , print(finished_enum(Parameters)),nl. |
| 6101 | | |
| 6102 | | |
| 6103 | | :- use_module(library(terms)). |
| 6104 | | % check whether a VARIABLE occurs inside a closure |
| 6105 | | closure_occurs_check(VARIABLE,_Par,_ParTypes,ClosureBody) :- expression_contains_setvar(ClosureBody,VARIABLE). |
| 6106 | | % /* occurs check; x = closure1(x) ; for other closures this cannot happen ???!!! TO DO: Check */ |
| 6107 | | % custom_explicit_sets:is_closure1_value_closure(Par,ParTypes,ClosureBody,Val), |
| 6108 | | % contains_var(VARIABLE,Val). |
| 6109 | | |
| 6110 | | expression_contains_setvar(b(E,_,_),Variable) :- !, |
| 6111 | | expression_contains_setvar_aux(E,Variable). |
| 6112 | | expression_contains_setvar(E,V) :- add_internal_error('Illegal Expression: ', expression_contains_setvar(E,V)), |
| 6113 | | contains_var(V,E). |
| 6114 | | |
| 6115 | | expression_contains_setvar_aux(value(Val),Variable) :- !,value_contains_setvar(Val,Variable). |
| 6116 | | % a few very common cases for performance; currently this predicate is often called for recursive functions |
| 6117 | | expression_contains_setvar_aux(identifier(_),_) :- !,fail. |
| 6118 | | expression_contains_setvar_aux(equal(A,B),Variable) :- !, |
| 6119 | | (expression_contains_setvar(A,Variable) -> true ; expression_contains_setvar(B,Variable)). |
| 6120 | | expression_contains_setvar_aux(conjunct(A,B),Variable) :- !, |
| 6121 | | (expression_contains_setvar(A,Variable) -> true ; expression_contains_setvar(B,Variable)). |
| 6122 | | expression_contains_setvar_aux(function(A,B),Variable) :- !, |
| 6123 | | (expression_contains_setvar(A,Variable) -> true ; expression_contains_setvar(B,Variable)). |
| 6124 | | expression_contains_setvar_aux(union(A,B),Variable) :- !, |
| 6125 | | (expression_contains_setvar(A,Variable) -> true ; expression_contains_setvar(B,Variable)). |
| 6126 | | expression_contains_setvar_aux(couple(A,B),Variable) :- !, |
| 6127 | | (expression_contains_setvar(A,Variable) -> true ; expression_contains_setvar(B,Variable)). |
| 6128 | | % the rest via safe_syntaxelement: |
| 6129 | | expression_contains_setvar_aux(Expr,V) :- |
| 6130 | | safe_syntaxelement_det(Expr,Subs,_Names,_,_),!, |
| 6131 | ? | member(Sub,Subs), expression_contains_setvar(Sub,V),!. |
| 6132 | | expression_contains_setvar_aux(E,V) :- add_internal_error('Illegal Expression: ', expression_contains_setvar_aux(E,V)), |
| 6133 | | contains_var(V,E). |
| 6134 | | |
| 6135 | | value_contains_setvar(Val,V) :- var(Val),!,Val==V. |
| 6136 | | value_contains_setvar(avl_set(_),_V) :- !, fail. % assume avl_set always properly grounded; avoid looking inside |
| 6137 | | value_contains_setvar(closure(_,_,Body),V) :- !, |
| 6138 | | expression_contains_setvar(Body,V). |
| 6139 | | value_contains_setvar(int(_),_) :- !,fail. % we check for set variables |
| 6140 | | value_contains_setvar(global_set(_),_) :- !,fail. % we check for set variables |
| 6141 | | value_contains_setvar(freetype(_),_) :- !,fail. % we check for set variables |
| 6142 | | value_contains_setvar(freeval(_ID,_Case,Val),V) :- !, value_contains_setvar(Val,V). |
| 6143 | | value_contains_setvar(string(_),_) :- !,fail. % we check for set variables |
| 6144 | | value_contains_setvar(fd(_,_),_) :- !,fail. % we check for set variables |
| 6145 | | value_contains_setvar((A,B),V) :- !, (value_contains_setvar(A,V) ; value_contains_setvar(B,V)). |
| 6146 | | value_contains_setvar([A|B],V) :- !, (value_contains_setvar(A,V) ; value_contains_setvar(B,V)). |
| 6147 | | value_contains_setvar(Val,V) :- |
| 6148 | | contains_var(V,Val). |
| 6149 | | |
| 6150 | | % ------------------ |