Mo7art/Stack2Graph_VD_prolog · Datasets at Hugging Face

chunk_id large_stringlengths 9 11 ⌀	question_id large_stringlengths 6 8	language large_stringclasses 1 value	chunk_index int64 0 4 ⌀	chunk_text large_stringlengths 115 2.62k ⌀	sparse_text large_stringlengths 111 4.37k	dense_vector listlengths 3.58k 3.58k ⌀	sparse_indices listlengths 9 217 ⌀	sparse_values listlengths 9 217 ⌀	export_source large_stringclasses 1 value
69134347_c0	69134347	prolog	0	Title: Why does Prolog generate additional variables while querying? Problem title: Why does Prolog generate additional variables while querying? Tags: prolog Problem: Why does Prolog generate additional variables while querying? Knowledge base: child(martha,charlotte). child(charlotte,caroline). child(caroline,laura)....	Why does Prolog generate additional variables while querying? Why does Prolog generate additional variables while querying? prolog Why Prolog _2978 Call Fail Redo HERE Exit _3233 Why does Prolog generate additional variables while querying? Knowledge base: Query: descend(martha, laura). Prolog first calls child(martha,...	[ 0.0179443359375, 0.008544921875, -0.01031494140625, 0.00579833984375, -0.0081787109375, 0.0096435546875, -0.0181884765625, 0.00946044921875, 0.01153564453125, -0.0201416015625, 0.0010528564453125, -0.0286865234375, -0.0263671875, -0.0037841796875, 0.007720947265625, 0.003265380859375, ...	[ 44084, 1250, 4867, 139392, 78301, 77336, 7, 12960, 41, 1294, 214, 502, 4235, 19051, 26265, 190355, 6096, 31, 65791, 5443, 105586, 191428, 3647, 58836, 53, 60887, 31809, 21, 3168, 5117, 11782, 29041, 35782, 30646, 47, 27117, 567, 12765, 2728...	[ 0.1175537109375, 0.199462890625, 0.2802734375, 0.18408203125, 0.156005859375, 0.265625, 0.028167724609375, 0.0819091796875, 0.1209716796875, 0.1326904296875, 0.0350341796875, 0.150390625, 0.1533203125, 0.22802734375, 0.1597900390625, 0.1995849609375, 0.0867919921875, 0.119018554687...	embed
41106353_c1	41106353	prolog	1	wapping, _G3131, [shadwell, whitechapel]) ? creep Call: (11) link(wapping, _G3130, east_london) ? creep Exit: (11) link(wapping, rotherhithe, east_london) ? creep Call: (11) next_station(east_london, rotherhithe, _G3134, [wapping, shadwell, whitechapel]) ? creep Call: (12) link(rotherhithe, _G3133, east_london) ? cree...	wapping, _G3131, [shadwell, whitechapel]) ? creep Call: (11) link(wapping, _G3130, east_london) ? creep Exit: (11) link(wapping, rotherhithe, east_london) ? creep Call: (11) next_station(east_london, rotherhithe, _G3134, [wapping, shadwell, whitechapel]) ? creep Call: (12) link(rotherhithe, _G3133, east_london) ? cree...	[ -0.0005950927734375, -0.00958251953125, 0.007293701171875, 0.0111083984375, 0.005035400390625, 0.00390625, 0.0021820068359375, -0.017822265625, 0.0208740234375, -0.002685546875, -0.01275634765625, 0.0274658203125, -0.0225830078125, 0.00469970703125, 0.000331878662109375, -0.00408935546...	[ 259, 26783, 4, 101, 724, 5016, 99225, 19256, 35011, 1436, 5310, 268, 705, 49512, 254, 26265, 12, 21282, 3126, 634, 1197, 28, 4438, 4759, 4445, 5443, 217, 2062, 9319, 127, 10902, 11737, 41311, 363, 114082, 23676, 125158, 613, 36840, 138414...	[ 0.181884765625, 0.2330322265625, 0.0155792236328125, 0.038543701171875, 0.10693359375, 0.259033203125, 0.1546630859375, 0.2259521484375, 0.115234375, 0.09063720703125, 0.1600341796875, 0.029754638671875, 0.06256103515625, 0.212646484375, 0.1768798828125, 0.2213134765625, 0.0776977539...	embed
66301190_c1	66301190	prolog	1	codes . Traditionally, a double-quoted string is exploded into a list of codes , and this notation also works SWI-Prolog in DCG contexts, even though SWI-Prolog maps a "double-quoted string" to the special string datatype otherwise. `0123` . Traditonally, text within back-quotes is mapped to an atom (I think, the 95 I...	codes . Traditionally, a double-quoted string is exploded into a list of codes , and this notation also works SWI-Prolog in DCG contexts, even though SWI-Prolog maps a "double-quoted string" to the special string datatype otherwise. `0123` . Traditonally, text within back-quotes is mapped to an atom (I think, the 95 I...	[ 0.020751953125, -0.00921630859375, 0.01446533203125, 0.0255126953125, -0.00063323974609375, -0.004364013671875, 0.01116943359375, 0.00113677978515625, -0.0050048828125, 0.0093994140625, -0.01080322265625, -0.0250244140625, -0.02099609375, -0.00139617919921875, -0.003997802734375, 0.011...	[ 18151, 7, 5, 97299, 10, 41929, 9, 68726, 71, 79315, 83, 24649, 48141, 3934, 5303, 110, 22062, 43240, 159, 38969, 10752, 4867, 391, 56367, 43701, 22288, 21555, 2661, 5361, 2053, 50986, 120262, 6746, 3742, 69121, 1507, 7986, 28032, 4420, 29...	[ 0.2437744140625, 0.05682373046875, 0.0151519775390625, 0.100830078125, 0.013275146484375, 0.2081298828125, 0.037841796875, 0.239013671875, 0.08056640625, 0.219482421875, 0.03582763671875, 0.206298828125, 0.0986328125, 0.078857421875, 0.1240234375, 0.1065673828125, 0.0295257568359375,...	embed
68610581_c1	68610581	prolog	1	--> []. nat_space(N) --> { var(N) }, " ", nat_space(M), { N is M+1 }. nat_space(M) --> { nonvar(M), M>0 }, " ", { N is M-1 }, nat_space(N). which does work fine: ?- Anz_Spaces=3,my_string_codes(String,Codes), once(phrase(nat_space(Anz_Spaces), Codes, [])). Anz_Spaces = 3, String = " ", Codes = [32, 32, 32]. ?- String=...	--> []. nat_space(N) --> { var(N) }, " ", nat_space(M), { N is M+1 }. nat_space(M) --> { nonvar(M), M>0 }, " ", { N is M-1 }, nat_space(N). which does work fine: ?- Anz_Spaces=3,my_string_codes(String,Codes), once(phrase(nat_space(Anz_Spaces), Codes, [])). Anz_Spaces = 3, String = " ", Codes = [32, 32, 32]. ?- String=...	[ -0.001373291015625, 0.007568359375, -0.01153564453125, 0.01068115234375, 0.00034332275390625, 0.0157470703125, 0.01165771484375, -0.00872802734375, 0.0361328125, -0.031982421875, 0.024169921875, -0.01177978515625, -0.007049560546875, 0.01556396484375, 0.0030364990234375, 0.010864257812...	[ 129908, 24, 18, 454, 65421, 839, 16, 285, 51912, 44, 594, 247, 541, 83, 276, 21748, 351, 1961, 2389, 4, 5759, 3129, 14602, 4488, 5885, 893, 169, 141012, 7, 76067, 1176, 91693, 40899, 132, 71713, 214, 114211, 24145, 179665, 184, 7695, ...	[ 0.0654296875, 0.1785888671875, 0.1907958984375, 0.067138671875, 0.26953125, 0.1558837890625, 0.00836181640625, 0.1966552734375, 0.00634765625, 0.0081787109375, 0.0994873046875, 0.008636474609375, 0.1009521484375, 0.020843505859375, 0.07293701171875, 0.1553955078125, 0.1015625, 0.15...	embed
77226982_c1	77226982	prolog	1	* predicates read_list(intl) reverse(intl, intl) append(intll, intll, intll) app(intl, intl, intl) length(intl, int) cut(intl, int, intl) subseq(intl, int, int, intl) prefixes(intl, int, intll) all_sublists(intl, intll) is_pal(intl) all_pals(intll, intll) all_palindroms(intl, intll) belongs_to_sublist(int, intll) filte...	* predicates read_list(intl) reverse(intl, intl) append(intll, intll, intll) app(intl, intl, intl) length(intl, int) cut(intl, int, intl) subseq(intl, int, int, intl) prefixes(intl, int, intll) all_sublists(intl, intll) is_pal(intl) all_pals(intll, intll) all_palindroms(intl, intll) belongs_to_sublist(int, intll) filte...	[ 0.0027923583984375, 0.01708984375, 0.01397705078125, 0.0120849609375, -0.0096435546875, 0.01544189453125, 0.0211181640625, 0.01043701171875, 0.0233154296875, -0.0257568359375, 0.0126953125, 0.0026702880859375, -0.00933837890625, -0.00146484375, 0.00946044921875, 0.0010833740234375, 0...	[ 661, 1653, 2063, 1636, 12301, 454, 6562, 4288, 141, 16, 39531, 184, 23, 18, 114689, 71, 1181, 4027, 140909, 59226, 1614, 864, 4, 183114, 90, 756, 22144, 7, 132, 83, 5007, 73, 41684, 186, 10617, 188, 46312, 62766, 32786, 70731, 13025, ...	[ 0.16845703125, 0.20458984375, 0.2313232421875, 0.13525390625, 0.2110595703125, 0.05084228515625, 0.23046875, 0.196044921875, 0.135498046875, 0.005462646484375, 0.1949462890625, 0.12939453125, 0.0904541015625, 0.1246337890625, 0.200439453125, 0.0675048828125, 0.2205810546875, 0.1926...	embed
61731888_c0	61731888	prolog	0	Title: Cartesian product of a list in Prolog Problem title: Cartesian product of a list in Prolog Tags: prolog Problem: Cartesian product of a list in Prolog So what I want to achieve is the following: A predicate that when given 2 lists returns a list of the Cartesian products of the elements. Here is an example. list...	Cartesian product of a list in Prolog Cartesian product of a list in Prolog prolog Cartesian Prolog list_mult Lfinal add_list Res Cartesian product of a list in Prolog So what I want to achieve is the following: A predicate that when given 2 lists returns a list of the Cartesian products of the elements. Here is an exa...	[ -0.003753662109375, 0.017578125, 0.0096435546875, 0.00909423828125, -0.016845703125, 0.01171875, -0.00347900390625, -0.01123046875, 0.0019989013671875, -0.0203857421875, 0.0028228759765625, 0.0262451171875, 0.0030670166015625, 0.001495361328125, -0.022705078125, -0.00144195556640625, ...	[ 106274, 39209, 12996, 111, 5303, 1250, 4867, 502, 81944, 339, 33870, 15190, 6562, 9624, 3444, 69307, 1653, 2063, 67, 34475, 116, 30646, 38742, 80854, 27781, 101935, 15044, 3871, 33022, 6024, 62479, 5701, 1614, 17721, 3789, 15458, 4028, 61924,...	[ 0.1884765625, 0.1741943359375, 0.2354736328125, 0.024169921875, 0.1854248046875, 0.144775390625, 0.2379150390625, 0.115966796875, 0.1988525390625, 0.03515625, 0.239990234375, 0.0989990234375, 0.169677734375, 0.10400390625, 0.0283966064453125, 0.0595703125, 0.1427001953125, 0.183837...	embed
34796368_c1	34796368	prolog	1	, [kurt_allgen, mona_malm] ). group( project_office, ahmed_hassan, [kurt_allgen, anna_nilsson] ). group( recruitment, lill_nilsson, [annie_cedrell, jonna_spjuth] ). group( salaries, bengt_karlsson, [gullbritt_svensson, siri_hallin] ). group( assembly, rune_runesson, [johnny_kraft] ). group( testing, allan_snygg, [edvin...	, [kurt_allgen, mona_malm] ). group( project_office, ahmed_hassan, [kurt_allgen, anna_nilsson] ). group( recruitment, lill_nilsson, [annie_cedrell, jonna_spjuth] ). group( salaries, bengt_karlsson, [gullbritt_svensson, siri_hallin] ). group( assembly, rune_runesson, [johnny_kraft] ). group( testing, allan_snygg, [edvin...	[ 0.004119873046875, -0.0018310546875, 0.000018358230590820312, 0.0164794921875, -0.0172119140625, 0.0084228515625, -0.0179443359375, -0.0120849609375, 0.0140380859375, 0.0057373046875, -0.0137939453125, 0.015869140625, -0.00787353515625, 0.00732421875, -0.000560760498046875, 0.000717163...	[ 2971, 18, 5584, 1409, 2667, 11, 2749, 39, 21115, 13452, 65024, 1263, 4806, 120516, 19, 78656, 17324, 4503, 172310, 400, 1181, 66, 701, 37534, 58248, 70656, 76, 461, 927, 4559, 1585, 5386, 1153, 146638, 80971, 1353, 76414, 95914, 132, 8984...	[ 0.080322265625, 0.082763671875, 0.09521484375, 0.1666259765625, 0.10693359375, 0.10357666015625, 0.06494140625, 0.095947265625, 0.2376708984375, 0.1473388671875, 0.2176513671875, 0.0148162841796875, 0.103759765625, 0.0914306640625, 0.067138671875, 0.10504150390625, 0.06805419921875, ...	embed
36673733_c0	36673733	prolog	0	Title: Prolog: generate queries out of DCG Problem title: Prolog: generate queries out of DCG Tags: prolog, call, dcg Problem: Prolog: generate queries out of DCG I currently have a small Prolog database containing a few people and some predicates for relations. For example: female(anna). female(susan). male(john). mal...	Prolog: generate queries out of DCG Prolog: generate queries out of DCG prolog call dcg Prolog DCG Prolog: generate queries out of DCG I currently have a small Prolog database containing a few people and some predicates for relations. For example: and I have a DCG which can determine valid questions like "who is the br...	[ 0.028076171875, -0.004547119140625, 0.01318359375, 0.0245361328125, 0.005767822265625, 0.03271484375, -0.006744384765625, -0.013671875, 0.01031494140625, -0.09130859375, -0.023193359375, -0.00439453125, -0.0216064453125, 0.01031494140625, 0.00970458984375, -0.0037078857421875, 0.0037...	[ 1250, 4867, 139392, 41, 10484, 1810, 111, 391, 56367, 12, 502, 11782, 104, 238, 177, 82424, 19336, 63399, 70541, 10846, 3395, 1653, 2063, 91582, 27781, 831, 83324, 35604, 17582, 497, 83, 82953, 35254, 19, 43240, 5299, 3444, 1528, 3249, 47...	[ 0.1405029296875, 0.233642578125, 0.170166015625, 0.1630859375, 0.1478271484375, 0.1229248046875, 0.09417724609375, 0.1192626953125, 0.210205078125, 0.00140380859375, 0.0931396484375, 0.1929931640625, 0.0413818359375, 0.0413818359375, 0.09515380859375, 0.04718017578125, 0.055328369140...	embed
30069099_c0	30069099	prolog	0	Title: Residual constraints with reification in clpfd Problem title: Residual constraints with reification in clpfd Tags: swi-prolog, prolog, clpfd Problem: Residual constraints with reification in clpfd I defined reified variants of the clpfd constraints (#<)/2 , (#=<)/2 , (#>=)/2 and (#>)/2 : :- use_module(library(cl...	Residual constraints with reification in clpfd Residual constraints with reification in clpfd swi-prolog prolog clpfd Residual use_module Truth bool01_truth _G968 _G912 _G1301 _G1243 Residual constraints with reification in clpfd I defined reified variants of the clpfd constraints (#<)/2 , (#=<)/2 , (#>=)/2 and (#>)/2 ...	[ -0.0035400390625, 0.0074462890625, 0.011474609375, 0.01019287109375, 0.0234375, -0.00787353515625, -0.003936767578125, 0.01385498046875, -0.005035400390625, 0.01531982421875, -0.003173828125, 0.0000400543212890625, -0.0133056640625, 0.0224609375, 0.03662109375, 0.0166015625, 0.019531...	[ 9624, 21937, 158, 2816, 4288, 678, 456, 41274, 33139, 39557, 71, 2452, 3454, 4867, 502, 4527, 83279, 184431, 142484, 6746, 75481, 11648, 1019, 1126, 1530, 43955, 11548, 61924, 47314, 20117, 16093, 12477, 96, 18, 284, 18113, 136, 571, 12684,...	[ 0.1217041015625, 0.2120361328125, 0.10491943359375, 0.18701171875, 0.1279296875, 0.06329345703125, 0.138427734375, 0.2193603515625, 0.1055908203125, 0.1300048828125, 0.1544189453125, 0.1412353515625, 0.0980224609375, 0.1842041015625, 0.0777587890625, 0.08544921875, 0.1099853515625, ...	embed
8344823_c0	8344823	prolog	0	Title: Choosing all possible options from List in Prolog Problem title: Choosing all possible options from List in Prolog Tags: prolog, list, river-crossing-puzzle, forall Problem: Choosing all possible options from List in Prolog So I have to write different procedures that will help me solve the farmer-wolf-goat-cabb...	Choosing all possible options from List in Prolog Choosing all possible options from List in Prolog prolog list river-crossing-puzzle forall List Choosing Prolog Choosing all possible options from List in Prolog So I have to write different procedures that will help me solve the farmer-wolf-goat-cabbage-fertilizer puzz...	[ -0.01141357421875, -0.009765625, -0.00872802734375, 0.0172119140625, -0.032958984375, 0.0048828125, -0.0260009765625, 0.0086669921875, 0.0113525390625, 0.0004520416259765625, 0.0146484375, -0.0198974609375, 0.0130615234375, 0.0087890625, -0.011962890625, 0.01507568359375, 0.007263183...	[ 4960, 232, 756, 7722, 50717, 1295, 32036, 1250, 4867, 23, 502, 5303, 96113, 95665, 214, 1766, 13894, 133, 100, 5584, 50491, 4358, 86869, 171751, 25400, 420, 519, 257, 408, 45391, 429, 2875, 24493, 4383, 104192, 3714, 41421, 23924, 4620, 2...	[ 0.07318115234375, 0.064453125, 0.124267578125, 0.202880859375, 0.246337890625, 0.0802001953125, 0.2012939453125, 0.15673828125, 0.231201171875, 0.0298309326171875, 0.1192626953125, 0.1925048828125, 0.148193359375, 0.149658203125, 0.055999755859375, 0.0821533203125, 0.10235595703125, ...	embed
36430150_c1	36430150	prolog	1	], [,spots(8,2),spots(8,3),spots(8,4),,spots(8,6),spots(8,7),spots(8,8),spots(8,9),,spots(8,11),spots(8,12)], [,spots(9,2),spots(9,3),,spots(9,5),spots(9,6),,,spots(9,9),spots(9,10),spots(9,11),spots(9,12)], [,spots(10,2),spots(10,3),,spots(10,5),spots(10,6),spots(10,7),spots(10,8),,spots(10,10),spots(10,11),...	], [,spots(8,2),spots(8,3),spots(8,4),,spots(8,6),spots(8,7),spots(8,8),spots(8,9),,spots(8,11),spots(8,12)], [,spots(9,2),spots(9,3),,spots(9,5),spots(9,6),,,spots(9,9),spots(9,10),spots(9,11),spots(9,12)], [,spots(10,2),spots(10,3),,spots(10,5),spots(10,6),spots(10,7),spots(10,8),,spots(10,10),spots(10,11),...	[ 0.007080078125, 0.0081787109375, -0.0047607421875, -0.002471923828125, -0.004241943359375, 0.00885009765625, 0.004364013671875, -0.0027923583984375, 0.015380859375, -0.0185546875, 0.006744384765625, -0.0062255859375, -0.00457763671875, -0.010986328125, -0.00823974609375, 0.026000976562...	[ 10114, 4, 378, 1639, 53370, 7, 1019, 10461, 132, 21320, 29557, 59690, 186922, 247, 50490, 145180, 48105, 55102, 268, 1126, 93754, 191534, 178692, 50258, 90980, 36076, 1662, 163324, 41600, 188523, 179941, 198889, 134186, 3444, 47, 4527, 7413, ...	[ 0.045257568359375, 0.01324462890625, 0.0159149169921875, 0.0836181640625, 0.2371826171875, 0.034942626953125, 0.1220703125, 0.08245849609375, 0.0128173828125, 0.0784912109375, 0.1297607421875, 0.05670166015625, 0.10546875, 0.0130615234375, 0.05999755859375, 0.1080322265625, 0.1132812...	embed
9647434_c0	9647434	prolog	0	Title: Finding letters in a word that have different orders Problem title: Finding letters in a word that have different orders Tags: prolog Problem: Finding letters in a word that have different orders Here is a description of a prolog program that I am working on: user might enter a 5 letter word, and the only letter...	Finding letters in a word that have different orders Finding letters in a word that have different orders prolog Finding U-Z A1-A5 Finding letters in a word that have different orders Here is a description of a prolog program that I am working on: user might enter a 5 letter word, and the only letters allowed are a,b,c...	[ 0.0196533203125, -0.0135498046875, 0.005035400390625, 0.00726318359375, 0.005126953125, 0.0185546875, -0.01153564453125, -0.0052490234375, 0.0164794921875, 0.0037994384765625, 0.00927734375, 0.0079345703125, 0.014892578125, 0.0004730224609375, 0.006683349609375, -0.005767822265625, -...	[ 26040, 214, 120820, 23, 2565, 450, 765, 12921, 12989, 502, 4867, 345, 9, 1511, 62, 20268, 284, 758, 76811, 1528, 20697, 38937, 13648, 30957, 190, 31330, 4734, 107003, 621, 275, 238, 71, 1543, 959, 756, 34153, 9844, 164805, 441, 876, 136...	[ 0.15478515625, 0.0281829833984375, 0.2362060546875, 0.07958984375, 0.1796875, 0.01953125, 0.0604248046875, 0.193359375, 0.212158203125, 0.134033203125, 0.18701171875, 0.05987548828125, 0.00396728515625, 0.1123046875, 0.0887451171875, 0.034210205078125, 0.0836181640625, 0.1021728515...	embed
31058929_c1	31058929	prolog	1	92503131e-16__2.2204460492503131e-16 Yes (0.00s cpu) This interval does not contain 0.0. I am aware that interval arithmetic often is a bit too approximate as in: [eclipse 4]: 1 $= sqrt(1). Delayed goals: 0 $= -1.1102230246251565e-16__2.2204460492503131e-16 Yes (0.00s cpu) But at least the equation holds! However, in t...	92503131e-16__2.2204460492503131e-16 Yes (0.00s cpu) This interval does not contain 0.0. I am aware that interval arithmetic often is a bit too approximate as in: [eclipse 4]: 1 $= sqrt(1). Delayed goals: 0 $= -1.1102230246251565e-16__2.2204460492503131e-16 Yes (0.00s cpu) But at least the equation holds! However, in t...	[ -0.0087890625, -0.0135498046875, -0.00067138671875, 0.01312255859375, 0.006378173828125, 0.0120849609375, 0.006103515625, 0.005035400390625, 0.0211181640625, 0.021728515625, 0.00787353515625, 0.035400390625, -0.0308837890625, -0.004913330078125, 0.0234375, 0.0027618408203125, 0.01989...	[ 171012, 9513, 115468, 13, 13528, 70147, 147758, 158332, 12977, 24291, 5016, 32635, 37509, 7, 1766, 3293, 51514, 14602, 959, 70541, 89678, 107419, 8962, 282, 9523, 27983, 4785, 5792, 35707, 5134, 15829, 106371, 184, 201, 106, 3650, 864, 3198, ...	[ 0.1629638671875, 0.0200958251953125, 0.10125732421875, 0.04461669921875, 0.177001953125, 0.0203094482421875, 0.04168701171875, 0.03643798828125, 0.011810302734375, 0.0268402099609375, 0.0924072265625, 0.09619140625, 0.1903076171875, 0.0186614990234375, 0.1656494140625, 0.03262329101562...	embed
35276850_c1	35276850	prolog	1	there other approaches than mine that does not cover 50+ lines? Updated Thanks a lot, the code became so much cleaner - it might go further, but now it is possible to actually post here (this is modified a bit - but the logic is there) inPeriods(Day, [ period(Start,End) \| _ ]) :- between(Start,End, Day). inPeriods(Day...	there other approaches than mine that does not cover 50+ lines? Updated Thanks a lot, the code became so much cleaner - it might go further, but now it is possible to actually post here (this is modified a bit - but the logic is there) inPeriods(Day, [ period(Start,End) \| _ ]) :- between(Start,End, Day). inPeriods(Day...	[ -0.007476806640625, 0.01458740234375, 0.0184326171875, 0.017578125, -0.01214599609375, 0.021240234375, -0.0179443359375, 0.005828857421875, 0.0067138671875, -0.025146484375, -0.01055908203125, 0.029296875, -0.0113525390625, 0.0037384033203125, 0.01019287109375, 0.0152587890625, 0.012...	[ 2685, 3789, 51515, 90, 3501, 5665, 14602, 959, 29256, 836, 1328, 124519, 28641, 5915, 70, 18151, 100512, 221, 5045, 46622, 56, 20, 442, 13648, 53333, 4, 5036, 83, 7722, 20653, 1305, 3688, 73197, 297, 62775, 16, 23, 15277, 846, 6468, 132...	[ 0.03448486328125, 0.09136962890625, 0.23974609375, 0.0880126953125, 0.034820556640625, 0.14697265625, 0.003021240234375, 0.06121826171875, 0.19189453125, 0.1490478515625, 0.093017578125, 0.2039794921875, 0.158203125, 0.044708251953125, 0.0369873046875, 0.2330322265625, 0.071472167968...	embed
35677482_c1	35677482	prolog	1	al_del_norte, morelos,candelaria,fray_servando,jamaica,santa_anita]). linea(5,[politecnico,instituto_del_petroleo,autobuses_norte,la_raza,misterios, valle_gomez,consulado,eduardo_molina,aragon,oceania,terminal_aerea, hangares,pantitlan]). linea(6,[el_rosario,tezozomoc,azcapotzalco,ferreria,norte_45,vallejo, instituto_d...	al_del_norte, morelos,candelaria,fray_servando,jamaica,santa_anita]). linea(5,[politecnico,instituto_del_petroleo,autobuses_norte,la_raza,misterios, valle_gomez,consulado,eduardo_molina,aragon,oceania,terminal_aerea, hangares,pantitlan]). linea(6,[el_rosario,tezozomoc,azcapotzalco,ferreria,norte_45,vallejo, instituto_d...	[ -0.0054931640625, 0.006439208984375, 0.0140380859375, 0.0306396484375, 0.000507354736328125, 0.00469970703125, 0.0035858154296875, 0.006256103515625, 0.0050048828125, -0.020751953125, -0.004425048828125, -0.017333984375, -0.0019989013671875, 0.0028839111328125, 0.00164794921875, -0.004...	[ 144, 1743, 13665, 67, 1286, 2400, 4, 6232, 6000, 53, 65756, 557, 19616, 2063, 116357, 66, 913, 268, 194, 42592, 104116, 74132, 3240, 12150, 65382, 5408, 82512, 8913, 4223, 90, 143, 5272, 11, 81334, 31669, 118666, 11723, 202, 43932, 432, ...	[ 0.15478515625, 0.1868896484375, 0.1630859375, 0.06744384765625, 0.0740966796875, 0.138427734375, 0.003875732421875, 0.09320068359375, 0.0284423828125, 0.00115966796875, 0.107666015625, 0.08489990234375, 0.0809326171875, 0.0283203125, 0.02349853515625, 0.008209228515625, 0.09027099609...	embed
40291548_c0	40291548	prolog	0	Title: Simple Prolog program: "Arguments are not sufficiently instantiated" error Problem title: Simple Prolog program: "Arguments are not sufficiently instantiated" error Tags: prolog, instantiation-error, clpfd Problem: Simple Prolog program: "Arguments are not sufficiently instantiated" error I a...	Simple Prolog program: "Arguments are not sufficiently instantiated" error Simple Prolog program: "Arguments are not sufficiently instantiated" error prolog instantiation-error clpfd Simple Prolog Arguments ERROR Simple Prolog program: "Arguments are not sufficiently instantiated" error I am writing...	[ -0.0103759765625, 0.0194091796875, 0.0186767578125, 0.0216064453125, 0.01507568359375, 0.03466796875, 0.004364013671875, 0.015625, 0.0283203125, -0.02880859375, 0.004486083984375, -0.0294189453125, 0.003753662109375, 0.0096435546875, 0.0213623046875, -0.00372314453125, 0.026123046875...	[ 60552, 1250, 4867, 1528, 7614, 1234, 9035, 621, 959, 129980, 34648, 14, 27686, 18499, 502, 188800, 39557, 71, 112140, 151206, 32562, 1653, 2063, 67, 314, 5117, 17262, 80854, 5773, 14012, 5303, 28412, 16750, 27781, 7311, 3638, 33342, 140909, ...	[ 0.188720703125, 0.1947021484375, 0.230224609375, 0.1279296875, 0.1387939453125, 0.253173828125, 0.162841796875, 0.08135986328125, 0.1580810546875, 0.2142333984375, 0.1617431640625, 0.160400390625, 0.10791015625, 0.170654296875, 0.12646484375, 0.14404296875, 0.0369873046875, 0.05468...	embed
45183170_c0	45183170	prolog	0	Title: How to make a prolog program return the value it computed Problem title: How to make a prolog program return the value it computed Tags: prolog Problem: How to make a prolog program return the value it computed (I'm not sur if return is the right word to describe it, but that's the best one I could find.) I am t...	How to make a prolog program return the value it computed How to make a prolog program return the value it computed prolog How How to make a prolog program return the value it computed (I'm not sur if return is the right word to describe it, but that's the best one I could find.) I am trying to write a small program in...	[ -0.00592041015625, 0.01434326171875, 0.006011962890625, 0.005584716796875, -0.017578125, 0.0205078125, -0.0031280517578125, -0.003387451171875, 0.01031494140625, -0.038330078125, 0.00531005859375, 0.0013275146484375, -0.0245361328125, -0.004119873046875, 0.0140380859375, 0.006561279296...	[ 11249, 3249, 502, 4867, 1528, 30646, 70, 34292, 442, 375, 7077, 297, 2565, 98363, 2965, 31577, 33022, 19336, 4527, 32354, 15190, 47, 54, 127664, 5256, 11675, 68034, 35839, 3034, 16750, 1511, 2203, 10554, 155761, 44116, 567, 114997, 2967, 20...	[ 0.07305908203125, 0.10614013671875, 0.1746826171875, 0.2335205078125, 0.211669921875, 0.265869140625, 0.089599609375, 0.196044921875, 0.1015625, 0.0794677734375, 0.18505859375, 0.0860595703125, 0.008026123046875, 0.010772705078125, 0.0357666015625, 0.046051025390625, 0.205078125, 0...	embed
35358436_c0	35358436	prolog	0	Title: Prolog: Arrangements of k elements with sum of elements S Problem title: Prolog: Arrangements of k elements with sum of elements S Tags: permutation, clpfd, combinations, list, prolog Problem: Prolog: Arrangements of k elements with sum of elements S I am trying to compute arrangements of K elements in Prolog, w...	Prolog: Arrangements of k elements with sum of elements S Prolog: Arrangements of k elements with sum of elements S permutation clpfd combinations list prolog Prolog Arrangements K-1 Tail Prolog: Arrangements of k elements with sum of elements S I am trying to compute arrangements of K elements in Prolog, where the sum...	[ 0.006805419921875, 0.0230712890625, 0.01251220703125, -0.00469970703125, -0.01385498046875, -0.000152587890625, -0.033203125, 0.0111083984375, 0.0111083984375, -0.0272216796875, 0.01116943359375, 0.0064697265625, 0.007568359375, 0.0037384033203125, -0.000873565673828125, 0.011474609375...	[ 1250, 4867, 187301, 429, 9035, 472, 80854, 678, 10554, 159, 117, 561, 39557, 71, 162515, 5303, 502, 341, 5759, 1218, 379, 31577, 9969, 6743, 70767, 111, 23, 2363, 105950, 34475, 831, 375, 7077, 390, 90791, 3714, 3642, 14311, 21094, 19441,...	[ 0.181640625, 0.251953125, 0.1976318359375, 0.1357421875, 0.026885986328125, 0.167724609375, 0.2332763671875, 0.038055419921875, 0.20166015625, 0.14501953125, 0.102294921875, 0.14501953125, 0.05181884765625, 0.06134033203125, 0.244873046875, 0.1622314453125, 0.08935546875, 0.2196044...	embed
43966167_c0	43966167	prolog	0	Title: How to write a Prolog predicate that will return a list of successor facts, sorted by value Problem title: How to write a Prolog predicate that will return a list of successor facts, sorted by value Tags: list, logic, prolog, sorting Problem: How to write a Prolog predicate that will return a list of successor f...	How to write a Prolog predicate that will return a list of successor facts, sorted by value How to write a Prolog predicate that will return a list of successor facts, sorted by value list logic prolog sorting How Prolog get_order_successors Item Rest DisregardHead Tail How to write a Prolog predicate that will return ...	[ 0.0130615234375, 0.0030059814453125, -0.016357421875, -0.01556396484375, -0.007537841796875, -0.0025787353515625, -0.00095367431640625, -0.019775390625, 0.011962890625, -0.021240234375, 0.0257568359375, 0.01165771484375, -0.0169677734375, -0.029541015625, 0.00531005859375, -0.004791259...	[ 11249, 33022, 1250, 4867, 1653, 2063, 67, 30646, 5303, 39457, 42, 15824, 7, 17497, 390, 34292, 1221, 62775, 502, 12096, 2046, 80596, 226534, 4970, 78426, 49756, 42077, 13025, 712, 1218, 379, 866, 31577, 12989, 82800, 214, 27781, 6713, 2060,...	[ 0.06396484375, 0.15283203125, 0.1722412109375, 0.248779296875, 0.1607666015625, 0.2056884765625, 0.1044921875, 0.157958984375, 0.1583251953125, 0.2056884765625, 0.111328125, 0.1507568359375, 0.022247314453125, 0.15625, 0.06671142578125, 0.181884765625, 0.0243988037109375, 0.0704956...	embed
77582360_c1	77582360	prolog	1	(Xs, X1, [X0], Run, Rest). % for an ascending prefix, the run is built up as a QUEUE % for a descending prefix, the run is built up as a STACK descending([], X0, Run, [X0\|Run], []). descending([X1\|Xs], X0, Run0, Run, Rest) :- ( X0 @< X1 -> Run = [X0\|Run0], Rest = [X1\|Xs] ; descending(Xs, X1, [X0\|Run0], Run, Rest) ). Ex...	(Xs, X1, [X0], Run, Rest). % for an ascending prefix, the run is built up as a QUEUE % for a descending prefix, the run is built up as a STACK descending([], X0, Run, [X0\|Run], []). descending([X1\|Xs], X0, Run0, Run, Rest) :- ( X0 @< X1 -> Run = [X0\|Run0], Rest = [X1\|Xs] ; descending(Xs, X1, [X0\|Run0], Run, Rest) ). Ex...	[ 0.00152587890625, 0.0004482269287109375, 0.0096435546875, -0.0020904541015625, -0.007598876953125, 0.01220703125, 0.000667572021484375, -0.025390625, 0.017333984375, -0.01092529296875, 0.024169921875, 0.041748046875, -0.00970458984375, 0.00098419189453125, 0.00408935546875, 0.020996093...	[ 1542, 7, 1193, 418, 2389, 28398, 49756, 1745, 100, 82800, 214, 183114, 11675, 88303, 1257, 237, 21389, 37066, 60887, 64174, 20572, 4, 163321, 15772, 89536, 705, 127877, 132, 116, 483, 382, 190, 138, 361, 305, 201, 757, 627, 2203, 220133, ...	[ 0.1407470703125, 0.064697265625, 0.0982666015625, 0.095703125, 0.1407470703125, 0.195068359375, 0.1923828125, 0.126708984375, 0.021820068359375, 0.172119140625, 0.0545654296875, 0.26025390625, 0.1895751953125, 0.11474609375, 0.051727294921875, 0.05914306640625, 0.1307373046875, 0.1...	embed
66143858_c0	66143858	prolog	0	Title: Converting list of clauses to a query? Problem title: Converting list of clauses to a query? Tags: clause, list, prolog, call Problem: Converting list of clauses to a query? let say i have the following facts : book(65). own(named('Peter'), 65). now got the query as a list of clauses : [what(A), own(named('Peter...	Converting list of clauses to a query? Converting list of clauses to a query? clause list prolog call Converting Peter query_lst Res lst2conj Conj Converting list of clauses to a query? let say i have the following facts : now got the query as a list of clauses : or how do I make a rule that accept this list and return...	[ -0.00872802734375, 0.0341796875, 0.001190185546875, 0.0093994140625, -0.0030975341796875, 0.003662109375, -0.01458740234375, 0.00531005859375, 0.007598876953125, -0.0439453125, -0.01531982421875, -0.011962890625, -0.00823974609375, 0.02001953125, -0.00433349609375, 0.01141357421875, ...	[ 1657, 814, 5303, 111, 70731, 90, 47, 41, 1294, 10, 13, 502, 4867, 11782, 7948, 271, 9624, 2271, 170, 1916, 15824, 237, 79986, 26946, 30646, 16750, 9655, 44084, 186048, 497, 128239, 2396, 148, 127, 2737, 35166, 51455, 35782, 110, 2367, 1...	[ 0.074462890625, 0.1387939453125, 0.2183837890625, 0.046905517578125, 0.2529296875, 0.14404296875, 0.09124755859375, 0.1744384765625, 0.193359375, 0.03656005859375, 0.08721923828125, 0.0811767578125, 0.1436767578125, 0.1082763671875, 0.182373046875, 0.06988525390625, 0.08184814453125,...	embed
52108128_c0	52108128	prolog	0	Title: gerrit prolog submit rule condition check Problem title: gerrit prolog submit rule condition check Tags: gerrit, prolog Problem: gerrit prolog submit rule condition check We are using gerrit 2.11 to add manager-approval label if inserted code over defined threshold. the prolog rules.pl as below. I can remove "Ma...	gerrit prolog submit rule condition check gerrit prolog submit rule condition check gerrit prolog commit_stats remove_verified submit_rule gerrit:default_submit Manager-Approval gerrit:commit_stats gerrit prolog submit rule condition check We are using gerrit 2.11 to add manager-approval label if inserted code over def...	[ 0.01043701171875, 0.00191497802734375, 0.005889892578125, 0.01123046875, -0.030517578125, -0.006134033203125, -0.0098876953125, 0.0123291015625, 0.0032501220703125, 0.01190185546875, 0.03662109375, 0.00927734375, 0.03125, -0.017578125, 0.024658203125, 0.0191650390625, 0.0390625, 0....	[ 4155, 2783, 502, 4867, 137447, 79986, 35431, 12765, 375, 4007, 17346, 87388, 814, 47314, 882, 214810, 22144, 30195, 39179, 42, 6785, 277, 787, 1662, 15190, 31095, 9007, 67967, 183540, 18151, 645, 61924, 159399, 16200, 91736, 2424, 12662, 3373...	[ 0.08984375, 0.212890625, 0.1353759765625, 0.1983642578125, 0.177978515625, 0.1470947265625, 0.1719970703125, 0.1324462890625, 0.0955810546875, 0.1949462890625, 0.1510009765625, 0.20068359375, 0.1534423828125, 0.1837158203125, 0.111572265625, 0.1446533203125, 0.079833984375, 0.21594...	embed
53505610_c0	53505610	prolog	0	Title: How to declare a list in Prolog? Problem title: How to declare a list in Prolog? Tags: prolog, list Problem: How to declare a list in Prolog? I have browsed through various answers on SO about how to declare a list but I keep getting error messages. I am reading the section on lists from a book that I have but t...	How to declare a list in Prolog? How to declare a list in Prolog? prolog list How Prolog Answer How to declare a list in Prolog? I have browsed through various answers on SO about how to declare a list but I keep getting error messages. I am reading the section on lists from a book that I have but there still isn't an ...	[ 0.0031280517578125, 0.017578125, 0.0128173828125, 0.01385498046875, -0.0185546875, 0.0174560546875, -0.01422119140625, 0.003753662109375, 0.001556396484375, -0.010986328125, 0.00250244140625, 0.00119781494140625, -0.025390625, 0.0155029296875, 0.01263427734375, 0.00726318359375, 0.01...	[ 11249, 47, 159978, 10, 5303, 23, 1250, 4867, 502, 130373, 15969, 3642, 18499, 89914, 12877, 27781, 26785, 2856, 13452, 18507, 96759, 5423, 17582, 38937, 35166, 9655, 53418, 119140, 7162, 28282, 3229, 37170, 15190, 14012, 48322, 7464, 831, 18,...	[ 0.079345703125, 0.0263824462890625, 0.2802734375, 0.0643310546875, 0.2685546875, 0.10113525390625, 0.1614990234375, 0.232666015625, 0.11181640625, 0.0965576171875, 0.043060302734375, 0.0258331298828125, 0.1292724609375, 0.0242462158203125, 0.0562744140625, 0.03521728515625, 0.0394287...	embed
11122814_c1	11122814	prolog	1	, the dog lives in the third house. This approach makes it easy to model neighbor constraints like this: def neighbor(X, Y) :- (X #= Y-1) #\/ (X #= Y+1). But somehow, the clpfd package does not yield a solution, even though (IMO) the problem is modeled correctly (I used the exact same model with the Choco constraint so...	, the dog lives in the third house. This approach makes it easy to model neighbor constraints like this: def neighbor(X, Y) :- (X #= Y-1) #\/ (X #= Y+1). But somehow, the clpfd package does not yield a solution, even though (IMO) the problem is modeled correctly (I used the exact same model with the Choco constraint so...	[ -0.0194091796875, -0.0033721923828125, 0.01165771484375, 0.0037689208984375, 0.01104736328125, 0.003997802734375, -0.031494140625, 0.001129150390625, -0.005340576171875, -0.0277099609375, -0.01495361328125, -0.00299072265625, -0.010498046875, 0.00860595703125, 0.00677490234375, -0.0028...	[ 70, 10269, 60742, 23, 50960, 18276, 51515, 30482, 23468, 3299, 208244, 158, 2816, 4288, 7, 1884, 8, 420, 1542, 990, 16, 15772, 1369, 110218, 64, 15, 21748, 4966, 209303, 33139, 39557, 71, 98169, 14602, 959, 11180, 19388, 29806, 4, 59773, ...	[ 0.029510498046875, 0.2333984375, 0.160400390625, 0.08154296875, 0.2103271484375, 0.165771484375, 0.1424560546875, 0.033447265625, 0.0902099609375, 0.239501953125, 0.305419921875, 0.1090087890625, 0.2052001953125, 0.13623046875, 0.0282745361328125, 0.054931640625, 0.06512451171875, ...	embed
63505466_c1	63505466	prolog	1	has the highest occurrence in F by top in the first copy, and by bot in the second copy, and then apply the following ten reduction rules one rule at a time for as many times as possible, for each of the copies: 1. p & bot --> bot 2. p & top --> p 3. p \| bot --> p 4. p \| top --> top 5. p => bot --> ~p 6. p => top --> ...	has the highest occurrence in F by top in the first copy, and by bot in the second copy, and then apply the following ten reduction rules one rule at a time for as many times as possible, for each of the copies: 1. p & bot --> bot 2. p & top --> p 3. p \| bot --> p 4. p \| top --> top 5. p => bot --> ~p 6. p => top --> ...	[ 0.0269775390625, 0.00579833984375, 0.006439208984375, 0.0264892578125, -0.0106201171875, -0.01611328125, 0.004730224609375, -0.004150390625, 0.006683349609375, -0.0244140625, -0.0033111572265625, 0.0057373046875, -0.01165771484375, -0.015625, 0.00396728515625, -0.025634765625, 0.0023...	[ 1556, 70, 167375, 74918, 42, 6620, 23, 563, 390, 2663, 5117, 43658, 13820, 17932, 59911, 25632, 1492, 456, 77391, 91736, 1632, 79986, 1733, 5941, 20028, 7722, 12638, 71200, 915, 619, 1031, 1892, 2289, 3217, 3569, 4068, 108, 125682, 136, 4...	[ 0.04443359375, 0.0198974609375, 0.1702880859375, 0.1728515625, 0.1328125, 0.080078125, 0.0237274169921875, 0.1881103515625, 0.009552001953125, 0.1883544921875, 0.055938720703125, 0.158203125, 0.146240234375, 0.0618896484375, 0.0804443359375, 0.0139923095703125, 0.1744384765625, 0.1...	embed
23971783_c0	23971783	prolog	0	Title: How to get a list of the Value of a number as the sum of 4 numbers in Prolog Problem title: How to get a list of the Value of a number as the sum of 4 numbers in Prolog Tags: prolog, magic-square Problem: How to get a list of the Value of a number as the sum of 4 numbers in Prolog I'm having trouble making this ...	How to get a list of the Value of a number as the sum of 4 numbers in Prolog How to get a list of the Value of a number as the sum of 4 numbers in Prolog prolog magic-square How Value Prolog How to get a list of the Value of a number as the sum of 4 numbers in Prolog I'm having trouble making this predicate work. The i...	[ -0.030517578125, 0.0087890625, 0.018310546875, -0.005828857421875, -0.02099609375, -0.00634765625, -0.0245361328125, 0.0250244140625, 0.0223388671875, -0.026123046875, 0.0030364990234375, 0.0137939453125, -0.00506591796875, -0.01080322265625, -0.0096435546875, 0.005126953125, -0.0148...	[ 11249, 2046, 5303, 111, 70, 190060, 14012, 237, 10554, 201, 101935, 23, 1250, 4867, 10, 502, 49846, 108047, 63134, 1653, 2063, 4488, 6528, 4527, 879, 837, 9120, 683, 113054, 756, 7722, 17569, 17368, 117, 561, 22062, 12477, 72803, 611, 277...	[ 0.06683349609375, 0.1175537109375, 0.2186279296875, 0.0809326171875, 0.042633056640625, 0.2491455078125, 0.1800537109375, 0.107666015625, 0.20849609375, 0.23046875, 0.2066650390625, 0.0699462890625, 0.1925048828125, 0.25439453125, 0.00506591796875, 0.122802734375, 0.15185546875, 0....	embed
16786274_c0	16786274	prolog	0	Title: How to find facts that do not have contribution in goal Problem title: How to find facts that do not have contribution in goal Tags: code-coverage, prolog, failure-slice Problem: How to find facts that do not have contribution in goal I'm trying to write a program that can check if the student program can fulfil...	How to find facts that do not have contribution in goal How to find facts that do not have contribution in goal code-coverage prolog failure-slice How How to find facts that do not have contribution in goal I'm trying to write a program that can check if the student program can fulfill a certain goal or not. I can do t...	[ 0.017822265625, 0.024169921875, 0.006011962890625, 0.01422119140625, -0.03564453125, -0.004119873046875, -0.004119873046875, -0.013427734375, 0.00017547607421875, -0.0169677734375, -0.00136566162109375, 0.000244140625, -0.031005859375, 0.0002651214599609375, 0.00604248046875, 0.0174560...	[ 11249, 47, 7413, 15824, 7, 450, 54, 959, 765, 127752, 23, 69236, 18151, 63127, 502, 4867, 137578, 13348, 33022, 1528, 12765, 9836, 831, 211394, 2174, 20653, 70541, 51, 86, 26531, 3714, 162466, 58735, 3642, 27781, 83, 35254, 19, 9963, 1021...	[ 0.0792236328125, 0.06298828125, 0.178466796875, 0.2164306640625, 0.151611328125, 0.0794677734375, 0.105712890625, 0.194580078125, 0.140625, 0.2103271484375, 0.119140625, 0.23095703125, 0.1904296875, 0.109375, 0.1171875, 0.1683349609375, 0.191650390625, 0.1102294921875, 0.05242919...	embed
52313710_c1	52313710	prolog	1	is Elem+1, length(X, NumOfItems), foreach(I in 1..NumOfItems, get(Quantity, I, K), X[I]::0..K), /* Set up the constraint that sum of item weights must not be bigger than bag capacity / sum([X[I]T : I in 1..NumOfItems], get(Weights, I, T)) #=< Capacity, /* Maximize the values of items in the bag, and find all possibl...	is Elem+1, length(X, NumOfItems), foreach(I in 1..NumOfItems, get(Quantity, I, K), X[I]::0..K), /* Set up the constraint that sum of item weights must not be bigger than bag capacity / sum([X[I]T : I in 1..NumOfItems], get(Weights, I, T)) #=< Capacity, /* Maximize the values of items in the bag, and find all possibl...	[ -0.015380859375, 0.0260009765625, -0.006103515625, 0.01123046875, -0.0091552734375, 0.025146484375, -0.01470947265625, 0.006744384765625, 0.02587890625, -0.032958984375, 0.00347900390625, -0.004730224609375, 0.000461578369140625, -0.0020751953125, 0.0087890625, 0.0166015625, 0.019165...	[ 83, 540, 195, 21748, 140909, 1542, 52782, 132887, 2982, 7, 100, 41581, 568, 615, 316, 2046, 173495, 18, 2481, 341, 1193, 53861, 605, 19943, 1257, 158, 2816, 4288, 10554, 111, 35735, 57888, 8110, 959, 186, 167785, 6157, 177399, 618, 87, ...	[ 0.1138916015625, 0.1162109375, 0.193359375, 0.2274169921875, 0.21337890625, 0.1552734375, 0.1640625, 0.22021484375, 0.1651611328125, 0.028961181640625, 0.03045654296875, 0.138916015625, 0.09521484375, 0.047393798828125, 0.1075439453125, 0.066650390625, 0.04327392578125, 0.026580810...	embed
54486975_c0	54486975	prolog	0	Title: How to Change Package Directory in SWI-Prolog Problem title: How to Change Package Directory in SWI-Prolog Tags: swi-prolog, prolog Problem: How to Change Package Directory in SWI-Prolog I am attempting to install a package (sldnfdraw) in SWI-Prolog, but I cannot find a way to specify an installation directory (...	How to Change Package Directory in SWI-Prolog How to Change Package Directory in SWI-Prolog swi-prolog prolog How Change Package Directory SWI-Prolog pack_install HOME PREF_DIR How to Change Package Directory in SWI-Prolog I am attempting to install a package (sldnfdraw) in SWI-Prolog, but I cannot find a way to specif...	[ 0.0257568359375, 0.00970458984375, 0.01141357421875, 0.01275634765625, -0.025390625, 0.000865936279296875, -0.00054168701171875, -0.007110595703125, 0.0019683837890625, 0.0216064453125, 0.01531982421875, 0.020751953125, -0.01409912109375, -0.0021209716796875, 0.0023345947265625, 0.0054...	[ 11249, 47, 87377, 56607, 4588, 31068, 53, 23, 159, 38969, 9, 10752, 4867, 91, 2452, 3454, 502, 43824, 80383, 70060, 23096, 919, 123237, 81887, 20600, 98169, 7, 7344, 19, 420, 86905, 53418, 40140, 59720, 14364, 3444, 209806, 55076, 84434, ...	[ 0.08624267578125, 0.028839111328125, 0.2493896484375, 0.250244140625, 0.120361328125, 0.2376708984375, 0.1270751953125, 0.056304931640625, 0.07928466796875, 0.21826171875, 0.0236968994140625, 0.15625, 0.19677734375, 0.024810791015625, 0.189453125, 0.1446533203125, 0.12255859375, 0....	embed
37947697_c0	37947697	prolog	0	Title: Example channelling constraints ECLiPSe Problem title: Example channelling constraints ECLiPSe Tags: eclipse-clp, prolog, clpfd, constraint-programming, constraints Problem: Example channelling constraints ECLiPSe Can someone provide a simple example of channelling constraints? Channelling constraints are used t...	Example channelling constraints ECLiPSe Example channelling constraints ECLiPSe eclipse-clp prolog clpfd constraint-programming constraints Example ECLiPSe Example channelling constraints ECLiPSe Can someone provide a simple example of channelling constraints? Channelling constraints are used to combine viewpoints of a...	[ 0.00093841552734375, -0.0067138671875, -0.00122833251953125, 0.02783203125, 0.003875732421875, -0.00677490234375, -0.0245361328125, -0.0233154296875, -0.0159912109375, -0.047119140625, -0.00909423828125, -0.0027008056640625, -0.005767822265625, 0.029541015625, 0.0224609375, 0.005889892...	[ 89536, 8705, 86723, 2069, 158, 2816, 4288, 59947, 9506, 9059, 13, 106371, 184, 26775, 502, 4867, 39557, 71, 28966, 22691, 8781, 27781, 111, 55969, 11814, 47, 70163, 21455, 38496, 2967, 10639, 14137, 1657, 27958, 187136, 3642, 442, 43240, 15...	[ 0.14990234375, 0.0576171875, 0.248046875, 0.2066650390625, 0.153564453125, 0.2427978515625, 0.1873779296875, 0.05963134765625, 0.09661865234375, 0.0859375, 0.09130859375, 0.1400146484375, 0.053955078125, 0.08123779296875, 0.066162109375, 0.10888671875, 0.003204345703125, 0.01692199...	embed
7642491_c0	7642491	prolog	0	Title: Writing formatted text in SWI-Prolog Problem title: Writing formatted text in SWI-Prolog Tags: prolog Problem: Writing formatted text in SWI-Prolog I have spent a significant amount of time in the SWI-Prolog documentation and am getting nowhere. My desire is to be able to format numbers that are output such that...	Writing formatted text in SWI-Prolog Writing formatted text in SWI-Prolog prolog a Writing SWI-Prolog Writing formatted text in SWI-Prolog I have spent a significant amount of time in the SWI-Prolog documentation and am getting nowhere. My desire is to be able to format numbers that are output such that I am controllin...	[ 0.004180908203125, 0.0106201171875, -0.0015411376953125, 0.0024566650390625, 0.01318359375, -0.002471923828125, 0.01129150390625, -0.000553131103515625, 0.00087738037109375, 0.036376953125, 0.0098876953125, 0.00738525390625, -0.0267333984375, -0.0028076171875, 0.015380859375, -0.006713...	[ 213185, 9384, 3674, 7986, 159, 38969, 10752, 4867, 502, 209806, 136913, 104851, 19048, 101935, 140992, 6226, 2069, 3622, 468, 32380, 2749, 153939, 44116, 7108, 90795, 62816, 146984, 3164, 138, 361, 38134, 32628, 44677, 45234, 163846, 11651, 241...	[ 0.1817626953125, 0.2213134765625, 0.1070556640625, 0.1845703125, 0.04522705078125, 0.2059326171875, 0.1419677734375, 0.178955078125, 0.113037109375, 0.0953369140625, 0.01141357421875, 0.12451171875, 0.006805419921875, 0.1513671875, 0.125, 0.1522216796875, 0.0199432373046875, 0.0711...	embed
16472680_c1	16472680	prolog	1	(y/n) ?"), response(Reply), Reply='y'. symptom(Patient,body_ache) :- write("Does ",Patient," have a body_ache (y/n) ?"), response(Reply), Reply='y'. symptom(Patient,chills) :- write("Does ",Patient," have a chills (y/n) ?"), response(Reply), Reply='y'. symptom(Patient,sore_throat) :- write("Does ",Patient," have a sor...	(y/n) ?"), response(Reply), Reply='y'. symptom(Patient,body_ache) :- write("Does ",Patient," have a body_ache (y/n) ?"), response(Reply), Reply='y'. symptom(Patient,chills) :- write("Does ",Patient," have a chills (y/n) ?"), response(Reply), Reply='y'. symptom(Patient,sore_throat) :- write("Does ",Patient," have a sor...	[ 0.006622314453125, -0.000025391578674316406, 0.0250244140625, 0.01153564453125, -0.01165771484375, 0.0240478515625, -0.0146484375, 0.006256103515625, -0.01275634765625, -0.027099609375, 0.001739501953125, 0.00933837890625, -0.01129150390625, -0.00390625, 0.00634765625, 0.00503540039062...	[ 53, 64, 19, 705, 74054, 57553, 62479, 122813, 5, 128668, 8335, 118, 2517, 4, 37873, 46994, 15772, 33022, 8331, 90, 765, 10, 14361, 1861, 42458, 149031, 46797, 42294, 257, 127124, 86, 1255, 214, 34614, 3613, 177, 15534, 112141, 8405, 17093...	[ 0.1357421875, 0.1650390625, 0.09423828125, 0.0660400390625, 0.01739501953125, 0.1893310546875, 0.1800537109375, 0.210693359375, 0.0179901123046875, 0.2479248046875, 0.0697021484375, 0.1500244140625, 0.1104736328125, 0.012542724609375, 0.15087890625, 0.2274169921875, 0.049407958984375...	embed
29167342_c0	29167342	prolog	0	Title: Prolog http get request with request headers Problem title: Prolog http get request with request headers Tags: json, prolog, swi-prolog Problem: Prolog http get request with request headers I trying to do a http get request with request headers with prolog but I can't find out how to do it exacly. Here's an exam...	Prolog http get request with request headers Prolog http get request with request headers json prolog swi-prolog Prolog unirest.get poker.p.mashape.com index.php X-Mashape-Key Accept player_cards winning_hands Players HREF http_get Json Prolog http get request with request headers I trying to do a http get request with...	[ -0.015380859375, 0.008056640625, 0.02734375, -0.005462646484375, -0.00008296966552734375, -0.0076904296875, -0.014892578125, 0.01409912109375, -0.01007080078125, -0.0537109375, 0.037841796875, 0.018798828125, -0.039306640625, -0.0107421875, 0.01422119140625, -0.008544921875, 0.005889...	[ 1250, 4867, 1621, 2046, 50336, 678, 10336, 1314, 1647, 1681, 502, 2452, 3454, 525, 3794, 25600, 53347, 63262, 3958, 1193, 2420, 1081, 162429, 111383, 58585, 38931, 69986, 12336, 60560, 22439, 28482, 821, 54, 2263, 27781, 145581, 57553, 33342,...	[ 0.1641845703125, 0.2442626953125, 0.1968994140625, 0.151611328125, 0.228515625, 0.1192626953125, 0.1844482421875, 0.1331787109375, 0.07965087890625, 0.1995849609375, 0.146484375, 0.1131591796875, 0.0989990234375, 0.1510009765625, 0.0970458984375, 0.17236328125, 0.15283203125, 0.029...	embed
73903703_c0	73903703	prolog	0	Title: How to check how many elements you've already consumed in Prolog DCGs Problem title: How to check how many elements you've already consumed in Prolog DCGs Tags: prolog, dcg Problem: How to check how many elements you've already consumed in Prolog DCGs Say I have these DCGs: zorbs([H\|T]) --> zorb(H), zo...	How to check how many elements you've already consumed in Prolog DCGs How to check how many elements you've already consumed in Prolog DCGs prolog dcg How Prolog DCGs How to check how many elements you've already consumed in Prolog DCGs Say I have these DCGs: I can do this: I can also "reverse" this by doing:...	[ -0.00124359130859375, 0.0111083984375, -0.0014495849609375, 0.0262451171875, -0.0244140625, 0.01226806640625, -0.00077056884765625, 0.00445556640625, 0.0224609375, -0.034423828125, -0.01104736328125, 0.00180816650390625, 0.0181884765625, -0.010009765625, 0.018310546875, 0.0120239257812...	[ 11249, 47, 12765, 3642, 5941, 80854, 398, 3768, 272, 21771, 18588, 297, 23, 1250, 4867, 391, 56367, 7, 502, 104, 238, 177, 765, 6097, 831, 54, 903, 107, 37676, 3444, 7413, 5303, 101935, 678, 140909, 40715, 201, 27781, 2500, 30646, 10588...	[ 0.03759765625, 0.0195465087890625, 0.23046875, 0.1131591796875, 0.1639404296875, 0.23095703125, 0.06182861328125, 0.034698486328125, 0.125, 0.2054443359375, 0.2144775390625, 0.1373291015625, 0.0943603515625, 0.180419921875, 0.24072265625, 0.1119384765625, 0.2032470703125, 0.078125,...	embed
15855932_c1	15855932	prolog	1	be a permutation of the list: [1,2,3,4,5,6,7,8] in wich every element rappresent the Y coordinate of a queen. so in this case I am rappresenting a queen position only by its Y coordinate (its row index) So I have the solution relation than say that a list Queens is a solution if Queens is a premutation of [1,2,3,4,5,6...	be a permutation of the list: [1,2,3,4,5,6,7,8] in wich every element rappresent the Y coordinate of a queen. so in this case I am rappresenting a queen position only by its Y coordinate (its row index) So I have the solution relation than say that a list Queens is a solution if Queens is a premutation of [1,2,3,4,5,6...	[ 0.0015106201171875, 0.017578125, 0.032470703125, 0.01275634765625, 0.000797271728515625, -0.0084228515625, -0.01104736328125, -0.01513671875, 0.021484375, 0.0026702880859375, 0.005035400390625, 0.0157470703125, -0.0068359375, 0.003997802734375, -0.0255126953125, 0.0128173828125, -0.0...	[ 186, 117, 561, 22062, 5303, 133063, 82449, 104629, 136005, 69696, 11907, 12830, 29892, 55247, 990, 176866, 13, 41, 33, 19069, 4734, 390, 15555, 63262, 29806, 41911, 44109, 7, 83, 10, 479, 7311, 46002, 104643, 52875, 27060, 34735, 61924, 364...	[ 0.06744384765625, 0.076904296875, 0.1522216796875, 0.08489990234375, 0.205322265625, 0.08740234375, 0.1793212890625, 0.1763916015625, 0.1605224609375, 0.003692626953125, 0.058013916015625, 0.11865234375, 0.13037109375, 0.1981201171875, 0.1182861328125, 0.1854248046875, 0.020309448242...	embed
28000773_c0	28000773	prolog	0	Title: Logical purity of when/2 and ground/1 Problem title: Logical purity of when/2 and ground/1 Tags: logical-purity, prolog Problem: Logical purity of when/2 and ground/1 The question I have a question related to logical purity. Is this program pure? when(ground(X), X > 2). Some [ir]relevant details about the contex...	Logical purity of when/2 and ground/1 Logical purity of when/2 and ground/1 logical-purity prolog Logical list_length Tail use_module set_prolog_flag clpfd_monotonic Logical purity of when/2 and ground/1 The question I have a question related to logical purity. Is this program pure? Some [ir]relevant details about the ...	[ -0.0133056640625, 0.036376953125, 0.01080322265625, 0.00799560546875, -0.00130462646484375, 0.0201416015625, 0.009521484375, 0.0098876953125, 0.00958251953125, -0.0341796875, 0.01312255859375, 0.0029144287109375, -0.0208740234375, -0.0093994140625, 0.00982666015625, 0.01361083984375, ...	[ 13146, 21533, 7398, 2481, 111, 3229, 12477, 136, 61585, 11583, 62775, 289, 4717, 502, 4867, 5303, 23986, 1218, 379, 4527, 83279, 5423, 3454, 190872, 33139, 39557, 71, 64176, 188, 9655, 2071, 903, 1528, 34166, 169429, 41653, 43701, 31577, 33...	[ 0.2198486328125, 0.1396484375, 0.2318115234375, 0.162841796875, 0.04351806640625, 0.1484375, 0.1917724609375, 0.04974365234375, 0.1610107421875, 0.16796875, 0.254638671875, 0.14208984375, 0.1788330078125, 0.1190185546875, 0.1630859375, 0.1671142578125, 0.08270263671875, 0.087829589...	embed
41321251_c0	41321251	prolog	0	Title: Query prolog with PHP Problem title: Query prolog with PHP Tags: swi-prolog, php, prolog Problem: Query prolog with PHP I am trying to make a sudoku game with PHP and prolog, the idea is to use prolog program to solve the sudoku then get the results via PHP, I have write this code down but I'm getting a empty ou...	Query prolog with PHP Query prolog with PHP swi-prolog php prolog Query PHP var_dump DOCTYPE www.w3.org Content-Type utf-8 Soduku style.css Program Files x86 swipl-win.exe test.pl print_r return_var Query prolog with PHP I am trying to make a sudoku game with PHP and prolog, the idea is to use prolog program to solve t...	[ 0.022705078125, 0.01153564453125, 0.0015106201171875, 0.0096435546875, -0.00958251953125, 0.017578125, -0.0137939453125, -0.003997802734375, -0.01165771484375, -0.057861328125, 0.02783203125, 0.0189208984375, -0.02978515625, 0.0033111572265625, -0.00738525390625, 0.01116943359375, 0....	[ 58836, 53, 502, 4867, 678, 47302, 2452, 3454, 3958, 285, 693, 2676, 120959, 27143, 434, 363, 1478, 70870, 196707, 17376, 1061, 319, 20623, 4439, 7663, 42724, 15276, 2424, 9494, 46480, 3034, 28412, 42, 30646, 1961, 31577, 8932, 38067, 6712, ...	[ 0.1746826171875, 0.0679931640625, 0.167724609375, 0.240234375, 0.1099853515625, 0.26318359375, 0.1328125, 0.1578369140625, 0.1973876953125, 0.1103515625, 0.099365234375, 0.14453125, 0.0537109375, 0.0965576171875, 0.01202392578125, 0.0848388671875, 0.056976318359375, 0.0809326171875...	embed
4089916_c0	4089916	prolog	0	Title: handling relations in prolog Problem title: handling relations in prolog Tags: prolog Problem: handling relations in prolog rel(X,Y) :- dep(X,Y). rel(X,Y) :- aux(X,Y). rel(X,Y) :- auxpass(X,Y). rel(X,Y) :- cop(X,Y). rel(X,Y) :- conj(X,Y). rel(X,Y) :- cc(X,Y). rel(X,Y) :- arg(X,Y). rel(X,Y) :- subj(X,Y). rel(X,Y)...	handling relations in prolog handling relations in prolog prolog agent1 ref1 handling relations in prolog but in the last relation i want the first "rel" to be different from the next "rel" how to check if they are distinct.. please help	[ -0.007537841796875, -0.01031494140625, 0.01043701171875, 0.011474609375, -0.01129150390625, -0.01324462890625, -0.0032958984375, -0.0093994140625, 0.01275634765625, -0.0556640625, 0.00775146484375, -0.0006561279296875, -0.0167236328125, -0.00958251953125, 0.0206298828125, 0.00805664062...	[ 45064, 91582, 23, 502, 4867, 23882, 18831, 4568, 41911, 3444, 5117, 7962, 186, 12921, 1295, 11737, 12765, 2174, 1836, 621, 117781, 4358 ]	[ 0.193115234375, 0.242919921875, 0.03558349609375, 0.13720703125, 0.2275390625, 0.12371826171875, 0.11798095703125, 0.130615234375, 0.1934814453125, 0.063720703125, 0.06640625, 0.2303466796875, 0.04205322265625, 0.171875, 0.020843505859375, 0.0867919921875, 0.1748046875, 0.056732177...	embed
37209489_c0	37209489	prolog	0	Title: ERROR: Type error: `file_path' expected, found `_G409' (a var) Problem title: ERROR: Type error: `file_path' expected, found `_G409' (a var) Tags: prolog Problem: ERROR: Type error: `file_path' expected, found `_G409' (a var) I have a problem with my Prolog Program. It is designed to assign w...	ERROR: Type error: `file_path' expected, found `_G409' (a var) ERROR: Type error: `file_path' expected, found `_G409' (a var) prolog ERROR Type file_path _G409 source_sink Nqrrroah Nqblubh Nqflua Nqdwingi Nqlhalha Ukahama Mhboa Sharabrab Falup is_set List ERROR: Type error: `file_path' expected, fou...	[ 0.0196533203125, 0.0203857421875, -0.00823974609375, 0.002777099609375, -0.003936767578125, 0.0067138671875, -0.02001953125, 0.00811767578125, -0.006622314453125, -0.019775390625, 0.0220947265625, -0.0126953125, -0.0025482177734375, -0.01190185546875, 0.0262451171875, 0.000295639038085...	[ 151206, 24638, 60457, 18499, 29822, 128405, 3768, 84751, 14037, 724, 2839, 1126, 11, 285, 502, 4867, 11435, 31344, 7, 14068, 18304, 1366, 47491, 5871, 18026, 22242, 99247, 4200, 528, 72883, 76027, 16977, 22225, 2037, 83, 3509, 32036, 2967, ...	[ 0.14208984375, 0.100830078125, 0.1876220703125, 0.1893310546875, 0.1846923828125, 0.1982421875, 0.1397705078125, 0.2200927734375, 0.110107421875, 0.06964111328125, 0.1865234375, 0.22216796875, 0.0740966796875, 0.20654296875, 0.1553955078125, 0.2666015625, 0.1441650390625, 0.1527099...	embed
57316321_c0	57316321	prolog	0	Title: How to catch exception to backtrack(or Delimited Continuations) in Prolog? Problem title: How to catch exception to backtrack(or Delimited Continuations) in Prolog? Tags: prolog Problem: How to catch exception to backtrack(or Delimited Continuations) in Prolog? I'm new to Prolog and trying to know some example f...	How to catch exception to backtrack(or Delimited Continuations) in Prolog? How to catch exception to backtrack(or Delimited Continuations) in Prolog? prolog typeError How Delimited Continuations Prolog Err _Context type_error _12488 How to catch exception to backtrack(or Delimited Continuations) in Prolog? I'm new to P...	[ 0.00262451171875, 0.0272216796875, 0.01043701171875, 0.0045166015625, -0.01031494140625, -0.005584716796875, 0.01055908203125, 0.0115966796875, -0.001068115234375, -0.03125, -0.0089111328125, -0.01116943359375, 0, 0.00001537799835205078, 0.037841796875, -0.01556396484375, 0.002716064...	[ 11249, 105556, 131527, 4420, 125728, 262, 93343, 50343, 5256, 1250, 4867, 47, 502, 10644, 18468, 297, 1004, 22829, 188800, 161414, 748, 23, 27781, 18113, 18151, 11675, 2452, 3454, 1019, 170179, 759, 5612, 2424, 75463, 75101, 31611, 1193, 2203...	[ 0.03643798828125, 0.184814453125, 0.2379150390625, 0.1773681640625, 0.280029296875, 0.0706787109375, 0.2100830078125, 0.1944580078125, 0.03515625, 0.1488037109375, 0.2181396484375, 0.049591064453125, 0.0787353515625, 0.152587890625, 0.0869140625, 0.00982666015625, 0.071044921875, 0...	embed
22466520_c0	22466520	prolog	0	Title: Prolog Query Exercise - Beginner Problem title: Prolog Query Exercise - Beginner Tags: prolog Problem: Prolog Query Exercise - Beginner I'm a begginer at Prolog and I need some help with this exercise, this is the knowledge base provided: album(‘R. Stevie Moore’, ‘Manuscription’). album(‘Lane Steinberg’, ‘Manusc...	Prolog Query Exercise - Beginner Prolog Query Exercise - Beginner prolog Prolog Query Exercise Beginner Stevie Moore Manuscription Lane Steinberg Yung Show Yukio Jessie Evans Autonervous Bettina Koster Lucia Pamela Walkin Shooby Taylor Human Horn Tiny Tim God Bless Legendary Stardust Cowboy Rock-It Stardom Walking Moon...	[ 0.01019287109375, 0.0274658203125, 0.001312255859375, 0.031005859375, -0.005401611328125, 0.01373291015625, -0.021728515625, -0.00482177734375, 0.0011138916015625, -0.049560546875, -0.0216064453125, -0.0203857421875, 0.007080078125, 0.0245361328125, -0.026123046875, 0.028076171875, 0...	[ 1250, 4867, 58836, 53, 155534, 184, 20, 67053, 56, 502, 8694, 15959, 119303, 58916, 59478, 239, 86, 27822, 4969, 990, 1619, 17367, 109402, 846, 117361, 478, 122841, 4396, 1679, 13048, 6300, 5516, 1204, 1515, 133556, 1342, 54950, 115059, 73,...	[ 0.2091064453125, 0.30810546875, 0.268798828125, 0.1414794921875, 0.1995849609375, 0.09619140625, 0.00665283203125, 0.1702880859375, 0.14404296875, 0.1219482421875, 0.107421875, 0.215087890625, 0.22607421875, 0.1053466796875, 0.1962890625, 0.1029052734375, 0.1156005859375, 0.0986328...	embed
65722678_c0	65722678	prolog	0	Title: solving kakuro in prolog using predicate Problem title: solving kakuro in prolog using predicate Tags: prolog Problem: solving kakuro in prolog using predicate I want to predicate solve Kakuro. My kakuro is this I have to create a predicate using the word solve (solve/1) for the game kakuro. I tried 3-4 codes an...	solving kakuro in prolog using predicate solving kakuro in prolog using predicate prolog predicate use_module all_different B-C F-J-N G-K-O F-G K-L O-P sum_list Head Tail Sum Sum1 Vars solving kakuro in prolog using predicate I want to predicate solve Kakuro. My kakuro is this I have to create a predicate using the wor...	[ 0.00086212158203125, -0.0107421875, 0.006072998046875, 0.00482177734375, -0.0189208984375, -0.0081787109375, -0.03076171875, 0.0223388671875, 0.003570556640625, -0.006134033203125, -0.0032806396484375, -0.004180908203125, 0.0181884765625, 0.005889892578125, 0.01318359375, 0.01574707031...	[ 3115, 6496, 18795, 11951, 23, 502, 4867, 17368, 1653, 2063, 67, 4527, 83279, 756, 238778, 335, 9, 605, 670, 10554, 6562, 44816, 1218, 36335, 3323, 3444, 86869, 40497, 903, 28282, 2565, 86918, 11583, 6712, 37842, 20444, 18151, 18499, 77336, ...	[ 0.13818359375, 0.09814453125, 0.14599609375, 0.289794921875, 0.055938720703125, 0.1636962890625, 0.2061767578125, 0.0924072265625, 0.1827392578125, 0.2257080078125, 0.1007080078125, 0.071044921875, 0.1019287109375, 0.07489013671875, 0.20458984375, 0.0163726806640625, 0.01254272460937...	embed
61550755_c0	61550755	prolog	0	Title: Block world problem search runs out of stack space Problem title: Block world problem search runs out of stack space Tags: search, iterative-deepening, prolog Problem: Block world problem search runs out of stack space I have the following code: move(state(on(X, NewX), OldY, Z), state(NewX, on(X, OldY), Z)). mov...	Block world problem search runs out of stack space Block world problem search runs out of stack space search iterative-deepening prolog Block NewX OldY OldZ OldX NewY NewZ Block world problem search runs out of stack space I have the following code: Where move give us the possible movements that you can use and path sh...	[ 0.0191650390625, 0.007232666015625, 0.007720947265625, 0.01806640625, -0.0028533935546875, 0.00750732421875, -0.00390625, 0.00347900390625, 0.02197265625, -0.052734375, 0.01214599609375, 0.0059814453125, 0.0022125244140625, 0.000530242919921875, 0.007080078125, 0.0030670166015625, 0....	[ 80231, 8999, 2967, 33938, 127877, 1810, 111, 177261, 32628, 720, 45023, 123041, 33, 502, 4867, 2356, 1542, 25074, 1723, 1511, 25632, 18151, 78662, 25813, 8337, 7722, 112664, 831, 4527, 60875, 5608, 5646, 1295, 1193, 47, 990, 1653, 2063, 67,...	[ 0.183837890625, 0.1270751953125, 0.1820068359375, 0.21923828125, 0.07666015625, 0.1729736328125, 0.203125, 0.2230224609375, 0.2088623046875, 0.1199951171875, 0.069580078125, 0.04205322265625, 0.06573486328125, 0.1217041015625, 0.150146484375, 0.06781005859375, 0.107177734375, 0.088...	embed
55529533_c0	55529533	prolog	0	Title: Prolog CLP(FD) Number of items in result Problem title: Prolog CLP(FD) Number of items in result Tags: clpfd, constraint-programming, prolog Problem: Prolog CLP(FD) Number of items in result include(=(1),Vars,I1),length(I1, SUM_1), include(=(2),Vars,I2),length(I2, SUM_2), include(=(3),Vars,I3),length(I3, SUM_3),...	Prolog CLP(FD) Number of items in result Prolog CLP(FD) Number of items in result clpfd constraint-programming prolog Prolog CLP Number D1_D1 D1_D2 D1_N1 D1_N2 D1_A0 D2_D1 D2_D2 D2_N1 D2_N2 D2_A0 D3_D1 D3_D2 D3_N1 D3_N2 D3_A0 D4_D1 D4_D2 D4_N1 D4_N2 D4_A0 D5_D1 D5_D2 D5_N1 D5_N2 D5_A0 D6_D1 D6_D2 D6_N1 D6_N2 D6_A0 D7_D...	[ -0.004119873046875, -0.0021514892578125, 0.00164031982421875, 0.00787353515625, -0.00823974609375, -0.0172119140625, -0.0201416015625, 0.005157470703125, 0.01031494140625, -0.03759765625, -0.01025390625, -0.033935546875, 0.01123046875, 0.0277099609375, 0.0029754638671875, 0.00848388671...	[ 1250, 4867, 37352, 98553, 103332, 111, 55769, 23, 16750, 313, 33139, 39557, 71, 158, 2816, 4288, 28966, 502, 391, 418, 397, 127944, 115187, 363, 910, 3323, 36335, 756, 46295, 38893, 9624, 839, 3115, 5094, 15246, 2069, 2967, 4785, 179933, ...	[ 0.1470947265625, 0.2308349609375, 0.203857421875, 0.158203125, 0.1370849609375, 0.016387939453125, 0.240478515625, 0.108642578125, 0.267822265625, 0.01336669921875, 0.009368896484375, 0.026153564453125, 0.0599365234375, 0.085205078125, 0.17529296875, 0.1373291015625, 0.08905029296875...	embed
15346729_c0	15346729	prolog	0	Title: Guidance with writing Prolog rule Problem title: Guidance with writing Prolog rule Tags: prolog, rule Problem: Guidance with writing Prolog rule I am in my initial phase of writing code in Prolog and am still trying wrap my head around the paradigm so please pardon the primitiveness of this question. I read in W...	Guidance with writing Prolog rule Guidance with writing Prolog rule prolog rule Guidance Prolog Head Body gate_type SIG terminal_type Guidance with writing Prolog rule I am in my initial phase of writing code in Prolog and am still trying wrap my head around the paradigm so please pardon the primitiveness of this quest...	[ 0.03759765625, 0.01531982421875, -0.005279541015625, 0.01025390625, -0.0034942626953125, 0.0159912109375, -0.005889892578125, -0.0042724609375, 0.021240234375, -0.0263671875, 0.00408935546875, -0.01708984375, -0.007110595703125, 0.0125732421875, 0.020263671875, -0.00860595703125, 0.0...	[ 53513, 549, 678, 32562, 1250, 4867, 79986, 502, 44816, 43960, 70836, 50986, 159, 31343, 33949, 93402, 18151, 137565, 10336, 214709, 128489, 8162, 8781, 51359, 3647, 40226, 32354, 4317, 3137, 606, 820, 31577, 28282, 25632, 54397, 903, 44961, 3...	[ 0.1209716796875, 0.1190185546875, 0.048004150390625, 0.1552734375, 0.14990234375, 0.214111328125, 0.1824951171875, 0.077880859375, 0.119873046875, 0.1363525390625, 0.1640625, 0.17138671875, 0.048858642578125, 0.177734375, 0.226318359375, 0.03167724609375, 0.08868408203125, 0.001556...	embed
53934948_c0	53934948	prolog	0	Title: Group facts in prolog by 3 variables Problem title: Group facts in prolog by 3 variables Tags: prolog, grouping Problem: Group facts in prolog by 3 variables I'm having troubles grouping some facts in prolog by 3 different properties. This is my knownledge base (a graph basically): % entity(Label, Id) % relation...	Group facts in prolog by 3 variables Group facts in prolog by 3 variables prolog grouping Group Label Type Subject Object Person id_0 Place Places Some Other group_relationships_by_node group_by_relationships Result Group facts in prolog by 3 variables I'm having troubles grouping some facts in prolog by 3 different pr...	[ 0.031982421875, -0.0086669921875, 0.00124359130859375, -0.004913330078125, -0.0130615234375, 0.003936767578125, -0.02392578125, 0.002716064453125, 0.018798828125, -0.01495361328125, -0.00927734375, 0.01239013671875, -0.0115966796875, -0.03125, -0.003875732421875, 0.0279541015625, -0....	[ 10760, 15824, 7, 502, 4867, 390, 138, 77336, 21115, 129214, 60457, 94341, 134549, 15270, 41076, 107, 57860, 16070, 1272, 157, 126684, 63134, 214, 12921, 183871, 51529, 181606, 3647, 41382, 198343, 36663, 151618, 12638, 77630, 3447, 28368, 10644...	[ 0.2342529296875, 0.2110595703125, 0.0149383544921875, 0.15478515625, 0.2203369140625, 0.0843505859375, 0.1925048828125, 0.2391357421875, 0.2459716796875, 0.1483154296875, 0.1036376953125, 0.1282958984375, 0.148681640625, 0.04620361328125, 0.057281494140625, 0.03118896484375, 0.127929...	embed
23716331_c1	23716331	prolog	1	Count, X #= A / P, Y #= B / P, xor_1bit_values(X, Y, Tmp), NewSum #= Sum + P*Tmp, NewCount is Count - 1, xor_number(A, B, Result, NewCount, NewSum). Sample input and output: ?- time(xor_number(123456789, 987654321, R, 32)). % 943 inferences, 0.000 CPU in 0.001 seconds (0% CPU, Infinite Lips) R = 1032168868 Now, this is...	Count, X #= A / P, Y #= B / P, xor_1bit_values(X, Y, Tmp), NewSum #= Sum + P*Tmp, NewCount is Count - 1, xor_number(A, B, Result, NewCount, NewSum). Sample input and output: ?- time(xor_number(123456789, 987654321, R, 32)). % 943 inferences, 0.000 CPU in 0.001 seconds (0% CPU, Infinite Lips) R = 1032168868 Now, this is...	[ -0.004119873046875, -0.000507354736328125, 0.00153350830078125, 0.002288818359375, -0.0164794921875, 0.0126953125, -0.0230712890625, -0.0030517578125, 0.021240234375, 0.00119781494140625, -0.000545501708984375, 0.0003719329833984375, 0.0074462890625, 0.00970458984375, 0.024169921875, -...	[ 108210, 1193, 468, 1369, 62, 248, 436, 990, 335, 74706, 115187, 3137, 27494, 1542, 4, 2676, 2356, 294, 316, 36335, 997, 1639, 83, 20, 106, 2606, 1297, 284, 126684, 947, 33209, 107730, 136, 140992, 705, 9, 1733, 94240, 454, 190875, 13683...	[ 0.2646484375, 0.1668701171875, 0.07659912109375, 0.03717041015625, 0.09124755859375, 0.09503173828125, 0.07080078125, 0.09405517578125, 0.1290283203125, 0.2376708984375, 0.0171661376953125, 0.1922607421875, 0.1490478515625, 0.0455322265625, 0.01226806640625, 0.1749267578125, 0.150390...	embed
59638407_c0	59638407	prolog	0	Title: How to delete every second occurence of an element in a nested list - PROLOG Problem title: How to delete every second occurence of an element in a nested list - PROLOG Tags: prolog Problem: How to delete every second occurence of an element in a nested list - PROLOG Suppose I have a list like [1,[2,1,[2],[3,1,1...	How to delete every second occurence of an element in a nested list - PROLOG How to delete every second occurence of an element in a nested list - PROLOG prolog How PROLOG delete_second_occurrence is_list How to delete every second occurence of an element in a nested list - PROLOG Suppose I have a list like [1,[2,1,[2]...	[ -0.01708984375, 0.034912109375, -0.00164031982421875, 0.00086212158203125, 0.0103759765625, 0.03271484375, 0.001312255859375, -0.00775146484375, 0.0240478515625, -0.035400390625, 0.01239013671875, -0.020263671875, 0.011962890625, -0.01336669921875, 0.015869140625, 0.01507568359375, 0...	[ 11249, 47, 154109, 11907, 17932, 74918, 6620, 12830, 8512, 71, 5303, 10514, 47510, 502, 4867, 191633, 6652, 64240, 83, 6562, 23, 304, 418, 363, 54968, 3444, 42, 1295, 31805, 17306, 40383, 627, 660, 339, 107730, 1193, 186, 184750, 20028, 1...	[ 0.049285888671875, 0.01904296875, 0.2376708984375, 0.1639404296875, 0.233642578125, 0.1937255859375, 0.120849609375, 0.1795654296875, 0.2359619140625, 0.1270751953125, 0.1885986328125, 0.135009765625, 0.2021484375, 0.055267333984375, 0.1190185546875, 0.22021484375, 0.10498046875, 0...	embed
44350667_c0	44350667	prolog	0	Title: Mutually referential Prolog rules in family tree Problem title: Mutually referential Prolog rules in family tree Tags: prolog Problem: Mutually referential Prolog rules in family tree I've seen various implementations of family trees in Prolog, but I haven't found one that does what I would like to do, which is ...	Mutually referential Prolog rules in family tree Mutually referential Prolog rules in family tree prolog Mutually Prolog Mutually referential Prolog rules in family tree I've seen various implementations of family trees in Prolog, but I haven't found one that does what I would like to do, which is to define child and p...	[ 0.031005859375, -0.002227783203125, 0.010498046875, 0.00750732421875, -0.0031280517578125, 0.0026092529296875, 0.0005035400390625, 0.0177001953125, 0.00482177734375, -0.051025390625, -0.00909423828125, -0.0018310546875, -0.0189208984375, 0.0205078125, 0.044189453125, 0.0087890625, 0....	[ 174948, 25958, 15005, 80973, 1250, 4867, 91736, 14449, 53201, 502, 51592, 208124, 1360, 90, 1884, 61924, 29041, 136, 49129, 390, 2852, 12638, 3789, 3444, 68018, 15824, 83, 22008, 28090, 19048, 26458, 2750, 621, 27863, 20020, 81887, 552, 6238,...	[ 0.113037109375, 0.08587646484375, 0.205078125, 0.1231689453125, 0.1317138671875, 0.228515625, 0.173095703125, 0.1217041015625, 0.222412109375, 0.1072998046875, 0.0182952880859375, 0.10693359375, 0.1995849609375, 0.048736572265625, 0.05450439453125, 0.19140625, 0.198486328125, 0.163...	embed
32909397_c0	32909397	prolog	0	Title: Prolog: Symmetric Rules Problem title: Prolog: Symmetric Rules Tags: logic-programming, prolog Problem: Prolog: Symmetric Rules I'm following a Prolog tutorial that asks to define a symmetric relation. Say for instance you have the following fact in the knowledge base: colleague(john,bob). You also want colleagu...	Prolog: Symmetric Rules Prolog: Symmetric Rules logic-programming prolog Prolog Symmetric Rules Prolog: Symmetric Rules I'm following a Prolog tutorial that asks to define a symmetric relation. Say for instance you have the following fact in the knowledge base: You also want colleague(bob,john) to be true, and likewise...	[ 0.010009765625, 0.01153564453125, 0.0159912109375, 0.00872802734375, 0.011474609375, 0.00665283203125, -0.017333984375, 0.0087890625, 0.011474609375, -0.043212890625, -0.0162353515625, 0.002105712890625, -0.0174560546875, 0.0011749267578125, 0.024169921875, 0.0034027099609375, 0.0027...	[ 1250, 4867, 4843, 39, 186518, 139118, 62775, 28966, 502, 25632, 57143, 61924, 230612, 238, 41911, 15824, 51359, 3647, 2843, 3444, 62975, 11, 6261, 837, 275, 66159, 29568, 100, 756, 4527, 79986, 37348, 17368, 41, 1294, 28219, 15400, 123087, ...	[ 0.115478515625, 0.20947265625, 0.05255126953125, 0.06597900390625, 0.1602783203125, 0.17919921875, 0.0352783203125, 0.04132080078125, 0.05035400390625, 0.12646484375, 0.1754150390625, 0.1162109375, 0.2568359375, 0.0750732421875, 0.176513671875, 0.1356201171875, 0.0867919921875, 0.1...	embed
37705419_c0	37705419	prolog	0	Title: Prolog check if list is part of a sequence Problem title: Prolog check if list is part of a sequence Tags: list, sequence, prolog Problem: Prolog check if list is part of a sequence My task is to define a predicate which checks if a given list is a part of a sequence. The predicate has three members. The first t...	Prolog check if list is part of a sequence Prolog check if list is part of a sequence list sequence prolog Prolog LenA LenB1 LenC LenC1 Prolog check if list is part of a sequence My task is to define a predicate which checks if a given list is a part of a sequence. The predicate has three members. The first two lists a...	[ 0.00634765625, 0.00787353515625, -0.0019378662109375, 0.0172119140625, -0.006072998046875, -0.00823974609375, -0.001617431640625, 0.02734375, 0.030029296875, -0.0079345703125, 0.0101318359375, 0.037353515625, -0.0108642578125, 0.015380859375, 0.01806640625, -0.00830078125, 0.01818847...	[ 1250, 4867, 12765, 2174, 5303, 83, 2831, 111, 40, 944, 3956, 502, 18226, 284, 441, 66211, 61924, 1653, 2063, 67, 17262, 43032, 5117, 6626, 86595, 12830, 997, 4958, 757, 4460, 33, 39531, 5281, 50960, 10750, 27781, 89536, 339, 418, 304, 3...	[ 0.149169921875, 0.22021484375, 0.155029296875, 0.087158203125, 0.227294921875, 0.06658935546875, 0.182861328125, 0.0914306640625, 0.0826416015625, 0.1591796875, 0.07421875, 0.1187744140625, 0.10736083984375, 0.047821044921875, 0.01336669921875, 0.05499267578125, 0.045989990234375, ...	embed
68058584_c1	68058584	prolog	1	(Others,L4,L3). int_0_100(N):- N >= 0, N =< 100. same_length([],[]). same_length([_\|Others1],[_\|Others2]):- same_length(Others1,Others2). I guess that the problem is that I instantiate a L4 list that can't change in the shuffle predicate. Now my colleague's solution: arrange(L1,L2,Diff):- same_length(L1,L2), shuffle(L1...	(Others,L4,L3). int_0_100(N):- N >= 0, N =< 100. same_length([],[]). same_length([_\|Others1],[_\|Others2]):- same_length(Others1,Others2). I guess that the problem is that I instantiate a L4 list that can't change in the shuffle predicate. Now my colleague's solution: arrange(L1,L2,Diff):- same_length(L1,L2), shuffle(L1...	[ -0.01129150390625, 0.02294921875, 0.01171875, -0.010986328125, -0.01458740234375, -0.0194091796875, -0.0247802734375, -0.006927490234375, 0.0198974609375, -0.0172119140625, 0.0025787353515625, 0.026611328125, 0.01214599609375, 0.0206298828125, -0.000308990478515625, -0.004150390625, ...	[ 670, 9319, 7, 866, 617, 21320, 23, 18, 2389, 3559, 839, 541, 977, 757, 16093, 805, 5701, 23986, 76172, 90173, 10461, 2967, 34648, 101426, 339, 5303, 831, 15549, 170052, 1653, 2063, 67, 62975, 6261, 29806, 137356, 418, 304, 32920, 2816, ...	[ 0.0823974609375, 0.1820068359375, 0.050537109375, 0.099365234375, 0.2054443359375, 0.1497802734375, 0.058135986328125, 0.05279541015625, 0.039794921875, 0.174072265625, 0.057159423828125, 0.09326171875, 0.00213623046875, 0.08343505859375, 0.0296173095703125, 0.15625, 0.15576171875, ...	embed
73176041_c0	73176041	prolog	0	Title: SWI-Prolog: Looking for some predicate which reduces a set in some generator set for some invariant predicate? Problem title: SWI-Prolog: Looking for some predicate which reduces a set in some generator set for some invariant predicate? Tags: invariants, prolog Problem: SWI-Prolog: Looking for some predicate whi...	SWI-Prolog: Looking for some predicate which reduces a set in some generator set for some invariant predicate? SWI-Prolog: Looking for some predicate which reduces a set in some generator set for some invariant predicate? invariants prolog SWI-Prolog Looking generator1_inv Inv ListOut ListIn Order SWI-Prolog: Looking f...	[ -0.00958251953125, -0.01068115234375, 0.0245361328125, -0.0007171630859375, -0.00159454345703125, -0.00139617919921875, -0.0185546875, -0.000926971435546875, 0.0091552734375, -0.021240234375, 0.018798828125, 0.037841796875, -0.002227783203125, 0.000732421875, 0.0087890625, 0.0004501342...	[ 159, 38969, 9, 10752, 4867, 157268, 100, 1653, 2063, 67, 34390, 5423, 145823, 23, 162591, 502, 418, 73, 334, 360, 32036, 79858, 4153, 81206, 16487, 19048, 96760, 171859, 997, 11, 5303, 154663, 3173, 508, 964, 3934, 117781, 43032, 275, 327...	[ 0.043365478515625, 0.226806640625, 0.01580810546875, 0.117431640625, 0.1597900390625, 0.1309814453125, 0.055694580078125, 0.145263671875, 0.1605224609375, 0.0416259765625, 0.1953125, 0.1287841796875, 0.248779296875, 0.0855712890625, 0.245361328125, 0.1015625, 0.047027587890625, 0.1...	embed
20688099_c1	20688099	prolog	1	case 3 (Lb) . . . . . 1 2 2 . ---> offset = 5 (La) 0 1 1 1 1 0 1 1 1 ( +) 0 1 1 1 1 1 3 3 1 What I want is to define the offset as a clpfd variable with a particular domain associated to it. In order to compute La+Lb I've written the predicate overlap/6 , which is the following: overlap([],[],_,_,_,[]) :- !. overlap([...	case 3 (Lb) . . . . . 1 2 2 . ---> offset = 5 (La) 0 1 1 1 1 0 1 1 1 ( +) 0 1 1 1 1 1 3 3 1 What I want is to define the offset as a clpfd variable with a particular domain associated to it. In order to compute La+Lb I've written the predicate overlap/6 , which is the following: overlap([],[],_,_,_,[]) :- !. overlap([...	[ 0.005706787109375, 0.00836181640625, 0.006439208984375, -0.004791259765625, 0.000614166259765625, -0.005615234375, -0.013671875, 0.01348876953125, 0.02001953125, -0.01263427734375, 0.01287841796875, -0.01055908203125, 0.0089111328125, 0.003936767578125, 0.0162353515625, 0.0025024414062...	[ 7225, 138, 866, 275, 106, 116, 5773, 3509, 2203, 190, 2729, 757, 997, 3444, 61924, 237, 33139, 39557, 71, 77336, 17311, 77758, 137272, 9969, 6743, 239, 1328, 59121, 1653, 2063, 645, 6324, 20155, 284, 42246, 62, 140909, 339, 2027, 19659, ...	[ 0.185302734375, 0.1746826171875, 0.09637451171875, 0.18115234375, 0.036224365234375, 0.0909423828125, 0.27734375, 0.27294921875, 0.0241851806640625, 0.143310546875, 0.1240234375, 0.1474609375, 0.089111328125, 0.04638671875, 0.138427734375, 0.025390625, 0.05853271484375, 0.082275390...	embed
18855146_c0	18855146	prolog	0	Title: Pack consecutive duplicates of list elements into sublists in Prolog Problem title: Pack consecutive duplicates of list elements into sublists in Prolog Tags: prolog, lambda Problem: Pack consecutive duplicates of list elements into sublists in Prolog I have a problem with returning an answer to Problem 9 of P-9...	Pack consecutive duplicates of list elements into sublists in Prolog Pack consecutive duplicates of list elements into sublists in Prolog prolog lambda Pack Prolog Acc Acc1 Call _G986 Exit _G1100 lists:append _G1105 _G1109 _G1114 _G1127 _G1132 Pack consecutive duplicates of list elements into sublists in Prolog I have ...	[ 0.01068115234375, 0.0076904296875, 0.0220947265625, 0.0036468505859375, -0.0242919921875, 0.027587890625, -0.00677490234375, 0.0091552734375, 0.01336669921875, -0.0096435546875, 0.014404296875, 0.0184326171875, -0.00946044921875, 0.00799560546875, -0.0107421875, 0.027587890625, 0.017...	[ 56607, 148390, 171763, 1636, 5303, 80854, 3934, 1614, 6562, 1250, 4867, 502, 6492, 85, 29899, 26265, 204225, 5443, 3559, 3611, 8194, 6463, 2592, 3768, 6460, 2967, 30646, 35166, 15649, 483, 5046, 56740, 36743, 839, 1212, 947, 33209, 41, 1294...	[ 0.2193603515625, 0.1712646484375, 0.232666015625, 0.091796875, 0.1434326171875, 0.1632080078125, 0.10101318359375, 0.191162109375, 0.21826171875, 0.1578369140625, 0.23095703125, 0.1060791015625, 0.1112060546875, 0.059234619140625, 0.039337158203125, 0.0523681640625, 0.1951904296875, ...	embed
21836482_c1	21836482	prolog	1	trans ), append(Prefix," ",Prefixspace), append(Prefixspace,Translationw,Translation). % predicate containing all possible data about verbs including endings % and such % arguments: Latin,Translation,Tense,Number,Mood,Voice word_verbx(Latin,Translation,Tense,Number,Mood,Voice,Person) :- verb(Stem1,_,_,_,_,Ptrans,_,Past...	trans ), append(Prefix," ",Prefixspace), append(Prefixspace,Translationw,Translation). % predicate containing all possible data about verbs including endings % and such % arguments: Latin,Translation,Tense,Number,Mood,Voice word_verbx(Latin,Translation,Tense,Number,Mood,Voice,Person) :- verb(Stem1,_,_,_,_,Ptrans,_,Past...	[ 0.0045166015625, 0.01458740234375, 0.0003528594970703125, -0.006622314453125, 0.023681640625, 0.00567626953125, -0.0032196044921875, -0.007293701171875, 0.02685546875, -0.036376953125, 0.02392578125, -0.01409912109375, -0.0025787353515625, -0.035400390625, -0.01458740234375, 0.02062988...	[ 3900, 6, 247, 114689, 71, 19273, 55923, 58, 65421, 62624, 57860, 434, 194, 1745, 1653, 2063, 67, 70541, 214, 756, 7722, 2053, 1672, 42792, 26719, 86658, 6044, 10750, 42845, 618, 21161, 18444, 26278, 594, 26995, 36635, 2980, 2565, 81465, 4...	[ 0.34375, 0.006988525390625, 0.046234130859375, 0.13818359375, 0.04681396484375, 0.1002197265625, 0.18701171875, 0.003814697265625, 0.18408203125, 0.20068359375, 0.1343994140625, 0.1339111328125, 0.0294342041015625, 0.148193359375, 0.2161865234375, 0.2322998046875, 0.1605224609375, ...	embed
34257684_c1	34257684	prolog	1	F pieces but all the other ones cant be similar) How do I make a new restriction with this: The only other remaining bar to have two spots on its side is C, so C must combine with A to make the 4 or 5 face The only other bar to have a spot on its side near one end is E, so E must combine with B to make the 2 or 3 face...	F pieces but all the other ones cant be similar) How do I make a new restriction with this: The only other remaining bar to have two spots on its side is C, so C must combine with A to make the 4 or 5 face The only other bar to have a spot on its side near one end is E, so E must combine with B to make the 2 or 3 face...	[ -0.00701904296875, -0.00168609619140625, 0.0081787109375, 0.0185546875, 0.00811767578125, -0.004547119140625, -0.01092529296875, 0.018798828125, 0.020263671875, -0.0250244140625, 0.006866455078125, 0.01043701171875, 0.03173828125, -0.005157470703125, -0.0034942626953125, 0.000907897949...	[ 563, 126371, 1284, 756, 3789, 64333, 45767, 186, 21373, 11249, 87, 3249, 10, 3525, 185190, 678, 903, 4734, 47143, 214, 1909, 6626, 13162, 5609, 313, 8110, 70163, 62, 201, 707, 190, 2577, 43573, 3564, 241, 335, 116, 138, 3917, 5154, 2347...	[ 0.1693115234375, 0.1983642578125, 0.03424072265625, 0.06671142578125, 0.06781005859375, 0.0390625, 0.1195068359375, 0.10760498046875, 0.201171875, 0.020294189453125, 0.00579833984375, 0.0902099609375, 0.01678466796875, 0.1241455078125, 0.296142578125, 0.092041015625, 0.071533203125, ...	embed
74294537_c0	74294537	prolog	0	Title: Why do I get repeated information on my query with ProLog? Problem title: Why do I get repeated information on my query with ProLog? Tags: prolog Problem: Why do I get repeated information on my query with ProLog? I'm very new to ProLog, butI'm doing a simple blood donation query system, however I don't understa...	Why do I get repeated information on my query with ProLog? Why do I get repeated information on my query with ProLog? prolog Why ProLog pode_doar tipo_a tipo_b tipo_ab tipo_o fator_p fator_n blood_type rh_factor Why do I get repeated information on my query with ProLog? I'm very new to ProLog, butI'm doing a simple blo...	[ -0.00262451171875, 0.0157470703125, 0.0174560546875, 0.021484375, -0.018798828125, -0.0040283203125, -0.01214599609375, -0.004119873046875, -0.00162506103515625, -0.03271484375, 0.0078125, -0.016845703125, -0.0026702880859375, -0.006011962890625, 0.0037078857421875, -0.0107421875, 0....	[ 44084, 54, 2046, 119140, 297, 4677, 759, 41, 1294, 678, 1250, 113972, 98, 502, 4867, 2911, 246, 147, 4309, 11, 275, 2055, 31, 1071, 1290, 59714, 50986, 127, 144810, 4552, 3525, 8781, 163117, 5426, 28219, 15400, 48716, 111, 5701, 3229, 7...	[ 0.1038818359375, 0.080810546875, 0.085693359375, 0.259521484375, 0.1539306640625, 0.2020263671875, 0.030426025390625, 0.1331787109375, 0.11474609375, 0.035308837890625, 0.1666259765625, 0.2281494140625, 0.00311279296875, 0.099609375, 0.166259765625, 0.1552734375, 0.0947265625, 0.11...	embed
54449376_c0	54449376	prolog	0	Title: For length/2 how to add human readable variable names Problem title: For length/2 how to add human readable variable names Tags: prolog-toplevel, prolog Problem: For length/2 how to add human readable variable names How can human readable variable names be displayed for system generated variable names? As a simp...	For length/2 how to add human readable variable names For length/2 how to add human readable variable names prolog-toplevel prolog _5112 _5118 _5124 variable_names Vars read_term list_partitionedNU _5242 _5248 _5254 For length/2 how to add human readable variable names How can human readable variable names be displayed...	[ 0.0027618408203125, 0.015625, 0.00946044921875, 0.00799560546875, -0.005523681640625, 0.0037689208984375, 0.01226806640625, 0.0054931640625, 0.005889892578125, -0.0201416015625, 0.00640869140625, -0.00555419921875, -0.002685546875, 0.0162353515625, 0.0240478515625, 0.0050048828125, 0...	[ 1326, 140909, 12477, 3642, 15190, 14135, 12301, 2886, 77336, 123055, 502, 4867, 13784, 67919, 11703, 1530, 1819, 2357, 11627, 3323, 7, 32166, 5303, 15866, 1363, 33261, 12744, 13023, 110763, 12338, 831, 44116, 5426, 139392, 8781, 27781, 2806, ...	[ 0.04534912109375, 0.1824951171875, 0.21484375, 0.03448486328125, 0.1568603515625, 0.1690673828125, 0.197998046875, 0.1800537109375, 0.26025390625, 0.2032470703125, 0.127197265625, 0.172607421875, 0.0526123046875, 0.121826171875, 0.0762939453125, 0.111572265625, 0.1038818359375, 0.1...	embed
65456276_c1	65456276	prolog	1	592 in 12..22. It tells me that the values 6 and 3 issue a failure in this program. So I want to use this information to modify my test sequence, making use of a finite number of alternative values. In the end I would like to reach something like the following: solution_valueSeq_alternatives(Vs, Seq, []) :- !, fail. so...	592 in 12..22. It tells me that the values 6 and 3 issue a failure in this program. So I want to use this information to modify my test sequence, making use of a finite number of alternative values. In the end I would like to reach something like the following: solution_valueSeq_alternatives(Vs, Seq, []) :- !, fail. so...	[ 0.00970458984375, 0.02490234375, 0.0145263671875, 0.0093994140625, 0.00836181640625, -0.021484375, -0.007781982421875, 0.00170135498046875, 0.01031494140625, 0.01251220703125, -0.00083160400390625, 0.024169921875, 0.00970458984375, 0.03271484375, 0.01263427734375, 0.007293701171875, ...	[ 192616, 5035, 4015, 14192, 142424, 305, 136, 138, 31089, 137578, 1528, 3444, 4527, 4677, 2811, 40383, 3034, 40, 944, 3956, 94418, 30700, 3564, 1884, 58359, 29806, 27494, 4233, 864, 119927, 856, 7, 503, 711, 35782, 10544, 285, 162, 31304, ...	[ 0.2978515625, 0.1448974609375, 0.12548828125, 0.016326904296875, 0.2052001953125, 0.144775390625, 0.05914306640625, 0.1396484375, 0.14697265625, 0.2435302734375, 0.117919921875, 0.03778076171875, 0.06646728515625, 0.1485595703125, 0.10443115234375, 0.1036376953125, 0.1749267578125, ...	embed
70402338_c0	70402338	prolog	0	Title: Tau Prolog - how to convert a prolog list into a JavaScript array Problem title: Tau Prolog - how to convert a prolog list into a JavaScript array Tags: tau-prolog, prolog, javascript Problem: Tau Prolog - how to convert a prolog list into a JavaScript array I want to use Tau Prolog together with JavaScript on a...	Tau Prolog - how to convert a prolog list into a JavaScript array Tau Prolog - how to convert a prolog list into a JavaScript array tau-prolog prolog javascript Tau Prolog JavaScript console.log session.format_answer answer.lookup Term Num is_float Array answer.links.X.args Tau Prolog - how to convert a prolog list int...	[ 0.007720947265625, 0.005615234375, -0.01220703125, 0.008544921875, -0.0022125244140625, 0.01318359375, 0.0004730224609375, 0.0272216796875, 0.004241943359375, -0.0225830078125, 0.00872802734375, 0.0001010894775390625, -0.02880859375, 0.0084228515625, -0.008056640625, 0.00567626953125, ...	[ 21139, 1250, 4867, 3642, 96760, 502, 5303, 3934, 10, 17925, 10298, 47, 5705, 3454, 136951, 130250, 56002, 51727, 10133, 6488, 35166, 64747, 2037, 2994, 52782, 83, 52347, 257, 69253, 10187, 1542, 61477, 53, 3444, 4527, 25842, 678, 438, 112, ...	[ 0.280029296875, 0.2027587890625, 0.26416015625, 0.07257080078125, 0.1680908203125, 0.193603515625, 0.206787109375, 0.1181640625, 0.06463623046875, 0.249755859375, 0.22705078125, 0.007354736328125, 0.227783203125, 0.1402587890625, 0.18896484375, 0.1844482421875, 0.11572265625, 0.130...	embed
15839923_c1	15839923	prolog	1	of the problem (it is the base case of the solution) * If the list of queen is not empty I can divide it into [X/Y\|Others] where X/Y rappresent position on the board of the first queen in the list * (the position is rappresentend by the couple (X,Y) where X is the column and Y the line) So, it is TRUE that the list [X...	of the problem (it is the base case of the solution) * If the list of queen is not empty I can divide it into [X/Y\|Others] where X/Y rappresent position on the board of the first queen in the list * (the position is rappresentend by the couple (X,Y) where X is the column and Y the line) So, it is TRUE that the list [X...	[ 0.01177978515625, -0.00074005126953125, 0.0228271484375, 0.02001953125, -0.01513671875, -0.006011962890625, 0.0062255859375, -0.005218505859375, 0.025390625, -0.0128173828125, -0.003173828125, -0.0062255859375, -0.021728515625, -0.005462646484375, -0.0201416015625, 0.01519775390625, ...	[ 111, 2967, 3647, 7225, 29806, 5303, 41, 33, 83, 959, 201505, 831, 101637, 3934, 1542, 64, 1723, 58745, 670, 9319, 1193, 29892, 55247, 19069, 45443, 5117, 24941, 3365, 316, 990, 13315, 149842, 647, 10, 159, 93478, 35213, 25632, 91582, 2956...	[ 0.1004638671875, 0.2083740234375, 0.138427734375, 0.10400390625, 0.175048828125, 0.2191162109375, 0.185302734375, 0.15869140625, 0.0304107666015625, 0.05328369140625, 0.14306640625, 0.008209228515625, 0.1375732421875, 0.0279083251953125, 0.109130859375, 0.123046875, 0.1265869140625, ...	embed
13408214_c0	13408214	prolog	0	Title: Finding if a set is additive mod K in Prolog Problem title: Finding if a set is additive mod K in Prolog Tags: prolog, discrete-mathematics, addition Problem: Finding if a set is additive mod K in Prolog I am a beginner in Prolog and I figured I could try to write a simple test to check if a set of integers mod ...	Finding if a set is additive mod K in Prolog Finding if a set is additive mod K in Prolog prolog discrete-mathematics addition Finding Prolog Redo Fail Exit Call _158 _186 Finding if a set is additive mod K in Prolog I am a beginner in Prolog and I figured I could try to write a simple test to check if a set of integer...	[ 0.0001544952392578125, -0.002166748046875, 0.0185546875, 0.005767822265625, -0.0089111328125, -0.005828857421875, -0.0191650390625, 0.005615234375, 0.00921630859375, -0.004669189453125, 0.0203857421875, 0.01708984375, -0.00113677978515625, 0.0019683837890625, 0.004791259765625, 0.00646...	[ 26040, 2174, 5423, 171793, 5844, 2811, 341, 1250, 4867, 83, 502, 81604, 140363, 66044, 6096, 31, 190355, 5443, 26265, 137197, 23, 8781, 3034, 12765, 892, 26255, 866, 21115, 7413, 10554, 11907, 6626, 80854, 339, 12830, 37842, 27489, 7722, 35...	[ 0.08587646484375, 0.07989501953125, 0.2142333984375, 0.1629638671875, 0.1240234375, 0.201171875, 0.1995849609375, 0.144287109375, 0.223388671875, 0.039215087890625, 0.083740234375, 0.071533203125, 0.0206298828125, 0.1143798828125, 0.03875732421875, 0.087158203125, 0.0955810546875, ...	embed
62563091_c0	62563091	prolog	0	Title: Prolog - bagof - case of no results Problem title: Prolog - bagof - case of no results Tags: prolog Problem: Prolog - bagof - case of no results I have activity-users relations: % Signature: activity(Name,Day)/2 % Purpose: describe an activity at the country club and the day it takes place % activity(swimming,su...	Prolog - bagof - case of no results Prolog - bagof - case of no results prolog Prolog Signature Name Day Purpose Child_name Activity activity_participants_list Activity_Name List Prolog - bagof - case of no results I have activity-users relations: I want to create query to get all the participants of activity. So I use...	[ -0.0113525390625, -0.0118408203125, 0.0072021484375, 0.027587890625, -0.0302734375, 0.01806640625, -0.0123291015625, -0.0113525390625, 0.0035552978515625, -0.00070953369140625, -0.016845703125, -0.01513671875, -0.0198974609375, 0.00750732421875, -0.00531005859375, -0.0034637451171875, ...	[ 1250, 4867, 41780, 420, 7225, 111, 110, 50339, 502, 26729, 141762, 15757, 10013, 16915, 123829, 11627, 42902, 103488, 15866, 25258, 10840, 6562, 163612, 32036, 223, 1314, 91582, 3444, 28282, 41, 2046, 756, 70, 56480, 4527, 164414, 154663, 429...	[ 0.133544921875, 0.2069091796875, 0.134033203125, 0.1959228515625, 0.125732421875, 0.092529296875, 0.1121826171875, 0.124755859375, 0.0982666015625, 0.044281005859375, 0.029937744140625, 0.041015625, 0.094970703125, 0.06689453125, 0.086669921875, 0.045440673828125, 0.09228515625, 0....	embed
34460301_c0	34460301	prolog	0	Title: SICStus Prolog 4.3.2: clpfd got no power? Problem title: SICStus Prolog 4.3.2: clpfd got no power? Tags: sicstus-prolog, clpfd, portability, prolog Problem: SICStus Prolog 4.3.2: clpfd got no power? Some of my Prolog programs could profit quite a bit if I could replace all (is)/2 -based integer arithmetics by th...	SICStus Prolog 4.3.2: clpfd got no power? SICStus Prolog 4.3.2: clpfd got no power? sicstus-prolog clpfd portability prolog SICStus Prolog type_error fd_evaluable use_module ERROR Domain clpfd_expression illegal_array_access Existence user:wi SICStus Prolog 4.3.2: clpfd got no power? Some of my Prolog programs could pr...	[ -0.00775146484375, 0.00634765625, 0.0003833770751953125, -0.00958251953125, 0.00004172325134277344, 0.00775146484375, -0.003814697265625, -0.00958251953125, -0.004058837890625, -0.0184326171875, 0.00002086162567138672, 0.00885009765625, -0.0284423828125, -0.00077056884765625, 0.014709472...	[ 159, 102198, 2143, 1250, 4867, 1398, 107033, 33139, 39557, 71, 4163, 110, 14537, 26536, 18253, 3454, 4898, 83259, 502, 10644, 188800, 159258, 2661, 4527, 83279, 151206, 93702, 204629, 85325, 19305, 113041, 122688, 38937, 2452, 103391, 5809, 183...	[ 0.083251953125, 0.05523681640625, 0.1905517578125, 0.1527099609375, 0.2288818359375, 0.114990234375, 0.224609375, 0.107666015625, 0.1363525390625, 0.1788330078125, 0.0814208984375, 0.124755859375, 0.2464599609375, 0.0667724609375, 0.171142578125, 0.116943359375, 0.06884765625, 0.03...	embed
60246766_c0	60246766	prolog	0	Title: prolog - create list from facts by criteria Problem title: prolog - create list from facts by criteria Tags: fact, list, prolog Problem: prolog - create list from facts by criteria I'm trying to create list from the facts in SWI-Prolog. There are amount of exapmles but I don't understand how to create list by cr...	prolog - create list from facts by criteria prolog - create list from facts by criteria fact list prolog facts Body Rate deposit Bank Usage List Prof Pro Before How Expected prolog - create list from facts by criteria I'm trying to create list from the facts in SWI-Prolog. There are amount of exapmles but I don't under...	[ 0.0201416015625, -0.015869140625, 0.00225830078125, 0.00408935546875, 0.003082275390625, 0.00958251953125, 0.005950927734375, 0.022216796875, 0.02294921875, 0.00008869171142578125, 0.00860595703125, -0.0133056640625, -0.01531982421875, -0.0289306640625, 0.01287841796875, 0.014953613281...	[ 502, 4867, 28282, 5303, 1295, 15824, 7, 390, 55738, 11, 43960, 131182, 40370, 4932, 70166, 32036, 11739, 1250, 117371, 11249, 60075, 13, 89829, 31577, 159, 38969, 10752, 41170, 1119, 2631, 39, 1577, 28219, 18151, 35064, 7145, 2063, 67, 1256...	[ 0.1578369140625, 0.259765625, 0.16064453125, 0.2139892578125, 0.1068115234375, 0.1837158203125, 0.054473876953125, 0.1051025390625, 0.191162109375, 0.1302490234375, 0.082275390625, 0.11572265625, 0.1466064453125, 0.10498046875, 0.09814453125, 0.1390380859375, 0.1099853515625, 0.158...	embed
57808598_c0	57808598	prolog	0	Title: Prolog Error: `character' expected, found `"((.).)"' (a string) Problem title: Prolog Error: `character' expected, found `"((.).)"' (a string) Tags: dcg, prolog Problem: Prolog Error: `character' expected, found `"((.).)"' (a string) My goal is to print all forms of trees ...	Prolog Error: `character' expected, found `"((.).)"' (a string) Prolog Error: `character' expected, found `"((.).)"' (a string) dcg prolog Prolog Error form1 Prev Next string_concat Inter form2 Strings PrevStrings1 List1 List2 Result Type _3182 Prolog Error: `character' expected,...	[ 0.0279541015625, 0.00970458984375, -0.027099609375, 0.00994873046875, -0.0034942626953125, 0.0076904296875, -0.01123046875, -0.003326416015625, 0.0025177001953125, -0.05419921875, 0.00007295608520507812, -0.03369140625, -0.004425048828125, 0.0033721923828125, 0.0107421875, 0.0017166137...	[ 1250, 4867, 212059, 9254, 2263, 720, 3768, 84751, 14037, 41502, 5, 79315, 177, 502, 3173, 74717, 4997, 2271, 4460, 5337, 304, 23351, 71713, 5180, 32036, 126684, 60457, 5016, 12012, 69236, 28412, 756, 1360, 90, 678, 541, 110, 988, 49129, 1...	[ 0.1900634765625, 0.250244140625, 0.215576171875, 0.118408203125, 0.1759033203125, 0.162109375, 0.1585693359375, 0.255126953125, 0.1612548828125, 0.009246826171875, 0.068115234375, 0.206298828125, 0.064453125, 0.1473388671875, 0.1597900390625, 0.06591796875, 0.05670166015625, 0.0121...	embed
37231990_c0	37231990	prolog	0	Title: Prolog: Append complex terms in a list Problem title: Prolog: Append complex terms in a list Tags: prolog, append, instantiation, list Problem: Prolog: Append complex terms in a list I'm new with Prolog and I have a problem that I don't understand why. I have a predicate (maybe wrong) that is to split a list in ...	Prolog: Append complex terms in a list Prolog: Append complex terms in a list prolog append instantiation list Prolog Append PrimerEdificio RestoEdificios ListaA ListaB ListaParcialA ListaParcialB LongitudResto LongitudA Call _G3026 _G3027 _G3140 _G3141 Exit _G3144 Prolog: Append complex terms in a list I'm new with Pr...	[ 0.011962890625, 0.028564453125, 0.007415771484375, 0.0162353515625, 0.0096435546875, 0.009521484375, -0.0035247802734375, 0.0439453125, 0.01904296875, -0.0166015625, 0.024169921875, -0.0018157958984375, 0.001617431640625, 0.0125732421875, 0.0167236328125, 0.0034027099609375, 0.030883...	[ 1250, 4867, 5659, 3611, 27140, 69407, 23, 5303, 10, 502, 114689, 34648, 14, 46282, 69489, 14486, 846, 49756, 31, 5790, 50085, 571, 26136, 21753, 4332, 2785, 14407, 284, 26265, 1197, 4046, 3768, 363, 43900, 5016, 8894, 5443, 724, 131663, 3...	[ 0.160400390625, 0.240234375, 0.1370849609375, 0.1397705078125, 0.241943359375, 0.2255859375, 0.07562255859375, 0.2091064453125, 0.016815185546875, 0.109375, 0.1649169921875, 0.132080078125, 0.104736328125, 0.114990234375, 0.0248565673828125, 0.089111328125, 0.0814208984375, 0.07843...	embed
64541632_c1	64541632	prolog	1	, Right), format('~w', [Value]), ( Value = 'and' -> write('(') ; true), ( Value = 'or' -> write('(') ; true), ( Value = 'not' -> write('(') ; true), printTree(Left), ( Value = 'and' -> write(',') ; true), ( Value = 'or' -> write(',') ; true), printTree(Right), ( Value = 'and' -> write(')') ; true), ( Value = 'not' -> w...	, Right), format('~w', [Value]), ( Value = 'and' -> write('(') ; true), ( Value = 'or' -> write('(') ; true), ( Value = 'not' -> write('(') ; true), printTree(Left), ( Value = 'and' -> write(',') ; true), ( Value = 'or' -> write(',') ; true), printTree(Right), ( Value = 'and' -> write(')') ; true), ( Value = 'not' -> w...	[ 0.010498046875, 0.0181884765625, 0.016357421875, 0.02294921875, -0.004150390625, 0.033935546875, -0.0228271484375, -0.02587890625, 0.0179443359375, 0.000244140625, -0.0072021484375, -0.0240478515625, -0.00007963180541992188, -0.01123046875, 0.0191650390625, -0.0034637451171875, 0.004...	[ 6, 4, 90911, 247, 9384, 2306, 434, 856, 50770, 190060, 2940, 33079, 33022, 29568, 748, 10869, 28412, 62731, 13, 2480, 22553, 965, 532, 8, 594, 43425, 1542, 110, 112, 990, 2292, 1723, 3525, 157, 11627, 8439, 1745, 5072, 12663, 69141, 10,...	[ 0.00079345703125, 0.0278778076171875, 0.188232421875, 0.0297698974609375, 0.2244873046875, 0.06671142578125, 0.20166015625, 0.1376953125, 0.21044921875, 0.259765625, 0.1834716796875, 0.0223236083984375, 0.1607666015625, 0.177001953125, 0.17333984375, 0.162109375, 0.155029296875, 0....	embed
36235348_c0	36235348	prolog	0	Title: Prolog and limitations of backtracking Problem title: Prolog and limitations of backtracking Tags: prolog Problem: Prolog and limitations of backtracking This is probably the most trivial implementation of a function that returns the length of a list in Prolog count([], 0). count([_\|B], T) :- count(B, U), T is U...	Prolog and limitations of backtracking Prolog and limitations of backtracking prolog Prolog _G4337877 _G4337880 _G4337883 _G4369400 Prolog and limitations of backtracking This is probably the most trivial implementation of a function that returns the length of a list in Prolog one thing about Prolog that I still cannot...	[ 0.0230712890625, 0.035888671875, 0.0126953125, 0.005767822265625, -0.0001316070556640625, -0.00506591796875, -0.01141357421875, 0.005584716796875, 0.02978515625, -0.050537109375, -0.00701904296875, -0.023193359375, 0.0033416748046875, 0.022705078125, 0.01129150390625, 0.0040283203125, ...	[ 1250, 4867, 136, 205969, 4420, 125728, 214, 7, 502, 182055, 11548, 134808, 4836, 150177, 146406, 10700, 2684, 686, 208124, 32354, 30646, 140909, 5303, 7464, 53418, 137565, 10336, 10932, 71985, 2481, 17368, 77336, 171859, 831, 11675, 54529, 876,...	[ 0.20703125, 0.278076171875, 0.011810302734375, 0.2215576171875, 0.1416015625, 0.2410888671875, 0.040191650390625, 0.025390625, 0.1246337890625, 0.1063232421875, 0.0419921875, 0.03594970703125, 0.081787109375, 0.039276123046875, 0.006683349609375, 0.06976318359375, 0.033843994140625, ...	embed
11054424_c1	11054424	prolog	1	- [openpage]. % openpage compiled 0.00 sec, 616 bytes true. ?- request('http://www.google.com', In). ERROR: request/2: Undefined procedure: http_open/3 ?- [forced] Action (h for help) ? exit So in my next session, I invoke use_module/1 before loading my source file, and all is fine: ?- use_module(library(http/http_open...	- [openpage]. % openpage compiled 0.00 sec, 616 bytes true. ?- request('http://www.google.com', In). ERROR: request/2: Undefined procedure: http_open/3 ?- [forced] Action (h for help) ? exit So in my next session, I invoke use_module/1 before loading my source file, and all is fine: ?- use_module(library(http/http_open...	[ 0.0028076171875, 0.00604248046875, 0.0074462890625, 0.005279541015625, 0.01318359375, 0.01055908203125, 0.003143310546875, -0.005828857421875, -0.002838134765625, -0.08251953125, 0.03076171875, -0.031494140625, -0.0120849609375, -0.00927734375, 0.028564453125, -0.0205078125, 0.000265...	[ 59636, 22469, 1745, 9803, 375, 5974, 37509, 19216, 305, 2485, 390, 29568, 50336, 5475, 1574, 59875, 277, 360, 151206, 24638, 12477, 79912, 5983, 50491, 1621, 18113, 50930, 71, 57945, 127, 4358, 82230, 23, 11737, 56002, 23253, 4527, 83279, 1...	[ 0.2362060546875, 0.256103515625, 0.065673828125, 0.166015625, 0.050262451171875, 0.2174072265625, 0.15185546875, 0.1597900390625, 0.01806640625, 0.206787109375, 0.07952880859375, 0.1192626953125, 0.16796875, 0.12109375, 0.0256195068359375, 0.1575927734375, 0.1259765625, 0.135620117...	embed
66619508_c1	66619508	prolog	1	ab_minimax(max,Board,-inf,inf,Value, NextBoard). ab_minimax(max,Board,_,_,-1, NextBoard):- is_winning_state_o(Board), !. ab_minimax(min,Board,_,_,1, NextBoard):- is_winning_state_x(Board), !. ab_minimax(_,Board,_,_,0, NextBoard):- is_a_draw(Board), !. ab_minimax(max,Board,Alfa,Beta,Value, NextBoard):- children(Board, ...	ab_minimax(max,Board,-inf,inf,Value, NextBoard). ab_minimax(max,Board,_,_,-1, NextBoard):- is_winning_state_o(Board), !. ab_minimax(min,Board,_,_,1, NextBoard):- is_winning_state_x(Board), !. ab_minimax(_,Board,_,_,0, NextBoard):- is_a_draw(Board), !. ab_minimax(max,Board,Alfa,Beta,Value, NextBoard):- children(Board, ...	[ -0.00201416015625, -0.020751953125, 0.032958984375, 0.0162353515625, 0.00238037109375, 0.00872802734375, 0.0133056640625, 0.01068115234375, 0.010498046875, -0.002685546875, -0.0260009765625, 0.009765625, 0.018310546875, -0.0028076171875, 0.003021240234375, -0.04443359375, -0.00114440...	[ 1563, 454, 9222, 24084, 132, 4, 12647, 5861, 46632, 856, 50770, 4997, 194, 5759, 9, 83, 69986, 61340, 31, 711, 1249, 418, 425, 2389, 11, 86905, 5, 6210, 1021, 6766, 102, 20020, 18389, 91345, 237052, 102656, 63813, 881, 71346, 841, 618, ...	[ 0.232177734375, 0.0848388671875, 0.2374267578125, 0.25634765625, 0.01605224609375, 0.01788330078125, 0.160888671875, 0.2158203125, 0.1685791015625, 0.0758056640625, 0.15771484375, 0.14990234375, 0.06427001953125, 0.114013671875, 0.01275634765625, 0.1092529296875, 0.2198486328125, 0...	embed
64754007_c0	64754007	prolog	0	Title: Largest empty subgraph of an undirected graph in SWI Prolog Problem title: Largest empty subgraph of an undirected graph in SWI Prolog Tags: graph-theory, prolog, undirected-graph Problem: Largest empty subgraph of an undirected graph in SWI Prolog An undirected graph is given. Find the number of internal stabil...	Largest empty subgraph of an undirected graph in SWI Prolog Largest empty subgraph of an undirected graph in SWI Prolog graph-theory prolog undirected-graph Largest SWI Prolog _________c_______ VisitedNodes TailPath VisitedNode Largest empty subgraph of an undirected graph in SWI Prolog I set the edges and vertices. An...	[ 0.00604248046875, 0.017333984375, 0.0137939453125, 0.0223388671875, -0.0186767578125, 0.015380859375, -0.014404296875, -0.0037841796875, 0.00714111328125, -0.0167236328125, -0.00016689300537109375, -0.0166015625, -0.00677490234375, 0.0115966796875, 0.0257568359375, 0.02294921875, 0.0...	[ 181268, 271, 201505, 1614, 41382, 51, 80581, 38969, 1250, 4867, 159, 502, 98684, 297, 5021, 988, 1218, 379, 683, 10519, 5423, 121303, 136, 95378, 5170, 44116, 5303, 135457, 54, 11737 ]	[ 0.0997314453125, 0.046630859375, 0.2158203125, 0.146240234375, 0.170654296875, 0.05242919921875, 0.1220703125, 0.164306640625, 0.0904541015625, 0.17138671875, 0.0191497802734375, 0.03680419921875, 0.1116943359375, 0.0153656005859375, 0.0799560546875, 0.03338623046875, 0.0526123046875...	embed
65180949_c0	65180949	prolog	0	Title: Most common sublist in Prolog Problem title: Most common sublist in Prolog Tags: sublist, algorithm, list, prolog Problem: Most common sublist in Prolog The problem is as follows: Write a predicate in Prolog most_common_sublist(L1,N,L2) that will find the sublist L2 with length N such that it is the most common ...	Most common sublist in Prolog Most common sublist in Prolog sublist algorithm list prolog Most Prolog Example most_common_sublist Result LOP Temp N-1 Hits check_how_many Pattern Most common sublist in Prolog The problem is as follows: Write a predicate in Prolog most_common_sublist(L1,N,L2) that will find the sublist L...	[ 0.0072021484375, -0.0048828125, 0.006622314453125, -0.0172119140625, -0.00860595703125, 0.024658203125, -0.0025634765625, 0.005523681640625, 0.0220947265625, -0.042724609375, 0.00750732421875, 0.02099609375, 0.02099609375, -0.0185546875, -0.006103515625, -0.00145721435546875, 0.01550...	[ 17006, 39210, 1614, 6562, 1250, 4867, 234873, 5303, 502, 89536, 2684, 277, 3796, 22144, 126684, 20880, 37446, 541, 5759, 145484, 12765, 47251, 669, 9876, 2967, 18781, 1653, 2063, 67, 839, 10461, 339, 304, 140909, 418, 51515, 139392, 7722, 1...	[ 0.066162109375, 0.1748046875, 0.22216796875, 0.19189453125, 0.153076171875, 0.234375, 0.1397705078125, 0.120849609375, 0.08447265625, 0.0220489501953125, 0.0653076171875, 0.04705810546875, 0.08160400390625, 0.187744140625, 0.1259765625, 0.1409912109375, 0.1497802734375, 0.061767578...	embed
41227318_c0	41227318	prolog	0	Title: Prolog algorithm for 3 water jugs Problem title: Prolog algorithm for 3 water jugs Tags: water-jug-problem, prolog Problem: Prolog algorithm for 3 water jugs I was trying to make a program to solve 3 any size water jugs problem. I have written this much refil(Size,_,_,Size). refil(FirstSize,SecondSize,ThirdSize,...	Prolog algorithm for 3 water jugs Prolog algorithm for 3 water jugs water-jug-problem prolog Prolog Size FirstSize SecondSize ThirdSize Goal New1 New2 New3 TempVal1 New2-SecondSize NextVal1 NextVal2 NextVal3 New3-ThirdSize reduce1 reduce2 Jug Prolog algorithm for 3 water jugs I was trying to make a program to solve 3 a...	[ -0.0025177001953125, 0.00836181640625, 0.0074462890625, 0.01031494140625, -0.01434326171875, -0.003173828125, -0.034912109375, 0.006134033203125, -0.005096435546875, 0.0230712890625, 0.0172119140625, 0.00885009765625, 0.00799560546875, -0.0016021728515625, 0.004241943359375, -0.0023651...	[ 1250, 4867, 234873, 138, 7401, 103863, 7, 461, 177, 38953, 502, 80378, 23972, 127167, 77648, 198387, 2016, 289, 2356, 418, 304, 363, 37446, 42272, 18504, 4997, 27495, 117177, 34390, 3314, 31577, 1528, 86869, 2499, 13267, 2967, 5045, 18151, ...	[ 0.1649169921875, 0.240478515625, 0.2239990234375, 0.226318359375, 0.1527099609375, 0.269775390625, 0.0706787109375, 0.199462890625, 0.1231689453125, 0.1768798828125, 0.136962890625, 0.1365966796875, 0.0430908203125, 0.1162109375, 0.0562744140625, 0.147216796875, 0.1712646484375, 0....	embed
53290479_c0	53290479	prolog	0	Title: Prolog: Give list to a fact Problem title: Prolog: Give list to a fact Tags: prolog Problem: Prolog: Give list to a fact Lets say I'm looking for someones friends. friend(mary, peter). friend(mary, paul). friend(mary, john). friend(mary, justin). friend(chris, peter). friend(chris, paul). friend(chris, conner). ...	Prolog: Give list to a fact Prolog: Give list to a fact prolog Prolog Give Prolog: Give list to a fact Lets say I'm looking for someones friends. In the above example I know that I can do something like which will tell me everyone paul is friends with or also which will return a list of everyone paul is friends with. L...	[ 0.0361328125, -0.0133056640625, -0.003448486328125, 0.033447265625, -0.0208740234375, -0.004241943359375, 0.003204345703125, 0.01129150390625, 0.01226806640625, -0.0169677734375, 0.0052490234375, -0.012939453125, -0.0034942626953125, 0.032470703125, -0.00738525390625, 0.00714111328125,...	[ 1250, 4867, 77878, 5303, 47, 15824, 502, 16487, 100, 22008, 23902, 27781, 3714, 831, 54, 1884, 14192, 30309, 249, 202, 83, 678, 2843, 30646, 3444, 738, 10176, 4785, 53894, 56, 33938, 18831, 1212, 717, 2046, 62, 186, 111, 1727, 53, 17656...	[ 0.1473388671875, 0.2333984375, 0.171142578125, 0.250244140625, 0.0966796875, 0.2193603515625, 0.1141357421875, 0.1295166015625, 0.1328125, 0.044036865234375, 0.2149658203125, 0.08734130859375, 0.043243408203125, 0.03814697265625, 0.039398193359375, 0.04180908203125, 0.1187744140625, ...	embed
32635299_c0	32635299	prolog	0	Title: Gerrit Prolog Rule - Require specific file type Problem title: Gerrit Prolog Rule - Require specific file type Tags: prolog, gerrit Problem: Gerrit Prolog Rule - Require specific file type I am new to Gerrit and Prolog, and am having difficulty creating my rule. With the rules.pl I currently have, it stalls when...	Gerrit Prolog Rule - Require specific file type Gerrit Prolog Rule - Require specific file type prolog gerrit Gerrit Prolog Rule Require submit_rule gerrit:default_submit my_rule gerrit:commit_delta Text-File-Must-Be-Present Gerrit Prolog Rule - Require specific file type I am new to Gerrit and Prolog, and am having di...	[ 0.017822265625, -0.0086669921875, 0.00106048583984375, 0.0026702880859375, -0.01312255859375, 0.0025787353515625, -0.00848388671875, -0.0062255859375, 0.00096893310546875, -0.0101318359375, 0.0223388671875, -0.00640869140625, -0.017578125, -0.01495361328125, 0.02587890625, 0.0192871093...	[ 8022, 2783, 1250, 4867, 139118, 853, 3181, 29458, 11435, 10644, 502, 4155, 137447, 882, 133, 214810, 22144, 4007, 759, 277, 1743, 102, 24129, 174350, 55668, 18, 6766, 19273, 12832, 3525, 34844, 105233, 79986, 91736, 2424, 82424, 765, 92621, ...	[ 0.1436767578125, 0.263671875, 0.1456298828125, 0.233154296875, 0.2119140625, 0.019805908203125, 0.1644287109375, 0.1832275390625, 0.211669921875, 0.184814453125, 0.118896484375, 0.10577392578125, 0.125, 0.1571044921875, 0.1112060546875, 0.17333984375, 0.0943603515625, 0.20336914062...	embed
28138944_c1	28138944	prolog	1	, P, A) :- tryGuess(Colors, Size, J, A), //Possibilities in J copy(J, X), //First possible result J -> X J = P, //Unification of all results run(Colors, Size, J, X). //loop tryGuess(_, _, _, []) :- !. tryGuess(Colors, Size, P, A) :- write('Evaluation of: '), write(A), nl, write('Black pegs: '), read(B), nl, write('Whit...	, P, A) :- tryGuess(Colors, Size, J, A), //Possibilities in J copy(J, X), //First possible result J -> X J = P, //Unification of all results run(Colors, Size, J, X). //loop tryGuess(_, _, _, []) :- !. tryGuess(Colors, Size, P, A) :- write('Evaluation of: '), write(A), nl, write('Black pegs: '), read(B), nl, write('Whit...	[ -0.00823974609375, -0.0111083984375, 0.01708984375, 0.0245361328125, 0.0087890625, 0.00604248046875, -0.00872802734375, -0.0004558563232421875, 0.019775390625, -0.0028533935546875, -0.00131988525390625, 0.04248046875, 0.00457763671875, 0.00238037109375, 0.00848388671875, 0.009704589843...	[ 4, 436, 62, 15772, 9790, 22769, 90, 7, 78457, 25251, 80378, 821, 4666, 7192, 36584, 2449, 43658, 1375, 1193, 247, 207263, 7722, 16750, 33079, 2203, 14256, 41274, 756, 50339, 11675, 28354, 268, 16, 711, 33022, 132, 647, 27494, 2320, 111, ...	[ 0.06011962890625, 0.0914306640625, 0.135986328125, 0.1239013671875, 0.1837158203125, 0.2353515625, 0.220947265625, 0.1636962890625, 0.134521484375, 0.1390380859375, 0.189697265625, 0.1522216796875, 0.042633056640625, 0.10467529296875, 0.19482421875, 0.0804443359375, 0.138427734375, ...	embed
61106653_c1	61106653	prolog	1	_power(earthquake, 100). has_power(scald, 80). has_power(icebeam, 90). has_power(darkpulse, 80). has_power(aurasphere, 80). has_power(sludgebomb, 90). has_power(hpfire, 60). I am trying to make a rule that gets the maximum amount damage done, but i am unsure as how to go about this. What i have so far is a rule that ca...	_power(earthquake, 100). has_power(scald, 80). has_power(icebeam, 90). has_power(darkpulse, 80). has_power(aurasphere, 80). has_power(sludgebomb, 90). has_power(hpfire, 60). I am trying to make a rule that gets the maximum amount damage done, but i am unsure as how to go about this. What i have so far is a rule that ca...	[ 0.0159912109375, 0.01116943359375, 0.017578125, 0.037353515625, -0.0003223419189453125, 0.00830078125, 0.0023345947265625, -0.01373291015625, 0.0036468505859375, -0.019287109375, 0.0069580078125, 0.00396728515625, 0.007659912109375, -0.0135498046875, 0.007232666015625, 0.00142669677734...	[ 101, 62783, 90134, 13722, 350, 805, 1556, 16275, 7344, 2248, 2980, 372, 302, 2510, 1506, 69035, 103984, 157695, 10791, 61007, 96946, 254, 73702, 1496, 31577, 3249, 79986, 62163, 38132, 41170, 82649, 16940, 51646, 1672, 2060, 83324, 36766, 10,...	[ 0.04388427734375, 0.19921875, 0.0709228515625, 0.155029296875, 0.05810546875, 0.14990234375, 0.116943359375, 0.04498291015625, 0.1385498046875, 0.15234375, 0.0733642578125, 0.1229248046875, 0.11328125, 0.1490478515625, 0.069091796875, 0.1776123046875, 0.11572265625, 0.197021484375,...	embed
57006348_c1	57006348	prolog	1	, Tree, _) -> ( succ(Len, Len1), append([Dig], Curr, Currn), same_ending1(Digs, SubTree, Currn, Fin, Len1, Len2) ) ; Len2 = Len, Fin = Curr-Tree ). Edit 2 : For the final suggestion on @gusbro 's answer I created this code ssame_endings(L1,[],Curr,Final):- Final=Curr. ssame_endings(L1, L2,Curr,Final):- build_tree(L1, T...	, Tree, _) -> ( succ(Len, Len1), append([Dig], Curr, Currn), same_ending1(Digs, SubTree, Currn, Fin, Len1, Len2) ) ; Len2 = Len, Fin = Curr-Tree ). Edit 2 : For the final suggestion on @gusbro 's answer I created this code ssame_endings(L1,[],Curr,Final):- Final=Curr. ssame_endings(L1, L2,Curr,Final):- build_tree(L1, T...	[ -0.006256103515625, 0.0263671875, -0.005584716796875, -0.0120849609375, -0.00244140625, 0.00714111328125, -0.0390625, 0.01025390625, 0.01202392578125, -0.03759765625, 0.0101318359375, -0.0096435546875, 0.034423828125, 0.00191497802734375, 0.0126953125, -0.00799560546875, 0.0131225585...	[ 6, 4, 101344, 101, 33079, 166, 10060, 866, 33, 18226, 17727, 114689, 71, 397, 872, 17065, 42, 19, 5701, 6238, 418, 7, 8273, 62731, 13, 13316, 10461, 2819, 304, 2203, 9, 194, 42079, 2704, 199015, 14336, 6369, 75935, 903, 18151, 91, 401...	[ 0.01214599609375, 0.057159423828125, 0.310546875, 0.1025390625, 0.0789794921875, 0.1004638671875, 0.130859375, 0.103271484375, 0.15087890625, 0.1845703125, 0.08026123046875, 0.140869140625, 0.05694580078125, 0.04754638671875, 0.1478271484375, 0.148193359375, 0.1510009765625, 0.0762...	embed
46771508_c1	46771508	prolog	1	/omnivores eat at night based on animal_food being eaten at night. Another example: ?- eats(bessie, cabbage, 14.00). will return true if bessie is a herbivore, cabbage is plant_food and herbivores eat during the day based on plant_food being eaten during the day. Also, the eater cannot be of the same class as the Food ...	/omnivores eat at night based on animal_food being eaten at night. Another example: ?- eats(bessie, cabbage, 14.00). will return true if bessie is a herbivore, cabbage is plant_food and herbivores eat during the day based on plant_food being eaten during the day. Also, the eater cannot be of the same class as the Food ...	[ 0.02197265625, 0.01324462890625, 0.006591796875, 0.008544921875, -0.000255584716796875, -0.0021209716796875, 0.000873565673828125, -0.01031494140625, 0.00775146484375, -0.03564453125, -0.004547119140625, 0.00872802734375, -0.00274658203125, -0.0035400390625, 0.0177001953125, -0.0170898...	[ 248, 306, 93, 3104, 90, 73203, 99, 17431, 35509, 26249, 49558, 8035, 33, 27781, 705, 28, 9821, 7438, 3629, 38980, 402, 429, 80461, 30646, 29568, 2174, 186, 91573, 83, 10, 604, 964, 104297, 18153, 454, 136, 20271, 5155, 46429, 53418, 570...	[ 0.02197265625, 0.09173583984375, 0.09259033203125, 0.183837890625, 0.06182861328125, 0.1912841796875, 0.104736328125, 0.2259521484375, 0.114013671875, 0.158203125, 0.1749267578125, 0.009674072265625, 0.02685546875, 0.09783935546875, 0.0213623046875, 0.1307373046875, 0.112548828125, ...	embed
39212508_c1	39212508	prolog	1	new Atom("C:\\Natural_Language_Final_Project\\PrologTest\\src\\clauses_qa2.pl")}); Query q2 = new Query("consult",new Term[]{new Atom("C:\\Natural_Language_Final_Project\\PrologTest\\src\\rules.pl")}); Scanner scan = new Scanner(ruleFile); while (scan.hasNextLine()){ System.out.println(scan.nextLine()); } jpl.JPL.init(...	new Atom("C:\\Natural_Language_Final_Project\\PrologTest\\src\\clauses_qa2.pl")}); Query q2 = new Query("consult",new Term[]{new Atom("C:\\Natural_Language_Final_Project\\PrologTest\\src\\rules.pl")}); Scanner scan = new Scanner(ruleFile); while (scan.hasNextLine()){ System.out.println(scan.nextLine()); } jpl.JPL.init(...	[ 0.02099609375, 0.0174560546875, 0.0068359375, 0.0196533203125, -0.01226806640625, 0.0196533203125, 0.0034332275390625, -0.013671875, -0.00396728515625, -0.02978515625, 0.0033721923828125, 0.0155029296875, -0.0203857421875, -0.033935546875, 0.006927490234375, 0.0067138671875, 0.004119...	[ 3525, 69728, 149989, 10393, 4588, 6159, 6236, 223353, 10752, 4867, 111337, 19437, 18347, 29001, 5498, 5442, 2424, 58836, 8096, 304, 147834, 54936, 2994, 13500, 65533, 44954, 882, 133, 174350, 4398, 10557, 81280, 93232, 12353, 6056, 21130, 84572...	[ 0.07806396484375, 0.2264404296875, 0.07928466796875, 0.08837890625, 0.0076904296875, 0.06494140625, 0.060760498046875, 0.087158203125, 0.1405029296875, 0.2342529296875, 0.18505859375, 0.07080078125, 0.07421875, 0.0576171875, 0.074951171875, 0.061004638671875, 0.14453125, 0.15734863...	embed
73602036_c0	73602036	prolog	0	Title: Trying to solve a game in Prolog Problem title: Trying to solve a game in Prolog Tags: clpfd, prolog Problem: Trying to solve a game in Prolog Suppose, we have the following game: There is a pair of numbers (x, y), 2 players are making moves. During the move a player can increase any number by 1 or multiply it b...	Trying to solve a game in Prolog Trying to solve a game in Prolog clpfd prolog Trying Prolog use_module next_state sequence_correct Trying to solve a game in Prolog Suppose, we have the following game: There is a pair of numbers (x, y), 2 players are making moves. During the move a player can increase any number by 1 o...	[ -0.0106201171875, 0.0048828125, 0.022216796875, 0.0089111328125, -0.005706787109375, 0.0042724609375, -0.006866455078125, -0.001983642578125, 0.003509521484375, -0.0225830078125, 0.0030975341796875, 0.032470703125, 0.0034942626953125, 0.01202392578125, 0.01116943359375, -0.005737304687...	[ 40858, 214, 86869, 6712, 23, 1250, 4867, 33139, 39557, 71, 502, 4527, 83279, 11737, 61340, 40, 944, 3956, 32399, 25632, 80836, 101935, 425, 113, 116, 92865, 20662, 25813, 133698, 58585, 831, 51312, 14012, 106, 707, 6024, 62479, 787, 2750, ...	[ 0.129150390625, 0.02191162109375, 0.1751708984375, 0.1241455078125, 0.076171875, 0.1910400390625, 0.253173828125, 0.02978515625, 0.05706787109375, 0.07806396484375, 0.13427734375, 0.0701904296875, 0.12353515625, 0.16015625, 0.1693115234375, 0.032318115234375, 0.0762939453125, 0.001...	embed
66459122_c0	66459122	prolog	0	Title: Creating a Knowledge Base and Querying in Prolog Problem title: Creating a Knowledge Base and Querying in Prolog Tags: prolog, knowledge-capture Problem: Creating a Knowledge Base and Querying in Prolog I want to create the Knowledge base equivalent to the statements as below in Prolog. John likes all kind of fo...	Creating a Knowledge Base and Querying in Prolog Creating a Knowledge Base and Querying in Prolog prolog knowledge-capture Creating Knowledge Base Querying Prolog ERROR Warning Clauses Current Use Creating a Knowledge Base and Querying in Prolog I want to create the Knowledge base equivalent to the statements as below ...	[ 0.041259765625, 0.01470947265625, 0.000514984130859375, 0.017822265625, 0.0031585693359375, 0.0054931640625, 0.0035552978515625, 0.003326416015625, 0.007293701171875, -0.009033203125, 0.00799560546875, -0.008544921875, -0.00762939453125, -0.0023193359375, 0.002471923828125, 0.018554687...	[ 56781, 191428, 44978, 136, 58836, 38543, 1250, 4867, 10, 23, 502, 51359, 15644, 1916, 151206, 24638, 5550, 100700, 114063, 36836, 3444, 28282, 3647, 183234, 63805, 35064, 4939, 1884, 756, 8562, 15381, 4129, 55670, 2661, 64113, 35672, 28, 9821...	[ 0.134765625, 0.184326171875, 0.23046875, 0.054901123046875, 0.1468505859375, 0.1357421875, 0.158447265625, 0.241943359375, 0.0149688720703125, 0.01531982421875, 0.092529296875, 0.115234375, 0.115234375, 0.0074462890625, 0.08984375, 0.007568359375, 0.0941162109375, 0.05596923828125,...	embed
18220248_c0	18220248	prolog	0	Title: to load the same prolog file into different modules in jpl Problem title: to load the same prolog file into different modules in jpl Tags: swi-prolog, prolog, jpl Problem: to load the same prolog file into different modules in jpl I am trying to use jpl to load the same swipl file into different modules. The rea...	to load the same prolog file into different modules in jpl to load the same prolog file into different modules in jpl swi-prolog prolog jpl jpl.PrologException PrologException permission_error load.pro load_files Non-module to_mess jpl.Query.get1 Query.java:336 jpl.Query.hasMoreSolutions Query.java:258 jpl.Query.oneSol...	[ 0.01470947265625, 0.035888671875, -0.0098876953125, 0.00093841552734375, -0.01434326171875, -0.01177978515625, 0.01483154296875, 0.00823974609375, 0.0035247802734375, -0.072265625, 0.00830078125, 0.00531005859375, -0.00396728515625, -0.02197265625, 0, 0.0198974609375, -0.0146484375, ...	[ 47, 72367, 5701, 502, 4867, 11435, 3934, 12921, 88996, 23, 1647, 2424, 2452, 3454, 10752, 63928, 1250, 168081, 188800, 29822, 3775, 83279, 3716, 41732, 58836, 24071, 122880, 102588, 34, 134900, 15265, 64552, 41, 91, 33657, 3525, 1653, 2063, ...	[ 0.033905029296875, 0.1976318359375, 0.1405029296875, 0.1798095703125, 0.23974609375, 0.13916015625, 0.1226806640625, 0.166259765625, 0.21142578125, 0.012908935546875, 0.0960693359375, 0.2340087890625, 0.1768798828125, 0.149169921875, 0.11767578125, 0.081787109375, 0.1348876953125, ...	embed
18592396_c0	18592396	prolog	0	Title: Predicate not working Problem title: Predicate not working Tags: predicate, prolog Problem: Predicate not working I'm new to prolog, and I really don't understand how things really work. Giving the following knowledge base, from a simplified social network: % user(nickname,email,city,friends_list) user(nick0,mai...	Predicate not working Predicate not working predicate prolog Predicate friends_list nick0 mail0 nick1 nick8 mail1 nick3 nick5 nick9 nick2 mail2 nick7 mail3 nick4 mail4 nick6 mail5 mail6 mail7 mail8 mail9 List Predicate not working I'm new to prolog, and I really don't understand how things really work. Giving the follo...	[ -0.0125732421875, -0.00885009765625, 0.001312255859375, -0.003814697265625, -0.0164794921875, 0.0128173828125, 0.001129150390625, -0.00982666015625, 0.002044677734375, -0.0225830078125, -0.007354736328125, -0.00592041015625, -0.006195068359375, -0.0169677734375, 0.006591796875, -0.0031...	[ 7145, 2063, 67, 959, 20697, 1653, 502, 4867, 23902, 6562, 128911, 2389, 6648, 1019, 363, 758, 1126, 32036, 3525, 28219, 8966, 6183, 4488, 25632, 51359, 3647, 112892, 2265, 33120, 3871, 44677, 33261, 26943, 139392, 5303, 26349, 678, 14012, 7...	[ 0.220947265625, 0.2685546875, 0.158935546875, 0.1629638671875, 0.217041015625, 0.1929931640625, 0.1773681640625, 0.22802734375, 0.1922607421875, 0.1793212890625, 0.1234130859375, 0.126708984375, 0.0849609375, 0.067626953125, 0.034515380859375, 0.0631103515625, 0.166259765625, 0.187...	embed
14095197_c0	14095197	prolog	0	Title: Count in prolog - Impossible to do Problem title: Count in prolog - Impossible to do Tags: prolog Problem: Count in prolog - Impossible to do EDIT : More simple : I changed my code to simplify. A predicate "nbarret" return the numbers of stations i want. So there is my new code, but it doesn't change anything : ...	Count in prolog - Impossible to do Count in prolog - Impossible to do prolog Count Impossible nb_stations Dir ERROR Arguments Exception _G2031 _G2270 _G2711 charles_de_gaulle_etoile bir_hakeim la_defense num_stations Dir1 Dir2 Count in prolog - Impossible to do EDIT : More simple : I changed my code to simplify. A pred...	[ 0.0027008056640625, -0.006072998046875, 0.00110626220703125, -0.00457763671875, 0.00885009765625, 0.007049560546875, 0.0079345703125, 0.00927734375, 0.0322265625, -0.06103515625, 0.00122833251953125, -0.00099945068359375, 0.000736236572265625, 0.0174560546875, 0.0208740234375, -0.01190...	[ 108210, 23, 502, 4867, 239596, 47, 54, 653, 275, 41311, 19946, 151206, 24638, 112140, 63928, 1549, 5016, 5757, 3768, 1662, 1577, 112, 49624, 31580, 1340, 263, 70704, 464, 21, 6211, 13269, 418, 304, 8781, 98816, 18151, 112892, 1653, 2063, ...	[ 0.243896484375, 0.106689453125, 0.16796875, 0.208740234375, 0.2274169921875, 0.06854248046875, 0.060791015625, 0.051544189453125, 0.10595703125, 0.209228515625, 0.07537841796875, 0.09649658203125, 0.013336181640625, 0.160400390625, 0.103759765625, 0.02008056640625, 0.1708984375, 0....	embed
38472425_c1	38472425	prolog	1	: gardener, highSchoolMathTeacher %Jim: vetAssistant, dishWasher %John: nurse, biologyTutor %Given Information, aka FACTS: %person(Name). person(mary). person(jim). person(john). %job(JobName). job(gardener). job(vetAssistant). job(dishWasher). job(nurse). job(highSchoolMathTeacher). job(biologyTutor). went_Out(nurse,v...	: gardener, highSchoolMathTeacher %Jim: vetAssistant, dishWasher %John: nurse, biologyTutor %Given Information, aka FACTS: %person(Name). person(mary). person(jim). person(john). %job(JobName). job(gardener). job(vetAssistant). job(dishWasher). job(nurse). job(highSchoolMathTeacher). job(biologyTutor). went_Out(nurse,v...	[ 0.01416015625, 0.031005859375, 0.0074462890625, 0.0211181640625, -0.0201416015625, 0.0294189453125, -0.037841796875, 0.0118408203125, 0.015380859375, -0.032958984375, -0.02099609375, 0.00482177734375, 0.0101318359375, 0.01287841796875, 0.012451171875, 0.0037994384765625, 0.0307617187...	[ 152, 80583, 56, 4, 11192, 25452, 43386, 199450, 10476, 934, 1745, 1375, 464, 12, 4213, 19659, 172, 42539, 45, 1495, 125673, 3334, 98385, 160020, 333, 25443, 15665, 1290, 37735, 1353, 32007, 15623, 155816, 30816, 163612, 3445, 1727, 53, 2030...	[ 0.07635498046875, 0.22900390625, 0.1719970703125, 0.0268402099609375, 0.116455078125, 0.07843017578125, 0.08172607421875, 0.163330078125, 0.0997314453125, 0.1466064453125, 0.1097412109375, 0.125732421875, 0.1846923828125, 0.05010986328125, 0.14453125, 0.0838623046875, 0.1319580078125...	embed
33721532_c0	33721532	prolog	0	Title: Prolog: Arguments are not sufficiently instantiated Problem title: Prolog: Arguments are not sufficiently instantiated Tags: prolog, clpfd, list Problem: Prolog: Arguments are not sufficiently instantiated I have the following problem: Generate all sub-strings of a length 2*n+1, formed from values of 0, 1 or -1,...	Prolog: Arguments are not sufficiently instantiated Prolog: Arguments are not sufficiently instantiated prolog clpfd list a Prolog Arguments N-M N-1 Prolog: Arguments are not sufficiently instantiated I have the following problem: This is what I did: All of the above code works correctly (I tested it). But with the fol...	[ -0.00121307373046875, -0.0098876953125, -0.00010013580322265625, 0.00799560546875, 0.000522613525390625, 0.0130615234375, -0.01385498046875, -0.0068359375, 0.0206298828125, -0.0111083984375, 0.01165771484375, -0.0133056640625, 0.015625, 0.0225830078125, 0.01190185546875, -0.02124023437...	[ 1250, 4867, 112140, 7, 621, 959, 129980, 538, 34648, 14, 27686, 502, 33139, 39557, 71, 5303, 541, 594, 5759, 2967, 18151, 43240, 26785, 3034, 25632, 9226, 43512, 18499, 44691 ]	[ 0.176025390625, 0.23681640625, 0.272216796875, 0.132568359375, 0.078857421875, 0.1650390625, 0.188232421875, 0.091552734375, 0.143798828125, 0.133544921875, 0.08544921875, 0.123779296875, 0.006195068359375, 0.04656982421875, 0.072021484375, 0.0970458984375, 0.031036376953125, 0.063...	embed
60780145_c0	60780145	prolog	0	Title: (Prolog) Check if a list can be split into 2 sub-lists that have equal sums Problem title: (Prolog) Check if a list can be split into 2 sub-lists that have equal sums Tags: subset-sum, subset, prolog Problem: (Prolog) Check if a list can be split into 2 sub-lists that have equal sums I am using Prolog to try and...	(Prolog) Check if a list can be split into 2 sub-lists that have equal sums (Prolog) Check if a list can be split into 2 sub-lists that have equal sums subset-sum subset prolog Prolog Check LEFT RIGHT SUM1 SUM2 (Prolog) Check if a list can be split into 2 sub-lists that have equal sums I am using Prolog to try and chec...	[ 0.00170135498046875, 0.0081787109375, 0.0263671875, 0.0016326904296875, -0.043212890625, 0.0069580078125, -0.00762939453125, 0.0185546875, 0.020751953125, 0.006744384765625, 0.01141357421875, 0.021484375, 0.0027618408203125, -0.0026397705078125, 0.01495361328125, 0.0201416015625, 0.0...	[ 10752, 4867, 38679, 2174, 5303, 831, 65450, 3934, 116, 1614, 6562, 7, 765, 105950, 10554, 3509, 11832, 502, 1250, 17428, 25217, 167177, 127944, 418, 304, 9790, 12765, 1159, 88500, 214493, 910, 35782, 116574, 18822, 1528, 105233, 184, 26513, ...	[ 0.1324462890625, 0.196044921875, 0.16455078125, 0.05743408203125, 0.1998291015625, 0.1195068359375, 0.206787109375, 0.09814453125, 0.1630859375, 0.212158203125, 0.2171630859375, 0.010650634765625, 0.03948974609375, 0.1741943359375, 0.169189453125, 0.1064453125, 0.1544189453125, 0.0...	embed
77737229_c0	77737229	prolog	0	Title: Prolog Predicates with A Variable Amount of Terms Problem title: Prolog Predicates with A Variable Amount of Terms Tags: prolog Problem: Prolog Predicates with A Variable Amount of Terms I'm trying to make a small Prolog program that can turn a term into html content. render_term(html(Head, Body), Output) :- Ope...	Prolog Predicates with A Variable Amount of Terms Prolog Predicates with A Variable Amount of Terms prolog Prolog Predicates Variable Amount Terms render_term Head Body Output OpenHtmlTag HeadOutput string_concat OutputWithHead BodyOutput ClosedHtmlTag Content ContentWithOpenTag body.html body.prolog Tag1 Tail Prolog P...	[ 0.01031494140625, 0.0252685546875, -0.004058837890625, 0.0022735595703125, -0.0208740234375, 0.000457763671875, -0.0038909912109375, 0.0084228515625, -0.006256103515625, -0.04638671875, 0.004302978515625, 0.00164031982421875, 0.004150390625, -0.022216796875, 0.006683349609375, 0.006805...	[ 1250, 4867, 7145, 2063, 1636, 678, 84572, 2886, 121147, 165504, 502, 89159, 32166, 44816, 43960, 13538, 13527, 18, 7237, 66448, 79858, 79315, 2271, 4460, 194583, 13025, 712, 153335, 70870, 103264, 14361, 7693, 3454, 4837, 1218, 379, 19336, 15...	[ 0.16796875, 0.247802734375, 0.1767578125, 0.1983642578125, 0.012481689453125, 0.074951171875, 0.17919921875, 0.0987548828125, 0.1331787109375, 0.2235107421875, 0.0875244140625, 0.1964111328125, 0.2120361328125, 0.1309814453125, 0.1207275390625, 0.09259033203125, 0.0694580078125, 0....	embed
8172687_c0	8172687	prolog	0	Title: Is there a way to translate database table rows into Prolog facts? Problem title: Is there a way to translate database table rows into Prolog facts? Tags: prolog, database, postgresql Problem: Is there a way to translate database table rows into Prolog facts? After doing some research, I was amazed with the powe...	Is there a way to translate database table rows into Prolog facts? Is there a way to translate database table rows into Prolog facts? prolog database postgresql Prolog mantenedora_ies ID_MANTENEDORA ID_IES papel_pessoa ID_PAPEL_MANTENEDORA ID_PAPEL_IES relacionamento_pessoa Is there a way to translate database table ro...	[ 0.032470703125, 0.004974365234375, 0.0137939453125, 0.00726318359375, -0.00135040283203125, 0.0081787109375, 0.0028228759765625, -0.005462646484375, -0.008544921875, -0.06884765625, 0.01275634765625, -0.0029754638671875, -0.03125, -0.00921630859375, -0.0225830078125, 0.00927734375, 0...	[ 2685, 3917, 3900, 19309, 63399, 23180, 15555, 7, 3934, 1250, 4867, 15824, 502, 1305, 17562, 99247, 31101, 13, 11606, 3387, 11338, 13940, 21170, 17610, 34468, 70418, 18164, 33144, 11, 12236, 111213, 128860, 2071, 10, 2527, 14537, 36510, 41, ...	[ 0.0228271484375, 0.11865234375, 0.1865234375, 0.190673828125, 0.1937255859375, 0.234130859375, 0.198486328125, 0.0953369140625, 0.136962890625, 0.1822509765625, 0.268310546875, 0.22607421875, 0.11376953125, 0.004364013671875, 0.191162109375, 0.0823974609375, 0.140869140625, 0.05664...	embed
37356113_c0	37356113	prolog	0	Title: Problems Understanding the Cut(!) Operator with example(Prolog Language) Problem title: Problems Understanding the Cut(!) Operator with example(Prolog Language) Tags: prolog-cut, prolog Problem: Problems Understanding the Cut(!) Operator with example(Prolog Language) I have the following rule: noRepetition([]). ...	Problems Understanding the Cut(!) Operator with example(Prolog Language) Problems Understanding the Cut(!) Operator with example(Prolog Language) prolog-cut prolog Problems Understanding Cut Operator Prolog Language Elem Rest Unfies Problems Understanding the Cut(!) Operator with example(Prolog Language) I have the fol...	[ 0.0184326171875, 0.0189208984375, 0.0306396484375, 0.0205078125, -0.0106201171875, 0.01239013671875, 0.003814697265625, 0.00101470947265625, 0.0191650390625, 0.00004553794860839844, -0.0203857421875, -0.0079345703125, -0.01019287109375, -0.00762939453125, 0.01287841796875, 0.0022430419...	[ 15649, 9626, 144057, 3003, 18, 151399, 150922, 27781, 10752, 4867, 83658, 502, 19774, 1250, 540, 195, 49756, 992, 1029, 25632, 79986, 7228, 28288, 5303, 1556, 110, 119140, 80854, 32786, 2174, 12830, 10617, 9655, 59226, 39933, 959, 9077, 14602...	[ 0.1031494140625, 0.098388671875, 0.07696533203125, 0.2020263671875, 0.126953125, 0.10028076171875, 0.26953125, 0.16455078125, 0.0718994140625, 0.1881103515625, 0.1304931640625, 0.0821533203125, 0.1995849609375, 0.058990478515625, 0.0186767578125, 0.1165771484375, 0.1856689453125, 0...	embed
62201804_c0	62201804	prolog	0	Title: Why prolog fails to find a route to a vertices (in graph)? Problem title: Why prolog fails to find a route to a vertices (in graph)? Tags: prolog Problem: Why prolog fails to find a route to a vertices (in graph)? I have a question to you: I have an exercise that says: Let there be given edges in the directed gr...	Why prolog fails to find a route to a vertices (in graph)? Why prolog fails to find a route to a vertices (in graph)? prolog Why go1 member1 Call _982 _1202 Exit _1206 Fail user:member1 Redo Why prolog fails to find a route to a vertices (in graph)? I have a question to you: I have an exercise that says: Let there be g...	[ 0.01123046875, 0.0172119140625, 0.005157470703125, 0.024658203125, -0.00274658203125, -0.009765625, -0.00799560546875, 0.011962890625, 0.0020599365234375, -0.0277099609375, 0.01116943359375, -0.01263427734375, -0.008056640625, 0.0096435546875, 0.01324462890625, 0.019287109375, 0.0142...	[ 44084, 502, 4867, 35782, 7, 7413, 36439, 47, 95378, 5170, 73, 41382, 738, 418, 32786, 26265, 16665, 304, 20840, 5443, 217, 1530, 9016, 190355, 38937, 27417, 9655, 81979, 10842, 2685, 34475, 121303, 8951, 46552, 876, 104, 1238, 420, 706, 8...	[ 0.1240234375, 0.1824951171875, 0.26123046875, 0.2049560546875, 0.02947998046875, 0.136474609375, 0.204833984375, 0.1357421875, 0.1845703125, 0.11328125, 0.03448486328125, 0.201171875, 0.150390625, 0.0928955078125, 0.1820068359375, 0.1409912109375, 0.1275634765625, 0.07720947265625,...	embed
61518394_c1	61518394	prolog	1	6, f12, f14, f21, f1, f10]). go(Case) :- case(Case, [H\|T]), getf124(Case, H). % determine acceptibilty of % F124, Defendent Ownership Rights getf124(Case,F) :- member(f3, F), write(['the defendent is the owner of secret']), nl, getf123(Case, [f124\|F]). getf124(Case,factorsSoFar):- write(['Accepted that the defendent is...	6, f12, f14, f21, f1, f10]). go(Case) :- case(Case, [H\|T]), getf124(Case, H). % determine acceptibilty of % F124, Defendent Ownership Rights getf124(Case,F) :- member(f3, F), write(['the defendent is the owner of secret']), nl, getf123(Case, [f124\|F]). getf124(Case,factorsSoFar):- write(['Accepted that the defendent is...	[ 0.00592041015625, 0.00787353515625, -0.006011962890625, 0.006011962890625, 0.01361083984375, -0.04345703125, -0.004119873046875, 0.01385498046875, 0.006927490234375, 0.0263671875, 0.01068115234375, 0.00063323974609375, -0.0023651123046875, -0.00118255615234375, -0.00099945068359375, 0....	[ 305, 4, 1238, 1530, 2592, 3117, 418, 963, 194, 738, 132, 441, 6991, 15772, 7225, 841, 58745, 618, 2046, 420, 109589, 572, 1745, 83324, 26946, 14, 2721, 939, 563, 85535, 26316, 18, 220197, 16070, 38927, 919, 32786, 363, 33022, 123823, 66...	[ 0.1685791015625, 0.04718017578125, 0.10418701171875, 0.204833984375, 0.2239990234375, 0.1302490234375, 0.0472412109375, 0.114501953125, 0.04022216796875, 0.231201171875, 0.009185791015625, 0.1326904296875, 0.18505859375, 0.07794189453125, 0.1611328125, 0.052734375, 0.014617919921875,...	embed
57736615_c0	57736615	prolog	0	Title: How can I inspect WAM code in SICStus Prolog Problem title: How can I inspect WAM code in SICStus Prolog Tags: prolog, warren-abstract-machine, sicstus-prolog Problem: How can I inspect WAM code in SICStus Prolog In the context of hacking clpz on sicstus-prolog I want to glimpse at the warren-abstract-machine co...	How can I inspect WAM code in SICStus Prolog How can I inspect WAM code in SICStus Prolog prolog warren-abstract-machine sicstus-prolog How WAM SICStus Prolog is_list is_list__clause1 dummy1 __clause1 is_list__clause2 dummy2 __clause2 GET_NIL_X0 PROCEED END_OF_CLAUSEQ user:is_list__clause1 GET_LIST_X0 U2_VOID_XVAR EXEC...	[ 0.00579833984375, 0.004058837890625, 0.00634765625, 0.0250244140625, -0.01361083984375, 0.02490234375, 0.00055694580078125, -0.006500244140625, -0.0054931640625, -0.0198974609375, 0.00799560546875, 0.00970458984375, -0.0230712890625, -0.0216064453125, 0.00830078125, 0.01348876953125, ...	[ 11249, 831, 134071, 4336, 594, 18151, 159, 102198, 2143, 1250, 4867, 502, 1631, 982, 2816, 103149, 26536, 18253, 3454, 83, 6562, 18347, 418, 8473, 1176, 304, 79794, 7787, 39015, 178102, 38937, 164, 23256, 61784, 16546, 23, 256, 169, 2676, ...	[ 0.012420654296875, 0.030303955078125, 0.25732421875, 0.141357421875, 0.192138671875, 0.214111328125, 0.08984375, 0.07684326171875, 0.1912841796875, 0.12744140625, 0.20458984375, 0.0950927734375, 0.0294952392578125, 0.1624755859375, 0.1422119140625, 0.1510009765625, 0.0732421875, 0....	embed
33554240_c0	33554240	prolog	0	Title: Converting logical puzzle into predicate calculus and prolog/dlv Problem title: Converting logical puzzle into predicate calculus and prolog/dlv Tags: answer-set-programming, logic, predicate, prolog Problem: Converting logical puzzle into predicate calculus and prolog/dlv The question is : The salt has been sto...	Converting logical puzzle into predicate calculus and prolog/dlv Converting logical puzzle into predicate calculus and prolog/dlv answer-set-programming logic predicate prolog Converting CATERPILLAR Bill Lizard CHESHIRE CAT Converting logical puzzle into predicate calculus and prolog/dlv The question is : The salt has ...	[ 0.01953125, -0.0087890625, -0.004791259765625, 0.0145263671875, -0.0079345703125, 0.0111083984375, -0.00860595703125, 0.0103759765625, -0.002960205078125, -0.0260009765625, -0.00958251953125, 0.003814697265625, -0.0169677734375, 0.01080322265625, 0.017333984375, 0.0205078125, 0.00097...	[ 1657, 814, 1916, 62775, 289, 104192, 3934, 1653, 2063, 67, 44805, 223, 502, 4867, 3723, 136, 35166, 3509, 28966, 23687, 14755, 146097, 16271, 19893, 80354, 4216, 83556, 69939, 11766, 100632, 9655, 581, 28279, 1556, 2809, 116496, 38, 14037, ...	[ 0.0218658447265625, 0.1370849609375, 0.010009765625, 0.178466796875, 0.070068359375, 0.23095703125, 0.05987548828125, 0.135009765625, 0.22705078125, 0.0989990234375, 0.2032470703125, 0.0999755859375, 0.13427734375, 0.1973876953125, 0.146728515625, 0.0176544189453125, 0.116943359375, ...	embed
17569923_c0	17569923	prolog	0	Title: Converting value of a term to an atom Problem title: Converting value of a term to an atom Tags: prolog Problem: Converting value of a term to an atom I appologise in advance if any of my terminology is off, its been a few years since I've touch Prolog and I decided to try and dust off my prolog cap and have ano...	Converting value of a term to an atom Converting value of a term to an atom prolog Converting animals_that_are Not does_animal_belong_to_group Species Group Animals Converting value of a term to an atom I appologise in advance if any of my terminology is off, its been a few years since I've touch Prolog and I decided t...	[ 0.017333984375, 0.0140380859375, 0.00921630859375, 0.01318359375, -0.0118408203125, 0.01318359375, -0.0159912109375, 0.0238037109375, -0.000858306884765625, -0.029296875, 0.01190185546875, 0.0167236328125, -0.0034637451171875, 0.01507568359375, 0.021728515625, 0.0004405975341796875, ...	[ 1657, 814, 34292, 13579, 47, 34627, 1916, 502, 4867, 85825, 1046, 11205, 14602, 161834, 372, 10617, 188, 51588, 24990, 10760, 82821, 12524, 18614, 5369, 23996, 1250, 3540, 88898, 18151, 2967, 62822, 159029, 45486, 21968, 141, 7986, 215624, 38...	[ 0.01605224609375, 0.1243896484375, 0.1854248046875, 0.211181640625, 0.086181640625, 0.23095703125, 0.00677490234375, 0.1207275390625, 0.2138671875, 0.20263671875, 0.00860595703125, 0.1807861328125, 0.09698486328125, 0.2393798828125, 0.0743408203125, 0.18798828125, 0.1270751953125, ...	embed
74026945_c0	74026945	prolog	0	Title: SWI-Prolog No permission to modify static procedure `set_prolog_flag/2' in init.pl Problem title: SWI-Prolog No permission to modify static procedure `set_prolog_flag/2' in init.pl Tags: prolog Problem: SWI-Prolog No permission to modify static procedure `set_prolog_flag/2' in init.pl I'm trying to mod...	SWI-Prolog No permission to modify static procedure `set_prolog_flag/2' in init.pl SWI-Prolog No permission to modify static procedure `set_prolog_flag/2' in init.pl prolog SWI-Prolog set_prolog_flag init.pl Documents Prolog swi-prolog.swipl ERROR init.pl:1 Welcome ABSOLUTELY WARRANTY Please answer_write_opti...	[ 0.01031494140625, 0.02099609375, 0.029541015625, -0.0026092529296875, -0.00848388671875, -0.01361083984375, -0.01190185546875, -0.0106201171875, 0.00457763671875, -0.0157470703125, -0.0032501220703125, 0.0126953125, -0.021484375, 0.0135498046875, 0.0076904296875, -0.0024261474609375, ...	[ 159, 38969, 10752, 4867, 438, 168081, 2811, 40383, 201939, 50491, 3509, 3454, 190872, 12477, 3768, 23, 217, 2424, 502, 5423, 1250, 2452, 151206, 19721, 91334, 60873, 30174, 109585, 18389, 168867, 61475, 180346, 75101, 13315, 209806, 15549, 1409...	[ 0.043609619140625, 0.2132568359375, 0.1575927734375, 0.205322265625, 0.0992431640625, 0.20703125, 0.144287109375, 0.0845947265625, 0.17919921875, 0.177490234375, 0.1103515625, 0.158447265625, 0.20849609375, 0.22216796875, 0.0933837890625, 0.1231689453125, 0.180908203125, 0.19201660...	embed
10133447_c0	10133447	prolog	0	Title: Is my heuristic algorithm correct? (Sudoku solver) Problem title: Is my heuristic algorithm correct? (Sudoku solver) Tags: prolog, sudoku, heuristics, algorithm Problem: Is my heuristic algorithm correct? (Sudoku solver) First of -yes this IS a homework- but it's primarily a theoretical question rather than a pr...	Is my heuristic algorithm correct? (Sudoku solver) Is my heuristic algorithm correct? (Sudoku solver) prolog sudoku heuristics algorithm 1 Sudoku Select Find Set Pick GoTo Solution Is my heuristic algorithm correct? (Sudoku solver) First of -yes this IS a homework- but it's primarily a theoretical question rather than ...	[ 0.0024871826171875, 0.01025390625, 0.01007080078125, 0.0067138671875, -0.0211181640625, 0.0052490234375, -0.018798828125, -0.0196533203125, -0.01483154296875, -0.018798828125, 0.0054931640625, -0.0015106201171875, -0.017578125, 0.004791259765625, -0.002410888671875, -0.0078125, -0.00...	[ 2071, 759, 764, 474, 48242, 234873, 26785, 11547, 319, 3115, 814, 502, 4867, 8932, 38067, 62210, 41637, 106, 15334, 51620, 26040, 19943, 122554, 2016, 7763, 187895, 294, 63736, 15744, 5368, 18244, 4524, 138155, 113292, 169935, 47644, 5122, 99...	[ 0.07562255859375, 0.1092529296875, 0.12158203125, 0.198486328125, 0.1883544921875, 0.27001953125, 0.208984375, 0.1309814453125, 0.166015625, 0.12158203125, 0.1558837890625, 0.08148193359375, 0.1650390625, 0.110107421875, 0.169189453125, 0.16650390625, 0.045013427734375, 0.008819580...	embed

69134347_c0

69134347

prolog

0

Title: Why does Prolog generate additional variables while querying? Problem title: Why does Prolog generate additional variables while querying? Tags: prolog Problem: Why does Prolog generate additional variables while querying? Knowledge base: child(martha,charlotte). child(charlotte,caroline). child(caroline,laura)....

Why does Prolog generate additional variables while querying? Why does Prolog generate additional variables while querying? prolog Why Prolog _2978 Call Fail Redo HERE Exit _3233 Why does Prolog generate additional variables while querying? Knowledge base: Query: descend(martha, laura). Prolog first calls child(martha,...

[ 0.0179443359375, 0.008544921875, -0.01031494140625, 0.00579833984375, -0.0081787109375, 0.0096435546875, -0.0181884765625, 0.00946044921875, 0.01153564453125, -0.0201416015625, 0.0010528564453125, -0.0286865234375, -0.0263671875, -0.0037841796875, 0.007720947265625, 0.003265380859375, ...

[ 44084, 1250, 4867, 139392, 78301, 77336, 7, 12960, 41, 1294, 214, 502, 4235, 19051, 26265, 190355, 6096, 31, 65791, 5443, 105586, 191428, 3647, 58836, 53, 60887, 31809, 21, 3168, 5117, 11782, 29041, 35782, 30646, 47, 27117, 567, 12765, 2728...

[ 0.1175537109375, 0.199462890625, 0.2802734375, 0.18408203125, 0.156005859375, 0.265625, 0.028167724609375, 0.0819091796875, 0.1209716796875, 0.1326904296875, 0.0350341796875, 0.150390625, 0.1533203125, 0.22802734375, 0.1597900390625, 0.1995849609375, 0.0867919921875, 0.119018554687...

embed

41106353_c1

41106353

prolog

1

wapping, _G3131, [shadwell, whitechapel]) ? creep Call: (11) link(wapping, _G3130, east_london) ? creep Exit: (11) link(wapping, rotherhithe, east_london) ? creep Call: (11) next_station(east_london, rotherhithe, _G3134, [wapping, shadwell, whitechapel]) ? creep Call: (12) link(rotherhithe, _G3133, east_london) ? cree...

[ -0.0005950927734375, -0.00958251953125, 0.007293701171875, 0.0111083984375, 0.005035400390625, 0.00390625, 0.0021820068359375, -0.017822265625, 0.0208740234375, -0.002685546875, -0.01275634765625, 0.0274658203125, -0.0225830078125, 0.00469970703125, 0.000331878662109375, -0.00408935546...

[ 259, 26783, 4, 101, 724, 5016, 99225, 19256, 35011, 1436, 5310, 268, 705, 49512, 254, 26265, 12, 21282, 3126, 634, 1197, 28, 4438, 4759, 4445, 5443, 217, 2062, 9319, 127, 10902, 11737, 41311, 363, 114082, 23676, 125158, 613, 36840, 138414...

[ 0.181884765625, 0.2330322265625, 0.0155792236328125, 0.038543701171875, 0.10693359375, 0.259033203125, 0.1546630859375, 0.2259521484375, 0.115234375, 0.09063720703125, 0.1600341796875, 0.029754638671875, 0.06256103515625, 0.212646484375, 0.1768798828125, 0.2213134765625, 0.0776977539...

embed

66301190_c1

66301190

prolog

1

codes . Traditionally, a double-quoted string is exploded into a list of codes , and this notation also works SWI-Prolog in DCG contexts, even though SWI-Prolog maps a "double-quoted string" to the special string datatype otherwise. `0123` . Traditonally, text within back-quotes is mapped to an atom (I think, the 95 I...

[ 0.020751953125, -0.00921630859375, 0.01446533203125, 0.0255126953125, -0.00063323974609375, -0.004364013671875, 0.01116943359375, 0.00113677978515625, -0.0050048828125, 0.0093994140625, -0.01080322265625, -0.0250244140625, -0.02099609375, -0.00139617919921875, -0.003997802734375, 0.011...

[ 18151, 7, 5, 97299, 10, 41929, 9, 68726, 71, 79315, 83, 24649, 48141, 3934, 5303, 110, 22062, 43240, 159, 38969, 10752, 4867, 391, 56367, 43701, 22288, 21555, 2661, 5361, 2053, 50986, 120262, 6746, 3742, 69121, 1507, 7986, 28032, 4420, 29...

[ 0.2437744140625, 0.05682373046875, 0.0151519775390625, 0.100830078125, 0.013275146484375, 0.2081298828125, 0.037841796875, 0.239013671875, 0.08056640625, 0.219482421875, 0.03582763671875, 0.206298828125, 0.0986328125, 0.078857421875, 0.1240234375, 0.1065673828125, 0.0295257568359375,...

embed

68610581_c1

68610581

prolog

1

--> []. nat_space(N) --> { var(N) }, " ", nat_space(M), { N is M+1 }. nat_space(M) --> { nonvar(M), M>0 }, " ", { N is M-1 }, nat_space(N). which does work fine: ?- Anz_Spaces=3,my_string_codes(String,Codes), once(phrase(nat_space(Anz_Spaces), Codes, [])). Anz_Spaces = 3, String = " ", Codes = [32, 32, 32]. ?- String=...

[ -0.001373291015625, 0.007568359375, -0.01153564453125, 0.01068115234375, 0.00034332275390625, 0.0157470703125, 0.01165771484375, -0.00872802734375, 0.0361328125, -0.031982421875, 0.024169921875, -0.01177978515625, -0.007049560546875, 0.01556396484375, 0.0030364990234375, 0.010864257812...

[ 129908, 24, 18, 454, 65421, 839, 16, 285, 51912, 44, 594, 247, 541, 83, 276, 21748, 351, 1961, 2389, 4, 5759, 3129, 14602, 4488, 5885, 893, 169, 141012, 7, 76067, 1176, 91693, 40899, 132, 71713, 214, 114211, 24145, 179665, 184, 7695, ...

[ 0.0654296875, 0.1785888671875, 0.1907958984375, 0.067138671875, 0.26953125, 0.1558837890625, 0.00836181640625, 0.1966552734375, 0.00634765625, 0.0081787109375, 0.0994873046875, 0.008636474609375, 0.1009521484375, 0.020843505859375, 0.07293701171875, 0.1553955078125, 0.1015625, 0.15...

embed

77226982_c1

77226982

prolog

1

* predicates read_list(intl) reverse(intl, intl) append(intll, intll, intll) app(intl, intl, intl) length(intl, int) cut(intl, int, intl) subseq(intl, int, int, intl) prefixes(intl, int, intll) all_sublists(intl, intll) is_pal(intl) all_pals(intll, intll) all_palindroms(intl, intll) belongs_to_sublist(int, intll) filte...

[ 0.0027923583984375, 0.01708984375, 0.01397705078125, 0.0120849609375, -0.0096435546875, 0.01544189453125, 0.0211181640625, 0.01043701171875, 0.0233154296875, -0.0257568359375, 0.0126953125, 0.0026702880859375, -0.00933837890625, -0.00146484375, 0.00946044921875, 0.0010833740234375, 0...

[ 661, 1653, 2063, 1636, 12301, 454, 6562, 4288, 141, 16, 39531, 184, 23, 18, 114689, 71, 1181, 4027, 140909, 59226, 1614, 864, 4, 183114, 90, 756, 22144, 7, 132, 83, 5007, 73, 41684, 186, 10617, 188, 46312, 62766, 32786, 70731, 13025, ...

[ 0.16845703125, 0.20458984375, 0.2313232421875, 0.13525390625, 0.2110595703125, 0.05084228515625, 0.23046875, 0.196044921875, 0.135498046875, 0.005462646484375, 0.1949462890625, 0.12939453125, 0.0904541015625, 0.1246337890625, 0.200439453125, 0.0675048828125, 0.2205810546875, 0.1926...

embed

61731888_c0

61731888

prolog

0

Title: Cartesian product of a list in Prolog Problem title: Cartesian product of a list in Prolog Tags: prolog Problem: Cartesian product of a list in Prolog So what I want to achieve is the following: A predicate that when given 2 lists returns a list of the Cartesian products of the elements. Here is an example. list...

Cartesian product of a list in Prolog Cartesian product of a list in Prolog prolog Cartesian Prolog list_mult Lfinal add_list Res Cartesian product of a list in Prolog So what I want to achieve is the following: A predicate that when given 2 lists returns a list of the Cartesian products of the elements. Here is an exa...

[ -0.003753662109375, 0.017578125, 0.0096435546875, 0.00909423828125, -0.016845703125, 0.01171875, -0.00347900390625, -0.01123046875, 0.0019989013671875, -0.0203857421875, 0.0028228759765625, 0.0262451171875, 0.0030670166015625, 0.001495361328125, -0.022705078125, -0.00144195556640625, ...

[ 106274, 39209, 12996, 111, 5303, 1250, 4867, 502, 81944, 339, 33870, 15190, 6562, 9624, 3444, 69307, 1653, 2063, 67, 34475, 116, 30646, 38742, 80854, 27781, 101935, 15044, 3871, 33022, 6024, 62479, 5701, 1614, 17721, 3789, 15458, 4028, 61924,...

[ 0.1884765625, 0.1741943359375, 0.2354736328125, 0.024169921875, 0.1854248046875, 0.144775390625, 0.2379150390625, 0.115966796875, 0.1988525390625, 0.03515625, 0.239990234375, 0.0989990234375, 0.169677734375, 0.10400390625, 0.0283966064453125, 0.0595703125, 0.1427001953125, 0.183837...

embed

34796368_c1

34796368

prolog

1

, [kurt_allgen, mona_malm] ). group( project_office, ahmed_hassan, [kurt_allgen, anna_nilsson] ). group( recruitment, lill_nilsson, [annie_cedrell, jonna_spjuth] ). group( salaries, bengt_karlsson, [gullbritt_svensson, siri_hallin] ). group( assembly, rune_runesson, [johnny_kraft] ). group( testing, allan_snygg, [edvin...

[ 0.004119873046875, -0.0018310546875, 0.000018358230590820312, 0.0164794921875, -0.0172119140625, 0.0084228515625, -0.0179443359375, -0.0120849609375, 0.0140380859375, 0.0057373046875, -0.0137939453125, 0.015869140625, -0.00787353515625, 0.00732421875, -0.000560760498046875, 0.000717163...

[ 2971, 18, 5584, 1409, 2667, 11, 2749, 39, 21115, 13452, 65024, 1263, 4806, 120516, 19, 78656, 17324, 4503, 172310, 400, 1181, 66, 701, 37534, 58248, 70656, 76, 461, 927, 4559, 1585, 5386, 1153, 146638, 80971, 1353, 76414, 95914, 132, 8984...

[ 0.080322265625, 0.082763671875, 0.09521484375, 0.1666259765625, 0.10693359375, 0.10357666015625, 0.06494140625, 0.095947265625, 0.2376708984375, 0.1473388671875, 0.2176513671875, 0.0148162841796875, 0.103759765625, 0.0914306640625, 0.067138671875, 0.10504150390625, 0.06805419921875, ...

embed

36673733_c0

36673733

prolog

0

Title: Prolog: generate queries out of DCG Problem title: Prolog: generate queries out of DCG Tags: prolog, call, dcg Problem: Prolog: generate queries out of DCG I currently have a small Prolog database containing a few people and some predicates for relations. For example: female(anna). female(susan). male(john). mal...

Prolog: generate queries out of DCG Prolog: generate queries out of DCG prolog call dcg Prolog DCG Prolog: generate queries out of DCG I currently have a small Prolog database containing a few people and some predicates for relations. For example: and I have a DCG which can determine valid questions like "who is the br...

[ 0.028076171875, -0.004547119140625, 0.01318359375, 0.0245361328125, 0.005767822265625, 0.03271484375, -0.006744384765625, -0.013671875, 0.01031494140625, -0.09130859375, -0.023193359375, -0.00439453125, -0.0216064453125, 0.01031494140625, 0.00970458984375, -0.0037078857421875, 0.0037...

[ 1250, 4867, 139392, 41, 10484, 1810, 111, 391, 56367, 12, 502, 11782, 104, 238, 177, 82424, 19336, 63399, 70541, 10846, 3395, 1653, 2063, 91582, 27781, 831, 83324, 35604, 17582, 497, 83, 82953, 35254, 19, 43240, 5299, 3444, 1528, 3249, 47...

[ 0.1405029296875, 0.233642578125, 0.170166015625, 0.1630859375, 0.1478271484375, 0.1229248046875, 0.09417724609375, 0.1192626953125, 0.210205078125, 0.00140380859375, 0.0931396484375, 0.1929931640625, 0.0413818359375, 0.0413818359375, 0.09515380859375, 0.04718017578125, 0.055328369140...

embed

30069099_c0

30069099

prolog

0

Title: Residual constraints with reification in clpfd Problem title: Residual constraints with reification in clpfd Tags: swi-prolog, prolog, clpfd Problem: Residual constraints with reification in clpfd I defined reified variants of the clpfd constraints (#<)/2 , (#=<)/2 , (#>=)/2 and (#>)/2 : :- use_module(library(cl...

Residual constraints with reification in clpfd Residual constraints with reification in clpfd swi-prolog prolog clpfd Residual use_module Truth bool01_truth _G968 _G912 _G1301 _G1243 Residual constraints with reification in clpfd I defined reified variants of the clpfd constraints (#<)/2 , (#=<)/2 , (#>=)/2 and (#>)/2 ...

[ -0.0035400390625, 0.0074462890625, 0.011474609375, 0.01019287109375, 0.0234375, -0.00787353515625, -0.003936767578125, 0.01385498046875, -0.005035400390625, 0.01531982421875, -0.003173828125, 0.0000400543212890625, -0.0133056640625, 0.0224609375, 0.03662109375, 0.0166015625, 0.019531...

[ 9624, 21937, 158, 2816, 4288, 678, 456, 41274, 33139, 39557, 71, 2452, 3454, 4867, 502, 4527, 83279, 184431, 142484, 6746, 75481, 11648, 1019, 1126, 1530, 43955, 11548, 61924, 47314, 20117, 16093, 12477, 96, 18, 284, 18113, 136, 571, 12684,...

[ 0.1217041015625, 0.2120361328125, 0.10491943359375, 0.18701171875, 0.1279296875, 0.06329345703125, 0.138427734375, 0.2193603515625, 0.1055908203125, 0.1300048828125, 0.1544189453125, 0.1412353515625, 0.0980224609375, 0.1842041015625, 0.0777587890625, 0.08544921875, 0.1099853515625, ...

embed

8344823_c0

8344823

prolog

0

Title: Choosing all possible options from List in Prolog Problem title: Choosing all possible options from List in Prolog Tags: prolog, list, river-crossing-puzzle, forall Problem: Choosing all possible options from List in Prolog So I have to write different procedures that will help me solve the farmer-wolf-goat-cabb...

Choosing all possible options from List in Prolog Choosing all possible options from List in Prolog prolog list river-crossing-puzzle forall List Choosing Prolog Choosing all possible options from List in Prolog So I have to write different procedures that will help me solve the farmer-wolf-goat-cabbage-fertilizer puzz...

[ -0.01141357421875, -0.009765625, -0.00872802734375, 0.0172119140625, -0.032958984375, 0.0048828125, -0.0260009765625, 0.0086669921875, 0.0113525390625, 0.0004520416259765625, 0.0146484375, -0.0198974609375, 0.0130615234375, 0.0087890625, -0.011962890625, 0.01507568359375, 0.007263183...

[ 4960, 232, 756, 7722, 50717, 1295, 32036, 1250, 4867, 23, 502, 5303, 96113, 95665, 214, 1766, 13894, 133, 100, 5584, 50491, 4358, 86869, 171751, 25400, 420, 519, 257, 408, 45391, 429, 2875, 24493, 4383, 104192, 3714, 41421, 23924, 4620, 2...

[ 0.07318115234375, 0.064453125, 0.124267578125, 0.202880859375, 0.246337890625, 0.0802001953125, 0.2012939453125, 0.15673828125, 0.231201171875, 0.0298309326171875, 0.1192626953125, 0.1925048828125, 0.148193359375, 0.149658203125, 0.055999755859375, 0.0821533203125, 0.10235595703125, ...

embed

36430150_c1

36430150

prolog

1

], [*,spots(8,2),spots(8,3),spots(8,4),*,spots(8,6),spots(8,7),spots(8,8),spots(8,9),*,spots(8,11),spots(8,12)], [*,spots(9,2),spots(9,3),*,spots(9,5),spots(9,6),*,*,spots(9,9),spots(9,10),spots(9,11),spots(9,12)], [*,spots(10,2),spots(10,3),*,spots(10,5),spots(10,6),spots(10,7),spots(10,8),*,spots(10,10),spots(10,11),...

[ 0.007080078125, 0.0081787109375, -0.0047607421875, -0.002471923828125, -0.004241943359375, 0.00885009765625, 0.004364013671875, -0.0027923583984375, 0.015380859375, -0.0185546875, 0.006744384765625, -0.0062255859375, -0.00457763671875, -0.010986328125, -0.00823974609375, 0.026000976562...

[ 10114, 4, 378, 1639, 53370, 7, 1019, 10461, 132, 21320, 29557, 59690, 186922, 247, 50490, 145180, 48105, 55102, 268, 1126, 93754, 191534, 178692, 50258, 90980, 36076, 1662, 163324, 41600, 188523, 179941, 198889, 134186, 3444, 47, 4527, 7413, ...

[ 0.045257568359375, 0.01324462890625, 0.0159149169921875, 0.0836181640625, 0.2371826171875, 0.034942626953125, 0.1220703125, 0.08245849609375, 0.0128173828125, 0.0784912109375, 0.1297607421875, 0.05670166015625, 0.10546875, 0.0130615234375, 0.05999755859375, 0.1080322265625, 0.1132812...

embed

9647434_c0

9647434

prolog

0

Title: Finding letters in a word that have different orders Problem title: Finding letters in a word that have different orders Tags: prolog Problem: Finding letters in a word that have different orders Here is a description of a prolog program that I am working on: user might enter a 5 letter word, and the only letter...

Finding letters in a word that have different orders Finding letters in a word that have different orders prolog Finding U-Z A1-A5 Finding letters in a word that have different orders Here is a description of a prolog program that I am working on: user might enter a 5 letter word, and the only letters allowed are a,b,c...

[ 0.0196533203125, -0.0135498046875, 0.005035400390625, 0.00726318359375, 0.005126953125, 0.0185546875, -0.01153564453125, -0.0052490234375, 0.0164794921875, 0.0037994384765625, 0.00927734375, 0.0079345703125, 0.014892578125, 0.0004730224609375, 0.006683349609375, -0.005767822265625, -...

[ 26040, 214, 120820, 23, 2565, 450, 765, 12921, 12989, 502, 4867, 345, 9, 1511, 62, 20268, 284, 758, 76811, 1528, 20697, 38937, 13648, 30957, 190, 31330, 4734, 107003, 621, 275, 238, 71, 1543, 959, 756, 34153, 9844, 164805, 441, 876, 136...

[ 0.15478515625, 0.0281829833984375, 0.2362060546875, 0.07958984375, 0.1796875, 0.01953125, 0.0604248046875, 0.193359375, 0.212158203125, 0.134033203125, 0.18701171875, 0.05987548828125, 0.00396728515625, 0.1123046875, 0.0887451171875, 0.034210205078125, 0.0836181640625, 0.1021728515...

embed

31058929_c1

31058929

prolog

1

92503131e-16__2.2204460492503131e-16 Yes (0.00s cpu) This interval does not contain 0.0. I am aware that interval arithmetic often is a bit too approximate as in: [eclipse 4]: 1 $= sqrt(1). Delayed goals: 0 $= -1.1102230246251565e-16__2.2204460492503131e-16 Yes (0.00s cpu) But at least the equation holds! However, in t...

[ -0.0087890625, -0.0135498046875, -0.00067138671875, 0.01312255859375, 0.006378173828125, 0.0120849609375, 0.006103515625, 0.005035400390625, 0.0211181640625, 0.021728515625, 0.00787353515625, 0.035400390625, -0.0308837890625, -0.004913330078125, 0.0234375, 0.0027618408203125, 0.01989...

[ 171012, 9513, 115468, 13, 13528, 70147, 147758, 158332, 12977, 24291, 5016, 32635, 37509, 7, 1766, 3293, 51514, 14602, 959, 70541, 89678, 107419, 8962, 282, 9523, 27983, 4785, 5792, 35707, 5134, 15829, 106371, 184, 201, 106, 3650, 864, 3198, ...

[ 0.1629638671875, 0.0200958251953125, 0.10125732421875, 0.04461669921875, 0.177001953125, 0.0203094482421875, 0.04168701171875, 0.03643798828125, 0.011810302734375, 0.0268402099609375, 0.0924072265625, 0.09619140625, 0.1903076171875, 0.0186614990234375, 0.1656494140625, 0.03262329101562...

embed

35276850_c1

35276850

prolog

1

there other approaches than mine that does not cover 50+ lines? Updated Thanks a lot, the code became so much cleaner - it might go further, but now it is possible to actually post here (this is modified a bit - but the logic is there) inPeriods(Day, [ period(Start,End) | _ ]) :- between(Start,End, Day). inPeriods(Day...

[ -0.007476806640625, 0.01458740234375, 0.0184326171875, 0.017578125, -0.01214599609375, 0.021240234375, -0.0179443359375, 0.005828857421875, 0.0067138671875, -0.025146484375, -0.01055908203125, 0.029296875, -0.0113525390625, 0.0037384033203125, 0.01019287109375, 0.0152587890625, 0.012...

[ 2685, 3789, 51515, 90, 3501, 5665, 14602, 959, 29256, 836, 1328, 124519, 28641, 5915, 70, 18151, 100512, 221, 5045, 46622, 56, 20, 442, 13648, 53333, 4, 5036, 83, 7722, 20653, 1305, 3688, 73197, 297, 62775, 16, 23, 15277, 846, 6468, 132...

[ 0.03448486328125, 0.09136962890625, 0.23974609375, 0.0880126953125, 0.034820556640625, 0.14697265625, 0.003021240234375, 0.06121826171875, 0.19189453125, 0.1490478515625, 0.093017578125, 0.2039794921875, 0.158203125, 0.044708251953125, 0.0369873046875, 0.2330322265625, 0.071472167968...

embed

35677482_c1

35677482

prolog

1

al_del_norte, morelos,candelaria,fray_servando,jamaica,santa_anita]). linea(5,[politecnico,instituto_del_petroleo,autobuses_norte,la_raza,misterios, valle_gomez,consulado,eduardo_molina,aragon,oceania,terminal_aerea, hangares,pantitlan]). linea(6,[el_rosario,tezozomoc,azcapotzalco,ferreria,norte_45,vallejo, instituto_d...

[ -0.0054931640625, 0.006439208984375, 0.0140380859375, 0.0306396484375, 0.000507354736328125, 0.00469970703125, 0.0035858154296875, 0.006256103515625, 0.0050048828125, -0.020751953125, -0.004425048828125, -0.017333984375, -0.0019989013671875, 0.0028839111328125, 0.00164794921875, -0.004...

[ 144, 1743, 13665, 67, 1286, 2400, 4, 6232, 6000, 53, 65756, 557, 19616, 2063, 116357, 66, 913, 268, 194, 42592, 104116, 74132, 3240, 12150, 65382, 5408, 82512, 8913, 4223, 90, 143, 5272, 11, 81334, 31669, 118666, 11723, 202, 43932, 432, ...

[ 0.15478515625, 0.1868896484375, 0.1630859375, 0.06744384765625, 0.0740966796875, 0.138427734375, 0.003875732421875, 0.09320068359375, 0.0284423828125, 0.00115966796875, 0.107666015625, 0.08489990234375, 0.0809326171875, 0.0283203125, 0.02349853515625, 0.008209228515625, 0.09027099609...

embed

40291548_c0

40291548

prolog

0

Title: Simple Prolog program: "Arguments are not sufficiently instantiated" error Problem title: Simple Prolog program: "Arguments are not sufficiently instantiated" error Tags: prolog, instantiation-error, clpfd Problem: Simple Prolog program: "Arguments are not sufficiently instantiated" error I a...

Simple Prolog program: "Arguments are not sufficiently instantiated" error Simple Prolog program: "Arguments are not sufficiently instantiated" error prolog instantiation-error clpfd Simple Prolog Arguments ERROR Simple Prolog program: "Arguments are not sufficiently instantiated" error I am writing...

[ -0.0103759765625, 0.0194091796875, 0.0186767578125, 0.0216064453125, 0.01507568359375, 0.03466796875, 0.004364013671875, 0.015625, 0.0283203125, -0.02880859375, 0.004486083984375, -0.0294189453125, 0.003753662109375, 0.0096435546875, 0.0213623046875, -0.00372314453125, 0.026123046875...

[ 60552, 1250, 4867, 1528, 7614, 1234, 9035, 621, 959, 129980, 34648, 14, 27686, 18499, 502, 188800, 39557, 71, 112140, 151206, 32562, 1653, 2063, 67, 314, 5117, 17262, 80854, 5773, 14012, 5303, 28412, 16750, 27781, 7311, 3638, 33342, 140909, ...

[ 0.188720703125, 0.1947021484375, 0.230224609375, 0.1279296875, 0.1387939453125, 0.253173828125, 0.162841796875, 0.08135986328125, 0.1580810546875, 0.2142333984375, 0.1617431640625, 0.160400390625, 0.10791015625, 0.170654296875, 0.12646484375, 0.14404296875, 0.0369873046875, 0.05468...

embed

45183170_c0

45183170

prolog

0

Title: How to make a prolog program return the value it computed Problem title: How to make a prolog program return the value it computed Tags: prolog Problem: How to make a prolog program return the value it computed (I'm not sur if return is the right word to describe it, but that's the best one I could find.) I am t...

How to make a prolog program return the value it computed How to make a prolog program return the value it computed prolog How How to make a prolog program return the value it computed (I'm not sur if return is the right word to describe it, but that's the best one I could find.) I am trying to write a small program in...

[ -0.00592041015625, 0.01434326171875, 0.006011962890625, 0.005584716796875, -0.017578125, 0.0205078125, -0.0031280517578125, -0.003387451171875, 0.01031494140625, -0.038330078125, 0.00531005859375, 0.0013275146484375, -0.0245361328125, -0.004119873046875, 0.0140380859375, 0.006561279296...

[ 11249, 3249, 502, 4867, 1528, 30646, 70, 34292, 442, 375, 7077, 297, 2565, 98363, 2965, 31577, 33022, 19336, 4527, 32354, 15190, 47, 54, 127664, 5256, 11675, 68034, 35839, 3034, 16750, 1511, 2203, 10554, 155761, 44116, 567, 114997, 2967, 20...

[ 0.07305908203125, 0.10614013671875, 0.1746826171875, 0.2335205078125, 0.211669921875, 0.265869140625, 0.089599609375, 0.196044921875, 0.1015625, 0.0794677734375, 0.18505859375, 0.0860595703125, 0.008026123046875, 0.010772705078125, 0.0357666015625, 0.046051025390625, 0.205078125, 0...

embed

35358436_c0

35358436

prolog

0

Title: Prolog: Arrangements of k elements with sum of elements S Problem title: Prolog: Arrangements of k elements with sum of elements S Tags: permutation, clpfd, combinations, list, prolog Problem: Prolog: Arrangements of k elements with sum of elements S I am trying to compute arrangements of K elements in Prolog, w...

Prolog: Arrangements of k elements with sum of elements S Prolog: Arrangements of k elements with sum of elements S permutation clpfd combinations list prolog Prolog Arrangements K-1 Tail Prolog: Arrangements of k elements with sum of elements S I am trying to compute arrangements of K elements in Prolog, where the sum...

[ 0.006805419921875, 0.0230712890625, 0.01251220703125, -0.00469970703125, -0.01385498046875, -0.000152587890625, -0.033203125, 0.0111083984375, 0.0111083984375, -0.0272216796875, 0.01116943359375, 0.0064697265625, 0.007568359375, 0.0037384033203125, -0.000873565673828125, 0.011474609375...

[ 1250, 4867, 187301, 429, 9035, 472, 80854, 678, 10554, 159, 117, 561, 39557, 71, 162515, 5303, 502, 341, 5759, 1218, 379, 31577, 9969, 6743, 70767, 111, 23, 2363, 105950, 34475, 831, 375, 7077, 390, 90791, 3714, 3642, 14311, 21094, 19441,...

[ 0.181640625, 0.251953125, 0.1976318359375, 0.1357421875, 0.026885986328125, 0.167724609375, 0.2332763671875, 0.038055419921875, 0.20166015625, 0.14501953125, 0.102294921875, 0.14501953125, 0.05181884765625, 0.06134033203125, 0.244873046875, 0.1622314453125, 0.08935546875, 0.2196044...

embed

43966167_c0

43966167

prolog

0

Title: How to write a Prolog predicate that will return a list of successor facts, sorted by value Problem title: How to write a Prolog predicate that will return a list of successor facts, sorted by value Tags: list, logic, prolog, sorting Problem: How to write a Prolog predicate that will return a list of successor f...

How to write a Prolog predicate that will return a list of successor facts, sorted by value How to write a Prolog predicate that will return a list of successor facts, sorted by value list logic prolog sorting How Prolog get_order_successors Item Rest DisregardHead Tail How to write a Prolog predicate that will return ...

[ 0.0130615234375, 0.0030059814453125, -0.016357421875, -0.01556396484375, -0.007537841796875, -0.0025787353515625, -0.00095367431640625, -0.019775390625, 0.011962890625, -0.021240234375, 0.0257568359375, 0.01165771484375, -0.0169677734375, -0.029541015625, 0.00531005859375, -0.004791259...

[ 11249, 33022, 1250, 4867, 1653, 2063, 67, 30646, 5303, 39457, 42, 15824, 7, 17497, 390, 34292, 1221, 62775, 502, 12096, 2046, 80596, 226534, 4970, 78426, 49756, 42077, 13025, 712, 1218, 379, 866, 31577, 12989, 82800, 214, 27781, 6713, 2060,...

[ 0.06396484375, 0.15283203125, 0.1722412109375, 0.248779296875, 0.1607666015625, 0.2056884765625, 0.1044921875, 0.157958984375, 0.1583251953125, 0.2056884765625, 0.111328125, 0.1507568359375, 0.022247314453125, 0.15625, 0.06671142578125, 0.181884765625, 0.0243988037109375, 0.0704956...

embed

77582360_c1

77582360

prolog

1

(Xs, X1, [X0], Run, Rest). % for an ascending prefix, the run is built up as a QUEUE % for a descending prefix, the run is built up as a STACK descending([], X0, Run, [X0|Run], []). descending([X1|Xs], X0, Run0, Run, Rest) :- ( X0 @< X1 -> Run = [X0|Run0], Rest = [X1|Xs] ; descending(Xs, X1, [X0|Run0], Run, Rest) ). Ex...

[ 0.00152587890625, 0.0004482269287109375, 0.0096435546875, -0.0020904541015625, -0.007598876953125, 0.01220703125, 0.000667572021484375, -0.025390625, 0.017333984375, -0.01092529296875, 0.024169921875, 0.041748046875, -0.00970458984375, 0.00098419189453125, 0.00408935546875, 0.020996093...

[ 1542, 7, 1193, 418, 2389, 28398, 49756, 1745, 100, 82800, 214, 183114, 11675, 88303, 1257, 237, 21389, 37066, 60887, 64174, 20572, 4, 163321, 15772, 89536, 705, 127877, 132, 116, 483, 382, 190, 138, 361, 305, 201, 757, 627, 2203, 220133, ...

[ 0.1407470703125, 0.064697265625, 0.0982666015625, 0.095703125, 0.1407470703125, 0.195068359375, 0.1923828125, 0.126708984375, 0.021820068359375, 0.172119140625, 0.0545654296875, 0.26025390625, 0.1895751953125, 0.11474609375, 0.051727294921875, 0.05914306640625, 0.1307373046875, 0.1...

embed

66143858_c0

66143858

prolog

0

Title: Converting list of clauses to a query? Problem title: Converting list of clauses to a query? Tags: clause, list, prolog, call Problem: Converting list of clauses to a query? let say i have the following facts : book(65). own(named('Peter'), 65). now got the query as a list of clauses : [what(A), own(named('Peter...

Converting list of clauses to a query? Converting list of clauses to a query? clause list prolog call Converting Peter query_lst Res lst2conj Conj Converting list of clauses to a query? let say i have the following facts : now got the query as a list of clauses : or how do I make a rule that accept this list and return...

[ -0.00872802734375, 0.0341796875, 0.001190185546875, 0.0093994140625, -0.0030975341796875, 0.003662109375, -0.01458740234375, 0.00531005859375, 0.007598876953125, -0.0439453125, -0.01531982421875, -0.011962890625, -0.00823974609375, 0.02001953125, -0.00433349609375, 0.01141357421875, ...

[ 1657, 814, 5303, 111, 70731, 90, 47, 41, 1294, 10, 13, 502, 4867, 11782, 7948, 271, 9624, 2271, 170, 1916, 15824, 237, 79986, 26946, 30646, 16750, 9655, 44084, 186048, 497, 128239, 2396, 148, 127, 2737, 35166, 51455, 35782, 110, 2367, 1...

[ 0.074462890625, 0.1387939453125, 0.2183837890625, 0.046905517578125, 0.2529296875, 0.14404296875, 0.09124755859375, 0.1744384765625, 0.193359375, 0.03656005859375, 0.08721923828125, 0.0811767578125, 0.1436767578125, 0.1082763671875, 0.182373046875, 0.06988525390625, 0.08184814453125,...

embed

52108128_c0

52108128

prolog

0

Title: gerrit prolog submit rule condition check Problem title: gerrit prolog submit rule condition check Tags: gerrit, prolog Problem: gerrit prolog submit rule condition check We are using gerrit 2.11 to add manager-approval label if inserted code over defined threshold. the prolog rules.pl as below. I can remove "Ma...

gerrit prolog submit rule condition check gerrit prolog submit rule condition check gerrit prolog commit_stats remove_verified submit_rule gerrit:default_submit Manager-Approval gerrit:commit_stats gerrit prolog submit rule condition check We are using gerrit 2.11 to add manager-approval label if inserted code over def...

[ 0.01043701171875, 0.00191497802734375, 0.005889892578125, 0.01123046875, -0.030517578125, -0.006134033203125, -0.0098876953125, 0.0123291015625, 0.0032501220703125, 0.01190185546875, 0.03662109375, 0.00927734375, 0.03125, -0.017578125, 0.024658203125, 0.0191650390625, 0.0390625, 0....

[ 4155, 2783, 502, 4867, 137447, 79986, 35431, 12765, 375, 4007, 17346, 87388, 814, 47314, 882, 214810, 22144, 30195, 39179, 42, 6785, 277, 787, 1662, 15190, 31095, 9007, 67967, 183540, 18151, 645, 61924, 159399, 16200, 91736, 2424, 12662, 3373...

[ 0.08984375, 0.212890625, 0.1353759765625, 0.1983642578125, 0.177978515625, 0.1470947265625, 0.1719970703125, 0.1324462890625, 0.0955810546875, 0.1949462890625, 0.1510009765625, 0.20068359375, 0.1534423828125, 0.1837158203125, 0.111572265625, 0.1446533203125, 0.079833984375, 0.21594...

embed

53505610_c0

53505610

prolog

0

Title: How to declare a list in Prolog? Problem title: How to declare a list in Prolog? Tags: prolog, list Problem: How to declare a list in Prolog? I have browsed through various answers on SO about how to declare a list but I keep getting error messages. I am reading the section on lists from a book that I have but t...

How to declare a list in Prolog? How to declare a list in Prolog? prolog list How Prolog Answer How to declare a list in Prolog? I have browsed through various answers on SO about how to declare a list but I keep getting error messages. I am reading the section on lists from a book that I have but there still isn't an ...

[ 0.0031280517578125, 0.017578125, 0.0128173828125, 0.01385498046875, -0.0185546875, 0.0174560546875, -0.01422119140625, 0.003753662109375, 0.001556396484375, -0.010986328125, 0.00250244140625, 0.00119781494140625, -0.025390625, 0.0155029296875, 0.01263427734375, 0.00726318359375, 0.01...

[ 11249, 47, 159978, 10, 5303, 23, 1250, 4867, 502, 130373, 15969, 3642, 18499, 89914, 12877, 27781, 26785, 2856, 13452, 18507, 96759, 5423, 17582, 38937, 35166, 9655, 53418, 119140, 7162, 28282, 3229, 37170, 15190, 14012, 48322, 7464, 831, 18,...

[ 0.079345703125, 0.0263824462890625, 0.2802734375, 0.0643310546875, 0.2685546875, 0.10113525390625, 0.1614990234375, 0.232666015625, 0.11181640625, 0.0965576171875, 0.043060302734375, 0.0258331298828125, 0.1292724609375, 0.0242462158203125, 0.0562744140625, 0.03521728515625, 0.0394287...

embed

11122814_c1

11122814

prolog

1

, the dog lives in the third house. This approach makes it easy to model neighbor constraints like this: def neighbor(X, Y) :- (X #= Y-1) #\/ (X #= Y+1). But somehow, the clpfd package does not yield a solution, even though (IMO) the problem is modeled correctly (I used the exact same model with the Choco constraint so...

[ -0.0194091796875, -0.0033721923828125, 0.01165771484375, 0.0037689208984375, 0.01104736328125, 0.003997802734375, -0.031494140625, 0.001129150390625, -0.005340576171875, -0.0277099609375, -0.01495361328125, -0.00299072265625, -0.010498046875, 0.00860595703125, 0.00677490234375, -0.0028...

[ 70, 10269, 60742, 23, 50960, 18276, 51515, 30482, 23468, 3299, 208244, 158, 2816, 4288, 7, 1884, 8, 420, 1542, 990, 16, 15772, 1369, 110218, 64, 15, 21748, 4966, 209303, 33139, 39557, 71, 98169, 14602, 959, 11180, 19388, 29806, 4, 59773, ...

[ 0.029510498046875, 0.2333984375, 0.160400390625, 0.08154296875, 0.2103271484375, 0.165771484375, 0.1424560546875, 0.033447265625, 0.0902099609375, 0.239501953125, 0.305419921875, 0.1090087890625, 0.2052001953125, 0.13623046875, 0.0282745361328125, 0.054931640625, 0.06512451171875, ...

embed

63505466_c1

63505466

prolog

1

has the highest occurrence in F by top in the first copy, and by bot in the second copy, and then apply the following ten reduction rules one rule at a time for as many times as possible, for each of the copies: 1. p & bot --> bot 2. p & top --> p 3. p | bot --> p 4. p | top --> top 5. p => bot --> ~p 6. p => top --> ...

[ 0.0269775390625, 0.00579833984375, 0.006439208984375, 0.0264892578125, -0.0106201171875, -0.01611328125, 0.004730224609375, -0.004150390625, 0.006683349609375, -0.0244140625, -0.0033111572265625, 0.0057373046875, -0.01165771484375, -0.015625, 0.00396728515625, -0.025634765625, 0.0023...

[ 1556, 70, 167375, 74918, 42, 6620, 23, 563, 390, 2663, 5117, 43658, 13820, 17932, 59911, 25632, 1492, 456, 77391, 91736, 1632, 79986, 1733, 5941, 20028, 7722, 12638, 71200, 915, 619, 1031, 1892, 2289, 3217, 3569, 4068, 108, 125682, 136, 4...

[ 0.04443359375, 0.0198974609375, 0.1702880859375, 0.1728515625, 0.1328125, 0.080078125, 0.0237274169921875, 0.1881103515625, 0.009552001953125, 0.1883544921875, 0.055938720703125, 0.158203125, 0.146240234375, 0.0618896484375, 0.0804443359375, 0.0139923095703125, 0.1744384765625, 0.1...

embed

23971783_c0

23971783

prolog

0

Title: How to get a list of the Value of a number as the sum of 4 numbers in Prolog Problem title: How to get a list of the Value of a number as the sum of 4 numbers in Prolog Tags: prolog, magic-square Problem: How to get a list of the Value of a number as the sum of 4 numbers in Prolog I'm having trouble making this ...

How to get a list of the Value of a number as the sum of 4 numbers in Prolog How to get a list of the Value of a number as the sum of 4 numbers in Prolog prolog magic-square How Value Prolog How to get a list of the Value of a number as the sum of 4 numbers in Prolog I'm having trouble making this predicate work. The i...

[ -0.030517578125, 0.0087890625, 0.018310546875, -0.005828857421875, -0.02099609375, -0.00634765625, -0.0245361328125, 0.0250244140625, 0.0223388671875, -0.026123046875, 0.0030364990234375, 0.0137939453125, -0.00506591796875, -0.01080322265625, -0.0096435546875, 0.005126953125, -0.0148...

[ 11249, 2046, 5303, 111, 70, 190060, 14012, 237, 10554, 201, 101935, 23, 1250, 4867, 10, 502, 49846, 108047, 63134, 1653, 2063, 4488, 6528, 4527, 879, 837, 9120, 683, 113054, 756, 7722, 17569, 17368, 117, 561, 22062, 12477, 72803, 611, 277...

[ 0.06683349609375, 0.1175537109375, 0.2186279296875, 0.0809326171875, 0.042633056640625, 0.2491455078125, 0.1800537109375, 0.107666015625, 0.20849609375, 0.23046875, 0.2066650390625, 0.0699462890625, 0.1925048828125, 0.25439453125, 0.00506591796875, 0.122802734375, 0.15185546875, 0....

embed

16786274_c0

16786274

prolog

0

Title: How to find facts that do not have contribution in goal Problem title: How to find facts that do not have contribution in goal Tags: code-coverage, prolog, failure-slice Problem: How to find facts that do not have contribution in goal I'm trying to write a program that can check if the student program can fulfil...

How to find facts that do not have contribution in goal How to find facts that do not have contribution in goal code-coverage prolog failure-slice How How to find facts that do not have contribution in goal I'm trying to write a program that can check if the student program can fulfill a certain goal or not. I can do t...

[ 0.017822265625, 0.024169921875, 0.006011962890625, 0.01422119140625, -0.03564453125, -0.004119873046875, -0.004119873046875, -0.013427734375, 0.00017547607421875, -0.0169677734375, -0.00136566162109375, 0.000244140625, -0.031005859375, 0.0002651214599609375, 0.00604248046875, 0.0174560...

[ 11249, 47, 7413, 15824, 7, 450, 54, 959, 765, 127752, 23, 69236, 18151, 63127, 502, 4867, 137578, 13348, 33022, 1528, 12765, 9836, 831, 211394, 2174, 20653, 70541, 51, 86, 26531, 3714, 162466, 58735, 3642, 27781, 83, 35254, 19, 9963, 1021...

[ 0.0792236328125, 0.06298828125, 0.178466796875, 0.2164306640625, 0.151611328125, 0.0794677734375, 0.105712890625, 0.194580078125, 0.140625, 0.2103271484375, 0.119140625, 0.23095703125, 0.1904296875, 0.109375, 0.1171875, 0.1683349609375, 0.191650390625, 0.1102294921875, 0.05242919...

embed

52313710_c1

52313710

prolog

1

is Elem+1, length(X, NumOfItems), foreach(I in 1..NumOfItems, get(Quantity, I, K), X[I]::0..K), /* Set up the constraint that sum of item weights must not be bigger than bag capacity */ sum([X[I]*T : I in 1..NumOfItems], get(Weights, I, T)) #=< Capacity, /* Maximize the values of items in the bag, and find all possibl...

[ -0.015380859375, 0.0260009765625, -0.006103515625, 0.01123046875, -0.0091552734375, 0.025146484375, -0.01470947265625, 0.006744384765625, 0.02587890625, -0.032958984375, 0.00347900390625, -0.004730224609375, 0.000461578369140625, -0.0020751953125, 0.0087890625, 0.0166015625, 0.019165...

[ 83, 540, 195, 21748, 140909, 1542, 52782, 132887, 2982, 7, 100, 41581, 568, 615, 316, 2046, 173495, 18, 2481, 341, 1193, 53861, 605, 19943, 1257, 158, 2816, 4288, 10554, 111, 35735, 57888, 8110, 959, 186, 167785, 6157, 177399, 618, 87, ...

[ 0.1138916015625, 0.1162109375, 0.193359375, 0.2274169921875, 0.21337890625, 0.1552734375, 0.1640625, 0.22021484375, 0.1651611328125, 0.028961181640625, 0.03045654296875, 0.138916015625, 0.09521484375, 0.047393798828125, 0.1075439453125, 0.066650390625, 0.04327392578125, 0.026580810...

embed

54486975_c0

54486975

prolog

0

Title: How to Change Package Directory in SWI-Prolog Problem title: How to Change Package Directory in SWI-Prolog Tags: swi-prolog, prolog Problem: How to Change Package Directory in SWI-Prolog I am attempting to install a package (sldnfdraw) in SWI-Prolog, but I cannot find a way to specify an installation directory (...

How to Change Package Directory in SWI-Prolog How to Change Package Directory in SWI-Prolog swi-prolog prolog How Change Package Directory SWI-Prolog pack_install HOME PREF_DIR How to Change Package Directory in SWI-Prolog I am attempting to install a package (sldnfdraw) in SWI-Prolog, but I cannot find a way to specif...

[ 0.0257568359375, 0.00970458984375, 0.01141357421875, 0.01275634765625, -0.025390625, 0.000865936279296875, -0.00054168701171875, -0.007110595703125, 0.0019683837890625, 0.0216064453125, 0.01531982421875, 0.020751953125, -0.01409912109375, -0.0021209716796875, 0.0023345947265625, 0.0054...

[ 11249, 47, 87377, 56607, 4588, 31068, 53, 23, 159, 38969, 9, 10752, 4867, 91, 2452, 3454, 502, 43824, 80383, 70060, 23096, 919, 123237, 81887, 20600, 98169, 7, 7344, 19, 420, 86905, 53418, 40140, 59720, 14364, 3444, 209806, 55076, 84434, ...

[ 0.08624267578125, 0.028839111328125, 0.2493896484375, 0.250244140625, 0.120361328125, 0.2376708984375, 0.1270751953125, 0.056304931640625, 0.07928466796875, 0.21826171875, 0.0236968994140625, 0.15625, 0.19677734375, 0.024810791015625, 0.189453125, 0.1446533203125, 0.12255859375, 0....

embed

37947697_c0

37947697

prolog

0

Title: Example channelling constraints ECLiPSe Problem title: Example channelling constraints ECLiPSe Tags: eclipse-clp, prolog, clpfd, constraint-programming, constraints Problem: Example channelling constraints ECLiPSe Can someone provide a simple example of channelling constraints? Channelling constraints are used t...

Example channelling constraints ECLiPSe Example channelling constraints ECLiPSe eclipse-clp prolog clpfd constraint-programming constraints Example ECLiPSe Example channelling constraints ECLiPSe Can someone provide a simple example of channelling constraints? Channelling constraints are used to combine viewpoints of a...

[ 0.00093841552734375, -0.0067138671875, -0.00122833251953125, 0.02783203125, 0.003875732421875, -0.00677490234375, -0.0245361328125, -0.0233154296875, -0.0159912109375, -0.047119140625, -0.00909423828125, -0.0027008056640625, -0.005767822265625, 0.029541015625, 0.0224609375, 0.005889892...

[ 89536, 8705, 86723, 2069, 158, 2816, 4288, 59947, 9506, 9059, 13, 106371, 184, 26775, 502, 4867, 39557, 71, 28966, 22691, 8781, 27781, 111, 55969, 11814, 47, 70163, 21455, 38496, 2967, 10639, 14137, 1657, 27958, 187136, 3642, 442, 43240, 15...

[ 0.14990234375, 0.0576171875, 0.248046875, 0.2066650390625, 0.153564453125, 0.2427978515625, 0.1873779296875, 0.05963134765625, 0.09661865234375, 0.0859375, 0.09130859375, 0.1400146484375, 0.053955078125, 0.08123779296875, 0.066162109375, 0.10888671875, 0.003204345703125, 0.01692199...

embed

7642491_c0

7642491

prolog

0

Title: Writing formatted text in SWI-Prolog Problem title: Writing formatted text in SWI-Prolog Tags: prolog Problem: Writing formatted text in SWI-Prolog I have spent a significant amount of time in the SWI-Prolog documentation and am getting nowhere. My desire is to be able to format numbers that are output such that...

Writing formatted text in SWI-Prolog Writing formatted text in SWI-Prolog prolog a Writing SWI-Prolog Writing formatted text in SWI-Prolog I have spent a significant amount of time in the SWI-Prolog documentation and am getting nowhere. My desire is to be able to format numbers that are output such that I am controllin...

[ 0.004180908203125, 0.0106201171875, -0.0015411376953125, 0.0024566650390625, 0.01318359375, -0.002471923828125, 0.01129150390625, -0.000553131103515625, 0.00087738037109375, 0.036376953125, 0.0098876953125, 0.00738525390625, -0.0267333984375, -0.0028076171875, 0.015380859375, -0.006713...

[ 213185, 9384, 3674, 7986, 159, 38969, 10752, 4867, 502, 209806, 136913, 104851, 19048, 101935, 140992, 6226, 2069, 3622, 468, 32380, 2749, 153939, 44116, 7108, 90795, 62816, 146984, 3164, 138, 361, 38134, 32628, 44677, 45234, 163846, 11651, 241...

[ 0.1817626953125, 0.2213134765625, 0.1070556640625, 0.1845703125, 0.04522705078125, 0.2059326171875, 0.1419677734375, 0.178955078125, 0.113037109375, 0.0953369140625, 0.01141357421875, 0.12451171875, 0.006805419921875, 0.1513671875, 0.125, 0.1522216796875, 0.0199432373046875, 0.0711...

embed

16472680_c1

16472680

prolog

1

(y/n) ?"), response(Reply), Reply='y'. symptom(Patient,body_ache) :- write("Does ",Patient," have a body_ache (y/n) ?"), response(Reply), Reply='y'. symptom(Patient,chills) :- write("Does ",Patient," have a chills (y/n) ?"), response(Reply), Reply='y'. symptom(Patient,sore_throat) :- write("Does ",Patient," have a sor...

[ 0.006622314453125, -0.000025391578674316406, 0.0250244140625, 0.01153564453125, -0.01165771484375, 0.0240478515625, -0.0146484375, 0.006256103515625, -0.01275634765625, -0.027099609375, 0.001739501953125, 0.00933837890625, -0.01129150390625, -0.00390625, 0.00634765625, 0.00503540039062...

[ 53, 64, 19, 705, 74054, 57553, 62479, 122813, 5, 128668, 8335, 118, 2517, 4, 37873, 46994, 15772, 33022, 8331, 90, 765, 10, 14361, 1861, 42458, 149031, 46797, 42294, 257, 127124, 86, 1255, 214, 34614, 3613, 177, 15534, 112141, 8405, 17093...

[ 0.1357421875, 0.1650390625, 0.09423828125, 0.0660400390625, 0.01739501953125, 0.1893310546875, 0.1800537109375, 0.210693359375, 0.0179901123046875, 0.2479248046875, 0.0697021484375, 0.1500244140625, 0.1104736328125, 0.012542724609375, 0.15087890625, 0.2274169921875, 0.049407958984375...

embed

29167342_c0

29167342

prolog

0

Title: Prolog http get request with request headers Problem title: Prolog http get request with request headers Tags: json, prolog, swi-prolog Problem: Prolog http get request with request headers I trying to do a http get request with request headers with prolog but I can't find out how to do it exacly. Here's an exam...

Prolog http get request with request headers Prolog http get request with request headers json prolog swi-prolog Prolog unirest.get poker.p.mashape.com index.php X-Mashape-Key Accept player_cards winning_hands Players HREF http_get Json Prolog http get request with request headers I trying to do a http get request with...

[ -0.015380859375, 0.008056640625, 0.02734375, -0.005462646484375, -0.00008296966552734375, -0.0076904296875, -0.014892578125, 0.01409912109375, -0.01007080078125, -0.0537109375, 0.037841796875, 0.018798828125, -0.039306640625, -0.0107421875, 0.01422119140625, -0.008544921875, 0.005889...

[ 1250, 4867, 1621, 2046, 50336, 678, 10336, 1314, 1647, 1681, 502, 2452, 3454, 525, 3794, 25600, 53347, 63262, 3958, 1193, 2420, 1081, 162429, 111383, 58585, 38931, 69986, 12336, 60560, 22439, 28482, 821, 54, 2263, 27781, 145581, 57553, 33342,...

[ 0.1641845703125, 0.2442626953125, 0.1968994140625, 0.151611328125, 0.228515625, 0.1192626953125, 0.1844482421875, 0.1331787109375, 0.07965087890625, 0.1995849609375, 0.146484375, 0.1131591796875, 0.0989990234375, 0.1510009765625, 0.0970458984375, 0.17236328125, 0.15283203125, 0.029...

embed

73903703_c0

73903703

prolog

0

Title: How to check how many elements you've already consumed in Prolog DCGs Problem title: How to check how many elements you've already consumed in Prolog DCGs Tags: prolog, dcg Problem: How to check how many elements you've already consumed in Prolog DCGs Say I have these DCGs: zorbs([H|T]) --> zorb(H), zo...

How to check how many elements you've already consumed in Prolog DCGs How to check how many elements you've already consumed in Prolog DCGs prolog dcg How Prolog DCGs How to check how many elements you've already consumed in Prolog DCGs Say I have these DCGs: I can do this: I can also "reverse" this by doing:...

[ -0.00124359130859375, 0.0111083984375, -0.0014495849609375, 0.0262451171875, -0.0244140625, 0.01226806640625, -0.00077056884765625, 0.00445556640625, 0.0224609375, -0.034423828125, -0.01104736328125, 0.00180816650390625, 0.0181884765625, -0.010009765625, 0.018310546875, 0.0120239257812...

[ 11249, 47, 12765, 3642, 5941, 80854, 398, 3768, 272, 21771, 18588, 297, 23, 1250, 4867, 391, 56367, 7, 502, 104, 238, 177, 765, 6097, 831, 54, 903, 107, 37676, 3444, 7413, 5303, 101935, 678, 140909, 40715, 201, 27781, 2500, 30646, 10588...

[ 0.03759765625, 0.0195465087890625, 0.23046875, 0.1131591796875, 0.1639404296875, 0.23095703125, 0.06182861328125, 0.034698486328125, 0.125, 0.2054443359375, 0.2144775390625, 0.1373291015625, 0.0943603515625, 0.180419921875, 0.24072265625, 0.1119384765625, 0.2032470703125, 0.078125,...

embed

15855932_c1

15855932

prolog

1

be a permutation of the list: [1,2,3,4,5,6,7,8] in wich every element rappresent the Y coordinate of a queen. so in this case I am rappresenting a queen position only by its Y coordinate (its row index) So I have the solution relation than say that a list Queens is a solution if Queens is a premutation of [1,2,3,4,5,6...

[ 0.0015106201171875, 0.017578125, 0.032470703125, 0.01275634765625, 0.000797271728515625, -0.0084228515625, -0.01104736328125, -0.01513671875, 0.021484375, 0.0026702880859375, 0.005035400390625, 0.0157470703125, -0.0068359375, 0.003997802734375, -0.0255126953125, 0.0128173828125, -0.0...

[ 186, 117, 561, 22062, 5303, 133063, 82449, 104629, 136005, 69696, 11907, 12830, 29892, 55247, 990, 176866, 13, 41, 33, 19069, 4734, 390, 15555, 63262, 29806, 41911, 44109, 7, 83, 10, 479, 7311, 46002, 104643, 52875, 27060, 34735, 61924, 364...

[ 0.06744384765625, 0.076904296875, 0.1522216796875, 0.08489990234375, 0.205322265625, 0.08740234375, 0.1793212890625, 0.1763916015625, 0.1605224609375, 0.003692626953125, 0.058013916015625, 0.11865234375, 0.13037109375, 0.1981201171875, 0.1182861328125, 0.1854248046875, 0.020309448242...

embed

28000773_c0

28000773

prolog

0

Title: Logical purity of when/2 and ground/1 Problem title: Logical purity of when/2 and ground/1 Tags: logical-purity, prolog Problem: Logical purity of when/2 and ground/1 The question I have a question related to logical purity. Is this program pure? when(ground(X), X > 2). Some [ir]relevant details about the contex...

Logical purity of when/2 and ground/1 Logical purity of when/2 and ground/1 logical-purity prolog Logical list_length Tail use_module set_prolog_flag clpfd_monotonic Logical purity of when/2 and ground/1 The question I have a question related to logical purity. Is this program pure? Some [ir]relevant details about the ...

[ -0.0133056640625, 0.036376953125, 0.01080322265625, 0.00799560546875, -0.00130462646484375, 0.0201416015625, 0.009521484375, 0.0098876953125, 0.00958251953125, -0.0341796875, 0.01312255859375, 0.0029144287109375, -0.0208740234375, -0.0093994140625, 0.00982666015625, 0.01361083984375, ...

[ 13146, 21533, 7398, 2481, 111, 3229, 12477, 136, 61585, 11583, 62775, 289, 4717, 502, 4867, 5303, 23986, 1218, 379, 4527, 83279, 5423, 3454, 190872, 33139, 39557, 71, 64176, 188, 9655, 2071, 903, 1528, 34166, 169429, 41653, 43701, 31577, 33...

[ 0.2198486328125, 0.1396484375, 0.2318115234375, 0.162841796875, 0.04351806640625, 0.1484375, 0.1917724609375, 0.04974365234375, 0.1610107421875, 0.16796875, 0.254638671875, 0.14208984375, 0.1788330078125, 0.1190185546875, 0.1630859375, 0.1671142578125, 0.08270263671875, 0.087829589...

embed

41321251_c0

41321251

prolog

0

Title: Query prolog with PHP Problem title: Query prolog with PHP Tags: swi-prolog, php, prolog Problem: Query prolog with PHP I am trying to make a sudoku game with PHP and prolog, the idea is to use prolog program to solve the sudoku then get the results via PHP, I have write this code down but I'm getting a empty ou...

Query prolog with PHP Query prolog with PHP swi-prolog php prolog Query PHP var_dump DOCTYPE www.w3.org Content-Type utf-8 Soduku style.css Program Files x86 swipl-win.exe test.pl print_r return_var Query prolog with PHP I am trying to make a sudoku game with PHP and prolog, the idea is to use prolog program to solve t...

[ 0.022705078125, 0.01153564453125, 0.0015106201171875, 0.0096435546875, -0.00958251953125, 0.017578125, -0.0137939453125, -0.003997802734375, -0.01165771484375, -0.057861328125, 0.02783203125, 0.0189208984375, -0.02978515625, 0.0033111572265625, -0.00738525390625, 0.01116943359375, 0....

[ 58836, 53, 502, 4867, 678, 47302, 2452, 3454, 3958, 285, 693, 2676, 120959, 27143, 434, 363, 1478, 70870, 196707, 17376, 1061, 319, 20623, 4439, 7663, 42724, 15276, 2424, 9494, 46480, 3034, 28412, 42, 30646, 1961, 31577, 8932, 38067, 6712, ...

[ 0.1746826171875, 0.0679931640625, 0.167724609375, 0.240234375, 0.1099853515625, 0.26318359375, 0.1328125, 0.1578369140625, 0.1973876953125, 0.1103515625, 0.099365234375, 0.14453125, 0.0537109375, 0.0965576171875, 0.01202392578125, 0.0848388671875, 0.056976318359375, 0.0809326171875...

embed

4089916_c0

4089916

prolog

0

Title: handling relations in prolog Problem title: handling relations in prolog Tags: prolog Problem: handling relations in prolog rel(X,Y) :- dep(X,Y). rel(X,Y) :- aux(X,Y). rel(X,Y) :- auxpass(X,Y). rel(X,Y) :- cop(X,Y). rel(X,Y) :- conj(X,Y). rel(X,Y) :- cc(X,Y). rel(X,Y) :- arg(X,Y). rel(X,Y) :- subj(X,Y). rel(X,Y)...

handling relations in prolog handling relations in prolog prolog agent1 ref1 handling relations in prolog but in the last relation i want the first "rel" to be different from the next "rel" how to check if they are distinct.. please help

[ -0.007537841796875, -0.01031494140625, 0.01043701171875, 0.011474609375, -0.01129150390625, -0.01324462890625, -0.0032958984375, -0.0093994140625, 0.01275634765625, -0.0556640625, 0.00775146484375, -0.0006561279296875, -0.0167236328125, -0.00958251953125, 0.0206298828125, 0.00805664062...

[ 45064, 91582, 23, 502, 4867, 23882, 18831, 4568, 41911, 3444, 5117, 7962, 186, 12921, 1295, 11737, 12765, 2174, 1836, 621, 117781, 4358 ]

[ 0.193115234375, 0.242919921875, 0.03558349609375, 0.13720703125, 0.2275390625, 0.12371826171875, 0.11798095703125, 0.130615234375, 0.1934814453125, 0.063720703125, 0.06640625, 0.2303466796875, 0.04205322265625, 0.171875, 0.020843505859375, 0.0867919921875, 0.1748046875, 0.056732177...

embed

37209489_c0

37209489

prolog

0

Title: ERROR: Type error: `file_path' expected, found `_G409' (a var) Problem title: ERROR: Type error: `file_path' expected, found `_G409' (a var) Tags: prolog Problem: ERROR: Type error: `file_path' expected, found `_G409' (a var) I have a problem with my Prolog Program. It is designed to assign w...

ERROR: Type error: `file_path' expected, found `_G409' (a var) ERROR: Type error: `file_path' expected, found `_G409' (a var) prolog ERROR Type file_path _G409 source_sink Nqrrroah Nqblubh Nqflua Nqdwingi Nqlhalha Ukahama Mhboa Sharabrab Falup is_set List ERROR: Type error: `file_path' expected, fou...

[ 0.0196533203125, 0.0203857421875, -0.00823974609375, 0.002777099609375, -0.003936767578125, 0.0067138671875, -0.02001953125, 0.00811767578125, -0.006622314453125, -0.019775390625, 0.0220947265625, -0.0126953125, -0.0025482177734375, -0.01190185546875, 0.0262451171875, 0.000295639038085...

[ 151206, 24638, 60457, 18499, 29822, 128405, 3768, 84751, 14037, 724, 2839, 1126, 11, 285, 502, 4867, 11435, 31344, 7, 14068, 18304, 1366, 47491, 5871, 18026, 22242, 99247, 4200, 528, 72883, 76027, 16977, 22225, 2037, 83, 3509, 32036, 2967, ...

[ 0.14208984375, 0.100830078125, 0.1876220703125, 0.1893310546875, 0.1846923828125, 0.1982421875, 0.1397705078125, 0.2200927734375, 0.110107421875, 0.06964111328125, 0.1865234375, 0.22216796875, 0.0740966796875, 0.20654296875, 0.1553955078125, 0.2666015625, 0.1441650390625, 0.1527099...

embed

57316321_c0

57316321

prolog

0

Title: How to catch exception to backtrack(or Delimited Continuations) in Prolog? Problem title: How to catch exception to backtrack(or Delimited Continuations) in Prolog? Tags: prolog Problem: How to catch exception to backtrack(or Delimited Continuations) in Prolog? I'm new to Prolog and trying to know some example f...

How to catch exception to backtrack(or Delimited Continuations) in Prolog? How to catch exception to backtrack(or Delimited Continuations) in Prolog? prolog typeError How Delimited Continuations Prolog Err _Context type_error _12488 How to catch exception to backtrack(or Delimited Continuations) in Prolog? I'm new to P...

[ 0.00262451171875, 0.0272216796875, 0.01043701171875, 0.0045166015625, -0.01031494140625, -0.005584716796875, 0.01055908203125, 0.0115966796875, -0.001068115234375, -0.03125, -0.0089111328125, -0.01116943359375, 0, 0.00001537799835205078, 0.037841796875, -0.01556396484375, 0.002716064...

[ 11249, 105556, 131527, 4420, 125728, 262, 93343, 50343, 5256, 1250, 4867, 47, 502, 10644, 18468, 297, 1004, 22829, 188800, 161414, 748, 23, 27781, 18113, 18151, 11675, 2452, 3454, 1019, 170179, 759, 5612, 2424, 75463, 75101, 31611, 1193, 2203...

[ 0.03643798828125, 0.184814453125, 0.2379150390625, 0.1773681640625, 0.280029296875, 0.0706787109375, 0.2100830078125, 0.1944580078125, 0.03515625, 0.1488037109375, 0.2181396484375, 0.049591064453125, 0.0787353515625, 0.152587890625, 0.0869140625, 0.00982666015625, 0.071044921875, 0...

embed

22466520_c0

22466520

prolog

0

Title: Prolog Query Exercise - Beginner Problem title: Prolog Query Exercise - Beginner Tags: prolog Problem: Prolog Query Exercise - Beginner I'm a begginer at Prolog and I need some help with this exercise, this is the knowledge base provided: album(‘R. Stevie Moore’, ‘Manuscription’). album(‘Lane Steinberg’, ‘Manusc...

Prolog Query Exercise - Beginner Prolog Query Exercise - Beginner prolog Prolog Query Exercise Beginner Stevie Moore Manuscription Lane Steinberg Yung Show Yukio Jessie Evans Autonervous Bettina Koster Lucia Pamela Walkin Shooby Taylor Human Horn Tiny Tim God Bless Legendary Stardust Cowboy Rock-It Stardom Walking Moon...

[ 0.01019287109375, 0.0274658203125, 0.001312255859375, 0.031005859375, -0.005401611328125, 0.01373291015625, -0.021728515625, -0.00482177734375, 0.0011138916015625, -0.049560546875, -0.0216064453125, -0.0203857421875, 0.007080078125, 0.0245361328125, -0.026123046875, 0.028076171875, 0...

[ 1250, 4867, 58836, 53, 155534, 184, 20, 67053, 56, 502, 8694, 15959, 119303, 58916, 59478, 239, 86, 27822, 4969, 990, 1619, 17367, 109402, 846, 117361, 478, 122841, 4396, 1679, 13048, 6300, 5516, 1204, 1515, 133556, 1342, 54950, 115059, 73,...

[ 0.2091064453125, 0.30810546875, 0.268798828125, 0.1414794921875, 0.1995849609375, 0.09619140625, 0.00665283203125, 0.1702880859375, 0.14404296875, 0.1219482421875, 0.107421875, 0.215087890625, 0.22607421875, 0.1053466796875, 0.1962890625, 0.1029052734375, 0.1156005859375, 0.0986328...

embed

65722678_c0

65722678

prolog

0

Title: solving kakuro in prolog using predicate Problem title: solving kakuro in prolog using predicate Tags: prolog Problem: solving kakuro in prolog using predicate I want to predicate solve Kakuro. My kakuro is this I have to create a predicate using the word solve (solve/1) for the game kakuro. I tried 3-4 codes an...

solving kakuro in prolog using predicate solving kakuro in prolog using predicate prolog predicate use_module all_different B-C F-J-N G-K-O F-G K-L O-P sum_list Head Tail Sum Sum1 Vars solving kakuro in prolog using predicate I want to predicate solve Kakuro. My kakuro is this I have to create a predicate using the wor...

[ 0.00086212158203125, -0.0107421875, 0.006072998046875, 0.00482177734375, -0.0189208984375, -0.0081787109375, -0.03076171875, 0.0223388671875, 0.003570556640625, -0.006134033203125, -0.0032806396484375, -0.004180908203125, 0.0181884765625, 0.005889892578125, 0.01318359375, 0.01574707031...

[ 3115, 6496, 18795, 11951, 23, 502, 4867, 17368, 1653, 2063, 67, 4527, 83279, 756, 238778, 335, 9, 605, 670, 10554, 6562, 44816, 1218, 36335, 3323, 3444, 86869, 40497, 903, 28282, 2565, 86918, 11583, 6712, 37842, 20444, 18151, 18499, 77336, ...

[ 0.13818359375, 0.09814453125, 0.14599609375, 0.289794921875, 0.055938720703125, 0.1636962890625, 0.2061767578125, 0.0924072265625, 0.1827392578125, 0.2257080078125, 0.1007080078125, 0.071044921875, 0.1019287109375, 0.07489013671875, 0.20458984375, 0.0163726806640625, 0.01254272460937...

embed

61550755_c0

61550755

prolog

0

Title: Block world problem search runs out of stack space Problem title: Block world problem search runs out of stack space Tags: search, iterative-deepening, prolog Problem: Block world problem search runs out of stack space I have the following code: move(state(on(X, NewX), OldY, Z), state(NewX, on(X, OldY), Z)). mov...

Block world problem search runs out of stack space Block world problem search runs out of stack space search iterative-deepening prolog Block NewX OldY OldZ OldX NewY NewZ Block world problem search runs out of stack space I have the following code: Where move give us the possible movements that you can use and path sh...

[ 0.0191650390625, 0.007232666015625, 0.007720947265625, 0.01806640625, -0.0028533935546875, 0.00750732421875, -0.00390625, 0.00347900390625, 0.02197265625, -0.052734375, 0.01214599609375, 0.0059814453125, 0.0022125244140625, 0.000530242919921875, 0.007080078125, 0.0030670166015625, 0....

[ 80231, 8999, 2967, 33938, 127877, 1810, 111, 177261, 32628, 720, 45023, 123041, 33, 502, 4867, 2356, 1542, 25074, 1723, 1511, 25632, 18151, 78662, 25813, 8337, 7722, 112664, 831, 4527, 60875, 5608, 5646, 1295, 1193, 47, 990, 1653, 2063, 67,...

[ 0.183837890625, 0.1270751953125, 0.1820068359375, 0.21923828125, 0.07666015625, 0.1729736328125, 0.203125, 0.2230224609375, 0.2088623046875, 0.1199951171875, 0.069580078125, 0.04205322265625, 0.06573486328125, 0.1217041015625, 0.150146484375, 0.06781005859375, 0.107177734375, 0.088...

embed

55529533_c0

55529533

prolog

0

Title: Prolog CLP(FD) Number of items in result Problem title: Prolog CLP(FD) Number of items in result Tags: clpfd, constraint-programming, prolog Problem: Prolog CLP(FD) Number of items in result include(=(1),Vars,I1),length(I1, SUM_1), include(=(2),Vars,I2),length(I2, SUM_2), include(=(3),Vars,I3),length(I3, SUM_3),...

Prolog CLP(FD) Number of items in result Prolog CLP(FD) Number of items in result clpfd constraint-programming prolog Prolog CLP Number D1_D1 D1_D2 D1_N1 D1_N2 D1_A0 D2_D1 D2_D2 D2_N1 D2_N2 D2_A0 D3_D1 D3_D2 D3_N1 D3_N2 D3_A0 D4_D1 D4_D2 D4_N1 D4_N2 D4_A0 D5_D1 D5_D2 D5_N1 D5_N2 D5_A0 D6_D1 D6_D2 D6_N1 D6_N2 D6_A0 D7_D...

[ -0.004119873046875, -0.0021514892578125, 0.00164031982421875, 0.00787353515625, -0.00823974609375, -0.0172119140625, -0.0201416015625, 0.005157470703125, 0.01031494140625, -0.03759765625, -0.01025390625, -0.033935546875, 0.01123046875, 0.0277099609375, 0.0029754638671875, 0.00848388671...

[ 1250, 4867, 37352, 98553, 103332, 111, 55769, 23, 16750, 313, 33139, 39557, 71, 158, 2816, 4288, 28966, 502, 391, 418, 397, 127944, 115187, 363, 910, 3323, 36335, 756, 46295, 38893, 9624, 839, 3115, 5094, 15246, 2069, 2967, 4785, 179933, ...

[ 0.1470947265625, 0.2308349609375, 0.203857421875, 0.158203125, 0.1370849609375, 0.016387939453125, 0.240478515625, 0.108642578125, 0.267822265625, 0.01336669921875, 0.009368896484375, 0.026153564453125, 0.0599365234375, 0.085205078125, 0.17529296875, 0.1373291015625, 0.08905029296875...

embed

15346729_c0

15346729

prolog

0

Title: Guidance with writing Prolog rule Problem title: Guidance with writing Prolog rule Tags: prolog, rule Problem: Guidance with writing Prolog rule I am in my initial phase of writing code in Prolog and am still trying wrap my head around the paradigm so please pardon the primitiveness of this question. I read in W...

Guidance with writing Prolog rule Guidance with writing Prolog rule prolog rule Guidance Prolog Head Body gate_type SIG terminal_type Guidance with writing Prolog rule I am in my initial phase of writing code in Prolog and am still trying wrap my head around the paradigm so please pardon the primitiveness of this quest...

[ 0.03759765625, 0.01531982421875, -0.005279541015625, 0.01025390625, -0.0034942626953125, 0.0159912109375, -0.005889892578125, -0.0042724609375, 0.021240234375, -0.0263671875, 0.00408935546875, -0.01708984375, -0.007110595703125, 0.0125732421875, 0.020263671875, -0.00860595703125, 0.0...

[ 53513, 549, 678, 32562, 1250, 4867, 79986, 502, 44816, 43960, 70836, 50986, 159, 31343, 33949, 93402, 18151, 137565, 10336, 214709, 128489, 8162, 8781, 51359, 3647, 40226, 32354, 4317, 3137, 606, 820, 31577, 28282, 25632, 54397, 903, 44961, 3...

[ 0.1209716796875, 0.1190185546875, 0.048004150390625, 0.1552734375, 0.14990234375, 0.214111328125, 0.1824951171875, 0.077880859375, 0.119873046875, 0.1363525390625, 0.1640625, 0.17138671875, 0.048858642578125, 0.177734375, 0.226318359375, 0.03167724609375, 0.08868408203125, 0.001556...

embed

53934948_c0

53934948

prolog

0

Title: Group facts in prolog by 3 variables Problem title: Group facts in prolog by 3 variables Tags: prolog, grouping Problem: Group facts in prolog by 3 variables I'm having troubles grouping some facts in prolog by 3 different properties. This is my knownledge base (a graph basically): % entity(Label, Id) % relation...

Group facts in prolog by 3 variables Group facts in prolog by 3 variables prolog grouping Group Label Type Subject Object Person id_0 Place Places Some Other group_relationships_by_node group_by_relationships Result Group facts in prolog by 3 variables I'm having troubles grouping some facts in prolog by 3 different pr...

[ 0.031982421875, -0.0086669921875, 0.00124359130859375, -0.004913330078125, -0.0130615234375, 0.003936767578125, -0.02392578125, 0.002716064453125, 0.018798828125, -0.01495361328125, -0.00927734375, 0.01239013671875, -0.0115966796875, -0.03125, -0.003875732421875, 0.0279541015625, -0....

[ 10760, 15824, 7, 502, 4867, 390, 138, 77336, 21115, 129214, 60457, 94341, 134549, 15270, 41076, 107, 57860, 16070, 1272, 157, 126684, 63134, 214, 12921, 183871, 51529, 181606, 3647, 41382, 198343, 36663, 151618, 12638, 77630, 3447, 28368, 10644...

[ 0.2342529296875, 0.2110595703125, 0.0149383544921875, 0.15478515625, 0.2203369140625, 0.0843505859375, 0.1925048828125, 0.2391357421875, 0.2459716796875, 0.1483154296875, 0.1036376953125, 0.1282958984375, 0.148681640625, 0.04620361328125, 0.057281494140625, 0.03118896484375, 0.127929...

embed

23716331_c1

23716331

prolog

1

Count, X #= A / P, Y #= B / P, xor_1bit_values(X, Y, Tmp), NewSum #= Sum + P*Tmp, NewCount is Count - 1, xor_number(A, B, Result, NewCount, NewSum). Sample input and output: ?- time(xor_number(123456789, 987654321, R, 32)). % 943 inferences, 0.000 CPU in 0.001 seconds (0% CPU, Infinite Lips) R = 1032168868 Now, this is...

[ -0.004119873046875, -0.000507354736328125, 0.00153350830078125, 0.002288818359375, -0.0164794921875, 0.0126953125, -0.0230712890625, -0.0030517578125, 0.021240234375, 0.00119781494140625, -0.000545501708984375, 0.0003719329833984375, 0.0074462890625, 0.00970458984375, 0.024169921875, -...

[ 108210, 1193, 468, 1369, 62, 248, 436, 990, 335, 74706, 115187, 3137, 27494, 1542, 4, 2676, 2356, 294, 316, 36335, 997, 1639, 83, 20, 106, 2606, 1297, 284, 126684, 947, 33209, 107730, 136, 140992, 705, 9, 1733, 94240, 454, 190875, 13683...

[ 0.2646484375, 0.1668701171875, 0.07659912109375, 0.03717041015625, 0.09124755859375, 0.09503173828125, 0.07080078125, 0.09405517578125, 0.1290283203125, 0.2376708984375, 0.0171661376953125, 0.1922607421875, 0.1490478515625, 0.0455322265625, 0.01226806640625, 0.1749267578125, 0.150390...

embed

59638407_c0

59638407

prolog

0

Title: How to delete every second occurence of an element in a nested list - PROLOG Problem title: How to delete every second occurence of an element in a nested list - PROLOG Tags: prolog Problem: How to delete every second occurence of an element in a nested list - PROLOG Suppose I have a list like [1,[2,1,[2],[3,1,1...

How to delete every second occurence of an element in a nested list - PROLOG How to delete every second occurence of an element in a nested list - PROLOG prolog How PROLOG delete_second_occurrence is_list How to delete every second occurence of an element in a nested list - PROLOG Suppose I have a list like [1,[2,1,[2]...

[ -0.01708984375, 0.034912109375, -0.00164031982421875, 0.00086212158203125, 0.0103759765625, 0.03271484375, 0.001312255859375, -0.00775146484375, 0.0240478515625, -0.035400390625, 0.01239013671875, -0.020263671875, 0.011962890625, -0.01336669921875, 0.015869140625, 0.01507568359375, 0...

[ 11249, 47, 154109, 11907, 17932, 74918, 6620, 12830, 8512, 71, 5303, 10514, 47510, 502, 4867, 191633, 6652, 64240, 83, 6562, 23, 304, 418, 363, 54968, 3444, 42, 1295, 31805, 17306, 40383, 627, 660, 339, 107730, 1193, 186, 184750, 20028, 1...

[ 0.049285888671875, 0.01904296875, 0.2376708984375, 0.1639404296875, 0.233642578125, 0.1937255859375, 0.120849609375, 0.1795654296875, 0.2359619140625, 0.1270751953125, 0.1885986328125, 0.135009765625, 0.2021484375, 0.055267333984375, 0.1190185546875, 0.22021484375, 0.10498046875, 0...

embed

44350667_c0

44350667

prolog

0

Title: Mutually referential Prolog rules in family tree Problem title: Mutually referential Prolog rules in family tree Tags: prolog Problem: Mutually referential Prolog rules in family tree I've seen various implementations of family trees in Prolog, but I haven't found one that does what I would like to do, which is ...

Mutually referential Prolog rules in family tree Mutually referential Prolog rules in family tree prolog Mutually Prolog Mutually referential Prolog rules in family tree I've seen various implementations of family trees in Prolog, but I haven't found one that does what I would like to do, which is to define child and p...

[ 0.031005859375, -0.002227783203125, 0.010498046875, 0.00750732421875, -0.0031280517578125, 0.0026092529296875, 0.0005035400390625, 0.0177001953125, 0.00482177734375, -0.051025390625, -0.00909423828125, -0.0018310546875, -0.0189208984375, 0.0205078125, 0.044189453125, 0.0087890625, 0....

[ 174948, 25958, 15005, 80973, 1250, 4867, 91736, 14449, 53201, 502, 51592, 208124, 1360, 90, 1884, 61924, 29041, 136, 49129, 390, 2852, 12638, 3789, 3444, 68018, 15824, 83, 22008, 28090, 19048, 26458, 2750, 621, 27863, 20020, 81887, 552, 6238,...

[ 0.113037109375, 0.08587646484375, 0.205078125, 0.1231689453125, 0.1317138671875, 0.228515625, 0.173095703125, 0.1217041015625, 0.222412109375, 0.1072998046875, 0.0182952880859375, 0.10693359375, 0.1995849609375, 0.048736572265625, 0.05450439453125, 0.19140625, 0.198486328125, 0.163...

embed

32909397_c0

32909397

prolog

0

Title: Prolog: Symmetric Rules Problem title: Prolog: Symmetric Rules Tags: logic-programming, prolog Problem: Prolog: Symmetric Rules I'm following a Prolog tutorial that asks to define a symmetric relation. Say for instance you have the following fact in the knowledge base: colleague(john,bob). You also want colleagu...

Prolog: Symmetric Rules Prolog: Symmetric Rules logic-programming prolog Prolog Symmetric Rules Prolog: Symmetric Rules I'm following a Prolog tutorial that asks to define a symmetric relation. Say for instance you have the following fact in the knowledge base: You also want colleague(bob,john) to be true, and likewise...

[ 0.010009765625, 0.01153564453125, 0.0159912109375, 0.00872802734375, 0.011474609375, 0.00665283203125, -0.017333984375, 0.0087890625, 0.011474609375, -0.043212890625, -0.0162353515625, 0.002105712890625, -0.0174560546875, 0.0011749267578125, 0.024169921875, 0.0034027099609375, 0.0027...

[ 1250, 4867, 4843, 39, 186518, 139118, 62775, 28966, 502, 25632, 57143, 61924, 230612, 238, 41911, 15824, 51359, 3647, 2843, 3444, 62975, 11, 6261, 837, 275, 66159, 29568, 100, 756, 4527, 79986, 37348, 17368, 41, 1294, 28219, 15400, 123087, ...

[ 0.115478515625, 0.20947265625, 0.05255126953125, 0.06597900390625, 0.1602783203125, 0.17919921875, 0.0352783203125, 0.04132080078125, 0.05035400390625, 0.12646484375, 0.1754150390625, 0.1162109375, 0.2568359375, 0.0750732421875, 0.176513671875, 0.1356201171875, 0.0867919921875, 0.1...

embed

37705419_c0

37705419

prolog

0

Title: Prolog check if list is part of a sequence Problem title: Prolog check if list is part of a sequence Tags: list, sequence, prolog Problem: Prolog check if list is part of a sequence My task is to define a predicate which checks if a given list is a part of a sequence. The predicate has three members. The first t...

Prolog check if list is part of a sequence Prolog check if list is part of a sequence list sequence prolog Prolog LenA LenB1 LenC LenC1 Prolog check if list is part of a sequence My task is to define a predicate which checks if a given list is a part of a sequence. The predicate has three members. The first two lists a...

[ 0.00634765625, 0.00787353515625, -0.0019378662109375, 0.0172119140625, -0.006072998046875, -0.00823974609375, -0.001617431640625, 0.02734375, 0.030029296875, -0.0079345703125, 0.0101318359375, 0.037353515625, -0.0108642578125, 0.015380859375, 0.01806640625, -0.00830078125, 0.01818847...

[ 1250, 4867, 12765, 2174, 5303, 83, 2831, 111, 40, 944, 3956, 502, 18226, 284, 441, 66211, 61924, 1653, 2063, 67, 17262, 43032, 5117, 6626, 86595, 12830, 997, 4958, 757, 4460, 33, 39531, 5281, 50960, 10750, 27781, 89536, 339, 418, 304, 3...

[ 0.149169921875, 0.22021484375, 0.155029296875, 0.087158203125, 0.227294921875, 0.06658935546875, 0.182861328125, 0.0914306640625, 0.0826416015625, 0.1591796875, 0.07421875, 0.1187744140625, 0.10736083984375, 0.047821044921875, 0.01336669921875, 0.05499267578125, 0.045989990234375, ...

embed

68058584_c1

68058584

prolog

1

(Others,L4,L3). int_0_100(N):- N >= 0, N =< 100. same_length([],[]). same_length([_|Others1],[_|Others2]):- same_length(Others1,Others2). I guess that the problem is that I instantiate a L4 list that can't change in the shuffle predicate. Now my colleague's solution: arrange(L1,L2,Diff):- same_length(L1,L2), shuffle(L1...

[ -0.01129150390625, 0.02294921875, 0.01171875, -0.010986328125, -0.01458740234375, -0.0194091796875, -0.0247802734375, -0.006927490234375, 0.0198974609375, -0.0172119140625, 0.0025787353515625, 0.026611328125, 0.01214599609375, 0.0206298828125, -0.000308990478515625, -0.004150390625, ...

[ 670, 9319, 7, 866, 617, 21320, 23, 18, 2389, 3559, 839, 541, 977, 757, 16093, 805, 5701, 23986, 76172, 90173, 10461, 2967, 34648, 101426, 339, 5303, 831, 15549, 170052, 1653, 2063, 67, 62975, 6261, 29806, 137356, 418, 304, 32920, 2816, ...

[ 0.0823974609375, 0.1820068359375, 0.050537109375, 0.099365234375, 0.2054443359375, 0.1497802734375, 0.058135986328125, 0.05279541015625, 0.039794921875, 0.174072265625, 0.057159423828125, 0.09326171875, 0.00213623046875, 0.08343505859375, 0.0296173095703125, 0.15625, 0.15576171875, ...

embed

73176041_c0

73176041

prolog

0

Title: SWI-Prolog: Looking for some predicate which reduces a set in some generator set for some invariant predicate? Problem title: SWI-Prolog: Looking for some predicate which reduces a set in some generator set for some invariant predicate? Tags: invariants, prolog Problem: SWI-Prolog: Looking for some predicate whi...

SWI-Prolog: Looking for some predicate which reduces a set in some generator set for some invariant predicate? SWI-Prolog: Looking for some predicate which reduces a set in some generator set for some invariant predicate? invariants prolog SWI-Prolog Looking generator1_inv Inv ListOut ListIn Order SWI-Prolog: Looking f...

[ -0.00958251953125, -0.01068115234375, 0.0245361328125, -0.0007171630859375, -0.00159454345703125, -0.00139617919921875, -0.0185546875, -0.000926971435546875, 0.0091552734375, -0.021240234375, 0.018798828125, 0.037841796875, -0.002227783203125, 0.000732421875, 0.0087890625, 0.0004501342...

[ 159, 38969, 9, 10752, 4867, 157268, 100, 1653, 2063, 67, 34390, 5423, 145823, 23, 162591, 502, 418, 73, 334, 360, 32036, 79858, 4153, 81206, 16487, 19048, 96760, 171859, 997, 11, 5303, 154663, 3173, 508, 964, 3934, 117781, 43032, 275, 327...

[ 0.043365478515625, 0.226806640625, 0.01580810546875, 0.117431640625, 0.1597900390625, 0.1309814453125, 0.055694580078125, 0.145263671875, 0.1605224609375, 0.0416259765625, 0.1953125, 0.1287841796875, 0.248779296875, 0.0855712890625, 0.245361328125, 0.1015625, 0.047027587890625, 0.1...

embed

20688099_c1

20688099

prolog

1

case 3 (Lb) . . . . . 1 2 2 . ---> offset = 5 (La) 0 1 1 1 1 0 1 1 1 ( +) 0 1 1 1 1 1 3 3 1 What I want is to define the offset as a clpfd variable with a particular domain associated to it. In order to compute La+Lb I've written the predicate overlap/6 , which is the following: overlap([],[],_,_,_,[]) :- !. overlap([...

[ 0.005706787109375, 0.00836181640625, 0.006439208984375, -0.004791259765625, 0.000614166259765625, -0.005615234375, -0.013671875, 0.01348876953125, 0.02001953125, -0.01263427734375, 0.01287841796875, -0.01055908203125, 0.0089111328125, 0.003936767578125, 0.0162353515625, 0.0025024414062...

[ 7225, 138, 866, 275, 106, 116, 5773, 3509, 2203, 190, 2729, 757, 997, 3444, 61924, 237, 33139, 39557, 71, 77336, 17311, 77758, 137272, 9969, 6743, 239, 1328, 59121, 1653, 2063, 645, 6324, 20155, 284, 42246, 62, 140909, 339, 2027, 19659, ...

[ 0.185302734375, 0.1746826171875, 0.09637451171875, 0.18115234375, 0.036224365234375, 0.0909423828125, 0.27734375, 0.27294921875, 0.0241851806640625, 0.143310546875, 0.1240234375, 0.1474609375, 0.089111328125, 0.04638671875, 0.138427734375, 0.025390625, 0.05853271484375, 0.082275390...

embed

18855146_c0

18855146

prolog

0

Title: Pack consecutive duplicates of list elements into sublists in Prolog Problem title: Pack consecutive duplicates of list elements into sublists in Prolog Tags: prolog, lambda Problem: Pack consecutive duplicates of list elements into sublists in Prolog I have a problem with returning an answer to Problem 9 of P-9...

Pack consecutive duplicates of list elements into sublists in Prolog Pack consecutive duplicates of list elements into sublists in Prolog prolog lambda Pack Prolog Acc Acc1 Call _G986 Exit _G1100 lists:append _G1105 _G1109 _G1114 _G1127 _G1132 Pack consecutive duplicates of list elements into sublists in Prolog I have ...

[ 0.01068115234375, 0.0076904296875, 0.0220947265625, 0.0036468505859375, -0.0242919921875, 0.027587890625, -0.00677490234375, 0.0091552734375, 0.01336669921875, -0.0096435546875, 0.014404296875, 0.0184326171875, -0.00946044921875, 0.00799560546875, -0.0107421875, 0.027587890625, 0.017...

[ 56607, 148390, 171763, 1636, 5303, 80854, 3934, 1614, 6562, 1250, 4867, 502, 6492, 85, 29899, 26265, 204225, 5443, 3559, 3611, 8194, 6463, 2592, 3768, 6460, 2967, 30646, 35166, 15649, 483, 5046, 56740, 36743, 839, 1212, 947, 33209, 41, 1294...

[ 0.2193603515625, 0.1712646484375, 0.232666015625, 0.091796875, 0.1434326171875, 0.1632080078125, 0.10101318359375, 0.191162109375, 0.21826171875, 0.1578369140625, 0.23095703125, 0.1060791015625, 0.1112060546875, 0.059234619140625, 0.039337158203125, 0.0523681640625, 0.1951904296875, ...

embed

21836482_c1

21836482

prolog

1

trans ), append(Prefix," ",Prefixspace), append(Prefixspace,Translationw,Translation). % predicate containing all possible data about verbs including endings % and such % arguments: Latin,Translation,Tense,Number,Mood,Voice word_verbx(Latin,Translation,Tense,Number,Mood,Voice,Person) :- verb(Stem1,_,_,_,_,Ptrans,_,Past...

[ 0.0045166015625, 0.01458740234375, 0.0003528594970703125, -0.006622314453125, 0.023681640625, 0.00567626953125, -0.0032196044921875, -0.007293701171875, 0.02685546875, -0.036376953125, 0.02392578125, -0.01409912109375, -0.0025787353515625, -0.035400390625, -0.01458740234375, 0.02062988...

[ 3900, 6, 247, 114689, 71, 19273, 55923, 58, 65421, 62624, 57860, 434, 194, 1745, 1653, 2063, 67, 70541, 214, 756, 7722, 2053, 1672, 42792, 26719, 86658, 6044, 10750, 42845, 618, 21161, 18444, 26278, 594, 26995, 36635, 2980, 2565, 81465, 4...

[ 0.34375, 0.006988525390625, 0.046234130859375, 0.13818359375, 0.04681396484375, 0.1002197265625, 0.18701171875, 0.003814697265625, 0.18408203125, 0.20068359375, 0.1343994140625, 0.1339111328125, 0.0294342041015625, 0.148193359375, 0.2161865234375, 0.2322998046875, 0.1605224609375, ...

embed

34257684_c1

34257684

prolog

1

F pieces but all the other ones cant be similar) How do I make a new restriction with this: The only other remaining bar to have two spots on its side is C, so C must combine with A to make the 4 or 5 face The only other bar to have a spot on its side near one end is E, so E must combine with B to make the 2 or 3 face...

[ -0.00701904296875, -0.00168609619140625, 0.0081787109375, 0.0185546875, 0.00811767578125, -0.004547119140625, -0.01092529296875, 0.018798828125, 0.020263671875, -0.0250244140625, 0.006866455078125, 0.01043701171875, 0.03173828125, -0.005157470703125, -0.0034942626953125, 0.000907897949...

[ 563, 126371, 1284, 756, 3789, 64333, 45767, 186, 21373, 11249, 87, 3249, 10, 3525, 185190, 678, 903, 4734, 47143, 214, 1909, 6626, 13162, 5609, 313, 8110, 70163, 62, 201, 707, 190, 2577, 43573, 3564, 241, 335, 116, 138, 3917, 5154, 2347...

[ 0.1693115234375, 0.1983642578125, 0.03424072265625, 0.06671142578125, 0.06781005859375, 0.0390625, 0.1195068359375, 0.10760498046875, 0.201171875, 0.020294189453125, 0.00579833984375, 0.0902099609375, 0.01678466796875, 0.1241455078125, 0.296142578125, 0.092041015625, 0.071533203125, ...

embed

74294537_c0

74294537

prolog

0

Title: Why do I get repeated information on my query with ProLog? Problem title: Why do I get repeated information on my query with ProLog? Tags: prolog Problem: Why do I get repeated information on my query with ProLog? I'm very new to ProLog, butI'm doing a simple blood donation query system, however I don't understa...

Why do I get repeated information on my query with ProLog? Why do I get repeated information on my query with ProLog? prolog Why ProLog pode_doar tipo_a tipo_b tipo_ab tipo_o fator_p fator_n blood_type rh_factor Why do I get repeated information on my query with ProLog? I'm very new to ProLog, butI'm doing a simple blo...

[ -0.00262451171875, 0.0157470703125, 0.0174560546875, 0.021484375, -0.018798828125, -0.0040283203125, -0.01214599609375, -0.004119873046875, -0.00162506103515625, -0.03271484375, 0.0078125, -0.016845703125, -0.0026702880859375, -0.006011962890625, 0.0037078857421875, -0.0107421875, 0....

[ 44084, 54, 2046, 119140, 297, 4677, 759, 41, 1294, 678, 1250, 113972, 98, 502, 4867, 2911, 246, 147, 4309, 11, 275, 2055, 31, 1071, 1290, 59714, 50986, 127, 144810, 4552, 3525, 8781, 163117, 5426, 28219, 15400, 48716, 111, 5701, 3229, 7...

[ 0.1038818359375, 0.080810546875, 0.085693359375, 0.259521484375, 0.1539306640625, 0.2020263671875, 0.030426025390625, 0.1331787109375, 0.11474609375, 0.035308837890625, 0.1666259765625, 0.2281494140625, 0.00311279296875, 0.099609375, 0.166259765625, 0.1552734375, 0.0947265625, 0.11...

embed

54449376_c0

54449376

prolog

0

Title: For length/2 how to add human readable variable names Problem title: For length/2 how to add human readable variable names Tags: prolog-toplevel, prolog Problem: For length/2 how to add human readable variable names How can human readable variable names be displayed for system generated variable names? As a simp...

For length/2 how to add human readable variable names For length/2 how to add human readable variable names prolog-toplevel prolog _5112 _5118 _5124 variable_names Vars read_term list_partitionedNU _5242 _5248 _5254 For length/2 how to add human readable variable names How can human readable variable names be displayed...

[ 0.0027618408203125, 0.015625, 0.00946044921875, 0.00799560546875, -0.005523681640625, 0.0037689208984375, 0.01226806640625, 0.0054931640625, 0.005889892578125, -0.0201416015625, 0.00640869140625, -0.00555419921875, -0.002685546875, 0.0162353515625, 0.0240478515625, 0.0050048828125, 0...

[ 1326, 140909, 12477, 3642, 15190, 14135, 12301, 2886, 77336, 123055, 502, 4867, 13784, 67919, 11703, 1530, 1819, 2357, 11627, 3323, 7, 32166, 5303, 15866, 1363, 33261, 12744, 13023, 110763, 12338, 831, 44116, 5426, 139392, 8781, 27781, 2806, ...

[ 0.04534912109375, 0.1824951171875, 0.21484375, 0.03448486328125, 0.1568603515625, 0.1690673828125, 0.197998046875, 0.1800537109375, 0.26025390625, 0.2032470703125, 0.127197265625, 0.172607421875, 0.0526123046875, 0.121826171875, 0.0762939453125, 0.111572265625, 0.1038818359375, 0.1...

embed

65456276_c1

65456276

prolog

1

592 in 12..22. It tells me that the values 6 and 3 issue a failure in this program. So I want to use this information to modify my test sequence, making use of a finite number of alternative values. In the end I would like to reach something like the following: solution_valueSeq_alternatives(Vs, Seq, []) :- !, fail. so...

[ 0.00970458984375, 0.02490234375, 0.0145263671875, 0.0093994140625, 0.00836181640625, -0.021484375, -0.007781982421875, 0.00170135498046875, 0.01031494140625, 0.01251220703125, -0.00083160400390625, 0.024169921875, 0.00970458984375, 0.03271484375, 0.01263427734375, 0.007293701171875, ...

[ 192616, 5035, 4015, 14192, 142424, 305, 136, 138, 31089, 137578, 1528, 3444, 4527, 4677, 2811, 40383, 3034, 40, 944, 3956, 94418, 30700, 3564, 1884, 58359, 29806, 27494, 4233, 864, 119927, 856, 7, 503, 711, 35782, 10544, 285, 162, 31304, ...

[ 0.2978515625, 0.1448974609375, 0.12548828125, 0.016326904296875, 0.2052001953125, 0.144775390625, 0.05914306640625, 0.1396484375, 0.14697265625, 0.2435302734375, 0.117919921875, 0.03778076171875, 0.06646728515625, 0.1485595703125, 0.10443115234375, 0.1036376953125, 0.1749267578125, ...

embed

70402338_c0

70402338

prolog

0

Title: Tau Prolog - how to convert a prolog list into a JavaScript array Problem title: Tau Prolog - how to convert a prolog list into a JavaScript array Tags: tau-prolog, prolog, javascript Problem: Tau Prolog - how to convert a prolog list into a JavaScript array I want to use Tau Prolog together with JavaScript on a...

Tau Prolog - how to convert a prolog list into a JavaScript array Tau Prolog - how to convert a prolog list into a JavaScript array tau-prolog prolog javascript Tau Prolog JavaScript console.log session.format_answer answer.lookup Term Num is_float Array answer.links.X.args Tau Prolog - how to convert a prolog list int...

[ 0.007720947265625, 0.005615234375, -0.01220703125, 0.008544921875, -0.0022125244140625, 0.01318359375, 0.0004730224609375, 0.0272216796875, 0.004241943359375, -0.0225830078125, 0.00872802734375, 0.0001010894775390625, -0.02880859375, 0.0084228515625, -0.008056640625, 0.00567626953125, ...

[ 21139, 1250, 4867, 3642, 96760, 502, 5303, 3934, 10, 17925, 10298, 47, 5705, 3454, 136951, 130250, 56002, 51727, 10133, 6488, 35166, 64747, 2037, 2994, 52782, 83, 52347, 257, 69253, 10187, 1542, 61477, 53, 3444, 4527, 25842, 678, 438, 112, ...

[ 0.280029296875, 0.2027587890625, 0.26416015625, 0.07257080078125, 0.1680908203125, 0.193603515625, 0.206787109375, 0.1181640625, 0.06463623046875, 0.249755859375, 0.22705078125, 0.007354736328125, 0.227783203125, 0.1402587890625, 0.18896484375, 0.1844482421875, 0.11572265625, 0.130...

embed

15839923_c1

15839923

prolog

1

of the problem (it is the base case of the solution) * If the list of queen is not empty I can divide it into [X/Y|Others] where X/Y rappresent position on the board of the first queen in the list * (the position is rappresentend by the couple (X,Y) where X is the column and Y the line) So, it is TRUE that the list [X...

[ 0.01177978515625, -0.00074005126953125, 0.0228271484375, 0.02001953125, -0.01513671875, -0.006011962890625, 0.0062255859375, -0.005218505859375, 0.025390625, -0.0128173828125, -0.003173828125, -0.0062255859375, -0.021728515625, -0.005462646484375, -0.0201416015625, 0.01519775390625, ...

[ 111, 2967, 3647, 7225, 29806, 5303, 41, 33, 83, 959, 201505, 831, 101637, 3934, 1542, 64, 1723, 58745, 670, 9319, 1193, 29892, 55247, 19069, 45443, 5117, 24941, 3365, 316, 990, 13315, 149842, 647, 10, 159, 93478, 35213, 25632, 91582, 2956...

[ 0.1004638671875, 0.2083740234375, 0.138427734375, 0.10400390625, 0.175048828125, 0.2191162109375, 0.185302734375, 0.15869140625, 0.0304107666015625, 0.05328369140625, 0.14306640625, 0.008209228515625, 0.1375732421875, 0.0279083251953125, 0.109130859375, 0.123046875, 0.1265869140625, ...

embed

13408214_c0

13408214

prolog

0

Title: Finding if a set is additive mod K in Prolog Problem title: Finding if a set is additive mod K in Prolog Tags: prolog, discrete-mathematics, addition Problem: Finding if a set is additive mod K in Prolog I am a beginner in Prolog and I figured I could try to write a simple test to check if a set of integers mod ...

Finding if a set is additive mod K in Prolog Finding if a set is additive mod K in Prolog prolog discrete-mathematics addition Finding Prolog Redo Fail Exit Call _158 _186 Finding if a set is additive mod K in Prolog I am a beginner in Prolog and I figured I could try to write a simple test to check if a set of integer...

[ 0.0001544952392578125, -0.002166748046875, 0.0185546875, 0.005767822265625, -0.0089111328125, -0.005828857421875, -0.0191650390625, 0.005615234375, 0.00921630859375, -0.004669189453125, 0.0203857421875, 0.01708984375, -0.00113677978515625, 0.0019683837890625, 0.004791259765625, 0.00646...

[ 26040, 2174, 5423, 171793, 5844, 2811, 341, 1250, 4867, 83, 502, 81604, 140363, 66044, 6096, 31, 190355, 5443, 26265, 137197, 23, 8781, 3034, 12765, 892, 26255, 866, 21115, 7413, 10554, 11907, 6626, 80854, 339, 12830, 37842, 27489, 7722, 35...

[ 0.08587646484375, 0.07989501953125, 0.2142333984375, 0.1629638671875, 0.1240234375, 0.201171875, 0.1995849609375, 0.144287109375, 0.223388671875, 0.039215087890625, 0.083740234375, 0.071533203125, 0.0206298828125, 0.1143798828125, 0.03875732421875, 0.087158203125, 0.0955810546875, ...

embed

62563091_c0

62563091

prolog

0

Title: Prolog - bagof - case of no results Problem title: Prolog - bagof - case of no results Tags: prolog Problem: Prolog - bagof - case of no results I have activity-users relations: % Signature: activity(Name,Day)/2 % Purpose: describe an activity at the country club and the day it takes place % activity(swimming,su...

Prolog - bagof - case of no results Prolog - bagof - case of no results prolog Prolog Signature Name Day Purpose Child_name Activity activity_participants_list Activity_Name List Prolog - bagof - case of no results I have activity-users relations: I want to create query to get all the participants of activity. So I use...

[ -0.0113525390625, -0.0118408203125, 0.0072021484375, 0.027587890625, -0.0302734375, 0.01806640625, -0.0123291015625, -0.0113525390625, 0.0035552978515625, -0.00070953369140625, -0.016845703125, -0.01513671875, -0.0198974609375, 0.00750732421875, -0.00531005859375, -0.0034637451171875, ...

[ 1250, 4867, 41780, 420, 7225, 111, 110, 50339, 502, 26729, 141762, 15757, 10013, 16915, 123829, 11627, 42902, 103488, 15866, 25258, 10840, 6562, 163612, 32036, 223, 1314, 91582, 3444, 28282, 41, 2046, 756, 70, 56480, 4527, 164414, 154663, 429...

[ 0.133544921875, 0.2069091796875, 0.134033203125, 0.1959228515625, 0.125732421875, 0.092529296875, 0.1121826171875, 0.124755859375, 0.0982666015625, 0.044281005859375, 0.029937744140625, 0.041015625, 0.094970703125, 0.06689453125, 0.086669921875, 0.045440673828125, 0.09228515625, 0....

embed

34460301_c0

34460301

prolog

0

Title: SICStus Prolog 4.3.2: clpfd got no power? Problem title: SICStus Prolog 4.3.2: clpfd got no power? Tags: sicstus-prolog, clpfd, portability, prolog Problem: SICStus Prolog 4.3.2: clpfd got no power? Some of my Prolog programs could profit quite a bit if I could replace all (is)/2 -based integer arithmetics by th...

SICStus Prolog 4.3.2: clpfd got no power? SICStus Prolog 4.3.2: clpfd got no power? sicstus-prolog clpfd portability prolog SICStus Prolog type_error fd_evaluable use_module ERROR Domain clpfd_expression illegal_array_access Existence user:wi SICStus Prolog 4.3.2: clpfd got no power? Some of my Prolog programs could pr...

[ -0.00775146484375, 0.00634765625, 0.0003833770751953125, -0.00958251953125, 0.00004172325134277344, 0.00775146484375, -0.003814697265625, -0.00958251953125, -0.004058837890625, -0.0184326171875, 0.00002086162567138672, 0.00885009765625, -0.0284423828125, -0.00077056884765625, 0.014709472...

[ 159, 102198, 2143, 1250, 4867, 1398, 107033, 33139, 39557, 71, 4163, 110, 14537, 26536, 18253, 3454, 4898, 83259, 502, 10644, 188800, 159258, 2661, 4527, 83279, 151206, 93702, 204629, 85325, 19305, 113041, 122688, 38937, 2452, 103391, 5809, 183...

[ 0.083251953125, 0.05523681640625, 0.1905517578125, 0.1527099609375, 0.2288818359375, 0.114990234375, 0.224609375, 0.107666015625, 0.1363525390625, 0.1788330078125, 0.0814208984375, 0.124755859375, 0.2464599609375, 0.0667724609375, 0.171142578125, 0.116943359375, 0.06884765625, 0.03...

embed

60246766_c0

60246766

prolog

0

Title: prolog - create list from facts by criteria Problem title: prolog - create list from facts by criteria Tags: fact, list, prolog Problem: prolog - create list from facts by criteria I'm trying to create list from the facts in SWI-Prolog. There are amount of exapmles but I don't understand how to create list by cr...

prolog - create list from facts by criteria prolog - create list from facts by criteria fact list prolog facts Body Rate deposit Bank Usage List Prof Pro Before How Expected prolog - create list from facts by criteria I'm trying to create list from the facts in SWI-Prolog. There are amount of exapmles but I don't under...

[ 0.0201416015625, -0.015869140625, 0.00225830078125, 0.00408935546875, 0.003082275390625, 0.00958251953125, 0.005950927734375, 0.022216796875, 0.02294921875, 0.00008869171142578125, 0.00860595703125, -0.0133056640625, -0.01531982421875, -0.0289306640625, 0.01287841796875, 0.014953613281...

[ 502, 4867, 28282, 5303, 1295, 15824, 7, 390, 55738, 11, 43960, 131182, 40370, 4932, 70166, 32036, 11739, 1250, 117371, 11249, 60075, 13, 89829, 31577, 159, 38969, 10752, 41170, 1119, 2631, 39, 1577, 28219, 18151, 35064, 7145, 2063, 67, 1256...

[ 0.1578369140625, 0.259765625, 0.16064453125, 0.2139892578125, 0.1068115234375, 0.1837158203125, 0.054473876953125, 0.1051025390625, 0.191162109375, 0.1302490234375, 0.082275390625, 0.11572265625, 0.1466064453125, 0.10498046875, 0.09814453125, 0.1390380859375, 0.1099853515625, 0.158...

embed

57808598_c0

57808598

prolog

0

Title: Prolog Error: `character' expected, found `"((.).)"' (a string) Problem title: Prolog Error: `character' expected, found `"((.).)"' (a string) Tags: dcg, prolog Problem: Prolog Error: `character' expected, found `"((.).)"' (a string) My goal is to print all forms of trees ...

Prolog Error: `character' expected, found `"((.).)"' (a string) Prolog Error: `character' expected, found `"((.).)"' (a string) dcg prolog Prolog Error form1 Prev Next string_concat Inter form2 Strings PrevStrings1 List1 List2 Result Type _3182 Prolog Error: `character' expected,...

[ 0.0279541015625, 0.00970458984375, -0.027099609375, 0.00994873046875, -0.0034942626953125, 0.0076904296875, -0.01123046875, -0.003326416015625, 0.0025177001953125, -0.05419921875, 0.00007295608520507812, -0.03369140625, -0.004425048828125, 0.0033721923828125, 0.0107421875, 0.0017166137...

[ 1250, 4867, 212059, 9254, 2263, 720, 3768, 84751, 14037, 41502, 5, 79315, 177, 502, 3173, 74717, 4997, 2271, 4460, 5337, 304, 23351, 71713, 5180, 32036, 126684, 60457, 5016, 12012, 69236, 28412, 756, 1360, 90, 678, 541, 110, 988, 49129, 1...

[ 0.1900634765625, 0.250244140625, 0.215576171875, 0.118408203125, 0.1759033203125, 0.162109375, 0.1585693359375, 0.255126953125, 0.1612548828125, 0.009246826171875, 0.068115234375, 0.206298828125, 0.064453125, 0.1473388671875, 0.1597900390625, 0.06591796875, 0.05670166015625, 0.0121...

embed

37231990_c0

37231990

prolog

0

Title: Prolog: Append complex terms in a list Problem title: Prolog: Append complex terms in a list Tags: prolog, append, instantiation, list Problem: Prolog: Append complex terms in a list I'm new with Prolog and I have a problem that I don't understand why. I have a predicate (maybe wrong) that is to split a list in ...

Prolog: Append complex terms in a list Prolog: Append complex terms in a list prolog append instantiation list Prolog Append PrimerEdificio RestoEdificios ListaA ListaB ListaParcialA ListaParcialB LongitudResto LongitudA Call _G3026 _G3027 _G3140 _G3141 Exit _G3144 Prolog: Append complex terms in a list I'm new with Pr...

[ 0.011962890625, 0.028564453125, 0.007415771484375, 0.0162353515625, 0.0096435546875, 0.009521484375, -0.0035247802734375, 0.0439453125, 0.01904296875, -0.0166015625, 0.024169921875, -0.0018157958984375, 0.001617431640625, 0.0125732421875, 0.0167236328125, 0.0034027099609375, 0.030883...

[ 1250, 4867, 5659, 3611, 27140, 69407, 23, 5303, 10, 502, 114689, 34648, 14, 46282, 69489, 14486, 846, 49756, 31, 5790, 50085, 571, 26136, 21753, 4332, 2785, 14407, 284, 26265, 1197, 4046, 3768, 363, 43900, 5016, 8894, 5443, 724, 131663, 3...

[ 0.160400390625, 0.240234375, 0.1370849609375, 0.1397705078125, 0.241943359375, 0.2255859375, 0.07562255859375, 0.2091064453125, 0.016815185546875, 0.109375, 0.1649169921875, 0.132080078125, 0.104736328125, 0.114990234375, 0.0248565673828125, 0.089111328125, 0.0814208984375, 0.07843...

embed

64541632_c1

64541632

prolog

1

, Right), format('~w', [Value]), ( Value = 'and' -> write('(') ; true), ( Value = 'or' -> write('(') ; true), ( Value = 'not' -> write('(') ; true), printTree(Left), ( Value = 'and' -> write(',') ; true), ( Value = 'or' -> write(',') ; true), printTree(Right), ( Value = 'and' -> write(')') ; true), ( Value = 'not' -> w...

[ 0.010498046875, 0.0181884765625, 0.016357421875, 0.02294921875, -0.004150390625, 0.033935546875, -0.0228271484375, -0.02587890625, 0.0179443359375, 0.000244140625, -0.0072021484375, -0.0240478515625, -0.00007963180541992188, -0.01123046875, 0.0191650390625, -0.0034637451171875, 0.004...

[ 6, 4, 90911, 247, 9384, 2306, 434, 856, 50770, 190060, 2940, 33079, 33022, 29568, 748, 10869, 28412, 62731, 13, 2480, 22553, 965, 532, 8, 594, 43425, 1542, 110, 112, 990, 2292, 1723, 3525, 157, 11627, 8439, 1745, 5072, 12663, 69141, 10,...

[ 0.00079345703125, 0.0278778076171875, 0.188232421875, 0.0297698974609375, 0.2244873046875, 0.06671142578125, 0.20166015625, 0.1376953125, 0.21044921875, 0.259765625, 0.1834716796875, 0.0223236083984375, 0.1607666015625, 0.177001953125, 0.17333984375, 0.162109375, 0.155029296875, 0....

embed

36235348_c0

36235348

prolog

0

Title: Prolog and limitations of backtracking Problem title: Prolog and limitations of backtracking Tags: prolog Problem: Prolog and limitations of backtracking This is probably the most trivial implementation of a function that returns the length of a list in Prolog count([], 0). count([_|B], T) :- count(B, U), T is U...

Prolog and limitations of backtracking Prolog and limitations of backtracking prolog Prolog _G4337877 _G4337880 _G4337883 _G4369400 Prolog and limitations of backtracking This is probably the most trivial implementation of a function that returns the length of a list in Prolog one thing about Prolog that I still cannot...

[ 0.0230712890625, 0.035888671875, 0.0126953125, 0.005767822265625, -0.0001316070556640625, -0.00506591796875, -0.01141357421875, 0.005584716796875, 0.02978515625, -0.050537109375, -0.00701904296875, -0.023193359375, 0.0033416748046875, 0.022705078125, 0.01129150390625, 0.0040283203125, ...

[ 1250, 4867, 136, 205969, 4420, 125728, 214, 7, 502, 182055, 11548, 134808, 4836, 150177, 146406, 10700, 2684, 686, 208124, 32354, 30646, 140909, 5303, 7464, 53418, 137565, 10336, 10932, 71985, 2481, 17368, 77336, 171859, 831, 11675, 54529, 876,...

[ 0.20703125, 0.278076171875, 0.011810302734375, 0.2215576171875, 0.1416015625, 0.2410888671875, 0.040191650390625, 0.025390625, 0.1246337890625, 0.1063232421875, 0.0419921875, 0.03594970703125, 0.081787109375, 0.039276123046875, 0.006683349609375, 0.06976318359375, 0.033843994140625, ...

embed

11054424_c1

11054424

prolog

1

- [openpage]. % openpage compiled 0.00 sec, 616 bytes true. ?- request('http://www.google.com', In). ERROR: request/2: Undefined procedure: http_open/3 ?- [forced] Action (h for help) ? exit So in my next session, I invoke use_module/1 before loading my source file, and all is fine: ?- use_module(library(http/http_open...

[ 0.0028076171875, 0.00604248046875, 0.0074462890625, 0.005279541015625, 0.01318359375, 0.01055908203125, 0.003143310546875, -0.005828857421875, -0.002838134765625, -0.08251953125, 0.03076171875, -0.031494140625, -0.0120849609375, -0.00927734375, 0.028564453125, -0.0205078125, 0.000265...

[ 59636, 22469, 1745, 9803, 375, 5974, 37509, 19216, 305, 2485, 390, 29568, 50336, 5475, 1574, 59875, 277, 360, 151206, 24638, 12477, 79912, 5983, 50491, 1621, 18113, 50930, 71, 57945, 127, 4358, 82230, 23, 11737, 56002, 23253, 4527, 83279, 1...

[ 0.2362060546875, 0.256103515625, 0.065673828125, 0.166015625, 0.050262451171875, 0.2174072265625, 0.15185546875, 0.1597900390625, 0.01806640625, 0.206787109375, 0.07952880859375, 0.1192626953125, 0.16796875, 0.12109375, 0.0256195068359375, 0.1575927734375, 0.1259765625, 0.135620117...

embed

66619508_c1

66619508

prolog

1

ab_minimax(max,Board,-inf,inf,Value, NextBoard). ab_minimax(max,Board,_,_,-1, NextBoard):- is_winning_state_o(Board), !. ab_minimax(min,Board,_,_,1, NextBoard):- is_winning_state_x(Board), !. ab_minimax(_,Board,_,_,0, NextBoard):- is_a_draw(Board), !. ab_minimax(max,Board,Alfa,Beta,Value, NextBoard):- children(Board, ...

[ -0.00201416015625, -0.020751953125, 0.032958984375, 0.0162353515625, 0.00238037109375, 0.00872802734375, 0.0133056640625, 0.01068115234375, 0.010498046875, -0.002685546875, -0.0260009765625, 0.009765625, 0.018310546875, -0.0028076171875, 0.003021240234375, -0.04443359375, -0.00114440...

[ 1563, 454, 9222, 24084, 132, 4, 12647, 5861, 46632, 856, 50770, 4997, 194, 5759, 9, 83, 69986, 61340, 31, 711, 1249, 418, 425, 2389, 11, 86905, 5, 6210, 1021, 6766, 102, 20020, 18389, 91345, 237052, 102656, 63813, 881, 71346, 841, 618, ...

[ 0.232177734375, 0.0848388671875, 0.2374267578125, 0.25634765625, 0.01605224609375, 0.01788330078125, 0.160888671875, 0.2158203125, 0.1685791015625, 0.0758056640625, 0.15771484375, 0.14990234375, 0.06427001953125, 0.114013671875, 0.01275634765625, 0.1092529296875, 0.2198486328125, 0...

embed

64754007_c0

64754007

prolog

0

Title: Largest empty subgraph of an undirected graph in SWI Prolog Problem title: Largest empty subgraph of an undirected graph in SWI Prolog Tags: graph-theory, prolog, undirected-graph Problem: Largest empty subgraph of an undirected graph in SWI Prolog An undirected graph is given. Find the number of internal stabil...

Largest empty subgraph of an undirected graph in SWI Prolog Largest empty subgraph of an undirected graph in SWI Prolog graph-theory prolog undirected-graph Largest SWI Prolog _________c_______ VisitedNodes TailPath VisitedNode Largest empty subgraph of an undirected graph in SWI Prolog I set the edges and vertices. An...

[ 0.00604248046875, 0.017333984375, 0.0137939453125, 0.0223388671875, -0.0186767578125, 0.015380859375, -0.014404296875, -0.0037841796875, 0.00714111328125, -0.0167236328125, -0.00016689300537109375, -0.0166015625, -0.00677490234375, 0.0115966796875, 0.0257568359375, 0.02294921875, 0.0...

[ 181268, 271, 201505, 1614, 41382, 51, 80581, 38969, 1250, 4867, 159, 502, 98684, 297, 5021, 988, 1218, 379, 683, 10519, 5423, 121303, 136, 95378, 5170, 44116, 5303, 135457, 54, 11737 ]

[ 0.0997314453125, 0.046630859375, 0.2158203125, 0.146240234375, 0.170654296875, 0.05242919921875, 0.1220703125, 0.164306640625, 0.0904541015625, 0.17138671875, 0.0191497802734375, 0.03680419921875, 0.1116943359375, 0.0153656005859375, 0.0799560546875, 0.03338623046875, 0.0526123046875...

embed

65180949_c0

65180949

prolog

0

Title: Most common sublist in Prolog Problem title: Most common sublist in Prolog Tags: sublist, algorithm, list, prolog Problem: Most common sublist in Prolog The problem is as follows: Write a predicate in Prolog most_common_sublist(L1,N,L2) that will find the sublist L2 with length N such that it is the most common ...

Most common sublist in Prolog Most common sublist in Prolog sublist algorithm list prolog Most Prolog Example most_common_sublist Result LOP Temp N-1 Hits check_how_many Pattern Most common sublist in Prolog The problem is as follows: Write a predicate in Prolog most_common_sublist(L1,N,L2) that will find the sublist L...

[ 0.0072021484375, -0.0048828125, 0.006622314453125, -0.0172119140625, -0.00860595703125, 0.024658203125, -0.0025634765625, 0.005523681640625, 0.0220947265625, -0.042724609375, 0.00750732421875, 0.02099609375, 0.02099609375, -0.0185546875, -0.006103515625, -0.00145721435546875, 0.01550...

[ 17006, 39210, 1614, 6562, 1250, 4867, 234873, 5303, 502, 89536, 2684, 277, 3796, 22144, 126684, 20880, 37446, 541, 5759, 145484, 12765, 47251, 669, 9876, 2967, 18781, 1653, 2063, 67, 839, 10461, 339, 304, 140909, 418, 51515, 139392, 7722, 1...

[ 0.066162109375, 0.1748046875, 0.22216796875, 0.19189453125, 0.153076171875, 0.234375, 0.1397705078125, 0.120849609375, 0.08447265625, 0.0220489501953125, 0.0653076171875, 0.04705810546875, 0.08160400390625, 0.187744140625, 0.1259765625, 0.1409912109375, 0.1497802734375, 0.061767578...

embed

41227318_c0

41227318

prolog

0

Title: Prolog algorithm for 3 water jugs Problem title: Prolog algorithm for 3 water jugs Tags: water-jug-problem, prolog Problem: Prolog algorithm for 3 water jugs I was trying to make a program to solve 3 any size water jugs problem. I have written this much refil(Size,_,_,Size). refil(FirstSize,SecondSize,ThirdSize,...

Prolog algorithm for 3 water jugs Prolog algorithm for 3 water jugs water-jug-problem prolog Prolog Size FirstSize SecondSize ThirdSize Goal New1 New2 New3 TempVal1 New2-SecondSize NextVal1 NextVal2 NextVal3 New3-ThirdSize reduce1 reduce2 Jug Prolog algorithm for 3 water jugs I was trying to make a program to solve 3 a...

[ -0.0025177001953125, 0.00836181640625, 0.0074462890625, 0.01031494140625, -0.01434326171875, -0.003173828125, -0.034912109375, 0.006134033203125, -0.005096435546875, 0.0230712890625, 0.0172119140625, 0.00885009765625, 0.00799560546875, -0.0016021728515625, 0.004241943359375, -0.0023651...

[ 1250, 4867, 234873, 138, 7401, 103863, 7, 461, 177, 38953, 502, 80378, 23972, 127167, 77648, 198387, 2016, 289, 2356, 418, 304, 363, 37446, 42272, 18504, 4997, 27495, 117177, 34390, 3314, 31577, 1528, 86869, 2499, 13267, 2967, 5045, 18151, ...

[ 0.1649169921875, 0.240478515625, 0.2239990234375, 0.226318359375, 0.1527099609375, 0.269775390625, 0.0706787109375, 0.199462890625, 0.1231689453125, 0.1768798828125, 0.136962890625, 0.1365966796875, 0.0430908203125, 0.1162109375, 0.0562744140625, 0.147216796875, 0.1712646484375, 0....

embed

53290479_c0

53290479

prolog

0

Title: Prolog: Give list to a fact Problem title: Prolog: Give list to a fact Tags: prolog Problem: Prolog: Give list to a fact Lets say I'm looking for someones friends. friend(mary, peter). friend(mary, paul). friend(mary, john). friend(mary, justin). friend(chris, peter). friend(chris, paul). friend(chris, conner). ...

Prolog: Give list to a fact Prolog: Give list to a fact prolog Prolog Give Prolog: Give list to a fact Lets say I'm looking for someones friends. In the above example I know that I can do something like which will tell me everyone paul is friends with or also which will return a list of everyone paul is friends with. L...

[ 0.0361328125, -0.0133056640625, -0.003448486328125, 0.033447265625, -0.0208740234375, -0.004241943359375, 0.003204345703125, 0.01129150390625, 0.01226806640625, -0.0169677734375, 0.0052490234375, -0.012939453125, -0.0034942626953125, 0.032470703125, -0.00738525390625, 0.00714111328125,...

[ 1250, 4867, 77878, 5303, 47, 15824, 502, 16487, 100, 22008, 23902, 27781, 3714, 831, 54, 1884, 14192, 30309, 249, 202, 83, 678, 2843, 30646, 3444, 738, 10176, 4785, 53894, 56, 33938, 18831, 1212, 717, 2046, 62, 186, 111, 1727, 53, 17656...

[ 0.1473388671875, 0.2333984375, 0.171142578125, 0.250244140625, 0.0966796875, 0.2193603515625, 0.1141357421875, 0.1295166015625, 0.1328125, 0.044036865234375, 0.2149658203125, 0.08734130859375, 0.043243408203125, 0.03814697265625, 0.039398193359375, 0.04180908203125, 0.1187744140625, ...

embed

32635299_c0

32635299

prolog

0

Title: Gerrit Prolog Rule - Require specific file type Problem title: Gerrit Prolog Rule - Require specific file type Tags: prolog, gerrit Problem: Gerrit Prolog Rule - Require specific file type I am new to Gerrit and Prolog, and am having difficulty creating my rule. With the rules.pl I currently have, it stalls when...

Gerrit Prolog Rule - Require specific file type Gerrit Prolog Rule - Require specific file type prolog gerrit Gerrit Prolog Rule Require submit_rule gerrit:default_submit my_rule gerrit:commit_delta Text-File-Must-Be-Present Gerrit Prolog Rule - Require specific file type I am new to Gerrit and Prolog, and am having di...

[ 0.017822265625, -0.0086669921875, 0.00106048583984375, 0.0026702880859375, -0.01312255859375, 0.0025787353515625, -0.00848388671875, -0.0062255859375, 0.00096893310546875, -0.0101318359375, 0.0223388671875, -0.00640869140625, -0.017578125, -0.01495361328125, 0.02587890625, 0.0192871093...

[ 8022, 2783, 1250, 4867, 139118, 853, 3181, 29458, 11435, 10644, 502, 4155, 137447, 882, 133, 214810, 22144, 4007, 759, 277, 1743, 102, 24129, 174350, 55668, 18, 6766, 19273, 12832, 3525, 34844, 105233, 79986, 91736, 2424, 82424, 765, 92621, ...

[ 0.1436767578125, 0.263671875, 0.1456298828125, 0.233154296875, 0.2119140625, 0.019805908203125, 0.1644287109375, 0.1832275390625, 0.211669921875, 0.184814453125, 0.118896484375, 0.10577392578125, 0.125, 0.1571044921875, 0.1112060546875, 0.17333984375, 0.0943603515625, 0.20336914062...

embed

28138944_c1

28138944

prolog

1

, P, A) :- tryGuess(Colors, Size, J, A), //Possibilities in J copy(J, X), //First possible result J -> X J = P, //Unification of all results run(Colors, Size, J, X). //loop tryGuess(_, _, _, []) :- !. tryGuess(Colors, Size, P, A) :- write('Evaluation of: '), write(A), nl, write('Black pegs: '), read(B), nl, write('Whit...

[ -0.00823974609375, -0.0111083984375, 0.01708984375, 0.0245361328125, 0.0087890625, 0.00604248046875, -0.00872802734375, -0.0004558563232421875, 0.019775390625, -0.0028533935546875, -0.00131988525390625, 0.04248046875, 0.00457763671875, 0.00238037109375, 0.00848388671875, 0.009704589843...

[ 4, 436, 62, 15772, 9790, 22769, 90, 7, 78457, 25251, 80378, 821, 4666, 7192, 36584, 2449, 43658, 1375, 1193, 247, 207263, 7722, 16750, 33079, 2203, 14256, 41274, 756, 50339, 11675, 28354, 268, 16, 711, 33022, 132, 647, 27494, 2320, 111, ...

[ 0.06011962890625, 0.0914306640625, 0.135986328125, 0.1239013671875, 0.1837158203125, 0.2353515625, 0.220947265625, 0.1636962890625, 0.134521484375, 0.1390380859375, 0.189697265625, 0.1522216796875, 0.042633056640625, 0.10467529296875, 0.19482421875, 0.0804443359375, 0.138427734375, ...

embed

61106653_c1

61106653

prolog

1

_power(earthquake, 100). has_power(scald, 80). has_power(icebeam, 90). has_power(darkpulse, 80). has_power(aurasphere, 80). has_power(sludgebomb, 90). has_power(hpfire, 60). I am trying to make a rule that gets the maximum amount damage done, but i am unsure as how to go about this. What i have so far is a rule that ca...

[ 0.0159912109375, 0.01116943359375, 0.017578125, 0.037353515625, -0.0003223419189453125, 0.00830078125, 0.0023345947265625, -0.01373291015625, 0.0036468505859375, -0.019287109375, 0.0069580078125, 0.00396728515625, 0.007659912109375, -0.0135498046875, 0.007232666015625, 0.00142669677734...

[ 101, 62783, 90134, 13722, 350, 805, 1556, 16275, 7344, 2248, 2980, 372, 302, 2510, 1506, 69035, 103984, 157695, 10791, 61007, 96946, 254, 73702, 1496, 31577, 3249, 79986, 62163, 38132, 41170, 82649, 16940, 51646, 1672, 2060, 83324, 36766, 10,...

[ 0.04388427734375, 0.19921875, 0.0709228515625, 0.155029296875, 0.05810546875, 0.14990234375, 0.116943359375, 0.04498291015625, 0.1385498046875, 0.15234375, 0.0733642578125, 0.1229248046875, 0.11328125, 0.1490478515625, 0.069091796875, 0.1776123046875, 0.11572265625, 0.197021484375,...

embed

57006348_c1

57006348

prolog

1

, Tree, _) -> ( succ(Len, Len1), append([Dig], Curr, Currn), same_ending1(Digs, SubTree, Currn, Fin, Len1, Len2) ) ; Len2 = Len, Fin = Curr-Tree ). Edit 2 : For the final suggestion on @gusbro 's answer I created this code ssame_endings(L1,[],Curr,Final):- Final=Curr. ssame_endings(L1, L2,Curr,Final):- build_tree(L1, T...

[ -0.006256103515625, 0.0263671875, -0.005584716796875, -0.0120849609375, -0.00244140625, 0.00714111328125, -0.0390625, 0.01025390625, 0.01202392578125, -0.03759765625, 0.0101318359375, -0.0096435546875, 0.034423828125, 0.00191497802734375, 0.0126953125, -0.00799560546875, 0.0131225585...

[ 6, 4, 101344, 101, 33079, 166, 10060, 866, 33, 18226, 17727, 114689, 71, 397, 872, 17065, 42, 19, 5701, 6238, 418, 7, 8273, 62731, 13, 13316, 10461, 2819, 304, 2203, 9, 194, 42079, 2704, 199015, 14336, 6369, 75935, 903, 18151, 91, 401...

[ 0.01214599609375, 0.057159423828125, 0.310546875, 0.1025390625, 0.0789794921875, 0.1004638671875, 0.130859375, 0.103271484375, 0.15087890625, 0.1845703125, 0.08026123046875, 0.140869140625, 0.05694580078125, 0.04754638671875, 0.1478271484375, 0.148193359375, 0.1510009765625, 0.0762...

embed

46771508_c1

46771508

prolog

1

/omnivores eat at night based on animal_food being eaten at night. Another example: ?- eats(bessie, cabbage, 14.00). will return true if bessie is a herbivore, cabbage is plant_food and herbivores eat during the day based on plant_food being eaten during the day. Also, the eater cannot be of the same class as the Food ...

[ 0.02197265625, 0.01324462890625, 0.006591796875, 0.008544921875, -0.000255584716796875, -0.0021209716796875, 0.000873565673828125, -0.01031494140625, 0.00775146484375, -0.03564453125, -0.004547119140625, 0.00872802734375, -0.00274658203125, -0.0035400390625, 0.0177001953125, -0.0170898...

[ 248, 306, 93, 3104, 90, 73203, 99, 17431, 35509, 26249, 49558, 8035, 33, 27781, 705, 28, 9821, 7438, 3629, 38980, 402, 429, 80461, 30646, 29568, 2174, 186, 91573, 83, 10, 604, 964, 104297, 18153, 454, 136, 20271, 5155, 46429, 53418, 570...

[ 0.02197265625, 0.09173583984375, 0.09259033203125, 0.183837890625, 0.06182861328125, 0.1912841796875, 0.104736328125, 0.2259521484375, 0.114013671875, 0.158203125, 0.1749267578125, 0.009674072265625, 0.02685546875, 0.09783935546875, 0.0213623046875, 0.1307373046875, 0.112548828125, ...

embed

39212508_c1

39212508

prolog

1

new Atom("C:\\Natural_Language_Final_Project\\PrologTest\\src\\clauses_qa2.pl")}); Query q2 = new Query("consult",new Term[]{new Atom("C:\\Natural_Language_Final_Project\\PrologTest\\src\\rules.pl")}); Scanner scan = new Scanner(ruleFile); while (scan.hasNextLine()){ System.out.println(scan.nextLine()); } jpl.JPL.init(...

[ 0.02099609375, 0.0174560546875, 0.0068359375, 0.0196533203125, -0.01226806640625, 0.0196533203125, 0.0034332275390625, -0.013671875, -0.00396728515625, -0.02978515625, 0.0033721923828125, 0.0155029296875, -0.0203857421875, -0.033935546875, 0.006927490234375, 0.0067138671875, 0.004119...

[ 3525, 69728, 149989, 10393, 4588, 6159, 6236, 223353, 10752, 4867, 111337, 19437, 18347, 29001, 5498, 5442, 2424, 58836, 8096, 304, 147834, 54936, 2994, 13500, 65533, 44954, 882, 133, 174350, 4398, 10557, 81280, 93232, 12353, 6056, 21130, 84572...

[ 0.07806396484375, 0.2264404296875, 0.07928466796875, 0.08837890625, 0.0076904296875, 0.06494140625, 0.060760498046875, 0.087158203125, 0.1405029296875, 0.2342529296875, 0.18505859375, 0.07080078125, 0.07421875, 0.0576171875, 0.074951171875, 0.061004638671875, 0.14453125, 0.15734863...

embed

73602036_c0

73602036

prolog

0

Title: Trying to solve a game in Prolog Problem title: Trying to solve a game in Prolog Tags: clpfd, prolog Problem: Trying to solve a game in Prolog Suppose, we have the following game: There is a pair of numbers (x, y), 2 players are making moves. During the move a player can increase any number by 1 or multiply it b...

Trying to solve a game in Prolog Trying to solve a game in Prolog clpfd prolog Trying Prolog use_module next_state sequence_correct Trying to solve a game in Prolog Suppose, we have the following game: There is a pair of numbers (x, y), 2 players are making moves. During the move a player can increase any number by 1 o...

[ -0.0106201171875, 0.0048828125, 0.022216796875, 0.0089111328125, -0.005706787109375, 0.0042724609375, -0.006866455078125, -0.001983642578125, 0.003509521484375, -0.0225830078125, 0.0030975341796875, 0.032470703125, 0.0034942626953125, 0.01202392578125, 0.01116943359375, -0.005737304687...

[ 40858, 214, 86869, 6712, 23, 1250, 4867, 33139, 39557, 71, 502, 4527, 83279, 11737, 61340, 40, 944, 3956, 32399, 25632, 80836, 101935, 425, 113, 116, 92865, 20662, 25813, 133698, 58585, 831, 51312, 14012, 106, 707, 6024, 62479, 787, 2750, ...

[ 0.129150390625, 0.02191162109375, 0.1751708984375, 0.1241455078125, 0.076171875, 0.1910400390625, 0.253173828125, 0.02978515625, 0.05706787109375, 0.07806396484375, 0.13427734375, 0.0701904296875, 0.12353515625, 0.16015625, 0.1693115234375, 0.032318115234375, 0.0762939453125, 0.001...

embed

66459122_c0

66459122

prolog

0

Title: Creating a Knowledge Base and Querying in Prolog Problem title: Creating a Knowledge Base and Querying in Prolog Tags: prolog, knowledge-capture Problem: Creating a Knowledge Base and Querying in Prolog I want to create the Knowledge base equivalent to the statements as below in Prolog. John likes all kind of fo...

Creating a Knowledge Base and Querying in Prolog Creating a Knowledge Base and Querying in Prolog prolog knowledge-capture Creating Knowledge Base Querying Prolog ERROR Warning Clauses Current Use Creating a Knowledge Base and Querying in Prolog I want to create the Knowledge base equivalent to the statements as below ...

[ 0.041259765625, 0.01470947265625, 0.000514984130859375, 0.017822265625, 0.0031585693359375, 0.0054931640625, 0.0035552978515625, 0.003326416015625, 0.007293701171875, -0.009033203125, 0.00799560546875, -0.008544921875, -0.00762939453125, -0.0023193359375, 0.002471923828125, 0.018554687...

[ 56781, 191428, 44978, 136, 58836, 38543, 1250, 4867, 10, 23, 502, 51359, 15644, 1916, 151206, 24638, 5550, 100700, 114063, 36836, 3444, 28282, 3647, 183234, 63805, 35064, 4939, 1884, 756, 8562, 15381, 4129, 55670, 2661, 64113, 35672, 28, 9821...

[ 0.134765625, 0.184326171875, 0.23046875, 0.054901123046875, 0.1468505859375, 0.1357421875, 0.158447265625, 0.241943359375, 0.0149688720703125, 0.01531982421875, 0.092529296875, 0.115234375, 0.115234375, 0.0074462890625, 0.08984375, 0.007568359375, 0.0941162109375, 0.05596923828125,...

embed

18220248_c0

18220248

prolog

0

Title: to load the same prolog file into different modules in jpl Problem title: to load the same prolog file into different modules in jpl Tags: swi-prolog, prolog, jpl Problem: to load the same prolog file into different modules in jpl I am trying to use jpl to load the same swipl file into different modules. The rea...

to load the same prolog file into different modules in jpl to load the same prolog file into different modules in jpl swi-prolog prolog jpl jpl.PrologException PrologException permission_error load.pro load_files Non-module to_mess jpl.Query.get1 Query.java:336 jpl.Query.hasMoreSolutions Query.java:258 jpl.Query.oneSol...

[ 0.01470947265625, 0.035888671875, -0.0098876953125, 0.00093841552734375, -0.01434326171875, -0.01177978515625, 0.01483154296875, 0.00823974609375, 0.0035247802734375, -0.072265625, 0.00830078125, 0.00531005859375, -0.00396728515625, -0.02197265625, 0, 0.0198974609375, -0.0146484375, ...

[ 47, 72367, 5701, 502, 4867, 11435, 3934, 12921, 88996, 23, 1647, 2424, 2452, 3454, 10752, 63928, 1250, 168081, 188800, 29822, 3775, 83279, 3716, 41732, 58836, 24071, 122880, 102588, 34, 134900, 15265, 64552, 41, 91, 33657, 3525, 1653, 2063, ...

[ 0.033905029296875, 0.1976318359375, 0.1405029296875, 0.1798095703125, 0.23974609375, 0.13916015625, 0.1226806640625, 0.166259765625, 0.21142578125, 0.012908935546875, 0.0960693359375, 0.2340087890625, 0.1768798828125, 0.149169921875, 0.11767578125, 0.081787109375, 0.1348876953125, ...

embed

18592396_c0

18592396

prolog

0

Title: Predicate not working Problem title: Predicate not working Tags: predicate, prolog Problem: Predicate not working I'm new to prolog, and I really don't understand how things really work. Giving the following knowledge base, from a simplified social network: % user(nickname,email,city,friends_list) user(nick0,mai...

Predicate not working Predicate not working predicate prolog Predicate friends_list nick0 mail0 nick1 nick8 mail1 nick3 nick5 nick9 nick2 mail2 nick7 mail3 nick4 mail4 nick6 mail5 mail6 mail7 mail8 mail9 List Predicate not working I'm new to prolog, and I really don't understand how things really work. Giving the follo...

[ -0.0125732421875, -0.00885009765625, 0.001312255859375, -0.003814697265625, -0.0164794921875, 0.0128173828125, 0.001129150390625, -0.00982666015625, 0.002044677734375, -0.0225830078125, -0.007354736328125, -0.00592041015625, -0.006195068359375, -0.0169677734375, 0.006591796875, -0.0031...

[ 7145, 2063, 67, 959, 20697, 1653, 502, 4867, 23902, 6562, 128911, 2389, 6648, 1019, 363, 758, 1126, 32036, 3525, 28219, 8966, 6183, 4488, 25632, 51359, 3647, 112892, 2265, 33120, 3871, 44677, 33261, 26943, 139392, 5303, 26349, 678, 14012, 7...

[ 0.220947265625, 0.2685546875, 0.158935546875, 0.1629638671875, 0.217041015625, 0.1929931640625, 0.1773681640625, 0.22802734375, 0.1922607421875, 0.1793212890625, 0.1234130859375, 0.126708984375, 0.0849609375, 0.067626953125, 0.034515380859375, 0.0631103515625, 0.166259765625, 0.187...

embed

14095197_c0

14095197

prolog

0

Title: Count in prolog - Impossible to do Problem title: Count in prolog - Impossible to do Tags: prolog Problem: Count in prolog - Impossible to do EDIT : More simple : I changed my code to simplify. A predicate "nbarret" return the numbers of stations i want. So there is my new code, but it doesn't change anything : ...

Count in prolog - Impossible to do Count in prolog - Impossible to do prolog Count Impossible nb_stations Dir ERROR Arguments Exception _G2031 _G2270 _G2711 charles_de_gaulle_etoile bir_hakeim la_defense num_stations Dir1 Dir2 Count in prolog - Impossible to do EDIT : More simple : I changed my code to simplify. A pred...

[ 0.0027008056640625, -0.006072998046875, 0.00110626220703125, -0.00457763671875, 0.00885009765625, 0.007049560546875, 0.0079345703125, 0.00927734375, 0.0322265625, -0.06103515625, 0.00122833251953125, -0.00099945068359375, 0.000736236572265625, 0.0174560546875, 0.0208740234375, -0.01190...

[ 108210, 23, 502, 4867, 239596, 47, 54, 653, 275, 41311, 19946, 151206, 24638, 112140, 63928, 1549, 5016, 5757, 3768, 1662, 1577, 112, 49624, 31580, 1340, 263, 70704, 464, 21, 6211, 13269, 418, 304, 8781, 98816, 18151, 112892, 1653, 2063, ...

[ 0.243896484375, 0.106689453125, 0.16796875, 0.208740234375, 0.2274169921875, 0.06854248046875, 0.060791015625, 0.051544189453125, 0.10595703125, 0.209228515625, 0.07537841796875, 0.09649658203125, 0.013336181640625, 0.160400390625, 0.103759765625, 0.02008056640625, 0.1708984375, 0....

embed

38472425_c1

38472425

prolog

1

: gardener, highSchoolMathTeacher %Jim: vetAssistant, dishWasher %John: nurse, biologyTutor %Given Information, aka FACTS: %person(Name). person(mary). person(jim). person(john). %job(JobName). job(gardener). job(vetAssistant). job(dishWasher). job(nurse). job(highSchoolMathTeacher). job(biologyTutor). went_Out(nurse,v...

[ 0.01416015625, 0.031005859375, 0.0074462890625, 0.0211181640625, -0.0201416015625, 0.0294189453125, -0.037841796875, 0.0118408203125, 0.015380859375, -0.032958984375, -0.02099609375, 0.00482177734375, 0.0101318359375, 0.01287841796875, 0.012451171875, 0.0037994384765625, 0.0307617187...

[ 152, 80583, 56, 4, 11192, 25452, 43386, 199450, 10476, 934, 1745, 1375, 464, 12, 4213, 19659, 172, 42539, 45, 1495, 125673, 3334, 98385, 160020, 333, 25443, 15665, 1290, 37735, 1353, 32007, 15623, 155816, 30816, 163612, 3445, 1727, 53, 2030...

[ 0.07635498046875, 0.22900390625, 0.1719970703125, 0.0268402099609375, 0.116455078125, 0.07843017578125, 0.08172607421875, 0.163330078125, 0.0997314453125, 0.1466064453125, 0.1097412109375, 0.125732421875, 0.1846923828125, 0.05010986328125, 0.14453125, 0.0838623046875, 0.1319580078125...

embed

33721532_c0

33721532

prolog

0

Title: Prolog: Arguments are not sufficiently instantiated Problem title: Prolog: Arguments are not sufficiently instantiated Tags: prolog, clpfd, list Problem: Prolog: Arguments are not sufficiently instantiated I have the following problem: Generate all sub-strings of a length 2*n+1, formed from values of 0, 1 or -1,...

Prolog: Arguments are not sufficiently instantiated Prolog: Arguments are not sufficiently instantiated prolog clpfd list a Prolog Arguments N-M N-1 Prolog: Arguments are not sufficiently instantiated I have the following problem: This is what I did: All of the above code works correctly (I tested it). But with the fol...

[ -0.00121307373046875, -0.0098876953125, -0.00010013580322265625, 0.00799560546875, 0.000522613525390625, 0.0130615234375, -0.01385498046875, -0.0068359375, 0.0206298828125, -0.0111083984375, 0.01165771484375, -0.0133056640625, 0.015625, 0.0225830078125, 0.01190185546875, -0.02124023437...

[ 1250, 4867, 112140, 7, 621, 959, 129980, 538, 34648, 14, 27686, 502, 33139, 39557, 71, 5303, 541, 594, 5759, 2967, 18151, 43240, 26785, 3034, 25632, 9226, 43512, 18499, 44691 ]

[ 0.176025390625, 0.23681640625, 0.272216796875, 0.132568359375, 0.078857421875, 0.1650390625, 0.188232421875, 0.091552734375, 0.143798828125, 0.133544921875, 0.08544921875, 0.123779296875, 0.006195068359375, 0.04656982421875, 0.072021484375, 0.0970458984375, 0.031036376953125, 0.063...

embed

60780145_c0

60780145

prolog

0

Title: (Prolog) Check if a list can be split into 2 sub-lists that have equal sums Problem title: (Prolog) Check if a list can be split into 2 sub-lists that have equal sums Tags: subset-sum, subset, prolog Problem: (Prolog) Check if a list can be split into 2 sub-lists that have equal sums I am using Prolog to try and...

(Prolog) Check if a list can be split into 2 sub-lists that have equal sums (Prolog) Check if a list can be split into 2 sub-lists that have equal sums subset-sum subset prolog Prolog Check LEFT RIGHT SUM1 SUM2 (Prolog) Check if a list can be split into 2 sub-lists that have equal sums I am using Prolog to try and chec...

[ 0.00170135498046875, 0.0081787109375, 0.0263671875, 0.0016326904296875, -0.043212890625, 0.0069580078125, -0.00762939453125, 0.0185546875, 0.020751953125, 0.006744384765625, 0.01141357421875, 0.021484375, 0.0027618408203125, -0.0026397705078125, 0.01495361328125, 0.0201416015625, 0.0...

[ 10752, 4867, 38679, 2174, 5303, 831, 65450, 3934, 116, 1614, 6562, 7, 765, 105950, 10554, 3509, 11832, 502, 1250, 17428, 25217, 167177, 127944, 418, 304, 9790, 12765, 1159, 88500, 214493, 910, 35782, 116574, 18822, 1528, 105233, 184, 26513, ...

[ 0.1324462890625, 0.196044921875, 0.16455078125, 0.05743408203125, 0.1998291015625, 0.1195068359375, 0.206787109375, 0.09814453125, 0.1630859375, 0.212158203125, 0.2171630859375, 0.010650634765625, 0.03948974609375, 0.1741943359375, 0.169189453125, 0.1064453125, 0.1544189453125, 0.0...

embed

77737229_c0

77737229

prolog

0

Title: Prolog Predicates with A Variable Amount of Terms Problem title: Prolog Predicates with A Variable Amount of Terms Tags: prolog Problem: Prolog Predicates with A Variable Amount of Terms I'm trying to make a small Prolog program that can turn a term into html content. render_term(html(Head, Body), Output) :- Ope...

Prolog Predicates with A Variable Amount of Terms Prolog Predicates with A Variable Amount of Terms prolog Prolog Predicates Variable Amount Terms render_term Head Body Output OpenHtmlTag HeadOutput string_concat OutputWithHead BodyOutput ClosedHtmlTag Content ContentWithOpenTag body.html body.prolog Tag1 Tail Prolog P...

[ 0.01031494140625, 0.0252685546875, -0.004058837890625, 0.0022735595703125, -0.0208740234375, 0.000457763671875, -0.0038909912109375, 0.0084228515625, -0.006256103515625, -0.04638671875, 0.004302978515625, 0.00164031982421875, 0.004150390625, -0.022216796875, 0.006683349609375, 0.006805...

[ 1250, 4867, 7145, 2063, 1636, 678, 84572, 2886, 121147, 165504, 502, 89159, 32166, 44816, 43960, 13538, 13527, 18, 7237, 66448, 79858, 79315, 2271, 4460, 194583, 13025, 712, 153335, 70870, 103264, 14361, 7693, 3454, 4837, 1218, 379, 19336, 15...

[ 0.16796875, 0.247802734375, 0.1767578125, 0.1983642578125, 0.012481689453125, 0.074951171875, 0.17919921875, 0.0987548828125, 0.1331787109375, 0.2235107421875, 0.0875244140625, 0.1964111328125, 0.2120361328125, 0.1309814453125, 0.1207275390625, 0.09259033203125, 0.0694580078125, 0....

embed

8172687_c0

8172687

prolog

0

Title: Is there a way to translate database table rows into Prolog facts? Problem title: Is there a way to translate database table rows into Prolog facts? Tags: prolog, database, postgresql Problem: Is there a way to translate database table rows into Prolog facts? After doing some research, I was amazed with the powe...

Is there a way to translate database table rows into Prolog facts? Is there a way to translate database table rows into Prolog facts? prolog database postgresql Prolog mantenedora_ies ID_MANTENEDORA ID_IES papel_pessoa ID_PAPEL_MANTENEDORA ID_PAPEL_IES relacionamento_pessoa Is there a way to translate database table ro...

[ 0.032470703125, 0.004974365234375, 0.0137939453125, 0.00726318359375, -0.00135040283203125, 0.0081787109375, 0.0028228759765625, -0.005462646484375, -0.008544921875, -0.06884765625, 0.01275634765625, -0.0029754638671875, -0.03125, -0.00921630859375, -0.0225830078125, 0.00927734375, 0...

[ 2685, 3917, 3900, 19309, 63399, 23180, 15555, 7, 3934, 1250, 4867, 15824, 502, 1305, 17562, 99247, 31101, 13, 11606, 3387, 11338, 13940, 21170, 17610, 34468, 70418, 18164, 33144, 11, 12236, 111213, 128860, 2071, 10, 2527, 14537, 36510, 41, ...

[ 0.0228271484375, 0.11865234375, 0.1865234375, 0.190673828125, 0.1937255859375, 0.234130859375, 0.198486328125, 0.0953369140625, 0.136962890625, 0.1822509765625, 0.268310546875, 0.22607421875, 0.11376953125, 0.004364013671875, 0.191162109375, 0.0823974609375, 0.140869140625, 0.05664...

embed

37356113_c0

37356113

prolog

0

Title: Problems Understanding the Cut(!) Operator with example(Prolog Language) Problem title: Problems Understanding the Cut(!) Operator with example(Prolog Language) Tags: prolog-cut, prolog Problem: Problems Understanding the Cut(!) Operator with example(Prolog Language) I have the following rule: noRepetition([]). ...

Problems Understanding the Cut(!) Operator with example(Prolog Language) Problems Understanding the Cut(!) Operator with example(Prolog Language) prolog-cut prolog Problems Understanding Cut Operator Prolog Language Elem Rest Unfies Problems Understanding the Cut(!) Operator with example(Prolog Language) I have the fol...

[ 0.0184326171875, 0.0189208984375, 0.0306396484375, 0.0205078125, -0.0106201171875, 0.01239013671875, 0.003814697265625, 0.00101470947265625, 0.0191650390625, 0.00004553794860839844, -0.0203857421875, -0.0079345703125, -0.01019287109375, -0.00762939453125, 0.01287841796875, 0.0022430419...

[ 15649, 9626, 144057, 3003, 18, 151399, 150922, 27781, 10752, 4867, 83658, 502, 19774, 1250, 540, 195, 49756, 992, 1029, 25632, 79986, 7228, 28288, 5303, 1556, 110, 119140, 80854, 32786, 2174, 12830, 10617, 9655, 59226, 39933, 959, 9077, 14602...

[ 0.1031494140625, 0.098388671875, 0.07696533203125, 0.2020263671875, 0.126953125, 0.10028076171875, 0.26953125, 0.16455078125, 0.0718994140625, 0.1881103515625, 0.1304931640625, 0.0821533203125, 0.1995849609375, 0.058990478515625, 0.0186767578125, 0.1165771484375, 0.1856689453125, 0...

embed

62201804_c0

62201804

prolog

0

Title: Why prolog fails to find a route to a vertices (in graph)? Problem title: Why prolog fails to find a route to a vertices (in graph)? Tags: prolog Problem: Why prolog fails to find a route to a vertices (in graph)? I have a question to you: I have an exercise that says: Let there be given edges in the directed gr...

Why prolog fails to find a route to a vertices (in graph)? Why prolog fails to find a route to a vertices (in graph)? prolog Why go1 member1 Call _982 _1202 Exit _1206 Fail user:member1 Redo Why prolog fails to find a route to a vertices (in graph)? I have a question to you: I have an exercise that says: Let there be g...

[ 0.01123046875, 0.0172119140625, 0.005157470703125, 0.024658203125, -0.00274658203125, -0.009765625, -0.00799560546875, 0.011962890625, 0.0020599365234375, -0.0277099609375, 0.01116943359375, -0.01263427734375, -0.008056640625, 0.0096435546875, 0.01324462890625, 0.019287109375, 0.0142...

[ 44084, 502, 4867, 35782, 7, 7413, 36439, 47, 95378, 5170, 73, 41382, 738, 418, 32786, 26265, 16665, 304, 20840, 5443, 217, 1530, 9016, 190355, 38937, 27417, 9655, 81979, 10842, 2685, 34475, 121303, 8951, 46552, 876, 104, 1238, 420, 706, 8...

[ 0.1240234375, 0.1824951171875, 0.26123046875, 0.2049560546875, 0.02947998046875, 0.136474609375, 0.204833984375, 0.1357421875, 0.1845703125, 0.11328125, 0.03448486328125, 0.201171875, 0.150390625, 0.0928955078125, 0.1820068359375, 0.1409912109375, 0.1275634765625, 0.07720947265625,...

embed

61518394_c1

61518394

prolog

1

6, f12, f14, f21, f1, f10]). go(Case) :- case(Case, [H|T]), getf124(Case, H). % determine acceptibilty of % F124, Defendent Ownership Rights getf124(Case,F) :- member(f3, F), write(['the defendent is the owner of secret']), nl, getf123(Case, [f124|F]). getf124(Case,factorsSoFar):- write(['Accepted that the defendent is...

[ 0.00592041015625, 0.00787353515625, -0.006011962890625, 0.006011962890625, 0.01361083984375, -0.04345703125, -0.004119873046875, 0.01385498046875, 0.006927490234375, 0.0263671875, 0.01068115234375, 0.00063323974609375, -0.0023651123046875, -0.00118255615234375, -0.00099945068359375, 0....

[ 305, 4, 1238, 1530, 2592, 3117, 418, 963, 194, 738, 132, 441, 6991, 15772, 7225, 841, 58745, 618, 2046, 420, 109589, 572, 1745, 83324, 26946, 14, 2721, 939, 563, 85535, 26316, 18, 220197, 16070, 38927, 919, 32786, 363, 33022, 123823, 66...

[ 0.1685791015625, 0.04718017578125, 0.10418701171875, 0.204833984375, 0.2239990234375, 0.1302490234375, 0.0472412109375, 0.114501953125, 0.04022216796875, 0.231201171875, 0.009185791015625, 0.1326904296875, 0.18505859375, 0.07794189453125, 0.1611328125, 0.052734375, 0.014617919921875,...

embed

57736615_c0

57736615

prolog

0

Title: How can I inspect WAM code in SICStus Prolog Problem title: How can I inspect WAM code in SICStus Prolog Tags: prolog, warren-abstract-machine, sicstus-prolog Problem: How can I inspect WAM code in SICStus Prolog In the context of hacking clpz on sicstus-prolog I want to glimpse at the warren-abstract-machine co...

How can I inspect WAM code in SICStus Prolog How can I inspect WAM code in SICStus Prolog prolog warren-abstract-machine sicstus-prolog How WAM SICStus Prolog is_list is_list__clause1 dummy1 __clause1 is_list__clause2 dummy2 __clause2 GET_NIL_X0 PROCEED END_OF_CLAUSEQ user:is_list__clause1 GET_LIST_X0 U2_VOID_XVAR EXEC...

[ 0.00579833984375, 0.004058837890625, 0.00634765625, 0.0250244140625, -0.01361083984375, 0.02490234375, 0.00055694580078125, -0.006500244140625, -0.0054931640625, -0.0198974609375, 0.00799560546875, 0.00970458984375, -0.0230712890625, -0.0216064453125, 0.00830078125, 0.01348876953125, ...

[ 11249, 831, 134071, 4336, 594, 18151, 159, 102198, 2143, 1250, 4867, 502, 1631, 982, 2816, 103149, 26536, 18253, 3454, 83, 6562, 18347, 418, 8473, 1176, 304, 79794, 7787, 39015, 178102, 38937, 164, 23256, 61784, 16546, 23, 256, 169, 2676, ...

[ 0.012420654296875, 0.030303955078125, 0.25732421875, 0.141357421875, 0.192138671875, 0.214111328125, 0.08984375, 0.07684326171875, 0.1912841796875, 0.12744140625, 0.20458984375, 0.0950927734375, 0.0294952392578125, 0.1624755859375, 0.1422119140625, 0.1510009765625, 0.0732421875, 0....

embed

33554240_c0

33554240

prolog

0

Title: Converting logical puzzle into predicate calculus and prolog/dlv Problem title: Converting logical puzzle into predicate calculus and prolog/dlv Tags: answer-set-programming, logic, predicate, prolog Problem: Converting logical puzzle into predicate calculus and prolog/dlv The question is : The salt has been sto...

Converting logical puzzle into predicate calculus and prolog/dlv Converting logical puzzle into predicate calculus and prolog/dlv answer-set-programming logic predicate prolog Converting CATERPILLAR Bill Lizard CHESHIRE CAT Converting logical puzzle into predicate calculus and prolog/dlv The question is : The salt has ...

[ 0.01953125, -0.0087890625, -0.004791259765625, 0.0145263671875, -0.0079345703125, 0.0111083984375, -0.00860595703125, 0.0103759765625, -0.002960205078125, -0.0260009765625, -0.00958251953125, 0.003814697265625, -0.0169677734375, 0.01080322265625, 0.017333984375, 0.0205078125, 0.00097...

[ 1657, 814, 1916, 62775, 289, 104192, 3934, 1653, 2063, 67, 44805, 223, 502, 4867, 3723, 136, 35166, 3509, 28966, 23687, 14755, 146097, 16271, 19893, 80354, 4216, 83556, 69939, 11766, 100632, 9655, 581, 28279, 1556, 2809, 116496, 38, 14037, ...

[ 0.0218658447265625, 0.1370849609375, 0.010009765625, 0.178466796875, 0.070068359375, 0.23095703125, 0.05987548828125, 0.135009765625, 0.22705078125, 0.0989990234375, 0.2032470703125, 0.0999755859375, 0.13427734375, 0.1973876953125, 0.146728515625, 0.0176544189453125, 0.116943359375, ...

embed

17569923_c0

17569923

prolog

0

Title: Converting value of a term to an atom Problem title: Converting value of a term to an atom Tags: prolog Problem: Converting value of a term to an atom I appologise in advance if any of my terminology is off, its been a few years since I've touch Prolog and I decided to try and dust off my prolog cap and have ano...

Converting value of a term to an atom Converting value of a term to an atom prolog Converting animals_that_are Not does_animal_belong_to_group Species Group Animals Converting value of a term to an atom I appologise in advance if any of my terminology is off, its been a few years since I've touch Prolog and I decided t...

[ 0.017333984375, 0.0140380859375, 0.00921630859375, 0.01318359375, -0.0118408203125, 0.01318359375, -0.0159912109375, 0.0238037109375, -0.000858306884765625, -0.029296875, 0.01190185546875, 0.0167236328125, -0.0034637451171875, 0.01507568359375, 0.021728515625, 0.0004405975341796875, ...

[ 1657, 814, 34292, 13579, 47, 34627, 1916, 502, 4867, 85825, 1046, 11205, 14602, 161834, 372, 10617, 188, 51588, 24990, 10760, 82821, 12524, 18614, 5369, 23996, 1250, 3540, 88898, 18151, 2967, 62822, 159029, 45486, 21968, 141, 7986, 215624, 38...

[ 0.01605224609375, 0.1243896484375, 0.1854248046875, 0.211181640625, 0.086181640625, 0.23095703125, 0.00677490234375, 0.1207275390625, 0.2138671875, 0.20263671875, 0.00860595703125, 0.1807861328125, 0.09698486328125, 0.2393798828125, 0.0743408203125, 0.18798828125, 0.1270751953125, ...

embed

74026945_c0

74026945

prolog

0

Title: SWI-Prolog No permission to modify static procedure `set_prolog_flag/2' in init.pl Problem title: SWI-Prolog No permission to modify static procedure `set_prolog_flag/2' in init.pl Tags: prolog Problem: SWI-Prolog No permission to modify static procedure `set_prolog_flag/2' in init.pl I'm trying to mod...

SWI-Prolog No permission to modify static procedure `set_prolog_flag/2' in init.pl SWI-Prolog No permission to modify static procedure `set_prolog_flag/2' in init.pl prolog SWI-Prolog set_prolog_flag init.pl Documents Prolog swi-prolog.swipl ERROR init.pl:1 Welcome ABSOLUTELY WARRANTY Please answer_write_opti...

[ 0.01031494140625, 0.02099609375, 0.029541015625, -0.0026092529296875, -0.00848388671875, -0.01361083984375, -0.01190185546875, -0.0106201171875, 0.00457763671875, -0.0157470703125, -0.0032501220703125, 0.0126953125, -0.021484375, 0.0135498046875, 0.0076904296875, -0.0024261474609375, ...

[ 159, 38969, 10752, 4867, 438, 168081, 2811, 40383, 201939, 50491, 3509, 3454, 190872, 12477, 3768, 23, 217, 2424, 502, 5423, 1250, 2452, 151206, 19721, 91334, 60873, 30174, 109585, 18389, 168867, 61475, 180346, 75101, 13315, 209806, 15549, 1409...

[ 0.043609619140625, 0.2132568359375, 0.1575927734375, 0.205322265625, 0.0992431640625, 0.20703125, 0.144287109375, 0.0845947265625, 0.17919921875, 0.177490234375, 0.1103515625, 0.158447265625, 0.20849609375, 0.22216796875, 0.0933837890625, 0.1231689453125, 0.180908203125, 0.19201660...

embed

10133447_c0

10133447

prolog

0

Title: Is my heuristic algorithm correct? (Sudoku solver) Problem title: Is my heuristic algorithm correct? (Sudoku solver) Tags: prolog, sudoku, heuristics, algorithm Problem: Is my heuristic algorithm correct? (Sudoku solver) First of -yes this IS a homework- but it's primarily a theoretical question rather than a pr...

Is my heuristic algorithm correct? (Sudoku solver) Is my heuristic algorithm correct? (Sudoku solver) prolog sudoku heuristics algorithm 1 Sudoku Select Find Set Pick GoTo Solution Is my heuristic algorithm correct? (Sudoku solver) First of -yes this IS a homework- but it's primarily a theoretical question rather than ...

[ 0.0024871826171875, 0.01025390625, 0.01007080078125, 0.0067138671875, -0.0211181640625, 0.0052490234375, -0.018798828125, -0.0196533203125, -0.01483154296875, -0.018798828125, 0.0054931640625, -0.0015106201171875, -0.017578125, 0.004791259765625, -0.002410888671875, -0.0078125, -0.00...

[ 2071, 759, 764, 474, 48242, 234873, 26785, 11547, 319, 3115, 814, 502, 4867, 8932, 38067, 62210, 41637, 106, 15334, 51620, 26040, 19943, 122554, 2016, 7763, 187895, 294, 63736, 15744, 5368, 18244, 4524, 138155, 113292, 169935, 47644, 5122, 99...

[ 0.07562255859375, 0.1092529296875, 0.12158203125, 0.198486328125, 0.1883544921875, 0.27001953125, 0.208984375, 0.1309814453125, 0.166015625, 0.12158203125, 0.1558837890625, 0.08148193359375, 0.1650390625, 0.110107421875, 0.169189453125, 0.16650390625, 0.045013427734375, 0.008819580...

embed