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
37938384_c0	37938384	prolog	0	Title: convert comment string to an ASCII character list in sicstus-prolog Problem title: convert comment string to an ASCII character list in sicstus-prolog Tags: prolog, sicstus-prolog, unix Problem: convert comment string to an ASCII character list in sicstus-prolog currently I am working on comparison between SICSt...	convert comment string to an ASCII character list in sicstus-prolog convert comment string to an ASCII character list in sicstus-prolog prolog sicstus-prolog unix ASCII pr_ua_sfochi Response CHI Q9.30 SFO NUC2189.76END ROE1.0 USD ZPSFOCHI XF4.50SFO4.5 fua2sfs fic_ticketinfo cat35 cat35info Transaction static.static.ser...	[ 0.011474609375, -0.005767822265625, -0.0159912109375, 0.0002918243408203125, -0.01348876953125, 0.006072998046875, 0.0023956298828125, 0.0133056640625, -0.006622314453125, 0.00958251953125, 0.007110595703125, 0.00970458984375, 0.00439453125, -0.000598907470703125, -0.01708984375, -0.00...	[ 96760, 6868, 79315, 47, 125429, 10001, 62816, 5303, 26536, 18253, 3454, 4867, 142, 502, 51, 4083, 3116, 3584, 1861, 92748, 62455, 2396, 1126, 1197, 51980, 18057, 142180, 11835, 39015, 102107, 19052, 9059, 50620, 2525, 104867, 17447, 20941, 14...	[ 0.145751953125, 0.2384033203125, 0.2252197265625, 0.0673828125, 0.117431640625, 0.228759765625, 0.179443359375, 0.176025390625, 0.09912109375, 0.2147216796875, 0.105224609375, 0.18212890625, 0.00836181640625, 0.1143798828125, 0.035491943359375, 0.0261077880859375, 0.10498046875, 0....	embed
77466582_c0	77466582	prolog	0	Title: Lion and Unicorn with Prolog SAT Solver Problem title: Lion and Unicorn with Prolog SAT Solver Tags: prolog, sat Problem: Lion and Unicorn with Prolog SAT Solver Would a Prolog SAT solver have an advantage in solving this riddle: When Alice entered the forest of forgetfulness, she did not forget everything, only...	Lion and Unicorn with Prolog SAT Solver Lion and Unicorn with Prolog SAT Solver prolog sat Lion Unicorn Prolog SAT Solver Lion and Unicorn with Prolog SAT Solver Would a Prolog SAT solver have an advantage in solving this riddle: Performance advantage over a solution like here (Free Access): The lion and the unicorn me...	[ 0.011962890625, -0.005401611328125, -0.00191497802734375, 0.01165771484375, -0.0137939453125, -0.0157470703125, 0.01104736328125, 0.0030364990234375, -0.00958251953125, -0.048583984375, -0.01031494140625, 0.015869140625, -0.0240478515625, 0.00897216796875, 0.00921630859375, 0.005676269...	[ 82209, 136, 11789, 10517, 19, 678, 1250, 4867, 75210, 6678, 814, 502, 11736, 154559, 10, 3115, 765, 142, 92940, 23, 6496, 903, 31351, 19298, 94030, 645, 29806, 1884, 3688, 81437, 40266, 581, 45486, 70, 60347, 42, 435, 10514, 47510, 112297...	[ 0.210693359375, 0.1707763671875, 0.1177978515625, 0.2130126953125, 0.1307373046875, 0.1356201171875, 0.163330078125, 0.2236328125, 0.226318359375, 0.178466796875, 0.2156982421875, 0.1124267578125, 0.1466064453125, 0.0814208984375, 0.0855712890625, 0.1806640625, 0.044769287109375, 0...	embed
78401940_c1	78401940	prolog	1	in some order; one of these films is Tower of London. The difference between the numbers of the screen on which Newton’s Laws and Vulture Gulch are playing is the same as the difference between the numbers of screen on which the Gentleman and Tower of London are showing. We use the variables Brisbane, Ellipsis, Frostf...	in some order; one of these films is Tower of London. The difference between the numbers of the screen on which Newton’s Laws and Vulture Gulch are playing is the same as the difference between the numbers of screen on which the Gentleman and Tower of London are showing. We use the variables Brisbane, Ellipsis, Frostf...	[ 0.00872802734375, 0.0108642578125, -0.002227783203125, 0.01092529296875, 0.0030364990234375, -0.01416015625, -0.0115966796875, 0.0079345703125, 0.0157470703125, 0.006195068359375, -0.0064697265625, -0.016845703125, 0.0205078125, 0.0164794921875, -0.01068115234375, 0.000774383544921875,...	[ 3060, 12989, 1632, 6097, 54180, 83, 68718, 111, 9020, 60212, 17721, 101935, 70, 49119, 145076, 26, 7, 36293, 136, 48138, 6644, 16965, 206, 75169, 5701, 44704, 133, 669, 141377, 1401, 4527, 77336, 15640, 36012, 540, 150, 74988, 166238, 73702...	[ 0.0144500732421875, 0.113525390625, 0.0369873046875, 0.03826904296875, 0.181640625, 0.056365966796875, 0.223876953125, 0.2110595703125, 0.2060546875, 0.176513671875, 0.038238525390625, 0.1395263671875, 0.03948974609375, 0.2158203125, 0.2109375, 0.1019287109375, 0.06732177734375, 0....	embed
16795386_c0	16795386	prolog	0	Title: Why this SPARQL query don't work into Prolog? Problem title: Why this SPARQL query don't work into Prolog? Tags: prolog, sparql, semantic-web Problem: Why this SPARQL query don't work into Prolog? I am trying to integrate SPARQL queries into Prolog program (I am using SWI-Prolog) To test it I am doing ...	Why this SPARQL query don't work into Prolog? Why this SPARQL query don't work into Prolog? prolog sparql semantic-web Why SPARQL Prolog Why this SPARQL query don't work into Prolog? I am trying to integrate SPARQL queries into Prolog program (I am using SWI-Prolog) To test it I am doing the following operati...	[ -0.002960205078125, 0.031982421875, 0.000492095947265625, 0.0272216796875, -0.0031585693359375, 0.00244140625, -0.01190185546875, -0.0007781982421875, 0.00156402587890625, -0.058837890625, 0.00726318359375, -0.003570556640625, -0.0096435546875, -0.00046539306640625, 0.0120849609375, -0...	[ 44084, 903, 159, 60436, 2737, 866, 41, 1294, 2301, 3768, 18, 4488, 3934, 1250, 4867, 502, 27148, 99247, 484, 109109, 14051, 31577, 78779, 10484, 1528, 38969, 10752, 3034, 25632, 41018, 188, 128019, 71924, 75101, 83279, 2844, 5765, 26404, 22...	[ 0.1124267578125, 0.0908203125, 0.04168701171875, 0.171875, 0.1981201171875, 0.18408203125, 0.176025390625, 0.136474609375, 0.06707763671875, 0.05987548828125, 0.1357421875, 0.159912109375, 0.1435546875, 0.1822509765625, 0.2254638671875, 0.1031494140625, 0.1729736328125, 0.219726562...	embed
55250974_c0	55250974	prolog	0	Title: Debugging a piece of codes in prolog Problem title: Debugging a piece of codes in prolog Tags: prolog Problem: Debugging a piece of codes in prolog There a piece of codes in Prolog, which is used to convert a txt file to 4 lists( 3 1D_lists one each line, last one is 2D_list, one sublist each line of rest lines....	Debugging a piece of codes in prolog Debugging a piece of codes in prolog prolog Str Debugging read_line_to_string Line Stream split_string L_list1 Split atom_number Conver Line1 L_list2 FQty Line2 L_list3 WQty read_Costs Costs at_end_of_stream Line3 L_list4 Costs1 Costs2 Debugging a piece of codes in prolog There a pi...	[ 0.01422119140625, -0.01165771484375, -0.0035247802734375, 0.0186767578125, -0.0017547607421875, -0.0025787353515625, -0.0027008056640625, 0.0113525390625, 0.006378173828125, -0.009765625, -0.0062255859375, -0.0167236328125, -0.0010833740234375, 0.00007486343383789062, 0.0169677734375, ...	[ 262, 978, 36659, 63847, 18151, 502, 4867, 111, 23351, 12301, 2256, 188, 91693, 16777, 115061, 65450, 339, 6562, 46474, 34627, 2606, 814, 2737, 939, 5510, 63099, 3611, 86429, 617, 1250, 11814, 96760, 124326, 11435, 47, 201, 5303, 138, 397, ...	[ 0.1326904296875, 0.2276611328125, 0.05889892578125, 0.1400146484375, 0.2430419921875, 0.1505126953125, 0.2364501953125, 0.01678466796875, 0.1136474609375, 0.1298828125, 0.14013671875, 0.12451171875, 0.1729736328125, 0.12109375, 0.151123046875, 0.11474609375, 0.0391845703125, 0.1424...	embed
40294688_c0	40294688	prolog	0	Title: Operations on lists in Prolog Problem title: Operations on lists in Prolog Tags: prolog, list Problem: Operations on lists in Prolog I'm new to Prolog and what I want to achieve is to perform an operation like append/3 over two lists that are saved in my program. I don't need to open swi-prolog and type append([...	Operations on lists in Prolog Operations on lists in Prolog prolog list Operations Prolog personal_union personal_list Operations on lists in Prolog I'm new to Prolog and what I want to achieve is to perform an operation like append/3 over two lists that are saved in my program. I don't need to open swi-prolog and type...	[ 0.01202392578125, 0.0264892578125, 0.01190185546875, 0.01275634765625, -0.003021240234375, 0.003997802734375, -0.0033721923828125, 0.01251220703125, 0.033935546875, -0.05517578125, 0.016357421875, -0.01031494140625, -0.01806640625, 0.01556396484375, 0.0162353515625, -0.01171875, 0.02...	[ 102203, 98, 5303, 7, 1250, 4867, 502, 3357, 87046, 6562, 3525, 3444, 69307, 51339, 41018, 114689, 71, 18113, 645, 6626, 57, 1528, 9803, 2452, 3454, 10644, 170, 92, 1542, 113054, 1193, 1369, 3871, 3996, 7722, 37064, 31, 2424, 11435, 79986,...	[ 0.1949462890625, 0.1048583984375, 0.224365234375, 0.049468994140625, 0.163818359375, 0.23486328125, 0.10528564453125, 0.0753173828125, 0.137451171875, 0.19140625, 0.00152587890625, 0.004638671875, 0.03662109375, 0.079345703125, 0.1929931640625, 0.141357421875, 0.091552734375, 0.180...	embed
27317069_c1	27317069	prolog	1	First\|Rest], Min, [First\|As]) :- !, min_prefix(Rest, Min, As). min_prefix(_, _, []). ?- find_min_3(Min, As). Min = 2, As = [b, e, h]. Finally, to the question(s): Can I do this directly with library(aggregate)? It feels like it should be possible.... Or is there a predicate like std::partition_point from the C++ standa...	First\|Rest], Min, [First\|As]) :- !, min_prefix(Rest, Min, As). min_prefix(_, _, []). ?- find_min_3(Min, As). Min = 2, As = [b, e, h]. Finally, to the question(s): Can I do this directly with library(aggregate)? It feels like it should be possible.... Or is there a predicate like std::partition_point from the C++ standa...	[ -0.000087738037109375, -0.0264892578125, 0.0130615234375, -0.00994873046875, -0.031982421875, -0.006134033203125, 0.01129150390625, -0.0137939453125, 0.006500244140625, -0.022705078125, 0.0087890625, 0.0250244140625, 0.007293701171875, -0.0023040771484375, 0.017578125, 0.00095748901367...	[ 23972, 58745, 1052, 525, 4211, 207263, 19659, 268, 15772, 711, 881, 4692, 55923, 1301, 7413, 1249, 363, 59076, 2203, 116, 275, 28, 1096, 5, 9655, 4171, 87, 54, 903, 105237, 678, 35773, 1294, 132, 197564, 12319, 1884, 442, 5608, 7722, 27...	[ 0.2069091796875, 0.045074462890625, 0.197021484375, 0.2109375, 0.2802734375, 0.1348876953125, 0.1949462890625, 0.0970458984375, 0.0316162109375, 0.04229736328125, 0.2425537109375, 0.07574462890625, 0.156982421875, 0.1629638671875, 0.180908203125, 0.259521484375, 0.1510009765625, 0....	embed
54971608_c1	54971608	prolog	1	), (J is N-I+1, nth1(I,X,A), nth1(J,Y,A))). X = [1, 2, 3, 4, 5], N = 5, Y = [5, 4, 3, 2, 1]. Subset: subset(X, Y) :- forany(A, {X,Y}, member(A,X), member(A, Y)). A funny way to generate all permutations of a list without duplicates: permutation(X, Y) :- length(X, N), length(Y, N), subset(X, Y). ?- permutation([1,2,3],X...	), (J is N-I+1, nth1(I,X,A), nth1(J,Y,A))). X = [1, 2, 3, 4, 5], N = 5, Y = [5, 4, 3, 2, 1]. Subset: subset(X, Y) :- forany(A, {X,Y}, member(A,X), member(A, Y)). A funny way to generate all permutations of a list without duplicates: permutation(X, Y) :- length(X, N), length(Y, N), subset(X, Y). ?- permutation([1,2,3],X...	[ 0.0010833740234375, 0.013916015625, 0.03173828125, -0.0036163330078125, -0.009033203125, -0.00946044921875, -0.007568359375, -0.00469970703125, 0.0235595703125, -0.006927490234375, -0.00142669677734375, 0.025634765625, 0.0113525390625, -0.0042724609375, -0.0244140625, -0.0079345703125,...	[ 247, 1375, 83, 541, 9, 568, 21748, 653, 927, 418, 1542, 284, 1723, 32149, 1193, 2203, 68252, 116, 138, 201, 190, 990, 758, 106, 8273, 3509, 1614, 15772, 100, 4848, 32786, 62, 99864, 3917, 139392, 756, 117, 14311, 21094, 111, 5303, 154...	[ 0.058807373046875, 0.180419921875, 0.0780029296875, 0.118896484375, 0.00982666015625, 0.0775146484375, 0.1107177734375, 0.0181427001953125, 0.1165771484375, 0.037200927734375, 0.1431884765625, 0.049407958984375, 0.0975341796875, 0.023681640625, 0.17041015625, 0.0902099609375, 0.03466...	embed
55412458_c1	55412458	prolog	1	"invent" empty lists in the first argument it would mean an infinite set of solutions for anything in the first argument. Although my full program has other constraints to prevent this, I can understand why flatten might not want to accomodate it. I can account for the edge cases (pun intended) by matching every permu...	"invent" empty lists in the first argument it would mean an infinite set of solutions for anything in the first argument. Although my full program has other constraints to prevent this, I can understand why flatten might not want to accomodate it. I can account for the edge cases (pun intended) by matching every permu...	[ -0.00537109375, 0.007293701171875, 0.00579833984375, 0.01470947265625, -0.01507568359375, 0.00634765625, -0.0185546875, -0.00994873046875, 0.0157470703125, 0.0013885498046875, -0.004241943359375, -0.00019359588623046875, 0.017333984375, -0.0059814453125, 0.0014801025390625, 0.024047851...	[ 132894, 201505, 5303, 7, 5117, 10750, 29459, 54241, 5423, 51347, 23937, 4393, 1528, 2816, 56282, 28219, 49878, 510, 13648, 3444, 52621, 17489, 831, 15426, 100, 121303, 50218, 179140, 14858, 11907, 117, 561, 2837, 17043, 418, 571, 1126, 866, ...	[ 0.200927734375, 0.203125, 0.2135009765625, 0.01727294921875, 0.0958251953125, 0.2054443359375, 0.034423828125, 0.09393310546875, 0.026153564453125, 0.1605224609375, 0.06317138671875, 0.00830078125, 0.10491943359375, 0.0714111328125, 0.0787353515625, 0.00439453125, 0.215087890625, 0...	embed
7580859_c0	7580859	prolog	0	Title: Prolog programming - path way to a solution Problem title: Prolog programming - path way to a solution Tags: prolog Problem: Prolog programming - path way to a solution I am studying prolog at university and facing some problems. What I already found out is just solution to a problem. However, I'm more intereste...	Prolog programming - path way to a solution Prolog programming - path way to a solution prolog Prolog List Flattened Item Tail is_list Prolog programming - path way to a solution I am studying prolog at university and facing some problems. What I already found out is just solution to a problem. However, I'm more intere...	[ 0.01080322265625, 0.0223388671875, 0.0106201171875, 0.0033111572265625, -0.00494384765625, 0.0142822265625, 0.0002918243408203125, -0.007293701171875, 0.01190185546875, -0.023681640625, 0.0140380859375, -0.015380859375, -0.0194091796875, 0.0146484375, 0.0019378662109375, 0.006256103515...	[ 1250, 4867, 56037, 449, 60875, 3917, 47, 29806, 502, 32036, 106516, 510, 297, 78426, 1218, 379, 83, 6562, 10, 35187, 214, 152363, 7808, 44402, 21771, 14037, 1810, 1660, 2967, 60892, 5351, 2046, 6044, 115992, 44457, 4358, 27781, 11757, 678, ...	[ 0.1771240234375, 0.23681640625, 0.1502685546875, 0.09112548828125, 0.1739501953125, 0.14306640625, 0.1351318359375, 0.1884765625, 0.1243896484375, 0.1971435546875, 0.2183837890625, 0.21435546875, 0.06689453125, 0.1875, 0.169189453125, 0.12548828125, 0.114013671875, 0.212158203125, ...	embed
34242458_c0	34242458	prolog	0	Title: Prolog receiving Json post Problem title: Prolog receiving Json post Tags: prolog, swi-prolog, post, http, json Problem: Prolog receiving Json post This is my first question in stackoverflow so, bear with me. I'm tring to build a simple Prolog api that receives json posts and after processing them, sends another...	Prolog receiving Json post Prolog receiving Json post prolog swi-prolog post http json Prolog Json Request http_read_json_dict DictIn DictOut reply_json ERROR atom_codes Arguments Prolog receiving Json post This is my first question in stackoverflow so, bear with me. I'm tring to build a simple Prolog api that receives...	[ 0.00860595703125, 0.0291748046875, 0.00372314453125, 0.0203857421875, -0.011962890625, 0.015625, 0.00982666015625, 0.01226806640625, -0.00628662109375, -0.045654296875, 0.0235595703125, 0.0235595703125, -0.036865234375, -0.011962890625, 0.0257568359375, 0.013427734375, -0.00077819824...	[ 1250, 4867, 217063, 821, 1681, 1305, 502, 2452, 3454, 1621, 1647, 853, 75616, 39116, 170, 61669, 60897, 4153, 79858, 75836, 151206, 34627, 40899, 112140, 5117, 9655, 177261, 5465, 118664, 45367, 8781, 31470, 53299, 32323, 25379, 15700, 4420, ...	[ 0.1610107421875, 0.26513671875, 0.0860595703125, 0.1253662109375, 0.21533203125, 0.1304931640625, 0.078369140625, 0.1859130859375, 0.13330078125, 0.042022705078125, 0.1024169921875, 0.055267333984375, 0.1793212890625, 0.10101318359375, 0.03704833984375, 0.09942626953125, 0.0317993164...	embed
19558041_c0	19558041	prolog	0	Title: Proper Subset - Prolog Problem title: Proper Subset - Prolog Tags: prolog, subset Problem: Proper Subset - Prolog I am attempting to write a program that takes two lists as input and checks for proper subset. I started with: proper([A],[]). proper([],[A]). proper([A\|T1],[A\|T2]) :- proper(T1,T2). This works perfe...	Proper Subset - Prolog Proper Subset - Prolog prolog subset Proper Subset Prolog Yes Proper Subset - Prolog I am attempting to write a program that takes two lists as input and checks for proper subset. I started with: This works perfectly fine for inputs in the exact same order. for instance: But doesn't for inputs su...	[ 0.00665283203125, -0.003875732421875, 0.0194091796875, 0.0140380859375, -0.0186767578125, 0.004730224609375, -0.0096435546875, -0.005828857421875, 0.017578125, 0.006805419921875, 0.01361083984375, 0.015869140625, -0.0159912109375, -0.002593994140625, 0.0181884765625, -0.005035400390625...	[ 1250, 1264, 8273, 3509, 4867, 502, 1614, 32635, 20, 81887, 33022, 1528, 51776, 6626, 5303, 107730, 12765, 100, 27798, 43240, 169123, 5885, 24763, 5701, 12989, 22027, 18, 32354, 23, 2811, 40383, 18151, 959, 2967, 17932, 70731, 17357, 756, 43...	[ 0.1661376953125, 0.2052001953125, 0.2239990234375, 0.2435302734375, 0.2275390625, 0.1314697265625, 0.21923828125, 0.04998779296875, 0.00469970703125, 0.04107666015625, 0.0653076171875, 0.1136474609375, 0.021484375, 0.09564208984375, 0.16552734375, 0.1517333984375, 0.137451171875, 0...	embed
67249600_c0	67249600	prolog	0	Title: Is there a more efficient way to manage large data than using facts? Problem title: Is there a more efficient way to manage large data than using facts? Tags: prolog Problem: Is there a more efficient way to manage large data than using facts? I finished working on an AI project that manages long strings (About ...	Is there a more efficient way to manage large data than using facts? Is there a more efficient way to manage large data than using facts? prolog facts INDEX NAMESTRING1 STRING1 NAMESTRING2 STRING2 FITNESS Is there a more efficient way to manage large data than using facts? I finished working on an AI project that manag...	[ 0.0235595703125, 0.010986328125, -0.00142669677734375, 0.035400390625, -0.01123046875, 0.00604248046875, 0.0206298828125, 0.01409912109375, 0.0216064453125, -0.04248046875, 0.029052734375, -0.00958251953125, 0.010009765625, -0.01251220703125, 0.0036163330078125, 0.0022125244140625, 0...	[ 2071, 2685, 10, 1286, 93766, 3917, 47, 111240, 21334, 2053, 3501, 17368, 15824, 7, 502, 4867, 51383, 26939, 75033, 21828, 90345, 418, 46549, 23186, 304, 175212, 36321, 122799, 20697, 38730, 13452, 4989, 79315, 65964, 124850, 31089, 13538, 400...	[ 0.048980712890625, 0.037567138671875, 0.013671875, 0.12841796875, 0.25537109375, 0.1107177734375, 0.053558349609375, 0.255126953125, 0.1883544921875, 0.203125, 0.0748291015625, 0.1126708984375, 0.2451171875, 0.1263427734375, 0.1331787109375, 0.1844482421875, 0.1431884765625, 0.1573...	embed
40792454_c0	40792454	prolog	0	Title: How to rewrite a orolog predicate so that it can list all possible answers Problem title: How to rewrite a orolog predicate so that it can list all possible answers Tags: prolog Problem: How to rewrite a orolog predicate so that it can list all possible answers The predicate diff(A, B, C) , should be true when l...	How to rewrite a orolog predicate so that it can list all possible answers How to rewrite a orolog predicate so that it can list all possible answers prolog How in_list How to rewrite a orolog predicate so that it can list all possible answers The predicate diff(A, B, C) , should be true when list C consists of element...	[ -0.0137939453125, 0.0086669921875, 0.0230712890625, 0.009521484375, -0.01611328125, 0.006805419921875, -0.014404296875, 0.01544189453125, 0.01263427734375, -0.0130615234375, 0.000682830810546875, 0.01116943359375, 0.01275634765625, 0.017578125, 0.01287841796875, 0.00811767578125, 0.0...	[ 11249, 456, 434, 18781, 707, 14071, 1653, 2063, 67, 5303, 756, 7722, 35166, 221, 831, 502, 4867, 23, 6562, 71337, 284, 335, 313, 5608, 29568, 58055, 80854, 62, 18, 10617, 2967, 12765, 26785, 705, 116, 138, 201, 33579, 122101, 106, 37170...	[ 0.01324462890625, 0.1417236328125, 0.1448974609375, 0.230712890625, 0.150390625, 0.2342529296875, 0.186767578125, 0.218505859375, 0.10400390625, 0.1732177734375, 0.09930419921875, 0.1923828125, 0.1885986328125, 0.024658203125, 0.030731201171875, 0.111572265625, 0.189208984375, 0.07...	embed
13170401_c0	13170401	prolog	0	Title: Find all possible paths without revisiting Problem title: Find all possible paths without revisiting Tags: prolog Problem: Find all possible paths without revisiting I need a predicate routing which gives all the cities between start & end. For example: path(chicago,atlanta). path(chicago,milwaukee). path(milwau...	Find all possible paths without revisiting Find all possible paths without revisiting prolog Find FromCity ToCity Connections FromConnection ToConnection Find all possible paths without revisiting I need a predicate routing which gives all the cities between start & end. For example: I have tried this, and keep coming ...	[ -0.00897216796875, 0.0113525390625, 0.01019287109375, 0.00482177734375, -0.0086669921875, 0.01385498046875, -0.0196533203125, -0.000644683837890625, 0.0103759765625, -0.0654296875, -0.0003070831298828125, -0.0006866455078125, -0.0045166015625, 0.015869140625, -0.00154876708984375, 0.01...	[ 26040, 756, 7722, 60875, 7, 15490, 15226, 172, 1916, 502, 4867, 28090, 115411, 717, 62448, 17514, 235603, 1830, 87, 3871, 1653, 2063, 67, 22629, 76199, 70, 162708, 17721, 4034, 619, 3564, 27781, 765, 37842, 903, 13695, 38162, 4420, 47, 12...	[ 0.1558837890625, 0.121337890625, 0.17724609375, 0.1944580078125, 0.093017578125, 0.14111328125, 0.09393310546875, 0.08795166015625, 0.1414794921875, 0.12939453125, 0.175048828125, 0.122802734375, 0.08074951171875, 0.107177734375, 0.1190185546875, 0.044281005859375, 0.109375, 0.0426...	embed
75898250_c1	75898250	prolog	1	-Prolog comes with ABSOLUTELY NO WARRANTY. This is free software. Please run ?- license. for legal details. For online help and background, visit https://www.swi-prolog.org For built-in help, use ?- help(Topic). or ?- apropos(Word). ?- p_ohm(I, I1, 1, 6, V1, V2, R, 1, R2). ERROR: Arguments are not sufficiently instanti...	-Prolog comes with ABSOLUTELY NO WARRANTY. This is free software. Please run ?- license. for legal details. For online help and background, visit https://www.swi-prolog.org For built-in help, use ?- help(Topic). or ?- apropos(Word). ?- p_ohm(I, I1, 1, 6, V1, V2, R, 1, R2). ERROR: Arguments are not sufficiently instanti...	[ -0.0081787109375, 0.003387451171875, 0.00054168701171875, 0.0038299560546875, 0.00689697265625, 0.01165771484375, -0.0142822265625, -0.0037384033203125, 0.0303955078125, -0.01458740234375, 0.03271484375, -0.0015411376953125, -0.0223388671875, -0.008544921875, -0.007049560546875, -0.008...	[ 10752, 4867, 32497, 678, 9520, 60873, 30174, 27143, 4092, 10975, 30607, 11675, 86872, 8437, 1118, 4358, 76615, 2452, 3454, 1478, 88303, 4527, 77888, 1771, 189461, 164805, 915, 454, 10597, 87, 418, 106, 305, 310, 304, 627, 10461, 151206, 246...	[ 0.20263671875, 0.27392578125, 0.0999755859375, 0.0592041015625, 0.049835205078125, 0.07525634765625, 0.11669921875, 0.1138916015625, 0.0379638671875, 0.13623046875, 0.006927490234375, 0.06683349609375, 0.05316162109375, 0.030853271484375, 0.014068603515625, 0.1004638671875, 0.0662841...	embed
47729432_c0	47729432	prolog	0	Title: Modifing text in pl file with swi-prolog Problem title: Modifing text in pl file with swi-prolog Tags: prolog Problem: Modifing text in pl file with swi-prolog I have the following file in prolog, 1111000011110000.pl : :- multifile firstname/1. :- multifile surname/1. :- multifile cardNumber/1. :- multifile code...	Modifing text in pl file with swi-prolog Modifing text in pl file with swi-prolog prolog Modifing Martin Andersson Modifing text in pl file with swi-prolog I have the following file in prolog, 1111000011110000.pl : I want to create a predicate that takes an integer-input (for instance 0) and modifies the 11110000111100...	[ 0.0162353515625, 0.0135498046875, -0.0015869140625, -0.010986328125, 0.0018768310546875, 0.0072021484375, 0.0003261566162109375, 0.0177001953125, 0.0155029296875, -0.0101318359375, -0.00118255615234375, 0.0164794921875, -0.0164794921875, -0.0240478515625, 0.041259765625, -0.00143432617...	[ 117712, 420, 7986, 23, 6456, 11435, 678, 91, 2452, 3454, 4867, 502, 6470, 141227, 25632, 36682, 191281, 159019, 28568, 2424, 3444, 28282, 1653, 2063, 67, 51776, 892, 1505, 73, 7077, 757, 73197, 221, 10750, 40197, 19714, 83, 98816, 47, 173...	[ 0.1500244140625, 0.1368408203125, 0.1868896484375, 0.045013427734375, 0.1978759765625, 0.1468505859375, 0.02764892578125, 0.0291290283203125, 0.1888427734375, 0.1524658203125, 0.2042236328125, 0.1591796875, 0.1416015625, 0.2152099609375, 0.0268402099609375, 0.1324462890625, 0.0900878...	embed
1817010_c0	1817010	prolog	0	Title: Embedded Prolog Interpreter/Compiler for Java Problem title: Embedded Prolog Interpreter/Compiler for Java Tags: prolog, constraint-programming, embedded-language, java, logic-programming Problem: Embedded Prolog Interpreter/Compiler for Java I'm working on an application in Java, that needs to do some complex l...	Embedded Prolog Interpreter/Compiler for Java Embedded Prolog Interpreter/Compiler for Java prolog constraint-programming embedded-language java logic-programming Embedded Prolog Interpreter Compiler Java Embedded Prolog Interpreter/Compiler for Java I'm working on an application in Java, that needs to do some complex ...	[ 0.0267333984375, -0.001861572265625, 0.0181884765625, 0.018798828125, -0.0027618408203125, 0.0208740234375, -0.017333984375, 0.000759124755859375, 0, -0.03466796875, -0.002288818359375, -0.0002841949462890625, -0.02392578125, 0.005340576171875, 0.0101318359375, -0.0052490234375, 0.00...	[ 2775, 372, 69819, 1250, 4867, 5337, 56359, 56, 64, 108161, 34759, 100, 41925, 502, 158, 2816, 4288, 28966, 55720, 196651, 79, 330, 62775, 15612, 20697, 38415, 23, 27140, 79986, 8, 77391, 123309, 1884, 18151, 759, 56037, 46876, 64457, 18822,...	[ 0.094482421875, 0.2149658203125, 0.09112548828125, 0.1650390625, 0.235107421875, 0.0797119140625, 0.174560546875, 0.05615234375, 0.013885498046875, 0.10235595703125, 0.15234375, 0.07611083984375, 0.2352294921875, 0.1171875, 0.03173828125, 0.154541015625, 0.0797119140625, 0.10461425...	embed
64292196_c0	64292196	prolog	0	Title: How to set executable path for a package on a configuration file on Emacs? Problem title: How to set executable path for a package on a configuration file on Emacs? Tags: prolog, emacs Problem: How to set executable path for a package on a configuration file on Emacs? I want to use "ediprolog" package on Emacs. ...	How to set executable path for a package on a configuration file on Emacs? How to set executable path for a package on a configuration file on Emacs? prolog emacs How Emacs You Custom How to set executable path for a package on a configuration file on Emacs? I want to use "ediprolog" package on Emacs. I followed instal...	[ 0.027587890625, -0.016845703125, -0.0113525390625, -0.0093994140625, -0.015869140625, 0.0264892578125, -0.006866455078125, 0.02197265625, -0.00010919570922851562, 0.01611328125, 0.008544921875, 0.0218505859375, -0.0306396484375, -0.00074005126953125, 0.00921630859375, -0.00367736816406...	[ 11249, 5423, 71924, 2886, 60875, 100, 98169, 98, 180346, 11435, 85269, 4439, 47, 502, 4867, 352, 2263, 7, 130664, 3444, 4527, 14660, 3454, 59720, 127689, 188336, 35273, 67919, 257, 37842, 313, 9, 1542, 178036, 51588, 123849, 42, 14071, 1276...	[ 0.0872802734375, 0.183837890625, 0.2261962890625, 0.166259765625, 0.266845703125, 0.08941650390625, 0.2420654296875, 0.08160400390625, 0.214599609375, 0.141357421875, 0.1781005859375, 0.18701171875, 0.001800537109375, 0.2012939453125, 0.2427978515625, 0.10064697265625, 0.10888671875,...	embed
68731776_c0	68731776	prolog	0	Title: How to fix this permutation sort? Problem title: How to fix this permutation sort? Tags: failure-slice, prolog, termination, duplicates, sorting Problem: How to fix this permutation sort? The following Prolog program defines a predicate sorted/2 for sorting by permutation (permutation sort) in ascending order a ...	How to fix this permutation sort? How to fix this permutation sort? failure-slice prolog termination duplicates sorting How Time How to fix this permutation sort? The following Prolog program defines a predicate sorted/2 for sorting by permutation (permutation sort) in ascending order a list passed in first argument, w...	[ -0.01043701171875, 0.01470947265625, 0.031982421875, -0.0166015625, -0.0230712890625, -0.011474609375, -0.02001953125, -0.0177001953125, 0.00872802734375, -0.0184326171875, 0.0157470703125, 0.025390625, 0.000453948974609375, -0.01025390625, 0.0037384033203125, 0.00128936767578125, -0...	[ 11249, 47, 30022, 903, 117, 561, 22062, 12096, 137578, 13348, 502, 4867, 29527, 171763, 1636, 19055, 25632, 1250, 1528, 61924, 1653, 2063, 67, 17497, 71, 12477, 214, 390, 1264, 82800, 12989, 5303, 115081, 5117, 10750, 50339, 17932, 86869, 3...	[ 0.0789794921875, 0.03997802734375, 0.1890869140625, 0.1298828125, 0.123779296875, 0.178955078125, 0.122802734375, 0.24462890625, 0.2086181640625, 0.1444091796875, 0.1422119140625, 0.25634765625, 0.13232421875, 0.199951171875, 0.04229736328125, 0.0927734375, 0.022186279296875, 0.175...	embed
43015558_c0	43015558	prolog	0	Title: Checking whether the tree is avl-tree in prolog. error Problem title: Checking whether the tree is avl-tree in prolog. error Tags: avl-tree, prolog, instantiation-error Problem: Checking whether the tree is avl-tree in prolog. error My programm is not working correct. When I try to test it I have an error. My ex...	Checking whether the tree is avl-tree in prolog. error Checking whether the tree is avl-tree in prolog. error avl-tree prolog instantiation-error Checking if_avl_tree is_binTree ERROR Arguments _6218 lab06tomashchuk.pl:50 Note Re-run Checking whether the tree is avl-tree in prolog. error My programm is not working corr...	[ 0.006378173828125, -0.0074462890625, -0.004241943359375, 0.005615234375, 0.010009765625, 0.001800537109375, -0.005828857421875, 0.00860595703125, -0.00653076171875, -0.029296875, 0.0120849609375, -0.0113525390625, 0.0086669921875, 0.006103515625, 0.0247802734375, -0.00714111328125, 0...	[ 38679, 214, 36766, 53201, 83, 185, 141, 9, 62600, 23, 502, 4867, 18499, 34648, 14, 188800, 2174, 11, 50132, 7568, 62731, 13, 151206, 112140, 10837, 1819, 60054, 9016, 23837, 18622, 853, 16428, 28966, 959, 20697, 26785, 9790, 3034, 27781, ...	[ 0.14794921875, 0.002410888671875, 0.0909423828125, 0.2327880859375, 0.0699462890625, 0.183837890625, 0.1922607421875, 0.07391357421875, 0.260498046875, 0.05877685546875, 0.156005859375, 0.228515625, 0.1485595703125, 0.0635986328125, 0.05499267578125, 0.1458740234375, 0.05416870117187...	embed
45407061_c1	45407061	prolog	1	The Knowledge Base used for grading will be different. here example and I only have problem with the last example % Knowledge Base male(adam). male(bob). male(brett). male(charles). male(chris). male(clay). female(ava). female(barbara). female(betty). female(colette). female(carrie). parent(adam,bob). parent(adam,barb...	The Knowledge Base used for grading will be different. here example and I only have problem with the last example % Knowledge Base male(adam). male(bob). male(brett). male(charles). male(chris). male(clay). female(ava). female(barbara). female(betty). female(colette). female(carrie). parent(adam,bob). parent(adam,barb...	[ 0.036376953125, 0.0098876953125, 0.0115966796875, 0.000553131103515625, -0.006622314453125, 0.01007080078125, -0.01251220703125, 0.00390625, -0.01214599609375, -0.008544921875, 0.022216796875, -0.0244140625, -0.0025177001953125, 0.0206298828125, -0.0103759765625, -0.006683349609375, ...	[ 581, 191428, 44978, 11814, 100, 6671, 214, 1221, 186, 12921, 5, 3688, 27781, 87, 4734, 765, 2967, 4568, 1745, 11280, 132, 91701, 837, 275, 189817, 9254, 1577, 206, 3679, 18347, 117776, 5528, 1299, 18064, 4626, 939, 587, 36711, 3284, 5056,...	[ 0.08544921875, 0.28564453125, 0.27001953125, 0.150390625, 0.0443115234375, 0.28173828125, 0.1842041015625, 0.124267578125, 0.111083984375, 0.22607421875, 0.00555419921875, 0.0855712890625, 0.2244873046875, 0.02996826171875, 0.08819580078125, 0.0867919921875, 0.181884765625, 0.11621...	embed
12549737_c0	12549737	prolog	0	Title: Prolog Binary Addition Issue? Problem title: Prolog Binary Addition Issue? Tags: prolog, binary Problem: Prolog Binary Addition Issue? I have this piece of homework that I have to write in Prolog.The requirement is to write a piece of code that does binary addition such as: ?- add([1,0,1],[1,1],X). X = [0,0,0,1]...	Prolog Binary Addition Issue? Prolog Binary Addition Issue? prolog binary Prolog Binary Addition Issue _G7100 Prolog Binary Addition Issue? I have this piece of homework that I have to write in Prolog.The requirement is to write a piece of code that does binary addition such as: And so, this is the code that I came up ...	[ 0.01153564453125, 0.0048828125, 0.01904296875, -0.00238037109375, -0.03173828125, 0.01611328125, -0.01708984375, -0.0035858154296875, 0.0211181640625, -0.00518798828125, 0.02490234375, -0.0224609375, -0.01708984375, 0.00970458984375, 0.0234375, -0.00799560546875, 0.040771484375, -0...	[ 1250, 4867, 54092, 1294, 29117, 14, 1363, 223317, 32, 502, 2394, 6635, 3559, 5368, 18244, 33022, 64209, 674, 63847, 18151, 14602, 66044, 903, 1257, 37202, 54, 44841, 114453, 37348, 831, 959, 28219, 5809, 17997, 16940, 44691, 9525, 146104, 1...	[ 0.169677734375, 0.220458984375, 0.213623046875, 0.1514892578125, 0.158935546875, 0.16064453125, 0.04058837890625, 0.206298828125, 0.0059814453125, 0.13232421875, 0.183837890625, 0.174072265625, 0.1409912109375, 0.03704833984375, 0.119384765625, 0.06207275390625, 0.0892333984375, 0....	embed
50900052_c0	50900052	prolog	0	Title: Using aleph with SWI-prolog: source_sink `library(aleph)' does not exist Problem title: Using aleph with SWI-prolog: source_sink `library(aleph)' does not exist Tags: aleph-ilp, package-management, swi-prolog, prolog, package Problem: Using aleph with SWI-prolog: source_sink `library(aleph)' does not e...	Using aleph with SWI-prolog: source_sink `library(aleph)' does not exist Using aleph with SWI-prolog: source_sink `library(aleph)' does not exist aleph-ilp package-management swi-prolog prolog package Using SWI-prolog source_sink aleph.pl use_module ERROR pl:1 Warning Goal user:use_module pl:2 Undefined user:...	[ 0.005645751953125, 0.00787353515625, 0.004150390625, 0.03564453125, -0.01953125, 0.01141357421875, 0.0220947265625, 0.0201416015625, -0.021484375, -0.0556640625, 0.008544921875, -0.017822265625, -0.006744384765625, -0.006500244140625, 0.0211181640625, -0.0189208984375, -0.00267028808...	[ 345, 662, 11727, 678, 159, 38969, 3454, 4867, 31344, 7, 14068, 150, 2844, 1294, 1935, 3768, 14602, 959, 32316, 379, 254, 98169, 87140, 2452, 502, 2424, 4527, 83279, 151206, 24638, 6456, 5550, 592, 2016, 289, 38937, 4032, 79912, 5983, 9133...	[ 0.0275115966796875, 0.134033203125, 0.250732421875, 0.0430908203125, 0.04248046875, 0.2061767578125, 0.1400146484375, 0.197998046875, 0.2423095703125, 0.115234375, 0.2130126953125, 0.138671875, 0.23486328125, 0.1490478515625, 0.1348876953125, 0.166259765625, 0.043304443359375, 0.11...	embed
46947830_c0	46947830	prolog	0	Title: All possible knight positions in n moves - infinite loop in prolog Problem title: All possible knight positions in n moves - infinite loop in prolog Tags: prolog, failure-slice, infinite-loop, knights-tour Problem: All possible knight positions in n moves - infinite loop in prolog I have a problem with backtrack...	All possible knight positions in n moves - infinite loop in prolog All possible knight positions in n moves - infinite loop in prolog prolog failure-slice infinite-loop knights-tour All knight_move predict_moves All possible knight positions in n moves - infinite loop in prolog I have a problem with backtracking in Pro...	[ 0.0130615234375, 0.0025787353515625, 0.0123291015625, 0.0022735595703125, 0.005523681640625, -0.0125732421875, -0.000308990478515625, 0.0277099609375, 0.006256103515625, -0.050048828125, 0.00811767578125, 0.005126953125, -0.0012054443359375, 0.0125732421875, 0.005950927734375, 0.006927...	[ 3164, 7722, 472, 54350, 19069, 653, 25813, 54241, 13, 40956, 502, 4867, 137578, 13348, 28354, 28889, 432, 272, 92054, 3132, 2967, 4420, 125728, 214, 23, 1250, 74481, 29806, 756, 141956, 24763, 60875, 28412, 5117, 50339, 8306, 121011, 16487, ...	[ 0.0960693359375, 0.190673828125, 0.0738525390625, 0.2137451171875, 0.1953125, 0.0975341796875, 0.186767578125, 0.11572265625, 0.05096435546875, 0.177978515625, 0.147216796875, 0.2191162109375, 0.1611328125, 0.082763671875, 0.1112060546875, 0.14208984375, 0.1094970703125, 0.08557128...	embed
4964782_c0	4964782	prolog	0	Title: Why "..." appears in my answer of matrix in Prolog Problem title: Why "..." appears in my answer of matrix in Prolog Tags: prolog-toplevel, matrix, prolog, coordinates Problem: Why "..." appears in my answer of matrix in Prolog I made a little code for creating a matrix of coordinates (like a...	Why "..." appears in my answer of matrix in Prolog Why "..." appears in my answer of matrix in Prolog prolog-toplevel matrix prolog coordinates Why Prolog M-1 N-1 Why "..." appears in my answer of matrix in Prolog I made a little code for creating a matrix of coordinates (like a chessboard), it's th...	[ 0.03076171875, 0.005035400390625, 0.0152587890625, 0.00543212890625, 0.00689697265625, -0.0155029296875, 0.02490234375, 0.025634765625, 0.01025390625, 0.000141143798828125, -0.0111083984375, 0.004791259765625, -0.00007724761962890625, -0.025390625, -0.006103515625, -0.00098419189453125...	[ 44084, 41502, 27, 1230, 135179, 35166, 111, 50944, 425, 1250, 4867, 502, 13784, 67919, 176866, 276, 5759, 541, 7673, 23, 10176, 18151, 105233, 290, 24351, 71924, 5299, 158661, 158208, 15464, 3564, 9842, 108975, 1632, 91403, 9588, 29786, 15400...	[ 0.1390380859375, 0.123291015625, 0.1065673828125, 0.00634765625, 0.143310546875, 0.1700439453125, 0.0487060546875, 0.1734619140625, 0.1116943359375, 0.1484375, 0.220703125, 0.09600830078125, 0.02783203125, 0.079833984375, 0.2052001953125, 0.063720703125, 0.1195068359375, 0.05349731...	embed
67607539_c0	67607539	prolog	0	Title: Unexpected error when am trying to print a simple number in prolog Problem title: Unexpected error when am trying to print a simple number in prolog Tags: prolog Problem: Unexpected error when am trying to print a simple number in prolog Am working on an exercise which I have to make some things. There am creati...	Unexpected error when am trying to print a simple number in prolog Unexpected error when am trying to print a simple number in prolog prolog Unexpected pow3 Program Unexpected error when am trying to print a simple number in prolog Am working on an exercise which I have to make some things. There am creating a " Functi...	[ 0.0067138671875, -0.01312255859375, 0.007537841796875, 0.000579833984375, 0.02294921875, 0.0005645751953125, -0.0213623046875, 0.003875732421875, 0.01080322265625, -0.044189453125, -0.025634765625, -0.04296875, 0.0015106201171875, 0.0133056640625, 0.03857421875, 0.002197265625, -0.00...	[ 83613, 13, 18499, 31577, 28412, 8781, 14012, 502, 4867, 23, 23827, 363, 7663, 20697, 81979, 3249, 105233, 28670, 10763, 74481, 54753, 238, 501, 105416, 2174, 60899, 117396, 201939, 101935, 137175, 8110, 30646, 31089, 3034, 9969, 34759, 127877, ...	[ 0.06976318359375, 0.059783935546875, 0.19775390625, 0.130859375, 0.18896484375, 0.1785888671875, 0.1824951171875, 0.1595458984375, 0.224853515625, 0.030548095703125, 0.1993408203125, 0.1500244140625, 0.1109619140625, 0.0732421875, 0.0743408203125, 0.01373291015625, 0.069091796875, ...	embed
1831488_c0	1831488	prolog	0	Title: integer division operator in Prolog Problem title: integer division operator in Prolog Tags: prolog, clpfd, sicstus-prolog Problem: integer division operator in Prolog This code is a part of the program that I am writing to solve a cryptarithmatic puzzle in prolog. I am solving this using CLPFD (SICStus Prolog)....	integer division operator in Prolog integer division operator in Prolog prolog clpfd sicstus-prolog Prolog solve1 clpfd_expression integer_div N-N1 integer division operator in Prolog This code is a part of the program that I am writing to solve a cryptarithmatic puzzle in prolog. I am solving this using CLPFD (SICStus...	[ -0.0169677734375, -0.002044677734375, -0.0021209716796875, -0.007080078125, 0.0059814453125, -0.00537109375, -0.01416015625, -0.01043701171875, 0.004150390625, -0.0274658203125, -0.0032806396484375, 0.002960205078125, 0.0048828125, 0.00750732421875, 0.0174560546875, -0.018798828125, ...	[ 892, 1505, 91853, 39933, 23, 1250, 4867, 502, 33139, 39557, 71, 26536, 18253, 3454, 86869, 418, 204629, 30618, 541, 9, 839, 18151, 1528, 32562, 136791, 8962, 104192, 3115, 46323, 41265, 397, 294, 102198, 2143, 18499, 17368, 978, 24908, 2076...	[ 0.125732421875, 0.1153564453125, 0.233154296875, 0.2283935546875, 0.04052734375, 0.159423828125, 0.2327880859375, 0.10626220703125, 0.073486328125, 0.12451171875, 0.1500244140625, 0.046051025390625, 0.2125244140625, 0.11083984375, 0.11669921875, 0.07135009765625, 0.177490234375, 0....	embed
28280906_c0	28280906	prolog	0	Title: Printing out only one result in batch mode with Prolog Problem title: Printing out only one result in batch mode with Prolog Tags: prolog Problem: Printing out only one result in batch mode with Prolog In Prolog, I can bring up the REPL to test Prolog code interactively (interactive mode), and I also can write d...	Printing out only one result in batch mode with Prolog Printing out only one result in batch mode with Prolog prolog Printing Prolog chop_suey chow_mein sweet_and_sour Printing out only one result in batch mode with Prolog In Prolog, I can bring up the REPL to test Prolog code interactively (interactive mode), and I al...	[ 0.01434326171875, 0.01007080078125, 0.01611328125, 0.0062255859375, -0.0108642578125, 0.00250244140625, 0.01019287109375, 0.0074462890625, 0.002227783203125, -0.0284423828125, -0.0174560546875, -0.00421142578125, -0.0184326171875, -0.01531982421875, 0.025634765625, 0.01116943359375, ...	[ 39754, 1810, 4734, 1632, 16750, 1777, 206, 13736, 1250, 4867, 502, 82335, 1159, 7460, 50335, 282, 73, 53673, 2940, 34639, 678, 831, 9069, 21130, 3034, 18151, 212398, 10433, 33022, 11435, 71924, 75101, 2848, 4527, 5423, 4390, 32354, 2046, 75...	[ 0.193359375, 0.13232421875, 0.122314453125, 0.1361083984375, 0.22802734375, 0.163818359375, 0.1004638671875, 0.1357421875, 0.162841796875, 0.23583984375, 0.1070556640625, 0.097900390625, 0.0394287109375, 0.0980224609375, 0.07147216796875, 0.05621337890625, 0.078369140625, 0.1107177...	embed
63928475_c1	63928475	prolog	1	). min_subset_value([P1\|RestP],Min) :- RestP \= [], min_subset_value(RestP, OtherMin), subset_value(P1,A1) , mini(A1, OtherMin, Min). % divide_to_players(+,+,-) : Generate a division of all the Elements to N subsets divide_to_players([],N,EmptySets):- N>=1, generate_empty_sets(EmptySets,N). divide_to_players(Elements, ...	). min_subset_value([P1\|RestP],Min) :- RestP \= [], min_subset_value(RestP, OtherMin), subset_value(P1,A1) , mini(A1, OtherMin, Min). % divide_to_players(+,+,-) : Generate a division of all the Elements to N subsets divide_to_players([],N,EmptySets):- N>=1, generate_empty_sets(EmptySets,N). divide_to_players(Elements, ...	[ -0.005828857421875, 0.00323486328125, 0.0299072265625, 0.01708984375, -0.008544921875, 0.0042724609375, 0.00933837890625, -0.00775146484375, 0.03662109375, -0.0167236328125, 0.0078125, 0.0361328125, -0.000736236572265625, -0.01287841796875, -0.00145721435546875, -0.00775146484375, 0....	[ 194, 881, 22144, 3509, 27494, 683, 418, 58745, 1052, 525, 59076, 15772, 49756, 64511, 1614, 17727, 7665, 284, 4211, 1745, 101637, 188, 139570, 1328, 152, 155370, 67, 91853, 756, 48325, 47, 541, 839, 134332, 939, 294, 7831, 2740, 33000, 13...	[ 0.1090087890625, 0.2047119140625, 0.200439453125, 0.2125244140625, 0.176025390625, 0.189697265625, 0.0908203125, 0.000457763671875, 0.043792724609375, 0.1053466796875, 0.232177734375, 0.026031494140625, 0.1951904296875, 0.05865478515625, 0.1787109375, 0.02874755859375, 0.18798828125,...	embed
43634848_c0	43634848	prolog	0	Title: Accessing the literal value of the object of a triple Problem title: Accessing the literal value of the object of a triple Tags: turtle-rdf, swi-prolog, prolog, cliopatria Problem: Accessing the literal value of the object of a triple I'm working on a validator that validates turtle files. When working on a func...	Accessing the literal value of the object of a triple Accessing the literal value of the object of a triple turtle-rdf swi-prolog prolog cliopatria Accessing Card xsd:nonNegativeInteger www.w3.org XMLSchema rdf_canonical_literal LiteralL rdf_compare xsd:integer Accessing the literal value of the object of a triple I'm ...	[ -0.003814697265625, -0.0147705078125, 0.00531005859375, 0.004150390625, -0.0022735595703125, -0.0289306640625, -0.006622314453125, -0.017333984375, 0.00421142578125, -0.0225830078125, 0.0123291015625, 0.03955078125, 0.0032806396484375, -0.0260009765625, 0.002838134765625, 0.00448608398...	[ 40266, 214, 15659, 289, 34292, 36746, 162738, 2130, 17991, 4216, 420, 2452, 3454, 4867, 502, 95701, 95543, 11, 23660, 1022, 71, 6431, 6433, 208, 4935, 67, 1505, 363, 92537, 25452, 11883, 38938, 39798, 135940, 141, 866, 277, 16082, 6191, 2...	[ 0.1846923828125, 0.004425048828125, 0.215576171875, 0.205078125, 0.2269287109375, 0.193359375, 0.2509765625, 0.1329345703125, 0.179931640625, 0.03387451171875, 0.0958251953125, 0.1419677734375, 0.059417724609375, 0.147705078125, 0.041259765625, 0.01129150390625, 0.1234130859375, 0....	embed
19251872_c0	19251872	prolog	0	Title: How do you specify facts in prolog files? Problem title: How do you specify facts in prolog files? Tags: prolog Problem: How do you specify facts in prolog files? I have a few facts stored in a file test.pl. memory(0, 0, 0). memory(0, 1, 0). memory(0, 2, 0). Now in the same directory, I start gprolog and load th...	How do you specify facts in prolog files? How do you specify facts in prolog files? prolog How test.pl Action RET user:1 test.pl:1 How do you specify facts in prolog files? I have a few facts stored in a file test.pl. Now in the same directory, I start gprolog and load the file. But it will treat the loaded facts stran...	[ 0.02490234375, -0.0031280517578125, 0.01031494140625, 0.01025390625, 0.0013580322265625, 0.00750732421875, 0.00823974609375, 0.006988525390625, -0.00109100341796875, -0.04541015625, -0.004669189453125, 0.0247802734375, -0.040771484375, -0.0091552734375, 0.0079345703125, 0.0089721679687...	[ 11249, 40140, 18929, 15824, 7, 502, 4867, 102158, 3034, 2424, 57945, 41116, 38937, 19721, 23, 4343, 11435, 14364, 706, 3454, 72367, 85689, 114453, 41, 1294, 1884, 31577, 5303, 51, 41274, 110, 77336, 40383, 678, 65918, 3714, 80934, 214, 4324...	[ 0.0290374755859375, 0.2117919921875, 0.15869140625, 0.2159423828125, 0.1265869140625, 0.16455078125, 0.227294921875, 0.1590576171875, 0.201416015625, 0.142333984375, 0.1002197265625, 0.167724609375, 0.1142578125, 0.027191162109375, 0.03228759765625, 0.010162353515625, 0.1304931640625...	embed
37171303_c1	37171303	prolog	1	R ([], 0). % r ight-leaning list_sizR([_\|Es], 1+N) :- list_sizR(Es,N). built-in (is)/2 vs val_of/2 val_of(V, E) :- ( E = E1+E2 -> val_of(V1, E1), val_of(V2, E2), V is V1+V2 ; number(E) -> V = E ). To measure runtimes I ran go(2000000) using different Prolog processors 2 : go(L) :- length(Xs, L), member(B_2, [list_sizL...	R ([], 0). % r ight-leaning list_sizR([_\|Es], 1+N) :- list_sizR(Es,N). built-in (is)/2 vs val_of/2 val_of(V, E) :- ( E = E1+E2 -> val_of(V1, E1), val_of(V2, E2), V is V1+V2 ; number(E) -> V = E ). To measure runtimes I ran go(2000000) using different Prolog processors 2 : go(L) :- length(Xs, L), member(B_2, [list_sizL...	[ -0.0057373046875, 0.0059814453125, 0.00537109375, -0.003326416015625, -0.002716064453125, -0.0033416748046875, -0.023193359375, -0.00555419921875, 0.0302734375, -0.017578125, 0.032470703125, 0.020751953125, 0.004913330078125, -0.0155029296875, 0.01275634765625, -0.00311279296875, 0.0...	[ 627, 1065, 757, 1745, 1690, 22553, 34677, 5303, 4900, 1052, 16474, 1328, 839, 88303, 73, 164, 12477, 20209, 3502, 4390, 856, 241, 418, 304, 10461, 310, 14012, 647, 2203, 72350, 11675, 70141, 13028, 738, 54753, 197094, 12921, 1250, 4867, 1...	[ 0.1973876953125, 0.031219482421875, 0.0997314453125, 0.0615234375, 0.002197265625, 0.16552734375, 0.1685791015625, 0.207763671875, 0.1671142578125, 0.2017822265625, 0.116455078125, 0.1201171875, 0.06732177734375, 0.1505126953125, 0.1046142578125, 0.17333984375, 0.1888427734375, 0.1...	embed
33802844_c0	33802844	prolog	0	Title: How to make the output of this prolog program state "true"? Problem title: How to make the output of this prolog program state "true"? Tags: prolog, backtracking, list Problem: How to make the output of this prolog program state "true"? I have this example prolog program, which on output prin...	How to make the output of this prolog program state "true"? How to make the output of this prolog program state "true"? prolog backtracking list How N-1 How to make the output of this prolog program state "true"? I have this example prolog program, which on output prints a number of * corresponding ...	[ 0.01007080078125, 0.01092529296875, 0.00543212890625, -0.000762939453125, -0.015869140625, 0.0167236328125, 0.0086669921875, 0.018798828125, 0.0111083984375, 0.01025390625, 0.00921630859375, -0.01177978515625, -0.004547119140625, -0.001953125, 0.01275634765625, -0.01806640625, 0.0324...	[ 11249, 47, 3249, 140992, 903, 502, 4867, 1528, 11341, 9774, 13, 4420, 125728, 214, 5303, 541, 5759, 70, 111, 27781, 28412, 14012, 661, 42518, 13267, 80854, 41, 1294, 10006, 189126, 2357, 66211, 8337, 2704, 35166, 26785, 76199, 98320, 3229, ...	[ 0.0888671875, 0.0347900390625, 0.115478515625, 0.265869140625, 0.091552734375, 0.1943359375, 0.24560546875, 0.17724609375, 0.16845703125, 0.1982421875, 0.1285400390625, 0.1746826171875, 0.2415771484375, 0.0838623046875, 0.1627197265625, 0.07257080078125, 0.1324462890625, 0.02947998...	embed
34091160_c0	34091160	prolog	0	Title: I/O in prolog: Error: Arguments are not sufficiently instantiated, no further information Problem title: I/O in prolog: Error: Arguments are not sufficiently instantiated, no further information Tags: prolog Problem: I/O in prolog: Error: Arguments are not sufficiently instantiated, no further information So I'm...	I/O in prolog: Error: Arguments are not sufficiently instantiated, no further information I/O in prolog: Error: Arguments are not sufficiently instantiated, no further information prolog Error Arguments I/O in prolog: Error: Arguments are not sufficiently instantiated, no further information So I'm working with I/O in ...	[ 0.0185546875, -0.00005245208740234375, -0.01409912109375, 0.0157470703125, -0.01263427734375, 0.01202392578125, 0.0115966796875, -0.005218505859375, -0.002685546875, -0.001678466796875, 0.029296875, -0.023193359375, -0.006072998046875, -0.00003337860107421875, 0.015380859375, -0.001144...	[ 87, 64, 670, 23, 502, 4867, 212059, 112140, 7, 959, 129980, 34648, 14, 27686, 110, 53333, 4677, 20697, 104192, 15400, 20949, 2499, 1653, 2063, 216806, 31089, 29569, 339, 304, 29822, 866, 5442, 2424, 5701, 18499, 1528, 5608, 54, 83, 134598...	[ 0.0535888671875, 0.2364501953125, 0.1656494140625, 0.06341552734375, 0.1820068359375, 0.2381591796875, 0.15869140625, 0.26708984375, 0.0546875, 0.10211181640625, 0.18798828125, 0.1514892578125, 0.1473388671875, 0.0633544921875, 0.0697021484375, 0.126708984375, 0.1849365234375, 0.04...	embed
33599781_c1	33599781	prolog	1	%We can't pour into the medium if medium is full Diff is min(5 - M, L), Diff > 0, NewLarge is L - Diff, %calculate the new Large NewMedium is M + Diff. %calculate the new Medium % move rule #2: Pour Large into Small (L--> S) move([L, M, S], [NewLarge,M,NewSmall]) :- L > 0, %We can't pour from large if Large is empty S...	%We can't pour into the medium if medium is full Diff is min(5 - M, L), Diff > 0, NewLarge is L - Diff, %calculate the new Large NewMedium is M + Diff. %calculate the new Medium % move rule #2: Pour Large into Small (L--> S) move([L, M, S], [NewLarge,M,NewSmall]) :- L > 0, %We can't pour from large if Large is empty S...	[ -0.010009765625, 0.0167236328125, 0.00872802734375, 0.031982421875, -0.005279541015625, 0.0004596710205078125, -0.042724609375, 0.0201416015625, 0.0159912109375, 0.03076171875, 0.01007080078125, 0.000522613525390625, 0.021484375, -0.004150390625, 0.0003185272216796875, -0.0075988769531...	[ 1745, 12137, 831, 18, 578, 3934, 70, 57646, 2174, 83, 4393, 191144, 881, 104116, 20, 276, 339, 247, 757, 2356, 2729, 27616, 6827, 16735, 3525, 181268, 6696, 28483, 997, 174413, 25813, 79986, 64947, 5547, 105508, 152745, 159, 46568, 594, 6...	[ 0.1595458984375, 0.0816650390625, 0.1124267578125, 0.10479736328125, 0.2509765625, 0.2054443359375, 0.00616455078125, 0.299072265625, 0.07415771484375, 0.0345458984375, 0.1669921875, 0.2491455078125, 0.195556640625, 0.0919189453125, 0.0419921875, 0.10089111328125, 0.1044921875, 0.0...	embed
71834093_c0	71834093	prolog	0	Title: List all combinations of a list prolog Problem title: List all combinations of a list prolog Tags: prolog Problem: List all combinations of a list prolog I want to write in Prolog a predicate that display all the combinations of a list of N elements with exactly M "black elements" ( b for black and w for white)....	List all combinations of a list prolog List all combinations of a list prolog prolog List NN1 Nn-1 N-1 Call _2900 _4108 Exit _5624 _4100 _7904 _9420 _7896 _11700 _11692 Redo _19114 _19106 _21394 List all combinations of a list prolog I want to write in Prolog a predicate that display all the combinations of a list of N...	[ -0.0272216796875, 0.016357421875, 0.017822265625, -0.00244140625, -0.000492095947265625, 0.0205078125, -0.009033203125, 0.0031890869140625, -0.00726318359375, 0.002532958984375, -0.0018157958984375, 0.00836181640625, 0.01318359375, 0.0101318359375, -0.00543212890625, 0.0164794921875, ...	[ 32036, 756, 162515, 7, 111, 5303, 502, 4867, 24455, 418, 541, 19, 5759, 26265, 20543, 617, 69139, 5443, 217, 13683, 2357, 3559, 123048, 14889, 1549, 153781, 15128, 12231, 6096, 31, 129150, 54100, 161787, 10, 3444, 33022, 1250, 1653, 2063, ...	[ 0.17041015625, 0.1451416015625, 0.2861328125, 0.1033935546875, 0.06646728515625, 0.2041015625, 0.1812744140625, 0.2091064453125, 0.16552734375, 0.069091796875, 0.123291015625, 0.032928466796875, 0.124755859375, 0.1240234375, 0.1114501953125, 0.0167388916015625, 0.124755859375, 0.06...	embed
33859548_c0	33859548	prolog	0	Title: Best way to update/add fact in the db? Problem title: Best way to update/add fact in the db? Tags: prolog, prolog-assert Problem: Best way to update/add fact in the db? Say I have facts like this : fact(abc,2). I want something like this (pseudo code) : fact_update(Functor,Name,AddToValue) :- if Fact_exist then ...	Best way to update/add fact in the db? Best way to update/add fact in the db? prolog prolog-assert Best fact_update Functor Name AddToValue Fact_exist update_fact NewVal CurrentValue create_new_fact fact_add Val Fact Amt NewAmt upd_fact Best way to update/add fact in the db? Say I have facts like this : I want somethin...	[ 0.01300048828125, 0.006591796875, 0.0260009765625, 0.000789642333984375, 0.0012359619140625, 0.00494384765625, -0.006561279296875, 0.0018157958984375, 0.0164794921875, -0.022216796875, 0.0213623046875, 0.01324462890625, -0.0089111328125, -0.01409912109375, 0.02490234375, -0.01843261718...	[ 11345, 3917, 47, 28350, 64, 11, 4028, 15824, 23, 40041, 502, 4867, 162, 33657, 117008, 28670, 18770, 15757, 29117, 7763, 856, 50770, 132640, 54376, 114700, 2356, 42272, 114063, 28282, 54936, 4769, 2022, 18, 23135, 1257, 71, 765, 1884, 903, ...	[ 0.1732177734375, 0.1473388671875, 0.09039306640625, 0.253173828125, 0.07470703125, 0.11083984375, 0.1988525390625, 0.274658203125, 0.127685546875, 0.2095947265625, 0.1068115234375, 0.1971435546875, 0.044097900390625, 0.18603515625, 0.2230224609375, 0.1143798828125, 0.1170654296875, ...	embed
52700063_c0	52700063	prolog	0	Title: Prolog - Simplifying rules or statements Problem title: Prolog - Simplifying rules or statements Tags: simplify, prolog Problem: Prolog - Simplifying rules or statements I've been looking at ways in which Prolog can automatically simplify statements. This is because I am planning to receive Prolog statements fro...	Prolog - Simplifying rules or statements Prolog - Simplifying rules or statements simplify prolog Prolog Simplifying Prolog - Simplifying rules or statements I've been looking at ways in which Prolog can automatically simplify statements. This is because I am planning to receive Prolog statements from an external sourc...	[ 0.047607421875, 0.0023956298828125, 0.00160980224609375, 0.01495361328125, -0.00469970703125, -0.00927734375, 0.008056640625, -0.0042724609375, 0.02197265625, -0.01318359375, -0.018798828125, -0.015380859375, -0.01361083984375, 0.00396728515625, 0.02099609375, 0.0037689208984375, 0.0...	[ 1250, 4867, 20, 55331, 141, 151138, 91736, 707, 63805, 112892, 18929, 502, 48322, 831, 191082, 58136, 53299, 173591, 31344, 23009, 75935, 28574, 53, 25129, 17514, 23, 140363, 125195, 1029, 34831, 5299, 149016, 54, 37076, 137399, 27781, 8781, ...	[ 0.19775390625, 0.275146484375, 0.00067138671875, 0.177001953125, 0.14990234375, 0.1649169921875, 0.187744140625, 0.0670166015625, 0.2315673828125, 0.225830078125, 0.16064453125, 0.1229248046875, 0.001953125, 0.037384033203125, 0.152099609375, 0.043609619140625, 0.0240478515625, 0.0...	embed
19745958_c0	19745958	prolog	0	Title: Prolog: square numbers in a list Problem title: Prolog: square numbers in a list Tags: recursion, prolog, list Problem: Prolog: square numbers in a list Ho do I square numbers in a list in prolog? The list can contain numbers, atoms and lists. for example: [a,b,2,3,4,[3],[c,d,9]] and the answer should be [a,b,4,...	Prolog: square numbers in a list Prolog: square numbers in a list recursion prolog list Prolog squared_members SqrdL SqrdLs Prolog: square numbers in a list Ho do I square numbers in a list in prolog? The list can contain numbers, atoms and lists. for example: [a,b,2,3,4,[3],[c,d,9]] and the answer should be [a,b,4,9,1...	[ -0.0001735687255859375, -0.003875732421875, 0.023681640625, 0.00145721435546875, -0.0068359375, 0.005859375, -0.0108642578125, 0.0034027099609375, 0.0035552978515625, 0.0068359375, 0.01153564453125, 0.01043701171875, -0.009521484375, 0.01251220703125, 0.004058837890625, -0.003738403320...	[ 1250, 4867, 108047, 101935, 23, 5303, 195625, 1830, 502, 71, 39, 27417, 864, 866, 2291, 54, 87, 6, 10, 831, 70541, 34627, 82449, 54968, 1126, 35166, 127915, 2485, 35299, 8770, 94727, 214, 142424, 617, 138, 201, 37842, 1193, 44978, 7225, ...	[ 0.1514892578125, 0.2362060546875, 0.28125, 0.244873046875, 0.114013671875, 0.27001953125, 0.1649169921875, 0.028533935546875, 0.160888671875, 0.1239013671875, 0.0372314453125, 0.1781005859375, 0.11669921875, 0.043243408203125, 0.1014404296875, 0.04083251953125, 0.039093017578125, 0...	embed
59341382_c1	59341382	prolog	1	I wanted to build the rules that allow you to say, e.g., 10 ore makes enough for 7 a: % handles the case where we have leftovers? % is this even the right way to model all this... when we have leftovers, we may % have to use them in the "reaction"... makes(In, Out) :- Out =.. [F,N], Val #>= N, OutN =.. [F,Val], makes(...	I wanted to build the rules that allow you to say, e.g., 10 ore makes enough for 7 a: % handles the case where we have leftovers? % is this even the right way to model all this... when we have leftovers, we may % have to use them in the "reaction"... makes(In, Out) :- Out =.. [F,N], Val #>= N, OutN =.. [F,Val], makes(...	[ -0.005767822265625, -0.00909423828125, 0.0194091796875, 0.0311279296875, -0.010498046875, 0.0155029296875, -0.003265380859375, -0.007568359375, 0.0272216796875, 0.003448486328125, -0.0145263671875, -0.0225830078125, 0.007781982421875, 0.00726318359375, 0.01055908203125, -0.02392578125,...	[ 36663, 45367, 91736, 63769, 5154, 209, 6517, 30482, 20174, 100, 361, 10, 1745, 34831, 7225, 765, 25737, 5465, 7, 7108, 3299, 4527, 107, 44713, 4153, 13538, 4769, 839, 42272, 43240, 106, 160370, 517, 14786, 2967, 179933, 126371, 831, 26458, ...	[ 0.00250244140625, 0.1348876953125, 0.1787109375, 0.046295166015625, 0.0187225341796875, 0.1343994140625, 0.2548828125, 0.1510009765625, 0.2264404296875, 0.057769775390625, 0.1197509765625, 0.1004638671875, 0.0491943359375, 0.048614501953125, 0.0262908935546875, 0.0491943359375, 0.114...	embed
78961334_c1	78961334	prolog	1	, when I uncomment the \+ member check, then when it goes to try to prove member((a,b), [(b,c)]) it will fail, continuing over \+ member and finding a suitable solution. However, if I trace. the execution with the \+ member call I get: [trace] ?- path(a,c,Steps). Call: (12) path(a, c, _46240) ? creep Call: (13) step(a,...	, when I uncomment the \+ member check, then when it goes to try to prove member((a,b), [(b,c)]) it will fail, continuing over \+ member and finding a suitable solution. However, if I trace. the execution with the \+ member call I get: [trace] ?- path(a,c,Steps). Call: (12) path(a, c, _46240) ? creep Call: (13) step(a,...	[ -0.00921630859375, 0.0040283203125, 0.0269775390625, 0.0213623046875, -0.0113525390625, 0.015625, 0.00787353515625, -0.00921630859375, 0.01068115234375, -0.042236328125, 0.010498046875, 0.0189208984375, -0.00762939453125, 0.0224609375, 0.00408935546875, -0.0281982421875, -0.019287109...	[ 3229, 87, 51, 277, 674, 41872, 1328, 32786, 12765, 60899, 9790, 47, 23534, 11, 275, 238, 1221, 35782, 19686, 645, 90791, 202319, 29806, 33306, 2174, 144851, 71924, 1830, 11782, 2046, 39989, 705, 60875, 191644, 26265, 23676, 501, 157255, 125...	[ 0.0290069580078125, 0.0258636474609375, 0.10107421875, 0.11181640625, 0.1435546875, 0.08880615234375, 0.2037353515625, 0.253173828125, 0.25830078125, 0.00103759765625, 0.1165771484375, 0.056671142578125, 0.204833984375, 0.01190185546875, 0.05340576171875, 0.066162109375, 0.0132141113...	embed
73532853_c0	73532853	prolog	0	Title: I want to add in ListAtL1 the elements of list that the count is 1 or 2 and in the ListAtL2 the elements of list that the count is 2 Problem title: I want to add in ListAtL1 the elements of list that the count is 1 or 2 and in the ListAtL2 the elements of list that the count is 2 Tags: prolog Problem: I want to ...	I want to add in ListAtL1 the elements of list that the count is 1 or 2 and in the ListAtL2 the elements of list that the count is 2 I want to add in ListAtL1 the elements of list that the count is 1 or 2 and in the ListAtL2 the elements of list that the count is 2 prolog ListAtL1 ListAtL2 find_in_list Element List Cou...	[ -0.001434326171875, -0.0028228759765625, -0.016357421875, -0.0086669921875, -0.0201416015625, 0.005523681640625, -0.0167236328125, 0.0128173828125, 0.016357421875, -0.0230712890625, 0.01336669921875, -0.01214599609375, 0.00921630859375, 0.0220947265625, 0.007232666015625, 0.02258300781...	[ 3444, 15190, 32036, 28848, 866, 418, 80854, 111, 5303, 54529, 106, 707, 116, 304, 23, 70, 136, 502, 4867, 7413, 73, 6562, 48325, 6, 108210, 13538, 65450, 154663, 18151, 16750, 4966, 5608, 44084, 903, 96276 ]	[ 0.04864501953125, 0.157470703125, 0.189208984375, 0.1065673828125, 0.1270751953125, 0.08251953125, 0.16845703125, 0.06494140625, 0.161865234375, 0.18359375, 0.09271240234375, 0.05419921875, 0.1693115234375, 0.1151123046875, 0.0335693359375, 0.006866455078125, 0.0194549560546875, 0....	embed
36805152_c0	36805152	prolog	0	Title: Inserting into a list of lists prolog Problem title: Inserting into a list of lists prolog Tags: prolog Problem: Inserting into a list of lists prolog I am working on a roster system project in prolog, and am using a modified search and insert structure based on an example provided by our professor. However, whe...	Inserting into a list of lists prolog Inserting into a list of lists prolog prolog Inserting read_student_info Inserting into a list of lists prolog I am working on a roster system project in prolog, and am using a modified search and insert structure based on an example provided by our professor. However, when I try t...	[ -0.006744384765625, 0.0031280517578125, 0.010009765625, 0.017333984375, -0.034423828125, 0.01324462890625, -0.0113525390625, -0.0224609375, -0.005615234375, -0.015625, 0.0218505859375, 0.0048828125, -0.0031585693359375, -0.01385498046875, -0.0036468505859375, 0.000621795654296875, 0....	[ 360, 2189, 1916, 3934, 5303, 111, 7, 502, 4867, 12301, 96610, 7319, 20697, 52470, 56, 5426, 13452, 73197, 33938, 136, 183540, 45646, 27781, 62952, 16030, 11675, 208124, 17164, 83, 8306, 2174, 110, 3789, 80854, 13379, 16031, 31089, 40956, 64...	[ 0.083251953125, 0.2059326171875, 0.0209503173828125, 0.1800537109375, 0.19384765625, 0.068115234375, 0.0465087890625, 0.125732421875, 0.2044677734375, 0.1685791015625, 0.1968994140625, 0.1522216796875, 0.0159454345703125, 0.1300048828125, 0.1253662109375, 0.0367431640625, 0.014022827...	embed
37304926_c0	37304926	prolog	0	Title: flatten in prolog - something like else Problem title: flatten in prolog - something like else Tags: prolog Problem: flatten in prolog - something like else Look at my implementation of flatten : Generally, it is working. Only problem is for my_flatten([], F) - it gives F=[]; F=[[]] instead of F=[] . my_flatten(...	flatten in prolog - something like else flatten in prolog - something like else prolog my_flatten Acc is_list flatten in prolog - something like else Look at my implementation of flatten : Generally, it is working. Only problem is for my_flatten([], F) - it gives F=[]; F=[[]] instead of F=[] . For my_flatten(X, [1,2,3]...	[ 0.0027618408203125, 0.01409912109375, 0.015625, -0.000919342041015625, -0.015380859375, 0.0146484375, 0.0166015625, 0.006500244140625, 0.019775390625, -0.0184326171875, 0.037841796875, 0.006744384765625, 0.0037689208984375, 0.003997802734375, 0.0234375, 0.01153564453125, 0.0055236816...	[ 49878, 510, 23, 502, 4867, 9844, 1884, 37076, 759, 150632, 29899, 83, 6562, 208124, 9082, 20697, 87293, 2967, 563, 76199, 1065, 64457, 1542, 155761, 1528, 40956, 7, 14315, 32316, 54241, 5941, 35166, 133063, 96386, 5608, 214, 1284, 378, 74, ...	[ 0.255859375, 0.2471923828125, 0.04693603515625, 0.14794921875, 0.2086181640625, 0.1026611328125, 0.184326171875, 0.1571044921875, 0.1142578125, 0.229248046875, 0.1390380859375, 0.04791259765625, 0.1912841796875, 0.1123046875, 0.040771484375, 0.0777587890625, 0.01055908203125, 0.104...	embed
60150536_c1	60150536	prolog	1	{[linked,L],[size,S]} & (ran(L,D) & Node_i in D) & Msg = ok & LinkedList_ = LinkedList. checkNodeError(LinkedList,Node_i,Msg_o,LinkedList_):- LinkedList = {[linked,L] / _} & (nran(L,D) & Node_i in D) & Msg = error & LinkedList_ = LinkedList. removePartialNode(LinkedList,Node_i,LinkedList_):- removePartialNodeOk(Linked...	{[linked,L],[size,S]} & (ran(L,D) & Node_i in D) & Msg = ok & LinkedList_ = LinkedList. checkNodeError(LinkedList,Node_i,Msg_o,LinkedList_):- LinkedList = {[linked,L] / _} & (nran(L,D) & Node_i in D) & Msg = error & LinkedList_ = LinkedList. removePartialNode(LinkedList,Node_i,LinkedList_):- removePartialNodeOk(Linked...	[ -0.0234375, -0.000820159912109375, -0.004180908203125, 0.0024261474609375, 0.0115966796875, 0.002716064453125, -0.0015716552734375, -0.0037689208984375, 0.010986328125, -0.0002498626708984375, 0.00885009765625, -0.0045166015625, 0.01171875, -0.0030364990234375, 0.0019378662109375, -0.0...	[ 10666, 10187, 297, 866, 268, 62539, 294, 8152, 619, 1603, 397, 16, 438, 454, 14, 23, 391, 70802, 177, 2203, 3664, 12779, 154663, 5, 12765, 5021, 112, 18468, 31611, 64287, 4, 7, 31, 2077, 248, 15, 18499, 87388, 58229, 15403, 9, 73852, ...	[ 0.0249481201171875, 0.19921875, 0.19384765625, 0.119873046875, 0.00579833984375, 0.128662109375, 0.09503173828125, 0.006103515625, 0.03448486328125, 0.138671875, 0.107177734375, 0.00592041015625, 0.1700439453125, 0.0469970703125, 0.0843505859375, 0.06390380859375, 0.14794921875, 0....	embed
35485185_c0	35485185	prolog	0	Title: Puzzle taken from Gardner Problem title: Puzzle taken from Gardner Tags: constraint-programming, prolog, clpfd Problem: Puzzle taken from Gardner I'm trying to solve the following puzzle in Prolog: Ten cells numbered 0,...,9 inscribe a 10-digit number such that each cell, say i, indicates the total number of occ...	Puzzle taken from Gardner Puzzle taken from Gardner constraint-programming prolog clpfd Gardner a Puzzle Count f.e Pos List I-1 ten_digit Nul Rest Digits Puzzle taken from Gardner I'm trying to solve the following puzzle in Prolog: This is what I wrote in Prolog but I'm stuck, I think there is something wrong with my t...	[ -0.00008726119995117188, -0.00604248046875, 0.001800537109375, 0.00994873046875, -0.012939453125, 0.0023345947265625, -0.03271484375, -0.004058837890625, 0.00201416015625, -0.048095703125, -0.01483154296875, 0.002410888671875, 0.005645751953125, 0.009033203125, 0.0034027099609375, -0.0...	[ 179277, 39958, 1295, 90968, 1679, 2816, 4288, 28966, 502, 4867, 33139, 39557, 71, 108210, 13498, 32036, 87, 5759, 1492, 4803, 541, 202, 49756, 51174, 933, 31577, 86869, 25632, 104192, 1250, 3293, 54397, 23, 179933, 5351, 44691, 454, 217, 16...	[ 0.2060546875, 0.06256103515625, 0.0902099609375, 0.1944580078125, 0.231201171875, 0.0892333984375, 0.0225372314453125, 0.036346435546875, 0.08538818359375, 0.191162109375, 0.000518798828125, 0.0477294921875, 0.055694580078125, 0.1424560546875, 0.131591796875, 0.09954833984375, 0.0475...	embed
41683508_c0	41683508	prolog	0	Title: Recursively defined function of two integers in Prolog (partition function) Problem title: Recursively defined function of two integers in Prolog (partition function) Tags: recursion, number-theory, prolog Problem: Recursively defined function of two integers in Prolog (partition function) I swear this isn't a h...	Recursively defined function of two integers in Prolog (partition function) Recursively defined function of two integers in Prolog (partition function) recursion number-theory prolog Recursively Prolog stackoverflow.com N-K Recursively defined function of two integers in Prolog (partition function) I swear this isn't a...	[ -0.01031494140625, 0.00130462646484375, 0.01123046875, -0.003387451171875, -0.003509521484375, -0.0120849609375, -0.0098876953125, -0.00897216796875, -0.00167083740234375, -0.00341796875, 0.0242919921875, -0.000396728515625, -0.0240478515625, 0.0068359375, 0.024169921875, -0.0044555664...	[ 853, 48650, 5844, 61924, 32354, 6626, 892, 26255, 1250, 4867, 15866, 1363, 195625, 1830, 14012, 2347, 502, 605, 52113, 18244, 2967, 38246, 29966, 61112, 23662, 54799, 99942, 26168, 2878, 17569, 9790, 33636, 2060, 5809, 2046, 705, 41600, 209, ...	[ 0.0772705078125, 0.211669921875, 0.1146240234375, 0.17626953125, 0.1849365234375, 0.1590576171875, 0.1474609375, 0.0872802734375, 0.1427001953125, 0.2437744140625, 0.1824951171875, 0.1263427734375, 0.226806640625, 0.060821533203125, 0.11669921875, 0.000213623046875, 0.1082763671875, ...	embed
33960346_c0	33960346	prolog	0	Title: Output \|... confuses me Problem title: Output \|... confuses me Tags: geometry, list, prolog Problem: Output \|... confuses me EDIT: What I need is a flag to denote when I am below the center. I am trying to get this shape , but I fail to fill the last level correctly! My latest code: :- use_module(library(clpfd))...	Output \|... confuses me Output \|... confuses me geometry list prolog Output use_module Dim Fill Below_center init_sublists init_zeroes NewFill edw1 Output \|... confuses me EDIT: What I need is a flag to denote when I am below the center. I am trying to get this shape , but I fail to fill the last level correctly! My la...	[ -0.004302978515625, 0.0172119140625, 0.0018310546875, -0.0020294189453125, -0.033447265625, 0.00897216796875, -0.0069580078125, 0.00927734375, 0.0091552734375, 0.0294189453125, 0.01007080078125, 0.00677490234375, 0.01531982421875, 0.00830078125, 0.01129150390625, 0.01116943359375, 0....	[ 13538, 7077, 55681, 5908, 163, 27, 700, 87739, 53, 5303, 502, 4867, 4527, 83279, 45247, 140423, 17336, 30090, 23, 217, 22144, 6562, 80510, 2356, 919, 5713, 2223, 434, 418, 172864, 3871, 49938, 8, 48345, 3229, 444, 35064, 27585, 115700, 35...	[ 0.171875, 0.1844482421875, 0.1661376953125, 0.1444091796875, 0.135009765625, 0.02056884765625, 0.047637939453125, 0.138916015625, 0.00982666015625, 0.1866455078125, 0.1436767578125, 0.206787109375, 0.0997314453125, 0.1392822265625, 0.1812744140625, 0.1829833984375, 0.2318115234375, ...	embed
51827926_c0	51827926	prolog	0	Title: Arguments are not sufficiently instantiated with prolog clpfd Problem title: Arguments are not sufficiently instantiated with prolog clpfd Tags: clpfd, prolog Problem: Arguments are not sufficiently instantiated with prolog clpfd computeShapeBelow(Shape1,Shape2) :- nth0(2,Shape1,Location1), nth0(2,Shape2,Locatio...	Arguments are not sufficiently instantiated with prolog clpfd Arguments are not sufficiently instantiated with prolog clpfd clpfd prolog Arguments ERROR instantiation_error _9234 clpfd:drep_to_domain _9270..15 _9266 clpfd.pl:3652 clpfd:clpfd_in _9302 _9308..15 clpfd.pl:1608 _9370 use_module Shape1 Shape2 nth0 Location1...	[ 0.0027008056640625, 0.01055908203125, -0.006988525390625, 0.0179443359375, -0.00007724761962890625, 0.0145263671875, -0.0108642578125, -0.006683349609375, 0.007781982421875, 0.0234375, 0.0164794921875, -0.01708984375, 0.0123291015625, 0.000797271728515625, 0.031005859375, -0.0073242187...	[ 112140, 7, 959, 129980, 538, 34648, 14, 27686, 678, 502, 4867, 33139, 39557, 71, 151206, 24638, 188800, 12231, 10289, 7090, 254, 188, 56206, 5757, 1837, 14604, 12744, 34937, 11591, 9550, 4527, 83279, 7224, 304, 927, 2389, 90788, 45247, 3227...	[ 0.2822265625, 0.09912109375, 0.1021728515625, 0.201904296875, 0.05023193359375, 0.1680908203125, 0.149658203125, 0.091552734375, 0.071533203125, 0.169189453125, 0.247314453125, 0.093505859375, 0.1572265625, 0.1309814453125, 0.1536865234375, 0.07275390625, 0.20166015625, 0.140625, ...	embed
47116666_c0	47116666	prolog	0	Title: findall(X,condition,List) list is filled with pointers and not real objects Problem title: findall(X,condition,List) list is filled with pointers and not real objects Tags: prolog, prolog-findall Problem: findall(X,condition,List) list is filled with pointers and not real objects I am trying to get a list full o...	findall(X,condition,List) list is filled with pointers and not real objects findall(X,condition,List) list is filled with pointers and not real objects prolog prolog-findall List _G2044 _G2041 _G2038 _G2035 findall(X,condition,List) list is filled with pointers and not real objects I am trying to get a list full of obj...	[ 0.0162353515625, -0.0030975341796875, 0.0023040771484375, 0.0147705078125, -0.013427734375, 0.01409912109375, -0.01251220703125, -0.0030975341796875, 0.005645751953125, -0.046875, 0.031494140625, -0.007110595703125, 0.01080322265625, -0.0096435546875, -0.004791259765625, 0.005523681640...	[ 7413, 5584, 1542, 126940, 154663, 5303, 83, 152382, 678, 6275, 1314, 959, 2773, 36746, 502, 4867, 111607, 32036, 1549, 12465, 8894, 10991, 5843, 31577, 2046, 4393, 1295, 63399, 11177, 35431, 54397, 1653, 2063, 41, 3129, 9836, 1556, 79315, 2...	[ 0.1641845703125, 0.2098388671875, 0.1107177734375, 0.225341796875, 0.169189453125, 0.213623046875, 0.021148681640625, 0.15380859375, 0.0264739990234375, 0.1934814453125, 0.1463623046875, 0.09100341796875, 0.1395263671875, 0.17578125, 0.0950927734375, 0.16796875, 0.124755859375, 0.1...	embed
19103880_c0	19103880	prolog	0	Title: Declare a variable Problem title: Declare a variable Tags: prolog, variables Problem: Declare a variable I didn't touch Prolog since high-school, and even though I've tried to find the info, it didn't help. Below is the example that has to illustrate my problem: %% everybody():- [dana, cody, bess, abby]. %% Ever...	Declare a variable Declare a variable prolog variables Declare Everybody likes_somebody likes_everybody Declare a variable I didn't touch Prolog since high-school, and even though I've tried to find the info, it didn't help. Below is the example that has to illustrate my problem: How do I declare everybody to just be t...	[ 0.00982666015625, 0.006805419921875, -0.0123291015625, 0.0274658203125, -0.004608154296875, 0.02587890625, -0.003204345703125, -0.00007200241088867188, 0.0128173828125, -0.02197265625, -0.00164031982421875, -0.00537109375, -0.01324462890625, 0.007293701171875, 0.0198974609375, 0.019653...	[ 25755, 38103, 77336, 502, 4867, 87769, 37873, 1884, 7, 104643, 18, 23996, 1250, 16792, 11192, 48738, 3004, 4358, 27781, 58755, 2967, 11249, 54, 87, 159978, 195348, 47, 1660, 186, 5303, 111, 29526, 6868, 124519, 37842, 184307, 18499, 89914, ...	[ 0.1417236328125, 0.1856689453125, 0.30517578125, 0.12841796875, 0.2261962890625, 0.09295654296875, 0.1922607421875, 0.2403564453125, 0.06451416015625, 0.0968017578125, 0.0316162109375, 0.10296630859375, 0.1263427734375, 0.019439697265625, 0.03619384765625, 0.0914306640625, 0.05917358...	embed
679728_c0	679728	prolog	0	Title: Prolog Family tree Problem title: Prolog Family tree Tags: prolog Problem: Prolog Family tree I did it but its not showing answers When i ask about the brothers,sisters,uncles,aunts This is what I wrote, what's wrong ? /uncle(X, Y) :– male(X), sibling(X, Z), parent(Z, Y)./ /*uncle(X, Y) :– male(X), spouse(X, W...	Prolog Family tree Prolog Family tree prolog Prolog Family Prolog Family tree I did it but its not showing answers When i ask about the brothers,sisters,uncles,aunts This is what I wrote, what's wrong ? And one more thing, how do I optimize the rule of the brother so that X is not brother to itself.	[ 0.033447265625, -0.0068359375, 0.0123291015625, 0.0030517578125, -0.024658203125, -0.0004634857177734375, -0.0029296875, 0.0000553131103515625, 0.0037994384765625, -0.027587890625, -0.0024566650390625, -0.0296630859375, 0.00518798828125, 0.01080322265625, 0.014404296875, 0.002975463867...	[ 1250, 4867, 59745, 53201, 502, 6777, 442, 1284, 6863, 959, 141377, 35166, 26458, 1672, 82953, 7, 172, 37499, 309, 66695, 916, 16037, 54397, 2367, 44691, 15572, 20650, 79986, 111, 1193, 83, 47, 68034 ]	[ 0.1085205078125, 0.21240234375, 0.03143310546875, 0.2017822265625, 0.0733642578125, 0.0357666015625, 0.01800537109375, 0.0274505615234375, 0.06781005859375, 0.0782470703125, 0.1146240234375, 0.1695556640625, 0.12005615234375, 0.043548583984375, 0.14794921875, 0.053955078125, 0.063781...	embed
44400495_c0	44400495	prolog	0	Title: Get all possible binary trees using Prolog? Problem title: Get all possible binary trees using Prolog? Tags: prolog, binary-tree Problem: Get all possible binary trees using Prolog? I'm aware there are lots of questions about defining a binary tree to check whether something is a binary tree or not,but i could n...	Get all possible binary trees using Prolog? Get all possible binary trees using Prolog? prolog binary-tree Prolog Get es_arbol Get all possible binary trees using Prolog? I'm aware there are lots of questions about defining a binary tree to check whether something is a binary tree or not,but i could not find a thread t...	[ 0.03369140625, 0.00494384765625, -0.003997802734375, -0.00909423828125, 0.0069580078125, 0.0194091796875, -0.0218505859375, -0.011474609375, 0.00160980224609375, -0.042724609375, 0.004058837890625, -0.0220947265625, -0.01153564453125, 0.0230712890625, 0.02392578125, 0.007415771484375, ...	[ 20779, 756, 7722, 2394, 6635, 1360, 90, 17368, 1250, 4867, 502, 62600, 198, 147, 7296, 13204, 449, 53201, 12765, 2146, 77087, 48225, 179933, 95486, 7013, 56464, 32354, 35839, 678, 110, 10750, 30646, 177, 15555, 8305, 7108, 29481, 140992, 24...	[ 0.08856201171875, 0.135498046875, 0.171142578125, 0.1876220703125, 0.10430908203125, 0.2274169921875, 0.1005859375, 0.0799560546875, 0.15185546875, 0.235595703125, 0.12548828125, 0.21337890625, 0.077880859375, 0.075439453125, 0.209716796875, 0.10107421875, 0.004974365234375, 0.2670...	embed
23649534_c0	23649534	prolog	0	Title: Use of cumulatives Problem title: Use of cumulatives Tags: prolog, sicstus-prolog, clpfd Problem: Use of cumulatives I'm working on a problem where I use the cumulatives/[2,3] predicate. But I get very bad performance when I try to combine this with minimize in labeling I have the following demo. 10 task, all wi...	Use of cumulatives Use of cumulatives prolog sicstus-prolog clpfd Use use_module Lab S10 Starttimes E10 Endtimeds M10 MachineIds All Tasks Machines MaxEndTime Make time_out LabOpt Vars Use of cumulatives I'm working on a problem where I use the cumulatives/[2,3] predicate. But I get very bad performance when I try to c...	[ 0.01239013671875, 0.002655029296875, 0.015625, -0.001617431640625, -0.0185546875, -0.00799560546875, 0.005889892578125, -0.0022125244140625, 0.01220703125, -0.06201171875, -0.0037841796875, -0.0031280517578125, 0.0223388671875, 0.01226806640625, 0.004241943359375, -0.0201416015625, 0...	[ 36836, 111, 314, 19908, 42991, 502, 4867, 26536, 18253, 3454, 39557, 71, 4527, 83279, 21488, 159, 963, 13794, 70141, 241, 18878, 6032, 276, 68311, 3164, 9598, 9920, 152378, 70059, 1733, 6056, 39029, 18, 3323, 20697, 2967, 64, 1065, 155761, ...	[ 0.139892578125, 0.05133056640625, 0.1519775390625, 0.2423095703125, 0.2398681640625, 0.1239013671875, 0.1800537109375, 0.034881591796875, 0.1827392578125, 0.09002685546875, 0.0149383544921875, 0.0517578125, 0.125732421875, 0.1146240234375, 0.158447265625, 0.031280517578125, 0.1802978...	embed
50706676_c0	50706676	prolog	0	Title: Prolog sudoku solver Problem title: Prolog sudoku solver Tags: clpfd, prolog, sudoku Problem: Prolog sudoku solver I'm new in prolog. I found a sudoku solver from swish.swi-prolog.org that I can't understan how this code predicates each elements of this puzzle! at least I can't figure out which lines of this cod...	Prolog sudoku solver Prolog sudoku solver clpfd prolog sudoku the Prolog use_rendering use_module Example Markus Triska SWI-Prolog Rows same_length all_distinct Columns Bs1 Bs2 Bs3 Prolog sudoku solver I'm new in prolog. I found a sudoku solver from swish.swi-prolog.org that I can't understan how this code predicates e...	[ -0.003631591796875, 0.0120849609375, 0.01904296875, -0.006805419921875, -0.018798828125, 0.003753662109375, 0.00469970703125, 0.00162506103515625, -0.003814697265625, -0.038330078125, -0.010986328125, -0.0179443359375, 0.007110595703125, 0.0020599365234375, -0.02001953125, 0.0308837890...	[ 1250, 4867, 8932, 38067, 3115, 814, 39557, 71, 502, 4527, 18280, 2852, 83279, 89536, 111246, 4699, 937, 38969, 10752, 96190, 5701, 23986, 756, 38893, 233987, 304, 363, 3525, 14037, 114686, 2452, 3454, 1478, 831, 18, 1379, 4384, 3642, 903, ...	[ 0.1583251953125, 0.271484375, 0.1358642578125, 0.1878662109375, 0.1236572265625, 0.125, 0.01654052734375, 0.0750732421875, 0.1378173828125, 0.103759765625, 0.07098388671875, 0.035400390625, 0.125, 0.07000732421875, 0.1378173828125, 0.1171875, 0.1488037109375, 0.1082763671875, 0.1...	embed
21366915_c0	21366915	prolog	0	Title: swipl increment cursor in recursive function Problem title: swipl increment cursor in recursive function Tags: recursion, tail-recursion, prolog Problem: swipl increment cursor in recursive function I am very green with Prolog. I have a 7-by-7 grid and for each cell I store the X , the Y , and two other things, ...	swipl increment cursor in recursive function swipl increment cursor in recursive function recursion tail-recursion prolog reset_cell reset_grid swipl increment cursor in recursive function I am very green with Prolog. I have a 7-by-7 grid and for each cell I store the X , the Y , and two other things, like this: cell(1...	[ -0.010009765625, 0.037353515625, 0.01092529296875, 0.019775390625, 0.00555419921875, -0.000606536865234375, -0.0203857421875, -0.0022430419921875, -0.0093994140625, -0.0010528564453125, 0.02197265625, 0.006988525390625, -0.01904296875, 0.006011962890625, 0.01611328125, 0.00494384765625...	[ 2452, 2424, 158661, 13810, 42, 23, 195625, 5844, 32354, 1830, 46741, 107, 48650, 502, 4867, 168398, 34680, 120067, 4552, 50997, 1250, 14104, 1272, 16709, 12638, 38750, 4343, 1193, 70, 990, 6626, 8966, 1884, 903, 41600, 106, 757, 3444, 37317...	[ 0.1690673828125, 0.2060546875, 0.250244140625, 0.1766357421875, 0.10223388671875, 0.033111572265625, 0.1883544921875, 0.126220703125, 0.1817626953125, 0.012359619140625, 0.202392578125, 0.011810302734375, 0.1181640625, 0.0784912109375, 0.2042236328125, 0.24267578125, 0.1712646484375,...	embed
28821545_c0	28821545	prolog	0	Title: Prolog: finding intersection of two lists? Problem title: Prolog: finding intersection of two lists? Tags: prolog Problem: Prolog: finding intersection of two lists? Let's say I have Prolog facts such as: fact1(x, [y1, y2, y3, y4]). fact2(z1, [s, t, u, y3). fact2(z2, [o, p, y1, q, r]). fact2(z3, [y1,...	Prolog: finding intersection of two lists? Prolog: finding intersection of two lists? prolog Prolog fact1 fact2 Prolog: finding intersection of two lists? Let's say I have Prolog facts such as: And, I want a query such that I get all the 'z' who are related to x. Thus, this query should output z1, z2, z3, z4, z5, z6 be...	[ 0.018310546875, -0.0002498626708984375, 0.007568359375, 0.017578125, -0.00665283203125, 0.022705078125, -0.0018768310546875, -0.0021209716796875, 0.01141357421875, -0.0267333984375, 0.00823974609375, 0.02685546875, -0.01373291015625, -0.0223388671875, 0.01019287109375, 0.005126953125, ...	[ 1250, 4867, 90791, 1940, 7, 58994, 111, 6626, 5303, 502, 15824, 418, 304, 3444, 41, 1294, 2046, 756, 70, 169, 2750, 621, 62548, 47, 1022, 5608, 140992, 97, 363, 617, 758, 910, 6637, 70541, 12830, 113, 5117, 25632, 18151, 41911, 82825, ...	[ 0.1856689453125, 0.2454833984375, 0.1519775390625, 0.1846923828125, 0.1678466796875, 0.173583984375, 0.03814697265625, 0.127197265625, 0.208251953125, 0.1455078125, 0.150634765625, 0.0526123046875, 0.125732421875, 0.09234619140625, 0.148681640625, 0.1356201171875, 0.09661865234375, ...	embed
8564332_c0	8564332	prolog	0	Title: tiles game . I can't act Problem title: tiles game . I can't act Tags: tiles, prolog Problem: tiles game . I can't act I am trying to make 8-tiles problem in prolog but my code is not running . To be more specific when I type an action then I take false. move([0, Y, Z], [Y, 0, Z], right). move([X, 0, Z...	tiles game . I can't act tiles game . I can't act tiles prolog arc_horiz Direction arc_vert RowState1 RowState2 ColState1 ColState2 State1 State2 Goal Actions Action INITIAL tiles game . I can't act I am trying to make 8-tiles problem in prolog but my code is not running . To be more specific when I type an a...	[ 0.010009765625, 0.0167236328125, 0.0242919921875, 0.01806640625, -0.01177978515625, -0.0030670166015625, -0.029296875, 0.00897216796875, -0.00799560546875, -0.01251220703125, 0.01263427734375, 0.02587890625, -0.01092529296875, 0.0146484375, -0.0029754638671875, 0.0047607421875, 0.003...	[ 139, 90, 6712, 87, 831, 3768, 18, 27992, 502, 4867, 46552, 497, 14096, 176774, 11549, 96190, 135206, 11554, 22836, 2016, 57945, 35522, 7842, 31577, 15045, 118, 1577, 2967, 18151, 959, 51042, 10644, 22631, 98320 ]	[ 0.21630859375, 0.124267578125, 0.1373291015625, 0.010009765625, 0.0718994140625, 0.017425537109375, 0.08331298828125, 0.174560546875, 0.142822265625, 0.1854248046875, 0.08673095703125, 0.0728759765625, 0.095703125, 0.1529541015625, 0.1141357421875, 0.0975341796875, 0.062744140625, ...	embed
16208038_c0	16208038	prolog	0	Title: Prolog: Appending a List fails and Not too sure why Problem title: Prolog: Appending a List fails and Not too sure why Tags: prolog, list, append Problem: Prolog: Appending a List fails and Not too sure why I am relatively new to prolog and what I am trying to do is create a list, but I seem to be encountering a...	Prolog: Appending a List fails and Not too sure why Prolog: Appending a List fails and Not too sure why prolog list append Prolog Appending List Not Prolog: Appending a List fails and Not too sure why I am relatively new to prolog and what I am trying to do is create a list, but I seem to be encountering an error and I...	[ 0.004913330078125, 0.00830078125, 0.01385498046875, 0.01806640625, 0.0023651123046875, 0.0198974609375, -0.004302978515625, 0.01123046875, 0.00421142578125, -0.0252685546875, 0.0230712890625, -0.020263671875, -0.020263671875, 0.00482177734375, 0.0228271484375, -0.002410888671875, 0.0...	[ 1250, 4867, 5787, 96819, 10, 32036, 35782, 5792, 9077, 502, 5303, 114689, 71, 11205, 28282, 190647, 18499, 144851, 206468, 6083, 79897, 366, 2189, 5443, 19107, 125592, 63258, 170, 3613, 18241, 49512, 254, 26265, 9007, 3611, 192616, 1819, 1295...	[ 0.1483154296875, 0.1805419921875, 0.11279296875, 0.130859375, 0.013275146484375, 0.1978759765625, 0.161865234375, 0.0469970703125, 0.04559326171875, 0.1248779296875, 0.1776123046875, 0.1534423828125, 0.052490234375, 0.0133056640625, 0.0523681640625, 0.005218505859375, 0.13720703125, ...	embed
29361220_c0	29361220	prolog	0	Title: Prolog - Multiplying A list with an uninstantiated list Problem title: Prolog - Multiplying A list with an uninstantiated list Tags: prolog Problem: Prolog - Multiplying A list with an uninstantiated list The input to this predicate is S, a list of integers I, and a list of integers T. Assumption is that both S ...	Prolog - Multiplying A list with an uninstantiated list Prolog - Multiplying A list with an uninstantiated list prolog Prolog Multiplying use_module mult_prod sum_prod Accum Accum1 Prolog - Multiplying A list with an uninstantiated list The input to this predicate is S, a list of integers I, and a list of integers T. A...	[ -0.026611328125, 0.03125, 0.027587890625, 0.01458740234375, -0.038818359375, -0.01055908203125, -0.02197265625, 0.005279541015625, 0.000545501708984375, -0.0216064453125, 0.0167236328125, 0.0244140625, -0.004058837890625, 0.01165771484375, -0.0172119140625, 0.0164794921875, 0.0274658...	[ 1250, 4867, 19335, 62479, 5303, 678, 51, 143034, 14, 27686, 502, 4527, 83279, 3869, 112348, 10554, 29899, 316, 107730, 1653, 2063, 159, 892, 26255, 87, 384, 71836, 89554, 34648, 32354, 118126, 5117, 12830, 17932, 6528, 151994, 19441, 214493, ...	[ 0.1141357421875, 0.188720703125, 0.0982666015625, 0.1563720703125, 0.195556640625, 0.03997802734375, 0.06744384765625, 0.142333984375, 0.1146240234375, 0.068603515625, 0.08294677734375, 0.0980224609375, 0.1322021484375, 0.1160888671875, 0.192138671875, 0.1431884765625, 0.062194824218...	embed
61414447_c0	61414447	prolog	0	Title: Checking if a list of variables is unifiable with a list of lists containing letters Problem title: Checking if a list of variables is unifiable with a list of lists containing letters Tags: list, unification, prolog Problem: Checking if a list of variables is unifiable with a list of lists containing letters I ...	Checking if a list of variables is unifiable with a list of lists containing letters Checking if a list of variables is unifiable with a list of lists containing letters list unification prolog Checking spaces_uni Spc LstWords Words Space Checking if a list of variables is unifiable with a list of lists containing lett...	[ -0.0009765625, 0.012939453125, -0.0021209716796875, -0.0016326904296875, -0.0172119140625, -0.005523681640625, -0.000751495361328125, -0.00262451171875, 0.007568359375, 0.00171661376953125, 0.01287841796875, 0.006591796875, 0.024658203125, -0.0106201171875, -0.0108642578125, 0.01940917...	[ 38679, 2174, 5303, 77336, 83, 51, 27430, 2886, 678, 70541, 120820, 41274, 502, 4867, 32628, 5980, 8019, 238, 339, 271, 164805, 22543, 43045, 214, 1653, 2063, 7, 31923, 866, 1511, 34153, 31, 42, 177, 11, 60042, 67, 12765, 2565, 831, 4038...	[ 0.1573486328125, 0.060028076171875, 0.1795654296875, 0.227783203125, 0.0295867919921875, 0.1502685546875, 0.1390380859375, 0.1231689453125, 0.115234375, 0.0867919921875, 0.1715087890625, 0.051025390625, 0.07196044921875, 0.1265869140625, 0.1827392578125, 0.1689453125, 0.0966796875, ...	embed
41325535_c1	41325535	prolog	1	%%%%%%%%%%%%%%%%%%%%%%%%%%% planExecute(P):-testPlan(P,E),writeExec(E),!. satisfiedGoal(E):- objectivos(Fn),!, sub(Fn,E). testPlan(Plan,[I\|Exec]) :- inicial(I), testPlan(Plan,I,Exec,Fn), satisfiedGoal(Fn). testPlan([],Fn,[],Fn). testPlan([H\|T],S,[H,N\|Exec],Fn) :- accao(nome:H, condicoes:C,efeitos:E, restricoes:R), sub...	%%%%%%%%%%%%%%%%%%%%%%%%%%% planExecute(P):-testPlan(P,E),writeExec(E),!. satisfiedGoal(E):- objectivos(Fn),!, sub(Fn,E). testPlan(Plan,[I\|Exec]) :- inicial(I), testPlan(Plan,I,Exec,Fn), satisfiedGoal(Fn). testPlan([],Fn,[],Fn). testPlan([H\|T],S,[H,N\|Exec],Fn) :- accao(nome:H, condicoes:C,efeitos:E, restricoes:R), sub...	[ -0.006805419921875, 0.005523681640625, -0.0027313232421875, 0.033203125, -0.019775390625, 0.0026092529296875, -0.017822265625, -0.007049560546875, 0.03466796875, 0.0033111572265625, 0.0198974609375, 0.0255126953125, -0.01556396484375, -0.0133056640625, 0.0023040771484375, 0.01324462890...	[ 1745, 3949, 1774, 211603, 13, 132, 683, 9, 6954, 78680, 647, 434, 18781, 19279, 3240, 38, 214521, 17903, 289, 36746, 40345, 919, 19, 1614, 3034, 568, 15772, 50974, 841, 618, 294, 839, 1030, 123142, 64970, 158, 55455, 89286, 66206, 587, ...	[ 0.082763671875, 0.0782470703125, 0.2451171875, 0.29736328125, 0.1103515625, 0.032623291015625, 0.1358642578125, 0.0306549072265625, 0.212158203125, 0.259521484375, 0.09613037109375, 0.0025634765625, 0.089599609375, 0.077392578125, 0.1822509765625, 0.0716552734375, 0.21533203125, 0....	embed
37372037_c1	37372037	prolog	1	FlatSubmatrixArray, FlatSubmatrix), % Cell count in rectangle must equal HintNumber %length(FlatSubmatrix, HintNumber), % All cells in rectangle must have ID as value %FlatSubmatrixArray[1..HintNumber] :: ID ) ), % Start searching labeling(Matrix), writematrix(Matrix, Width, Height, HintsArray). writematrix(Matrix, Wid...	FlatSubmatrixArray, FlatSubmatrix), % Cell count in rectangle must equal HintNumber %length(FlatSubmatrix, HintNumber), % All cells in rectangle must have ID as value %FlatSubmatrixArray[1..HintNumber] :: ID ) ), % Start searching labeling(Matrix), writematrix(Matrix, Width, Height, HintsArray). writematrix(Matrix, Wid...	[ -0.01153564453125, 0.007354736328125, 0.00640869140625, 0.006591796875, 0.009765625, -0.0113525390625, -0.015625, -0.00750732421875, 0.007537841796875, -0.0025634765625, -0.0186767578125, -0.0089111328125, 0.006805419921875, 0.0162353515625, -0.007293701171875, -0.012939453125, 0.014...	[ 106516, 96472, 192, 87427, 7614, 7092, 1745, 80743, 54529, 148734, 449, 133, 8110, 105950, 19895, 18, 18444, 26278, 23986, 2335, 38750, 11338, 34292, 841, 4288, 157318, 67967, 4613, 33022, 58302, 22553, 1529, 2783, 237, 54704, 21455, 568, 961...	[ 0.23291015625, 0.203857421875, 0.0791015625, 0.1439208984375, 0.04339599609375, 0.12841796875, 0.002227783203125, 0.1710205078125, 0.1614990234375, 0.09942626953125, 0.0892333984375, 0.04156494140625, 0.053497314453125, 0.1337890625, 0.18896484375, 0.060150146484375, 0.061279296875, ...	embed
47581135_c0	47581135	prolog	0	Title: Prolog chess knight algorithm Problem title: Prolog chess knight algorithm Tags: algorithm, knights-tour, prolog Problem: Prolog chess knight algorithm I'm trying to resolve chess knight problem for custom matrix but I don't know where is problem. A chess knight must visit each place once, and when he manages to...	Prolog chess knight algorithm Prolog chess knight algorithm algorithm knights-tour prolog Prolog POINT Xmax Ymax Prolog chess knight algorithm I'm trying to resolve chess knight problem for custom matrix but I don't know where is problem. A chess knight must visit each place once, and when he manages to visit all field...	[ -0.002960205078125, 0.0098876953125, 0.0240478515625, 0.0126953125, 0.002166748046875, 0.006805419921875, -0.01458740234375, 0.0167236328125, 0.0240478515625, -0.0263671875, 0.0020294189453125, 0.001373291015625, -0.01416015625, 0.0093994140625, -0.006378173828125, -0.02294921875, 0....	[ 1250, 4867, 290, 7, 472, 54350, 234873, 28889, 502, 8574, 59537, 1193, 24084, 990, 31577, 103608, 2967, 114122, 50944, 425, 2301, 18, 3714, 7440, 62, 8110, 19922, 12638, 3687, 24145, 111240, 756, 44457, 67229, 1528, 764, 16487, 26785, 16251...	[ 0.165771484375, 0.234130859375, 0.1820068359375, 0.1236572265625, 0.10638427734375, 0.2396240234375, 0.23876953125, 0.226318359375, 0.1221923828125, 0.133056640625, 0.1109619140625, 0.02581787109375, 0.173095703125, 0.041717529296875, 0.03717041015625, 0.129150390625, 0.139404296875,...	embed
20711208_c0	20711208	prolog	0	Title: Prolog infinite loop Problem title: Prolog infinite loop Tags: prolog, recursion Problem: Prolog infinite loop I'm fairly new to Prolog and I hope this question hasn't been asked and answered but if it has I apologize, I can't make sense of any of the other similar questions and answers. My problem is that I hav...	Prolog infinite loop Prolog infinite loop prolog recursion Prolog Prolog infinite loop I'm fairly new to Prolog and I hope this question hasn't been asked and answered but if it has I apologize, I can't make sense of any of the other similar questions and answers. My problem is that I have 3 towns, connected by roads. ...	[ 0.0201416015625, 0.0069580078125, 0.01007080078125, 0.0238037109375, -0.003173828125, -0.0026092529296875, -0.00537109375, -0.002593994140625, 0.00762939453125, -0.072265625, 0.0166015625, -0.0067138671875, -0.016845703125, -0.01025390625, 0.0205078125, 0.037109375, 0.006072998046875...	[ 1250, 4867, 54241, 13, 40956, 502, 195625, 1830, 180663, 3525, 15673, 194663, 12524, 10422, 21373, 2967, 765, 138, 59444, 162711, 33816, 17006, 1632, 3917, 6626, 48800, 10, 876, 501, 101935, 62488, 3871, 19048, 738, 1295, 47, 15490, 179933, ...	[ 0.1954345703125, 0.2447509765625, 0.18603515625, 0.0850830078125, 0.260498046875, 0.1524658203125, 0.250732421875, 0.057373046875, 0.03436279296875, 0.013275146484375, 0.033905029296875, 0.004119873046875, 0.0472412109375, 0.05902099609375, 0.009521484375, 0.12646484375, 0.0548095703...	embed
64807019_c0	64807019	prolog	0	Title: Finding the binary tree height in Prolog Problem title: Finding the binary tree height in Prolog Tags: binary-tree, prolog, recursion Problem: Finding the binary tree height in Prolog So I have a task to create a binary tree using the following facts that define each node with its two child nodes: node(root, a, ...	Finding the binary tree height in Prolog Finding the binary tree height in Prolog binary-tree prolog recursion Finding Prolog RootNode Height Left Right Finding the binary tree height in Prolog So I have a task to create a binary tree using the following facts that define each node with its two child nodes: I want to d...	[ 0.021240234375, 0.0123291015625, -0.000911712646484375, 0.004302978515625, 0.00213623046875, 0.0135498046875, -0.015625, -0.01397705078125, -0.00159454345703125, -0.051025390625, -0.012939453125, -0.03271484375, -0.010009765625, 0.00034332275390625, 0.031494140625, -0.0167236328125, ...	[ 26040, 2394, 6635, 53201, 155955, 1250, 4867, 62600, 502, 195625, 150948, 5021, 112, 1529, 22553, 2480, 90911, 66211, 28282, 15824, 61924, 110, 6626, 29041, 79986, 12724, 818, 74481, 4034, 111, 4989, 525, 62488, 74855, 2060, 16065, 2407, 2002...	[ 0.0743408203125, 0.1514892578125, 0.124267578125, 0.232666015625, 0.231689453125, 0.1473388671875, 0.209716796875, 0.190185546875, 0.0841064453125, 0.1275634765625, 0.152587890625, 0.1514892578125, 0.1427001953125, 0.1439208984375, 0.131591796875, 0.025421142578125, 0.05816650390625,...	embed
62174656_c1	62174656	prolog	1	shows: 1) the state-transition probability matrix A, b) the discrete emission/observation probabilities matrix B, and 3) the initial (prior) probabilities matrix π. The model is not hidden because you know the sequence of states from the colors of the coins and dice. Suppose, however, that someone else is generating t...	shows: 1) the state-transition probability matrix A, b) the discrete emission/observation probabilities matrix B, and 3) the initial (prior) probabilities matrix π. The model is not hidden because you know the sequence of states from the colors of the coins and dice. Suppose, however, that someone else is generating t...	[ -0.0244140625, -0.002960205078125, -0.0126953125, 0.0281982421875, -0.01153564453125, 0.0093994140625, -0.006439208984375, 0.00159454345703125, 0.0103759765625, -0.0177001953125, -0.0086669921875, -0.000431060791015625, 0.0040283203125, 0.01171875, 0.010498046875, -0.00250244140625, ...	[ 45831, 4879, 11341, 30145, 14, 1363, 37242, 2481, 50944, 425, 62, 876, 81604, 13, 28, 21150, 64, 141331, 31075, 335, 4, 8439, 61475, 5293, 748, 16, 7823, 3299, 83, 959, 204105, 6637, 3714, 70, 40, 944, 111, 117249, 1295, 104988, 43780, ...	[ 0.1993408203125, 0.00640869140625, 0.1409912109375, 0.1483154296875, 0.07196044921875, 0.07891845703125, 0.265380859375, 0.1893310546875, 0.14013671875, 0.043609619140625, 0.0689697265625, 0.01495361328125, 0.14892578125, 0.04852294921875, 0.1361083984375, 0.177734375, 0.04052734375,...	embed
70669724_c0	70669724	prolog	0	Title: How using upcase_atom/2 in Prolog? Problem title: How using upcase_atom/2 in Prolog? Tags: swi-prolog, prolog Problem: How using upcase_atom/2 in Prolog? Here is a minimal theorem prover in Prolog: :- op(1110, xfy, =>). % conditional % ----------------------------------------------------------------- provable(F,...	How using upcase_atom/2 in Prolog? How using upcase_atom/2 in Prolog? swi-prolog prolog upcase_atom/2 How upcase_atom Prolog Initial i.e Conditional Proof How using upcase_atom/2 in Prolog? Here is a minimal theorem prover in Prolog: to prove identity : I do not succeed to write some lines of Prolog code to get with th...	[ 0.0155029296875, 0.00946044921875, 0.0172119140625, 0.02001953125, 0.00885009765625, 0.00897216796875, 0.006256103515625, 0.0074462890625, -0.005096435546875, -0.031494140625, 0.01519775390625, 0.000701904296875, 0.007415771484375, -0.0023345947265625, 0.025146484375, 0.004974365234375...	[ 11249, 17368, 1257, 58437, 5928, 12477, 23, 1250, 4867, 11, 2452, 3454, 502, 1890, 46347, 43315, 4390, 20187, 70, 58391, 814, 47, 23534, 182324, 959, 214493, 33022, 3060, 124519, 18151, 2046, 5701, 107730, 140992, 678, 34627, 77336, 10323, ...	[ 0.10601806640625, 0.143798828125, 0.138427734375, 0.2340087890625, 0.1910400390625, 0.2196044921875, 0.0595703125, 0.156494140625, 0.24560546875, 0.0186004638671875, 0.118408203125, 0.1090087890625, 0.0911865234375, 0.0496826171875, 0.17626953125, 0.0789794921875, 0.1220703125, 0.1...	embed
39815240_c0	39815240	prolog	0	Title: prolog doesn't give me a solution when one exists Problem title: prolog doesn't give me a solution when one exists Tags: prolog, prolog-dif, logical-purity Problem: prolog doesn't give me a solution when one exists I am working through Seven Languages in Seven Weeks , but there is something I don't und...	prolog doesn't give me a solution when one exists prolog doesn't give me a solution when one exists prolog prolog-dif logical-purity teams.pl prolog doesn't give me a solution when one exists I am working through Seven Languages in Seven Weeks , but there is something I don't understand about prolog. I have t...	[ 0.00848388671875, 0.014404296875, 0.00160980224609375, 0.01043701171875, -0.0198974609375, -0.00701904296875, -0.0052490234375, 0.00079345703125, 0.00640869140625, -0.0303955078125, 0.00927734375, 0.01019287109375, 0.0006256103515625, -0.002685546875, 0.0021820068359375, 0.012023925781...	[ 502, 4867, 22027, 3768, 18, 8337, 163, 10, 29806, 3229, 1632, 32316, 7, 428, 420, 62775, 289, 4717, 2481, 87199, 2424, 20697, 8305, 132556, 83658, 58417, 2301, 28219, 25632, 1528, 77007, 58982, 8509, 11969, 39, 4007, 72367, 1884, 2499, 51...	[ 0.188720703125, 0.275634765625, 0.0491943359375, 0.0290069580078125, 0.0899658203125, 0.08642578125, 0.0709228515625, 0.0850830078125, 0.2135009765625, 0.076904296875, 0.07403564453125, 0.2076416015625, 0.074951171875, 0.010894775390625, 0.040496826171875, 0.085205078125, 0.030853271...	embed
76290570_c1	76290570	prolog	1	weight paired with table 2: % weight(Kg) weight(10). weight(10). weight(10). weight(10). % balance weight-table pairs, Table 1 total KG, Table 2 total Kg balance([], 0, 0). balance([weight(Kg)-1 \| Ws], Table1Total, Table2Total) :- Table1Total #= T1_ + Kg, balance(Ws, T1_, Table2Total). balance([weight(Kg)-2 \| Ws], Tab...	weight paired with table 2: % weight(Kg) weight(10). weight(10). weight(10). weight(10). % balance weight-table pairs, Table 1 total KG, Table 2 total Kg balance([], 0, 0). balance([weight(Kg)-1 \| Ws], Table1Total, Table2Total) :- Table1Total #= T1_ + Kg, balance(Ws, T1_, Table2Total). balance([weight(Kg)-2 \| Ws], Tab...	[ 0.01544189453125, 0.0201416015625, -0.0118408203125, -0.0031890869140625, -0.01007080078125, 0.0125732421875, 0.0068359375, -0.0035400390625, -0.0025482177734375, 0.00421142578125, 0.0186767578125, 0.008544921875, 0.02734375, 0.0081787109375, 0.00311279296875, 0.003570556640625, 0.01...	[ 57888, 80836, 678, 23180, 15573, 1745, 605, 177, 90980, 40197, 22819, 112997, 106, 3622, 94397, 116, 341, 757, 165598, 5759, 601, 169473, 304, 418, 384, 997, 5428, 738, 8335, 481, 7413, 5584, 150533, 19770, 27494, 10461, 32920, 43719, 618, ...	[ 0.2144775390625, 0.19677734375, 0.005523681640625, 0.259765625, 0.1602783203125, 0.043670654296875, 0.03509521484375, 0.077880859375, 0.1187744140625, 0.209716796875, 0.198486328125, 0.220703125, 0.035552978515625, 0.0760498046875, 0.1103515625, 0.1065673828125, 0.0199737548828125, ...	embed
20804543_c0	20804543	prolog	0	Title: DCGs - how to split an atom into a list for further dcg rule processing Problem title: DCGs - how to split an atom into a list for further dcg rule processing Tags: prolog, dcg Problem: DCGs - how to split an atom into a list for further dcg rule processing I have a simple grammar, which takes 3 list items and r...	DCGs - how to split an atom into a list for further dcg rule processing DCGs - how to split an atom into a list for further dcg rule processing prolog dcg DCGs DCGs - how to split an atom into a list for further dcg rule processing I have a simple grammar, which takes 3 list items and runs a different dcg rule on each....	[ 0.00421142578125, -0.0025634765625, -0.002227783203125, 0.021484375, -0.00537109375, 0.0301513671875, -0.0016021728515625, -0.00299072265625, -0.004119873046875, -0.01312255859375, 0.0015869140625, 0.00830078125, -0.0140380859375, -0.000591278076171875, -0.003631591796875, 0.02734375, ...	[ 391, 56367, 7, 3642, 65450, 34627, 3934, 5303, 53333, 104, 238, 177, 79986, 9433, 47, 142, 100, 502, 4867, 8781, 122092, 147, 51776, 138, 55769, 127877, 12921, 12638, 28864, 43240, 5885, 2967, 107730, 27117, 116, 959, 17932, 158, 4460, 13...	[ 0.0985107421875, 0.216552734375, 0.0689697265625, 0.0828857421875, 0.24462890625, 0.2393798828125, 0.166748046875, 0.2122802734375, 0.07867431640625, 0.0638427734375, 0.06103515625, 0.1339111328125, 0.1700439453125, 0.0899658203125, 0.04925537109375, 0.036651611328125, 0.037322998046...	embed
66343215_c0	66343215	prolog	0	Title: Dealing with dynamic predicates that cause compilation failures Problem title: Dealing with dynamic predicates that cause compilation failures Tags: prolog, gnu-prolog Problem: Dealing with dynamic predicates that cause compilation failures I am attempting to run an example GNU Prolog program used as an example ...	Dealing with dynamic predicates that cause compilation failures Dealing with dynamic predicates that cause compilation failures prolog gnu-prolog Dealing Users Chase Desktop Prolog newAnimal.pro newAnimal.pro:74:12 Dealing with dynamic predicates that cause compilation failures I am attempting to run an example GNU Pro...	[ 0.0223388671875, 0.0037841796875, 0.0137939453125, 0.01470947265625, -0.016357421875, 0.0233154296875, 0.0128173828125, 0.0250244140625, -0.007049560546875, -0.038818359375, -0.01318359375, -0.01165771484375, -0.02734375, -0.0250244140625, 0.03564453125, 0.00872802734375, 0.010498046...	[ 90943, 678, 84079, 1653, 2063, 1636, 22304, 98352, 1363, 137578, 502, 4867, 104155, 3454, 53400, 4841, 184, 141423, 1250, 93, 2749, 81887, 11675, 27781, 165132, 1528, 15411, 4488, 18151, 198932, 6366, 15246, 84433, 77275, 2489, 2424, 124326, ...	[ 0.145263671875, 0.069091796875, 0.216552734375, 0.17431640625, 0.205078125, 0.08966064453125, 0.09814453125, 0.2125244140625, 0.023284912109375, 0.1754150390625, 0.103271484375, 0.20751953125, 0.11572265625, 0.13037109375, 0.1395263671875, 0.160400390625, 0.049896240234375, 0.13098...	embed
33137737_c0	33137737	prolog	0	Title: What value should be instead of "underscore"? Problem title: What value should be instead of "underscore"? Tags: logic, prolog Problem: What value should be instead of "underscore"? I'm learning Prolog and have the following given lines: Consider the following Prolog program. It contains fact...	What value should be instead of "underscore"? What value should be instead of "underscore"? logic prolog What Consider Prolog math100 cs330 phys210 ee100 What value should be instead of "underscore"? I'm learning Prolog and have the following given lines: And then there's a question: I've finished a...	[ 0.01373291015625, 0.009765625, 0.01092529296875, 0.0174560546875, -0.0296630859375, 0.022216796875, 0.002044677734375, 0.00054168701171875, 0.000705718994140625, -0.015869140625, 0.0042724609375, -0.004425048828125, -0.00677490234375, -0.002105712890625, -0.005706787109375, 0.016845703...	[ 4865, 34292, 5608, 186, 64457, 41502, 24658, 7, 30854, 62775, 502, 4867, 137399, 1250, 48909, 3559, 20763, 94375, 34053, 88142, 1804, 111, 124519, 122799, 44402, 63134, 100094, 454, 35166, 27489, 196592, 27685, 82512, 237259, 17932 ]	[ 0.071533203125, 0.2445068359375, 0.1566162109375, 0.059600830078125, 0.196044921875, 0.01824951171875, 0.27783203125, 0.12109375, 0.278564453125, 0.11376953125, 0.0902099609375, 0.2144775390625, 0.1209716796875, 0.134521484375, 0.0195770263671875, 0.1463623046875, 0.00213623046875, ...	embed
38607599_c0	38607599	prolog	0	Title: Categorising a list into two separate lists by type Problem title: Categorising a list into two separate lists by type Tags: list, prolog Problem: Categorising a list into two separate lists by type I'm still fairly new to Prolog and I've been having difficulties with an exercise involving lists: given a list of...	Categorising a list into two separate lists by type Categorising a list into two separate lists by type list prolog Categorising IntegerListHead FloatListHead IntHead IntList FloatHead FloatList ERROR Undefined DWIM Categorising a list into two separate lists by type I'm still fairly new to Prolog and I've been having ...	[ 0.00860595703125, -0.00311279296875, -0.0093994140625, 0.00469970703125, -0.02587890625, 0.017333984375, -0.0152587890625, -0.00982666015625, -0.0025787353515625, -0.0004711151123046875, 0.001495361328125, -0.0255126953125, -0.0152587890625, -0.00408935546875, -0.0003032684326171875, -...	[ 161637, 6953, 5303, 3934, 6626, 84797, 390, 10644, 502, 4867, 44401, 154663, 13025, 712, 38699, 151206, 24638, 79912, 5983, 30439, 17199, 1250, 34844, 81979, 34475, 61799, 2053, 1632, 70541, 892, 1505, 142424, 2773, 14012, 42077, 55769, 7311, ...	[ 0.2047119140625, 0.032684326171875, 0.2078857421875, 0.11865234375, 0.1617431640625, 0.1651611328125, 0.0738525390625, 0.2142333984375, 0.102294921875, 0.191650390625, 0.08349609375, 0.0980224609375, 0.1085205078125, 0.03118896484375, 0.10247802734375, 0.109130859375, 0.0170288085937...	embed
25793451_c1	25793451	prolog	1	, Result ):- Expression =.. [_, SubExpA], get_Subterms(SubExpA,[],PartResA), append(PartResA, [Expression\|PartialResult], Result), !. get_Subterms( Expression, PartialResult, Result ):- !, Expression =.. [_, SubExpA, SubExpB], get_Subterms(SubExpA,[],PartResA), get_Subterms(SubExpB,[],PartResB), append(PartResA, PartRe...	, Result ):- Expression =.. [_, SubExpA], get_Subterms(SubExpA,[],PartResA), append(PartResA, [Expression\|PartialResult], Result), !. get_Subterms( Expression, PartialResult, Result ):- !, Expression =.. [_, SubExpA, SubExpB], get_Subterms(SubExpA,[],PartResA), get_Subterms(SubExpB,[],PartResB), append(PartResA, PartRe...	[ -0.00982666015625, 0.00537109375, 0.017578125, 0.0185546875, -0.000335693359375, 0.006256103515625, -0.007415771484375, 0.00958251953125, 0.0198974609375, 0.0020294189453125, 0.017578125, 0.0023651123046875, -0.00927734375, -0.006866455078125, -0.00494384765625, -0.003021240234375, 0...	[ 4, 126684, 2077, 25129, 1830, 2203, 8273, 19279, 254, 284, 2046, 96472, 32166, 58229, 4332, 114689, 71, 178752, 15403, 7, 7136, 711, 9148, 289, 571, 1601, 78381, 139118, 839, 594, 180423, 8335, 481, 79986, 26951, 133, 17727, 866, 304, 418...	[ 0.064208984375, 0.2208251953125, 0.07373046875, 0.234130859375, 0.1929931640625, 0.124267578125, 0.149169921875, 0.10614013671875, 0.1341552734375, 0.10394287109375, 0.095703125, 0.14892578125, 0.2093505859375, 0.0777587890625, 0.030975341796875, 0.1114501953125, 0.0274810791015625, ...	embed
65173123_c1	65173123	prolog	1	6. get_card_suit(Card, hearts) :- mod(Card, 24) >= 2 * 6, mod(Card, 24) < 3 * 6. get_card_suit(Card, spades) :- mod(Card, 24) >= 3 * 6, mod(Card, 24) < 4 * 6. I also tested something else out. I replaced the get_cards_by_suit/3 definition with the following: get_cards_by_suit(List, Suit, [4, 5, 6, 7, 7]) :- write(List)...	6. get_card_suit(Card, hearts) :- mod(Card, 24) >= 2 * 6, mod(Card, 24) < 3 * 6. get_card_suit(Card, spades) :- mod(Card, 24) >= 3 * 6, mod(Card, 24) < 4 * 6. I also tested something else out. I replaced the get_cards_by_suit/3 definition with the following: get_cards_by_suit(List, Suit, [4, 5, 6, 7, 7]) :- write(List)...	[ -0.00628662109375, 0.00579833984375, 0.0037841796875, -0.006134033203125, -0.003143310546875, -0.010498046875, -0.01275634765625, -0.000797271728515625, 0.02587890625, -0.005096435546875, 0.00836181640625, 0.0286865234375, -0.022705078125, -0.009521484375, 0.0033111572265625, -0.014099...	[ 2289, 2046, 38931, 68879, 156119, 26498, 7, 2811, 744, 661, 305, 138, 5623, 988, 201, 3034, 1810, 91995, 1272, 18113, 80934, 154663, 1832, 190, 361, 33022, 13169, 41, 1294, 7413, 6639, 449, 525, 70731, 13, 13438, 49146, 43512, 226584, 415...	[ 0.119140625, 0.1253662109375, 0.25390625, 0.241455078125, 0.2349853515625, 0.2047119140625, 0.11962890625, 0.15478515625, 0.1287841796875, 0.0040283203125, 0.0928955078125, 0.0625, 0.1708984375, 0.1544189453125, 0.04425048828125, 0.1121826171875, 0.0200958251953125, 0.100830078125,...	embed
67689985_c0	67689985	prolog	0	Title: Prolog: How to write a predicate that calculates an integral? Problem title: Prolog: How to write a predicate that calculates an integral? Tags: integral, parameters, predicate, prolog Problem: Prolog: How to write a predicate that calculates an integral? I want to write a prediacte integrate(A, B, N, F, R), A i...	Prolog: How to write a predicate that calculates an integral? Prolog: How to write a predicate that calculates an integral? integral parameters predicate prolog Prolog How B-A Prolog: How to write a predicate that calculates an integral? I want to write a prediacte integrate(A, B, N, F, R), A is the lower boundary, B i...	[ -0.0016937255859375, -0.027587890625, 0.0032806396484375, 0.002197265625, -0.007354736328125, 0.0191650390625, 0.0076904296875, -0.022705078125, 0.0068359375, -0.004791259765625, 0.0108642578125, 0.0205078125, -0.0284423828125, 0.010498046875, 0.039794921875, -0.000728607177734375, 0...	[ 1250, 4867, 11249, 47, 33022, 1653, 2063, 67, 450, 74481, 1636, 28970, 10, 142, 171859, 502, 335, 9, 284, 3444, 14, 58967, 78779, 13, 541, 563, 627, 62, 83, 92319, 99091, 6635, 1407, 56, 14012, 206025, 32354, 126684, 74189, 18151, 4527,...	[ 0.15380859375, 0.19873046875, 0.10687255859375, 0.043365478515625, 0.222900390625, 0.2122802734375, 0.2386474609375, 0.142578125, 0.04986572265625, 0.23681640625, 0.08837890625, 0.2998046875, 0.02203369140625, 0.029510498046875, 0.1612548828125, 0.119140625, 0.1231689453125, 0.0397...	embed
23719009_c0	23719009	prolog	0	Title: Need assistance with similar More Money code for Prolog Problem title: Need assistance with similar More Money code for Prolog Tags: cryptarithmetic-puzzle, eclipse-clp, prolog Problem: Need assistance with similar More Money code for Prolog Every letter below in the puzzle uniquely represent one of the 10 digit...	Need assistance with similar More Money code for Prolog Need assistance with similar More Money code for Prolog cryptarithmetic-puzzle eclipse-clp prolog Need More Money Prolog List diff_list shallow_backtrack Tail Input1 Input2 Need assistance with similar More Money code for Prolog Every letter below in the puzzle un...	[ 0.00836181640625, -0.00164794921875, -0.00006341934204101562, 0.0174560546875, -0.0281982421875, 0.01312255859375, -0.0023193359375, 0.01031494140625, 0.00543212890625, -0.007049560546875, 0.00531005859375, -0.00408935546875, 0.029541015625, 0.018310546875, -0.00537109375, 0.0051269531...	[ 52889, 127557, 21373, 5455, 81669, 18151, 1250, 4867, 136791, 8962, 1766, 13894, 133, 106371, 184, 26775, 502, 32036, 71337, 6562, 35299, 8770, 12620, 125728, 1218, 379, 87769, 31330, 35064, 104192, 36998, 33636, 209, 153939, 757, 106, 3569, ...	[ 0.1473388671875, 0.1361083984375, 0.1259765625, 0.208251953125, 0.2333984375, 0.1798095703125, 0.14697265625, 0.2293701171875, 0.1177978515625, 0.0458984375, 0.048583984375, 0.06903076171875, 0.036468505859375, 0.1580810546875, 0.092529296875, 0.06390380859375, 0.0802001953125, 0.1...	embed
34072666_c0	34072666	prolog	0	Title: SWI Prolog homework assistance Problem title: SWI Prolog homework assistance Tags: prolog, sorting Problem: SWI Prolog homework assistance I'm kind of at a loss on how to tackle this homework project based on what I know about prolog (which, admittedly isn't a whole lot) Basically, we have a group of diners that...	SWI Prolog homework assistance SWI Prolog homework assistance prolog sorting SWI Prolog SWI Prolog homework assistance I'm kind of at a loss on how to tackle this homework project based on what I know about prolog (which, admittedly isn't a whole lot) Basically, we have a group of diners that rank their preferences on ...	[ 0.0098876953125, 0.01055908203125, 0.002227783203125, -0.00360107421875, -0.046630859375, 0.00469970703125, -0.0021820068359375, -0.0047607421875, 0.005706787109375, -0.01806640625, 0.009521484375, 0.021240234375, -0.0186767578125, -0.0238037109375, -0.0062255859375, -0.0155029296875, ...	[ 159, 38969, 1250, 4867, 5368, 18244, 127557, 502, 12096, 214, 8562, 86669, 3642, 36461, 13452, 35509, 3714, 21115, 149383, 30648, 2363, 205537, 24233, 45, 1495, 23468, 9351, 114942, 62, 335, 313, 391, 241, 69236, 83, 95486, 40, 9821, 23180,...	[ 0.081298828125, 0.24609375, 0.1668701171875, 0.2266845703125, 0.1082763671875, 0.1517333984375, 0.1650390625, 0.14794921875, 0.20361328125, 0.0758056640625, 0.0059814453125, 0.08685302734375, 0.0230712890625, 0.03192138671875, 0.069091796875, 0.09222412109375, 0.0206146240234375, 0...	embed
5439426_c1	5439426	prolog	1	(because in reality you shouldn't be able to attack one instance of an interaction twice). Then a new attack try is started. If an attack succeeds and the secret is leaked, a little info on how the attacker got the secret is written. tryToAttack(Secret) :- successfulRun(Init_1,Init_2,Init_3,RespGet_1,RespGet_2,RespGet...	(because in reality you shouldn't be able to attack one instance of an interaction twice). Then a new attack try is started. If an attack succeeds and the secret is leaked, a little info on how the attacker got the secret is written. tryToAttack(Secret) :- successfulRun(Init_1,Init_2,Init_3,RespGet_1,RespGet_2,RespGet...	[ -0.017822265625, 0.00494384765625, 0.01422119140625, 0.01531982421875, -0.010009765625, 0.013671875, -0.00157928466796875, 0.0035552978515625, 0.00109100341796875, -0.005828857421875, 0.0250244140625, 0.046630859375, -0.012939453125, 0.0177001953125, 0.032958984375, -0.0009384155273437...	[ 50081, 5608, 19048, 47, 52875, 1632, 110527, 182809, 186351, 194, 47009, 3525, 9790, 26859, 4263, 214493, 7, 23410, 95, 344, 10176, 3004, 3642, 56, 4163, 59121, 7763, 2310, 2594, 132, 237051, 15772, 65771, 163321, 4153, 217, 115187, 4, 304,...	[ 0.155517578125, 0.02435302734375, 0.0634765625, 0.0069580078125, 0.2666015625, 0.0731201171875, 0.149658203125, 0.207763671875, 0.196044921875, 0.0221710205078125, 0.024261474609375, 0.08013916015625, 0.1846923828125, 0.0889892578125, 0.0254058837890625, 0.1639404296875, 0.0004882812...	embed
40272699_c0	40272699	prolog	0	Title: Out of local stack error being thrown in list of lists Problem title: Out of local stack error being thrown in list of lists Tags: prolog Problem: Out of local stack error being thrown in list of lists My input: A list of lists with 0s and 1s. 0s being walkable blocks and 1s being walls. My starting point (1,1) ...	Out of local stack error being thrown in list of lists Out of local stack error being thrown in list of lists prolog Out Maze nth1 OldX OldY OldY-1 OldX-1 Path Out of local stack error being thrown in list of lists My input: A list of lists with 0s and 1s. 0s being walkable blocks and 1s being walls. My starting point ...	[ 0.01165771484375, 0.023681640625, -0.002685546875, 0.0247802734375, 0.00677490234375, 0.01397705078125, -0.0035858154296875, 0.010498046875, 0.01190185546875, -0.0478515625, 0.0186767578125, 0.0164794921875, 0.006439208984375, -0.0120849609375, 0.0172119140625, 0.00921630859375, -0.0...	[ 13538, 111, 4000, 177261, 18499, 8035, 104250, 23, 5303, 19, 502, 4867, 29678, 927, 418, 25074, 1542, 1723, 5759, 108421, 107730, 757, 106, 35691, 46389, 58982, 72134, 6275, 17727, 86658, 5036, 4527, 10461, 140992, 60875, 7514, 39958, 2046, ...	[ 0.1905517578125, 0.167236328125, 0.162841796875, 0.23779296875, 0.2255859375, 0.0230560302734375, 0.1524658203125, 0.07281494140625, 0.20556640625, 0.00250244140625, 0.1280517578125, 0.195556640625, 0.112060546875, 0.1392822265625, 0.0462646484375, 0.1212158203125, 0.13037109375, 0...	embed
21927188_c0	21927188	prolog	0	Title: Stack Trace Prolog Predicate Problem title: Stack Trace Prolog Predicate Tags: prolog, algorithm, backtracking, recursion Problem: Stack Trace Prolog Predicate I have a very simple min function written in Prolog, and I don't understand how it works. Code: min(E, [E]) :- write('case 1: '), write(E), nl. min(E, [E...	Stack Trace Prolog Predicate Stack Trace Prolog Predicate prolog algorithm backtracking recursion Stack Trace Prolog Predicate _L164 _G323 Stack Trace Prolog Predicate I have a very simple min function written in Prolog, and I don't understand how it works. Code: We've just started using Prolog in class, and I don't un...	[ 0.0194091796875, 0.00494384765625, -0.00543212890625, 0.01239013671875, -0.007049560546875, 0.0026397705078125, 0.00433349609375, -0.0010986328125, 0.00555419921875, -0.0196533203125, 0.0089111328125, 0.011474609375, -0.009521484375, -0.0159912109375, 0.0174560546875, 0.01519775390625,...	[ 6512, 2594, 4937, 329, 1250, 4867, 7145, 2063, 67, 502, 234873, 4420, 125728, 214, 195625, 1830, 154019, 363, 3742, 8781, 881, 32354, 59121, 2301, 18, 28219, 3642, 442, 43240, 28864, 18507, 151575, 5844, 50218, 1884, 28412, 63805, 7730, 98,...	[ 0.1156005859375, 0.08135986328125, 0.214599609375, 0.072509765625, 0.176513671875, 0.25390625, 0.1400146484375, 0.1741943359375, 0.03021240234375, 0.1552734375, 0.2083740234375, 0.1259765625, 0.238037109375, 0.006256103515625, 0.208740234375, 0.00128173828125, 0.1900634765625, 0.04...	embed
20624934_c0	20624934	prolog	0	Title: Checking a square of numbers in Prolog Problem title: Checking a square of numbers in Prolog Tags: prolog Problem: Checking a square of numbers in Prolog square([A1, A2, A3\|_], [B1, B2, B3\|_], [C1, C2, C3\|_]):- all_diff([A1, A2, A3, B1, B2, B3, C1, C2, C3]). squares([[]\|_]):- !. squares([[A1,A2,A3\|A4], [B1,B2,B3...	Checking a square of numbers in Prolog Checking a square of numbers in Prolog prolog Checking Prolog all_diff existence_error Checking a square of numbers in Prolog I'm getting a uncaught exception: error(existence_error(procedure,square/1),squares/1) - I'm new to Prolog so I'm not quite sure what this is saying (well,...	[ 0.01123046875, 0.002288818359375, 0.0186767578125, 0.0135498046875, -0.0267333984375, -0.013427734375, -0.0269775390625, 0.004638671875, -0.001434326171875, -0.00010395050048828125, 0.01422119140625, 0.00183868408203125, 0.0147705078125, -0.0145263671875, -0.0159912109375, -0.007873535...	[ 38679, 108047, 111, 101935, 1250, 4867, 502, 756, 152462, 116311, 188800, 23, 408, 46526, 131527, 18499, 232578, 11583, 7730, 44691, 46132, 8932, 38067, 1528, 7, 8560, 8305, 138, 363, 104192, 72134, 2663, 25737, 86991, 103136, 98567, 12765, 3...	[ 0.198974609375, 0.251953125, 0.04644775390625, 0.181640625, 0.17236328125, 0.25, 0.127685546875, 0.094970703125, 0.246337890625, 0.205810546875, 0.221923828125, 0.005767822265625, 0.002197265625, 0.003936767578125, 0.1617431640625, 0.1826171875, 0.1751708984375, 0.1409912109375, ...	embed
10655013_c0	10655013	prolog	0	Title: How to create global variable in prolog Problem title: How to create global variable in prolog Tags: prolog, list, variables, reusability, global Problem: How to create global variable in prolog I have a list that I create as follows: tab([(top,left),(top,middle),(top,right),(center,left),(center,middle), (cente...	How to create global variable in prolog How to create global variable in prolog prolog list variables reusability global How AllPos Line Column Tab List Element NewList How to create global variable in prolog I have a list that I create as follows: I wish to create a global variable AllPosition that is a tab. So I did ...	[ 0.0255126953125, 0.00811767578125, -0.0062255859375, -0.00008678436279296875, -0.0184326171875, -0.003875732421875, -0.009765625, 0.02734375, 0.02099609375, -0.0235595703125, 0.035400390625, 0.018310546875, 0.013916015625, -0.0107421875, 0.009521484375, 0.0067138671875, 0.00379943847...	[ 11249, 28282, 7964, 77336, 502, 4867, 23, 5303, 223, 41159, 3164, 7192, 7, 16777, 233987, 22193, 32036, 48325, 2356, 154663, 32599, 172, 1363, 20928, 7108, 2967, 32354, 53299, 80836, 87388, 1615, 184, 5908, 12830, 3525, 15490, 32786, 20697, ...	[ 0.039825439453125, 0.163818359375, 0.2066650390625, 0.302978515625, 0.130859375, 0.2210693359375, 0.0188140869140625, 0.136962890625, 0.0697021484375, 0.005401611328125, 0.1240234375, 0.1920166015625, 0.140625, 0.1160888671875, 0.1217041015625, 0.121337890625, 0.10345458984375, 0.1...	embed
24231179_c1	24231179	prolog	1	'), unix('cat model'), see(model), readModel(M), seen, displaySol(M), halt. var2num(T,N):- hash_term(T,Key), varNumber(Key,T,N),!. var2num(T,N):- retract(numVars(N0)), N is N0+1, assert(numVars(N)), hash_term(T,Key), assert(varNumber(Key,T,N)), assert( num2var(N,T) ), !. writeHeader:- numVars(N), numClauses(C), write('...	'), unix('cat model'), see(model), readModel(M), seen, displaySol(M), halt. var2num(T,N):- hash_term(T,Key), varNumber(Key,T,N),!. var2num(T,N):- retract(numVars(N0)), N is N0+1, assert(numVars(N)), hash_term(T,Key), assert(varNumber(Key,T,N)), assert( num2var(N,T) ), !. writeHeader:- numVars(N), numClauses(C), write('...	[ -0.0203857421875, 0.0032806396484375, -0.02001953125, 0.019775390625, -0.00164031982421875, 0.011962890625, -0.00180816650390625, -0.0052490234375, 0.01123046875, -0.041748046875, -0.0220947265625, 0.0021209716796875, 0.01544189453125, 0.0072021484375, -0.0003337860107421875, 0.0013809...	[ 242, 247, 51, 4084, 4460, 3299, 1957, 51734, 12301, 140290, 594, 51592, 44116, 102588, 58810, 5, 285, 304, 2606, 618, 839, 1556, 127, 32166, 162429, 18444, 26278, 38, 41499, 15390, 81827, 77495, 541, 83, 2389, 21748, 237, 33657, 1961, 132...	[ 0.07708740234375, 0.0748291015625, 0.177978515625, 0.1923828125, 0.280029296875, 0.321044921875, 0.2178955078125, 0.23828125, 0.1690673828125, 0.232177734375, 0.1075439453125, 0.2239990234375, 0.1451416015625, 0.18798828125, 0.203125, 0.0032958984375, 0.1549072265625, 0.13537597656...	embed
28684011_c0	28684011	prolog	0	Title: Why does using [H\|T] as a parameter instead of a normal variable cause my predicate to fail? Problem title: Why does using [H\|T] as a parameter instead of a normal variable cause my predicate to fail? Tags: prolog, list Problem: Why does using [H\|T] as a parameter instead of a normal variable cause my predicate ...	Why does using [H\|T] as a parameter instead of a normal variable cause my predicate to fail? Why does using [H\|T] as a parameter instead of a normal variable cause my predicate to fail? prolog list Why e.g Why does using [H\|T] as a parameter instead of a normal variable cause my predicate to fail? I'm creating a predic...	[ -0.00665283203125, 0.0167236328125, 0.00689697265625, 0.00183868408203125, -0.01422119140625, -0.006317138671875, -0.00799560546875, -0.0014190673828125, -0.0064697265625, -0.01055908203125, 0.017578125, -0.0087890625, -0.01226806640625, -0.01220703125, 0.00830078125, -0.00994873046875...	[ 44084, 17368, 841, 58745, 618, 237, 171859, 64457, 3638, 77336, 22304, 1653, 2063, 67, 35782, 502, 4867, 5303, 759, 47, 105233, 87388, 58735, 12830, 1542, 1723, 16401, 990, 7, 16750, 49146, 6496, 756, 74918, 1193, 1295, 61475, 214, 35405, ...	[ 0.1102294921875, 0.0909423828125, 0.15771484375, 0.1541748046875, 0.1807861328125, 0.036590576171875, 0.1956787109375, 0.0955810546875, 0.1102294921875, 0.20458984375, 0.08416748046875, 0.1678466796875, 0.206298828125, 0.123046875, 0.2125244140625, 0.1392822265625, 0.169921875, 0.1...	embed
35258273_c0	35258273	prolog	0	Title: Prolog: Recursion on a list with one one-time rule Problem title: Prolog: Recursion on a list with one one-time rule Tags: recursion, traveling-salesman, prolog Problem: Prolog: Recursion on a list with one one-time rule Most probably I couldn't properly phrase my search keywords. What I'm trying to do is to rec...	Prolog: Recursion on a list with one one-time rule Prolog: Recursion on a list with one one-time rule recursion traveling-salesman prolog Prolog Recursion List Sum Diff E1-E2 SoD Result Prolog: Recursion on a list with one one-time rule Most probably I couldn't properly phrase my search keywords. What I'm trying to do ...	[ -0.002593994140625, 0.014404296875, -0.0001544952392578125, 0.0255126953125, -0.013671875, 0.003997802734375, -0.010498046875, 0.01275634765625, 0.0208740234375, -0.037841796875, -0.006317138671875, 0.0047607421875, -0.0098876953125, 0.0177001953125, 0.018310546875, 0.0146484375, 0.0...	[ 1250, 4867, 165428, 42, 6889, 5303, 1632, 6032, 79986, 195625, 26983, 214, 7, 21183, 669, 502, 32036, 36335, 191144, 241, 20268, 647, 304, 1061, 397, 126684, 155965, 113860, 33938, 166117, 31577, 5844, 151575, 60212, 148390, 112820, 13695, 15...	[ 0.13916015625, 0.20654296875, 0.1630859375, 0.1607666015625, 0.09417724609375, 0.197998046875, 0.1248779296875, 0.1802978515625, 0.170166015625, 0.250244140625, 0.1314697265625, 0.0325927734375, 0.056640625, 0.1021728515625, 0.0853271484375, 0.0850830078125, 0.1781005859375, 0.2150...	embed
50541887_c0	50541887	prolog	0	Title: Prolog list of lists get all elements Problem title: Prolog list of lists get all elements Tags: head, list, prolog Problem: Prolog list of lists get all elements I have a lists of lists: decide([[1,2,-3],[-2,3],[6],[4]],K). I want to return all the possible solutions pressing ';'. The rule is to first return th...	Prolog list of lists get all elements Prolog list of lists get all elements head list prolog Prolog return_list_members Lit Prolog list of lists get all elements I have a lists of lists: I want to return all the possible solutions pressing ';'. The rule is to first return the values that its list has size 1. Then I wan...	[ 0.006805419921875, -0.00213623046875, 0.003021240234375, 0.00848388671875, -0.0146484375, -0.01080322265625, -0.0091552734375, -0.0078125, -0.006683349609375, -0.032958984375, 0.0262451171875, -0.0107421875, 0.00164031982421875, 0.00982666015625, 0.0089111328125, -0.00830078125, 0.03...	[ 1250, 4867, 5303, 111, 2046, 756, 80854, 10336, 502, 30646, 6562, 39, 27417, 27668, 7, 765, 3444, 47, 70, 7722, 51347, 24234, 214, 74, 79986, 5117, 142424, 1556, 13267, 615, 167785, 3501, 89536, 3642, 3332, 202, 69236, 678, 4734, 1632, ...	[ 0.1395263671875, 0.218505859375, 0.2044677734375, 0.047393798828125, 0.1055908203125, 0.149658203125, 0.207275390625, 0.175048828125, 0.113037109375, 0.2066650390625, 0.1820068359375, 0.0794677734375, 0.2008056640625, 0.1180419921875, 0.03094482421875, 0.010711669921875, 0.0800170898...	embed
53085672_c0	53085672	prolog	0	Title: swipl(prolog compiler) giver Undefined procedure error, but the rule is already defined Problem title: swipl(prolog compiler) giver Undefined procedure error, but the rule is already defined Tags: prolog, runtime-error, swi-prolog, dijkstra Problem: swipl(prolog compiler) giver Undefined procedure error, but the...	swipl(prolog compiler) giver Undefined procedure error, but the rule is already defined swipl(prolog compiler) giver Undefined procedure error, but the rule is already defined prolog runtime-error swi-prolog dijkstra Undefined edge1 Departure Arrival Dist Cost Time Arrival-Departure BusId Distance ERROR However swipl(p...	[ 0.0252685546875, 0.0152587890625, 0.0135498046875, 0.018798828125, -0.020751953125, -0.0140380859375, -0.0166015625, -0.00946044921875, -0.00762939453125, -0.051513671875, -0.004302978515625, -0.01202392578125, -0.0012359619140625, -0.0133056640625, 0.031982421875, 0.006561279296875, ...	[ 91, 2452, 2424, 3454, 4867, 9969, 34759, 16861, 79912, 5983, 297, 50491, 18499, 1284, 79986, 21771, 61924, 502, 11675, 6032, 188800, 151141, 2816, 121303, 418, 262, 2500, 205545, 6206, 63099, 19055, 25852, 568, 71, 154349, 151206, 52080, 9548...	[ 0.018951416015625, 0.1998291015625, 0.258056640625, 0.1651611328125, 0.2235107421875, 0.12841796875, 0.18017578125, 0.111572265625, 0.07763671875, 0.20361328125, 0.04791259765625, 0.1729736328125, 0.1920166015625, 0.011627197265625, 0.173828125, 0.108154296875, 0.2078857421875, 0.1...	embed
10889254_c1	10889254	prolog	1	,C) { count_good_beers_for_at(janus,godthaab,2) } Info: 1 tuple computed. As you can see, the counter doesn't return the pubs frequented but having 0 liked beers. I was planning to work around this by using a left outer join. DES> is_happy_at(D,P,Z) :- lj(serves(P,B), count_good_beers_for_at(D,Y,Z), (Y=P)) Info: Proces...	,C) { count_good_beers_for_at(janus,godthaab,2) } Info: 1 tuple computed. As you can see, the counter doesn't return the pubs frequented but having 0 liked beers. I was planning to work around this by using a left outer join. DES> is_happy_at(D,P,Z) :- lj(serves(P,B), count_good_beers_for_at(D,Y,Z), (Y=P)) Info: Proces...	[ 0.021240234375, -0.000396728515625, 0.0042724609375, 0.01458740234375, 0.0023040771484375, 0.034912109375, -0.01190185546875, -0.013671875, 0.011962890625, -0.03662109375, 0.01177978515625, -0.00049591064453125, 0.026611328125, 0.00897216796875, 0.004913330078125, 0.0048828125, 0.005...	[ 441, 54529, 70810, 372, 1314, 2472, 257, 2864, 223, 7803, 3238, 2055, 10461, 14048, 106, 370, 8705, 375, 7077, 105416, 18, 30646, 64792, 7, 131174, 19441, 757, 1884, 186, 58136, 4488, 10932, 25737, 1810, 56, 33284, 51552, 83, 157976, 397,...	[ 0.056365966796875, 0.18505859375, 0.162353515625, 0.170166015625, 0.1451416015625, 0.10205078125, 0.1561279296875, 0.09320068359375, 0.1412353515625, 0.000640869140625, 0.1075439453125, 0.0966796875, 0.062255859375, 0.151123046875, 0.083984375, 0.10455322265625, 0.1956787109375, 0....	embed
20083285_c0	20083285	prolog	0	Title: Get Index of an element/ element by index in List of Lists Problem title: Get Index of an element/ element by index in List of Lists Tags: loops, prolog, list, indexing Problem: Get Index of an element/ element by index in List of Lists How could I achieve something similar to the nth0/3 predicate on a list of l...	Get Index of an element/ element by index in List of Lists Get Index of an element/ element by index in List of Lists loops prolog list indexing Get Index List Lists nth0 Elem Idx Idx2 Tail Element Index1 Ind Get Index of an element/ element by index in List of Lists How could I achieve something similar to the nth0/3 ...	[ 0.012939453125, 0.01055908203125, -0.0028839111328125, -0.0021209716796875, -0.0196533203125, 0.01495361328125, 0.022216796875, 0.0011444091796875, 0.00811767578125, -0.0439453125, 0.00010251998901367188, -0.00101470947265625, -0.0264892578125, -0.00439453125, 0.004486083984375, 0.0006...	[ 20779, 31471, 111, 12830, 64, 390, 63262, 23, 32036, 40956, 502, 4867, 5303, 653, 927, 2389, 540, 195, 24799, 425, 1218, 379, 48325, 14489, 5809, 69307, 21373, 18113, 1653, 2063, 67, 1884, 19048, 14192, 2367, 83, 60892, 75414, 25632, 1328...	[ 0.122314453125, 0.294677734375, 0.1090087890625, 0.2158203125, 0.09393310546875, 0.1160888671875, 0.2744140625, 0.0711669921875, 0.212158203125, 0.18359375, 0.09600830078125, 0.14697265625, 0.2093505859375, 0.031280517578125, 0.12255859375, 0.1256103515625, 0.0557861328125, 0.10937...	embed
72933697_c0	72933697	prolog	0	Title: How to debug non-termination Problem title: How to debug non-termination Tags: prolog, clp, clpz Problem: How to debug non-termination I'm trying to implement n_factors/2 predicate that works in all directions. :- use_module(library(clpz)). n_factors(N, Fs) :- integer(N), N > 1, primes(Ps), n_factors0(N, Fs, Ps)...	How to debug non-termination How to debug non-termination prolog clp clpz How n_factors use_module n_factors0 primes0 How to debug non-termination I'm trying to implement n_factors/2 predicate that works in all directions. When I am issuing the following query I get: before the program moves on to exploring the realm o...	[ -0.0120849609375, 0.00238037109375, 0.0103759765625, 0.012939453125, 0.0015716552734375, -0.0054931640625, -0.0008087158203125, -0.0185546875, 0.003173828125, -0.036376953125, 0.02734375, -0.007415771484375, 0.0157470703125, -0.0012054443359375, 0.01422119140625, 0.0196533203125, 0.0...	[ 11249, 8, 85779, 351, 720, 91407, 47, 502, 4867, 33139, 254, 169, 653, 144810, 4527, 83279, 2389, 20809, 31577, 29479, 12477, 1653, 2063, 43240, 48225, 1159, 41, 8108, 1528, 25813, 98, 24649, 2773, 43257, 101935, 9655, 141956, 24233, 140363...	[ 0.0241241455078125, 0.156005859375, 0.268310546875, 0.1927490234375, 0.1649169921875, 0.177734375, 0.023223876953125, 0.10498046875, 0.1422119140625, 0.0157012939453125, 0.06573486328125, 0.0567626953125, 0.0706787109375, 0.197998046875, 0.045257568359375, 0.0906982421875, 0.06555175...	embed
1429887_c1	1429887	prolog	1	child(X,Z), married(Y,Z), not(child(X,Y)), male(X). grandparent(X,Y):- parent(X,Z), parent(Z,Y). grandmother(X,Y):- grandparent(X,Y), female(X). grandfather(X,Y):- grandparent(X,Y), male(X). grandchild(X,Y):- child(X,Z), child(Z,Y). married(X,Y):- wife(X,Y), female(X). married(X,Y):- husband(X,Y), male(X). married(i,w...	child(X,Z), married(Y,Z), not(child(X,Y)), male(X). grandparent(X,Y):- parent(X,Z), parent(Z,Y). grandmother(X,Y):- grandparent(X,Y), female(X). grandfather(X,Y):- grandparent(X,Y), male(X). grandchild(X,Y):- child(X,Z), child(Z,Y). married(X,Y):- wife(X,Y), female(X). married(X,Y):- husband(X,Y), male(X). married(i,w...	[ 0.006134033203125, 0.01104736328125, 0.0224609375, 0.0206298828125, -0.01708984375, 0.01165771484375, -0.0191650390625, 0.0115966796875, 0.004791259765625, -0.0164794921875, -0.00604248046875, -0.025390625, -0.0169677734375, 0.0029144287109375, 0.0142822265625, 0.010498046875, 0.0137...	[ 29041, 1542, 4, 1511, 247, 139505, 132, 1723, 959, 206, 38472, 11280, 194, 9963, 99547, 49129, 432, 9319, 117776, 1021, 58386, 71390, 434, 71, 42732, 78, 79298, 114015, 775, 19729, 420, 14, 29954, 85, 46526, 51, 11030, 7, 19441, 5915, 6...	[ 0.2021484375, 0.09326171875, 0.029083251953125, 0.13818359375, 0.0611572265625, 0.1964111328125, 0.020904541015625, 0.134521484375, 0.175048828125, 0.1007080078125, 0.1181640625, 0.111328125, 0.0435791015625, 0.1593017578125, 0.24658203125, 0.1474609375, 0.0599365234375, 0.12451171...	embed
44219018_c1	44219018	prolog	1	verify(does_not_fly), verify(swims), verify(is_black_and_white). albatross :- bird, verify(appears_in_story_Ancient_Mariner), verify(flys_well). /* classification rules */ mammal :- verify(has_hair), !. mammal :- verify(gives_milk). bird :- verify(has_feathers), !. bird :- verify(flys), verify(lays_eggs). carnivore :-...	verify(does_not_fly), verify(swims), verify(is_black_and_white). albatross :- bird, verify(appears_in_story_Ancient_Mariner), verify(flys_well). /* classification rules */ mammal :- verify(has_hair), !. mammal :- verify(gives_milk). bird :- verify(has_feathers), !. bird :- verify(flys), verify(lays_eggs). carnivore :-...	[ 0.01226806640625, 0.02685546875, 0.01031494140625, 0.0177001953125, -0.00083160400390625, -0.003143310546875, 0.00157928466796875, 0.012451171875, -0.004302978515625, -0.01129150390625, 0.0019073486328125, -0.01708984375, -0.00909423828125, -0.01129150390625, 0.00946044921875, 0.004028...	[ 493, 40383, 246, 90, 10869, 35121, 247, 2452, 4432, 164, 151675, 2940, 148477, 194, 45491, 49042, 7, 15772, 263, 71, 9007, 28575, 73, 86385, 7251, 45964, 63344, 1679, 19256, 1639, 40865, 91736, 21968, 141, 10557, 75512, 711, 96259, 12397, ...	[ 0.2138671875, 0.266845703125, 0.114013671875, 0.104736328125, 0.1806640625, 0.1929931640625, 0.01641845703125, 0.1041259765625, 0.0733642578125, 0.09033203125, 0.151611328125, 0.1246337890625, 0.1412353515625, 0.030609130859375, 0.17724609375, 0.25732421875, 0.1480712890625, 0.1245...	embed
50497151_c0	50497151	prolog	0	Title: make display matrix prolog tkeclipse Problem title: make display matrix prolog tkeclipse Tags: prolog, constraint-programming, eclipse-clp Problem: make display matrix prolog tkeclipse I am new to prolog and want to generate a display matrix from the below prolog code as given in the image The image below is gen...	make display matrix prolog tkeclipse make display matrix prolog tkeclipse prolog constraint-programming eclipse-clp pc1 cc1 hc2 pc2 hc3 pc4 cc4 part_family rm1 rm2 rm3 rm4 rm5 rm6 rm7 pc1_1 pc1_2 cc1_1 cc1_2 hc2_1 hc2_2 pc2_1 hc3_1 pc4_1 pc4_2 cc4_1 pr1 pr2 pr3 pr4 pr5 pr6 cc2 cc3 cc11 cc12 A:L B:M Active C:N solve_dcs...	[ 0.026611328125, -0.0047607421875, 0.0038299560546875, 0.011474609375, 0.00543212890625, -0.01312255859375, -0.041748046875, 0.0079345703125, -0.01031494140625, 0.00787353515625, -0.007720947265625, -0.0218505859375, 0.0020751953125, 0.000476837158203125, -0.0030975341796875, 0.00010538...	[ 3249, 44116, 50944, 425, 502, 4867, 35640, 106371, 184, 158, 2816, 4288, 28966, 28, 26775, 36719, 418, 10060, 304, 1096, 363, 617, 6, 2831, 454, 212122, 39, 758, 910, 1690, 966, 238, 4083, 1662, 62, 12, 866, 594, 88441, 839, 86869, 71...	[ 0.112060546875, 0.216796875, 0.2196044921875, 0.1392822265625, 0.1602783203125, 0.21826171875, 0.1448974609375, 0.212890625, 0.156982421875, 0.0926513671875, 0.2020263671875, 0.136962890625, 0.1546630859375, 0.0096435546875, 0.1453857421875, 0.099853515625, 0.032958984375, 0.034545...	embed
55241006_c0	55241006	prolog	0	Title: Prolog the cheapest path Problem title: Prolog the cheapest path Tags: path, prolog Problem: Prolog the cheapest path I have to do a Prolog app which have to find the cheapest path, the fastest path, the cheapest with max time arrival, the fastest with max price. I write a little but I do not know how to find th...	Prolog the cheapest path Prolog the cheapest path path prolog Prolog Path Visited Nodes Node path_cost aggregate_all Cost path_min_cost Min Prolog the cheapest path I have to do a Prolog app which have to find the cheapest path, the fastest path, the cheapest with max time arrival, the fastest with max price. I write a...	[ 0.0174560546875, 0.00141143798828125, -0.00726318359375, 0.00543212890625, -0.0023193359375, 0.0125732421875, -0.0111083984375, -0.0201416015625, 0.01123046875, -0.0703125, -0.004638671875, 0.0166015625, -0.01495361328125, 0.0091552734375, 0.0030517578125, -0.01300048828125, -0.00518...	[ 1250, 4867, 70, 64720, 525, 60875, 502, 108421, 98684, 297, 438, 988, 112, 587, 271, 197564, 13, 5584, 63099, 1249, 4211, 765, 54, 4027, 7413, 4271, 18389, 1733, 30780, 27167, 33022, 10176, 959, 3714, 64333, 4488 ]	[ 0.1763916015625, 0.26708984375, 0.045013427734375, 0.2158203125, 0.1505126953125, 0.2259521484375, 0.119873046875, 0.181640625, 0.1483154296875, 0.0259552001953125, 0.1224365234375, 0.09466552734375, 0.080322265625, 0.09521484375, 0.0589599609375, 0.123291015625, 0.04449462890625, ...	embed
56310184_c1	56310184	prolog	1	2): ?- Year in 1990..2005,leap_year1(Year),indomain(Year). Year = 2000. ?- Year in 1990..2005,leap_year2(Year),indomain(Year). Year = 1992 ; Year = 1996 ; Year = 2004. As you can see, neither query correctly generates the full sequence of leap years (1992, 1996, 2000, 2004). Further, the following queries around the ye...	2): ?- Year in 1990..2005,leap_year1(Year),indomain(Year). Year = 2000. ?- Year in 1990..2005,leap_year2(Year),indomain(Year). Year = 1992 ; Year = 1996 ; Year = 2004. As you can see, neither query correctly generates the full sequence of leap years (1992, 1996, 2000, 2004). Further, the following queries around the ye...	[ -0.005828857421875, -0.006317138671875, 0.004730224609375, 0.00848388671875, 0.0023345947265625, 0.023681640625, -0.006591796875, -0.01422119140625, 0.00115966796875, -0.006866455078125, -0.017822265625, 0.01141357421875, -0.01226806640625, -0.004547119140625, 0.0235595703125, 0.002655...	[ 4958, 705, 42552, 23, 96145, 32096, 133, 2631, 46799, 418, 69085, 147, 36735, 24931, 52489, 304, 12839, 11891, 44211, 1957, 2725, 9319, 41, 1294, 26785, 139392, 4393, 40, 944, 95, 5369, 77407, 88922, 4821, 10484, 10932, 6602, 33418, 2843, ...	[ 0.050750732421875, 0.042388916015625, 0.144775390625, 0.0635986328125, 0.1937255859375, 0.203857421875, 0.10028076171875, 0.20703125, 0.1951904296875, 0.054840087890625, 0.10443115234375, 0.081787109375, 0.047760009765625, 0.21240234375, 0.2080078125, 0.06256103515625, 0.149047851562...	embed
24714985_c0	24714985	prolog	0	Title: size of tree using accumulator Problem title: size of tree using accumulator Tags: tree, accumulator, prolog Problem: size of tree using accumulator I am tryin to learn prolog and got stuck in one of the toy example. binary_tree is defined as: The term '-' (the minus symbol) represents the empty tree. The term t...	size of tree using accumulator size of tree using accumulator tree accumulator prolog accumulator binary_tree Tree Call _G10307 _G10422 _G10435 Exit _G10437 _G10438 _G10440 _G10441 size of tree using accumulator I am tryin to learn prolog and got stuck in one of the toy example. binary_tree is defined as: now Im trying...	[ 0.0250244140625, -0.0000438690185546875, 0.0098876953125, -0.0108642578125, 0.0020599365234375, -0.00421142578125, -0.0206298828125, 0.019287109375, -0.006195068359375, -0.047607421875, 0.0260009765625, -0.00023555755615234375, 0.003936767578125, 0.0037078857421875, 0.047119140625, -0....	[ 13267, 53201, 17368, 183278, 1290, 502, 4867, 2394, 6635, 62600, 101344, 26265, 63620, 8368, 66947, 4015, 123141, 5443, 217, 152719, 149988, 141929, 167819, 30698, 179933, 72713, 27781, 61924, 31577, 33022, 1653, 2063, 62731, 13, 839, 7413, 111...	[ 0.1832275390625, 0.222900390625, 0.110595703125, 0.222412109375, 0.158935546875, 0.105224609375, 0.1611328125, 0.1531982421875, 0.0986328125, 0.2237548828125, 0.207275390625, 0.1240234375, 0.111083984375, 0.09228515625, 0.0618896484375, 0.0435791015625, 0.0859375, 0.078125, 0.032...	embed
25215654_c0	25215654	prolog	0	Title: First order logic in practice, how to deal with undecidablity? Problem title: First order logic in practice, how to deal with undecidablity? Tags: computation, decidable, logic, prolog Problem: First order logic in practice, how to deal with undecidablity? I am very new to these things. Hope this is not a very n...	First order logic in practice, how to deal with undecidablity? First order logic in practice, how to deal with undecidablity? computation decidable logic prolog First First order logic in practice, how to deal with undecidablity? I am very new to these things. Hope this is not a very naive question. I tried the followi...	[ 0.0260009765625, 0.002838134765625, 0.0162353515625, 0.010498046875, -0.0031280517578125, 0.0096435546875, 0.00830078125, 0.00347900390625, -0.0008087158203125, -0.034423828125, -0.0029754638671875, 0.006439208984375, -0.00482177734375, 0.0166015625, -0.0021820068359375, -0.00260925292...	[ 23972, 12989, 62775, 41361, 3642, 47, 35142, 678, 9232, 24750, 7121, 939, 23, 181135, 8, 2661, 502, 4867, 4552, 3525, 37842, 25632, 26168, 1250, 62, 148525, 335, 34475, 29568, 87, 151575, 17378, 563, 7842, 9127, 9655, 15400, 3038, 959, 14...	[ 0.1297607421875, 0.1722412109375, 0.2061767578125, 0.1798095703125, 0.06048583984375, 0.0166473388671875, 0.1572265625, 0.159423828125, 0.1441650390625, 0.1986083984375, 0.1715087890625, 0.1385498046875, 0.02801513671875, 0.1209716796875, 0.0897216796875, 0.115234375, 0.1407470703125...	embed

37938384_c0

37938384

prolog

0

Title: convert comment string to an ASCII character list in sicstus-prolog Problem title: convert comment string to an ASCII character list in sicstus-prolog Tags: prolog, sicstus-prolog, unix Problem: convert comment string to an ASCII character list in sicstus-prolog currently I am working on comparison between SICSt...

convert comment string to an ASCII character list in sicstus-prolog convert comment string to an ASCII character list in sicstus-prolog prolog sicstus-prolog unix ASCII pr_ua_sfochi Response CHI Q9.30 SFO NUC2189.76END ROE1.0 USD ZPSFOCHI XF4.50SFO4.5 fua2sfs fic_ticketinfo cat35 cat35info Transaction static.static.ser...

[ 0.011474609375, -0.005767822265625, -0.0159912109375, 0.0002918243408203125, -0.01348876953125, 0.006072998046875, 0.0023956298828125, 0.0133056640625, -0.006622314453125, 0.00958251953125, 0.007110595703125, 0.00970458984375, 0.00439453125, -0.000598907470703125, -0.01708984375, -0.00...

[ 96760, 6868, 79315, 47, 125429, 10001, 62816, 5303, 26536, 18253, 3454, 4867, 142, 502, 51, 4083, 3116, 3584, 1861, 92748, 62455, 2396, 1126, 1197, 51980, 18057, 142180, 11835, 39015, 102107, 19052, 9059, 50620, 2525, 104867, 17447, 20941, 14...

[ 0.145751953125, 0.2384033203125, 0.2252197265625, 0.0673828125, 0.117431640625, 0.228759765625, 0.179443359375, 0.176025390625, 0.09912109375, 0.2147216796875, 0.105224609375, 0.18212890625, 0.00836181640625, 0.1143798828125, 0.035491943359375, 0.0261077880859375, 0.10498046875, 0....

embed

77466582_c0

77466582

prolog

0

Title: Lion and Unicorn with Prolog SAT Solver Problem title: Lion and Unicorn with Prolog SAT Solver Tags: prolog, sat Problem: Lion and Unicorn with Prolog SAT Solver Would a Prolog SAT solver have an advantage in solving this riddle: When Alice entered the forest of forgetfulness, she did not forget everything, only...

Lion and Unicorn with Prolog SAT Solver Lion and Unicorn with Prolog SAT Solver prolog sat Lion Unicorn Prolog SAT Solver Lion and Unicorn with Prolog SAT Solver Would a Prolog SAT solver have an advantage in solving this riddle: Performance advantage over a solution like here (Free Access): The lion and the unicorn me...

[ 0.011962890625, -0.005401611328125, -0.00191497802734375, 0.01165771484375, -0.0137939453125, -0.0157470703125, 0.01104736328125, 0.0030364990234375, -0.00958251953125, -0.048583984375, -0.01031494140625, 0.015869140625, -0.0240478515625, 0.00897216796875, 0.00921630859375, 0.005676269...

[ 82209, 136, 11789, 10517, 19, 678, 1250, 4867, 75210, 6678, 814, 502, 11736, 154559, 10, 3115, 765, 142, 92940, 23, 6496, 903, 31351, 19298, 94030, 645, 29806, 1884, 3688, 81437, 40266, 581, 45486, 70, 60347, 42, 435, 10514, 47510, 112297...

[ 0.210693359375, 0.1707763671875, 0.1177978515625, 0.2130126953125, 0.1307373046875, 0.1356201171875, 0.163330078125, 0.2236328125, 0.226318359375, 0.178466796875, 0.2156982421875, 0.1124267578125, 0.1466064453125, 0.0814208984375, 0.0855712890625, 0.1806640625, 0.044769287109375, 0...

embed

78401940_c1

78401940

prolog

1

in some order; one of these films is Tower of London. The difference between the numbers of the screen on which Newton’s Laws and Vulture Gulch are playing is the same as the difference between the numbers of screen on which the Gentleman and Tower of London are showing. We use the variables Brisbane, Ellipsis, Frostf...

[ 0.00872802734375, 0.0108642578125, -0.002227783203125, 0.01092529296875, 0.0030364990234375, -0.01416015625, -0.0115966796875, 0.0079345703125, 0.0157470703125, 0.006195068359375, -0.0064697265625, -0.016845703125, 0.0205078125, 0.0164794921875, -0.01068115234375, 0.000774383544921875,...

[ 3060, 12989, 1632, 6097, 54180, 83, 68718, 111, 9020, 60212, 17721, 101935, 70, 49119, 145076, 26, 7, 36293, 136, 48138, 6644, 16965, 206, 75169, 5701, 44704, 133, 669, 141377, 1401, 4527, 77336, 15640, 36012, 540, 150, 74988, 166238, 73702...

[ 0.0144500732421875, 0.113525390625, 0.0369873046875, 0.03826904296875, 0.181640625, 0.056365966796875, 0.223876953125, 0.2110595703125, 0.2060546875, 0.176513671875, 0.038238525390625, 0.1395263671875, 0.03948974609375, 0.2158203125, 0.2109375, 0.1019287109375, 0.06732177734375, 0....

embed

16795386_c0

16795386

prolog

0

Title: Why this SPARQL query don't work into Prolog? Problem title: Why this SPARQL query don't work into Prolog? Tags: prolog, sparql, semantic-web Problem: Why this SPARQL query don't work into Prolog? I am trying to integrate SPARQL queries into Prolog program (I am using SWI-Prolog) To test it I am doing ...

Why this SPARQL query don't work into Prolog? Why this SPARQL query don't work into Prolog? prolog sparql semantic-web Why SPARQL Prolog Why this SPARQL query don't work into Prolog? I am trying to integrate SPARQL queries into Prolog program (I am using SWI-Prolog) To test it I am doing the following operati...

[ -0.002960205078125, 0.031982421875, 0.000492095947265625, 0.0272216796875, -0.0031585693359375, 0.00244140625, -0.01190185546875, -0.0007781982421875, 0.00156402587890625, -0.058837890625, 0.00726318359375, -0.003570556640625, -0.0096435546875, -0.00046539306640625, 0.0120849609375, -0...

[ 44084, 903, 159, 60436, 2737, 866, 41, 1294, 2301, 3768, 18, 4488, 3934, 1250, 4867, 502, 27148, 99247, 484, 109109, 14051, 31577, 78779, 10484, 1528, 38969, 10752, 3034, 25632, 41018, 188, 128019, 71924, 75101, 83279, 2844, 5765, 26404, 22...

[ 0.1124267578125, 0.0908203125, 0.04168701171875, 0.171875, 0.1981201171875, 0.18408203125, 0.176025390625, 0.136474609375, 0.06707763671875, 0.05987548828125, 0.1357421875, 0.159912109375, 0.1435546875, 0.1822509765625, 0.2254638671875, 0.1031494140625, 0.1729736328125, 0.219726562...

embed

55250974_c0

55250974

prolog

0

Title: Debugging a piece of codes in prolog Problem title: Debugging a piece of codes in prolog Tags: prolog Problem: Debugging a piece of codes in prolog There a piece of codes in Prolog, which is used to convert a txt file to 4 lists( 3 1D_lists one each line, last one is 2D_list, one sublist each line of rest lines....

Debugging a piece of codes in prolog Debugging a piece of codes in prolog prolog Str Debugging read_line_to_string Line Stream split_string L_list1 Split atom_number Conver Line1 L_list2 FQty Line2 L_list3 WQty read_Costs Costs at_end_of_stream Line3 L_list4 Costs1 Costs2 Debugging a piece of codes in prolog There a pi...

[ 0.01422119140625, -0.01165771484375, -0.0035247802734375, 0.0186767578125, -0.0017547607421875, -0.0025787353515625, -0.0027008056640625, 0.0113525390625, 0.006378173828125, -0.009765625, -0.0062255859375, -0.0167236328125, -0.0010833740234375, 0.00007486343383789062, 0.0169677734375, ...

[ 262, 978, 36659, 63847, 18151, 502, 4867, 111, 23351, 12301, 2256, 188, 91693, 16777, 115061, 65450, 339, 6562, 46474, 34627, 2606, 814, 2737, 939, 5510, 63099, 3611, 86429, 617, 1250, 11814, 96760, 124326, 11435, 47, 201, 5303, 138, 397, ...

[ 0.1326904296875, 0.2276611328125, 0.05889892578125, 0.1400146484375, 0.2430419921875, 0.1505126953125, 0.2364501953125, 0.01678466796875, 0.1136474609375, 0.1298828125, 0.14013671875, 0.12451171875, 0.1729736328125, 0.12109375, 0.151123046875, 0.11474609375, 0.0391845703125, 0.1424...

embed

40294688_c0

40294688

prolog

0

Title: Operations on lists in Prolog Problem title: Operations on lists in Prolog Tags: prolog, list Problem: Operations on lists in Prolog I'm new to Prolog and what I want to achieve is to perform an operation like append/3 over two lists that are saved in my program. I don't need to open swi-prolog and type append([...

Operations on lists in Prolog Operations on lists in Prolog prolog list Operations Prolog personal_union personal_list Operations on lists in Prolog I'm new to Prolog and what I want to achieve is to perform an operation like append/3 over two lists that are saved in my program. I don't need to open swi-prolog and type...

[ 0.01202392578125, 0.0264892578125, 0.01190185546875, 0.01275634765625, -0.003021240234375, 0.003997802734375, -0.0033721923828125, 0.01251220703125, 0.033935546875, -0.05517578125, 0.016357421875, -0.01031494140625, -0.01806640625, 0.01556396484375, 0.0162353515625, -0.01171875, 0.02...

[ 102203, 98, 5303, 7, 1250, 4867, 502, 3357, 87046, 6562, 3525, 3444, 69307, 51339, 41018, 114689, 71, 18113, 645, 6626, 57, 1528, 9803, 2452, 3454, 10644, 170, 92, 1542, 113054, 1193, 1369, 3871, 3996, 7722, 37064, 31, 2424, 11435, 79986,...

[ 0.1949462890625, 0.1048583984375, 0.224365234375, 0.049468994140625, 0.163818359375, 0.23486328125, 0.10528564453125, 0.0753173828125, 0.137451171875, 0.19140625, 0.00152587890625, 0.004638671875, 0.03662109375, 0.079345703125, 0.1929931640625, 0.141357421875, 0.091552734375, 0.180...

embed

27317069_c1

27317069

prolog

1

First|Rest], Min, [First|As]) :- !, min_prefix(Rest, Min, As). min_prefix(_, _, []). ?- find_min_3(Min, As). Min = 2, As = [b, e, h]. Finally, to the question(s): Can I do this directly with library(aggregate)? It feels like it should be possible.... Or is there a predicate like std::partition_point from the C++ standa...

[ -0.000087738037109375, -0.0264892578125, 0.0130615234375, -0.00994873046875, -0.031982421875, -0.006134033203125, 0.01129150390625, -0.0137939453125, 0.006500244140625, -0.022705078125, 0.0087890625, 0.0250244140625, 0.007293701171875, -0.0023040771484375, 0.017578125, 0.00095748901367...

[ 23972, 58745, 1052, 525, 4211, 207263, 19659, 268, 15772, 711, 881, 4692, 55923, 1301, 7413, 1249, 363, 59076, 2203, 116, 275, 28, 1096, 5, 9655, 4171, 87, 54, 903, 105237, 678, 35773, 1294, 132, 197564, 12319, 1884, 442, 5608, 7722, 27...

[ 0.2069091796875, 0.045074462890625, 0.197021484375, 0.2109375, 0.2802734375, 0.1348876953125, 0.1949462890625, 0.0970458984375, 0.0316162109375, 0.04229736328125, 0.2425537109375, 0.07574462890625, 0.156982421875, 0.1629638671875, 0.180908203125, 0.259521484375, 0.1510009765625, 0....

embed

54971608_c1

54971608

prolog

1

), (J is N-I+1, nth1(I,X,A), nth1(J,Y,A))). X = [1, 2, 3, 4, 5], N = 5, Y = [5, 4, 3, 2, 1]. Subset: subset(X, Y) :- forany(A, {X,Y}, member(A,X), member(A, Y)). A funny way to generate all permutations of a list without duplicates: permutation(X, Y) :- length(X, N), length(Y, N), subset(X, Y). ?- permutation([1,2,3],X...

[ 0.0010833740234375, 0.013916015625, 0.03173828125, -0.0036163330078125, -0.009033203125, -0.00946044921875, -0.007568359375, -0.00469970703125, 0.0235595703125, -0.006927490234375, -0.00142669677734375, 0.025634765625, 0.0113525390625, -0.0042724609375, -0.0244140625, -0.0079345703125,...

[ 247, 1375, 83, 541, 9, 568, 21748, 653, 927, 418, 1542, 284, 1723, 32149, 1193, 2203, 68252, 116, 138, 201, 190, 990, 758, 106, 8273, 3509, 1614, 15772, 100, 4848, 32786, 62, 99864, 3917, 139392, 756, 117, 14311, 21094, 111, 5303, 154...

[ 0.058807373046875, 0.180419921875, 0.0780029296875, 0.118896484375, 0.00982666015625, 0.0775146484375, 0.1107177734375, 0.0181427001953125, 0.1165771484375, 0.037200927734375, 0.1431884765625, 0.049407958984375, 0.0975341796875, 0.023681640625, 0.17041015625, 0.0902099609375, 0.03466...

embed

55412458_c1

55412458

prolog

1

"invent" empty lists in the first argument it would mean an infinite set of solutions for anything in the first argument. Although my full program has other constraints to prevent this, I can understand why flatten might not want to accomodate it. I can account for the edge cases (pun intended) by matching every permu...

[ -0.00537109375, 0.007293701171875, 0.00579833984375, 0.01470947265625, -0.01507568359375, 0.00634765625, -0.0185546875, -0.00994873046875, 0.0157470703125, 0.0013885498046875, -0.004241943359375, -0.00019359588623046875, 0.017333984375, -0.0059814453125, 0.0014801025390625, 0.024047851...

[ 132894, 201505, 5303, 7, 5117, 10750, 29459, 54241, 5423, 51347, 23937, 4393, 1528, 2816, 56282, 28219, 49878, 510, 13648, 3444, 52621, 17489, 831, 15426, 100, 121303, 50218, 179140, 14858, 11907, 117, 561, 2837, 17043, 418, 571, 1126, 866, ...

[ 0.200927734375, 0.203125, 0.2135009765625, 0.01727294921875, 0.0958251953125, 0.2054443359375, 0.034423828125, 0.09393310546875, 0.026153564453125, 0.1605224609375, 0.06317138671875, 0.00830078125, 0.10491943359375, 0.0714111328125, 0.0787353515625, 0.00439453125, 0.215087890625, 0...

embed

7580859_c0

7580859

prolog

0

Title: Prolog programming - path way to a solution Problem title: Prolog programming - path way to a solution Tags: prolog Problem: Prolog programming - path way to a solution I am studying prolog at university and facing some problems. What I already found out is just solution to a problem. However, I'm more intereste...

Prolog programming - path way to a solution Prolog programming - path way to a solution prolog Prolog List Flattened Item Tail is_list Prolog programming - path way to a solution I am studying prolog at university and facing some problems. What I already found out is just solution to a problem. However, I'm more intere...

[ 0.01080322265625, 0.0223388671875, 0.0106201171875, 0.0033111572265625, -0.00494384765625, 0.0142822265625, 0.0002918243408203125, -0.007293701171875, 0.01190185546875, -0.023681640625, 0.0140380859375, -0.015380859375, -0.0194091796875, 0.0146484375, 0.0019378662109375, 0.006256103515...

[ 1250, 4867, 56037, 449, 60875, 3917, 47, 29806, 502, 32036, 106516, 510, 297, 78426, 1218, 379, 83, 6562, 10, 35187, 214, 152363, 7808, 44402, 21771, 14037, 1810, 1660, 2967, 60892, 5351, 2046, 6044, 115992, 44457, 4358, 27781, 11757, 678, ...

[ 0.1771240234375, 0.23681640625, 0.1502685546875, 0.09112548828125, 0.1739501953125, 0.14306640625, 0.1351318359375, 0.1884765625, 0.1243896484375, 0.1971435546875, 0.2183837890625, 0.21435546875, 0.06689453125, 0.1875, 0.169189453125, 0.12548828125, 0.114013671875, 0.212158203125, ...

embed

34242458_c0

34242458

prolog

0

Title: Prolog receiving Json post Problem title: Prolog receiving Json post Tags: prolog, swi-prolog, post, http, json Problem: Prolog receiving Json post This is my first question in stackoverflow so, bear with me. I'm tring to build a simple Prolog api that receives json posts and after processing them, sends another...

Prolog receiving Json post Prolog receiving Json post prolog swi-prolog post http json Prolog Json Request http_read_json_dict DictIn DictOut reply_json ERROR atom_codes Arguments Prolog receiving Json post This is my first question in stackoverflow so, bear with me. I'm tring to build a simple Prolog api that receives...

[ 0.00860595703125, 0.0291748046875, 0.00372314453125, 0.0203857421875, -0.011962890625, 0.015625, 0.00982666015625, 0.01226806640625, -0.00628662109375, -0.045654296875, 0.0235595703125, 0.0235595703125, -0.036865234375, -0.011962890625, 0.0257568359375, 0.013427734375, -0.00077819824...

[ 1250, 4867, 217063, 821, 1681, 1305, 502, 2452, 3454, 1621, 1647, 853, 75616, 39116, 170, 61669, 60897, 4153, 79858, 75836, 151206, 34627, 40899, 112140, 5117, 9655, 177261, 5465, 118664, 45367, 8781, 31470, 53299, 32323, 25379, 15700, 4420, ...

[ 0.1610107421875, 0.26513671875, 0.0860595703125, 0.1253662109375, 0.21533203125, 0.1304931640625, 0.078369140625, 0.1859130859375, 0.13330078125, 0.042022705078125, 0.1024169921875, 0.055267333984375, 0.1793212890625, 0.10101318359375, 0.03704833984375, 0.09942626953125, 0.0317993164...

embed

19558041_c0

19558041

prolog

0

Title: Proper Subset - Prolog Problem title: Proper Subset - Prolog Tags: prolog, subset Problem: Proper Subset - Prolog I am attempting to write a program that takes two lists as input and checks for proper subset. I started with: proper([A],[]). proper([],[A]). proper([A|T1],[A|T2]) :- proper(T1,T2). This works perfe...

Proper Subset - Prolog Proper Subset - Prolog prolog subset Proper Subset Prolog Yes Proper Subset - Prolog I am attempting to write a program that takes two lists as input and checks for proper subset. I started with: This works perfectly fine for inputs in the exact same order. for instance: But doesn't for inputs su...

[ 0.00665283203125, -0.003875732421875, 0.0194091796875, 0.0140380859375, -0.0186767578125, 0.004730224609375, -0.0096435546875, -0.005828857421875, 0.017578125, 0.006805419921875, 0.01361083984375, 0.015869140625, -0.0159912109375, -0.002593994140625, 0.0181884765625, -0.005035400390625...

[ 1250, 1264, 8273, 3509, 4867, 502, 1614, 32635, 20, 81887, 33022, 1528, 51776, 6626, 5303, 107730, 12765, 100, 27798, 43240, 169123, 5885, 24763, 5701, 12989, 22027, 18, 32354, 23, 2811, 40383, 18151, 959, 2967, 17932, 70731, 17357, 756, 43...

[ 0.1661376953125, 0.2052001953125, 0.2239990234375, 0.2435302734375, 0.2275390625, 0.1314697265625, 0.21923828125, 0.04998779296875, 0.00469970703125, 0.04107666015625, 0.0653076171875, 0.1136474609375, 0.021484375, 0.09564208984375, 0.16552734375, 0.1517333984375, 0.137451171875, 0...

embed

67249600_c0

67249600

prolog

0

Title: Is there a more efficient way to manage large data than using facts? Problem title: Is there a more efficient way to manage large data than using facts? Tags: prolog Problem: Is there a more efficient way to manage large data than using facts? I finished working on an AI project that manages long strings (About ...

Is there a more efficient way to manage large data than using facts? Is there a more efficient way to manage large data than using facts? prolog facts INDEX NAMESTRING1 STRING1 NAMESTRING2 STRING2 FITNESS Is there a more efficient way to manage large data than using facts? I finished working on an AI project that manag...

[ 0.0235595703125, 0.010986328125, -0.00142669677734375, 0.035400390625, -0.01123046875, 0.00604248046875, 0.0206298828125, 0.01409912109375, 0.0216064453125, -0.04248046875, 0.029052734375, -0.00958251953125, 0.010009765625, -0.01251220703125, 0.0036163330078125, 0.0022125244140625, 0...

[ 2071, 2685, 10, 1286, 93766, 3917, 47, 111240, 21334, 2053, 3501, 17368, 15824, 7, 502, 4867, 51383, 26939, 75033, 21828, 90345, 418, 46549, 23186, 304, 175212, 36321, 122799, 20697, 38730, 13452, 4989, 79315, 65964, 124850, 31089, 13538, 400...

[ 0.048980712890625, 0.037567138671875, 0.013671875, 0.12841796875, 0.25537109375, 0.1107177734375, 0.053558349609375, 0.255126953125, 0.1883544921875, 0.203125, 0.0748291015625, 0.1126708984375, 0.2451171875, 0.1263427734375, 0.1331787109375, 0.1844482421875, 0.1431884765625, 0.1573...

embed

40792454_c0

40792454

prolog

0

Title: How to rewrite a orolog predicate so that it can list all possible answers Problem title: How to rewrite a orolog predicate so that it can list all possible answers Tags: prolog Problem: How to rewrite a orolog predicate so that it can list all possible answers The predicate diff(A, B, C) , should be true when l...

How to rewrite a orolog predicate so that it can list all possible answers How to rewrite a orolog predicate so that it can list all possible answers prolog How in_list How to rewrite a orolog predicate so that it can list all possible answers The predicate diff(A, B, C) , should be true when list C consists of element...

[ -0.0137939453125, 0.0086669921875, 0.0230712890625, 0.009521484375, -0.01611328125, 0.006805419921875, -0.014404296875, 0.01544189453125, 0.01263427734375, -0.0130615234375, 0.000682830810546875, 0.01116943359375, 0.01275634765625, 0.017578125, 0.01287841796875, 0.00811767578125, 0.0...

[ 11249, 456, 434, 18781, 707, 14071, 1653, 2063, 67, 5303, 756, 7722, 35166, 221, 831, 502, 4867, 23, 6562, 71337, 284, 335, 313, 5608, 29568, 58055, 80854, 62, 18, 10617, 2967, 12765, 26785, 705, 116, 138, 201, 33579, 122101, 106, 37170...

[ 0.01324462890625, 0.1417236328125, 0.1448974609375, 0.230712890625, 0.150390625, 0.2342529296875, 0.186767578125, 0.218505859375, 0.10400390625, 0.1732177734375, 0.09930419921875, 0.1923828125, 0.1885986328125, 0.024658203125, 0.030731201171875, 0.111572265625, 0.189208984375, 0.07...

embed

13170401_c0

13170401

prolog

0

Title: Find all possible paths without revisiting Problem title: Find all possible paths without revisiting Tags: prolog Problem: Find all possible paths without revisiting I need a predicate routing which gives all the cities between start & end. For example: path(chicago,atlanta). path(chicago,milwaukee). path(milwau...

Find all possible paths without revisiting Find all possible paths without revisiting prolog Find FromCity ToCity Connections FromConnection ToConnection Find all possible paths without revisiting I need a predicate routing which gives all the cities between start & end. For example: I have tried this, and keep coming ...

[ -0.00897216796875, 0.0113525390625, 0.01019287109375, 0.00482177734375, -0.0086669921875, 0.01385498046875, -0.0196533203125, -0.000644683837890625, 0.0103759765625, -0.0654296875, -0.0003070831298828125, -0.0006866455078125, -0.0045166015625, 0.015869140625, -0.00154876708984375, 0.01...

[ 26040, 756, 7722, 60875, 7, 15490, 15226, 172, 1916, 502, 4867, 28090, 115411, 717, 62448, 17514, 235603, 1830, 87, 3871, 1653, 2063, 67, 22629, 76199, 70, 162708, 17721, 4034, 619, 3564, 27781, 765, 37842, 903, 13695, 38162, 4420, 47, 12...

[ 0.1558837890625, 0.121337890625, 0.17724609375, 0.1944580078125, 0.093017578125, 0.14111328125, 0.09393310546875, 0.08795166015625, 0.1414794921875, 0.12939453125, 0.175048828125, 0.122802734375, 0.08074951171875, 0.107177734375, 0.1190185546875, 0.044281005859375, 0.109375, 0.0426...

embed

75898250_c1

75898250

prolog

1

-Prolog comes with ABSOLUTELY NO WARRANTY. This is free software. Please run ?- license. for legal details. For online help and background, visit https://www.swi-prolog.org For built-in help, use ?- help(Topic). or ?- apropos(Word). ?- p_ohm(I, I1, 1, 6, V1, V2, R, 1, R2). ERROR: Arguments are not sufficiently instanti...

[ -0.0081787109375, 0.003387451171875, 0.00054168701171875, 0.0038299560546875, 0.00689697265625, 0.01165771484375, -0.0142822265625, -0.0037384033203125, 0.0303955078125, -0.01458740234375, 0.03271484375, -0.0015411376953125, -0.0223388671875, -0.008544921875, -0.007049560546875, -0.008...

[ 10752, 4867, 32497, 678, 9520, 60873, 30174, 27143, 4092, 10975, 30607, 11675, 86872, 8437, 1118, 4358, 76615, 2452, 3454, 1478, 88303, 4527, 77888, 1771, 189461, 164805, 915, 454, 10597, 87, 418, 106, 305, 310, 304, 627, 10461, 151206, 246...

[ 0.20263671875, 0.27392578125, 0.0999755859375, 0.0592041015625, 0.049835205078125, 0.07525634765625, 0.11669921875, 0.1138916015625, 0.0379638671875, 0.13623046875, 0.006927490234375, 0.06683349609375, 0.05316162109375, 0.030853271484375, 0.014068603515625, 0.1004638671875, 0.0662841...

embed

47729432_c0

47729432

prolog

0

Title: Modifing text in pl file with swi-prolog Problem title: Modifing text in pl file with swi-prolog Tags: prolog Problem: Modifing text in pl file with swi-prolog I have the following file in prolog, 1111000011110000.pl : :- multifile firstname/1. :- multifile surname/1. :- multifile cardNumber/1. :- multifile code...

Modifing text in pl file with swi-prolog Modifing text in pl file with swi-prolog prolog Modifing Martin Andersson Modifing text in pl file with swi-prolog I have the following file in prolog, 1111000011110000.pl : I want to create a predicate that takes an integer-input (for instance 0) and modifies the 11110000111100...

[ 0.0162353515625, 0.0135498046875, -0.0015869140625, -0.010986328125, 0.0018768310546875, 0.0072021484375, 0.0003261566162109375, 0.0177001953125, 0.0155029296875, -0.0101318359375, -0.00118255615234375, 0.0164794921875, -0.0164794921875, -0.0240478515625, 0.041259765625, -0.00143432617...

[ 117712, 420, 7986, 23, 6456, 11435, 678, 91, 2452, 3454, 4867, 502, 6470, 141227, 25632, 36682, 191281, 159019, 28568, 2424, 3444, 28282, 1653, 2063, 67, 51776, 892, 1505, 73, 7077, 757, 73197, 221, 10750, 40197, 19714, 83, 98816, 47, 173...

[ 0.1500244140625, 0.1368408203125, 0.1868896484375, 0.045013427734375, 0.1978759765625, 0.1468505859375, 0.02764892578125, 0.0291290283203125, 0.1888427734375, 0.1524658203125, 0.2042236328125, 0.1591796875, 0.1416015625, 0.2152099609375, 0.0268402099609375, 0.1324462890625, 0.0900878...

embed

1817010_c0

1817010

prolog

0

Title: Embedded Prolog Interpreter/Compiler for Java Problem title: Embedded Prolog Interpreter/Compiler for Java Tags: prolog, constraint-programming, embedded-language, java, logic-programming Problem: Embedded Prolog Interpreter/Compiler for Java I'm working on an application in Java, that needs to do some complex l...

Embedded Prolog Interpreter/Compiler for Java Embedded Prolog Interpreter/Compiler for Java prolog constraint-programming embedded-language java logic-programming Embedded Prolog Interpreter Compiler Java Embedded Prolog Interpreter/Compiler for Java I'm working on an application in Java, that needs to do some complex ...

[ 0.0267333984375, -0.001861572265625, 0.0181884765625, 0.018798828125, -0.0027618408203125, 0.0208740234375, -0.017333984375, 0.000759124755859375, 0, -0.03466796875, -0.002288818359375, -0.0002841949462890625, -0.02392578125, 0.005340576171875, 0.0101318359375, -0.0052490234375, 0.00...

[ 2775, 372, 69819, 1250, 4867, 5337, 56359, 56, 64, 108161, 34759, 100, 41925, 502, 158, 2816, 4288, 28966, 55720, 196651, 79, 330, 62775, 15612, 20697, 38415, 23, 27140, 79986, 8, 77391, 123309, 1884, 18151, 759, 56037, 46876, 64457, 18822,...

[ 0.094482421875, 0.2149658203125, 0.09112548828125, 0.1650390625, 0.235107421875, 0.0797119140625, 0.174560546875, 0.05615234375, 0.013885498046875, 0.10235595703125, 0.15234375, 0.07611083984375, 0.2352294921875, 0.1171875, 0.03173828125, 0.154541015625, 0.0797119140625, 0.10461425...

embed

64292196_c0

64292196

prolog

0

Title: How to set executable path for a package on a configuration file on Emacs? Problem title: How to set executable path for a package on a configuration file on Emacs? Tags: prolog, emacs Problem: How to set executable path for a package on a configuration file on Emacs? I want to use "ediprolog" package on Emacs. ...

How to set executable path for a package on a configuration file on Emacs? How to set executable path for a package on a configuration file on Emacs? prolog emacs How Emacs You Custom How to set executable path for a package on a configuration file on Emacs? I want to use "ediprolog" package on Emacs. I followed instal...

[ 0.027587890625, -0.016845703125, -0.0113525390625, -0.0093994140625, -0.015869140625, 0.0264892578125, -0.006866455078125, 0.02197265625, -0.00010919570922851562, 0.01611328125, 0.008544921875, 0.0218505859375, -0.0306396484375, -0.00074005126953125, 0.00921630859375, -0.00367736816406...

[ 11249, 5423, 71924, 2886, 60875, 100, 98169, 98, 180346, 11435, 85269, 4439, 47, 502, 4867, 352, 2263, 7, 130664, 3444, 4527, 14660, 3454, 59720, 127689, 188336, 35273, 67919, 257, 37842, 313, 9, 1542, 178036, 51588, 123849, 42, 14071, 1276...

[ 0.0872802734375, 0.183837890625, 0.2261962890625, 0.166259765625, 0.266845703125, 0.08941650390625, 0.2420654296875, 0.08160400390625, 0.214599609375, 0.141357421875, 0.1781005859375, 0.18701171875, 0.001800537109375, 0.2012939453125, 0.2427978515625, 0.10064697265625, 0.10888671875,...

embed

68731776_c0

68731776

prolog

0

Title: How to fix this permutation sort? Problem title: How to fix this permutation sort? Tags: failure-slice, prolog, termination, duplicates, sorting Problem: How to fix this permutation sort? The following Prolog program defines a predicate sorted/2 for sorting by permutation (permutation sort) in ascending order a ...

How to fix this permutation sort? How to fix this permutation sort? failure-slice prolog termination duplicates sorting How Time How to fix this permutation sort? The following Prolog program defines a predicate sorted/2 for sorting by permutation (permutation sort) in ascending order a list passed in first argument, w...

[ -0.01043701171875, 0.01470947265625, 0.031982421875, -0.0166015625, -0.0230712890625, -0.011474609375, -0.02001953125, -0.0177001953125, 0.00872802734375, -0.0184326171875, 0.0157470703125, 0.025390625, 0.000453948974609375, -0.01025390625, 0.0037384033203125, 0.00128936767578125, -0...

[ 11249, 47, 30022, 903, 117, 561, 22062, 12096, 137578, 13348, 502, 4867, 29527, 171763, 1636, 19055, 25632, 1250, 1528, 61924, 1653, 2063, 67, 17497, 71, 12477, 214, 390, 1264, 82800, 12989, 5303, 115081, 5117, 10750, 50339, 17932, 86869, 3...

[ 0.0789794921875, 0.03997802734375, 0.1890869140625, 0.1298828125, 0.123779296875, 0.178955078125, 0.122802734375, 0.24462890625, 0.2086181640625, 0.1444091796875, 0.1422119140625, 0.25634765625, 0.13232421875, 0.199951171875, 0.04229736328125, 0.0927734375, 0.022186279296875, 0.175...

embed

43015558_c0

43015558

prolog

0

Title: Checking whether the tree is avl-tree in prolog. error Problem title: Checking whether the tree is avl-tree in prolog. error Tags: avl-tree, prolog, instantiation-error Problem: Checking whether the tree is avl-tree in prolog. error My programm is not working correct. When I try to test it I have an error. My ex...

Checking whether the tree is avl-tree in prolog. error Checking whether the tree is avl-tree in prolog. error avl-tree prolog instantiation-error Checking if_avl_tree is_binTree ERROR Arguments _6218 lab06tomashchuk.pl:50 Note Re-run Checking whether the tree is avl-tree in prolog. error My programm is not working corr...

[ 0.006378173828125, -0.0074462890625, -0.004241943359375, 0.005615234375, 0.010009765625, 0.001800537109375, -0.005828857421875, 0.00860595703125, -0.00653076171875, -0.029296875, 0.0120849609375, -0.0113525390625, 0.0086669921875, 0.006103515625, 0.0247802734375, -0.00714111328125, 0...

[ 38679, 214, 36766, 53201, 83, 185, 141, 9, 62600, 23, 502, 4867, 18499, 34648, 14, 188800, 2174, 11, 50132, 7568, 62731, 13, 151206, 112140, 10837, 1819, 60054, 9016, 23837, 18622, 853, 16428, 28966, 959, 20697, 26785, 9790, 3034, 27781, ...

[ 0.14794921875, 0.002410888671875, 0.0909423828125, 0.2327880859375, 0.0699462890625, 0.183837890625, 0.1922607421875, 0.07391357421875, 0.260498046875, 0.05877685546875, 0.156005859375, 0.228515625, 0.1485595703125, 0.0635986328125, 0.05499267578125, 0.1458740234375, 0.05416870117187...

embed

45407061_c1

45407061

prolog

1

The Knowledge Base used for grading will be different. here example and I only have problem with the last example % Knowledge Base male(adam). male(bob). male(brett). male(charles). male(chris). male(clay). female(ava). female(barbara). female(betty). female(colette). female(carrie). parent(adam,bob). parent(adam,barb...

[ 0.036376953125, 0.0098876953125, 0.0115966796875, 0.000553131103515625, -0.006622314453125, 0.01007080078125, -0.01251220703125, 0.00390625, -0.01214599609375, -0.008544921875, 0.022216796875, -0.0244140625, -0.0025177001953125, 0.0206298828125, -0.0103759765625, -0.006683349609375, ...

[ 581, 191428, 44978, 11814, 100, 6671, 214, 1221, 186, 12921, 5, 3688, 27781, 87, 4734, 765, 2967, 4568, 1745, 11280, 132, 91701, 837, 275, 189817, 9254, 1577, 206, 3679, 18347, 117776, 5528, 1299, 18064, 4626, 939, 587, 36711, 3284, 5056,...

[ 0.08544921875, 0.28564453125, 0.27001953125, 0.150390625, 0.0443115234375, 0.28173828125, 0.1842041015625, 0.124267578125, 0.111083984375, 0.22607421875, 0.00555419921875, 0.0855712890625, 0.2244873046875, 0.02996826171875, 0.08819580078125, 0.0867919921875, 0.181884765625, 0.11621...

embed

12549737_c0

12549737

prolog

0

Title: Prolog Binary Addition Issue? Problem title: Prolog Binary Addition Issue? Tags: prolog, binary Problem: Prolog Binary Addition Issue? I have this piece of homework that I have to write in Prolog.The requirement is to write a piece of code that does binary addition such as: ?- add([1,0,1],[1,1],X). X = [0,0,0,1]...

Prolog Binary Addition Issue? Prolog Binary Addition Issue? prolog binary Prolog Binary Addition Issue _G7100 Prolog Binary Addition Issue? I have this piece of homework that I have to write in Prolog.The requirement is to write a piece of code that does binary addition such as: And so, this is the code that I came up ...

[ 0.01153564453125, 0.0048828125, 0.01904296875, -0.00238037109375, -0.03173828125, 0.01611328125, -0.01708984375, -0.0035858154296875, 0.0211181640625, -0.00518798828125, 0.02490234375, -0.0224609375, -0.01708984375, 0.00970458984375, 0.0234375, -0.00799560546875, 0.040771484375, -0...

[ 1250, 4867, 54092, 1294, 29117, 14, 1363, 223317, 32, 502, 2394, 6635, 3559, 5368, 18244, 33022, 64209, 674, 63847, 18151, 14602, 66044, 903, 1257, 37202, 54, 44841, 114453, 37348, 831, 959, 28219, 5809, 17997, 16940, 44691, 9525, 146104, 1...

[ 0.169677734375, 0.220458984375, 0.213623046875, 0.1514892578125, 0.158935546875, 0.16064453125, 0.04058837890625, 0.206298828125, 0.0059814453125, 0.13232421875, 0.183837890625, 0.174072265625, 0.1409912109375, 0.03704833984375, 0.119384765625, 0.06207275390625, 0.0892333984375, 0....

embed

50900052_c0

50900052

prolog

0

Title: Using aleph with SWI-prolog: source_sink `library(aleph)' does not exist Problem title: Using aleph with SWI-prolog: source_sink `library(aleph)' does not exist Tags: aleph-ilp, package-management, swi-prolog, prolog, package Problem: Using aleph with SWI-prolog: source_sink `library(aleph)' does not e...

Using aleph with SWI-prolog: source_sink `library(aleph)' does not exist Using aleph with SWI-prolog: source_sink `library(aleph)' does not exist aleph-ilp package-management swi-prolog prolog package Using SWI-prolog source_sink aleph.pl use_module ERROR pl:1 Warning Goal user:use_module pl:2 Undefined user:...

[ 0.005645751953125, 0.00787353515625, 0.004150390625, 0.03564453125, -0.01953125, 0.01141357421875, 0.0220947265625, 0.0201416015625, -0.021484375, -0.0556640625, 0.008544921875, -0.017822265625, -0.006744384765625, -0.006500244140625, 0.0211181640625, -0.0189208984375, -0.00267028808...

[ 345, 662, 11727, 678, 159, 38969, 3454, 4867, 31344, 7, 14068, 150, 2844, 1294, 1935, 3768, 14602, 959, 32316, 379, 254, 98169, 87140, 2452, 502, 2424, 4527, 83279, 151206, 24638, 6456, 5550, 592, 2016, 289, 38937, 4032, 79912, 5983, 9133...

[ 0.0275115966796875, 0.134033203125, 0.250732421875, 0.0430908203125, 0.04248046875, 0.2061767578125, 0.1400146484375, 0.197998046875, 0.2423095703125, 0.115234375, 0.2130126953125, 0.138671875, 0.23486328125, 0.1490478515625, 0.1348876953125, 0.166259765625, 0.043304443359375, 0.11...

embed

46947830_c0

46947830

prolog

0

Title: All possible knight positions in n moves - infinite loop in prolog Problem title: All possible knight positions in n moves - infinite loop in prolog Tags: prolog, failure-slice, infinite-loop, knights-tour Problem: All possible knight positions in n moves - infinite loop in prolog I have a problem with backtrack...

All possible knight positions in n moves - infinite loop in prolog All possible knight positions in n moves - infinite loop in prolog prolog failure-slice infinite-loop knights-tour All knight_move predict_moves All possible knight positions in n moves - infinite loop in prolog I have a problem with backtracking in Pro...

[ 0.0130615234375, 0.0025787353515625, 0.0123291015625, 0.0022735595703125, 0.005523681640625, -0.0125732421875, -0.000308990478515625, 0.0277099609375, 0.006256103515625, -0.050048828125, 0.00811767578125, 0.005126953125, -0.0012054443359375, 0.0125732421875, 0.005950927734375, 0.006927...

[ 3164, 7722, 472, 54350, 19069, 653, 25813, 54241, 13, 40956, 502, 4867, 137578, 13348, 28354, 28889, 432, 272, 92054, 3132, 2967, 4420, 125728, 214, 23, 1250, 74481, 29806, 756, 141956, 24763, 60875, 28412, 5117, 50339, 8306, 121011, 16487, ...

[ 0.0960693359375, 0.190673828125, 0.0738525390625, 0.2137451171875, 0.1953125, 0.0975341796875, 0.186767578125, 0.11572265625, 0.05096435546875, 0.177978515625, 0.147216796875, 0.2191162109375, 0.1611328125, 0.082763671875, 0.1112060546875, 0.14208984375, 0.1094970703125, 0.08557128...

embed

4964782_c0

4964782

prolog

0

Title: Why "..." appears in my answer of matrix in Prolog Problem title: Why "..." appears in my answer of matrix in Prolog Tags: prolog-toplevel, matrix, prolog, coordinates Problem: Why "..." appears in my answer of matrix in Prolog I made a little code for creating a matrix of coordinates (like a...

Why "..." appears in my answer of matrix in Prolog Why "..." appears in my answer of matrix in Prolog prolog-toplevel matrix prolog coordinates Why Prolog M-1 N-1 Why "..." appears in my answer of matrix in Prolog I made a little code for creating a matrix of coordinates (like a chessboard), it's th...

[ 0.03076171875, 0.005035400390625, 0.0152587890625, 0.00543212890625, 0.00689697265625, -0.0155029296875, 0.02490234375, 0.025634765625, 0.01025390625, 0.000141143798828125, -0.0111083984375, 0.004791259765625, -0.00007724761962890625, -0.025390625, -0.006103515625, -0.00098419189453125...

[ 44084, 41502, 27, 1230, 135179, 35166, 111, 50944, 425, 1250, 4867, 502, 13784, 67919, 176866, 276, 5759, 541, 7673, 23, 10176, 18151, 105233, 290, 24351, 71924, 5299, 158661, 158208, 15464, 3564, 9842, 108975, 1632, 91403, 9588, 29786, 15400...

[ 0.1390380859375, 0.123291015625, 0.1065673828125, 0.00634765625, 0.143310546875, 0.1700439453125, 0.0487060546875, 0.1734619140625, 0.1116943359375, 0.1484375, 0.220703125, 0.09600830078125, 0.02783203125, 0.079833984375, 0.2052001953125, 0.063720703125, 0.1195068359375, 0.05349731...

embed

67607539_c0

67607539

prolog

0

Title: Unexpected error when am trying to print a simple number in prolog Problem title: Unexpected error when am trying to print a simple number in prolog Tags: prolog Problem: Unexpected error when am trying to print a simple number in prolog Am working on an exercise which I have to make some things. There am creati...

Unexpected error when am trying to print a simple number in prolog Unexpected error when am trying to print a simple number in prolog prolog Unexpected pow3 Program Unexpected error when am trying to print a simple number in prolog Am working on an exercise which I have to make some things. There am creating a " Functi...

[ 0.0067138671875, -0.01312255859375, 0.007537841796875, 0.000579833984375, 0.02294921875, 0.0005645751953125, -0.0213623046875, 0.003875732421875, 0.01080322265625, -0.044189453125, -0.025634765625, -0.04296875, 0.0015106201171875, 0.0133056640625, 0.03857421875, 0.002197265625, -0.00...

[ 83613, 13, 18499, 31577, 28412, 8781, 14012, 502, 4867, 23, 23827, 363, 7663, 20697, 81979, 3249, 105233, 28670, 10763, 74481, 54753, 238, 501, 105416, 2174, 60899, 117396, 201939, 101935, 137175, 8110, 30646, 31089, 3034, 9969, 34759, 127877, ...

[ 0.06976318359375, 0.059783935546875, 0.19775390625, 0.130859375, 0.18896484375, 0.1785888671875, 0.1824951171875, 0.1595458984375, 0.224853515625, 0.030548095703125, 0.1993408203125, 0.1500244140625, 0.1109619140625, 0.0732421875, 0.0743408203125, 0.01373291015625, 0.069091796875, ...

embed

1831488_c0

1831488

prolog

0

Title: integer division operator in Prolog Problem title: integer division operator in Prolog Tags: prolog, clpfd, sicstus-prolog Problem: integer division operator in Prolog This code is a part of the program that I am writing to solve a cryptarithmatic puzzle in prolog. I am solving this using CLPFD (SICStus Prolog)....

integer division operator in Prolog integer division operator in Prolog prolog clpfd sicstus-prolog Prolog solve1 clpfd_expression integer_div N-N1 integer division operator in Prolog This code is a part of the program that I am writing to solve a cryptarithmatic puzzle in prolog. I am solving this using CLPFD (SICStus...

[ -0.0169677734375, -0.002044677734375, -0.0021209716796875, -0.007080078125, 0.0059814453125, -0.00537109375, -0.01416015625, -0.01043701171875, 0.004150390625, -0.0274658203125, -0.0032806396484375, 0.002960205078125, 0.0048828125, 0.00750732421875, 0.0174560546875, -0.018798828125, ...

[ 892, 1505, 91853, 39933, 23, 1250, 4867, 502, 33139, 39557, 71, 26536, 18253, 3454, 86869, 418, 204629, 30618, 541, 9, 839, 18151, 1528, 32562, 136791, 8962, 104192, 3115, 46323, 41265, 397, 294, 102198, 2143, 18499, 17368, 978, 24908, 2076...

[ 0.125732421875, 0.1153564453125, 0.233154296875, 0.2283935546875, 0.04052734375, 0.159423828125, 0.2327880859375, 0.10626220703125, 0.073486328125, 0.12451171875, 0.1500244140625, 0.046051025390625, 0.2125244140625, 0.11083984375, 0.11669921875, 0.07135009765625, 0.177490234375, 0....

embed

28280906_c0

28280906

prolog

0

Title: Printing out only one result in batch mode with Prolog Problem title: Printing out only one result in batch mode with Prolog Tags: prolog Problem: Printing out only one result in batch mode with Prolog In Prolog, I can bring up the REPL to test Prolog code interactively (interactive mode), and I also can write d...

Printing out only one result in batch mode with Prolog Printing out only one result in batch mode with Prolog prolog Printing Prolog chop_suey chow_mein sweet_and_sour Printing out only one result in batch mode with Prolog In Prolog, I can bring up the REPL to test Prolog code interactively (interactive mode), and I al...

[ 0.01434326171875, 0.01007080078125, 0.01611328125, 0.0062255859375, -0.0108642578125, 0.00250244140625, 0.01019287109375, 0.0074462890625, 0.002227783203125, -0.0284423828125, -0.0174560546875, -0.00421142578125, -0.0184326171875, -0.01531982421875, 0.025634765625, 0.01116943359375, ...

[ 39754, 1810, 4734, 1632, 16750, 1777, 206, 13736, 1250, 4867, 502, 82335, 1159, 7460, 50335, 282, 73, 53673, 2940, 34639, 678, 831, 9069, 21130, 3034, 18151, 212398, 10433, 33022, 11435, 71924, 75101, 2848, 4527, 5423, 4390, 32354, 2046, 75...

[ 0.193359375, 0.13232421875, 0.122314453125, 0.1361083984375, 0.22802734375, 0.163818359375, 0.1004638671875, 0.1357421875, 0.162841796875, 0.23583984375, 0.1070556640625, 0.097900390625, 0.0394287109375, 0.0980224609375, 0.07147216796875, 0.05621337890625, 0.078369140625, 0.1107177...

embed

63928475_c1

63928475

prolog

1

). min_subset_value([P1|RestP],Min) :- RestP \= [], min_subset_value(RestP, OtherMin), subset_value(P1,A1) , mini(A1, OtherMin, Min). % divide_to_players(+,+,-) : Generate a division of all the Elements to N subsets divide_to_players([],N,EmptySets):- N>=1, generate_empty_sets(EmptySets,N). divide_to_players(Elements, ...

[ -0.005828857421875, 0.00323486328125, 0.0299072265625, 0.01708984375, -0.008544921875, 0.0042724609375, 0.00933837890625, -0.00775146484375, 0.03662109375, -0.0167236328125, 0.0078125, 0.0361328125, -0.000736236572265625, -0.01287841796875, -0.00145721435546875, -0.00775146484375, 0....

[ 194, 881, 22144, 3509, 27494, 683, 418, 58745, 1052, 525, 59076, 15772, 49756, 64511, 1614, 17727, 7665, 284, 4211, 1745, 101637, 188, 139570, 1328, 152, 155370, 67, 91853, 756, 48325, 47, 541, 839, 134332, 939, 294, 7831, 2740, 33000, 13...

[ 0.1090087890625, 0.2047119140625, 0.200439453125, 0.2125244140625, 0.176025390625, 0.189697265625, 0.0908203125, 0.000457763671875, 0.043792724609375, 0.1053466796875, 0.232177734375, 0.026031494140625, 0.1951904296875, 0.05865478515625, 0.1787109375, 0.02874755859375, 0.18798828125,...

embed

43634848_c0

43634848

prolog

0

Title: Accessing the literal value of the object of a triple Problem title: Accessing the literal value of the object of a triple Tags: turtle-rdf, swi-prolog, prolog, cliopatria Problem: Accessing the literal value of the object of a triple I'm working on a validator that validates turtle files. When working on a func...

Accessing the literal value of the object of a triple Accessing the literal value of the object of a triple turtle-rdf swi-prolog prolog cliopatria Accessing Card xsd:nonNegativeInteger www.w3.org XMLSchema rdf_canonical_literal LiteralL rdf_compare xsd:integer Accessing the literal value of the object of a triple I'm ...

[ -0.003814697265625, -0.0147705078125, 0.00531005859375, 0.004150390625, -0.0022735595703125, -0.0289306640625, -0.006622314453125, -0.017333984375, 0.00421142578125, -0.0225830078125, 0.0123291015625, 0.03955078125, 0.0032806396484375, -0.0260009765625, 0.002838134765625, 0.00448608398...

[ 40266, 214, 15659, 289, 34292, 36746, 162738, 2130, 17991, 4216, 420, 2452, 3454, 4867, 502, 95701, 95543, 11, 23660, 1022, 71, 6431, 6433, 208, 4935, 67, 1505, 363, 92537, 25452, 11883, 38938, 39798, 135940, 141, 866, 277, 16082, 6191, 2...

[ 0.1846923828125, 0.004425048828125, 0.215576171875, 0.205078125, 0.2269287109375, 0.193359375, 0.2509765625, 0.1329345703125, 0.179931640625, 0.03387451171875, 0.0958251953125, 0.1419677734375, 0.059417724609375, 0.147705078125, 0.041259765625, 0.01129150390625, 0.1234130859375, 0....

embed

19251872_c0

19251872

prolog

0

Title: How do you specify facts in prolog files? Problem title: How do you specify facts in prolog files? Tags: prolog Problem: How do you specify facts in prolog files? I have a few facts stored in a file test.pl. memory(0, 0, 0). memory(0, 1, 0). memory(0, 2, 0). Now in the same directory, I start gprolog and load th...

How do you specify facts in prolog files? How do you specify facts in prolog files? prolog How test.pl Action RET user:1 test.pl:1 How do you specify facts in prolog files? I have a few facts stored in a file test.pl. Now in the same directory, I start gprolog and load the file. But it will treat the loaded facts stran...

[ 0.02490234375, -0.0031280517578125, 0.01031494140625, 0.01025390625, 0.0013580322265625, 0.00750732421875, 0.00823974609375, 0.006988525390625, -0.00109100341796875, -0.04541015625, -0.004669189453125, 0.0247802734375, -0.040771484375, -0.0091552734375, 0.0079345703125, 0.0089721679687...

[ 11249, 40140, 18929, 15824, 7, 502, 4867, 102158, 3034, 2424, 57945, 41116, 38937, 19721, 23, 4343, 11435, 14364, 706, 3454, 72367, 85689, 114453, 41, 1294, 1884, 31577, 5303, 51, 41274, 110, 77336, 40383, 678, 65918, 3714, 80934, 214, 4324...

[ 0.0290374755859375, 0.2117919921875, 0.15869140625, 0.2159423828125, 0.1265869140625, 0.16455078125, 0.227294921875, 0.1590576171875, 0.201416015625, 0.142333984375, 0.1002197265625, 0.167724609375, 0.1142578125, 0.027191162109375, 0.03228759765625, 0.010162353515625, 0.1304931640625...

embed

37171303_c1

37171303

prolog

1

R ([], 0). % r ight-leaning list_sizR([_|Es], 1+N) :- list_sizR(Es,N). built-in (is)/2 vs val_of/2 val_of(V, E) :- ( E = E1+E2 -> val_of(V1, E1), val_of(V2, E2), V is V1+V2 ; number(E) -> V = E ). To measure runtimes I ran go(2000000) using different Prolog processors 2 : go(L) :- length(Xs, L), member(B_2, [list_sizL...

[ -0.0057373046875, 0.0059814453125, 0.00537109375, -0.003326416015625, -0.002716064453125, -0.0033416748046875, -0.023193359375, -0.00555419921875, 0.0302734375, -0.017578125, 0.032470703125, 0.020751953125, 0.004913330078125, -0.0155029296875, 0.01275634765625, -0.00311279296875, 0.0...

[ 627, 1065, 757, 1745, 1690, 22553, 34677, 5303, 4900, 1052, 16474, 1328, 839, 88303, 73, 164, 12477, 20209, 3502, 4390, 856, 241, 418, 304, 10461, 310, 14012, 647, 2203, 72350, 11675, 70141, 13028, 738, 54753, 197094, 12921, 1250, 4867, 1...

[ 0.1973876953125, 0.031219482421875, 0.0997314453125, 0.0615234375, 0.002197265625, 0.16552734375, 0.1685791015625, 0.207763671875, 0.1671142578125, 0.2017822265625, 0.116455078125, 0.1201171875, 0.06732177734375, 0.1505126953125, 0.1046142578125, 0.17333984375, 0.1888427734375, 0.1...

embed

33802844_c0

33802844

prolog

0

Title: How to make the output of this prolog program state "true"? Problem title: How to make the output of this prolog program state "true"? Tags: prolog, backtracking, list Problem: How to make the output of this prolog program state "true"? I have this example prolog program, which on output prin...

How to make the output of this prolog program state "true"? How to make the output of this prolog program state "true"? prolog backtracking list How N-1 How to make the output of this prolog program state "true"? I have this example prolog program, which on output prints a number of * corresponding ...

[ 0.01007080078125, 0.01092529296875, 0.00543212890625, -0.000762939453125, -0.015869140625, 0.0167236328125, 0.0086669921875, 0.018798828125, 0.0111083984375, 0.01025390625, 0.00921630859375, -0.01177978515625, -0.004547119140625, -0.001953125, 0.01275634765625, -0.01806640625, 0.0324...

[ 11249, 47, 3249, 140992, 903, 502, 4867, 1528, 11341, 9774, 13, 4420, 125728, 214, 5303, 541, 5759, 70, 111, 27781, 28412, 14012, 661, 42518, 13267, 80854, 41, 1294, 10006, 189126, 2357, 66211, 8337, 2704, 35166, 26785, 76199, 98320, 3229, ...

[ 0.0888671875, 0.0347900390625, 0.115478515625, 0.265869140625, 0.091552734375, 0.1943359375, 0.24560546875, 0.17724609375, 0.16845703125, 0.1982421875, 0.1285400390625, 0.1746826171875, 0.2415771484375, 0.0838623046875, 0.1627197265625, 0.07257080078125, 0.1324462890625, 0.02947998...

embed

34091160_c0

34091160

prolog

0

Title: I/O in prolog: Error: Arguments are not sufficiently instantiated, no further information Problem title: I/O in prolog: Error: Arguments are not sufficiently instantiated, no further information Tags: prolog Problem: I/O in prolog: Error: Arguments are not sufficiently instantiated, no further information So I'm...

I/O in prolog: Error: Arguments are not sufficiently instantiated, no further information I/O in prolog: Error: Arguments are not sufficiently instantiated, no further information prolog Error Arguments I/O in prolog: Error: Arguments are not sufficiently instantiated, no further information So I'm working with I/O in ...

[ 0.0185546875, -0.00005245208740234375, -0.01409912109375, 0.0157470703125, -0.01263427734375, 0.01202392578125, 0.0115966796875, -0.005218505859375, -0.002685546875, -0.001678466796875, 0.029296875, -0.023193359375, -0.006072998046875, -0.00003337860107421875, 0.015380859375, -0.001144...

[ 87, 64, 670, 23, 502, 4867, 212059, 112140, 7, 959, 129980, 34648, 14, 27686, 110, 53333, 4677, 20697, 104192, 15400, 20949, 2499, 1653, 2063, 216806, 31089, 29569, 339, 304, 29822, 866, 5442, 2424, 5701, 18499, 1528, 5608, 54, 83, 134598...

[ 0.0535888671875, 0.2364501953125, 0.1656494140625, 0.06341552734375, 0.1820068359375, 0.2381591796875, 0.15869140625, 0.26708984375, 0.0546875, 0.10211181640625, 0.18798828125, 0.1514892578125, 0.1473388671875, 0.0633544921875, 0.0697021484375, 0.126708984375, 0.1849365234375, 0.04...

embed

33599781_c1

33599781

prolog

1

%We can't pour into the medium if medium is full Diff is min(5 - M, L), Diff > 0, NewLarge is L - Diff, %calculate the new Large NewMedium is M + Diff. %calculate the new Medium % move rule #2: Pour Large into Small (L--> S) move([L, M, S], [NewLarge,M,NewSmall]) :- L > 0, %We can't pour from large if Large is empty S...

[ -0.010009765625, 0.0167236328125, 0.00872802734375, 0.031982421875, -0.005279541015625, 0.0004596710205078125, -0.042724609375, 0.0201416015625, 0.0159912109375, 0.03076171875, 0.01007080078125, 0.000522613525390625, 0.021484375, -0.004150390625, 0.0003185272216796875, -0.0075988769531...

[ 1745, 12137, 831, 18, 578, 3934, 70, 57646, 2174, 83, 4393, 191144, 881, 104116, 20, 276, 339, 247, 757, 2356, 2729, 27616, 6827, 16735, 3525, 181268, 6696, 28483, 997, 174413, 25813, 79986, 64947, 5547, 105508, 152745, 159, 46568, 594, 6...

[ 0.1595458984375, 0.0816650390625, 0.1124267578125, 0.10479736328125, 0.2509765625, 0.2054443359375, 0.00616455078125, 0.299072265625, 0.07415771484375, 0.0345458984375, 0.1669921875, 0.2491455078125, 0.195556640625, 0.0919189453125, 0.0419921875, 0.10089111328125, 0.1044921875, 0.0...

embed

71834093_c0

71834093

prolog

0

Title: List all combinations of a list prolog Problem title: List all combinations of a list prolog Tags: prolog Problem: List all combinations of a list prolog I want to write in Prolog a predicate that display all the combinations of a list of N elements with exactly M "black elements" ( b for black and w for white)....

List all combinations of a list prolog List all combinations of a list prolog prolog List NN1 Nn-1 N-1 Call _2900 _4108 Exit _5624 _4100 _7904 _9420 _7896 _11700 _11692 Redo _19114 _19106 _21394 List all combinations of a list prolog I want to write in Prolog a predicate that display all the combinations of a list of N...

[ -0.0272216796875, 0.016357421875, 0.017822265625, -0.00244140625, -0.000492095947265625, 0.0205078125, -0.009033203125, 0.0031890869140625, -0.00726318359375, 0.002532958984375, -0.0018157958984375, 0.00836181640625, 0.01318359375, 0.0101318359375, -0.00543212890625, 0.0164794921875, ...

[ 32036, 756, 162515, 7, 111, 5303, 502, 4867, 24455, 418, 541, 19, 5759, 26265, 20543, 617, 69139, 5443, 217, 13683, 2357, 3559, 123048, 14889, 1549, 153781, 15128, 12231, 6096, 31, 129150, 54100, 161787, 10, 3444, 33022, 1250, 1653, 2063, ...

[ 0.17041015625, 0.1451416015625, 0.2861328125, 0.1033935546875, 0.06646728515625, 0.2041015625, 0.1812744140625, 0.2091064453125, 0.16552734375, 0.069091796875, 0.123291015625, 0.032928466796875, 0.124755859375, 0.1240234375, 0.1114501953125, 0.0167388916015625, 0.124755859375, 0.06...

embed

33859548_c0

33859548

prolog

0

Title: Best way to update/add fact in the db? Problem title: Best way to update/add fact in the db? Tags: prolog, prolog-assert Problem: Best way to update/add fact in the db? Say I have facts like this : fact(abc,2). I want something like this (pseudo code) : fact_update(Functor,Name,AddToValue) :- if Fact_exist then ...

Best way to update/add fact in the db? Best way to update/add fact in the db? prolog prolog-assert Best fact_update Functor Name AddToValue Fact_exist update_fact NewVal CurrentValue create_new_fact fact_add Val Fact Amt NewAmt upd_fact Best way to update/add fact in the db? Say I have facts like this : I want somethin...

[ 0.01300048828125, 0.006591796875, 0.0260009765625, 0.000789642333984375, 0.0012359619140625, 0.00494384765625, -0.006561279296875, 0.0018157958984375, 0.0164794921875, -0.022216796875, 0.0213623046875, 0.01324462890625, -0.0089111328125, -0.01409912109375, 0.02490234375, -0.01843261718...

[ 11345, 3917, 47, 28350, 64, 11, 4028, 15824, 23, 40041, 502, 4867, 162, 33657, 117008, 28670, 18770, 15757, 29117, 7763, 856, 50770, 132640, 54376, 114700, 2356, 42272, 114063, 28282, 54936, 4769, 2022, 18, 23135, 1257, 71, 765, 1884, 903, ...

[ 0.1732177734375, 0.1473388671875, 0.09039306640625, 0.253173828125, 0.07470703125, 0.11083984375, 0.1988525390625, 0.274658203125, 0.127685546875, 0.2095947265625, 0.1068115234375, 0.1971435546875, 0.044097900390625, 0.18603515625, 0.2230224609375, 0.1143798828125, 0.1170654296875, ...

embed

52700063_c0

52700063

prolog

0

Title: Prolog - Simplifying rules or statements Problem title: Prolog - Simplifying rules or statements Tags: simplify, prolog Problem: Prolog - Simplifying rules or statements I've been looking at ways in which Prolog can automatically simplify statements. This is because I am planning to receive Prolog statements fro...

Prolog - Simplifying rules or statements Prolog - Simplifying rules or statements simplify prolog Prolog Simplifying Prolog - Simplifying rules or statements I've been looking at ways in which Prolog can automatically simplify statements. This is because I am planning to receive Prolog statements from an external sourc...

[ 0.047607421875, 0.0023956298828125, 0.00160980224609375, 0.01495361328125, -0.00469970703125, -0.00927734375, 0.008056640625, -0.0042724609375, 0.02197265625, -0.01318359375, -0.018798828125, -0.015380859375, -0.01361083984375, 0.00396728515625, 0.02099609375, 0.0037689208984375, 0.0...

[ 1250, 4867, 20, 55331, 141, 151138, 91736, 707, 63805, 112892, 18929, 502, 48322, 831, 191082, 58136, 53299, 173591, 31344, 23009, 75935, 28574, 53, 25129, 17514, 23, 140363, 125195, 1029, 34831, 5299, 149016, 54, 37076, 137399, 27781, 8781, ...

[ 0.19775390625, 0.275146484375, 0.00067138671875, 0.177001953125, 0.14990234375, 0.1649169921875, 0.187744140625, 0.0670166015625, 0.2315673828125, 0.225830078125, 0.16064453125, 0.1229248046875, 0.001953125, 0.037384033203125, 0.152099609375, 0.043609619140625, 0.0240478515625, 0.0...

embed

19745958_c0

19745958

prolog

0

Title: Prolog: square numbers in a list Problem title: Prolog: square numbers in a list Tags: recursion, prolog, list Problem: Prolog: square numbers in a list Ho do I square numbers in a list in prolog? The list can contain numbers, atoms and lists. for example: [a,b,2,3,4,[3],[c,d,9]] and the answer should be [a,b,4,...

Prolog: square numbers in a list Prolog: square numbers in a list recursion prolog list Prolog squared_members SqrdL SqrdLs Prolog: square numbers in a list Ho do I square numbers in a list in prolog? The list can contain numbers, atoms and lists. for example: [a,b,2,3,4,[3],[c,d,9]] and the answer should be [a,b,4,9,1...

[ -0.0001735687255859375, -0.003875732421875, 0.023681640625, 0.00145721435546875, -0.0068359375, 0.005859375, -0.0108642578125, 0.0034027099609375, 0.0035552978515625, 0.0068359375, 0.01153564453125, 0.01043701171875, -0.009521484375, 0.01251220703125, 0.004058837890625, -0.003738403320...

[ 1250, 4867, 108047, 101935, 23, 5303, 195625, 1830, 502, 71, 39, 27417, 864, 866, 2291, 54, 87, 6, 10, 831, 70541, 34627, 82449, 54968, 1126, 35166, 127915, 2485, 35299, 8770, 94727, 214, 142424, 617, 138, 201, 37842, 1193, 44978, 7225, ...

[ 0.1514892578125, 0.2362060546875, 0.28125, 0.244873046875, 0.114013671875, 0.27001953125, 0.1649169921875, 0.028533935546875, 0.160888671875, 0.1239013671875, 0.0372314453125, 0.1781005859375, 0.11669921875, 0.043243408203125, 0.1014404296875, 0.04083251953125, 0.039093017578125, 0...

embed

59341382_c1

59341382

prolog

1

I wanted to build the rules that allow you to say, e.g., 10 ore makes enough for 7 a: % handles the case where we have leftovers? % is this even the right way to model all this... when we have leftovers, we may % have to use them in the "reaction"... makes(In, Out) :- Out =.. [F,N], Val #>= N, OutN =.. [F,Val], makes(...

[ -0.005767822265625, -0.00909423828125, 0.0194091796875, 0.0311279296875, -0.010498046875, 0.0155029296875, -0.003265380859375, -0.007568359375, 0.0272216796875, 0.003448486328125, -0.0145263671875, -0.0225830078125, 0.007781982421875, 0.00726318359375, 0.01055908203125, -0.02392578125,...

[ 36663, 45367, 91736, 63769, 5154, 209, 6517, 30482, 20174, 100, 361, 10, 1745, 34831, 7225, 765, 25737, 5465, 7, 7108, 3299, 4527, 107, 44713, 4153, 13538, 4769, 839, 42272, 43240, 106, 160370, 517, 14786, 2967, 179933, 126371, 831, 26458, ...

[ 0.00250244140625, 0.1348876953125, 0.1787109375, 0.046295166015625, 0.0187225341796875, 0.1343994140625, 0.2548828125, 0.1510009765625, 0.2264404296875, 0.057769775390625, 0.1197509765625, 0.1004638671875, 0.0491943359375, 0.048614501953125, 0.0262908935546875, 0.0491943359375, 0.114...

embed

78961334_c1

78961334

prolog

1

, when I uncomment the \+ member check, then when it goes to try to prove member((a,b), [(b,c)]) it will fail, continuing over \+ member and finding a suitable solution. However, if I trace. the execution with the \+ member call I get: [trace] ?- path(a,c,Steps). Call: (12) path(a, c, _46240) ? creep Call: (13) step(a,...

[ -0.00921630859375, 0.0040283203125, 0.0269775390625, 0.0213623046875, -0.0113525390625, 0.015625, 0.00787353515625, -0.00921630859375, 0.01068115234375, -0.042236328125, 0.010498046875, 0.0189208984375, -0.00762939453125, 0.0224609375, 0.00408935546875, -0.0281982421875, -0.019287109...

[ 3229, 87, 51, 277, 674, 41872, 1328, 32786, 12765, 60899, 9790, 47, 23534, 11, 275, 238, 1221, 35782, 19686, 645, 90791, 202319, 29806, 33306, 2174, 144851, 71924, 1830, 11782, 2046, 39989, 705, 60875, 191644, 26265, 23676, 501, 157255, 125...

[ 0.0290069580078125, 0.0258636474609375, 0.10107421875, 0.11181640625, 0.1435546875, 0.08880615234375, 0.2037353515625, 0.253173828125, 0.25830078125, 0.00103759765625, 0.1165771484375, 0.056671142578125, 0.204833984375, 0.01190185546875, 0.05340576171875, 0.066162109375, 0.0132141113...

embed

73532853_c0

73532853

prolog

0

Title: I want to add in ListAtL1 the elements of list that the count is 1 or 2 and in the ListAtL2 the elements of list that the count is 2 Problem title: I want to add in ListAtL1 the elements of list that the count is 1 or 2 and in the ListAtL2 the elements of list that the count is 2 Tags: prolog Problem: I want to ...

I want to add in ListAtL1 the elements of list that the count is 1 or 2 and in the ListAtL2 the elements of list that the count is 2 I want to add in ListAtL1 the elements of list that the count is 1 or 2 and in the ListAtL2 the elements of list that the count is 2 prolog ListAtL1 ListAtL2 find_in_list Element List Cou...

[ -0.001434326171875, -0.0028228759765625, -0.016357421875, -0.0086669921875, -0.0201416015625, 0.005523681640625, -0.0167236328125, 0.0128173828125, 0.016357421875, -0.0230712890625, 0.01336669921875, -0.01214599609375, 0.00921630859375, 0.0220947265625, 0.007232666015625, 0.02258300781...

[ 3444, 15190, 32036, 28848, 866, 418, 80854, 111, 5303, 54529, 106, 707, 116, 304, 23, 70, 136, 502, 4867, 7413, 73, 6562, 48325, 6, 108210, 13538, 65450, 154663, 18151, 16750, 4966, 5608, 44084, 903, 96276 ]

[ 0.04864501953125, 0.157470703125, 0.189208984375, 0.1065673828125, 0.1270751953125, 0.08251953125, 0.16845703125, 0.06494140625, 0.161865234375, 0.18359375, 0.09271240234375, 0.05419921875, 0.1693115234375, 0.1151123046875, 0.0335693359375, 0.006866455078125, 0.0194549560546875, 0....

embed

36805152_c0

36805152

prolog

0

Title: Inserting into a list of lists prolog Problem title: Inserting into a list of lists prolog Tags: prolog Problem: Inserting into a list of lists prolog I am working on a roster system project in prolog, and am using a modified search and insert structure based on an example provided by our professor. However, whe...

Inserting into a list of lists prolog Inserting into a list of lists prolog prolog Inserting read_student_info Inserting into a list of lists prolog I am working on a roster system project in prolog, and am using a modified search and insert structure based on an example provided by our professor. However, when I try t...

[ -0.006744384765625, 0.0031280517578125, 0.010009765625, 0.017333984375, -0.034423828125, 0.01324462890625, -0.0113525390625, -0.0224609375, -0.005615234375, -0.015625, 0.0218505859375, 0.0048828125, -0.0031585693359375, -0.01385498046875, -0.0036468505859375, 0.000621795654296875, 0....

[ 360, 2189, 1916, 3934, 5303, 111, 7, 502, 4867, 12301, 96610, 7319, 20697, 52470, 56, 5426, 13452, 73197, 33938, 136, 183540, 45646, 27781, 62952, 16030, 11675, 208124, 17164, 83, 8306, 2174, 110, 3789, 80854, 13379, 16031, 31089, 40956, 64...

[ 0.083251953125, 0.2059326171875, 0.0209503173828125, 0.1800537109375, 0.19384765625, 0.068115234375, 0.0465087890625, 0.125732421875, 0.2044677734375, 0.1685791015625, 0.1968994140625, 0.1522216796875, 0.0159454345703125, 0.1300048828125, 0.1253662109375, 0.0367431640625, 0.014022827...

embed

37304926_c0

37304926

prolog

0

Title: flatten in prolog - something like else Problem title: flatten in prolog - something like else Tags: prolog Problem: flatten in prolog - something like else Look at my implementation of flatten : Generally, it is working. Only problem is for my_flatten([], F) - it gives F=[]; F=[[]] instead of F=[] . my_flatten(...

flatten in prolog - something like else flatten in prolog - something like else prolog my_flatten Acc is_list flatten in prolog - something like else Look at my implementation of flatten : Generally, it is working. Only problem is for my_flatten([], F) - it gives F=[]; F=[[]] instead of F=[] . For my_flatten(X, [1,2,3]...

[ 0.0027618408203125, 0.01409912109375, 0.015625, -0.000919342041015625, -0.015380859375, 0.0146484375, 0.0166015625, 0.006500244140625, 0.019775390625, -0.0184326171875, 0.037841796875, 0.006744384765625, 0.0037689208984375, 0.003997802734375, 0.0234375, 0.01153564453125, 0.0055236816...

[ 49878, 510, 23, 502, 4867, 9844, 1884, 37076, 759, 150632, 29899, 83, 6562, 208124, 9082, 20697, 87293, 2967, 563, 76199, 1065, 64457, 1542, 155761, 1528, 40956, 7, 14315, 32316, 54241, 5941, 35166, 133063, 96386, 5608, 214, 1284, 378, 74, ...

[ 0.255859375, 0.2471923828125, 0.04693603515625, 0.14794921875, 0.2086181640625, 0.1026611328125, 0.184326171875, 0.1571044921875, 0.1142578125, 0.229248046875, 0.1390380859375, 0.04791259765625, 0.1912841796875, 0.1123046875, 0.040771484375, 0.0777587890625, 0.01055908203125, 0.104...

embed

60150536_c1

60150536

prolog

1

{[linked,L],[size,S]} & (ran(L,D) & Node_i in D) & Msg = ok & LinkedList_ = LinkedList. checkNodeError(LinkedList,Node_i,Msg_o,LinkedList_):- LinkedList = {[linked,L] / _} & (nran(L,D) & Node_i in D) & Msg = error & LinkedList_ = LinkedList. removePartialNode(LinkedList,Node_i,LinkedList_):- removePartialNodeOk(Linked...

[ -0.0234375, -0.000820159912109375, -0.004180908203125, 0.0024261474609375, 0.0115966796875, 0.002716064453125, -0.0015716552734375, -0.0037689208984375, 0.010986328125, -0.0002498626708984375, 0.00885009765625, -0.0045166015625, 0.01171875, -0.0030364990234375, 0.0019378662109375, -0.0...

[ 10666, 10187, 297, 866, 268, 62539, 294, 8152, 619, 1603, 397, 16, 438, 454, 14, 23, 391, 70802, 177, 2203, 3664, 12779, 154663, 5, 12765, 5021, 112, 18468, 31611, 64287, 4, 7, 31, 2077, 248, 15, 18499, 87388, 58229, 15403, 9, 73852, ...

[ 0.0249481201171875, 0.19921875, 0.19384765625, 0.119873046875, 0.00579833984375, 0.128662109375, 0.09503173828125, 0.006103515625, 0.03448486328125, 0.138671875, 0.107177734375, 0.00592041015625, 0.1700439453125, 0.0469970703125, 0.0843505859375, 0.06390380859375, 0.14794921875, 0....

embed

35485185_c0

35485185

prolog

0

Title: Puzzle taken from Gardner Problem title: Puzzle taken from Gardner Tags: constraint-programming, prolog, clpfd Problem: Puzzle taken from Gardner I'm trying to solve the following puzzle in Prolog: Ten cells numbered 0,...,9 inscribe a 10-digit number such that each cell, say i, indicates the total number of occ...

Puzzle taken from Gardner Puzzle taken from Gardner constraint-programming prolog clpfd Gardner a Puzzle Count f.e Pos List I-1 ten_digit Nul Rest Digits Puzzle taken from Gardner I'm trying to solve the following puzzle in Prolog: This is what I wrote in Prolog but I'm stuck, I think there is something wrong with my t...

[ -0.00008726119995117188, -0.00604248046875, 0.001800537109375, 0.00994873046875, -0.012939453125, 0.0023345947265625, -0.03271484375, -0.004058837890625, 0.00201416015625, -0.048095703125, -0.01483154296875, 0.002410888671875, 0.005645751953125, 0.009033203125, 0.0034027099609375, -0.0...

[ 179277, 39958, 1295, 90968, 1679, 2816, 4288, 28966, 502, 4867, 33139, 39557, 71, 108210, 13498, 32036, 87, 5759, 1492, 4803, 541, 202, 49756, 51174, 933, 31577, 86869, 25632, 104192, 1250, 3293, 54397, 23, 179933, 5351, 44691, 454, 217, 16...

[ 0.2060546875, 0.06256103515625, 0.0902099609375, 0.1944580078125, 0.231201171875, 0.0892333984375, 0.0225372314453125, 0.036346435546875, 0.08538818359375, 0.191162109375, 0.000518798828125, 0.0477294921875, 0.055694580078125, 0.1424560546875, 0.131591796875, 0.09954833984375, 0.0475...

embed

41683508_c0

41683508

prolog

0

Title: Recursively defined function of two integers in Prolog (partition function) Problem title: Recursively defined function of two integers in Prolog (partition function) Tags: recursion, number-theory, prolog Problem: Recursively defined function of two integers in Prolog (partition function) I swear this isn't a h...

Recursively defined function of two integers in Prolog (partition function) Recursively defined function of two integers in Prolog (partition function) recursion number-theory prolog Recursively Prolog stackoverflow.com N-K Recursively defined function of two integers in Prolog (partition function) I swear this isn't a...

[ -0.01031494140625, 0.00130462646484375, 0.01123046875, -0.003387451171875, -0.003509521484375, -0.0120849609375, -0.0098876953125, -0.00897216796875, -0.00167083740234375, -0.00341796875, 0.0242919921875, -0.000396728515625, -0.0240478515625, 0.0068359375, 0.024169921875, -0.0044555664...

[ 853, 48650, 5844, 61924, 32354, 6626, 892, 26255, 1250, 4867, 15866, 1363, 195625, 1830, 14012, 2347, 502, 605, 52113, 18244, 2967, 38246, 29966, 61112, 23662, 54799, 99942, 26168, 2878, 17569, 9790, 33636, 2060, 5809, 2046, 705, 41600, 209, ...

[ 0.0772705078125, 0.211669921875, 0.1146240234375, 0.17626953125, 0.1849365234375, 0.1590576171875, 0.1474609375, 0.0872802734375, 0.1427001953125, 0.2437744140625, 0.1824951171875, 0.1263427734375, 0.226806640625, 0.060821533203125, 0.11669921875, 0.000213623046875, 0.1082763671875, ...

embed

33960346_c0

33960346

prolog

0

Title: Output |... confuses me Problem title: Output |... confuses me Tags: geometry, list, prolog Problem: Output |... confuses me EDIT: What I need is a flag to denote when I am below the center. I am trying to get this shape , but I fail to fill the last level correctly! My latest code: :- use_module(library(clpfd))...

Output |... confuses me Output |... confuses me geometry list prolog Output use_module Dim Fill Below_center init_sublists init_zeroes NewFill edw1 Output |... confuses me EDIT: What I need is a flag to denote when I am below the center. I am trying to get this shape , but I fail to fill the last level correctly! My la...

[ -0.004302978515625, 0.0172119140625, 0.0018310546875, -0.0020294189453125, -0.033447265625, 0.00897216796875, -0.0069580078125, 0.00927734375, 0.0091552734375, 0.0294189453125, 0.01007080078125, 0.00677490234375, 0.01531982421875, 0.00830078125, 0.01129150390625, 0.01116943359375, 0....

[ 13538, 7077, 55681, 5908, 163, 27, 700, 87739, 53, 5303, 502, 4867, 4527, 83279, 45247, 140423, 17336, 30090, 23, 217, 22144, 6562, 80510, 2356, 919, 5713, 2223, 434, 418, 172864, 3871, 49938, 8, 48345, 3229, 444, 35064, 27585, 115700, 35...

[ 0.171875, 0.1844482421875, 0.1661376953125, 0.1444091796875, 0.135009765625, 0.02056884765625, 0.047637939453125, 0.138916015625, 0.00982666015625, 0.1866455078125, 0.1436767578125, 0.206787109375, 0.0997314453125, 0.1392822265625, 0.1812744140625, 0.1829833984375, 0.2318115234375, ...

embed

51827926_c0

51827926

prolog

0

Title: Arguments are not sufficiently instantiated with prolog clpfd Problem title: Arguments are not sufficiently instantiated with prolog clpfd Tags: clpfd, prolog Problem: Arguments are not sufficiently instantiated with prolog clpfd computeShapeBelow(Shape1,Shape2) :- nth0(2,Shape1,Location1), nth0(2,Shape2,Locatio...

Arguments are not sufficiently instantiated with prolog clpfd Arguments are not sufficiently instantiated with prolog clpfd clpfd prolog Arguments ERROR instantiation_error _9234 clpfd:drep_to_domain _9270..15 _9266 clpfd.pl:3652 clpfd:clpfd_in _9302 _9308..15 clpfd.pl:1608 _9370 use_module Shape1 Shape2 nth0 Location1...

[ 0.0027008056640625, 0.01055908203125, -0.006988525390625, 0.0179443359375, -0.00007724761962890625, 0.0145263671875, -0.0108642578125, -0.006683349609375, 0.007781982421875, 0.0234375, 0.0164794921875, -0.01708984375, 0.0123291015625, 0.000797271728515625, 0.031005859375, -0.0073242187...

[ 112140, 7, 959, 129980, 538, 34648, 14, 27686, 678, 502, 4867, 33139, 39557, 71, 151206, 24638, 188800, 12231, 10289, 7090, 254, 188, 56206, 5757, 1837, 14604, 12744, 34937, 11591, 9550, 4527, 83279, 7224, 304, 927, 2389, 90788, 45247, 3227...

[ 0.2822265625, 0.09912109375, 0.1021728515625, 0.201904296875, 0.05023193359375, 0.1680908203125, 0.149658203125, 0.091552734375, 0.071533203125, 0.169189453125, 0.247314453125, 0.093505859375, 0.1572265625, 0.1309814453125, 0.1536865234375, 0.07275390625, 0.20166015625, 0.140625, ...

embed

47116666_c0

47116666

prolog

0

Title: findall(X,condition,List) list is filled with pointers and not real objects Problem title: findall(X,condition,List) list is filled with pointers and not real objects Tags: prolog, prolog-findall Problem: findall(X,condition,List) list is filled with pointers and not real objects I am trying to get a list full o...

findall(X,condition,List) list is filled with pointers and not real objects findall(X,condition,List) list is filled with pointers and not real objects prolog prolog-findall List _G2044 _G2041 _G2038 _G2035 findall(X,condition,List) list is filled with pointers and not real objects I am trying to get a list full of obj...

[ 0.0162353515625, -0.0030975341796875, 0.0023040771484375, 0.0147705078125, -0.013427734375, 0.01409912109375, -0.01251220703125, -0.0030975341796875, 0.005645751953125, -0.046875, 0.031494140625, -0.007110595703125, 0.01080322265625, -0.0096435546875, -0.004791259765625, 0.005523681640...

[ 7413, 5584, 1542, 126940, 154663, 5303, 83, 152382, 678, 6275, 1314, 959, 2773, 36746, 502, 4867, 111607, 32036, 1549, 12465, 8894, 10991, 5843, 31577, 2046, 4393, 1295, 63399, 11177, 35431, 54397, 1653, 2063, 41, 3129, 9836, 1556, 79315, 2...

[ 0.1641845703125, 0.2098388671875, 0.1107177734375, 0.225341796875, 0.169189453125, 0.213623046875, 0.021148681640625, 0.15380859375, 0.0264739990234375, 0.1934814453125, 0.1463623046875, 0.09100341796875, 0.1395263671875, 0.17578125, 0.0950927734375, 0.16796875, 0.124755859375, 0.1...

embed

19103880_c0

19103880

prolog

0

Title: Declare a variable Problem title: Declare a variable Tags: prolog, variables Problem: Declare a variable I didn't touch Prolog since high-school, and even though I've tried to find the info, it didn't help. Below is the example that has to illustrate my problem: %% everybody():- [dana, cody, bess, abby]. %% Ever...

Declare a variable Declare a variable prolog variables Declare Everybody likes_somebody likes_everybody Declare a variable I didn't touch Prolog since high-school, and even though I've tried to find the info, it didn't help. Below is the example that has to illustrate my problem: How do I declare everybody to just be t...

[ 0.00982666015625, 0.006805419921875, -0.0123291015625, 0.0274658203125, -0.004608154296875, 0.02587890625, -0.003204345703125, -0.00007200241088867188, 0.0128173828125, -0.02197265625, -0.00164031982421875, -0.00537109375, -0.01324462890625, 0.007293701171875, 0.0198974609375, 0.019653...

[ 25755, 38103, 77336, 502, 4867, 87769, 37873, 1884, 7, 104643, 18, 23996, 1250, 16792, 11192, 48738, 3004, 4358, 27781, 58755, 2967, 11249, 54, 87, 159978, 195348, 47, 1660, 186, 5303, 111, 29526, 6868, 124519, 37842, 184307, 18499, 89914, ...

[ 0.1417236328125, 0.1856689453125, 0.30517578125, 0.12841796875, 0.2261962890625, 0.09295654296875, 0.1922607421875, 0.2403564453125, 0.06451416015625, 0.0968017578125, 0.0316162109375, 0.10296630859375, 0.1263427734375, 0.019439697265625, 0.03619384765625, 0.0914306640625, 0.05917358...

embed

679728_c0

679728

prolog

0

Title: Prolog Family tree Problem title: Prolog Family tree Tags: prolog Problem: Prolog Family tree I did it but its not showing answers When i ask about the brothers,sisters,uncles,aunts This is what I wrote, what's wrong ? /*uncle(X, Y) :– male(X), sibling(X, Z), parent(Z, Y).*/ /*uncle(X, Y) :– male(X), spouse(X, W...

Prolog Family tree Prolog Family tree prolog Prolog Family Prolog Family tree I did it but its not showing answers When i ask about the brothers,sisters,uncles,aunts This is what I wrote, what's wrong ? And one more thing, how do I optimize the rule of the brother so that X is not brother to itself.

[ 0.033447265625, -0.0068359375, 0.0123291015625, 0.0030517578125, -0.024658203125, -0.0004634857177734375, -0.0029296875, 0.0000553131103515625, 0.0037994384765625, -0.027587890625, -0.0024566650390625, -0.0296630859375, 0.00518798828125, 0.01080322265625, 0.014404296875, 0.002975463867...

[ 1250, 4867, 59745, 53201, 502, 6777, 442, 1284, 6863, 959, 141377, 35166, 26458, 1672, 82953, 7, 172, 37499, 309, 66695, 916, 16037, 54397, 2367, 44691, 15572, 20650, 79986, 111, 1193, 83, 47, 68034 ]

[ 0.1085205078125, 0.21240234375, 0.03143310546875, 0.2017822265625, 0.0733642578125, 0.0357666015625, 0.01800537109375, 0.0274505615234375, 0.06781005859375, 0.0782470703125, 0.1146240234375, 0.1695556640625, 0.12005615234375, 0.043548583984375, 0.14794921875, 0.053955078125, 0.063781...

embed

44400495_c0

44400495

prolog

0

Title: Get all possible binary trees using Prolog? Problem title: Get all possible binary trees using Prolog? Tags: prolog, binary-tree Problem: Get all possible binary trees using Prolog? I'm aware there are lots of questions about defining a binary tree to check whether something is a binary tree or not,but i could n...

Get all possible binary trees using Prolog? Get all possible binary trees using Prolog? prolog binary-tree Prolog Get es_arbol Get all possible binary trees using Prolog? I'm aware there are lots of questions about defining a binary tree to check whether something is a binary tree or not,but i could not find a thread t...

[ 0.03369140625, 0.00494384765625, -0.003997802734375, -0.00909423828125, 0.0069580078125, 0.0194091796875, -0.0218505859375, -0.011474609375, 0.00160980224609375, -0.042724609375, 0.004058837890625, -0.0220947265625, -0.01153564453125, 0.0230712890625, 0.02392578125, 0.007415771484375, ...

[ 20779, 756, 7722, 2394, 6635, 1360, 90, 17368, 1250, 4867, 502, 62600, 198, 147, 7296, 13204, 449, 53201, 12765, 2146, 77087, 48225, 179933, 95486, 7013, 56464, 32354, 35839, 678, 110, 10750, 30646, 177, 15555, 8305, 7108, 29481, 140992, 24...

[ 0.08856201171875, 0.135498046875, 0.171142578125, 0.1876220703125, 0.10430908203125, 0.2274169921875, 0.1005859375, 0.0799560546875, 0.15185546875, 0.235595703125, 0.12548828125, 0.21337890625, 0.077880859375, 0.075439453125, 0.209716796875, 0.10107421875, 0.004974365234375, 0.2670...

embed

23649534_c0

23649534

prolog

0

Title: Use of cumulatives Problem title: Use of cumulatives Tags: prolog, sicstus-prolog, clpfd Problem: Use of cumulatives I'm working on a problem where I use the cumulatives/[2,3] predicate. But I get very bad performance when I try to combine this with minimize in labeling I have the following demo. 10 task, all wi...

Use of cumulatives Use of cumulatives prolog sicstus-prolog clpfd Use use_module Lab S10 Starttimes E10 Endtimeds M10 MachineIds All Tasks Machines MaxEndTime Make time_out LabOpt Vars Use of cumulatives I'm working on a problem where I use the cumulatives/[2,3] predicate. But I get very bad performance when I try to c...

[ 0.01239013671875, 0.002655029296875, 0.015625, -0.001617431640625, -0.0185546875, -0.00799560546875, 0.005889892578125, -0.0022125244140625, 0.01220703125, -0.06201171875, -0.0037841796875, -0.0031280517578125, 0.0223388671875, 0.01226806640625, 0.004241943359375, -0.0201416015625, 0...

[ 36836, 111, 314, 19908, 42991, 502, 4867, 26536, 18253, 3454, 39557, 71, 4527, 83279, 21488, 159, 963, 13794, 70141, 241, 18878, 6032, 276, 68311, 3164, 9598, 9920, 152378, 70059, 1733, 6056, 39029, 18, 3323, 20697, 2967, 64, 1065, 155761, ...

[ 0.139892578125, 0.05133056640625, 0.1519775390625, 0.2423095703125, 0.2398681640625, 0.1239013671875, 0.1800537109375, 0.034881591796875, 0.1827392578125, 0.09002685546875, 0.0149383544921875, 0.0517578125, 0.125732421875, 0.1146240234375, 0.158447265625, 0.031280517578125, 0.1802978...

embed

50706676_c0

50706676

prolog

0

Title: Prolog sudoku solver Problem title: Prolog sudoku solver Tags: clpfd, prolog, sudoku Problem: Prolog sudoku solver I'm new in prolog. I found a sudoku solver from swish.swi-prolog.org that I can't understan how this code predicates each elements of this puzzle! at least I can't figure out which lines of this cod...

Prolog sudoku solver Prolog sudoku solver clpfd prolog sudoku the Prolog use_rendering use_module Example Markus Triska SWI-Prolog Rows same_length all_distinct Columns Bs1 Bs2 Bs3 Prolog sudoku solver I'm new in prolog. I found a sudoku solver from swish.swi-prolog.org that I can't understan how this code predicates e...

[ -0.003631591796875, 0.0120849609375, 0.01904296875, -0.006805419921875, -0.018798828125, 0.003753662109375, 0.00469970703125, 0.00162506103515625, -0.003814697265625, -0.038330078125, -0.010986328125, -0.0179443359375, 0.007110595703125, 0.0020599365234375, -0.02001953125, 0.0308837890...

[ 1250, 4867, 8932, 38067, 3115, 814, 39557, 71, 502, 4527, 18280, 2852, 83279, 89536, 111246, 4699, 937, 38969, 10752, 96190, 5701, 23986, 756, 38893, 233987, 304, 363, 3525, 14037, 114686, 2452, 3454, 1478, 831, 18, 1379, 4384, 3642, 903, ...

[ 0.1583251953125, 0.271484375, 0.1358642578125, 0.1878662109375, 0.1236572265625, 0.125, 0.01654052734375, 0.0750732421875, 0.1378173828125, 0.103759765625, 0.07098388671875, 0.035400390625, 0.125, 0.07000732421875, 0.1378173828125, 0.1171875, 0.1488037109375, 0.1082763671875, 0.1...

embed

21366915_c0

21366915

prolog

0

Title: swipl increment cursor in recursive function Problem title: swipl increment cursor in recursive function Tags: recursion, tail-recursion, prolog Problem: swipl increment cursor in recursive function I am very green with Prolog. I have a 7-by-7 grid and for each cell I store the X , the Y , and two other things, ...

swipl increment cursor in recursive function swipl increment cursor in recursive function recursion tail-recursion prolog reset_cell reset_grid swipl increment cursor in recursive function I am very green with Prolog. I have a 7-by-7 grid and for each cell I store the X , the Y , and two other things, like this: cell(1...

[ -0.010009765625, 0.037353515625, 0.01092529296875, 0.019775390625, 0.00555419921875, -0.000606536865234375, -0.0203857421875, -0.0022430419921875, -0.0093994140625, -0.0010528564453125, 0.02197265625, 0.006988525390625, -0.01904296875, 0.006011962890625, 0.01611328125, 0.00494384765625...

[ 2452, 2424, 158661, 13810, 42, 23, 195625, 5844, 32354, 1830, 46741, 107, 48650, 502, 4867, 168398, 34680, 120067, 4552, 50997, 1250, 14104, 1272, 16709, 12638, 38750, 4343, 1193, 70, 990, 6626, 8966, 1884, 903, 41600, 106, 757, 3444, 37317...

[ 0.1690673828125, 0.2060546875, 0.250244140625, 0.1766357421875, 0.10223388671875, 0.033111572265625, 0.1883544921875, 0.126220703125, 0.1817626953125, 0.012359619140625, 0.202392578125, 0.011810302734375, 0.1181640625, 0.0784912109375, 0.2042236328125, 0.24267578125, 0.1712646484375,...

embed

28821545_c0

28821545

prolog

0

Title: Prolog: finding intersection of two lists? Problem title: Prolog: finding intersection of two lists? Tags: prolog Problem: Prolog: finding intersection of two lists? Let's say I have Prolog facts such as: fact1(x, [y1, y2, y3, y4]). fact2(z1, [s, t, u, **y3**). fact2(z2, [o, p, **y1**, q, r]). fact2(z3, [**y1**,...

Prolog: finding intersection of two lists? Prolog: finding intersection of two lists? prolog Prolog fact1 fact2 Prolog: finding intersection of two lists? Let's say I have Prolog facts such as: And, I want a query such that I get all the 'z' who are related to x. Thus, this query should output z1, z2, z3, z4, z5, z6 be...

[ 0.018310546875, -0.0002498626708984375, 0.007568359375, 0.017578125, -0.00665283203125, 0.022705078125, -0.0018768310546875, -0.0021209716796875, 0.01141357421875, -0.0267333984375, 0.00823974609375, 0.02685546875, -0.01373291015625, -0.0223388671875, 0.01019287109375, 0.005126953125, ...

[ 1250, 4867, 90791, 1940, 7, 58994, 111, 6626, 5303, 502, 15824, 418, 304, 3444, 41, 1294, 2046, 756, 70, 169, 2750, 621, 62548, 47, 1022, 5608, 140992, 97, 363, 617, 758, 910, 6637, 70541, 12830, 113, 5117, 25632, 18151, 41911, 82825, ...

[ 0.1856689453125, 0.2454833984375, 0.1519775390625, 0.1846923828125, 0.1678466796875, 0.173583984375, 0.03814697265625, 0.127197265625, 0.208251953125, 0.1455078125, 0.150634765625, 0.0526123046875, 0.125732421875, 0.09234619140625, 0.148681640625, 0.1356201171875, 0.09661865234375, ...

embed

8564332_c0

8564332

prolog

0

Title: tiles game . I can't act Problem title: tiles game . I can't act Tags: tiles, prolog Problem: tiles game . I can't act I am trying to make 8-tiles problem in prolog but my code is not running . To be more specific when I type an action then I take false. move([0, Y, Z], [Y, 0, Z], right). move([X, 0, Z...

tiles game . I can't act tiles game . I can't act tiles prolog arc_horiz Direction arc_vert RowState1 RowState2 ColState1 ColState2 State1 State2 Goal Actions Action INITIAL tiles game . I can't act I am trying to make 8-tiles problem in prolog but my code is not running . To be more specific when I type an a...

[ 0.010009765625, 0.0167236328125, 0.0242919921875, 0.01806640625, -0.01177978515625, -0.0030670166015625, -0.029296875, 0.00897216796875, -0.00799560546875, -0.01251220703125, 0.01263427734375, 0.02587890625, -0.01092529296875, 0.0146484375, -0.0029754638671875, 0.0047607421875, 0.003...

[ 139, 90, 6712, 87, 831, 3768, 18, 27992, 502, 4867, 46552, 497, 14096, 176774, 11549, 96190, 135206, 11554, 22836, 2016, 57945, 35522, 7842, 31577, 15045, 118, 1577, 2967, 18151, 959, 51042, 10644, 22631, 98320 ]

[ 0.21630859375, 0.124267578125, 0.1373291015625, 0.010009765625, 0.0718994140625, 0.017425537109375, 0.08331298828125, 0.174560546875, 0.142822265625, 0.1854248046875, 0.08673095703125, 0.0728759765625, 0.095703125, 0.1529541015625, 0.1141357421875, 0.0975341796875, 0.062744140625, ...

embed

16208038_c0

16208038

prolog

0

Title: Prolog: Appending a List fails and Not too sure why Problem title: Prolog: Appending a List fails and Not too sure why Tags: prolog, list, append Problem: Prolog: Appending a List fails and Not too sure why I am relatively new to prolog and what I am trying to do is create a list, but I seem to be encountering a...

Prolog: Appending a List fails and Not too sure why Prolog: Appending a List fails and Not too sure why prolog list append Prolog Appending List Not Prolog: Appending a List fails and Not too sure why I am relatively new to prolog and what I am trying to do is create a list, but I seem to be encountering an error and I...

[ 0.004913330078125, 0.00830078125, 0.01385498046875, 0.01806640625, 0.0023651123046875, 0.0198974609375, -0.004302978515625, 0.01123046875, 0.00421142578125, -0.0252685546875, 0.0230712890625, -0.020263671875, -0.020263671875, 0.00482177734375, 0.0228271484375, -0.002410888671875, 0.0...

[ 1250, 4867, 5787, 96819, 10, 32036, 35782, 5792, 9077, 502, 5303, 114689, 71, 11205, 28282, 190647, 18499, 144851, 206468, 6083, 79897, 366, 2189, 5443, 19107, 125592, 63258, 170, 3613, 18241, 49512, 254, 26265, 9007, 3611, 192616, 1819, 1295...

[ 0.1483154296875, 0.1805419921875, 0.11279296875, 0.130859375, 0.013275146484375, 0.1978759765625, 0.161865234375, 0.0469970703125, 0.04559326171875, 0.1248779296875, 0.1776123046875, 0.1534423828125, 0.052490234375, 0.0133056640625, 0.0523681640625, 0.005218505859375, 0.13720703125, ...

embed

29361220_c0

29361220

prolog

0

Title: Prolog - Multiplying A list with an uninstantiated list Problem title: Prolog - Multiplying A list with an uninstantiated list Tags: prolog Problem: Prolog - Multiplying A list with an uninstantiated list The input to this predicate is S, a list of integers I, and a list of integers T. Assumption is that both S ...

Prolog - Multiplying A list with an uninstantiated list Prolog - Multiplying A list with an uninstantiated list prolog Prolog Multiplying use_module mult_prod sum_prod Accum Accum1 Prolog - Multiplying A list with an uninstantiated list The input to this predicate is S, a list of integers I, and a list of integers T. A...

[ -0.026611328125, 0.03125, 0.027587890625, 0.01458740234375, -0.038818359375, -0.01055908203125, -0.02197265625, 0.005279541015625, 0.000545501708984375, -0.0216064453125, 0.0167236328125, 0.0244140625, -0.004058837890625, 0.01165771484375, -0.0172119140625, 0.0164794921875, 0.0274658...

[ 1250, 4867, 19335, 62479, 5303, 678, 51, 143034, 14, 27686, 502, 4527, 83279, 3869, 112348, 10554, 29899, 316, 107730, 1653, 2063, 159, 892, 26255, 87, 384, 71836, 89554, 34648, 32354, 118126, 5117, 12830, 17932, 6528, 151994, 19441, 214493, ...

[ 0.1141357421875, 0.188720703125, 0.0982666015625, 0.1563720703125, 0.195556640625, 0.03997802734375, 0.06744384765625, 0.142333984375, 0.1146240234375, 0.068603515625, 0.08294677734375, 0.0980224609375, 0.1322021484375, 0.1160888671875, 0.192138671875, 0.1431884765625, 0.062194824218...

embed

61414447_c0

61414447

prolog

0

Title: Checking if a list of variables is unifiable with a list of lists containing letters Problem title: Checking if a list of variables is unifiable with a list of lists containing letters Tags: list, unification, prolog Problem: Checking if a list of variables is unifiable with a list of lists containing letters I ...

Checking if a list of variables is unifiable with a list of lists containing letters Checking if a list of variables is unifiable with a list of lists containing letters list unification prolog Checking spaces_uni Spc LstWords Words Space Checking if a list of variables is unifiable with a list of lists containing lett...

[ -0.0009765625, 0.012939453125, -0.0021209716796875, -0.0016326904296875, -0.0172119140625, -0.005523681640625, -0.000751495361328125, -0.00262451171875, 0.007568359375, 0.00171661376953125, 0.01287841796875, 0.006591796875, 0.024658203125, -0.0106201171875, -0.0108642578125, 0.01940917...

[ 38679, 2174, 5303, 77336, 83, 51, 27430, 2886, 678, 70541, 120820, 41274, 502, 4867, 32628, 5980, 8019, 238, 339, 271, 164805, 22543, 43045, 214, 1653, 2063, 7, 31923, 866, 1511, 34153, 31, 42, 177, 11, 60042, 67, 12765, 2565, 831, 4038...

[ 0.1573486328125, 0.060028076171875, 0.1795654296875, 0.227783203125, 0.0295867919921875, 0.1502685546875, 0.1390380859375, 0.1231689453125, 0.115234375, 0.0867919921875, 0.1715087890625, 0.051025390625, 0.07196044921875, 0.1265869140625, 0.1827392578125, 0.1689453125, 0.0966796875, ...

embed

41325535_c1

41325535

prolog

1

%%%%%%%%%%%%%%%%%%%%%%%%%%% planExecute(P):-testPlan(P,E),writeExec(E),!. satisfiedGoal(E):- objectivos(Fn),!, sub(Fn,E). testPlan(Plan,[I|Exec]) :- inicial(I), testPlan(Plan,I,Exec,Fn), satisfiedGoal(Fn). testPlan([],Fn,[],Fn). testPlan([H|T],S,[H,N|Exec],Fn) :- accao(nome:H, condicoes:C,efeitos:E, restricoes:R), sub...

[ -0.006805419921875, 0.005523681640625, -0.0027313232421875, 0.033203125, -0.019775390625, 0.0026092529296875, -0.017822265625, -0.007049560546875, 0.03466796875, 0.0033111572265625, 0.0198974609375, 0.0255126953125, -0.01556396484375, -0.0133056640625, 0.0023040771484375, 0.01324462890...

[ 1745, 3949, 1774, 211603, 13, 132, 683, 9, 6954, 78680, 647, 434, 18781, 19279, 3240, 38, 214521, 17903, 289, 36746, 40345, 919, 19, 1614, 3034, 568, 15772, 50974, 841, 618, 294, 839, 1030, 123142, 64970, 158, 55455, 89286, 66206, 587, ...

[ 0.082763671875, 0.0782470703125, 0.2451171875, 0.29736328125, 0.1103515625, 0.032623291015625, 0.1358642578125, 0.0306549072265625, 0.212158203125, 0.259521484375, 0.09613037109375, 0.0025634765625, 0.089599609375, 0.077392578125, 0.1822509765625, 0.0716552734375, 0.21533203125, 0....

embed

37372037_c1

37372037

prolog

1

FlatSubmatrixArray, FlatSubmatrix), % Cell count in rectangle must equal HintNumber %length(FlatSubmatrix, HintNumber), % All cells in rectangle must have ID as value %FlatSubmatrixArray[1..HintNumber] :: ID ) ), % Start searching labeling(Matrix), writematrix(Matrix, Width, Height, HintsArray). writematrix(Matrix, Wid...

[ -0.01153564453125, 0.007354736328125, 0.00640869140625, 0.006591796875, 0.009765625, -0.0113525390625, -0.015625, -0.00750732421875, 0.007537841796875, -0.0025634765625, -0.0186767578125, -0.0089111328125, 0.006805419921875, 0.0162353515625, -0.007293701171875, -0.012939453125, 0.014...

[ 106516, 96472, 192, 87427, 7614, 7092, 1745, 80743, 54529, 148734, 449, 133, 8110, 105950, 19895, 18, 18444, 26278, 23986, 2335, 38750, 11338, 34292, 841, 4288, 157318, 67967, 4613, 33022, 58302, 22553, 1529, 2783, 237, 54704, 21455, 568, 961...

[ 0.23291015625, 0.203857421875, 0.0791015625, 0.1439208984375, 0.04339599609375, 0.12841796875, 0.002227783203125, 0.1710205078125, 0.1614990234375, 0.09942626953125, 0.0892333984375, 0.04156494140625, 0.053497314453125, 0.1337890625, 0.18896484375, 0.060150146484375, 0.061279296875, ...

embed

47581135_c0

47581135

prolog

0

Title: Prolog chess knight algorithm Problem title: Prolog chess knight algorithm Tags: algorithm, knights-tour, prolog Problem: Prolog chess knight algorithm I'm trying to resolve chess knight problem for custom matrix but I don't know where is problem. A chess knight must visit each place once, and when he manages to...

Prolog chess knight algorithm Prolog chess knight algorithm algorithm knights-tour prolog Prolog POINT Xmax Ymax Prolog chess knight algorithm I'm trying to resolve chess knight problem for custom matrix but I don't know where is problem. A chess knight must visit each place once, and when he manages to visit all field...

[ -0.002960205078125, 0.0098876953125, 0.0240478515625, 0.0126953125, 0.002166748046875, 0.006805419921875, -0.01458740234375, 0.0167236328125, 0.0240478515625, -0.0263671875, 0.0020294189453125, 0.001373291015625, -0.01416015625, 0.0093994140625, -0.006378173828125, -0.02294921875, 0....

[ 1250, 4867, 290, 7, 472, 54350, 234873, 28889, 502, 8574, 59537, 1193, 24084, 990, 31577, 103608, 2967, 114122, 50944, 425, 2301, 18, 3714, 7440, 62, 8110, 19922, 12638, 3687, 24145, 111240, 756, 44457, 67229, 1528, 764, 16487, 26785, 16251...

[ 0.165771484375, 0.234130859375, 0.1820068359375, 0.1236572265625, 0.10638427734375, 0.2396240234375, 0.23876953125, 0.226318359375, 0.1221923828125, 0.133056640625, 0.1109619140625, 0.02581787109375, 0.173095703125, 0.041717529296875, 0.03717041015625, 0.129150390625, 0.139404296875,...

embed

20711208_c0

20711208

prolog

0

Title: Prolog infinite loop Problem title: Prolog infinite loop Tags: prolog, recursion Problem: Prolog infinite loop I'm fairly new to Prolog and I hope this question hasn't been asked and answered but if it has I apologize, I can't make sense of any of the other similar questions and answers. My problem is that I hav...

Prolog infinite loop Prolog infinite loop prolog recursion Prolog Prolog infinite loop I'm fairly new to Prolog and I hope this question hasn't been asked and answered but if it has I apologize, I can't make sense of any of the other similar questions and answers. My problem is that I have 3 towns, connected by roads. ...

[ 0.0201416015625, 0.0069580078125, 0.01007080078125, 0.0238037109375, -0.003173828125, -0.0026092529296875, -0.00537109375, -0.002593994140625, 0.00762939453125, -0.072265625, 0.0166015625, -0.0067138671875, -0.016845703125, -0.01025390625, 0.0205078125, 0.037109375, 0.006072998046875...

[ 1250, 4867, 54241, 13, 40956, 502, 195625, 1830, 180663, 3525, 15673, 194663, 12524, 10422, 21373, 2967, 765, 138, 59444, 162711, 33816, 17006, 1632, 3917, 6626, 48800, 10, 876, 501, 101935, 62488, 3871, 19048, 738, 1295, 47, 15490, 179933, ...

[ 0.1954345703125, 0.2447509765625, 0.18603515625, 0.0850830078125, 0.260498046875, 0.1524658203125, 0.250732421875, 0.057373046875, 0.03436279296875, 0.013275146484375, 0.033905029296875, 0.004119873046875, 0.0472412109375, 0.05902099609375, 0.009521484375, 0.12646484375, 0.0548095703...

embed

64807019_c0

64807019

prolog

0

Title: Finding the binary tree height in Prolog Problem title: Finding the binary tree height in Prolog Tags: binary-tree, prolog, recursion Problem: Finding the binary tree height in Prolog So I have a task to create a binary tree using the following facts that define each node with its two child nodes: node(root, a, ...

Finding the binary tree height in Prolog Finding the binary tree height in Prolog binary-tree prolog recursion Finding Prolog RootNode Height Left Right Finding the binary tree height in Prolog So I have a task to create a binary tree using the following facts that define each node with its two child nodes: I want to d...

[ 0.021240234375, 0.0123291015625, -0.000911712646484375, 0.004302978515625, 0.00213623046875, 0.0135498046875, -0.015625, -0.01397705078125, -0.00159454345703125, -0.051025390625, -0.012939453125, -0.03271484375, -0.010009765625, 0.00034332275390625, 0.031494140625, -0.0167236328125, ...

[ 26040, 2394, 6635, 53201, 155955, 1250, 4867, 62600, 502, 195625, 150948, 5021, 112, 1529, 22553, 2480, 90911, 66211, 28282, 15824, 61924, 110, 6626, 29041, 79986, 12724, 818, 74481, 4034, 111, 4989, 525, 62488, 74855, 2060, 16065, 2407, 2002...

[ 0.0743408203125, 0.1514892578125, 0.124267578125, 0.232666015625, 0.231689453125, 0.1473388671875, 0.209716796875, 0.190185546875, 0.0841064453125, 0.1275634765625, 0.152587890625, 0.1514892578125, 0.1427001953125, 0.1439208984375, 0.131591796875, 0.025421142578125, 0.05816650390625,...

embed

62174656_c1

62174656

prolog

1

shows: 1) the state-transition probability matrix A, b) the discrete emission/observation probabilities matrix B, and 3) the initial (prior) probabilities matrix π. The model is not hidden because you know the sequence of states from the colors of the coins and dice. Suppose, however, that someone else is generating t...

[ -0.0244140625, -0.002960205078125, -0.0126953125, 0.0281982421875, -0.01153564453125, 0.0093994140625, -0.006439208984375, 0.00159454345703125, 0.0103759765625, -0.0177001953125, -0.0086669921875, -0.000431060791015625, 0.0040283203125, 0.01171875, 0.010498046875, -0.00250244140625, ...

[ 45831, 4879, 11341, 30145, 14, 1363, 37242, 2481, 50944, 425, 62, 876, 81604, 13, 28, 21150, 64, 141331, 31075, 335, 4, 8439, 61475, 5293, 748, 16, 7823, 3299, 83, 959, 204105, 6637, 3714, 70, 40, 944, 111, 117249, 1295, 104988, 43780, ...

[ 0.1993408203125, 0.00640869140625, 0.1409912109375, 0.1483154296875, 0.07196044921875, 0.07891845703125, 0.265380859375, 0.1893310546875, 0.14013671875, 0.043609619140625, 0.0689697265625, 0.01495361328125, 0.14892578125, 0.04852294921875, 0.1361083984375, 0.177734375, 0.04052734375,...

embed

70669724_c0

70669724

prolog

0

Title: How using upcase_atom/2 in Prolog? Problem title: How using upcase_atom/2 in Prolog? Tags: swi-prolog, prolog Problem: How using upcase_atom/2 in Prolog? Here is a minimal theorem prover in Prolog: :- op(1110, xfy, =>). % conditional % ----------------------------------------------------------------- provable(F,...

How using upcase_atom/2 in Prolog? How using upcase_atom/2 in Prolog? swi-prolog prolog upcase_atom/2 How upcase_atom Prolog Initial i.e Conditional Proof How using upcase_atom/2 in Prolog? Here is a minimal theorem prover in Prolog: to prove identity : I do not succeed to write some lines of Prolog code to get with th...

[ 0.0155029296875, 0.00946044921875, 0.0172119140625, 0.02001953125, 0.00885009765625, 0.00897216796875, 0.006256103515625, 0.0074462890625, -0.005096435546875, -0.031494140625, 0.01519775390625, 0.000701904296875, 0.007415771484375, -0.0023345947265625, 0.025146484375, 0.004974365234375...

[ 11249, 17368, 1257, 58437, 5928, 12477, 23, 1250, 4867, 11, 2452, 3454, 502, 1890, 46347, 43315, 4390, 20187, 70, 58391, 814, 47, 23534, 182324, 959, 214493, 33022, 3060, 124519, 18151, 2046, 5701, 107730, 140992, 678, 34627, 77336, 10323, ...

[ 0.10601806640625, 0.143798828125, 0.138427734375, 0.2340087890625, 0.1910400390625, 0.2196044921875, 0.0595703125, 0.156494140625, 0.24560546875, 0.0186004638671875, 0.118408203125, 0.1090087890625, 0.0911865234375, 0.0496826171875, 0.17626953125, 0.0789794921875, 0.1220703125, 0.1...

embed

39815240_c0

39815240

prolog

0

Title: prolog doesn't give me a solution when one exists Problem title: prolog doesn't give me a solution when one exists Tags: prolog, prolog-dif, logical-purity Problem: prolog doesn't give me a solution when one exists I am working through Seven Languages in Seven Weeks , but there is something I don't und...

prolog doesn't give me a solution when one exists prolog doesn't give me a solution when one exists prolog prolog-dif logical-purity teams.pl prolog doesn't give me a solution when one exists I am working through Seven Languages in Seven Weeks , but there is something I don't understand about prolog. I have t...

[ 0.00848388671875, 0.014404296875, 0.00160980224609375, 0.01043701171875, -0.0198974609375, -0.00701904296875, -0.0052490234375, 0.00079345703125, 0.00640869140625, -0.0303955078125, 0.00927734375, 0.01019287109375, 0.0006256103515625, -0.002685546875, 0.0021820068359375, 0.012023925781...

[ 502, 4867, 22027, 3768, 18, 8337, 163, 10, 29806, 3229, 1632, 32316, 7, 428, 420, 62775, 289, 4717, 2481, 87199, 2424, 20697, 8305, 132556, 83658, 58417, 2301, 28219, 25632, 1528, 77007, 58982, 8509, 11969, 39, 4007, 72367, 1884, 2499, 51...

[ 0.188720703125, 0.275634765625, 0.0491943359375, 0.0290069580078125, 0.0899658203125, 0.08642578125, 0.0709228515625, 0.0850830078125, 0.2135009765625, 0.076904296875, 0.07403564453125, 0.2076416015625, 0.074951171875, 0.010894775390625, 0.040496826171875, 0.085205078125, 0.030853271...

embed

76290570_c1

76290570

prolog

1

weight paired with table 2: % weight(Kg) weight(10). weight(10). weight(10). weight(10). % balance weight-table pairs, Table 1 total KG, Table 2 total Kg balance([], 0, 0). balance([weight(Kg)-1 | Ws], Table1Total, Table2Total) :- Table1Total #= T1_ + Kg, balance(Ws, T1_, Table2Total). balance([weight(Kg)-2 | Ws], Tab...

[ 0.01544189453125, 0.0201416015625, -0.0118408203125, -0.0031890869140625, -0.01007080078125, 0.0125732421875, 0.0068359375, -0.0035400390625, -0.0025482177734375, 0.00421142578125, 0.0186767578125, 0.008544921875, 0.02734375, 0.0081787109375, 0.00311279296875, 0.003570556640625, 0.01...

[ 57888, 80836, 678, 23180, 15573, 1745, 605, 177, 90980, 40197, 22819, 112997, 106, 3622, 94397, 116, 341, 757, 165598, 5759, 601, 169473, 304, 418, 384, 997, 5428, 738, 8335, 481, 7413, 5584, 150533, 19770, 27494, 10461, 32920, 43719, 618, ...

[ 0.2144775390625, 0.19677734375, 0.005523681640625, 0.259765625, 0.1602783203125, 0.043670654296875, 0.03509521484375, 0.077880859375, 0.1187744140625, 0.209716796875, 0.198486328125, 0.220703125, 0.035552978515625, 0.0760498046875, 0.1103515625, 0.1065673828125, 0.0199737548828125, ...

embed

20804543_c0

20804543

prolog

0

Title: DCGs - how to split an atom into a list for further dcg rule processing Problem title: DCGs - how to split an atom into a list for further dcg rule processing Tags: prolog, dcg Problem: DCGs - how to split an atom into a list for further dcg rule processing I have a simple grammar, which takes 3 list items and r...

DCGs - how to split an atom into a list for further dcg rule processing DCGs - how to split an atom into a list for further dcg rule processing prolog dcg DCGs DCGs - how to split an atom into a list for further dcg rule processing I have a simple grammar, which takes 3 list items and runs a different dcg rule on each....

[ 0.00421142578125, -0.0025634765625, -0.002227783203125, 0.021484375, -0.00537109375, 0.0301513671875, -0.0016021728515625, -0.00299072265625, -0.004119873046875, -0.01312255859375, 0.0015869140625, 0.00830078125, -0.0140380859375, -0.000591278076171875, -0.003631591796875, 0.02734375, ...

[ 391, 56367, 7, 3642, 65450, 34627, 3934, 5303, 53333, 104, 238, 177, 79986, 9433, 47, 142, 100, 502, 4867, 8781, 122092, 147, 51776, 138, 55769, 127877, 12921, 12638, 28864, 43240, 5885, 2967, 107730, 27117, 116, 959, 17932, 158, 4460, 13...

[ 0.0985107421875, 0.216552734375, 0.0689697265625, 0.0828857421875, 0.24462890625, 0.2393798828125, 0.166748046875, 0.2122802734375, 0.07867431640625, 0.0638427734375, 0.06103515625, 0.1339111328125, 0.1700439453125, 0.0899658203125, 0.04925537109375, 0.036651611328125, 0.037322998046...

embed

66343215_c0

66343215

prolog

0

Title: Dealing with dynamic predicates that cause compilation failures Problem title: Dealing with dynamic predicates that cause compilation failures Tags: prolog, gnu-prolog Problem: Dealing with dynamic predicates that cause compilation failures I am attempting to run an example GNU Prolog program used as an example ...

Dealing with dynamic predicates that cause compilation failures Dealing with dynamic predicates that cause compilation failures prolog gnu-prolog Dealing Users Chase Desktop Prolog newAnimal.pro newAnimal.pro:74:12 Dealing with dynamic predicates that cause compilation failures I am attempting to run an example GNU Pro...

[ 0.0223388671875, 0.0037841796875, 0.0137939453125, 0.01470947265625, -0.016357421875, 0.0233154296875, 0.0128173828125, 0.0250244140625, -0.007049560546875, -0.038818359375, -0.01318359375, -0.01165771484375, -0.02734375, -0.0250244140625, 0.03564453125, 0.00872802734375, 0.010498046...

[ 90943, 678, 84079, 1653, 2063, 1636, 22304, 98352, 1363, 137578, 502, 4867, 104155, 3454, 53400, 4841, 184, 141423, 1250, 93, 2749, 81887, 11675, 27781, 165132, 1528, 15411, 4488, 18151, 198932, 6366, 15246, 84433, 77275, 2489, 2424, 124326, ...

[ 0.145263671875, 0.069091796875, 0.216552734375, 0.17431640625, 0.205078125, 0.08966064453125, 0.09814453125, 0.2125244140625, 0.023284912109375, 0.1754150390625, 0.103271484375, 0.20751953125, 0.11572265625, 0.13037109375, 0.1395263671875, 0.160400390625, 0.049896240234375, 0.13098...

embed

33137737_c0

33137737

prolog

0

Title: What value should be instead of "underscore"? Problem title: What value should be instead of "underscore"? Tags: logic, prolog Problem: What value should be instead of "underscore"? I'm learning Prolog and have the following given lines: Consider the following Prolog program. It contains fact...

What value should be instead of "underscore"? What value should be instead of "underscore"? logic prolog What Consider Prolog math100 cs330 phys210 ee100 What value should be instead of "underscore"? I'm learning Prolog and have the following given lines: And then there's a question: I've finished a...

[ 0.01373291015625, 0.009765625, 0.01092529296875, 0.0174560546875, -0.0296630859375, 0.022216796875, 0.002044677734375, 0.00054168701171875, 0.000705718994140625, -0.015869140625, 0.0042724609375, -0.004425048828125, -0.00677490234375, -0.002105712890625, -0.005706787109375, 0.016845703...

[ 4865, 34292, 5608, 186, 64457, 41502, 24658, 7, 30854, 62775, 502, 4867, 137399, 1250, 48909, 3559, 20763, 94375, 34053, 88142, 1804, 111, 124519, 122799, 44402, 63134, 100094, 454, 35166, 27489, 196592, 27685, 82512, 237259, 17932 ]

[ 0.071533203125, 0.2445068359375, 0.1566162109375, 0.059600830078125, 0.196044921875, 0.01824951171875, 0.27783203125, 0.12109375, 0.278564453125, 0.11376953125, 0.0902099609375, 0.2144775390625, 0.1209716796875, 0.134521484375, 0.0195770263671875, 0.1463623046875, 0.00213623046875, ...

embed

38607599_c0

38607599

prolog

0

Title: Categorising a list into two separate lists by type Problem title: Categorising a list into two separate lists by type Tags: list, prolog Problem: Categorising a list into two separate lists by type I'm still fairly new to Prolog and I've been having difficulties with an exercise involving lists: given a list of...

Categorising a list into two separate lists by type Categorising a list into two separate lists by type list prolog Categorising IntegerListHead FloatListHead IntHead IntList FloatHead FloatList ERROR Undefined DWIM Categorising a list into two separate lists by type I'm still fairly new to Prolog and I've been having ...

[ 0.00860595703125, -0.00311279296875, -0.0093994140625, 0.00469970703125, -0.02587890625, 0.017333984375, -0.0152587890625, -0.00982666015625, -0.0025787353515625, -0.0004711151123046875, 0.001495361328125, -0.0255126953125, -0.0152587890625, -0.00408935546875, -0.0003032684326171875, -...

[ 161637, 6953, 5303, 3934, 6626, 84797, 390, 10644, 502, 4867, 44401, 154663, 13025, 712, 38699, 151206, 24638, 79912, 5983, 30439, 17199, 1250, 34844, 81979, 34475, 61799, 2053, 1632, 70541, 892, 1505, 142424, 2773, 14012, 42077, 55769, 7311, ...

[ 0.2047119140625, 0.032684326171875, 0.2078857421875, 0.11865234375, 0.1617431640625, 0.1651611328125, 0.0738525390625, 0.2142333984375, 0.102294921875, 0.191650390625, 0.08349609375, 0.0980224609375, 0.1085205078125, 0.03118896484375, 0.10247802734375, 0.109130859375, 0.0170288085937...

embed

25793451_c1

25793451

prolog

1

, Result ):- Expression =.. [_, SubExpA], get_Subterms(SubExpA,[],PartResA), append(PartResA, [Expression|PartialResult], Result), !. get_Subterms( Expression, PartialResult, Result ):- !, Expression =.. [_, SubExpA, SubExpB], get_Subterms(SubExpA,[],PartResA), get_Subterms(SubExpB,[],PartResB), append(PartResA, PartRe...

[ -0.00982666015625, 0.00537109375, 0.017578125, 0.0185546875, -0.000335693359375, 0.006256103515625, -0.007415771484375, 0.00958251953125, 0.0198974609375, 0.0020294189453125, 0.017578125, 0.0023651123046875, -0.00927734375, -0.006866455078125, -0.00494384765625, -0.003021240234375, 0...

[ 4, 126684, 2077, 25129, 1830, 2203, 8273, 19279, 254, 284, 2046, 96472, 32166, 58229, 4332, 114689, 71, 178752, 15403, 7, 7136, 711, 9148, 289, 571, 1601, 78381, 139118, 839, 594, 180423, 8335, 481, 79986, 26951, 133, 17727, 866, 304, 418...

[ 0.064208984375, 0.2208251953125, 0.07373046875, 0.234130859375, 0.1929931640625, 0.124267578125, 0.149169921875, 0.10614013671875, 0.1341552734375, 0.10394287109375, 0.095703125, 0.14892578125, 0.2093505859375, 0.0777587890625, 0.030975341796875, 0.1114501953125, 0.0274810791015625, ...

embed

65173123_c1

65173123

prolog

1

6. get_card_suit(Card, hearts) :- mod(Card, 24) >= 2 * 6, mod(Card, 24) < 3 * 6. get_card_suit(Card, spades) :- mod(Card, 24) >= 3 * 6, mod(Card, 24) < 4 * 6. I also tested something else out. I replaced the get_cards_by_suit/3 definition with the following: get_cards_by_suit(List, Suit, [4, 5, 6, 7, 7]) :- write(List)...

[ -0.00628662109375, 0.00579833984375, 0.0037841796875, -0.006134033203125, -0.003143310546875, -0.010498046875, -0.01275634765625, -0.000797271728515625, 0.02587890625, -0.005096435546875, 0.00836181640625, 0.0286865234375, -0.022705078125, -0.009521484375, 0.0033111572265625, -0.014099...

[ 2289, 2046, 38931, 68879, 156119, 26498, 7, 2811, 744, 661, 305, 138, 5623, 988, 201, 3034, 1810, 91995, 1272, 18113, 80934, 154663, 1832, 190, 361, 33022, 13169, 41, 1294, 7413, 6639, 449, 525, 70731, 13, 13438, 49146, 43512, 226584, 415...

[ 0.119140625, 0.1253662109375, 0.25390625, 0.241455078125, 0.2349853515625, 0.2047119140625, 0.11962890625, 0.15478515625, 0.1287841796875, 0.0040283203125, 0.0928955078125, 0.0625, 0.1708984375, 0.1544189453125, 0.04425048828125, 0.1121826171875, 0.0200958251953125, 0.100830078125,...

embed

67689985_c0

67689985

prolog

0

Title: Prolog: How to write a predicate that calculates an integral? Problem title: Prolog: How to write a predicate that calculates an integral? Tags: integral, parameters, predicate, prolog Problem: Prolog: How to write a predicate that calculates an integral? I want to write a prediacte integrate(A, B, N, F, R), A i...

Prolog: How to write a predicate that calculates an integral? Prolog: How to write a predicate that calculates an integral? integral parameters predicate prolog Prolog How B-A Prolog: How to write a predicate that calculates an integral? I want to write a prediacte integrate(A, B, N, F, R), A is the lower boundary, B i...

[ -0.0016937255859375, -0.027587890625, 0.0032806396484375, 0.002197265625, -0.007354736328125, 0.0191650390625, 0.0076904296875, -0.022705078125, 0.0068359375, -0.004791259765625, 0.0108642578125, 0.0205078125, -0.0284423828125, 0.010498046875, 0.039794921875, -0.000728607177734375, 0...

[ 1250, 4867, 11249, 47, 33022, 1653, 2063, 67, 450, 74481, 1636, 28970, 10, 142, 171859, 502, 335, 9, 284, 3444, 14, 58967, 78779, 13, 541, 563, 627, 62, 83, 92319, 99091, 6635, 1407, 56, 14012, 206025, 32354, 126684, 74189, 18151, 4527,...

[ 0.15380859375, 0.19873046875, 0.10687255859375, 0.043365478515625, 0.222900390625, 0.2122802734375, 0.2386474609375, 0.142578125, 0.04986572265625, 0.23681640625, 0.08837890625, 0.2998046875, 0.02203369140625, 0.029510498046875, 0.1612548828125, 0.119140625, 0.1231689453125, 0.0397...

embed

23719009_c0

23719009

prolog

0

Title: Need assistance with similar More Money code for Prolog Problem title: Need assistance with similar More Money code for Prolog Tags: cryptarithmetic-puzzle, eclipse-clp, prolog Problem: Need assistance with similar More Money code for Prolog Every letter below in the puzzle uniquely represent one of the 10 digit...

Need assistance with similar More Money code for Prolog Need assistance with similar More Money code for Prolog cryptarithmetic-puzzle eclipse-clp prolog Need More Money Prolog List diff_list shallow_backtrack Tail Input1 Input2 Need assistance with similar More Money code for Prolog Every letter below in the puzzle un...

[ 0.00836181640625, -0.00164794921875, -0.00006341934204101562, 0.0174560546875, -0.0281982421875, 0.01312255859375, -0.0023193359375, 0.01031494140625, 0.00543212890625, -0.007049560546875, 0.00531005859375, -0.00408935546875, 0.029541015625, 0.018310546875, -0.00537109375, 0.0051269531...

[ 52889, 127557, 21373, 5455, 81669, 18151, 1250, 4867, 136791, 8962, 1766, 13894, 133, 106371, 184, 26775, 502, 32036, 71337, 6562, 35299, 8770, 12620, 125728, 1218, 379, 87769, 31330, 35064, 104192, 36998, 33636, 209, 153939, 757, 106, 3569, ...

[ 0.1473388671875, 0.1361083984375, 0.1259765625, 0.208251953125, 0.2333984375, 0.1798095703125, 0.14697265625, 0.2293701171875, 0.1177978515625, 0.0458984375, 0.048583984375, 0.06903076171875, 0.036468505859375, 0.1580810546875, 0.092529296875, 0.06390380859375, 0.0802001953125, 0.1...

embed

34072666_c0

34072666

prolog

0

Title: SWI Prolog homework assistance Problem title: SWI Prolog homework assistance Tags: prolog, sorting Problem: SWI Prolog homework assistance I'm kind of at a loss on how to tackle this homework project based on what I know about prolog (which, admittedly isn't a whole lot) Basically, we have a group of diners that...

SWI Prolog homework assistance SWI Prolog homework assistance prolog sorting SWI Prolog SWI Prolog homework assistance I'm kind of at a loss on how to tackle this homework project based on what I know about prolog (which, admittedly isn't a whole lot) Basically, we have a group of diners that rank their preferences on ...

[ 0.0098876953125, 0.01055908203125, 0.002227783203125, -0.00360107421875, -0.046630859375, 0.00469970703125, -0.0021820068359375, -0.0047607421875, 0.005706787109375, -0.01806640625, 0.009521484375, 0.021240234375, -0.0186767578125, -0.0238037109375, -0.0062255859375, -0.0155029296875, ...

[ 159, 38969, 1250, 4867, 5368, 18244, 127557, 502, 12096, 214, 8562, 86669, 3642, 36461, 13452, 35509, 3714, 21115, 149383, 30648, 2363, 205537, 24233, 45, 1495, 23468, 9351, 114942, 62, 335, 313, 391, 241, 69236, 83, 95486, 40, 9821, 23180,...

[ 0.081298828125, 0.24609375, 0.1668701171875, 0.2266845703125, 0.1082763671875, 0.1517333984375, 0.1650390625, 0.14794921875, 0.20361328125, 0.0758056640625, 0.0059814453125, 0.08685302734375, 0.0230712890625, 0.03192138671875, 0.069091796875, 0.09222412109375, 0.0206146240234375, 0...

embed

5439426_c1

5439426

prolog

1

(because in reality you shouldn't be able to attack one instance of an interaction twice). Then a new attack try is started. If an attack succeeds and the secret is leaked, a little info on how the attacker got the secret is written. tryToAttack(Secret) :- successfulRun(Init_1,Init_2,Init_3,RespGet_1,RespGet_2,RespGet...

[ -0.017822265625, 0.00494384765625, 0.01422119140625, 0.01531982421875, -0.010009765625, 0.013671875, -0.00157928466796875, 0.0035552978515625, 0.00109100341796875, -0.005828857421875, 0.0250244140625, 0.046630859375, -0.012939453125, 0.0177001953125, 0.032958984375, -0.0009384155273437...

[ 50081, 5608, 19048, 47, 52875, 1632, 110527, 182809, 186351, 194, 47009, 3525, 9790, 26859, 4263, 214493, 7, 23410, 95, 344, 10176, 3004, 3642, 56, 4163, 59121, 7763, 2310, 2594, 132, 237051, 15772, 65771, 163321, 4153, 217, 115187, 4, 304,...

[ 0.155517578125, 0.02435302734375, 0.0634765625, 0.0069580078125, 0.2666015625, 0.0731201171875, 0.149658203125, 0.207763671875, 0.196044921875, 0.0221710205078125, 0.024261474609375, 0.08013916015625, 0.1846923828125, 0.0889892578125, 0.0254058837890625, 0.1639404296875, 0.0004882812...

embed

40272699_c0

40272699

prolog

0

Title: Out of local stack error being thrown in list of lists Problem title: Out of local stack error being thrown in list of lists Tags: prolog Problem: Out of local stack error being thrown in list of lists My input: A list of lists with 0s and 1s. 0s being walkable blocks and 1s being walls. My starting point (1,1) ...

Out of local stack error being thrown in list of lists Out of local stack error being thrown in list of lists prolog Out Maze nth1 OldX OldY OldY-1 OldX-1 Path Out of local stack error being thrown in list of lists My input: A list of lists with 0s and 1s. 0s being walkable blocks and 1s being walls. My starting point ...

[ 0.01165771484375, 0.023681640625, -0.002685546875, 0.0247802734375, 0.00677490234375, 0.01397705078125, -0.0035858154296875, 0.010498046875, 0.01190185546875, -0.0478515625, 0.0186767578125, 0.0164794921875, 0.006439208984375, -0.0120849609375, 0.0172119140625, 0.00921630859375, -0.0...

[ 13538, 111, 4000, 177261, 18499, 8035, 104250, 23, 5303, 19, 502, 4867, 29678, 927, 418, 25074, 1542, 1723, 5759, 108421, 107730, 757, 106, 35691, 46389, 58982, 72134, 6275, 17727, 86658, 5036, 4527, 10461, 140992, 60875, 7514, 39958, 2046, ...

[ 0.1905517578125, 0.167236328125, 0.162841796875, 0.23779296875, 0.2255859375, 0.0230560302734375, 0.1524658203125, 0.07281494140625, 0.20556640625, 0.00250244140625, 0.1280517578125, 0.195556640625, 0.112060546875, 0.1392822265625, 0.0462646484375, 0.1212158203125, 0.13037109375, 0...

embed

21927188_c0

21927188

prolog

0

Title: Stack Trace Prolog Predicate Problem title: Stack Trace Prolog Predicate Tags: prolog, algorithm, backtracking, recursion Problem: Stack Trace Prolog Predicate I have a very simple min function written in Prolog, and I don't understand how it works. Code: min(E, [E]) :- write('case 1: '), write(E), nl. min(E, [E...

Stack Trace Prolog Predicate Stack Trace Prolog Predicate prolog algorithm backtracking recursion Stack Trace Prolog Predicate _L164 _G323 Stack Trace Prolog Predicate I have a very simple min function written in Prolog, and I don't understand how it works. Code: We've just started using Prolog in class, and I don't un...

[ 0.0194091796875, 0.00494384765625, -0.00543212890625, 0.01239013671875, -0.007049560546875, 0.0026397705078125, 0.00433349609375, -0.0010986328125, 0.00555419921875, -0.0196533203125, 0.0089111328125, 0.011474609375, -0.009521484375, -0.0159912109375, 0.0174560546875, 0.01519775390625,...

[ 6512, 2594, 4937, 329, 1250, 4867, 7145, 2063, 67, 502, 234873, 4420, 125728, 214, 195625, 1830, 154019, 363, 3742, 8781, 881, 32354, 59121, 2301, 18, 28219, 3642, 442, 43240, 28864, 18507, 151575, 5844, 50218, 1884, 28412, 63805, 7730, 98,...

[ 0.1156005859375, 0.08135986328125, 0.214599609375, 0.072509765625, 0.176513671875, 0.25390625, 0.1400146484375, 0.1741943359375, 0.03021240234375, 0.1552734375, 0.2083740234375, 0.1259765625, 0.238037109375, 0.006256103515625, 0.208740234375, 0.00128173828125, 0.1900634765625, 0.04...

embed

20624934_c0

20624934

prolog

0

Title: Checking a square of numbers in Prolog Problem title: Checking a square of numbers in Prolog Tags: prolog Problem: Checking a square of numbers in Prolog square([A1, A2, A3|_], [B1, B2, B3|_], [C1, C2, C3|_]):- all_diff([A1, A2, A3, B1, B2, B3, C1, C2, C3]). squares([[]|_]):- !. squares([[A1,A2,A3|A4], [B1,B2,B3...

Checking a square of numbers in Prolog Checking a square of numbers in Prolog prolog Checking Prolog all_diff existence_error Checking a square of numbers in Prolog I'm getting a uncaught exception: error(existence_error(procedure,square/1),squares/1) - I'm new to Prolog so I'm not quite sure what this is saying (well,...

[ 0.01123046875, 0.002288818359375, 0.0186767578125, 0.0135498046875, -0.0267333984375, -0.013427734375, -0.0269775390625, 0.004638671875, -0.001434326171875, -0.00010395050048828125, 0.01422119140625, 0.00183868408203125, 0.0147705078125, -0.0145263671875, -0.0159912109375, -0.007873535...

[ 38679, 108047, 111, 101935, 1250, 4867, 502, 756, 152462, 116311, 188800, 23, 408, 46526, 131527, 18499, 232578, 11583, 7730, 44691, 46132, 8932, 38067, 1528, 7, 8560, 8305, 138, 363, 104192, 72134, 2663, 25737, 86991, 103136, 98567, 12765, 3...

[ 0.198974609375, 0.251953125, 0.04644775390625, 0.181640625, 0.17236328125, 0.25, 0.127685546875, 0.094970703125, 0.246337890625, 0.205810546875, 0.221923828125, 0.005767822265625, 0.002197265625, 0.003936767578125, 0.1617431640625, 0.1826171875, 0.1751708984375, 0.1409912109375, ...

embed

10655013_c0

10655013

prolog

0

Title: How to create global variable in prolog Problem title: How to create global variable in prolog Tags: prolog, list, variables, reusability, global Problem: How to create global variable in prolog I have a list that I create as follows: tab([(top,left),(top,middle),(top,right),(center,left),(center,middle), (cente...

How to create global variable in prolog How to create global variable in prolog prolog list variables reusability global How AllPos Line Column Tab List Element NewList How to create global variable in prolog I have a list that I create as follows: I wish to create a global variable AllPosition that is a tab. So I did ...

[ 0.0255126953125, 0.00811767578125, -0.0062255859375, -0.00008678436279296875, -0.0184326171875, -0.003875732421875, -0.009765625, 0.02734375, 0.02099609375, -0.0235595703125, 0.035400390625, 0.018310546875, 0.013916015625, -0.0107421875, 0.009521484375, 0.0067138671875, 0.00379943847...

[ 11249, 28282, 7964, 77336, 502, 4867, 23, 5303, 223, 41159, 3164, 7192, 7, 16777, 233987, 22193, 32036, 48325, 2356, 154663, 32599, 172, 1363, 20928, 7108, 2967, 32354, 53299, 80836, 87388, 1615, 184, 5908, 12830, 3525, 15490, 32786, 20697, ...

[ 0.039825439453125, 0.163818359375, 0.2066650390625, 0.302978515625, 0.130859375, 0.2210693359375, 0.0188140869140625, 0.136962890625, 0.0697021484375, 0.005401611328125, 0.1240234375, 0.1920166015625, 0.140625, 0.1160888671875, 0.1217041015625, 0.121337890625, 0.10345458984375, 0.1...

embed

24231179_c1

24231179

prolog

1

'), unix('cat model'), see(model), readModel(M), seen, displaySol(M), halt. var2num(T,N):- hash_term(T,Key), varNumber(Key,T,N),!. var2num(T,N):- retract(numVars(N0)), N is N0+1, assert(numVars(N)), hash_term(T,Key), assert(varNumber(Key,T,N)), assert( num2var(N,T) ), !. writeHeader:- numVars(N), numClauses(C), write('...

[ -0.0203857421875, 0.0032806396484375, -0.02001953125, 0.019775390625, -0.00164031982421875, 0.011962890625, -0.00180816650390625, -0.0052490234375, 0.01123046875, -0.041748046875, -0.0220947265625, 0.0021209716796875, 0.01544189453125, 0.0072021484375, -0.0003337860107421875, 0.0013809...

[ 242, 247, 51, 4084, 4460, 3299, 1957, 51734, 12301, 140290, 594, 51592, 44116, 102588, 58810, 5, 285, 304, 2606, 618, 839, 1556, 127, 32166, 162429, 18444, 26278, 38, 41499, 15390, 81827, 77495, 541, 83, 2389, 21748, 237, 33657, 1961, 132...

[ 0.07708740234375, 0.0748291015625, 0.177978515625, 0.1923828125, 0.280029296875, 0.321044921875, 0.2178955078125, 0.23828125, 0.1690673828125, 0.232177734375, 0.1075439453125, 0.2239990234375, 0.1451416015625, 0.18798828125, 0.203125, 0.0032958984375, 0.1549072265625, 0.13537597656...

embed

28684011_c0

28684011

prolog

0

Title: Why does using [H|T] as a parameter instead of a normal variable cause my predicate to fail? Problem title: Why does using [H|T] as a parameter instead of a normal variable cause my predicate to fail? Tags: prolog, list Problem: Why does using [H|T] as a parameter instead of a normal variable cause my predicate ...

Why does using [H|T] as a parameter instead of a normal variable cause my predicate to fail? Why does using [H|T] as a parameter instead of a normal variable cause my predicate to fail? prolog list Why e.g Why does using [H|T] as a parameter instead of a normal variable cause my predicate to fail? I'm creating a predic...

[ -0.00665283203125, 0.0167236328125, 0.00689697265625, 0.00183868408203125, -0.01422119140625, -0.006317138671875, -0.00799560546875, -0.0014190673828125, -0.0064697265625, -0.01055908203125, 0.017578125, -0.0087890625, -0.01226806640625, -0.01220703125, 0.00830078125, -0.00994873046875...

[ 44084, 17368, 841, 58745, 618, 237, 171859, 64457, 3638, 77336, 22304, 1653, 2063, 67, 35782, 502, 4867, 5303, 759, 47, 105233, 87388, 58735, 12830, 1542, 1723, 16401, 990, 7, 16750, 49146, 6496, 756, 74918, 1193, 1295, 61475, 214, 35405, ...

[ 0.1102294921875, 0.0909423828125, 0.15771484375, 0.1541748046875, 0.1807861328125, 0.036590576171875, 0.1956787109375, 0.0955810546875, 0.1102294921875, 0.20458984375, 0.08416748046875, 0.1678466796875, 0.206298828125, 0.123046875, 0.2125244140625, 0.1392822265625, 0.169921875, 0.1...

embed

35258273_c0

35258273

prolog

0

Title: Prolog: Recursion on a list with one one-time rule Problem title: Prolog: Recursion on a list with one one-time rule Tags: recursion, traveling-salesman, prolog Problem: Prolog: Recursion on a list with one one-time rule Most probably I couldn't properly phrase my search keywords. What I'm trying to do is to rec...

Prolog: Recursion on a list with one one-time rule Prolog: Recursion on a list with one one-time rule recursion traveling-salesman prolog Prolog Recursion List Sum Diff E1-E2 SoD Result Prolog: Recursion on a list with one one-time rule Most probably I couldn't properly phrase my search keywords. What I'm trying to do ...

[ -0.002593994140625, 0.014404296875, -0.0001544952392578125, 0.0255126953125, -0.013671875, 0.003997802734375, -0.010498046875, 0.01275634765625, 0.0208740234375, -0.037841796875, -0.006317138671875, 0.0047607421875, -0.0098876953125, 0.0177001953125, 0.018310546875, 0.0146484375, 0.0...

[ 1250, 4867, 165428, 42, 6889, 5303, 1632, 6032, 79986, 195625, 26983, 214, 7, 21183, 669, 502, 32036, 36335, 191144, 241, 20268, 647, 304, 1061, 397, 126684, 155965, 113860, 33938, 166117, 31577, 5844, 151575, 60212, 148390, 112820, 13695, 15...

[ 0.13916015625, 0.20654296875, 0.1630859375, 0.1607666015625, 0.09417724609375, 0.197998046875, 0.1248779296875, 0.1802978515625, 0.170166015625, 0.250244140625, 0.1314697265625, 0.0325927734375, 0.056640625, 0.1021728515625, 0.0853271484375, 0.0850830078125, 0.1781005859375, 0.2150...

embed

50541887_c0

50541887

prolog

0

Title: Prolog list of lists get all elements Problem title: Prolog list of lists get all elements Tags: head, list, prolog Problem: Prolog list of lists get all elements I have a lists of lists: decide([[1,2,-3],[-2,3],[6],[4]],K). I want to return all the possible solutions pressing ';'. The rule is to first return th...

Prolog list of lists get all elements Prolog list of lists get all elements head list prolog Prolog return_list_members Lit Prolog list of lists get all elements I have a lists of lists: I want to return all the possible solutions pressing ';'. The rule is to first return the values that its list has size 1. Then I wan...

[ 0.006805419921875, -0.00213623046875, 0.003021240234375, 0.00848388671875, -0.0146484375, -0.01080322265625, -0.0091552734375, -0.0078125, -0.006683349609375, -0.032958984375, 0.0262451171875, -0.0107421875, 0.00164031982421875, 0.00982666015625, 0.0089111328125, -0.00830078125, 0.03...

[ 1250, 4867, 5303, 111, 2046, 756, 80854, 10336, 502, 30646, 6562, 39, 27417, 27668, 7, 765, 3444, 47, 70, 7722, 51347, 24234, 214, 74, 79986, 5117, 142424, 1556, 13267, 615, 167785, 3501, 89536, 3642, 3332, 202, 69236, 678, 4734, 1632, ...

[ 0.1395263671875, 0.218505859375, 0.2044677734375, 0.047393798828125, 0.1055908203125, 0.149658203125, 0.207275390625, 0.175048828125, 0.113037109375, 0.2066650390625, 0.1820068359375, 0.0794677734375, 0.2008056640625, 0.1180419921875, 0.03094482421875, 0.010711669921875, 0.0800170898...

embed

53085672_c0

53085672

prolog

0

Title: swipl(prolog compiler) giver Undefined procedure error, but the rule is already defined Problem title: swipl(prolog compiler) giver Undefined procedure error, but the rule is already defined Tags: prolog, runtime-error, swi-prolog, dijkstra Problem: swipl(prolog compiler) giver Undefined procedure error, but the...

swipl(prolog compiler) giver Undefined procedure error, but the rule is already defined swipl(prolog compiler) giver Undefined procedure error, but the rule is already defined prolog runtime-error swi-prolog dijkstra Undefined edge1 Departure Arrival Dist Cost Time Arrival-Departure BusId Distance ERROR However swipl(p...

[ 0.0252685546875, 0.0152587890625, 0.0135498046875, 0.018798828125, -0.020751953125, -0.0140380859375, -0.0166015625, -0.00946044921875, -0.00762939453125, -0.051513671875, -0.004302978515625, -0.01202392578125, -0.0012359619140625, -0.0133056640625, 0.031982421875, 0.006561279296875, ...

[ 91, 2452, 2424, 3454, 4867, 9969, 34759, 16861, 79912, 5983, 297, 50491, 18499, 1284, 79986, 21771, 61924, 502, 11675, 6032, 188800, 151141, 2816, 121303, 418, 262, 2500, 205545, 6206, 63099, 19055, 25852, 568, 71, 154349, 151206, 52080, 9548...

[ 0.018951416015625, 0.1998291015625, 0.258056640625, 0.1651611328125, 0.2235107421875, 0.12841796875, 0.18017578125, 0.111572265625, 0.07763671875, 0.20361328125, 0.04791259765625, 0.1729736328125, 0.1920166015625, 0.011627197265625, 0.173828125, 0.108154296875, 0.2078857421875, 0.1...

embed

10889254_c1

10889254

prolog

1

,C) { count_good_beers_for_at(janus,godthaab,2) } Info: 1 tuple computed. As you can see, the counter doesn't return the pubs frequented but having 0 liked beers. I was planning to work around this by using a left outer join. DES> is_happy_at(D,P,Z) :- lj(serves(P,B), count_good_beers_for_at(D,Y,Z), (Y=P)) Info: Proces...

[ 0.021240234375, -0.000396728515625, 0.0042724609375, 0.01458740234375, 0.0023040771484375, 0.034912109375, -0.01190185546875, -0.013671875, 0.011962890625, -0.03662109375, 0.01177978515625, -0.00049591064453125, 0.026611328125, 0.00897216796875, 0.004913330078125, 0.0048828125, 0.005...

[ 441, 54529, 70810, 372, 1314, 2472, 257, 2864, 223, 7803, 3238, 2055, 10461, 14048, 106, 370, 8705, 375, 7077, 105416, 18, 30646, 64792, 7, 131174, 19441, 757, 1884, 186, 58136, 4488, 10932, 25737, 1810, 56, 33284, 51552, 83, 157976, 397,...

[ 0.056365966796875, 0.18505859375, 0.162353515625, 0.170166015625, 0.1451416015625, 0.10205078125, 0.1561279296875, 0.09320068359375, 0.1412353515625, 0.000640869140625, 0.1075439453125, 0.0966796875, 0.062255859375, 0.151123046875, 0.083984375, 0.10455322265625, 0.1956787109375, 0....

embed

20083285_c0

20083285

prolog

0

Title: Get Index of an element/ element by index in List of Lists Problem title: Get Index of an element/ element by index in List of Lists Tags: loops, prolog, list, indexing Problem: Get Index of an element/ element by index in List of Lists How could I achieve something similar to the nth0/3 predicate on a list of l...

Get Index of an element/ element by index in List of Lists Get Index of an element/ element by index in List of Lists loops prolog list indexing Get Index List Lists nth0 Elem Idx Idx2 Tail Element Index1 Ind Get Index of an element/ element by index in List of Lists How could I achieve something similar to the nth0/3 ...

[ 0.012939453125, 0.01055908203125, -0.0028839111328125, -0.0021209716796875, -0.0196533203125, 0.01495361328125, 0.022216796875, 0.0011444091796875, 0.00811767578125, -0.0439453125, 0.00010251998901367188, -0.00101470947265625, -0.0264892578125, -0.00439453125, 0.004486083984375, 0.0006...

[ 20779, 31471, 111, 12830, 64, 390, 63262, 23, 32036, 40956, 502, 4867, 5303, 653, 927, 2389, 540, 195, 24799, 425, 1218, 379, 48325, 14489, 5809, 69307, 21373, 18113, 1653, 2063, 67, 1884, 19048, 14192, 2367, 83, 60892, 75414, 25632, 1328...

[ 0.122314453125, 0.294677734375, 0.1090087890625, 0.2158203125, 0.09393310546875, 0.1160888671875, 0.2744140625, 0.0711669921875, 0.212158203125, 0.18359375, 0.09600830078125, 0.14697265625, 0.2093505859375, 0.031280517578125, 0.12255859375, 0.1256103515625, 0.0557861328125, 0.10937...

embed

72933697_c0

72933697

prolog

0

Title: How to debug non-termination Problem title: How to debug non-termination Tags: prolog, clp, clpz Problem: How to debug non-termination I'm trying to implement n_factors/2 predicate that works in all directions. :- use_module(library(clpz)). n_factors(N, Fs) :- integer(N), N > 1, primes(Ps), n_factors0(N, Fs, Ps)...

How to debug non-termination How to debug non-termination prolog clp clpz How n_factors use_module n_factors0 primes0 How to debug non-termination I'm trying to implement n_factors/2 predicate that works in all directions. When I am issuing the following query I get: before the program moves on to exploring the realm o...

[ -0.0120849609375, 0.00238037109375, 0.0103759765625, 0.012939453125, 0.0015716552734375, -0.0054931640625, -0.0008087158203125, -0.0185546875, 0.003173828125, -0.036376953125, 0.02734375, -0.007415771484375, 0.0157470703125, -0.0012054443359375, 0.01422119140625, 0.0196533203125, 0.0...

[ 11249, 8, 85779, 351, 720, 91407, 47, 502, 4867, 33139, 254, 169, 653, 144810, 4527, 83279, 2389, 20809, 31577, 29479, 12477, 1653, 2063, 43240, 48225, 1159, 41, 8108, 1528, 25813, 98, 24649, 2773, 43257, 101935, 9655, 141956, 24233, 140363...

[ 0.0241241455078125, 0.156005859375, 0.268310546875, 0.1927490234375, 0.1649169921875, 0.177734375, 0.023223876953125, 0.10498046875, 0.1422119140625, 0.0157012939453125, 0.06573486328125, 0.0567626953125, 0.0706787109375, 0.197998046875, 0.045257568359375, 0.0906982421875, 0.06555175...

embed

1429887_c1

1429887

prolog

1

child(X,Z), married(Y,Z), not(child(X,Y)), male(X). grandparent(X,Y):- parent(X,Z), parent(Z,Y). grandmother(X,Y):- grandparent(X,Y), female(X). grandfather(X,Y):- grandparent(X,Y), male(X). grandchild(X,Y):- child(X,Z), child(Z,Y). married(X,Y):- wife(X,Y), female(X). married(X,Y):- husband(X,Y), male(X). married(i,w...

[ 0.006134033203125, 0.01104736328125, 0.0224609375, 0.0206298828125, -0.01708984375, 0.01165771484375, -0.0191650390625, 0.0115966796875, 0.004791259765625, -0.0164794921875, -0.00604248046875, -0.025390625, -0.0169677734375, 0.0029144287109375, 0.0142822265625, 0.010498046875, 0.0137...

[ 29041, 1542, 4, 1511, 247, 139505, 132, 1723, 959, 206, 38472, 11280, 194, 9963, 99547, 49129, 432, 9319, 117776, 1021, 58386, 71390, 434, 71, 42732, 78, 79298, 114015, 775, 19729, 420, 14, 29954, 85, 46526, 51, 11030, 7, 19441, 5915, 6...

[ 0.2021484375, 0.09326171875, 0.029083251953125, 0.13818359375, 0.0611572265625, 0.1964111328125, 0.020904541015625, 0.134521484375, 0.175048828125, 0.1007080078125, 0.1181640625, 0.111328125, 0.0435791015625, 0.1593017578125, 0.24658203125, 0.1474609375, 0.0599365234375, 0.12451171...

embed

44219018_c1

44219018

prolog

1

verify(does_not_fly), verify(swims), verify(is_black_and_white). albatross :- bird, verify(appears_in_story_Ancient_Mariner), verify(flys_well). /* classification rules */ mammal :- verify(has_hair), !. mammal :- verify(gives_milk). bird :- verify(has_feathers), !. bird :- verify(flys), verify(lays_eggs). carnivore :-...

[ 0.01226806640625, 0.02685546875, 0.01031494140625, 0.0177001953125, -0.00083160400390625, -0.003143310546875, 0.00157928466796875, 0.012451171875, -0.004302978515625, -0.01129150390625, 0.0019073486328125, -0.01708984375, -0.00909423828125, -0.01129150390625, 0.00946044921875, 0.004028...

[ 493, 40383, 246, 90, 10869, 35121, 247, 2452, 4432, 164, 151675, 2940, 148477, 194, 45491, 49042, 7, 15772, 263, 71, 9007, 28575, 73, 86385, 7251, 45964, 63344, 1679, 19256, 1639, 40865, 91736, 21968, 141, 10557, 75512, 711, 96259, 12397, ...

[ 0.2138671875, 0.266845703125, 0.114013671875, 0.104736328125, 0.1806640625, 0.1929931640625, 0.01641845703125, 0.1041259765625, 0.0733642578125, 0.09033203125, 0.151611328125, 0.1246337890625, 0.1412353515625, 0.030609130859375, 0.17724609375, 0.25732421875, 0.1480712890625, 0.1245...

embed

50497151_c0

50497151

prolog

0

Title: make display matrix prolog tkeclipse Problem title: make display matrix prolog tkeclipse Tags: prolog, constraint-programming, eclipse-clp Problem: make display matrix prolog tkeclipse I am new to prolog and want to generate a display matrix from the below prolog code as given in the image The image below is gen...

make display matrix prolog tkeclipse make display matrix prolog tkeclipse prolog constraint-programming eclipse-clp pc1 cc1 hc2 pc2 hc3 pc4 cc4 part_family rm1 rm2 rm3 rm4 rm5 rm6 rm7 pc1_1 pc1_2 cc1_1 cc1_2 hc2_1 hc2_2 pc2_1 hc3_1 pc4_1 pc4_2 cc4_1 pr1 pr2 pr3 pr4 pr5 pr6 cc2 cc3 cc11 cc12 A:L B:M Active C:N solve_dcs...

[ 0.026611328125, -0.0047607421875, 0.0038299560546875, 0.011474609375, 0.00543212890625, -0.01312255859375, -0.041748046875, 0.0079345703125, -0.01031494140625, 0.00787353515625, -0.007720947265625, -0.0218505859375, 0.0020751953125, 0.000476837158203125, -0.0030975341796875, 0.00010538...

[ 3249, 44116, 50944, 425, 502, 4867, 35640, 106371, 184, 158, 2816, 4288, 28966, 28, 26775, 36719, 418, 10060, 304, 1096, 363, 617, 6, 2831, 454, 212122, 39, 758, 910, 1690, 966, 238, 4083, 1662, 62, 12, 866, 594, 88441, 839, 86869, 71...

[ 0.112060546875, 0.216796875, 0.2196044921875, 0.1392822265625, 0.1602783203125, 0.21826171875, 0.1448974609375, 0.212890625, 0.156982421875, 0.0926513671875, 0.2020263671875, 0.136962890625, 0.1546630859375, 0.0096435546875, 0.1453857421875, 0.099853515625, 0.032958984375, 0.034545...

embed

55241006_c0

55241006

prolog

0

Title: Prolog the cheapest path Problem title: Prolog the cheapest path Tags: path, prolog Problem: Prolog the cheapest path I have to do a Prolog app which have to find the cheapest path, the fastest path, the cheapest with max time arrival, the fastest with max price. I write a little but I do not know how to find th...

Prolog the cheapest path Prolog the cheapest path path prolog Prolog Path Visited Nodes Node path_cost aggregate_all Cost path_min_cost Min Prolog the cheapest path I have to do a Prolog app which have to find the cheapest path, the fastest path, the cheapest with max time arrival, the fastest with max price. I write a...

[ 0.0174560546875, 0.00141143798828125, -0.00726318359375, 0.00543212890625, -0.0023193359375, 0.0125732421875, -0.0111083984375, -0.0201416015625, 0.01123046875, -0.0703125, -0.004638671875, 0.0166015625, -0.01495361328125, 0.0091552734375, 0.0030517578125, -0.01300048828125, -0.00518...

[ 1250, 4867, 70, 64720, 525, 60875, 502, 108421, 98684, 297, 438, 988, 112, 587, 271, 197564, 13, 5584, 63099, 1249, 4211, 765, 54, 4027, 7413, 4271, 18389, 1733, 30780, 27167, 33022, 10176, 959, 3714, 64333, 4488 ]

[ 0.1763916015625, 0.26708984375, 0.045013427734375, 0.2158203125, 0.1505126953125, 0.2259521484375, 0.119873046875, 0.181640625, 0.1483154296875, 0.0259552001953125, 0.1224365234375, 0.09466552734375, 0.080322265625, 0.09521484375, 0.0589599609375, 0.123291015625, 0.04449462890625, ...

embed

56310184_c1

56310184

prolog

1

2): ?- Year in 1990..2005,leap_year1(Year),indomain(Year). Year = 2000. ?- Year in 1990..2005,leap_year2(Year),indomain(Year). Year = 1992 ; Year = 1996 ; Year = 2004. As you can see, neither query correctly generates the full sequence of leap years (1992, 1996, 2000, 2004). Further, the following queries around the ye...

[ -0.005828857421875, -0.006317138671875, 0.004730224609375, 0.00848388671875, 0.0023345947265625, 0.023681640625, -0.006591796875, -0.01422119140625, 0.00115966796875, -0.006866455078125, -0.017822265625, 0.01141357421875, -0.01226806640625, -0.004547119140625, 0.0235595703125, 0.002655...

[ 4958, 705, 42552, 23, 96145, 32096, 133, 2631, 46799, 418, 69085, 147, 36735, 24931, 52489, 304, 12839, 11891, 44211, 1957, 2725, 9319, 41, 1294, 26785, 139392, 4393, 40, 944, 95, 5369, 77407, 88922, 4821, 10484, 10932, 6602, 33418, 2843, ...

[ 0.050750732421875, 0.042388916015625, 0.144775390625, 0.0635986328125, 0.1937255859375, 0.203857421875, 0.10028076171875, 0.20703125, 0.1951904296875, 0.054840087890625, 0.10443115234375, 0.081787109375, 0.047760009765625, 0.21240234375, 0.2080078125, 0.06256103515625, 0.149047851562...

embed

24714985_c0

24714985

prolog

0

Title: size of tree using accumulator Problem title: size of tree using accumulator Tags: tree, accumulator, prolog Problem: size of tree using accumulator I am tryin to learn prolog and got stuck in one of the toy example. binary_tree is defined as: The term '-' (the minus symbol) represents the empty tree. The term t...

size of tree using accumulator size of tree using accumulator tree accumulator prolog accumulator binary_tree Tree Call _G10307 _G10422 _G10435 Exit _G10437 _G10438 _G10440 _G10441 size of tree using accumulator I am tryin to learn prolog and got stuck in one of the toy example. binary_tree is defined as: now Im trying...

[ 0.0250244140625, -0.0000438690185546875, 0.0098876953125, -0.0108642578125, 0.0020599365234375, -0.00421142578125, -0.0206298828125, 0.019287109375, -0.006195068359375, -0.047607421875, 0.0260009765625, -0.00023555755615234375, 0.003936767578125, 0.0037078857421875, 0.047119140625, -0....

[ 13267, 53201, 17368, 183278, 1290, 502, 4867, 2394, 6635, 62600, 101344, 26265, 63620, 8368, 66947, 4015, 123141, 5443, 217, 152719, 149988, 141929, 167819, 30698, 179933, 72713, 27781, 61924, 31577, 33022, 1653, 2063, 62731, 13, 839, 7413, 111...

[ 0.1832275390625, 0.222900390625, 0.110595703125, 0.222412109375, 0.158935546875, 0.105224609375, 0.1611328125, 0.1531982421875, 0.0986328125, 0.2237548828125, 0.207275390625, 0.1240234375, 0.111083984375, 0.09228515625, 0.0618896484375, 0.0435791015625, 0.0859375, 0.078125, 0.032...

embed

25215654_c0

25215654

prolog

0

Title: First order logic in practice, how to deal with undecidablity? Problem title: First order logic in practice, how to deal with undecidablity? Tags: computation, decidable, logic, prolog Problem: First order logic in practice, how to deal with undecidablity? I am very new to these things. Hope this is not a very n...

First order logic in practice, how to deal with undecidablity? First order logic in practice, how to deal with undecidablity? computation decidable logic prolog First First order logic in practice, how to deal with undecidablity? I am very new to these things. Hope this is not a very naive question. I tried the followi...

[ 0.0260009765625, 0.002838134765625, 0.0162353515625, 0.010498046875, -0.0031280517578125, 0.0096435546875, 0.00830078125, 0.00347900390625, -0.0008087158203125, -0.034423828125, -0.0029754638671875, 0.006439208984375, -0.00482177734375, 0.0166015625, -0.0021820068359375, -0.00260925292...

[ 23972, 12989, 62775, 41361, 3642, 47, 35142, 678, 9232, 24750, 7121, 939, 23, 181135, 8, 2661, 502, 4867, 4552, 3525, 37842, 25632, 26168, 1250, 62, 148525, 335, 34475, 29568, 87, 151575, 17378, 563, 7842, 9127, 9655, 15400, 3038, 959, 14...

[ 0.1297607421875, 0.1722412109375, 0.2061767578125, 0.1798095703125, 0.06048583984375, 0.0166473388671875, 0.1572265625, 0.159423828125, 0.1441650390625, 0.1986083984375, 0.1715087890625, 0.1385498046875, 0.02801513671875, 0.1209716796875, 0.0897216796875, 0.115234375, 0.1407470703125...

embed