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
2900505_c0	2900505	prolog	0	Title: copy file into another file in prolog Problem title: copy file into another file in prolog Tags: prolog Problem: copy file into another file in prolog Good morning/evening how can I write something in a file and then copy its content into the current file? for example I consult file1.pro then I have rule write s...	copy file into another file in prolog copy file into another file in prolog prolog copy file into another file in prolog Good morning/evening how can I write something in a file and then copy its content into the current file? for example I consult file1.pro then I have rule write something in file2.pro , after this ru...	[ 0.01470947265625, -0.006805419921875, 0.003509521484375, 0.035400390625, 0.00075531005859375, 0.003021240234375, -0.002349853515625, 0.025146484375, 0.0172119140625, -0.043701171875, 0.015869140625, 0.0072021484375, -0.0015716552734375, 0.006591796875, 0.041748046875, -0.007080078125, ...	[ 43658, 11435, 3934, 15700, 23, 502, 4867, 42141, 3134, 3642, 831, 87, 33022, 9844, 7068, 6863, 10941, 43581, 75463, 3454, 79986, 5442, 67229, 12447, 3444, 114689, 71, 18, 37842, 105237, 2053, 108975, 1884, 5983, 26582 ]	[ 0.208740234375, 0.214599609375, 0.17236328125, 0.0909423828125, 0.02978515625, 0.1412353515625, 0.2210693359375, 0.079833984375, 0.00079345703125, 0.0599365234375, 0.052764892578125, 0.0128173828125, 0.1650390625, 0.0316162109375, 0.00299072265625, 0.032257080078125, 0.1287841796875,...	embed
19592238_c0	19592238	prolog	0	Title: How to compare element of List passed as parameters? Problem title: How to compare element of List passed as parameters? Tags: prolog Problem: How to compare element of List passed as parameters? How to compare two elements of two Lists in Prolog? find should return next available route so Departure should be le...	How to compare element of List passed as parameters? How to compare element of List passed as parameters? prolog How List Departure Dep JFK BLL Arrival Arr How to compare element of List passed as parameters? How to compare two elements of two Lists in Prolog? find should return next available route so Departure should...	[ -0.000873565673828125, -0.00982666015625, 0.00579833984375, 0.00921630859375, -0.010009765625, 0.005615234375, 0.0005645751953125, -0.01495361328125, 0.021240234375, 0.0027008056640625, 0.0002899169921875, 0.006103515625, 0.005340576171875, -0.01251220703125, -0.00787353515625, -0.0278...	[ 11249, 47, 69101, 12830, 32036, 115081, 237, 171859, 7, 502, 4867, 262, 2500, 6644, 254, 821, 86371, 335, 23708, 205545, 141, 1172, 42, 6626, 80854, 1250, 7413, 30646, 11737, 19882, 36439, 40715, 105950 ]	[ 0.0714111328125, 0.037322998046875, 0.2237548828125, 0.1546630859375, 0.197509765625, 0.1722412109375, 0.0736083984375, 0.21728515625, 0.003971099853515625, 0.07861328125, 0.2119140625, 0.15283203125, 0.166015625, 0.0653076171875, 0.1654052734375, 0.027313232421875, 0.1607666015625, ...	embed
73720186_c0	73720186	prolog	0	Title: we have to create a PROLOG program to print out a square of n x n given character '' on the screen. use SWIprolog Problem title: we have to create a PROLOG program to print out a square of n x n given character '' on the screen. use SWIprolog Tags: prolog Problem: we have to create a PROLOG...	we have to create a PROLOG program to print out a square of n x n given character '' on the screen. use SWIprolog we have to create a PROLOG program to print out a square of n x n given character '' on the screen. use SWIprolog prolog PROLOG SWIprolog EXAMPLE we have to create a PROLOG program to ...	[ 0.027099609375, -0.0035858154296875, 0.017333984375, 0.0030975341796875, -0.005462646484375, 0.0078125, -0.005279541015625, 0.006439208984375, -0.005035400390625, -0.006866455078125, 0.017333984375, -0.0238037109375, -0.01519775390625, -0.018310546875, -0.0257568359375, -0.007385253906...	[ 642, 765, 47, 28282, 10514, 47510, 1528, 28412, 1810, 108047, 111, 653, 1022, 34475, 62816, 54764, 3768, 1639, 49119, 5, 4527, 159, 38969, 3454, 4867, 10, 502, 29426, 8922, 103084, 33022 ]	[ 0.034881591796875, 0.060455322265625, 0.01904296875, 0.106689453125, 0.168701171875, 0.2452392578125, 0.183837890625, 0.185546875, 0.1343994140625, 0.212646484375, 0.04913330078125, 0.10723876953125, 0.144287109375, 0.05670166015625, 0.183837890625, 0.00628662109375, 0.1820068359375,...	embed
29519600_c0	29519600	prolog	0	Title: Why does 'is' in swi-prolog behave differently if sides are switched? Problem title: Why does 'is' in swi-prolog behave differently if sides are switched? Tags: prolog Problem: Why does 'is' in swi-prolog behave differently if sides are switched? I'm using swi-prolog version 6.6.6 if that mat...	Why does 'is' in swi-prolog behave differently if sides are switched? Why does 'is' in swi-prolog behave differently if sides are switched? prolog Why Why does 'is' in swi-prolog behave differently if sides are switched? I'm using swi-prolog version 6.6.6 if that matters. As far as I can tell they s...	[ 0.00157928466796875, 0.006866455078125, 0.0224609375, -0.0111083984375, -0.019287109375, -0.00909423828125, 0.027099609375, 0.00164794921875, 0.01080322265625, 0.01251220703125, 0.018310546875, -0.004669189453125, 0.0040283203125, -0.00848388671875, 0.0133056640625, -0.013671875, 0.0...	[ 44084, 3768, 164, 91, 2452, 3454, 4867, 186, 68991, 12921, 538, 2174, 5609, 7, 101089, 297, 502, 23, 17368, 11389, 2289, 156960, 26866, 5608, 183234, 4734, 60212, 26818, 83, 98, 8337, 50339, 39989, 4572, 2811, 86827, 21320, 757, 98320, 72...	[ 0.11962890625, 0.096435546875, 0.20654296875, 0.0618896484375, 0.2376708984375, 0.1568603515625, 0.231201171875, 0.04473876953125, 0.1649169921875, 0.1839599609375, 0.00848388671875, 0.06640625, 0.2205810546875, 0.04168701171875, 0.1986083984375, 0.029693603515625, 0.0848388671875, ...	embed
52879198_c0	52879198	prolog	0	Title: Prolog family rules Problem title: Prolog family rules Tags: prolog Problem: Prolog family rules I have a few facts: parent(bob, anne). % bob is a. parent of anne. sibling(anne, mary). I'm trying to get parents from sibling facts, so if I query parent(X, mary) bob should be an output. So far my rules are: siblin...	Prolog family rules Prolog family rules prolog Prolog Prolog family rules I have a few facts: I'm trying to get parents from sibling facts, so if I query parent(X, mary) bob should be an output. So far my rules are: It goes on an infinite loop. I suspect it is because the recursive call has no end condition. What can I...	[ 0.0250244140625, 0.0130615234375, -0.0025177001953125, 0.01513671875, -0.025146484375, 0.000728607177734375, 0.00421142578125, 0.008544921875, -0.00286865234375, -0.035400390625, 0.00909423828125, -0.0277099609375, -0.00775146484375, 0.0186767578125, 0.0234375, -0.005035400390625, 0....	[ 1250, 4867, 14449, 91736, 502, 10846, 15824, 31577, 2046, 27863, 1295, 78, 79298, 41, 1294, 49129, 1542, 1108, 53, 21895, 5608, 140992, 2060, 60899, 98, 54241, 13, 40956, 92610, 195625, 5844, 11782, 110, 3564, 35431, 4488 ]	[ 0.1383056640625, 0.2435302734375, 0.123779296875, 0.1468505859375, 0.1015625, 0.033599853515625, 0.1448974609375, 0.055084228515625, 0.059661865234375, 0.1851806640625, 0.025665283203125, 0.08148193359375, 0.16162109375, 0.1201171875, 0.1197509765625, 0.191650390625, 0.07220458984375...	embed
53660041_c2	53660041	prolog	2	empty, 3] L = [3, 1, empty] L = [3, empty, 1] L = [empty, 1, 3] L = [empty, 3, 1] L = [2, 3, empty] L = [2, empty, 3] L = [3, 2, empty] L = [3, empty, 2] L = [empty, 2, 3] L = [empty, 3, 2] discard the listResul which no contains empty, only 8 configurations for queens who no attack each other are valid from the outpu...	empty, 3] L = [3, 1, empty] L = [3, empty, 1] L = [empty, 1, 3] L = [empty, 3, 1] L = [2, 3, empty] L = [2, empty, 3] L = [3, 2, empty] L = [3, empty, 2] L = [empty, 2, 3] L = [empty, 3, 2] discard the listResul which no contains empty, only 8 configurations for queens who no attack each other are valid from the outpu...	[ -0.004058837890625, 0.01495361328125, 0.0123291015625, 0.0242919921875, 0.005279541015625, -0.004364013671875, -0.010498046875, -0.002349853515625, 0.0155029296875, 0.0157470703125, -0.01214599609375, 0.003021240234375, -0.00921630859375, 0.002716064453125, -0.0228271484375, 0.00598144...	[ 201505, 138, 339, 2203, 122101, 4, 106, 33548, 939, 116, 17116, 5861, 5303, 4332, 10178, 70541, 4734, 382, 180346, 41, 1755, 110, 52875, 12638, 3789, 35604, 140992, 6056, 268, 28864, 26073, 7, 541, 41732, 33, 1250, 4867, 126684, 32036, 32...	[ 0.27392578125, 0.2039794921875, 0.177001953125, 0.092041015625, 0.1107177734375, 0.00360107421875, 0.04010009765625, 0.1160888671875, 0.09912109375, 0.0892333984375, 0.0289306640625, 0.0799560546875, 0.1800537109375, 0.088134765625, 0.244140625, 0.0165863037109375, 0.005615234375, ...	embed
6351245_c0	6351245	prolog	0	Title: Unit testing in XSB Prolog? Problem title: Unit testing in XSB Prolog? Tags: plunit, prolog, unit-testing, xsb Problem: Unit testing in XSB Prolog? How do people working with XSB Prolog do unit testing? Is there a library available? Or is it possible to somehow use SWI-Prolog's plunit library in XSB? If there is...	Unit testing in XSB Prolog? Unit testing in XSB Prolog? plunit prolog unit-testing xsb Unit XSB Prolog Unit testing in XSB Prolog? How do people working with XSB Prolog do unit testing? Is there a library available? Or is it possible to somehow use SWI-Prolog's plunit library in XSB? If there is not an available testin...	[ 0.00677490234375, 0.029296875, 0.0108642578125, -0.0194091796875, -0.006500244140625, 0.0042724609375, 0.0152587890625, -0.0013275146484375, 0.002655029296875, -0.01470947265625, -0.0002574920654296875, 0.0208740234375, -0.00848388671875, -0.00154876708984375, 0.0031585693359375, -0.00...	[ 46640, 134234, 23, 1193, 36474, 1250, 4867, 32, 12266, 6773, 502, 25072, 6954, 214, 1022, 7, 275, 11249, 3395, 20697, 54, 35773, 1294, 19882, 7722, 4527, 38969, 10752, 146731, 143834, 3034, 18151, 40304, 103510 ]	[ 0.2132568359375, 0.235595703125, 0.05511474609375, 0.1187744140625, 0.2054443359375, 0.1207275390625, 0.19921875, 0.010406494140625, 0.1143798828125, 0.1661376953125, 0.08026123046875, 0.1865234375, 0.1959228515625, 0.009552001953125, 0.069580078125, 0.02294921875, 0.1221923828125, ...	embed
19638004_c0	19638004	prolog	0	Title: Open .pl file and close current one in SWI - Prolog Problem title: Open .pl file and close current one in SWI - Prolog Tags: prolog, swi-prolog Problem: Open .pl file and close current one in SWI - Prolog I have created two different .pl files in SWI-Prolog for a text adventure game. They are two different missi...	Open .pl file and close current one in SWI - Prolog Open .pl file and close current one in SWI - Prolog prolog swi-prolog Open SWI Prolog Open .pl file and close current one in SWI - Prolog I have created two different .pl files in SWI-Prolog for a text adventure game. They are two different missions. Is there any way ...	[ 0.026123046875, 0.005706787109375, -0.0016021728515625, 0.0234375, -0.0186767578125, -0.0157470703125, -0.00147247314453125, 0.001190185546875, 0.0086669921875, -0.0213623046875, 0.00046539306640625, 0.024169921875, -0.01904296875, -0.00555419921875, 0.037841796875, -0.00701904296875, ...	[ 13527, 5, 2424, 11435, 136, 20903, 43581, 1632, 23, 159, 38969, 1250, 4867, 502, 2452, 3454, 75935, 6626, 12921, 102158, 10752, 7986, 156578, 6712, 6, 54916, 3917, 3564, 5117, 29752, 47, 9803, 17932, 11522, 28282, 541, 100, 6957 ]	[ 0.1671142578125, 0.093505859375, 0.27392578125, 0.22412109375, 0.05682373046875, 0.1846923828125, 0.14892578125, 0.06475830078125, 0.045654296875, 0.0750732421875, 0.2320556640625, 0.1448974609375, 0.2000732421875, 0.113037109375, 0.1654052734375, 0.109130859375, 0.136474609375, 0....	embed
19928890_c0	19928890	prolog	0	Title: Recursion and loop in prolog Problem title: Recursion and loop in prolog Tags: prolog Problem: Recursion and loop in prolog I've been trying to use prolog recursion to get the following output. ?- triangle(5). ++++1 +++12 ++123 +1234 12345 This is what I've done so far but it doesn't give me expected output. tri...	Recursion and loop in prolog Recursion and loop in prolog prolog Recursion X-1 N-1 Recursion and loop in prolog I've been trying to use prolog recursion to get the following output. ?- triangle(5). This is what I've done so far but it doesn't give me expected output.	[ 0.006622314453125, 0.006622314453125, 0.004364013671875, 0.00970458984375, -0.00689697265625, 0.01806640625, 0.006927490234375, 0.00494384765625, 0.01141357421875, -0.01409912109375, 0.003448486328125, -0.00457763671875, -0.0062255859375, 0.00408935546875, 0.0019073486328125, 0.0089721...	[ 165428, 42, 6889, 136, 40956, 502, 4867, 1193, 5759, 541, 23, 31577, 4527, 195625, 1830, 2046, 25632, 140992, 705, 9, 1927, 109217, 124534, 16940, 2060, 84751 ]	[ 0.16064453125, 0.1737060546875, 0.1552734375, 0.08184814453125, 0.2459716796875, 0.1419677734375, 0.24658203125, 0.06982421875, 0.1114501953125, 0.026519775390625, 0.01335906982421875, 0.061737060546875, 0.02410888671875, 0.20556640625, 0.1109619140625, 0.00786590576171875, 0.0536804...	embed
22469584_c0	22469584	prolog	0	Title: Store result as a list using prolog Problem title: Store result as a list using prolog Tags: list, prolog Problem: Store result as a list using prolog I wanted the result to be stored in a list. subject(english, 2). subject(math,2). subject(science,2). get_subject(subject, level) :- subject(subject,level) . when...	Store result as a list using prolog Store result as a list using prolog list prolog prolog Store get_subject Store result as a list using prolog I wanted the result to be stored in a list. when I have this query: it gives me the output: but i wanted the output to be list like this: [english, math, science] is it possib...	[ 0.01177978515625, -0.000782012939453125, 0.0025787353515625, 0.01318359375, -0.002105712890625, 0.00848388671875, -0.005889892578125, 0.0086669921875, 0.0218505859375, -0.05224609375, 0.00872802734375, -0.006134033203125, -0.0240478515625, -0.01220703125, -0.006439208984375, 0.00253295...	[ 14934, 16750, 237, 5303, 17368, 502, 4867, 10, 2046, 22144, 75161, 36663, 70, 4343, 71, 23, 41, 1294, 76199, 140992, 1284, 47, 186, 1884, 903, 13305, 15227, 48909, 41664, 7722, 54 ]	[ 0.235107421875, 0.2037353515625, 0.112060546875, 0.2066650390625, 0.0386962890625, 0.158447265625, 0.246826171875, 0.0265350341796875, 0.0445556640625, 0.117919921875, 0.161376953125, 0.110595703125, 0.0177154541015625, 0.1658935546875, 0.0592041015625, 0.0430908203125, 0.07360839843...	embed
26367865_c2	26367865	prolog	2	With_Me, all_About_That_Bass] Anyway, is there more elegant way of doing this? Code signals: How, top10us, all_About_That_Bass, Meghan, Trainor, shake_It_Off, Taylor, Swift, black_Widow, Iggy, Azalea, Featuring, Rita, Ora, bang_Bang, Jessie, Ariana, Grande, Nicki, Minaj, Tove, dont_Tell_Em, Jeremih, Maroon, stay_With_M...	With_Me, all_About_That_Bass] Anyway, is there more elegant way of doing this? Code signals: How, top10us, all_About_That_Bass, Meghan, Trainor, shake_It_Off, Taylor, Swift, black_Widow, Iggy, Azalea, Featuring, Rita, Ora, bang_Bang, Jessie, Ariana, Grande, Nicki, Minaj, Tove, dont_Tell_Em, Jeremih, Maroon, stay_With_M...	[ -0.0107421875, 0.0191650390625, 0.00010538101196289062, 0.038330078125, -0.0166015625, 0.0166015625, 0.01007080078125, 0.00125885009765625, 0.00830078125, 0.01519775390625, -0.01531982421875, -0.033447265625, 0.01556396484375, 0.01153564453125, -0.0118408203125, 0.004150390625, -0.00...	[ 17106, 6696, 4, 756, 24988, 6056, 115743, 63473, 7, 126786, 1286, 27650, 3917, 20594, 903, 28864, 26073, 11249, 2663, 963, 223, 167361, 137879, 748, 174450, 23389, 150369, 63569, 130643, 22556, 36119, 24293, 87, 67192, 1155, 1935, 11, 4221, ...	[ 0.2440185546875, 0.25439453125, 0.021697998046875, 0.15966796875, 0.091552734375, 0.1998291015625, 0.2027587890625, 0.2464599609375, 0.13427734375, 0.0489501953125, 0.076904296875, 0.21435546875, 0.0849609375, 0.1253662109375, 0.1483154296875, 0.2626953125, 0.273193359375, 0.154541...	embed
10066476_c0	10066476	prolog	0	Title: Removing element or list in SWI-Prolog Problem title: Removing element or list in SWI-Prolog Tags: prolog Problem: Removing element or list in SWI-Prolog Another problem, I have a good working "function" for deleting: remove([],X,[]) :- !. remove([X\|T],X,L1) :- !, remove(T,X,L1). remove([H\|T],X,[H\|L1]) :- remove...	Removing element or list in SWI-Prolog Removing element or list in SWI-Prolog prolog Removing SWI-Prolog Removing element or list in SWI-Prolog Another problem, I have a good working "function" for deleting: But it doesn't work like I want it to work. It removes element or even list... ...but doesn't remove all appeara...	[ 0.0079345703125, 0.0224609375, 0.001922607421875, 0.0147705078125, -0.0272216796875, -0.004486083984375, -0.006011962890625, -0.003997802734375, -0.00408935546875, -0.018798828125, 0.0185546875, 0.007537841796875, -0.0155029296875, -0.002960205078125, 0.0026397705078125, -0.00283813476...	[ 853, 432, 6496, 12830, 707, 5303, 159, 38969, 10752, 4867, 23, 502, 2967, 4127, 20697, 137175, 24674, 1916, 22027, 18, 4488, 1884, 3444, 87388, 7, 8789, 756, 170894, 69236, 25647 ]	[ 0.02996826171875, 0.131103515625, 0.045440673828125, 0.17822265625, 0.058868408203125, 0.182861328125, 0.0648193359375, 0.20947265625, 0.1171875, 0.1978759765625, 0.0196990966796875, 0.109130859375, 0.0865478515625, 0.04827880859375, 0.06634521484375, 0.12451171875, 0.1751708984375, ...	embed
12719117_c0	12719117	prolog	0	Title: Prolog: getting first float from list Problem title: Prolog: getting first float from list Tags: prolog Problem: Prolog: getting first float from list I'm having trouble getting the first float element in a list. What I've done so far (completely useless, maybe): get_float( _, F ) :- float( F ). get_float( [ Fir...	Prolog: getting first float from list Prolog: getting first float from list prolog list Prolog get_float First Rest some_pred SomeList FloatNumber Prolog: getting first float from list I'm having trouble getting the first float element in a list. What I've done so far (completely useless, maybe): Gives me this:	[ 0.01043701171875, -0.0162353515625, 0.006591796875, -0.01416015625, -0.004150390625, -0.0042724609375, -0.0019989013671875, -0.0072021484375, 0.00156402587890625, -0.025390625, 0.019775390625, 0.0130615234375, -0.0235595703125, -0.000713348388671875, 0.0086669921875, 0.0009384155273437...	[ 1250, 4867, 20949, 5117, 21917, 257, 1295, 5303, 502, 2046, 52347, 23972, 49756, 3060, 19714, 31384, 154663, 38699, 18444, 26278, 63134, 12830, 23, 16940, 2060, 9393, 51139, 77878 ]	[ 0.131103515625, 0.2181396484375, 0.10260009765625, 0.1602783203125, 0.24267578125, 0.1861572265625, 0.1038818359375, 0.1923828125, 0.0982666015625, 0.0811767578125, 0.209716796875, 0.1337890625, 0.20703125, 0.049407958984375, 0.175537109375, 0.0268402099609375, 0.15087890625, 0.184...	embed
27103666_c0	27103666	prolog	0	Title: Prolog Syntax Error : Operator expected Problem title: Prolog Syntax Error : Operator expected Tags: prolog Problem: Prolog Syntax Error : Operator expected I have the error/solution :5:10 : Syntax Error : Operator expected nonoverlap(R,Task1,Task2) :- Task1 = task(_,T1,L1,Rs2), Task2 = task(_,T2,L2,Rs2), ((memb...	Prolog Syntax Error : Operator expected Prolog Syntax Error : Operator expected prolog Prolog Syntax Error Operator Task1 Task2 Rs2 Rs1 Prolog Syntax Error : Operator expected I have the error/solution :5:10 : Syntax Error : Operator expected	[ 0.00836181640625, 0.0078125, -0.0028839111328125, 0.00897216796875, 0.0026702880859375, -0.01226806640625, -0.0225830078125, 0.01202392578125, 0.0034332275390625, -0.0203857421875, 0.0111083984375, 0.00823974609375, -0.00151824951171875, -0.02099609375, 0.0167236328125, 0.0032653808593...	[ 1250, 4867, 19010, 86531, 212059, 150922, 84751, 502, 9598, 92, 418, 304, 115034, 765, 18499, 166589, 758, 15110, 152 ]	[ 0.1572265625, 0.2452392578125, 0.1668701171875, 0.2174072265625, 0.1949462890625, 0.2763671875, 0.2354736328125, 0.10040283203125, 0.1375732421875, 0.041839599609375, 0.054443359375, 0.12005615234375, 0.1102294921875, 0.009765625, 0.1805419921875, 0.1373291015625, 0.06561279296875, ...	embed
55551512_c0	55551512	prolog	0	Title: Prolog Implementation of foldl1 Problem title: Prolog Implementation of foldl1 Tags: prolog, meta-predicate, fold Problem: Prolog Implementation of foldl1 I am trying to implement foldl1 in prolog without using build-in foldl predicate. My code produce Syntax error: Operator expected : foldl1(_, [E], E). foldl1(...	Prolog Implementation of foldl1 Prolog Implementation of foldl1 prolog meta-predicate fold Prolog Implementation foldl1 Syntax Operator Predicate Result Ans Prolog Implementation of foldl1 I am trying to implement foldl1 in prolog without using build-in foldl predicate. My code produce Syntax error: Operator expected :...	[ 0.004180908203125, -0.01171875, 0.006744384765625, 0.007537841796875, -0.02001953125, 0.001953125, -0.014404296875, 0.007049560546875, -0.002655029296875, -0.04833984375, 0.01953125, -0.01513671875, -0.014404296875, -0.0206298828125, 0.0230712890625, -0.015625, -0.02392578125, 0.02...	[ 1250, 4867, 153941, 18344, 20469, 418, 502, 23550, 19714, 2063, 42822, 19010, 86531, 150922, 7145, 126684, 893, 31577, 29479, 15490, 17368, 45367, 73, 1653, 18151, 27489, 18499, 84751, 87, 41206, 25689, 398 ]	[ 0.1593017578125, 0.222900390625, 0.156982421875, 0.15966796875, 0.1907958984375, 0.12939453125, 0.1474609375, 0.14306640625, 0.111328125, 0.1470947265625, 0.17578125, 0.0946044921875, 0.1583251953125, 0.2646484375, 0.1256103515625, 0.1171875, 0.0159759521484375, 0.038421630859375, ...	embed
22926167_c0	22926167	prolog	0	Title: Adjacent Pair function in prolog Problem title: Adjacent Pair function in prolog Tags: prolog Problem: Adjacent Pair function in prolog what should I do to the following to get the result like this: adjpair(L): The list L consists of pairs of adjacent identical values. ?- adjpair([a, a, b, b, c, c]). true ?- adj...	Adjacent Pair function in prolog Adjacent Pair function in prolog prolog Adjacent Pair is_in Adjacent Pair function in prolog what should I do to the following to get the result like this: The one I have so far is:	[ 0.00144195556640625, 0.0184326171875, 0.0157470703125, 0.00115203857421875, -0.00982666015625, 0.0181884765625, -0.01226806640625, 0.0103759765625, 0.0185546875, -0.0191650390625, 0.0167236328125, 0.020263671875, -0.0086669921875, 0.004119873046875, 0.00186920166015625, 0.0077514648437...	[ 3145, 145, 16797, 1342, 481, 32354, 502, 4867, 83, 73, 5608, 54, 47, 25632, 2046, 16750, 1884, 903, 765, 2060 ]	[ 0.0875244140625, 0.1734619140625, 0.179443359375, 0.1981201171875, 0.1650390625, 0.1773681640625, 0.1385498046875, 0.2139892578125, 0.12060546875, 0.0968017578125, 0.0282440185546875, 0.01397705078125, 0.013671875, 0.048126220703125, 0.048095703125, 0.1229248046875, 0.080322265625, ...	embed
62764673_c0	62764673	prolog	0	Title: Does anyone know what the SLD tree for this prolog code could be? Problem title: Does anyone know what the SLD tree for this prolog code could be? Tags: sld-resolution, prolog Problem: Does anyone know what the SLD tree for this prolog code could be? So this is a prolog code and I can't figure out what the SLD t...	Does anyone know what the SLD tree for this prolog code could be? Does anyone know what the SLD tree for this prolog code could be? sld-resolution prolog Does SLD Person Does anyone know what the SLD tree for this prolog code could be? So this is a prolog code and I can't figure out what the SLD tree is. I know it's no...	[ 0.006866455078125, 0.0380859375, -0.015625, 0.0322265625, -0.02685546875, 0.017333984375, -0.02294921875, -0.00897216796875, -0.00762939453125, -0.04638671875, -0.0177001953125, -0.021484375, -0.00762939453125, 0.004852294921875, 0.0245361328125, -0.0040283203125, 0.0400390625, -0....	[ 35672, 3714, 2367, 159, 30693, 53201, 100, 903, 502, 4867, 18151, 5809, 186, 70, 91, 7344, 107, 166589, 101790, 15270, 831, 18, 26366, 83, 959, 134598, 4488, 168867, 13448, 158839, 3444, 21176, 20650, 129745 ]	[ 0.045928955078125, 0.10888671875, 0.0650634765625, 0.1346435546875, 0.270263671875, 0.26513671875, 0.00311279296875, 0.04095458984375, 0.1544189453125, 0.1995849609375, 0.1988525390625, 0.09490966796875, 0.051239013671875, 0.05950927734375, 0.1004638671875, 0.205322265625, 0.08489990...	embed
56620094_c0	56620094	prolog	0	Title: How can i set a newline in a set string in SWI-Prolog? Problem title: How can i set a newline in a set string in SWI-Prolog? Tags: prolog Problem: How can i set a newline in a set string in SWI-Prolog? I have this string: B='Dogs cats birds and fish'. and i need it to appear in the format bellow: Dogs, cats, bir...	How can i set a newline in a set string in SWI-Prolog? How can i set a newline in a set string in SWI-Prolog? prolog How SWI-Prolog Dogs How can i set a newline in a set string in SWI-Prolog? I have this string: and i need it to appear in the format bellow: Is there any possible way for this to happen? I tried nl as in...	[ 0.001007080078125, -0.0169677734375, 0.0123291015625, 0.0299072265625, -0.009521484375, 0.0162353515625, 0.004119873046875, -0.0022125244140625, 0.00860595703125, 0.01141357421875, -0.0164794921875, 0.007080078125, 0.014404296875, -0.003997802734375, -0.003631591796875, 0.0086059570312...	[ 11249, 831, 17, 5423, 3525, 2256, 23, 79315, 159, 38969, 10752, 4867, 10, 502, 9, 41129, 7, 903, 3871, 108975, 9384, 41566, 7722, 3917, 37842, 13169, 237, 335, 8331, 9405, 7515, 263, 67155, 110, 25820, 136 ]	[ 0.05426025390625, 0.065185546875, 0.044158935546875, 0.2310791015625, 0.168212890625, 0.272705078125, 0.06805419921875, 0.2548828125, 0.06683349609375, 0.208740234375, 0.1396484375, 0.22509765625, 0.0430908203125, 0.08251953125, 0.001861572265625, 0.17724609375, 0.014434814453125, ...	embed
65495313_c0	65495313	prolog	0	Title: How to create a list without using findall? Prolog Problem title: How to create a list without using findall? Prolog Tags: prolog Problem: How to create a list without using findall? Prolog I am generating permutations: takeout(X,[X\|T],T). takeout(X,[F\|R],[F\|S]):- takeout(X,R,S). perm([],[]). perm([X\|Y],Z):- per...	How to create a list without using findall? Prolog How to create a list without using findall? Prolog prolog findall How Prolog List How to create a list without using findall? Prolog I am generating permutations: I want to know how to create a list of all the permutations without using findall. Example:	[ 0.01214599609375, 0.0091552734375, 0.0079345703125, 0.0037078857421875, -0.002197265625, 0.0020599365234375, -0.043212890625, 0.00095367431640625, 0.0042724609375, -0.03076171875, 0.004608154296875, -0.0167236328125, 0.0191650390625, 0.007659912109375, -0.0018310546875, 0.025146484375,...	[ 11249, 28282, 10, 5303, 15490, 17368, 7413, 5584, 1250, 4867, 47, 502, 32036, 12663, 117, 14311, 21094, 756 ]	[ 0.0192108154296875, 0.1624755859375, 0.019866943359375, 0.2105712890625, 0.13134765625, 0.032958984375, 0.11346435546875, 0.175537109375, 0.109130859375, 0.203857421875, 0.0155181884765625, 0.0404052734375, 0.1732177734375, 0.055877685546875, 0.04107666015625, 0.15185546875, 0.046539...	embed
31584614_c1	31584614	prolog	1	would not be exported. I need to use csv_load_mod:mt_relation/3 etc. Is there a way to get a module to export a dynamic predicate or adapt prepare_db/3 so the facts it asserts are not local or they get asserted to the module that called it? Code signals: Modules, csv_load_mod, prepare_db, use_module, set_prolog_stack,...	would not be exported. I need to use csv_load_mod:mt_relation/3 etc. Is there a way to get a module to export a dynamic predicate or adapt prepare_db/3 so the facts it asserts are not local or they get asserted to the module that called it? Code signals: Modules, csv_load_mod, prepare_db, use_module, set_prolog_stack,...	[ 0.026611328125, -0.0031890869140625, 0.01153564453125, 0.017333984375, -0.0037078857421875, 0.007354736328125, 0.022705078125, -0.001373291015625, 0.0189208984375, -0.036376953125, -0.0126953125, 0.0045166015625, -0.0196533203125, -0.0177001953125, 0.017333984375, -0.0140380859375, -...	[ 2806, 959, 186, 31255, 297, 3871, 4527, 20763, 334, 63033, 13415, 18, 107, 57860, 18113, 3917, 2046, 88996, 84079, 1653, 2063, 67, 39908, 114606, 48073, 15824, 237, 33657, 4000, 16865, 35839, 28864, 26073, 63014, 83279, 5423, 3454, 4867, 59...	[ 0.048309326171875, 0.089111328125, 0.0355224609375, 0.2498779296875, 0.10888671875, 0.028167724609375, 0.0416259765625, 0.04132080078125, 0.18115234375, 0.10211181640625, 0.1346435546875, 0.0758056640625, 0.05487060546875, 0.1639404296875, 0.165283203125, 0.038330078125, 0.0240783691...	embed
32737396_c0	32737396	prolog	0	Title: Arithmetic comparison in Prolog Problem title: Arithmetic comparison in Prolog Tags: prolog, arithmetic-expressions Problem: Arithmetic comparison in Prolog Let's say we have two variables X and Y . X is 53 and Y is 52 . What I want to do is compare them by adding 1 to the Y , so that it would be 53 - therefore ...	Arithmetic comparison in Prolog Arithmetic comparison in Prolog prolog arithmetic-expressions Arithmetic Prolog Arithmetic comparison in Prolog Let's say we have two variables X and Y . X is 53 and Y is 52 . What I want to do is compare them by adding 1 to the Y , so that it would be 53 - therefore X would be equal to ...	[ 0.005615234375, 0.0034637451171875, -0.001922607421875, 0.0322265625, 0.006103515625, 0.01129150390625, -0.0022125244140625, 0.004241943359375, -0.004608154296875, 0.0032806396484375, 0.0137939453125, 0.009521484375, -0.00021839141845703125, 0.0079345703125, 0.0135498046875, -0.0231933...	[ 1172, 8962, 282, 225490, 1250, 4867, 23, 502, 204629, 6626, 77336, 7, 1193, 136, 990, 8934, 7221, 3444, 69101, 154107, 106, 47, 2806, 105950, 997, 31577, 17368, 39933, 66044, 33342, 8781, 98320, 132283 ]	[ 0.00225830078125, 0.12451171875, 0.07421875, 0.224609375, 0.1744384765625, 0.26708984375, 0.01531982421875, 0.122314453125, 0.1016845703125, 0.052154541015625, 0.21728515625, 0.007904052734375, 0.15185546875, 0.0703125, 0.1517333984375, 0.2401123046875, 0.2509765625, 0.021224975585...	embed
5031551_c0	5031551	prolog	0	Title: Prolog list operation Problem title: Prolog list operation Tags: list, prolog Problem: Prolog list operation Here's my problem (by example since that's quicker): ?- enum_list([alpha, beta, gamma, beta, beta, delta, epsilon, alpha], L). L = [alpha1, beta1, gamma, beta2, beta3, delta, epsilon, alpha2]. The problem...	Prolog list operation Prolog list operation list prolog Prolog enum_list alpha1 beta1 beta2 beta3 alpha2 Prolog list operation Here's my problem (by example since that's quicker): The problem is simple when I am allowed to reorder the list (just sort the list, group same elements into lists, enum the lists if they are ...	[ 0.0081787109375, 0.0089111328125, 0, -0.00567626953125, -0.005767822265625, 0.01611328125, -0.01519775390625, 0.007415771484375, 0.00811767578125, -0.00872802734375, 0.000370025634765625, 0.0179443359375, 0.00738525390625, 0.018310546875, -0.00885009765625, 0.006195068359375, 0.00083...	[ 1250, 4867, 5303, 41018, 502, 22, 316, 6562, 144, 14612, 418, 51703, 304, 363, 2967, 27781, 63773, 56, 8781, 107003, 47, 456, 80596, 70, 12096, 21115, 5701, 80854, 3934, 2174, 1836, 51713, 3501, 4879, 4966, 87, 3444, 13695, 12989, 25647 ]	[ 0.1734619140625, 0.248779296875, 0.222412109375, 0.206787109375, 0.1304931640625, 0.1243896484375, 0.212158203125, 0.202880859375, 0.07080078125, 0.149658203125, 0.00079345703125, 0.1375732421875, 0.03326416015625, 0.06195068359375, 0.1490478515625, 0.0555419921875, 0.0526123046875, ...	embed
57956107_c0	57956107	prolog	0	Title: Write immediatly on the console Problem title: Write immediatly on the console Tags: prolog Problem: Write immediatly on the console I want to abort my program right after it writes something to the console, but "write" is not displaying the message immediatly. write('The AI wins!'), abort. This is the message I...	Write immediatly on the console Write immediatly on the console prolog Write Write immediatly on the console I want to abort my program right after it writes something to the console, but "write" is not displaying the message immediatly. This is the message I want to be shown. I tried it with "print" and it stays the s...	[ -0.0034027099609375, 0.0196533203125, -0.000881195068359375, -0.01123046875, -0.003173828125, 0.0020294189453125, 0.013916015625, -0.01116943359375, -0.0029754638671875, -0.01324462890625, 0.011962890625, 0.0181884765625, -0.0002803802490234375, 0.0054931640625, 0.01446533203125, 0.008...	[ 601, 18781, 566, 12333, 18, 538, 98, 130250, 502, 4867, 3444, 47, 64853, 1528, 7103, 33022, 434, 959, 44116, 214, 26008, 127887, 37842, 35662, 24765, 5701, 18026, 1495, 6056, 7077, 18499, 86429, 3957, 38730, 19916, 7, 38, 14602, 32316, 38...	[ 0.15087890625, 0.2275390625, 0.0928955078125, 0.2138671875, 0.1212158203125, 0.11474609375, 0.111328125, 0.255126953125, 0.1533203125, 0.204833984375, 0.083984375, 0.108642578125, 0.279296875, 0.145751953125, 0.1015625, 0.14306640625, 0.1087646484375, 0.06787109375, 0.17309570312...	embed
67684953_c0	67684953	prolog	0	Title: Display Last Element in List Prolog Problem title: Display Last Element in List Prolog Tags: prolog Problem: Display Last Element in List Prolog Given the list [1, 2, 3, 4] , display the last element. I am using only one parameter and using recursion. This is what I tried. But the output is always true . lastEle...	Display Last Element in List Prolog Display Last Element in List Prolog prolog Display Last Element List Prolog Stack Tail Head Singleton Display Last Element in List Prolog Given the list [1, 2, 3, 4] , display the last element. I am using only one parameter and using recursion. This is what I tried. But the output is...	[ 0.017578125, 0.0152587890625, 0.014404296875, 0.0128173828125, -0.00142669677734375, 0.0196533203125, -0.007171630859375, -0.00124359130859375, -0.0133056640625, -0.007476806640625, 0.0216064453125, -0.046142578125, -0.014404296875, -0.0028076171875, 0.0087890625, -0.000169754028320312...	[ 90045, 21672, 48325, 23, 32036, 1250, 4867, 502, 6512, 2594, 1218, 379, 44816, 43609, 1507, 5303, 68252, 116, 138, 201, 44116, 4568, 12830, 17368, 4734, 1632, 171859, 195625, 1830, 37842, 140992, 11343, 29568, 20949 ]	[ 0.1802978515625, 0.256591796875, 0.22314453125, 0.029876708984375, 0.1866455078125, 0.1478271484375, 0.2191162109375, 0.0845947265625, 0.09674072265625, 0.00653076171875, 0.1033935546875, 0.03070068359375, 0.13623046875, 0.1180419921875, 0.134521484375, 0.1466064453125, 0.00863647460...	embed
41748222_c1	41748222	prolog	1	), structuralOrDependencyRelation( RelationTwo), weakest( Relation, RelationOne, RelationTwo), isADirectRelation( Source, RelationTwo, Intermediate), isARelation( Intermediate, RelationOne, Target, [[Source,RelationTwo,Intermediate]\|Visited]). How do I implement that the first call isARelation(A, B, C, []). does the ca...	), structuralOrDependencyRelation( RelationTwo), weakest( Relation, RelationOne, RelationTwo), isADirectRelation( Source, RelationTwo, Intermediate), isARelation( Intermediate, RelationOne, Target, [[Source,RelationTwo,Intermediate]\|Visited]). How do I implement that the first call isARelation(A, B, C, []). does the ca...	[ -0.000545501708984375, 0.007598876953125, 0.01708984375, 0.019287109375, 0.00848388671875, 0.018310546875, -0.0125732421875, -0.0247802734375, 0.01385498046875, -0.0262451171875, 0.0087890625, 0.0281982421875, -0.03857421875, 0.01495361328125, 0.0322265625, -0.005218505859375, 0.0075...	[ 247, 118990, 141, 19060, 4657, 26885, 27771, 4332, 57860, 116822, 618, 3613, 642, 344, 525, 62068, 83, 284, 184911, 77641, 12333, 67, 11909, 13, 160017, 211235, 65331, 194, 11249, 54, 87, 29479, 5117, 11782, 335, 313, 74481, 50339, 136, 1...	[ 0.049591064453125, 0.212890625, 0.0782470703125, 0.1641845703125, 0.0823974609375, 0.2054443359375, 0.0341796875, 0.1197509765625, 0.259765625, 0.246826171875, 0.039337158203125, 0.1690673828125, 0.1192626953125, 0.1361083984375, 0.1602783203125, 0.1385498046875, 0.1341552734375, 0...	embed
30117272_c0	30117272	prolog	0	Title: getting out of local stack at prolog Problem title: getting out of local stack at prolog Tags: transitive-closure, prolog Problem: getting out of local stack at prolog p(0,0). p(0,1). p(0,2). p(0,3). p(0,4). p(1,1). p(1,2). p(1,3). p(1,4). p(1,0). p(2,0). p(2,1). p(2,2). p(2,3). p(2,4). p(3,0). p(3,1). p(3,2). p...	getting out of local stack at prolog getting out of local stack at prolog transitive-closure prolog Y-1 X-1 ERROR getting out of local stack at prolog I don't know why this code I wrote isn't working. e.g.:	[ 0.01031494140625, 0.013427734375, 0.0146484375, 0.01708984375, 0.0005950927734375, -0.0087890625, -0.021728515625, 0.006072998046875, -0.00182342529296875, -0.043701171875, 0.00157928466796875, 0.010986328125, 0.00015544891357421875, 0.0036773681640625, 0.03515625, 0.000238418579101562...	[ 20949, 1810, 111, 4000, 177261, 99, 502, 4867, 62621, 5844, 170224, 990, 5759, 1193, 151206, 24638, 3714, 15400, 903, 18151, 54397, 56112, 18, 20697 ]	[ 0.11676025390625, 0.2093505859375, 0.1929931640625, 0.1666259765625, 0.220947265625, 0.1051025390625, 0.1322021484375, 0.254638671875, 0.126220703125, 0.11090087890625, 0.177978515625, 0.11468505859375, 0.1258544921875, 0.077392578125, 0.123291015625, 0.08013916015625, 0.056701660156...	embed
41935073_c0	41935073	prolog	0	Title: How to trace backtracks of clpfd in prolog? Problem title: How to trace backtracks of clpfd in prolog? Tags: sudoku, clpfd, prolog Problem: How to trace backtracks of clpfd in prolog? I am making a sudoku solver with prolog using clpfd library . I have to trace the backtracks and every squares labeled with row a...	How to trace backtracks of clpfd in prolog? How to trace backtracks of clpfd in prolog? sudoku clpfd prolog How How to trace backtracks of clpfd in prolog? I am making a sudoku solver with prolog using clpfd library . I have to trace the backtracks and every squares labeled with row and column and the number it gets in...	[ 0.01434326171875, 0.0220947265625, 0.002532958984375, 0.020751953125, -0.01007080078125, -0.00799560546875, 0.0028228759765625, 0.011474609375, -0.00830078125, -0.03857421875, -0.00927734375, -0.0242919921875, -0.01153564453125, -0.00165557861328125, 0.01104736328125, 0.002059936523437...	[ 11249, 47, 144851, 4420, 125728, 7, 111, 33139, 39557, 71, 23, 502, 4867, 8932, 38067, 3115, 814, 35773, 11907, 108047, 67967, 678, 15555, 316, 14012, 62163, 3173, 2046, 4677, 1295, 234873, 139999, 46552, 25553, 6892, 91736, 68034 ]	[ 0.09844970703125, 0.05279541015625, 0.2255859375, 0.177001953125, 0.2578125, 0.08367919921875, 0.01611328125, 0.0943603515625, 0.1307373046875, 0.185302734375, 0.0648193359375, 0.1402587890625, 0.212646484375, 0.08294677734375, 0.155029296875, 0.051055908203125, 0.055572509765625, ...	embed
10609483_c0	10609483	prolog	0	Title: Converting OSM data to Prolog facts? Problem title: Converting OSM data to Prolog facts? Tags: prolog, openstreetmap, converters Problem: Converting OSM data to Prolog facts? For a small experiment, I would like to transform an exported OSM dataset from XML to Prolog. I know there are certain general purpose XML...	Converting OSM data to Prolog facts? Converting OSM data to Prolog facts? prolog openstreetmap converters Converting OSM Prolog Converting OSM data to Prolog facts? For a small experiment, I would like to transform an exported OSM dataset from XML to Prolog. I know there are certain general purpose XML to Prolog conver...	[ 0.026611328125, 0.0103759765625, 0.00262451171875, -0.0257568359375, 0.011474609375, 0.0135498046875, -0.0004367828369140625, -0.0205078125, -0.00933837890625, -0.029052734375, 0.0064697265625, -0.00799560546875, -0.015380859375, -0.00482177734375, -0.0031280517578125, -0.0064697265625...	[ 1657, 814, 1916, 180, 18148, 2053, 47, 1250, 4867, 15824, 7, 502, 9803, 5967, 62346, 172127, 19336, 28007, 1884, 27198, 31255, 297, 3509, 1295, 92537, 4537, 60042, 29016, 617, 1542, 7237, 2965, 3917, 2967, 93002, 35773, 96760, 142267, 18811...	[ 0.0687255859375, 0.13818359375, 0.055908203125, 0.1734619140625, 0.270263671875, 0.1614990234375, 0.1224365234375, 0.175537109375, 0.266357421875, 0.1787109375, 0.13623046875, 0.1080322265625, 0.07275390625, 0.112060546875, 0.178466796875, 0.2288818359375, 0.034759521484375, 0.1215...	embed
35484964_c0	35484964	prolog	0	Title: Determining if a list is empty or not Problem title: Determining if a list is empty or not Tags: prolog, list Problem: Determining if a list is empty or not I want to do some if \| else stuff in prolog. Below is my code, Prolog will return 'R = false' if my input list is not empty, it will return 'false' if my li...	Determining if a list is empty or not Determining if a list is empty or not prolog list Determining Determining if a list is empty or not I want to do some if \| else stuff in prolog. Below is my code, Prolog will return 'R = false' if my input list is not empty, it will return 'false' if my list is empty. What do I mis...	[ 0.005615234375, 0.0035400390625, 0.0081787109375, 0.01397705078125, -0.00811767578125, 0.0087890625, 0.00604248046875, -0.00140380859375, 0.007598876953125, 0.0291748046875, 0.0186767578125, -0.0002689361572265625, -0.035888671875, 0.006683349609375, 0.00189971923828125, 0.011352539062...	[ 262, 30524, 2174, 5303, 83, 201505, 707, 959, 502, 4867, 3444, 37076, 18151, 1250, 30646, 1052, 2203, 98320, 107730, 8710, 18025, 28864, 13538 ]	[ 0.0526123046875, 0.1329345703125, 0.0950927734375, 0.1982421875, 0.070068359375, 0.22509765625, 0.045623779296875, 0.08111572265625, 0.1082763671875, 0.180908203125, 0.00091552734375, 0.093017578125, 0.07464599609375, 0.1051025390625, 0.09613037109375, 0.1123046875, 0.00738525390625,...	embed
35616452_c0	35616452	prolog	0	Title: How can I test a phrase with a context free grammar writing with DCG prolog Problem title: How can I test a phrase with a context free grammar writing with DCG prolog Tags: dcg, prolog Problem: How can I test a phrase with a context free grammar writing with DCG prolog I have a context free grammar which I have ...	How can I test a phrase with a context free grammar writing with DCG prolog How can I test a phrase with a context free grammar writing with DCG prolog dcg prolog How DCG How can I test a phrase with a context free grammar writing with DCG prolog I have a context free grammar which I have written in DCG prolog. I also ...	[ 0.033203125, -0.0101318359375, -0.00433349609375, 0.0277099609375, 0.0003833770751953125, 0.00738525390625, 0.00109100341796875, -0.0001773834228515625, 0.0096435546875, -0.0093994140625, -0.006011962890625, -0.004180908203125, -0.00799560546875, 0.01080322265625, 0.00299072265625, 0.0...	[ 11249, 831, 87, 3034, 113860, 678, 43701, 4092, 122092, 147, 32562, 391, 56367, 502, 4867, 177, 59121, 27781, 46876, 3444, 47, 12638, 493, 26785, 3642, 54, 903 ]	[ 0.045379638671875, 0.0628662109375, 0.0206298828125, 0.22265625, 0.2291259765625, 0.07354736328125, 0.1680908203125, 0.111083984375, 0.091552734375, 0.0753173828125, 0.11279296875, 0.05950927734375, 0.180419921875, 0.0902099609375, 0.173828125, 0.040191650390625, 0.0159149169921875, ...	embed
28642031_c1	28642031	prolog	1	b')" I don't like compiling a "day.exe" to run a script ( according to the docs this often is not necessary), but I have found no other way to pass arguments to rules. I saw a basic intro on swi-pl.org that has not helped much. It does not explain how to make the leap from the script.sh file example to the execution of...	b')" I don't like compiling a "day.exe" to run a script ( according to the docs this often is not necessary), but I have found no other way to pass arguments to rules. I saw a basic intro on swi-pl.org that has not helped much. It does not explain how to make the leap from the script.sh file example to the execution of...	[ 0.0211181640625, 0.01165771484375, -0.004425048828125, 0.030029296875, -0.00567626953125, 0.000640869140625, 0.0011444091796875, -0.0034637451171875, 0.004364013671875, -0.0247802734375, -0.01324462890625, 0.012939453125, -0.004302978515625, 0.01434326171875, 0.00537109375, -0.01049804...	[ 25, 2301, 18, 1884, 9969, 49725, 5636, 5, 46480, 11675, 26499, 27983, 63559, 14037, 3917, 27875, 10750, 7, 47, 91736, 24124, 62822, 64627, 91, 2452, 2424, 1478, 104902, 5045, 73342, 3642, 95, 2631, 1295, 1495, 11435, 27781, 71924, 64, 13,...	[ 0.01605224609375, 0.048065185546875, 0.0770263671875, 0.130126953125, 0.082763671875, 0.01324462890625, 0.1707763671875, 0.019378662109375, 0.210693359375, 0.09478759765625, 0.25048828125, 0.06866455078125, 0.1016845703125, 0.009429931640625, 0.038116455078125, 0.13134765625, 0.26000...	embed
55390157_c0	55390157	prolog	0	Title: How to access rule data in PROLOG Problem title: How to access rule data in PROLOG Tags: prolog Problem: How to access rule data in PROLOG I have to determine whether two rectangles overlap or not, I can do this but I am struggling with figuring out how to grab my given data, and compare it to eachother to deter...	How to access rule data in PROLOG How to access rule data in PROLOG prolog R1 How PROLOG Have How to access rule data in PROLOG I have to determine whether two rectangles overlap or not, I can do this but I am struggling with figuring out how to grab my given data, and compare it to eachother to determine larger values...	[ 0.026123046875, 0.01092529296875, 0.003143310546875, 0.029296875, 0.00506591796875, 0.022705078125, 0.00064849853515625, 0.017333984375, -0.00064849853515625, -0.0216064453125, 0.0113525390625, 0.00157928466796875, 0.006011962890625, -0.0272216796875, 0.0245361328125, -0.00927734375, ...	[ 11249, 47, 17203, 79986, 2053, 23, 10514, 47510, 502, 4867, 627, 418, 31901, 83324, 36766, 6626, 148734, 449, 1577, 645, 6324, 959, 831, 237875, 26747, 3642, 59102, 34475, 69101, 126340, 150679, 142424 ]	[ 0.07244873046875, 0.06817626953125, 0.2236328125, 0.2398681640625, 0.2239990234375, 0.09393310546875, 0.1907958984375, 0.26416015625, 0.131103515625, 0.2327880859375, 0.09112548828125, 0.08514404296875, 0.044036865234375, 0.11846923828125, 0.0179290771484375, 0.0936279296875, 0.11981...	embed
7485212_c0	7485212	prolog	0	Title: "Not equal" sign in Visual Prolog? Problem title: "Not equal" sign in Visual Prolog? Tags: prolog, visual-prolog, equals, clause Problem: "Not equal" sign in Visual Prolog? I can't find any documentation on "not equal" sign in Visual Prolog. Please provide the right solution of this problem: ...	"Not equal" sign in Visual Prolog? "Not equal" sign in Visual Prolog? prolog visual-prolog equals clause Not Visual Prolog Person Sister Parent "Not equal" sign in Visual Prolog? I can't find any documentation on "not equal" sign in Visual Prolog. Please provide the right solution of this problem:	[ 0.01544189453125, 0.01171875, 0.0184326171875, 0.00592041015625, -0.035888671875, 0.01708984375, -0.0016021728515625, -0.0024261474609375, -0.0111083984375, -0.0113525390625, -0.00726318359375, -0.0150146484375, 0.018798828125, 0.006744384765625, 0.001556396484375, 0.017333984375, -0...	[ 41502, 122116, 105950, 1230, 24092, 73372, 1250, 4867, 23, 502, 21176, 3454, 70731, 11205, 15270, 602, 1515, 170918, 209806, 10869, 7108, 29806, 2967 ]	[ 0.07177734375, 0.1488037109375, 0.193115234375, 0.01305389404296875, 0.1805419921875, 0.1724853515625, 0.09124755859375, 0.1920166015625, 0.0045166015625, 0.054443359375, 0.1680908203125, 0.0748291015625, 0.1107177734375, 0.10137939453125, 0.061065673828125, 0.075927734375, 0.0759887...	embed
24003082_c2	24003082	prolog	2	.Plc, Netbeans, SWI, Nobukuni, Kino, Queens, Applet, Runnable, Run, Frame, f.addWindowListener, WindowAdapter, WindowEvent, System.exit, qb.init, f.add, Center, f.setSize, f.show, qb.run1, Color, Thread, System.out.println, Start, runner.start, runner.resume, runner.suspend, run1, Plc.startPlc, Integer, Plc, Object, Pl...	.Plc, Netbeans, SWI, Nobukuni, Kino, Queens, Applet, Runnable, Run, Frame, f.addWindowListener, WindowAdapter, WindowEvent, System.exit, qb.init, f.add, Center, f.setSize, f.show, qb.run1, Color, Thread, System.out.println, Start, runner.start, runner.resume, runner.suspend, run1, Plc.startPlc, Integer, Plc, Object, Pl...	[ 0.00098419189453125, 0.0035858154296875, -0.006011962890625, 0.0238037109375, -0.006622314453125, 0.0010528564453125, 0.0264892578125, -0.01055908203125, 0.0057373046875, -0.0203857421875, -0.0037078857421875, 0.0185546875, -0.00170135498046875, -0.018310546875, -0.0123291015625, -0.01...	[ 6, 5, 683, 32838, 4, 10086, 372, 10133, 159, 38969, 438, 107798, 93, 49309, 44109, 7, 4129, 18, 28398, 19, 2886, 42557, 13, 1238, 4028, 92049, 24293, 154663, 39060, 176501, 22409, 2631, 720, 192134, 12353, 23399, 8096, 275, 73, 217, 115...	[ 0.041534423828125, 0.19775390625, 0.0889892578125, 0.2254638671875, 0.0511474609375, 0.14794921875, 0.241943359375, 0.1826171875, 0.05853271484375, 0.18994140625, 0.07733154296875, 0.1492919921875, 0.156982421875, 0.2215576171875, 0.18017578125, 0.08502197265625, 0.1766357421875, 0...	embed
71687825_c0	71687825	prolog	0	Title: knowledgment unification in prolog Problem title: knowledgment unification in prolog Tags: prolog, zebra-puzzle Problem: knowledgment unification in prolog What I have to do is to unify the possible options and solve the problem with these sentences The Spaniard lives next to the red house. The Norwegian lives i...	knowledgment unification in prolog knowledgment unification in prolog prolog zebra-puzzle knowledgment unification in prolog What I have to do is to unify the possible options and solve the problem with these sentences This is my attempt but I am getting an error, could someone please help me.	[ -0.00555419921875, 0.00186920166015625, 0.0220947265625, 0.008544921875, 0.00970458984375, -0.000965118408203125, -0.033447265625, 0.01068115234375, -0.00040435791015625, -0.031005859375, -0.004638671875, 0.01336669921875, 0.0040283203125, -0.0157470703125, -0.00933837890625, 0.0080566...	[ 3714, 6259, 177, 674, 51, 41274, 23, 502, 4867, 116232, 1766, 13894, 133, 765, 47, 54, 40383, 7722, 50717, 86869, 2967, 678, 6097, 149357, 81887, 20949, 18499, 5809, 22008, 22936, 4358, 5 ]	[ 0.179931640625, 0.172119140625, 0.11865234375, 0.13134765625, 0.1986083984375, 0.2139892578125, 0.0775146484375, 0.1519775390625, 0.22509765625, 0.193603515625, 0.08306884765625, 0.09735107421875, 0.085693359375, 0.05096435546875, 0.0056610107421875, 0.0195159912109375, 0.17407226562...	embed
3796866_c0	3796866	prolog	0	Title: how to count odd and even number with using PROLOG Problem title: how to count odd and even number with using PROLOG Tags: list, prolog, recursion Problem: how to count odd and even number with using PROLOG question is: when we key in mem([1,2,3,4,5]). we will get the output as bellow: odd=3 even=2 my coding is ...	how to count odd and even number with using PROLOG how to count odd and even number with using PROLOG list prolog recursion PROLOG how to count odd and even number with using PROLOG question is: when we key in mem([1,2,3,4,5]). we will get the output as bellow: odd=3 even=2 my coding is like that but cannot run. can he...	[ 0.0074462890625, 0.0185546875, -0.00141143798828125, -0.0008392333984375, 0.0028228759765625, 0.031005859375, -0.0177001953125, 0.01025390625, 0.006805419921875, -0.0242919921875, 0.01031494140625, -0.043212890625, 0.01171875, 0.019287109375, 0.024169921875, -0.00445556640625, -0.004...	[ 3642, 47, 54529, 70270, 136, 3853, 14012, 678, 17368, 10514, 47510, 5303, 502, 4867, 195625, 1830, 9655, 22799, 23, 7199, 133063, 363, 80389, 2046, 140992, 41566, 76067, 55257, 552, 6238, 53418, 11675, 4358, 12765, 121742, 1542, 62766, 132, ...	[ 0.05682373046875, 0.052276611328125, 0.20361328125, 0.261474609375, 0.148193359375, 0.2177734375, 0.1844482421875, 0.125732421875, 0.1029052734375, 0.1669921875, 0.2166748046875, 0.1212158203125, 0.1146240234375, 0.15283203125, 0.142578125, 0.02105712890625, 0.014404296875, 0.16210...	embed
11355151_c0	11355151	prolog	0	Title: prolog trace how to use Problem title: prolog trace how to use Tags: trace, prolog Problem: prolog trace how to use How to go second step when trace prolog program? For example, I want to trace following simple program: length1([],0). length1([_X\|Xs],N):- length1(Xs,N1), N is N1+1. I trace program: ?- trace,leng...	prolog trace how to use prolog trace how to use trace prolog length1 Call _G231 Exit prolog trace how to use How to go second step when trace prolog program? For example, I want to trace following simple program: I trace program: But as we see, it immediately gives answer. But I thought it should be like Call:(8) ... C...	[ 0.01080322265625, 0.0201416015625, 0.003570556640625, 0.01397705078125, -0.00311279296875, 0.0028228759765625, -0.001953125, 0.00946044921875, 0.004547119140625, -0.052001953125, 0.01055908203125, 0.00168609619140625, -0.031982421875, 0.002471923828125, 0.025146484375, -0.01513671875, ...	[ 502, 4867, 144851, 3642, 47, 4527, 140909, 418, 26265, 724, 304, 5016, 5443, 738, 17932, 29954, 1528, 25632, 8781, 1957, 109312, 76199, 35166, 17569, 5608, 1884, 50490, 222104, 20594, 44691 ]	[ 0.1680908203125, 0.241455078125, 0.26611328125, 0.07586669921875, 0.052490234375, 0.1571044921875, 0.1505126953125, 0.05322265625, 0.14111328125, 0.0196075439453125, 0.07379150390625, 0.2000732421875, 0.055938720703125, 0.05841064453125, 0.138671875, 0.141845703125, 0.1358642578125, ...	embed
54185772_c0	54185772	prolog	0	Title: Member (extended) predicate - find element in a list of lists (any level) Problem title: Member (extended) predicate - find element in a list of lists (any level) Tags: prolog Problem: Member (extended) predicate - find element in a list of lists (any level) We all know the classic Prolog predicate for member: m...	Member (extended) predicate - find element in a list of lists (any level) Member (extended) predicate - find element in a list of lists (any level) prolog Member Member (extended) predicate - find element in a list of lists (any level) We all know the classic Prolog predicate for member: I am struggling to come up with...	[ -0.000873565673828125, 0.01080322265625, 0.0216064453125, -0.0003643035888671875, -0.01251220703125, -0.0003719329833984375, 0.014404296875, 0.01312255859375, -0.000156402587890625, -0.04931640625, 0.0216064453125, 0.0010833740234375, 0.0189208984375, 0.00286865234375, -0.003143310546875...	[ 74057, 3355, 35548, 71, 1653, 2063, 67, 20, 7413, 12830, 23, 5303, 7, 4848, 17366, 502, 4867, 756, 3714, 54704, 1250, 100, 32786, 237875, 1380, 1257, 65042, 297, 157318, 4390, 27781 ]	[ 0.281005859375, 0.057220458984375, 0.1383056640625, 0.064453125, 0.1798095703125, 0.2252197265625, 0.124755859375, 0.0255126953125, 0.168701171875, 0.1751708984375, 0.044677734375, 0.187744140625, 0.02581787109375, 0.041168212890625, 0.146484375, 0.1380615234375, 0.2109375, 0.02420...	embed
37154622_c0	37154622	prolog	0	Title: How to find all perfect matching in bipartite graph using Prolog? Problem title: How to find all perfect matching in bipartite graph using Prolog? Tags: matching, bipartite, prolog-findall, prolog Problem: How to find all perfect matching in bipartite graph using Prolog? I'm trying to find all perfect matching i...	How to find all perfect matching in bipartite graph using Prolog? How to find all perfect matching in bipartite graph using Prolog? matching bipartite prolog-findall prolog Prolog How How to find all perfect matching in bipartite graph using Prolog? I'm trying to find all perfect matching in bipartite graph and then do...	[ -0.00946044921875, 0.017822265625, 0.00946044921875, 0.000278472900390625, -0.0021514892578125, 0.0103759765625, -0.00194549560546875, 0.0074462890625, 0.006927490234375, -0.040283203125, 0.004669189453125, 0.01043701171875, 0.006591796875, -0.00933837890625, -0.00982666015625, 0.00427...	[ 11249, 7413, 756, 15787, 14858, 214, 23, 333, 15866, 67, 41382, 17368, 1250, 4867, 47, 502, 111607, 5584, 31577, 351, 219836, 29806, 112465, 234873, 959, 78643, 80973 ]	[ 0.052490234375, 0.12744140625, 0.123291015625, 0.21923828125, 0.248779296875, 0.1563720703125, 0.054107666015625, 0.1585693359375, 0.1585693359375, 0.0841064453125, 0.195068359375, 0.04376220703125, 0.1536865234375, 0.236083984375, 0.0236663818359375, 0.09796142578125, 0.052185058593...	embed
44087873_c0	44087873	prolog	0	Title: How can I combine format and print in prolog? Problem title: How can I combine format and print in prolog? Tags: prolog Problem: How can I combine format and print in prolog? How can I combine format and print in prolog? Basically, I pretend to print a message like "Element 5 occurs 3 times" in prolog. Number 5 ...	How can I combine format and print in prolog? How can I combine format and print in prolog? prolog How Element count_occur How can I combine format and print in prolog? How can I combine format and print in prolog? Basically, I pretend to print a message like "Element 5 occurs 3 times" in prolog. Number 5 and 3 depends...	[ -0.0036773681640625, 0.0166015625, -0.004241943359375, 0.011962890625, 0.0213623046875, 0.0101318359375, -0.003662109375, 0.00034332275390625, 0.014892578125, -0.024658203125, 0.006683349609375, -0.02880859375, -0.003692626953125, -0.00165557861328125, 0.00323486328125, -0.010009765625...	[ 11249, 831, 70163, 9384, 136, 28412, 23, 502, 4867, 48325, 54529, 6652, 16820, 48339, 26008, 647, 19929, 190, 74918, 7, 138, 20028, 103332, 56566, 71924, 145581, 1884, 27781 ]	[ 0.056884765625, 0.0941162109375, 0.2178955078125, 0.2188720703125, 0.042083740234375, 0.203369140625, 0.052764892578125, 0.182861328125, 0.2386474609375, 0.2196044921875, 0.21044921875, 0.08819580078125, 0.156494140625, 0.1680908203125, 0.1182861328125, 0.049560546875, 0.170043945312...	embed
13150916_c0	13150916	prolog	0	Title: How to add to end of list in prolog Problem title: How to add to end of list in prolog Tags: prolog Problem: How to add to end of list in prolog I am trying to add one item to the end of a list in prolog, but it keeps on failing. insertAtEnd(X,[ ],[X]). insertAtEnd(X,[H\|T],[H\|Z]) :- insertAtEnd(X,T,Z). letters([...	How to add to end of list in prolog How to add to end of list in prolog prolog How Stored How to add to end of list in prolog I am trying to add one item to the end of a list in prolog, but it keeps on failing. I do not understand why this below does not work. I am also attempting to store this list in the variable Sto...	[ 0.0194091796875, 0.00701904296875, 0.00823974609375, 0.0162353515625, -0.01409912109375, 0.0291748046875, -0.0245361328125, 0.00396728515625, -0.003662109375, -0.033447265625, 0.031982421875, -0.0216064453125, -0.0052490234375, -0.01312255859375, 0.0038604736328125, 0.01080322265625, ...	[ 11249, 15190, 47, 3564, 111, 5303, 502, 4867, 23, 14934, 71, 31577, 1632, 35735, 13695, 35782, 214, 35064, 959, 4488, 4343, 77336, 87420 ]	[ 0.04681396484375, 0.1751708984375, 0.1588134765625, 0.1947021484375, 0.18212890625, 0.181396484375, 0.154541015625, 0.2188720703125, 0.01702880859375, 0.1319580078125, 0.07135009765625, 0.006256103515625, 0.046417236328125, 0.136474609375, 0.032562255859375, 0.1168212890625, 0.019821...	embed
74128859_c0	74128859	prolog	0	Title: Prolog write the is_progression predicate to check that the sequence of elements of a numerical list is a geometric progression Problem title: Prolog write the is_progression predicate to check that the sequence of elements of a numerical list is a geometric progression Tags: prolog Problem: Prolog write the is_...	Prolog write the is_progression predicate to check that the sequence of elements of a numerical list is a geometric progression Prolog write the is_progression predicate to check that the sequence of elements of a numerical list is a geometric progression prolog Prolog is_progression Prolog write the is_progression pre...	[ -0.00177001953125, 0.01190185546875, -0.0089111328125, 0.013916015625, -0.01513671875, 0.02685546875, -0.0074462890625, 0.00518798828125, 0.005706787109375, 0.00848388671875, 0.00482177734375, 0.01080322265625, -0.01141357421875, -0.002777099609375, -0.02587890625, 0.008544921875, 0....	[ 1250, 4867, 33022, 83, 454, 3454, 148448, 1653, 2063, 67, 12765, 450, 40, 944, 3956, 80854, 54744, 6827, 5303, 10, 84183, 238, 187735, 70, 502 ]	[ 0.1507568359375, 0.2421875, 0.0838623046875, 0.19091796875, 0.053253173828125, 0.1546630859375, 0.2763671875, 0.1859130859375, 0.193603515625, 0.10418701171875, 0.177978515625, 0.03656005859375, 0.0531005859375, 0.138671875, 0.00897216796875, 0.1544189453125, 0.1219482421875, 0.033...	embed
46129129_c0	46129129	prolog	0	Title: What are the conditions of the query in order to be True? Problem title: What are the conditions of the query in order to be True? Tags: prolog Problem: What are the conditions of the query in order to be True? I'm new to Prolog and trying to figure out how it works. So could anyone help me with the following co...	What are the conditions of the query in order to be True? What are the conditions of the query in order to be True? prolog What What are the conditions of the query in order to be True? I'm new to Prolog and trying to figure out how it works. So could anyone help me with the following code: So when would Prolog return ...	[ 0.01251220703125, 0.0152587890625, -0.015625, 0.00506591796875, -0.00897216796875, 0.0118408203125, 0.0101318359375, 0.01251220703125, -0.00058746337890625, -0.0000896453857421875, 0.01263427734375, -0.0196533203125, -0.0213623046875, 0.01318359375, -0.0257568359375, 0.025390625, 0.0...	[ 4865, 621, 70, 27289, 111, 41, 1294, 23, 12989, 47, 186, 87599, 502, 4867, 3525, 1250, 26366, 43240, 4358, 18151, 3229, 2806, 30646, 618, 882, 13, 2174, 25632, 9384, 705, 9, 2367, 164, 100231, 132, 1542, 28007, 12921, 107730, 4734, 1193...	[ 0.10601806640625, 0.06768798828125, 0.07550048828125, 0.263427734375, 0.1112060546875, 0.2047119140625, 0.2064208984375, 0.010589599609375, 0.175537109375, 0.0911865234375, 0.1202392578125, 0.26123046875, 0.15185546875, 0.2763671875, 0.004608154296875, 0.1915283203125, 0.000732421875...	embed
47453963_c0	47453963	prolog	0	Title: Prolog, about how to form better clauses Problem title: Prolog, about how to form better clauses Tags: prolog, prolog-dif, prolog-cut, logical-purity Problem: Prolog, about how to form better clauses I have following clauses: num_parent(adam, X) :- !, X = 0. num_parent(eve, X) :- !, X = 0. num_parent(X, 2). When...	Prolog, about how to form better clauses Prolog, about how to form better clauses prolog prolog-dif prolog-cut logical-purity Prolog num_parent Prolog, about how to form better clauses I have following clauses: When I typed the query: It only returns: which is what I want. But when I typed this query: it only returns: ...	[ -0.000453948974609375, 0.033203125, 0.0128173828125, 0.0059814453125, -0.0174560546875, 0.0167236328125, -0.004486083984375, -0.0002307891845703125, 0.0225830078125, -0.032470703125, 0.005828857421875, -0.01251220703125, 0.004486083984375, 0.009765625, 0.01953125, 0.0059814453125, 0....	[ 1250, 4867, 3173, 11522, 70731, 502, 428, 420, 19774, 62775, 289, 4717, 2481, 13269, 99547, 90, 25632, 10644, 41, 1294, 4734, 30646, 3129, 2367, 87, 3444, 903, 7, 3642, 2811, 40383, 3249 ]	[ 0.1263427734375, 0.2137451171875, 0.137939453125, 0.1326904296875, 0.2017822265625, 0.123291015625, 0.043243408203125, 0.091064453125, 0.12646484375, 0.103759765625, 0.013671875, 0.1083984375, 0.0064697265625, 0.1051025390625, 0.15283203125, 0.10479736328125, 0.032257080078125, 0.1...	embed
7655998_c1	7655998	prolog	1	x + 3*Bg^width/7, Tri^y3 #= Bg^y + Bg^height/2, cgStar(Star), Star^n #=5, Star^color #= white, Star^centerX #= Bg^x + Bg^width/7, Star^centerY #= Bg^centerY, Star^diameter #= Bg^height/4, Os=[Bg,W1,W2,Tri,Star,Frame]. Whenever i try to run, i get this error? Type 'help' for usage. \| ?- cl('cuba.pl'). Compiling::cuba.pl...	x + 3*Bg^width/7, Tri^y3 #= Bg^y + Bg^height/2, cgStar(Star), Star^n #=5, Star^color #= white, Star^centerX #= Bg^x + Bg^width/7, Star^centerY #= Bg^centerY, Star^diameter #= Bg^height/4, Os=[Bg,W1,W2,Tri,Star,Frame]. Whenever i try to run, i get this error? Type 'help' for usage. \| ?- cl('cuba.pl'). Compiling::cuba.pl...	[ 0.0291748046875, 0.0101318359375, -0.0030517578125, 0.01446533203125, -0.0135498046875, 0.01190185546875, 0.007354736328125, -0.00860595703125, 0.0194091796875, -0.02734375, -0.01318359375, -0.000835418701171875, -0.0020904541015625, -0.0186767578125, 0.004730224609375, 0.0022277832031...	[ 1022, 997, 138, 1639, 146984, 32359, 4699, 8353, 53, 363, 1369, 1106, 22553, 12477, 177, 44072, 4612, 114997, 46133, 35011, 30090, 1542, 425, 4, 1723, 29089, 17357, 2027, 74257, 108386, 14847, 30441, 17, 9790, 11675, 2046, 903, 18499, 60457...	[ 0.08984375, 0.2193603515625, 0.171875, 0.074462890625, 0.17041015625, 0.07916259765625, 0.158935546875, 0.026824951171875, 0.07330322265625, 0.12255859375, 0.008544921875, 0.01416015625, 0.0546875, 0.0236358642578125, 0.0706787109375, 0.1968994140625, 0.128173828125, 0.079772949218...	embed
70818218_c0	70818218	prolog	0	Title: List_subset_of_list predicate with choice points? Problem title: List_subset_of_list predicate with choice points? Tags: prolog Problem: List_subset_of_list predicate with choice points? So here's my subset predicate: subset([],[_\|_]). subset([X\|Ts],L) :- member(X,L), subset(Ts,L). Here's the problem I get: ?- s...	List_subset_of_list predicate with choice points? List_subset_of_list predicate with choice points? prolog List_subset_of_list List_subset_of_list predicate with choice points? So here's my subset predicate: Here's the problem I get: Why did prolog keep looking for a solution when it'd already found one? I tried adding...	[ 0.0042724609375, 0.01434326171875, 0.0289306640625, -0.00021648406982421875, -0.0260009765625, -0.00445556640625, -0.001678466796875, 0.01202392578125, 0.0198974609375, -0.0003299713134765625, -0.00787353515625, 0.004608154296875, 0.00186920166015625, 0.00045013427734375, -0.002151489257...	[ 32036, 22144, 3509, 4390, 6562, 1653, 2063, 67, 678, 44126, 26847, 502, 4867, 3688, 759, 1614, 2967, 44084, 13695, 16487, 100, 10, 29806, 3229, 71, 21771, 14037, 1632, 37842, 154107, 59226, 12912, 5117, 70731, 13, 4527, 9384, 18499, 108975 ...	[ 0.1798095703125, 0.196044921875, 0.2276611328125, 0.159423828125, 0.1854248046875, 0.1627197265625, 0.1993408203125, 0.0633544921875, 0.091064453125, 0.1759033203125, 0.1871337890625, 0.140380859375, 0.1954345703125, 0.0008544921875, 0.00128173828125, 0.1849365234375, 0.0885009765625...	embed
47079149_c1	47079149	prolog	1	return a new Matrix with the newValue on the Cell of the Row. Example: I want to set my row nº1 and cell nº 4 to the value: [1,2,3]. So the output matrix will be: [ [[-1], [-1], [-1], [1,2,3], [-1], [-1], [-1]], [[-1], [0], [1], [0], [2], [-1]], [[3], [4], [3], [1], [1], [2], [3]], [[1], [5], [4], [2], [4], [3]], [[2]...	return a new Matrix with the newValue on the Cell of the Row. Example: I want to set my row nº1 and cell nº 4 to the value: [1,2,3]. So the output matrix will be: [ [[-1], [-1], [-1], [1,2,3], [-1], [-1], [-1]], [[-1], [0], [1], [0], [2], [-1]], [[3], [4], [3], [1], [1], [2], [3]], [[1], [5], [4], [2], [4], [3]], [[2]...	[ -0.025390625, 0.0034332275390625, 0.01312255859375, 0.03173828125, 0.0031585693359375, -0.010498046875, -0.023681640625, 0.0155029296875, 0.0027618408203125, 0.038330078125, -0.018798828125, -0.0023345947265625, 0.00054931640625, 0.0115966796875, -0.0203857421875, -0.0164794921875, 0...	[ 30646, 3525, 194234, 678, 856, 50770, 98, 80743, 111, 96190, 89536, 8705, 3444, 5423, 759, 15555, 110, 418, 136, 38750, 201, 47, 34292, 155761, 140992, 50944, 425, 9, 76172, 4, 5759, 59535, 83914, 147352, 2389, 55300, 91995, 7, 5303, 2886...	[ 0.2210693359375, 0.197509765625, 0.30859375, 0.054351806640625, 0.1715087890625, 0.2188720703125, 0.0098876953125, 0.177490234375, 0.050994873046875, 0.189697265625, 0.0843505859375, 0.0195465087890625, 0.11181640625, 0.1754150390625, 0.000396728515625, 0.206298828125, 0.09619140625,...	embed
47618576_c1	47618576	prolog	1	:- parts of the getConspirators predicate. They look almost the same! Now, I do know that the " _ " symbol means "literally any value" (AKA Prolog doesn't care about what value it is). But how does Prolog know which case to pick when running through the code? My theory is that Prolog runs the getConspirators( [_\|T], C...	:- parts of the getConspirators predicate. They look almost the same! Now, I do know that the " _ " symbol means "literally any value" (AKA Prolog doesn't care about what value it is). But how does Prolog know which case to pick when running through the code? My theory is that Prolog runs the getConspirators( [_\|T], C...	[ 0.0031280517578125, -0.0033111572265625, -0.010498046875, 0.005767822265625, -0.0228271484375, -0.00982666015625, 0.0177001953125, -0.0123291015625, 0.0133056640625, -0.017822265625, 0.0101318359375, 0.01422119140625, -0.01458740234375, 0.0098876953125, 0.00494384765625, -0.00885009765...	[ 15772, 63920, 2046, 11935, 54547, 22230, 1653, 2063, 67, 6713, 39555, 5701, 101, 26582, 26950, 39798, 2499, 34292, 1250, 4867, 18, 517, 3714, 7225, 39580, 51042, 8305, 18151, 154453, 127877, 454, 58745, 618, 313, 9624, 136, 2174, 35782, 653...	[ 0.0760498046875, 0.03546142578125, 0.135986328125, 0.090087890625, 0.26806640625, 0.1658935546875, 0.09161376953125, 0.1165771484375, 0.00689697265625, 0.0897216796875, 0.029052734375, 0.05517578125, 0.1534423828125, 0.1959228515625, 0.06768798828125, 0.051300048828125, 0.08740234375...	embed
49677559_c0	49677559	prolog	0	Title: why does bubblesort([8,7,6,5,4,3,2,1],L). return unsorted list? Problem title: why does bubblesort([8,7,6,5,4,3,2,1],L). return unsorted list? Tags: prolog Problem: why does bubblesort([8,7,6,5,4,3,2,1],L). return unsorted list? bubblesort(inputList, SortList) :- swap(inputList, List), !, printlist(List), bubble...	why does bubblesort([8,7,6,5,4,3,2,1],L). return unsorted list? why does bubblesort([8,7,6,5,4,3,2,1],L). return unsorted list? prolog SortList List List1 Head why does bubblesort([8,7,6,5,4,3,2,1],L). return unsorted list?	[ 0.0135498046875, 0.027587890625, 0.01300048828125, -0.00543212890625, -0.03564453125, -0.010986328125, -0.01190185546875, -0.0084228515625, -0.0172119140625, 0.021484375, 0.0233154296875, 0.0191650390625, -0.009033203125, -0.00592041015625, -0.00543212890625, 0.00102996826171875, 0.0...	[ 15400, 14602, 373, 73163, 62351, 186922, 129678, 617, 363, 304, 76172, 866, 30646, 51, 297, 5303, 502, 4867, 53666, 154663, 32036, 418, 44816, 1065, 194 ]	[ 0.10552978515625, 0.040618896484375, 0.109130859375, 0.2115478515625, 0.2568359375, 0.258544921875, 0.243896484375, 0.1453857421875, 0.137939453125, 0.041748046875, 0.0054931640625, 0.0966796875, 0.1358642578125, 0.103271484375, 0.058349609375, 0.157958984375, 0.07037353515625, 0.1...	embed
22348899_c0	22348899	prolog	0	Title: Using append in Prolog Problem title: Using append in Prolog Tags: append, prolog Problem: Using append in Prolog I am very new to Prolog and I am experimenting using 'append'. I am trying to write a very simple program that takes the first item of a list, and add's it to an empty list L. Would someone please ex...	Using append in Prolog Using append in Prolog append prolog Using Prolog add_first Using append in Prolog I am very new to Prolog and I am experimenting using 'append'. I am trying to write a very simple program that takes the first item of a list, and add's it to an empty list L. Would someone please explain to me why...	[ 0.01129150390625, 0.00072479248046875, 0.00714111328125, 0.01025390625, -0.006927490234375, 0.0000782012939453125, -0.006622314453125, 0.009765625, 0.022216796875, -0.056640625, 0.03076171875, -0.00118255615234375, -0.012451171875, 0.005523681640625, 0.0255126953125, -0.00982666015625,...	[ 345, 114689, 71, 1250, 4867, 502, 15190, 13448, 271, 23, 3525, 28007, 9007, 3611, 31577, 33022, 8781, 1528, 51776, 5117, 35735, 5303, 201505, 339, 73342, 15400, 23742, 18, 4488, 44084, 18151, 22027 ]	[ 0.052978515625, 0.2171630859375, 0.1973876953125, 0.1505126953125, 0.25, 0.10430908203125, 0.1429443359375, 0.10400390625, 0.06793212890625, 0.00994873046875, 0.024078369140625, 0.1051025390625, 0.111328125, 0.1865234375, 0.05426025390625, 0.041107177734375, 0.0806884765625, 0.1235...	embed
36559441_c0	36559441	prolog	0	Title: How can I assert facts about all List members in Prolog? Problem title: How can I assert facts about all List members in Prolog? Tags: prolog Problem: How can I assert facts about all List members in Prolog? I'd like to assert facts about all members of a List in prolog, and have any resulting unification retain...	How can I assert facts about all List members in Prolog? How can I assert facts about all List members in Prolog? prolog How List Prolog _h27057686 _h27057704 _h27057722 How can I assert facts about all List members in Prolog? I'd like to assert facts about all members of a List in prolog, and have any resulting unific...	[ 0.01348876953125, -0.004547119140625, 0.004974365234375, 0.0023193359375, -0.0185546875, -0.01708984375, 0.01220703125, 0.01531982421875, 0.0126953125, 0.00311279296875, 0.0235595703125, 0.0159912109375, 0.0133056640625, 0.0152587890625, -0.0021820068359375, 0.01214599609375, 0.00720...	[ 11249, 831, 237, 33657, 15824, 7, 1672, 756, 32036, 43032, 1250, 4867, 502, 178475, 7709, 87, 23, 1884, 51, 41274, 27781, 12638, 5303, 32786, 105950, 43606, 64549, 3917, 19064, 41, 1294, 114997, 990, 567 ]	[ 0.057586669921875, 0.054901123046875, 0.0980224609375, 0.2147216796875, 0.2000732421875, 0.1181640625, 0.0863037109375, 0.107421875, 0.2137451171875, 0.212158203125, 0.17138671875, 0.25390625, 0.1322021484375, 0.006561279296875, 0.039581298828125, 0.013702392578125, 0.055511474609375...	embed
23464932_c0	23464932	prolog	0	Title: Prolog: McCarthy 91 Problem title: Prolog: McCarthy 91 Tags: prolog Problem: Prolog: McCarthy 91 I'm learning about recursion and came across the McCarthy 91 function . I've been able to find examples of it in several languages (C++, Java, Python, Scheme, and so on). I'm trying to find out how it would be writte...	Prolog: McCarthy 91 Prolog: McCarthy 91 prolog Prolog McCarthy Prolog: McCarthy 91 I'm learning about recursion and came across the McCarthy 91 function . I've been able to find examples of it in several languages (C++, Java, Python, Scheme, and so on). I'm trying to find out how it would be written in Prolog though. I...	[ 0.01708984375, -0.00469970703125, 0.00982666015625, 0.0302734375, 0.0098876953125, 0.012939453125, -0.0031280517578125, 0.01531982421875, 0.006988525390625, -0.051513671875, -0.01025390625, -0.0011138916015625, -0.031494140625, -0.0023345947265625, 0.0224609375, 0.0029449462890625, 0...	[ 1250, 4867, 12, 85283, 147, 29178, 20031, 502, 52080, 1672, 195625, 1830, 36880, 32354, 7413, 27781, 111, 442, 40368, 46876, 441, 37223, 41925, 145581, 34702, 31577, 3642, 2806, 59121, 23, 1118, 6528, 33022, 35978, 73, 18151, 31344, 4358 ]	[ 0.20361328125, 0.273193359375, 0.02978515625, 0.1365966796875, 0.1732177734375, 0.262939453125, 0.30615234375, 0.1519775390625, 0.06072998046875, 0.0023193359375, 0.279052734375, 0.175048828125, 0.06475830078125, 0.212158203125, 0.009307861328125, 0.1827392578125, 0.030120849609375, ...	embed
15011417_c0	15011417	prolog	0	Title: How to run prolog on swipl and return all the traces in one go Problem title: How to run prolog on swipl and return all the traces in one go Tags: swi-prolog, prolog Problem: How to run prolog on swipl and return all the traces in one go 1: If one query ie. a(X). returns multiple answers, how can I let the progr...	How to run prolog on swipl and return all the traces in one go How to run prolog on swipl and return all the traces in one go swi-prolog prolog How foo.pl How to run prolog on swipl and return all the traces in one go 1: If one query ie. a(X). returns multiple answers, how can I let the program return all the answers a...	[ 0.0179443359375, 0.0030364990234375, -0.007476806640625, 0.00982666015625, -0.017822265625, 0.005035400390625, -0.00176239013671875, -0.00360107421875, 0.011474609375, -0.0673828125, 0.0189208984375, -0.00010919570922851562, -0.0216064453125, 0.004058837890625, 0.0069580078125, 0.00218...	[ 11249, 11675, 502, 4867, 98, 91, 2452, 2424, 30646, 756, 144851, 23, 1632, 738, 3454, 5775, 31, 47, 136, 70, 41, 10, 1542, 48716, 35166, 3642, 1528, 1809, 2589, 28412, 72367, 11435, 375, 669 ]	[ 0.052032470703125, 0.171142578125, 0.193115234375, 0.27392578125, 0.0762939453125, 0.043212890625, 0.19384765625, 0.2254638671875, 0.1839599609375, 0.0875244140625, 0.2061767578125, 0.057464599609375, 0.07562255859375, 0.1241455078125, 0.1295166015625, 0.03704833984375, 0.03729248046...	embed
50182365_c0	50182365	prolog	0	Title: Create lists of permutations of size N from elements of another list Problem title: Create lists of permutations of size N from elements of another list Tags: list, prolog, permutation Problem: Create lists of permutations of size N from elements of another list How do I, given a List = [(1,1),(1,2),(1,3),(1,4)]...	Create lists of permutations of size N from elements of another list Create lists of permutations of size N from elements of another list list prolog permutation elements Create ListOut Create lists of permutations of size N from elements of another list How do I, given a List = [(1,1),(1,2),(1,3),(1,4)], N = 2, create...	[ 0.0123291015625, 0.0037841796875, 0.0079345703125, 0.00775146484375, -0.00390625, 0.0220947265625, -0.01263427734375, -0.004791259765625, 0.0208740234375, -0.0228271484375, 0.00244140625, -0.004791259765625, 0.017822265625, 0.00677490234375, -0.02734375, 0.0174560546875, 0.0185546875...	[ 151313, 5303, 7, 117, 14311, 21094, 13267, 541, 1295, 80854, 15700, 502, 4867, 561, 22062, 32036, 79858, 54, 87, 34475, 2203, 41600, 17727, 133063, 21320, 163324, 116, 28282, 10, 70541, 214, 48716, 12989, 297, 111, 304, 154663, 24610 ]	[ 0.1834716796875, 0.258056640625, 0.03228759765625, 0.147216796875, 0.246337890625, 0.12841796875, 0.1405029296875, 0.149658203125, 0.0843505859375, 0.1629638671875, 0.08203125, 0.123779296875, 0.1922607421875, 0.194091796875, 0.0312042236328125, 0.2335205078125, 0.255859375, 0.0446...	embed
22139198_c0	22139198	prolog	0	Title: How to sort a list without using predefined prolog functions? Problem title: How to sort a list without using predefined prolog functions? Tags: prolog Problem: How to sort a list without using predefined prolog functions? I'm new to prolog programing. I have gone through several sample answers, but couldn't fin...	How to sort a list without using predefined prolog functions? How to sort a list without using predefined prolog functions? prolog predefined How How to sort a list without using predefined prolog functions? I'm new to prolog programing. I have gone through several sample answers, but couldn't find solution to my probl...	[ 0.002685546875, 0.0147705078125, 0.0040283203125, -0.00543212890625, -0.0179443359375, 0.0024566650390625, -0.018798828125, 0.007171630859375, -0.0098876953125, -0.03173828125, 0.004364013671875, 0.0036773681640625, -0.029296875, -0.008544921875, 0.00909423828125, 0.0000805854797363281...	[ 11249, 47, 12096, 5303, 15490, 17368, 1653, 13, 5983, 502, 4867, 32354, 10, 3525, 1528, 29806, 2967, 70541, 9351, 136, 32070, 6763, 121763, 66159, 1112, 18548, 85520, 36663, 678, 118055, 12989, 3917 ]	[ 0.05596923828125, 0.0209503173828125, 0.2271728515625, 0.1983642578125, 0.13330078125, 0.059051513671875, 0.09814453125, 0.0670166015625, 0.1712646484375, 0.110595703125, 0.1993408203125, 0.1297607421875, 0.00390625, 0.011322021484375, 0.07177734375, 0.03961181640625, 0.03955078125, ...	embed
59685831_c0	59685831	prolog	0	Title: Does SLD tree exist if the query is invalid in Prolog? Problem title: Does SLD tree exist if the query is invalid in Prolog? Tags: prolog Problem: Does SLD tree exist if the query is invalid in Prolog? Considering the following Prolog program : reverse_bits([1], [0]). reverse_bits([0], [1]). reverse_bits([H\|T], ...	Does SLD tree exist if the query is invalid in Prolog? Does SLD tree exist if the query is invalid in Prolog? prolog Does SLD Prolog reverse_bits Input Does SLD tree exist if the query is invalid in Prolog? Considering the following Prolog program : What's the SLD tree for the question above ? It's not valid so does it...	[ 0.0177001953125, 0.043701171875, -0.005126953125, 0.0211181640625, -0.0164794921875, 0.0201416015625, -0.0162353515625, -0.0067138671875, -0.017822265625, -0.0089111328125, 0.004974365234375, 0.004302978515625, 0.000858306884765625, -0.0084228515625, 0.0189208984375, -0.002105712890625...	[ 101790, 159, 30693, 53201, 32316, 2174, 41, 1294, 83, 56649, 1250, 4867, 502, 39531, 184, 3137, 360, 7077, 23, 1528, 959, 35604 ]	[ 0.0231781005859375, 0.091064453125, 0.2413330078125, 0.246826171875, 0.1712646484375, 0.057708740234375, 0.09521484375, 0.091796875, 0.038848876953125, 0.221435546875, 0.135009765625, 0.2127685546875, 0.0721435546875, 0.156494140625, 0.08453369140625, 0.118896484375, 0.03988647460937...	embed
65586928_c0	65586928	prolog	0	Title: Arithmetic puzzle prolog Problem title: Arithmetic puzzle prolog Tags: prolog Problem: Arithmetic puzzle prolog I have to put + and - between the numbers in that list to get the provided number. For example something like 12-34 = -22. I have done it like this: arit(L, Ls, S) :- arit(L, Ls, S, 0). arit([], [], R,...	Arithmetic puzzle prolog Arithmetic puzzle prolog prolog Arithmetic Arithmetic puzzle prolog I have to put + and - between the numbers in that list to get the provided number. For example something like 12-34 = -22. I have done it like this: It works, but it has duplicates in answer (like 1+2+3 and +1+2+3). Maybe someo...	[ -0.00225830078125, 0.000675201416015625, -0.01507568359375, -0.00189971923828125, -0.0194091796875, 0.0128173828125, -0.01385498046875, 0.00830078125, -0.00750732421875, -0.0255126953125, -0.001617431640625, 0.0152587890625, 0.0189208984375, 0.0233154296875, -0.000911712646484375, 0.00...	[ 1172, 8962, 282, 9523, 104192, 502, 4867, 87, 765, 47, 3884, 997, 136, 20, 17721, 101935, 450, 5303, 2046, 62952, 14012, 27781, 427, 112208, 2203, 31043, 1884, 43240, 1284, 1556, 171763, 1636, 35166, 5062, 106, 54651, 85398, 57157, 83425, ...	[ 0.0305328369140625, 0.119384765625, 0.02630615234375, 0.080810546875, 0.2130126953125, 0.1895751953125, 0.2176513671875, 0.0167388916015625, 0.0677490234375, 0.017730712890625, 0.088623046875, 0.166259765625, 0.1346435546875, 0.1500244140625, 0.15380859375, 0.156005859375, 0.01835632...	embed
7347682_c0	7347682	prolog	0	Title: swi prolog , matching data Problem title: swi prolog , matching data Tags: prolog Problem: swi prolog , matching data this is my source code , can someone tell me what is error , and wat is the best way to do this , i want to show out who matching who ...can somebody help me ? % Author: % Date: 08-Sep-11 person(...	swi prolog , matching data swi prolog , matching data prolog Author Date Sep-11 match:-person Fage Fatt Mage Matt ERROR Undefined However swi prolog , matching data this is my source code , can someone tell me what is error , and wat is the best way to do this , i want to show out who matching who ...can somebody help ...	[ 0.0159912109375, 0.0235595703125, 0.0228271484375, 0.00494384765625, -0.006378173828125, -0.006561279296875, -0.00555419921875, 0.0228271484375, 0.0032958984375, -0.0177001953125, 0.0059814453125, -0.01318359375, 0.0038299560546875, -0.0067138671875, 0.020263671875, -0.0234375, 0.017...	[ 91, 2452, 502, 4867, 4, 14858, 214, 2053, 61804, 21693, 16675, 30816, 71470, 13, 24967, 18, 5695, 39162, 151206, 24638, 79912, 5983, 903, 31344, 18151, 831, 14192, 2367, 83, 18499, 793, 2965, 3917, 54, 3444, 47, 7639, 1810, 2750, 176256, ...	[ 0.08935546875, 0.25634765625, 0.19677734375, 0.245361328125, 0.0244293212890625, 0.2607421875, 0.186767578125, 0.19921875, 0.05364990234375, 0.00604248046875, 0.008544921875, 0.1494140625, 0.162109375, 0.1474609375, 0.2255859375, 0.107666015625, 0.1185302734375, 0.210205078125, 0...	embed
15031203_c1	15031203	prolog	1	1,Q2)) :- p(XY, Q1), p(XY, Q2). pp((X, Y), opposite, (Q1, Q2)) :- p((X, Y), Q1), p((Y, X), Q2). pareto(PP->R) :- \+ (pp(XY, agree, PP), \+ p(XY, R)). dictator(J, F) :- member(J:PP, [1:(P, _), 2:(_, P)]), \+ (member(PP->R, F), pp(_, opposite, (P, R))). agree(+, XY, QQ) :- pp(XY, agree, QQ). agree(-,(X,Y), QQ) :- pp((Y, ...	1,Q2)) :- p(XY, Q1), p(XY, Q2). pp((X, Y), opposite, (Q1, Q2)) :- p((X, Y), Q1), p((Y, X), Q2). pareto(PP->R) :- \+ (pp(XY, agree, PP), \+ p(XY, R)). dictator(J, F) :- member(J:PP, [1:(P, _), 2:(_, P)]), \+ (member(PP->R, F), pp(_, opposite, (P, R))). agree(+, XY, QQ) :- pp(XY, agree, QQ). agree(-,(X,Y), QQ) :- pp((Y, ...	[ -0.01287841796875, -0.01263427734375, 0.0034332275390625, -0.0101318359375, -0.015869140625, -0.01483154296875, 0.0283203125, 0.0064697265625, 0.00592041015625, 0.00701904296875, -0.017822265625, 0.01458740234375, -0.004486083984375, -0.00139617919921875, 0.00347900390625, -0.007720947...	[ 106, 4, 2737, 10461, 16, 15772, 915, 143907, 2396, 17727, 32261, 132, 1542, 990, 198274, 418, 1723, 1193, 4787, 188, 17487, 103607, 1052, 1328, 6366, 53520, 12211, 627, 28214, 1290, 1375, 563, 32786, 12, 15573, 436, 39, 27417, 683, 66286,...	[ 0.058441162109375, 0.0379638671875, 0.14453125, 0.2103271484375, 0.0045166015625, 0.09649658203125, 0.1270751953125, 0.1759033203125, 0.131591796875, 0.08148193359375, 0.2083740234375, 0.0306396484375, 0.1136474609375, 0.1527099609375, 0.21875, 0.08599853515625, 0.21337890625, 0.17...	embed
59379917_c1	59379917	prolog	1	program files (x86)/XSB/syslib/standard.xwam ... standard:catch/3 From c:/program files (x86)/XSB/syslib/standard.xwam AFAIK this error is usually when theres a prblem with a user defined predicate but this is a standard function and the documentation says it auto-imports so why am I getting this error? Code signals: E...	program files (x86)/XSB/syslib/standard.xwam ... standard:catch/3 From c:/program files (x86)/XSB/syslib/standard.xwam AFAIK this error is usually when theres a prblem with a user defined predicate but this is a standard function and the documentation says it auto-imports so why am I getting this error? Code signals: E...	[ 0.035888671875, 0.03076171875, -0.00286865234375, 0.0025634765625, -0.0247802734375, 0.031982421875, 0.0186767578125, 0.0106201171875, 0.0004425048828125, -0.059326171875, -0.013671875, 0.00011777877807617188, -0.0089111328125, -0.029052734375, 0.0181884765625, -0.0037994384765625, -...	[ 1528, 102158, 112916, 1542, 36474, 94924, 5612, 66589, 425, 634, 39, 5570, 4460, 206, 18113, 28090, 12, 18749, 18499, 56104, 2661, 38937, 61924, 1653, 2063, 32354, 209806, 1809, 60270, 15400, 903, 28864, 26073, 151206, 24638, 1193, 6032, 1226...	[ 0.14111328125, 0.1556396484375, 0.22119140625, 0.0751953125, 0.232421875, 0.0997314453125, 0.240478515625, 0.2322998046875, 0.050933837890625, 0.1827392578125, 0.1651611328125, 0.2213134765625, 0.1724853515625, 0.162841796875, 0.227783203125, 0.011962890625, 0.021087646484375, 0.14...	embed
44995631_c0	44995631	prolog	0	Title: prolog logic and cut Problem title: prolog logic and cut Tags: prolog-cut, prolog Problem: prolog logic and cut I have a some problem understaing the flow of prolog. here is the code: h(X):- 1 is X mod 2, write(X), nl, 0 is X mod 3, !, fail. h(_). t(_,[],0). t(M,[_\|LS],1):-member(M,LS),write('member'), nl,fail. ...	prolog logic and cut prolog logic and cut prolog-cut prolog prolog logic and cut I have a some problem understaing the flow of prolog. here is the code: now I am runing 3 things: 1. r([3,7,9],R). 2. r([5,11,13],R). 3. r([2,3,5],R). and I cant understand the answers I get. the answers are: 1. 3 false. 2. 5 11 false. 3. ...	[ 0.0157470703125, 0.0179443359375, 0.0159912109375, -0.00121307373046875, 0.000354766845703125, 0.00128936767578125, -0.005645751953125, 0.01043701171875, 0.01202392578125, -0.01470947265625, 0.000514984130859375, -0.0031585693359375, 0.01116943359375, -0.0050048828125, 0.0220947265625, ...	[ 502, 4867, 62775, 136, 59226, 19774, 87, 765, 2967, 1379, 590, 70, 86608, 111, 3688, 18151, 5036, 3114, 592, 138, 8966, 12, 615, 1690, 132, 363, 166590, 1052, 194, 787, 758, 1662, 2681, 1031, 304, 92714, 45767, 28219, 35166, 2046, 98320...	[ 0.17724609375, 0.244384765625, 0.23046875, 0.056396484375, 0.1915283203125, 0.1759033203125, 0.02545166015625, 0.030059814453125, 0.107666015625, 0.06890869140625, 0.103759765625, 0.012298583984375, 0.2286376953125, 0.0426025390625, 0.0159454345703125, 0.1802978515625, 0.032592773437...	embed
25972392_c0	25972392	prolog	0	Title: Calculating whether number is prime in Prolog Problem title: Calculating whether number is prime in Prolog Tags: primality-test, prolog, primes Problem: Calculating whether number is prime in Prolog I am trying to calculate if the input is a prime number but something goes wrong... here's my code: primeNumber(X)...	Calculating whether number is prime in Prolog Calculating whether number is prime in Prolog primality-test prolog primes Calculating Prolog prime_prime Next Calculating whether number is prime in Prolog I am trying to calculate if the input is a prime number but something goes wrong... here's my code: It gives me false...	[ -0.01177978515625, 0.005615234375, 0.0228271484375, 0.0177001953125, 0.00531005859375, 0.001129150390625, 0.0087890625, -0.019287109375, 0.0031280517578125, -0.005096435546875, -0.003875732421875, -0.00421142578125, -0.01397705078125, 0.00408935546875, 0.006500244140625, 0.002151489257...	[ 212467, 26518, 36766, 14012, 83, 20809, 23, 1250, 4867, 29810, 134393, 6954, 502, 114654, 4997, 31577, 74481, 2174, 107730, 10, 44691, 18151, 163, 98320, 11907, 1733, 29786, 20594 ]	[ 0.1514892578125, 0.068603515625, 0.1318359375, 0.16845703125, 0.10498046875, 0.223876953125, 0.06658935546875, 0.1519775390625, 0.2281494140625, 0.09844970703125, 0.0634765625, 0.09716796875, 0.0977783203125, 0.175537109375, 0.03240966796875, 0.03692626953125, 0.1348876953125, 0.05...	embed
38688356_c2	38688356	prolog	2	count how many Bitter fruits the person ate and so are the others. (T = sweet -> TcounterSweet is +1 ; ), (T = sweet -> TcounterCitric is +1 ; ). %. (TcounterBitter => 3 -> recomend_fruits(P, _,T, _) ; ). %supposed to when one of the counters gets 3 or more (if one person ate more the 3 bitters, sweet or citric fruits...	count how many Bitter fruits the person ate and so are the others. (T = sweet -> TcounterSweet is +1 ; ), (T = sweet -> TcounterCitric is +1 ; ). %. (TcounterBitter => 3 -> recomend_fruits(P, _,T, _) ; ). %supposed to when one of the counters gets 3 or more (if one person ate more the 3 bitters, sweet or citric fruits...	[ 0.013671875, 0.013427734375, -0.0130615234375, 0.0233154296875, -0.01177978515625, -0.006561279296875, 0.01092529296875, 0.016845703125, 0.0223388671875, 0.004638671875, -0.024658203125, -0.0115966796875, 0.0157470703125, 0.020751953125, 0.0230712890625, -0.0308837890625, 0.020629882...	[ 54529, 3642, 5941, 40787, 42, 93151, 3445, 10, 67, 27060, 618, 53673, 384, 71013, 56, 1177, 126, 83, 57157, 40658, 62233, 69130, 16882, 3055, 138, 33844, 25965, 23129, 14481, 683, 3229, 105416, 62163, 707, 1286, 1632, 114309, 1059, 247, 2...	[ 0.2293701171875, 0.06280517578125, 0.11767578125, 0.246826171875, 0.177978515625, 0.2509765625, 0.121337890625, 0.093994140625, 0.08447265625, 0.0645751953125, 0.07379150390625, 0.1807861328125, 0.046478271484375, 0.1815185546875, 0.05670166015625, 0.106689453125, 0.1158447265625, ...	embed
43723424_c0	43723424	prolog	0	Title: Prolog unpacking lists predicate Problem title: Prolog unpacking lists predicate Tags: prolog Problem: Prolog unpacking lists predicate I tried to create something what would work like this: ?- unpacking([[1], [1,2], [3]], Lst1, NewLst). NewLst=[1,3] I wrote it like this: unpacking([], Lst1, Lst1). unpacking([[H...	Prolog unpacking lists predicate Prolog unpacking lists predicate prolog Prolog Lst1 NewLst Lst2 Prolog unpacking lists predicate I tried to create something what would work like this: I wrote it like this: and I know that I am doing something wrong. I am starting in Prolog so, need to learn from my mistakes :)	[ -0.0031890869140625, 0.0106201171875, 0.000014781951904296875, 0.000060558319091796875, -0.008544921875, 0.027587890625, -0.0037078857421875, 0.00836181640625, 0.00689697265625, -0.0213623046875, 0.0087890625, -0.01507568359375, 0.0042724609375, 0.0087890625, -0.01483154296875, 0.01989...	[ 1250, 4867, 51, 29102, 214, 5303, 1653, 2063, 67, 502, 339, 271, 418, 2356, 866, 304, 37842, 28282, 4488, 1884, 903, 54397, 442, 3714, 444, 20594, 9844, 44691, 72134, 3871, 30698, 121742 ]	[ 0.1966552734375, 0.275146484375, 0.1246337890625, 0.236328125, 0.05426025390625, 0.2125244140625, 0.18359375, 0.2333984375, 0.03411865234375, 0.1513671875, 0.07135009765625, 0.1229248046875, 0.0927734375, 0.10430908203125, 0.048126220703125, 0.0968017578125, 0.0849609375, 0.0856933...	embed
43849424_c0	43849424	prolog	0	Title: Create Fibonacci Sequence in Prolog with 1 Parameter Problem title: Create Fibonacci Sequence in Prolog with 1 Parameter Tags: fibonacci, prolog Problem: Create Fibonacci Sequence in Prolog with 1 Parameter I am a beginner on prolog and is trying to create fibonacci sequence rules. But it can't run because of er...	Create Fibonacci Sequence in Prolog with 1 Parameter Create Fibonacci Sequence in Prolog with 1 Parameter fibonacci prolog Create Fibonacci Sequence Prolog Parameter N-1 N-2 Create Fibonacci Sequence in Prolog with 1 Parameter I am a beginner on prolog and is trying to create fibonacci sequence rules. But it can't run ...	[ 0.029296875, 0.015380859375, -0.0238037109375, 0.00762939453125, -0.001800537109375, -0.002349853515625, 0.014892578125, 0.01068115234375, 0.0035858154296875, -0.0211181640625, -0.00360107421875, -0.0240478515625, -0.014892578125, 0.0093994140625, 0.019775390625, 0.000186920166015625, ...	[ 151313, 3698, 20990, 52544, 503, 944, 3956, 23, 1250, 4867, 678, 106, 1720, 29089, 809, 502, 541, 5759, 5428, 1679, 31577, 28282, 40, 91736, 831, 18, 11675, 18499, 18151, 8962, 282, 9523, 275, 83, 959, 10, 32354, 77641, 4358 ]	[ 0.13916015625, 0.16162109375, 0.181396484375, 0.223876953125, 0.1112060546875, 0.1640625, 0.1097412109375, 0.045135498046875, 0.1641845703125, 0.25244140625, 0.0379638671875, 0.1072998046875, 0.1099853515625, 0.1290283203125, 0.18408203125, 0.1204833984375, 0.04595947265625, 0.1335...	embed
27247642_c0	27247642	prolog	0	Title: Prolog intersection of three lists Problem title: Prolog intersection of three lists Tags: interception, prolog, list Problem: Prolog intersection of three lists please can give some of you advice about interception of three lists in Prolog? I done interception of two lists: prunik([], _, []). prunik([H1\|T1], L2...	Prolog intersection of three lists Prolog intersection of three lists interception prolog list Prolog Res Prolog intersection of three lists please can give some of you advice about interception of three lists in Prolog? I done interception of two lists: And it works, when I put this question: I try remake this for thr...	[ -0.007049560546875, 0.007537841796875, 0.005889892578125, 0.007171630859375, -0.005889892578125, 0.01409912109375, -0.00390625, -0.006378173828125, 0.00156402587890625, -0.039306640625, -0.00469970703125, 0.01519775390625, -0.000762939453125, 0.01171875, 0.00823974609375, 0.02001953125...	[ 1250, 4867, 1940, 7, 58994, 17262, 5303, 63928, 502, 9624, 67660, 111, 16940, 6626, 43240, 9655, 9790, 456, 55898, 13319, 3714 ]	[ 0.1534423828125, 0.2235107421875, 0.1622314453125, 0.1361083984375, 0.0772705078125, 0.2138671875, 0.21630859375, 0.195068359375, 0.1041259765625, 0.099609375, 0.096923828125, 0.037384033203125, 0.006805419921875, 0.0750732421875, 0.0843505859375, 0.015533447265625, 0.017044067382812...	embed
40763883_c0	40763883	prolog	0	Title: How to transform a term into a list in Prolog Problem title: How to transform a term into a list in Prolog Tags: parsing, prolog Problem: How to transform a term into a list in Prolog How can i transform a term like: 3 * y * w * t^3 in a list made of: List = [3, *, y,...], without using the following predicate: ...	How to transform a term into a list in Prolog How to transform a term into a list in Prolog parsing prolog How Prolog t2l Term List t2l_ List-X L1-L4 L1-L2 L3-L4 How to transform a term into a list in Prolog How can i transform a term like: 3 * y * w * t^3 in a list made of: List = [3, *, y,...], without using the foll...	[ 0.0218505859375, 0.01226806640625, 0.00130462646484375, -0.0022430419921875, -0.0067138671875, 0.000492095947265625, -0.016357421875, 0.006378173828125, 0.0031280517578125, -0.040771484375, 0.0303955078125, 0.0216064453125, -0.005706787109375, 0.0074462890625, -0.0030059814453125, 0.02...	[ 11249, 47, 27198, 13579, 3934, 10, 5303, 23, 1250, 4867, 366, 6953, 502, 808, 304, 141, 2994, 39, 32036, 1542, 339, 20268, 866, 617, 27495, 831, 17, 1884, 138, 661, 113, 148, 8353, 363, 7228, 111, 2203, 122101, 15490, 17368, 1653, 206...	[ 0.0469970703125, 0.0213470458984375, 0.231689453125, 0.27392578125, 0.125732421875, 0.0928955078125, 0.263671875, 0.038818359375, 0.1885986328125, 0.2626953125, 0.053192138671875, 0.034942626953125, 0.1268310546875, 0.03216552734375, 0.04156494140625, 0.06182861328125, 0.186767578125...	embed
4495977_c0	4495977	prolog	0	Title: Loading files in Prolog Problem title: Loading files in Prolog Tags: prolog Problem: Loading files in Prolog I am going through a Prolog tutorial. It is telling me I can load other prolog files by typing: [filename]. but every time I try this am getting ERROR: load_files/2: Arguments are not sufficiently instant...	Loading files in Prolog Loading files in Prolog prolog Loading Prolog ERROR load_files Arguments KB5 Loading files in Prolog I am going through a Prolog tutorial. It is telling me I can load other prolog files by typing: but every time I try this am getting The file is in the same directory as the one am working in. He...	[ 0.043212890625, 0.0126953125, -0.0010223388671875, 0.01409912109375, -0.0257568359375, 0.004058837890625, 0.0111083984375, 0.0031585693359375, 0.006011962890625, -0.052734375, 0.0137939453125, -0.01904296875, -0.027587890625, -0.00543212890625, -0.00162506103515625, 0.004119873046875, ...	[ 228006, 102158, 1250, 4867, 23, 502, 151206, 24638, 72367, 29822, 112140, 30742, 758, 57143, 831, 3789, 11417, 214, 11907, 1733, 9790, 444, 20949, 11435, 83, 5701, 14364, 237, 20697, 18499, 44691 ]	[ 0.19140625, 0.138916015625, 0.1663818359375, 0.2471923828125, 0.0634765625, 0.1448974609375, 0.115478515625, 0.051849365234375, 0.1651611328125, 0.1534423828125, 0.1956787109375, 0.1083984375, 0.09588623046875, 0.0972900390625, 0.01617431640625, 0.06787109375, 0.1597900390625, 0.09...	embed
13550741_c0	13550741	prolog	0	Title: Recognizing patterns in DCG Problem title: Recognizing patterns in DCG Tags: prolog, list, dcg Problem: Recognizing patterns in DCG I am currently writing a dcg that takes a list of form [0,1]* and tells me if the number of 0 's in the list is 3 greater than the number of 1 's. I can't seem to get the third part...	Recognizing patterns in DCG Recognizing patterns in DCG prolog list dcg Recognizing DCG Count Newcnt Cnt Cnt-1 Recognizing patterns in DCG I am currently writing a dcg that takes a list of form [0,1]* and tells me if the number of 0 's in the list is 3 greater than the number of 1 's. I can't seem to get the third part...	[ 0.005462646484375, 0.0035247802734375, -0.01324462890625, 0.006317138671875, 0.015625, 0.020751953125, -0.0140380859375, -0.0052490234375, 0.027587890625, 0.00189971923828125, -0.0177001953125, -0.03955078125, 0.00592041015625, 0.01519775390625, 0.0032501220703125, -0.00250244140625, ...	[ 853, 115558, 35401, 103510, 23, 391, 56367, 7, 502, 4867, 5303, 104, 238, 177, 108210, 2356, 660, 5759, 82424, 32562, 51776, 3173, 2389, 76172, 14192, 2174, 14012, 757, 242, 138, 117396, 3501, 106, 831, 48903, 50960, 2831, 64, 107838, 448...	[ 0.051544189453125, 0.177001953125, 0.0379638671875, 0.23095703125, 0.040679931640625, 0.1331787109375, 0.2208251953125, 0.0178070068359375, 0.1119384765625, 0.187744140625, 0.1580810546875, 0.081787109375, 0.087646484375, 0.1553955078125, 0.1458740234375, 0.032257080078125, 0.1274414...	embed
65001718_c1	65001718	prolog	1	!. selectedMenu(ID, 4):- admission(ID), !. selectedMenu(ID, 5):- write("Good bye, it was fun assisting you!"), nl, % personDetails(ID, name), write(name), undo. eligibilityCriteria(ID):- write("Elgibility for BE degree....."). applicationProcess(ID):- write("Application Process"). applicationStatus(ID):- write("Applic...	!. selectedMenu(ID, 4):- admission(ID), !. selectedMenu(ID, 5):- write("Good bye, it was fun assisting you!"), nl, % personDetails(ID, name), write(name), undo. eligibilityCriteria(ID):- write("Elgibility for BE degree....."). applicationProcess(ID):- write("Application Process"). applicationStatus(ID):- write("Applic...	[ 0.00469970703125, 0.0009307861328125, 0.00860595703125, 0.04345703125, -0.0034637451171875, 0.0011444091796875, -0.0240478515625, -0.026123046875, 0.01068115234375, -0.00182342529296875, -0.005523681640625, -0.01300048828125, -0.0101318359375, 0.001708984375, 0.0191650390625, 0.0062561...	[ 711, 133291, 29638, 34, 7146, 13956, 606, 21150, 21162, 33022, 132, 144890, 390, 13, 442, 509, 7477, 30793, 214, 398, 3890, 247, 13169, 1745, 3445, 46741, 9351, 11627, 165, 28, 7883, 83259, 416, 26206, 7623, 735, 9622, 79385, 38415, 26531...	[ 0.07513427734375, 0.185302734375, 0.1768798828125, 0.1368408203125, 0.175048828125, 0.1568603515625, 0.134033203125, 0.178466796875, 0.13671875, 0.1734619140625, 0.001068115234375, 0.138671875, 0.122314453125, 0.0819091796875, 0.1016845703125, 0.139892578125, 0.212890625, 0.2353515...	embed
21336892_c0	21336892	prolog	0	Title: Heuristic Search In Prolog Problem title: Heuristic Search In Prolog Tags: prolog, heuristics Problem: Heuristic Search In Prolog I have solved Bridge and Torch puzzle in Prolog by simple depth first search. Now I am trying to solve it via a heuristic search. But I have no idea how should a heuristic be defined ...	Heuristic Search In Prolog Heuristic Search In Prolog prolog heuristics Heuristic Search Prolog Heuristic Search In Prolog I have solved Bridge and Torch puzzle in Prolog by simple depth first search. Now I am trying to solve it via a heuristic search. But I have no idea how should a heuristic be defined in Prolog. As ...	[ 0.01513671875, 0.0025787353515625, -0.0019073486328125, 0.0203857421875, -0.01116943359375, 0.0003681182861328125, -0.00145721435546875, -0.003448486328125, -0.012939453125, -0.048095703125, 0.01123046875, -0.023193359375, 0.002838134765625, 0.02490234375, 0.00811767578125, -0.00891113...	[ 1529, 474, 48242, 33086, 360, 1250, 4867, 502, 764, 62210, 41637, 86869, 59132, 136, 6653, 206, 104192, 8781, 168867, 5117, 33938, 31577, 1829, 6528, 3642, 5608, 10, 61924, 23, 80234, 27781, 159, 38969, 10752, 1815, 4527, 157318, 5122, 4764...	[ 0.109619140625, 0.2418212890625, 0.25341796875, 0.2362060546875, 0.06341552734375, 0.167724609375, 0.2410888671875, 0.1097412109375, 0.1270751953125, 0.24658203125, 0.1868896484375, 0.1270751953125, 0.170166015625, 0.1126708984375, 0.1343994140625, 0.0740966796875, 0.1826171875, 0....	embed
23712656_c0	23712656	prolog	0	Title: Instantiating L to a list of digits Prolog Problem title: Instantiating L to a list of digits Prolog Tags: prolog, clpfd Problem: Instantiating L to a list of digits Prolog If I have the following database: digit(0). digit(1). digit(2). digit(3). digit(4). digit(5). digit(6). digit(7). digit(8). digit(9). I want...	Instantiating L to a list of digits Prolog Instantiating L to a list of digits Prolog prolog clpfd Instantiating Prolog Instantiating L to a list of digits Prolog If I have the following database: I want the query to succeed by instantiating X and Y to 10*10 = 100 different combinations of digits, how would I go about ...	[ 0.0064697265625, 0.004547119140625, -0.00023937225341796875, 0.000804901123046875, -0.0130615234375, 0.00787353515625, -0.002655029296875, -0.0074462890625, -0.00677490234375, -0.032470703125, -0.0218505859375, -0.0238037109375, -0.0159912109375, 0.00537109375, -0.001220703125, 0.01159...	[ 166945, 14, 26518, 339, 47, 5303, 153939, 1250, 4867, 502, 39557, 71, 25632, 63399, 3444, 41, 1294, 214493, 34648, 1193, 136, 990, 209, 1639, 963, 2203, 805, 12921, 162515, 1672, 903, 3871, 4527, 94418, 77758, 158, 2816, 4288, 129745 ]	[ 0.1568603515625, 0.1470947265625, 0.1220703125, 0.19677734375, 0.140625, 0.1431884765625, 0.2059326171875, 0.1317138671875, 0.21044921875, 0.060150146484375, 0.026641845703125, 0.0760498046875, 0.051605224609375, 0.195556640625, 0.0958251953125, 0.1328125, 0.1099853515625, 0.167358...	embed
20550856_c0	20550856	prolog	0	Title: how to calculate a function in prolog? Problem title: how to calculate a function in prolog? Tags: function, max, prolog Problem: how to calculate a function in prolog? We have to find a function in prolog Q(a,b,n) with a < b and with the following way: Q(a, b, n) = max { k ∈ N \| b ^ k - a ^ k < = n} here is the...	how to calculate a function in prolog? how to calculate a function in prolog? function max prolog C-A C1-A how to calculate a function in prolog? We have to find a function in prolog Q(a,b,n) with a < b and with the following way: Q(a, b, n) = max { k ∈ N \| b ^ k - a ^ k < = n} here is the my code but it is always givi...	[ 0.007476806640625, -0.00102996826171875, 0.01324462890625, -0.001312255859375, 0.0069580078125, -0.009521484375, 0.0031280517578125, -0.01239013671875, 0.00634765625, -0.032470703125, 0.0107421875, 0.007415771484375, -0.0228271484375, -0.01409912109375, 0.015869140625, -0.034423828125,...	[ 3642, 47, 74481, 67, 32354, 23, 502, 4867, 18389, 313, 9, 284, 20268, 10, 7413, 2396, 11, 275, 19, 4426, 876, 653, 472, 245918, 541, 20, 18151, 11343, 68772, 163, 157, 155761, 56641, 140992, 5608, 787 ]	[ 0.093505859375, 0.037200927734375, 0.2275390625, 0.0999755859375, 0.2470703125, 0.12109375, 0.179931640625, 0.266845703125, 0.208984375, 0.029815673828125, 0.004730224609375, 0.078125, 0.067138671875, 0.0633544921875, 0.0843505859375, 0.16552734375, 0.004425048828125, 0.05932617187...	embed
29088697_c0	29088697	prolog	0	Title: how to define (sometimes) recursive prolog trees Problem title: how to define (sometimes) recursive prolog trees Tags: prolog, dcg Problem: how to define (sometimes) recursive prolog trees I've got two different types of sentences to parse, but i'll just give them simples names for now. Basically, I have two par...	how to define (sometimes) recursive prolog trees how to define (sometimes) recursive prolog trees prolog dcg how to define (sometimes) recursive prolog trees I've got two different types of sentences to parse, but i'll just give them simples names for now. Basically, I have two parse trees I hope that makes sense, I ju...	[ 0.0196533203125, -0.0004730224609375, -0.0162353515625, 0.0152587890625, 0.004364013671875, 0.0277099609375, -0.01104736328125, -0.0035247802734375, 0.00848388671875, -0.051513671875, -0.003204345703125, -0.0169677734375, -0.006927490234375, 0.0145263671875, 0.033935546875, 0.001480102...	[ 3642, 47, 61924, 43452, 70141, 195625, 5844, 502, 4867, 1360, 90, 238, 177, 6626, 12921, 52895, 149357, 366, 184, 30362, 10422, 6528, 1528, 23, 40956, 4358, 177261, 645, 118664 ]	[ 0.045684814453125, 0.0163421630859375, 0.1927490234375, 0.0831298828125, 0.138916015625, 0.1697998046875, 0.1329345703125, 0.119873046875, 0.1942138671875, 0.197509765625, 0.11279296875, 0.003387451171875, 0.08721923828125, 0.03778076171875, 0.0257720947265625, 0.07159423828125, 0.15...	embed
44456066_c0	44456066	prolog	0	Title: Existence error on lists Problem title: Existence error on lists Tags: prolog Problem: Existence error on lists I am using gprolog allong with gplc and I get fatal error: redefining built-in predicate member/2 when I try to compile the following code. I also get uncaught exception: error(existence_error(procedur...	Existence error on lists Existence error on lists prolog Existence existence_error Existence error on lists I am using gprolog allong with gplc and I get fatal error: redefining built-in predicate member/2 when I try to compile the following code. I also get uncaught exception: error(existence_error(procedure,member/0)...	[ 0.00555419921875, 0.00933837890625, 0.006011962890625, 0.013916015625, -0.008056640625, 0.00689697265625, 0.005767822265625, 0.02294921875, 0.00506591796875, -0.06494140625, 0.0240478515625, -0.008056640625, 0.0123291015625, -0.0009765625, 0.028564453125, -0.0145263671875, 0.02160644...	[ 122688, 329, 18499, 98, 5303, 502, 4867, 116311, 188800, 7, 17368, 706, 3454, 10617, 2424, 238, 85235, 456, 49919, 449, 88303, 73, 1653, 2063, 67, 32786, 12477, 9790, 9969, 1340, 70, 25632, 18151, 408, 46526, 131527, 232578, 39, 27417, 10...	[ 0.20947265625, 0.0068359375, 0.2186279296875, 0.0865478515625, 0.2132568359375, 0.1497802734375, 0.213134765625, 0.2193603515625, 0.24169921875, 0.04541015625, 0.01214599609375, 0.059051513671875, 0.17529296875, 0.06658935546875, 0.07861328125, 0.045806884765625, 0.1259765625, 0.06...	embed
33523013_c0	33523013	prolog	0	Title: How to build a number from a list of numbers in Prolog? Problem title: How to build a number from a list of numbers in Prolog? Tags: clpfd, prolog, list Problem: How to build a number from a list of numbers in Prolog? I'm pretty new in Prolog, and I was trying (without any success) to get a number from it's repr...	How to build a number from a list of numbers in Prolog? How to build a number from a list of numbers in Prolog? clpfd prolog list a How Prolog How to build a number from a list of numbers in Prolog? I'm pretty new in Prolog, and I was trying (without any success) to get a number from it's representation as a list of nu...	[ -0.0291748046875, 0.0191650390625, 0.0108642578125, 0.0026092529296875, 0.002899169921875, 0.01611328125, -0.03466796875, 0.029052734375, 0.0023956298828125, -0.031494140625, 0.004974365234375, -0.018310546875, 0.00201416015625, 0.032958984375, 0.01422119140625, -0.0169677734375, 0.0...	[ 11249, 47, 45367, 14012, 1295, 5303, 101935, 23, 1250, 4867, 39557, 71, 502, 10, 3525, 31577, 36272, 2046, 18811, 237, 339, 133063, 96386, 541, 48636, 145755, 195625, 5844, 234873, 24855, 8962, 282, 9523, 1657, 334, 83, 959, 32354, 4358, ...	[ 0.067626953125, 0.034027099609375, 0.204345703125, 0.2144775390625, 0.1522216796875, 0.17578125, 0.170166015625, 0.0526123046875, 0.168212890625, 0.2381591796875, 0.007568359375, 0.057830810546875, 0.1048583984375, 0.0200958251953125, 0.01251220703125, 0.040313720703125, 0.0124511718...	embed
54270827_c0	54270827	prolog	0	Title: Non linear constraints over real numbers in Prolog Problem title: Non linear constraints over real numbers in Prolog Tags: prolog, constraints Problem: Non linear constraints over real numbers in Prolog I am using clpr for constraint logic programming over real numbers in Prolog. Specifically i want to maximise ...	Non linear constraints over real numbers in Prolog Non linear constraints over real numbers in Prolog prolog constraints Non Prolog use_module Non linear constraints over real numbers in Prolog I am using clpr for constraint logic programming over real numbers in Prolog. Specifically i want to maximise nonlinear expres...	[ 0.00052642822265625, 0.000133514404296875, 0.004852294921875, 0.0126953125, 0.007080078125, 0.023193359375, 0.0020599365234375, 0.0034942626953125, 0.0098876953125, -0.05712890625, -0.0179443359375, 0.0191650390625, -0.006134033203125, -0.010986328125, 0.0162353515625, 0.00741577148437...	[ 3775, 192617, 158, 2816, 4288, 645, 2773, 101935, 1250, 4867, 502, 4527, 83279, 17368, 33139, 10287, 62775, 56037, 3444, 39771, 3075, 351, 2256, 147, 125195, 18151, 35064, 84046, 14602, 959, 4488, 133266, 661, 678, 10, 997, 43240, 67330, 35...	[ 0.1409912109375, 0.2491455078125, 0.0682373046875, 0.154052734375, 0.09130859375, 0.07684326171875, 0.1224365234375, 0.1202392578125, 0.13916015625, 0.2220458984375, 0.08087158203125, 0.05487060546875, 0.1068115234375, 0.05303955078125, 0.08123779296875, 0.226318359375, 0.10827636718...	embed
29319851_c0	29319851	prolog	0	Title: Predicate that take a list and give me the last item of this list do not work as i expect Problem title: Predicate that take a list and give me the last item of this list do not work as i expect Tags: prolog Problem: Predicate that take a list and give me the last item of this list do not work as i expect I cann...	Predicate that take a list and give me the last item of this list do not work as i expect Predicate that take a list and give me the last item of this list do not work as i expect prolog Predicate Predicate that take a list and give me the last item of this list do not work as i expect I cannot understand why this pred...	[ 0.003173828125, 0.005828857421875, 0.01470947265625, -0.00677490234375, -0.0146484375, 0.0252685546875, -0.00543212890625, 0.0113525390625, -0.006744384765625, -0.02099609375, 0.041259765625, -0.0252685546875, -0.0019683837890625, 0.0133056640625, 0, 0.01025390625, 0.015869140625, ...	[ 7145, 2063, 67, 450, 5646, 5303, 136, 8337, 163, 4568, 35735, 111, 959, 4488, 237, 41206, 10, 903, 502, 4867, 54, 53418, 28219, 15400, 1653, 17569, 46741, 1632, 12830, 11675, 41, 1294, 1542, 133063, 96386, 16750, 1193, 76067, 1284, 98320,...	[ 0.1949462890625, 0.2327880859375, 0.0987548828125, 0.0235595703125, 0.159423828125, 0.204833984375, 0.039459228515625, 0.08416748046875, 0.043701171875, 0.24609375, 0.1767578125, 0.1441650390625, 0.131103515625, 0.1488037109375, 0.08099365234375, 0.1756591796875, 0.00543212890625, ...	embed
49590129_c0	49590129	prolog	0	Title: How to find phrase in file prolog Problem title: How to find phrase in file prolog Tags: prolog, dcg, swi-prolog Problem: How to find phrase in file prolog I am trying to find phrase in a file using Prolog and if its finded just returing true. The problem is that i dont have idea how to use this phrase_from_file...	How to find phrase in file prolog How to find phrase in file prolog prolog dcg swi-prolog How Smthing phrase_from_file b.txt fs1111myphrase111asd How to find phrase in file prolog I am trying to find phrase in a file using Prolog and if its finded just returing true. The problem is that i dont have idea how to use this...	[ 0.0162353515625, -0.01422119140625, 0.00262451171875, 0.01361083984375, -0.00738525390625, 0.009521484375, 0.02197265625, -0.000659942626953125, -0.0029296875, -0.05517578125, 0.01055908203125, 0.02197265625, -0.018798828125, -0.00823974609375, 0.019287109375, 0.006744384765625, 0.00...	[ 11249, 47, 7413, 113860, 23, 11435, 502, 4867, 177, 2452, 3454, 24965, 64113, 161063, 29822, 876, 124326, 159019, 1176, 179665, 184, 97024, 31577, 1250, 6863, 9881, 71, 83648, 29568, 2967, 13319, 6528, 3642, 4527, 903, 12477, 71924, 33938, ...	[ 0.037506103515625, 0.034454345703125, 0.1734619140625, 0.3115234375, 0.0997314453125, 0.1873779296875, 0.180908203125, 0.229248046875, 0.029937744140625, 0.1153564453125, 0.1397705078125, 0.026123046875, 0.1290283203125, 0.1483154296875, 0.175537109375, 0.0753173828125, 0.16345214843...	embed
61277051_c1	61277051	prolog	1	to add 9 or 10 (depending on the example) at the end. Program: insere_ordenado_ite(El,L1,L2) :- insere_ordenado_ite(El,L1,L2,[]). insere_ordenado_ite(El,[],L2,L2). insere_ordenado_ite(El,[P\|R],L2,AC) :- El >= P, append(AC,[P],NAC), insere_ordenado_ite(El,R,L2,NAC). insere_ordenado_ite(El,[P\|R],L2,AC) :- El < P, append...	to add 9 or 10 (depending on the example) at the end. Program: insere_ordenado_ite(El,L1,L2) :- insere_ordenado_ite(El,L1,L2,[]). insere_ordenado_ite(El,[],L2,L2). insere_ordenado_ite(El,[P\|R],L2,AC) :- El >= P, append(AC,[P],NAC), insere_ordenado_ite(El,R,L2,NAC). insere_ordenado_ite(El,[P\|R],L2,AC) :- El < P, append...	[ -0.01177978515625, -0.009765625, -0.00153350830078125, -0.004302978515625, -0.003662109375, 0.04833984375, -0.0213623046875, -0.0032958984375, 0.0220947265625, -0.0191650390625, 0.035888671875, 0.0022430419921875, -0.007598876953125, 0.004302978515625, 0.0064697265625, -0.0121459960937...	[ 47, 15190, 483, 707, 209, 27781, 99, 3564, 7663, 28046, 13, 38228, 1138, 1486, 7623, 866, 418, 10461, 15772, 304, 1052, 15012, 540, 436, 114689, 184777, 71, 5351, 2967, 9844, 132283, 1295, 7279, 35431, 9077, 3642, 54, 42551, 4358, 77947, ...	[ 0.048248291015625, 0.2056884765625, 0.2254638671875, 0.073486328125, 0.2169189453125, 0.1773681640625, 0.03997802734375, 0.1900634765625, 0.178955078125, 0.1954345703125, 0.142578125, 0.1986083984375, 0.1429443359375, 0.1500244140625, 0.112548828125, 0.05902099609375, 0.0210876464843...	embed
56050573_c0	56050573	prolog	0	Title: Prolog CLPFD Transitivity Problem title: Prolog CLPFD Transitivity Tags: clpfd, prolog Problem: Prolog CLPFD Transitivity "Obvious" is not a word lightly bandied about, but why does SWI-Prolog's CLPFD correctly solve this: ?- A+1 #= A2. A = 1. but not this: ?- B #= A + 1, B #= A 2. A+1#=B, A*2#=B. ( label and...	Prolog CLPFD Transitivity Prolog CLPFD Transitivity clpfd prolog Prolog CLPFD Transitivity Arguments Prolog CLPFD Transitivity "Obvious" is not a word lightly bandied about, but why does SWI-Prolog's CLPFD correctly solve this: but not this: ( label and indomain yield Arguments are not sufficiently instantiated .) Is i...	[ -0.00152587890625, 0.0074462890625, 0.0098876953125, 0.0091552734375, 0.0091552734375, -0.01300048828125, -0.0030059814453125, -0.006195068359375, 0.00885009765625, -0.01416015625, -0.000705718994140625, 0.00188446044921875, 0.007080078125, 0.0294189453125, 0.02392578125, -0.0000605583...	[ 1250, 4867, 46323, 41265, 397, 162774, 54613, 39557, 71, 502, 112140, 46471, 10023, 223, 959, 2565, 22729, 15400, 159, 38969, 10752, 26785, 86869, 903, 1284, 67967, 136, 67018, 24931, 11180, 19388, 129980, 34648, 3115, 814, 22027, 18, 105556,...	[ 0.1361083984375, 0.233642578125, 0.0985107421875, 0.127685546875, 0.15771484375, 0.1907958984375, 0.1387939453125, 0.0531005859375, 0.06622314453125, 0.03973388671875, 0.2120361328125, 0.094482421875, 0.14404296875, 0.180419921875, 0.1171875, 0.10589599609375, 0.029571533203125, 0....	embed
8176347_c0	8176347	prolog	0	Title: Split a list in half Problem title: Split a list in half Tags: list, prolog Problem: Split a list in half I need to define divide so that List [1,2,3,4,5] divides into: a = [1,2,3} b = [4,5] I'm getting an error that says "Arguments are not sufficiently instantiated" , and I don't know enough about the language ...	Split a list in half Split a list in half list prolog Split Arguments Split a list in half I need to define divide so that List [1,2,3,4,5] divides into: I'm getting an error that says "Arguments are not sufficiently instantiated" , and I don't know enough about the language to figure out what my problem is, or if my d...	[ 0.001678466796875, 0.0252685546875, 0.0130615234375, 0.00445556640625, -0.0172119140625, 0.0274658203125, 0.00168609619140625, 0.007476806640625, 0.0233154296875, -0.00787353515625, 0.00811767578125, -0.01495361328125, 0.003692626953125, 0.017333984375, 0.00750732421875, -0.01214599609...	[ 46474, 5303, 23, 23552, 10, 502, 4867, 112140, 3871, 61924, 101637, 221, 32036, 155761, 80389, 7, 3934, 18499, 7614, 1234, 9035, 621, 959, 129980, 34648, 14, 27686, 3714, 20174, 46876, 26366, 2967, 4331, 7108, 196219, 77947, 765, 2060 ]	[ 0.2332763671875, 0.2225341796875, 0.1258544921875, 0.2330322265625, 0.0261688232421875, 0.13623046875, 0.1439208984375, 0.2467041015625, 0.058807373046875, 0.1761474609375, 0.2489013671875, 0.029998779296875, 0.200927734375, 0.162109375, 0.2213134765625, 0.07415771484375, 0.176025390...	embed
13905832_c0	13905832	prolog	0	Title: Prolog - Latin Square solution Problem title: Prolog - Latin Square solution Tags: latin-square, prolog, clpfd Problem: Prolog - Latin Square solution I am trying to write a program in Prolog to find a Latin Square of size N. I have this right now: delete(X, [X\|T], T). delete(X, [H\|T], [H\|S]) :- delete(X, T, S)....	Prolog - Latin Square solution Prolog - Latin Square solution latin-square prolog clpfd Prolog Latin Square Prolog - Latin Square solution I am trying to write a program in Prolog to find a Latin Square of size N. I have this right now:	[ 0.0078125, 0.021240234375, 0.014404296875, -0.00537109375, -0.0186767578125, -0.0054931640625, -0.00836181640625, -0.005523681640625, 0.00555419921875, -0.03515625, 0.00848388671875, -0.0018310546875, -0.00135040283203125, -0.0191650390625, -0.0162353515625, -0.0002994537353515625, -...	[ 1250, 4867, 20, 42845, 68305, 29806, 45137, 108047, 502, 33139, 39557, 71, 87, 31577, 33022, 10, 1528, 23, 7413, 111, 13267, 541, 765, 903, 7108, 5036 ]	[ 0.173828125, 0.27734375, 0.024566650390625, 0.256591796875, 0.25048828125, 0.1932373046875, 0.2208251953125, 0.2276611328125, 0.1297607421875, 0.0101318359375, 0.06768798828125, 0.09423828125, 0.01493072509765625, 0.08563232421875, 0.11090087890625, 0.03814697265625, 0.1612548828125,...	embed
18954787_c0	18954787	prolog	0	Title: Prolog predicate regarding list manipulation Problem title: Prolog predicate regarding list manipulation Tags: prolog, predicate Problem: Prolog predicate regarding list manipulation E.g: given 3 statement: car(toyota,[sedan,5_seater,head_rest]). car(nissan,[4_seater,sedan,2_door,head_rest,blue]). car(peugeot,[h...	Prolog predicate regarding list manipulation Prolog predicate regarding list manipulation prolog predicate Prolog head_rest sun_roof Prolog predicate regarding list manipulation E.g: given 3 statement: How to write a Prolog predicate items(A, X, Y) that is true if A is the list car that contain all the parts in X but d...	[ 0.00970458984375, -0.0086669921875, -0.005096435546875, 0.00909423828125, -0.0291748046875, 0.022216796875, 0.003265380859375, 0.00732421875, 0.0023956298828125, -0.00029754638671875, -0.00933837890625, 0.01202392578125, -0.01226806640625, -0.0042724609375, -0.0002956390380859375, 0.00...	[ 1250, 4867, 1653, 2063, 67, 118861, 5303, 45258, 502, 10336, 56644, 4262, 516, 4390, 34475, 138, 63805, 11249, 47, 33022, 55769, 284, 1193, 990, 29568, 2174, 62, 2258, 70541, 756, 63920, 1284, 959, 2499, 15673, 176256, 4358, 129745 ]	[ 0.17822265625, 0.254638671875, 0.1845703125, 0.213623046875, 0.113037109375, 0.0386962890625, 0.2052001953125, 0.220458984375, 0.0919189453125, 0.0927734375, 0.1539306640625, 0.07025146484375, 0.1075439453125, 0.1123046875, 0.05072021484375, 0.11083984375, 0.19091796875, 0.05310058...	embed
42489333_c0	42489333	prolog	0	Title: Understanding add_to_heap(+Heap0, +Priority, ?Key, -Heap) Problem title: Understanding add_to_heap(+Heap0, +Priority, ?Key, -Heap) Tags: heap, swi-prolog, prolog Problem: Understanding add_to_heap(+Heap0, +Priority, ?Key, -Heap) From the docs : add_to_heap(+Heap0, +Priority, ?Key, -Heap) is semidet Adds Key with...	Understanding add_to_heap(+Heap0, +Priority, ?Key, -Heap) Understanding add_to_heap(+Heap0, +Priority, ?Key, -Heap) heap swi-prolog prolog Understanding add_to_heap Heap0 Priority Key Heap Understanding add_to_heap(+Heap0, +Priority, ?Key, -Heap) From the docs : If I understand it correctly, then add_to_heap adds a key...	[ 0.003509521484375, 0.0101318359375, -0.0118408203125, -0.0174560546875, -0.0028839111328125, 0.01495361328125, -0.01019287109375, -0.010986328125, 0.009765625, 0.00103759765625, 0.030029296875, -0.005889892578125, 0.027099609375, 0.027099609375, 0.008056640625, -0.0306396484375, 0.00...	[ 9626, 144057, 15190, 188, 1106, 2631, 1328, 13025, 2389, 33163, 748, 2481, 162429, 764, 2452, 3454, 4867, 502, 1529, 168857, 26824, 54, 28219, 22799, 6863, 25343, 83, 198343, 10, 16530, 111, 17305, 6423 ]	[ 0.055206298828125, 0.03948974609375, 0.1680908203125, 0.1683349609375, 0.1715087890625, 0.2432861328125, 0.0281219482421875, 0.110107421875, 0.1226806640625, 0.0291290283203125, 0.0943603515625, 0.037261962890625, 0.1839599609375, 0.1395263671875, 0.13330078125, 0.062042236328125, 0....	embed
42595598_c0	42595598	prolog	0	Title: Why does =:= give an error when the variable is not instantiated, but == doesn't? Problem title: Why does =:= give an error when the variable is not instantiated, but == doesn't? Tags: instantiation-error, prolog Problem: Why does =:= give an error when the variable is not instantiated, but == doesn't?...	Why does =:= give an error when the variable is not instantiated, but == doesn't? Why does =:= give an error when the variable is not instantiated, but == doesn't? instantiation-error prolog Why Instantiation _409 Why does =:= give an error when the variable is not instantiated, but == doesn't? would result i...	[ 0.00250244140625, 0.0123291015625, 0.0264892578125, -0.00457763671875, 0.01068115234375, 0.007293701171875, 0.01019287109375, -0.0118408203125, 0.0208740234375, -0.01116943359375, 0.0361328125, -0.0133056640625, 0.01519775390625, 0.0184326171875, 0.0166015625, -0.0157470703125, 0.000...	[ 44084, 2203, 12, 1369, 8337, 18499, 3229, 77336, 83, 959, 34648, 14, 27686, 1284, 69112, 22027, 3768, 18, 188800, 502, 4867, 166945, 2320, 2839, 1126, 16750, 35166, 157, 2806, 123087, 15044, 68991, 51, 143034 ]	[ 0.090087890625, 0.17529296875, 0.1180419921875, 0.1761474609375, 0.08984375, 0.210205078125, 0.046966552734375, 0.2366943359375, 0.029571533203125, 0.1724853515625, 0.1253662109375, 0.1474609375, 0.06463623046875, 0.0684814453125, 0.290771484375, 0.109375, 0.092041015625, 0.1730957...	embed
47046061_c2	47046061	prolog	2	049 bytes written, 10 ms warning: /home/cg/root/3832463/main.pg:1: user directive caused exception: error(existence_error(procedure,main/0),load/1) \| ?- uncaught exception: error(syntax_error('user_input:1 (char:5) . or operator expected after Code signals: Why, Peter, Anne, Mark, Zara, Beatrice, Andrew, Sarah, Eugenie...	049 bytes written, 10 ms warning: /home/cg/root/3832463/main.pg:1: user directive caused exception: error(existence_error(procedure,main/0),load/1) \| ?- uncaught exception: error(syntax_error('user_input:1 (char:5) . or operator expected after Code signals: Why, Peter, Anne, Mark, Zara, Beatrice, Andrew, Sarah, Eugenie...	[ 0.005889892578125, 0.0322265625, -0.000640869140625, 0.0033416748046875, -0.025390625, 0.0037078857421875, 0.00750732421875, 0.0113525390625, -0.00164794921875, -0.05859375, 0.007537841796875, -0.01556396484375, -0.0037841796875, -0.0026397705078125, 0.0089111328125, -0.0208740234375, ...	[ 5742, 1126, 390, 1636, 59121, 4, 209, 68163, 1631, 592, 248, 29552, 64, 238, 177, 148920, 162982, 2357, 15748, 24931, 254, 19721, 38937, 8951, 5844, 143434, 131527, 18499, 116311, 188800, 232578, 107838, 63033, 11583, 58745, 705, 9, 51, 408...	[ 0.076904296875, 0.132568359375, 0.148681640625, 0.1053466796875, 0.1834716796875, 0.0189208984375, 0.1358642578125, 0.1695556640625, 0.1702880859375, 0.10137939453125, 0.04632568359375, 0.17236328125, 0.00701904296875, 0.023712158203125, 0.10308837890625, 0.24609375, 0.135498046875, ...	embed
16250660_c0	16250660	prolog	0	Title: Delete an element in a list at a specified index Problem title: Delete an element in a list at a specified index Tags: indexing, list, prolog, element Problem: Delete an element in a list at a specified index I need your help! Can you help me with this: delete an element in a list at a specified index in Prolog....	Delete an element in a list at a specified index Delete an element in a list at a specified index indexing list prolog element Delete List Index NewList Delete an element in a list at a specified index I need your help! Can you help me with this: delete an element in a list at a specified index in Prolog. For example: ...	[ -0.01177978515625, 0.00115203857421875, 0.002716064453125, -0.0019073486328125, -0.0244140625, 0.0164794921875, 0.0081787109375, 0.00555419921875, 0.019287109375, -0.01373291015625, 0.0299072265625, -0.02294921875, -0.0296630859375, 0.005828857421875, 0.016357421875, -0.001487731933593...	[ 262, 46485, 12830, 23, 5303, 99, 58735, 297, 63262, 142, 502, 4867, 32036, 31471, 2356, 154663, 10, 3871, 4358, 4171, 903, 154109, 1250, 27781, 2301, 18, 3714, 3642, 54, 6678, 4126 ]	[ 0.1229248046875, 0.1947021484375, 0.196533203125, 0.08837890625, 0.1923828125, 0.1588134765625, 0.1962890625, 0.023712158203125, 0.228759765625, 0.042449951171875, 0.09814453125, 0.2469482421875, 0.1522216796875, 0.20654296875, 0.1048583984375, 0.170166015625, 0.04473876953125, 0.0...	embed
35825287_c0	35825287	prolog	0	Title: Split atom and conserve separators Problem title: Split atom and conserve separators Tags: list, prolog, split Problem: Split atom and conserve separators suppose that I a have an atom which contains some keyN-separators , how I can generate a list that contains list of separate elements 1000<=N<=5000~ keys/elem...	Split atom and conserve separators Split atom and conserve separators list prolog split Split Atom elem1key1elem2key2elem3key1...elemN split_atom_list key1 key2 Res_List elem1 elem2 Split atom and conserve separators suppose that I a have an atom which contains some keyN-separators , how I can generate a list that cont...	[ -0.0033111572265625, 0.003997802734375, -0.005584716796875, -0.006103515625, -0.0208740234375, 0.004150390625, 0.0120849609375, 0.01190185546875, -0.0084228515625, -0.0002384185791015625, -0.0020599365234375, 0.005218505859375, 0.005767822265625, -0.005401611328125, 0.0157470703125, 0....	[ 46474, 34627, 136, 118684, 37451, 22230, 5303, 502, 4867, 65450, 69728, 88, 195, 19770, 27889, 839, 5928, 6562, 22799, 304, 9624, 154663, 139124, 765, 70541, 184, 6276, 3642, 831, 139392, 84797, 80854, 4382, 16093, 29213, 2306, 64, 62766, 8...	[ 0.18896484375, 0.1993408203125, 0.0745849609375, 0.1878662109375, 0.2044677734375, 0.1126708984375, 0.1893310546875, 0.089111328125, 0.144775390625, 0.1790771484375, 0.1751708984375, 0.02301025390625, 0.08184814453125, 0.0994873046875, 0.056427001953125, 0.149658203125, 0.13000488281...	embed
24851737_c0	24851737	prolog	0	Title: Is it possible to implement some semantic like this in Prolog? Problem title: Is it possible to implement some semantic like this in Prolog? Tags: prolog Problem: Is it possible to implement some semantic like this in Prolog? So basically in C , we can implement some semantic like this: int foo(int a ) { if (a =...	Is it possible to implement some semantic like this in Prolog? Is it possible to implement some semantic like this in Prolog? prolog Prolog Is it possible to implement some semantic like this in Prolog? So basically in C , we can implement some semantic like this: So I am trying to use Prolog to implement the same sema...	[ 0.007415771484375, 0.0179443359375, 0.0019989013671875, 0.0216064453125, 0.005828857421875, 0.0179443359375, 0.00054931640625, 0.005584716796875, -0.01116943359375, -0.017578125, 0.00531005859375, 0.0115966796875, -0.0269775390625, 0.0133056640625, 0.0218505859375, -0.0089111328125, ...	[ 2071, 7722, 29479, 3060, 484, 109109, 1884, 903, 23, 1250, 4867, 502, 442, 47, 313, 831, 31577, 4527, 5701, 3688, 55681, 1556, 13580, 33636, 2174, 11, 69112, 805, 30646, 757, 4358 ]	[ 0.0146636962890625, 0.186767578125, 0.20556640625, 0.0333251953125, 0.2012939453125, 0.2049560546875, 0.1368408203125, 0.13037109375, 0.1285400390625, 0.2015380859375, 0.279052734375, 0.1441650390625, 0.025146484375, 0.0175933837890625, 0.1165771484375, 0.0692138671875, 0.01734924316...	embed
15126458_c0	15126458	prolog	0	Title: Prolog - subtraction in and between trees Problem title: Prolog - subtraction in and between trees Tags: prolog Problem: Prolog - subtraction in and between trees This is a problem I encountered. How do you subtract values in a binary tree recursively? subtractTree(tree(leaf(4), tree(leaf(2), leaf(1))),S). S = 3...	Prolog - subtraction in and between trees Prolog - subtraction in and between trees prolog Prolog Prolog - subtraction in and between trees This is a problem I encountered. How do you subtract values in a binary tree recursively? For this example, it first subtracts the leaves in each tree before subtracting the values...	[ 0.0264892578125, 0.0234375, -0.01239013671875, -0.0027313232421875, -0.003570556640625, 0.0091552734375, -0.030517578125, -0.004180908203125, -0.003509521484375, -0.032470703125, -0.016845703125, -0.00176239013671875, -0.0126953125, 0.017578125, 0.0283203125, 0.004913330078125, 0.019...	[ 1250, 4867, 1614, 117474, 17721, 1360, 23, 502, 2967, 190647, 11249, 54, 398, 39989, 18, 142424, 2394, 6635, 53201, 195625, 5844, 27781, 5117, 933, 31358, 12638, 8108, 1556, 34292, 1398, 17932, 106, 58671, 33000, 115178, 35166, 1031 ]	[ 0.1256103515625, 0.2177734375, 0.149169921875, 0.162841796875, 0.1607666015625, 0.1724853515625, 0.02691650390625, 0.06890869140625, 0.087890625, 0.0280609130859375, 0.06854248046875, 0.03314208984375, 0.000946044921875, 0.1734619140625, 0.0936279296875, 0.18603515625, 0.164916992187...	embed
35764778_c0	35764778	prolog	0	Title: Switch statements in Prolog Problem title: Switch statements in Prolog Tags: pattern-matching, switch-statement, prolog Problem: Switch statements in Prolog In Prolog predicates, I often write repetitive conditional statements like this one, but I wish they could be written more concisely: output(Lang, Type, Out...	Switch statements in Prolog Switch statements in Prolog pattern-matching switch-statement prolog Switch Prolog Lang Type Output Switch statements in Prolog In Prolog predicates, I often write repetitive conditional statements like this one, but I wish they could be written more concisely: Would it be possible to replac...	[ 0, -0.0031280517578125, 0.004150390625, 0.000461578369140625, -0.0289306640625, -0.0211181640625, -0.0235595703125, 0.02294921875, -0.00518798828125, -0.00238037109375, 0.0179443359375, 0.00909423828125, -0.0164794921875, -0.023681640625, 0.0250244140625, 0.02392578125, 0.00512695312...	[ 106101, 63805, 1250, 4867, 23, 103510, 98753, 101089, 61340, 502, 15786, 60457, 13538, 1653, 2063, 1636, 27983, 33022, 57346, 4935, 35431, 289, 1884, 903, 1632, 32599, 5809, 59121, 1286, 158, 10794, 7722, 91995, 36549, 318, 184, 9, 674 ]	[ 0.2314453125, 0.2294921875, 0.1334228515625, 0.22998046875, 0.010986328125, 0.145751953125, 0.1334228515625, 0.2239990234375, 0.19775390625, 0.070556640625, 0.1153564453125, 0.1375732421875, 0.0987548828125, 0.1038818359375, 0.153076171875, 0.0294647216796875, 0.088134765625, 0.061...	embed
20514022_c0	20514022	prolog	0	Title: Prolog: between/3 with a list at the end Problem title: Prolog: between/3 with a list at the end Tags: between, list, prolog Problem: Prolog: between/3 with a list at the end my question comes up because of this question Can you write between/3 in pure prolog? would it be possible to make between/3 and the third...	Prolog: between/3 with a list at the end Prolog: between/3 with a list at the end between list prolog Prolog Prolog: between/3 with a list at the end my question comes up because of this question Can you write between/3 in pure prolog? would it be possible to make between/3 and the third argument is a list so if you as...	[ 0.0034332275390625, 0.018798828125, 0.01708984375, -0.00439453125, -0.01531982421875, 0.040283203125, -0.00927734375, -0.0034942626953125, -0.002471923828125, -0.013916015625, 0.00897216796875, -0.022705078125, 0.00408935546875, 0.007171630859375, 0.0036468505859375, 0.00897216796875, ...	[ 1250, 4867, 17721, 18113, 678, 5303, 3564, 502, 4171, 33022, 34166, 7722, 3249, 50960, 10750, 83, 26458, 32497, 4488, 51347 ]	[ 0.1116943359375, 0.188232421875, 0.2257080078125, 0.25732421875, 0.03472900390625, 0.1656494140625, 0.1287841796875, 0.1195068359375, 0.000885009765625, 0.1104736328125, 0.0911865234375, 0.07293701171875, 0.01220703125, 0.197509765625, 0.203125, 0.0089111328125, 0.0032958984375, 0....	embed
69958021_c0	69958021	prolog	0	Title: Prolog recursion - why do I need to declare an extra variable Problem title: Prolog recursion - why do I need to declare an extra variable Tags: prolog Problem: Prolog recursion - why do I need to declare an extra variable One thing I don't understand is why must we declare another variable during recursion. For...	Prolog recursion - why do I need to declare an extra variable Prolog recursion - why do I need to declare an extra variable prolog Prolog N-1 Prolog recursion - why do I need to declare an extra variable One thing I don't understand is why must we declare another variable during recursion. For example: Why can't we jus...	[ 0.003570556640625, 0.014892578125, 0.00213623046875, 0.007568359375, 0.00147247314453125, -0.009033203125, -0.0177001953125, 0.003814697265625, 0.015869140625, -0.0081787109375, 0.0086669921875, -0.0159912109375, -0.0179443359375, -0.007110595703125, 0.03662109375, -0.01220703125, 0....	[ 1250, 4867, 195625, 1830, 15400, 87, 3871, 47, 159978, 142, 4173, 77336, 502, 541, 5759, 54, 28219, 8110, 15700, 20271, 44084, 17514, 177261, 645, 118664, 18499, 60212 ]	[ 0.1365966796875, 0.23583984375, 0.1849365234375, 0.1011962890625, 0.13671875, 0.0190582275390625, 0.121337890625, 0.029632568359375, 0.1943359375, 0.040130615234375, 0.1507568359375, 0.27197265625, 0.1053466796875, 0.039031982421875, 0.1019287109375, 0.01177978515625, 0.0667724609375...	embed
27548229_c0	27548229	prolog	0	Title: Prolog Definite Clause Grammar program for IPv4 address Problem title: Prolog Definite Clause Grammar program for IPv4 address Tags: prolog, dcg Problem: Prolog Definite Clause Grammar program for IPv4 address I'm currently trying to set up a little program for accepting IPv4 dotted quad strings in SWI Prolog us...	Prolog Definite Clause Grammar program for IPv4 address Prolog Definite Clause Grammar program for IPv4 address prolog dcg Prolog Definite Clause Grammar IPv4 Prolog Definite Clause Grammar program for IPv4 address I'm currently trying to set up a little program for accepting IPv4 dotted quad strings in SWI Prolog usin...	[ 0.01263427734375, 0.01385498046875, -0.005279541015625, 0.021728515625, -0.00189971923828125, 0.010009765625, -0.0072021484375, 0.004638671875, -0.00147247314453125, -0.0164794921875, -0.0140380859375, -0.008056640625, -0.035888671875, -0.0027008056640625, 0.002471923828125, 0.00958251...	[ 1250, 4867, 88606, 67, 100700, 13, 48078, 1727, 1528, 100, 8021, 334, 617, 29823, 502, 104, 238, 177, 82424, 31577, 5423, 1257, 10176, 26946, 20633, 3674, 91526, 79315, 159, 38969, 391, 56367, 429, 47506, 20288, 20271, 65006, 72272, 831, ...	[ 0.1683349609375, 0.25048828125, 0.1751708984375, 0.1158447265625, 0.2020263671875, 0.08740234375, 0.159423828125, 0.1429443359375, 0.201171875, 0.04150390625, 0.0992431640625, 0.1080322265625, 0.2310791015625, 0.1368408203125, 0.138671875, 0.087646484375, 0.1082763671875, 0.1359863...	embed
47213585_c0	47213585	prolog	0	Title: Binomial Coefficient [Prolog] Problem title: Binomial Coefficient [Prolog] Tags: prolog, binomial-coefficients, swi-prolog-for-sharing Problem: Binomial Coefficient [Prolog] bc(0,N,R,R):- N>0,R is 1,!. bc(M,0,R,R):- M>0,R is 1,!. bc(N,N,R,R):- R is 1,!. bc(M,N,R,R1):- M1 is M - 1, N1 is N - 1, bc(M1,N1,R,R2), bc...	Binomial Coefficient [Prolog] Binomial Coefficient [Prolog] prolog binomial-coefficients swi-prolog-for-sharing Binomial Coefficient Prolog Binomial Coefficient [Prolog] Why does it return false? Task is: Write recursive procedure C(M,N) (0 ≤ m ≤ n ) to find out binomial coefficient using this formule: P.S.: I use onli...	[ -0.011962890625, 0.031982421875, 0.0150146484375, 0.0035552978515625, 0.00616455078125, 0.0150146484375, 0.005157470703125, -0.0040283203125, 0.0086669921875, -0.01287841796875, 0.00099945068359375, -0.0218505859375, -0.01531982421875, 0.00099945068359375, 0.01068115234375, 0.006286621...	[ 1843, 1687, 15403, 1311, 13, 24500, 45964, 10752, 4867, 502, 333, 587, 4240, 11044, 2452, 3454, 2420, 2852, 1250, 44084, 14602, 30646, 98320, 9598, 92, 601, 18781, 195625, 5844, 50491, 313, 132, 594, 4, 839, 22085, 6, 237637, 347, 653, ...	[ 0.1248779296875, 0.2032470703125, 0.1678466796875, 0.1590576171875, 0.096923828125, 0.1942138671875, 0.1690673828125, 0.1619873046875, 0.2257080078125, 0.109130859375, 0.1619873046875, 0.11865234375, 0.1114501953125, 0.1064453125, 0.153564453125, 0.096923828125, 0.09234619140625, 0...	embed
40632997_c0	40632997	prolog	0	Title: Define the predicate Prolog Problem title: Define the predicate Prolog Tags: clpfd, prolog Problem: Define the predicate Prolog I'm reviewing some exercise for the coming test and having difficulty at this. Given a list of integers L, define the predicate: add(L,S) which returns a list of integers S in which eac...	Define the predicate Prolog Define the predicate Prolog clpfd prolog Define Prolog Define the predicate Prolog I'm reviewing some exercise for the coming test and having difficulty at this. So my question is what define the predicate means? It looks pretty general. I've read some threads but they did not provide much. ...	[ -0.0030059814453125, 0.0247802734375, -0.0086669921875, 0.00592041015625, -0.0264892578125, 0.0201416015625, -0.00372314453125, -0.0086669921875, -0.00128936767578125, -0.019287109375, 0.0228271484375, -0.004852294921875, -0.0208740234375, 0.0162353515625, 0.0177001953125, 0.0163574218...	[ 262, 64552, 70, 1653, 2063, 67, 1250, 4867, 33139, 39557, 71, 502, 81979, 3034, 2367, 61924, 26950, 33342, 4537, 86997 ]	[ 0.0758056640625, 0.17041015625, 0.09771728515625, 0.203857421875, 0.249755859375, 0.1844482421875, 0.176025390625, 0.270263671875, 0.0213775634765625, 0.042510986328125, 0.067626953125, 0.1026611328125, 0.0180511474609375, 0.11962890625, 0.04754638671875, 0.2308349609375, 0.106018066...	embed
43820954_c0	43820954	prolog	0	Title: Find if a number is a member of an element in a list Problem title: Find if a number is a member of an element in a list Tags: prolog Problem: Find if a number is a member of an element in a list i´m trying to create a predicate that returns me the element of a list that contains a certain number given by me. Ex...	Find if a number is a member of an element in a list Find if a number is a member of an element in a list prolog Find where_is_it Num Find if a number is a member of an element in a list i´m trying to create a predicate that returns me the element of a list that contains a certain number given by me. Example: I am a re...	[ -0.0086669921875, 0.001983642578125, 0.00005602836608886719, -0.005401611328125, -0.0201416015625, 0.031494140625, 0.010498046875, 0.0027923583984375, -0.0009918212890625, -0.038818359375, -0.0025177001953125, -0.011962890625, -0.004608154296875, -0.00052642822265625, 0.01220703125, -0...	[ 26040, 2174, 14012, 83, 10, 32786, 111, 12830, 23, 5303, 502, 4867, 7440, 164, 217, 52782, 31577, 28282, 1653, 2063, 67, 30646, 163, 70541, 24233, 34475, 89536, 35845, 77848, 903, 18151 ]	[ 0.1353759765625, 0.1488037109375, 0.216796875, 0.124267578125, 0.0718994140625, 0.2415771484375, 0.126220703125, 0.199951171875, 0.0914306640625, 0.188720703125, 0.09228515625, 0.1605224609375, 0.1590576171875, 0.1246337890625, 0.175048828125, 0.2191162109375, 0.0330810546875, 0.04...	embed
37534509_c0	37534509	prolog	0	Title: Prolog - Operator in predicate Problem title: Prolog - Operator in predicate Tags: prolog, operators Problem: Prolog - Operator in predicate Is it possible to include operators (like +, >, =, !=, >= etc.) in argument for a predicate (examples below are just a demonstraition and do not have much use)? test(A > B)...	Prolog - Operator in predicate Prolog - Operator in predicate prolog operators Prolog Operator Prolog - Operator in predicate Is it possible to include operators (like +, >, =, !=, >= etc.) in argument for a predicate (examples below are just a demonstraition and do not have much use)? Seems to work, but: Does not - wh...	[ 0.0252685546875, 0.00043487548828125, 0.01080322265625, -0.00194549560546875, 0.0159912109375, 0.003143310546875, 0.01953125, 0.003570556640625, -0.00994873046875, -0.013916015625, 0.01031494140625, -0.00640869140625, -0.00051116943359375, -0.015380859375, 0.01446533203125, 0.005187988...	[ 1250, 4867, 150922, 23, 1653, 2063, 67, 20, 502, 39933, 2071, 442, 7722, 26698, 7, 5062, 997, 977, 2203, 4, 711, 10750, 100, 302, 35064, 10, 32837, 1363, 136, 959, 5045, 4527, 6872, 4488, 1284, 101790, 15400, 44084, 68018, 831, 99201, ...	[ 0.1575927734375, 0.2298583984375, 0.252685546875, 0.08892822265625, 0.1719970703125, 0.204833984375, 0.10296630859375, 0.004730224609375, 0.1114501953125, 0.274169921875, 0.0078125, 0.0310211181640625, 0.14013671875, 0.1529541015625, 0.07147216796875, 0.04681396484375, 0.17822265625,...	embed
16824039_c0	16824039	prolog	0	Title: HTML select tag in SWI-Prolog Problem title: HTML select tag in SWI-Prolog Tags: php, prolog, html Problem: HTML select tag in SWI-Prolog How can i convert this to SWI-Prolog ? i didn't find on the internet how to write the select in prolog, and can you tell me how can i make the php code work in the ? <select i...	HTML select tag in SWI-Prolog HTML select tag in SWI-Prolog php prolog html HTML SWI-Prolog data_nastere_zi HTML select tag in SWI-Prolog How can i convert this to SWI-Prolog ? i didn't find on the internet how to write the select in prolog, and can you tell me how can i make the php code work in the ?	[ 0.01165771484375, -0.009765625, 0.01361083984375, 0.0037384033203125, -0.019287109375, -0.00994873046875, -0.0142822265625, 0.0198974609375, 0.00592041015625, -0.0264892578125, 0.00482177734375, 0.004638671875, -0.01336669921875, -0.01025390625, 0.00897216796875, 0.0157470703125, 0.0...	[ 19097, 36849, 7909, 159, 38969, 10752, 4867, 23, 9, 3958, 502, 7693, 2053, 2658, 18864, 708, 831, 96760, 903, 47, 33022, 18151, 4488 ]	[ 0.248291015625, 0.251220703125, 0.1915283203125, 0.065673828125, 0.2255859375, 0.135009765625, 0.2144775390625, 0.03692626953125, 0.0234375, 0.1448974609375, 0.136474609375, 0.1815185546875, 0.0986328125, 0.07080078125, 0.184814453125, 0.15234375, 0.0218353271484375, 0.158081054687...	embed

2900505_c0

2900505

prolog

0

Title: copy file into another file in prolog Problem title: copy file into another file in prolog Tags: prolog Problem: copy file into another file in prolog Good morning/evening how can I write something in a file and then copy its content into the current file? for example I consult file1.pro then I have rule write s...

copy file into another file in prolog copy file into another file in prolog prolog copy file into another file in prolog Good morning/evening how can I write something in a file and then copy its content into the current file? for example I consult file1.pro then I have rule write something in file2.pro , after this ru...

[ 0.01470947265625, -0.006805419921875, 0.003509521484375, 0.035400390625, 0.00075531005859375, 0.003021240234375, -0.002349853515625, 0.025146484375, 0.0172119140625, -0.043701171875, 0.015869140625, 0.0072021484375, -0.0015716552734375, 0.006591796875, 0.041748046875, -0.007080078125, ...

[ 43658, 11435, 3934, 15700, 23, 502, 4867, 42141, 3134, 3642, 831, 87, 33022, 9844, 7068, 6863, 10941, 43581, 75463, 3454, 79986, 5442, 67229, 12447, 3444, 114689, 71, 18, 37842, 105237, 2053, 108975, 1884, 5983, 26582 ]

[ 0.208740234375, 0.214599609375, 0.17236328125, 0.0909423828125, 0.02978515625, 0.1412353515625, 0.2210693359375, 0.079833984375, 0.00079345703125, 0.0599365234375, 0.052764892578125, 0.0128173828125, 0.1650390625, 0.0316162109375, 0.00299072265625, 0.032257080078125, 0.1287841796875,...

embed

19592238_c0

19592238

prolog

0

Title: How to compare element of List passed as parameters? Problem title: How to compare element of List passed as parameters? Tags: prolog Problem: How to compare element of List passed as parameters? How to compare two elements of two Lists in Prolog? find should return next available route so Departure should be le...

How to compare element of List passed as parameters? How to compare element of List passed as parameters? prolog How List Departure Dep JFK BLL Arrival Arr How to compare element of List passed as parameters? How to compare two elements of two Lists in Prolog? find should return next available route so Departure should...

[ -0.000873565673828125, -0.00982666015625, 0.00579833984375, 0.00921630859375, -0.010009765625, 0.005615234375, 0.0005645751953125, -0.01495361328125, 0.021240234375, 0.0027008056640625, 0.0002899169921875, 0.006103515625, 0.005340576171875, -0.01251220703125, -0.00787353515625, -0.0278...

[ 11249, 47, 69101, 12830, 32036, 115081, 237, 171859, 7, 502, 4867, 262, 2500, 6644, 254, 821, 86371, 335, 23708, 205545, 141, 1172, 42, 6626, 80854, 1250, 7413, 30646, 11737, 19882, 36439, 40715, 105950 ]

[ 0.0714111328125, 0.037322998046875, 0.2237548828125, 0.1546630859375, 0.197509765625, 0.1722412109375, 0.0736083984375, 0.21728515625, 0.003971099853515625, 0.07861328125, 0.2119140625, 0.15283203125, 0.166015625, 0.0653076171875, 0.1654052734375, 0.027313232421875, 0.1607666015625, ...

embed

73720186_c0

73720186

prolog

0

Title: we have to create a PROLOG program to print out a square of n x n given character '*' on the screen. use SWIprolog Problem title: we have to create a PROLOG program to print out a square of n x n given character '*' on the screen. use SWIprolog Tags: prolog Problem: we have to create a PROLOG...

we have to create a PROLOG program to print out a square of n x n given character '*' on the screen. use SWIprolog we have to create a PROLOG program to print out a square of n x n given character '*' on the screen. use SWIprolog prolog PROLOG SWIprolog EXAMPLE we have to create a PROLOG program to ...

[ 0.027099609375, -0.0035858154296875, 0.017333984375, 0.0030975341796875, -0.005462646484375, 0.0078125, -0.005279541015625, 0.006439208984375, -0.005035400390625, -0.006866455078125, 0.017333984375, -0.0238037109375, -0.01519775390625, -0.018310546875, -0.0257568359375, -0.007385253906...

[ 642, 765, 47, 28282, 10514, 47510, 1528, 28412, 1810, 108047, 111, 653, 1022, 34475, 62816, 54764, 3768, 1639, 49119, 5, 4527, 159, 38969, 3454, 4867, 10, 502, 29426, 8922, 103084, 33022 ]

[ 0.034881591796875, 0.060455322265625, 0.01904296875, 0.106689453125, 0.168701171875, 0.2452392578125, 0.183837890625, 0.185546875, 0.1343994140625, 0.212646484375, 0.04913330078125, 0.10723876953125, 0.144287109375, 0.05670166015625, 0.183837890625, 0.00628662109375, 0.1820068359375,...

embed

29519600_c0

29519600

prolog

0

Title: Why does 'is' in swi-prolog behave differently if sides are switched? Problem title: Why does 'is' in swi-prolog behave differently if sides are switched? Tags: prolog Problem: Why does 'is' in swi-prolog behave differently if sides are switched? I'm using swi-prolog version 6.6.6 if that mat...

Why does 'is' in swi-prolog behave differently if sides are switched? Why does 'is' in swi-prolog behave differently if sides are switched? prolog Why Why does 'is' in swi-prolog behave differently if sides are switched? I'm using swi-prolog version 6.6.6 if that matters. As far as I can tell they s...

[ 0.00157928466796875, 0.006866455078125, 0.0224609375, -0.0111083984375, -0.019287109375, -0.00909423828125, 0.027099609375, 0.00164794921875, 0.01080322265625, 0.01251220703125, 0.018310546875, -0.004669189453125, 0.0040283203125, -0.00848388671875, 0.0133056640625, -0.013671875, 0.0...

[ 44084, 3768, 164, 91, 2452, 3454, 4867, 186, 68991, 12921, 538, 2174, 5609, 7, 101089, 297, 502, 23, 17368, 11389, 2289, 156960, 26866, 5608, 183234, 4734, 60212, 26818, 83, 98, 8337, 50339, 39989, 4572, 2811, 86827, 21320, 757, 98320, 72...

[ 0.11962890625, 0.096435546875, 0.20654296875, 0.0618896484375, 0.2376708984375, 0.1568603515625, 0.231201171875, 0.04473876953125, 0.1649169921875, 0.1839599609375, 0.00848388671875, 0.06640625, 0.2205810546875, 0.04168701171875, 0.1986083984375, 0.029693603515625, 0.0848388671875, ...

embed

52879198_c0

52879198

prolog

0

Title: Prolog family rules Problem title: Prolog family rules Tags: prolog Problem: Prolog family rules I have a few facts: parent(bob, anne). % bob is a. parent of anne. sibling(anne, mary). I'm trying to get parents from sibling facts, so if I query parent(X, mary) bob should be an output. So far my rules are: siblin...

Prolog family rules Prolog family rules prolog Prolog Prolog family rules I have a few facts: I'm trying to get parents from sibling facts, so if I query parent(X, mary) bob should be an output. So far my rules are: It goes on an infinite loop. I suspect it is because the recursive call has no end condition. What can I...

[ 0.0250244140625, 0.0130615234375, -0.0025177001953125, 0.01513671875, -0.025146484375, 0.000728607177734375, 0.00421142578125, 0.008544921875, -0.00286865234375, -0.035400390625, 0.00909423828125, -0.0277099609375, -0.00775146484375, 0.0186767578125, 0.0234375, -0.005035400390625, 0....

[ 1250, 4867, 14449, 91736, 502, 10846, 15824, 31577, 2046, 27863, 1295, 78, 79298, 41, 1294, 49129, 1542, 1108, 53, 21895, 5608, 140992, 2060, 60899, 98, 54241, 13, 40956, 92610, 195625, 5844, 11782, 110, 3564, 35431, 4488 ]

[ 0.1383056640625, 0.2435302734375, 0.123779296875, 0.1468505859375, 0.1015625, 0.033599853515625, 0.1448974609375, 0.055084228515625, 0.059661865234375, 0.1851806640625, 0.025665283203125, 0.08148193359375, 0.16162109375, 0.1201171875, 0.1197509765625, 0.191650390625, 0.07220458984375...

embed

53660041_c2

53660041

prolog

2

empty, 3] L = [3, 1, empty] L = [3, empty, 1] L = [empty, 1, 3] L = [empty, 3, 1] L = [2, 3, empty] L = [2, empty, 3] L = [3, 2, empty] L = [3, empty, 2] L = [empty, 2, 3] L = [empty, 3, 2] discard the listResul which no contains empty, only 8 configurations for queens who no attack each other are valid from the outpu...

[ -0.004058837890625, 0.01495361328125, 0.0123291015625, 0.0242919921875, 0.005279541015625, -0.004364013671875, -0.010498046875, -0.002349853515625, 0.0155029296875, 0.0157470703125, -0.01214599609375, 0.003021240234375, -0.00921630859375, 0.002716064453125, -0.0228271484375, 0.00598144...

[ 201505, 138, 339, 2203, 122101, 4, 106, 33548, 939, 116, 17116, 5861, 5303, 4332, 10178, 70541, 4734, 382, 180346, 41, 1755, 110, 52875, 12638, 3789, 35604, 140992, 6056, 268, 28864, 26073, 7, 541, 41732, 33, 1250, 4867, 126684, 32036, 32...

[ 0.27392578125, 0.2039794921875, 0.177001953125, 0.092041015625, 0.1107177734375, 0.00360107421875, 0.04010009765625, 0.1160888671875, 0.09912109375, 0.0892333984375, 0.0289306640625, 0.0799560546875, 0.1800537109375, 0.088134765625, 0.244140625, 0.0165863037109375, 0.005615234375, ...

embed

6351245_c0

6351245

prolog

0

Title: Unit testing in XSB Prolog? Problem title: Unit testing in XSB Prolog? Tags: plunit, prolog, unit-testing, xsb Problem: Unit testing in XSB Prolog? How do people working with XSB Prolog do unit testing? Is there a library available? Or is it possible to somehow use SWI-Prolog's plunit library in XSB? If there is...

Unit testing in XSB Prolog? Unit testing in XSB Prolog? plunit prolog unit-testing xsb Unit XSB Prolog Unit testing in XSB Prolog? How do people working with XSB Prolog do unit testing? Is there a library available? Or is it possible to somehow use SWI-Prolog's plunit library in XSB? If there is not an available testin...

[ 0.00677490234375, 0.029296875, 0.0108642578125, -0.0194091796875, -0.006500244140625, 0.0042724609375, 0.0152587890625, -0.0013275146484375, 0.002655029296875, -0.01470947265625, -0.0002574920654296875, 0.0208740234375, -0.00848388671875, -0.00154876708984375, 0.0031585693359375, -0.00...

[ 46640, 134234, 23, 1193, 36474, 1250, 4867, 32, 12266, 6773, 502, 25072, 6954, 214, 1022, 7, 275, 11249, 3395, 20697, 54, 35773, 1294, 19882, 7722, 4527, 38969, 10752, 146731, 143834, 3034, 18151, 40304, 103510 ]

[ 0.2132568359375, 0.235595703125, 0.05511474609375, 0.1187744140625, 0.2054443359375, 0.1207275390625, 0.19921875, 0.010406494140625, 0.1143798828125, 0.1661376953125, 0.08026123046875, 0.1865234375, 0.1959228515625, 0.009552001953125, 0.069580078125, 0.02294921875, 0.1221923828125, ...

embed

19638004_c0

19638004

prolog

0

Title: Open .pl file and close current one in SWI - Prolog Problem title: Open .pl file and close current one in SWI - Prolog Tags: prolog, swi-prolog Problem: Open .pl file and close current one in SWI - Prolog I have created two different .pl files in SWI-Prolog for a text adventure game. They are two different missi...

Open .pl file and close current one in SWI - Prolog Open .pl file and close current one in SWI - Prolog prolog swi-prolog Open SWI Prolog Open .pl file and close current one in SWI - Prolog I have created two different .pl files in SWI-Prolog for a text adventure game. They are two different missions. Is there any way ...

[ 0.026123046875, 0.005706787109375, -0.0016021728515625, 0.0234375, -0.0186767578125, -0.0157470703125, -0.00147247314453125, 0.001190185546875, 0.0086669921875, -0.0213623046875, 0.00046539306640625, 0.024169921875, -0.01904296875, -0.00555419921875, 0.037841796875, -0.00701904296875, ...

[ 13527, 5, 2424, 11435, 136, 20903, 43581, 1632, 23, 159, 38969, 1250, 4867, 502, 2452, 3454, 75935, 6626, 12921, 102158, 10752, 7986, 156578, 6712, 6, 54916, 3917, 3564, 5117, 29752, 47, 9803, 17932, 11522, 28282, 541, 100, 6957 ]

[ 0.1671142578125, 0.093505859375, 0.27392578125, 0.22412109375, 0.05682373046875, 0.1846923828125, 0.14892578125, 0.06475830078125, 0.045654296875, 0.0750732421875, 0.2320556640625, 0.1448974609375, 0.2000732421875, 0.113037109375, 0.1654052734375, 0.109130859375, 0.136474609375, 0....

embed

19928890_c0

19928890

prolog

0

Title: Recursion and loop in prolog Problem title: Recursion and loop in prolog Tags: prolog Problem: Recursion and loop in prolog I've been trying to use prolog recursion to get the following output. ?- triangle(5). ++++1 +++12 ++123 +1234 12345 This is what I've done so far but it doesn't give me expected output. tri...

Recursion and loop in prolog Recursion and loop in prolog prolog Recursion X-1 N-1 Recursion and loop in prolog I've been trying to use prolog recursion to get the following output. ?- triangle(5). This is what I've done so far but it doesn't give me expected output.

[ 0.006622314453125, 0.006622314453125, 0.004364013671875, 0.00970458984375, -0.00689697265625, 0.01806640625, 0.006927490234375, 0.00494384765625, 0.01141357421875, -0.01409912109375, 0.003448486328125, -0.00457763671875, -0.0062255859375, 0.00408935546875, 0.0019073486328125, 0.0089721...

[ 165428, 42, 6889, 136, 40956, 502, 4867, 1193, 5759, 541, 23, 31577, 4527, 195625, 1830, 2046, 25632, 140992, 705, 9, 1927, 109217, 124534, 16940, 2060, 84751 ]

[ 0.16064453125, 0.1737060546875, 0.1552734375, 0.08184814453125, 0.2459716796875, 0.1419677734375, 0.24658203125, 0.06982421875, 0.1114501953125, 0.026519775390625, 0.01335906982421875, 0.061737060546875, 0.02410888671875, 0.20556640625, 0.1109619140625, 0.00786590576171875, 0.0536804...

embed

22469584_c0

22469584

prolog

0

Title: Store result as a list using prolog Problem title: Store result as a list using prolog Tags: list, prolog Problem: Store result as a list using prolog I wanted the result to be stored in a list. subject(english, 2). subject(math,2). subject(science,2). get_subject(subject, level) :- subject(subject,level) . when...

Store result as a list using prolog Store result as a list using prolog list prolog prolog Store get_subject Store result as a list using prolog I wanted the result to be stored in a list. when I have this query: it gives me the output: but i wanted the output to be list like this: [english, math, science] is it possib...

[ 0.01177978515625, -0.000782012939453125, 0.0025787353515625, 0.01318359375, -0.002105712890625, 0.00848388671875, -0.005889892578125, 0.0086669921875, 0.0218505859375, -0.05224609375, 0.00872802734375, -0.006134033203125, -0.0240478515625, -0.01220703125, -0.006439208984375, 0.00253295...

[ 14934, 16750, 237, 5303, 17368, 502, 4867, 10, 2046, 22144, 75161, 36663, 70, 4343, 71, 23, 41, 1294, 76199, 140992, 1284, 47, 186, 1884, 903, 13305, 15227, 48909, 41664, 7722, 54 ]

[ 0.235107421875, 0.2037353515625, 0.112060546875, 0.2066650390625, 0.0386962890625, 0.158447265625, 0.246826171875, 0.0265350341796875, 0.0445556640625, 0.117919921875, 0.161376953125, 0.110595703125, 0.0177154541015625, 0.1658935546875, 0.0592041015625, 0.0430908203125, 0.07360839843...

embed

26367865_c2

26367865

prolog

2

With_Me, all_About_That_Bass] Anyway, is there more elegant way of doing this? Code signals: How, top10us, all_About_That_Bass, Meghan, Trainor, shake_It_Off, Taylor, Swift, black_Widow, Iggy, Azalea, Featuring, Rita, Ora, bang_Bang, Jessie, Ariana, Grande, Nicki, Minaj, Tove, dont_Tell_Em, Jeremih, Maroon, stay_With_M...

[ -0.0107421875, 0.0191650390625, 0.00010538101196289062, 0.038330078125, -0.0166015625, 0.0166015625, 0.01007080078125, 0.00125885009765625, 0.00830078125, 0.01519775390625, -0.01531982421875, -0.033447265625, 0.01556396484375, 0.01153564453125, -0.0118408203125, 0.004150390625, -0.00...

[ 17106, 6696, 4, 756, 24988, 6056, 115743, 63473, 7, 126786, 1286, 27650, 3917, 20594, 903, 28864, 26073, 11249, 2663, 963, 223, 167361, 137879, 748, 174450, 23389, 150369, 63569, 130643, 22556, 36119, 24293, 87, 67192, 1155, 1935, 11, 4221, ...

[ 0.2440185546875, 0.25439453125, 0.021697998046875, 0.15966796875, 0.091552734375, 0.1998291015625, 0.2027587890625, 0.2464599609375, 0.13427734375, 0.0489501953125, 0.076904296875, 0.21435546875, 0.0849609375, 0.1253662109375, 0.1483154296875, 0.2626953125, 0.273193359375, 0.154541...

embed

10066476_c0

10066476

prolog

0

Title: Removing element or list in SWI-Prolog Problem title: Removing element or list in SWI-Prolog Tags: prolog Problem: Removing element or list in SWI-Prolog Another problem, I have a good working "function" for deleting: remove([],X,[]) :- !. remove([X|T],X,L1) :- !, remove(T,X,L1). remove([H|T],X,[H|L1]) :- remove...

Removing element or list in SWI-Prolog Removing element or list in SWI-Prolog prolog Removing SWI-Prolog Removing element or list in SWI-Prolog Another problem, I have a good working "function" for deleting: But it doesn't work like I want it to work. It removes element or even list... ...but doesn't remove all appeara...

[ 0.0079345703125, 0.0224609375, 0.001922607421875, 0.0147705078125, -0.0272216796875, -0.004486083984375, -0.006011962890625, -0.003997802734375, -0.00408935546875, -0.018798828125, 0.0185546875, 0.007537841796875, -0.0155029296875, -0.002960205078125, 0.0026397705078125, -0.00283813476...

[ 853, 432, 6496, 12830, 707, 5303, 159, 38969, 10752, 4867, 23, 502, 2967, 4127, 20697, 137175, 24674, 1916, 22027, 18, 4488, 1884, 3444, 87388, 7, 8789, 756, 170894, 69236, 25647 ]

[ 0.02996826171875, 0.131103515625, 0.045440673828125, 0.17822265625, 0.058868408203125, 0.182861328125, 0.0648193359375, 0.20947265625, 0.1171875, 0.1978759765625, 0.0196990966796875, 0.109130859375, 0.0865478515625, 0.04827880859375, 0.06634521484375, 0.12451171875, 0.1751708984375, ...

embed

12719117_c0

12719117

prolog

0

Title: Prolog: getting first float from list Problem title: Prolog: getting first float from list Tags: prolog Problem: Prolog: getting first float from list I'm having trouble getting the first float element in a list. What I've done so far (completely useless, maybe): get_float( _, F ) :- float( F ). get_float( [ Fir...

Prolog: getting first float from list Prolog: getting first float from list prolog list Prolog get_float First Rest some_pred SomeList FloatNumber Prolog: getting first float from list I'm having trouble getting the first float element in a list. What I've done so far (completely useless, maybe): Gives me this:

[ 0.01043701171875, -0.0162353515625, 0.006591796875, -0.01416015625, -0.004150390625, -0.0042724609375, -0.0019989013671875, -0.0072021484375, 0.00156402587890625, -0.025390625, 0.019775390625, 0.0130615234375, -0.0235595703125, -0.000713348388671875, 0.0086669921875, 0.0009384155273437...

[ 1250, 4867, 20949, 5117, 21917, 257, 1295, 5303, 502, 2046, 52347, 23972, 49756, 3060, 19714, 31384, 154663, 38699, 18444, 26278, 63134, 12830, 23, 16940, 2060, 9393, 51139, 77878 ]

[ 0.131103515625, 0.2181396484375, 0.10260009765625, 0.1602783203125, 0.24267578125, 0.1861572265625, 0.1038818359375, 0.1923828125, 0.0982666015625, 0.0811767578125, 0.209716796875, 0.1337890625, 0.20703125, 0.049407958984375, 0.175537109375, 0.0268402099609375, 0.15087890625, 0.184...

embed

27103666_c0

27103666

prolog

0

Title: Prolog Syntax Error : Operator expected Problem title: Prolog Syntax Error : Operator expected Tags: prolog Problem: Prolog Syntax Error : Operator expected I have the error/solution :5:10 : Syntax Error : Operator expected nonoverlap(R,Task1,Task2) :- Task1 = task(_,T1,L1,Rs2), Task2 = task(_,T2,L2,Rs2), ((memb...

Prolog Syntax Error : Operator expected Prolog Syntax Error : Operator expected prolog Prolog Syntax Error Operator Task1 Task2 Rs2 Rs1 Prolog Syntax Error : Operator expected I have the error/solution :5:10 : Syntax Error : Operator expected

[ 0.00836181640625, 0.0078125, -0.0028839111328125, 0.00897216796875, 0.0026702880859375, -0.01226806640625, -0.0225830078125, 0.01202392578125, 0.0034332275390625, -0.0203857421875, 0.0111083984375, 0.00823974609375, -0.00151824951171875, -0.02099609375, 0.0167236328125, 0.0032653808593...

[ 1250, 4867, 19010, 86531, 212059, 150922, 84751, 502, 9598, 92, 418, 304, 115034, 765, 18499, 166589, 758, 15110, 152 ]

[ 0.1572265625, 0.2452392578125, 0.1668701171875, 0.2174072265625, 0.1949462890625, 0.2763671875, 0.2354736328125, 0.10040283203125, 0.1375732421875, 0.041839599609375, 0.054443359375, 0.12005615234375, 0.1102294921875, 0.009765625, 0.1805419921875, 0.1373291015625, 0.06561279296875, ...

embed

55551512_c0

55551512

prolog

0

Title: Prolog Implementation of foldl1 Problem title: Prolog Implementation of foldl1 Tags: prolog, meta-predicate, fold Problem: Prolog Implementation of foldl1 I am trying to implement foldl1 in prolog without using build-in foldl predicate. My code produce Syntax error: Operator expected : foldl1(_, [E], E). foldl1(...

Prolog Implementation of foldl1 Prolog Implementation of foldl1 prolog meta-predicate fold Prolog Implementation foldl1 Syntax Operator Predicate Result Ans Prolog Implementation of foldl1 I am trying to implement foldl1 in prolog without using build-in foldl predicate. My code produce Syntax error: Operator expected :...

[ 0.004180908203125, -0.01171875, 0.006744384765625, 0.007537841796875, -0.02001953125, 0.001953125, -0.014404296875, 0.007049560546875, -0.002655029296875, -0.04833984375, 0.01953125, -0.01513671875, -0.014404296875, -0.0206298828125, 0.0230712890625, -0.015625, -0.02392578125, 0.02...

[ 1250, 4867, 153941, 18344, 20469, 418, 502, 23550, 19714, 2063, 42822, 19010, 86531, 150922, 7145, 126684, 893, 31577, 29479, 15490, 17368, 45367, 73, 1653, 18151, 27489, 18499, 84751, 87, 41206, 25689, 398 ]

[ 0.1593017578125, 0.222900390625, 0.156982421875, 0.15966796875, 0.1907958984375, 0.12939453125, 0.1474609375, 0.14306640625, 0.111328125, 0.1470947265625, 0.17578125, 0.0946044921875, 0.1583251953125, 0.2646484375, 0.1256103515625, 0.1171875, 0.0159759521484375, 0.038421630859375, ...

embed

22926167_c0

22926167

prolog

0

Title: Adjacent Pair function in prolog Problem title: Adjacent Pair function in prolog Tags: prolog Problem: Adjacent Pair function in prolog what should I do to the following to get the result like this: adjpair(L): The list L consists of pairs of adjacent identical values. ?- adjpair([a, a, b, b, c, c]). true ?- adj...

Adjacent Pair function in prolog Adjacent Pair function in prolog prolog Adjacent Pair is_in Adjacent Pair function in prolog what should I do to the following to get the result like this: The one I have so far is:

[ 0.00144195556640625, 0.0184326171875, 0.0157470703125, 0.00115203857421875, -0.00982666015625, 0.0181884765625, -0.01226806640625, 0.0103759765625, 0.0185546875, -0.0191650390625, 0.0167236328125, 0.020263671875, -0.0086669921875, 0.004119873046875, 0.00186920166015625, 0.0077514648437...

[ 3145, 145, 16797, 1342, 481, 32354, 502, 4867, 83, 73, 5608, 54, 47, 25632, 2046, 16750, 1884, 903, 765, 2060 ]

[ 0.0875244140625, 0.1734619140625, 0.179443359375, 0.1981201171875, 0.1650390625, 0.1773681640625, 0.1385498046875, 0.2139892578125, 0.12060546875, 0.0968017578125, 0.0282440185546875, 0.01397705078125, 0.013671875, 0.048126220703125, 0.048095703125, 0.1229248046875, 0.080322265625, ...

embed

62764673_c0

62764673

prolog

0

Title: Does anyone know what the SLD tree for this prolog code could be? Problem title: Does anyone know what the SLD tree for this prolog code could be? Tags: sld-resolution, prolog Problem: Does anyone know what the SLD tree for this prolog code could be? So this is a prolog code and I can't figure out what the SLD t...

Does anyone know what the SLD tree for this prolog code could be? Does anyone know what the SLD tree for this prolog code could be? sld-resolution prolog Does SLD Person Does anyone know what the SLD tree for this prolog code could be? So this is a prolog code and I can't figure out what the SLD tree is. I know it's no...

[ 0.006866455078125, 0.0380859375, -0.015625, 0.0322265625, -0.02685546875, 0.017333984375, -0.02294921875, -0.00897216796875, -0.00762939453125, -0.04638671875, -0.0177001953125, -0.021484375, -0.00762939453125, 0.004852294921875, 0.0245361328125, -0.0040283203125, 0.0400390625, -0....

[ 35672, 3714, 2367, 159, 30693, 53201, 100, 903, 502, 4867, 18151, 5809, 186, 70, 91, 7344, 107, 166589, 101790, 15270, 831, 18, 26366, 83, 959, 134598, 4488, 168867, 13448, 158839, 3444, 21176, 20650, 129745 ]

[ 0.045928955078125, 0.10888671875, 0.0650634765625, 0.1346435546875, 0.270263671875, 0.26513671875, 0.00311279296875, 0.04095458984375, 0.1544189453125, 0.1995849609375, 0.1988525390625, 0.09490966796875, 0.051239013671875, 0.05950927734375, 0.1004638671875, 0.205322265625, 0.08489990...

embed

56620094_c0

56620094

prolog

0

Title: How can i set a newline in a set string in SWI-Prolog? Problem title: How can i set a newline in a set string in SWI-Prolog? Tags: prolog Problem: How can i set a newline in a set string in SWI-Prolog? I have this string: B='Dogs cats birds and fish'. and i need it to appear in the format bellow: Dogs, cats, bir...

How can i set a newline in a set string in SWI-Prolog? How can i set a newline in a set string in SWI-Prolog? prolog How SWI-Prolog Dogs How can i set a newline in a set string in SWI-Prolog? I have this string: and i need it to appear in the format bellow: Is there any possible way for this to happen? I tried nl as in...

[ 0.001007080078125, -0.0169677734375, 0.0123291015625, 0.0299072265625, -0.009521484375, 0.0162353515625, 0.004119873046875, -0.0022125244140625, 0.00860595703125, 0.01141357421875, -0.0164794921875, 0.007080078125, 0.014404296875, -0.003997802734375, -0.003631591796875, 0.0086059570312...

[ 11249, 831, 17, 5423, 3525, 2256, 23, 79315, 159, 38969, 10752, 4867, 10, 502, 9, 41129, 7, 903, 3871, 108975, 9384, 41566, 7722, 3917, 37842, 13169, 237, 335, 8331, 9405, 7515, 263, 67155, 110, 25820, 136 ]

[ 0.05426025390625, 0.065185546875, 0.044158935546875, 0.2310791015625, 0.168212890625, 0.272705078125, 0.06805419921875, 0.2548828125, 0.06683349609375, 0.208740234375, 0.1396484375, 0.22509765625, 0.0430908203125, 0.08251953125, 0.001861572265625, 0.17724609375, 0.014434814453125, ...

embed

65495313_c0

65495313

prolog

0

Title: How to create a list without using findall? Prolog Problem title: How to create a list without using findall? Prolog Tags: prolog Problem: How to create a list without using findall? Prolog I am generating permutations: takeout(X,[X|T],T). takeout(X,[F|R],[F|S]):- takeout(X,R,S). perm([],[]). perm([X|Y],Z):- per...

How to create a list without using findall? Prolog How to create a list without using findall? Prolog prolog findall How Prolog List How to create a list without using findall? Prolog I am generating permutations: I want to know how to create a list of all the permutations without using findall. Example:

[ 0.01214599609375, 0.0091552734375, 0.0079345703125, 0.0037078857421875, -0.002197265625, 0.0020599365234375, -0.043212890625, 0.00095367431640625, 0.0042724609375, -0.03076171875, 0.004608154296875, -0.0167236328125, 0.0191650390625, 0.007659912109375, -0.0018310546875, 0.025146484375,...

[ 11249, 28282, 10, 5303, 15490, 17368, 7413, 5584, 1250, 4867, 47, 502, 32036, 12663, 117, 14311, 21094, 756 ]

[ 0.0192108154296875, 0.1624755859375, 0.019866943359375, 0.2105712890625, 0.13134765625, 0.032958984375, 0.11346435546875, 0.175537109375, 0.109130859375, 0.203857421875, 0.0155181884765625, 0.0404052734375, 0.1732177734375, 0.055877685546875, 0.04107666015625, 0.15185546875, 0.046539...

embed

31584614_c1

31584614

prolog

1

would not be exported. I need to use csv_load_mod:mt_relation/3 etc. Is there a way to get a module to export a dynamic predicate or adapt prepare_db/3 so the facts it asserts are not local or they get asserted to the module that called it? Code signals: Modules, csv_load_mod, prepare_db, use_module, set_prolog_stack,...

[ 0.026611328125, -0.0031890869140625, 0.01153564453125, 0.017333984375, -0.0037078857421875, 0.007354736328125, 0.022705078125, -0.001373291015625, 0.0189208984375, -0.036376953125, -0.0126953125, 0.0045166015625, -0.0196533203125, -0.0177001953125, 0.017333984375, -0.0140380859375, -...

[ 2806, 959, 186, 31255, 297, 3871, 4527, 20763, 334, 63033, 13415, 18, 107, 57860, 18113, 3917, 2046, 88996, 84079, 1653, 2063, 67, 39908, 114606, 48073, 15824, 237, 33657, 4000, 16865, 35839, 28864, 26073, 63014, 83279, 5423, 3454, 4867, 59...

[ 0.048309326171875, 0.089111328125, 0.0355224609375, 0.2498779296875, 0.10888671875, 0.028167724609375, 0.0416259765625, 0.04132080078125, 0.18115234375, 0.10211181640625, 0.1346435546875, 0.0758056640625, 0.05487060546875, 0.1639404296875, 0.165283203125, 0.038330078125, 0.0240783691...

embed

32737396_c0

32737396

prolog

0

Title: Arithmetic comparison in Prolog Problem title: Arithmetic comparison in Prolog Tags: prolog, arithmetic-expressions Problem: Arithmetic comparison in Prolog Let's say we have two variables X and Y . X is 53 and Y is 52 . What I want to do is compare them by adding 1 to the Y , so that it would be 53 - therefore ...

Arithmetic comparison in Prolog Arithmetic comparison in Prolog prolog arithmetic-expressions Arithmetic Prolog Arithmetic comparison in Prolog Let's say we have two variables X and Y . X is 53 and Y is 52 . What I want to do is compare them by adding 1 to the Y , so that it would be 53 - therefore X would be equal to ...

[ 0.005615234375, 0.0034637451171875, -0.001922607421875, 0.0322265625, 0.006103515625, 0.01129150390625, -0.0022125244140625, 0.004241943359375, -0.004608154296875, 0.0032806396484375, 0.0137939453125, 0.009521484375, -0.00021839141845703125, 0.0079345703125, 0.0135498046875, -0.0231933...

[ 1172, 8962, 282, 225490, 1250, 4867, 23, 502, 204629, 6626, 77336, 7, 1193, 136, 990, 8934, 7221, 3444, 69101, 154107, 106, 47, 2806, 105950, 997, 31577, 17368, 39933, 66044, 33342, 8781, 98320, 132283 ]

[ 0.00225830078125, 0.12451171875, 0.07421875, 0.224609375, 0.1744384765625, 0.26708984375, 0.01531982421875, 0.122314453125, 0.1016845703125, 0.052154541015625, 0.21728515625, 0.007904052734375, 0.15185546875, 0.0703125, 0.1517333984375, 0.2401123046875, 0.2509765625, 0.021224975585...

embed

5031551_c0

5031551

prolog

0

Title: Prolog list operation Problem title: Prolog list operation Tags: list, prolog Problem: Prolog list operation Here's my problem (by example since that's quicker): ?- enum_list([alpha, beta, gamma, beta, beta, delta, epsilon, alpha], L). L = [alpha1, beta1, gamma, beta2, beta3, delta, epsilon, alpha2]. The problem...

Prolog list operation Prolog list operation list prolog Prolog enum_list alpha1 beta1 beta2 beta3 alpha2 Prolog list operation Here's my problem (by example since that's quicker): The problem is simple when I am allowed to reorder the list (just sort the list, group same elements into lists, enum the lists if they are ...

[ 0.0081787109375, 0.0089111328125, 0, -0.00567626953125, -0.005767822265625, 0.01611328125, -0.01519775390625, 0.007415771484375, 0.00811767578125, -0.00872802734375, 0.000370025634765625, 0.0179443359375, 0.00738525390625, 0.018310546875, -0.00885009765625, 0.006195068359375, 0.00083...

[ 1250, 4867, 5303, 41018, 502, 22, 316, 6562, 144, 14612, 418, 51703, 304, 363, 2967, 27781, 63773, 56, 8781, 107003, 47, 456, 80596, 70, 12096, 21115, 5701, 80854, 3934, 2174, 1836, 51713, 3501, 4879, 4966, 87, 3444, 13695, 12989, 25647 ]

[ 0.1734619140625, 0.248779296875, 0.222412109375, 0.206787109375, 0.1304931640625, 0.1243896484375, 0.212158203125, 0.202880859375, 0.07080078125, 0.149658203125, 0.00079345703125, 0.1375732421875, 0.03326416015625, 0.06195068359375, 0.1490478515625, 0.0555419921875, 0.0526123046875, ...

embed

57956107_c0

57956107

prolog

0

Title: Write immediatly on the console Problem title: Write immediatly on the console Tags: prolog Problem: Write immediatly on the console I want to abort my program right after it writes something to the console, but "write" is not displaying the message immediatly. write('The AI wins!'), abort. This is the message I...

Write immediatly on the console Write immediatly on the console prolog Write Write immediatly on the console I want to abort my program right after it writes something to the console, but "write" is not displaying the message immediatly. This is the message I want to be shown. I tried it with "print" and it stays the s...

[ -0.0034027099609375, 0.0196533203125, -0.000881195068359375, -0.01123046875, -0.003173828125, 0.0020294189453125, 0.013916015625, -0.01116943359375, -0.0029754638671875, -0.01324462890625, 0.011962890625, 0.0181884765625, -0.0002803802490234375, 0.0054931640625, 0.01446533203125, 0.008...

[ 601, 18781, 566, 12333, 18, 538, 98, 130250, 502, 4867, 3444, 47, 64853, 1528, 7103, 33022, 434, 959, 44116, 214, 26008, 127887, 37842, 35662, 24765, 5701, 18026, 1495, 6056, 7077, 18499, 86429, 3957, 38730, 19916, 7, 38, 14602, 32316, 38...

[ 0.15087890625, 0.2275390625, 0.0928955078125, 0.2138671875, 0.1212158203125, 0.11474609375, 0.111328125, 0.255126953125, 0.1533203125, 0.204833984375, 0.083984375, 0.108642578125, 0.279296875, 0.145751953125, 0.1015625, 0.14306640625, 0.1087646484375, 0.06787109375, 0.17309570312...

embed

67684953_c0

67684953

prolog

0

Title: Display Last Element in List Prolog Problem title: Display Last Element in List Prolog Tags: prolog Problem: Display Last Element in List Prolog Given the list [1, 2, 3, 4] , display the last element. I am using only one parameter and using recursion. This is what I tried. But the output is always true . lastEle...

Display Last Element in List Prolog Display Last Element in List Prolog prolog Display Last Element List Prolog Stack Tail Head Singleton Display Last Element in List Prolog Given the list [1, 2, 3, 4] , display the last element. I am using only one parameter and using recursion. This is what I tried. But the output is...

[ 0.017578125, 0.0152587890625, 0.014404296875, 0.0128173828125, -0.00142669677734375, 0.0196533203125, -0.007171630859375, -0.00124359130859375, -0.0133056640625, -0.007476806640625, 0.0216064453125, -0.046142578125, -0.014404296875, -0.0028076171875, 0.0087890625, -0.000169754028320312...

[ 90045, 21672, 48325, 23, 32036, 1250, 4867, 502, 6512, 2594, 1218, 379, 44816, 43609, 1507, 5303, 68252, 116, 138, 201, 44116, 4568, 12830, 17368, 4734, 1632, 171859, 195625, 1830, 37842, 140992, 11343, 29568, 20949 ]

[ 0.1802978515625, 0.256591796875, 0.22314453125, 0.029876708984375, 0.1866455078125, 0.1478271484375, 0.2191162109375, 0.0845947265625, 0.09674072265625, 0.00653076171875, 0.1033935546875, 0.03070068359375, 0.13623046875, 0.1180419921875, 0.134521484375, 0.1466064453125, 0.00863647460...

embed

41748222_c1

41748222

prolog

1

), structuralOrDependencyRelation( RelationTwo), weakest( Relation, RelationOne, RelationTwo), isADirectRelation( Source, RelationTwo, Intermediate), isARelation( Intermediate, RelationOne, Target, [[Source,RelationTwo,Intermediate]|Visited]). How do I implement that the first call isARelation(A, B, C, []). does the ca...

[ -0.000545501708984375, 0.007598876953125, 0.01708984375, 0.019287109375, 0.00848388671875, 0.018310546875, -0.0125732421875, -0.0247802734375, 0.01385498046875, -0.0262451171875, 0.0087890625, 0.0281982421875, -0.03857421875, 0.01495361328125, 0.0322265625, -0.005218505859375, 0.0075...

[ 247, 118990, 141, 19060, 4657, 26885, 27771, 4332, 57860, 116822, 618, 3613, 642, 344, 525, 62068, 83, 284, 184911, 77641, 12333, 67, 11909, 13, 160017, 211235, 65331, 194, 11249, 54, 87, 29479, 5117, 11782, 335, 313, 74481, 50339, 136, 1...

[ 0.049591064453125, 0.212890625, 0.0782470703125, 0.1641845703125, 0.0823974609375, 0.2054443359375, 0.0341796875, 0.1197509765625, 0.259765625, 0.246826171875, 0.039337158203125, 0.1690673828125, 0.1192626953125, 0.1361083984375, 0.1602783203125, 0.1385498046875, 0.1341552734375, 0...

embed

30117272_c0

30117272

prolog

0

Title: getting out of local stack at prolog Problem title: getting out of local stack at prolog Tags: transitive-closure, prolog Problem: getting out of local stack at prolog p(0,0). p(0,1). p(0,2). p(0,3). p(0,4). p(1,1). p(1,2). p(1,3). p(1,4). p(1,0). p(2,0). p(2,1). p(2,2). p(2,3). p(2,4). p(3,0). p(3,1). p(3,2). p...

getting out of local stack at prolog getting out of local stack at prolog transitive-closure prolog Y-1 X-1 ERROR getting out of local stack at prolog I don't know why this code I wrote isn't working. e.g.:

[ 0.01031494140625, 0.013427734375, 0.0146484375, 0.01708984375, 0.0005950927734375, -0.0087890625, -0.021728515625, 0.006072998046875, -0.00182342529296875, -0.043701171875, 0.00157928466796875, 0.010986328125, 0.00015544891357421875, 0.0036773681640625, 0.03515625, 0.000238418579101562...

[ 20949, 1810, 111, 4000, 177261, 99, 502, 4867, 62621, 5844, 170224, 990, 5759, 1193, 151206, 24638, 3714, 15400, 903, 18151, 54397, 56112, 18, 20697 ]

[ 0.11676025390625, 0.2093505859375, 0.1929931640625, 0.1666259765625, 0.220947265625, 0.1051025390625, 0.1322021484375, 0.254638671875, 0.126220703125, 0.11090087890625, 0.177978515625, 0.11468505859375, 0.1258544921875, 0.077392578125, 0.123291015625, 0.08013916015625, 0.056701660156...

embed

41935073_c0

41935073

prolog

0

Title: How to trace backtracks of clpfd in prolog? Problem title: How to trace backtracks of clpfd in prolog? Tags: sudoku, clpfd, prolog Problem: How to trace backtracks of clpfd in prolog? I am making a sudoku solver with prolog using clpfd library . I have to trace the backtracks and every squares labeled with row a...

How to trace backtracks of clpfd in prolog? How to trace backtracks of clpfd in prolog? sudoku clpfd prolog How How to trace backtracks of clpfd in prolog? I am making a sudoku solver with prolog using clpfd library . I have to trace the backtracks and every squares labeled with row and column and the number it gets in...

[ 0.01434326171875, 0.0220947265625, 0.002532958984375, 0.020751953125, -0.01007080078125, -0.00799560546875, 0.0028228759765625, 0.011474609375, -0.00830078125, -0.03857421875, -0.00927734375, -0.0242919921875, -0.01153564453125, -0.00165557861328125, 0.01104736328125, 0.002059936523437...

[ 11249, 47, 144851, 4420, 125728, 7, 111, 33139, 39557, 71, 23, 502, 4867, 8932, 38067, 3115, 814, 35773, 11907, 108047, 67967, 678, 15555, 316, 14012, 62163, 3173, 2046, 4677, 1295, 234873, 139999, 46552, 25553, 6892, 91736, 68034 ]

[ 0.09844970703125, 0.05279541015625, 0.2255859375, 0.177001953125, 0.2578125, 0.08367919921875, 0.01611328125, 0.0943603515625, 0.1307373046875, 0.185302734375, 0.0648193359375, 0.1402587890625, 0.212646484375, 0.08294677734375, 0.155029296875, 0.051055908203125, 0.055572509765625, ...

embed

10609483_c0

10609483

prolog

0

Title: Converting OSM data to Prolog facts? Problem title: Converting OSM data to Prolog facts? Tags: prolog, openstreetmap, converters Problem: Converting OSM data to Prolog facts? For a small experiment, I would like to transform an exported OSM dataset from XML to Prolog. I know there are certain general purpose XML...

Converting OSM data to Prolog facts? Converting OSM data to Prolog facts? prolog openstreetmap converters Converting OSM Prolog Converting OSM data to Prolog facts? For a small experiment, I would like to transform an exported OSM dataset from XML to Prolog. I know there are certain general purpose XML to Prolog conver...

[ 0.026611328125, 0.0103759765625, 0.00262451171875, -0.0257568359375, 0.011474609375, 0.0135498046875, -0.0004367828369140625, -0.0205078125, -0.00933837890625, -0.029052734375, 0.0064697265625, -0.00799560546875, -0.015380859375, -0.00482177734375, -0.0031280517578125, -0.0064697265625...

[ 1657, 814, 1916, 180, 18148, 2053, 47, 1250, 4867, 15824, 7, 502, 9803, 5967, 62346, 172127, 19336, 28007, 1884, 27198, 31255, 297, 3509, 1295, 92537, 4537, 60042, 29016, 617, 1542, 7237, 2965, 3917, 2967, 93002, 35773, 96760, 142267, 18811...

[ 0.0687255859375, 0.13818359375, 0.055908203125, 0.1734619140625, 0.270263671875, 0.1614990234375, 0.1224365234375, 0.175537109375, 0.266357421875, 0.1787109375, 0.13623046875, 0.1080322265625, 0.07275390625, 0.112060546875, 0.178466796875, 0.2288818359375, 0.034759521484375, 0.1215...

embed

35484964_c0

35484964

prolog

0

Title: Determining if a list is empty or not Problem title: Determining if a list is empty or not Tags: prolog, list Problem: Determining if a list is empty or not I want to do some if | else stuff in prolog. Below is my code, Prolog will return 'R = false' if my input list is not empty, it will return 'false' if my li...

Determining if a list is empty or not Determining if a list is empty or not prolog list Determining Determining if a list is empty or not I want to do some if | else stuff in prolog. Below is my code, Prolog will return 'R = false' if my input list is not empty, it will return 'false' if my list is empty. What do I mis...

[ 0.005615234375, 0.0035400390625, 0.0081787109375, 0.01397705078125, -0.00811767578125, 0.0087890625, 0.00604248046875, -0.00140380859375, 0.007598876953125, 0.0291748046875, 0.0186767578125, -0.0002689361572265625, -0.035888671875, 0.006683349609375, 0.00189971923828125, 0.011352539062...

[ 262, 30524, 2174, 5303, 83, 201505, 707, 959, 502, 4867, 3444, 37076, 18151, 1250, 30646, 1052, 2203, 98320, 107730, 8710, 18025, 28864, 13538 ]

[ 0.0526123046875, 0.1329345703125, 0.0950927734375, 0.1982421875, 0.070068359375, 0.22509765625, 0.045623779296875, 0.08111572265625, 0.1082763671875, 0.180908203125, 0.00091552734375, 0.093017578125, 0.07464599609375, 0.1051025390625, 0.09613037109375, 0.1123046875, 0.00738525390625,...

embed

35616452_c0

35616452

prolog

0

Title: How can I test a phrase with a context free grammar writing with DCG prolog Problem title: How can I test a phrase with a context free grammar writing with DCG prolog Tags: dcg, prolog Problem: How can I test a phrase with a context free grammar writing with DCG prolog I have a context free grammar which I have ...

How can I test a phrase with a context free grammar writing with DCG prolog How can I test a phrase with a context free grammar writing with DCG prolog dcg prolog How DCG How can I test a phrase with a context free grammar writing with DCG prolog I have a context free grammar which I have written in DCG prolog. I also ...

[ 0.033203125, -0.0101318359375, -0.00433349609375, 0.0277099609375, 0.0003833770751953125, 0.00738525390625, 0.00109100341796875, -0.0001773834228515625, 0.0096435546875, -0.0093994140625, -0.006011962890625, -0.004180908203125, -0.00799560546875, 0.01080322265625, 0.00299072265625, 0.0...

[ 11249, 831, 87, 3034, 113860, 678, 43701, 4092, 122092, 147, 32562, 391, 56367, 502, 4867, 177, 59121, 27781, 46876, 3444, 47, 12638, 493, 26785, 3642, 54, 903 ]

[ 0.045379638671875, 0.0628662109375, 0.0206298828125, 0.22265625, 0.2291259765625, 0.07354736328125, 0.1680908203125, 0.111083984375, 0.091552734375, 0.0753173828125, 0.11279296875, 0.05950927734375, 0.180419921875, 0.0902099609375, 0.173828125, 0.040191650390625, 0.0159149169921875, ...

embed

28642031_c1

28642031

prolog

1

b')" I don't like compiling a "day.exe" to run a script ( according to the docs this often is not necessary), but I have found no other way to pass arguments to rules. I saw a basic intro on swi-pl.org that has not helped much. It does not explain how to make the leap from the script.sh file example to the execution of...

[ 0.0211181640625, 0.01165771484375, -0.004425048828125, 0.030029296875, -0.00567626953125, 0.000640869140625, 0.0011444091796875, -0.0034637451171875, 0.004364013671875, -0.0247802734375, -0.01324462890625, 0.012939453125, -0.004302978515625, 0.01434326171875, 0.00537109375, -0.01049804...

[ 25, 2301, 18, 1884, 9969, 49725, 5636, 5, 46480, 11675, 26499, 27983, 63559, 14037, 3917, 27875, 10750, 7, 47, 91736, 24124, 62822, 64627, 91, 2452, 2424, 1478, 104902, 5045, 73342, 3642, 95, 2631, 1295, 1495, 11435, 27781, 71924, 64, 13,...

[ 0.01605224609375, 0.048065185546875, 0.0770263671875, 0.130126953125, 0.082763671875, 0.01324462890625, 0.1707763671875, 0.019378662109375, 0.210693359375, 0.09478759765625, 0.25048828125, 0.06866455078125, 0.1016845703125, 0.009429931640625, 0.038116455078125, 0.13134765625, 0.26000...

embed

55390157_c0

55390157

prolog

0

Title: How to access rule data in PROLOG Problem title: How to access rule data in PROLOG Tags: prolog Problem: How to access rule data in PROLOG I have to determine whether two rectangles overlap or not, I can do this but I am struggling with figuring out how to grab my given data, and compare it to eachother to deter...

How to access rule data in PROLOG How to access rule data in PROLOG prolog R1 How PROLOG Have How to access rule data in PROLOG I have to determine whether two rectangles overlap or not, I can do this but I am struggling with figuring out how to grab my given data, and compare it to eachother to determine larger values...

[ 0.026123046875, 0.01092529296875, 0.003143310546875, 0.029296875, 0.00506591796875, 0.022705078125, 0.00064849853515625, 0.017333984375, -0.00064849853515625, -0.0216064453125, 0.0113525390625, 0.00157928466796875, 0.006011962890625, -0.0272216796875, 0.0245361328125, -0.00927734375, ...

[ 11249, 47, 17203, 79986, 2053, 23, 10514, 47510, 502, 4867, 627, 418, 31901, 83324, 36766, 6626, 148734, 449, 1577, 645, 6324, 959, 831, 237875, 26747, 3642, 59102, 34475, 69101, 126340, 150679, 142424 ]

[ 0.07244873046875, 0.06817626953125, 0.2236328125, 0.2398681640625, 0.2239990234375, 0.09393310546875, 0.1907958984375, 0.26416015625, 0.131103515625, 0.2327880859375, 0.09112548828125, 0.08514404296875, 0.044036865234375, 0.11846923828125, 0.0179290771484375, 0.0936279296875, 0.11981...

embed

7485212_c0

7485212

prolog

0

Title: "Not equal" sign in Visual Prolog? Problem title: "Not equal" sign in Visual Prolog? Tags: prolog, visual-prolog, equals, clause Problem: "Not equal" sign in Visual Prolog? I can't find any documentation on "not equal" sign in Visual Prolog. Please provide the right solution of this problem: ...

"Not equal" sign in Visual Prolog? "Not equal" sign in Visual Prolog? prolog visual-prolog equals clause Not Visual Prolog Person Sister Parent "Not equal" sign in Visual Prolog? I can't find any documentation on "not equal" sign in Visual Prolog. Please provide the right solution of this problem:

[ 0.01544189453125, 0.01171875, 0.0184326171875, 0.00592041015625, -0.035888671875, 0.01708984375, -0.0016021728515625, -0.0024261474609375, -0.0111083984375, -0.0113525390625, -0.00726318359375, -0.0150146484375, 0.018798828125, 0.006744384765625, 0.001556396484375, 0.017333984375, -0...

[ 41502, 122116, 105950, 1230, 24092, 73372, 1250, 4867, 23, 502, 21176, 3454, 70731, 11205, 15270, 602, 1515, 170918, 209806, 10869, 7108, 29806, 2967 ]

[ 0.07177734375, 0.1488037109375, 0.193115234375, 0.01305389404296875, 0.1805419921875, 0.1724853515625, 0.09124755859375, 0.1920166015625, 0.0045166015625, 0.054443359375, 0.1680908203125, 0.0748291015625, 0.1107177734375, 0.10137939453125, 0.061065673828125, 0.075927734375, 0.0759887...

embed

24003082_c2

24003082

prolog

2

.Plc, Netbeans, SWI, Nobukuni, Kino, Queens, Applet, Runnable, Run, Frame, f.addWindowListener, WindowAdapter, WindowEvent, System.exit, qb.init, f.add, Center, f.setSize, f.show, qb.run1, Color, Thread, System.out.println, Start, runner.start, runner.resume, runner.suspend, run1, Plc.startPlc, Integer, Plc, Object, Pl...

[ 0.00098419189453125, 0.0035858154296875, -0.006011962890625, 0.0238037109375, -0.006622314453125, 0.0010528564453125, 0.0264892578125, -0.01055908203125, 0.0057373046875, -0.0203857421875, -0.0037078857421875, 0.0185546875, -0.00170135498046875, -0.018310546875, -0.0123291015625, -0.01...

[ 6, 5, 683, 32838, 4, 10086, 372, 10133, 159, 38969, 438, 107798, 93, 49309, 44109, 7, 4129, 18, 28398, 19, 2886, 42557, 13, 1238, 4028, 92049, 24293, 154663, 39060, 176501, 22409, 2631, 720, 192134, 12353, 23399, 8096, 275, 73, 217, 115...

[ 0.041534423828125, 0.19775390625, 0.0889892578125, 0.2254638671875, 0.0511474609375, 0.14794921875, 0.241943359375, 0.1826171875, 0.05853271484375, 0.18994140625, 0.07733154296875, 0.1492919921875, 0.156982421875, 0.2215576171875, 0.18017578125, 0.08502197265625, 0.1766357421875, 0...

embed

71687825_c0

71687825

prolog

0

Title: knowledgment unification in prolog Problem title: knowledgment unification in prolog Tags: prolog, zebra-puzzle Problem: knowledgment unification in prolog What I have to do is to unify the possible options and solve the problem with these sentences The Spaniard lives next to the red house. The Norwegian lives i...

knowledgment unification in prolog knowledgment unification in prolog prolog zebra-puzzle knowledgment unification in prolog What I have to do is to unify the possible options and solve the problem with these sentences This is my attempt but I am getting an error, could someone please help me.

[ -0.00555419921875, 0.00186920166015625, 0.0220947265625, 0.008544921875, 0.00970458984375, -0.000965118408203125, -0.033447265625, 0.01068115234375, -0.00040435791015625, -0.031005859375, -0.004638671875, 0.01336669921875, 0.0040283203125, -0.0157470703125, -0.00933837890625, 0.0080566...

[ 3714, 6259, 177, 674, 51, 41274, 23, 502, 4867, 116232, 1766, 13894, 133, 765, 47, 54, 40383, 7722, 50717, 86869, 2967, 678, 6097, 149357, 81887, 20949, 18499, 5809, 22008, 22936, 4358, 5 ]

[ 0.179931640625, 0.172119140625, 0.11865234375, 0.13134765625, 0.1986083984375, 0.2139892578125, 0.0775146484375, 0.1519775390625, 0.22509765625, 0.193603515625, 0.08306884765625, 0.09735107421875, 0.085693359375, 0.05096435546875, 0.0056610107421875, 0.0195159912109375, 0.17407226562...

embed

3796866_c0

3796866

prolog

0

Title: how to count odd and even number with using PROLOG Problem title: how to count odd and even number with using PROLOG Tags: list, prolog, recursion Problem: how to count odd and even number with using PROLOG question is: when we key in mem([1,2,3,4,5]). we will get the output as bellow: odd=3 even=2 my coding is ...

how to count odd and even number with using PROLOG how to count odd and even number with using PROLOG list prolog recursion PROLOG how to count odd and even number with using PROLOG question is: when we key in mem([1,2,3,4,5]). we will get the output as bellow: odd=3 even=2 my coding is like that but cannot run. can he...

[ 0.0074462890625, 0.0185546875, -0.00141143798828125, -0.0008392333984375, 0.0028228759765625, 0.031005859375, -0.0177001953125, 0.01025390625, 0.006805419921875, -0.0242919921875, 0.01031494140625, -0.043212890625, 0.01171875, 0.019287109375, 0.024169921875, -0.00445556640625, -0.004...

[ 3642, 47, 54529, 70270, 136, 3853, 14012, 678, 17368, 10514, 47510, 5303, 502, 4867, 195625, 1830, 9655, 22799, 23, 7199, 133063, 363, 80389, 2046, 140992, 41566, 76067, 55257, 552, 6238, 53418, 11675, 4358, 12765, 121742, 1542, 62766, 132, ...

[ 0.05682373046875, 0.052276611328125, 0.20361328125, 0.261474609375, 0.148193359375, 0.2177734375, 0.1844482421875, 0.125732421875, 0.1029052734375, 0.1669921875, 0.2166748046875, 0.1212158203125, 0.1146240234375, 0.15283203125, 0.142578125, 0.02105712890625, 0.014404296875, 0.16210...

embed

11355151_c0

11355151

prolog

0

Title: prolog trace how to use Problem title: prolog trace how to use Tags: trace, prolog Problem: prolog trace how to use How to go second step when trace prolog program? For example, I want to trace following simple program: length1([],0). length1([_X|Xs],N):- length1(Xs,N1), N is N1+1. I trace program: ?- trace,leng...

prolog trace how to use prolog trace how to use trace prolog length1 Call _G231 Exit prolog trace how to use How to go second step when trace prolog program? For example, I want to trace following simple program: I trace program: But as we see, it immediately gives answer. But I thought it should be like Call:(8) ... C...

[ 0.01080322265625, 0.0201416015625, 0.003570556640625, 0.01397705078125, -0.00311279296875, 0.0028228759765625, -0.001953125, 0.00946044921875, 0.004547119140625, -0.052001953125, 0.01055908203125, 0.00168609619140625, -0.031982421875, 0.002471923828125, 0.025146484375, -0.01513671875, ...

[ 502, 4867, 144851, 3642, 47, 4527, 140909, 418, 26265, 724, 304, 5016, 5443, 738, 17932, 29954, 1528, 25632, 8781, 1957, 109312, 76199, 35166, 17569, 5608, 1884, 50490, 222104, 20594, 44691 ]

[ 0.1680908203125, 0.241455078125, 0.26611328125, 0.07586669921875, 0.052490234375, 0.1571044921875, 0.1505126953125, 0.05322265625, 0.14111328125, 0.0196075439453125, 0.07379150390625, 0.2000732421875, 0.055938720703125, 0.05841064453125, 0.138671875, 0.141845703125, 0.1358642578125, ...

embed

54185772_c0

54185772

prolog

0

Title: Member (extended) predicate - find element in a list of lists (any level) Problem title: Member (extended) predicate - find element in a list of lists (any level) Tags: prolog Problem: Member (extended) predicate - find element in a list of lists (any level) We all know the classic Prolog predicate for member: m...

Member (extended) predicate - find element in a list of lists (any level) Member (extended) predicate - find element in a list of lists (any level) prolog Member Member (extended) predicate - find element in a list of lists (any level) We all know the classic Prolog predicate for member: I am struggling to come up with...

[ -0.000873565673828125, 0.01080322265625, 0.0216064453125, -0.0003643035888671875, -0.01251220703125, -0.0003719329833984375, 0.014404296875, 0.01312255859375, -0.000156402587890625, -0.04931640625, 0.0216064453125, 0.0010833740234375, 0.0189208984375, 0.00286865234375, -0.003143310546875...

[ 74057, 3355, 35548, 71, 1653, 2063, 67, 20, 7413, 12830, 23, 5303, 7, 4848, 17366, 502, 4867, 756, 3714, 54704, 1250, 100, 32786, 237875, 1380, 1257, 65042, 297, 157318, 4390, 27781 ]

[ 0.281005859375, 0.057220458984375, 0.1383056640625, 0.064453125, 0.1798095703125, 0.2252197265625, 0.124755859375, 0.0255126953125, 0.168701171875, 0.1751708984375, 0.044677734375, 0.187744140625, 0.02581787109375, 0.041168212890625, 0.146484375, 0.1380615234375, 0.2109375, 0.02420...

embed

37154622_c0

37154622

prolog

0

Title: How to find all perfect matching in bipartite graph using Prolog? Problem title: How to find all perfect matching in bipartite graph using Prolog? Tags: matching, bipartite, prolog-findall, prolog Problem: How to find all perfect matching in bipartite graph using Prolog? I'm trying to find all perfect matching i...

How to find all perfect matching in bipartite graph using Prolog? How to find all perfect matching in bipartite graph using Prolog? matching bipartite prolog-findall prolog Prolog How How to find all perfect matching in bipartite graph using Prolog? I'm trying to find all perfect matching in bipartite graph and then do...

[ -0.00946044921875, 0.017822265625, 0.00946044921875, 0.000278472900390625, -0.0021514892578125, 0.0103759765625, -0.00194549560546875, 0.0074462890625, 0.006927490234375, -0.040283203125, 0.004669189453125, 0.01043701171875, 0.006591796875, -0.00933837890625, -0.00982666015625, 0.00427...

[ 11249, 7413, 756, 15787, 14858, 214, 23, 333, 15866, 67, 41382, 17368, 1250, 4867, 47, 502, 111607, 5584, 31577, 351, 219836, 29806, 112465, 234873, 959, 78643, 80973 ]

[ 0.052490234375, 0.12744140625, 0.123291015625, 0.21923828125, 0.248779296875, 0.1563720703125, 0.054107666015625, 0.1585693359375, 0.1585693359375, 0.0841064453125, 0.195068359375, 0.04376220703125, 0.1536865234375, 0.236083984375, 0.0236663818359375, 0.09796142578125, 0.052185058593...

embed

44087873_c0

44087873

prolog

0

Title: How can I combine format and print in prolog? Problem title: How can I combine format and print in prolog? Tags: prolog Problem: How can I combine format and print in prolog? How can I combine format and print in prolog? Basically, I pretend to print a message like "Element 5 occurs 3 times" in prolog. Number 5 ...

How can I combine format and print in prolog? How can I combine format and print in prolog? prolog How Element count_occur How can I combine format and print in prolog? How can I combine format and print in prolog? Basically, I pretend to print a message like "Element 5 occurs 3 times" in prolog. Number 5 and 3 depends...

[ -0.0036773681640625, 0.0166015625, -0.004241943359375, 0.011962890625, 0.0213623046875, 0.0101318359375, -0.003662109375, 0.00034332275390625, 0.014892578125, -0.024658203125, 0.006683349609375, -0.02880859375, -0.003692626953125, -0.00165557861328125, 0.00323486328125, -0.010009765625...

[ 11249, 831, 70163, 9384, 136, 28412, 23, 502, 4867, 48325, 54529, 6652, 16820, 48339, 26008, 647, 19929, 190, 74918, 7, 138, 20028, 103332, 56566, 71924, 145581, 1884, 27781 ]

[ 0.056884765625, 0.0941162109375, 0.2178955078125, 0.2188720703125, 0.042083740234375, 0.203369140625, 0.052764892578125, 0.182861328125, 0.2386474609375, 0.2196044921875, 0.21044921875, 0.08819580078125, 0.156494140625, 0.1680908203125, 0.1182861328125, 0.049560546875, 0.170043945312...

embed

13150916_c0

13150916

prolog

0

Title: How to add to end of list in prolog Problem title: How to add to end of list in prolog Tags: prolog Problem: How to add to end of list in prolog I am trying to add one item to the end of a list in prolog, but it keeps on failing. insertAtEnd(X,[ ],[X]). insertAtEnd(X,[H|T],[H|Z]) :- insertAtEnd(X,T,Z). letters([...

How to add to end of list in prolog How to add to end of list in prolog prolog How Stored How to add to end of list in prolog I am trying to add one item to the end of a list in prolog, but it keeps on failing. I do not understand why this below does not work. I am also attempting to store this list in the variable Sto...

[ 0.0194091796875, 0.00701904296875, 0.00823974609375, 0.0162353515625, -0.01409912109375, 0.0291748046875, -0.0245361328125, 0.00396728515625, -0.003662109375, -0.033447265625, 0.031982421875, -0.0216064453125, -0.0052490234375, -0.01312255859375, 0.0038604736328125, 0.01080322265625, ...

[ 11249, 15190, 47, 3564, 111, 5303, 502, 4867, 23, 14934, 71, 31577, 1632, 35735, 13695, 35782, 214, 35064, 959, 4488, 4343, 77336, 87420 ]

[ 0.04681396484375, 0.1751708984375, 0.1588134765625, 0.1947021484375, 0.18212890625, 0.181396484375, 0.154541015625, 0.2188720703125, 0.01702880859375, 0.1319580078125, 0.07135009765625, 0.006256103515625, 0.046417236328125, 0.136474609375, 0.032562255859375, 0.1168212890625, 0.019821...

embed

74128859_c0

74128859

prolog

0

Title: Prolog write the is_progression predicate to check that the sequence of elements of a numerical list is a geometric progression Problem title: Prolog write the is_progression predicate to check that the sequence of elements of a numerical list is a geometric progression Tags: prolog Problem: Prolog write the is_...

Prolog write the is_progression predicate to check that the sequence of elements of a numerical list is a geometric progression Prolog write the is_progression predicate to check that the sequence of elements of a numerical list is a geometric progression prolog Prolog is_progression Prolog write the is_progression pre...

[ -0.00177001953125, 0.01190185546875, -0.0089111328125, 0.013916015625, -0.01513671875, 0.02685546875, -0.0074462890625, 0.00518798828125, 0.005706787109375, 0.00848388671875, 0.00482177734375, 0.01080322265625, -0.01141357421875, -0.002777099609375, -0.02587890625, 0.008544921875, 0....

[ 1250, 4867, 33022, 83, 454, 3454, 148448, 1653, 2063, 67, 12765, 450, 40, 944, 3956, 80854, 54744, 6827, 5303, 10, 84183, 238, 187735, 70, 502 ]

[ 0.1507568359375, 0.2421875, 0.0838623046875, 0.19091796875, 0.053253173828125, 0.1546630859375, 0.2763671875, 0.1859130859375, 0.193603515625, 0.10418701171875, 0.177978515625, 0.03656005859375, 0.0531005859375, 0.138671875, 0.00897216796875, 0.1544189453125, 0.1219482421875, 0.033...

embed

46129129_c0

46129129

prolog

0

Title: What are the conditions of the query in order to be True? Problem title: What are the conditions of the query in order to be True? Tags: prolog Problem: What are the conditions of the query in order to be True? I'm new to Prolog and trying to figure out how it works. So could anyone help me with the following co...

What are the conditions of the query in order to be True? What are the conditions of the query in order to be True? prolog What What are the conditions of the query in order to be True? I'm new to Prolog and trying to figure out how it works. So could anyone help me with the following code: So when would Prolog return ...

[ 0.01251220703125, 0.0152587890625, -0.015625, 0.00506591796875, -0.00897216796875, 0.0118408203125, 0.0101318359375, 0.01251220703125, -0.00058746337890625, -0.0000896453857421875, 0.01263427734375, -0.0196533203125, -0.0213623046875, 0.01318359375, -0.0257568359375, 0.025390625, 0.0...

[ 4865, 621, 70, 27289, 111, 41, 1294, 23, 12989, 47, 186, 87599, 502, 4867, 3525, 1250, 26366, 43240, 4358, 18151, 3229, 2806, 30646, 618, 882, 13, 2174, 25632, 9384, 705, 9, 2367, 164, 100231, 132, 1542, 28007, 12921, 107730, 4734, 1193...

[ 0.10601806640625, 0.06768798828125, 0.07550048828125, 0.263427734375, 0.1112060546875, 0.2047119140625, 0.2064208984375, 0.010589599609375, 0.175537109375, 0.0911865234375, 0.1202392578125, 0.26123046875, 0.15185546875, 0.2763671875, 0.004608154296875, 0.1915283203125, 0.000732421875...

embed

47453963_c0

47453963

prolog

0

Title: Prolog, about how to form better clauses Problem title: Prolog, about how to form better clauses Tags: prolog, prolog-dif, prolog-cut, logical-purity Problem: Prolog, about how to form better clauses I have following clauses: num_parent(adam, X) :- !, X = 0. num_parent(eve, X) :- !, X = 0. num_parent(X, 2). When...

Prolog, about how to form better clauses Prolog, about how to form better clauses prolog prolog-dif prolog-cut logical-purity Prolog num_parent Prolog, about how to form better clauses I have following clauses: When I typed the query: It only returns: which is what I want. But when I typed this query: it only returns: ...

[ -0.000453948974609375, 0.033203125, 0.0128173828125, 0.0059814453125, -0.0174560546875, 0.0167236328125, -0.004486083984375, -0.0002307891845703125, 0.0225830078125, -0.032470703125, 0.005828857421875, -0.01251220703125, 0.004486083984375, 0.009765625, 0.01953125, 0.0059814453125, 0....

[ 1250, 4867, 3173, 11522, 70731, 502, 428, 420, 19774, 62775, 289, 4717, 2481, 13269, 99547, 90, 25632, 10644, 41, 1294, 4734, 30646, 3129, 2367, 87, 3444, 903, 7, 3642, 2811, 40383, 3249 ]

[ 0.1263427734375, 0.2137451171875, 0.137939453125, 0.1326904296875, 0.2017822265625, 0.123291015625, 0.043243408203125, 0.091064453125, 0.12646484375, 0.103759765625, 0.013671875, 0.1083984375, 0.0064697265625, 0.1051025390625, 0.15283203125, 0.10479736328125, 0.032257080078125, 0.1...

embed

7655998_c1

7655998

prolog

1

x + 3*Bg^width/7, Tri^y3 #= Bg^y + Bg^height/2, cgStar(Star), Star^n #=5, Star^color #= white, Star^centerX #= Bg^x + Bg^width/7, Star^centerY #= Bg^centerY, Star^diameter #= Bg^height/4, Os=[Bg,W1,W2,Tri,Star,Frame]. Whenever i try to run, i get this error? Type 'help' for usage. | ?- cl('cuba.pl'). Compiling::cuba.pl...

[ 0.0291748046875, 0.0101318359375, -0.0030517578125, 0.01446533203125, -0.0135498046875, 0.01190185546875, 0.007354736328125, -0.00860595703125, 0.0194091796875, -0.02734375, -0.01318359375, -0.000835418701171875, -0.0020904541015625, -0.0186767578125, 0.004730224609375, 0.0022277832031...

[ 1022, 997, 138, 1639, 146984, 32359, 4699, 8353, 53, 363, 1369, 1106, 22553, 12477, 177, 44072, 4612, 114997, 46133, 35011, 30090, 1542, 425, 4, 1723, 29089, 17357, 2027, 74257, 108386, 14847, 30441, 17, 9790, 11675, 2046, 903, 18499, 60457...

[ 0.08984375, 0.2193603515625, 0.171875, 0.074462890625, 0.17041015625, 0.07916259765625, 0.158935546875, 0.026824951171875, 0.07330322265625, 0.12255859375, 0.008544921875, 0.01416015625, 0.0546875, 0.0236358642578125, 0.0706787109375, 0.1968994140625, 0.128173828125, 0.079772949218...

embed

70818218_c0

70818218

prolog

0

Title: List_subset_of_list predicate with choice points? Problem title: List_subset_of_list predicate with choice points? Tags: prolog Problem: List_subset_of_list predicate with choice points? So here's my subset predicate: subset([],[_|_]). subset([X|Ts],L) :- member(X,L), subset(Ts,L). Here's the problem I get: ?- s...

List_subset_of_list predicate with choice points? List_subset_of_list predicate with choice points? prolog List_subset_of_list List_subset_of_list predicate with choice points? So here's my subset predicate: Here's the problem I get: Why did prolog keep looking for a solution when it'd already found one? I tried adding...

[ 0.0042724609375, 0.01434326171875, 0.0289306640625, -0.00021648406982421875, -0.0260009765625, -0.00445556640625, -0.001678466796875, 0.01202392578125, 0.0198974609375, -0.0003299713134765625, -0.00787353515625, 0.004608154296875, 0.00186920166015625, 0.00045013427734375, -0.002151489257...

[ 32036, 22144, 3509, 4390, 6562, 1653, 2063, 67, 678, 44126, 26847, 502, 4867, 3688, 759, 1614, 2967, 44084, 13695, 16487, 100, 10, 29806, 3229, 71, 21771, 14037, 1632, 37842, 154107, 59226, 12912, 5117, 70731, 13, 4527, 9384, 18499, 108975 ...

[ 0.1798095703125, 0.196044921875, 0.2276611328125, 0.159423828125, 0.1854248046875, 0.1627197265625, 0.1993408203125, 0.0633544921875, 0.091064453125, 0.1759033203125, 0.1871337890625, 0.140380859375, 0.1954345703125, 0.0008544921875, 0.00128173828125, 0.1849365234375, 0.0885009765625...

embed

47079149_c1

47079149

prolog

1

return a new Matrix with the newValue on the Cell of the Row. Example: I want to set my row nº1 and cell nº 4 to the value: [1,2,3]. So the output matrix will be: [ [[-1], [-1], [-1], [1,2,3], [-1], [-1], [-1]], [[-1], [0], [1], [0], [2], [-1]], [[3], [4], [3], [1], [1], [2], [3]], [[1], [5], [4], [2], [4], [3]], [[2]...

[ -0.025390625, 0.0034332275390625, 0.01312255859375, 0.03173828125, 0.0031585693359375, -0.010498046875, -0.023681640625, 0.0155029296875, 0.0027618408203125, 0.038330078125, -0.018798828125, -0.0023345947265625, 0.00054931640625, 0.0115966796875, -0.0203857421875, -0.0164794921875, 0...

[ 30646, 3525, 194234, 678, 856, 50770, 98, 80743, 111, 96190, 89536, 8705, 3444, 5423, 759, 15555, 110, 418, 136, 38750, 201, 47, 34292, 155761, 140992, 50944, 425, 9, 76172, 4, 5759, 59535, 83914, 147352, 2389, 55300, 91995, 7, 5303, 2886...

[ 0.2210693359375, 0.197509765625, 0.30859375, 0.054351806640625, 0.1715087890625, 0.2188720703125, 0.0098876953125, 0.177490234375, 0.050994873046875, 0.189697265625, 0.0843505859375, 0.0195465087890625, 0.11181640625, 0.1754150390625, 0.000396728515625, 0.206298828125, 0.09619140625,...

embed

47618576_c1

47618576

prolog

1

:- parts of the getConspirators predicate. They look almost the same! Now, I do know that the " _ " symbol means "literally any value" (AKA Prolog doesn't care about what value it is). But how does Prolog know which case to pick when running through the code? My theory is that Prolog runs the getConspirators( [_|T], C...

[ 0.0031280517578125, -0.0033111572265625, -0.010498046875, 0.005767822265625, -0.0228271484375, -0.00982666015625, 0.0177001953125, -0.0123291015625, 0.0133056640625, -0.017822265625, 0.0101318359375, 0.01422119140625, -0.01458740234375, 0.0098876953125, 0.00494384765625, -0.00885009765...

[ 15772, 63920, 2046, 11935, 54547, 22230, 1653, 2063, 67, 6713, 39555, 5701, 101, 26582, 26950, 39798, 2499, 34292, 1250, 4867, 18, 517, 3714, 7225, 39580, 51042, 8305, 18151, 154453, 127877, 454, 58745, 618, 313, 9624, 136, 2174, 35782, 653...

[ 0.0760498046875, 0.03546142578125, 0.135986328125, 0.090087890625, 0.26806640625, 0.1658935546875, 0.09161376953125, 0.1165771484375, 0.00689697265625, 0.0897216796875, 0.029052734375, 0.05517578125, 0.1534423828125, 0.1959228515625, 0.06768798828125, 0.051300048828125, 0.08740234375...

embed

49677559_c0

49677559

prolog

0

Title: why does bubblesort([8,7,6,5,4,3,2,1],L). return unsorted list? Problem title: why does bubblesort([8,7,6,5,4,3,2,1],L). return unsorted list? Tags: prolog Problem: why does bubblesort([8,7,6,5,4,3,2,1],L). return unsorted list? bubblesort(inputList, SortList) :- swap(inputList, List), !, printlist(List), bubble...

why does bubblesort([8,7,6,5,4,3,2,1],L). return unsorted list? why does bubblesort([8,7,6,5,4,3,2,1],L). return unsorted list? prolog SortList List List1 Head why does bubblesort([8,7,6,5,4,3,2,1],L). return unsorted list?

[ 0.0135498046875, 0.027587890625, 0.01300048828125, -0.00543212890625, -0.03564453125, -0.010986328125, -0.01190185546875, -0.0084228515625, -0.0172119140625, 0.021484375, 0.0233154296875, 0.0191650390625, -0.009033203125, -0.00592041015625, -0.00543212890625, 0.00102996826171875, 0.0...

[ 15400, 14602, 373, 73163, 62351, 186922, 129678, 617, 363, 304, 76172, 866, 30646, 51, 297, 5303, 502, 4867, 53666, 154663, 32036, 418, 44816, 1065, 194 ]

[ 0.10552978515625, 0.040618896484375, 0.109130859375, 0.2115478515625, 0.2568359375, 0.258544921875, 0.243896484375, 0.1453857421875, 0.137939453125, 0.041748046875, 0.0054931640625, 0.0966796875, 0.1358642578125, 0.103271484375, 0.058349609375, 0.157958984375, 0.07037353515625, 0.1...

embed

22348899_c0

22348899

prolog

0

Title: Using append in Prolog Problem title: Using append in Prolog Tags: append, prolog Problem: Using append in Prolog I am very new to Prolog and I am experimenting using 'append'. I am trying to write a very simple program that takes the first item of a list, and add's it to an empty list L. Would someone please ex...

Using append in Prolog Using append in Prolog append prolog Using Prolog add_first Using append in Prolog I am very new to Prolog and I am experimenting using 'append'. I am trying to write a very simple program that takes the first item of a list, and add's it to an empty list L. Would someone please explain to me why...

[ 0.01129150390625, 0.00072479248046875, 0.00714111328125, 0.01025390625, -0.006927490234375, 0.0000782012939453125, -0.006622314453125, 0.009765625, 0.022216796875, -0.056640625, 0.03076171875, -0.00118255615234375, -0.012451171875, 0.005523681640625, 0.0255126953125, -0.00982666015625,...

[ 345, 114689, 71, 1250, 4867, 502, 15190, 13448, 271, 23, 3525, 28007, 9007, 3611, 31577, 33022, 8781, 1528, 51776, 5117, 35735, 5303, 201505, 339, 73342, 15400, 23742, 18, 4488, 44084, 18151, 22027 ]

[ 0.052978515625, 0.2171630859375, 0.1973876953125, 0.1505126953125, 0.25, 0.10430908203125, 0.1429443359375, 0.10400390625, 0.06793212890625, 0.00994873046875, 0.024078369140625, 0.1051025390625, 0.111328125, 0.1865234375, 0.05426025390625, 0.041107177734375, 0.0806884765625, 0.1235...

embed

36559441_c0

36559441

prolog

0

Title: How can I assert facts about all List members in Prolog? Problem title: How can I assert facts about all List members in Prolog? Tags: prolog Problem: How can I assert facts about all List members in Prolog? I'd like to assert facts about all members of a List in prolog, and have any resulting unification retain...

How can I assert facts about all List members in Prolog? How can I assert facts about all List members in Prolog? prolog How List Prolog _h27057686 _h27057704 _h27057722 How can I assert facts about all List members in Prolog? I'd like to assert facts about all members of a List in prolog, and have any resulting unific...

[ 0.01348876953125, -0.004547119140625, 0.004974365234375, 0.0023193359375, -0.0185546875, -0.01708984375, 0.01220703125, 0.01531982421875, 0.0126953125, 0.00311279296875, 0.0235595703125, 0.0159912109375, 0.0133056640625, 0.0152587890625, -0.0021820068359375, 0.01214599609375, 0.00720...

[ 11249, 831, 237, 33657, 15824, 7, 1672, 756, 32036, 43032, 1250, 4867, 502, 178475, 7709, 87, 23, 1884, 51, 41274, 27781, 12638, 5303, 32786, 105950, 43606, 64549, 3917, 19064, 41, 1294, 114997, 990, 567 ]

[ 0.057586669921875, 0.054901123046875, 0.0980224609375, 0.2147216796875, 0.2000732421875, 0.1181640625, 0.0863037109375, 0.107421875, 0.2137451171875, 0.212158203125, 0.17138671875, 0.25390625, 0.1322021484375, 0.006561279296875, 0.039581298828125, 0.013702392578125, 0.055511474609375...

embed

23464932_c0

23464932

prolog

0

Title: Prolog: McCarthy 91 Problem title: Prolog: McCarthy 91 Tags: prolog Problem: Prolog: McCarthy 91 I'm learning about recursion and came across the McCarthy 91 function . I've been able to find examples of it in several languages (C++, Java, Python, Scheme, and so on). I'm trying to find out how it would be writte...

Prolog: McCarthy 91 Prolog: McCarthy 91 prolog Prolog McCarthy Prolog: McCarthy 91 I'm learning about recursion and came across the McCarthy 91 function . I've been able to find examples of it in several languages (C++, Java, Python, Scheme, and so on). I'm trying to find out how it would be written in Prolog though. I...

[ 0.01708984375, -0.00469970703125, 0.00982666015625, 0.0302734375, 0.0098876953125, 0.012939453125, -0.0031280517578125, 0.01531982421875, 0.006988525390625, -0.051513671875, -0.01025390625, -0.0011138916015625, -0.031494140625, -0.0023345947265625, 0.0224609375, 0.0029449462890625, 0...

[ 1250, 4867, 12, 85283, 147, 29178, 20031, 502, 52080, 1672, 195625, 1830, 36880, 32354, 7413, 27781, 111, 442, 40368, 46876, 441, 37223, 41925, 145581, 34702, 31577, 3642, 2806, 59121, 23, 1118, 6528, 33022, 35978, 73, 18151, 31344, 4358 ]

[ 0.20361328125, 0.273193359375, 0.02978515625, 0.1365966796875, 0.1732177734375, 0.262939453125, 0.30615234375, 0.1519775390625, 0.06072998046875, 0.0023193359375, 0.279052734375, 0.175048828125, 0.06475830078125, 0.212158203125, 0.009307861328125, 0.1827392578125, 0.030120849609375, ...

embed

15011417_c0

15011417

prolog

0

Title: How to run prolog on swipl and return all the traces in one go Problem title: How to run prolog on swipl and return all the traces in one go Tags: swi-prolog, prolog Problem: How to run prolog on swipl and return all the traces in one go 1: If one query ie. a(X). returns multiple answers, how can I let the progr...

How to run prolog on swipl and return all the traces in one go How to run prolog on swipl and return all the traces in one go swi-prolog prolog How foo.pl How to run prolog on swipl and return all the traces in one go 1: If one query ie. a(X). returns multiple answers, how can I let the program return all the answers a...

[ 0.0179443359375, 0.0030364990234375, -0.007476806640625, 0.00982666015625, -0.017822265625, 0.005035400390625, -0.00176239013671875, -0.00360107421875, 0.011474609375, -0.0673828125, 0.0189208984375, -0.00010919570922851562, -0.0216064453125, 0.004058837890625, 0.0069580078125, 0.00218...

[ 11249, 11675, 502, 4867, 98, 91, 2452, 2424, 30646, 756, 144851, 23, 1632, 738, 3454, 5775, 31, 47, 136, 70, 41, 10, 1542, 48716, 35166, 3642, 1528, 1809, 2589, 28412, 72367, 11435, 375, 669 ]

[ 0.052032470703125, 0.171142578125, 0.193115234375, 0.27392578125, 0.0762939453125, 0.043212890625, 0.19384765625, 0.2254638671875, 0.1839599609375, 0.0875244140625, 0.2061767578125, 0.057464599609375, 0.07562255859375, 0.1241455078125, 0.1295166015625, 0.03704833984375, 0.03729248046...

embed

50182365_c0

50182365

prolog

0

Title: Create lists of permutations of size N from elements of another list Problem title: Create lists of permutations of size N from elements of another list Tags: list, prolog, permutation Problem: Create lists of permutations of size N from elements of another list How do I, given a List = [(1,1),(1,2),(1,3),(1,4)]...

Create lists of permutations of size N from elements of another list Create lists of permutations of size N from elements of another list list prolog permutation elements Create ListOut Create lists of permutations of size N from elements of another list How do I, given a List = [(1,1),(1,2),(1,3),(1,4)], N = 2, create...

[ 0.0123291015625, 0.0037841796875, 0.0079345703125, 0.00775146484375, -0.00390625, 0.0220947265625, -0.01263427734375, -0.004791259765625, 0.0208740234375, -0.0228271484375, 0.00244140625, -0.004791259765625, 0.017822265625, 0.00677490234375, -0.02734375, 0.0174560546875, 0.0185546875...

[ 151313, 5303, 7, 117, 14311, 21094, 13267, 541, 1295, 80854, 15700, 502, 4867, 561, 22062, 32036, 79858, 54, 87, 34475, 2203, 41600, 17727, 133063, 21320, 163324, 116, 28282, 10, 70541, 214, 48716, 12989, 297, 111, 304, 154663, 24610 ]

[ 0.1834716796875, 0.258056640625, 0.03228759765625, 0.147216796875, 0.246337890625, 0.12841796875, 0.1405029296875, 0.149658203125, 0.0843505859375, 0.1629638671875, 0.08203125, 0.123779296875, 0.1922607421875, 0.194091796875, 0.0312042236328125, 0.2335205078125, 0.255859375, 0.0446...

embed

22139198_c0

22139198

prolog

0

Title: How to sort a list without using predefined prolog functions? Problem title: How to sort a list without using predefined prolog functions? Tags: prolog Problem: How to sort a list without using predefined prolog functions? I'm new to prolog programing. I have gone through several sample answers, but couldn't fin...

How to sort a list without using predefined prolog functions? How to sort a list without using predefined prolog functions? prolog predefined How How to sort a list without using predefined prolog functions? I'm new to prolog programing. I have gone through several sample answers, but couldn't find solution to my probl...

[ 0.002685546875, 0.0147705078125, 0.0040283203125, -0.00543212890625, -0.0179443359375, 0.0024566650390625, -0.018798828125, 0.007171630859375, -0.0098876953125, -0.03173828125, 0.004364013671875, 0.0036773681640625, -0.029296875, -0.008544921875, 0.00909423828125, 0.0000805854797363281...

[ 11249, 47, 12096, 5303, 15490, 17368, 1653, 13, 5983, 502, 4867, 32354, 10, 3525, 1528, 29806, 2967, 70541, 9351, 136, 32070, 6763, 121763, 66159, 1112, 18548, 85520, 36663, 678, 118055, 12989, 3917 ]

[ 0.05596923828125, 0.0209503173828125, 0.2271728515625, 0.1983642578125, 0.13330078125, 0.059051513671875, 0.09814453125, 0.0670166015625, 0.1712646484375, 0.110595703125, 0.1993408203125, 0.1297607421875, 0.00390625, 0.011322021484375, 0.07177734375, 0.03961181640625, 0.03955078125, ...

embed

59685831_c0

59685831

prolog

0

Title: Does SLD tree exist if the query is invalid in Prolog? Problem title: Does SLD tree exist if the query is invalid in Prolog? Tags: prolog Problem: Does SLD tree exist if the query is invalid in Prolog? Considering the following Prolog program : reverse_bits([1], [0]). reverse_bits([0], [1]). reverse_bits([H|T], ...

Does SLD tree exist if the query is invalid in Prolog? Does SLD tree exist if the query is invalid in Prolog? prolog Does SLD Prolog reverse_bits Input Does SLD tree exist if the query is invalid in Prolog? Considering the following Prolog program : What's the SLD tree for the question above ? It's not valid so does it...

[ 0.0177001953125, 0.043701171875, -0.005126953125, 0.0211181640625, -0.0164794921875, 0.0201416015625, -0.0162353515625, -0.0067138671875, -0.017822265625, -0.0089111328125, 0.004974365234375, 0.004302978515625, 0.000858306884765625, -0.0084228515625, 0.0189208984375, -0.002105712890625...

[ 101790, 159, 30693, 53201, 32316, 2174, 41, 1294, 83, 56649, 1250, 4867, 502, 39531, 184, 3137, 360, 7077, 23, 1528, 959, 35604 ]

[ 0.0231781005859375, 0.091064453125, 0.2413330078125, 0.246826171875, 0.1712646484375, 0.057708740234375, 0.09521484375, 0.091796875, 0.038848876953125, 0.221435546875, 0.135009765625, 0.2127685546875, 0.0721435546875, 0.156494140625, 0.08453369140625, 0.118896484375, 0.03988647460937...

embed

65586928_c0

65586928

prolog

0

Title: Arithmetic puzzle prolog Problem title: Arithmetic puzzle prolog Tags: prolog Problem: Arithmetic puzzle prolog I have to put + and - between the numbers in that list to get the provided number. For example something like 12-34 = -22. I have done it like this: arit(L, Ls, S) :- arit(L, Ls, S, 0). arit([], [], R,...

Arithmetic puzzle prolog Arithmetic puzzle prolog prolog Arithmetic Arithmetic puzzle prolog I have to put + and - between the numbers in that list to get the provided number. For example something like 12-34 = -22. I have done it like this: It works, but it has duplicates in answer (like 1+2+3 and +1+2+3). Maybe someo...

[ -0.00225830078125, 0.000675201416015625, -0.01507568359375, -0.00189971923828125, -0.0194091796875, 0.0128173828125, -0.01385498046875, 0.00830078125, -0.00750732421875, -0.0255126953125, -0.001617431640625, 0.0152587890625, 0.0189208984375, 0.0233154296875, -0.000911712646484375, 0.00...

[ 1172, 8962, 282, 9523, 104192, 502, 4867, 87, 765, 47, 3884, 997, 136, 20, 17721, 101935, 450, 5303, 2046, 62952, 14012, 27781, 427, 112208, 2203, 31043, 1884, 43240, 1284, 1556, 171763, 1636, 35166, 5062, 106, 54651, 85398, 57157, 83425, ...

[ 0.0305328369140625, 0.119384765625, 0.02630615234375, 0.080810546875, 0.2130126953125, 0.1895751953125, 0.2176513671875, 0.0167388916015625, 0.0677490234375, 0.017730712890625, 0.088623046875, 0.166259765625, 0.1346435546875, 0.1500244140625, 0.15380859375, 0.156005859375, 0.01835632...

embed

7347682_c0

7347682

prolog

0

Title: swi prolog , matching data Problem title: swi prolog , matching data Tags: prolog Problem: swi prolog , matching data this is my source code , can someone tell me what is error , and wat is the best way to do this , i want to show out who matching who ...can somebody help me ? % Author: % Date: 08-Sep-11 person(...

swi prolog , matching data swi prolog , matching data prolog Author Date Sep-11 match:-person Fage Fatt Mage Matt ERROR Undefined However swi prolog , matching data this is my source code , can someone tell me what is error , and wat is the best way to do this , i want to show out who matching who ...can somebody help ...

[ 0.0159912109375, 0.0235595703125, 0.0228271484375, 0.00494384765625, -0.006378173828125, -0.006561279296875, -0.00555419921875, 0.0228271484375, 0.0032958984375, -0.0177001953125, 0.0059814453125, -0.01318359375, 0.0038299560546875, -0.0067138671875, 0.020263671875, -0.0234375, 0.017...

[ 91, 2452, 502, 4867, 4, 14858, 214, 2053, 61804, 21693, 16675, 30816, 71470, 13, 24967, 18, 5695, 39162, 151206, 24638, 79912, 5983, 903, 31344, 18151, 831, 14192, 2367, 83, 18499, 793, 2965, 3917, 54, 3444, 47, 7639, 1810, 2750, 176256, ...

[ 0.08935546875, 0.25634765625, 0.19677734375, 0.245361328125, 0.0244293212890625, 0.2607421875, 0.186767578125, 0.19921875, 0.05364990234375, 0.00604248046875, 0.008544921875, 0.1494140625, 0.162109375, 0.1474609375, 0.2255859375, 0.107666015625, 0.1185302734375, 0.210205078125, 0...

embed

15031203_c1

15031203

prolog

1

1,Q2)) :- p(XY, Q1), p(XY, Q2). pp((X, Y), opposite, (Q1, Q2)) :- p((X, Y), Q1), p((Y, X), Q2). pareto(PP->R) :- \+ (pp(XY, agree, PP), \+ p(XY, R)). dictator(J, F) :- member(J:PP, [1:(P, _), 2:(_, P)]), \+ (member(PP->R, F), pp(_, opposite, (P, R))). agree(+, XY, QQ) :- pp(XY, agree, QQ). agree(-,(X,Y), QQ) :- pp((Y, ...

[ -0.01287841796875, -0.01263427734375, 0.0034332275390625, -0.0101318359375, -0.015869140625, -0.01483154296875, 0.0283203125, 0.0064697265625, 0.00592041015625, 0.00701904296875, -0.017822265625, 0.01458740234375, -0.004486083984375, -0.00139617919921875, 0.00347900390625, -0.007720947...

[ 106, 4, 2737, 10461, 16, 15772, 915, 143907, 2396, 17727, 32261, 132, 1542, 990, 198274, 418, 1723, 1193, 4787, 188, 17487, 103607, 1052, 1328, 6366, 53520, 12211, 627, 28214, 1290, 1375, 563, 32786, 12, 15573, 436, 39, 27417, 683, 66286,...

[ 0.058441162109375, 0.0379638671875, 0.14453125, 0.2103271484375, 0.0045166015625, 0.09649658203125, 0.1270751953125, 0.1759033203125, 0.131591796875, 0.08148193359375, 0.2083740234375, 0.0306396484375, 0.1136474609375, 0.1527099609375, 0.21875, 0.08599853515625, 0.21337890625, 0.17...

embed

59379917_c1

59379917

prolog

1

program files (x86)/XSB/syslib/standard.xwam ... standard:catch/3 From c:/program files (x86)/XSB/syslib/standard.xwam AFAIK this error is usually when theres a prblem with a user defined predicate but this is a standard function and the documentation says it auto-imports so why am I getting this error? Code signals: E...

[ 0.035888671875, 0.03076171875, -0.00286865234375, 0.0025634765625, -0.0247802734375, 0.031982421875, 0.0186767578125, 0.0106201171875, 0.0004425048828125, -0.059326171875, -0.013671875, 0.00011777877807617188, -0.0089111328125, -0.029052734375, 0.0181884765625, -0.0037994384765625, -...

[ 1528, 102158, 112916, 1542, 36474, 94924, 5612, 66589, 425, 634, 39, 5570, 4460, 206, 18113, 28090, 12, 18749, 18499, 56104, 2661, 38937, 61924, 1653, 2063, 32354, 209806, 1809, 60270, 15400, 903, 28864, 26073, 151206, 24638, 1193, 6032, 1226...

[ 0.14111328125, 0.1556396484375, 0.22119140625, 0.0751953125, 0.232421875, 0.0997314453125, 0.240478515625, 0.2322998046875, 0.050933837890625, 0.1827392578125, 0.1651611328125, 0.2213134765625, 0.1724853515625, 0.162841796875, 0.227783203125, 0.011962890625, 0.021087646484375, 0.14...

embed

44995631_c0

44995631

prolog

0

Title: prolog logic and cut Problem title: prolog logic and cut Tags: prolog-cut, prolog Problem: prolog logic and cut I have a some problem understaing the flow of prolog. here is the code: h(X):- 1 is X mod 2, write(X), nl, 0 is X mod 3, !, fail. h(_). t(_,[],0). t(M,[_|LS],1):-member(M,LS),write('member'), nl,fail. ...

prolog logic and cut prolog logic and cut prolog-cut prolog prolog logic and cut I have a some problem understaing the flow of prolog. here is the code: now I am runing 3 things: 1. r([3,7,9],R). 2. r([5,11,13],R). 3. r([2,3,5],R). and I cant understand the answers I get. the answers are: 1. 3 false. 2. 5 11 false. 3. ...

[ 0.0157470703125, 0.0179443359375, 0.0159912109375, -0.00121307373046875, 0.000354766845703125, 0.00128936767578125, -0.005645751953125, 0.01043701171875, 0.01202392578125, -0.01470947265625, 0.000514984130859375, -0.0031585693359375, 0.01116943359375, -0.0050048828125, 0.0220947265625, ...

[ 502, 4867, 62775, 136, 59226, 19774, 87, 765, 2967, 1379, 590, 70, 86608, 111, 3688, 18151, 5036, 3114, 592, 138, 8966, 12, 615, 1690, 132, 363, 166590, 1052, 194, 787, 758, 1662, 2681, 1031, 304, 92714, 45767, 28219, 35166, 2046, 98320...

[ 0.17724609375, 0.244384765625, 0.23046875, 0.056396484375, 0.1915283203125, 0.1759033203125, 0.02545166015625, 0.030059814453125, 0.107666015625, 0.06890869140625, 0.103759765625, 0.012298583984375, 0.2286376953125, 0.0426025390625, 0.0159454345703125, 0.1802978515625, 0.032592773437...

embed

25972392_c0

25972392

prolog

0

Title: Calculating whether number is prime in Prolog Problem title: Calculating whether number is prime in Prolog Tags: primality-test, prolog, primes Problem: Calculating whether number is prime in Prolog I am trying to calculate if the input is a prime number but something goes wrong... here's my code: primeNumber(X)...

Calculating whether number is prime in Prolog Calculating whether number is prime in Prolog primality-test prolog primes Calculating Prolog prime_prime Next Calculating whether number is prime in Prolog I am trying to calculate if the input is a prime number but something goes wrong... here's my code: It gives me false...

[ -0.01177978515625, 0.005615234375, 0.0228271484375, 0.0177001953125, 0.00531005859375, 0.001129150390625, 0.0087890625, -0.019287109375, 0.0031280517578125, -0.005096435546875, -0.003875732421875, -0.00421142578125, -0.01397705078125, 0.00408935546875, 0.006500244140625, 0.002151489257...

[ 212467, 26518, 36766, 14012, 83, 20809, 23, 1250, 4867, 29810, 134393, 6954, 502, 114654, 4997, 31577, 74481, 2174, 107730, 10, 44691, 18151, 163, 98320, 11907, 1733, 29786, 20594 ]

[ 0.1514892578125, 0.068603515625, 0.1318359375, 0.16845703125, 0.10498046875, 0.223876953125, 0.06658935546875, 0.1519775390625, 0.2281494140625, 0.09844970703125, 0.0634765625, 0.09716796875, 0.0977783203125, 0.175537109375, 0.03240966796875, 0.03692626953125, 0.1348876953125, 0.05...

embed

38688356_c2

38688356

prolog

2

count how many Bitter fruits the person ate and so are the others. (T = sweet -> TcounterSweet is +1 ; ), (T = sweet -> TcounterCitric is +1 ; ). %. (TcounterBitter => 3 -> recomend_fruits(P, _,T, _) ; ). %supposed to when one of the counters gets 3 or more (if one person ate more the 3 bitters, sweet or citric fruits...

[ 0.013671875, 0.013427734375, -0.0130615234375, 0.0233154296875, -0.01177978515625, -0.006561279296875, 0.01092529296875, 0.016845703125, 0.0223388671875, 0.004638671875, -0.024658203125, -0.0115966796875, 0.0157470703125, 0.020751953125, 0.0230712890625, -0.0308837890625, 0.020629882...

[ 54529, 3642, 5941, 40787, 42, 93151, 3445, 10, 67, 27060, 618, 53673, 384, 71013, 56, 1177, 126, 83, 57157, 40658, 62233, 69130, 16882, 3055, 138, 33844, 25965, 23129, 14481, 683, 3229, 105416, 62163, 707, 1286, 1632, 114309, 1059, 247, 2...

[ 0.2293701171875, 0.06280517578125, 0.11767578125, 0.246826171875, 0.177978515625, 0.2509765625, 0.121337890625, 0.093994140625, 0.08447265625, 0.0645751953125, 0.07379150390625, 0.1807861328125, 0.046478271484375, 0.1815185546875, 0.05670166015625, 0.106689453125, 0.1158447265625, ...

embed

43723424_c0

43723424

prolog

0

Title: Prolog unpacking lists predicate Problem title: Prolog unpacking lists predicate Tags: prolog Problem: Prolog unpacking lists predicate I tried to create something what would work like this: ?- unpacking([[1], [1,2], [3]], Lst1, NewLst). NewLst=[1,3] I wrote it like this: unpacking([], Lst1, Lst1). unpacking([[H...

Prolog unpacking lists predicate Prolog unpacking lists predicate prolog Prolog Lst1 NewLst Lst2 Prolog unpacking lists predicate I tried to create something what would work like this: I wrote it like this: and I know that I am doing something wrong. I am starting in Prolog so, need to learn from my mistakes :)

[ -0.0031890869140625, 0.0106201171875, 0.000014781951904296875, 0.000060558319091796875, -0.008544921875, 0.027587890625, -0.0037078857421875, 0.00836181640625, 0.00689697265625, -0.0213623046875, 0.0087890625, -0.01507568359375, 0.0042724609375, 0.0087890625, -0.01483154296875, 0.01989...

[ 1250, 4867, 51, 29102, 214, 5303, 1653, 2063, 67, 502, 339, 271, 418, 2356, 866, 304, 37842, 28282, 4488, 1884, 903, 54397, 442, 3714, 444, 20594, 9844, 44691, 72134, 3871, 30698, 121742 ]

[ 0.1966552734375, 0.275146484375, 0.1246337890625, 0.236328125, 0.05426025390625, 0.2125244140625, 0.18359375, 0.2333984375, 0.03411865234375, 0.1513671875, 0.07135009765625, 0.1229248046875, 0.0927734375, 0.10430908203125, 0.048126220703125, 0.0968017578125, 0.0849609375, 0.0856933...

embed

43849424_c0

43849424

prolog

0

Title: Create Fibonacci Sequence in Prolog with 1 Parameter Problem title: Create Fibonacci Sequence in Prolog with 1 Parameter Tags: fibonacci, prolog Problem: Create Fibonacci Sequence in Prolog with 1 Parameter I am a beginner on prolog and is trying to create fibonacci sequence rules. But it can't run because of er...

Create Fibonacci Sequence in Prolog with 1 Parameter Create Fibonacci Sequence in Prolog with 1 Parameter fibonacci prolog Create Fibonacci Sequence Prolog Parameter N-1 N-2 Create Fibonacci Sequence in Prolog with 1 Parameter I am a beginner on prolog and is trying to create fibonacci sequence rules. But it can't run ...

[ 0.029296875, 0.015380859375, -0.0238037109375, 0.00762939453125, -0.001800537109375, -0.002349853515625, 0.014892578125, 0.01068115234375, 0.0035858154296875, -0.0211181640625, -0.00360107421875, -0.0240478515625, -0.014892578125, 0.0093994140625, 0.019775390625, 0.000186920166015625, ...

[ 151313, 3698, 20990, 52544, 503, 944, 3956, 23, 1250, 4867, 678, 106, 1720, 29089, 809, 502, 541, 5759, 5428, 1679, 31577, 28282, 40, 91736, 831, 18, 11675, 18499, 18151, 8962, 282, 9523, 275, 83, 959, 10, 32354, 77641, 4358 ]

[ 0.13916015625, 0.16162109375, 0.181396484375, 0.223876953125, 0.1112060546875, 0.1640625, 0.1097412109375, 0.045135498046875, 0.1641845703125, 0.25244140625, 0.0379638671875, 0.1072998046875, 0.1099853515625, 0.1290283203125, 0.18408203125, 0.1204833984375, 0.04595947265625, 0.1335...

embed

27247642_c0

27247642

prolog

0

Title: Prolog intersection of three lists Problem title: Prolog intersection of three lists Tags: interception, prolog, list Problem: Prolog intersection of three lists please can give some of you advice about interception of three lists in Prolog? I done interception of two lists: prunik([], _, []). prunik([H1|T1], L2...

Prolog intersection of three lists Prolog intersection of three lists interception prolog list Prolog Res Prolog intersection of three lists please can give some of you advice about interception of three lists in Prolog? I done interception of two lists: And it works, when I put this question: I try remake this for thr...

[ -0.007049560546875, 0.007537841796875, 0.005889892578125, 0.007171630859375, -0.005889892578125, 0.01409912109375, -0.00390625, -0.006378173828125, 0.00156402587890625, -0.039306640625, -0.00469970703125, 0.01519775390625, -0.000762939453125, 0.01171875, 0.00823974609375, 0.02001953125...

[ 1250, 4867, 1940, 7, 58994, 17262, 5303, 63928, 502, 9624, 67660, 111, 16940, 6626, 43240, 9655, 9790, 456, 55898, 13319, 3714 ]

[ 0.1534423828125, 0.2235107421875, 0.1622314453125, 0.1361083984375, 0.0772705078125, 0.2138671875, 0.21630859375, 0.195068359375, 0.1041259765625, 0.099609375, 0.096923828125, 0.037384033203125, 0.006805419921875, 0.0750732421875, 0.0843505859375, 0.015533447265625, 0.017044067382812...

embed

40763883_c0

40763883

prolog

0

Title: How to transform a term into a list in Prolog Problem title: How to transform a term into a list in Prolog Tags: parsing, prolog Problem: How to transform a term into a list in Prolog How can i transform a term like: 3 * y * w * t^3 in a list made of: List = [3, *, y,...], without using the following predicate: ...

How to transform a term into a list in Prolog How to transform a term into a list in Prolog parsing prolog How Prolog t2l Term List t2l_ List-X L1-L4 L1-L2 L3-L4 How to transform a term into a list in Prolog How can i transform a term like: 3 * y * w * t^3 in a list made of: List = [3, *, y,...], without using the foll...

[ 0.0218505859375, 0.01226806640625, 0.00130462646484375, -0.0022430419921875, -0.0067138671875, 0.000492095947265625, -0.016357421875, 0.006378173828125, 0.0031280517578125, -0.040771484375, 0.0303955078125, 0.0216064453125, -0.005706787109375, 0.0074462890625, -0.0030059814453125, 0.02...

[ 11249, 47, 27198, 13579, 3934, 10, 5303, 23, 1250, 4867, 366, 6953, 502, 808, 304, 141, 2994, 39, 32036, 1542, 339, 20268, 866, 617, 27495, 831, 17, 1884, 138, 661, 113, 148, 8353, 363, 7228, 111, 2203, 122101, 15490, 17368, 1653, 206...

[ 0.0469970703125, 0.0213470458984375, 0.231689453125, 0.27392578125, 0.125732421875, 0.0928955078125, 0.263671875, 0.038818359375, 0.1885986328125, 0.2626953125, 0.053192138671875, 0.034942626953125, 0.1268310546875, 0.03216552734375, 0.04156494140625, 0.06182861328125, 0.186767578125...

embed

4495977_c0

4495977

prolog

0

Title: Loading files in Prolog Problem title: Loading files in Prolog Tags: prolog Problem: Loading files in Prolog I am going through a Prolog tutorial. It is telling me I can load other prolog files by typing: [filename]. but every time I try this am getting ERROR: load_files/2: Arguments are not sufficiently instant...

Loading files in Prolog Loading files in Prolog prolog Loading Prolog ERROR load_files Arguments KB5 Loading files in Prolog I am going through a Prolog tutorial. It is telling me I can load other prolog files by typing: but every time I try this am getting The file is in the same directory as the one am working in. He...

[ 0.043212890625, 0.0126953125, -0.0010223388671875, 0.01409912109375, -0.0257568359375, 0.004058837890625, 0.0111083984375, 0.0031585693359375, 0.006011962890625, -0.052734375, 0.0137939453125, -0.01904296875, -0.027587890625, -0.00543212890625, -0.00162506103515625, 0.004119873046875, ...

[ 228006, 102158, 1250, 4867, 23, 502, 151206, 24638, 72367, 29822, 112140, 30742, 758, 57143, 831, 3789, 11417, 214, 11907, 1733, 9790, 444, 20949, 11435, 83, 5701, 14364, 237, 20697, 18499, 44691 ]

[ 0.19140625, 0.138916015625, 0.1663818359375, 0.2471923828125, 0.0634765625, 0.1448974609375, 0.115478515625, 0.051849365234375, 0.1651611328125, 0.1534423828125, 0.1956787109375, 0.1083984375, 0.09588623046875, 0.0972900390625, 0.01617431640625, 0.06787109375, 0.1597900390625, 0.09...

embed

13550741_c0

13550741

prolog

0

Title: Recognizing patterns in DCG Problem title: Recognizing patterns in DCG Tags: prolog, list, dcg Problem: Recognizing patterns in DCG I am currently writing a dcg that takes a list of form [0,1]* and tells me if the number of 0 's in the list is 3 greater than the number of 1 's. I can't seem to get the third part...

Recognizing patterns in DCG Recognizing patterns in DCG prolog list dcg Recognizing DCG Count Newcnt Cnt Cnt-1 Recognizing patterns in DCG I am currently writing a dcg that takes a list of form [0,1]* and tells me if the number of 0 's in the list is 3 greater than the number of 1 's. I can't seem to get the third part...

[ 0.005462646484375, 0.0035247802734375, -0.01324462890625, 0.006317138671875, 0.015625, 0.020751953125, -0.0140380859375, -0.0052490234375, 0.027587890625, 0.00189971923828125, -0.0177001953125, -0.03955078125, 0.00592041015625, 0.01519775390625, 0.0032501220703125, -0.00250244140625, ...

[ 853, 115558, 35401, 103510, 23, 391, 56367, 7, 502, 4867, 5303, 104, 238, 177, 108210, 2356, 660, 5759, 82424, 32562, 51776, 3173, 2389, 76172, 14192, 2174, 14012, 757, 242, 138, 117396, 3501, 106, 831, 48903, 50960, 2831, 64, 107838, 448...

[ 0.051544189453125, 0.177001953125, 0.0379638671875, 0.23095703125, 0.040679931640625, 0.1331787109375, 0.2208251953125, 0.0178070068359375, 0.1119384765625, 0.187744140625, 0.1580810546875, 0.081787109375, 0.087646484375, 0.1553955078125, 0.1458740234375, 0.032257080078125, 0.1274414...

embed

65001718_c1

65001718

prolog

1

!. selectedMenu(ID, 4):- admission(ID), !. selectedMenu(ID, 5):- write("Good bye, it was fun assisting you!"), nl, % personDetails(ID, name), write(name), undo. eligibilityCriteria(ID):- write("Elgibility for BE degree....."). applicationProcess(ID):- write("Application Process"). applicationStatus(ID):- write("Applic...

[ 0.00469970703125, 0.0009307861328125, 0.00860595703125, 0.04345703125, -0.0034637451171875, 0.0011444091796875, -0.0240478515625, -0.026123046875, 0.01068115234375, -0.00182342529296875, -0.005523681640625, -0.01300048828125, -0.0101318359375, 0.001708984375, 0.0191650390625, 0.0062561...

[ 711, 133291, 29638, 34, 7146, 13956, 606, 21150, 21162, 33022, 132, 144890, 390, 13, 442, 509, 7477, 30793, 214, 398, 3890, 247, 13169, 1745, 3445, 46741, 9351, 11627, 165, 28, 7883, 83259, 416, 26206, 7623, 735, 9622, 79385, 38415, 26531...

[ 0.07513427734375, 0.185302734375, 0.1768798828125, 0.1368408203125, 0.175048828125, 0.1568603515625, 0.134033203125, 0.178466796875, 0.13671875, 0.1734619140625, 0.001068115234375, 0.138671875, 0.122314453125, 0.0819091796875, 0.1016845703125, 0.139892578125, 0.212890625, 0.2353515...

embed

21336892_c0

21336892

prolog

0

Title: Heuristic Search In Prolog Problem title: Heuristic Search In Prolog Tags: prolog, heuristics Problem: Heuristic Search In Prolog I have solved Bridge and Torch puzzle in Prolog by simple depth first search. Now I am trying to solve it via a heuristic search. But I have no idea how should a heuristic be defined ...

Heuristic Search In Prolog Heuristic Search In Prolog prolog heuristics Heuristic Search Prolog Heuristic Search In Prolog I have solved Bridge and Torch puzzle in Prolog by simple depth first search. Now I am trying to solve it via a heuristic search. But I have no idea how should a heuristic be defined in Prolog. As ...

[ 0.01513671875, 0.0025787353515625, -0.0019073486328125, 0.0203857421875, -0.01116943359375, 0.0003681182861328125, -0.00145721435546875, -0.003448486328125, -0.012939453125, -0.048095703125, 0.01123046875, -0.023193359375, 0.002838134765625, 0.02490234375, 0.00811767578125, -0.00891113...

[ 1529, 474, 48242, 33086, 360, 1250, 4867, 502, 764, 62210, 41637, 86869, 59132, 136, 6653, 206, 104192, 8781, 168867, 5117, 33938, 31577, 1829, 6528, 3642, 5608, 10, 61924, 23, 80234, 27781, 159, 38969, 10752, 1815, 4527, 157318, 5122, 4764...

[ 0.109619140625, 0.2418212890625, 0.25341796875, 0.2362060546875, 0.06341552734375, 0.167724609375, 0.2410888671875, 0.1097412109375, 0.1270751953125, 0.24658203125, 0.1868896484375, 0.1270751953125, 0.170166015625, 0.1126708984375, 0.1343994140625, 0.0740966796875, 0.1826171875, 0....

embed

23712656_c0

23712656

prolog

0

Title: Instantiating L to a list of digits Prolog Problem title: Instantiating L to a list of digits Prolog Tags: prolog, clpfd Problem: Instantiating L to a list of digits Prolog If I have the following database: digit(0). digit(1). digit(2). digit(3). digit(4). digit(5). digit(6). digit(7). digit(8). digit(9). I want...

Instantiating L to a list of digits Prolog Instantiating L to a list of digits Prolog prolog clpfd Instantiating Prolog Instantiating L to a list of digits Prolog If I have the following database: I want the query to succeed by instantiating X and Y to 10*10 = 100 different combinations of digits, how would I go about ...

[ 0.0064697265625, 0.004547119140625, -0.00023937225341796875, 0.000804901123046875, -0.0130615234375, 0.00787353515625, -0.002655029296875, -0.0074462890625, -0.00677490234375, -0.032470703125, -0.0218505859375, -0.0238037109375, -0.0159912109375, 0.00537109375, -0.001220703125, 0.01159...

[ 166945, 14, 26518, 339, 47, 5303, 153939, 1250, 4867, 502, 39557, 71, 25632, 63399, 3444, 41, 1294, 214493, 34648, 1193, 136, 990, 209, 1639, 963, 2203, 805, 12921, 162515, 1672, 903, 3871, 4527, 94418, 77758, 158, 2816, 4288, 129745 ]

[ 0.1568603515625, 0.1470947265625, 0.1220703125, 0.19677734375, 0.140625, 0.1431884765625, 0.2059326171875, 0.1317138671875, 0.21044921875, 0.060150146484375, 0.026641845703125, 0.0760498046875, 0.051605224609375, 0.195556640625, 0.0958251953125, 0.1328125, 0.1099853515625, 0.167358...

embed

20550856_c0

20550856

prolog

0

Title: how to calculate a function in prolog? Problem title: how to calculate a function in prolog? Tags: function, max, prolog Problem: how to calculate a function in prolog? We have to find a function in prolog Q(a,b,n) with a < b and with the following way: Q(a, b, n) = max { k ∈ N | b ^ k - a ^ k < = n} here is the...

how to calculate a function in prolog? how to calculate a function in prolog? function max prolog C-A C1-A how to calculate a function in prolog? We have to find a function in prolog Q(a,b,n) with a < b and with the following way: Q(a, b, n) = max { k ∈ N | b ^ k - a ^ k < = n} here is the my code but it is always givi...

[ 0.007476806640625, -0.00102996826171875, 0.01324462890625, -0.001312255859375, 0.0069580078125, -0.009521484375, 0.0031280517578125, -0.01239013671875, 0.00634765625, -0.032470703125, 0.0107421875, 0.007415771484375, -0.0228271484375, -0.01409912109375, 0.015869140625, -0.034423828125,...

[ 3642, 47, 74481, 67, 32354, 23, 502, 4867, 18389, 313, 9, 284, 20268, 10, 7413, 2396, 11, 275, 19, 4426, 876, 653, 472, 245918, 541, 20, 18151, 11343, 68772, 163, 157, 155761, 56641, 140992, 5608, 787 ]

[ 0.093505859375, 0.037200927734375, 0.2275390625, 0.0999755859375, 0.2470703125, 0.12109375, 0.179931640625, 0.266845703125, 0.208984375, 0.029815673828125, 0.004730224609375, 0.078125, 0.067138671875, 0.0633544921875, 0.0843505859375, 0.16552734375, 0.004425048828125, 0.05932617187...

embed

29088697_c0

29088697

prolog

0

Title: how to define (sometimes) recursive prolog trees Problem title: how to define (sometimes) recursive prolog trees Tags: prolog, dcg Problem: how to define (sometimes) recursive prolog trees I've got two different types of sentences to parse, but i'll just give them simples names for now. Basically, I have two par...

how to define (sometimes) recursive prolog trees how to define (sometimes) recursive prolog trees prolog dcg how to define (sometimes) recursive prolog trees I've got two different types of sentences to parse, but i'll just give them simples names for now. Basically, I have two parse trees I hope that makes sense, I ju...

[ 0.0196533203125, -0.0004730224609375, -0.0162353515625, 0.0152587890625, 0.004364013671875, 0.0277099609375, -0.01104736328125, -0.0035247802734375, 0.00848388671875, -0.051513671875, -0.003204345703125, -0.0169677734375, -0.006927490234375, 0.0145263671875, 0.033935546875, 0.001480102...

[ 3642, 47, 61924, 43452, 70141, 195625, 5844, 502, 4867, 1360, 90, 238, 177, 6626, 12921, 52895, 149357, 366, 184, 30362, 10422, 6528, 1528, 23, 40956, 4358, 177261, 645, 118664 ]

[ 0.045684814453125, 0.0163421630859375, 0.1927490234375, 0.0831298828125, 0.138916015625, 0.1697998046875, 0.1329345703125, 0.119873046875, 0.1942138671875, 0.197509765625, 0.11279296875, 0.003387451171875, 0.08721923828125, 0.03778076171875, 0.0257720947265625, 0.07159423828125, 0.15...

embed

44456066_c0

44456066

prolog

0

Title: Existence error on lists Problem title: Existence error on lists Tags: prolog Problem: Existence error on lists I am using gprolog allong with gplc and I get fatal error: redefining built-in predicate member/2 when I try to compile the following code. I also get uncaught exception: error(existence_error(procedur...

Existence error on lists Existence error on lists prolog Existence existence_error Existence error on lists I am using gprolog allong with gplc and I get fatal error: redefining built-in predicate member/2 when I try to compile the following code. I also get uncaught exception: error(existence_error(procedure,member/0)...

[ 0.00555419921875, 0.00933837890625, 0.006011962890625, 0.013916015625, -0.008056640625, 0.00689697265625, 0.005767822265625, 0.02294921875, 0.00506591796875, -0.06494140625, 0.0240478515625, -0.008056640625, 0.0123291015625, -0.0009765625, 0.028564453125, -0.0145263671875, 0.02160644...

[ 122688, 329, 18499, 98, 5303, 502, 4867, 116311, 188800, 7, 17368, 706, 3454, 10617, 2424, 238, 85235, 456, 49919, 449, 88303, 73, 1653, 2063, 67, 32786, 12477, 9790, 9969, 1340, 70, 25632, 18151, 408, 46526, 131527, 232578, 39, 27417, 10...

[ 0.20947265625, 0.0068359375, 0.2186279296875, 0.0865478515625, 0.2132568359375, 0.1497802734375, 0.213134765625, 0.2193603515625, 0.24169921875, 0.04541015625, 0.01214599609375, 0.059051513671875, 0.17529296875, 0.06658935546875, 0.07861328125, 0.045806884765625, 0.1259765625, 0.06...

embed

33523013_c0

33523013

prolog

0

Title: How to build a number from a list of numbers in Prolog? Problem title: How to build a number from a list of numbers in Prolog? Tags: clpfd, prolog, list Problem: How to build a number from a list of numbers in Prolog? I'm pretty new in Prolog, and I was trying (without any success) to get a number from it's repr...

How to build a number from a list of numbers in Prolog? How to build a number from a list of numbers in Prolog? clpfd prolog list a How Prolog How to build a number from a list of numbers in Prolog? I'm pretty new in Prolog, and I was trying (without any success) to get a number from it's representation as a list of nu...

[ -0.0291748046875, 0.0191650390625, 0.0108642578125, 0.0026092529296875, 0.002899169921875, 0.01611328125, -0.03466796875, 0.029052734375, 0.0023956298828125, -0.031494140625, 0.004974365234375, -0.018310546875, 0.00201416015625, 0.032958984375, 0.01422119140625, -0.0169677734375, 0.0...

[ 11249, 47, 45367, 14012, 1295, 5303, 101935, 23, 1250, 4867, 39557, 71, 502, 10, 3525, 31577, 36272, 2046, 18811, 237, 339, 133063, 96386, 541, 48636, 145755, 195625, 5844, 234873, 24855, 8962, 282, 9523, 1657, 334, 83, 959, 32354, 4358, ...

[ 0.067626953125, 0.034027099609375, 0.204345703125, 0.2144775390625, 0.1522216796875, 0.17578125, 0.170166015625, 0.0526123046875, 0.168212890625, 0.2381591796875, 0.007568359375, 0.057830810546875, 0.1048583984375, 0.0200958251953125, 0.01251220703125, 0.040313720703125, 0.0124511718...

embed

54270827_c0

54270827

prolog

0

Title: Non linear constraints over real numbers in Prolog Problem title: Non linear constraints over real numbers in Prolog Tags: prolog, constraints Problem: Non linear constraints over real numbers in Prolog I am using clpr for constraint logic programming over real numbers in Prolog. Specifically i want to maximise ...

Non linear constraints over real numbers in Prolog Non linear constraints over real numbers in Prolog prolog constraints Non Prolog use_module Non linear constraints over real numbers in Prolog I am using clpr for constraint logic programming over real numbers in Prolog. Specifically i want to maximise nonlinear expres...

[ 0.00052642822265625, 0.000133514404296875, 0.004852294921875, 0.0126953125, 0.007080078125, 0.023193359375, 0.0020599365234375, 0.0034942626953125, 0.0098876953125, -0.05712890625, -0.0179443359375, 0.0191650390625, -0.006134033203125, -0.010986328125, 0.0162353515625, 0.00741577148437...

[ 3775, 192617, 158, 2816, 4288, 645, 2773, 101935, 1250, 4867, 502, 4527, 83279, 17368, 33139, 10287, 62775, 56037, 3444, 39771, 3075, 351, 2256, 147, 125195, 18151, 35064, 84046, 14602, 959, 4488, 133266, 661, 678, 10, 997, 43240, 67330, 35...

[ 0.1409912109375, 0.2491455078125, 0.0682373046875, 0.154052734375, 0.09130859375, 0.07684326171875, 0.1224365234375, 0.1202392578125, 0.13916015625, 0.2220458984375, 0.08087158203125, 0.05487060546875, 0.1068115234375, 0.05303955078125, 0.08123779296875, 0.226318359375, 0.10827636718...

embed

29319851_c0

29319851

prolog

0

Title: Predicate that take a list and give me the last item of this list do not work as i expect Problem title: Predicate that take a list and give me the last item of this list do not work as i expect Tags: prolog Problem: Predicate that take a list and give me the last item of this list do not work as i expect I cann...

Predicate that take a list and give me the last item of this list do not work as i expect Predicate that take a list and give me the last item of this list do not work as i expect prolog Predicate Predicate that take a list and give me the last item of this list do not work as i expect I cannot understand why this pred...

[ 0.003173828125, 0.005828857421875, 0.01470947265625, -0.00677490234375, -0.0146484375, 0.0252685546875, -0.00543212890625, 0.0113525390625, -0.006744384765625, -0.02099609375, 0.041259765625, -0.0252685546875, -0.0019683837890625, 0.0133056640625, 0, 0.01025390625, 0.015869140625, ...

[ 7145, 2063, 67, 450, 5646, 5303, 136, 8337, 163, 4568, 35735, 111, 959, 4488, 237, 41206, 10, 903, 502, 4867, 54, 53418, 28219, 15400, 1653, 17569, 46741, 1632, 12830, 11675, 41, 1294, 1542, 133063, 96386, 16750, 1193, 76067, 1284, 98320,...

[ 0.1949462890625, 0.2327880859375, 0.0987548828125, 0.0235595703125, 0.159423828125, 0.204833984375, 0.039459228515625, 0.08416748046875, 0.043701171875, 0.24609375, 0.1767578125, 0.1441650390625, 0.131103515625, 0.1488037109375, 0.08099365234375, 0.1756591796875, 0.00543212890625, ...

embed

49590129_c0

49590129

prolog

0

Title: How to find phrase in file prolog Problem title: How to find phrase in file prolog Tags: prolog, dcg, swi-prolog Problem: How to find phrase in file prolog I am trying to find phrase in a file using Prolog and if its finded just returing true. The problem is that i dont have idea how to use this phrase_from_file...

How to find phrase in file prolog How to find phrase in file prolog prolog dcg swi-prolog How Smthing phrase_from_file b.txt fs1111myphrase111asd How to find phrase in file prolog I am trying to find phrase in a file using Prolog and if its finded just returing true. The problem is that i dont have idea how to use this...

[ 0.0162353515625, -0.01422119140625, 0.00262451171875, 0.01361083984375, -0.00738525390625, 0.009521484375, 0.02197265625, -0.000659942626953125, -0.0029296875, -0.05517578125, 0.01055908203125, 0.02197265625, -0.018798828125, -0.00823974609375, 0.019287109375, 0.006744384765625, 0.00...

[ 11249, 47, 7413, 113860, 23, 11435, 502, 4867, 177, 2452, 3454, 24965, 64113, 161063, 29822, 876, 124326, 159019, 1176, 179665, 184, 97024, 31577, 1250, 6863, 9881, 71, 83648, 29568, 2967, 13319, 6528, 3642, 4527, 903, 12477, 71924, 33938, ...

[ 0.037506103515625, 0.034454345703125, 0.1734619140625, 0.3115234375, 0.0997314453125, 0.1873779296875, 0.180908203125, 0.229248046875, 0.029937744140625, 0.1153564453125, 0.1397705078125, 0.026123046875, 0.1290283203125, 0.1483154296875, 0.175537109375, 0.0753173828125, 0.16345214843...

embed

61277051_c1

61277051

prolog

1

to add 9 or 10 (depending on the example) at the end. Program: insere_ordenado_ite(El,L1,L2) :- insere_ordenado_ite(El,L1,L2,[]). insere_ordenado_ite(El,[],L2,L2). insere_ordenado_ite(El,[P|R],L2,AC) :- El >= P, append(AC,[P],NAC), insere_ordenado_ite(El,R,L2,NAC). insere_ordenado_ite(El,[P|R],L2,AC) :- El < P, append...

[ -0.01177978515625, -0.009765625, -0.00153350830078125, -0.004302978515625, -0.003662109375, 0.04833984375, -0.0213623046875, -0.0032958984375, 0.0220947265625, -0.0191650390625, 0.035888671875, 0.0022430419921875, -0.007598876953125, 0.004302978515625, 0.0064697265625, -0.0121459960937...

[ 47, 15190, 483, 707, 209, 27781, 99, 3564, 7663, 28046, 13, 38228, 1138, 1486, 7623, 866, 418, 10461, 15772, 304, 1052, 15012, 540, 436, 114689, 184777, 71, 5351, 2967, 9844, 132283, 1295, 7279, 35431, 9077, 3642, 54, 42551, 4358, 77947, ...

[ 0.048248291015625, 0.2056884765625, 0.2254638671875, 0.073486328125, 0.2169189453125, 0.1773681640625, 0.03997802734375, 0.1900634765625, 0.178955078125, 0.1954345703125, 0.142578125, 0.1986083984375, 0.1429443359375, 0.1500244140625, 0.112548828125, 0.05902099609375, 0.0210876464843...

embed

56050573_c0

56050573

prolog

0

Title: Prolog CLPFD Transitivity Problem title: Prolog CLPFD Transitivity Tags: clpfd, prolog Problem: Prolog CLPFD Transitivity "Obvious" is not a word lightly bandied about, but why does SWI-Prolog's CLPFD correctly solve this: ?- A+1 #= A*2. A = 1. but not this: ?- B #= A + 1, B #= A * 2. A+1#=B, A*2#=B. ( label and...

Prolog CLPFD Transitivity Prolog CLPFD Transitivity clpfd prolog Prolog CLPFD Transitivity Arguments Prolog CLPFD Transitivity "Obvious" is not a word lightly bandied about, but why does SWI-Prolog's CLPFD correctly solve this: but not this: ( label and indomain yield Arguments are not sufficiently instantiated .) Is i...

[ -0.00152587890625, 0.0074462890625, 0.0098876953125, 0.0091552734375, 0.0091552734375, -0.01300048828125, -0.0030059814453125, -0.006195068359375, 0.00885009765625, -0.01416015625, -0.000705718994140625, 0.00188446044921875, 0.007080078125, 0.0294189453125, 0.02392578125, -0.0000605583...

[ 1250, 4867, 46323, 41265, 397, 162774, 54613, 39557, 71, 502, 112140, 46471, 10023, 223, 959, 2565, 22729, 15400, 159, 38969, 10752, 26785, 86869, 903, 1284, 67967, 136, 67018, 24931, 11180, 19388, 129980, 34648, 3115, 814, 22027, 18, 105556,...

[ 0.1361083984375, 0.233642578125, 0.0985107421875, 0.127685546875, 0.15771484375, 0.1907958984375, 0.1387939453125, 0.0531005859375, 0.06622314453125, 0.03973388671875, 0.2120361328125, 0.094482421875, 0.14404296875, 0.180419921875, 0.1171875, 0.10589599609375, 0.029571533203125, 0....

embed

8176347_c0

8176347

prolog

0

Title: Split a list in half Problem title: Split a list in half Tags: list, prolog Problem: Split a list in half I need to define divide so that List [1,2,3,4,5] divides into: a = [1,2,3} b = [4,5] I'm getting an error that says "Arguments are not sufficiently instantiated" , and I don't know enough about the language ...

Split a list in half Split a list in half list prolog Split Arguments Split a list in half I need to define divide so that List [1,2,3,4,5] divides into: I'm getting an error that says "Arguments are not sufficiently instantiated" , and I don't know enough about the language to figure out what my problem is, or if my d...

[ 0.001678466796875, 0.0252685546875, 0.0130615234375, 0.00445556640625, -0.0172119140625, 0.0274658203125, 0.00168609619140625, 0.007476806640625, 0.0233154296875, -0.00787353515625, 0.00811767578125, -0.01495361328125, 0.003692626953125, 0.017333984375, 0.00750732421875, -0.01214599609...

[ 46474, 5303, 23, 23552, 10, 502, 4867, 112140, 3871, 61924, 101637, 221, 32036, 155761, 80389, 7, 3934, 18499, 7614, 1234, 9035, 621, 959, 129980, 34648, 14, 27686, 3714, 20174, 46876, 26366, 2967, 4331, 7108, 196219, 77947, 765, 2060 ]

[ 0.2332763671875, 0.2225341796875, 0.1258544921875, 0.2330322265625, 0.0261688232421875, 0.13623046875, 0.1439208984375, 0.2467041015625, 0.058807373046875, 0.1761474609375, 0.2489013671875, 0.029998779296875, 0.200927734375, 0.162109375, 0.2213134765625, 0.07415771484375, 0.176025390...

embed

13905832_c0

13905832

prolog

0

Title: Prolog - Latin Square solution Problem title: Prolog - Latin Square solution Tags: latin-square, prolog, clpfd Problem: Prolog - Latin Square solution I am trying to write a program in Prolog to find a Latin Square of size N. I have this right now: delete(X, [X|T], T). delete(X, [H|T], [H|S]) :- delete(X, T, S)....

Prolog - Latin Square solution Prolog - Latin Square solution latin-square prolog clpfd Prolog Latin Square Prolog - Latin Square solution I am trying to write a program in Prolog to find a Latin Square of size N. I have this right now:

[ 0.0078125, 0.021240234375, 0.014404296875, -0.00537109375, -0.0186767578125, -0.0054931640625, -0.00836181640625, -0.005523681640625, 0.00555419921875, -0.03515625, 0.00848388671875, -0.0018310546875, -0.00135040283203125, -0.0191650390625, -0.0162353515625, -0.0002994537353515625, -...

[ 1250, 4867, 20, 42845, 68305, 29806, 45137, 108047, 502, 33139, 39557, 71, 87, 31577, 33022, 10, 1528, 23, 7413, 111, 13267, 541, 765, 903, 7108, 5036 ]

[ 0.173828125, 0.27734375, 0.024566650390625, 0.256591796875, 0.25048828125, 0.1932373046875, 0.2208251953125, 0.2276611328125, 0.1297607421875, 0.0101318359375, 0.06768798828125, 0.09423828125, 0.01493072509765625, 0.08563232421875, 0.11090087890625, 0.03814697265625, 0.1612548828125,...

embed

18954787_c0

18954787

prolog

0

Title: Prolog predicate regarding list manipulation Problem title: Prolog predicate regarding list manipulation Tags: prolog, predicate Problem: Prolog predicate regarding list manipulation E.g: given 3 statement: car(toyota,[sedan,5_seater,head_rest]). car(nissan,[4_seater,sedan,2_door,head_rest,blue]). car(peugeot,[h...

Prolog predicate regarding list manipulation Prolog predicate regarding list manipulation prolog predicate Prolog head_rest sun_roof Prolog predicate regarding list manipulation E.g: given 3 statement: How to write a Prolog predicate items(A, X, Y) that is true if A is the list car that contain all the parts in X but d...

[ 0.00970458984375, -0.0086669921875, -0.005096435546875, 0.00909423828125, -0.0291748046875, 0.022216796875, 0.003265380859375, 0.00732421875, 0.0023956298828125, -0.00029754638671875, -0.00933837890625, 0.01202392578125, -0.01226806640625, -0.0042724609375, -0.0002956390380859375, 0.00...

[ 1250, 4867, 1653, 2063, 67, 118861, 5303, 45258, 502, 10336, 56644, 4262, 516, 4390, 34475, 138, 63805, 11249, 47, 33022, 55769, 284, 1193, 990, 29568, 2174, 62, 2258, 70541, 756, 63920, 1284, 959, 2499, 15673, 176256, 4358, 129745 ]

[ 0.17822265625, 0.254638671875, 0.1845703125, 0.213623046875, 0.113037109375, 0.0386962890625, 0.2052001953125, 0.220458984375, 0.0919189453125, 0.0927734375, 0.1539306640625, 0.07025146484375, 0.1075439453125, 0.1123046875, 0.05072021484375, 0.11083984375, 0.19091796875, 0.05310058...

embed

42489333_c0

42489333

prolog

0

Title: Understanding add_to_heap(+Heap0, +Priority, ?Key, -Heap) Problem title: Understanding add_to_heap(+Heap0, +Priority, ?Key, -Heap) Tags: heap, swi-prolog, prolog Problem: Understanding add_to_heap(+Heap0, +Priority, ?Key, -Heap) From the docs : add_to_heap(+Heap0, +Priority, ?Key, -Heap) is semidet Adds Key with...

Understanding add_to_heap(+Heap0, +Priority, ?Key, -Heap) Understanding add_to_heap(+Heap0, +Priority, ?Key, -Heap) heap swi-prolog prolog Understanding add_to_heap Heap0 Priority Key Heap Understanding add_to_heap(+Heap0, +Priority, ?Key, -Heap) From the docs : If I understand it correctly, then add_to_heap adds a key...

[ 0.003509521484375, 0.0101318359375, -0.0118408203125, -0.0174560546875, -0.0028839111328125, 0.01495361328125, -0.01019287109375, -0.010986328125, 0.009765625, 0.00103759765625, 0.030029296875, -0.005889892578125, 0.027099609375, 0.027099609375, 0.008056640625, -0.0306396484375, 0.00...

[ 9626, 144057, 15190, 188, 1106, 2631, 1328, 13025, 2389, 33163, 748, 2481, 162429, 764, 2452, 3454, 4867, 502, 1529, 168857, 26824, 54, 28219, 22799, 6863, 25343, 83, 198343, 10, 16530, 111, 17305, 6423 ]

[ 0.055206298828125, 0.03948974609375, 0.1680908203125, 0.1683349609375, 0.1715087890625, 0.2432861328125, 0.0281219482421875, 0.110107421875, 0.1226806640625, 0.0291290283203125, 0.0943603515625, 0.037261962890625, 0.1839599609375, 0.1395263671875, 0.13330078125, 0.062042236328125, 0....

embed

42595598_c0

42595598

prolog

0

Title: Why does =:= give an error when the variable is not instantiated, but == doesn't? Problem title: Why does =:= give an error when the variable is not instantiated, but == doesn't? Tags: instantiation-error, prolog Problem: Why does =:= give an error when the variable is not instantiated, but == doesn't?...

Why does =:= give an error when the variable is not instantiated, but == doesn't? Why does =:= give an error when the variable is not instantiated, but == doesn't? instantiation-error prolog Why Instantiation _409 Why does =:= give an error when the variable is not instantiated, but == doesn't? would result i...

[ 0.00250244140625, 0.0123291015625, 0.0264892578125, -0.00457763671875, 0.01068115234375, 0.007293701171875, 0.01019287109375, -0.0118408203125, 0.0208740234375, -0.01116943359375, 0.0361328125, -0.0133056640625, 0.01519775390625, 0.0184326171875, 0.0166015625, -0.0157470703125, 0.000...

[ 44084, 2203, 12, 1369, 8337, 18499, 3229, 77336, 83, 959, 34648, 14, 27686, 1284, 69112, 22027, 3768, 18, 188800, 502, 4867, 166945, 2320, 2839, 1126, 16750, 35166, 157, 2806, 123087, 15044, 68991, 51, 143034 ]

[ 0.090087890625, 0.17529296875, 0.1180419921875, 0.1761474609375, 0.08984375, 0.210205078125, 0.046966552734375, 0.2366943359375, 0.029571533203125, 0.1724853515625, 0.1253662109375, 0.1474609375, 0.06463623046875, 0.0684814453125, 0.290771484375, 0.109375, 0.092041015625, 0.1730957...

embed

47046061_c2

47046061

prolog

2

049 bytes written, 10 ms warning: /home/cg/root/3832463/main.pg:1: user directive caused exception: error(existence_error(procedure,main/0),load/1) | ?- uncaught exception: error(syntax_error('user_input:1 (char:5) . or operator expected after Code signals: Why, Peter, Anne, Mark, Zara, Beatrice, Andrew, Sarah, Eugenie...

[ 0.005889892578125, 0.0322265625, -0.000640869140625, 0.0033416748046875, -0.025390625, 0.0037078857421875, 0.00750732421875, 0.0113525390625, -0.00164794921875, -0.05859375, 0.007537841796875, -0.01556396484375, -0.0037841796875, -0.0026397705078125, 0.0089111328125, -0.0208740234375, ...

[ 5742, 1126, 390, 1636, 59121, 4, 209, 68163, 1631, 592, 248, 29552, 64, 238, 177, 148920, 162982, 2357, 15748, 24931, 254, 19721, 38937, 8951, 5844, 143434, 131527, 18499, 116311, 188800, 232578, 107838, 63033, 11583, 58745, 705, 9, 51, 408...

[ 0.076904296875, 0.132568359375, 0.148681640625, 0.1053466796875, 0.1834716796875, 0.0189208984375, 0.1358642578125, 0.1695556640625, 0.1702880859375, 0.10137939453125, 0.04632568359375, 0.17236328125, 0.00701904296875, 0.023712158203125, 0.10308837890625, 0.24609375, 0.135498046875, ...

embed

16250660_c0

16250660

prolog

0

Title: Delete an element in a list at a specified index Problem title: Delete an element in a list at a specified index Tags: indexing, list, prolog, element Problem: Delete an element in a list at a specified index I need your help! Can you help me with this: delete an element in a list at a specified index in Prolog....

Delete an element in a list at a specified index Delete an element in a list at a specified index indexing list prolog element Delete List Index NewList Delete an element in a list at a specified index I need your help! Can you help me with this: delete an element in a list at a specified index in Prolog. For example: ...

[ -0.01177978515625, 0.00115203857421875, 0.002716064453125, -0.0019073486328125, -0.0244140625, 0.0164794921875, 0.0081787109375, 0.00555419921875, 0.019287109375, -0.01373291015625, 0.0299072265625, -0.02294921875, -0.0296630859375, 0.005828857421875, 0.016357421875, -0.001487731933593...

[ 262, 46485, 12830, 23, 5303, 99, 58735, 297, 63262, 142, 502, 4867, 32036, 31471, 2356, 154663, 10, 3871, 4358, 4171, 903, 154109, 1250, 27781, 2301, 18, 3714, 3642, 54, 6678, 4126 ]

[ 0.1229248046875, 0.1947021484375, 0.196533203125, 0.08837890625, 0.1923828125, 0.1588134765625, 0.1962890625, 0.023712158203125, 0.228759765625, 0.042449951171875, 0.09814453125, 0.2469482421875, 0.1522216796875, 0.20654296875, 0.1048583984375, 0.170166015625, 0.04473876953125, 0.0...

embed

35825287_c0

35825287

prolog

0

Title: Split atom and conserve separators Problem title: Split atom and conserve separators Tags: list, prolog, split Problem: Split atom and conserve separators suppose that I a have an atom which contains some keyN-separators , how I can generate a list that contains list of separate elements 1000<=N<=5000~ keys/elem...

Split atom and conserve separators Split atom and conserve separators list prolog split Split Atom elem1key1elem2key2elem3key1...elemN split_atom_list key1 key2 Res_List elem1 elem2 Split atom and conserve separators suppose that I a have an atom which contains some keyN-separators , how I can generate a list that cont...

[ -0.0033111572265625, 0.003997802734375, -0.005584716796875, -0.006103515625, -0.0208740234375, 0.004150390625, 0.0120849609375, 0.01190185546875, -0.0084228515625, -0.0002384185791015625, -0.0020599365234375, 0.005218505859375, 0.005767822265625, -0.005401611328125, 0.0157470703125, 0....

[ 46474, 34627, 136, 118684, 37451, 22230, 5303, 502, 4867, 65450, 69728, 88, 195, 19770, 27889, 839, 5928, 6562, 22799, 304, 9624, 154663, 139124, 765, 70541, 184, 6276, 3642, 831, 139392, 84797, 80854, 4382, 16093, 29213, 2306, 64, 62766, 8...

[ 0.18896484375, 0.1993408203125, 0.0745849609375, 0.1878662109375, 0.2044677734375, 0.1126708984375, 0.1893310546875, 0.089111328125, 0.144775390625, 0.1790771484375, 0.1751708984375, 0.02301025390625, 0.08184814453125, 0.0994873046875, 0.056427001953125, 0.149658203125, 0.13000488281...

embed

24851737_c0

24851737

prolog

0

Title: Is it possible to implement some semantic like this in Prolog? Problem title: Is it possible to implement some semantic like this in Prolog? Tags: prolog Problem: Is it possible to implement some semantic like this in Prolog? So basically in C , we can implement some semantic like this: int foo(int a ) { if (a =...

Is it possible to implement some semantic like this in Prolog? Is it possible to implement some semantic like this in Prolog? prolog Prolog Is it possible to implement some semantic like this in Prolog? So basically in C , we can implement some semantic like this: So I am trying to use Prolog to implement the same sema...

[ 0.007415771484375, 0.0179443359375, 0.0019989013671875, 0.0216064453125, 0.005828857421875, 0.0179443359375, 0.00054931640625, 0.005584716796875, -0.01116943359375, -0.017578125, 0.00531005859375, 0.0115966796875, -0.0269775390625, 0.0133056640625, 0.0218505859375, -0.0089111328125, ...

[ 2071, 7722, 29479, 3060, 484, 109109, 1884, 903, 23, 1250, 4867, 502, 442, 47, 313, 831, 31577, 4527, 5701, 3688, 55681, 1556, 13580, 33636, 2174, 11, 69112, 805, 30646, 757, 4358 ]

[ 0.0146636962890625, 0.186767578125, 0.20556640625, 0.0333251953125, 0.2012939453125, 0.2049560546875, 0.1368408203125, 0.13037109375, 0.1285400390625, 0.2015380859375, 0.279052734375, 0.1441650390625, 0.025146484375, 0.0175933837890625, 0.1165771484375, 0.0692138671875, 0.01734924316...

embed

15126458_c0

15126458

prolog

0

Title: Prolog - subtraction in and between trees Problem title: Prolog - subtraction in and between trees Tags: prolog Problem: Prolog - subtraction in and between trees This is a problem I encountered. How do you subtract values in a binary tree recursively? subtractTree(tree(leaf(4), tree(leaf(2), leaf(1))),S). S = 3...

Prolog - subtraction in and between trees Prolog - subtraction in and between trees prolog Prolog Prolog - subtraction in and between trees This is a problem I encountered. How do you subtract values in a binary tree recursively? For this example, it first subtracts the leaves in each tree before subtracting the values...

[ 0.0264892578125, 0.0234375, -0.01239013671875, -0.0027313232421875, -0.003570556640625, 0.0091552734375, -0.030517578125, -0.004180908203125, -0.003509521484375, -0.032470703125, -0.016845703125, -0.00176239013671875, -0.0126953125, 0.017578125, 0.0283203125, 0.004913330078125, 0.019...

[ 1250, 4867, 1614, 117474, 17721, 1360, 23, 502, 2967, 190647, 11249, 54, 398, 39989, 18, 142424, 2394, 6635, 53201, 195625, 5844, 27781, 5117, 933, 31358, 12638, 8108, 1556, 34292, 1398, 17932, 106, 58671, 33000, 115178, 35166, 1031 ]

[ 0.1256103515625, 0.2177734375, 0.149169921875, 0.162841796875, 0.1607666015625, 0.1724853515625, 0.02691650390625, 0.06890869140625, 0.087890625, 0.0280609130859375, 0.06854248046875, 0.03314208984375, 0.000946044921875, 0.1734619140625, 0.0936279296875, 0.18603515625, 0.164916992187...

embed

35764778_c0

35764778

prolog

0

Title: Switch statements in Prolog Problem title: Switch statements in Prolog Tags: pattern-matching, switch-statement, prolog Problem: Switch statements in Prolog In Prolog predicates, I often write repetitive conditional statements like this one, but I wish they could be written more concisely: output(Lang, Type, Out...

Switch statements in Prolog Switch statements in Prolog pattern-matching switch-statement prolog Switch Prolog Lang Type Output Switch statements in Prolog In Prolog predicates, I often write repetitive conditional statements like this one, but I wish they could be written more concisely: Would it be possible to replac...

[ 0, -0.0031280517578125, 0.004150390625, 0.000461578369140625, -0.0289306640625, -0.0211181640625, -0.0235595703125, 0.02294921875, -0.00518798828125, -0.00238037109375, 0.0179443359375, 0.00909423828125, -0.0164794921875, -0.023681640625, 0.0250244140625, 0.02392578125, 0.00512695312...

[ 106101, 63805, 1250, 4867, 23, 103510, 98753, 101089, 61340, 502, 15786, 60457, 13538, 1653, 2063, 1636, 27983, 33022, 57346, 4935, 35431, 289, 1884, 903, 1632, 32599, 5809, 59121, 1286, 158, 10794, 7722, 91995, 36549, 318, 184, 9, 674 ]

[ 0.2314453125, 0.2294921875, 0.1334228515625, 0.22998046875, 0.010986328125, 0.145751953125, 0.1334228515625, 0.2239990234375, 0.19775390625, 0.070556640625, 0.1153564453125, 0.1375732421875, 0.0987548828125, 0.1038818359375, 0.153076171875, 0.0294647216796875, 0.088134765625, 0.061...

embed

20514022_c0

20514022

prolog

0

Title: Prolog: between/3 with a list at the end Problem title: Prolog: between/3 with a list at the end Tags: between, list, prolog Problem: Prolog: between/3 with a list at the end my question comes up because of this question Can you write between/3 in pure prolog? would it be possible to make between/3 and the third...

Prolog: between/3 with a list at the end Prolog: between/3 with a list at the end between list prolog Prolog Prolog: between/3 with a list at the end my question comes up because of this question Can you write between/3 in pure prolog? would it be possible to make between/3 and the third argument is a list so if you as...

[ 0.0034332275390625, 0.018798828125, 0.01708984375, -0.00439453125, -0.01531982421875, 0.040283203125, -0.00927734375, -0.0034942626953125, -0.002471923828125, -0.013916015625, 0.00897216796875, -0.022705078125, 0.00408935546875, 0.007171630859375, 0.0036468505859375, 0.00897216796875, ...

[ 1250, 4867, 17721, 18113, 678, 5303, 3564, 502, 4171, 33022, 34166, 7722, 3249, 50960, 10750, 83, 26458, 32497, 4488, 51347 ]

[ 0.1116943359375, 0.188232421875, 0.2257080078125, 0.25732421875, 0.03472900390625, 0.1656494140625, 0.1287841796875, 0.1195068359375, 0.000885009765625, 0.1104736328125, 0.0911865234375, 0.07293701171875, 0.01220703125, 0.197509765625, 0.203125, 0.0089111328125, 0.0032958984375, 0....

embed

69958021_c0

69958021

prolog

0

Title: Prolog recursion - why do I need to declare an extra variable Problem title: Prolog recursion - why do I need to declare an extra variable Tags: prolog Problem: Prolog recursion - why do I need to declare an extra variable One thing I don't understand is why must we declare another variable during recursion. For...

Prolog recursion - why do I need to declare an extra variable Prolog recursion - why do I need to declare an extra variable prolog Prolog N-1 Prolog recursion - why do I need to declare an extra variable One thing I don't understand is why must we declare another variable during recursion. For example: Why can't we jus...

[ 0.003570556640625, 0.014892578125, 0.00213623046875, 0.007568359375, 0.00147247314453125, -0.009033203125, -0.0177001953125, 0.003814697265625, 0.015869140625, -0.0081787109375, 0.0086669921875, -0.0159912109375, -0.0179443359375, -0.007110595703125, 0.03662109375, -0.01220703125, 0....

[ 1250, 4867, 195625, 1830, 15400, 87, 3871, 47, 159978, 142, 4173, 77336, 502, 541, 5759, 54, 28219, 8110, 15700, 20271, 44084, 17514, 177261, 645, 118664, 18499, 60212 ]

[ 0.1365966796875, 0.23583984375, 0.1849365234375, 0.1011962890625, 0.13671875, 0.0190582275390625, 0.121337890625, 0.029632568359375, 0.1943359375, 0.040130615234375, 0.1507568359375, 0.27197265625, 0.1053466796875, 0.039031982421875, 0.1019287109375, 0.01177978515625, 0.0667724609375...

embed

27548229_c0

27548229

prolog

0

Title: Prolog Definite Clause Grammar program for IPv4 address Problem title: Prolog Definite Clause Grammar program for IPv4 address Tags: prolog, dcg Problem: Prolog Definite Clause Grammar program for IPv4 address I'm currently trying to set up a little program for accepting IPv4 dotted quad strings in SWI Prolog us...

Prolog Definite Clause Grammar program for IPv4 address Prolog Definite Clause Grammar program for IPv4 address prolog dcg Prolog Definite Clause Grammar IPv4 Prolog Definite Clause Grammar program for IPv4 address I'm currently trying to set up a little program for accepting IPv4 dotted quad strings in SWI Prolog usin...

[ 0.01263427734375, 0.01385498046875, -0.005279541015625, 0.021728515625, -0.00189971923828125, 0.010009765625, -0.0072021484375, 0.004638671875, -0.00147247314453125, -0.0164794921875, -0.0140380859375, -0.008056640625, -0.035888671875, -0.0027008056640625, 0.002471923828125, 0.00958251...

[ 1250, 4867, 88606, 67, 100700, 13, 48078, 1727, 1528, 100, 8021, 334, 617, 29823, 502, 104, 238, 177, 82424, 31577, 5423, 1257, 10176, 26946, 20633, 3674, 91526, 79315, 159, 38969, 391, 56367, 429, 47506, 20288, 20271, 65006, 72272, 831, ...

[ 0.1683349609375, 0.25048828125, 0.1751708984375, 0.1158447265625, 0.2020263671875, 0.08740234375, 0.159423828125, 0.1429443359375, 0.201171875, 0.04150390625, 0.0992431640625, 0.1080322265625, 0.2310791015625, 0.1368408203125, 0.138671875, 0.087646484375, 0.1082763671875, 0.1359863...

embed

47213585_c0

47213585

prolog

0

Title: Binomial Coefficient [Prolog] Problem title: Binomial Coefficient [Prolog] Tags: prolog, binomial-coefficients, swi-prolog-for-sharing Problem: Binomial Coefficient [Prolog] bc(0,N,R,R):- N>0,R is 1,!. bc(M,0,R,R):- M>0,R is 1,!. bc(N,N,R,R):- R is 1,!. bc(M,N,R,R1):- M1 is M - 1, N1 is N - 1, bc(M1,N1,R,R2), bc...

Binomial Coefficient [Prolog] Binomial Coefficient [Prolog] prolog binomial-coefficients swi-prolog-for-sharing Binomial Coefficient Prolog Binomial Coefficient [Prolog] Why does it return false? Task is: Write recursive procedure C(M,N) (0 ≤ m ≤ n ) to find out binomial coefficient using this formule: P.S.: I use onli...

[ -0.011962890625, 0.031982421875, 0.0150146484375, 0.0035552978515625, 0.00616455078125, 0.0150146484375, 0.005157470703125, -0.0040283203125, 0.0086669921875, -0.01287841796875, 0.00099945068359375, -0.0218505859375, -0.01531982421875, 0.00099945068359375, 0.01068115234375, 0.006286621...

[ 1843, 1687, 15403, 1311, 13, 24500, 45964, 10752, 4867, 502, 333, 587, 4240, 11044, 2452, 3454, 2420, 2852, 1250, 44084, 14602, 30646, 98320, 9598, 92, 601, 18781, 195625, 5844, 50491, 313, 132, 594, 4, 839, 22085, 6, 237637, 347, 653, ...

[ 0.1248779296875, 0.2032470703125, 0.1678466796875, 0.1590576171875, 0.096923828125, 0.1942138671875, 0.1690673828125, 0.1619873046875, 0.2257080078125, 0.109130859375, 0.1619873046875, 0.11865234375, 0.1114501953125, 0.1064453125, 0.153564453125, 0.096923828125, 0.09234619140625, 0...

embed

40632997_c0

40632997

prolog

0

Title: Define the predicate Prolog Problem title: Define the predicate Prolog Tags: clpfd, prolog Problem: Define the predicate Prolog I'm reviewing some exercise for the coming test and having difficulty at this. Given a list of integers L, define the predicate: add(L,S) which returns a list of integers S in which eac...

Define the predicate Prolog Define the predicate Prolog clpfd prolog Define Prolog Define the predicate Prolog I'm reviewing some exercise for the coming test and having difficulty at this. So my question is what define the predicate means? It looks pretty general. I've read some threads but they did not provide much. ...

[ -0.0030059814453125, 0.0247802734375, -0.0086669921875, 0.00592041015625, -0.0264892578125, 0.0201416015625, -0.00372314453125, -0.0086669921875, -0.00128936767578125, -0.019287109375, 0.0228271484375, -0.004852294921875, -0.0208740234375, 0.0162353515625, 0.0177001953125, 0.0163574218...

[ 262, 64552, 70, 1653, 2063, 67, 1250, 4867, 33139, 39557, 71, 502, 81979, 3034, 2367, 61924, 26950, 33342, 4537, 86997 ]

[ 0.0758056640625, 0.17041015625, 0.09771728515625, 0.203857421875, 0.249755859375, 0.1844482421875, 0.176025390625, 0.270263671875, 0.0213775634765625, 0.042510986328125, 0.067626953125, 0.1026611328125, 0.0180511474609375, 0.11962890625, 0.04754638671875, 0.2308349609375, 0.106018066...

embed

43820954_c0

43820954

prolog

0

Title: Find if a number is a member of an element in a list Problem title: Find if a number is a member of an element in a list Tags: prolog Problem: Find if a number is a member of an element in a list i´m trying to create a predicate that returns me the element of a list that contains a certain number given by me. Ex...

Find if a number is a member of an element in a list Find if a number is a member of an element in a list prolog Find where_is_it Num Find if a number is a member of an element in a list i´m trying to create a predicate that returns me the element of a list that contains a certain number given by me. Example: I am a re...

[ -0.0086669921875, 0.001983642578125, 0.00005602836608886719, -0.005401611328125, -0.0201416015625, 0.031494140625, 0.010498046875, 0.0027923583984375, -0.0009918212890625, -0.038818359375, -0.0025177001953125, -0.011962890625, -0.004608154296875, -0.00052642822265625, 0.01220703125, -0...

[ 26040, 2174, 14012, 83, 10, 32786, 111, 12830, 23, 5303, 502, 4867, 7440, 164, 217, 52782, 31577, 28282, 1653, 2063, 67, 30646, 163, 70541, 24233, 34475, 89536, 35845, 77848, 903, 18151 ]

[ 0.1353759765625, 0.1488037109375, 0.216796875, 0.124267578125, 0.0718994140625, 0.2415771484375, 0.126220703125, 0.199951171875, 0.0914306640625, 0.188720703125, 0.09228515625, 0.1605224609375, 0.1590576171875, 0.1246337890625, 0.175048828125, 0.2191162109375, 0.0330810546875, 0.04...

embed

37534509_c0

37534509

prolog

0

Title: Prolog - Operator in predicate Problem title: Prolog - Operator in predicate Tags: prolog, operators Problem: Prolog - Operator in predicate Is it possible to include operators (like +, >, =, !=, >= etc.) in argument for a predicate (examples below are just a demonstraition and do not have much use)? test(A > B)...

Prolog - Operator in predicate Prolog - Operator in predicate prolog operators Prolog Operator Prolog - Operator in predicate Is it possible to include operators (like +, >, =, !=, >= etc.) in argument for a predicate (examples below are just a demonstraition and do not have much use)? Seems to work, but: Does not - wh...

[ 0.0252685546875, 0.00043487548828125, 0.01080322265625, -0.00194549560546875, 0.0159912109375, 0.003143310546875, 0.01953125, 0.003570556640625, -0.00994873046875, -0.013916015625, 0.01031494140625, -0.00640869140625, -0.00051116943359375, -0.015380859375, 0.01446533203125, 0.005187988...

[ 1250, 4867, 150922, 23, 1653, 2063, 67, 20, 502, 39933, 2071, 442, 7722, 26698, 7, 5062, 997, 977, 2203, 4, 711, 10750, 100, 302, 35064, 10, 32837, 1363, 136, 959, 5045, 4527, 6872, 4488, 1284, 101790, 15400, 44084, 68018, 831, 99201, ...

[ 0.1575927734375, 0.2298583984375, 0.252685546875, 0.08892822265625, 0.1719970703125, 0.204833984375, 0.10296630859375, 0.004730224609375, 0.1114501953125, 0.274169921875, 0.0078125, 0.0310211181640625, 0.14013671875, 0.1529541015625, 0.07147216796875, 0.04681396484375, 0.17822265625,...

embed

16824039_c0

16824039

prolog

0

Title: HTML select tag in SWI-Prolog Problem title: HTML select tag in SWI-Prolog Tags: php, prolog, html Problem: HTML select tag in SWI-Prolog How can i convert this to SWI-Prolog ? i didn't find on the internet how to write the select in prolog, and can you tell me how can i make the php code work in the ? <select i...

HTML select tag in SWI-Prolog HTML select tag in SWI-Prolog php prolog html HTML SWI-Prolog data_nastere_zi HTML select tag in SWI-Prolog How can i convert this to SWI-Prolog ? i didn't find on the internet how to write the select in prolog, and can you tell me how can i make the php code work in the ?

[ 0.01165771484375, -0.009765625, 0.01361083984375, 0.0037384033203125, -0.019287109375, -0.00994873046875, -0.0142822265625, 0.0198974609375, 0.00592041015625, -0.0264892578125, 0.00482177734375, 0.004638671875, -0.01336669921875, -0.01025390625, 0.00897216796875, 0.0157470703125, 0.0...

[ 19097, 36849, 7909, 159, 38969, 10752, 4867, 23, 9, 3958, 502, 7693, 2053, 2658, 18864, 708, 831, 96760, 903, 47, 33022, 18151, 4488 ]

[ 0.248291015625, 0.251220703125, 0.1915283203125, 0.065673828125, 0.2255859375, 0.135009765625, 0.2144775390625, 0.03692626953125, 0.0234375, 0.1448974609375, 0.136474609375, 0.1815185546875, 0.0986328125, 0.07080078125, 0.184814453125, 0.15234375, 0.0218353271484375, 0.158081054687...

embed