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
26679486_c0	26679486	prolog	0	Title: trace route of the quicksort algorithm - prolog Problem title: trace route of the quicksort algorithm - prolog Tags: stack-trace, prolog, quicksort Problem: trace route of the quicksort algorithm - prolog I have that previous question about this quicksort here .The prolog code for quicksort: gt(X,Y):- X @>Y. con...	trace route of the quicksort algorithm - prolog trace route of the quicksort algorithm - prolog stack-trace prolog quicksort List Head Tail List1 List2 Sorted Small Big SortedSmall SortedBig Call _G4136 _G4269 _G4270 Exit _G4261 _G4273 Fail Redo _G4264 _G4237 trace route of the quicksort algorithm - prolog I have that ...	[ 0.0181884765625, 0.0167236328125, 0.0157470703125, -0.0033416748046875, -0.01513671875, -0.011474609375, -0.01031494140625, 0.00640869140625, 0.0002727508544921875, -0.0096435546875, -0.00823974609375, 0.0191650390625, -0.0218505859375, -0.0277099609375, 0.0220947265625, 0.008056640625...	[ 144851, 36439, 63773, 62351, 234873, 502, 4867, 177261, 39989, 32036, 44816, 1218, 379, 304, 53666, 105508, 14195, 297, 69070, 129933, 26265, 8894, 8659, 13023, 14212, 724, 617, 104283, 5443, 179122, 418, 13574, 190355, 6096, 31, 71041, 10945, ...	[ 0.2462158203125, 0.2320556640625, 0.2291259765625, 0.303955078125, 0.2073974609375, 0.182373046875, 0.2470703125, 0.112060546875, 0.17919921875, 0.1607666015625, 0.1639404296875, 0.1334228515625, 0.09869384765625, 0.058349609375, 0.1978759765625, 0.042083740234375, 0.11083984375, 0...	embed
51279571_c0	51279571	prolog	0	Title: Evaluating expressions with indexicals in SICStus Prolog Problem title: Evaluating expressions with indexicals in SICStus Prolog Tags: clpfd, prolog Problem: Evaluating expressions with indexicals in SICStus Prolog I'm trying to write a predicate in SICStus Prolog such that given an expression, I can evaluate it...	Evaluating expressions with indexicals in SICStus Prolog Evaluating expressions with indexicals in SICStus Prolog clpfd prolog Evaluating SICStus Prolog Variables Updates Values Result Term Val1 Val2 Evaluating expressions with indexicals in SICStus Prolog I'm trying to write a predicate in SICStus Prolog such that giv...	[ -0.01544189453125, 0.007293701171875, 0.0247802734375, 0.0118408203125, 0.0037689208984375, 0.0034942626953125, 0.01116943359375, 0.0030670166015625, 0.0137939453125, -0.0211181640625, -0.000782012939453125, 0.018798828125, -0.0037841796875, -0.006927490234375, 0.0400390625, -0.0118408...	[ 151228, 125195, 678, 63262, 21533, 159, 102198, 2143, 1250, 4867, 7, 71, 502, 111477, 28641, 190060, 126684, 2994, 4769, 304, 31577, 33022, 1653, 2063, 34475, 831, 151575, 7522, 20028, 25632, 43240, 84751, 1286, 121151, 18151, 64457, 62, 83, ...	[ 0.2144775390625, 0.236572265625, 0.06121826171875, 0.1864013671875, 0.198486328125, 0.0758056640625, 0.0738525390625, 0.1585693359375, 0.12646484375, 0.1873779296875, 0.0216522216796875, 0.026336669921875, 0.07354736328125, 0.06005859375, 0.0869140625, 0.07861328125, 0.06964111328125...	embed
63716046_c1	63716046	prolog	1	andma, daughter, _12442) ? creep Call: (11) lists:append([grandma], _12442, _12904) ? creep Exit: (11) lists:append([grandma], _12442, [grandma\|_12442]) ? creep Call: (11) isChild(grandma, daughter, [grandma\|_12442]) ? creep Call: (12) parent(grandma, _13040) ? creep Exit: (12) parent(grandma, mom) ? creep Call: (12) l...	andma, daughter, _12442) ? creep Call: (11) lists:append([grandma], _12442, _12904) ? creep Exit: (11) lists:append([grandma], _12442, [grandma\|_12442]) ? creep Call: (11) isChild(grandma, daughter, [grandma\|_12442]) ? creep Call: (12) parent(grandma, _13040) ? creep Exit: (12) parent(grandma, mom) ? creep Call: (12) l...	[ 0.0029144287109375, 0.0162353515625, 0.0169677734375, 0.03173828125, 0.01422119140625, 0.020751953125, 0.002532958984375, 0.0203857421875, 0.0291748046875, -0.001983642578125, -0.01708984375, -0.023193359375, -0.020751953125, 0.0267333984375, 0.0228271484375, -0.0284423828125, 0.0103...	[ 136, 192, 4, 76849, 101, 1530, 161041, 16, 705, 49512, 254, 26265, 12, 21282, 5303, 9007, 3611, 79139, 117595, 112072, 5443, 217, 83, 441, 102656, 23676, 49129, 43955, 125136, 32318, 78986, 115468, 101807, 28261, 136124, 12825, 46526, 125158,...	[ 0.1494140625, 0.2252197265625, 0.095458984375, 0.255126953125, 0.057342529296875, 0.1556396484375, 0.278564453125, 0.013702392578125, 0.112548828125, 0.218017578125, 0.19189453125, 0.22998046875, 0.0645751953125, 0.1978759765625, 0.2242431640625, 0.0872802734375, 0.1414794921875, 0...	embed
22506832_c0	22506832	prolog	0	Title: Prolog - Apply procedure to specific list members Problem title: Prolog - Apply procedure to specific list members Tags: prolog, list, nested Problem: Prolog - Apply procedure to specific list members I've got a function which takes a list, and removes all unique elements in that list: repeating(Q, L):- repeatin...	Prolog - Apply procedure to specific list members Prolog - Apply procedure to specific list members prolog list nested Prolog Apply Prolog - Apply procedure to specific list members I've got a function which takes a list, and removes all unique elements in that list: for example the query gives I want to apply this to ...	[ -0.01507568359375, 0.0091552734375, 0.0093994140625, -0.018798828125, -0.02197265625, 0.00927734375, -0.006103515625, 0.005157470703125, 0.0255126953125, -0.0306396484375, 0.000682830810546875, 0.00830078125, 0.00067138671875, -0.00494384765625, 0.002349853515625, 0.00677490234375, 0...	[ 1250, 4867, 5659, 538, 50491, 47, 29458, 5303, 43032, 502, 8512, 71, 4163, 32354, 51776, 87388, 756, 36998, 80854, 41, 1294, 3444, 59911, 903, 22759, 12830, 4989, 175199, 4734, 50960, 30646, 351, 45602, 18151, 5036, 4027, 25720, 8781, 42141...	[ 0.197998046875, 0.27734375, 0.1607666015625, 0.1143798828125, 0.2330322265625, 0.0987548828125, 0.2132568359375, 0.19384765625, 0.2103271484375, 0.15185546875, 0.168701171875, 0.003143310546875, 0.007598876953125, 0.1539306640625, 0.06640625, 0.1834716796875, 0.092529296875, 0.1818...	embed
25170868_c1	25170868	prolog	1	t15 \| 3 \| All \| r1 r3 r2 t16 \| 427 \| All \| r3 r2 t17 \| 956 \| All \| r3 t18 \| 657 \| All \| t19 \| 113 \| All \| t20 \| 251 \| All \| r3 r2 In this small example we have 20 task to be scheduled on 5 machines. t4, t7, t15 use resource r1 can therefor not be executed at the same time even if they are scheduled on different machin...	t15 \| 3 \| All \| r1 r3 r2 t16 \| 427 \| All \| r3 r2 t17 \| 956 \| All \| r3 t18 \| 657 \| All \| t19 \| 113 \| All \| t20 \| 251 \| All \| r3 r2 In this small example we have 20 task to be scheduled on 5 machines. t4, t7, t15 use resource r1 can therefor not be executed at the same time even if they are scheduled on different machin...	[ -0.00823974609375, 0.005096435546875, -0.00860595703125, 0.0033111572265625, -0.015869140625, -0.0277099609375, -0.01904296875, 0.0033111572265625, 0.0108642578125, -0.0361328125, 0.01251220703125, 0.00173187255859375, 0.008056640625, 0.018798828125, 0.0020904541015625, 0.01953125, 0...	[ 808, 1837, 58745, 138, 3164, 6, 1690, 418, 363, 304, 2485, 201, 3768, 2489, 483, 13683, 1819, 210344, 2947, 49508, 1549, 144019, 360, 903, 19336, 27781, 642, 765, 387, 66211, 47, 186, 80889, 71, 98, 190, 116491, 617, 966, 4527, 177953, ...	[ 0.1622314453125, 0.2421875, 0.090576171875, 0.150634765625, 0.15966796875, 0.0341796875, 0.1602783203125, 0.10418701171875, 0.2144775390625, 0.1636962890625, 0.2042236328125, 0.1142578125, 0.1712646484375, 0.15185546875, 0.07037353515625, 0.180908203125, 0.164306640625, 0.163696289...	embed
47348548_c0	47348548	prolog	0	Title: Prolog and Logic Puzzles Problem title: Prolog and Logic Puzzles Tags: prolog, zebra-puzzle Problem: Prolog and Logic Puzzles I seem to be having an issue with the unification of facts in Prolog, but can't confirm it. Everything looks like it should work, and I've looked up examples of solved logic puzzles using...	Prolog and Logic Puzzles Prolog and Logic Puzzles prolog zebra-puzzle Prolog Logic Puzzles Names Food Hobby Shirt Colour Other Name GirlName Prolog and Logic Puzzles I seem to be having an issue with the unification of facts in Prolog, but can't confirm it. Everything looks like it should work, and I've looked up examp...	[ 0.015869140625, 0.01043701171875, 0.00469970703125, 0.01226806640625, -0.016845703125, 0.00494384765625, -0.0311279296875, -0.0234375, 0.0223388671875, -0.00872802734375, 0.00079345703125, 0.017333984375, 0.0087890625, -0.0115966796875, 0.005889892578125, 0.002777099609375, -0.002471...	[ 1250, 4867, 136, 50592, 238, 179277, 7, 502, 116232, 1766, 13894, 15757, 34562, 126527, 103842, 196431, 64511, 45327, 163612, 48903, 19441, 31089, 51, 41274, 15824, 23, 831, 18, 39563, 171581, 33342, 1884, 5608, 4488, 27781, 86869, 62775, 104...	[ 0.2144775390625, 0.290771484375, 0.0904541015625, 0.1651611328125, 0.06097412109375, 0.2078857421875, 0.0079345703125, 0.1485595703125, 0.1929931640625, 0.1265869140625, 0.12744140625, 0.0986328125, 0.149658203125, 0.1424560546875, 0.123291015625, 0.129150390625, 0.020782470703125, ...	embed
53335339_c0	53335339	prolog	0	Title: Replacing prolog base case with recursive call Problem title: Replacing prolog base case with recursive call Tags: recursion, prolog Problem: Replacing prolog base case with recursive call I am new to Prolog, started learning it recently using the awesome book Learn Prolog Now! . There is something I don't fully...	Replacing prolog base case with recursive call Replacing prolog base case with recursive call recursion prolog Replacing Replacing prolog base case with recursive call I am new to Prolog, started learning it recently using the awesome book Learn Prolog Now! . There is something I don't fully understand and it's really ...	[ 0.007659912109375, -0.002655029296875, 0.00445556640625, 0.004791259765625, 0.0034942626953125, -0.000942230224609375, -0.00408935546875, 0.004852294921875, 0.020263671875, -0.03271484375, 0.0157470703125, -0.00830078125, -0.0264892578125, 0.0098876953125, 0.01409912109375, -0.00271606...	[ 853, 133266, 502, 4867, 3647, 7225, 678, 195625, 5844, 11782, 1830, 1250, 12877, 14240, 28219, 81979, 765, 25632, 51359, 1653, 2063, 67, 2806, 53383, 2174, 15549, 47, 22304, 54241, 98, 98320, 50218, 15400, 36917, 41, 34475, 29041, 1511, 146...	[ 0.03857421875, 0.1270751953125, 0.138671875, 0.21044921875, 0.177978515625, 0.1934814453125, 0.0161895751953125, 0.2242431640625, 0.1131591796875, 0.166015625, 0.11376953125, 0.109130859375, 0.0188446044921875, 0.012939453125, 0.0731201171875, 0.03131103515625, 0.01483154296875, 0....	embed
19611117_c0	19611117	prolog	0	Title: Prolog code generates error Problem title: Prolog code generates error Tags: prolog Problem: Prolog code generates error I want to understand why the next piece of code is not working. modul(A,B,R):-A<B,R is B-A. modul(A,B,R):-R is A-B. This here extracts the Xth element from the list extractFromList([H\|_],X,R):...	Prolog code generates error Prolog code generates error prolog Prolog B-A A-B X-1 manhatan2 _L165 ERROR Arguments Exception _G1122 _G1123 Prolog code generates error I want to understand why the next piece of code is not working. This here extracts the Xth element from the list This here computes the Manhattan distance...	[ 0.0123291015625, 0.0103759765625, -0.005126953125, 0.004913330078125, 0.0123291015625, 0.0201416015625, -0.00811767578125, 0.0034027099609375, 0.00762939453125, -0.0189208984375, 0.01312255859375, -0.024658203125, 0.01153564453125, -0.01019287109375, -0.00103759765625, -0.0062255859375...	[ 1250, 4867, 18151, 139392, 7, 18499, 502, 335, 284, 62, 571, 1193, 5759, 332, 150878, 304, 866, 118913, 151206, 112140, 63928, 724, 1662, 4015, 3742, 28219, 15400, 11737, 63847, 959, 20697, 3688, 125663, 927, 12830, 5303, 7077, 147037, 6248...	[ 0.1842041015625, 0.259521484375, 0.203369140625, 0.2176513671875, 0.05615234375, 0.2283935546875, 0.148193359375, 0.0792236328125, 0.069091796875, 0.0303192138671875, 0.0914306640625, 0.118408203125, 0.09765625, 0.07525634765625, 0.232421875, 0.106689453125, 0.0389404296875, 0.2507...	embed
58741123_c0	58741123	prolog	0	Title: Is there way I could fix this error ? Undefined symbols for architecture x86_64: (gnu-prolog) Problem title: Is there way I could fix this error ? Undefined symbols for architecture x86_64: (gnu-prolog) Tags: gnu-prolog, prolog Problem: Is there way I could fix this error ? Undefined symbols for architecture x86...	Is there way I could fix this error ? Undefined symbols for architecture x86_64: (gnu-prolog) Is there way I could fix this error ? Undefined symbols for architecture x86_64: (gnu-prolog) gnu-prolog prolog Undefined x86_64 existence_error gplcML9Z1g.o _Lpred2_1 _Lpred2_2 _Lpred2_3 _Lpred2_4 Is there way I could fix thi...	[ 0.00115203857421875, 0.005126953125, 0.00323486328125, 0.00384521484375, -0.0194091796875, 0.00616455078125, 0.022216796875, 0.0024566650390625, -0.011962890625, -0.04833984375, -0.000640869140625, -0.01165771484375, 0.0022735595703125, -0.00531005859375, 0.0155029296875, 0.00294494628...	[ 3917, 5809, 30022, 903, 18499, 79912, 5983, 297, 26582, 7, 159958, 1022, 15276, 13307, 104155, 3454, 4867, 2685, 100, 502, 116311, 188800, 706, 2424, 39456, 866, 19714, 304, 115187, 363, 617, 1528, 127877, 5885, 2452, 9790, 11675, 959, 6577...	[ 0.0123291015625, 0.04522705078125, 0.1341552734375, 0.0149383544921875, 0.166748046875, 0.1392822265625, 0.2080078125, 0.030029296875, 0.239990234375, 0.051055908203125, 0.165771484375, 0.029083251953125, 0.2425537109375, 0.226806640625, 0.1953125, 0.1572265625, 0.187744140625, 0.0...	embed
66941974_c0	66941974	prolog	0	Title: prolog: issue with undirected graph: path to one direction works, but infinite loop for the other direction Problem title: prolog: issue with undirected graph: path to one direction works, but infinite loop for the other direction Tags: prolog Problem: prolog: issue with undirected graph: path to one direction w...	prolog: issue with undirected graph: path to one direction works, but infinite loop for the other direction prolog: issue with undirected graph: path to one direction works, but infinite loop for the other direction prolog prolog: issue with undirected graph: path to one direction works, but infinite loop for the other...	[ 0.007476806640625, 0.00634765625, 0.0125732421875, -0.001678466796875, -0.0150146484375, -0.0048828125, -0.0120849609375, 0.01409912109375, 0.00872802734375, -0.07470703125, 0.0166015625, 0.003143310546875, -0.013427734375, 0.0177001953125, 0.026123046875, 0.00994873046875, 0.0228271...	[ 502, 4867, 31089, 51, 80581, 297, 41382, 60875, 47, 1632, 48225, 43240, 1284, 54241, 13, 40956, 3789, 678, 100, 18151, 1884, 15190, 1286, 124519, 26458, 1528, 1295, 110, 112, 1193, 990, 20697, 195625, 1830, 808, 148, 29568, 4127, 3229, 34...	[ 0.1546630859375, 0.2100830078125, 0.1236572265625, 0.06146240234375, 0.17431640625, 0.0467529296875, 0.1773681640625, 0.224365234375, 0.1351318359375, 0.0936279296875, 0.189453125, 0.120361328125, 0.0723876953125, 0.151611328125, 0.08441162109375, 0.1932373046875, 0.07745361328125, ...	embed
29088308_c0	29088308	prolog	0	Title: Enumerating domains in Prolog's clpfd Problem title: Enumerating domains in Prolog's clpfd Tags: clpfd, prolog Problem: Enumerating domains in Prolog's clpfd I'm exploring dependent structures of constraints like this one: assign(X,Y) :- X in 1..5, ((X mod 2 #= 1) #=> Y in 2..3), ((X mod 2 #= 0) #=> Y ...	Enumerating domains in Prolog's clpfd Enumerating domains in Prolog's clpfd clpfd prolog Enumerating Prolog X-D fd_dom Enumerating domains in Prolog's clpfd I'm exploring dependent structures of constraints like this one: What I'm looking for is a representation of X 's and Y 's domains that is as sparse as p...	[ 0.013671875, -0.01318359375, 0.0089111328125, 0.01324462890625, 0.005889892578125, 0.0152587890625, 0.00189208984375, 0.0023651123046875, 0.0024261474609375, -0.045654296875, -0.0078125, -0.0196533203125, 0.0038909912109375, 0.004730224609375, 0.01336669921875, -0.016845703125, 0.015...	[ 357, 15537, 98767, 77758, 7, 1250, 4867, 3768, 33139, 39557, 71, 23, 502, 1193, 397, 1238, 3815, 24649, 108750, 45646, 158, 2816, 4288, 16487, 100, 18811, 136, 990, 237, 27148, 7722, 124519, 92714, 155761, 617, 190, 3917, 96391, 756, 7733...	[ 0.023406982421875, 0.222412109375, 0.065185546875, 0.23486328125, 0.057586669921875, 0.1485595703125, 0.251953125, 0.023406982421875, 0.06005859375, 0.1357421875, 0.1524658203125, 0.00738525390625, 0.0823974609375, 0.114013671875, 0.14208984375, 0.006988525390625, 0.177490234375, 0...	embed
48982779_c0	48982779	prolog	0	Title: Prolog print in the specific format Problem title: Prolog print in the specific format Tags: prolog Problem: Prolog print in the specific format Say I have two lists [A, B, C] and [D, E, F] on my hand now. The values in list1 and list2 are in the same range, but I don't exactly know how they match with each othe...	Prolog print in the specific format Prolog print in the specific format prolog 1 Prolog ONE TWO THREE Prolog print in the specific format Say I have two lists [A, B, C] and [D, E, F] on my hand now. The values in list1 and list2 are in the same range, but I don't exactly know how they match with each other. There is on...	[ 0.0106201171875, -0.015869140625, 0.0002422332763671875, 0.0189208984375, -0.00787353515625, -0.0019989013671875, -0.0189208984375, 0.003814697265625, 0.013427734375, 0.01513671875, -0.00762939453125, -0.0235595703125, 0.000576019287109375, -0.006134033203125, 0.0106201171875, -0.01782...	[ 1250, 4867, 28412, 23, 29458, 9384, 502, 106, 31261, 43789, 148776, 6626, 5303, 284, 335, 313, 397, 241, 563, 3535, 5036, 142424, 304, 5701, 37457, 3714, 14858, 3789, 207116, 62, 391, 2203, 116, 138, 35431, 3642, 831, 16750, 25632, 2967, ...	[ 0.198486328125, 0.288330078125, 0.22509765625, 0.045806884765625, 0.244140625, 0.2374267578125, 0.162353515625, 0.043853759765625, 0.08184814453125, 0.05206298828125, 0.115234375, 0.07012939453125, 0.2012939453125, 0.02386474609375, 0.03961181640625, 0.02459716796875, 0.0610046386718...	embed
37367646_c0	37367646	prolog	0	Title: Lambda calculus with Prolog Problem title: Lambda calculus with Prolog Tags: prolog, parsing, nlp, lambda, logic Problem: Lambda calculus with Prolog I'm doing past exam questions for my Symbolic AI course. One of the questions is this: Show the interpretation that the grammar and lexicon would assign to Every m...	Lambda calculus with Prolog Lambda calculus with Prolog prolog parsing nlp lambda logic Lambda Prolog Every VP:NP DET:N DET AUX:VP AUX P:X Q:X A:B Lambda calculus with Prolog I'm doing past exam questions for my Symbolic AI course. One of the questions is this: Show the interpretation that the grammar and lexicon would...	[ 0.027587890625, 0.0084228515625, -0.017333984375, 0.005157470703125, -0.01031494140625, 0.0220947265625, 0.019287109375, 0.01287841796875, 0.0162353515625, -0.055908203125, 0.00689697265625, -0.01300048828125, -0.006256103515625, -0.020751953125, 0.005340576171875, 0.01263427734375, ...	[ 122930, 85, 44805, 223, 678, 1250, 4867, 502, 366, 26775, 21, 6492, 62775, 87769, 41195, 28814, 105437, 839, 71609, 1542, 2396, 62, 571, 11015, 42276, 131899, 38730, 15411, 17582, 17367, 206019, 122092, 136, 95, 73140, 19, 2806, 95486, 332,...	[ 0.1898193359375, 0.1385498046875, 0.158447265625, 0.08245849609375, 0.0728759765625, 0.1431884765625, 0.2392578125, 0.113525390625, 0.11279296875, 0.1412353515625, 0.00732421875, 0.162353515625, 0.1298828125, 0.2010498046875, 0.1885986328125, 0.10333251953125, 0.185791015625, 0.007...	embed
9855986_c0	9855986	prolog	0	Title: Solving a logic puzzle (Kuromasu, Where is black cells) in Prolog Problem title: Solving a logic puzzle (Kuromasu, Where is black cells) in Prolog Tags: clpfd, logic, prolog, puzzle Problem: Solving a logic puzzle (Kuromasu, Where is black cells) in Prolog I have some problems with solving puzzle. I haven't foun...	Solving a logic puzzle (Kuromasu, Where is black cells) in Prolog Solving a logic puzzle (Kuromasu, Where is black cells) in Prolog clpfd logic prolog puzzle Solving Kuromasu Where Prolog Solving a logic puzzle (Kuromasu, Where is black cells) in Prolog I have some problems with solving puzzle. I haven't found solution...	[ -0.0091552734375, 0.00555419921875, 0.0103759765625, 0.0111083984375, -0.0166015625, -0.00164031982421875, -0.006103515625, -0.005126953125, -0.0152587890625, -0.0079345703125, 0.0012054443359375, -0.01055908203125, 0.0096435546875, 0.00555419921875, 0.01904296875, 0.006378173828125, ...	[ 6678, 6496, 62775, 104192, 44858, 8945, 1159, 78662, 83, 22556, 38750, 7, 1250, 4867, 39557, 71, 502, 5375, 23, 44402, 3115, 14037, 29806, 100, 903, 33022, 5351, 4271, 139392, 11907, 154109, 7722, 26785, 2967, 3126, 756, 91736, 12921, 9655,...	[ 0.1173095703125, 0.035614013671875, 0.1939697265625, 0.212158203125, 0.0989990234375, 0.204833984375, 0.19189453125, 0.1224365234375, 0.0888671875, 0.1710205078125, 0.204833984375, 0.0279693603515625, 0.1483154296875, 0.2247314453125, 0.00677490234375, 0.04669189453125, 0.08776855468...	embed
61277051_c0	61277051	prolog	0	Title: inserting an integer into a sorted list Problem title: inserting an integer into a sorted list Tags: list, prolog Problem: inserting an integer into a sorted list So my problem is this i have a predicate called insere_ordenado(El,Lst1,Lst2) in which El is a random integer, Lst1 is a list and Lst2 is the resultin...	inserting an integer into a sorted list inserting an integer into a sorted list list prolog insere_ordenado_ite NAC NNAC inserting an integer into a sorted list So my problem is this i have a predicate called insere_ordenado(El,Lst1,Lst2) in which El is a random integer, Lst1 is a list and Lst2 is the resulting list of...	[ -0.0257568359375, -0.01953125, -0.00054168701171875, -0.0052490234375, 0.004486083984375, 0.051025390625, -0.020263671875, -0.0172119140625, 0.003021240234375, -0.0262451171875, 0.0257568359375, -0.00141143798828125, -0.015380859375, -0.002105712890625, 0.01446533203125, 0.001617431640...	[ 183540, 892, 1505, 3934, 17497, 71, 5303, 502, 4867, 28046, 13, 38228, 1138, 1486, 184777, 541, 2967, 1653, 2063, 67, 7623, 271, 418, 10461, 540, 96759, 339, 304, 16750, 154107, 47, 13580, 195625, 5844, 765, 720, 45023, 3444, 15190, 14012...	[ 0.2225341796875, 0.1341552734375, 0.1212158203125, 0.10015869140625, 0.1790771484375, 0.12646484375, 0.1875, 0.12451171875, 0.16650390625, 0.211669921875, 0.1558837890625, 0.185546875, 0.1727294921875, 0.131591796875, 0.2183837890625, 0.05316162109375, 0.1170654296875, 0.1177978515...	embed
27450199_c0	27450199	prolog	0	Title: Create combinations of numbers within list prolog Problem title: Create combinations of numbers within list prolog Tags: prolog, constraints, clpfd, algorithm Problem: Create combinations of numbers within list prolog I am developing a program in PROLOG ( with restrictions ) which is supposed to output a combina...	Create combinations of numbers within list prolog Create combinations of numbers within list prolog prolog constraints clpfd algorithm Create Possible Wrong Missing Numbers Etc all_different Create combinations of numbers within list prolog I am developing a program in PROLOG ( with restrictions ) which is supposed to ...	[ -0.02734375, -0.0023956298828125, 0.019775390625, 0.001953125, 0.01397705078125, 0.00860595703125, -0.019287109375, 0.0093994140625, 0.021240234375, -0.031494140625, -0.0157470703125, -0.0220947265625, 0.01953125, 0.007598876953125, 0.0162353515625, 0.0164794921875, -0.00123596191406...	[ 151313, 162515, 7, 101935, 28032, 5303, 502, 4867, 158, 2816, 4288, 33139, 39557, 71, 234873, 115861, 2661, 35133, 16771, 214, 103332, 756, 238778, 111, 168698, 1528, 23, 10514, 47510, 678, 185190, 134598, 140992, 305, 24233, 8110, 1295, 106,...	[ 0.1336669921875, 0.2498779296875, 0.086669921875, 0.1612548828125, 0.1815185546875, 0.202392578125, 0.1566162109375, 0.231689453125, 0.0272979736328125, 0.1512451171875, 0.103515625, 0.0206451416015625, 0.0655517578125, 0.11328125, 0.16552734375, 0.06787109375, 0.012451171875, 0.09...	embed
10588865_c0	10588865	prolog	0	Title: Allegrograph Geospatial Prolog Queries Problem title: Allegrograph Geospatial Prolog Queries Tags: allegrograph, geospatial, semantic-web, prolog Problem: Allegrograph Geospatial Prolog Queries I have some triples that represent the locations of several cities. I want to be able to fire off a Prolog query like (...	Allegrograph Geospatial Prolog Queries Allegrograph Geospatial Prolog Queries allegrograph geospatial semantic-web prolog Allegrograph Geospatial Prolog Queries exns:geolocation Server Allegrograph Geospatial Prolog Queries I have some triples that represent the locations of several cities. I want to be able to fire of...	[ 0.016845703125, 0.018798828125, 0.00592041015625, -0.0019683837890625, -0.0133056640625, -0.005126953125, 0.00823974609375, -0.003326416015625, -0.0194091796875, -0.040771484375, 0.0172119140625, 0.00775146484375, -0.0172119140625, -0.0361328125, -0.00274658203125, 0.01007080078125, ...	[ 4344, 8407, 41382, 30152, 10974, 1250, 4867, 5813, 747, 20787, 484, 14051, 502, 1119, 1779, 429, 31, 87632, 22687, 3060, 162738, 7, 33636, 31913, 40368, 162708, 3444, 11476, 5773, 41, 1294, 1884, 18499, 176377, 4082, 81887, 11782, 4904, 568...	[ 0.128662109375, 0.1678466796875, 0.1875, 0.114990234375, 0.090087890625, 0.1749267578125, 0.2479248046875, 0.1212158203125, 0.09271240234375, 0.1597900390625, 0.0506591796875, 0.060791015625, 0.1114501953125, 0.060760498046875, 0.1219482421875, 0.0775146484375, 0.1114501953125, 0.1...	embed
43600928_c0	43600928	prolog	0	Title: Translating a tabled predicate from b-prolog to gprolog Problem title: Translating a tabled predicate from b-prolog to gprolog Tags: prolog, knights-tour, predicate, declarative Problem: Translating a tabled predicate from b-prolog to gprolog For fun I've been attempting to write a Knight's Tour ( https://en.wik...	Translating a tabled predicate from b-prolog to gprolog Translating a tabled predicate from b-prolog to gprolog prolog knights-tour predicate declarative b-prolog Translating Visits NewX NewY Score possible_knight_moves possible_moves_count Translating a tabled predicate from b-prolog to gprolog For fun I've been attem...	[ 0.0003337860107421875, -0.00982666015625, 0.01446533203125, 0.0036163330078125, -0.015869140625, 0.0235595703125, -0.0152587890625, -0.01495361328125, 0.002044677734375, -0.048583984375, 0.007781982421875, 0.0235595703125, -0.03271484375, -0.000797271728515625, -0.01055908203125, 0.029...	[ 11062, 143, 23180, 71, 1653, 2063, 67, 1295, 876, 3454, 4867, 47, 706, 502, 472, 54350, 7, 28889, 21635, 98684, 2356, 1542, 1723, 168071, 7722, 92, 432, 3132, 71013, 7477, 81887, 33022, 114996, 25, 11330, 7168, 13691, 3768, 3115, 814, 5...	[ 0.1337890625, 0.18994140625, 0.2366943359375, 0.113037109375, 0.1787109375, 0.2265625, 0.0570068359375, 0.051788330078125, 0.1444091796875, 0.1771240234375, 0.19873046875, 0.05291748046875, 0.08001708984375, 0.14501953125, 0.030029296875, 0.183837890625, 0.023529052734375, 0.217895...	embed
66840573_c0	66840573	prolog	0	Title: Program in SWI-Prolog Problem title: Program in SWI-Prolog Tags: prolog Problem: Program in SWI-Prolog Task:Write to the new file all the lines of the source file that contain the specified string as a fragment, which is entered from the keyboard. I can't figure out how to compare the lines from the file line by...	Program in SWI-Prolog Program in SWI-Prolog prolog Program SWI-Prolog Enter SOURFILE check_exist read_line_to_string NEWFILE write_to_file Filename exists_file There TEXT File Data Program in SWI-Prolog Task:Write to the new file all the lines of the source file that contain the specified string as a fragment, which is...	[ 0.004608154296875, -0.00897216796875, -0.003265380859375, 0.01129150390625, -0.03369140625, 0.01263427734375, 0.00518798828125, 0.0281982421875, -0.005859375, -0.00836181640625, 0.004241943359375, 0.02783203125, -0.0306396484375, -0.017578125, 0.0078125, 0.0025177001953125, 0.0234375...	[ 7663, 23, 159, 38969, 10752, 4867, 502, 60816, 76234, 919, 52099, 12765, 54376, 12301, 2256, 188, 91693, 80111, 33022, 29822, 42724, 32316, 7, 13018, 70981, 11809, 9598, 1456, 18781, 47, 3525, 11435, 756, 70, 124519, 31344, 70541, 58735, 79...	[ 0.2027587890625, 0.048370361328125, 0.07952880859375, 0.235107421875, 0.17529296875, 0.215087890625, 0.127685546875, 0.104736328125, 0.09869384765625, 0.094970703125, 0.031707763671875, 0.125244140625, 0.1988525390625, 0.1246337890625, 0.1434326171875, 0.14501953125, 0.16943359375, ...	embed
28773539_c1	28773539	prolog	1	:- same_colour(shape_a, shape_b). :- end_tests(same_colour). I've also tried: test(same_colour, [ setup(asserta(colour(shape_a, colour_1))), setup(asserta(colour(shape_b, colour_1))), cleanup(retract(colour(shape_a, colour_1))), cleanup(retract(colour(shape_b, colour_1))) ]) :- same_colour(shape_a, shape_b). that is, ...	:- same_colour(shape_a, shape_b). :- end_tests(same_colour). I've also tried: test(same_colour, [ setup(asserta(colour(shape_a, colour_1))), setup(asserta(colour(shape_b, colour_1))), cleanup(retract(colour(shape_a, colour_1))), cleanup(retract(colour(shape_b, colour_1))) ]) :- same_colour(shape_a, shape_b). that is, ...	[ 0.001983642578125, 0.00616455078125, -0.00677490234375, 0.00933837890625, -0.009765625, -0.00958251953125, 0.004913330078125, -0.014892578125, 0.0025177001953125, 0.0128173828125, -0.01116943359375, 0.0537109375, -0.0206298828125, 0.005462646484375, 0.0220947265625, 0.00665283203125, ...	[ 15772, 5701, 22796, 474, 2420, 1081, 11, 4, 115700, 275, 3564, 6954, 7, 40175, 272, 2843, 37842, 3034, 169581, 162, 110965, 134855, 115187, 46622, 39989, 5117, 159978, 136, 15824, 59437, 18347, 35782, 144851, 8306, 16865, 959, 29568, 12960, ...	[ 0.027313232421875, 0.159423828125, 0.147216796875, 0.10150146484375, 0.121337890625, 0.06591796875, 0.10321044921875, 0.010009765625, 0.184326171875, 0.14794921875, 0.119384765625, 0.1905517578125, 0.013458251953125, 0.146240234375, 0.00067138671875, 0.008026123046875, 0.09130859375,...	embed
29257745_c0	29257745	prolog	0	Title: How do I write a predicate that returns a specific list? Problem title: How do I write a predicate that returns a specific list? Tags: prolog Problem: How do I write a predicate that returns a specific list? I am attempting to write a predicate that will identify the following changeover destinations. The places...	How do I write a predicate that returns a specific list? How do I write a predicate that returns a specific list? prolog How new_york san_francisco abu_dhabi buenos_aires hong_kong How do I write a predicate that returns a specific list? I am attempting to write a predicate that will identify the following changeover d...	[ -0.0084228515625, -0.00799560546875, -0.0035247802734375, 0.0086669921875, 0.01397705078125, 0.0213623046875, -0.00872802734375, -0.0205078125, 0.00897216796875, 0.01806640625, -0.02490234375, 0.0022430419921875, -0.010498046875, 0.001220703125, 0.01275634765625, -0.00762939453125, 0...	[ 11249, 54, 87, 33022, 10, 1653, 2063, 67, 450, 30646, 29458, 5303, 7, 502, 4867, 3525, 13437, 92, 3725, 95022, 164, 587, 45405, 71, 54815, 126819, 19027, 30434, 45310, 81887, 135812, 25632, 15549, 5465, 78869, 44677, 99, 3129, 7722, 47, ...	[ 0.109619140625, 0.049468994140625, 0.04705810546875, 0.2225341796875, 0.07049560546875, 0.2166748046875, 0.256103515625, 0.181884765625, 0.06231689453125, 0.217041015625, 0.210693359375, 0.228759765625, 0.06988525390625, 0.1397705078125, 0.2076416015625, 0.05743408203125, 0.130981445...	embed
50749333_c0	50749333	prolog	0	Title: Prolog check if list contains even number of an element Problem title: Prolog check if list contains even number of an element Tags: tail, recursion, prolog, list, head Problem: Prolog check if list contains even number of an element I have to check if a list contains an even number of an element without built-i...	Prolog check if list contains even number of an element Prolog check if list contains even number of an element tail recursion prolog list head Prolog Tail Head Prolog check if list contains even number of an element I have to check if a list contains an even number of an element without built-ins. Example: returns fal...	[ -0.0074462890625, 0.0017547607421875, 0.004974365234375, -0.00762939453125, -0.013671875, 0.004669189453125, -0.012451171875, -0.00933837890625, -0.00640869140625, -0.02490234375, 0.0003566741943359375, -0.00897216796875, 0.000858306884765625, 0.01397705078125, 0.01422119140625, -0.001...	[ 1250, 4867, 12765, 2174, 5303, 70541, 3853, 14012, 12830, 46741, 195625, 502, 10336, 1218, 379, 44816, 15490, 88303, 5425, 30646, 98320, 29568, 114063, 11341, 9790, 101089, 17721, 117249, 54799, 74918, 4488, 8306, 3934, 959, 55923 ]	[ 0.1583251953125, 0.2396240234375, 0.1834716796875, 0.07867431640625, 0.1888427734375, 0.143310546875, 0.1885986328125, 0.1297607421875, 0.196044921875, 0.1796875, 0.12841796875, 0.1173095703125, 0.1534423828125, 0.08447265625, 0.040252685546875, 0.14013671875, 0.0811767578125, 0.06...	embed
23378414_c0	23378414	prolog	0	Title: Save argument into a fact from user input Problem title: Save argument into a fact from user input Tags: prolog Problem: Save argument into a fact from user input Some days ago I asked a question about basis input/output in Prolog, but now I have another question. I'm doing a Prolog project in my college related...	Save argument into a fact from user input Save argument into a fact from user input prolog user Save Save argument into a fact from user input Some days ago I asked a question about basis input/output in Prolog, but now I have another question. I'm doing a Prolog project in my college related with an ITS diagnostic. Le...	[ 0.0146484375, 0.0072021484375, 0.01226806640625, 0.01519775390625, -0.002777099609375, 0.019775390625, -0.00726318359375, 0.00384521484375, -0.00872802734375, -0.033935546875, 0.01239013671875, 0.00009107589721679688, -0.015869140625, 0.01708984375, -0.00445556640625, -0.01397705078125...	[ 64944, 10750, 3934, 10, 15824, 1295, 38937, 107730, 502, 4867, 18231, 6056, 7077, 1250, 9655, 13452, 40466, 119119, 52070, 62822, 91736, 134234, 3917, 30098, 12638, 17368, 17582, 64457, 5423, 35978, 73342, 1884, 159978, 201505, 199, 1830, 454, ...	[ 0.2242431640625, 0.29345703125, 0.1514892578125, 0.013427734375, 0.233642578125, 0.131103515625, 0.1727294921875, 0.2000732421875, 0.1287841796875, 0.23095703125, 0.193603515625, 0.07574462890625, 0.00555419921875, 0.138916015625, 0.032867431640625, 0.0516357421875, 0.0517578125, 0...	embed
32529229_c1	32529229	prolog	1	0 , Qtot is Qa + Qb , Qtot =< 3. applicable(emptyBinA,state(Qa,Qb)) :- Qb > 0, Qtot is Qa + Qb , Qtot =< 4. applicable(fillAwithB,state(Qa,Qb)) :- Qa < 4, Qtrasf is 4 - Qa , Qtrasf =< Qb. applicable(fillBwithA,state(Qa,Qb)) :- Qb < 3, Qtrasf is 3 - Qb , Qtrasf=<Qa. apply(emptyA,state(Qa,Qb),state(0,Qb)). apply(emptyB,s...	0 , Qtot is Qa + Qb , Qtot =< 3. applicable(emptyBinA,state(Qa,Qb)) :- Qb > 0, Qtot is Qa + Qb , Qtot =< 4. applicable(fillAwithB,state(Qa,Qb)) :- Qa < 4, Qtrasf is 4 - Qa , Qtrasf =< Qb. applicable(fillBwithA,state(Qa,Qb)) :- Qb < 3, Qtrasf is 3 - Qb , Qtrasf=<Qa. apply(emptyA,state(Qa,Qb),state(0,Qb)). apply(emptyB,s...	[ 0.0146484375, 0.00506591796875, 0.0118408203125, 0.014404296875, 0.005035400390625, 0.002288818359375, -0.020263671875, -0.000820159912109375, 0.019287109375, -0.007659912109375, 0.02099609375, -0.009765625, 0.006866455078125, 0.009033203125, 0.005615234375, -0.025390625, 0.020874023...	[ 757, 2396, 21737, 83, 16785, 997, 275, 2203, 16093, 1031, 152431, 33548, 939, 571, 73, 284, 61340, 51724, 2737, 15772, 977, 1398, 116115, 76228, 4426, 201, 29987, 420, 138, 59911, 1328, 105801, 46568, 2356, 21320, 9, 86827, 959, 34735, 36...	[ 0.1646728515625, 0.1551513671875, 0.26708984375, 0.1309814453125, 0.206298828125, 0.1644287109375, 0.14208984375, 0.0357666015625, 0.1375732421875, 0.083740234375, 0.1739501953125, 0.1339111328125, 0.10687255859375, 0.10888671875, 0.127197265625, 0.14892578125, 0.1558837890625, 0.2...	embed
59011516_c1	59011516	prolog	1	(X,_), \+ common_noun(X,_), \+ preposition(X,_,_), \+ copula_verb(X), \+ transitive_verb(X,_,_), \+ intransitive_verb(X,_). common_noun(cat,X) :- cat(X). common_noun(box,X) :- box(X). common_noun(basket,X) :- basket(X). common_noun(poptart,X) :- poptart(X). intransitive_verb(purrs,X) :- purrs(X). intransitive_verb(slee...	(X,_), \+ common_noun(X,_), \+ preposition(X,_,_), \+ copula_verb(X), \+ transitive_verb(X,_,_), \+ intransitive_verb(X,_). common_noun(cat,X) :- cat(X). common_noun(box,X) :- box(X). common_noun(basket,X) :- basket(X). common_noun(poptart,X) :- poptart(X). intransitive_verb(purrs,X) :- purrs(X). intransitive_verb(slee...	[ -0.004241943359375, 0.00067901611328125, -0.0201416015625, 0.03271484375, 0.000583648681640625, 0.0162353515625, 0.01129150390625, -0.00958251953125, 0.018798828125, -0.051025390625, 0.01531982421875, 0.000682830810546875, -0.00213623046875, -0.0038604736328125, 0.0169677734375, 0.0054...	[ 1542, 454, 1328, 39210, 157, 309, 479, 40322, 552, 42943, 81465, 62621, 5844, 23, 30145, 4935, 4460, 15772, 7515, 11728, 16530, 5918, 3473, 149241, 33554, 867, 7426, 4717, 7398, 4295, 170572, 60268, 28661, 1723, 1608, 164, 83, 170, 100034, ...	[ 0.163818359375, 0.111572265625, 0.1158447265625, 0.1580810546875, 0.0582275390625, 0.137939453125, 0.038665771484375, 0.1390380859375, 0.1241455078125, 0.2587890625, 0.1983642578125, 0.1175537109375, 0.0902099609375, 0.03924560546875, 0.04718017578125, 0.06591796875, 0.1795654296875,...	embed
10609324_c0	10609324	prolog	0	Title: Prolog: a(b,c) and a(X,Y):-a(Y,X), query a(c,b) returns infinite true? Problem title: Prolog: a(b,c) and a(X,Y):-a(Y,X), query a(c,b) returns infinite true? Tags: prolog Problem: Prolog: a(b,c) and a(X,Y):-a(Y,X), query a(c,b) returns infinite true? Here is my knowledge base: a(b,c). a(X,Y):-a(Y,X). Here is my q...	Prolog: a(b,c) and a(X,Y):-a(Y,X), query a(c,b) returns infinite true? Prolog: a(b,c) and a(X,Y):-a(Y,X), query a(c,b) returns infinite true? prolog Prolog Prolog: a(b,c) and a(X,Y):-a(Y,X), query a(c,b) returns infinite true? Here is my knowledge base: Here is my query: a(c,b). I am using SWI-Prolog. I thought that th...	[ 0.025390625, 0.0228271484375, 0.01165771484375, 0.0164794921875, -0.0174560546875, 0.00341796875, 0.005889892578125, -0.00640869140625, 0.00567626953125, -0.0301513671875, 0.0189208984375, 0.003875732421875, -0.0279541015625, -0.0032196044921875, 0.029052734375, 0.009765625, 0.022949...	[ 1250, 4867, 10, 275, 238, 136, 1542, 1723, 9, 41, 1294, 30646, 54241, 29568, 4, 13, 502, 7, 51359, 3647, 11853, 17368, 159, 38969, 10752, 17569, 1528, 2448, 1916, 9774, 33306, 64457, 28412, 136622, 2174, 5962, 40, 46029, 4759, 24189, 16...	[ 0.2021484375, 0.22412109375, 0.0936279296875, 0.146484375, 0.1170654296875, 0.05029296875, 0.1204833984375, 0.112060546875, 0.0277557373046875, 0.1512451171875, 0.1029052734375, 0.20361328125, 0.153076171875, 0.24169921875, 0.0830078125, 0.039642333984375, 0.1453857421875, 0.009338...	embed
12192069_c0	12192069	prolog	0	Title: Too much backtracking: why is there a "redo" here? Problem title: Too much backtracking: why is there a "redo" here? Tags: successor-arithmetics, backtracking, prolog Problem: Too much backtracking: why is there a "redo" here? I'm doing a very simple exercise in Prolog and there's something I...	Too much backtracking: why is there a "redo" here? Too much backtracking: why is there a "redo" here? successor-arithmetics backtracking prolog Too greater_than Call Exit Redo Fail Too much backtracking: why is there a "redo" here? I'm doing a very simple exercise in Prolog and there's something I d...	[ 0.00616455078125, 0.01519775390625, 0.0079345703125, 0.027587890625, -0.0169677734375, 0.00811767578125, 0.0012969970703125, 0.007232666015625, 0.00787353515625, -0.0189208984375, 0.00946044921875, -0.005462646484375, -0.01312255859375, -0.00885009765625, 0.0205078125, -0.014404296875,...	[ 56374, 5045, 4420, 125728, 214, 15400, 83, 2685, 10, 56693, 3688, 41502, 39457, 42, 8962, 282, 41637, 502, 4867, 117396, 21732, 26265, 5443, 217, 6096, 31, 190355, 8781, 81979, 1250, 28219, 144851, 1528, 7134, 46429, 3501, 977, 892, 26255, ...	[ 0.137939453125, 0.1634521484375, 0.16748046875, 0.2332763671875, 0.110107421875, 0.1629638671875, 0.051727294921875, 0.100341796875, 0.1041259765625, 0.277587890625, 0.1575927734375, 0.005615234375, 0.191650390625, 0.0748291015625, 0.082763671875, 0.03594970703125, 0.0144500732421875...	embed
36556702_c0	36556702	prolog	0	Title: How to avoid Out of global stack ERROR when looking for multiple answers? Problem title: How to avoid Out of global stack ERROR when looking for multiple answers? Tags: failure-slice, prolog Problem: How to avoid Out of global stack ERROR when looking for multiple answers? After loading the following program usi...	How to avoid Out of global stack ERROR when looking for multiple answers? How to avoid Out of global stack ERROR when looking for multiple answers? failure-slice prolog How Out ERROR How to avoid Out of global stack ERROR when looking for multiple answers? After loading the following program using SWI-Prolog and enteri...	[ 0.003936767578125, 0.0198974609375, 0.0019073486328125, 0.0198974609375, -0.0037994384765625, 0.0045166015625, -0.00909423828125, 0.0269775390625, 0.0120849609375, -0.044921875, 0.0162353515625, -0.003814697265625, -0.00077056884765625, -0.00469970703125, 0.02880859375, 0.0071411132812...	[ 11249, 71864, 13538, 111, 7964, 177261, 151206, 24638, 3229, 16487, 100, 48716, 35166, 47, 137578, 7, 13348, 502, 4867, 72367, 25632, 1528, 159, 38969, 9, 10752, 41, 5117, 16750, 37202, 11343, 26785, 137447, 40, 46029, 4759, 6713, 1286, 503...	[ 0.112060546875, 0.2159423828125, 0.2340087890625, 0.210693359375, 0.2313232421875, 0.2646484375, 0.1968994140625, 0.15234375, 0.0284576416015625, 0.1378173828125, 0.10162353515625, 0.1971435546875, 0.197998046875, 0.009918212890625, 0.235107421875, 0.0167388916015625, 0.2005615234375...	embed
22442853_c0	22442853	prolog	0	Title: Is it acceptable for a prolog procedure to work only one way? Problem title: Is it acceptable for a prolog procedure to work only one way? Tags: prolog, logic Problem: Is it acceptable for a prolog procedure to work only one way? I have a prolog program: link(liverpool,preston). link(liverpool,manchester). link(...	Is it acceptable for a prolog procedure to work only one way? Is it acceptable for a prolog procedure to work only one way? prolog logic BList CList Result Is it acceptable for a prolog procedure to work only one way? I have a prolog program: Merge works if I call it like this: merge([a,b,c],[d,e,f],Result). --> [a,b,c...	[ 0.0152587890625, 0.02685546875, 0.0228271484375, 0.0002593994140625, -0.0234375, 0.007080078125, -0.01708984375, -0.004486083984375, 0.012939453125, -0.0260009765625, -0.006622314453125, 0.0062255859375, -0.0045166015625, 0.004608154296875, 0.0191650390625, 0.0023345947265625, 0.0059...	[ 2071, 213850, 502, 4867, 50491, 4488, 4734, 1632, 3917, 62775, 335, 154663, 313, 126684, 1528, 6035, 429, 43240, 2174, 11782, 1884, 903, 42564, 275, 238, 420, 7, 7136, 5526, 82775, 86869, 1542, 71, 177261, 645, 118664, 137567, 123166, 32354...	[ 0.0285186767578125, 0.2213134765625, 0.1900634765625, 0.276123046875, 0.208251953125, 0.1466064453125, 0.124755859375, 0.156982421875, 0.193115234375, 0.1845703125, 0.062255859375, 0.2083740234375, 0.0298614501953125, 0.1627197265625, 0.1573486328125, 0.2158203125, 0.194580078125, ...	embed
59120867_c0	59120867	prolog	0	Title: Given a few facts in prolog. I can't seem to create a rule which returns the variables don't have a relationship with given variable Problem title: Given a few facts in prolog. I can't seem to create a rule which returns the variables don't have a relationship with given variable Tags: prolog...	Given a few facts in prolog. I can't seem to create a rule which returns the variables don't have a relationship with given variable Given a few facts in prolog. I can't seem to create a rule which returns the variables don't have a relationship with given variable prolog Given beggining_letters mid...	[ 0.0198974609375, -0.0011749267578125, -0.0020751953125, 0.008056640625, -0.00823974609375, 0.017578125, 0.00067901611328125, 0.001983642578125, -0.0026702880859375, 0.0301513671875, -0.0242919921875, -0.006317138671875, 0.003814697265625, 0.0179443359375, 0.0120849609375, 0.01086425781...	[ 77878, 19, 10846, 15824, 502, 4867, 48903, 28282, 79986, 30646, 77336, 3768, 18, 765, 76755, 678, 34475, 23, 2301, 10, 186, 16680, 592, 63049, 86991, 4568, 35064, 831, 27798, 959, 86, 6958, 3422, 7, 756, 120820, 208244, 47, 31330, 1542, ...	[ 0.07135009765625, 0.002960205078125, 0.053924560546875, 0.09454345703125, 0.12890625, 0.1966552734375, 0.0171356201171875, 0.078369140625, 0.1639404296875, 0.142578125, 0.2159423828125, 0.025054931640625, 0.0672607421875, 0.0604248046875, 0.1461181640625, 0.038421630859375, 0.1114501...	embed
45306615_c0	45306615	prolog	0	Title: Prolog: syntactically correct objects + relation vs. structure Problem title: Prolog: syntactically correct objects + relation vs. structure Tags: syntax, prolog Problem: Prolog: syntactically correct objects + relation vs. structure I'm new to Prolog and gradually working my way through Ivan Bratko's 'Prolog Pr...	Prolog: syntactically correct objects + relation vs. structure Prolog: syntactically correct objects + relation vs. structure syntax prolog Prolog Prolog: syntactically correct objects + relation vs. structure I'm new to Prolog and gradually working my way through Ivan Bratko's 'Prolog Programming for Artificial Intell...	[ 0.0216064453125, 0.0238037109375, 0.006744384765625, 0.000858306884765625, 0.004150390625, 0.01495361328125, -0.002532958984375, 0.00811767578125, -0.0008087158203125, -0.0224609375, 0.0022735595703125, -0.015380859375, -0.0034637451171875, -0.007080078125, 0.00136566162109375, -0.0148...	[ 1250, 4867, 6002, 18, 47013, 26785, 36746, 997, 41911, 20209, 45646, 86531, 502, 3525, 23698, 119794, 265, 10752, 27958, 100, 231996, 157075, 81979, 34513, 22469, 5606, 35782, 1957, 15400, 190, 132, 1542, 4, 1723, 83, 959, 12960, 65158, 256...	[ 0.1629638671875, 0.25439453125, 0.1483154296875, 0.12744140625, 0.1546630859375, 0.2264404296875, 0.189453125, 0.18017578125, 0.22412109375, 0.1063232421875, 0.246826171875, 0.10498046875, 0.09906005859375, 0.00128173828125, 0.044708251953125, 0.1007080078125, 0.1336669921875, 0.16...	embed
46500822_c0	46500822	prolog	0	Title: Skipping list of lists elements Problem title: Skipping list of lists elements Tags: list, prolog Problem: Skipping list of lists elements I have this nested list: list = [[1, 2, 3, 4], [2, 7, 2, 1], [3, 3, 7, 5], [4, 4, 1, 7]] And I'm trying to skip the first list of this nested list, and the first element of e...	Skipping list of lists elements Skipping list of lists elements list prolog Skipping skip_first_list Tail HeadTail Skipping list of lists elements I have this nested list: And I'm trying to skip the first list of this nested list, and the first element of each list. I want it to become like this: So far I have this: Wh...	[ -0.00897216796875, 0.01904296875, 0.00665283203125, 0.0087890625, -0.0264892578125, 0.0213623046875, 0.00958251953125, 0.002197265625, 0.0194091796875, -0.005859375, 0.004669189453125, -0.0029144287109375, -0.019287109375, 0.015625, -0.00128173828125, 0.01507568359375, 0.016723632812...	[ 20491, 26783, 5303, 111, 7, 80854, 502, 4867, 21658, 13448, 271, 6562, 1218, 379, 44816, 9874, 903, 8512, 71, 31577, 47, 5117, 12830, 12638, 3444, 24209, 1884, 2060, 959, 27489, 26785, 16750, 37202, 141377, 1747, 96819, 23, 39531, 73, 323...	[ 0.19384765625, 0.1240234375, 0.2061767578125, 0.09552001953125, 0.0235595703125, 0.1737060546875, 0.134765625, 0.2296142578125, 0.2103271484375, 0.0751953125, 0.051422119140625, 0.1923828125, 0.1038818359375, 0.09100341796875, 0.0880126953125, 0.1162109375, 0.015289306640625, 0.176...	embed
9983206_c0	9983206	prolog	0	Title: Prolog: where to begin solving Minesweeper-like puzzle? Problem title: Prolog: where to begin solving Minesweeper-like puzzle? Tags: puzzle, prolog Problem: Prolog: where to begin solving Minesweeper-like puzzle? I need to write something like a minesweeper in prolog. I am able to do that in "normal" language bu...	Prolog: where to begin solving Minesweeper-like puzzle? Prolog: where to begin solving Minesweeper-like puzzle? puzzle prolog Prolog Minesweeper-like Prolog: where to begin solving Minesweeper-like puzzle? I need to write something like a minesweeper in prolog. I am able to do that in "normal" language but when i try t...	[ 0.01336669921875, -0.00250244140625, -0.004241943359375, 0.0008087158203125, -0.0115966796875, 0.000308990478515625, 0.0013885498046875, 0.0031280517578125, -0.0162353515625, -0.025390625, -0.0023040771484375, 0.01953125, 0.00860595703125, -0.0038909912109375, 0.0017852783203125, 0.003...	[ 1250, 4867, 7440, 9842, 3115, 6496, 56713, 7, 1177, 13, 1264, 5062, 104192, 502, 47, 3871, 33022, 9844, 1884, 10, 5665, 23, 19048, 33176, 46876, 9790, 4034, 552, 6238, 678, 112668, 18, 3714, 3642, 6305, 360, 7077, 29458, 62554, 13267, 3...	[ 0.1817626953125, 0.25732421875, 0.10205078125, 0.13720703125, 0.151123046875, 0.09381103515625, 0.201416015625, 0.1085205078125, 0.2010498046875, 0.166259765625, 0.205810546875, 0.1690673828125, 0.23388671875, 0.175537109375, 0.0213623046875, 0.052215576171875, 0.1790771484375, 0.0...	embed
16238426_c0	16238426	prolog	0	Title: Mistakes in my facts? (Prolog) Problem title: Mistakes in my facts? (Prolog) Tags: prolog Problem: Mistakes in my facts? (Prolog) parent(_,_). descendant(X,Y):- parent(Y,X). descendant(edward,david). descendant(malcolm,mark). descendant(edward,therese). descendant(malcolm,nathalie). descendant(matthew,raymond). ...	Mistakes in my facts? (Prolog) Mistakes in my facts? (Prolog) prolog Mistakes Prolog Mistakes in my facts? (Prolog) The problem here is that for some reason the code isn't working. What I mean by that is that no matter what queries I input regarding this code it always returns true (I'm not including all the atoms in m...	[ 0.044677734375, 0.0145263671875, 0.0120849609375, 0.0040283203125, -0.0205078125, 0.01495361328125, 0.00244140625, -0.005157470703125, -0.01422119140625, -0.033935546875, 0.01361083984375, -0.0220947265625, -0.0108642578125, 0.00238037109375, 0.01202392578125, 0.0155029296875, 0.0163...	[ 7950, 1865, 90, 23, 759, 15824, 7, 32, 10752, 4867, 502, 1250, 2967, 3688, 31635, 18151, 56112, 18, 20697, 29459, 110, 26866, 41, 107730, 118861, 903, 11343, 30646, 29568, 26719, 756, 34627, 1528, 2806, 8781, 11280, 1542, 707, 117776, 339...	[ 0.1055908203125, 0.1993408203125, 0.0875244140625, 0.1304931640625, 0.123046875, 0.198486328125, 0.1220703125, 0.0294647216796875, 0.1123046875, 0.1773681640625, 0.106201171875, 0.1396484375, 0.115234375, 0.03582763671875, 0.022552490234375, 0.2025146484375, 0.032196044921875, 0.06...	embed
36635273_c0	36635273	prolog	0	Title: Possible list permutation using a given formula Problem title: Possible list permutation using a given formula Tags: prolog, permutation, list Problem: Possible list permutation using a given formula I am trying to get my head wrap around lists in Prolog. To do this I am trying to create a sort of game. You pass...	Possible list permutation using a given formula Possible list permutation using a given formula prolog permutation list a Possible Possible list permutation using a given formula I am trying to get my head wrap around lists in Prolog. To do this I am trying to create a sort of game. You pass in a list of numbers 1-9 th...	[ 0.017333984375, 0.0322265625, -0.0040283203125, -0.0035400390625, -0.0013885498046875, -0.00188446044921875, -0.022705078125, 0.0093994140625, 0.02294921875, -0.03369140625, -0.01251220703125, -0.003204345703125, -0.0079345703125, 0.017822265625, -0.006988525390625, -0.00286865234375, ...	[ 115861, 2661, 5303, 117, 561, 22062, 17368, 34475, 26168, 502, 4867, 10, 31577, 759, 10336, 137565, 10932, 7, 23, 1250, 28282, 12096, 111, 6712, 27875, 101935, 106, 15205, 831, 186, 119140, 297, 2499, 140909, 91736, 72134, 1295, 70, 5117, ...	[ 0.21630859375, 0.143310546875, 0.276123046875, 0.1517333984375, 0.2259521484375, 0.1146240234375, 0.1219482421875, 0.169189453125, 0.26171875, 0.1832275390625, 0.2447509765625, 0.030364990234375, 0.0843505859375, 0.00701904296875, 0.0908203125, 0.079833984375, 0.0765380859375, 0.04...	embed
30223006_c0	30223006	prolog	0	Title: SWI Prolog 5.8.3 - div is not a function? Problem title: SWI Prolog 5.8.3 - div is not a function? Tags: swi-prolog, prolog Problem: SWI Prolog 5.8.3 - div is not a function? In my program I have a predicate number_to_unique_bits_list , that receives a number and a list of booleans, and returns a a boolean formu...	SWI Prolog 5.8.3 - div is not a function? SWI Prolog 5.8.3 - div is not a function? swi-prolog prolog SWI Prolog number_to_unique_bits_list IntegerNumber Bit RestBits ResultBit RestResultBits ModRes Divided not_on_sat SWI Prolog 5.8.3 - div is not a function? In my program I have a predicate number_to_unique_bits_list ...	[ -0.01416015625, -0.00058746337890625, 0.028564453125, -0.0081787109375, 0.0013580322265625, 0.01019287109375, -0.01129150390625, 0.00145721435546875, 0.01611328125, -0.05126953125, 0.003509521484375, -0.000858306884765625, 0.0030975341796875, 0.00482177734375, 0.01434326171875, -0.0133...	[ 159, 38969, 1250, 4867, 190, 52196, 363, 18221, 83, 959, 10, 32354, 2452, 3454, 502, 14012, 188, 34, 45602, 3137, 6562, 44401, 27774, 49756, 571, 14481, 126684, 217, 16269, 4332, 76278, 48141, 191, 6489, 1528, 1653, 2063, 53299, 5303, 337...	[ 0.06365966796875, 0.2313232421875, 0.1624755859375, 0.2242431640625, 0.09954833984375, 0.18017578125, 0.16064453125, 0.273681640625, 0.1160888671875, 0.1824951171875, 0.1005859375, 0.2197265625, 0.1610107421875, 0.10302734375, 0.098876953125, 0.1651611328125, 0.1444091796875, 0.063...	embed
33785865_c0	33785865	prolog	0	Title: Prolog: How to compose two "functions", to find the min of the squares of my list? Problem title: Prolog: How to compose two "functions", to find the min of the squares of my list? Tags: function-composition, composition, prolog Problem: Prolog: How to compose two "functions", to find the min...	Prolog: How to compose two "functions", to find the min of the squares of my list? Prolog: How to compose two "functions", to find the min of the squares of my list? function-composition composition prolog Prolog How First Rest FirstSquared SquareRest result_List Answer Prolog: How to compose two "f...	[ 0.006378173828125, -0.00390625, 0.02294921875, 0.0247802734375, -0.012939453125, 0.0203857421875, 0.01263427734375, 0.00518798828125, -0.00185394287109375, -0.010498046875, 0.01434326171875, 0.012451171875, 0.0048828125, -0.010986328125, 0, -0.0166015625, -0.005401611328125, 0.0106...	[ 1250, 4867, 11249, 150350, 6626, 137175, 7413, 881, 111, 108047, 7, 759, 5303, 32354, 277, 40322, 166577, 502, 23972, 49756, 94727, 297, 68305, 1052, 525, 16750, 154663, 130373, 52080, 9655, 2967, 2060, 19048, 3249, 214, 3714, 11782, 3525, ...	[ 0.13720703125, 0.233154296875, 0.07916259765625, 0.2291259765625, 0.19873046875, 0.2191162109375, 0.08404541015625, 0.254638671875, 0.0714111328125, 0.17138671875, 0.008819580078125, 0.051483154296875, 0.2156982421875, 0.158935546875, 0.086669921875, 0.0914306640625, 0.1741943359375,...	embed
27786010_c0	27786010	prolog	0	Title: Prolog "Not together in source file" and "Singleton Variable" errors Problem title: Prolog "Not together in source file" and "Singleton Variable" errors Tags: prolog, singleton Problem: Prolog "Not together in source file" and "Singleton Variable" errors %Sitting room / Ki...	Prolog "Not together in source file" and "Singleton Variable" errors Prolog "Not together in source file" and "Singleton Variable" errors prolog singleton Prolog Not Singleton Variable Clauses Warning test.pl:27 test.pl:28 test.pl:34 test.pl:36 test.pl:37 test.pl:38 test.pl:40 te...	[ 0.0264892578125, 0.0224609375, -0.0005950927734375, -0.01422119140625, -0.006378173828125, 0.018798828125, -0.0174560546875, -0.007659912109375, 0.00933837890625, -0.027587890625, -0.0177001953125, -0.0045166015625, 0.0038299560546875, -0.0189208984375, 0.020263671875, -0.0000202655792...	[ 1250, 4867, 41502, 122116, 25842, 23, 31344, 11435, 136, 213039, 1507, 84572, 2886, 18499, 502, 11001, 11205, 43609, 100700, 5550, 3034, 2424, 27592, 28270, 30197, 32944, 30225, 34179, 22932, 33529, 35167, 23924, 112997, 33915, 24453, 25134, 34...	[ 0.194580078125, 0.28369140625, 0.0057373046875, 0.1922607421875, 0.27001953125, 0.1246337890625, 0.2401123046875, 0.20654296875, 0.0273590087890625, 0.1990966796875, 0.1766357421875, 0.1806640625, 0.1265869140625, 0.202880859375, 0.1552734375, 0.1328125, 0.105224609375, 0.151489257...	embed
51673750_c1	51673750	prolog	1	y, is, ten, fullstop ]). lpsolve(Data, Answers):- lpsolve( [], Variables, Answers, Data, [] ). % labeling( [], Variables ). lpsolve( PreviousVariables, CurrentVariables, Answers, Data, Remainder ) :- sentence(Answers, Data,Remainder). lpsolve( PreviousVariables, CurrentVariables, Answers, Data, Remainder ) :- sentence...	y, is, ten, fullstop ]). lpsolve(Data, Answers):- lpsolve( [], Variables, Answers, Data, [] ). % labeling( [], Variables ). lpsolve( PreviousVariables, CurrentVariables, Answers, Data, Remainder ) :- sentence(Answers, Data,Remainder). lpsolve( PreviousVariables, CurrentVariables, Answers, Data, Remainder ) :- sentence...	[ 0.01092529296875, 0.00848388671875, -0.00885009765625, 0.0257568359375, -0.01214599609375, 0.0213623046875, 0.01458740234375, -0.00396728515625, 0.0096435546875, -0.038818359375, -0.00927734375, 0.000919342041015625, 0.005889892578125, 0.0023040771484375, 0.010009765625, 0.027954101562...	[ 113, 83, 1492, 4393, 19111, 96, 86918, 137989, 4, 130373, 111477, 13566, 11809, 1745, 67967, 254, 6422, 81827, 14, 19736, 114063, 853, 24931, 820, 149357, 7251, 7, 42844, 4332, 2517, 4153, 95211, 1177, 1542, 179665, 42792, 21690, 164, 1029,...	[ 0.175048828125, 0.1875, 0.2447509765625, 0.117431640625, 0.2078857421875, 0.0180206298828125, 0.1905517578125, 0.1202392578125, 0.01007080078125, 0.28369140625, 0.23095703125, 0.1702880859375, 0.1260986328125, 0.087158203125, 0.1566162109375, 0.00079345703125, 0.1201171875, 0.15051...	embed
12826174_c0	12826174	prolog	0	Title: Rectangular Peg Solitaire in Prolog? Problem title: Rectangular Peg Solitaire in Prolog? Tags: counter, prolog, recursion Problem: Rectangular Peg Solitaire in Prolog? possible quick question here since I'm new to Prolog. I'm trying to convert this code for solving a triangular peg solitaire puzzle into solving ...	Rectangular Peg Solitaire in Prolog? Rectangular Peg Solitaire in Prolog? counter prolog recursion Rectangular Peg Solitaire Prolog Legal Rotate One BRJ Series Rest Rectangular Peg Solitaire in Prolog? possible quick question here since I'm new to Prolog. I'm trying to convert this code for solving a triangular peg sol...	[ -0.01080322265625, -0.00592041015625, 0.0159912109375, 0.0152587890625, -0.016357421875, 0.0272216796875, -0.01080322265625, 0.01434326171875, 0.01043701171875, -0.0166015625, -0.0306396484375, 0.0086669921875, 0.0244140625, -0.0179443359375, 0.002227783203125, 0.00897216796875, 0.00...	[ 48224, 14525, 35975, 1460, 177, 124725, 44386, 1250, 4867, 23, 105416, 502, 195625, 51825, 146283, 6561, 60310, 64876, 49756, 32, 7722, 63773, 96760, 18151, 3115, 1927, 1463, 280, 20245, 104192, 148734, 10393, 320, 2967, 7808, 2633, 1528, 371...	[ 0.054412841796875, 0.1671142578125, 0.1990966796875, 0.2069091796875, 0.1732177734375, 0.1405029296875, 0.221435546875, 0.171142578125, 0.256591796875, 0.0799560546875, 0.2174072265625, 0.08941650390625, 0.1015625, 0.1094970703125, 0.0806884765625, 0.091796875, 0.114013671875, 0.07...	embed
63200623_c1	63200623	prolog	1	2). product(2, 2, 1). % repeating product n2 because it can lay horizontal or vertical product(3, 1, 3). product(3, 3, 1). % idem product(4, 3, 3). % is square so does not need it product(5, 2, 3). product(5, 3, 2). % iden product(6, 4, 2). product(6, 2, 4). % idem % because it can lay virtically or horizontally in a ...	2). product(2, 2, 1). % repeating product n2 because it can lay horizontal or vertical product(3, 1, 3). product(3, 3, 1). % idem product(4, 3, 3). % is square so does not need it product(5, 2, 3). product(5, 3, 2). % iden product(6, 4, 2). product(6, 2, 4). % idem % because it can lay virtically or horizontally in a ...	[ -0.00080108642578125, 0.016357421875, -0.01318359375, 0.01361083984375, -0.017822265625, -0.0034027099609375, -0.01190185546875, -0.00043487548828125, 0.01611328125, -0.00689697265625, 0.01153564453125, 0.0108642578125, 0.007659912109375, -0.0218505859375, -0.0006256103515625, -0.00866...	[ 4958, 12996, 54753, 116, 4879, 1745, 119140, 214, 304, 6637, 831, 21, 53, 124001, 707, 79259, 86827, 8439, 138, 50638, 105801, 108047, 221, 959, 3871, 104116, 17, 555, 139303, 201, 13956, 1017, 23, 16530, 9319, 7514, 58302, 77554, 18444, ...	[ 0.1307373046875, 0.274658203125, 0.084228515625, 0.12255859375, 0.0253448486328125, 0.0889892578125, 0.2220458984375, 0.033843994140625, 0.10546875, 0.06549072265625, 0.10223388671875, 0.09088134765625, 0.07879638671875, 0.15869140625, 0.0455322265625, 0.161376953125, 0.0114440917968...	embed
48751921_c0	48751921	prolog	0	Title: In Prolog, how to sort even and odd numbers represented with symbols and chains of predicates? Problem title: In Prolog, how to sort even and odd numbers represented with symbols and chains of predicates? Tags: prolog, knowledge-management Problem: In Prolog, how to sort even and odd numbers represented with sym...	In Prolog, how to sort even and odd numbers represented with symbols and chains of predicates? In Prolog, how to sort even and odd numbers represented with symbols and chains of predicates? prolog knowledge-management Prolog if_larger elder_than Next In Prolog, how to sort even and odd numbers represented with symbols ...	[ 0.0047607421875, 0.0166015625, 0.01190185546875, 0.0098876953125, -0.00616455078125, 0.0252685546875, -0.006439208984375, 0.006500244140625, 0.015869140625, -0.0164794921875, 0.003387451171875, 0.01116943359375, 0.0021514892578125, -0.0062255859375, 0.0234375, -0.0020904541015625, -0...	[ 360, 1250, 4867, 3642, 47, 12096, 3853, 136, 70270, 101935, 33636, 678, 26582, 121293, 111, 1653, 2063, 1636, 297, 502, 51359, 87140, 2174, 320, 88, 820, 21732, 4997, 44759, 13648, 151581, 1957, 18151, 70, 25632, 12989, 1632, 17262, 43606, ...	[ 0.04364013671875, 0.189453125, 0.258544921875, 0.081787109375, 0.06640625, 0.251708984375, 0.198974609375, 0.1331787109375, 0.25927734375, 0.2362060546875, 0.1962890625, 0.0831298828125, 0.209228515625, 0.1553955078125, 0.06573486328125, 0.1558837890625, 0.1849365234375, 0.10644531...	embed
72555579_c0	72555579	prolog	0	Title: Type error: file_name_extension/3 `character_code' expected , found `row(1, 410021001, 'Alan', 90, 84.5, 117, 60, 66)' (a compound) Problem title: Type error: file_name_extension/3 `character_code' expected , found `row(1, 410021001, 'Alan', 90, 84.5, 117, 60, 66)' (a comp...	Type error: file_name_extension/3 `character_code' expected , found `row(1, 410021001, 'Alan', 90, 84.5, 117, 60, 66)' (a compound) Type error: file_name_extension/3 `character_code' expected , found `row(1, 410021001, 'Alan', 90, 84.5, 117, 60, 66)' (a compound) swi-prolog-for-s...	[ 0.01336669921875, -0.002288818359375, 0.008544921875, 0.023193359375, -0.006317138671875, -0.00185394287109375, -0.0022430419921875, 0.003997802734375, -0.0157470703125, 0.0126953125, -0.0042724609375, -0.015380859375, -0.01141357421875, -0.0146484375, -0.0074462890625, -0.007049560546...	[ 60457, 18499, 11435, 11627, 3355, 128872, 18113, 9254, 2263, 720, 40899, 3768, 84751, 14037, 15555, 201, 3559, 3117, 34479, 284, 1414, 2510, 382, 104867, 53373, 1496, 84308, 11, 217773, 91, 2452, 3454, 4867, 2420, 2852, 502, 38969, 10752, 3...	[ 0.1903076171875, 0.2025146484375, 0.15966796875, 0.125732421875, 0.07958984375, 0.1566162109375, 0.20703125, 0.06805419921875, 0.10235595703125, 0.076904296875, 0.1962890625, 0.1400146484375, 0.2119140625, 0.0791015625, 0.188232421875, 0.055877685546875, 0.0732421875, 0.10180664062...	embed
41227318_c1	41227318	prolog	1	3rd'),nl; reduce1(New3,NextVal3,-(New2-SecondSize))-> NextVal2 is 0, NextVal1 is New1, write('From 3rd to 2nd'),nl; reduce2(New1, NextVal1, New2, SecondSize)-> NextVal2 is 0, NextVal3 is New3, write('From 2nd to 1st'),nl; reduce2(New1, NextVal1, New3, ThirdSize)-> NextVal3 is 0, NextVal2 is New2, write('From 3rd to 1s...	3rd'),nl; reduce1(New3,NextVal3,-(New2-SecondSize))-> NextVal2 is 0, NextVal1 is New1, write('From 3rd to 2nd'),nl; reduce2(New1, NextVal1, New2, SecondSize)-> NextVal2 is 0, NextVal3 is New3, write('From 2nd to 1st'),nl; reduce2(New1, NextVal1, New3, ThirdSize)-> NextVal3 is 0, NextVal2 is New2, write('From 3rd to 1s...	[ -0.0220947265625, 0.0294189453125, -0.0033111572265625, 0.01220703125, -0.01214599609375, -0.0019683837890625, -0.02734375, 0.010986328125, 0.013671875, 0.026611328125, 0.0025787353515625, 0.00653076171875, 0.003173828125, -0.00384521484375, 0.0029449462890625, 0.008544921875, -0.003...	[ 138, 4216, 25, 13169, 34390, 46568, 363, 81280, 42272, 18504, 2271, 127167, 4997, 304, 757, 2356, 33022, 168407, 47, 116, 2208, 77648, 198387, 271, 3314, 177, 25813, 207263, 117177, 17903, 289, 397, 2811, 1193, 391, 2016, 4426, 80378, 418, ...	[ 0.149658203125, 0.1573486328125, 0.0195159912109375, 0.088134765625, 0.187744140625, 0.078125, 0.1298828125, 0.0755615234375, 0.1551513671875, 0.0164794921875, 0.0020751953125, 0.130615234375, 0.08624267578125, 0.07281494140625, 0.1041259765625, 0.0709228515625, 0.0953369140625, 0....	embed
41858094_c1	41858094	prolog	1	inburgh). adjacent(leicester, sheffield). adjacent(sheffield, manchester). adjacent(peterborough, york). adjacent(york, newcastle). adjacent(newcastle, edinburgh). And the following rules: Rule that makes the adjacent relationships two-way: twoWay(X, Y) :- adjacent(X, Y); adjacent(Y, X). And my rule that returns the li...	inburgh). adjacent(leicester, sheffield). adjacent(sheffield, manchester). adjacent(peterborough, york). adjacent(york, newcastle). adjacent(newcastle, edinburgh). And the following rules: Rule that makes the adjacent relationships two-way: twoWay(X, Y) :- adjacent(X, Y); adjacent(Y, X). And my rule that returns the li...	[ 0.006988525390625, -0.0098876953125, 0.0115966796875, 0.0269775390625, 0.00616455078125, 0.00665283203125, 0.0159912109375, 0.00799560546875, 0.0203857421875, -0.04443359375, -0.0120849609375, 0.019775390625, 0.00872802734375, 0.00421142578125, 0.00860595703125, -0.003509521484375, 0...	[ 23, 13593, 127, 123594, 16797, 2980, 1515, 2412, 420, 28394, 108282, 104588, 184721, 70662, 13437, 3525, 55741, 133, 23251, 25632, 91736, 139118, 30482, 151618, 6626, 7514, 22489, 1542, 990, 1193, 759, 79986, 30646, 5303, 29398, 34475, 13315, ...	[ 0.117919921875, 0.17333984375, 0.11669921875, 0.1849365234375, 0.211181640625, 0.11083984375, 0.13720703125, 0.042999267578125, 0.0733642578125, 0.2125244140625, 0.098388671875, 0.1298828125, 0.1881103515625, 0.0665283203125, 0.0753173828125, 0.018463134765625, 0.080810546875, 0.05...	embed
13112816_c0	13112816	prolog	0	Title: Determine even position in a list and take out second occurence Problem title: Determine even position in a list and take out second occurence Tags: prolog Problem: Determine even position in a list and take out second occurence I just learned prolog for a week and I have to write a prolog program that counts th...	Determine even position in a list and take out second occurence Determine even position in a list and take out second occurence prolog Determine Determine even position in a list and take out second occurence I just learned prolog for a week and I have to write a prolog program that counts the number of times an elemen...	[ 0.009521484375, 0.01190185546875, 0.0035858154296875, 0.01080322265625, 0.00921630859375, 0.02001953125, -0.01214599609375, 0.00775146484375, 0.021240234375, -0.02490234375, 0.0003337860107421875, -0.01953125, 0.00634765625, 0.0169677734375, 0.01019287109375, 0.0091552734375, 0.00283...	[ 262, 30524, 13, 3853, 19069, 23, 5303, 136, 5646, 1810, 17932, 74918, 6620, 502, 4867, 97384, 5895, 33022, 1528, 54529, 14012, 20028, 12830, 108975, 214, 339, 99, 9790, 26366, 2967, 444, 40008, 5036, 201, 6632, 4568, 611, 21974, 35782, 37...	[ 0.057708740234375, 0.184326171875, 0.0284423828125, 0.2078857421875, 0.231689453125, 0.04620361328125, 0.20751953125, 0.0169219970703125, 0.12890625, 0.1580810546875, 0.18017578125, 0.17919921875, 0.1021728515625, 0.1116943359375, 0.1875, 0.063232421875, 0.003936767578125, 0.029235...	embed
69698132_c1	69698132	prolog	1	(Y)), tree(leaf(Y), SwapB1)) :- dif(B1, leaf(_)), swap(B1, SwapB1). swap(tree(leaf(X), B2), tree(SwapB2, leaf(X))) :- dif(B2, leaf(_)), swap(B2, SwapB2). swap(tree(B1, B2), tree(B2,B1)) :- dif(B1, leaf(_)), dif(B2, leaf(_)). When I execute the following query swap(T1,T). I get: ?- swap(T1,T). T1 = tree(leaf(_A), leaf(_...	(Y)), tree(leaf(Y), SwapB1)) :- dif(B1, leaf(_)), swap(B1, SwapB1). swap(tree(leaf(X), B2), tree(SwapB2, leaf(X))) :- dif(B2, leaf(_)), swap(B2, SwapB2). swap(tree(B1, B2), tree(B2,B1)) :- dif(B1, leaf(_)), dif(B2, leaf(_)). When I execute the following query swap(T1,T). I get: ?- swap(T1,T). T1 = tree(leaf(_A), leaf(_...	[ 0.005706787109375, 0.0125732421875, -0.0024871826171875, 0.004058837890625, -0.00128173828125, -0.00811767578125, -0.04296875, -0.0169677734375, -0.008544921875, -0.01251220703125, -0.006927490234375, 0.01043701171875, -0.003753662109375, 0.00147247314453125, 0.01556396484375, 0.017822...	[ 1723, 247, 53201, 133, 2407, 43062, 254, 571, 17727, 15772, 45755, 418, 95, 202317, 62600, 1542, 335, 10461, 634, 304, 71924, 25632, 41, 1294, 618, 4, 2046, 705, 384, 2203, 397, 80126, 1250, 4867, 959, 179635, 756, 51347, 12638, 14012, ...	[ 0.1304931640625, 0.026519775390625, 0.2215576171875, 0.08258056640625, 0.1776123046875, 0.195556640625, 0.1192626953125, 0.109130859375, 0.08984375, 0.0716552734375, 0.1834716796875, 0.123046875, 0.027801513671875, 0.270263671875, 0.1793212890625, 0.042755126953125, 0.054046630859375...	embed
16214184_c0	16214184	prolog	0	Title: SWI prolog make set of variables name with rbtrees or others means Problem title: SWI prolog make set of variables name with rbtrees or others means Tags: tree, prolog, set, variables Problem: SWI prolog make set of variables name with rbtrees or others means I have got a term from which I want to get set of var...	SWI prolog make set of variables name with rbtrees or others means SWI prolog make set of variables name with rbtrees or others means tree prolog set variables SWI only_one rb_in rb_insert SWI prolog make set of variables name with rbtrees or others means I have got a term from which I want to get set of variables name...	[ 0.0201416015625, 0.016357421875, 0.0093994140625, 0.0035552978515625, -0.008056640625, -0.00024127960205078125, -0.0198974609375, 0.0250244140625, 0.0031890869140625, -0.04248046875, 0.01019287109375, 0.0145263671875, 0.00994873046875, 0.00002014636993408203, 0.01324462890625, 0.013793...	[ 159, 38969, 502, 4867, 3249, 5423, 111, 77336, 7, 9351, 678, 13471, 2921, 90, 27060, 26950, 53201, 4734, 3630, 73, 33657, 4163, 13579, 1295, 3444, 2046, 107730, 759, 39, 11, 24084, 397, 140992, 571, 441, 12989, 170894, 21690, 2886, 11627,...	[ 0.0302734375, 0.225341796875, 0.14990234375, 0.1971435546875, 0.034149169921875, 0.2012939453125, 0.056732177734375, 0.2440185546875, 0.012237548828125, 0.1463623046875, 0.09326171875, 0.137939453125, 0.20263671875, 0.1280517578125, 0.06585693359375, 0.01715087890625, 0.1849365234375...	embed
23050202_c0	23050202	prolog	0	Title: Prolog: String data not displaying properly inside ELSE clause Problem title: Prolog: String data not displaying properly inside ELSE clause Tags: prolog Problem: Prolog: String data not displaying properly inside ELSE clause I have a function that allows the user to enter a single quoted string (A), then search...	Prolog: String data not displaying properly inside ELSE clause Prolog: String data not displaying properly inside ELSE clause prolog Prolog FIRST CHECK SLOT DISPLAY DATA THEN PASS Name Grade Prolog: String data not displaying properly inside ELSE clause I have a function that allows the user to enter a single quoted st...	[ 0.019775390625, 0.000850677490234375, 0.00457763671875, 0.037109375, 0.00121307373046875, 0.027099609375, 0.017333984375, -0.00994873046875, 0.017333984375, 0.024658203125, 0.0235595703125, -0.0079345703125, -0.002838134765625, -0.006744384765625, 0.005035400390625, 0.01092529296875, ...	[ 1250, 4867, 23351, 214, 2053, 44116, 155965, 46132, 96922, 70731, 959, 502, 133907, 83556, 20572, 115447, 209973, 103695, 391, 17758, 8436, 15757, 22453, 13, 32354, 114864, 38937, 30957, 11001, 66747, 79315, 284, 33938, 5303, 1614, 6562, 1542, ...	[ 0.135498046875, 0.214599609375, 0.1842041015625, 0.082763671875, 0.1807861328125, 0.1806640625, 0.1072998046875, 0.099853515625, 0.233642578125, 0.173095703125, 0.03656005859375, 0.1007080078125, 0.0151214599609375, 0.08917236328125, 0.03399658203125, 0.09808349609375, 0.051177978515...	embed
55024606_c0	55024606	prolog	0	Title: Shifting a list N times using Prolog [] issue :- Exercise 3.6 “ Prolog Programming for Artificial Intelligence” by Ivan Btrako Problem title: Shifting a list N times using Prolog [] issue :- Exercise 3.6 “ Prolog Programming for Artificial Intelligence” by Ivan Btrako Tags: prolog, list Problem: Shifting a list ...	Shifting a list N times using Prolog [] issue :- Exercise 3.6 “ Prolog Programming for Artificial Intelligence” by Ivan Btrako Shifting a list N times using Prolog [] issue :- Exercise 3.6 “ Prolog Programming for Artificial Intelligence” by Ivan Btrako prolog list Prolog Shifting Exercise Programming Artificial Intell...	[ 0.005889892578125, 0.000732421875, 0.015869140625, 0.00384521484375, -0.01361083984375, -0.0196533203125, -0.033203125, 0.00872802734375, -0.00811767578125, -0.01055908203125, 0.0087890625, 0.00469970703125, -0.0125732421875, 0.004119873046875, 0.0019073486328125, 0.0208740234375, 0....	[ 8294, 2480, 5303, 541, 20028, 17368, 1250, 4867, 31089, 155534, 102738, 27958, 231996, 157075, 23698, 13151, 502, 32036, 304, 3444, 28282, 1653, 2063, 122925, 154663, 418, 10461, 47014, 12830, 25737, 89536, 75935, 67, 44691, 18, 28219, 15400, ...	[ 0.1783447265625, 0.1787109375, 0.2335205078125, 0.13623046875, 0.1856689453125, 0.0609130859375, 0.1622314453125, 0.221435546875, 0.07183837890625, 0.1353759765625, 0.1424560546875, 0.1099853515625, 0.10205078125, 0.110595703125, 0.0999755859375, 0.156494140625, 0.004913330078125, ...	embed
69529482_c0	69529482	prolog	0	Title: Calculating syntactic complexity of a prolog predicate Problem title: Calculating syntactic complexity of a prolog predicate Tags: prolog Problem: Calculating syntactic complexity of a prolog predicate Currently working on an exercise where, given some predicate, the syntactic complexity has to be calculated. Th...	Calculating syntactic complexity of a prolog predicate Calculating syntactic complexity of a prolog predicate prolog Calculating Total Calculating syntactic complexity of a prolog predicate Currently working on an exercise where, given some predicate, the syntactic complexity has to be calculated. The syntactic complex...	[ 0.01104736328125, 0.0137939453125, -0.005828857421875, 0.00897216796875, -0.01068115234375, 0.018798828125, 0.01263427734375, -0.006317138671875, -0.0167236328125, -0.031005859375, 0.00164031982421875, -0.0247802734375, -0.011962890625, 0.00142669677734375, 0.02294921875, 0.01281738281...	[ 212467, 6002, 102, 49086, 27140, 2481, 502, 4867, 1653, 2063, 67, 33867, 20697, 81979, 74481, 3674, 28960, 34627, 1771, 32354, 787, 77336, 160624, 939, 1021, 9319, 837, 275, 990, 1193, 79786, 1810, 51515, 1916, 6044, 2174, 3173, 8512, 5303,...	[ 0.18701171875, 0.1605224609375, 0.197509765625, 0.132568359375, 0.231201171875, 0.1302490234375, 0.1519775390625, 0.2044677734375, 0.1790771484375, 0.223876953125, 0.10986328125, 0.1490478515625, 0.005096435546875, 0.040252685546875, 0.1904296875, 0.003997802734375, 0.008697509765625...	embed
37040060_c0	37040060	prolog	0	Title: Writing a Prolog program that is supposed to multiply every element in the list by a number Problem title: Writing a Prolog program that is supposed to multiply every element in the list by a number Tags: prolog, multiplication, list Problem: Writing a Prolog program that is supposed to multiply every element in...	Writing a Prolog program that is supposed to multiply every element in the list by a number Writing a Prolog program that is supposed to multiply every element in the list by a number prolog multiplication list Writing Prolog multiply_list Result Number NewXs Writing a Prolog program that is supposed to multiply every ...	[ -0.0201416015625, 0.0185546875, 0.00579833984375, 0.00037384033203125, -0.006103515625, 0.026123046875, -0.0213623046875, 0.0030517578125, 0.0184326171875, -0.028564453125, -0.0013580322265625, -0.021240234375, -0.0205078125, 0.00176239013671875, 0.0019378662109375, 0.01202392578125, ...	[ 213185, 1250, 4867, 1528, 450, 134598, 6024, 62479, 11907, 12830, 5303, 390, 14012, 502, 127664, 6562, 126684, 103332, 2356, 1542, 7, 31577, 33022, 18151, 51776, 6626, 107730, 10750, 1632, 140992, 1653, 2063, 67, 34475, 7413, 124901, 80854, 1...	[ 0.158935546875, 0.1846923828125, 0.258056640625, 0.1815185546875, 0.008575439453125, 0.16796875, 0.119873046875, 0.1580810546875, 0.1246337890625, 0.16796875, 0.1810302734375, 0.043365478515625, 0.145263671875, 0.1573486328125, 0.133056640625, 0.197021484375, 0.141845703125, 0.0964...	embed
5945015_c0	5945015	prolog	0	Title: Undefined Procedure in SWI-Prolog does not work Problem title: Undefined Procedure in SWI-Prolog does not work Tags: procedure, prolog, undefined Problem: Undefined Procedure in SWI-Prolog does not work I am just starting to use Prolog, and already I've run into problem with a seemingly simple example. Here is m...	Undefined Procedure in SWI-Prolog does not work Undefined Procedure in SWI-Prolog does not work procedure prolog undefined Undefined Procedure SWI-Prolog ERROR Exception dumb.pl Undefined Procedure in SWI-Prolog does not work I am just starting to use Prolog, and already I've run into problem with a seemingly simple ex...	[ -0.00299072265625, 0.0274658203125, 0.008056640625, 0.027587890625, -0.0322265625, 0.003021240234375, 0.00445556640625, -0.0159912109375, -0.0042724609375, -0.0289306640625, -0.0037841796875, -0.000659942626953125, -0.0186767578125, -0.004241943359375, 0.011962890625, 0.010986328125, ...	[ 79912, 5983, 297, 170470, 13, 23, 159, 38969, 10752, 4867, 959, 4488, 50491, 502, 9232, 151206, 63928, 115, 6492, 2424, 1250, 2967, 8781, 27781, 11435, 72367, 1528, 3934, 91, 2452, 3034, 678, 903, 13315, 105876, 17569, 44116, 29568, 18499, ...	[ 0.143798828125, 0.2183837890625, 0.0770263671875, 0.2230224609375, 0.0389404296875, 0.0163421630859375, 0.07073974609375, 0.2095947265625, 0.1490478515625, 0.2266845703125, 0.09222412109375, 0.15185546875, 0.2047119140625, 0.1461181640625, 0.1019287109375, 0.04766845703125, 0.0914916...	embed
17574872_c0	17574872	prolog	0	Title: Appending dynamically generated lists to a new list Problem title: Appending dynamically generated lists to a new list Tags: dynamic, list, prolog Problem: Appending dynamically generated lists to a new list I am trying to add a list into an already created list. program(Route, FinalRoute). The Route variable is...	Appending dynamically generated lists to a new list Appending dynamically generated lists to a new list dynamic list prolog Appending Route FinalRoute Source Dest Conditions Cond Rest get_info Path NewDest Appending dynamically generated lists to a new list I am trying to add a list into an already created list. progra...	[ 0.0262451171875, 0.002838134765625, 0.017333984375, 0.00102996826171875, 0.0025482177734375, 0.010009765625, -0.0167236328125, 0.005615234375, 0.0189208984375, -0.0264892578125, 0.010009765625, -0.0064697265625, -0.0191650390625, -0.004608154296875, 0.00506591796875, 0.00982666015625, ...	[ 5787, 96819, 84079, 139392, 5303, 47, 3525, 502, 4867, 106015, 27188, 12724, 6743, 77641, 262, 271, 46347, 1657, 49756, 7319, 108421, 2356, 397, 525, 31577, 15190, 3934, 21771, 75935, 1528, 77336, 83, 98816, 48716, 20028, 20271, 71924, 36541,...	[ 0.1446533203125, 0.0667724609375, 0.1868896484375, 0.16943359375, 0.232421875, 0.1126708984375, 0.127685546875, 0.109375, 0.14453125, 0.2724609375, 0.205810546875, 0.198486328125, 0.184814453125, 0.1258544921875, 0.13720703125, 0.11669921875, 0.110595703125, 0.05535888671875, 0.1...	embed
2102336_c1	2102336	prolog	1	consult_query.query(); if ( !consulted ){ System.err.println( "Consult failed" ); System.exit( 1 ); } } public static void main( String argv[] ){ JPL.init(); JavaProlog jpTest = new JavaProlog(); } If I run the Prolog program directly from Prolog it works fine and the same when I call it from the Java application. I c...	consult_query.query(); if ( !consulted ){ System.err.println( "Consult failed" ); System.exit( 1 ); } } public static void main( String argv[] ){ JPL.init(); JavaProlog jpTest = new JavaProlog(); } If I run the Prolog program directly from Prolog it works fine and the same when I call it from the Java application. I c...	[ 0.017822265625, 0.007080078125, 0.0006561279296875, 0.023681640625, 0.000949859619140625, 0.013671875, 0.0115966796875, 0.00933837890625, -0.00130462646484375, -0.040771484375, 0.0159912109375, 0.0157470703125, -0.026611328125, 0.00087738037109375, 0.01019287109375, -0.002655029296875,...	[ 75463, 944, 1294, 147834, 297, 12353, 56, 42, 35662, 239550, 165523, 13, 23399, 106, 3835, 201939, 2292, 5201, 23351, 79459, 334, 821, 21130, 217, 41925, 10752, 4867, 46802, 111337, 11675, 1250, 1528, 105237, 1295, 43240, 5885, 11782, 38415, ...	[ 0.2626953125, 0.14599609375, 0.1156005859375, 0.2076416015625, 0.08673095703125, 0.12744140625, 0.00628662109375, 0.00689697265625, 0.00555419921875, 0.2607421875, 0.1597900390625, 0.0118408203125, 0.15087890625, 0.0146636962890625, 0.006988525390625, 0.06414794921875, 0.055267333984...	embed
16457233_c1	16457233	prolog	1	: (7) del([_G389\|_G390], [[a, b, c], [], []], _G412) ? creep Exit: (7) del([a, b, c], [[a, b, c], [], []], [[], []]) ? creep Top1 = a, Stack1 = [b, c], Stacks1 = [[], []] . I have some difficulties to understand why: [Top1\|Stack1] is unified with the first stack [a, b, c] EDIT: I think that maybe work in this way: The ...	: (7) del([_G389\|_G390], [[a, b, c], [], []], _G412) ? creep Exit: (7) del([a, b, c], [[a, b, c], [], []], [[], []]) ? creep Top1 = a, Stack1 = [b, c], Stacks1 = [[], []] . I have some difficulties to understand why: [Top1\|Stack1] is unified with the first stack [a, b, c] EDIT: I think that maybe work in this way: The ...	[ -0.0027618408203125, 0.0130615234375, 0.01220703125, 0.015869140625, -0.0203857421875, -0.00041961669921875, -0.000537872314453125, 0.0012054443359375, 0.013916015625, -0.00958251953125, 0.0228271484375, 0.0118408203125, 0.0013580322265625, -0.0020599365234375, 0.00787353515625, -0.005...	[ 8696, 146, 724, 119861, 150197, 876, 501, 617, 55102, 49512, 254, 5443, 217, 4792, 418, 2203, 6512, 2594, 22824, 34844, 28219, 15400, 77888, 58745, 42378, 76172, 83, 51, 47314, 678, 5117, 177261, 4488, 5303, 111, 275, 238, 10336, 33022, 9...	[ 0.1092529296875, 0.24169921875, 0.03082275390625, 0.2315673828125, 0.2030029296875, 0.097900390625, 0.0841064453125, 0.061431884765625, 0.1083984375, 0.1505126953125, 0.086181640625, 0.09637451171875, 0.0601806640625, 0.1746826171875, 0.1256103515625, 0.007049560546875, 0.15625, 0....	embed
29152309_c1	29152309	prolog	1	_10. rep_10. rep_10. rep_10. rep_100M :- rep_10, rep_10, rep_10, rep_10, rep_10, rep_10, rep_10, rep_10. Code for int_cntA/2: benchA_1(I,W,Rt) :- statistics(runtime,_), ( repeat(100000000), int_cntA(I,W), false ; true ), statistics(runtime,[_,Rt]), int_cntA(I,W). benchA_2(I,W,Rt) :- statistics(runtime,_), ( between(1,1...	_10. rep_10. rep_10. rep_10. rep_100M :- rep_10, rep_10, rep_10, rep_10, rep_10, rep_10, rep_10, rep_10. Code for int_cntA/2: benchA_1(I,W,Rt) :- statistics(runtime,_), ( repeat(100000000), int_cntA(I,W), false ; true ), statistics(runtime,[_,Rt]), int_cntA(I,W). benchA_2(I,W,Rt) :- statistics(runtime,_), ( between(1,1...	[ -0.0086669921875, -0.0272216796875, 0.0150146484375, 0.0252685546875, -0.007415771484375, 0.00592041015625, 0.0020904541015625, -0.0023345947265625, 0.01263427734375, -0.004730224609375, -0.00191497802734375, 0.02734375, 0.0003757476806640625, 0.0299072265625, 0.0216064453125, -0.01647...	[ 101, 963, 5, 10958, 454, 3559, 594, 15772, 4, 28864, 100, 23, 18, 238, 660, 284, 12477, 1585, 206, 115187, 568, 1456, 1052, 80835, 16428, 6032, 119140, 197094, 98320, 29568, 304, 17721, 363, 571, 2161, 142, 24018, 31365, 17, 966, 20625,...	[ 0.0794677734375, 0.23681640625, 0.03533935546875, 0.2239990234375, 0.048980712890625, 0.2222900390625, 0.20263671875, 0.097900390625, 0.0157470703125, 0.250732421875, 0.03985595703125, 0.1121826171875, 0.141845703125, 0.0682373046875, 0.1749267578125, 0.209228515625, 0.2802734375, ...	embed
48255377_c1	48255377	prolog	1	,s5,500). ubicacion(boligrafos,s6,400). ubicacion(plumas,s7,500). ubicacion(plumas,s8,400). ubicacion(colonias,s3,150). ubicacion(ratones,s4,210). /* Conexiones IDA */ conectado (pc1,pc2,10). conectado (pc2,pc3,10). conectado (pc3,pc4,10). conectado (pc4,t,10). conectado (ps1,pc1,5). conectado (ps2,pc2,5). conectado (p...	,s5,500). ubicacion(boligrafos,s6,400). ubicacion(plumas,s7,500). ubicacion(plumas,s8,400). ubicacion(colonias,s3,150). ubicacion(ratones,s4,210). /* Conexiones IDA */ conectado (pc1,pc2,10). conectado (pc2,pc3,10). conectado (pc3,pc4,10). conectado (pc4,t,10). conectado (ps1,pc1,5). conectado (ps2,pc2,5). conectado (p...	[ -0.004608154296875, 0.00124359130859375, 0.005523681640625, 0.0289306640625, 0.00103759765625, -0.006561279296875, -0.0260009765625, 0.01214599609375, 0.0281982421875, -0.0233154296875, -0.0001659393310546875, 0.00946044921875, -0.0034942626953125, -0.006378173828125, -0.012939453125, ...	[ 6, 4, 7, 758, 4283, 194, 104508, 6447, 40285, 26583, 232, 910, 10700, 2424, 28388, 966, 1019, 22796, 1174, 363, 19236, 30426, 1444, 617, 88142, 248, 1639, 1657, 3355, 55105, 27112, 661, 180726, 57095, 50258, 18, 6423, 57626, 71928, 15, ...	[ 0.094970703125, 0.05377197265625, 0.1090087890625, 0.1177978515625, 0.238037109375, 0.044036865234375, 0.22607421875, 0.05389404296875, 0.080078125, 0.1968994140625, 0.09527587890625, 0.1102294921875, 0.1724853515625, 0.0858154296875, 0.1849365234375, 0.04107666015625, 0.121826171875...	embed
35704143_c0	35704143	prolog	0	Title: Just can't import files to my Racket program Problem title: Just can't import files to my Racket program Tags: racket, scheme, prolog Problem: Just can't import files to my Racket program One in two files I try to import to my program doesn't work out. I know the programs have to be in the same folder ...	Just can't import files to my Racket program Just can't import files to my Racket program racket scheme prolog files Just Racket se3-bib prologInScheme.rkt prologInScheme.rkt:19:3 Users Lidiya AppData Roaming Documents Mathe WS1516 SE3 Just can't import files to my Racket program One in two files I try to imp...	[ 0.0035858154296875, 0.0172119140625, -0.0174560546875, 0.0284423828125, -0.025634765625, 0.017822265625, 0.00157928466796875, -0.0179443359375, -0.007476806640625, -0.042724609375, -0.0014495849609375, -0.0118408203125, -0.0091552734375, 0.00070953369140625, 0.013671875, -0.02661132812...	[ 9563, 831, 3768, 18, 24927, 102158, 47, 759, 2552, 27853, 1528, 673, 150370, 502, 4867, 40, 27495, 82095, 25452, 12549, 363, 53400, 1261, 49778, 5659, 137989, 2777, 302, 43101, 123426, 52143, 1837, 2485, 6755, 6626, 9790, 4488, 1810, 103391...	[ 0.0496826171875, 0.1033935546875, 0.0347900390625, 0.0814208984375, 0.28466796875, 0.2222900390625, 0.1395263671875, 0.07220458984375, 0.1485595703125, 0.2220458984375, 0.18310546875, 0.1180419921875, 0.134765625, 0.130615234375, 0.21728515625, 0.06353759765625, 0.11767578125, 0.14...	embed
67149206_c0	67149206	prolog	0	Title: Prolog: maplist (Vars in 1..9) on every elements except for the first row and first column in a matrix. Do not want two predicates Problem title: Prolog: maplist (Vars in 1..9) on every elements except for the first row and first column in a matrix. Do not want two predicates Tags: prolog Problem: Prolog: maplis...	Prolog: maplist (Vars in 1..9) on every elements except for the first row and first column in a matrix. Do not want two predicates Prolog: maplist (Vars in 1..9) on every elements except for the first row and first column in a matrix. Do not want two predicates prolog Prolog Vars ____ single_digit _ColHd Rows single_di...	[ -0.000232696533203125, 0.00433349609375, -0.00933837890625, -0.0004425048828125, -0.0267333984375, 0.027099609375, -0.0062255859375, 0.024658203125, 0.006744384765625, -0.032958984375, -0.010986328125, 0.0036163330078125, -0.0115966796875, -0.001708984375, -0.0181884765625, -0.00282287...	[ 1250, 4867, 22288, 6562, 81827, 615, 1126, 98, 11907, 80854, 40494, 5117, 15555, 3365, 316, 50944, 425, 3444, 6626, 1653, 2063, 136, 959, 502, 3323, 11001, 4803, 78457, 71, 96190, 217, 70870, 1636, 831, 678, 1639, 839, 218288, 4734, 1632,...	[ 0.20556640625, 0.257568359375, 0.19287109375, 0.2529296875, 0.19970703125, 0.0809326171875, 0.169921875, 0.038818359375, 0.0877685546875, 0.149169921875, 0.0823974609375, 0.0711669921875, 0.1436767578125, 0.0675048828125, 0.0931396484375, 0.182373046875, 0.0653076171875, 0.10504150...	embed
37007363_c0	37007363	prolog	0	Title: List - counting atoms related to their previous term Problem title: List - counting atoms related to their previous term Tags: prolog, list Problem: List - counting atoms related to their previous term I want to count the number of elements in a list which have a relation with the element following. The predicat...	List - counting atoms related to their previous term List - counting atoms related to their previous term prolog list List count_list Count Acc Acc1 List - counting atoms related to their previous term I want to count the number of elements in a list which have a relation with the element following. The predicate I hav...	[ 0.0032958984375, 0.02197265625, -0.005767822265625, 0.0137939453125, 0.00112152099609375, 0.00244140625, -0.009765625, 0.01141357421875, 0.01495361328125, -0.03173828125, 0.0052490234375, 0.0019989013671875, 0.0263671875, 0.01953125, 0.01123046875, 0.01043701171875, 0.004364013671875...	[ 32036, 54529, 214, 34627, 7, 62548, 47, 2363, 96362, 13579, 502, 4867, 5303, 6562, 108210, 29899, 418, 3444, 14012, 80854, 23, 41911, 678, 12830, 25632, 1653, 2063, 67, 43240, 17368, 183278, 1290, 77336, 158661, 2174, 30646, 29568, 27781, 1...	[ 0.2125244140625, 0.198974609375, 0.0655517578125, 0.210205078125, 0.03564453125, 0.169921875, 0.05096435546875, 0.0142669677734375, 0.10693359375, 0.1629638671875, 0.108642578125, 0.1392822265625, 0.2132568359375, 0.183837890625, 0.166259765625, 0.0933837890625, 0.044097900390625, ...	embed
33833593_c0	33833593	prolog	0	Title: Prolog length to initialize list adds new List to existing Lists Problem title: Prolog length to initialize list adds new List to existing Lists Tags: list, prolog Problem: Prolog length to initialize list adds new List to existing Lists puzzle(ListToAdd,ListToAdd1,Res,_,Carry) :- length(Res,ResultLength), lengt...	Prolog length to initialize list adds new List to existing Lists Prolog length to initialize list adds new List to existing Lists list prolog Prolog List Lists ListToAdd ListToAdd1 Res Carry ResultLength Query Before _5459 _5499 _5539 _5319 _5199 _5239 _5279 After _12043 _12107 _12171 _12235 Prolog length to initialize...	[ 0.0140380859375, 0.027099609375, 0.004974365234375, 0.01373291015625, -0.0164794921875, 0.005859375, 0.01300048828125, -0.0059814453125, 0.0205078125, -0.03076171875, 0.014404296875, -0.0118408203125, 0.006439208984375, 0.037109375, 0.0003185272216796875, -0.02001953125, 0.0186767578...	[ 1250, 4867, 140909, 47, 61475, 20650, 5303, 15190, 3525, 32036, 144573, 502, 7763, 4028, 418, 9624, 3980, 1294, 126684, 5267, 449, 927, 58836, 117371, 170290, 12338, 5046, 11663, 9323, 2947, 116518, 20840, 11548, 44141, 123439, 149265, 4527, ...	[ 0.1947021484375, 0.2425537109375, 0.2061767578125, 0.045013427734375, 0.1861572265625, 0.0703125, 0.2093505859375, 0.141357421875, 0.09765625, 0.1934814453125, 0.1495361328125, 0.09429931640625, 0.1116943359375, 0.1141357421875, 0.039886474609375, 0.131591796875, 0.1085205078125, 0...	embed
64831615_c1	64831615	prolog	1	atko's book, I need to arrange the "blocks" DOG CAT RAT , I just can't put CAT with/over RAT or vice versa, and DOG with/over CAT , or vice versa, and I can only pass block by block, one by one. I have 3 places, the result of the "ordered" list should be in place 3, something like this: R = (previously there are all th...	atko's book, I need to arrange the "blocks" DOG CAT RAT , I just can't put CAT with/over RAT or vice versa, and DOG with/over CAT , or vice versa, and I can only pass block by block, one by one. I have 3 places, the result of the "ordered" list should be in place 3, something like this: R = (previously there are all th...	[ 0.00015735626220703125, 0.00677490234375, 0.0086669921875, 0.0103759765625, 0.006988525390625, -0.01177978515625, -0.014892578125, -0.0028839111328125, 0.0240478515625, -0.0235595703125, 0.00921630859375, 0.0003986358642578125, -0.00726318359375, -0.01104736328125, -0.021484375, 0.0107...	[ 99, 265, 25, 7, 12877, 87, 3871, 137356, 81409, 6197, 724, 100632, 34918, 1660, 831, 18, 3884, 678, 5465, 22925, 105274, 4734, 27875, 46389, 390, 1632, 765, 138, 44677, 16750, 80596, 297, 5303, 5608, 3687, 627, 2203, 65572, 4460, 12540, ...	[ 0.052825927734375, 0.1812744140625, 0.0257568359375, 0.06201171875, 0.15283203125, 0.0214691162109375, 0.07421875, 0.243896484375, 0.2138671875, 0.1490478515625, 0.11083984375, 0.193603515625, 0.198486328125, 0.012359619140625, 0.08770751953125, 0.043487548828125, 0.06842041015625, ...	embed
7525972_c0	7525972	prolog	0	Title: Can't get minimize from CLPFD to work Problem title: Can't get minimize from CLPFD to work Tags: clpfd, constraint-programming, prolog Problem: Can't get minimize from CLPFD to work Me and a friend are writing a program which is supposed to solve a CLP problem. We want to use minimize to optimize the s...	Can't get minimize from CLPFD to work Can't get minimize from CLPFD to work clpfd constraint-programming prolog CLPFD Can gen_var N-1 nth1 Can't get minimize from CLPFD to work Me and a friend are writing a program which is supposed to solve a CLP problem. We want to use minimize to optimize the solution but ...	[ -0.002166748046875, 0.01104736328125, 0.017333984375, 0.00299072265625, -0.005889892578125, 0.004241943359375, 0.0074462890625, -0.00933837890625, 0.00885009765625, -0.031982421875, -0.01055908203125, -0.0054931640625, 0.00122833251953125, -0.007293701171875, 0.01556396484375, 0.009216...	[ 4171, 3768, 18, 2046, 881, 77651, 1295, 46323, 41265, 397, 47, 4488, 33139, 39557, 71, 2816, 4288, 28966, 502, 4867, 9226, 454, 1961, 541, 5759, 927, 418, 34391, 32562, 1528, 86869, 313, 37352, 2967, 4527, 15572, 20650, 29806, 23742, 1369...	[ 0.06787109375, 0.046234130859375, 0.075927734375, 0.07220458984375, 0.2252197265625, 0.275146484375, 0.12060546875, 0.145263671875, 0.14501953125, 0.2098388671875, 0.047271728515625, 0.14501953125, 0.08331298828125, 0.104248046875, 0.1312255859375, 0.13037109375, 0.04156494140625, ...	embed
55044140_c0	55044140	prolog	0	Title: how to set set_prolog_flag(stack_limit, 2_147_483_648). to double the limit using swipl prolog Problem title: how to set set_prolog_flag(stack_limit, 2_147_483_648). to double the limit using swipl prolog Tags: json, prolog, swi-prolog, xsd Problem: how to set set_prolog_flag(stack_limit, 2_147_483_648). to doub...	how to set set_prolog_flag(stack_limit, 2_147_483_648). to double the limit using swipl prolog how to set set_prolog_flag(stack_limit, 2_147_483_648). to double the limit using swipl prolog json prolog swi-prolog xsd swipl set_prolog_flag stack_limit xsd2json-master cli.pl proj_xsd p1_v1.xsd ERROR Stack Choice xsd2json...	[ 0.0098876953125, 0.015380859375, 0.006317138671875, -0.003021240234375, -0.000591278076171875, -0.01397705078125, -0.0185546875, 0.0087890625, 0.00982666015625, -0.017822265625, 0.03662109375, 0.0123291015625, 0.003021240234375, -0.033935546875, 0.038330078125, 0.01434326171875, 0.01...	[ 3642, 5423, 3454, 4867, 190872, 590, 2594, 93343, 128497, 161382, 202400, 41929, 17475, 2452, 2424, 502, 116, 1647, 1681, 1022, 71, 177261, 170, 47327, 95701, 151206, 6512, 181948, 304, 7612, 140909, 3671, 402, 196352, 157, 341, 34926, 11675,...	[ 0.009246826171875, 0.159423828125, 0.16259765625, 0.2227783203125, 0.225830078125, 0.095703125, 0.0892333984375, 0.236328125, 0.1461181640625, 0.157470703125, 0.17333984375, 0.1490478515625, 0.212158203125, 0.1339111328125, 0.148193359375, 0.1182861328125, 0.014892578125, 0.0541076...	embed
59882857_c0	59882857	prolog	0	Title: Unary and binary arithmetic operations in Prolog Problem title: Unary and binary arithmetic operations in Prolog Tags: binary, prolog, successor-arithmetics Problem: Unary and binary arithmetic operations in Prolog I am trying to do unary and binary arithmetic operations in Prolog. unary numbers are defined as b...	Unary and binary arithmetic operations in Prolog Unary and binary arithmetic operations in Prolog binary prolog successor-arithmetics Unary Prolog Result Res NewRes Unary and binary arithmetic operations in Prolog I am trying to do unary and binary arithmetic operations in Prolog. unary numbers are defined as bot=0 and...	[ 0.0069580078125, -0.00159454345703125, 0.00872802734375, 0.0147705078125, -0.0036163330078125, -0.01513671875, 0.005218505859375, 0.00384521484375, 0.01513671875, 0.00457763671875, -0.006134033203125, -0.006011962890625, -0.006866455078125, 0.003387451171875, 0.01409912109375, 0.007324...	[ 4228, 1294, 136, 2394, 6635, 8962, 282, 41018, 1250, 4867, 187, 23, 502, 39457, 42, 126684, 9624, 2356, 4332, 31577, 220, 101935, 61924, 237, 13820, 145407, 91, 1542, 21748, 138, 83, 9190, 33636, 36549, 567, 180, 153939, 45234, 1632, 1971...	[ 0.173583984375, 0.183349609375, 0.048126220703125, 0.19580078125, 0.1346435546875, 0.138916015625, 0.06671142578125, 0.1552734375, 0.1549072265625, 0.25439453125, 0.0162811279296875, 0.00921630859375, 0.0999755859375, 0.109375, 0.0220184326171875, 0.1553955078125, 0.0849609375, 0.0...	embed
29444527_c0	29444527	prolog	0	Title: Redundant answers of reified predicate variant of append/3 Problem title: Redundant answers of reified predicate variant of append/3 Tags: list, reification, prolog, logical-purity Problem: Redundant answers of reified predicate variant of append/3 I wanted to offer a logically pure solution to some other recent...	Redundant answers of reified predicate variant of append/3 Redundant answers of reified predicate variant of append/3 list reification prolog logical-purity Redundant if_ ZZs prolog:dif Redundant answers of reified predicate variant of append/3 I wanted to offer a logically pure solution to some other recent problem in...	[ -0.01214599609375, 0.0033416748046875, 0.0216064453125, 0.0021209716796875, 0.0059814453125, -0.007049560546875, 0.01019287109375, 0.0230712890625, 0.003021240234375, -0.0091552734375, 0.010009765625, 0.022705078125, -0.013427734375, 0.0211181640625, 0.0208740234375, 0.02734375, 0.00...	[ 6096, 35405, 18, 35166, 456, 47314, 1653, 2063, 20117, 114689, 71, 18113, 5303, 41274, 502, 4867, 62775, 4717, 2174, 76362, 428, 420, 67, 12684, 34166, 29806, 2967, 4738, 29479, 1052, 17357, 35509, 1636, 136, 78690, 8710, 1250, 69941, 345, ...	[ 0.0733642578125, 0.208251953125, 0.0163726806640625, 0.1591796875, 0.0938720703125, 0.17236328125, 0.1253662109375, 0.17236328125, 0.246337890625, 0.1507568359375, 0.07415771484375, 0.239990234375, 0.1025390625, 0.13134765625, 0.08935546875, 0.1595458984375, 0.0703125, 0.0885009765...	embed
61399656_c0	61399656	prolog	0	Title: Trying to Implement a Split Predicate in Prolog Problem title: Trying to Implement a Split Predicate in Prolog Tags: prolog, list, split, predicate Problem: Trying to Implement a Split Predicate in Prolog I am trying to implement a partition predicate in Prolog that splits a list into its two halves, a Prefix an...	Trying to Implement a Split Predicate in Prolog Trying to Implement a Split Predicate in Prolog prolog list split predicate Trying Implement Split Predicate Prolog Prefix Plen Slen Pre Suff Type Trying to Implement a Split Predicate in Prolog I am trying to implement a partition predicate in Prolog that splits a list i...	[ -0.00579833984375, 0.01007080078125, 0.0005645751953125, -0.003143310546875, -0.0272216796875, -0.0037384033203125, -0.004730224609375, -0.0084228515625, 0.00762939453125, 0.0250244140625, -0.00080108642578125, -0.007293701171875, -0.0150146484375, -0.01513671875, 0.01190185546875, 0.0...	[ 40858, 153941, 46474, 7145, 2063, 67, 1250, 4867, 23, 502, 5303, 65450, 1653, 1914, 55923, 19434, 1977, 21493, 60457, 31577, 29479, 2878, 1363, 6626, 106706, 142830, 5701, 140909, 183114, 136, 133784, 31195, 61924, 339, 159, 841, 436, 1556, ...	[ 0.109130859375, 0.1494140625, 0.216064453125, 0.15380859375, 0.1884765625, 0.07025146484375, 0.1424560546875, 0.207763671875, 0.002166748046875, 0.09771728515625, 0.14306640625, 0.193603515625, 0.13916015625, 0.0987548828125, 0.1712646484375, 0.103759765625, 0.1466064453125, 0.1541...	embed
70525199_c0	70525199	prolog	0	Title: Is there a better way for making a list of ancestors in this program? Problem title: Is there a better way for making a list of ancestors in this program? Tags: prolog Problem: Is there a better way for making a list of ancestors in this program? same_gender_parent(ID, L) :- person(ID, _, _, P, _, _, _), member(...	Is there a better way for making a list of ancestors in this program? Is there a better way for making a list of ancestors in this program? prolog same_gender_parent Parent week_diff Is there a better way for making a list of ancestors in this program? In the code above, I have made it so that it takes a person(ID, nam...	[ 0.006439208984375, -0.00836181640625, 0.01129150390625, 0.002655029296875, -0.0299072265625, 0.01409912109375, -0.033447265625, 0.018798828125, 0.000028252601623535156, -0.059814453125, 0.0133056640625, -0.006195068359375, -0.004241943359375, 0.0034942626953125, 0.006072998046875, 0.01...	[ 11522, 3917, 20662, 10, 5303, 111, 60502, 22230, 903, 1528, 502, 4867, 5701, 23200, 99547, 170918, 5895, 152462, 18151, 7228, 51776, 3445, 7146, 9351, 127501, 5622, 127319, 38043, 12765, 2174, 11338, 32786, 14449, 49129, 304, 237052, 3129, 23...	[ 0.12109375, 0.075439453125, 0.126708984375, 0.061431884765625, 0.201416015625, 0.0301361083984375, 0.1964111328125, 0.1949462890625, 0.021209716796875, 0.1661376953125, 0.118896484375, 0.177490234375, 0.167236328125, 0.14306640625, 0.1671142578125, 0.1629638671875, 0.1961669921875, ...	embed
43659631_c0	43659631	prolog	0	Title: Comparing more than 2 lists' elements in prolog to find if exactly two elements are the same Problem title: Comparing more than 2 lists' elements in prolog to find if exactly two elements are the same Tags: prolog Problem: Comparing more than 2 lists' elements in prolog to find if exactly two elements ...	Comparing more than 2 lists' elements in prolog to find if exactly two elements are the same Comparing more than 2 lists' elements in prolog to find if exactly two elements are the same prolog Comparing _Name _Surname _Car _Color customer1 customer2 customer3 customer4 result:-customer1 Comparing more than 2 ...	[ -0.0007476806640625, -0.0030059814453125, -0.004608154296875, -0.00213623046875, 0.003143310546875, 0.0205078125, -0.005126953125, 0.01251220703125, 0.0269775390625, -0.003875732421875, -0.00689697265625, 0.02880859375, 0.025146484375, -0.00115203857421875, -0.0067138671875, -0.0015258...	[ 113307, 1286, 3501, 116, 5303, 7, 80854, 502, 4867, 7413, 2174, 66161, 6626, 621, 5701, 163612, 84041, 11627, 21851, 1484, 43373, 304, 363, 617, 5928, 33636, 2258, 8796, 134855, 3714, 831, 12765, 23, 110, 59463, 765, 10576, 12638, 12921, ...	[ 0.18701171875, 0.1251220703125, 0.08953857421875, 0.146728515625, 0.2384033203125, 0.00933837890625, 0.1683349609375, 0.154296875, 0.193603515625, 0.0880126953125, 0.06329345703125, 0.1212158203125, 0.094482421875, 0.07025146484375, 0.1949462890625, 0.0704345703125, 0.040283203125, ...	embed
14044146_c0	14044146	prolog	0	Title: Checking List in Prolog Problem title: Checking List in Prolog Tags: prolog Problem: Checking List in Prolog I'm trying to do a schedule that has constraints in Prolog. Scheduling will be based on two constraints. The courses of the same semester and the courses taught by the same instructor cannot be scheduled ...	Checking List in Prolog Checking List in Prolog prolog Checking List Prolog ceng123 cse111 cse112 cse113 cse114 cse115 cse116 cse117 cse118 Course CourseTail Day Slot ScheduleTail Course2 Day2 Slot2 Tail Semester1 Semester2 syntax_error user_input:1 char:4 read_term Checking List in Prolog I'm trying to do a schedule t...	[ -0.007171630859375, 0.005340576171875, 0.0111083984375, 0.015869140625, -0.03515625, -0.0247802734375, -0.0279541015625, 0.0111083984375, 0.006317138671875, -0.02099609375, -0.0008392333984375, -0.01220703125, -0.00299072265625, -0.0023040771484375, -0.006805419921875, 0.00665283203125...	[ 38679, 214, 32036, 23, 1250, 4867, 502, 405, 449, 48636, 184, 97024, 88438, 116597, 129150, 103928, 120620, 115250, 116329, 154162, 9874, 379, 10013, 69623, 230074, 304, 1218, 162356, 86531, 188800, 38937, 21441, 12301, 32166, 31577, 80889, 158...	[ 0.2161865234375, 0.125732421875, 0.2020263671875, 0.03729248046875, 0.15869140625, 0.2470703125, 0.1007080078125, 0.02874755859375, 0.07080078125, 0.1671142578125, 0.047393798828125, 0.09765625, 0.06329345703125, 0.050537109375, 0.03070068359375, 0.00665283203125, 0.0163421630859375,...	embed
40966138_c0	40966138	prolog	0	Title: SWI-prolog same generation Problem title: SWI-prolog same generation Tags: prolog, family-tree Problem: SWI-prolog same generation I have some facts and rules that I'm trying to use that when I pass a query it says if the two variables are of the same generation (either siblings or cousins). %mother/father DB mo...	SWI-prolog same generation SWI-prolog same generation prolog family-tree SWI-prolog Parent Defines same_generation SWI-prolog same generation I have some facts and rules that I'm trying to use that when I pass a query it says if the two variables are of the same generation (either siblings or cousins). Unfortunately th...	[ 0.01434326171875, 0.0294189453125, -0.00872802734375, -0.0036773681640625, -0.0247802734375, -0.0017242431640625, -0.017822265625, -0.0054931640625, 0.005706787109375, -0.038818359375, 0.0111083984375, -0.018798828125, -0.012451171875, 0.0120849609375, -0.0023956298828125, -0.009338378...	[ 159, 38969, 3454, 4867, 5701, 58093, 502, 14449, 62600, 170918, 85535, 48281, 15824, 91736, 31577, 4527, 27875, 41, 1294, 17378, 2174, 6626, 77336, 621, 111, 78, 79298, 193429, 185397, 2967, 3034, 29041, 136, 49129, 1119, 40175, 1363, 176769,...	[ 0.058837890625, 0.204345703125, 0.1195068359375, 0.1954345703125, 0.1639404296875, 0.243408203125, 0.1102294921875, 0.1014404296875, 0.209716796875, 0.176513671875, 0.1505126953125, 0.201171875, 0.052032470703125, 0.07391357421875, 0.005157470703125, 0.0182647705078125, 0.09118652343...	embed
16245945_c0	16245945	prolog	0	Title: Avoiding cycles in directed graph Problem title: Avoiding cycles in directed graph Tags: prolog Problem: Avoiding cycles in directed graph I am writing a simple program in SWI-Prolog to run through a directed graph, from one node to the next. I'm having trouble avoiding cycles though and would like some help. Ea...	Avoiding cycles in directed graph Avoiding cycles in directed graph prolog Avoiding Start End Route Cost Next FirstCost StayTime NewRoute SecondCost Routing Avoiding cycles in directed graph I am writing a simple program in SWI-Prolog to run through a directed graph, from one node to the next. I'm having trouble avoidi...	[ 0.0157470703125, 0.0128173828125, 0.0177001953125, 0.0128173828125, 0.003387451171875, -0.01190185546875, -0.0191650390625, 0.00592041015625, 0.01495361328125, -0.07470703125, -0.00144195556640625, -0.00141143798828125, -0.0233154296875, 0.0234375, 0.0206298828125, 0.02490234375, -0....	[ 84361, 86675, 105823, 7, 23, 8951, 297, 41382, 502, 4867, 13794, 18878, 106015, 63099, 4997, 23972, 441, 5510, 140682, 70059, 12724, 6743, 77648, 56709, 32562, 8781, 1528, 159, 38969, 10752, 11675, 110, 11737, 63134, 71864, 4358, 98423, 12130...	[ 0.177978515625, 0.05914306640625, 0.254638671875, 0.1007080078125, 0.01910400390625, 0.1878662109375, 0.06256103515625, 0.2139892578125, 0.13916015625, 0.1947021484375, 0.048614501953125, 0.093017578125, 0.135009765625, 0.144287109375, 0.0386962890625, 0.0128173828125, 0.066284179687...	embed
36452727_c0	36452727	prolog	0	Title: Source of pure prolog small programs Problem title: Source of pure prolog small programs Tags: logic, prolog, logical-purity Problem: Source of pure prolog small programs The question: is there a place with some programs that I can check out? I'm talking rosetta code style, but I went there and saw that almost e...	Source of pure prolog small programs Source of pure prolog small programs logic prolog logical-purity Source Source of pure prolog small programs The question: is there a place with some programs that I can check out? I'm talking rosetta code style, but I went there and saw that almost every program is solved with non ...	[ 0.0177001953125, 0.02392578125, 0.01031494140625, -0.00390625, -0.0220947265625, 0.031982421875, 0.00170135498046875, -0.003021240234375, 0.01348876953125, -0.05126953125, 0.000446319580078125, -0.00933837890625, -0.029296875, 0.002655029296875, 0.0189208984375, 0.00022411346435546875,...	[ 77641, 111, 34166, 502, 4867, 19336, 103391, 62775, 289, 4717, 2481, 9655, 2685, 3687, 3060, 87, 831, 12765, 1810, 56661, 49175, 2310, 18151, 20623, 4, 136, 24124, 39555, 11907, 1528, 86869, 71, 351, 6002, 86531, 214, 59226, 15744, 450, 1...	[ 0.259521484375, 0.092529296875, 0.2459716796875, 0.193359375, 0.2802734375, 0.217529296875, 0.222900390625, 0.1885986328125, 0.09912109375, 0.16162109375, 0.1083984375, 0.028717041015625, 0.0188446044921875, 0.1328125, 0.0457763671875, 0.00958251953125, 0.05889892578125, 0.16003417...	embed
69988736_c0	69988736	prolog	0	Title: Prolog, a list of the most common list items Problem title: Prolog, a list of the most common list items Tags: prolog Problem: Prolog, a list of the most common list items Write a predicate that forms a list of the most common list items. The list is entered from the keyboard while the predicate is running. Do n...	Prolog, a list of the most common list items Prolog, a list of the most common list items prolog Prolog List bubble_sort SList ResList InputList SortList List1 Prolog, a list of the most common list items Write a predicate that forms a list of the most common list items. The list is entered from the keyboard while the ...	[ 0.01434326171875, -0.005126953125, 0.006439208984375, -0.0164794921875, -0.0086669921875, 0.004119873046875, -0.0142822265625, 0.0035400390625, 0.00823974609375, -0.007080078125, 0.00152587890625, -0.01202392578125, -0.01171875, -0.001678466796875, 0.0067138671875, -0.0179443359375, ...	[ 1250, 4867, 5303, 70, 2684, 39210, 55769, 10, 502, 32036, 373, 73163, 62351, 159, 154663, 9624, 7077, 53666, 418, 601, 18781, 1653, 2063, 67, 3173, 30957, 1295, 149186, 12960, 51042, 959, 4527, 88303, 38132, 33938, 136, 12096, 2389, 363, ...	[ 0.1966552734375, 0.299072265625, 0.2152099609375, 0.003997802734375, 0.133544921875, 0.211181640625, 0.1904296875, 0.011993408203125, 0.1549072265625, 0.1619873046875, 0.0202789306640625, 0.1688232421875, 0.196044921875, 0.005950927734375, 0.1851806640625, 0.02850341796875, 0.0200805...	embed
12071959_c0	12071959	prolog	0	Title: Extension to CFG, what is it? Problem title: Extension to CFG, what is it? Tags: context-free-grammar, dcg-semicontext, dcg, iso-prolog, prolog Problem: Extension to CFG, what is it? Consider the following extension to context-free grammars that permits rules to have in the left-hand side, one (or more) terminal...	Extension to CFG, what is it? Extension to CFG, what is it? context-free-grammar dcg-semicontext dcg iso-prolog prolog Extension CFG Extension to CFG, what is it? Consider the following extension to context-free grammars that permits rules to have in the left-hand side, one (or more) terminal on the right side of the n...	[ 0.030517578125, 0.0120849609375, 0.031494140625, 0.03369140625, -0.004608154296875, 0.015869140625, -0.014404296875, -0.015380859375, 0.01116943359375, 0.0028533935546875, -0.003509521484375, 0.0011138916015625, -0.01263427734375, 0.0079345703125, 0.006072998046875, -0.00390625, 0.01...	[ 224545, 47, 313, 123254, 2367, 83, 442, 43701, 32087, 107415, 147, 104, 238, 177, 84505, 2271, 22829, 13882, 3454, 4867, 502, 111938, 122092, 21816, 28897, 91736, 765, 25737, 12336, 5609, 1632, 1286, 33949, 7108, 351, 30524, 289, 111, 3173,...	[ 0.27783203125, 0.1702880859375, 0.0908203125, 0.272705078125, 0.1121826171875, 0.10498046875, 0.1488037109375, 0.1796875, 0.1705322265625, 0.11962890625, 0.0711669921875, 0.013336181640625, 0.040924072265625, 0.09967041015625, 0.085693359375, 0.056488037109375, 0.1124267578125, 0.0...	embed
46446407_c1	46446407	prolog	1	,Ts0,Fs0,Feature). if_(If_1, Then_0, Else_0) :- call(If_1, T), ( T == true -> call(Then_0) ; T == false -> call(Else_0) ; nonvar(T) -> throw(error(type_error(boolean,T),_)) ; /* var(T) */ throw(error(instantiation_error,_)) ). bool01_t(1,true). bool01_t(0,false). =(X, Y, T) :- ( X == Y -> T = true ; X \= Y -> T = false...	,Ts0,Fs0,Feature). if_(If_1, Then_0, Else_0) :- call(If_1, T), ( T == true -> call(Then_0) ; T == false -> call(Else_0) ; nonvar(T) -> throw(error(type_error(boolean,T),_)) ; /* var(T) */ throw(error(instantiation_error,_)) ). bool01_t(1,true). bool01_t(0,false). =(X, Y, T) :- ( X == Y -> T = true ; X \= Y -> T = false...	[ -0.01116943359375, -0.005126953125, -0.0169677734375, -0.0208740234375, 0.0157470703125, -0.0234375, 0.016357421875, -0.000896453857421875, -0.01202392578125, 0.0189208984375, 0.0164794921875, 0.020263671875, 0, 0.038818359375, 0.00128936767578125, 0.00162506103515625, 0.002273559570...	[ 6, 4, 618, 7, 2389, 919, 30154, 11, 6644, 194, 2174, 454, 132, 91306, 115187, 47009, 540, 184, 77495, 15772, 11782, 384, 29568, 33079, 3957, 19, 69112, 98320, 7623, 351, 1961, 104250, 188800, 50986, 142484, 5073, 1639, 285, 143034, 14, ...	[ 0.0271148681640625, 0.05535888671875, 0.146484375, 0.03277587890625, 0.1898193359375, 0.05908203125, 0.107666015625, 0.0958251953125, 0.119873046875, 0.1168212890625, 0.19482421875, 0.1251220703125, 0.00982666015625, 0.1790771484375, 0.1611328125, 0.147216796875, 0.13232421875, 0.1...	embed
28102112_c0	28102112	prolog	0	Title: prolog function to infer new facts from data Problem title: prolog function to infer new facts from data Tags: nlp, prolog, machine-learning, logic, function Problem: prolog function to infer new facts from data I have a dataset containing "facts" recognizable to prolog, i.e.: 'be'('mr jiang', 'representative of...	prolog function to infer new facts from data prolog function to infer new facts from data nlp prolog machine-learning logic function data prolog function to infer new facts from data I have a dataset containing "facts" recognizable to prolog, i.e.: I want the system to recognize that 'mr jiang' is referenced in both of...	[ 0.031982421875, -0.00396728515625, 0.0020751953125, 0.03369140625, 0.0079345703125, 0.007476806640625, -0.00469970703125, 0.005615234375, 0.00714111328125, -0.0517578125, 0.00634765625, -0.005615234375, -0.024169921875, -0.027099609375, 0.00836181640625, 0.0028839111328125, 0.0206298...	[ 502, 4867, 32354, 47, 53498, 3525, 15824, 7, 1295, 2053, 653, 26775, 36279, 152538, 62775, 3509, 70541, 114700, 75530, 16523, 2886, 3444, 5426, 125296, 76492, 890, 1463, 91067, 15044, 25632, 5608, 16487, 44944, 16444, 234873, 5351, 88308, 577...	[ 0.2236328125, 0.275390625, 0.205078125, 0.06256103515625, 0.264404296875, 0.14404296875, 0.2120361328125, 0.044921875, 0.15869140625, 0.1866455078125, 0.0009765625, 0.1705322265625, 0.04217529296875, 0.11767578125, 0.08447265625, 0.129638671875, 0.026641845703125, 0.2047119140625, ...	embed
45910617_c0	45910617	prolog	0	Title: get sublist of all elements that create specific word prolog Problem title: get sublist of all elements that create specific word prolog Tags: prolog Problem: get sublist of all elements that create specific word prolog i want to get a sublist of all elements that assemble specific word for example for the call ...	get sublist of all elements that create specific word prolog get sublist of all elements that create specific word prolog prolog abc123 Results RSet Collect Set Order N-Result atom_chars Result _-W N1-W1 N2-_ N2-W2 get sublist of all elements that create specific word prolog i want to get a sublist of all elements that...	[ 0.010009765625, -0.01141357421875, -0.0003814697265625, 0.0135498046875, -0.0225830078125, -0.00811767578125, -0.004638671875, 0.01031494140625, 0.0224609375, -0.0130615234375, 0.0196533203125, 0.025634765625, 0.0030364990234375, -0.0233154296875, -0.003173828125, -0.0025634765625, 0...	[ 2046, 1614, 6562, 111, 756, 80854, 28282, 29458, 2565, 502, 4867, 1563, 48636, 146104, 126, 138521, 19943, 81206, 4332, 7, 7136, 34627, 9254, 126684, 1456, 18504, 304, 3444, 93457, 11782, 1528, 28412 ]	[ 0.07672119140625, 0.2210693359375, 0.209716796875, 0.002655029296875, 0.0721435546875, 0.1781005859375, 0.1204833984375, 0.1522216796875, 0.1348876953125, 0.1455078125, 0.19921875, 0.01947021484375, 0.1895751953125, 0.149169921875, 0.1236572265625, 0.13134765625, 0.096923828125, 0....	embed
27333727_c0	27333727	prolog	0	Title: How to make Prolog able to generate all possible solutions to a query Problem title: How to make Prolog able to generate all possible solutions to a query Tags: prolog Problem: How to make Prolog able to generate all possible solutions to a query I'd like to be able to generate all possible lists of elements, wi...	How to make Prolog able to generate all possible solutions to a query How to make Prolog able to generate all possible solutions to a query prolog How Prolog not_in How to make Prolog able to generate all possible solutions to a query I'd like to be able to generate all possible lists of elements, with an ‘and’ between...	[ 0.00640869140625, 0.025634765625, 0.01495361328125, 0.0033416748046875, -0.0194091796875, 0.013671875, -0.02001953125, -0.00836181640625, 0.02294921875, -0.046630859375, -0.01116943359375, -0.005279541015625, -0.008056640625, 0.01446533203125, 0.00469970703125, 0.0159912109375, 0.015...	[ 11249, 3249, 1250, 4867, 19048, 139392, 756, 7722, 51347, 47, 41, 1294, 502, 959, 73, 1884, 5303, 80854, 2940, 17721, 4568, 6626, 3638, 46876, 110, 171763, 107, 136, 22759, 83, 26785, 55547, 1632, 1029, 17262, 16487, 11001, 62766, 59121, ...	[ 0.08135986328125, 0.083251953125, 0.1966552734375, 0.271484375, 0.1119384765625, 0.2069091796875, 0.148681640625, 0.175048828125, 0.1883544921875, 0.050750732421875, 0.107177734375, 0.10345458984375, 0.1514892578125, 0.05230712890625, 0.0501708984375, 0.082763671875, 0.2054443359375,...	embed
77787718_c0	77787718	prolog	0	Title: How to identify valid bodies and convertible terms Problem title: How to identify valid bodies and convertible terms Tags: iso-prolog, prolog Problem: How to identify valid bodies and convertible terms is_convertible_term(T) should be true, if T can be converted to a valid body (7.6.2 of ISO/IEC 13211-1). Thus: ...	How to identify valid bodies and convertible terms How to identify valid bodies and convertible terms iso-prolog prolog How is_convertible_term is_body How to identify valid bodies and convertible terms is_convertible_term(T) should be true, if T can be converted to a valid body (7.6.2 of ISO/IEC 13211-1). Thus: This s...	[ 0.034912109375, 0.01043701171875, 0.0164794921875, 0.03515625, -0.026611328125, 0.010498046875, -0.0181884765625, -0.0048828125, 0.01708984375, -0.007110595703125, 0.012939453125, -0.0032501220703125, -0.01171875, 0.02734375, 0.01483154296875, -0.0040283203125, 0.024169921875, 0.01...	[ 11249, 135812, 35604, 337, 34204, 136, 166615, 2661, 69407, 13882, 3454, 4867, 502, 83, 2271, 41418, 32166, 37873, 47, 618, 5608, 29568, 2174, 384, 831, 117176, 14361, 178121, 17408, 126109, 59531, 1662, 110218, 59121, 23, 1250, 16610, 31943,...	[ 0.050079345703125, 0.2286376953125, 0.2486572265625, 0.1715087890625, 0.1737060546875, 0.08056640625, 0.2061767578125, 0.2169189453125, 0.23046875, 0.1331787109375, 0.143798828125, 0.205322265625, 0.1373291015625, 0.171142578125, 0.086181640625, 0.2064208984375, 0.2479248046875, 0....	embed
10231815_c1	10231815	prolog	1	called travel(valmont, losAngeles,X). There is a point during the trace where the correct path shows up, aside from the anonymous variable at the end: travel(valmont, metz, connected(metz, paris, connected(paris, losAngeles, _17))) but I don't actually know how to unify this with the variable X ! I can't really wrap m...	called travel(valmont, losAngeles,X). There is a point during the trace where the correct path shows up, aside from the anonymous variable at the end: travel(valmont, metz, connected(metz, paris, connected(paris, losAngeles, _17))) but I don't actually know how to unify this with the variable X ! I can't really wrap m...	[ 0.00128173828125, 0.017822265625, 0.00775146484375, 0.005767822265625, 0.01226806640625, 0.01287841796875, -0.00726318359375, -0.021240234375, 0.01226806640625, -0.052978515625, -0.0001068115234375, -0.0048828125, -0.031005859375, 0.006378173828125, -0.01409912109375, -0.012451171875, ...	[ 35839, 26983, 1405, 15477, 388, 159064, 90, 1542, 6275, 20271, 70, 144851, 26785, 60875, 45831, 1257, 52184, 77336, 3564, 435, 169, 162711, 1928, 366, 164, 24980, 2489, 32149, 18, 20653, 3714, 3642, 51, 40383, 903, 678, 1193, 711, 137565, ...	[ 0.1357421875, 0.2958984375, 0.1439208984375, 0.256591796875, 0.0736083984375, 0.1458740234375, 0.1416015625, 0.124267578125, 0.07421875, 0.058380126953125, 0.003204345703125, 0.21533203125, 0.1683349609375, 0.224853515625, 0.0745849609375, 0.069580078125, 0.1646728515625, 0.2435302...	embed
49554268_c0	49554268	prolog	0	Title: How to keep the pipe to another process opened Problem title: How to keep the pipe to another process opened Tags: swi-prolog, prolog Problem: How to keep the pipe to another process opened I am trying to talk with the bc instance through pipes , but with my code it runs the new instance every time. Is it possib...	How to keep the pipe to another process opened How to keep the pipe to another process opened swi-prolog prolog How use_module read_result Out Result send_command Command R.in flush_output R.out open_session process_create Pid dict_create pid:Pid in:In out:Out close_instance process_kill R.pid with_command How to keep ...	[ 0.0228271484375, 0.0115966796875, -0.0047607421875, -0.00750732421875, -0.01055908203125, -0.0081787109375, 0.0034027099609375, -0.0301513671875, 0.0157470703125, -0.0634765625, 0.012939453125, 0.031494140625, 0.004302978515625, 0.01904296875, 0.01263427734375, -0.0162353515625, 0.02...	[ 11249, 47, 13695, 137158, 15700, 9433, 142096, 70, 91, 2452, 3454, 4867, 502, 4527, 83279, 12301, 2109, 7136, 13538, 126684, 25379, 277, 12018, 123573, 627, 73, 14838, 1495, 6056, 9803, 169234, 7612, 532, 61669, 45226, 23, 4153, 1810, 79858...	[ 0.0750732421875, 0.173583984375, 0.2149658203125, 0.2486572265625, 0.163818359375, 0.189208984375, 0.22509765625, 0.01068115234375, 0.002593994140625, 0.1812744140625, 0.1185302734375, 0.1868896484375, 0.1083984375, 0.039886474609375, 0.0911865234375, 0.1099853515625, 0.0433349609375...	embed
35677482_c2	35677482	prolog	2	_de_san_juan,tepalcates,guelatao, peñon_viejo,acatitla,santa_marta,los_reyes,la_paz]). linea(b,[ciudad_azteca,plaza_aragon,olimpica,ecatepec,muzquiz, rio_de_los_remedios,impulsora,nezahualcoyotl,villa_de_aragon, bosque_de_aragon,deportivo_oceania,oceania,romero_rubio, Code signals: List, Prolog, salto_del_agua, isabel_...	_de_san_juan,tepalcates,guelatao, peñon_viejo,acatitla,santa_marta,los_reyes,la_paz]). linea(b,[ciudad_azteca,plaza_aragon,olimpica,ecatepec,muzquiz, rio_de_los_remedios,impulsora,nezahualcoyotl,villa_de_aragon, bosque_de_aragon,deportivo_oceania,oceania,romero_rubio, Code signals: List, Prolog, salto_del_agua, isabel_...	[ -0.01080322265625, -0.01226806640625, 0.0079345703125, 0.0272216796875, -0.0037078857421875, 0.005767822265625, -0.01312255859375, 0.000732421875, 0.00836181640625, -0.01214599609375, -0.00732421875, -0.00193023681640625, 0.0050048828125, 0.009033203125, -0.01068115234375, -0.008361816...	[ 101, 112, 1462, 461, 66, 4, 67, 5007, 33478, 7, 6261, 20506, 31, 280, 12485, 19, 513, 9613, 143, 116357, 1727, 102, 36840, 90, 42796, 268, 194, 42592, 132, 275, 13359, 12409, 1828, 408, 128488, 11, 75334, 110132, 2063, 47107, 3181, 16...	[ 0.051025390625, 0.16064453125, 0.0931396484375, 0.1932373046875, 0.0753173828125, 0.0279693603515625, 0.12060546875, 0.057830810546875, 0.1302490234375, 0.0511474609375, 0.0196990966796875, 0.0899658203125, 0.0743408203125, 0.007781982421875, 0.064208984375, 0.040374755859375, 0.0070...	embed
36521634_c1	36521634	prolog	1	ayonaise,protein). char(mayonaise,sour). char(mayonaise,sweet). %! ingredient layer1 ingredient(pork). ingredient(beef). ingredient(chicken). ingredient(duck). ingredient(herbs). ingredient(meat). ingredient(shrimp). ingredient(bun). ingredient(coleslaw). ingredient(lettuce). ingredient(kaiserroll). ingredient(onion). ...	ayonaise,protein). char(mayonaise,sour). char(mayonaise,sweet). %! ingredient layer1 ingredient(pork). ingredient(beef). ingredient(chicken). ingredient(duck). ingredient(herbs). ingredient(meat). ingredient(shrimp). ingredient(bun). ingredient(coleslaw). ingredient(lettuce). ingredient(kaiserroll). ingredient(onion). ...	[ -0.01556396484375, -0.00157928466796875, 0.0162353515625, 0.0238037109375, -0.00970458984375, 0.02490234375, -0.0045166015625, -0.0103759765625, -0.00116729736328125, -0.023193359375, 0.003997802734375, 0.01263427734375, -0.005401611328125, 0.0189208984375, -0.006317138671875, -0.01519...	[ 537, 31, 132068, 4, 80000, 73, 194, 21441, 132, 192, 1410, 34639, 7, 1177, 126, 1745, 38, 186227, 135355, 418, 4680, 92, 372, 4240, 134342, 33, 693, 2594, 3334, 16145, 282, 257, 32298, 2676, 17643, 46813, 19729, 37356, 49036, 33464, 56,...	[ 0.2313232421875, 0.204345703125, 0.326171875, 0.0269622802734375, 0.1925048828125, 0.1614990234375, 0.081298828125, 0.1956787109375, 0.041046142578125, 0.1331787109375, 0.2205810546875, 0.181640625, 0.079345703125, 0.114501953125, 0.154541015625, 0.1229248046875, 0.1004638671875, 0...	embed
8712804_c0	8712804	prolog	0	Title: Prolog - dividing a list in N parts Problem title: Prolog - dividing a list in N parts Tags: list, prolog, divide, dcg Problem: Prolog - dividing a list in N parts I'm trying to write a predicate that divides a list into N parts. This is what I have so far. partition(1, List, List). partition(N, List, [X,Y\|Rest]...	Prolog - dividing a list in N parts Prolog - dividing a list in N parts list prolog divide dcg Prolog List Rest NextToChop Choose NewN N-1 Length You Deel1 Deel2 Prolog - dividing a list in N parts I'm trying to write a predicate that divides a list into N parts. This is what I have so far. The idea is to keep chopping...	[ -0.00970458984375, 0.00049591064453125, 0.0142822265625, -0.00543212890625, -0.01226806640625, 0.01202392578125, -0.016845703125, -0.01953125, 0.0086669921875, -0.0089111328125, -0.00927734375, 0.0137939453125, -0.00173187255859375, 0.010498046875, 0.0096435546875, -0.0034637451171875,...	[ 1250, 4867, 61998, 449, 5303, 23, 541, 63920, 502, 101637, 238, 177, 32036, 49756, 4997, 7763, 58052, 211525, 2356, 839, 5759, 77554, 2583, 50275, 418, 304, 31577, 33022, 1653, 2063, 67, 3934, 2060, 6528, 13695, 681, 26783, 6626, 3789, 24...	[ 0.1737060546875, 0.23681640625, 0.2005615234375, 0.05804443359375, 0.21435546875, 0.0968017578125, 0.1993408203125, 0.2320556640625, 0.1407470703125, 0.1929931640625, 0.019683837890625, 0.0479736328125, 0.1568603515625, 0.1314697265625, 0.0977783203125, 0.054534912109375, 0.152954101...	embed
54984486_c1	54984486	prolog	1	list. count_dcg(N,N) --> []. % single item in list % No semicontext (push back) needed because only one item removed from list. count_dcg(N0,N) --> [_], \+ [_], { N is N0 + 1 }. % Semicontext (push back) needed because two items removed from list. % Need second item to stay on list. count_dcg(N,N),[C] --> [C,C]. % Sem...	list. count_dcg(N,N) --> []. % single item in list % No semicontext (push back) needed because only one item removed from list. count_dcg(N0,N) --> [_], \+ [_], { N is N0 + 1 }. % Semicontext (push back) needed because two items removed from list. % Need second item to stay on list. count_dcg(N,N),[C] --> [C,C]. % Sem...	[ -0.00168609619140625, 0.01251220703125, -0.00115966796875, 0.0137939453125, 0.0196533203125, 0.005035400390625, -0.01141357421875, -0.01190185546875, 0.0179443359375, -0.02001953125, -0.0091552734375, -0.013671875, -0.0020751953125, 0.01904296875, 0.01611328125, 0.0068359375, -0.0092...	[ 5303, 5, 54529, 71, 238, 177, 839, 4, 129908, 1745, 11001, 35735, 23, 438, 36137, 2271, 22829, 7332, 127, 4420, 44841, 6637, 4734, 1632, 184750, 1295, 454, 2389, 1328, 541, 83, 997, 106, 84420, 6626, 55769, 52889, 17932, 24765, 98, 866,...	[ 0.2279052734375, 0.004119873046875, 0.2276611328125, 0.010528564453125, 0.051300048828125, 0.1507568359375, 0.1448974609375, 0.0494384765625, 0.046417236328125, 0.06671142578125, 0.158447265625, 0.1475830078125, 0.05316162109375, 0.047698974609375, 0.106201171875, 0.07257080078125, 0...	embed
23862705_c0	23862705	prolog	0	Title: Understanding recursive rules in Prolog Problem title: Understanding recursive rules in Prolog Tags: prolog, recursion Problem: Understanding recursive rules in Prolog I am starting Prolog, courtesy of Seven Languages in Seven Weeks , and struggling a bit with understanding how Prolog is handling recursion. Give...	Understanding recursive rules in Prolog Understanding recursive rules in Prolog prolog recursion Understanding Prolog Total Head Tail Sum Understanding recursive rules in Prolog I am starting Prolog, courtesy of Seven Languages in Seven Weeks , and struggling a bit with understanding how Prolog is handling recursion. G...	[ 0.01226806640625, 0.02685546875, 0.012939453125, 0.026611328125, -0.0045166015625, 0.011962890625, -0.0040283203125, 0.006378173828125, 0.0191650390625, -0.0152587890625, 0.01806640625, -0.033935546875, -0.014404296875, -0.00341796875, 0.030029296875, 0.012451171875, 0.03173828125, ...	[ 9626, 144057, 195625, 5844, 91736, 1250, 4867, 502, 1830, 33867, 44816, 1218, 379, 36335, 132556, 83658, 58417, 237875, 100094, 45064, 18151, 28219, 10176, 80756, 1257, 166996, 449, 11782, 7, 10554, 114453, 110, 143726, 65395, 19, 28032, 96276,...	[ 0.059295654296875, 0.04742431640625, 0.2191162109375, 0.1380615234375, 0.1875, 0.1519775390625, 0.2369384765625, 0.095947265625, 0.1114501953125, 0.115966796875, 0.1746826171875, 0.138671875, 0.10357666015625, 0.190673828125, 0.0322265625, 0.1273193359375, 0.083251953125, 0.0045166...	embed
65532899_c0	65532899	prolog	0	Title: Proper unify_with_occurs_check/2 in SWI-Prolog? Problem title: Proper unify_with_occurs_check/2 in SWI-Prolog? Tags: swi-prolog, logical-purity, occurs-check, prolog Problem: Proper unify_with_occurs_check/2 in SWI-Prolog? s2 :- Q=[[lambda,symbol(_3026),[cons,[quote,_3434], [quote,_3514]]],[quote,_3206]], P=[_34...	Proper unify_with_occurs_check/2 in SWI-Prolog? Proper unify_with_occurs_check/2 in SWI-Prolog? swi-prolog logical-purity occurs-check prolog Proper unify_with_occurs_check SWI-Prolog _3026 _3434 _3514 _3206 Proper unify_with_occurs_check/2 in SWI-Prolog? Got this strange behaviour. I was running these test cases: Now ...	[ 0.009521484375, 0.01507568359375, -0.0030364990234375, 0.0012969970703125, -0.01361083984375, -0.0279541015625, -0.00946044921875, 0.01275634765625, 0.00469970703125, -0.007415771484375, 0.01214599609375, 0.019775390625, 0.01275634765625, -0.007720947265625, 0.01055908203125, 0.0040893...	[ 1250, 1264, 51, 40383, 76228, 6652, 48650, 78292, 12477, 159, 38969, 10752, 4867, 91, 2452, 3454, 62775, 4717, 2481, 74918, 502, 1197, 4046, 363, 152697, 5843, 2592, 139652, 903, 114453, 224833, 3034, 50218, 50339, 184345, 304, 44691, 6626, ...	[ 0.08831787109375, 0.1131591796875, 0.1607666015625, 0.1744384765625, 0.1260986328125, 0.0718994140625, 0.119140625, 0.2354736328125, 0.229248046875, 0.073974609375, 0.2210693359375, 0.12109375, 0.175537109375, 0.075439453125, 0.1451416015625, 0.07757568359375, 0.08544921875, 0.0865...	embed
29907900_c0	29907900	prolog	0	Title: In a List of Lists, Append all Lists together into one List Problem title: In a List of Lists, Append all Lists together into one List Tags: prolog Problem: In a List of Lists, Append all Lists together into one List I need to write a predicate partition/2 such that partition(L, P) is satisfied when the concaten...	In a List of Lists, Append all Lists together into one List In a List of Lists, Append all Lists together into one List prolog List Lists Append Partition Base XY1 In a List of Lists, Append all Lists together into one List I need to write a predicate partition/2 such that partition(L, P) is satisfied when the concaten...	[ -0.0093994140625, 0.017333984375, 0.006317138671875, -0.00177001953125, -0.02294921875, 0.00092315673828125, -0.01116943359375, -0.00390625, 0.0167236328125, 0.000762939453125, 0.0076904296875, -0.00146484375, 0.000415802001953125, -0.00732421875, -0.00823974609375, 0.00897216796875, ...	[ 360, 32036, 111, 5659, 3611, 756, 7, 25842, 3934, 1632, 502, 4867, 9148, 44978, 143907, 418, 3871, 33022, 1653, 2063, 2878, 1363, 12477, 866, 436, 214521, 158, 4460, 33, 11907, 5701, 5303, 339, 70541, 61799, 41, 175199, 105950, 18, 4488, ...	[ 0.010498046875, 0.262939453125, 0.08331298828125, 0.1146240234375, 0.1419677734375, 0.123291015625, 0.084228515625, 0.209228515625, 0.1068115234375, 0.1478271484375, 0.0911865234375, 0.12158203125, 0.129150390625, 0.1099853515625, 0.086181640625, 0.007659912109375, 0.041656494140625,...	embed
34891204_c0	34891204	prolog	0	Title: Fact appears only once in the Knowledge Base Problem title: Fact appears only once in the Knowledge Base Tags: prolog Problem: Fact appears only once in the Knowledge Base I have this KB (Knowledge Base): %artist(ArtistId, ArtistName, YearofDebut). %album(AlbumId, AlbumName, YearOfRelease, Artists). %song(AlbumI...	Fact appears only once in the Knowledge Base Fact appears only once in the Knowledge Base prolog Fact Knowledge Base ArtistId ArtistName YearofDebut AlbumId AlbumName YearOfRelease Artists Songname Duration MIEIC John Williams LEIC One Hit Wonder Reloaded Best Legacy Release Rap Indiana Jones Pop Harry Potter Rock Jaws...	[ 0.023193359375, 0.005401611328125, 0.008544921875, -0.0040283203125, 0.0023040771484375, 0.006866455078125, -0.000820159912109375, 0.01470947265625, 0.00162506103515625, -0.011962890625, -0.01177978515625, 0.0036468505859375, -0.011962890625, -0.00408935546875, -0.00244140625, 0.012084...	[ 132640, 135179, 4734, 24145, 23, 191428, 44978, 502, 4867, 69891, 163612, 42552, 4390, 8789, 37340, 132887, 133, 5986, 11627, 79843, 276, 20441, 16259, 4939, 40478, 17428, 6561, 43482, 76648, 853, 63033, 11345, 84671, 152590, 41474, 122069, 293...	[ 0.301513671875, 0.2332763671875, 0.19677734375, 0.27880859375, 0.1392822265625, 0.231689453125, 0.254638671875, 0.1524658203125, 0.2005615234375, 0.09552001953125, 0.0180206298828125, 0.1722412109375, 0.03094482421875, 0.1336669921875, 0.119384765625, 0.02960205078125, 0.015747070312...	embed
59520621_c1	59520621	prolog	1	I posted the same question on the SWI Prolog forum but did not get any responses. I am running SWI Prolog. % https://www.swi-prolog.org/pldoc/doc/_SWI_/library/clp/clpr.pl :-use_module(library(clpr)). % time is ordered precedes(1, 2). precedes(2, 3). % knowledge p(X1, T2, fire):- p(X2, T1, presenceOfFlammableMaterial)...	I posted the same question on the SWI Prolog forum but did not get any responses. I am running SWI Prolog. % https://www.swi-prolog.org/pldoc/doc/_SWI_/library/clp/clpr.pl :-use_module(library(clpr)). % time is ordered precedes(1, 2). precedes(2, 3). % knowledge p(X1, T2, fire):- p(X2, T1, presenceOfFlammableMaterial)...	[ 0.0164794921875, 0.01312255859375, 0.010986328125, 0.031982421875, 0.0030975341796875, 0.01165771484375, 0.034423828125, -0.017333984375, 0.0120849609375, -0.044189453125, 0.0091552734375, 0.0211181640625, -0.0037994384765625, -0.0078125, 0.017822265625, 0.007598876953125, 0.00256347...	[ 44183, 5701, 9655, 159, 38969, 1250, 4867, 4738, 959, 57553, 51042, 1745, 2452, 3454, 2424, 29713, 2844, 26775, 34937, 10287, 4032, 83279, 150, 1733, 12989, 107671, 4958, 90, 8439, 51359, 915, 1542, 418, 384, 304, 11476, 169424, 132887, 371...	[ 0.027801513671875, 0.0260162353515625, 0.03363037109375, 0.0692138671875, 0.23388671875, 0.148193359375, 0.208984375, 0.0455322265625, 0.04266357421875, 0.09075927734375, 0.1055908203125, 0.060516357421875, 0.208740234375, 0.08209228515625, 0.0162506103515625, 0.0921630859375, 0.0955...	embed
4747498_c0	4747498	prolog	0	Title: Tennis match scheduling Problem title: Tennis match scheduling Tags: prolog, scheduling, algorithm, clpfd Problem: Tennis match scheduling There are a limited number of players and a limited number of tennis courts. At each round, there can be at most as many matches as there are courts. Nobody plays 2 rounds wi...	Tennis match scheduling Tennis match scheduling prolog scheduling algorithm clpfd Tennis Tennis match scheduling There are a limited number of players and a limited number of tennis courts. At each round, there can be at most as many matches as there are courts. Nobody plays 2 rounds without a break. Everyone plays a m...	[ -0.00113677978515625, 0.02294921875, 0.0054931640625, 0.0216064453125, -0.01611328125, -0.0279541015625, -0.024658203125, 0.015869140625, -0.000926971435546875, -0.0191650390625, -0.004913330078125, -0.0103759765625, 0.01177978515625, 0.030517578125, 0.0020599365234375, 0.0159912109375...	[ 118843, 14858, 5094, 15246, 2069, 502, 4867, 234873, 39557, 71, 84046, 14012, 92865, 69686, 29685, 12638, 68807, 831, 2684, 237, 5941, 438, 37873, 11301, 116, 15490, 36356, 191096, 26548, 30309, 37076, 103687, 80889, 51776, 10846, 7722, 79986, ...	[ 0.255126953125, 0.1844482421875, 0.1793212890625, 0.2110595703125, 0.05682373046875, 0.1126708984375, 0.1981201171875, 0.2548828125, 0.0162200927734375, 0.056884765625, 0.1484375, 0.051025390625, 0.1959228515625, 0.260009765625, 0.18798828125, 0.0830078125, 0.1651611328125, 0.06359...	embed
63574077_c0	63574077	prolog	0	Title: Prolog rule can condition to be before a date, but not after a date, why? Problem title: Prolog rule can condition to be before a date, but not after a date, why? Tags: prolog-setof, prolog Problem: Prolog rule can condition to be before a date, but not after a date, why? I have the following rules looking for f...	Prolog rule can condition to be before a date, but not after a date, why? Prolog rule can condition to be before a date, but not after a date, why? prolog-setof prolog Prolog Date Category Preceding Amount After Rows CEM Consulting Package Tuition Prolog rule can condition to be before a date, but not after a date, why...	[ 0.01434326171875, -0.007781982421875, 0.009521484375, 0.035888671875, -0.01123046875, -0.0022735595703125, -0.00897216796875, 0.0274658203125, 0.0150146484375, -0.007720947265625, 0.000461578369140625, -0.004791259765625, -0.000316619873046875, -0.03662109375, 0.0128173828125, -0.00253...	[ 1250, 4867, 79986, 831, 35431, 186, 8108, 5622, 1284, 959, 7103, 15400, 502, 4390, 25512, 49057, 1914, 329, 121147, 24372, 96190, 17513, 149512, 56607, 1371, 14, 91736, 16487, 100, 15824, 63399, 24233, 112474, 107671, 214, 43240, 5885, 4966, ...	[ 0.185546875, 0.25634765625, 0.190185546875, 0.0950927734375, 0.2357177734375, 0.05963134765625, 0.21484375, 0.16064453125, 0.05352783203125, 0.0635986328125, 0.21044921875, 0.1138916015625, 0.1119384765625, 0.0178375244140625, 0.0994873046875, 0.03900146484375, 0.0408935546875, 0.0...	embed
42973822_c1	42973822	prolog	1	R = [[[alexanderplatz, u2, gleisdreieck, ruhleben], [gleisdreieck, u1, prinzenstrasse, 'warschauer strasse']], 6900] ; R = [[[alexanderplatz, u2, stadtmitte, ruhleben], [stadtmitte, u6, 'hallesches tor', 'alt-mariendorf'], ['hallesches tor', u1, prinzenstrasse, 'warschauer strasse']], 5000] ; R = [[[alexanderplatz, u8...	R = [[[alexanderplatz, u2, gleisdreieck, ruhleben], [gleisdreieck, u1, prinzenstrasse, 'warschauer strasse']], 6900] ; R = [[[alexanderplatz, u2, stadtmitte, ruhleben], [stadtmitte, u6, 'hallesches tor', 'alt-mariendorf'], ['hallesches tor', u1, prinzenstrasse, 'warschauer strasse']], 5000] ; R = [[[alexanderplatz, u8...	[ 0.0142822265625, 0.007476806640625, 0.0036468505859375, 0.0126953125, -0.000823974609375, -0.00494384765625, -0.0020904541015625, -0.0166015625, 0.0181884765625, -0.04345703125, 0.0003376007080078125, 0.0084228515625, -0.002655029296875, -0.01055908203125, -0.018798828125, 0.0202636718...	[ 627, 2203, 16020, 820, 46149, 75, 304, 67830, 7090, 60113, 21875, 53047, 15592, 14, 418, 2448, 3121, 2816, 4205, 32854, 6363, 2619, 305, 20543, 47704, 4007, 67, 910, 104603, 9983, 7010, 14438, 127830, 19692, 1019, 10910, 4223, 2189, 604, ...	[ 0.1849365234375, 0.0787353515625, 0.044342041015625, 0.052703857421875, 0.18701171875, 0.0694580078125, 0.08380126953125, 0.03460693359375, 0.0908203125, 0.10528564453125, 0.08349609375, 0.1981201171875, 0.05841064453125, 0.010284423828125, 0.0207672119140625, 0.06536865234375, 0.032...	embed
2981222_c0	2981222	prolog	0	Title: Prolog Beginner: How to unify with arithmetic comparison operators or how to get a set var to range of values Problem title: Prolog Beginner: How to unify with arithmetic comparison operators or how to get a set var to range of values Tags: prolog, clpfd Problem: Prolog Beginner: How to unify with arithmetic com...	Prolog Beginner: How to unify with arithmetic comparison operators or how to get a set var to range of values Prolog Beginner: How to unify with arithmetic comparison operators or how to get a set var to range of values prolog clpfd Prolog Beginner How in1 in2 Some Prolog Beginner: How to unify with arithmetic comparis...	[ 0.0064697265625, 0.0004405975341796875, 0.00970458984375, 0.00628662109375, -0.006134033203125, 0.006011962890625, -0.010498046875, -0.0035400390625, -0.00144195556640625, -0.001739501953125, 0.00811767578125, 0.00799560546875, 0.0027008056640625, 0.0023193359375, 0.02880859375, -0.022...	[ 1250, 4867, 67053, 56, 11249, 51, 40383, 678, 8962, 225490, 39933, 3642, 2046, 5423, 285, 47, 37457, 142424, 502, 23, 304, 3525, 3871, 33022, 892, 1505, 606, 820, 15190, 101935, 17721, 757, 15205, 3789, 27489, 29806, 9444, 3444, 2806, 188...	[ 0.18408203125, 0.2685546875, 0.0748291015625, 0.0736083984375, 0.04736328125, 0.1278076171875, 0.1527099609375, 0.074951171875, 0.08203125, 0.1929931640625, 0.13330078125, 0.008758544921875, 0.042816162109375, 0.1102294921875, 0.18408203125, 0.09320068359375, 0.1392822265625, 0.110...	embed
37093257_c0	37093257	prolog	0	Title: Prolog Maze: Lookup predicate Problem title: Prolog Maze: Lookup predicate Tags: lookup, maze, prolog Problem: Prolog Maze: Lookup predicate I have a question: How to do a lookup predicate for a maze. Given a lab: [[[down,left,up],[left,down,up],[right,up],[up],[,up],[right,left,up]], [[left,down],[down,up],[dow...	Prolog Maze: Lookup predicate Prolog Maze: Lookup predicate lookup maze prolog Prolog Maze Lookup Lab Walls N-1 Y1-1 X1-1 map_calc movs_possiveis Movs Poss Prolog Maze: Lookup predicate I have a question: How to do a lookup predicate for a maze. Given a lab: I need define a way of looking up a cell in the Labryinth dat...	[ 0.00640869140625, -0.009765625, 0.0235595703125, 0.004302978515625, 0.0084228515625, -0.007781982421875, 0.016845703125, 0.0208740234375, 0.01116943359375, -0.01953125, -0.00762939453125, 0.00994873046875, -0.021484375, -0.0205078125, 0.000629425048828125, -0.005218505859375, 0.00294...	[ 1250, 4867, 29678, 13, 60818, 2037, 1653, 2063, 67, 6713, 291, 731, 502, 21488, 23706, 541, 5759, 990, 115727, 22288, 6827, 931, 18043, 7522, 29888, 164, 276, 515, 13498, 9655, 11249, 47, 54, 10, 100, 60054, 61924, 3917, 16487, 1257, 38...	[ 0.1513671875, 0.2149658203125, 0.1622314453125, 0.1109619140625, 0.1395263671875, 0.2099609375, 0.203125, 0.24365234375, 0.142822265625, 0.1993408203125, 0.160888671875, 0.2177734375, 0.08587646484375, 0.113037109375, 0.1385498046875, 0.0079345703125, 0.05889892578125, 0.0281982421...	embed
9966407_c1	9966407	prolog	1	like a kinda tedious/poor method perhaps? Thanks in advance for the help! Edit: Thanks to the help below, I've gotten a program running that is functional (at least from what I can tell). I've put it in the code below, in case someone else wanders here. I believe it is, however, extremely inefficient, so there's plent...	like a kinda tedious/poor method perhaps? Thanks in advance for the help! Edit: Thanks to the help below, I've gotten a program running that is functional (at least from what I can tell). I've put it in the code below, in case someone else wanders here. I believe it is, however, extremely inefficient, so there's plent...	[ -0.0028076171875, -0.00122833251953125, -0.002166748046875, -0.005859375, 0.0050048828125, 0.00994873046875, 0.0189208984375, -0.0294189453125, -0.0022735595703125, 0.0047607421875, 0.0289306640625, 0.0159912109375, -0.005523681640625, -0.00726318359375, 0.00604248046875, -0.0172119140...	[ 1884, 8562, 120, 5670, 223, 771, 748, 55300, 95134, 129745, 4358, 42079, 35064, 17763, 1528, 51042, 123309, 257, 19713, 1295, 2367, 831, 14192, 70, 18151, 23, 7225, 22008, 37076, 6165, 14202, 18822, 4, 49903, 111531, 24500, 45964, 7, 87794,...	[ 0.056610107421875, 0.0556640625, 0.031829833984375, 0.061920166015625, 0.006378173828125, 0.1278076171875, 0.049224853515625, 0.15966796875, 0.04974365234375, 0.030914306640625, 0.06597900390625, 0.008544921875, 0.048980712890625, 0.048553466796875, 0.1778564453125, 0.1112060546875, ...	embed
15031203_c0	15031203	prolog	0	Title: Meaning of -> in swi-prolog Problem title: Meaning of -> in swi-prolog Tags: prolog Problem: Meaning of -> in swi-prolog I have a program in swi-prolog and there is an operator(?) -> , which I have met for the first time and I don't know what it is doing. There is a fragment of code, which I don't understa...	Meaning of -> in swi-prolog Meaning of -> in swi-prolog prolog Meaning all_pp J:PP Meaning of -> in swi-prolog I have a program in swi-prolog and there is an operator(?) -> , which I have met for the first time and I don't know what it is doing. There is a fragment of code, which I don't understand: I found that ...	[ 0.0169677734375, 0.00653076171875, 0.0283203125, -0.0185546875, -0.01611328125, 0.000766754150390625, -0.0019683837890625, 0.01904296875, -0.007171630859375, -0.0238037109375, 0.0059814453125, -0.0086669921875, -0.01080322265625, -0.0306396484375, 0.01055908203125, -0.0159912109375, ...	[ 1215, 11, 592, 20, 1230, 5386, 91, 2452, 3454, 4867, 111, 502, 756, 454, 6366, 821, 12, 17487, 33079, 23, 1528, 39933, 435, 3714, 20594, 38551, 18151, 18, 28219, 14037, 3229, 765, 7068, 2174, 1193, 29568, 990, 71924, 120262, 567, 43240,...	[ 0.073486328125, 0.1019287109375, 0.0279388427734375, 0.125244140625, 0.119873046875, 0.2275390625, 0.0230560302734375, 0.19189453125, 0.13525390625, 0.2049560546875, 0.037139892578125, 0.1351318359375, 0.1341552734375, 0.001678466796875, 0.212646484375, 0.1212158203125, 0.00866699218...	embed
54716395_c0	54716395	prolog	0	Title: How Do I Compare a List to a Database Prolog Problem title: How Do I Compare a List to a Database Prolog Tags: compare, prolog, list Problem: How Do I Compare a List to a Database Prolog I have a database of facts that has entries like this snippet symptom(shingles,headache). symptom(shingles,fever). symptom(shi...	How Do I Compare a List to a Database Prolog How Do I Compare a List to a Database Prolog compare prolog list How Compare List Database Prolog Symptoms Please Done read_string Response Symptoms0 How Do I Compare a List to a Database Prolog I have a database of facts that has entries like this snippet I then have a pred...	[ 0.0162353515625, -0.0228271484375, 0.00677490234375, 0.024658203125, -0.0201416015625, 0.01953125, -0.007720947265625, 0.0167236328125, 0.007598876953125, -0.039306640625, 0.0150146484375, 0.021484375, -0.005584716796875, -0.0157470703125, -0.0145263671875, -0.0113525390625, 0.012023...	[ 11249, 984, 87, 113307, 13, 32036, 47, 187781, 1250, 4867, 69101, 502, 5303, 149450, 91693, 92748, 10, 63399, 15824, 112820, 1653, 2063, 153698, 38937, 3642, 54, 17932, 34627, 15190, 70997, 15700, 30957, 3820, 814, 128668, 54700, 1577 ]	[ 0.085205078125, 0.048858642578125, 0.052490234375, 0.20947265625, 0.10498046875, 0.243896484375, 0.12548828125, 0.215576171875, 0.1417236328125, 0.2225341796875, 0.2086181640625, 0.1087646484375, 0.18603515625, 0.1781005859375, 0.01422119140625, 0.0204315185546875, 0.02880859375, 0...	embed

26679486_c0

26679486

prolog

0

Title: trace route of the quicksort algorithm - prolog Problem title: trace route of the quicksort algorithm - prolog Tags: stack-trace, prolog, quicksort Problem: trace route of the quicksort algorithm - prolog I have that previous question about this quicksort here .The prolog code for quicksort: gt(X,Y):- X @>Y. con...

trace route of the quicksort algorithm - prolog trace route of the quicksort algorithm - prolog stack-trace prolog quicksort List Head Tail List1 List2 Sorted Small Big SortedSmall SortedBig Call _G4136 _G4269 _G4270 Exit _G4261 _G4273 Fail Redo _G4264 _G4237 trace route of the quicksort algorithm - prolog I have that ...

[ 0.0181884765625, 0.0167236328125, 0.0157470703125, -0.0033416748046875, -0.01513671875, -0.011474609375, -0.01031494140625, 0.00640869140625, 0.0002727508544921875, -0.0096435546875, -0.00823974609375, 0.0191650390625, -0.0218505859375, -0.0277099609375, 0.0220947265625, 0.008056640625...

[ 144851, 36439, 63773, 62351, 234873, 502, 4867, 177261, 39989, 32036, 44816, 1218, 379, 304, 53666, 105508, 14195, 297, 69070, 129933, 26265, 8894, 8659, 13023, 14212, 724, 617, 104283, 5443, 179122, 418, 13574, 190355, 6096, 31, 71041, 10945, ...

[ 0.2462158203125, 0.2320556640625, 0.2291259765625, 0.303955078125, 0.2073974609375, 0.182373046875, 0.2470703125, 0.112060546875, 0.17919921875, 0.1607666015625, 0.1639404296875, 0.1334228515625, 0.09869384765625, 0.058349609375, 0.1978759765625, 0.042083740234375, 0.11083984375, 0...

embed

51279571_c0

51279571

prolog

0

Title: Evaluating expressions with indexicals in SICStus Prolog Problem title: Evaluating expressions with indexicals in SICStus Prolog Tags: clpfd, prolog Problem: Evaluating expressions with indexicals in SICStus Prolog I'm trying to write a predicate in SICStus Prolog such that given an expression, I can evaluate it...

Evaluating expressions with indexicals in SICStus Prolog Evaluating expressions with indexicals in SICStus Prolog clpfd prolog Evaluating SICStus Prolog Variables Updates Values Result Term Val1 Val2 Evaluating expressions with indexicals in SICStus Prolog I'm trying to write a predicate in SICStus Prolog such that giv...

[ -0.01544189453125, 0.007293701171875, 0.0247802734375, 0.0118408203125, 0.0037689208984375, 0.0034942626953125, 0.01116943359375, 0.0030670166015625, 0.0137939453125, -0.0211181640625, -0.000782012939453125, 0.018798828125, -0.0037841796875, -0.006927490234375, 0.0400390625, -0.0118408...

[ 151228, 125195, 678, 63262, 21533, 159, 102198, 2143, 1250, 4867, 7, 71, 502, 111477, 28641, 190060, 126684, 2994, 4769, 304, 31577, 33022, 1653, 2063, 34475, 831, 151575, 7522, 20028, 25632, 43240, 84751, 1286, 121151, 18151, 64457, 62, 83, ...

[ 0.2144775390625, 0.236572265625, 0.06121826171875, 0.1864013671875, 0.198486328125, 0.0758056640625, 0.0738525390625, 0.1585693359375, 0.12646484375, 0.1873779296875, 0.0216522216796875, 0.026336669921875, 0.07354736328125, 0.06005859375, 0.0869140625, 0.07861328125, 0.06964111328125...

embed

63716046_c1

63716046

prolog

1

andma, daughter, _12442) ? creep Call: (11) lists:append([grandma], _12442, _12904) ? creep Exit: (11) lists:append([grandma], _12442, [grandma|_12442]) ? creep Call: (11) isChild(grandma, daughter, [grandma|_12442]) ? creep Call: (12) parent(grandma, _13040) ? creep Exit: (12) parent(grandma, mom) ? creep Call: (12) l...

[ 0.0029144287109375, 0.0162353515625, 0.0169677734375, 0.03173828125, 0.01422119140625, 0.020751953125, 0.002532958984375, 0.0203857421875, 0.0291748046875, -0.001983642578125, -0.01708984375, -0.023193359375, -0.020751953125, 0.0267333984375, 0.0228271484375, -0.0284423828125, 0.0103...

[ 136, 192, 4, 76849, 101, 1530, 161041, 16, 705, 49512, 254, 26265, 12, 21282, 5303, 9007, 3611, 79139, 117595, 112072, 5443, 217, 83, 441, 102656, 23676, 49129, 43955, 125136, 32318, 78986, 115468, 101807, 28261, 136124, 12825, 46526, 125158,...

[ 0.1494140625, 0.2252197265625, 0.095458984375, 0.255126953125, 0.057342529296875, 0.1556396484375, 0.278564453125, 0.013702392578125, 0.112548828125, 0.218017578125, 0.19189453125, 0.22998046875, 0.0645751953125, 0.1978759765625, 0.2242431640625, 0.0872802734375, 0.1414794921875, 0...

embed

22506832_c0

22506832

prolog

0

Title: Prolog - Apply procedure to specific list members Problem title: Prolog - Apply procedure to specific list members Tags: prolog, list, nested Problem: Prolog - Apply procedure to specific list members I've got a function which takes a list, and removes all unique elements in that list: repeating(Q, L):- repeatin...

Prolog - Apply procedure to specific list members Prolog - Apply procedure to specific list members prolog list nested Prolog Apply Prolog - Apply procedure to specific list members I've got a function which takes a list, and removes all unique elements in that list: for example the query gives I want to apply this to ...

[ -0.01507568359375, 0.0091552734375, 0.0093994140625, -0.018798828125, -0.02197265625, 0.00927734375, -0.006103515625, 0.005157470703125, 0.0255126953125, -0.0306396484375, 0.000682830810546875, 0.00830078125, 0.00067138671875, -0.00494384765625, 0.002349853515625, 0.00677490234375, 0...

[ 1250, 4867, 5659, 538, 50491, 47, 29458, 5303, 43032, 502, 8512, 71, 4163, 32354, 51776, 87388, 756, 36998, 80854, 41, 1294, 3444, 59911, 903, 22759, 12830, 4989, 175199, 4734, 50960, 30646, 351, 45602, 18151, 5036, 4027, 25720, 8781, 42141...

[ 0.197998046875, 0.27734375, 0.1607666015625, 0.1143798828125, 0.2330322265625, 0.0987548828125, 0.2132568359375, 0.19384765625, 0.2103271484375, 0.15185546875, 0.168701171875, 0.003143310546875, 0.007598876953125, 0.1539306640625, 0.06640625, 0.1834716796875, 0.092529296875, 0.1818...

embed

25170868_c1

25170868

prolog

1

t15 | 3 | All | r1 r3 r2 t16 | 427 | All | r3 r2 t17 | 956 | All | r3 t18 | 657 | All | t19 | 113 | All | t20 | 251 | All | r3 r2 In this small example we have 20 task to be scheduled on 5 machines. t4, t7, t15 use resource r1 can therefor not be executed at the same time even if they are scheduled on different machin...

[ -0.00823974609375, 0.005096435546875, -0.00860595703125, 0.0033111572265625, -0.015869140625, -0.0277099609375, -0.01904296875, 0.0033111572265625, 0.0108642578125, -0.0361328125, 0.01251220703125, 0.00173187255859375, 0.008056640625, 0.018798828125, 0.0020904541015625, 0.01953125, 0...

[ 808, 1837, 58745, 138, 3164, 6, 1690, 418, 363, 304, 2485, 201, 3768, 2489, 483, 13683, 1819, 210344, 2947, 49508, 1549, 144019, 360, 903, 19336, 27781, 642, 765, 387, 66211, 47, 186, 80889, 71, 98, 190, 116491, 617, 966, 4527, 177953, ...

[ 0.1622314453125, 0.2421875, 0.090576171875, 0.150634765625, 0.15966796875, 0.0341796875, 0.1602783203125, 0.10418701171875, 0.2144775390625, 0.1636962890625, 0.2042236328125, 0.1142578125, 0.1712646484375, 0.15185546875, 0.07037353515625, 0.180908203125, 0.164306640625, 0.163696289...

embed

47348548_c0

47348548

prolog

0

Title: Prolog and Logic Puzzles Problem title: Prolog and Logic Puzzles Tags: prolog, zebra-puzzle Problem: Prolog and Logic Puzzles I seem to be having an issue with the unification of facts in Prolog, but can't confirm it. Everything looks like it should work, and I've looked up examples of solved logic puzzles using...

Prolog and Logic Puzzles Prolog and Logic Puzzles prolog zebra-puzzle Prolog Logic Puzzles Names Food Hobby Shirt Colour Other Name GirlName Prolog and Logic Puzzles I seem to be having an issue with the unification of facts in Prolog, but can't confirm it. Everything looks like it should work, and I've looked up examp...

[ 0.015869140625, 0.01043701171875, 0.00469970703125, 0.01226806640625, -0.016845703125, 0.00494384765625, -0.0311279296875, -0.0234375, 0.0223388671875, -0.00872802734375, 0.00079345703125, 0.017333984375, 0.0087890625, -0.0115966796875, 0.005889892578125, 0.002777099609375, -0.002471...

[ 1250, 4867, 136, 50592, 238, 179277, 7, 502, 116232, 1766, 13894, 15757, 34562, 126527, 103842, 196431, 64511, 45327, 163612, 48903, 19441, 31089, 51, 41274, 15824, 23, 831, 18, 39563, 171581, 33342, 1884, 5608, 4488, 27781, 86869, 62775, 104...

[ 0.2144775390625, 0.290771484375, 0.0904541015625, 0.1651611328125, 0.06097412109375, 0.2078857421875, 0.0079345703125, 0.1485595703125, 0.1929931640625, 0.1265869140625, 0.12744140625, 0.0986328125, 0.149658203125, 0.1424560546875, 0.123291015625, 0.129150390625, 0.020782470703125, ...

embed

53335339_c0

53335339

prolog

0

Title: Replacing prolog base case with recursive call Problem title: Replacing prolog base case with recursive call Tags: recursion, prolog Problem: Replacing prolog base case with recursive call I am new to Prolog, started learning it recently using the awesome book Learn Prolog Now! . There is something I don't fully...

Replacing prolog base case with recursive call Replacing prolog base case with recursive call recursion prolog Replacing Replacing prolog base case with recursive call I am new to Prolog, started learning it recently using the awesome book Learn Prolog Now! . There is something I don't fully understand and it's really ...

[ 0.007659912109375, -0.002655029296875, 0.00445556640625, 0.004791259765625, 0.0034942626953125, -0.000942230224609375, -0.00408935546875, 0.004852294921875, 0.020263671875, -0.03271484375, 0.0157470703125, -0.00830078125, -0.0264892578125, 0.0098876953125, 0.01409912109375, -0.00271606...

[ 853, 133266, 502, 4867, 3647, 7225, 678, 195625, 5844, 11782, 1830, 1250, 12877, 14240, 28219, 81979, 765, 25632, 51359, 1653, 2063, 67, 2806, 53383, 2174, 15549, 47, 22304, 54241, 98, 98320, 50218, 15400, 36917, 41, 34475, 29041, 1511, 146...

[ 0.03857421875, 0.1270751953125, 0.138671875, 0.21044921875, 0.177978515625, 0.1934814453125, 0.0161895751953125, 0.2242431640625, 0.1131591796875, 0.166015625, 0.11376953125, 0.109130859375, 0.0188446044921875, 0.012939453125, 0.0731201171875, 0.03131103515625, 0.01483154296875, 0....

embed

19611117_c0

19611117

prolog

0

Title: Prolog code generates error Problem title: Prolog code generates error Tags: prolog Problem: Prolog code generates error I want to understand why the next piece of code is not working. modul(A,B,R):-A<B,R is B-A. modul(A,B,R):-R is A-B. This here extracts the Xth element from the list extractFromList([H|_],X,R):...

Prolog code generates error Prolog code generates error prolog Prolog B-A A-B X-1 manhatan2 _L165 ERROR Arguments Exception _G1122 _G1123 Prolog code generates error I want to understand why the next piece of code is not working. This here extracts the Xth element from the list This here computes the Manhattan distance...

[ 0.0123291015625, 0.0103759765625, -0.005126953125, 0.004913330078125, 0.0123291015625, 0.0201416015625, -0.00811767578125, 0.0034027099609375, 0.00762939453125, -0.0189208984375, 0.01312255859375, -0.024658203125, 0.01153564453125, -0.01019287109375, -0.00103759765625, -0.0062255859375...

[ 1250, 4867, 18151, 139392, 7, 18499, 502, 335, 284, 62, 571, 1193, 5759, 332, 150878, 304, 866, 118913, 151206, 112140, 63928, 724, 1662, 4015, 3742, 28219, 15400, 11737, 63847, 959, 20697, 3688, 125663, 927, 12830, 5303, 7077, 147037, 6248...

[ 0.1842041015625, 0.259521484375, 0.203369140625, 0.2176513671875, 0.05615234375, 0.2283935546875, 0.148193359375, 0.0792236328125, 0.069091796875, 0.0303192138671875, 0.0914306640625, 0.118408203125, 0.09765625, 0.07525634765625, 0.232421875, 0.106689453125, 0.0389404296875, 0.2507...

embed

58741123_c0

58741123

prolog

0

Title: Is there way I could fix this error ? Undefined symbols for architecture x86_64: (gnu-prolog) Problem title: Is there way I could fix this error ? Undefined symbols for architecture x86_64: (gnu-prolog) Tags: gnu-prolog, prolog Problem: Is there way I could fix this error ? Undefined symbols for architecture x86...

Is there way I could fix this error ? Undefined symbols for architecture x86_64: (gnu-prolog) Is there way I could fix this error ? Undefined symbols for architecture x86_64: (gnu-prolog) gnu-prolog prolog Undefined x86_64 existence_error gplcML9Z1g.o _Lpred2_1 _Lpred2_2 _Lpred2_3 _Lpred2_4 Is there way I could fix thi...

[ 0.00115203857421875, 0.005126953125, 0.00323486328125, 0.00384521484375, -0.0194091796875, 0.00616455078125, 0.022216796875, 0.0024566650390625, -0.011962890625, -0.04833984375, -0.000640869140625, -0.01165771484375, 0.0022735595703125, -0.00531005859375, 0.0155029296875, 0.00294494628...

[ 3917, 5809, 30022, 903, 18499, 79912, 5983, 297, 26582, 7, 159958, 1022, 15276, 13307, 104155, 3454, 4867, 2685, 100, 502, 116311, 188800, 706, 2424, 39456, 866, 19714, 304, 115187, 363, 617, 1528, 127877, 5885, 2452, 9790, 11675, 959, 6577...

[ 0.0123291015625, 0.04522705078125, 0.1341552734375, 0.0149383544921875, 0.166748046875, 0.1392822265625, 0.2080078125, 0.030029296875, 0.239990234375, 0.051055908203125, 0.165771484375, 0.029083251953125, 0.2425537109375, 0.226806640625, 0.1953125, 0.1572265625, 0.187744140625, 0.0...

embed

66941974_c0

66941974

prolog

0

Title: prolog: issue with undirected graph: path to one direction works, but infinite loop for the other direction Problem title: prolog: issue with undirected graph: path to one direction works, but infinite loop for the other direction Tags: prolog Problem: prolog: issue with undirected graph: path to one direction w...

prolog: issue with undirected graph: path to one direction works, but infinite loop for the other direction prolog: issue with undirected graph: path to one direction works, but infinite loop for the other direction prolog prolog: issue with undirected graph: path to one direction works, but infinite loop for the other...

[ 0.007476806640625, 0.00634765625, 0.0125732421875, -0.001678466796875, -0.0150146484375, -0.0048828125, -0.0120849609375, 0.01409912109375, 0.00872802734375, -0.07470703125, 0.0166015625, 0.003143310546875, -0.013427734375, 0.0177001953125, 0.026123046875, 0.00994873046875, 0.0228271...

[ 502, 4867, 31089, 51, 80581, 297, 41382, 60875, 47, 1632, 48225, 43240, 1284, 54241, 13, 40956, 3789, 678, 100, 18151, 1884, 15190, 1286, 124519, 26458, 1528, 1295, 110, 112, 1193, 990, 20697, 195625, 1830, 808, 148, 29568, 4127, 3229, 34...

[ 0.1546630859375, 0.2100830078125, 0.1236572265625, 0.06146240234375, 0.17431640625, 0.0467529296875, 0.1773681640625, 0.224365234375, 0.1351318359375, 0.0936279296875, 0.189453125, 0.120361328125, 0.0723876953125, 0.151611328125, 0.08441162109375, 0.1932373046875, 0.07745361328125, ...

embed

29088308_c0

29088308

prolog

0

Title: Enumerating domains in Prolog's clpfd Problem title: Enumerating domains in Prolog's clpfd Tags: clpfd, prolog Problem: Enumerating domains in Prolog's clpfd I'm exploring dependent structures of constraints like this one: assign(X,Y) :- X in 1..5, ((X mod 2 #= 1) #=> Y in 2..3), ((X mod 2 #= 0) #=> Y ...

Enumerating domains in Prolog's clpfd Enumerating domains in Prolog's clpfd clpfd prolog Enumerating Prolog X-D fd_dom Enumerating domains in Prolog's clpfd I'm exploring dependent structures of constraints like this one: What I'm looking for is a representation of X 's and Y 's domains that is as sparse as p...

[ 0.013671875, -0.01318359375, 0.0089111328125, 0.01324462890625, 0.005889892578125, 0.0152587890625, 0.00189208984375, 0.0023651123046875, 0.0024261474609375, -0.045654296875, -0.0078125, -0.0196533203125, 0.0038909912109375, 0.004730224609375, 0.01336669921875, -0.016845703125, 0.015...

[ 357, 15537, 98767, 77758, 7, 1250, 4867, 3768, 33139, 39557, 71, 23, 502, 1193, 397, 1238, 3815, 24649, 108750, 45646, 158, 2816, 4288, 16487, 100, 18811, 136, 990, 237, 27148, 7722, 124519, 92714, 155761, 617, 190, 3917, 96391, 756, 7733...

[ 0.023406982421875, 0.222412109375, 0.065185546875, 0.23486328125, 0.057586669921875, 0.1485595703125, 0.251953125, 0.023406982421875, 0.06005859375, 0.1357421875, 0.1524658203125, 0.00738525390625, 0.0823974609375, 0.114013671875, 0.14208984375, 0.006988525390625, 0.177490234375, 0...

embed

48982779_c0

48982779

prolog

0

Title: Prolog print in the specific format Problem title: Prolog print in the specific format Tags: prolog Problem: Prolog print in the specific format Say I have two lists [A, B, C] and [D, E, F] on my hand now. The values in list1 and list2 are in the same range, but I don't exactly know how they match with each othe...

Prolog print in the specific format Prolog print in the specific format prolog 1 Prolog ONE TWO THREE Prolog print in the specific format Say I have two lists [A, B, C] and [D, E, F] on my hand now. The values in list1 and list2 are in the same range, but I don't exactly know how they match with each other. There is on...

[ 0.0106201171875, -0.015869140625, 0.0002422332763671875, 0.0189208984375, -0.00787353515625, -0.0019989013671875, -0.0189208984375, 0.003814697265625, 0.013427734375, 0.01513671875, -0.00762939453125, -0.0235595703125, 0.000576019287109375, -0.006134033203125, 0.0106201171875, -0.01782...

[ 1250, 4867, 28412, 23, 29458, 9384, 502, 106, 31261, 43789, 148776, 6626, 5303, 284, 335, 313, 397, 241, 563, 3535, 5036, 142424, 304, 5701, 37457, 3714, 14858, 3789, 207116, 62, 391, 2203, 116, 138, 35431, 3642, 831, 16750, 25632, 2967, ...

[ 0.198486328125, 0.288330078125, 0.22509765625, 0.045806884765625, 0.244140625, 0.2374267578125, 0.162353515625, 0.043853759765625, 0.08184814453125, 0.05206298828125, 0.115234375, 0.07012939453125, 0.2012939453125, 0.02386474609375, 0.03961181640625, 0.02459716796875, 0.0610046386718...

embed

37367646_c0

37367646

prolog

0

Title: Lambda calculus with Prolog Problem title: Lambda calculus with Prolog Tags: prolog, parsing, nlp, lambda, logic Problem: Lambda calculus with Prolog I'm doing past exam questions for my Symbolic AI course. One of the questions is this: Show the interpretation that the grammar and lexicon would assign to Every m...

Lambda calculus with Prolog Lambda calculus with Prolog prolog parsing nlp lambda logic Lambda Prolog Every VP:NP DET:N DET AUX:VP AUX P:X Q:X A:B Lambda calculus with Prolog I'm doing past exam questions for my Symbolic AI course. One of the questions is this: Show the interpretation that the grammar and lexicon would...

[ 0.027587890625, 0.0084228515625, -0.017333984375, 0.005157470703125, -0.01031494140625, 0.0220947265625, 0.019287109375, 0.01287841796875, 0.0162353515625, -0.055908203125, 0.00689697265625, -0.01300048828125, -0.006256103515625, -0.020751953125, 0.005340576171875, 0.01263427734375, ...

[ 122930, 85, 44805, 223, 678, 1250, 4867, 502, 366, 26775, 21, 6492, 62775, 87769, 41195, 28814, 105437, 839, 71609, 1542, 2396, 62, 571, 11015, 42276, 131899, 38730, 15411, 17582, 17367, 206019, 122092, 136, 95, 73140, 19, 2806, 95486, 332,...

[ 0.1898193359375, 0.1385498046875, 0.158447265625, 0.08245849609375, 0.0728759765625, 0.1431884765625, 0.2392578125, 0.113525390625, 0.11279296875, 0.1412353515625, 0.00732421875, 0.162353515625, 0.1298828125, 0.2010498046875, 0.1885986328125, 0.10333251953125, 0.185791015625, 0.007...

embed

9855986_c0

9855986

prolog

0

Title: Solving a logic puzzle (Kuromasu, Where is black cells) in Prolog Problem title: Solving a logic puzzle (Kuromasu, Where is black cells) in Prolog Tags: clpfd, logic, prolog, puzzle Problem: Solving a logic puzzle (Kuromasu, Where is black cells) in Prolog I have some problems with solving puzzle. I haven't foun...

Solving a logic puzzle (Kuromasu, Where is black cells) in Prolog Solving a logic puzzle (Kuromasu, Where is black cells) in Prolog clpfd logic prolog puzzle Solving Kuromasu Where Prolog Solving a logic puzzle (Kuromasu, Where is black cells) in Prolog I have some problems with solving puzzle. I haven't found solution...

[ -0.0091552734375, 0.00555419921875, 0.0103759765625, 0.0111083984375, -0.0166015625, -0.00164031982421875, -0.006103515625, -0.005126953125, -0.0152587890625, -0.0079345703125, 0.0012054443359375, -0.01055908203125, 0.0096435546875, 0.00555419921875, 0.01904296875, 0.006378173828125, ...

[ 6678, 6496, 62775, 104192, 44858, 8945, 1159, 78662, 83, 22556, 38750, 7, 1250, 4867, 39557, 71, 502, 5375, 23, 44402, 3115, 14037, 29806, 100, 903, 33022, 5351, 4271, 139392, 11907, 154109, 7722, 26785, 2967, 3126, 756, 91736, 12921, 9655,...

[ 0.1173095703125, 0.035614013671875, 0.1939697265625, 0.212158203125, 0.0989990234375, 0.204833984375, 0.19189453125, 0.1224365234375, 0.0888671875, 0.1710205078125, 0.204833984375, 0.0279693603515625, 0.1483154296875, 0.2247314453125, 0.00677490234375, 0.04669189453125, 0.08776855468...

embed

61277051_c0

61277051

prolog

0

Title: inserting an integer into a sorted list Problem title: inserting an integer into a sorted list Tags: list, prolog Problem: inserting an integer into a sorted list So my problem is this i have a predicate called insere_ordenado(El,Lst1,Lst2) in which El is a random integer, Lst1 is a list and Lst2 is the resultin...

inserting an integer into a sorted list inserting an integer into a sorted list list prolog insere_ordenado_ite NAC NNAC inserting an integer into a sorted list So my problem is this i have a predicate called insere_ordenado(El,Lst1,Lst2) in which El is a random integer, Lst1 is a list and Lst2 is the resulting list of...

[ -0.0257568359375, -0.01953125, -0.00054168701171875, -0.0052490234375, 0.004486083984375, 0.051025390625, -0.020263671875, -0.0172119140625, 0.003021240234375, -0.0262451171875, 0.0257568359375, -0.00141143798828125, -0.015380859375, -0.002105712890625, 0.01446533203125, 0.001617431640...

[ 183540, 892, 1505, 3934, 17497, 71, 5303, 502, 4867, 28046, 13, 38228, 1138, 1486, 184777, 541, 2967, 1653, 2063, 67, 7623, 271, 418, 10461, 540, 96759, 339, 304, 16750, 154107, 47, 13580, 195625, 5844, 765, 720, 45023, 3444, 15190, 14012...

[ 0.2225341796875, 0.1341552734375, 0.1212158203125, 0.10015869140625, 0.1790771484375, 0.12646484375, 0.1875, 0.12451171875, 0.16650390625, 0.211669921875, 0.1558837890625, 0.185546875, 0.1727294921875, 0.131591796875, 0.2183837890625, 0.05316162109375, 0.1170654296875, 0.1177978515...

embed

27450199_c0

27450199

prolog

0

Title: Create combinations of numbers within list prolog Problem title: Create combinations of numbers within list prolog Tags: prolog, constraints, clpfd, algorithm Problem: Create combinations of numbers within list prolog I am developing a program in PROLOG ( with restrictions ) which is supposed to output a combina...

Create combinations of numbers within list prolog Create combinations of numbers within list prolog prolog constraints clpfd algorithm Create Possible Wrong Missing Numbers Etc all_different Create combinations of numbers within list prolog I am developing a program in PROLOG ( with restrictions ) which is supposed to ...

[ -0.02734375, -0.0023956298828125, 0.019775390625, 0.001953125, 0.01397705078125, 0.00860595703125, -0.019287109375, 0.0093994140625, 0.021240234375, -0.031494140625, -0.0157470703125, -0.0220947265625, 0.01953125, 0.007598876953125, 0.0162353515625, 0.0164794921875, -0.00123596191406...

[ 151313, 162515, 7, 101935, 28032, 5303, 502, 4867, 158, 2816, 4288, 33139, 39557, 71, 234873, 115861, 2661, 35133, 16771, 214, 103332, 756, 238778, 111, 168698, 1528, 23, 10514, 47510, 678, 185190, 134598, 140992, 305, 24233, 8110, 1295, 106,...

[ 0.1336669921875, 0.2498779296875, 0.086669921875, 0.1612548828125, 0.1815185546875, 0.202392578125, 0.1566162109375, 0.231689453125, 0.0272979736328125, 0.1512451171875, 0.103515625, 0.0206451416015625, 0.0655517578125, 0.11328125, 0.16552734375, 0.06787109375, 0.012451171875, 0.09...

embed

10588865_c0

10588865

prolog

0

Title: Allegrograph Geospatial Prolog Queries Problem title: Allegrograph Geospatial Prolog Queries Tags: allegrograph, geospatial, semantic-web, prolog Problem: Allegrograph Geospatial Prolog Queries I have some triples that represent the locations of several cities. I want to be able to fire off a Prolog query like (...

Allegrograph Geospatial Prolog Queries Allegrograph Geospatial Prolog Queries allegrograph geospatial semantic-web prolog Allegrograph Geospatial Prolog Queries exns:geolocation Server Allegrograph Geospatial Prolog Queries I have some triples that represent the locations of several cities. I want to be able to fire of...

[ 0.016845703125, 0.018798828125, 0.00592041015625, -0.0019683837890625, -0.0133056640625, -0.005126953125, 0.00823974609375, -0.003326416015625, -0.0194091796875, -0.040771484375, 0.0172119140625, 0.00775146484375, -0.0172119140625, -0.0361328125, -0.00274658203125, 0.01007080078125, ...

[ 4344, 8407, 41382, 30152, 10974, 1250, 4867, 5813, 747, 20787, 484, 14051, 502, 1119, 1779, 429, 31, 87632, 22687, 3060, 162738, 7, 33636, 31913, 40368, 162708, 3444, 11476, 5773, 41, 1294, 1884, 18499, 176377, 4082, 81887, 11782, 4904, 568...

[ 0.128662109375, 0.1678466796875, 0.1875, 0.114990234375, 0.090087890625, 0.1749267578125, 0.2479248046875, 0.1212158203125, 0.09271240234375, 0.1597900390625, 0.0506591796875, 0.060791015625, 0.1114501953125, 0.060760498046875, 0.1219482421875, 0.0775146484375, 0.1114501953125, 0.1...

embed

43600928_c0

43600928

prolog

0

Title: Translating a tabled predicate from b-prolog to gprolog Problem title: Translating a tabled predicate from b-prolog to gprolog Tags: prolog, knights-tour, predicate, declarative Problem: Translating a tabled predicate from b-prolog to gprolog For fun I've been attempting to write a Knight's Tour ( https://en.wik...

Translating a tabled predicate from b-prolog to gprolog Translating a tabled predicate from b-prolog to gprolog prolog knights-tour predicate declarative b-prolog Translating Visits NewX NewY Score possible_knight_moves possible_moves_count Translating a tabled predicate from b-prolog to gprolog For fun I've been attem...

[ 0.0003337860107421875, -0.00982666015625, 0.01446533203125, 0.0036163330078125, -0.015869140625, 0.0235595703125, -0.0152587890625, -0.01495361328125, 0.002044677734375, -0.048583984375, 0.007781982421875, 0.0235595703125, -0.03271484375, -0.000797271728515625, -0.01055908203125, 0.029...

[ 11062, 143, 23180, 71, 1653, 2063, 67, 1295, 876, 3454, 4867, 47, 706, 502, 472, 54350, 7, 28889, 21635, 98684, 2356, 1542, 1723, 168071, 7722, 92, 432, 3132, 71013, 7477, 81887, 33022, 114996, 25, 11330, 7168, 13691, 3768, 3115, 814, 5...

[ 0.1337890625, 0.18994140625, 0.2366943359375, 0.113037109375, 0.1787109375, 0.2265625, 0.0570068359375, 0.051788330078125, 0.1444091796875, 0.1771240234375, 0.19873046875, 0.05291748046875, 0.08001708984375, 0.14501953125, 0.030029296875, 0.183837890625, 0.023529052734375, 0.217895...

embed

66840573_c0

66840573

prolog

0

Title: Program in SWI-Prolog Problem title: Program in SWI-Prolog Tags: prolog Problem: Program in SWI-Prolog Task:Write to the new file all the lines of the source file that contain the specified string as a fragment, which is entered from the keyboard. I can't figure out how to compare the lines from the file line by...

Program in SWI-Prolog Program in SWI-Prolog prolog Program SWI-Prolog Enter SOURFILE check_exist read_line_to_string NEWFILE write_to_file Filename exists_file There TEXT File Data Program in SWI-Prolog Task:Write to the new file all the lines of the source file that contain the specified string as a fragment, which is...

[ 0.004608154296875, -0.00897216796875, -0.003265380859375, 0.01129150390625, -0.03369140625, 0.01263427734375, 0.00518798828125, 0.0281982421875, -0.005859375, -0.00836181640625, 0.004241943359375, 0.02783203125, -0.0306396484375, -0.017578125, 0.0078125, 0.0025177001953125, 0.0234375...

[ 7663, 23, 159, 38969, 10752, 4867, 502, 60816, 76234, 919, 52099, 12765, 54376, 12301, 2256, 188, 91693, 80111, 33022, 29822, 42724, 32316, 7, 13018, 70981, 11809, 9598, 1456, 18781, 47, 3525, 11435, 756, 70, 124519, 31344, 70541, 58735, 79...

[ 0.2027587890625, 0.048370361328125, 0.07952880859375, 0.235107421875, 0.17529296875, 0.215087890625, 0.127685546875, 0.104736328125, 0.09869384765625, 0.094970703125, 0.031707763671875, 0.125244140625, 0.1988525390625, 0.1246337890625, 0.1434326171875, 0.14501953125, 0.16943359375, ...

embed

28773539_c1

28773539

prolog

1

:- same_colour(shape_a, shape_b). :- end_tests(same_colour). I've also tried: test(same_colour, [ setup(asserta(colour(shape_a, colour_1))), setup(asserta(colour(shape_b, colour_1))), cleanup(retract(colour(shape_a, colour_1))), cleanup(retract(colour(shape_b, colour_1))) ]) :- same_colour(shape_a, shape_b). that is, ...

[ 0.001983642578125, 0.00616455078125, -0.00677490234375, 0.00933837890625, -0.009765625, -0.00958251953125, 0.004913330078125, -0.014892578125, 0.0025177001953125, 0.0128173828125, -0.01116943359375, 0.0537109375, -0.0206298828125, 0.005462646484375, 0.0220947265625, 0.00665283203125, ...

[ 15772, 5701, 22796, 474, 2420, 1081, 11, 4, 115700, 275, 3564, 6954, 7, 40175, 272, 2843, 37842, 3034, 169581, 162, 110965, 134855, 115187, 46622, 39989, 5117, 159978, 136, 15824, 59437, 18347, 35782, 144851, 8306, 16865, 959, 29568, 12960, ...

[ 0.027313232421875, 0.159423828125, 0.147216796875, 0.10150146484375, 0.121337890625, 0.06591796875, 0.10321044921875, 0.010009765625, 0.184326171875, 0.14794921875, 0.119384765625, 0.1905517578125, 0.013458251953125, 0.146240234375, 0.00067138671875, 0.008026123046875, 0.09130859375,...

embed

29257745_c0

29257745

prolog

0

Title: How do I write a predicate that returns a specific list? Problem title: How do I write a predicate that returns a specific list? Tags: prolog Problem: How do I write a predicate that returns a specific list? I am attempting to write a predicate that will identify the following changeover destinations. The places...

How do I write a predicate that returns a specific list? How do I write a predicate that returns a specific list? prolog How new_york san_francisco abu_dhabi buenos_aires hong_kong How do I write a predicate that returns a specific list? I am attempting to write a predicate that will identify the following changeover d...

[ -0.0084228515625, -0.00799560546875, -0.0035247802734375, 0.0086669921875, 0.01397705078125, 0.0213623046875, -0.00872802734375, -0.0205078125, 0.00897216796875, 0.01806640625, -0.02490234375, 0.0022430419921875, -0.010498046875, 0.001220703125, 0.01275634765625, -0.00762939453125, 0...

[ 11249, 54, 87, 33022, 10, 1653, 2063, 67, 450, 30646, 29458, 5303, 7, 502, 4867, 3525, 13437, 92, 3725, 95022, 164, 587, 45405, 71, 54815, 126819, 19027, 30434, 45310, 81887, 135812, 25632, 15549, 5465, 78869, 44677, 99, 3129, 7722, 47, ...

[ 0.109619140625, 0.049468994140625, 0.04705810546875, 0.2225341796875, 0.07049560546875, 0.2166748046875, 0.256103515625, 0.181884765625, 0.06231689453125, 0.217041015625, 0.210693359375, 0.228759765625, 0.06988525390625, 0.1397705078125, 0.2076416015625, 0.05743408203125, 0.130981445...

embed

50749333_c0

50749333

prolog

0

Title: Prolog check if list contains even number of an element Problem title: Prolog check if list contains even number of an element Tags: tail, recursion, prolog, list, head Problem: Prolog check if list contains even number of an element I have to check if a list contains an even number of an element without built-i...

Prolog check if list contains even number of an element Prolog check if list contains even number of an element tail recursion prolog list head Prolog Tail Head Prolog check if list contains even number of an element I have to check if a list contains an even number of an element without built-ins. Example: returns fal...

[ -0.0074462890625, 0.0017547607421875, 0.004974365234375, -0.00762939453125, -0.013671875, 0.004669189453125, -0.012451171875, -0.00933837890625, -0.00640869140625, -0.02490234375, 0.0003566741943359375, -0.00897216796875, 0.000858306884765625, 0.01397705078125, 0.01422119140625, -0.001...

[ 1250, 4867, 12765, 2174, 5303, 70541, 3853, 14012, 12830, 46741, 195625, 502, 10336, 1218, 379, 44816, 15490, 88303, 5425, 30646, 98320, 29568, 114063, 11341, 9790, 101089, 17721, 117249, 54799, 74918, 4488, 8306, 3934, 959, 55923 ]

[ 0.1583251953125, 0.2396240234375, 0.1834716796875, 0.07867431640625, 0.1888427734375, 0.143310546875, 0.1885986328125, 0.1297607421875, 0.196044921875, 0.1796875, 0.12841796875, 0.1173095703125, 0.1534423828125, 0.08447265625, 0.040252685546875, 0.14013671875, 0.0811767578125, 0.06...

embed

23378414_c0

23378414

prolog

0

Title: Save argument into a fact from user input Problem title: Save argument into a fact from user input Tags: prolog Problem: Save argument into a fact from user input Some days ago I asked a question about basis input/output in Prolog, but now I have another question. I'm doing a Prolog project in my college related...

Save argument into a fact from user input Save argument into a fact from user input prolog user Save Save argument into a fact from user input Some days ago I asked a question about basis input/output in Prolog, but now I have another question. I'm doing a Prolog project in my college related with an ITS diagnostic. Le...

[ 0.0146484375, 0.0072021484375, 0.01226806640625, 0.01519775390625, -0.002777099609375, 0.019775390625, -0.00726318359375, 0.00384521484375, -0.00872802734375, -0.033935546875, 0.01239013671875, 0.00009107589721679688, -0.015869140625, 0.01708984375, -0.00445556640625, -0.01397705078125...

[ 64944, 10750, 3934, 10, 15824, 1295, 38937, 107730, 502, 4867, 18231, 6056, 7077, 1250, 9655, 13452, 40466, 119119, 52070, 62822, 91736, 134234, 3917, 30098, 12638, 17368, 17582, 64457, 5423, 35978, 73342, 1884, 159978, 201505, 199, 1830, 454, ...

[ 0.2242431640625, 0.29345703125, 0.1514892578125, 0.013427734375, 0.233642578125, 0.131103515625, 0.1727294921875, 0.2000732421875, 0.1287841796875, 0.23095703125, 0.193603515625, 0.07574462890625, 0.00555419921875, 0.138916015625, 0.032867431640625, 0.0516357421875, 0.0517578125, 0...

embed

32529229_c1

32529229

prolog

1

0 , Qtot is Qa + Qb , Qtot =< 3. applicable(emptyBinA,state(Qa,Qb)) :- Qb > 0, Qtot is Qa + Qb , Qtot =< 4. applicable(fillAwithB,state(Qa,Qb)) :- Qa < 4, Qtrasf is 4 - Qa , Qtrasf =< Qb. applicable(fillBwithA,state(Qa,Qb)) :- Qb < 3, Qtrasf is 3 - Qb , Qtrasf=<Qa. apply(emptyA,state(Qa,Qb),state(0,Qb)). apply(emptyB,s...

[ 0.0146484375, 0.00506591796875, 0.0118408203125, 0.014404296875, 0.005035400390625, 0.002288818359375, -0.020263671875, -0.000820159912109375, 0.019287109375, -0.007659912109375, 0.02099609375, -0.009765625, 0.006866455078125, 0.009033203125, 0.005615234375, -0.025390625, 0.020874023...

[ 757, 2396, 21737, 83, 16785, 997, 275, 2203, 16093, 1031, 152431, 33548, 939, 571, 73, 284, 61340, 51724, 2737, 15772, 977, 1398, 116115, 76228, 4426, 201, 29987, 420, 138, 59911, 1328, 105801, 46568, 2356, 21320, 9, 86827, 959, 34735, 36...

[ 0.1646728515625, 0.1551513671875, 0.26708984375, 0.1309814453125, 0.206298828125, 0.1644287109375, 0.14208984375, 0.0357666015625, 0.1375732421875, 0.083740234375, 0.1739501953125, 0.1339111328125, 0.10687255859375, 0.10888671875, 0.127197265625, 0.14892578125, 0.1558837890625, 0.2...

embed

59011516_c1

59011516

prolog

1

(X,_), \+ common_noun(X,_), \+ preposition(X,_,_), \+ copula_verb(X), \+ transitive_verb(X,_,_), \+ intransitive_verb(X,_). common_noun(cat,X) :- cat(X). common_noun(box,X) :- box(X). common_noun(basket,X) :- basket(X). common_noun(poptart,X) :- poptart(X). intransitive_verb(purrs,X) :- purrs(X). intransitive_verb(slee...

[ -0.004241943359375, 0.00067901611328125, -0.0201416015625, 0.03271484375, 0.000583648681640625, 0.0162353515625, 0.01129150390625, -0.00958251953125, 0.018798828125, -0.051025390625, 0.01531982421875, 0.000682830810546875, -0.00213623046875, -0.0038604736328125, 0.0169677734375, 0.0054...

[ 1542, 454, 1328, 39210, 157, 309, 479, 40322, 552, 42943, 81465, 62621, 5844, 23, 30145, 4935, 4460, 15772, 7515, 11728, 16530, 5918, 3473, 149241, 33554, 867, 7426, 4717, 7398, 4295, 170572, 60268, 28661, 1723, 1608, 164, 83, 170, 100034, ...

[ 0.163818359375, 0.111572265625, 0.1158447265625, 0.1580810546875, 0.0582275390625, 0.137939453125, 0.038665771484375, 0.1390380859375, 0.1241455078125, 0.2587890625, 0.1983642578125, 0.1175537109375, 0.0902099609375, 0.03924560546875, 0.04718017578125, 0.06591796875, 0.1795654296875,...

embed

10609324_c0

10609324

prolog

0

Title: Prolog: a(b,c) and a(X,Y):-a(Y,X), query a(c,b) returns infinite true? Problem title: Prolog: a(b,c) and a(X,Y):-a(Y,X), query a(c,b) returns infinite true? Tags: prolog Problem: Prolog: a(b,c) and a(X,Y):-a(Y,X), query a(c,b) returns infinite true? Here is my knowledge base: a(b,c). a(X,Y):-a(Y,X). Here is my q...

Prolog: a(b,c) and a(X,Y):-a(Y,X), query a(c,b) returns infinite true? Prolog: a(b,c) and a(X,Y):-a(Y,X), query a(c,b) returns infinite true? prolog Prolog Prolog: a(b,c) and a(X,Y):-a(Y,X), query a(c,b) returns infinite true? Here is my knowledge base: Here is my query: a(c,b). I am using SWI-Prolog. I thought that th...

[ 0.025390625, 0.0228271484375, 0.01165771484375, 0.0164794921875, -0.0174560546875, 0.00341796875, 0.005889892578125, -0.00640869140625, 0.00567626953125, -0.0301513671875, 0.0189208984375, 0.003875732421875, -0.0279541015625, -0.0032196044921875, 0.029052734375, 0.009765625, 0.022949...

[ 1250, 4867, 10, 275, 238, 136, 1542, 1723, 9, 41, 1294, 30646, 54241, 29568, 4, 13, 502, 7, 51359, 3647, 11853, 17368, 159, 38969, 10752, 17569, 1528, 2448, 1916, 9774, 33306, 64457, 28412, 136622, 2174, 5962, 40, 46029, 4759, 24189, 16...

[ 0.2021484375, 0.22412109375, 0.0936279296875, 0.146484375, 0.1170654296875, 0.05029296875, 0.1204833984375, 0.112060546875, 0.0277557373046875, 0.1512451171875, 0.1029052734375, 0.20361328125, 0.153076171875, 0.24169921875, 0.0830078125, 0.039642333984375, 0.1453857421875, 0.009338...

embed

12192069_c0

12192069

prolog

0

Title: Too much backtracking: why is there a "redo" here? Problem title: Too much backtracking: why is there a "redo" here? Tags: successor-arithmetics, backtracking, prolog Problem: Too much backtracking: why is there a "redo" here? I'm doing a very simple exercise in Prolog and there's something I...

Too much backtracking: why is there a "redo" here? Too much backtracking: why is there a "redo" here? successor-arithmetics backtracking prolog Too greater_than Call Exit Redo Fail Too much backtracking: why is there a "redo" here? I'm doing a very simple exercise in Prolog and there's something I d...

[ 0.00616455078125, 0.01519775390625, 0.0079345703125, 0.027587890625, -0.0169677734375, 0.00811767578125, 0.0012969970703125, 0.007232666015625, 0.00787353515625, -0.0189208984375, 0.00946044921875, -0.005462646484375, -0.01312255859375, -0.00885009765625, 0.0205078125, -0.014404296875,...

[ 56374, 5045, 4420, 125728, 214, 15400, 83, 2685, 10, 56693, 3688, 41502, 39457, 42, 8962, 282, 41637, 502, 4867, 117396, 21732, 26265, 5443, 217, 6096, 31, 190355, 8781, 81979, 1250, 28219, 144851, 1528, 7134, 46429, 3501, 977, 892, 26255, ...

[ 0.137939453125, 0.1634521484375, 0.16748046875, 0.2332763671875, 0.110107421875, 0.1629638671875, 0.051727294921875, 0.100341796875, 0.1041259765625, 0.277587890625, 0.1575927734375, 0.005615234375, 0.191650390625, 0.0748291015625, 0.082763671875, 0.03594970703125, 0.0144500732421875...

embed

36556702_c0

36556702

prolog

0

Title: How to avoid Out of global stack ERROR when looking for multiple answers? Problem title: How to avoid Out of global stack ERROR when looking for multiple answers? Tags: failure-slice, prolog Problem: How to avoid Out of global stack ERROR when looking for multiple answers? After loading the following program usi...

How to avoid Out of global stack ERROR when looking for multiple answers? How to avoid Out of global stack ERROR when looking for multiple answers? failure-slice prolog How Out ERROR How to avoid Out of global stack ERROR when looking for multiple answers? After loading the following program using SWI-Prolog and enteri...

[ 0.003936767578125, 0.0198974609375, 0.0019073486328125, 0.0198974609375, -0.0037994384765625, 0.0045166015625, -0.00909423828125, 0.0269775390625, 0.0120849609375, -0.044921875, 0.0162353515625, -0.003814697265625, -0.00077056884765625, -0.00469970703125, 0.02880859375, 0.0071411132812...

[ 11249, 71864, 13538, 111, 7964, 177261, 151206, 24638, 3229, 16487, 100, 48716, 35166, 47, 137578, 7, 13348, 502, 4867, 72367, 25632, 1528, 159, 38969, 9, 10752, 41, 5117, 16750, 37202, 11343, 26785, 137447, 40, 46029, 4759, 6713, 1286, 503...

[ 0.112060546875, 0.2159423828125, 0.2340087890625, 0.210693359375, 0.2313232421875, 0.2646484375, 0.1968994140625, 0.15234375, 0.0284576416015625, 0.1378173828125, 0.10162353515625, 0.1971435546875, 0.197998046875, 0.009918212890625, 0.235107421875, 0.0167388916015625, 0.2005615234375...

embed

22442853_c0

22442853

prolog

0

Title: Is it acceptable for a prolog procedure to work only one way? Problem title: Is it acceptable for a prolog procedure to work only one way? Tags: prolog, logic Problem: Is it acceptable for a prolog procedure to work only one way? I have a prolog program: link(liverpool,preston). link(liverpool,manchester). link(...

Is it acceptable for a prolog procedure to work only one way? Is it acceptable for a prolog procedure to work only one way? prolog logic BList CList Result Is it acceptable for a prolog procedure to work only one way? I have a prolog program: Merge works if I call it like this: merge([a,b,c],[d,e,f],Result). --> [a,b,c...

[ 0.0152587890625, 0.02685546875, 0.0228271484375, 0.0002593994140625, -0.0234375, 0.007080078125, -0.01708984375, -0.004486083984375, 0.012939453125, -0.0260009765625, -0.006622314453125, 0.0062255859375, -0.0045166015625, 0.004608154296875, 0.0191650390625, 0.0023345947265625, 0.0059...

[ 2071, 213850, 502, 4867, 50491, 4488, 4734, 1632, 3917, 62775, 335, 154663, 313, 126684, 1528, 6035, 429, 43240, 2174, 11782, 1884, 903, 42564, 275, 238, 420, 7, 7136, 5526, 82775, 86869, 1542, 71, 177261, 645, 118664, 137567, 123166, 32354...

[ 0.0285186767578125, 0.2213134765625, 0.1900634765625, 0.276123046875, 0.208251953125, 0.1466064453125, 0.124755859375, 0.156982421875, 0.193115234375, 0.1845703125, 0.062255859375, 0.2083740234375, 0.0298614501953125, 0.1627197265625, 0.1573486328125, 0.2158203125, 0.194580078125, ...

embed

59120867_c0

59120867

prolog

0

Title: Given a few facts in prolog. I can't seem to create a rule which returns the variables don't have a relationship with given variable Problem title: Given a few facts in prolog. I can't seem to create a rule which returns the variables don't have a relationship with given variable Tags: prolog...

Given a few facts in prolog. I can't seem to create a rule which returns the variables don't have a relationship with given variable Given a few facts in prolog. I can't seem to create a rule which returns the variables don't have a relationship with given variable prolog Given beggining_letters mid...

[ 0.0198974609375, -0.0011749267578125, -0.0020751953125, 0.008056640625, -0.00823974609375, 0.017578125, 0.00067901611328125, 0.001983642578125, -0.0026702880859375, 0.0301513671875, -0.0242919921875, -0.006317138671875, 0.003814697265625, 0.0179443359375, 0.0120849609375, 0.01086425781...

[ 77878, 19, 10846, 15824, 502, 4867, 48903, 28282, 79986, 30646, 77336, 3768, 18, 765, 76755, 678, 34475, 23, 2301, 10, 186, 16680, 592, 63049, 86991, 4568, 35064, 831, 27798, 959, 86, 6958, 3422, 7, 756, 120820, 208244, 47, 31330, 1542, ...

[ 0.07135009765625, 0.002960205078125, 0.053924560546875, 0.09454345703125, 0.12890625, 0.1966552734375, 0.0171356201171875, 0.078369140625, 0.1639404296875, 0.142578125, 0.2159423828125, 0.025054931640625, 0.0672607421875, 0.0604248046875, 0.1461181640625, 0.038421630859375, 0.1114501...

embed

45306615_c0

45306615

prolog

0

Title: Prolog: syntactically correct objects + relation vs. structure Problem title: Prolog: syntactically correct objects + relation vs. structure Tags: syntax, prolog Problem: Prolog: syntactically correct objects + relation vs. structure I'm new to Prolog and gradually working my way through Ivan Bratko's 'Prolog Pr...

Prolog: syntactically correct objects + relation vs. structure Prolog: syntactically correct objects + relation vs. structure syntax prolog Prolog Prolog: syntactically correct objects + relation vs. structure I'm new to Prolog and gradually working my way through Ivan Bratko's 'Prolog Programming for Artificial Intell...

[ 0.0216064453125, 0.0238037109375, 0.006744384765625, 0.000858306884765625, 0.004150390625, 0.01495361328125, -0.002532958984375, 0.00811767578125, -0.0008087158203125, -0.0224609375, 0.0022735595703125, -0.015380859375, -0.0034637451171875, -0.007080078125, 0.00136566162109375, -0.0148...

[ 1250, 4867, 6002, 18, 47013, 26785, 36746, 997, 41911, 20209, 45646, 86531, 502, 3525, 23698, 119794, 265, 10752, 27958, 100, 231996, 157075, 81979, 34513, 22469, 5606, 35782, 1957, 15400, 190, 132, 1542, 4, 1723, 83, 959, 12960, 65158, 256...

[ 0.1629638671875, 0.25439453125, 0.1483154296875, 0.12744140625, 0.1546630859375, 0.2264404296875, 0.189453125, 0.18017578125, 0.22412109375, 0.1063232421875, 0.246826171875, 0.10498046875, 0.09906005859375, 0.00128173828125, 0.044708251953125, 0.1007080078125, 0.1336669921875, 0.16...

embed

46500822_c0

46500822

prolog

0

Title: Skipping list of lists elements Problem title: Skipping list of lists elements Tags: list, prolog Problem: Skipping list of lists elements I have this nested list: list = [[1, 2, 3, 4], [2, 7, 2, 1], [3, 3, 7, 5], [4, 4, 1, 7]] And I'm trying to skip the first list of this nested list, and the first element of e...

Skipping list of lists elements Skipping list of lists elements list prolog Skipping skip_first_list Tail HeadTail Skipping list of lists elements I have this nested list: And I'm trying to skip the first list of this nested list, and the first element of each list. I want it to become like this: So far I have this: Wh...

[ -0.00897216796875, 0.01904296875, 0.00665283203125, 0.0087890625, -0.0264892578125, 0.0213623046875, 0.00958251953125, 0.002197265625, 0.0194091796875, -0.005859375, 0.004669189453125, -0.0029144287109375, -0.019287109375, 0.015625, -0.00128173828125, 0.01507568359375, 0.016723632812...

[ 20491, 26783, 5303, 111, 7, 80854, 502, 4867, 21658, 13448, 271, 6562, 1218, 379, 44816, 9874, 903, 8512, 71, 31577, 47, 5117, 12830, 12638, 3444, 24209, 1884, 2060, 959, 27489, 26785, 16750, 37202, 141377, 1747, 96819, 23, 39531, 73, 323...

[ 0.19384765625, 0.1240234375, 0.2061767578125, 0.09552001953125, 0.0235595703125, 0.1737060546875, 0.134765625, 0.2296142578125, 0.2103271484375, 0.0751953125, 0.051422119140625, 0.1923828125, 0.1038818359375, 0.09100341796875, 0.0880126953125, 0.1162109375, 0.015289306640625, 0.176...

embed

9983206_c0

9983206

prolog

0

Title: Prolog: where to begin solving Minesweeper-like puzzle? Problem title: Prolog: where to begin solving Minesweeper-like puzzle? Tags: puzzle, prolog Problem: Prolog: where to begin solving Minesweeper-like puzzle? I need to write something like a minesweeper in prolog. I am able to do that in "normal" language bu...

Prolog: where to begin solving Minesweeper-like puzzle? Prolog: where to begin solving Minesweeper-like puzzle? puzzle prolog Prolog Minesweeper-like Prolog: where to begin solving Minesweeper-like puzzle? I need to write something like a minesweeper in prolog. I am able to do that in "normal" language but when i try t...

[ 0.01336669921875, -0.00250244140625, -0.004241943359375, 0.0008087158203125, -0.0115966796875, 0.000308990478515625, 0.0013885498046875, 0.0031280517578125, -0.0162353515625, -0.025390625, -0.0023040771484375, 0.01953125, 0.00860595703125, -0.0038909912109375, 0.0017852783203125, 0.003...

[ 1250, 4867, 7440, 9842, 3115, 6496, 56713, 7, 1177, 13, 1264, 5062, 104192, 502, 47, 3871, 33022, 9844, 1884, 10, 5665, 23, 19048, 33176, 46876, 9790, 4034, 552, 6238, 678, 112668, 18, 3714, 3642, 6305, 360, 7077, 29458, 62554, 13267, 3...

[ 0.1817626953125, 0.25732421875, 0.10205078125, 0.13720703125, 0.151123046875, 0.09381103515625, 0.201416015625, 0.1085205078125, 0.2010498046875, 0.166259765625, 0.205810546875, 0.1690673828125, 0.23388671875, 0.175537109375, 0.0213623046875, 0.052215576171875, 0.1790771484375, 0.0...

embed

16238426_c0

16238426

prolog

0

Title: Mistakes in my facts? (Prolog) Problem title: Mistakes in my facts? (Prolog) Tags: prolog Problem: Mistakes in my facts? (Prolog) parent(_,_). descendant(X,Y):- parent(Y,X). descendant(edward,david). descendant(malcolm,mark). descendant(edward,therese). descendant(malcolm,nathalie). descendant(matthew,raymond). ...

Mistakes in my facts? (Prolog) Mistakes in my facts? (Prolog) prolog Mistakes Prolog Mistakes in my facts? (Prolog) The problem here is that for some reason the code isn't working. What I mean by that is that no matter what queries I input regarding this code it always returns true (I'm not including all the atoms in m...

[ 0.044677734375, 0.0145263671875, 0.0120849609375, 0.0040283203125, -0.0205078125, 0.01495361328125, 0.00244140625, -0.005157470703125, -0.01422119140625, -0.033935546875, 0.01361083984375, -0.0220947265625, -0.0108642578125, 0.00238037109375, 0.01202392578125, 0.0155029296875, 0.0163...

[ 7950, 1865, 90, 23, 759, 15824, 7, 32, 10752, 4867, 502, 1250, 2967, 3688, 31635, 18151, 56112, 18, 20697, 29459, 110, 26866, 41, 107730, 118861, 903, 11343, 30646, 29568, 26719, 756, 34627, 1528, 2806, 8781, 11280, 1542, 707, 117776, 339...

[ 0.1055908203125, 0.1993408203125, 0.0875244140625, 0.1304931640625, 0.123046875, 0.198486328125, 0.1220703125, 0.0294647216796875, 0.1123046875, 0.1773681640625, 0.106201171875, 0.1396484375, 0.115234375, 0.03582763671875, 0.022552490234375, 0.2025146484375, 0.032196044921875, 0.06...

embed

36635273_c0

36635273

prolog

0

Title: Possible list permutation using a given formula Problem title: Possible list permutation using a given formula Tags: prolog, permutation, list Problem: Possible list permutation using a given formula I am trying to get my head wrap around lists in Prolog. To do this I am trying to create a sort of game. You pass...

Possible list permutation using a given formula Possible list permutation using a given formula prolog permutation list a Possible Possible list permutation using a given formula I am trying to get my head wrap around lists in Prolog. To do this I am trying to create a sort of game. You pass in a list of numbers 1-9 th...

[ 0.017333984375, 0.0322265625, -0.0040283203125, -0.0035400390625, -0.0013885498046875, -0.00188446044921875, -0.022705078125, 0.0093994140625, 0.02294921875, -0.03369140625, -0.01251220703125, -0.003204345703125, -0.0079345703125, 0.017822265625, -0.006988525390625, -0.00286865234375, ...

[ 115861, 2661, 5303, 117, 561, 22062, 17368, 34475, 26168, 502, 4867, 10, 31577, 759, 10336, 137565, 10932, 7, 23, 1250, 28282, 12096, 111, 6712, 27875, 101935, 106, 15205, 831, 186, 119140, 297, 2499, 140909, 91736, 72134, 1295, 70, 5117, ...

[ 0.21630859375, 0.143310546875, 0.276123046875, 0.1517333984375, 0.2259521484375, 0.1146240234375, 0.1219482421875, 0.169189453125, 0.26171875, 0.1832275390625, 0.2447509765625, 0.030364990234375, 0.0843505859375, 0.00701904296875, 0.0908203125, 0.079833984375, 0.0765380859375, 0.04...

embed

30223006_c0

30223006

prolog

0

Title: SWI Prolog 5.8.3 - div is not a function? Problem title: SWI Prolog 5.8.3 - div is not a function? Tags: swi-prolog, prolog Problem: SWI Prolog 5.8.3 - div is not a function? In my program I have a predicate number_to_unique_bits_list , that receives a number and a list of booleans, and returns a a boolean formu...

SWI Prolog 5.8.3 - div is not a function? SWI Prolog 5.8.3 - div is not a function? swi-prolog prolog SWI Prolog number_to_unique_bits_list IntegerNumber Bit RestBits ResultBit RestResultBits ModRes Divided not_on_sat SWI Prolog 5.8.3 - div is not a function? In my program I have a predicate number_to_unique_bits_list ...

[ -0.01416015625, -0.00058746337890625, 0.028564453125, -0.0081787109375, 0.0013580322265625, 0.01019287109375, -0.01129150390625, 0.00145721435546875, 0.01611328125, -0.05126953125, 0.003509521484375, -0.000858306884765625, 0.0030975341796875, 0.00482177734375, 0.01434326171875, -0.0133...

[ 159, 38969, 1250, 4867, 190, 52196, 363, 18221, 83, 959, 10, 32354, 2452, 3454, 502, 14012, 188, 34, 45602, 3137, 6562, 44401, 27774, 49756, 571, 14481, 126684, 217, 16269, 4332, 76278, 48141, 191, 6489, 1528, 1653, 2063, 53299, 5303, 337...

[ 0.06365966796875, 0.2313232421875, 0.1624755859375, 0.2242431640625, 0.09954833984375, 0.18017578125, 0.16064453125, 0.273681640625, 0.1160888671875, 0.1824951171875, 0.1005859375, 0.2197265625, 0.1610107421875, 0.10302734375, 0.098876953125, 0.1651611328125, 0.1444091796875, 0.063...

embed

33785865_c0

33785865

prolog

0

Title: Prolog: How to compose two "functions", to find the min of the squares of my list? Problem title: Prolog: How to compose two "functions", to find the min of the squares of my list? Tags: function-composition, composition, prolog Problem: Prolog: How to compose two "functions", to find the min...

Prolog: How to compose two "functions", to find the min of the squares of my list? Prolog: How to compose two "functions", to find the min of the squares of my list? function-composition composition prolog Prolog How First Rest FirstSquared SquareRest result_List Answer Prolog: How to compose two "f...

[ 0.006378173828125, -0.00390625, 0.02294921875, 0.0247802734375, -0.012939453125, 0.0203857421875, 0.01263427734375, 0.00518798828125, -0.00185394287109375, -0.010498046875, 0.01434326171875, 0.012451171875, 0.0048828125, -0.010986328125, 0, -0.0166015625, -0.005401611328125, 0.0106...

[ 1250, 4867, 11249, 150350, 6626, 137175, 7413, 881, 111, 108047, 7, 759, 5303, 32354, 277, 40322, 166577, 502, 23972, 49756, 94727, 297, 68305, 1052, 525, 16750, 154663, 130373, 52080, 9655, 2967, 2060, 19048, 3249, 214, 3714, 11782, 3525, ...

[ 0.13720703125, 0.233154296875, 0.07916259765625, 0.2291259765625, 0.19873046875, 0.2191162109375, 0.08404541015625, 0.254638671875, 0.0714111328125, 0.17138671875, 0.008819580078125, 0.051483154296875, 0.2156982421875, 0.158935546875, 0.086669921875, 0.0914306640625, 0.1741943359375,...

embed

27786010_c0

27786010

prolog

0

Title: Prolog "Not together in source file" and "Singleton Variable" errors Problem title: Prolog "Not together in source file" and "Singleton Variable" errors Tags: prolog, singleton Problem: Prolog "Not together in source file" and "Singleton Variable" errors %Sitting room / Ki...

Prolog "Not together in source file" and "Singleton Variable" errors Prolog "Not together in source file" and "Singleton Variable" errors prolog singleton Prolog Not Singleton Variable Clauses Warning test.pl:27 test.pl:28 test.pl:34 test.pl:36 test.pl:37 test.pl:38 test.pl:40 te...

[ 0.0264892578125, 0.0224609375, -0.0005950927734375, -0.01422119140625, -0.006378173828125, 0.018798828125, -0.0174560546875, -0.007659912109375, 0.00933837890625, -0.027587890625, -0.0177001953125, -0.0045166015625, 0.0038299560546875, -0.0189208984375, 0.020263671875, -0.0000202655792...

[ 1250, 4867, 41502, 122116, 25842, 23, 31344, 11435, 136, 213039, 1507, 84572, 2886, 18499, 502, 11001, 11205, 43609, 100700, 5550, 3034, 2424, 27592, 28270, 30197, 32944, 30225, 34179, 22932, 33529, 35167, 23924, 112997, 33915, 24453, 25134, 34...

[ 0.194580078125, 0.28369140625, 0.0057373046875, 0.1922607421875, 0.27001953125, 0.1246337890625, 0.2401123046875, 0.20654296875, 0.0273590087890625, 0.1990966796875, 0.1766357421875, 0.1806640625, 0.1265869140625, 0.202880859375, 0.1552734375, 0.1328125, 0.105224609375, 0.151489257...

embed

51673750_c1

51673750

prolog

1

y, is, ten, fullstop ]). lpsolve(Data, Answers):- lpsolve( [], Variables, Answers, Data, [] ). % labeling( [], Variables ). lpsolve( PreviousVariables, CurrentVariables, Answers, Data, Remainder ) :- sentence(Answers, Data,Remainder). lpsolve( PreviousVariables, CurrentVariables, Answers, Data, Remainder ) :- sentence...

[ 0.01092529296875, 0.00848388671875, -0.00885009765625, 0.0257568359375, -0.01214599609375, 0.0213623046875, 0.01458740234375, -0.00396728515625, 0.0096435546875, -0.038818359375, -0.00927734375, 0.000919342041015625, 0.005889892578125, 0.0023040771484375, 0.010009765625, 0.027954101562...

[ 113, 83, 1492, 4393, 19111, 96, 86918, 137989, 4, 130373, 111477, 13566, 11809, 1745, 67967, 254, 6422, 81827, 14, 19736, 114063, 853, 24931, 820, 149357, 7251, 7, 42844, 4332, 2517, 4153, 95211, 1177, 1542, 179665, 42792, 21690, 164, 1029,...

[ 0.175048828125, 0.1875, 0.2447509765625, 0.117431640625, 0.2078857421875, 0.0180206298828125, 0.1905517578125, 0.1202392578125, 0.01007080078125, 0.28369140625, 0.23095703125, 0.1702880859375, 0.1260986328125, 0.087158203125, 0.1566162109375, 0.00079345703125, 0.1201171875, 0.15051...

embed

12826174_c0

12826174

prolog

0

Title: Rectangular Peg Solitaire in Prolog? Problem title: Rectangular Peg Solitaire in Prolog? Tags: counter, prolog, recursion Problem: Rectangular Peg Solitaire in Prolog? possible quick question here since I'm new to Prolog. I'm trying to convert this code for solving a triangular peg solitaire puzzle into solving ...

Rectangular Peg Solitaire in Prolog? Rectangular Peg Solitaire in Prolog? counter prolog recursion Rectangular Peg Solitaire Prolog Legal Rotate One BRJ Series Rest Rectangular Peg Solitaire in Prolog? possible quick question here since I'm new to Prolog. I'm trying to convert this code for solving a triangular peg sol...

[ -0.01080322265625, -0.00592041015625, 0.0159912109375, 0.0152587890625, -0.016357421875, 0.0272216796875, -0.01080322265625, 0.01434326171875, 0.01043701171875, -0.0166015625, -0.0306396484375, 0.0086669921875, 0.0244140625, -0.0179443359375, 0.002227783203125, 0.00897216796875, 0.00...

[ 48224, 14525, 35975, 1460, 177, 124725, 44386, 1250, 4867, 23, 105416, 502, 195625, 51825, 146283, 6561, 60310, 64876, 49756, 32, 7722, 63773, 96760, 18151, 3115, 1927, 1463, 280, 20245, 104192, 148734, 10393, 320, 2967, 7808, 2633, 1528, 371...

[ 0.054412841796875, 0.1671142578125, 0.1990966796875, 0.2069091796875, 0.1732177734375, 0.1405029296875, 0.221435546875, 0.171142578125, 0.256591796875, 0.0799560546875, 0.2174072265625, 0.08941650390625, 0.1015625, 0.1094970703125, 0.0806884765625, 0.091796875, 0.114013671875, 0.07...

embed

63200623_c1

63200623

prolog

1

2). product(2, 2, 1). % repeating product n2 because it can lay horizontal or vertical product(3, 1, 3). product(3, 3, 1). % idem product(4, 3, 3). % is square so does not need it product(5, 2, 3). product(5, 3, 2). % iden product(6, 4, 2). product(6, 2, 4). % idem % because it can lay virtically or horizontally in a ...

[ -0.00080108642578125, 0.016357421875, -0.01318359375, 0.01361083984375, -0.017822265625, -0.0034027099609375, -0.01190185546875, -0.00043487548828125, 0.01611328125, -0.00689697265625, 0.01153564453125, 0.0108642578125, 0.007659912109375, -0.0218505859375, -0.0006256103515625, -0.00866...

[ 4958, 12996, 54753, 116, 4879, 1745, 119140, 214, 304, 6637, 831, 21, 53, 124001, 707, 79259, 86827, 8439, 138, 50638, 105801, 108047, 221, 959, 3871, 104116, 17, 555, 139303, 201, 13956, 1017, 23, 16530, 9319, 7514, 58302, 77554, 18444, ...

[ 0.1307373046875, 0.274658203125, 0.084228515625, 0.12255859375, 0.0253448486328125, 0.0889892578125, 0.2220458984375, 0.033843994140625, 0.10546875, 0.06549072265625, 0.10223388671875, 0.09088134765625, 0.07879638671875, 0.15869140625, 0.0455322265625, 0.161376953125, 0.0114440917968...

embed

48751921_c0

48751921

prolog

0

Title: In Prolog, how to sort even and odd numbers represented with symbols and chains of predicates? Problem title: In Prolog, how to sort even and odd numbers represented with symbols and chains of predicates? Tags: prolog, knowledge-management Problem: In Prolog, how to sort even and odd numbers represented with sym...

In Prolog, how to sort even and odd numbers represented with symbols and chains of predicates? In Prolog, how to sort even and odd numbers represented with symbols and chains of predicates? prolog knowledge-management Prolog if_larger elder_than Next In Prolog, how to sort even and odd numbers represented with symbols ...

[ 0.0047607421875, 0.0166015625, 0.01190185546875, 0.0098876953125, -0.00616455078125, 0.0252685546875, -0.006439208984375, 0.006500244140625, 0.015869140625, -0.0164794921875, 0.003387451171875, 0.01116943359375, 0.0021514892578125, -0.0062255859375, 0.0234375, -0.0020904541015625, -0...

[ 360, 1250, 4867, 3642, 47, 12096, 3853, 136, 70270, 101935, 33636, 678, 26582, 121293, 111, 1653, 2063, 1636, 297, 502, 51359, 87140, 2174, 320, 88, 820, 21732, 4997, 44759, 13648, 151581, 1957, 18151, 70, 25632, 12989, 1632, 17262, 43606, ...

[ 0.04364013671875, 0.189453125, 0.258544921875, 0.081787109375, 0.06640625, 0.251708984375, 0.198974609375, 0.1331787109375, 0.25927734375, 0.2362060546875, 0.1962890625, 0.0831298828125, 0.209228515625, 0.1553955078125, 0.06573486328125, 0.1558837890625, 0.1849365234375, 0.10644531...

embed

72555579_c0

72555579

prolog

0

Title: Type error: file_name_extension/3 `character_code' expected , found `row(1, 410021001, 'Alan', 90, 84.5, 117, 60, 66)' (a compound) Problem title: Type error: file_name_extension/3 `character_code' expected , found `row(1, 410021001, 'Alan', 90, 84.5, 117, 60, 66)' (a comp...

Type error: file_name_extension/3 `character_code' expected , found `row(1, 410021001, 'Alan', 90, 84.5, 117, 60, 66)' (a compound) Type error: file_name_extension/3 `character_code' expected , found `row(1, 410021001, 'Alan', 90, 84.5, 117, 60, 66)' (a compound) swi-prolog-for-s...

[ 0.01336669921875, -0.002288818359375, 0.008544921875, 0.023193359375, -0.006317138671875, -0.00185394287109375, -0.0022430419921875, 0.003997802734375, -0.0157470703125, 0.0126953125, -0.0042724609375, -0.015380859375, -0.01141357421875, -0.0146484375, -0.0074462890625, -0.007049560546...

[ 60457, 18499, 11435, 11627, 3355, 128872, 18113, 9254, 2263, 720, 40899, 3768, 84751, 14037, 15555, 201, 3559, 3117, 34479, 284, 1414, 2510, 382, 104867, 53373, 1496, 84308, 11, 217773, 91, 2452, 3454, 4867, 2420, 2852, 502, 38969, 10752, 3...

[ 0.1903076171875, 0.2025146484375, 0.15966796875, 0.125732421875, 0.07958984375, 0.1566162109375, 0.20703125, 0.06805419921875, 0.10235595703125, 0.076904296875, 0.1962890625, 0.1400146484375, 0.2119140625, 0.0791015625, 0.188232421875, 0.055877685546875, 0.0732421875, 0.10180664062...

embed

41227318_c1

41227318

prolog

1

3rd'),nl; reduce1(New3,NextVal3,-(New2-SecondSize))-> NextVal2 is 0, NextVal1 is New1, write('From 3rd to 2nd'),nl; reduce2(New1, NextVal1, New2, SecondSize)-> NextVal2 is 0, NextVal3 is New3, write('From 2nd to 1st'),nl; reduce2(New1, NextVal1, New3, ThirdSize)-> NextVal3 is 0, NextVal2 is New2, write('From 3rd to 1s...

[ -0.0220947265625, 0.0294189453125, -0.0033111572265625, 0.01220703125, -0.01214599609375, -0.0019683837890625, -0.02734375, 0.010986328125, 0.013671875, 0.026611328125, 0.0025787353515625, 0.00653076171875, 0.003173828125, -0.00384521484375, 0.0029449462890625, 0.008544921875, -0.003...

[ 138, 4216, 25, 13169, 34390, 46568, 363, 81280, 42272, 18504, 2271, 127167, 4997, 304, 757, 2356, 33022, 168407, 47, 116, 2208, 77648, 198387, 271, 3314, 177, 25813, 207263, 117177, 17903, 289, 397, 2811, 1193, 391, 2016, 4426, 80378, 418, ...

[ 0.149658203125, 0.1573486328125, 0.0195159912109375, 0.088134765625, 0.187744140625, 0.078125, 0.1298828125, 0.0755615234375, 0.1551513671875, 0.0164794921875, 0.0020751953125, 0.130615234375, 0.08624267578125, 0.07281494140625, 0.1041259765625, 0.0709228515625, 0.0953369140625, 0....

embed

41858094_c1

41858094

prolog

1

inburgh). adjacent(leicester, sheffield). adjacent(sheffield, manchester). adjacent(peterborough, york). adjacent(york, newcastle). adjacent(newcastle, edinburgh). And the following rules: Rule that makes the adjacent relationships two-way: twoWay(X, Y) :- adjacent(X, Y); adjacent(Y, X). And my rule that returns the li...

[ 0.006988525390625, -0.0098876953125, 0.0115966796875, 0.0269775390625, 0.00616455078125, 0.00665283203125, 0.0159912109375, 0.00799560546875, 0.0203857421875, -0.04443359375, -0.0120849609375, 0.019775390625, 0.00872802734375, 0.00421142578125, 0.00860595703125, -0.003509521484375, 0...

[ 23, 13593, 127, 123594, 16797, 2980, 1515, 2412, 420, 28394, 108282, 104588, 184721, 70662, 13437, 3525, 55741, 133, 23251, 25632, 91736, 139118, 30482, 151618, 6626, 7514, 22489, 1542, 990, 1193, 759, 79986, 30646, 5303, 29398, 34475, 13315, ...

[ 0.117919921875, 0.17333984375, 0.11669921875, 0.1849365234375, 0.211181640625, 0.11083984375, 0.13720703125, 0.042999267578125, 0.0733642578125, 0.2125244140625, 0.098388671875, 0.1298828125, 0.1881103515625, 0.0665283203125, 0.0753173828125, 0.018463134765625, 0.080810546875, 0.05...

embed

13112816_c0

13112816

prolog

0

Title: Determine even position in a list and take out second occurence Problem title: Determine even position in a list and take out second occurence Tags: prolog Problem: Determine even position in a list and take out second occurence I just learned prolog for a week and I have to write a prolog program that counts th...

Determine even position in a list and take out second occurence Determine even position in a list and take out second occurence prolog Determine Determine even position in a list and take out second occurence I just learned prolog for a week and I have to write a prolog program that counts the number of times an elemen...

[ 0.009521484375, 0.01190185546875, 0.0035858154296875, 0.01080322265625, 0.00921630859375, 0.02001953125, -0.01214599609375, 0.00775146484375, 0.021240234375, -0.02490234375, 0.0003337860107421875, -0.01953125, 0.00634765625, 0.0169677734375, 0.01019287109375, 0.0091552734375, 0.00283...

[ 262, 30524, 13, 3853, 19069, 23, 5303, 136, 5646, 1810, 17932, 74918, 6620, 502, 4867, 97384, 5895, 33022, 1528, 54529, 14012, 20028, 12830, 108975, 214, 339, 99, 9790, 26366, 2967, 444, 40008, 5036, 201, 6632, 4568, 611, 21974, 35782, 37...

[ 0.057708740234375, 0.184326171875, 0.0284423828125, 0.2078857421875, 0.231689453125, 0.04620361328125, 0.20751953125, 0.0169219970703125, 0.12890625, 0.1580810546875, 0.18017578125, 0.17919921875, 0.1021728515625, 0.1116943359375, 0.1875, 0.063232421875, 0.003936767578125, 0.029235...

embed

69698132_c1

69698132

prolog

1

(Y)), tree(leaf(Y), SwapB1)) :- dif(B1, leaf(_)), swap(B1, SwapB1). swap(tree(leaf(X), B2), tree(SwapB2, leaf(X))) :- dif(B2, leaf(_)), swap(B2, SwapB2). swap(tree(B1, B2), tree(B2,B1)) :- dif(B1, leaf(_)), dif(B2, leaf(_)). When I execute the following query swap(T1,T). I get: ?- swap(T1,T). T1 = tree(leaf(_A), leaf(_...

[ 0.005706787109375, 0.0125732421875, -0.0024871826171875, 0.004058837890625, -0.00128173828125, -0.00811767578125, -0.04296875, -0.0169677734375, -0.008544921875, -0.01251220703125, -0.006927490234375, 0.01043701171875, -0.003753662109375, 0.00147247314453125, 0.01556396484375, 0.017822...

[ 1723, 247, 53201, 133, 2407, 43062, 254, 571, 17727, 15772, 45755, 418, 95, 202317, 62600, 1542, 335, 10461, 634, 304, 71924, 25632, 41, 1294, 618, 4, 2046, 705, 384, 2203, 397, 80126, 1250, 4867, 959, 179635, 756, 51347, 12638, 14012, ...

[ 0.1304931640625, 0.026519775390625, 0.2215576171875, 0.08258056640625, 0.1776123046875, 0.195556640625, 0.1192626953125, 0.109130859375, 0.08984375, 0.0716552734375, 0.1834716796875, 0.123046875, 0.027801513671875, 0.270263671875, 0.1793212890625, 0.042755126953125, 0.054046630859375...

embed

16214184_c0

16214184

prolog

0

Title: SWI prolog make set of variables name with rbtrees or others means Problem title: SWI prolog make set of variables name with rbtrees or others means Tags: tree, prolog, set, variables Problem: SWI prolog make set of variables name with rbtrees or others means I have got a term from which I want to get set of var...

SWI prolog make set of variables name with rbtrees or others means SWI prolog make set of variables name with rbtrees or others means tree prolog set variables SWI only_one rb_in rb_insert SWI prolog make set of variables name with rbtrees or others means I have got a term from which I want to get set of variables name...

[ 0.0201416015625, 0.016357421875, 0.0093994140625, 0.0035552978515625, -0.008056640625, -0.00024127960205078125, -0.0198974609375, 0.0250244140625, 0.0031890869140625, -0.04248046875, 0.01019287109375, 0.0145263671875, 0.00994873046875, 0.00002014636993408203, 0.01324462890625, 0.013793...

[ 159, 38969, 502, 4867, 3249, 5423, 111, 77336, 7, 9351, 678, 13471, 2921, 90, 27060, 26950, 53201, 4734, 3630, 73, 33657, 4163, 13579, 1295, 3444, 2046, 107730, 759, 39, 11, 24084, 397, 140992, 571, 441, 12989, 170894, 21690, 2886, 11627,...

[ 0.0302734375, 0.225341796875, 0.14990234375, 0.1971435546875, 0.034149169921875, 0.2012939453125, 0.056732177734375, 0.2440185546875, 0.012237548828125, 0.1463623046875, 0.09326171875, 0.137939453125, 0.20263671875, 0.1280517578125, 0.06585693359375, 0.01715087890625, 0.1849365234375...

embed

23050202_c0

23050202

prolog

0

Title: Prolog: String data not displaying properly inside ELSE clause Problem title: Prolog: String data not displaying properly inside ELSE clause Tags: prolog Problem: Prolog: String data not displaying properly inside ELSE clause I have a function that allows the user to enter a single quoted string (A), then search...

Prolog: String data not displaying properly inside ELSE clause Prolog: String data not displaying properly inside ELSE clause prolog Prolog FIRST CHECK SLOT DISPLAY DATA THEN PASS Name Grade Prolog: String data not displaying properly inside ELSE clause I have a function that allows the user to enter a single quoted st...

[ 0.019775390625, 0.000850677490234375, 0.00457763671875, 0.037109375, 0.00121307373046875, 0.027099609375, 0.017333984375, -0.00994873046875, 0.017333984375, 0.024658203125, 0.0235595703125, -0.0079345703125, -0.002838134765625, -0.006744384765625, 0.005035400390625, 0.01092529296875, ...

[ 1250, 4867, 23351, 214, 2053, 44116, 155965, 46132, 96922, 70731, 959, 502, 133907, 83556, 20572, 115447, 209973, 103695, 391, 17758, 8436, 15757, 22453, 13, 32354, 114864, 38937, 30957, 11001, 66747, 79315, 284, 33938, 5303, 1614, 6562, 1542, ...

[ 0.135498046875, 0.214599609375, 0.1842041015625, 0.082763671875, 0.1807861328125, 0.1806640625, 0.1072998046875, 0.099853515625, 0.233642578125, 0.173095703125, 0.03656005859375, 0.1007080078125, 0.0151214599609375, 0.08917236328125, 0.03399658203125, 0.09808349609375, 0.051177978515...

embed

55024606_c0

55024606

prolog

0

Title: Shifting a list N times using Prolog [] issue :- Exercise 3.6 “ Prolog Programming for Artificial Intelligence” by Ivan Btrako Problem title: Shifting a list N times using Prolog [] issue :- Exercise 3.6 “ Prolog Programming for Artificial Intelligence” by Ivan Btrako Tags: prolog, list Problem: Shifting a list ...

Shifting a list N times using Prolog [] issue :- Exercise 3.6 “ Prolog Programming for Artificial Intelligence” by Ivan Btrako Shifting a list N times using Prolog [] issue :- Exercise 3.6 “ Prolog Programming for Artificial Intelligence” by Ivan Btrako prolog list Prolog Shifting Exercise Programming Artificial Intell...

[ 0.005889892578125, 0.000732421875, 0.015869140625, 0.00384521484375, -0.01361083984375, -0.0196533203125, -0.033203125, 0.00872802734375, -0.00811767578125, -0.01055908203125, 0.0087890625, 0.00469970703125, -0.0125732421875, 0.004119873046875, 0.0019073486328125, 0.0208740234375, 0....

[ 8294, 2480, 5303, 541, 20028, 17368, 1250, 4867, 31089, 155534, 102738, 27958, 231996, 157075, 23698, 13151, 502, 32036, 304, 3444, 28282, 1653, 2063, 122925, 154663, 418, 10461, 47014, 12830, 25737, 89536, 75935, 67, 44691, 18, 28219, 15400, ...

[ 0.1783447265625, 0.1787109375, 0.2335205078125, 0.13623046875, 0.1856689453125, 0.0609130859375, 0.1622314453125, 0.221435546875, 0.07183837890625, 0.1353759765625, 0.1424560546875, 0.1099853515625, 0.10205078125, 0.110595703125, 0.0999755859375, 0.156494140625, 0.004913330078125, ...

embed

69529482_c0

69529482

prolog

0

Title: Calculating syntactic complexity of a prolog predicate Problem title: Calculating syntactic complexity of a prolog predicate Tags: prolog Problem: Calculating syntactic complexity of a prolog predicate Currently working on an exercise where, given some predicate, the syntactic complexity has to be calculated. Th...

Calculating syntactic complexity of a prolog predicate Calculating syntactic complexity of a prolog predicate prolog Calculating Total Calculating syntactic complexity of a prolog predicate Currently working on an exercise where, given some predicate, the syntactic complexity has to be calculated. The syntactic complex...

[ 0.01104736328125, 0.0137939453125, -0.005828857421875, 0.00897216796875, -0.01068115234375, 0.018798828125, 0.01263427734375, -0.006317138671875, -0.0167236328125, -0.031005859375, 0.00164031982421875, -0.0247802734375, -0.011962890625, 0.00142669677734375, 0.02294921875, 0.01281738281...

[ 212467, 6002, 102, 49086, 27140, 2481, 502, 4867, 1653, 2063, 67, 33867, 20697, 81979, 74481, 3674, 28960, 34627, 1771, 32354, 787, 77336, 160624, 939, 1021, 9319, 837, 275, 990, 1193, 79786, 1810, 51515, 1916, 6044, 2174, 3173, 8512, 5303,...

[ 0.18701171875, 0.1605224609375, 0.197509765625, 0.132568359375, 0.231201171875, 0.1302490234375, 0.1519775390625, 0.2044677734375, 0.1790771484375, 0.223876953125, 0.10986328125, 0.1490478515625, 0.005096435546875, 0.040252685546875, 0.1904296875, 0.003997802734375, 0.008697509765625...

embed

37040060_c0

37040060

prolog

0

Title: Writing a Prolog program that is supposed to multiply every element in the list by a number Problem title: Writing a Prolog program that is supposed to multiply every element in the list by a number Tags: prolog, multiplication, list Problem: Writing a Prolog program that is supposed to multiply every element in...

Writing a Prolog program that is supposed to multiply every element in the list by a number Writing a Prolog program that is supposed to multiply every element in the list by a number prolog multiplication list Writing Prolog multiply_list Result Number NewXs Writing a Prolog program that is supposed to multiply every ...

[ -0.0201416015625, 0.0185546875, 0.00579833984375, 0.00037384033203125, -0.006103515625, 0.026123046875, -0.0213623046875, 0.0030517578125, 0.0184326171875, -0.028564453125, -0.0013580322265625, -0.021240234375, -0.0205078125, 0.00176239013671875, 0.0019378662109375, 0.01202392578125, ...

[ 213185, 1250, 4867, 1528, 450, 134598, 6024, 62479, 11907, 12830, 5303, 390, 14012, 502, 127664, 6562, 126684, 103332, 2356, 1542, 7, 31577, 33022, 18151, 51776, 6626, 107730, 10750, 1632, 140992, 1653, 2063, 67, 34475, 7413, 124901, 80854, 1...

[ 0.158935546875, 0.1846923828125, 0.258056640625, 0.1815185546875, 0.008575439453125, 0.16796875, 0.119873046875, 0.1580810546875, 0.1246337890625, 0.16796875, 0.1810302734375, 0.043365478515625, 0.145263671875, 0.1573486328125, 0.133056640625, 0.197021484375, 0.141845703125, 0.0964...

embed

5945015_c0

5945015

prolog

0

Title: Undefined Procedure in SWI-Prolog does not work Problem title: Undefined Procedure in SWI-Prolog does not work Tags: procedure, prolog, undefined Problem: Undefined Procedure in SWI-Prolog does not work I am just starting to use Prolog, and already I've run into problem with a seemingly simple example. Here is m...

Undefined Procedure in SWI-Prolog does not work Undefined Procedure in SWI-Prolog does not work procedure prolog undefined Undefined Procedure SWI-Prolog ERROR Exception dumb.pl Undefined Procedure in SWI-Prolog does not work I am just starting to use Prolog, and already I've run into problem with a seemingly simple ex...

[ -0.00299072265625, 0.0274658203125, 0.008056640625, 0.027587890625, -0.0322265625, 0.003021240234375, 0.00445556640625, -0.0159912109375, -0.0042724609375, -0.0289306640625, -0.0037841796875, -0.000659942626953125, -0.0186767578125, -0.004241943359375, 0.011962890625, 0.010986328125, ...

[ 79912, 5983, 297, 170470, 13, 23, 159, 38969, 10752, 4867, 959, 4488, 50491, 502, 9232, 151206, 63928, 115, 6492, 2424, 1250, 2967, 8781, 27781, 11435, 72367, 1528, 3934, 91, 2452, 3034, 678, 903, 13315, 105876, 17569, 44116, 29568, 18499, ...

[ 0.143798828125, 0.2183837890625, 0.0770263671875, 0.2230224609375, 0.0389404296875, 0.0163421630859375, 0.07073974609375, 0.2095947265625, 0.1490478515625, 0.2266845703125, 0.09222412109375, 0.15185546875, 0.2047119140625, 0.1461181640625, 0.1019287109375, 0.04766845703125, 0.0914916...

embed

17574872_c0

17574872

prolog

0

Title: Appending dynamically generated lists to a new list Problem title: Appending dynamically generated lists to a new list Tags: dynamic, list, prolog Problem: Appending dynamically generated lists to a new list I am trying to add a list into an already created list. program(Route, FinalRoute). The Route variable is...

Appending dynamically generated lists to a new list Appending dynamically generated lists to a new list dynamic list prolog Appending Route FinalRoute Source Dest Conditions Cond Rest get_info Path NewDest Appending dynamically generated lists to a new list I am trying to add a list into an already created list. progra...

[ 0.0262451171875, 0.002838134765625, 0.017333984375, 0.00102996826171875, 0.0025482177734375, 0.010009765625, -0.0167236328125, 0.005615234375, 0.0189208984375, -0.0264892578125, 0.010009765625, -0.0064697265625, -0.0191650390625, -0.004608154296875, 0.00506591796875, 0.00982666015625, ...

[ 5787, 96819, 84079, 139392, 5303, 47, 3525, 502, 4867, 106015, 27188, 12724, 6743, 77641, 262, 271, 46347, 1657, 49756, 7319, 108421, 2356, 397, 525, 31577, 15190, 3934, 21771, 75935, 1528, 77336, 83, 98816, 48716, 20028, 20271, 71924, 36541,...

[ 0.1446533203125, 0.0667724609375, 0.1868896484375, 0.16943359375, 0.232421875, 0.1126708984375, 0.127685546875, 0.109375, 0.14453125, 0.2724609375, 0.205810546875, 0.198486328125, 0.184814453125, 0.1258544921875, 0.13720703125, 0.11669921875, 0.110595703125, 0.05535888671875, 0.1...

embed

2102336_c1

2102336

prolog

1

consult_query.query(); if ( !consulted ){ System.err.println( "Consult failed" ); System.exit( 1 ); } } public static void main( String argv[] ){ JPL.init(); JavaProlog jpTest = new JavaProlog(); } If I run the Prolog program directly from Prolog it works fine and the same when I call it from the Java application. I c...

[ 0.017822265625, 0.007080078125, 0.0006561279296875, 0.023681640625, 0.000949859619140625, 0.013671875, 0.0115966796875, 0.00933837890625, -0.00130462646484375, -0.040771484375, 0.0159912109375, 0.0157470703125, -0.026611328125, 0.00087738037109375, 0.01019287109375, -0.002655029296875,...

[ 75463, 944, 1294, 147834, 297, 12353, 56, 42, 35662, 239550, 165523, 13, 23399, 106, 3835, 201939, 2292, 5201, 23351, 79459, 334, 821, 21130, 217, 41925, 10752, 4867, 46802, 111337, 11675, 1250, 1528, 105237, 1295, 43240, 5885, 11782, 38415, ...

[ 0.2626953125, 0.14599609375, 0.1156005859375, 0.2076416015625, 0.08673095703125, 0.12744140625, 0.00628662109375, 0.00689697265625, 0.00555419921875, 0.2607421875, 0.1597900390625, 0.0118408203125, 0.15087890625, 0.0146636962890625, 0.006988525390625, 0.06414794921875, 0.055267333984...

embed

16457233_c1

16457233

prolog

1

: (7) del([_G389|_G390], [[a, b, c], [], []], _G412) ? creep Exit: (7) del([a, b, c], [[a, b, c], [], []], [[], []]) ? creep Top1 = a, Stack1 = [b, c], Stacks1 = [[], []] . I have some difficulties to understand why: [Top1|Stack1] is unified with the first stack [a, b, c] EDIT: I think that maybe work in this way: The ...

[ -0.0027618408203125, 0.0130615234375, 0.01220703125, 0.015869140625, -0.0203857421875, -0.00041961669921875, -0.000537872314453125, 0.0012054443359375, 0.013916015625, -0.00958251953125, 0.0228271484375, 0.0118408203125, 0.0013580322265625, -0.0020599365234375, 0.00787353515625, -0.005...

[ 8696, 146, 724, 119861, 150197, 876, 501, 617, 55102, 49512, 254, 5443, 217, 4792, 418, 2203, 6512, 2594, 22824, 34844, 28219, 15400, 77888, 58745, 42378, 76172, 83, 51, 47314, 678, 5117, 177261, 4488, 5303, 111, 275, 238, 10336, 33022, 9...

[ 0.1092529296875, 0.24169921875, 0.03082275390625, 0.2315673828125, 0.2030029296875, 0.097900390625, 0.0841064453125, 0.061431884765625, 0.1083984375, 0.1505126953125, 0.086181640625, 0.09637451171875, 0.0601806640625, 0.1746826171875, 0.1256103515625, 0.007049560546875, 0.15625, 0....

embed

29152309_c1

29152309

prolog

1

_10. rep_10. rep_10. rep_10. rep_100M :- rep_10, rep_10, rep_10, rep_10, rep_10, rep_10, rep_10, rep_10. Code for int_cntA/2: benchA_1(I,W,Rt) :- statistics(runtime,_), ( repeat(100000000), int_cntA(I,W), false ; true ), statistics(runtime,[_,Rt]), int_cntA(I,W). benchA_2(I,W,Rt) :- statistics(runtime,_), ( between(1,1...

[ -0.0086669921875, -0.0272216796875, 0.0150146484375, 0.0252685546875, -0.007415771484375, 0.00592041015625, 0.0020904541015625, -0.0023345947265625, 0.01263427734375, -0.004730224609375, -0.00191497802734375, 0.02734375, 0.0003757476806640625, 0.0299072265625, 0.0216064453125, -0.01647...

[ 101, 963, 5, 10958, 454, 3559, 594, 15772, 4, 28864, 100, 23, 18, 238, 660, 284, 12477, 1585, 206, 115187, 568, 1456, 1052, 80835, 16428, 6032, 119140, 197094, 98320, 29568, 304, 17721, 363, 571, 2161, 142, 24018, 31365, 17, 966, 20625,...

[ 0.0794677734375, 0.23681640625, 0.03533935546875, 0.2239990234375, 0.048980712890625, 0.2222900390625, 0.20263671875, 0.097900390625, 0.0157470703125, 0.250732421875, 0.03985595703125, 0.1121826171875, 0.141845703125, 0.0682373046875, 0.1749267578125, 0.209228515625, 0.2802734375, ...

embed

48255377_c1

48255377

prolog

1

,s5,500). ubicacion(boligrafos,s6,400). ubicacion(plumas,s7,500). ubicacion(plumas,s8,400). ubicacion(colonias,s3,150). ubicacion(ratones,s4,210). /* Conexiones IDA */ conectado (pc1,pc2,10). conectado (pc2,pc3,10). conectado (pc3,pc4,10). conectado (pc4,t,10). conectado (ps1,pc1,5). conectado (ps2,pc2,5). conectado (p...

[ -0.004608154296875, 0.00124359130859375, 0.005523681640625, 0.0289306640625, 0.00103759765625, -0.006561279296875, -0.0260009765625, 0.01214599609375, 0.0281982421875, -0.0233154296875, -0.0001659393310546875, 0.00946044921875, -0.0034942626953125, -0.006378173828125, -0.012939453125, ...

[ 6, 4, 7, 758, 4283, 194, 104508, 6447, 40285, 26583, 232, 910, 10700, 2424, 28388, 966, 1019, 22796, 1174, 363, 19236, 30426, 1444, 617, 88142, 248, 1639, 1657, 3355, 55105, 27112, 661, 180726, 57095, 50258, 18, 6423, 57626, 71928, 15, ...

[ 0.094970703125, 0.05377197265625, 0.1090087890625, 0.1177978515625, 0.238037109375, 0.044036865234375, 0.22607421875, 0.05389404296875, 0.080078125, 0.1968994140625, 0.09527587890625, 0.1102294921875, 0.1724853515625, 0.0858154296875, 0.1849365234375, 0.04107666015625, 0.121826171875...

embed

35704143_c0

35704143

prolog

0

Title: Just can't import files to my Racket program Problem title: Just can't import files to my Racket program Tags: racket, scheme, prolog Problem: Just can't import files to my Racket program One in two files I try to import to my program doesn't work out. I know the programs have to be in the same folder ...

Just can't import files to my Racket program Just can't import files to my Racket program racket scheme prolog files Just Racket se3-bib prologInScheme.rkt prologInScheme.rkt:19:3 Users Lidiya AppData Roaming Documents Mathe WS1516 SE3 Just can't import files to my Racket program One in two files I try to imp...

[ 0.0035858154296875, 0.0172119140625, -0.0174560546875, 0.0284423828125, -0.025634765625, 0.017822265625, 0.00157928466796875, -0.0179443359375, -0.007476806640625, -0.042724609375, -0.0014495849609375, -0.0118408203125, -0.0091552734375, 0.00070953369140625, 0.013671875, -0.02661132812...

[ 9563, 831, 3768, 18, 24927, 102158, 47, 759, 2552, 27853, 1528, 673, 150370, 502, 4867, 40, 27495, 82095, 25452, 12549, 363, 53400, 1261, 49778, 5659, 137989, 2777, 302, 43101, 123426, 52143, 1837, 2485, 6755, 6626, 9790, 4488, 1810, 103391...

[ 0.0496826171875, 0.1033935546875, 0.0347900390625, 0.0814208984375, 0.28466796875, 0.2222900390625, 0.1395263671875, 0.07220458984375, 0.1485595703125, 0.2220458984375, 0.18310546875, 0.1180419921875, 0.134765625, 0.130615234375, 0.21728515625, 0.06353759765625, 0.11767578125, 0.14...

embed

67149206_c0

67149206

prolog

0

Title: Prolog: maplist (Vars in 1..9) on every elements except for the first row and first column in a matrix. Do not want two predicates Problem title: Prolog: maplist (Vars in 1..9) on every elements except for the first row and first column in a matrix. Do not want two predicates Tags: prolog Problem: Prolog: maplis...

Prolog: maplist (Vars in 1..9) on every elements except for the first row and first column in a matrix. Do not want two predicates Prolog: maplist (Vars in 1..9) on every elements except for the first row and first column in a matrix. Do not want two predicates prolog Prolog Vars ____ single_digit _ColHd Rows single_di...

[ -0.000232696533203125, 0.00433349609375, -0.00933837890625, -0.0004425048828125, -0.0267333984375, 0.027099609375, -0.0062255859375, 0.024658203125, 0.006744384765625, -0.032958984375, -0.010986328125, 0.0036163330078125, -0.0115966796875, -0.001708984375, -0.0181884765625, -0.00282287...

[ 1250, 4867, 22288, 6562, 81827, 615, 1126, 98, 11907, 80854, 40494, 5117, 15555, 3365, 316, 50944, 425, 3444, 6626, 1653, 2063, 136, 959, 502, 3323, 11001, 4803, 78457, 71, 96190, 217, 70870, 1636, 831, 678, 1639, 839, 218288, 4734, 1632,...

[ 0.20556640625, 0.257568359375, 0.19287109375, 0.2529296875, 0.19970703125, 0.0809326171875, 0.169921875, 0.038818359375, 0.0877685546875, 0.149169921875, 0.0823974609375, 0.0711669921875, 0.1436767578125, 0.0675048828125, 0.0931396484375, 0.182373046875, 0.0653076171875, 0.10504150...

embed

37007363_c0

37007363

prolog

0

Title: List - counting atoms related to their previous term Problem title: List - counting atoms related to their previous term Tags: prolog, list Problem: List - counting atoms related to their previous term I want to count the number of elements in a list which have a relation with the element following. The predicat...

List - counting atoms related to their previous term List - counting atoms related to their previous term prolog list List count_list Count Acc Acc1 List - counting atoms related to their previous term I want to count the number of elements in a list which have a relation with the element following. The predicate I hav...

[ 0.0032958984375, 0.02197265625, -0.005767822265625, 0.0137939453125, 0.00112152099609375, 0.00244140625, -0.009765625, 0.01141357421875, 0.01495361328125, -0.03173828125, 0.0052490234375, 0.0019989013671875, 0.0263671875, 0.01953125, 0.01123046875, 0.01043701171875, 0.004364013671875...

[ 32036, 54529, 214, 34627, 7, 62548, 47, 2363, 96362, 13579, 502, 4867, 5303, 6562, 108210, 29899, 418, 3444, 14012, 80854, 23, 41911, 678, 12830, 25632, 1653, 2063, 67, 43240, 17368, 183278, 1290, 77336, 158661, 2174, 30646, 29568, 27781, 1...

[ 0.2125244140625, 0.198974609375, 0.0655517578125, 0.210205078125, 0.03564453125, 0.169921875, 0.05096435546875, 0.0142669677734375, 0.10693359375, 0.1629638671875, 0.108642578125, 0.1392822265625, 0.2132568359375, 0.183837890625, 0.166259765625, 0.0933837890625, 0.044097900390625, ...

embed

33833593_c0

33833593

prolog

0

Title: Prolog length to initialize list adds new List to existing Lists Problem title: Prolog length to initialize list adds new List to existing Lists Tags: list, prolog Problem: Prolog length to initialize list adds new List to existing Lists puzzle(ListToAdd,ListToAdd1,Res,_,Carry) :- length(Res,ResultLength), lengt...

Prolog length to initialize list adds new List to existing Lists Prolog length to initialize list adds new List to existing Lists list prolog Prolog List Lists ListToAdd ListToAdd1 Res Carry ResultLength Query Before _5459 _5499 _5539 _5319 _5199 _5239 _5279 After _12043 _12107 _12171 _12235 Prolog length to initialize...

[ 0.0140380859375, 0.027099609375, 0.004974365234375, 0.01373291015625, -0.0164794921875, 0.005859375, 0.01300048828125, -0.0059814453125, 0.0205078125, -0.03076171875, 0.014404296875, -0.0118408203125, 0.006439208984375, 0.037109375, 0.0003185272216796875, -0.02001953125, 0.0186767578...

[ 1250, 4867, 140909, 47, 61475, 20650, 5303, 15190, 3525, 32036, 144573, 502, 7763, 4028, 418, 9624, 3980, 1294, 126684, 5267, 449, 927, 58836, 117371, 170290, 12338, 5046, 11663, 9323, 2947, 116518, 20840, 11548, 44141, 123439, 149265, 4527, ...

[ 0.1947021484375, 0.2425537109375, 0.2061767578125, 0.045013427734375, 0.1861572265625, 0.0703125, 0.2093505859375, 0.141357421875, 0.09765625, 0.1934814453125, 0.1495361328125, 0.09429931640625, 0.1116943359375, 0.1141357421875, 0.039886474609375, 0.131591796875, 0.1085205078125, 0...

embed

64831615_c1

64831615

prolog

1

atko's book, I need to arrange the "blocks" DOG CAT RAT , I just can't put CAT with/over RAT or vice versa, and DOG with/over CAT , or vice versa, and I can only pass block by block, one by one. I have 3 places, the result of the "ordered" list should be in place 3, something like this: R = (previously there are all th...

[ 0.00015735626220703125, 0.00677490234375, 0.0086669921875, 0.0103759765625, 0.006988525390625, -0.01177978515625, -0.014892578125, -0.0028839111328125, 0.0240478515625, -0.0235595703125, 0.00921630859375, 0.0003986358642578125, -0.00726318359375, -0.01104736328125, -0.021484375, 0.0107...

[ 99, 265, 25, 7, 12877, 87, 3871, 137356, 81409, 6197, 724, 100632, 34918, 1660, 831, 18, 3884, 678, 5465, 22925, 105274, 4734, 27875, 46389, 390, 1632, 765, 138, 44677, 16750, 80596, 297, 5303, 5608, 3687, 627, 2203, 65572, 4460, 12540, ...

[ 0.052825927734375, 0.1812744140625, 0.0257568359375, 0.06201171875, 0.15283203125, 0.0214691162109375, 0.07421875, 0.243896484375, 0.2138671875, 0.1490478515625, 0.11083984375, 0.193603515625, 0.198486328125, 0.012359619140625, 0.08770751953125, 0.043487548828125, 0.06842041015625, ...

embed

7525972_c0

7525972

prolog

0

Title: Can't get minimize from CLPFD to work Problem title: Can't get minimize from CLPFD to work Tags: clpfd, constraint-programming, prolog Problem: Can't get minimize from CLPFD to work Me and a friend are writing a program which is supposed to solve a CLP problem. We want to use minimize to optimize the s...

Can't get minimize from CLPFD to work Can't get minimize from CLPFD to work clpfd constraint-programming prolog CLPFD Can gen_var N-1 nth1 Can't get minimize from CLPFD to work Me and a friend are writing a program which is supposed to solve a CLP problem. We want to use minimize to optimize the solution but ...

[ -0.002166748046875, 0.01104736328125, 0.017333984375, 0.00299072265625, -0.005889892578125, 0.004241943359375, 0.0074462890625, -0.00933837890625, 0.00885009765625, -0.031982421875, -0.01055908203125, -0.0054931640625, 0.00122833251953125, -0.007293701171875, 0.01556396484375, 0.009216...

[ 4171, 3768, 18, 2046, 881, 77651, 1295, 46323, 41265, 397, 47, 4488, 33139, 39557, 71, 2816, 4288, 28966, 502, 4867, 9226, 454, 1961, 541, 5759, 927, 418, 34391, 32562, 1528, 86869, 313, 37352, 2967, 4527, 15572, 20650, 29806, 23742, 1369...

[ 0.06787109375, 0.046234130859375, 0.075927734375, 0.07220458984375, 0.2252197265625, 0.275146484375, 0.12060546875, 0.145263671875, 0.14501953125, 0.2098388671875, 0.047271728515625, 0.14501953125, 0.08331298828125, 0.104248046875, 0.1312255859375, 0.13037109375, 0.04156494140625, ...

embed

55044140_c0

55044140

prolog

0

Title: how to set set_prolog_flag(stack_limit, 2_147_483_648). to double the limit using swipl prolog Problem title: how to set set_prolog_flag(stack_limit, 2_147_483_648). to double the limit using swipl prolog Tags: json, prolog, swi-prolog, xsd Problem: how to set set_prolog_flag(stack_limit, 2_147_483_648). to doub...

how to set set_prolog_flag(stack_limit, 2_147_483_648). to double the limit using swipl prolog how to set set_prolog_flag(stack_limit, 2_147_483_648). to double the limit using swipl prolog json prolog swi-prolog xsd swipl set_prolog_flag stack_limit xsd2json-master cli.pl proj_xsd p1_v1.xsd ERROR Stack Choice xsd2json...

[ 0.0098876953125, 0.015380859375, 0.006317138671875, -0.003021240234375, -0.000591278076171875, -0.01397705078125, -0.0185546875, 0.0087890625, 0.00982666015625, -0.017822265625, 0.03662109375, 0.0123291015625, 0.003021240234375, -0.033935546875, 0.038330078125, 0.01434326171875, 0.01...

[ 3642, 5423, 3454, 4867, 190872, 590, 2594, 93343, 128497, 161382, 202400, 41929, 17475, 2452, 2424, 502, 116, 1647, 1681, 1022, 71, 177261, 170, 47327, 95701, 151206, 6512, 181948, 304, 7612, 140909, 3671, 402, 196352, 157, 341, 34926, 11675,...

[ 0.009246826171875, 0.159423828125, 0.16259765625, 0.2227783203125, 0.225830078125, 0.095703125, 0.0892333984375, 0.236328125, 0.1461181640625, 0.157470703125, 0.17333984375, 0.1490478515625, 0.212158203125, 0.1339111328125, 0.148193359375, 0.1182861328125, 0.014892578125, 0.0541076...

embed

59882857_c0

59882857

prolog

0

Title: Unary and binary arithmetic operations in Prolog Problem title: Unary and binary arithmetic operations in Prolog Tags: binary, prolog, successor-arithmetics Problem: Unary and binary arithmetic operations in Prolog I am trying to do unary and binary arithmetic operations in Prolog. unary numbers are defined as b...

Unary and binary arithmetic operations in Prolog Unary and binary arithmetic operations in Prolog binary prolog successor-arithmetics Unary Prolog Result Res NewRes Unary and binary arithmetic operations in Prolog I am trying to do unary and binary arithmetic operations in Prolog. unary numbers are defined as bot=0 and...

[ 0.0069580078125, -0.00159454345703125, 0.00872802734375, 0.0147705078125, -0.0036163330078125, -0.01513671875, 0.005218505859375, 0.00384521484375, 0.01513671875, 0.00457763671875, -0.006134033203125, -0.006011962890625, -0.006866455078125, 0.003387451171875, 0.01409912109375, 0.007324...

[ 4228, 1294, 136, 2394, 6635, 8962, 282, 41018, 1250, 4867, 187, 23, 502, 39457, 42, 126684, 9624, 2356, 4332, 31577, 220, 101935, 61924, 237, 13820, 145407, 91, 1542, 21748, 138, 83, 9190, 33636, 36549, 567, 180, 153939, 45234, 1632, 1971...

[ 0.173583984375, 0.183349609375, 0.048126220703125, 0.19580078125, 0.1346435546875, 0.138916015625, 0.06671142578125, 0.1552734375, 0.1549072265625, 0.25439453125, 0.0162811279296875, 0.00921630859375, 0.0999755859375, 0.109375, 0.0220184326171875, 0.1553955078125, 0.0849609375, 0.0...

embed

29444527_c0

29444527

prolog

0

Title: Redundant answers of reified predicate variant of append/3 Problem title: Redundant answers of reified predicate variant of append/3 Tags: list, reification, prolog, logical-purity Problem: Redundant answers of reified predicate variant of append/3 I wanted to offer a logically pure solution to some other recent...

Redundant answers of reified predicate variant of append/3 Redundant answers of reified predicate variant of append/3 list reification prolog logical-purity Redundant if_ ZZs prolog:dif Redundant answers of reified predicate variant of append/3 I wanted to offer a logically pure solution to some other recent problem in...

[ -0.01214599609375, 0.0033416748046875, 0.0216064453125, 0.0021209716796875, 0.0059814453125, -0.007049560546875, 0.01019287109375, 0.0230712890625, 0.003021240234375, -0.0091552734375, 0.010009765625, 0.022705078125, -0.013427734375, 0.0211181640625, 0.0208740234375, 0.02734375, 0.00...

[ 6096, 35405, 18, 35166, 456, 47314, 1653, 2063, 20117, 114689, 71, 18113, 5303, 41274, 502, 4867, 62775, 4717, 2174, 76362, 428, 420, 67, 12684, 34166, 29806, 2967, 4738, 29479, 1052, 17357, 35509, 1636, 136, 78690, 8710, 1250, 69941, 345, ...

[ 0.0733642578125, 0.208251953125, 0.0163726806640625, 0.1591796875, 0.0938720703125, 0.17236328125, 0.1253662109375, 0.17236328125, 0.246337890625, 0.1507568359375, 0.07415771484375, 0.239990234375, 0.1025390625, 0.13134765625, 0.08935546875, 0.1595458984375, 0.0703125, 0.0885009765...

embed

61399656_c0

61399656

prolog

0

Title: Trying to Implement a Split Predicate in Prolog Problem title: Trying to Implement a Split Predicate in Prolog Tags: prolog, list, split, predicate Problem: Trying to Implement a Split Predicate in Prolog I am trying to implement a partition predicate in Prolog that splits a list into its two halves, a Prefix an...

Trying to Implement a Split Predicate in Prolog Trying to Implement a Split Predicate in Prolog prolog list split predicate Trying Implement Split Predicate Prolog Prefix Plen Slen Pre Suff Type Trying to Implement a Split Predicate in Prolog I am trying to implement a partition predicate in Prolog that splits a list i...

[ -0.00579833984375, 0.01007080078125, 0.0005645751953125, -0.003143310546875, -0.0272216796875, -0.0037384033203125, -0.004730224609375, -0.0084228515625, 0.00762939453125, 0.0250244140625, -0.00080108642578125, -0.007293701171875, -0.0150146484375, -0.01513671875, 0.01190185546875, 0.0...

[ 40858, 153941, 46474, 7145, 2063, 67, 1250, 4867, 23, 502, 5303, 65450, 1653, 1914, 55923, 19434, 1977, 21493, 60457, 31577, 29479, 2878, 1363, 6626, 106706, 142830, 5701, 140909, 183114, 136, 133784, 31195, 61924, 339, 159, 841, 436, 1556, ...

[ 0.109130859375, 0.1494140625, 0.216064453125, 0.15380859375, 0.1884765625, 0.07025146484375, 0.1424560546875, 0.207763671875, 0.002166748046875, 0.09771728515625, 0.14306640625, 0.193603515625, 0.13916015625, 0.0987548828125, 0.1712646484375, 0.103759765625, 0.1466064453125, 0.1541...

embed

70525199_c0

70525199

prolog

0

Title: Is there a better way for making a list of ancestors in this program? Problem title: Is there a better way for making a list of ancestors in this program? Tags: prolog Problem: Is there a better way for making a list of ancestors in this program? same_gender_parent(ID, L) :- person(ID, _, _, P, _, _, _), member(...

Is there a better way for making a list of ancestors in this program? Is there a better way for making a list of ancestors in this program? prolog same_gender_parent Parent week_diff Is there a better way for making a list of ancestors in this program? In the code above, I have made it so that it takes a person(ID, nam...

[ 0.006439208984375, -0.00836181640625, 0.01129150390625, 0.002655029296875, -0.0299072265625, 0.01409912109375, -0.033447265625, 0.018798828125, 0.000028252601623535156, -0.059814453125, 0.0133056640625, -0.006195068359375, -0.004241943359375, 0.0034942626953125, 0.006072998046875, 0.01...

[ 11522, 3917, 20662, 10, 5303, 111, 60502, 22230, 903, 1528, 502, 4867, 5701, 23200, 99547, 170918, 5895, 152462, 18151, 7228, 51776, 3445, 7146, 9351, 127501, 5622, 127319, 38043, 12765, 2174, 11338, 32786, 14449, 49129, 304, 237052, 3129, 23...

[ 0.12109375, 0.075439453125, 0.126708984375, 0.061431884765625, 0.201416015625, 0.0301361083984375, 0.1964111328125, 0.1949462890625, 0.021209716796875, 0.1661376953125, 0.118896484375, 0.177490234375, 0.167236328125, 0.14306640625, 0.1671142578125, 0.1629638671875, 0.1961669921875, ...

embed

43659631_c0

43659631

prolog

0

Title: Comparing more than 2 lists' elements in prolog to find if exactly two elements are the same Problem title: Comparing more than 2 lists' elements in prolog to find if exactly two elements are the same Tags: prolog Problem: Comparing more than 2 lists' elements in prolog to find if exactly two elements ...

Comparing more than 2 lists' elements in prolog to find if exactly two elements are the same Comparing more than 2 lists' elements in prolog to find if exactly two elements are the same prolog Comparing _Name _Surname _Car _Color customer1 customer2 customer3 customer4 result:-customer1 Comparing more than 2 ...

[ -0.0007476806640625, -0.0030059814453125, -0.004608154296875, -0.00213623046875, 0.003143310546875, 0.0205078125, -0.005126953125, 0.01251220703125, 0.0269775390625, -0.003875732421875, -0.00689697265625, 0.02880859375, 0.025146484375, -0.00115203857421875, -0.0067138671875, -0.0015258...

[ 113307, 1286, 3501, 116, 5303, 7, 80854, 502, 4867, 7413, 2174, 66161, 6626, 621, 5701, 163612, 84041, 11627, 21851, 1484, 43373, 304, 363, 617, 5928, 33636, 2258, 8796, 134855, 3714, 831, 12765, 23, 110, 59463, 765, 10576, 12638, 12921, ...

[ 0.18701171875, 0.1251220703125, 0.08953857421875, 0.146728515625, 0.2384033203125, 0.00933837890625, 0.1683349609375, 0.154296875, 0.193603515625, 0.0880126953125, 0.06329345703125, 0.1212158203125, 0.094482421875, 0.07025146484375, 0.1949462890625, 0.0704345703125, 0.040283203125, ...

embed

14044146_c0

14044146

prolog

0

Title: Checking List in Prolog Problem title: Checking List in Prolog Tags: prolog Problem: Checking List in Prolog I'm trying to do a schedule that has constraints in Prolog. Scheduling will be based on two constraints. The courses of the same semester and the courses taught by the same instructor cannot be scheduled ...

Checking List in Prolog Checking List in Prolog prolog Checking List Prolog ceng123 cse111 cse112 cse113 cse114 cse115 cse116 cse117 cse118 Course CourseTail Day Slot ScheduleTail Course2 Day2 Slot2 Tail Semester1 Semester2 syntax_error user_input:1 char:4 read_term Checking List in Prolog I'm trying to do a schedule t...

[ -0.007171630859375, 0.005340576171875, 0.0111083984375, 0.015869140625, -0.03515625, -0.0247802734375, -0.0279541015625, 0.0111083984375, 0.006317138671875, -0.02099609375, -0.0008392333984375, -0.01220703125, -0.00299072265625, -0.0023040771484375, -0.006805419921875, 0.00665283203125...

[ 38679, 214, 32036, 23, 1250, 4867, 502, 405, 449, 48636, 184, 97024, 88438, 116597, 129150, 103928, 120620, 115250, 116329, 154162, 9874, 379, 10013, 69623, 230074, 304, 1218, 162356, 86531, 188800, 38937, 21441, 12301, 32166, 31577, 80889, 158...

[ 0.2161865234375, 0.125732421875, 0.2020263671875, 0.03729248046875, 0.15869140625, 0.2470703125, 0.1007080078125, 0.02874755859375, 0.07080078125, 0.1671142578125, 0.047393798828125, 0.09765625, 0.06329345703125, 0.050537109375, 0.03070068359375, 0.00665283203125, 0.0163421630859375,...

embed

40966138_c0

40966138

prolog

0

Title: SWI-prolog same generation Problem title: SWI-prolog same generation Tags: prolog, family-tree Problem: SWI-prolog same generation I have some facts and rules that I'm trying to use that when I pass a query it says if the two variables are of the same generation (either siblings or cousins). %mother/father DB mo...

SWI-prolog same generation SWI-prolog same generation prolog family-tree SWI-prolog Parent Defines same_generation SWI-prolog same generation I have some facts and rules that I'm trying to use that when I pass a query it says if the two variables are of the same generation (either siblings or cousins). Unfortunately th...

[ 0.01434326171875, 0.0294189453125, -0.00872802734375, -0.0036773681640625, -0.0247802734375, -0.0017242431640625, -0.017822265625, -0.0054931640625, 0.005706787109375, -0.038818359375, 0.0111083984375, -0.018798828125, -0.012451171875, 0.0120849609375, -0.0023956298828125, -0.009338378...

[ 159, 38969, 3454, 4867, 5701, 58093, 502, 14449, 62600, 170918, 85535, 48281, 15824, 91736, 31577, 4527, 27875, 41, 1294, 17378, 2174, 6626, 77336, 621, 111, 78, 79298, 193429, 185397, 2967, 3034, 29041, 136, 49129, 1119, 40175, 1363, 176769,...

[ 0.058837890625, 0.204345703125, 0.1195068359375, 0.1954345703125, 0.1639404296875, 0.243408203125, 0.1102294921875, 0.1014404296875, 0.209716796875, 0.176513671875, 0.1505126953125, 0.201171875, 0.052032470703125, 0.07391357421875, 0.005157470703125, 0.0182647705078125, 0.09118652343...

embed

16245945_c0

16245945

prolog

0

Title: Avoiding cycles in directed graph Problem title: Avoiding cycles in directed graph Tags: prolog Problem: Avoiding cycles in directed graph I am writing a simple program in SWI-Prolog to run through a directed graph, from one node to the next. I'm having trouble avoiding cycles though and would like some help. Ea...

Avoiding cycles in directed graph Avoiding cycles in directed graph prolog Avoiding Start End Route Cost Next FirstCost StayTime NewRoute SecondCost Routing Avoiding cycles in directed graph I am writing a simple program in SWI-Prolog to run through a directed graph, from one node to the next. I'm having trouble avoidi...

[ 0.0157470703125, 0.0128173828125, 0.0177001953125, 0.0128173828125, 0.003387451171875, -0.01190185546875, -0.0191650390625, 0.00592041015625, 0.01495361328125, -0.07470703125, -0.00144195556640625, -0.00141143798828125, -0.0233154296875, 0.0234375, 0.0206298828125, 0.02490234375, -0....

[ 84361, 86675, 105823, 7, 23, 8951, 297, 41382, 502, 4867, 13794, 18878, 106015, 63099, 4997, 23972, 441, 5510, 140682, 70059, 12724, 6743, 77648, 56709, 32562, 8781, 1528, 159, 38969, 10752, 11675, 110, 11737, 63134, 71864, 4358, 98423, 12130...

[ 0.177978515625, 0.05914306640625, 0.254638671875, 0.1007080078125, 0.01910400390625, 0.1878662109375, 0.06256103515625, 0.2139892578125, 0.13916015625, 0.1947021484375, 0.048614501953125, 0.093017578125, 0.135009765625, 0.144287109375, 0.0386962890625, 0.0128173828125, 0.066284179687...

embed

36452727_c0

36452727

prolog

0

Title: Source of pure prolog small programs Problem title: Source of pure prolog small programs Tags: logic, prolog, logical-purity Problem: Source of pure prolog small programs The question: is there a place with some programs that I can check out? I'm talking rosetta code style, but I went there and saw that almost e...

Source of pure prolog small programs Source of pure prolog small programs logic prolog logical-purity Source Source of pure prolog small programs The question: is there a place with some programs that I can check out? I'm talking rosetta code style, but I went there and saw that almost every program is solved with non ...

[ 0.0177001953125, 0.02392578125, 0.01031494140625, -0.00390625, -0.0220947265625, 0.031982421875, 0.00170135498046875, -0.003021240234375, 0.01348876953125, -0.05126953125, 0.000446319580078125, -0.00933837890625, -0.029296875, 0.002655029296875, 0.0189208984375, 0.00022411346435546875,...

[ 77641, 111, 34166, 502, 4867, 19336, 103391, 62775, 289, 4717, 2481, 9655, 2685, 3687, 3060, 87, 831, 12765, 1810, 56661, 49175, 2310, 18151, 20623, 4, 136, 24124, 39555, 11907, 1528, 86869, 71, 351, 6002, 86531, 214, 59226, 15744, 450, 1...

[ 0.259521484375, 0.092529296875, 0.2459716796875, 0.193359375, 0.2802734375, 0.217529296875, 0.222900390625, 0.1885986328125, 0.09912109375, 0.16162109375, 0.1083984375, 0.028717041015625, 0.0188446044921875, 0.1328125, 0.0457763671875, 0.00958251953125, 0.05889892578125, 0.16003417...

embed

69988736_c0

69988736

prolog

0

Title: Prolog, a list of the most common list items Problem title: Prolog, a list of the most common list items Tags: prolog Problem: Prolog, a list of the most common list items Write a predicate that forms a list of the most common list items. The list is entered from the keyboard while the predicate is running. Do n...

Prolog, a list of the most common list items Prolog, a list of the most common list items prolog Prolog List bubble_sort SList ResList InputList SortList List1 Prolog, a list of the most common list items Write a predicate that forms a list of the most common list items. The list is entered from the keyboard while the ...

[ 0.01434326171875, -0.005126953125, 0.006439208984375, -0.0164794921875, -0.0086669921875, 0.004119873046875, -0.0142822265625, 0.0035400390625, 0.00823974609375, -0.007080078125, 0.00152587890625, -0.01202392578125, -0.01171875, -0.001678466796875, 0.0067138671875, -0.0179443359375, ...

[ 1250, 4867, 5303, 70, 2684, 39210, 55769, 10, 502, 32036, 373, 73163, 62351, 159, 154663, 9624, 7077, 53666, 418, 601, 18781, 1653, 2063, 67, 3173, 30957, 1295, 149186, 12960, 51042, 959, 4527, 88303, 38132, 33938, 136, 12096, 2389, 363, ...

[ 0.1966552734375, 0.299072265625, 0.2152099609375, 0.003997802734375, 0.133544921875, 0.211181640625, 0.1904296875, 0.011993408203125, 0.1549072265625, 0.1619873046875, 0.0202789306640625, 0.1688232421875, 0.196044921875, 0.005950927734375, 0.1851806640625, 0.02850341796875, 0.0200805...

embed

12071959_c0

12071959

prolog

0

Title: Extension to CFG, what is it? Problem title: Extension to CFG, what is it? Tags: context-free-grammar, dcg-semicontext, dcg, iso-prolog, prolog Problem: Extension to CFG, what is it? Consider the following extension to context-free grammars that permits rules to have in the left-hand side, one (or more) terminal...

Extension to CFG, what is it? Extension to CFG, what is it? context-free-grammar dcg-semicontext dcg iso-prolog prolog Extension CFG Extension to CFG, what is it? Consider the following extension to context-free grammars that permits rules to have in the left-hand side, one (or more) terminal on the right side of the n...

[ 0.030517578125, 0.0120849609375, 0.031494140625, 0.03369140625, -0.004608154296875, 0.015869140625, -0.014404296875, -0.015380859375, 0.01116943359375, 0.0028533935546875, -0.003509521484375, 0.0011138916015625, -0.01263427734375, 0.0079345703125, 0.006072998046875, -0.00390625, 0.01...

[ 224545, 47, 313, 123254, 2367, 83, 442, 43701, 32087, 107415, 147, 104, 238, 177, 84505, 2271, 22829, 13882, 3454, 4867, 502, 111938, 122092, 21816, 28897, 91736, 765, 25737, 12336, 5609, 1632, 1286, 33949, 7108, 351, 30524, 289, 111, 3173,...

[ 0.27783203125, 0.1702880859375, 0.0908203125, 0.272705078125, 0.1121826171875, 0.10498046875, 0.1488037109375, 0.1796875, 0.1705322265625, 0.11962890625, 0.0711669921875, 0.013336181640625, 0.040924072265625, 0.09967041015625, 0.085693359375, 0.056488037109375, 0.1124267578125, 0.0...

embed

46446407_c1

46446407

prolog

1

,Ts0,Fs0,Feature). if_(If_1, Then_0, Else_0) :- call(If_1, T), ( T == true -> call(Then_0) ; T == false -> call(Else_0) ; nonvar(T) -> throw(error(type_error(boolean,T),_)) ; /* var(T) */ throw(error(instantiation_error,_)) ). bool01_t(1,true). bool01_t(0,false). =(X, Y, T) :- ( X == Y -> T = true ; X \= Y -> T = false...

[ -0.01116943359375, -0.005126953125, -0.0169677734375, -0.0208740234375, 0.0157470703125, -0.0234375, 0.016357421875, -0.000896453857421875, -0.01202392578125, 0.0189208984375, 0.0164794921875, 0.020263671875, 0, 0.038818359375, 0.00128936767578125, 0.00162506103515625, 0.002273559570...

[ 6, 4, 618, 7, 2389, 919, 30154, 11, 6644, 194, 2174, 454, 132, 91306, 115187, 47009, 540, 184, 77495, 15772, 11782, 384, 29568, 33079, 3957, 19, 69112, 98320, 7623, 351, 1961, 104250, 188800, 50986, 142484, 5073, 1639, 285, 143034, 14, ...

[ 0.0271148681640625, 0.05535888671875, 0.146484375, 0.03277587890625, 0.1898193359375, 0.05908203125, 0.107666015625, 0.0958251953125, 0.119873046875, 0.1168212890625, 0.19482421875, 0.1251220703125, 0.00982666015625, 0.1790771484375, 0.1611328125, 0.147216796875, 0.13232421875, 0.1...

embed

28102112_c0

28102112

prolog

0

Title: prolog function to infer new facts from data Problem title: prolog function to infer new facts from data Tags: nlp, prolog, machine-learning, logic, function Problem: prolog function to infer new facts from data I have a dataset containing "facts" recognizable to prolog, i.e.: 'be'('mr jiang', 'representative of...

prolog function to infer new facts from data prolog function to infer new facts from data nlp prolog machine-learning logic function data prolog function to infer new facts from data I have a dataset containing "facts" recognizable to prolog, i.e.: I want the system to recognize that 'mr jiang' is referenced in both of...

[ 0.031982421875, -0.00396728515625, 0.0020751953125, 0.03369140625, 0.0079345703125, 0.007476806640625, -0.00469970703125, 0.005615234375, 0.00714111328125, -0.0517578125, 0.00634765625, -0.005615234375, -0.024169921875, -0.027099609375, 0.00836181640625, 0.0028839111328125, 0.0206298...

[ 502, 4867, 32354, 47, 53498, 3525, 15824, 7, 1295, 2053, 653, 26775, 36279, 152538, 62775, 3509, 70541, 114700, 75530, 16523, 2886, 3444, 5426, 125296, 76492, 890, 1463, 91067, 15044, 25632, 5608, 16487, 44944, 16444, 234873, 5351, 88308, 577...

[ 0.2236328125, 0.275390625, 0.205078125, 0.06256103515625, 0.264404296875, 0.14404296875, 0.2120361328125, 0.044921875, 0.15869140625, 0.1866455078125, 0.0009765625, 0.1705322265625, 0.04217529296875, 0.11767578125, 0.08447265625, 0.129638671875, 0.026641845703125, 0.2047119140625, ...

embed

45910617_c0

45910617

prolog

0

Title: get sublist of all elements that create specific word prolog Problem title: get sublist of all elements that create specific word prolog Tags: prolog Problem: get sublist of all elements that create specific word prolog i want to get a sublist of all elements that assemble specific word for example for the call ...

get sublist of all elements that create specific word prolog get sublist of all elements that create specific word prolog prolog abc123 Results RSet Collect Set Order N-Result atom_chars Result _-W N1-W1 N2-_ N2-W2 get sublist of all elements that create specific word prolog i want to get a sublist of all elements that...

[ 0.010009765625, -0.01141357421875, -0.0003814697265625, 0.0135498046875, -0.0225830078125, -0.00811767578125, -0.004638671875, 0.01031494140625, 0.0224609375, -0.0130615234375, 0.0196533203125, 0.025634765625, 0.0030364990234375, -0.0233154296875, -0.003173828125, -0.0025634765625, 0...

[ 2046, 1614, 6562, 111, 756, 80854, 28282, 29458, 2565, 502, 4867, 1563, 48636, 146104, 126, 138521, 19943, 81206, 4332, 7, 7136, 34627, 9254, 126684, 1456, 18504, 304, 3444, 93457, 11782, 1528, 28412 ]

[ 0.07672119140625, 0.2210693359375, 0.209716796875, 0.002655029296875, 0.0721435546875, 0.1781005859375, 0.1204833984375, 0.1522216796875, 0.1348876953125, 0.1455078125, 0.19921875, 0.01947021484375, 0.1895751953125, 0.149169921875, 0.1236572265625, 0.13134765625, 0.096923828125, 0....

embed

27333727_c0

27333727

prolog

0

Title: How to make Prolog able to generate all possible solutions to a query Problem title: How to make Prolog able to generate all possible solutions to a query Tags: prolog Problem: How to make Prolog able to generate all possible solutions to a query I'd like to be able to generate all possible lists of elements, wi...

How to make Prolog able to generate all possible solutions to a query How to make Prolog able to generate all possible solutions to a query prolog How Prolog not_in How to make Prolog able to generate all possible solutions to a query I'd like to be able to generate all possible lists of elements, with an ‘and’ between...

[ 0.00640869140625, 0.025634765625, 0.01495361328125, 0.0033416748046875, -0.0194091796875, 0.013671875, -0.02001953125, -0.00836181640625, 0.02294921875, -0.046630859375, -0.01116943359375, -0.005279541015625, -0.008056640625, 0.01446533203125, 0.00469970703125, 0.0159912109375, 0.015...

[ 11249, 3249, 1250, 4867, 19048, 139392, 756, 7722, 51347, 47, 41, 1294, 502, 959, 73, 1884, 5303, 80854, 2940, 17721, 4568, 6626, 3638, 46876, 110, 171763, 107, 136, 22759, 83, 26785, 55547, 1632, 1029, 17262, 16487, 11001, 62766, 59121, ...

[ 0.08135986328125, 0.083251953125, 0.1966552734375, 0.271484375, 0.1119384765625, 0.2069091796875, 0.148681640625, 0.175048828125, 0.1883544921875, 0.050750732421875, 0.107177734375, 0.10345458984375, 0.1514892578125, 0.05230712890625, 0.0501708984375, 0.082763671875, 0.2054443359375,...

embed

77787718_c0

77787718

prolog

0

Title: How to identify valid bodies and convertible terms Problem title: How to identify valid bodies and convertible terms Tags: iso-prolog, prolog Problem: How to identify valid bodies and convertible terms is_convertible_term(T) should be true, if T can be converted to a valid body (7.6.2 of ISO/IEC 13211-1). Thus: ...

How to identify valid bodies and convertible terms How to identify valid bodies and convertible terms iso-prolog prolog How is_convertible_term is_body How to identify valid bodies and convertible terms is_convertible_term(T) should be true, if T can be converted to a valid body (7.6.2 of ISO/IEC 13211-1). Thus: This s...

[ 0.034912109375, 0.01043701171875, 0.0164794921875, 0.03515625, -0.026611328125, 0.010498046875, -0.0181884765625, -0.0048828125, 0.01708984375, -0.007110595703125, 0.012939453125, -0.0032501220703125, -0.01171875, 0.02734375, 0.01483154296875, -0.0040283203125, 0.024169921875, 0.01...

[ 11249, 135812, 35604, 337, 34204, 136, 166615, 2661, 69407, 13882, 3454, 4867, 502, 83, 2271, 41418, 32166, 37873, 47, 618, 5608, 29568, 2174, 384, 831, 117176, 14361, 178121, 17408, 126109, 59531, 1662, 110218, 59121, 23, 1250, 16610, 31943,...

[ 0.050079345703125, 0.2286376953125, 0.2486572265625, 0.1715087890625, 0.1737060546875, 0.08056640625, 0.2061767578125, 0.2169189453125, 0.23046875, 0.1331787109375, 0.143798828125, 0.205322265625, 0.1373291015625, 0.171142578125, 0.086181640625, 0.2064208984375, 0.2479248046875, 0....

embed

10231815_c1

10231815

prolog

1

called travel(valmont, losAngeles,X). There is a point during the trace where the correct path shows up, aside from the anonymous variable at the end: travel(valmont, metz, connected(metz, paris, connected(paris, losAngeles, _17))) but I don't actually know how to unify this with the variable X ! I can't really wrap m...

[ 0.00128173828125, 0.017822265625, 0.00775146484375, 0.005767822265625, 0.01226806640625, 0.01287841796875, -0.00726318359375, -0.021240234375, 0.01226806640625, -0.052978515625, -0.0001068115234375, -0.0048828125, -0.031005859375, 0.006378173828125, -0.01409912109375, -0.012451171875, ...

[ 35839, 26983, 1405, 15477, 388, 159064, 90, 1542, 6275, 20271, 70, 144851, 26785, 60875, 45831, 1257, 52184, 77336, 3564, 435, 169, 162711, 1928, 366, 164, 24980, 2489, 32149, 18, 20653, 3714, 3642, 51, 40383, 903, 678, 1193, 711, 137565, ...

[ 0.1357421875, 0.2958984375, 0.1439208984375, 0.256591796875, 0.0736083984375, 0.1458740234375, 0.1416015625, 0.124267578125, 0.07421875, 0.058380126953125, 0.003204345703125, 0.21533203125, 0.1683349609375, 0.224853515625, 0.0745849609375, 0.069580078125, 0.1646728515625, 0.2435302...

embed

49554268_c0

49554268

prolog

0

Title: How to keep the pipe to another process opened Problem title: How to keep the pipe to another process opened Tags: swi-prolog, prolog Problem: How to keep the pipe to another process opened I am trying to talk with the bc instance through pipes , but with my code it runs the new instance every time. Is it possib...

How to keep the pipe to another process opened How to keep the pipe to another process opened swi-prolog prolog How use_module read_result Out Result send_command Command R.in flush_output R.out open_session process_create Pid dict_create pid:Pid in:In out:Out close_instance process_kill R.pid with_command How to keep ...

[ 0.0228271484375, 0.0115966796875, -0.0047607421875, -0.00750732421875, -0.01055908203125, -0.0081787109375, 0.0034027099609375, -0.0301513671875, 0.0157470703125, -0.0634765625, 0.012939453125, 0.031494140625, 0.004302978515625, 0.01904296875, 0.01263427734375, -0.0162353515625, 0.02...

[ 11249, 47, 13695, 137158, 15700, 9433, 142096, 70, 91, 2452, 3454, 4867, 502, 4527, 83279, 12301, 2109, 7136, 13538, 126684, 25379, 277, 12018, 123573, 627, 73, 14838, 1495, 6056, 9803, 169234, 7612, 532, 61669, 45226, 23, 4153, 1810, 79858...

[ 0.0750732421875, 0.173583984375, 0.2149658203125, 0.2486572265625, 0.163818359375, 0.189208984375, 0.22509765625, 0.01068115234375, 0.002593994140625, 0.1812744140625, 0.1185302734375, 0.1868896484375, 0.1083984375, 0.039886474609375, 0.0911865234375, 0.1099853515625, 0.0433349609375...

embed

35677482_c2

35677482

prolog

2

_de_san_juan,tepalcates,guelatao, peñon_viejo,acatitla,santa_marta,los_reyes,la_paz]). linea(b,[ciudad_azteca,plaza_aragon,olimpica,ecatepec,muzquiz, rio_de_los_remedios,impulsora,nezahualcoyotl,villa_de_aragon, bosque_de_aragon,deportivo_oceania,oceania,romero_rubio, Code signals: List, Prolog, salto_del_agua, isabel_...

[ -0.01080322265625, -0.01226806640625, 0.0079345703125, 0.0272216796875, -0.0037078857421875, 0.005767822265625, -0.01312255859375, 0.000732421875, 0.00836181640625, -0.01214599609375, -0.00732421875, -0.00193023681640625, 0.0050048828125, 0.009033203125, -0.01068115234375, -0.008361816...

[ 101, 112, 1462, 461, 66, 4, 67, 5007, 33478, 7, 6261, 20506, 31, 280, 12485, 19, 513, 9613, 143, 116357, 1727, 102, 36840, 90, 42796, 268, 194, 42592, 132, 275, 13359, 12409, 1828, 408, 128488, 11, 75334, 110132, 2063, 47107, 3181, 16...

[ 0.051025390625, 0.16064453125, 0.0931396484375, 0.1932373046875, 0.0753173828125, 0.0279693603515625, 0.12060546875, 0.057830810546875, 0.1302490234375, 0.0511474609375, 0.0196990966796875, 0.0899658203125, 0.0743408203125, 0.007781982421875, 0.064208984375, 0.040374755859375, 0.0070...

embed

36521634_c1

36521634

prolog

1

ayonaise,protein). char(mayonaise,sour). char(mayonaise,sweet). %! ingredient layer1 ingredient(pork). ingredient(beef). ingredient(chicken). ingredient(duck). ingredient(herbs). ingredient(meat). ingredient(shrimp). ingredient(bun). ingredient(coleslaw). ingredient(lettuce). ingredient(kaiserroll). ingredient(onion). ...

[ -0.01556396484375, -0.00157928466796875, 0.0162353515625, 0.0238037109375, -0.00970458984375, 0.02490234375, -0.0045166015625, -0.0103759765625, -0.00116729736328125, -0.023193359375, 0.003997802734375, 0.01263427734375, -0.005401611328125, 0.0189208984375, -0.006317138671875, -0.01519...

[ 537, 31, 132068, 4, 80000, 73, 194, 21441, 132, 192, 1410, 34639, 7, 1177, 126, 1745, 38, 186227, 135355, 418, 4680, 92, 372, 4240, 134342, 33, 693, 2594, 3334, 16145, 282, 257, 32298, 2676, 17643, 46813, 19729, 37356, 49036, 33464, 56,...

[ 0.2313232421875, 0.204345703125, 0.326171875, 0.0269622802734375, 0.1925048828125, 0.1614990234375, 0.081298828125, 0.1956787109375, 0.041046142578125, 0.1331787109375, 0.2205810546875, 0.181640625, 0.079345703125, 0.114501953125, 0.154541015625, 0.1229248046875, 0.1004638671875, 0...

embed

8712804_c0

8712804

prolog

0

Title: Prolog - dividing a list in N parts Problem title: Prolog - dividing a list in N parts Tags: list, prolog, divide, dcg Problem: Prolog - dividing a list in N parts I'm trying to write a predicate that divides a list into N parts. This is what I have so far. partition(1, List, List). partition(N, List, [X,Y|Rest]...

Prolog - dividing a list in N parts Prolog - dividing a list in N parts list prolog divide dcg Prolog List Rest NextToChop Choose NewN N-1 Length You Deel1 Deel2 Prolog - dividing a list in N parts I'm trying to write a predicate that divides a list into N parts. This is what I have so far. The idea is to keep chopping...

[ -0.00970458984375, 0.00049591064453125, 0.0142822265625, -0.00543212890625, -0.01226806640625, 0.01202392578125, -0.016845703125, -0.01953125, 0.0086669921875, -0.0089111328125, -0.00927734375, 0.0137939453125, -0.00173187255859375, 0.010498046875, 0.0096435546875, -0.0034637451171875,...

[ 1250, 4867, 61998, 449, 5303, 23, 541, 63920, 502, 101637, 238, 177, 32036, 49756, 4997, 7763, 58052, 211525, 2356, 839, 5759, 77554, 2583, 50275, 418, 304, 31577, 33022, 1653, 2063, 67, 3934, 2060, 6528, 13695, 681, 26783, 6626, 3789, 24...

[ 0.1737060546875, 0.23681640625, 0.2005615234375, 0.05804443359375, 0.21435546875, 0.0968017578125, 0.1993408203125, 0.2320556640625, 0.1407470703125, 0.1929931640625, 0.019683837890625, 0.0479736328125, 0.1568603515625, 0.1314697265625, 0.0977783203125, 0.054534912109375, 0.152954101...

embed

54984486_c1

54984486

prolog

1

list. count_dcg(N,N) --> []. % single item in list % No semicontext (push back) needed because only one item removed from list. count_dcg(N0,N) --> [_], \+ [_], { N is N0 + 1 }. % Semicontext (push back) needed because two items removed from list. % Need second item to stay on list. count_dcg(N,N),[C] --> [C,C]. % Sem...

[ -0.00168609619140625, 0.01251220703125, -0.00115966796875, 0.0137939453125, 0.0196533203125, 0.005035400390625, -0.01141357421875, -0.01190185546875, 0.0179443359375, -0.02001953125, -0.0091552734375, -0.013671875, -0.0020751953125, 0.01904296875, 0.01611328125, 0.0068359375, -0.0092...

[ 5303, 5, 54529, 71, 238, 177, 839, 4, 129908, 1745, 11001, 35735, 23, 438, 36137, 2271, 22829, 7332, 127, 4420, 44841, 6637, 4734, 1632, 184750, 1295, 454, 2389, 1328, 541, 83, 997, 106, 84420, 6626, 55769, 52889, 17932, 24765, 98, 866,...

[ 0.2279052734375, 0.004119873046875, 0.2276611328125, 0.010528564453125, 0.051300048828125, 0.1507568359375, 0.1448974609375, 0.0494384765625, 0.046417236328125, 0.06671142578125, 0.158447265625, 0.1475830078125, 0.05316162109375, 0.047698974609375, 0.106201171875, 0.07257080078125, 0...

embed

23862705_c0

23862705

prolog

0

Title: Understanding recursive rules in Prolog Problem title: Understanding recursive rules in Prolog Tags: prolog, recursion Problem: Understanding recursive rules in Prolog I am starting Prolog, courtesy of Seven Languages in Seven Weeks , and struggling a bit with understanding how Prolog is handling recursion. Give...

Understanding recursive rules in Prolog Understanding recursive rules in Prolog prolog recursion Understanding Prolog Total Head Tail Sum Understanding recursive rules in Prolog I am starting Prolog, courtesy of Seven Languages in Seven Weeks , and struggling a bit with understanding how Prolog is handling recursion. G...

[ 0.01226806640625, 0.02685546875, 0.012939453125, 0.026611328125, -0.0045166015625, 0.011962890625, -0.0040283203125, 0.006378173828125, 0.0191650390625, -0.0152587890625, 0.01806640625, -0.033935546875, -0.014404296875, -0.00341796875, 0.030029296875, 0.012451171875, 0.03173828125, ...

[ 9626, 144057, 195625, 5844, 91736, 1250, 4867, 502, 1830, 33867, 44816, 1218, 379, 36335, 132556, 83658, 58417, 237875, 100094, 45064, 18151, 28219, 10176, 80756, 1257, 166996, 449, 11782, 7, 10554, 114453, 110, 143726, 65395, 19, 28032, 96276,...

[ 0.059295654296875, 0.04742431640625, 0.2191162109375, 0.1380615234375, 0.1875, 0.1519775390625, 0.2369384765625, 0.095947265625, 0.1114501953125, 0.115966796875, 0.1746826171875, 0.138671875, 0.10357666015625, 0.190673828125, 0.0322265625, 0.1273193359375, 0.083251953125, 0.0045166...

embed

65532899_c0

65532899

prolog

0

Title: Proper unify_with_occurs_check/2 in SWI-Prolog? Problem title: Proper unify_with_occurs_check/2 in SWI-Prolog? Tags: swi-prolog, logical-purity, occurs-check, prolog Problem: Proper unify_with_occurs_check/2 in SWI-Prolog? s2 :- Q=[[lambda,symbol(_3026),[cons,[quote,_3434], [quote,_3514]]],[quote,_3206]], P=[_34...

Proper unify_with_occurs_check/2 in SWI-Prolog? Proper unify_with_occurs_check/2 in SWI-Prolog? swi-prolog logical-purity occurs-check prolog Proper unify_with_occurs_check SWI-Prolog _3026 _3434 _3514 _3206 Proper unify_with_occurs_check/2 in SWI-Prolog? Got this strange behaviour. I was running these test cases: Now ...

[ 0.009521484375, 0.01507568359375, -0.0030364990234375, 0.0012969970703125, -0.01361083984375, -0.0279541015625, -0.00946044921875, 0.01275634765625, 0.00469970703125, -0.007415771484375, 0.01214599609375, 0.019775390625, 0.01275634765625, -0.007720947265625, 0.01055908203125, 0.0040893...

[ 1250, 1264, 51, 40383, 76228, 6652, 48650, 78292, 12477, 159, 38969, 10752, 4867, 91, 2452, 3454, 62775, 4717, 2481, 74918, 502, 1197, 4046, 363, 152697, 5843, 2592, 139652, 903, 114453, 224833, 3034, 50218, 50339, 184345, 304, 44691, 6626, ...

[ 0.08831787109375, 0.1131591796875, 0.1607666015625, 0.1744384765625, 0.1260986328125, 0.0718994140625, 0.119140625, 0.2354736328125, 0.229248046875, 0.073974609375, 0.2210693359375, 0.12109375, 0.175537109375, 0.075439453125, 0.1451416015625, 0.07757568359375, 0.08544921875, 0.0865...

embed

29907900_c0

29907900

prolog

0

Title: In a List of Lists, Append all Lists together into one List Problem title: In a List of Lists, Append all Lists together into one List Tags: prolog Problem: In a List of Lists, Append all Lists together into one List I need to write a predicate partition/2 such that partition(L, P) is satisfied when the concaten...

In a List of Lists, Append all Lists together into one List In a List of Lists, Append all Lists together into one List prolog List Lists Append Partition Base XY1 In a List of Lists, Append all Lists together into one List I need to write a predicate partition/2 such that partition(L, P) is satisfied when the concaten...

[ -0.0093994140625, 0.017333984375, 0.006317138671875, -0.00177001953125, -0.02294921875, 0.00092315673828125, -0.01116943359375, -0.00390625, 0.0167236328125, 0.000762939453125, 0.0076904296875, -0.00146484375, 0.000415802001953125, -0.00732421875, -0.00823974609375, 0.00897216796875, ...

[ 360, 32036, 111, 5659, 3611, 756, 7, 25842, 3934, 1632, 502, 4867, 9148, 44978, 143907, 418, 3871, 33022, 1653, 2063, 2878, 1363, 12477, 866, 436, 214521, 158, 4460, 33, 11907, 5701, 5303, 339, 70541, 61799, 41, 175199, 105950, 18, 4488, ...

[ 0.010498046875, 0.262939453125, 0.08331298828125, 0.1146240234375, 0.1419677734375, 0.123291015625, 0.084228515625, 0.209228515625, 0.1068115234375, 0.1478271484375, 0.0911865234375, 0.12158203125, 0.129150390625, 0.1099853515625, 0.086181640625, 0.007659912109375, 0.041656494140625,...

embed

34891204_c0

34891204

prolog

0

Title: Fact appears only once in the Knowledge Base Problem title: Fact appears only once in the Knowledge Base Tags: prolog Problem: Fact appears only once in the Knowledge Base I have this KB (Knowledge Base): %artist(ArtistId, ArtistName, YearofDebut). %album(AlbumId, AlbumName, YearOfRelease, Artists). %song(AlbumI...

Fact appears only once in the Knowledge Base Fact appears only once in the Knowledge Base prolog Fact Knowledge Base ArtistId ArtistName YearofDebut AlbumId AlbumName YearOfRelease Artists Songname Duration MIEIC John Williams LEIC One Hit Wonder Reloaded Best Legacy Release Rap Indiana Jones Pop Harry Potter Rock Jaws...

[ 0.023193359375, 0.005401611328125, 0.008544921875, -0.0040283203125, 0.0023040771484375, 0.006866455078125, -0.000820159912109375, 0.01470947265625, 0.00162506103515625, -0.011962890625, -0.01177978515625, 0.0036468505859375, -0.011962890625, -0.00408935546875, -0.00244140625, 0.012084...

[ 132640, 135179, 4734, 24145, 23, 191428, 44978, 502, 4867, 69891, 163612, 42552, 4390, 8789, 37340, 132887, 133, 5986, 11627, 79843, 276, 20441, 16259, 4939, 40478, 17428, 6561, 43482, 76648, 853, 63033, 11345, 84671, 152590, 41474, 122069, 293...

[ 0.301513671875, 0.2332763671875, 0.19677734375, 0.27880859375, 0.1392822265625, 0.231689453125, 0.254638671875, 0.1524658203125, 0.2005615234375, 0.09552001953125, 0.0180206298828125, 0.1722412109375, 0.03094482421875, 0.1336669921875, 0.119384765625, 0.02960205078125, 0.015747070312...

embed

59520621_c1

59520621

prolog

1

I posted the same question on the SWI Prolog forum but did not get any responses. I am running SWI Prolog. % https://www.swi-prolog.org/pldoc/doc/_SWI_/library/clp/clpr.pl :-use_module(library(clpr)). % time is ordered precedes(1, 2). precedes(2, 3). % knowledge p(X1, T2, fire):- p(X2, T1, presenceOfFlammableMaterial)...

[ 0.0164794921875, 0.01312255859375, 0.010986328125, 0.031982421875, 0.0030975341796875, 0.01165771484375, 0.034423828125, -0.017333984375, 0.0120849609375, -0.044189453125, 0.0091552734375, 0.0211181640625, -0.0037994384765625, -0.0078125, 0.017822265625, 0.007598876953125, 0.00256347...

[ 44183, 5701, 9655, 159, 38969, 1250, 4867, 4738, 959, 57553, 51042, 1745, 2452, 3454, 2424, 29713, 2844, 26775, 34937, 10287, 4032, 83279, 150, 1733, 12989, 107671, 4958, 90, 8439, 51359, 915, 1542, 418, 384, 304, 11476, 169424, 132887, 371...

[ 0.027801513671875, 0.0260162353515625, 0.03363037109375, 0.0692138671875, 0.23388671875, 0.148193359375, 0.208984375, 0.0455322265625, 0.04266357421875, 0.09075927734375, 0.1055908203125, 0.060516357421875, 0.208740234375, 0.08209228515625, 0.0162506103515625, 0.0921630859375, 0.0955...

embed

4747498_c0

4747498

prolog

0

Title: Tennis match scheduling Problem title: Tennis match scheduling Tags: prolog, scheduling, algorithm, clpfd Problem: Tennis match scheduling There are a limited number of players and a limited number of tennis courts. At each round, there can be at most as many matches as there are courts. Nobody plays 2 rounds wi...

Tennis match scheduling Tennis match scheduling prolog scheduling algorithm clpfd Tennis Tennis match scheduling There are a limited number of players and a limited number of tennis courts. At each round, there can be at most as many matches as there are courts. Nobody plays 2 rounds without a break. Everyone plays a m...

[ -0.00113677978515625, 0.02294921875, 0.0054931640625, 0.0216064453125, -0.01611328125, -0.0279541015625, -0.024658203125, 0.015869140625, -0.000926971435546875, -0.0191650390625, -0.004913330078125, -0.0103759765625, 0.01177978515625, 0.030517578125, 0.0020599365234375, 0.0159912109375...

[ 118843, 14858, 5094, 15246, 2069, 502, 4867, 234873, 39557, 71, 84046, 14012, 92865, 69686, 29685, 12638, 68807, 831, 2684, 237, 5941, 438, 37873, 11301, 116, 15490, 36356, 191096, 26548, 30309, 37076, 103687, 80889, 51776, 10846, 7722, 79986, ...

[ 0.255126953125, 0.1844482421875, 0.1793212890625, 0.2110595703125, 0.05682373046875, 0.1126708984375, 0.1981201171875, 0.2548828125, 0.0162200927734375, 0.056884765625, 0.1484375, 0.051025390625, 0.1959228515625, 0.260009765625, 0.18798828125, 0.0830078125, 0.1651611328125, 0.06359...

embed

63574077_c0

63574077

prolog

0

Title: Prolog rule can condition to be before a date, but not after a date, why? Problem title: Prolog rule can condition to be before a date, but not after a date, why? Tags: prolog-setof, prolog Problem: Prolog rule can condition to be before a date, but not after a date, why? I have the following rules looking for f...

Prolog rule can condition to be before a date, but not after a date, why? Prolog rule can condition to be before a date, but not after a date, why? prolog-setof prolog Prolog Date Category Preceding Amount After Rows CEM Consulting Package Tuition Prolog rule can condition to be before a date, but not after a date, why...

[ 0.01434326171875, -0.007781982421875, 0.009521484375, 0.035888671875, -0.01123046875, -0.0022735595703125, -0.00897216796875, 0.0274658203125, 0.0150146484375, -0.007720947265625, 0.000461578369140625, -0.004791259765625, -0.000316619873046875, -0.03662109375, 0.0128173828125, -0.00253...

[ 1250, 4867, 79986, 831, 35431, 186, 8108, 5622, 1284, 959, 7103, 15400, 502, 4390, 25512, 49057, 1914, 329, 121147, 24372, 96190, 17513, 149512, 56607, 1371, 14, 91736, 16487, 100, 15824, 63399, 24233, 112474, 107671, 214, 43240, 5885, 4966, ...

[ 0.185546875, 0.25634765625, 0.190185546875, 0.0950927734375, 0.2357177734375, 0.05963134765625, 0.21484375, 0.16064453125, 0.05352783203125, 0.0635986328125, 0.21044921875, 0.1138916015625, 0.1119384765625, 0.0178375244140625, 0.0994873046875, 0.03900146484375, 0.0408935546875, 0.0...

embed

42973822_c1

42973822

prolog

1

R = [[[alexanderplatz, u2, gleisdreieck, ruhleben], [gleisdreieck, u1, prinzenstrasse, 'warschauer strasse']], 6900] ; R = [[[alexanderplatz, u2, stadtmitte, ruhleben], [stadtmitte, u6, 'hallesches tor', 'alt-mariendorf'], ['hallesches tor', u1, prinzenstrasse, 'warschauer strasse']], 5000] ; R = [[[alexanderplatz, u8...

[ 0.0142822265625, 0.007476806640625, 0.0036468505859375, 0.0126953125, -0.000823974609375, -0.00494384765625, -0.0020904541015625, -0.0166015625, 0.0181884765625, -0.04345703125, 0.0003376007080078125, 0.0084228515625, -0.002655029296875, -0.01055908203125, -0.018798828125, 0.0202636718...

[ 627, 2203, 16020, 820, 46149, 75, 304, 67830, 7090, 60113, 21875, 53047, 15592, 14, 418, 2448, 3121, 2816, 4205, 32854, 6363, 2619, 305, 20543, 47704, 4007, 67, 910, 104603, 9983, 7010, 14438, 127830, 19692, 1019, 10910, 4223, 2189, 604, ...

[ 0.1849365234375, 0.0787353515625, 0.044342041015625, 0.052703857421875, 0.18701171875, 0.0694580078125, 0.08380126953125, 0.03460693359375, 0.0908203125, 0.10528564453125, 0.08349609375, 0.1981201171875, 0.05841064453125, 0.010284423828125, 0.0207672119140625, 0.06536865234375, 0.032...

embed

2981222_c0

2981222

prolog

0

Title: Prolog Beginner: How to unify with arithmetic comparison operators or how to get a set var to range of values Problem title: Prolog Beginner: How to unify with arithmetic comparison operators or how to get a set var to range of values Tags: prolog, clpfd Problem: Prolog Beginner: How to unify with arithmetic com...

Prolog Beginner: How to unify with arithmetic comparison operators or how to get a set var to range of values Prolog Beginner: How to unify with arithmetic comparison operators or how to get a set var to range of values prolog clpfd Prolog Beginner How in1 in2 Some Prolog Beginner: How to unify with arithmetic comparis...

[ 0.0064697265625, 0.0004405975341796875, 0.00970458984375, 0.00628662109375, -0.006134033203125, 0.006011962890625, -0.010498046875, -0.0035400390625, -0.00144195556640625, -0.001739501953125, 0.00811767578125, 0.00799560546875, 0.0027008056640625, 0.0023193359375, 0.02880859375, -0.022...

[ 1250, 4867, 67053, 56, 11249, 51, 40383, 678, 8962, 225490, 39933, 3642, 2046, 5423, 285, 47, 37457, 142424, 502, 23, 304, 3525, 3871, 33022, 892, 1505, 606, 820, 15190, 101935, 17721, 757, 15205, 3789, 27489, 29806, 9444, 3444, 2806, 188...

[ 0.18408203125, 0.2685546875, 0.0748291015625, 0.0736083984375, 0.04736328125, 0.1278076171875, 0.1527099609375, 0.074951171875, 0.08203125, 0.1929931640625, 0.13330078125, 0.008758544921875, 0.042816162109375, 0.1102294921875, 0.18408203125, 0.09320068359375, 0.1392822265625, 0.110...

embed

37093257_c0

37093257

prolog

0

Title: Prolog Maze: Lookup predicate Problem title: Prolog Maze: Lookup predicate Tags: lookup, maze, prolog Problem: Prolog Maze: Lookup predicate I have a question: How to do a lookup predicate for a maze. Given a lab: [[[down,left,up],[left,down,up],[right,up],[up],[,up],[right,left,up]], [[left,down],[down,up],[dow...

Prolog Maze: Lookup predicate Prolog Maze: Lookup predicate lookup maze prolog Prolog Maze Lookup Lab Walls N-1 Y1-1 X1-1 map_calc movs_possiveis Movs Poss Prolog Maze: Lookup predicate I have a question: How to do a lookup predicate for a maze. Given a lab: I need define a way of looking up a cell in the Labryinth dat...

[ 0.00640869140625, -0.009765625, 0.0235595703125, 0.004302978515625, 0.0084228515625, -0.007781982421875, 0.016845703125, 0.0208740234375, 0.01116943359375, -0.01953125, -0.00762939453125, 0.00994873046875, -0.021484375, -0.0205078125, 0.000629425048828125, -0.005218505859375, 0.00294...

[ 1250, 4867, 29678, 13, 60818, 2037, 1653, 2063, 67, 6713, 291, 731, 502, 21488, 23706, 541, 5759, 990, 115727, 22288, 6827, 931, 18043, 7522, 29888, 164, 276, 515, 13498, 9655, 11249, 47, 54, 10, 100, 60054, 61924, 3917, 16487, 1257, 38...

[ 0.1513671875, 0.2149658203125, 0.1622314453125, 0.1109619140625, 0.1395263671875, 0.2099609375, 0.203125, 0.24365234375, 0.142822265625, 0.1993408203125, 0.160888671875, 0.2177734375, 0.08587646484375, 0.113037109375, 0.1385498046875, 0.0079345703125, 0.05889892578125, 0.0281982421...

embed

9966407_c1

9966407

prolog

1

like a kinda tedious/poor method perhaps? Thanks in advance for the help! Edit: Thanks to the help below, I've gotten a program running that is functional (at least from what I can tell). I've put it in the code below, in case someone else wanders here. I believe it is, however, extremely inefficient, so there's plent...

[ -0.0028076171875, -0.00122833251953125, -0.002166748046875, -0.005859375, 0.0050048828125, 0.00994873046875, 0.0189208984375, -0.0294189453125, -0.0022735595703125, 0.0047607421875, 0.0289306640625, 0.0159912109375, -0.005523681640625, -0.00726318359375, 0.00604248046875, -0.0172119140...

[ 1884, 8562, 120, 5670, 223, 771, 748, 55300, 95134, 129745, 4358, 42079, 35064, 17763, 1528, 51042, 123309, 257, 19713, 1295, 2367, 831, 14192, 70, 18151, 23, 7225, 22008, 37076, 6165, 14202, 18822, 4, 49903, 111531, 24500, 45964, 7, 87794,...

[ 0.056610107421875, 0.0556640625, 0.031829833984375, 0.061920166015625, 0.006378173828125, 0.1278076171875, 0.049224853515625, 0.15966796875, 0.04974365234375, 0.030914306640625, 0.06597900390625, 0.008544921875, 0.048980712890625, 0.048553466796875, 0.1778564453125, 0.1112060546875, ...

embed

15031203_c0

15031203

prolog

0

Title: Meaning of -> in swi-prolog Problem title: Meaning of -> in swi-prolog Tags: prolog Problem: Meaning of -> in swi-prolog I have a program in swi-prolog and there is an operator(?) -> , which I have met for the first time and I don't know what it is doing. There is a fragment of code, which I don't understa...

Meaning of -> in swi-prolog Meaning of -> in swi-prolog prolog Meaning all_pp J:PP Meaning of -> in swi-prolog I have a program in swi-prolog and there is an operator(?) -> , which I have met for the first time and I don't know what it is doing. There is a fragment of code, which I don't understand: I found that ...

[ 0.0169677734375, 0.00653076171875, 0.0283203125, -0.0185546875, -0.01611328125, 0.000766754150390625, -0.0019683837890625, 0.01904296875, -0.007171630859375, -0.0238037109375, 0.0059814453125, -0.0086669921875, -0.01080322265625, -0.0306396484375, 0.01055908203125, -0.0159912109375, ...

[ 1215, 11, 592, 20, 1230, 5386, 91, 2452, 3454, 4867, 111, 502, 756, 454, 6366, 821, 12, 17487, 33079, 23, 1528, 39933, 435, 3714, 20594, 38551, 18151, 18, 28219, 14037, 3229, 765, 7068, 2174, 1193, 29568, 990, 71924, 120262, 567, 43240,...

[ 0.073486328125, 0.1019287109375, 0.0279388427734375, 0.125244140625, 0.119873046875, 0.2275390625, 0.0230560302734375, 0.19189453125, 0.13525390625, 0.2049560546875, 0.037139892578125, 0.1351318359375, 0.1341552734375, 0.001678466796875, 0.212646484375, 0.1212158203125, 0.00866699218...

embed

54716395_c0

54716395

prolog

0

Title: How Do I Compare a List to a Database Prolog Problem title: How Do I Compare a List to a Database Prolog Tags: compare, prolog, list Problem: How Do I Compare a List to a Database Prolog I have a database of facts that has entries like this snippet symptom(shingles,headache). symptom(shingles,fever). symptom(shi...

How Do I Compare a List to a Database Prolog How Do I Compare a List to a Database Prolog compare prolog list How Compare List Database Prolog Symptoms Please Done read_string Response Symptoms0 How Do I Compare a List to a Database Prolog I have a database of facts that has entries like this snippet I then have a pred...

[ 0.0162353515625, -0.0228271484375, 0.00677490234375, 0.024658203125, -0.0201416015625, 0.01953125, -0.007720947265625, 0.0167236328125, 0.007598876953125, -0.039306640625, 0.0150146484375, 0.021484375, -0.005584716796875, -0.0157470703125, -0.0145263671875, -0.0113525390625, 0.012023...

[ 11249, 984, 87, 113307, 13, 32036, 47, 187781, 1250, 4867, 69101, 502, 5303, 149450, 91693, 92748, 10, 63399, 15824, 112820, 1653, 2063, 153698, 38937, 3642, 54, 17932, 34627, 15190, 70997, 15700, 30957, 3820, 814, 128668, 54700, 1577 ]

[ 0.085205078125, 0.048858642578125, 0.052490234375, 0.20947265625, 0.10498046875, 0.243896484375, 0.12548828125, 0.215576171875, 0.1417236328125, 0.2225341796875, 0.2086181640625, 0.1087646484375, 0.18603515625, 0.1781005859375, 0.01422119140625, 0.0204315185546875, 0.02880859375, 0...

embed