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
40945905_c0	40945905	prolog	0	Title: How to test binary trees in prolog Problem title: How to test binary trees in prolog Tags: prolog, binary-tree Problem: How to test binary trees in prolog I want to test this prolog program: # binary_tree(void). binary_tree(tree(_Element,Left,Right)):-binary_tree(Left),binary_tree(Right). test(tree(a,tree(b,tree...	How to test binary trees in prolog How to test binary trees in prolog prolog binary-tree How binary_tree _Element Left Right How to test binary trees in prolog I want to test this prolog program: # # When I execute it with: I get (and I should get "true" instead) What am I doing wrong? Thanks	[ 0.02392578125, 0.009765625, -0.0048828125, 0.007720947265625, 0.0028533935546875, 0.024658203125, -0.0189208984375, -0.0032806396484375, -0.0029296875, -0.0220947265625, 0.00013256072998046875, -0.0145263671875, -0.0184326171875, 0.0211181640625, 0.0289306640625, 0.007476806640625, 0...	[ 11249, 47, 3034, 2394, 6635, 1360, 90, 23, 502, 4867, 62600, 19929, 2480, 90911, 3444, 1528, 71924, 678, 2046, 5608, 9774, 64457, 44691 ]	[ 0.04217529296875, 0.052337646484375, 0.2144775390625, 0.162353515625, 0.118896484375, 0.2015380859375, 0.0548095703125, 0.03076171875, 0.1546630859375, 0.216796875, 0.2337646484375, 0.1109619140625, 0.06658935546875, 0.0992431640625, 0.0107421875, 0.07061767578125, 0.0902099609375, ...	embed
46756842_c0	46756842	prolog	0	Title: what's the difference between #= and =:= in SWI prolog Problem title: what's the difference between #= and =:= in SWI prolog Tags: operator-keyword, math, clpfd, prolog Problem: what's the difference between #= and =:= in SWI prolog What is the difference between #= and =:= in SWI prolog. I have found ...	what's the difference between #= and =:= in SWI prolog what's the difference between #= and =:= in SWI prolog operator-keyword math clpfd prolog SWI what's the difference between #= and =:= in SWI prolog What is the difference between #= and =:= in SWI prolog. I have found the definition from SWI prolog, but ...	[ 0.0208740234375, -0.004638671875, 0.0181884765625, 0.0030059814453125, 0.00238037109375, -0.00872802734375, -0.008544921875, 0.00384521484375, 0.01141357421875, 0.017578125, 0.016357421875, -0.00775146484375, 0.01287841796875, 0.026611328125, 0.01171875, -0.00872802734375, 0.00476074...	[ 2367, 3768, 70, 60212, 17721, 468, 1369, 136, 2203, 12, 23, 159, 38969, 502, 4867, 39933, 19770, 47416, 48909, 33139, 39557, 71, 80934, 55681, 2452, 3454, 29713, 669, 8962, 19714, 2816, 4288 ]	[ 0.016387939453125, 0.0799560546875, 0.050201416015625, 0.21533203125, 0.10302734375, 0.1239013671875, 0.2421875, 0.1141357421875, 0.220703125, 0.15966796875, 0.07421875, 0.08038330078125, 0.2119140625, 0.1435546875, 0.194091796875, 0.14404296875, 0.008087158203125, 0.02496337890625...	embed
2694453_c0	2694453	prolog	0	Title: Looking for a good semantic parser for the Russian language Problem title: Looking for a good semantic parser for the Russian language Tags: semantic-analysis, nlp, parse-tree, prolog Problem: Looking for a good semantic parser for the Russian language Does anyone know of a semantic parser for the Russian langua...	Looking for a good semantic parser for the Russian language Looking for a good semantic parser for the Russian language semantic-analysis nlp parse-tree prolog Looking Russian Looking for a good semantic parser for the Russian language Does anyone know of a semantic parser for the Russian language? I've attempted to co...	[ -0.01495361328125, 0.0257568359375, -0.00188446044921875, 0.0224609375, 0.0079345703125, 0.03271484375, -0.004608154296875, 0.002960205078125, -0.00799560546875, -0.046142578125, -0.01251220703125, -0.01806640625, 0.0098876953125, -0.005035400390625, 0.00543212890625, 0.000755310058593...	[ 157268, 10, 4127, 484, 109109, 366, 2189, 100, 102374, 46876, 174976, 26775, 184, 62600, 502, 4867, 3714, 81887, 222495, 3126, 2500, 107415, 25820, 156377, 5426, 11675, 4727, 139392, 400, 7008, 5062, 18811, 53201, 92537, 140992, 5885 ]	[ 0.1094970703125, 0.048675537109375, 0.06768798828125, 0.1627197265625, 0.1612548828125, 0.1826171875, 0.2071533203125, 0.0908203125, 0.26171875, 0.1676025390625, 0.0789794921875, 0.1375732421875, 0.0692138671875, 0.1160888671875, 0.0986328125, 0.16748046875, 0.0262298583984375, 0.0...	embed
13057428_c0	13057428	prolog	0	Title: Prolog: Failure driven loops Problem title: Prolog: Failure driven loops Tags: prolog-setof, logic-programming, prolog Problem: Prolog: Failure driven loops I used the following failure driven loop to list everything without using semicolons. happiness(fred,5). happiness(john,3). happiness(grace,2). someGoal(X) ...	Prolog: Failure driven loops Prolog: Failure driven loops prolog-setof logic-programming prolog Prolog Failure Prolog: Failure driven loops I used the following failure driven loop to list everything without using semicolons. In query mode, I get this as expected How can I insert these numbers into a list rather than w...	[ 0.037841796875, 0.004119873046875, -0.00156402587890625, -0.0001964569091796875, -0.0030517578125, 0.006072998046875, 0.0016021728515625, 0.0038299560546875, 0.0128173828125, -0.0252685546875, 0.00518798828125, -0.0128173828125, -0.0113525390625, -0.002410888671875, 0.0024566650390625, ...	[ 1250, 4867, 190355, 3408, 22648, 40956, 502, 3509, 4390, 62775, 28966, 11814, 25632, 137578, 19, 5303, 26818, 15490, 17368, 36137, 22796, 1779, 41, 1294, 13736, 2046, 84751, 831, 183540, 6097, 101935, 43257, 32562, 49119, 34831, 28032, 3060, ...	[ 0.132568359375, 0.20703125, 0.1512451171875, 0.13330078125, 0.099609375, 0.182373046875, 0.0789794921875, 0.0287017822265625, 0.0204620361328125, 0.067138671875, 0.0028076171875, 0.0537109375, 0.06591796875, 0.22998046875, 0.011810302734375, 0.180908203125, 0.1103515625, 0.12207031...	embed
53615645_c0	53615645	prolog	0	Title: How do I make the recursion in prolog? Problem title: How do I make the recursion in prolog? Tags: prolog Problem: How do I make the recursion in prolog? I'm creating a recursive function that returns me a list in Mem. Cycle everything perfectly and then with the backtracking prolog returns the empty list. Help....	How do I make the recursion in prolog? How do I make the recursion in prolog? prolog How Iniz Mem string_chars A1_1 Operation Lista nth0 How do I make the recursion in prolog? I'm creating a recursive function that returns me a list in Mem. Cycle everything perfectly and then with the backtracking prolog returns the em...	[ 0.011474609375, -0.0026397705078125, 0.005859375, 0.040283203125, -0.0135498046875, -0.0016326904296875, -0.0026702880859375, 0.003173828125, 0.029296875, -0.03271484375, -0.0091552734375, -0.0157470703125, -0.0198974609375, 0.03369140625, 0.009521484375, 0.0029449462890625, 0.002105...	[ 11249, 54, 87, 3249, 70, 195625, 1830, 23, 502, 4867, 360, 1418, 17443, 79315, 9254, 62, 115187, 102203, 50085, 927, 2389, 105233, 5844, 32354, 30646, 5303, 151612, 13, 26818, 169123, 4420, 125728, 214, 201505, 39527 ]	[ 0.0760498046875, 0.031005859375, 0.0268096923828125, 0.1229248046875, 0.0654296875, 0.2177734375, 0.173828125, 0.055572509765625, 0.163330078125, 0.250244140625, 0.038360595703125, 0.1103515625, 0.179931640625, 0.0889892578125, 0.1058349609375, 0.0113525390625, 0.0245361328125, 0.1...	embed
8191746_c0	8191746	prolog	0	Title: Deeper Explanation of Prolog Count Problem title: Deeper Explanation of Prolog Count Tags: prolog Problem: Deeper Explanation of Prolog Count Currently playing around in Prolog... I'm having trouble groking the count list rule. I haven't been able to find a good explanation anywhere. Can someone give me a break ...	Deeper Explanation of Prolog Count Deeper Explanation of Prolog Count prolog Deeper Explanation Prolog Count Head Tail TailCount Deeper Explanation of Prolog Count Currently playing around in Prolog... I'm having trouble groking the count list rule. I haven't been able to find a good explanation anywhere. Can someone g...	[ 0.02880859375, 0.0201416015625, -0.00372314453125, 0.01361083984375, 0.014404296875, 0.0074462890625, -0.0126953125, -0.016845703125, 0.03369140625, -0.01904296875, 0.000377655029296875, -0.04931640625, 0.00732421875, 0.03271484375, 0.0274658203125, -0.0135498046875, 0.0205078125, ...	[ 62723, 56, 5443, 5868, 1250, 4867, 108210, 2320, 502, 44816, 1218, 379, 75169, 63134, 11969, 6048, 54529, 5303, 79986, 4127, 187136, 7565, 442, 12638, 195625, 1830, 5844, 10422, 56112, 18 ]	[ 0.1024169921875, 0.071044921875, 0.01702880859375, 0.1456298828125, 0.1483154296875, 0.22705078125, 0.2012939453125, 0.0042724609375, 0.1051025390625, 0.1456298828125, 0.1131591796875, 0.0565185546875, 0.0288848876953125, 0.055755615234375, 0.060821533203125, 0.03460693359375, 0.2188...	embed
46505809_c0	46505809	prolog	0	Title: Why is Prolog not recognizing these built-ins? Problem title: Why is Prolog not recognizing these built-ins? Tags: prolog Problem: Why is Prolog not recognizing these built-ins? I'm having trouble using the round/1 and floor/1 built-ins in SWI-Prolog. When using them in my code, they aren't recognized and when s...	Why is Prolog not recognizing these built-ins? Why is Prolog not recognizing these built-ins? prolog Why Prolog Why is Prolog not recognizing these built-ins? I'm having trouble using the round/1 and floor/1 built-ins in SWI-Prolog. When using them in my code, they aren't recognized and when submitting them as a query;...	[ -0.01104736328125, 0.0081787109375, 0.00848388671875, 0.005615234375, -0.0177001953125, 0.02490234375, -0.006195068359375, 0.0072021484375, -0.0126953125, 0.00518798828125, -0.005767822265625, -0.0242919921875, -0.0234375, -0.0084228515625, 0.0223388671875, -0.00830078125, -0.0109863...	[ 44084, 83, 1250, 4867, 959, 75530, 19, 84382, 6097, 88303, 9, 5425, 502, 63134, 17368, 70, 68807, 11583, 136, 74912, 159, 38969, 10752, 18151, 18, 125296, 137447, 41, 705, 122336, 50491, 44691, 1118, 114686, 11389, 54825, 20600, 18499 ]	[ 0.092529296875, 0.03631591796875, 0.188720703125, 0.2470703125, 0.1090087890625, 0.102294921875, 0.0751953125, 0.05517578125, 0.080078125, 0.1929931640625, 0.07354736328125, 0.1944580078125, 0.12939453125, 0.066650390625, 0.0745849609375, 0.00531005859375, 0.1768798828125, 0.163085...	embed
47951732_c2	47951732	prolog	2	_Content-Head_Subtree_Indeterminate, Head_Subtree_Content-Concatenation_Indeterminate, Head_Subtree_Indeterminate, TailResult, MinTree, Others, CurrentMin, Candidate, ResultMinTree, ResultOthers, CurrentMin_Priority, Candidate_Priority, BeforeTree, AfterTree, Dummy-Dummy, MinData, MinPriority, MinTreeSubTree_Content-Mi...	_Content-Head_Subtree_Indeterminate, Head_Subtree_Content-Concatenation_Indeterminate, Head_Subtree_Indeterminate, TailResult, MinTree, Others, CurrentMin, Candidate, ResultMinTree, ResultOthers, CurrentMin_Priority, Candidate_Priority, BeforeTree, AfterTree, Dummy-Dummy, MinData, MinPriority, MinTreeSubTree_Content-Mi...	[ 0.0281982421875, -0.00787353515625, -0.004974365234375, 0.00872802734375, 0.002838134765625, 0.01153564453125, -0.003173828125, -0.023681640625, 0.042724609375, 0.007720947265625, 0.009765625, 0.018310546875, 0.00439453125, 0.009033203125, 0.029541015625, -0.0145263671875, 0.02661132...	[ 101, 11935, 25352, 13025, 712, 454, 96472, 62600, 4153, 145099, 67, 4, 44816, 4460, 33, 2320, 1218, 379, 4332, 7, 7136, 4211, 62731, 13, 64511, 114063, 59076, 194215, 126684, 9319, 33163, 748, 117371, 24372, 27919, 1176, 316, 137989, 26824,...	[ 0.07183837890625, 0.1141357421875, 0.252197265625, 0.1455078125, 0.1500244140625, 0.0277099609375, 0.217041015625, 0.289794921875, 0.0579833984375, 0.2476806640625, 0.0865478515625, 0.03765869140625, 0.2254638671875, 0.1243896484375, 0.1048583984375, 0.006927490234375, 0.117309570312...	embed
57209902_c0	57209902	prolog	0	Title: Prolog : querying if something doesn't satisfy a predicate Problem title: Prolog : querying if something doesn't satisfy a predicate Tags: prolog, logic-programming Problem: Prolog : querying if something doesn't satisfy a predicate I'm sure this is a n00b question, but how do I ask for things which sa...	Prolog : querying if something doesn't satisfy a predicate Prolog : querying if something doesn't satisfy a predicate prolog logic-programming Prolog Prolog : querying if something doesn't satisfy a predicate I'm sure this is a n00b question, but how do I ask for things which satisfy one predicate and not ano...	[ 0.00604248046875, 0.00836181640625, 0.003570556640625, 0.0037841796875, -0.018310546875, 0.034423828125, 0.0074462890625, 0.00122833251953125, -0.006805419921875, -0.02001953125, -0.0034637451171875, -0.0162353515625, -0.0113525390625, -0.0037384033203125, 0.0028839111328125, 0.0096435...	[ 1250, 4867, 152, 41, 1294, 214, 2174, 9844, 22027, 3768, 18, 40407, 53, 1653, 2063, 67, 10, 502, 62775, 28966, 9077, 7049, 275, 9655, 1284, 3642, 54, 87, 26458, 100, 8966, 3129, 1632, 136, 959, 15700, 63399, 111, 3395, 6, 2980, 114382...	[ 0.197998046875, 0.281494140625, 0.037689208984375, 0.13134765625, 0.164794921875, 0.06646728515625, 0.137939453125, 0.1029052734375, 0.1572265625, 0.06298828125, 0.19677734375, 0.2034912109375, 0.1685791015625, 0.17138671875, 0.21728515625, 0.102294921875, 0.048797607421875, 0.1389...	embed
55820947_c0	55820947	prolog	0	Title: Apply OR constraint over the variables in a list Problem title: Apply OR constraint over the variables in a list Tags: eclipse-clp, prolog Problem: Apply OR constraint over the variables in a list Suppose we have a list of variables. We want to apply a constraint over the variables, but the relation of these con...	Apply OR constraint over the variables in a list Apply OR constraint over the variables in a list eclipse-clp prolog Apply Apply OR constraint over the variables in a list Suppose we have a list of variables. We want to apply a constraint over the variables, but the relation of these constraints are or . How we can do ...	[ 0.001129150390625, -0.0037689208984375, 0.00848388671875, 0.01202392578125, -0.0025787353515625, -0.014404296875, -0.0205078125, 0.0289306640625, 0.020751953125, -0.0186767578125, -0.00640869140625, -0.00537109375, 0.0111083984375, 0.021484375, 0.0038299560546875, 0.002685546875, 0.0...	[ 5659, 538, 33172, 158, 2816, 4288, 645, 77336, 7, 23, 5303, 28, 106371, 184, 26775, 502, 4867, 111, 3444, 59911, 10, 41911, 621, 707, 831, 54, 903, 234962, 313, 37352, 3454, 60322, 2174, 16610, 62, 83, 1542, 990, 567, 1927, 686, 289, ...	[ 0.135986328125, 0.09698486328125, 0.300048828125, 0.1363525390625, 0.2144775390625, 0.1837158203125, 0.161376953125, 0.2320556640625, 0.052154541015625, 0.03363037109375, 0.2154541015625, 0.000701904296875, 0.1611328125, 0.0931396484375, 0.132568359375, 0.1119384765625, 0.20385742187...	embed
65108225_c0	65108225	prolog	0	Title: Prolog checking if 2 lists have same number of elements Problem title: Prolog checking if 2 lists have same number of elements Tags: prolog Problem: Prolog checking if 2 lists have same number of elements I am trying to figure out how to do this little thing. I have 2 lists for example [1,1,2,3,4] and [2,1,4,3,1...	Prolog checking if 2 lists have same number of elements Prolog checking if 2 lists have same number of elements prolog Prolog Prolog checking if 2 lists have same number of elements I am trying to figure out how to do this little thing. I have 2 lists for example [1,1,2,3,4] and [2,1,4,3,1] , I need to confirm if all e...	[ 0.0128173828125, 0.017822265625, -0.007598876953125, -0.0016021728515625, -0.0096435546875, 0.0184326171875, -0.0108642578125, 0.00469970703125, 0.005035400390625, -0.015625, 0.01300048828125, -0.0224609375, 0.003570556640625, 0.01318359375, -0.01043701171875, -0.0079345703125, 0.019...	[ 1250, 4867, 175199, 2174, 116, 5303, 7, 765, 5701, 14012, 80854, 502, 26366, 10176, 13580, 133063, 82449, 163324, 363, 47, 39563, 756, 106, 99201, 23, 8337, 36917, 107730, 29568, 1884, 107, 98320, 12096, 32354 ]	[ 0.158203125, 0.229736328125, 0.1593017578125, 0.0859375, 0.177490234375, 0.21142578125, 0.07733154296875, 0.0667724609375, 0.15625, 0.1448974609375, 0.201904296875, 0.125732421875, 0.027557373046875, 0.034576416015625, 0.007568359375, 0.03936767578125, 0.13525390625, 0.051300048828...	embed
27367412_c0	27367412	prolog	0	Title: Returning a list: Prolog Problem title: Returning a list: Prolog Tags: list, prolog Problem: Returning a list: Prolog Im trying to create a predicate that returns a list of all females. So far I have: female(elisabeth). female(queenmother). female(diana). female(anne). female(beatrice). female(sarah). female(zar...	Returning a list: Prolog Returning a list: Prolog list prolog Returning Prolog the_royal_females Returning a list: Prolog Im trying to create a predicate that returns a list of all females. So far I have: But this returns each female individuly like How can i get it to return [elisabeth,queenmother,diana] instead?	[ 0.020751953125, -0.01251220703125, -0.0002384185791015625, 0.01495361328125, 0.005126953125, 0.0341796875, -0.003875732421875, 0.01348876953125, 0.0022430419921875, -0.040283203125, -0.00274658203125, -0.0036163330078125, -0.01312255859375, 0.021240234375, 0.01416015625, 0.02783203125,...	[ 173340, 214, 10, 5303, 12, 1250, 4867, 502, 70, 516, 16300, 98357, 21183, 3370, 31577, 28282, 1653, 2063, 67, 30646, 7, 111, 756, 117776, 2060, 4966, 903, 12638, 12146, 1884, 11249, 831, 2046, 442, 47, 28967, 11, 86077, 944, 33, 432, ...	[ 0.2003173828125, 0.0814208984375, 0.0283203125, 0.2169189453125, 0.0213470458984375, 0.158447265625, 0.21630859375, 0.1177978515625, 0.06982421875, 0.109619140625, 0.15478515625, 0.161376953125, 0.1517333984375, 0.0133056640625, 0.062255859375, 0.1026611328125, 0.1351318359375, 0.1...	embed
66130847_c1	66130847	prolog	1	convert([],[]). % use the map to convert any Item convert(Item-_,R) :- cmap(Item,R). %processing Questions convert(drs([], [question(drs(_Refs,Conds))]), Res) :- convert(Conds, Res). %DRS processing convert(drs(Refs,Conds),Res) :- skolem(Refs), convert(Conds,Res). % process list of items convert([H\|T],[RH\|RT]) :- conv...	convert([],[]). % use the map to convert any Item convert(Item-_,R) :- cmap(Item,R). %processing Questions convert(drs([], [question(drs(_Refs,Conds))]), Res) :- convert(Conds, Res). %DRS processing convert(drs(Refs,Conds),Res) :- skolem(Refs), convert(Conds,Res). % process list of items convert([H\|T],[RH\|RT]) :- conv...	[ -0.009033203125, 0.008544921875, 0.010986328125, 0.01239013671875, 0.00640869140625, 0.01556396484375, -0.01361083984375, 0.0032806396484375, 0.01495361328125, -0.00787353515625, 0.0145263671875, -0.00154876708984375, 0.007720947265625, 0.012451171875, -0.012939453125, -0.0010452270507...	[ 96760, 132, 1065, 268, 194, 1745, 4527, 70, 22288, 47, 2499, 78426, 568, 2982, 9, 454, 1052, 15772, 1827, 2631, 63923, 214, 68185, 7, 7569, 7162, 1363, 190015, 11935, 6468, 9624, 397, 15396, 9433, 4332, 18700, 39, 5303, 111, 55769, 841,...	[ 0.31005859375, 0.019012451171875, 0.04302978515625, 0.04180908203125, 0.041534423828125, 0.1141357421875, 0.130615234375, 0.055084228515625, 0.22314453125, 0.06817626953125, 0.092529296875, 0.220947265625, 0.034210205078125, 0.19189453125, 0.0286865234375, 0.0191802978515625, 0.08068...	embed
72542714_c0	72542714	prolog	0	Title: Check if List C is the difference of List A and List B Problem title: Check if List C is the difference of List A and List B Tags: list, prolog Problem: Check if List C is the difference of List A and List B I am trying to write a Prolog program which returns true if list C is list A without List B ( so using se...	Check if List C is the difference of List A and List B Check if List C is the difference of List A and List B list prolog Check List Check if List C is the difference of List A and List B I am trying to write a Prolog program which returns true if list C is list A without List B ( so using set operators: C = A \ B ) Al...	[ 0.0189208984375, 0.0203857421875, 0.031005859375, 0.031982421875, -0.0118408203125, 0.01025390625, -0.002288818359375, 0.01373291015625, 0.0125732421875, 0.02099609375, -0.00180816650390625, 0.0038604736328125, -0.0024261474609375, 0.0181884765625, 0.001495361328125, -0.00567626953125,...	[ 38679, 2174, 32036, 313, 83, 70, 60212, 111, 62, 136, 335, 5303, 502, 4867, 31577, 33022, 1250, 1528, 30646, 29568, 15490, 17368, 5423, 39933, 2203, 41872, 2967, 33342, 8781, 22553, 26366, 5024 ]	[ 0.156982421875, 0.10430908203125, 0.2083740234375, 0.234130859375, 0.1221923828125, 0.080810546875, 0.212890625, 0.058929443359375, 0.1368408203125, 0.1256103515625, 0.1839599609375, 0.1529541015625, 0.1029052734375, 0.1407470703125, 0.0290374755859375, 0.044219970703125, 0.084716796...	embed
36272417_c0	36272417	prolog	0	Title: Does the predicate `contracting/1` restore deleted inconsistent values? Problem title: Does the predicate `contracting/1` restore deleted inconsistent values? Tags: clpfd, dynamic, prolog Problem: Does the predicate `contracting/1` restore deleted inconsistent values? This question is subsequent to another one I...	Does the predicate `contracting/1` restore deleted inconsistent values? Does the predicate `contracting/1` restore deleted inconsistent values? clpfd dynamic prolog Does Does the predicate `contracting/1` restore deleted inconsistent values? This question is subsequent to another one I posted earlier on custom labeling...	[ 0.006500244140625, 0.0009307861328125, 0.002532958984375, 0.006439208984375, -0.0294189453125, 0.0235595703125, 0.004302978515625, 0.0113525390625, 0.01904296875, 0.00323486328125, 0.0054931640625, -0.0030670166015625, 0.01116943359375, 0.00099945068359375, 0.0419921875, 0.005096435546...	[ 101790, 1653, 2063, 67, 184103, 214, 11583, 14359, 107, 154109, 23, 25553, 6892, 142424, 71, 18, 39557, 84079, 502, 4867, 114122, 67967, 1250, 18264, 11814, 7103, 34292, 95486, 77336, 73, 1295, 77758, 28123, 2822, 4420, 125728 ]	[ 0.057373046875, 0.1407470703125, 0.1669921875, 0.06329345703125, 0.191650390625, 0.1474609375, 0.18212890625, 0.1763916015625, 0.1107177734375, 0.14892578125, 0.096923828125, 0.1484375, 0.1875, 0.161376953125, 0.039886474609375, 0.044677734375, 0.00958251953125, 0.1229248046875, ...	embed
61509075_c0	61509075	prolog	0	Title: Can use a head variable as a functor name in a body? Problem title: Can use a head variable as a functor name in a body? Tags: prolog Problem: Can use a head variable as a functor name in a body? Prolog lets us unify compound terms to variables: token(1,2,3). token(4,5,6). token_term(Term, X, Y, Z) :- Term=token...	Can use a head variable as a functor name in a body? Can use a head variable as a functor name in a body? prolog Can token_term Term Can use a head variable as a functor name in a body? Prolog lets us unify compound terms to variables: How can we make a more general version for any functor name: It seems the following ...	[ 0.039794921875, 0.00921630859375, 0.012451171875, -0.0054931640625, -0.004364013671875, -0.00787353515625, -0.00335693359375, 0.00927734375, 0.002197265625, -0.052734375, 0.013427734375, 0.0157470703125, 0.00162506103515625, -0.0038909912109375, 0.0174560546875, -0.027587890625, 0.00...	[ 4171, 4527, 10336, 77336, 237, 7477, 18770, 9351, 14361, 23, 502, 4867, 47, 1098, 32166, 2994, 10, 1250, 2633, 51, 40383, 217773, 69407, 4537, 11389, 25632, 959, 107003, 6002, 86531 ]	[ 0.061767578125, 0.11279296875, 0.22314453125, 0.271240234375, 0.0633544921875, 0.19287109375, 0.1981201171875, 0.1544189453125, 0.1697998046875, 0.0350341796875, 0.04388427734375, 0.2037353515625, 0.0875244140625, 0.1593017578125, 0.1505126953125, 0.1082763671875, 0.008514404296875, ...	embed
18561323_c0	18561323	prolog	0	Title: Prolog error: Predicate Protected Problem title: Prolog error: Predicate Protected Tags: win-prolog, prolog, predicate Problem: Prolog error: Predicate Protected I'm new to prolog and I'm trying to write a predicate that returns "Yes" if two train stations are on the same line. line(1,[a,b,c,d,e]); line(2,[b,g,f...	Prolog error: Predicate Protected Prolog error: Predicate Protected win-prolog prolog predicate Prolog Predicate Protected same_line Prolog error: Predicate Protected I'm new to prolog and I'm trying to write a predicate that returns "Yes" if two train stations are on the same line. Example: ?- same_line(n,j). Yes Howe...	[ -0.000949859619140625, 0.00213623046875, -0.0002803802490234375, -0.000431060791015625, -0.00823974609375, 0.01263427734375, 0.011962890625, 0.0078125, 0.017822265625, -0.060302734375, -0.0087890625, 0.025634765625, 0.0086669921875, -0.01202392578125, 0, 0.015625, -0.005859375, 0.0...	[ 1250, 4867, 18499, 7145, 2063, 67, 127942, 297, 19916, 3454, 502, 1653, 5701, 2256, 3525, 31577, 33022, 30646, 91480, 2174, 6626, 25550, 29398, 13315, 89536, 705, 19, 170, 32635, 108568, 47970, 47510, 9969, 49725, 212059, 12661, 20594, 44691 ...	[ 0.1839599609375, 0.230712890625, 0.1806640625, 0.2115478515625, 0.246826171875, 0.1446533203125, 0.241455078125, 0.1285400390625, 0.1239013671875, 0.1219482421875, 0.1334228515625, 0.1824951171875, 0.1392822265625, 0.1707763671875, 0.023651123046875, 0.032318115234375, 0.10986328125,...	embed
35857498_c0	35857498	prolog	0	Title: How to automate semicolon in Prolog Problem title: How to automate semicolon in Prolog Tags: syntax, prolog-toplevel, prolog Problem: How to automate semicolon in Prolog I am learning about Prolog in class and was shown a way to automatically press the semicolon key until there are no more solutions. I have trie...	How to automate semicolon in Prolog How to automate semicolon in Prolog syntax prolog-toplevel prolog How Prolog How to automate semicolon in Prolog I am learning about Prolog in class and was shown a way to automatically press the semicolon key until there are no more solutions. I have tried searching on Google but I ...	[ -0.003753662109375, 0.0272216796875, 0.01385498046875, 0.0361328125, -0.0238037109375, 0.0189208984375, -0.0009918212890625, -0.007537841796875, -0.005126953125, -0.033447265625, 0.0263671875, -0.006591796875, -0.0017547607421875, 0.0186767578125, 0.00665283203125, -0.0196533203125, ...	[ 11249, 11408, 13, 40, 46029, 4759, 23, 1250, 4867, 86531, 502, 13784, 67919, 18507, 191082, 24234, 22799, 24189, 110, 1286, 51347, 1815, 27781, 7413, 5584, 127887, 2819, 128019, 141377, 15490, 119140 ]	[ 0.021453857421875, 0.2249755859375, 0.061279296875, 0.121337890625, 0.1915283203125, 0.205810546875, 0.040740966796875, 0.1563720703125, 0.2374267578125, 0.054840087890625, 0.07867431640625, 0.008056640625, 0.06378173828125, 0.047515869140625, 0.16015625, 0.1328125, 0.15478515625, ...	embed
65343982_c0	65343982	prolog	0	Title: DCG reversing a string of binary bits Problem title: DCG reversing a string of binary bits Tags: prolog, dcg Problem: DCG reversing a string of binary bits I want to write a (Prolog) DCG which takes in strings of the form a2rev(a) where a is a string of binary bits, e.g. 1012101, 001121100, 0111002001110. My ide...	DCG reversing a string of binary bits DCG reversing a string of binary bits prolog dcg DCG a2rev DCG reversing a string of binary bits I want to write a (Prolog) DCG which takes in strings of the form a2rev(a) where a is a string of binary bits, e.g. 1012101, 001121100, 0111002001110. My idea was the following : This d...	[ 0.00811767578125, 0.01708984375, 0.00225830078125, 0.0267333984375, -0.0027008056640625, 0.032958984375, 0.0045166015625, -0.002288818359375, 0.0294189453125, -0.0108642578125, -0.0162353515625, 0.00531005859375, -0.005401611328125, 0.014404296875, 0.0146484375, 0.0111083984375, 0.01...	[ 391, 56367, 39531, 6953, 79315, 111, 2394, 6635, 4785, 502, 4867, 104, 238, 177, 10, 304, 65381, 3444, 33022, 10752, 51776, 23, 3173, 11, 7440, 83, 209, 1530, 35046, 34479, 129697, 3559, 136485, 38824, 36053, 6528, 25632, 3293, 22027, 18,...	[ 0.098388671875, 0.2252197265625, 0.231201171875, 0.0657958984375, 0.199462890625, 0.03350830078125, 0.1514892578125, 0.0963134765625, 0.1695556640625, 0.1026611328125, 0.1915283203125, 0.041961669921875, 0.0325927734375, 0.03582763671875, 0.115478515625, 0.0980224609375, 0.2301025390...	embed
43779483_c0	43779483	prolog	0	Title: Counting adjacent duplicates in scheme and prolog Problem title: Counting adjacent duplicates in scheme and prolog Tags: scheme, prolog Problem: Counting adjacent duplicates in scheme and prolog I am new to scheme and prolog and have done only a few basic problems. I need to write a function in scheme and prolog...	Counting adjacent duplicates in scheme and prolog Counting adjacent duplicates in scheme and prolog scheme prolog Counting Count Counting adjacent duplicates in scheme and prolog I am new to scheme and prolog and have done only a few basic problems. I need to write a function in scheme and prolog for counting adjacent ...	[ 0.0107421875, -0.0031585693359375, 0.0011138916015625, -0.004180908203125, -0.006988525390625, 0.0074462890625, -0.013671875, 0.00069427490234375, 0.01031494140625, -0.03466796875, -0.033203125, 0.0003490447998046875, -0.0017547607421875, 0.017578125, 0.02734375, -0.00087738037109375, ...	[ 1311, 128396, 123594, 16797, 171763, 1636, 23, 150370, 136, 502, 4867, 108210, 3525, 62822, 44402, 3871, 33022, 32354, 54529, 214, 456, 64240, 69098, 5303, 89536, 242, 41600, 106, 116, 138, 4879, 76199, 86827, 4958, 8439, 18151, 5368, 18244, ...	[ 0.136474609375, 0.148681640625, 0.171142578125, 0.2135009765625, 0.280029296875, 0.1593017578125, 0.0284423828125, 0.2049560546875, 0.0804443359375, 0.1341552734375, 0.1912841796875, 0.1788330078125, 0.02703857421875, 0.020050048828125, 0.04034423828125, 0.056396484375, 0.08410644531...	embed
73552532_c0	73552532	prolog	0	Title: Getting possible product combinations of number in a list Prolog Problem title: Getting possible product combinations of number in a list Prolog Tags: list, prolog, sudoku, clpfd Problem: Getting possible product combinations of number in a list Prolog I am using constraint logic programming and I want to output...	Getting possible product combinations of number in a list Prolog Getting possible product combinations of number in a list Prolog list prolog sudoku clpfd Getting Prolog Getting possible product combinations of number in a list Prolog I am using constraint logic programming and I want to output a list with the product ...	[ -0.02099609375, 0.0203857421875, -0.0087890625, 0.025634765625, -0.0233154296875, -0.0035400390625, -0.024169921875, 0.0047607421875, -0.005279541015625, -0.01556396484375, -0.015625, -0.0021514892578125, -0.00101470947265625, 0.01220703125, -0.00506591796875, 0.0108642578125, 0.0039...	[ 210732, 7722, 12996, 162515, 7, 111, 14012, 23, 5303, 1250, 4867, 502, 8932, 38067, 33139, 39557, 71, 17368, 158, 2816, 4288, 62775, 56037, 3444, 140992, 10, 678, 158928, 5117, 12830, 105950, 47, 2357, 305, 101, 2806, 201, 707, 116, 31577...	[ 0.10546875, 0.1988525390625, 0.25537109375, 0.23046875, 0.07244873046875, 0.0111083984375, 0.177734375, 0.049285888671875, 0.2174072265625, 0.1448974609375, 0.2406005859375, 0.09759521484375, 0.111083984375, 0.2069091796875, 0.004730224609375, 0.0538330078125, 0.04962158203125, 0.0...	embed
45612584_c0	45612584	prolog	0	Title: Tokenize math expression - error undefined procedure Problem title: Tokenize math expression - error undefined procedure Tags: prolog Problem: Tokenize math expression - error undefined procedure I am trying to tokenize math expression from user's input. I have written this code, but I don't understand, why the ...	Tokenize math expression - error undefined procedure Tokenize math expression - error undefined procedure prolog Tokenize input_infix Enter Input Chars ERROR Undefined _1236 notation.pl:4 Tokenize math expression - error undefined procedure I am trying to tokenize math expression from user's input. I have written this ...	[ 0.006561279296875, -0.004241943359375, -0.005462646484375, 0.0087890625, 0.00011396408081054688, 0.010986328125, 0.0003070831298828125, 0.0125732421875, -0.0084228515625, -0.036376953125, 0.007415771484375, 0.01300048828125, -0.01116943359375, -0.006195068359375, 0.01214599609375, -0.0...	[ 717, 1098, 20650, 48909, 125195, 18499, 9232, 5983, 50491, 502, 4867, 107730, 73, 55923, 60816, 360, 7077, 21656, 151206, 24638, 79912, 1530, 8659, 110, 22062, 2424, 617, 297, 31577, 47, 1295, 38937, 59121, 18151, 28219, 15400, 1653, 2063, ...	[ 0.143798828125, 0.219970703125, 0.213623046875, 0.1541748046875, 0.219970703125, 0.1839599609375, 0.093505859375, 0.1690673828125, 0.1942138671875, 0.0889892578125, 0.1163330078125, 0.160400390625, 0.0261993408203125, 0.18505859375, 0.1173095703125, 0.02001953125, 0.0936279296875, ...	embed
8779114_c0	8779114	prolog	0	Title: arithmetic computer Problem title: arithmetic computer Tags: prolog, dcg Problem: arithmetic computer I need some help in prolog, which is pretty new to me. I have to design a small arithmetic computer. The expression to be evaluated will be represented as a list for example: ?-evaluate([2,+,4,,5,+,1,,2,*,3],R...	arithmetic computer arithmetic computer prolog dcg arithmetic computer I need some help in prolog, which is pretty new to me. I have to design a small arithmetic computer. The expression to be evaluated will be represented as a list for example: I am trying to do this by designing two predicates one called parse to tra...	[ -0.006439208984375, 0.00396728515625, -0.00107574462890625, 0.0289306640625, 0.0037689208984375, 0.025146484375, -0.004180908203125, -0.0033721923828125, 0.0107421875, -0.0306396484375, -0.01904296875, -0.0002689361572265625, 0.0033416748046875, -0.01165771484375, -0.00897216796875, -0...	[ 187, 8962, 282, 9523, 13909, 502, 4867, 104, 238, 177, 87, 3871, 3060, 4358, 23, 28875, 3525, 163, 4331, 19336, 125195, 47, 151575, 297, 1221, 33636, 237, 5303, 27781, 31577, 6626, 1653, 2063, 35839, 366, 184, 27198, 70, 44402, 2831, 18...	[ 0.04345703125, 0.1448974609375, 0.1292724609375, 0.123291015625, 0.1812744140625, 0.172119140625, 0.239990234375, 0.02276611328125, 0.025634765625, 0.1165771484375, 0.008148193359375, 0.0877685546875, 0.000152587890625, 0.134033203125, 0.04693603515625, 0.012939453125, 0.059295654296...	embed
22857912_c0	22857912	prolog	0	Title: prolog predicates - swap Problem title: prolog predicates - swap Tags: prolog Problem: prolog predicates - swap I have an exam in Prolog today and am revising for it using old questions. Would answer c be the incorrect answer? Can anyone please explain this to me? It would be very helpful. Thank you, Consider th...	prolog predicates - swap prolog predicates - swap prolog prolog predicates - swap I have an exam in Prolog today and am revising for it using old questions. Would answer c be the incorrect answer? Can anyone please explain this to me? It would be very helpful. Thank you, Consider the following predicate: Which of the f...	[ 0.00122833251953125, 0.0140380859375, 0.0033111572265625, -0.013427734375, -0.0257568359375, 0.004638671875, -0.01904296875, -0.00592041015625, -0.01226806640625, 0.0260009765625, 0.00811767578125, 0.0184326171875, -0.0140380859375, 0.0037841796875, 0.00543212890625, 0.01361083984375, ...	[ 502, 4867, 1653, 2063, 1636, 202317, 42276, 1250, 18925, 15226, 17368, 10332, 17582, 35166, 501, 214552, 73342, 137399, 67, 25632, 41, 1294, 136, 80836, 83 ]	[ 0.1837158203125, 0.244140625, 0.20166015625, 0.2440185546875, 0.150146484375, 0.252685546875, 0.1009521484375, 0.1517333984375, 0.01220703125, 0.0479736328125, 0.007537841796875, 0.06768798828125, 0.1180419921875, 0.1348876953125, 0.086181640625, 0.19873046875, 0.029052734375, 0.00...	embed
1544826_c0	1544826	prolog	0	Title: Prolog Problem with "is" function Problem title: Prolog Problem with "is" function Tags: prolog Problem: Prolog Problem with "is" function I am having a problem with prolog that I do not understand. I have used the tracer to follow the problem, and this is what happens .... (8) 8 NEXT value(d...	Prolog Problem with "is" function Prolog Problem with "is" function prolog Prolog Problem NEXT Orly EXIT CALL error_handler sepia_kernel Prolog Problem with "is" function I am having a problem with prolog that I do not understand. I have used the tracer to follow the problem, and this is what happen...	[ 0.00457763671875, -0.00122833251953125, -0.0057373046875, -0.01904296875, -0.018310546875, 0.01043701171875, -0.01031494140625, -0.0306396484375, 0.00634765625, -0.034423828125, 0.01513671875, 0.0145263671875, -0.00909423828125, -0.006866455078125, 0.0181884765625, -0.00012302398681640...	[ 1250, 4867, 15649, 678, 164, 32354, 502, 9960, 70981, 3347, 538, 29426, 6371, 313, 66437, 18499, 74258, 40, 12455, 72083, 2967, 28219, 1152, 3443, 28960, 96276, 44691, 11782, 683, 83, 27226 ]	[ 0.1568603515625, 0.269775390625, 0.130859375, 0.0535888671875, 0.215576171875, 0.1943359375, 0.1116943359375, 0.03704833984375, 0.092041015625, 0.1319580078125, 0.1741943359375, 0.1112060546875, 0.08795166015625, 0.047332763671875, 0.1324462890625, 0.110107421875, 0.1517333984375, ...	embed
72169915_c0	72169915	prolog	0	Title: How does the '!' (cut) operator exactly work in Prolog? Problem title: How does the '!' (cut) operator exactly work in Prolog? Tags: prolog-cut, prolog Problem: How does the '!' (cut) operator exactly work in Prolog? I'm learning Prolog and I'm having some difficulties to understand how this ...	How does the '!' (cut) operator exactly work in Prolog? How does the '!' (cut) operator exactly work in Prolog? prolog-cut prolog How Prolog How does the '!' (cut) operator exactly work in Prolog? I'm learning Prolog and I'm having some difficulties to understand how this particular operator works. ...	[ 0.0439453125, 0.0191650390625, 0.033203125, 0.0098876953125, 0.00433349609375, 0.0189208984375, -0.002349853515625, -0.0032501220703125, 0.009033203125, -0.006927490234375, -0.0067138671875, -0.0130615234375, -0.00738525390625, -0.003662109375, 0.01141357421875, 0.00323486328125, -0....	[ 11249, 14602, 70, 54764, 3768, 74, 38, 19774, 16, 39933, 66161, 4488, 23, 1250, 4867, 502, 25, 15, 52080, 19441, 34844, 3387, 47, 28219, 3642, 903, 17311, 43240, 30745, 442, 7, 11814, 7279, 4420, 125728, 214, 20271, 195625, 54613, 53, 4...	[ 0.135498046875, 0.124755859375, 0.09222412109375, 0.01031494140625, 0.169677734375, 0.0299072265625, 0.22021484375, 0.267578125, 0.10205078125, 0.265869140625, 0.175537109375, 0.1873779296875, 0.1085205078125, 0.2135009765625, 0.296875, 0.1400146484375, 0.0236358642578125, 0.021697...	embed
42490764_c0	42490764	prolog	0	Title: how to generate all combinations of 2 lists in prolog Problem title: how to generate all combinations of 2 lists in prolog Tags: prolog Problem: how to generate all combinations of 2 lists in prolog I need to generate combinations of 2 lists which have 4 elements each. For example, list([1,2,3,4],[x,y,w,z],L). s...	how to generate all combinations of 2 lists in prolog how to generate all combinations of 2 lists in prolog prolog how to generate all combinations of 2 lists in prolog I need to generate combinations of 2 lists which have 4 elements each. For example, list([1,2,3,4],[x,y,w,z],L). should return L = [(1,x),(1,y),(1,w),(...	[ -0.0072021484375, 0.027587890625, -0.000331878662109375, 0.00933837890625, -0.00799560546875, 0.028076171875, -0.0247802734375, 0.0069580078125, 0.001312255859375, -0.037841796875, 0.00787353515625, -0.005279541015625, 0.022705078125, 0.0135498046875, -0.0032501220703125, 0.00078201293...	[ 3642, 47, 139392, 756, 162515, 7, 111, 116, 5303, 23, 502, 4867, 3871, 201, 80854, 12638, 133063, 82449, 53, 434, 169, 866, 5608, 30646, 339, 2203, 425, 35166, 18151, 28412, 959, 26785, 30022 ]	[ 0.059326171875, 0.03216552734375, 0.2244873046875, 0.1510009765625, 0.2445068359375, 0.122314453125, 0.07476806640625, 0.1641845703125, 0.2332763671875, 0.053253173828125, 0.1590576171875, 0.2171630859375, 0.017303466796875, 0.130859375, 0.131103515625, 0.00213623046875, 0.0446166992...	embed
52955498_c0	52955498	prolog	0	Title: encoding given input using prolog Problem title: encoding given input using prolog Tags: prolog Problem: encoding given input using prolog count([_],[],1). count(H,[H1\|T],N):- count(H1,T,N1),(H = H1 -> N is N1+1 ; H \=H1 -> N is 1). encode([]). encode([H\|T]):- count(H,T,N1),encode(T),write("["),write(N1),write("...	encoding given input using prolog encoding given input using prolog prolog prolog Encoded Output encoding given input using prolog Above is my Prolog code to count and print the consecutive occurrence of the letters and giving the out put in desired manner. For example if Sample Input: should return	[ 0.0294189453125, 0.000942230224609375, -0.0167236328125, 0.02001953125, -0.006011962890625, 0.007354736328125, -0.00970458984375, 0.03173828125, -0.00738525390625, -0.023681640625, -0.006500244140625, -0.031494140625, 0.0022735595703125, 0.0255126953125, 0.00124359130859375, -0.0049133...	[ 22, 587, 6238, 34475, 107730, 17368, 502, 4867, 357, 40899, 71, 13538, 7077, 92437, 759, 1250, 18151, 54529, 28412, 148390, 74918, 42, 6620, 120820, 68772, 1810, 3884, 104851, 144996, 2174, 947, 33209, 360, 5608, 30646 ]	[ 0.07757568359375, 0.186279296875, 0.10882568359375, 0.1468505859375, 0.194091796875, 0.06744384765625, 0.1563720703125, 0.2099609375, 0.044891357421875, 0.2056884765625, 0.024993896484375, 0.13330078125, 0.11907958984375, 0.03131103515625, 0.004825592041015625, 0.1395263671875, 0.131...	embed
4261014_c0	4261014	prolog	0	Title: predicate with Prolog Problem title: predicate with Prolog Tags: prolog Problem: predicate with Prolog I have to write a program which has a predicate p(A,B,C,D,E,F) . A,B,C,D,E,F are lists. A contains D, E and F. (Something like A and B is D, A and C is E) F contains A without D and E. And also elements in list...	predicate with Prolog predicate with Prolog prolog Prolog predicate with Prolog I have to write a program which has a predicate p(A,B,C,D,E,F) . A,B,C,D,E,F are lists. A contains D, E and F. (Something like A and B is D, A and C is E) F contains A without D and E. And also elements in list F are in pairs (example if A ...	[ 0.0235595703125, 0.0103759765625, -0.0004673004150390625, 0.0017242431640625, -0.0174560546875, 0.0322265625, -0.01409912109375, -0.00994873046875, 0.00011014938354492188, -0.0145263671875, 0.016357421875, -0.01336669921875, -0.00714111328125, -0.01165771484375, 0.0023956298828125, 0.0...	[ 1653, 2063, 67, 678, 1250, 4867, 502, 87, 765, 47, 33022, 1528, 1556, 915, 284, 571, 441, 397, 647, 919, 62, 621, 5303, 70541, 391, 241, 136, 563, 1884, 335, 313, 15490, 80854, 80836, 11, 4034, 57143, 2046, 442, 27781 ]	[ 0.21435546875, 0.2490234375, 0.137939453125, 0.1181640625, 0.18896484375, 0.251220703125, 0.1375732421875, 0.016845703125, 0.03558349609375, 0.0233612060546875, 0.151123046875, 0.197998046875, 0.0206146240234375, 0.1136474609375, 0.021392822265625, 0.02545166015625, 0.026077270507812...	embed
2659713_c0	2659713	prolog	0	Title: Can you do Logic Programming in Scala? Problem title: Can you do Logic Programming in Scala? Tags: prolog, scala, programming-languages, logic-programming, language-features Problem: Can you do Logic Programming in Scala? I read somewhere that Pattern Matching like that supported by the match/case feature in Sca...	Can you do Logic Programming in Scala? Can you do Logic Programming in Scala? prolog scala programming-languages logic-programming language-features Can Logic Programming Scala Can you do Logic Programming in Scala? I read somewhere that Pattern Matching like that supported by the match/case feature in Scala was actual...	[ 0.0113525390625, 0.0260009765625, 0.009765625, 0.013671875, -0.007415771484375, -0.00830078125, -0.025146484375, 0.006072998046875, -0.0069580078125, -0.049560546875, 0.007598876953125, -0.01434326171875, -0.0079345703125, -0.010009765625, 0.0247802734375, -0.0003452301025390625, 0.0...	[ 4171, 398, 54, 50592, 238, 27958, 214, 23, 152653, 11, 502, 4867, 146232, 56037, 449, 196651, 62775, 28966, 46876, 88981, 12301, 9876, 22766, 67407, 1884, 8060, 14858, 58437, 60213, 20653, 3017, 15555, 1250, 4527, 27650, 86869, 44402, 62448, ...	[ 0.1243896484375, 0.09539794921875, 0.1259765625, 0.251220703125, 0.147216796875, 0.225830078125, 0.1287841796875, 0.1103515625, 0.2484130859375, 0.1949462890625, 0.06451416015625, 0.2227783203125, 0.2271728515625, 0.1407470703125, 0.04632568359375, 0.1138916015625, 0.207275390625, ...	embed
37232679_c1	37232679	prolog	1	? I have a set of garbage cans (which have a name, type, location, capacity). The idea is that given a zone (that has several locations) I could get the sum of all the capacities over 90 from the garbage cans in that area. So ecoZona would grab the zone and "send it" to listaEcos, this one would split the list of garba...	? I have a set of garbage cans (which have a name, type, location, capacity). The idea is that given a zone (that has several locations) I could get the sum of all the capacities over 90 from the garbage cans in that area. So ecoZona would grab the zone and "send it" to listaEcos, this one would split the list of garba...	[ 0.01202392578125, 0.0076904296875, -0.00738525390625, 0.027099609375, -0.005096435546875, 0.0186767578125, -0.0263671875, 0.024169921875, 0.017333984375, -0.00958251953125, 0.01513671875, -0.005950927734375, 0.00421142578125, -0.015380859375, 0.0020599365234375, -0.00262451171875, 0....	[ 705, 87, 765, 5423, 111, 3671, 402, 429, 831, 7, 9351, 10644, 31913, 177399, 6528, 83, 34475, 20288, 40368, 5809, 2046, 10554, 756, 139049, 31075, 645, 2510, 16128, 49347, 1511, 2477, 2806, 59102, 39285, 5875, 132570, 65450, 5303, 183871, ...	[ 0.0841064453125, 0.02398681640625, 0.04669189453125, 0.0833740234375, 0.00860595703125, 0.0968017578125, 0.1805419921875, 0.1180419921875, 0.1968994140625, 0.110107421875, 0.044097900390625, 0.111083984375, 0.1702880859375, 0.19775390625, 0.143310546875, 0.028717041015625, 0.03053283...	embed
49066838_c0	49066838	prolog	0	Title: Depth First Search, my code cant find the path Problem title: Depth First Search, my code cant find the path Tags: depth-first-search, prolog Problem: Depth First Search, my code cant find the path I tried this code for depth first search in Prolog, but it is not complete. It did not show the path. This is my tr...	Depth First Search, my code cant find the path Depth First Search, my code cant find the path depth-first-search prolog Depth First Search Depth First Search, my code cant find the path I tried this code for depth first search in Prolog, but it is not complete. It did not show the path. This is my tree and Roles for de...	[ 0.033935546875, 0.013916015625, 0.0181884765625, 0.023681640625, 0.01214599609375, 0.01031494140625, -0.01373291015625, 0.00396728515625, -0.0145263671875, -0.030029296875, 0.006439208984375, -0.022216796875, -0.01007080078125, 0.0255126953125, 0.0145263671875, 0.0033111572265625, 0....	[ 262, 254, 927, 23972, 33086, 759, 18151, 45767, 7413, 70, 60875, 168867, 13448, 271, 86250, 502, 4867, 37842, 903, 5117, 33938, 1250, 1284, 83, 959, 28484, 7639, 3293, 53201, 136, 2777, 1577 ]	[ 0.139404296875, 0.2017822265625, 0.1331787109375, 0.18603515625, 0.22607421875, 0.0380859375, 0.1851806640625, 0.1351318359375, 0.162353515625, 0.0323486328125, 0.2230224609375, 0.2489013671875, 0.1260986328125, 0.08990478515625, 0.1748046875, 0.1192626953125, 0.2086181640625, 0.06...	embed
21263067_c0	21263067	prolog	0	Title: PROLOG how to "connect" similar objects Problem title: PROLOG how to "connect" similar objects Tags: transitive-closure, prolog Problem: PROLOG how to "connect" similar objects Hey im new to prolog and was wondering: Let's say i have this code: component(a,b). component(a,c). component(a,d). ...	PROLOG how to "connect" similar objects PROLOG how to "connect" similar objects transitive-closure prolog PROLOG PROLOG how to "connect" similar objects Hey im new to prolog and was wondering: Let's say i have this code: and i want to create an argument consistsof(X,Y):- component(X,Y); component(Y,...	[ 0.01104736328125, 0.007049560546875, 0.0172119140625, 0.0185546875, -0.01446533203125, 0.02587890625, -0.043212890625, 0.004730224609375, 0.0052490234375, -0.040283203125, 0.002532958984375, -0.0283203125, -0.007598876953125, 0.006439208984375, -0.0089111328125, -0.02099609375, -0.01...	[ 10514, 47510, 3642, 47, 135457, 21373, 36746, 62621, 5844, 170224, 502, 4867, 58, 7, 28240, 566, 3525, 149016, 18151, 3444, 28282, 10750, 58055, 54304, 1542, 1723, 82761, 1511, 76199, 163, 990, 1369, 876, 238, 420, 2046, 16750, 11, 1001, ...	[ 0.163330078125, 0.242919921875, 0.05780029296875, 0.03704833984375, 0.2347412109375, 0.2293701171875, 0.21533203125, 0.1221923828125, 0.080322265625, 0.173583984375, 0.12890625, 0.2088623046875, 0.006561279296875, 0.044921875, 0.00274658203125, 0.002899169921875, 0.0175323486328125, ...	embed
43111832_c1	43111832	prolog	1	help is greatly appreciated. EDITED The intention of this exercise is to write rules such that you can complete this family tree, though only minimal facts are given. As you can see, it only states that Warren is the father of Jerry, and from brother and sister facts, we know Jerry is the brother of Stuart and Kather....	help is greatly appreciated. EDITED The intention of this exercise is to write rules such that you can complete this family tree, though only minimal facts are given. As you can see, it only states that Warren is the father of Jerry, and from brother and sister facts, we know Jerry is the brother of Stuart and Kather....	[ 0.01708984375, 0.015869140625, -0.010009765625, 0.01190185546875, -0.0341796875, -0.002716064453125, -0.001922607421875, 0.0036468505859375, 0.024658203125, -0.048583984375, 0.006622314453125, -0.01312255859375, 0.00110626220703125, 0.03173828125, 0.016357421875, -0.00677490234375, 0...	[ 4358, 77947, 172864, 91177, 81979, 33022, 91736, 6044, 831, 28484, 903, 14449, 53201, 21208, 4734, 20187, 15824, 34475, 1957, 117249, 171458, 83, 70, 67373, 111, 138171, 1295, 82953, 136, 114015, 211524, 1136, 9319, 79986, 49129, 4390, 1542, ...	[ 0.084716796875, 0.02874755859375, 0.026214599609375, 0.10498046875, 0.11962890625, 0.160400390625, 0.1636962890625, 0.02740478515625, 0.00152587890625, 0.1201171875, 0.031158447265625, 0.1363525390625, 0.2183837890625, 0.007598876953125, 0.03082275390625, 0.12060546875, 0.1181640625,...	embed
19623302_c0	19623302	prolog	0	Title: Why am I getting a type error on pi in Prolog? Problem title: Why am I getting a type error on pi in Prolog? Tags: iso-prolog, prolog, pi Problem: Why am I getting a type error on pi in Prolog? I am using pi as part of a Prolog program I am writing. Here is my only mention of pi in the whole program: ArcDistance...	Why am I getting a type error on pi in Prolog? Why am I getting a type error on pi in Prolog? iso-prolog prolog pi Why Prolog ArcDistance Degree Diameter type_error Why am I getting a type error on pi in Prolog? I am using pi as part of a Prolog program I am writing. Here is my only mention of pi in the whole program: ...	[ -0.004669189453125, -0.0023651123046875, 0.0079345703125, -0.01031494140625, -0.008544921875, -0.013916015625, -0.00006008148193359375, -0.00927734375, -0.01153564453125, -0.053466796875, -0.009033203125, -0.01214599609375, -0.01544189453125, -0.006927490234375, 0.017333984375, 0.01208...	[ 44084, 444, 87, 20949, 10644, 18499, 98, 2147, 23, 1250, 4867, 10, 13882, 3454, 502, 51210, 14055, 116071, 262, 7134, 4512, 29089, 188800, 17368, 2831, 1528, 32562, 4734, 41392, 28271, 11675, 2046, 25632, 2022, 44691, 159029, 223, 4358 ]	[ 0.0947265625, 0.0221099853515625, 0.004241943359375, 0.044921875, 0.2257080078125, 0.208984375, 0.06622314453125, 0.2425537109375, 0.04022216796875, 0.14453125, 0.2315673828125, 0.003753662109375, 0.06451416015625, 0.103515625, 0.10418701171875, 0.090087890625, 0.09423828125, 0.089...	embed
66561076_c0	66561076	prolog	0	Title: list processing in Prolog Problem title: list processing in Prolog Tags: prolog Problem: list processing in Prolog I am new to prolog and I'm having trouble with this problem. I am taking a sentence as input and put [Anne,do,you,know] in front of the sentence and replace any occurrence of you to I. For example c...	list processing in Prolog list processing in Prolog prolog Prolog Head Tail TailX Anne list processing in Prolog I am new to prolog and I'm having trouble with this problem. I am taking a sentence as input and put [Anne,do,you,know] in front of the sentence and replace any occurrence of you to I. For example copycat([y...	[ -0.0019989013671875, 0.007354736328125, 0.015380859375, 0.036376953125, 0.00171661376953125, 0.0029754638671875, 0.00811767578125, 0.005218505859375, 0.009765625, -0.01470947265625, 0.0225830078125, -0.0206298828125, -0.0196533203125, 0.015625, 0.0130615234375, -0.0042724609375, 0.01...	[ 5303, 9433, 1250, 4867, 214, 23, 502, 44816, 1218, 379, 1542, 14245, 3525, 63134, 2967, 35971, 149357, 237, 107730, 3884, 7251, 86, 246, 53927, 69723, 12912, 91995, 2499, 74918, 111, 398, 47, 87, 1326, 43658, 4460, 25003, 282, 1193, 16, ...	[ 0.2286376953125, 0.1474609375, 0.17041015625, 0.249755859375, 0.04364013671875, 0.004302978515625, 0.1304931640625, 0.08880615234375, 0.0994873046875, 0.0933837890625, 0.1292724609375, 0.246826171875, 0.021484375, 0.07513427734375, 0.05987548828125, 0.04693603515625, 0.1727294921875,...	embed
17349357_c0	17349357	prolog	0	Title: prolog, how to correctly use escape sequences Problem title: prolog, how to correctly use escape sequences Tags: yap, prolog Problem: prolog, how to correctly use escape sequences I need (for design choices) to obtain a list who respects the following pattern: Uses = ['foo\/1', 'foobar\/2']. I'm able to build up...	prolog, how to correctly use escape sequences prolog, how to correctly use escape sequences yap prolog Uses Module prolog, how to correctly use escape sequences I need (for design choices) to obtain a list who respects the following pattern: I'm able to build up the name/number pattern doing: where rule is an internal ...	[ 0.02490234375, 0.007293701171875, 0.004119873046875, 0.01275634765625, -0.039306640625, 0.0269775390625, 0.005218505859375, 0.0198974609375, 0.0159912109375, -0.0341796875, 0.01165771484375, -0.0216064453125, -0.000881195068359375, 0.0164794921875, 0.000873565673828125, 0.0032958984375...	[ 502, 4867, 3642, 47, 26785, 538, 4527, 144281, 40, 26513, 5170, 15850, 36836, 63014, 3871, 4331, 44126, 113054, 5303, 15072, 25632, 103510, 19048, 45367, 1257, 9351, 2606, 1297, 79986, 70796, 15824, 345, 425, 14865, 114942, 72546, 17368, 64, ...	[ 0.163330078125, 0.2347412109375, 0.059783935546875, 0.014312744140625, 0.1220703125, 0.03363037109375, 0.1533203125, 0.23876953125, 0.099365234375, 0.1925048828125, 0.1064453125, 0.151611328125, 0.0450439453125, 0.09649658203125, 0.04498291015625, 0.0872802734375, 0.0247344970703125,...	embed
1801998_c0	1801998	prolog	0	Title: Parsing with DCGs in Scheme (without Prolog)? Problem title: Parsing with DCGs in Scheme (without Prolog)? Tags: dcg, scheme, parsing, prolog Problem: Parsing with DCGs in Scheme (without Prolog)? Lots of Prolog-in-Scheme implementations are out there. E.g. Kanren, Schelog. Apparently in "Paradigms of AI Program...	Parsing with DCGs in Scheme (without Prolog)? Parsing with DCGs in Scheme (without Prolog)? dcg scheme parsing prolog Parsing DCGs Scheme Prolog Parsing with DCGs in Scheme (without Prolog)? Lots of Prolog-in-Scheme implementations are out there. E.g. Kanren, Schelog. Apparently in "Paradigms of AI Programming" Norvig ...	[ 0.01470947265625, 0.00677490234375, 0.00299072265625, 0.0238037109375, 0.0035858154296875, 0.01806640625, -0.011962890625, -0.0159912109375, -0.004608154296875, -0.03515625, -0.0035858154296875, -0.005401611328125, -0.02197265625, -0.00799560546875, 0.00531005859375, 0.000579833984375,...	[ 2392, 6953, 678, 391, 56367, 7, 23, 34702, 282, 6056, 1250, 4867, 104, 238, 177, 150370, 366, 502, 73, 25452, 12549, 208124, 2685, 2734, 982, 4803, 38730, 27958, 12876, 24299, 29479, 188, 9506, 7008, 9969, 34759, 1261, 88606, 100700, 4807...	[ 0.1636962890625, 0.10052490234375, 0.08355712890625, 0.09375, 0.244140625, 0.0692138671875, 0.038177490234375, 0.1712646484375, 0.1361083984375, 0.081787109375, 0.153076171875, 0.2469482421875, 0.037567138671875, 0.0302734375, 0.121337890625, 0.1871337890625, 0.159912109375, 0.1077...	embed
47477933_c0	47477933	prolog	0	Title: output list element with more occurs in Prolog Problem title: output list element with more occurs in Prolog Tags: prolog Problem: output list element with more occurs in Prolog I would like to write a query which gives has output the element of a list which occurs more. I don't want to use the assert predicate....	output list element with more occurs in Prolog output list element with more occurs in Prolog prolog Prolog find_element output list element with more occurs in Prolog I would like to write a query which gives has output the element of a list which occurs more. I don't want to use the assert predicate. I write down thi...	[ 0.0198974609375, -0.00013446807861328125, -0.00052642822265625, 0.00811767578125, -0.0009765625, -0.005859375, -0.00128936767578125, -0.0098876953125, 0.0166015625, -0.055419921875, 0.0009613037109375, -0.0247802734375, 0.0185546875, 0.01007080078125, 0.00885009765625, -0.01123046875, ...	[ 140992, 5303, 12830, 678, 1286, 74918, 23, 1250, 4867, 502, 7413, 62766, 7, 1884, 33022, 41, 1294, 76199, 1556, 3444, 237, 33657, 1653, 2063, 67, 7565, 11343, 5117, 111, 27781 ]	[ 0.249755859375, 0.1844482421875, 0.1654052734375, 0.052642822265625, 0.2054443359375, 0.181396484375, 0.04937744140625, 0.1500244140625, 0.2364501953125, 0.1082763671875, 0.1041259765625, 0.1805419921875, 0.0239105224609375, 0.0228271484375, 0.045379638671875, 0.1015625, 0.1036987304...	embed
52802222_c1	52802222	prolog	1	4 2 Call: generate_perm([[1,2]],[3,1]) ? # 5 3 Call: member(_138349,[1,2]) ? ?# 5 3 Exit: member(1,[1,2]) ? # 6 3 Call: generate_perm([],[3,1,1]) ? # 6 3 Exit: generate_perm([],[3,1,1]) ? ?# 4 2 Exit: generate_perm([[1,2]],[3,1]) ? ?# 2 1 Exit: generate_perm([[1,2,3,4],[1,2]],[3]) ? P = [] ? So the answer is there (Cal...	4 2 Call: generate_perm([[1,2]],[3,1]) ? # 5 3 Call: member(_138349,[1,2]) ? ?# 5 3 Exit: member(1,[1,2]) ? # 6 3 Call: generate_perm([],[3,1,1]) ? # 6 3 Exit: generate_perm([],[3,1,1]) ? ?# 4 2 Exit: generate_perm([[1,2]],[3,1]) ? ?# 2 1 Exit: generate_perm([[1,2,3,4],[1,2]],[3]) ? P = [] ? So the answer is there (Cal...	[ -0.0157470703125, 0.0302734375, 0.01116943359375, 0.006622314453125, -0.01141357421875, 0.01806640625, -0.034912109375, -0.01483154296875, 0.0137939453125, -0.02734375, -0.006103515625, 0.01239013671875, 0.01611328125, 0.0302734375, -0.01806640625, -0.01348876953125, -0.01171875, -...	[ 201, 116, 26265, 12, 139392, 1264, 39, 133063, 4, 363, 76172, 190, 138, 32786, 141535, 117760, 5443, 217, 305, 106, 82449, 54968, 436, 2203, 35166, 2685, 441, 5584, 132, 418, 3688, 122101, 1284, 76199, 163, 201505, 5303, 831, 18, 26366, ...	[ 0.143798828125, 0.1466064453125, 0.211669921875, 0.0435791015625, 0.2646484375, 0.2308349609375, 0.2164306640625, 0.140380859375, 0.000579833984375, 0.0908203125, 0.06732177734375, 0.07049560546875, 0.10235595703125, 0.1871337890625, 0.1236572265625, 0.2327880859375, 0.1014404296875,...	embed
65678387_c0	65678387	prolog	0	Title: Convert complex term to List of lists and then back to term with modified functor Problem title: Convert complex term to List of lists and then back to term with modified functor Tags: functor, prolog, list Problem: Convert complex term to List of lists and then back to term with modified functor you can use =.....	Convert complex term to List of lists and then back to term with modified functor Convert complex term to List of lists and then back to term with modified functor functor prolog list Convert List Convert complex term to List of lists and then back to term with modified functor you can use =.. to convert simple terms. ...	[ 0.03466796875, 0.01458740234375, 0.00159454345703125, 0.00775146484375, -0.003143310546875, 0.000713348388671875, 0.005950927734375, -0.00003695487976074219, -0.003875732421875, -0.0115966796875, 0.005889892578125, -0.000743865966796875, -0.005157470703125, 0.02734375, 0.007080078125, ...	[ 1657, 11549, 27140, 13579, 47, 32036, 111, 5303, 7, 4420, 678, 73197, 297, 7477, 18770, 502, 4867, 831, 4527, 2203, 96760, 8781, 69407, 84797, 66211, 3444, 456, 48281, 98816 ]	[ 0.05999755859375, 0.15673828125, 0.2230224609375, 0.2020263671875, 0.0579833984375, 0.1690673828125, 0.051116943359375, 0.1766357421875, 0.0189666748046875, 0.07470703125, 0.03265380859375, 0.122802734375, 0.0196075439453125, 0.1138916015625, 0.1829833984375, 0.07696533203125, 0.1518...	embed
55079546_c0	55079546	prolog	0	Title: family tree /3 prolog Problem title: family tree /3 prolog Tags: family-tree, prolog Problem: family tree /3 prolog I'm sort of a beginner to Prolog and I have a quick question. I've built a family tree in prolog with parents(X,Y,Z). But when time comes to built uncle(Uncle,X). and aunt(Aunt,X). seems a bit diff...	family tree /3 prolog family tree /3 prolog family-tree prolog family tree /3 prolog I'm sort of a beginner to Prolog and I have a quick question. I've built a family tree in prolog with parents(X,Y,Z). But when time comes to built uncle(Uncle,X). and aunt(Aunt,X). seems a bit difficult for me. I've tried uncle(Uncle,X...	[ 0.02294921875, -0.00003933906555175781, 0.005767822265625, -0.005889892578125, -0.0264892578125, 0.006500244140625, 0.003265380859375, 0.0123291015625, 0.010498046875, -0.041748046875, -0.000759124755859375, -0.0306396484375, 0.004974365234375, 0.018310546875, 0.021484375, -0.000331878...	[ 14449, 53201, 18113, 502, 4867, 62600, 1679, 1250, 88303, 678, 27863, 1723, 1511, 51, 11030, 132, 14256, 1542, 136, 10, 9109, 37202, 4785, 34844, 100, 37842, 15772, 5117, 12600, 6700, 99547, 19095, 5701, 184345, 40368, 20028, 172337, 47644, ...	[ 0.0701904296875, 0.2042236328125, 0.13916015625, 0.1004638671875, 0.189208984375, 0.1654052734375, 0.03411865234375, 0.116455078125, 0.1488037109375, 0.043792724609375, 0.134033203125, 0.0655517578125, 0.0182647705078125, 0.1104736328125, 0.1510009765625, 0.00067138671875, 0.10351562...	embed
26449516_c1	26449516	prolog	1	Col,Row1,SolutionFile). show_result(_,_,MaxCol,_,Col,SolutionFile) :- Col > MaxCol, !. show_result(Squares,MaxRow,MaxCol,Row,Col,SolutionFile) :- ( memberchk(sq(Row,Col,X),Squares), !, open(SolutionFile,write,Stream), write(Stream,X), close(Stream) ; open(SolutionFile,write,Stream), write(Stream,'#'), close(Stream) ), ...	Col,Row1,SolutionFile). show_result(_,_,MaxCol,_,Col,SolutionFile) :- Col > MaxCol, !. show_result(Squares,MaxRow,MaxCol,Row,Col,SolutionFile) :- ( memberchk(sq(Row,Col,X),Squares), !, open(SolutionFile,write,Stream), write(Stream,X), close(Stream) ; open(SolutionFile,write,Stream), write(Stream,'#'), close(Stream) ), ...	[ 0.017822265625, 0.0196533203125, 0.0262451171875, 0.00909423828125, -0.00775146484375, -0.003692626953125, -0.005279541015625, -0.01348876953125, 0.004974365234375, 0.0322265625, -0.004638671875, -0.002655029296875, -0.00665283203125, 0.01806640625, -0.00823974609375, -0.0213623046875,...	[ 11554, 12724, 434, 418, 102588, 34, 1363, 174350, 7639, 2109, 7136, 71346, 78457, 977, 9920, 711, 94727, 90, 32786, 206, 92, 864, 1542, 9803, 18781, 115061, 33022, 20903, 4904, 21748, 30646, 9774, 1284, 22027, 18, 23937, 47, 11435, 3871, ...	[ 0.188720703125, 0.13671875, 0.0955810546875, 0.10333251953125, 0.1138916015625, 0.09210205078125, 0.043670654296875, 0.1898193359375, 0.135498046875, 0.12255859375, 0.1536865234375, 0.09716796875, 0.189453125, 0.00579833984375, 0.1458740234375, 0.01959228515625, 0.116455078125, 0.0...	embed
62538102_c1	62538102	prolog	1	274,2))), :(clpfd,#\=(_25130,+(_25202,1))), :(clpfd,all_different([_25130,_25202,_25274,_25346])), :(clpfd,in(_25346,..(1,4))), :(clpfd,#\=(_25274,+(_25346,1))), :(clpfd,#\=(_25202,+(_25346,2))), :(clpfd,in(_25274,..(1,4))), :(clpfd,#\=(_25202,+(_25274,1))), :(clpfd,in(_25202,..(1,4))) ] as opposed to just: % Actual si...	274,2))), :(clpfd,#\=(_25130,+(_25202,1))), :(clpfd,all_different([_25130,_25202,_25274,_25346])), :(clpfd,in(_25346,..(1,4))), :(clpfd,#\=(_25274,+(_25346,1))), :(clpfd,#\=(_25202,+(_25346,2))), :(clpfd,in(_25274,..(1,4))), :(clpfd,#\=(_25202,+(_25274,1))), :(clpfd,in(_25202,..(1,4))) ] as opposed to just: % Actual si...	[ 0.007781982421875, 0.01165771484375, -0.00897216796875, 0.0269775390625, -0.01190185546875, 0.00885009765625, -0.01470947265625, -0.000591278076171875, 0.004913330078125, -0.02490234375, 0.00836181640625, 0.004852294921875, 0.003021240234375, 0.0162353515625, -0.00665283203125, -0.0017...	[ 1438, 617, 4, 304, 32149, 31124, 34937, 39557, 71, 4904, 1369, 2588, 43955, 1328, 143179, 418, 5584, 238778, 3768, 363, 9271, 73, 163324, 144429, 1660, 1745, 100582, 26536, 18253, 30646, 34292, 284, 571, 441, 397, 3164, 4358, 77947, 38, 2...	[ 0.2276611328125, 0.234375, 0.02239990234375, 0.1673583984375, 0.1331787109375, 0.0217437744140625, 0.109619140625, 0.149169921875, 0.1231689453125, 0.053497314453125, 0.00531005859375, 0.1651611328125, 0.221923828125, 0.158203125, 0.23876953125, 0.05560302734375, 0.1409912109375, 0...	embed
22512726_c0	22512726	prolog	0	Title: Alternative to \+ in Prolog? Problem title: Alternative to \+ in Prolog? Tags: built-in, predicate, primes, prolog Problem: Alternative to \+ in Prolog? I have a program that returns true if an integer is prime, and else false. However I used the built-in predicate '\ +' which it turns out I am not allowed to us...	Alternative to \+ in Prolog? Alternative to \+ in Prolog? built-in predicate primes prolog Alternative Prolog is_prime has_factor Alternative to \+ in Prolog? I have a program that returns true if an integer is prime, and else false. However I used the built-in predicate '\ +' which it turns out I am not allowed to use...	[ -0.01165771484375, 0.0283203125, 0.0184326171875, -0.008544921875, -0.007293701171875, 0.0052490234375, -0.0076904296875, -0.0184326171875, 0.009033203125, -0.043701171875, -0.0033111572265625, 0.003753662109375, 0.001190185546875, -0.01171875, -0.0034332275390625, 0.0035552978515625, ...	[ 103905, 47, 41872, 1328, 23, 1250, 4867, 88303, 73, 1653, 2063, 67, 20809, 502, 83, 114654, 1556, 144810, 1528, 30646, 29568, 2174, 892, 1505, 37076, 98320, 11814, 997, 444, 959, 107003, 4527, 10932, 17368, 442, 4358, 77947 ]	[ 0.1678466796875, 0.04547119140625, 0.17578125, 0.2403564453125, 0.079345703125, 0.1873779296875, 0.25244140625, 0.135009765625, 0.1243896484375, 0.17578125, 0.224853515625, 0.10174560546875, 0.2193603515625, 0.1549072265625, 0.07733154296875, 0.212890625, 0.1502685546875, 0.2724609...	embed
3705023_c0	3705023	prolog	0	Title: fastest bidirectional java prolog implementation Problem title: fastest bidirectional java prolog implementation Tags: ffi, java, prolog Problem: fastest bidirectional java prolog implementation I am trying to use a a java-prolog layer on top of my current agent-based simulation. I am running Mac OS X Snow Leopa...	fastest bidirectional java prolog implementation fastest bidirectional java prolog implementation ffi java prolog fastest bidirectional java prolog implementation I am trying to use a a java-prolog layer on top of my current agent-based simulation. I am running Mac OS X Snow Leopard and Netbeans 6.9 and tried to use JP...	[ 0.0157470703125, 0.004913330078125, -0.0108642578125, -0.007232666015625, -0.012939453125, 0.01611328125, 0.007293701171875, 0.000469207763671875, 0.0028839111328125, -0.055419921875, 0.022216796875, 0.01458740234375, -0.0260009765625, -0.009033203125, 0.01202392578125, 0.0003471374511...	[ 4271, 525, 333, 80581, 110117, 79, 330, 502, 4867, 208124, 24500, 31577, 4527, 3454, 135355, 2663, 43581, 23882, 77007, 40226, 51042, 4727, 11787, 1193, 76935, 232425, 10086, 372, 10133, 165160, 37842, 821, 21130, 2452, 38246, 18, 145755, 303...	[ 0.1712646484375, 0.133544921875, 0.161376953125, 0.1546630859375, 0.1077880859375, 0.1397705078125, 0.2000732421875, 0.1678466796875, 0.2235107421875, 0.231201171875, 0.193115234375, 0.03680419921875, 0.05743408203125, 0.140625, 0.1710205078125, 0.0694580078125, 0.021026611328125, ...	embed
22443076_c1	22443076	prolog	1	X, member((Y,X), Sibs)). But when I do display_siblings I expected to see roelof-gerda . But the output is only x=roelof What did I do wrong. Im a beginner at Prolog and try to understand how this works. Roelof Edit 1: Could this be a solution: How can I prevent duplicates in prolog Edit 2: I will do but I still do not...	X, member((Y,X), Sibs)). But when I do display_siblings I expected to see roelof-gerda . But the output is only x=roelof What did I do wrong. Im a beginner at Prolog and try to understand how this works. Roelof Edit 1: Could this be a solution: How can I prevent duplicates in prolog Edit 2: I will do but I still do not...	[ 0.00732421875, 0.01025390625, 0.019287109375, -0.00225830078125, -0.0234375, -0.002288818359375, -0.007720947265625, 0.004180908203125, 0.017822265625, -0.01019287109375, 0.0235595703125, -0.004486083984375, 0.014404296875, 0.0029296875, 0.00872802734375, 0.0164794921875, -0.00207519...	[ 1193, 32786, 1723, 1542, 602, 16145, 44116, 76103, 33992, 84751, 1957, 2062, 13, 64093, 1505, 85, 140992, 4734, 1022, 1369, 516, 44691, 1250, 4867, 28219, 43240, 2777, 29806, 56282, 171763, 1636, 502, 15400, 3509, 4390, 9, 1374, 16093, 990,...	[ 0.134521484375, 0.205810546875, 0.1680908203125, 0.12060546875, 0.1522216796875, 0.1722412109375, 0.1968994140625, 0.1768798828125, 0.2396240234375, 0.0931396484375, 0.06573486328125, 0.0164031982421875, 0.05255126953125, 0.258544921875, 0.1279296875, 0.156982421875, 0.1824951171875,...	embed
7759701_c0	7759701	prolog	0	Title: How to compute the sum of unpaired numbers up to N? Problem title: How to compute the sum of unpaired numbers up to N? Tags: prolog Problem: How to compute the sum of unpaired numbers up to N? I have some code on prolog, but this code does not work. sum(N,_):-N<0,fail. sum(N,S):-N=0,S=0,!. sum(N,S):-N1=N-1,sum(N...	How to compute the sum of unpaired numbers up to N? How to compute the sum of unpaired numbers up to N? prolog How N-1 n-2 How to compute the sum of unpaired numbers up to N? I have some code on prolog, but this code does not work. Correct recursive function on PHP I need to convert this function to prolog. For example...	[ -0.00921630859375, 0.0130615234375, 0.0242919921875, 0.00286865234375, 0.0031890869140625, 0.0186767578125, 0.0118408203125, 0.0177001953125, 0.023193359375, -0.026611328125, 0.01251220703125, -0.011962890625, -0.0034027099609375, 0.01007080078125, 0.0223388671875, 0.01239013671875, ...	[ 11249, 47, 9969, 6743, 10554, 111, 51, 109637, 297, 101935, 1257, 541, 502, 4867, 5759, 653, 5428, 70, 18151, 959, 4488, 46348, 195625, 5844, 32354, 98, 47302, 3871, 96760, 839, 126684, 705, 139303, 4332, 7, 7136, 18781, 84751, 483 ]	[ 0.076171875, 0.1077880859375, 0.1435546875, 0.146240234375, 0.222412109375, 0.07452392578125, 0.1138916015625, 0.226318359375, 0.1239013671875, 0.1654052734375, 0.1142578125, 0.18017578125, 0.135498046875, 0.1995849609375, 0.1588134765625, 0.05487060546875, 0.203369140625, 0.035614...	embed
23938093_c1	23938093	prolog	1	,0,0,1,1,1,1],[10],_) :- !. accessible(F,L,C) :- CC is C-1, or(G,H,F), accessible(G,M,CC), accessible(H,N,CC), L=[0, [M,N]]. accessible(F,L,C) :- CC is C-1, and(G,H,F), accessible(G,M,CC), accessible(H,N,CC), L=[1,[M,N]]. accessible(F,L,C) :- CC is C-1, not(F,X), accessible(X,M,CC), L=[2,M]. I would like to compute the...	,0,0,1,1,1,1],[10],_) :- !. accessible(F,L,C) :- CC is C-1, or(G,H,F), accessible(G,M,CC), accessible(H,N,CC), L=[0, [M,N]]. accessible(F,L,C) :- CC is C-1, and(G,H,F), accessible(G,M,CC), accessible(H,N,CC), L=[1,[M,N]]. accessible(F,L,C) :- CC is C-1, not(F,X), accessible(X,M,CC), L=[2,M]. I would like to compute the...	[ 0.00714111328125, 0.0059814453125, 0.00787353515625, 0.0130615234375, -0.0164794921875, 0.01123046875, -0.01171875, 0.00274658203125, 0.00579833984375, -0.0269775390625, 0.00006246566772460938, -0.00014781951904296875, 0.01043701171875, 0.00156402587890625, 0.0038909912109375, -0.00396...	[ 4, 63527, 418, 76172, 63709, 454, 15772, 711, 81522, 919, 866, 441, 21581, 83, 313, 5759, 707, 724, 841, 594, 13709, 839, 339, 2389, 959, 1542, 304, 1884, 9969, 6743, 32354, 74706, 17721, 534, 1530, 9790, 25632, 69236, 132, 206808, 1193...	[ 0.0227813720703125, 0.2196044921875, 0.07275390625, 0.1014404296875, 0.173828125, 0.08526611328125, 0.1162109375, 0.108642578125, 0.288330078125, 0.1473388671875, 0.117431640625, 0.1094970703125, 0.210205078125, 0.12255859375, 0.1221923828125, 0.21630859375, 0.03314208984375, 0.110...	embed
10504656_c0	10504656	prolog	0	Title: Tree postorder traversal in Prolog Problem title: Tree postorder traversal in Prolog Tags: prolog, dcg Problem: Tree postorder traversal in Prolog Tree traversal refers to the process of visiting each node in a tree data structure in a systematic way. The postorder traversal in the following image Sorted_binary_...	Tree postorder traversal in Prolog Tree postorder traversal in Prolog prolog dcg Tree Prolog PREORDER Tree postorder traversal in Prolog Tree traversal refers to the process of visiting each node in a tree data structure in a systematic way. The postorder traversal in the following image Sorted_binary_tree returns A, C...	[ 0.0439453125, 0.00106048583984375, 0.0177001953125, -0.01177978515625, 0.00848388671875, 0.0286865234375, -0.01953125, -0.003570556640625, 0.009765625, -0.0341796875, -0.00482177734375, 0.009765625, -0.0181884765625, -0.0177001953125, 0.0198974609375, 0.0211181640625, -0.01123046875,...	[ 101344, 1305, 80596, 37317, 289, 23, 1250, 4867, 502, 238, 177, 23096, 24638, 18044, 15005, 9433, 150080, 12638, 110, 112, 53201, 2053, 45646, 242161, 3917, 25632, 29569, 53666, 19155, 1294, 62600, 30646, 313, 335, 572, 87, 527, 563, 2480, ...	[ 0.2578125, 0.194091796875, 0.264892578125, 0.251953125, 0.1602783203125, 0.01641845703125, 0.1846923828125, 0.2548828125, 0.1435546875, 0.0254058837890625, 0.0811767578125, 0.15869140625, 0.2034912109375, 0.1832275390625, 0.0423583984375, 0.0950927734375, 0.1917724609375, 0.0695800...	embed
9688526_c0	9688526	prolog	0	Title: Prolog sublists generation, multiply empty list - don't know why Problem title: Prolog sublists generation, multiply empty list - don't know why Tags: append, prolog, sublist Problem: Prolog sublists generation, multiply empty list - don't know why I want to make prolog returning me all possible sublis...	Prolog sublists generation, multiply empty list - don't know why Prolog sublists generation, multiply empty list - don't know why append prolog sublist Prolog Out Prolog sublists generation, multiply empty list - don't know why I want to make prolog returning me all possible sublists of given list so I wrote:...	[ 0.00616455078125, 0.0169677734375, 0.01092529296875, -0.0001201629638671875, -0.035400390625, -0.0028533935546875, -0.0072021484375, 0.00543212890625, 0.018798828125, -0.01165771484375, 0.00787353515625, 0.01446533203125, -0.006927490234375, 0.01116943359375, 0.00494384765625, 0.012634...	[ 1250, 4867, 1614, 6562, 58093, 6024, 62479, 201505, 5303, 3714, 15400, 114689, 502, 13538, 3444, 30646, 756, 7722, 16750, 2046, 31351, 119140, 214 ]	[ 0.0938720703125, 0.1947021484375, 0.17431640625, 0.2039794921875, 0.1199951171875, 0.0679931640625, 0.129638671875, 0.15234375, 0.165283203125, 0.00994873046875, 0.044403076171875, 0.066162109375, 0.07293701171875, 0.09954833984375, 0.017974853515625, 0.08203125, 0.001007080078125, ...	embed
13824568_c0	13824568	prolog	0	Title: Silly detail enquiry about Prolog unification Problem title: Silly detail enquiry about Prolog unification Tags: unification, prolog, list, cons Problem: Silly detail enquiry about Prolog unification In Prolog: ?-P=[A\|B], P=[1,_]. P = [1, _G1091], A = 1, B = [_G1091] B is shown as [_G1091] showing it's an uninst...	Silly detail enquiry about Prolog unification Silly detail enquiry about Prolog unification unification prolog list cons Silly Prolog _G1091 Silly detail enquiry about Prolog unification In Prolog: B is shown as [_G1091] showing it's an uninstantiated variable. However, if I change a tiny bit... All of a sudden it's no...	[ 0.0245361328125, 0.02392578125, 0.0238037109375, -0.0054931640625, -0.00909423828125, -0.006195068359375, -0.0113525390625, -0.00286865234375, 0.00811767578125, 0.01611328125, 0.0022125244140625, 0.00811767578125, 0.0224609375, 0.00119781494140625, 0.00188446044921875, 0.008544921875, ...	[ 602, 12097, 22443, 3181, 1250, 4867, 51, 41274, 502, 5303, 158, 724, 963, 12183, 335, 127887, 237, 106000, 76172, 141377, 143034, 14, 27686, 77336, 2174, 15549, 57278, 4785, 8932, 959, 60892, 83, 1284, 7464, 43542, 40383, 678, 23937, 1380, ...	[ 0.10418701171875, 0.1788330078125, 0.1668701171875, 0.09564208984375, 0.1441650390625, 0.2396240234375, 0.156982421875, 0.112060546875, 0.05267333984375, 0.1075439453125, 0.1341552734375, 0.076171875, 0.065185546875, 0.171142578125, 0.1597900390625, 0.10546875, 0.0145111083984375, ...	embed
27710292_c0	27710292	prolog	0	Title: Prolog Out of local stack error Problem title: Prolog Out of local stack error Tags: prolog, transitive-closure Problem: Prolog Out of local stack error I tried some basic example from a book and it makes "Out of local stack" error (I'll tell more after the code). here is the code: edge(a,b). edge(a,e). edge(b,d...	Prolog Out of local stack error Prolog Out of local stack error prolog transitive-closure Prolog Out Node1 Node2 SomeNode Prolog Out of local stack error I tried some basic example from a book and it makes "Out of local stack" error (I'll tell more after the code). here is the code: I tried for example to write query e...	[ 0.0294189453125, 0.01220703125, 0.0031890869140625, 0.023193359375, 0.006439208984375, -0.00982666015625, -0.049072265625, 0.030517578125, 0.011474609375, -0.06396484375, 0.00885009765625, -0.0147705078125, 0.0216064453125, 0.01043701171875, 0.046142578125, 0.006927490234375, 0.00769...	[ 1250, 4867, 13538, 111, 4000, 177261, 18499, 502, 62621, 5844, 170224, 438, 112, 304, 5021, 37842, 62822, 27781, 12877, 79858, 18151, 33022, 41, 1294, 121303, 275, 176377, 29568, 30957, 74, 2967, 3688 ]	[ 0.154296875, 0.228759765625, 0.1783447265625, 0.2027587890625, 0.174072265625, 0.228759765625, 0.1871337890625, 0.1346435546875, 0.1217041015625, 0.045684814453125, 0.162841796875, 0.1146240234375, 0.0357666015625, 0.02227783203125, 0.1136474609375, 0.02569580078125, 0.04409790039062...	embed
18697784_c0	18697784	prolog	0	Title: Prolog unification exercise Problem title: Prolog unification exercise Tags: prolog Problem: Prolog unification exercise I not shure how in my exam answer to this qestion: Let's consider this prolog program: p(a,b). p(b,c). p(c,a). q(X,X). q(X,Y):-p(X,Z),q(Z,Y). and question: ?- q(X,X). And valid? answer is: Abo...	Prolog unification exercise Prolog unification exercise prolog Prolog Prolog unification exercise I not shure how in my exam answer to this qestion: and question: And valid? answer is: And I don't get it, really. IMO this predicate can be fullfilled in 3 ways: What I don't understand here? Or maybe the answer is wrong ...	[ 0.0074462890625, 0.0220947265625, 0.025390625, 0.004058837890625, -0.01446533203125, 0.00634765625, -0.01953125, -0.0169677734375, 0.00665283203125, -0.00390625, -0.0031585693359375, -0.0010223388671875, 0.01397705078125, -0.0159912109375, -0.02099609375, 0.0042724609375, 0.008728027...	[ 1250, 4867, 51, 41274, 81979, 502, 959, 107, 3642, 42276, 35166, 47, 9655, 3493, 35604, 2301, 18, 2046, 442, 6183, 59773, 903, 1653, 2063, 67, 831, 4393, 116115, 23, 138, 48322, 28219, 3688, 44691, 1733, 4127 ]	[ 0.1331787109375, 0.2313232421875, 0.1378173828125, 0.088134765625, 0.18310546875, 0.0826416015625, 0.0286865234375, 0.06378173828125, 0.08526611328125, 0.142822265625, 0.1580810546875, 0.006988525390625, 0.060699462890625, 0.1011962890625, 0.289794921875, 0.04644775390625, 0.06982421...	embed
55659980_c0	55659980	prolog	0	Title: The difference between dollar sign ($) and number (or hash) sign (#) in Prolog Problem title: The difference between dollar sign ($) and number (or hash) sign (#) in Prolog Tags: prolog, eclipse-clp Problem: The difference between dollar sign ($) and number (or hash) sign (#) in Prolog As I found I can use from ...	The difference between dollar sign ($) and number (or hash) sign (#) in Prolog The difference between dollar sign ($) and number (or hash) sign (#) in Prolog prolog eclipse-clp Prolog Yes The difference between dollar sign ($) and number (or hash) sign (#) in Prolog As I found I can use from $ and # in the shortened ve...	[ 0.00592041015625, 0.01239013671875, 0.01324462890625, 0.00653076171875, -0.01123046875, 0.0130615234375, -0.01104736328125, 0.018798828125, 0.0223388671875, 0.000514984130859375, 0.007659912109375, 0.001220703125, -0.0021209716796875, 0.0002384185791015625, 0.0113525390625, 0.013122558...	[ 60212, 17721, 15437, 24092, 4369, 136, 14012, 748, 1556, 127, 4904, 23, 1250, 4867, 502, 106371, 184, 26775, 32635, 831, 4527, 1295, 3650, 468, 16610, 11389, 45890, 41, 16750, 2367, 70, 15400, 25632, 1294, 83 ]	[ 0.2249755859375, 0.143798828125, 0.230224609375, 0.246826171875, 0.2371826171875, 0.1123046875, 0.2135009765625, 0.058807373046875, 0.1837158203125, 0.176513671875, 0.20263671875, 0.1021728515625, 0.159423828125, 0.237060546875, 0.1044921875, 0.109375, 0.033050537109375, 0.06262207...	embed
36065170_c0	36065170	prolog	0	Title: Prolog lexer can't find the error Problem title: Prolog lexer can't find the error Tags: prolog Problem: Prolog lexer can't find the error I have a lexer that I am trying to build. I just want to know why it doesn't create the second list. %TokenList=[int, add, '(', int, a, ',', int, b, ')']. lexer([H\|...	Prolog lexer can't find the error Prolog lexer can't find the error prolog Prolog TokenList Output lexer_test TYPE_INT TYPE_BOOL COMMA ASSIGN LET_IN COND_IF COND_THEN COND_ELSE LOGIC_EQ LOGIC_NOT_EQ LOGIC_GT LOGIC_GTEQ ARITH_ADD ARITH_SUB OPEN_P CLOSE_P INTEGER IDENTIFIER Prolog lexer can't find the error I h...	[ 0.0166015625, -0.006622314453125, -0.00970458984375, 0.0255126953125, -0.015869140625, 0.00653076171875, -0.0093994140625, 0.00628662109375, 0.0196533203125, -0.01507568359375, 0.016845703125, 0.0015106201171875, -0.00390625, -0.0174560546875, 0.0274658203125, 0.008056640625, 0.00454...	[ 1250, 4867, 95, 34058, 3768, 18, 7413, 18499, 831, 502, 717, 1098, 154663, 13538, 6954, 95267, 59537, 137142, 31436, 8218, 151657, 27089, 397, 47510, 178102, 23415, 32338, 65441, 102686, 208585, 101868, 45367, 3714, 15400, 28282, 17932, 5303, ...	[ 0.1488037109375, 0.2083740234375, 0.1298828125, 0.23876953125, 0.051788330078125, 0.0831298828125, 0.1678466796875, 0.2279052734375, 0.0229339599609375, 0.126220703125, 0.075927734375, 0.1302490234375, 0.1505126953125, 0.0860595703125, 0.1575927734375, 0.05694580078125, 0.04678344726...	embed
19979548_c0	19979548	prolog	0	Title: Predicate that generates integers and tests if integer Problem title: Predicate that generates integers and tests if integer Tags: failure-slice, predicate, prolog, integer Problem: Predicate that generates integers and tests if integer I'm trying to make a Prolog predicate that will let me test if a given value...	Predicate that generates integers and tests if integer Predicate that generates integers and tests if integer failure-slice predicate prolog integer Predicate Predicate that generates integers and tests if integer I'm trying to make a Prolog predicate that will let me test if a given value is a integer bigger than 0, a...	[ -0.0036468505859375, 0.000278472900390625, -0.01031494140625, 0.0174560546875, -0.000667572021484375, 0.031982421875, -0.0022735595703125, -0.016357421875, -0.00469970703125, -0.0185546875, 0.0023040771484375, 0.0242919921875, -0.0302734375, 0.01434326171875, 0.0211181640625, 0.0189208...	[ 7145, 2063, 67, 139392, 892, 26255, 136, 109921, 2174, 1505, 450, 137578, 13348, 1653, 502, 4867, 7, 31577, 3249, 1250, 2633, 163, 3034, 34475, 34292, 83, 167785, 3501, 757, 8337, 35604, 77336, 5036, 33342, 1884, 3293, 1221, 756, 1284, 32...	[ 0.1534423828125, 0.199462890625, 0.07977294921875, 0.205810546875, 0.1441650390625, 0.1337890625, 0.124755859375, 0.2119140625, 0.1649169921875, 0.08843994140625, 0.0218505859375, 0.213134765625, 0.145751953125, 0.1590576171875, 0.13623046875, 0.1837158203125, 0.031341552734375, 0....	embed
79163408_c2	79163408	prolog	2	< 1, abs(X - X1) + abs(Y - Y1) \= 0. count_mines(X, Y, Count) :- findall(1, (adjacent(X, Y, AdjX, AdjY), mine(AdjX, AdjY)), Mines), length(Mines, Count). open_cell(X, Y) :- cell(X, Y, closed, _), count_mines(X, Y, Count), (Count > 0 -> retract(cell(X, Y, closed, _)), assert(cell(X, Y, open, Count)), write('open cell > ...	< 1, abs(X - X1) + abs(Y - Y1) \= 0. count_mines(X, Y, Count) :- findall(1, (adjacent(X, Y, AdjX, AdjY), mine(AdjX, AdjY)), Mines), length(Mines, Count). open_cell(X, Y) :- cell(X, Y, closed, _), count_mines(X, Y, Count), (Count > 0 -> retract(cell(X, Y, closed, _)), assert(cell(X, Y, open, Count)), write('open cell > ...	[ 0.0037078857421875, -0.00689697265625, 0.00506591796875, 0.0238037109375, 0.019287109375, -0.0015411376953125, -0.0101318359375, 0.01190185546875, 0.008056640625, -0.0001811981201171875, -0.0213623046875, 0.023193359375, 0.0185546875, -0.00150299072265625, 0.00830078125, -0.01391601562...	[ 4426, 106, 43719, 1542, 20, 1193, 17727, 997, 1723, 990, 1369, 757, 5, 54529, 2962, 7, 132, 4, 108210, 15772, 7413, 5584, 41600, 712, 145, 16797, 170, 5665, 56713, 140909, 59076, 194, 9803, 454, 34680, 38750, 155738, 41499, 15390, 33657, ...	[ 0.1192626953125, 0.0933837890625, 0.1641845703125, 0.146240234375, 0.085205078125, 0.0865478515625, 0.096435546875, 0.1212158203125, 0.13720703125, 0.177978515625, 0.078369140625, 0.1280517578125, 0.033447265625, 0.2178955078125, 0.2666015625, 0.14697265625, 0.0151519775390625, 0.0...	embed
67577974_c0	67577974	prolog	0	Title: Predicate concat in Prolog Problem title: Predicate concat in Prolog Tags: prolog Problem: Predicate concat in Prolog I'm trying to write a predicate concat/3 with header concat(whole, part1, part2) that succeeds if part1 and part2 are two not-empty subsequences which when concatenated form the sequence whole. F...	Predicate concat in Prolog Predicate concat in Prolog prolog Predicate Prolog Predicate concat in Prolog I'm trying to write a predicate concat/3 with header concat(whole, part1, part2) that succeeds if part1 and part2 are two not-empty subsequences which when concatenated form the sequence whole. For example concat(A,...	[ 0.01287841796875, 0.01165771484375, 0.00421142578125, 0.0123291015625, 0.0029449462890625, 0.030029296875, -0.01904296875, 0.0301513671875, 0.0218505859375, -0.02197265625, -0.003997802734375, 0.0089111328125, -0.031982421875, 0.007415771484375, 0.018310546875, 0.01171875, -0.0026550...	[ 7145, 2063, 67, 158, 4460, 1250, 4867, 502, 31577, 33022, 1653, 18113, 10336, 56, 70919, 2831, 10461, 214493, 2174, 136, 304, 6626, 959, 33548, 1614, 184, 26513, 33, 3173, 944, 28271, 284, 1530, 97, 116, 138, 201, 35166, 62, 2203, 11468...	[ 0.1358642578125, 0.171875, 0.07232666015625, 0.16455078125, 0.2181396484375, 0.1602783203125, 0.21728515625, 0.1165771484375, 0.016143798828125, 0.05743408203125, 0.1417236328125, 0.1829833984375, 0.095458984375, 0.038482666015625, 0.11669921875, 0.082275390625, 0.0280609130859375, ...	embed
50092359_c0	50092359	prolog	0	Title: Write a program in prolog that determines if there are exactly three values in such a way that they add upto a sum of N Problem title: Write a program in prolog that determines if there are exactly three values in such a way that they add upto a sum of N Tags: prolog Problem: Write a program in prolog that deter...	Write a program in prolog that determines if there are exactly three values in such a way that they add upto a sum of N Write a program in prolog that determines if there are exactly three values in such a way that they add upto a sum of N prolog Write Write a program in prolog that determines if there are exactly thre...	[ 0.0035400390625, 0.003662109375, 0.0098876953125, -0.006805419921875, -0.0189208984375, 0.01275634765625, -0.004241943359375, 0.01226806640625, 0.0186767578125, -0.01263427734375, 0.01470947265625, -0.0242919921875, 0.007568359375, 0.0019683837890625, 0, 0.0213623046875, 0.0209960937...	[ 601, 18781, 1528, 23, 502, 4867, 83324, 2174, 66161, 17262, 142424, 15190, 1257, 188, 10554, 541, 2685, 6044, 3917, 22221, 32036, 133063, 82449, 4, 104629, 678, 105950, 305, 5608, 28412, 29568, 6637, 138, 2289, 106, 54651, 85398, 71928, 166...	[ 0.10650634765625, 0.0863037109375, 0.231201171875, 0.06024169921875, 0.1827392578125, 0.275390625, 0.179931640625, 0.1053466796875, 0.198974609375, 0.24267578125, 0.255615234375, 0.1746826171875, 0.08984375, 0.1142578125, 0.2100830078125, 0.1480712890625, 0.0173187255859375, 0.0142...	embed
35125846_c0	35125846	prolog	0	Title: Unify variable if the condition is met Problem title: Unify variable if the condition is met Tags: prolog Problem: Unify variable if the condition is met I want to assign a value to a variable R , but the value depends on the condition. if (cond1) var = value1 + 5; else if (cond2) var = value1 + 10; else var = v...	Unify variable if the condition is met Unify variable if the condition is met prolog Unify cond1 value1 cond2 value2 value3 value4 Unify variable if the condition is met I want to assign a value to a variable R , but the value depends on the condition. This is how I tried, but if the first condition fails, var is assig...	[ 0.01214599609375, 0.0019989013671875, -0.0025787353515625, 0.00299072265625, 0.004241943359375, -0.0033721923828125, -0.007537841796875, 0.0272216796875, 0.0068359375, 0.0140380859375, 0.00145721435546875, -0.0045166015625, 0.009765625, 0.002197265625, 0.01312255859375, 0.0047607421875...	[ 992, 40383, 77336, 2174, 35431, 83, 435, 502, 4867, 158, 71, 418, 34292, 304, 363, 617, 3444, 95486, 47, 627, 56566, 37842, 70, 5117, 35782, 7, 285, 20802, 33770 ]	[ 0.1820068359375, 0.208984375, 0.26416015625, 0.116943359375, 0.236572265625, 0.06451416015625, 0.1837158203125, 0.1199951171875, 0.1585693359375, 0.1070556640625, 0.06982421875, 0.01422119140625, 0.1458740234375, 0.0235443115234375, 0.041717529296875, 0.114501953125, 0.03555297851562...	embed
37117901_c0	37117901	prolog	0	Title: What does it mean by express this puzzle as a CSP Problem title: What does it mean by express this puzzle as a CSP Tags: prolog, clpfd Problem: What does it mean by express this puzzle as a CSP What is meant by the below for the attached image. By labelling each cell with a variable, express the puzzle as a CSP....	What does it mean by express this puzzle as a CSP What does it mean by express this puzzle as a CSP prolog clpfd What CSP Hint What does it mean by express this puzzle as a CSP What is meant by the below for the attached image. I initially thought just add variables to each cell like A, B, C etc to each cell and then c...	[ 0.00506591796875, -0.00037384033203125, 0.0035552978515625, 0.0303955078125, 0.006317138671875, 0.00634765625, -0.0027618408203125, 0.004852294921875, -0.023193359375, -0.0047607421875, -0.0115966796875, 0.0015716552734375, 0.01141357421875, 0.033935546875, -0.0029449462890625, 0.00897...	[ 29459, 36510, 903, 104192, 237, 313, 9434, 502, 4867, 71, 19895, 18, 131148, 390, 35064, 220642, 29569, 17569, 15190, 77336, 12638, 38750, 2816, 187136, 56065 ]	[ 0.0958251953125, 0.1937255859375, 0.0855712890625, 0.2174072265625, 0.0701904296875, 0.0867919921875, 0.234130859375, 0.07470703125, 0.156494140625, 0.034637451171875, 0.151123046875, 0.09051513671875, 0.1046142578125, 0.0271759033203125, 0.133056640625, 0.07208251953125, 0.122558593...	embed
62313750_c0	62313750	prolog	0	Title: Prolog Sum value numbers smaller than limit Problem title: Prolog Sum value numbers smaller than limit Tags: prolog Problem: Prolog Sum value numbers smaller than limit Define predicate summy(List, Limit, N), where List is a list of absolute value numbers, and N is the sum of such numbers from List lists whose v...	Prolog Sum value numbers smaller than limit Prolog Sum value numbers smaller than limit prolog Prolog Sum Prolog Sum value numbers smaller than limit Define predicate summy(List, Limit, N), where List is a list of absolute value numbers, and N is the sum of such numbers from List lists whose value is smaller than Limit...	[ -0.01495361328125, -0.013427734375, 0.0284423828125, -0.007354736328125, -0.01287841796875, 0.00982666015625, 0.0059814453125, 0.029296875, 0.029296875, 0.035400390625, -0.0030059814453125, 0.002044677734375, -0.01116943359375, -0.02099609375, 0.0291748046875, 0.0036163330078125, 0.0...	[ 1250, 4867, 36335, 34292, 101935, 164917, 3501, 17475, 502, 64552, 1653, 2063, 67, 10554, 1176, 154663, 125177, 541, 7440, 32036, 83, 5303, 111, 89931, 6044, 765, 11675, 27781, 45831, 1193, 4046, 959, 1662, 5 ]	[ 0.135986328125, 0.21044921875, 0.2088623046875, 0.21630859375, 0.13818359375, 0.192138671875, 0.06866455078125, 0.2432861328125, 0.089599609375, 0.1392822265625, 0.148681640625, 0.1961669921875, 0.10089111328125, 0.216064453125, 0.25927734375, 0.212890625, 0.295166015625, 0.1722412...	embed
33749538_c0	33749538	prolog	0	Title: How to stop rec call in prolog Problem title: How to stop rec call in prolog Tags: recursion, prolog, list Problem: How to stop rec call in prolog I want to represent a number as a list of digits. I did most of the implementations but I do not know how to stop the recursive call after parsing the whole number. I...	How to stop rec call in prolog How to stop rec call in prolog recursion prolog list How NR1 How to stop rec call in prolog I want to represent a number as a list of digits. I did most of the implementations but I do not know how to stop the recursive call after parsing the whole number. I know this solution is not the ...	[ -0.013671875, 0.0008697509765625, 0.018798828125, -0.009765625, -0.0084228515625, 0.010009765625, -0.02294921875, 0.003662109375, 0.01324462890625, -0.02734375, 0.0004253387451171875, -0.00384521484375, -0.0201416015625, -0.00848388671875, 0.01348876953125, -0.0078125, 0.00439453125,...	[ 11249, 47, 7279, 21954, 11782, 23, 502, 4867, 195625, 1830, 5303, 71641, 418, 3444, 33636, 14012, 237, 153939, 7, 6777, 2684, 208124, 3714, 3642, 5844, 7103, 366, 6953, 28271, 29806, 2965, 6528, 11853, 6305, 88308, 22936, 705, 9, 3900, 10...	[ 0.06109619140625, 0.036376953125, 0.2347412109375, 0.2398681640625, 0.2435302734375, 0.06219482421875, 0.1749267578125, 0.2396240234375, 0.194580078125, 0.047271728515625, 0.15234375, 0.13671875, 0.0487060546875, 0.0751953125, 0.201904296875, 0.158935546875, 0.1019287109375, 0.1544...	embed
71893100_c0	71893100	prolog	0	Title: Prolog: Convert list into dictionary? Problem title: Prolog: Convert list into dictionary? Tags: prolog, list, dictionary, type-conversion Problem: Prolog: Convert list into dictionary? I am searching some swi-prolog predicate: list_to_dict(List, Dict) :- ?? Which is able to convert a list like l = [a, b, c, d] ...	Prolog: Convert list into dictionary? Prolog: Convert list into dictionary? prolog list dictionary type-conversion Prolog Convert list_to_dict List Dict dict_label Prolog: Convert list into dictionary? I am searching some swi-prolog predicate: Which is able to convert a list like into a Prolog dict d whose keys are equ...	[ -0.00836181640625, -0.006011962890625, -0.0076904296875, 0.003387451171875, -0.019287109375, -0.007110595703125, -0.0224609375, 0.0081787109375, -0.001129150390625, -0.022705078125, 0.0118408203125, 0.003173828125, -0.00543212890625, 0.00836181640625, 0.0235595703125, 0, 0.0112304687...	[ 1250, 4867, 12, 1657, 11549, 5303, 3934, 45, 10763, 6635, 502, 10644, 2271, 46354, 188, 61669, 32036, 60897, 18, 152526, 157318, 2452, 3454, 1653, 2063, 19048, 96760, 1884, 104, 22799, 105950, 63262, 72134, 99, 615, 27781, 36917, 3173, 7794...	[ 0.16650390625, 0.259521484375, 0.010498046875, 0.058013916015625, 0.13720703125, 0.233154296875, 0.1090087890625, 0.081787109375, 0.1539306640625, 0.1475830078125, 0.1297607421875, 0.1173095703125, 0.04241943359375, 0.10589599609375, 0.042877197265625, 0.16796875, 0.1575927734375, ...	embed
20154594_c0	20154594	prolog	0	Title: Get a list of numbers from a list of complex terms Problem title: Get a list of numbers from a list of complex terms Tags: prolog Problem: Get a list of numbers from a list of complex terms I have a list of complex terms with the same functor and arity, but different arguments. Something like this: Elements = [e...	Get a list of numbers from a list of complex terms Get a list of numbers from a list of complex terms prolog a Get Elements Numbers Get a list of numbers from a list of complex terms I have a list of complex terms with the same functor and arity, but different arguments. Something like this: And from it I wish to gener...	[ 0.004547119140625, 0.007720947265625, -0.01348876953125, 0.02099609375, 0.00010824203491210938, 0.0419921875, 0.003631591796875, 0.020263671875, 0.0162353515625, -0.0281982421875, -0.0026397705078125, -0.0206298828125, -0.025634765625, 0.01806640625, -0.00506591796875, 0.00031661987304...	[ 20779, 5303, 111, 101935, 1295, 27140, 69407, 502, 4867, 48325, 103332, 5701, 7477, 18770, 187, 2481, 1284, 12921, 10750, 32599, 139392, 3525, 70541, 4734, 17932, 12638, 13579, 3917, 4331, 1653, 2063, 67, 86869, 2967, 100, 2499, 140909, 10773...	[ 0.136474609375, 0.1669921875, 0.06494140625, 0.1763916015625, 0.10009765625, 0.2208251953125, 0.2247314453125, 0.12060546875, 0.1727294921875, 0.1802978515625, 0.1759033203125, 0.054595947265625, 0.080322265625, 0.10418701171875, 0.04864501953125, 0.099365234375, 0.002105712890625, ...	embed
43875886_c0	43875886	prolog	0	Title: How I get most repetitive element of this? (Prolog - Logic Paradigm) Problem title: How I get most repetitive element of this? (Prolog - Logic Paradigm) Tags: prolog Problem: How I get most repetitive element of this? (Prolog - Logic Paradigm) In predicate "sample", the first element is your id and the others, a...	How I get most repetitive element of this? (Prolog - Logic Paradigm) How I get most repetitive element of this? (Prolog - Logic Paradigm) prolog How Prolog Logic Paradigm How I get most repetitive element of this? (Prolog - Logic Paradigm) In predicate "sample", the first element is your id and the others, are the resu...	[ -0.0032501220703125, 0.002288818359375, -0.013427734375, 0.017578125, -0.00927734375, 0.01611328125, -0.0023040771484375, 0.0023193359375, 0.005950927734375, -0.05615234375, 0.0035552978515625, -0.0052490234375, -0.0123291015625, -0.0238037109375, 0.00323486328125, -0.0096435546875, ...	[ 11249, 2046, 2684, 57346, 4935, 12830, 111, 903, 10752, 4867, 50592, 238, 1720, 4803, 39, 87, 502, 1250, 1653, 2063, 433, 33209, 5117, 83, 935, 3447, 27060, 621, 16750, 121413, 3871, 119140, 34292, 8194, 6528, 3642 ]	[ 0.0860595703125, 0.1282958984375, 0.208740234375, 0.27490234375, 0.19189453125, 0.1966552734375, 0.06915283203125, 0.10760498046875, 0.0576171875, 0.1961669921875, 0.1141357421875, 0.002349853515625, 0.05230712890625, 0.1043701171875, 0.0343017578125, 0.03668212890625, 0.078735351562...	embed
30712311_c0	30712311	prolog	0	Title: Predicate that pick elements which are on list twice not less not more Problem title: Predicate that pick elements which are on list twice not less not more Tags: prolog Problem: Predicate that pick elements which are on list twice not less not more I'm trying to write a predicate twice(El,L) which will return t...	Predicate that pick elements which are on list twice not less not more Predicate that pick elements which are on list twice not less not more prolog Predicate Predicate that pick elements which are on list twice not less not more I'm trying to write a predicate twice(El,L) which will return true. when El is on list exa...	[ -0.004486083984375, 0.010009765625, 0.01373291015625, -0.01556396484375, 0.0087890625, 0.0311279296875, -0.0042724609375, -0.0023956298828125, 0.00445556640625, -0.036865234375, 0.0252685546875, 0.008544921875, 0.0004100799560546875, 0.020751953125, -0.004730224609375, 0.02392578125, ...	[ 7145, 2063, 67, 450, 39580, 80854, 98, 5303, 186351, 959, 40715, 1286, 502, 4867, 621, 31577, 33022, 1653, 7623, 866, 1221, 30646, 29568, 3229, 540, 83, 66161, 765, 43240, 26267, 100, 54753, 133063, 82449, 1284, 1542, 155761, 96386, 41929, ...	[ 0.19091796875, 0.2327880859375, 0.131103515625, 0.054168701171875, 0.2239990234375, 0.192138671875, 0.1451416015625, 0.192138671875, 0.216552734375, 0.14013671875, 0.1942138671875, 0.153564453125, 0.141357421875, 0.1812744140625, 0.0091552734375, 0.073486328125, 0.10498046875, 0.19...	embed
57670280_c0	57670280	prolog	0	Title: 7 liter and 5 liter jugs to 4 liter jug puzzle with depth-first search Problem title: 7 liter and 5 liter jugs to 4 liter jug puzzle with depth-first search Tags: prolog, water-jug-problem Problem: 7 liter and 5 liter jugs to 4 liter jug puzzle with depth-first search I want to use any kind of depth-first search...	7 liter and 5 liter jugs to 4 liter jug puzzle with depth-first search 7 liter and 5 liter jugs to 4 liter jug puzzle with depth-first search prolog water-jug-problem JUG1 JUG2 7 liter and 5 liter jugs to 4 liter jug puzzle with depth-first search I want to use any kind of depth-first search to solve the 7 Liter and 5 ...	[ 0.006256103515625, 0.0164794921875, -0.0142822265625, 0.01458740234375, -0.02294921875, 0.000782012939453125, -0.04443359375, 0.0166015625, -0.00799560546875, 0.010986328125, 0.024658203125, -0.0125732421875, -0.002105712890625, 0.0267333984375, 0.012451171875, 0.007354736328125, 0.0...	[ 361, 15659, 136, 190, 103863, 7, 47, 201, 104192, 678, 168867, 13448, 33938, 502, 4867, 7401, 461, 177, 38953, 30357, 724, 418, 304, 271, 87, 3444, 4527, 2499, 8562, 86869, 70, 104578, 179277, 23, 159, 38969, 9, 10752, 765, 110, 6528, ...	[ 0.1614990234375, 0.205078125, 0.1016845703125, 0.1884765625, 0.25732421875, 0.06927490234375, 0.1380615234375, 0.201904296875, 0.201416015625, 0.03656005859375, 0.165771484375, 0.1058349609375, 0.1800537109375, 0.1064453125, 0.197509765625, 0.115966796875, 0.175048828125, 0.1542968...	embed
7815824_c0	7815824	prolog	0	Title: Prolog return duplicate list Problem title: Prolog return duplicate list Tags: prolog, list Problem: Prolog return duplicate list I am getting duplicated list when I try to findall/3 possible path in a graph? Any idea what is wrong with the code? The pattern of duplicate was S:6 was duplicated with S:13, S:7 wit...	Prolog return duplicate list Prolog return duplicate list prolog list Prolog Vix Len long_p Prolog return duplicate list I am getting duplicated list when I try to findall/3 possible path in a graph? Any idea what is wrong with the code? The pattern of duplicate was S:6 was duplicated with S:13, S:7 with S:14, S:8 with...	[ 0.004241943359375, 0.028076171875, -0.0050048828125, 0.0166015625, -0.022705078125, -0.01611328125, -0.03125, 0.0118408203125, 0.0169677734375, -0.051513671875, 0.001373291015625, -0.007415771484375, 0.027587890625, 0.010986328125, 0.006072998046875, 0.038330078125, 0.0185546875, 0...	[ 1250, 4867, 30646, 171763, 67, 5303, 502, 582, 425, 18226, 4989, 254, 20949, 3674, 9790, 7413, 5584, 18113, 7722, 60875, 41382, 6528, 44691, 18151, 103510, 159, 910, 22618, 22635, 1019, 12221, 117781, 16750 ]	[ 0.1556396484375, 0.2734375, 0.15771484375, 0.226806640625, 0.144775390625, 0.1939697265625, 0.089111328125, 0.099609375, 0.0654296875, 0.1396484375, 0.032379150390625, 0.038604736328125, 0.0153961181640625, 0.0904541015625, 0.0638427734375, 0.09136962890625, 0.1226806640625, 0.2354...	embed
65066605_c0	65066605	prolog	0	Title: Why is my recursive prolog script not working? Problem title: Why is my recursive prolog script not working? Tags: prolog Problem: Why is my recursive prolog script not working? Can anyone help me out with Prolog recursive functions? I have to type in a recursive input and it should give me true, but it gives me...	Why is my recursive prolog script not working? Why is my recursive prolog script not working? prolog Why Bob Food Why is my recursive prolog script not working? Can anyone help me out with Prolog recursive functions? I have to type in a recursive input and it should give me true, but it gives me an error and I sitll do...	[ 0.0152587890625, 0.00579833984375, 0.004547119140625, 0.0234375, -0.0034332275390625, 0.0296630859375, 0.00506591796875, -0.000316619873046875, 0.0208740234375, -0.00799560546875, 0.015625, -0.00628662109375, -0.022216796875, 0.005462646484375, 0.02197265625, -0.01275634765625, 0.012...	[ 44084, 83, 759, 195625, 5844, 502, 4867, 26499, 959, 20697, 25027, 34562, 35672, 4358, 1810, 1250, 32354, 10644, 23, 107730, 29568, 76199, 18499, 3714, 26366, 2367, 765, 360, 7077, 204246, 13, 257, 26286, 1176, 16750, 212059, 992, 69723, 50...	[ 0.131591796875, 0.05816650390625, 0.09954833984375, 0.23193359375, 0.1705322265625, 0.1773681640625, 0.220458984375, 0.2335205078125, 0.1634521484375, 0.1591796875, 0.185791015625, 0.25146484375, 0.000152587890625, 0.04278564453125, 0.04010009765625, 0.1424560546875, 0.10400390625, ...	embed
71644928_c0	71644928	prolog	0	Title: Prolog: Cast term into string? Problem title: Prolog: Cast term into string? Tags: swi-prolog, string, prolog Problem: Prolog: Cast term into string? I have a Prolog program, which generates terms of this form: :-op(803, xfy, →). connect(X, Y, Result):- Result = (X → Y). if I now call connect(a,b,R) my result is...	Prolog: Cast term into string? Prolog: Cast term into string? swi-prolog string prolog Prolog Cast Result Prolog: Cast term into string? I have a Prolog program, which generates terms of this form: if I now call connect(a,b,R) my result is R = (a→b). Is their a possibility to convert terms like (a→b) into a string with...	[ 0.0306396484375, 0.0162353515625, 0.00701904296875, 0.01904296875, -0.006072998046875, 0.0042724609375, -0.0133056640625, 0.00958251953125, -0.013671875, -0.02392578125, 0.01129150390625, -0.0155029296875, -0.042236328125, 0.0106201171875, -0.021484375, -0.0006256103515625, -0.009643...	[ 1250, 4867, 32301, 13579, 3934, 79315, 2452, 3454, 502, 126684, 1528, 139392, 69407, 3173, 11782, 37067, 11, 275, 1052, 16750, 627, 2203, 23585, 207116, 96760, 1884, 28032, 64330, 4488, 50339, 145581, 12302, 2424, 39642, 254, 46576, 8562, 286...	[ 0.175048828125, 0.248291015625, 0.2218017578125, 0.273193359375, 0.158935546875, 0.259033203125, 0.1318359375, 0.1405029296875, 0.13525390625, 0.1737060546875, 0.11376953125, 0.0997314453125, 0.21923828125, 0.08990478515625, 0.10791015625, 0.1715087890625, 0.060760498046875, 0.1298...	embed
42960669_c0	42960669	prolog	0	Title: Prolog, how to read value pro function for use in other function Problem title: Prolog, how to read value pro function for use in other function Tags: prolog, function Problem: Prolog, how to read value pro function for use in other function I have this function: func1(X). After execution func1(a) return value X...	Prolog, how to read value pro function for use in other function Prolog, how to read value pro function for use in other function prolog function Prolog func1 other_func final_func Prolog, how to read value pro function for use in other function I have this function: After execution func1(a) return value X = n. This is...	[ 0.01324462890625, -0.0048828125, 0.00787353515625, 0.00775146484375, -0.00775146484375, -0.002960205078125, 0.0169677734375, -0.01165771484375, 0.01226806640625, -0.0274658203125, 0.01251220703125, 0.00946044921875, -0.0157470703125, -0.000133514404296875, 0.0233154296875, -0.005035400...	[ 1250, 4867, 3642, 12301, 34292, 502, 32354, 100, 4527, 23, 3789, 47, 7477, 418, 16498, 2704, 24372, 71924, 1830, 238, 11, 30646, 1193, 2203, 653, 17932, 169, 29568, 707, 98320, 3871, 2046, 11343 ]	[ 0.1505126953125, 0.2362060546875, 0.033050537109375, 0.2100830078125, 0.2371826171875, 0.21728515625, 0.1915283203125, 0.0182342529296875, 0.09228515625, 0.038330078125, 0.1044921875, 0.020477294921875, 0.114013671875, 0.0406494140625, 0.129638671875, 0.1300048828125, 0.0814208984375...	embed
48611847_c0	48611847	prolog	0	Title: Add following numbers to difference list in Prolog Problem title: Add following numbers to difference list in Prolog Tags: prolog Problem: Add following numbers to difference list in Prolog I created a program in Prolog which returns following powers of two starting from one: twos(N, L) :- twosH(N, 1, L). twosH(...	Add following numbers to difference list in Prolog Add following numbers to difference list in Prolog prolog Add Prolog N-1 A-B B-C A-C Add following numbers to difference list in Prolog I created a program in Prolog which returns following powers of two starting from one: I would like it to use difference list instead...	[ 0.00750732421875, 0.005584716796875, 0.006103515625, 0.0208740234375, -0.00191497802734375, 0.02978515625, -0.01519775390625, 0.036376953125, 0.017333984375, -0.031494140625, 0.01275634765625, 0.00124359130859375, 0.007293701171875, 0.025146484375, 0.004302978515625, 0.005035400390625,...	[ 29117, 25632, 101935, 47, 60212, 5303, 1250, 4867, 23, 502, 541, 5759, 62, 9, 571, 335, 441, 75935, 1528, 30646, 14537, 6626, 72134, 1295, 1632, 2806, 1884, 4527, 64457, 20324, 3714, 114689, 71, 12830, 49504, 3934 ]	[ 0.1119384765625, 0.1964111328125, 0.1934814453125, 0.0716552734375, 0.2447509765625, 0.2130126953125, 0.1754150390625, 0.265625, 0.0440673828125, 0.1331787109375, 0.05975341796875, 0.1341552734375, 0.032196044921875, 0.004058837890625, 0.0899658203125, 0.047637939453125, 0.0738525390...	embed
43482898_c0	43482898	prolog	0	Title: Prolog: How to create a program that doesn't allow for a number to be neighbour to another number Problem title: Prolog: How to create a program that doesn't allow for a number to be neighbour to another number Tags: prolog, between Problem: Prolog: How to create a program that doesn't allow for a numb...	Prolog: How to create a program that doesn't allow for a number to be neighbour to another number Prolog: How to create a program that doesn't allow for a number to be neighbour to another number prolog between Prolog How Prolog: How to create a program that doesn't allow for a number to be neighbour to anoth...	[ 0.01190185546875, 0.004791259765625, -0.0021820068359375, -0.00128173828125, -0.005889892578125, 0.019775390625, 0.00188446044921875, 0.01385498046875, 0.00933837890625, -0.031494140625, -0.02197265625, -0.01190185546875, -0.0159912109375, 0.008544921875, 0.003082275390625, 0.006408691...	[ 1250, 4867, 11249, 47, 28282, 1528, 3768, 18, 63769, 14012, 186, 108, 6958, 38648, 15700, 450, 22027, 502, 17721, 100, 3444, 33022, 27117, 24765, 116, 3789, 101935, 1284, 959, 29458, 237, 1919, 18632, 25568, 363, 80389, 190, 2499, 40494, ...	[ 0.1773681640625, 0.262451171875, 0.102294921875, 0.0689697265625, 0.1683349609375, 0.214111328125, 0.0228271484375, 0.10003662109375, 0.1302490234375, 0.1700439453125, 0.03619384765625, 0.0849609375, 0.1400146484375, 0.1707763671875, 0.052734375, 0.03009033203125, 0.046112060546875, ...	embed
23961630_c0	23961630	prolog	0	Title: Prolog List Squaring, Modifying element in List Problem title: Prolog List Squaring, Modifying element in List Tags: prolog Problem: Prolog List Squaring, Modifying element in List I am trying to write a short Prolog program which takes a list of numbers and returns a list where all numbers have been squared. Ie...	Prolog List Squaring, Modifying element in List Prolog List Squaring, Modifying element in List prolog Prolog List Squaring Modifying list_of_squares Prolog List Squaring, Modifying element in List I am trying to write a short Prolog program which takes a list of numbers and returns a list where all numbers have been s...	[ -0.00007867813110351562, 0.033203125, 0.01141357421875, -0.02099609375, 0.007110595703125, 0.00927734375, -0.0137939453125, 0.00555419921875, 0.0233154296875, -0.020751953125, 0.0152587890625, -0.00138092041015625, -0.01019287109375, -0.01409912109375, 0.0048828125, 0.00286865234375, ...	[ 1250, 4867, 32036, 159, 94727, 214, 16269, 151138, 12830, 23, 502, 5303, 4390, 108047, 31577, 33022, 16610, 1528, 51776, 101935, 30646, 756, 2809, 304, 80389, 44357, 617, 2485, 2588, 18151, 2060, 31635, 21208, 22027, 18, 1884, 163, 91, 1193...	[ 0.1763916015625, 0.246826171875, 0.2498779296875, 0.057586669921875, 0.2362060546875, 0.1234130859375, 0.1640625, 0.1053466796875, 0.1634521484375, 0.038665771484375, 0.1236572265625, 0.2042236328125, 0.103271484375, 0.220703125, 0.0634765625, 0.0654296875, 0.11279296875, 0.1311035...	embed
72321311_c1	72321311	prolog	1	\|T], Cr, Index, Size, Sum):- Cr>= Size/2, Line is Size/2, Line =< Cr, Index =< Line, Index1 is Index + 1, row_sum(T, Cr, Index1, Size, S1), Sum is S1 + H. row_sum([_\|T], Cr, Index, Size, Sum):- print(' Entering with no sum '), % Line is Size /2, print(' Houston?? '), Index > Size/2, print('Aaaaaa'), Index1 is Index + 1...	\|T], Cr, Index, Size, Sum):- Cr>= Size/2, Line is Size/2, Line =< Cr, Index =< Line, Index1 is Index + 1, row_sum(T, Cr, Index1, Size, S1), Sum is S1 + H. row_sum([_\|T], Cr, Index, Size, Sum):- print(' Entering with no sum '), % Line is Size /2, print(' Houston?? '), Index > Size/2, print('Aaaaaa'), Index1 is Index + 1...	[ -0.01806640625, 0.009033203125, 0.03564453125, 0.003265380859375, -0.02294921875, -0.0172119140625, 0.00616455078125, 0.01611328125, 0.02099609375, 0.0211181640625, 0.0030517578125, -0.036865234375, -0.0072021484375, -0.002227783203125, 0.005523681640625, 0.0123291015625, 0.033203125...	[ 58745, 618, 268, 41802, 31471, 80378, 36335, 2077, 2740, 1369, 12477, 16777, 83, 4, 418, 997, 106, 15555, 11832, 159, 17727, 572, 28412, 357, 33558, 678, 110, 10554, 1745, 6, 122046, 4767, 284, 83151, 42, 127167, 316, 194, 77947, 4358, ...	[ 0.06622314453125, 0.1009521484375, 0.01385498046875, 0.2200927734375, 0.254150390625, 0.201416015625, 0.2060546875, 0.00909423828125, 0.0548095703125, 0.038848876953125, 0.1754150390625, 0.192138671875, 0.0478515625, 0.000457763671875, 0.05645751953125, 0.09912109375, 0.0289916992187...	embed
5168213_c0	5168213	prolog	0	Title: Downloading and installing VIP7Kernel.dll on my pc Problem title: Downloading and installing VIP7Kernel.dll on my pc Tags: dll, windows, prolog Problem: Downloading and installing VIP7Kernel.dll on my pc I have a VisualProlog program (exe executable) to run but when trying to execute the file windows (Seven in t...	Downloading and installing VIP7Kernel.dll on my pc Downloading and installing VIP7Kernel.dll on my pc dll windows prolog Downloading VIP7Kernel.dll System32 Downloading and installing VIP7Kernel.dll on my pc I have a VisualProlog program (exe executable) to run but when trying to execute the file windows (Seven in this...	[ 0.0234375, 0.01495361328125, -0.004730224609375, 0.01544189453125, 0.001739501953125, 0.0306396484375, -0.021484375, -0.00250244140625, -0.0169677734375, -0.04443359375, 0.00494384765625, 0.01507568359375, -0.025146484375, 0.011962890625, 0.00579833984375, 0.0081787109375, 0.01269531...	[ 4857, 214, 136, 20600, 33881, 966, 605, 3196, 141, 5, 71, 1181, 98, 759, 36719, 81717, 54825, 502, 4867, 12353, 6460, 87, 765, 73372, 10752, 1528, 46480, 71924, 2886, 47, 11675, 1284, 3229, 31577, 11435, 4233, 1353, 14192, 163, 450, 764...	[ 0.1212158203125, 0.03515625, 0.06646728515625, 0.149169921875, 0.25439453125, 0.225830078125, 0.0789794921875, 0.2415771484375, 0.2022705078125, 0.04437255859375, 0.079833984375, 0.190185546875, 0.0499267578125, 0.04742431640625, 0.143798828125, 0.221435546875, 0.1341552734375, 0.1...	embed
72866871_c0	72866871	prolog	0	Title: Comparing the number of nodes at a given depth in Prolog Problem title: Comparing the number of nodes at a given depth in Prolog Tags: prolog, depth, binary-tree Problem: Comparing the number of nodes at a given depth in Prolog Given two binary trees T1 and T2 having the same height, I would like to know how to ...	Comparing the number of nodes at a given depth in Prolog Comparing the number of nodes at a given depth in Prolog prolog depth binary-tree Comparing Prolog Comparing the number of nodes at a given depth in Prolog Given two binary trees T1 and T2 having the same height, I would like to know how to check if the number of...	[ 0.0238037109375, -0.00701904296875, -0.004180908203125, 0.00885009765625, 0.01348876953125, -0.01019287109375, -0.0036163330078125, -0.012939453125, -0.0013885498046875, -0.01495361328125, -0.00113677978515625, -0.02685546875, 0.01104736328125, 0.01123046875, 0.022705078125, -0.0060729...	[ 113307, 14012, 110, 988, 99, 34475, 168867, 1250, 4867, 502, 2394, 62600, 6626, 6635, 1360, 90, 384, 418, 136, 304, 5701, 155955, 3714, 12765, 2174, 105950, 34292, 391, 1653, 2063, 132887, 5021, 257, 397, 618, 541, 74481, 61924, 28, 16178...	[ 0.189208984375, 0.103759765625, 0.1737060546875, 0.16259765625, 0.02239990234375, 0.026336669921875, 0.2442626953125, 0.166748046875, 0.2330322265625, 0.1214599609375, 0.158447265625, 0.130859375, 0.02996826171875, 0.05078125, 0.166259765625, 0.01531982421875, 0.10040283203125, 0.0...	embed
26209403_c0	26209403	prolog	0	Title: Prolog find elements in the list with accumulator Problem title: Prolog find elements in the list with accumulator Tags: prolog Problem: Prolog find elements in the list with accumulator I am trying to understand accumulators, so I want this implementation to contain them. I have figured how to search through a ...	Prolog find elements in the list with accumulator Prolog find elements in the list with accumulator prolog Prolog Element Tail Prolog find elements in the list with accumulator I am trying to understand accumulators, so I want this implementation to contain them. I have figured how to search through a simple list. This...	[ -0.0064697265625, 0.0185546875, 0.003143310546875, 0.0257568359375, -0.00836181640625, 0.03125, -0.007720947265625, 0.006195068359375, 0.0004367828369140625, -0.048095703125, 0.0181884765625, -0.0303955078125, 0.013671875, 0.01806640625, 0.0169677734375, -0.0133056640625, 0.021484375...	[ 1250, 4867, 7413, 80854, 23, 5303, 678, 183278, 1290, 502, 48325, 1218, 379, 31577, 28219, 22230, 3444, 208124, 70541, 26366, 33938, 8305, 8781, 54529, 14012, 74918, 42, 69098, 34475, 12830, 3249, 4488, 8512, 71, 7 ]	[ 0.1514892578125, 0.220458984375, 0.1204833984375, 0.2197265625, 0.10430908203125, 0.19384765625, 0.111572265625, 0.244140625, 0.1702880859375, 0.10595703125, 0.1458740234375, 0.09881591796875, 0.104248046875, 0.006988525390625, 0.06463623046875, 0.1448974609375, 0.02496337890625, 0...	embed
9561031_c0	9561031	prolog	0	Title: Generating dynamic size permutations in SWI-Prolog results with ERROR: Out of global stack Problem title: Generating dynamic size permutations in SWI-Prolog results with ERROR: Out of global stack Tags: prolog, clpfd Problem: Generating dynamic size permutations in SWI-Prolog results with ERROR: Out of global st...	Generating dynamic size permutations in SWI-Prolog results with ERROR: Out of global stack Generating dynamic size permutations in SWI-Prolog results with ERROR: Out of global stack prolog clpfd Generating SWI-Prolog ERROR Out use_module Indexes Generating dynamic size permutations in SWI-Prolog results with ERROR: Out...	[ 0.00799560546875, 0.0228271484375, 0.011962890625, 0.0045166015625, -0.0081787109375, 0.0023651123046875, -0.0185546875, -0.002471923828125, 0.006683349609375, -0.05126953125, -0.005889892578125, -0.024169921875, 0.01104736328125, -0.00148773193359375, 0.025634765625, 0.003097534179687...	[ 155370, 84079, 13267, 117, 14311, 21094, 159, 38969, 10752, 4867, 50339, 151206, 24638, 13538, 111, 7964, 177261, 502, 33139, 39557, 71, 4527, 83279, 31471, 31577, 139392, 48716, 18151, 30646, 756, 3564, 150631 ]	[ 0.1356201171875, 0.1722412109375, 0.146240234375, 0.1092529296875, 0.202880859375, 0.05584716796875, 0.0626220703125, 0.227294921875, 0.1036376953125, 0.1787109375, 0.0833740234375, 0.122314453125, 0.103515625, 0.1929931640625, 0.1754150390625, 0.1864013671875, 0.2454833984375, 0.0...	embed
2441034_c0	2441034	prolog	0	Title: Prolog : Simple question Problem title: Prolog : Simple question Tags: prolog Problem: Prolog : Simple question I want to add any strings user entered into a list run :- write('How many students you have: '),read(x),nl. enterNameOfStudents(x). enterNameOfStudents(x) :- for(A, 1, x, 1),write('Please enter the nam...	Prolog : Simple question Prolog : Simple question prolog Prolog Simple How Please Prolog : Simple question I want to add any strings user entered into a list What do i put in the ?????? portion to ensure that whatever the user enter will go into a user-defined list which will be used for further processing later ? Plea...	[ 0.0167236328125, 0.01409912109375, -0.0030975341796875, 0.02490234375, -0.01416015625, 0.0244140625, 0.0087890625, 0.01324462890625, 0.0135498046875, -0.0361328125, 0.0079345703125, -0.01507568359375, -0.004852294921875, 0.01080322265625, 0.00799560546875, -0.01300048828125, 0.018920...	[ 1250, 4867, 60552, 9655, 502, 11249, 30607, 3444, 47, 15190, 2499, 79315, 7, 38937, 30957, 297, 3934, 10, 5303, 17, 3884, 23, 705, 85908, 126826, 63284, 89778, 1221, 738, 112, 5983, 11814, 9433, 4358, 37842, 183851, 41884, 114689, 71, 378...	[ 0.123291015625, 0.197509765625, 0.205078125, 0.1739501953125, 0.0789794921875, 0.0701904296875, 0.16845703125, 0.1015625, 0.008819580078125, 0.18212890625, 0.07257080078125, 0.2255859375, 0.08673095703125, 0.1580810546875, 0.1712646484375, 0.076416015625, 0.1129150390625, 0.0731811...	embed
11261926_c0	11261926	prolog	0	Title: How similar are Relational Database Languages and Logic Programming? Problem title: How similar are Relational Database Languages and Logic Programming? Tags: prolog, clojure-core.logic, relational-database, clojure Problem: How similar are Relational Database Languages and Logic Programming? What are the simila...	How similar are Relational Database Languages and Logic Programming? How similar are Relational Database Languages and Logic Programming? prolog clojure-core.logic relational-database clojure How Relational Database Languages Logic Programming core.logic clojure-core.logic How similar are Relational Database Languages ...	[ 0.0146484375, 0.0166015625, 0.0087890625, 0.01953125, -0.01055908203125, 0.0164794921875, -0.012451171875, -0.01019287109375, 0.0037384033203125, -0.0322265625, -0.001617431640625, 0.0009613037109375, -0.01055908203125, -0.0179443359375, 0.002349853515625, -0.01507568359375, -0.02087...	[ 21373, 116822, 289, 187781, 83658, 50592, 238, 27958, 214, 502, 4867, 20450, 461, 107, 30854, 137043, 41911, 10135, 37382, 11249, 56458, 136, 60212, 20531, 23755, 208124, 63399, 46876, 99247, 62775, 56037, 1940, 152028 ]	[ 0.15625, 0.2021484375, 0.130126953125, 0.2088623046875, 0.194580078125, 0.216064453125, 0.0966796875, 0.1912841796875, 0.0703125, 0.106689453125, 0.2210693359375, 0.118896484375, 0.151123046875, 0.1234130859375, 0.127685546875, 0.207763671875, 0.176025390625, 0.019805908203125, 0...	embed
34558948_c0	34558948	prolog	0	Title: make/0 functionality for SICStus Problem title: make/0 functionality for SICStus Tags: module, sicstus-prolog, prolog Problem: make/0 functionality for SICStus How can I ensure that all modules (and ideally also all other files that have been loaded or included) are up-to-date? When issuing use_module(mymodule) ...	make/0 functionality for SICStus make/0 functionality for SICStus module sicstus-prolog prolog mymodule SICStus use_module mymodule.pl make/0 functionality for SICStus How can I ensure that all modules (and ideally also all other files that have been loaded or included) are up-to-date? When issuing use_module(mymodule)...	[ -0.00567626953125, 0.0135498046875, 0.00982666015625, 0.00946044921875, -0.0079345703125, 0.0087890625, -0.005401611328125, 0.013671875, -0.0003490447998046875, -0.0439453125, -0.0098876953125, 0.004425048828125, -0.005279541015625, -0.0169677734375, 0.01953125, 0.00017261505126953125,...	[ 3249, 107838, 123309, 2481, 159, 102198, 2143, 100, 88996, 26536, 18253, 3454, 4867, 502, 759, 83279, 4527, 13, 2424, 831, 87, 63284, 450, 756, 6397, 3789, 102158, 72367, 99201, 621, 1257, 188, 17489, 1159, 1176, 69101, 129344, 5622, 11435,...	[ 0.1971435546875, 0.241455078125, 0.200927734375, 0.01788330078125, 0.1568603515625, 0.127197265625, 0.2401123046875, 0.002532958984375, 0.212158203125, 0.130615234375, 0.2098388671875, 0.07855224609375, 0.165283203125, 0.05938720703125, 0.142822265625, 0.1822509765625, 0.1357421875, ...	embed
15018251_c0	15018251	prolog	0	Title: maplist raises uncaught exception: error(existence_error(procedure,maplist/2),top_level/0) Problem title: maplist raises uncaught exception: error(existence_error(procedure,maplist/2),top_level/0) Tags: prolog, gnu-prolog Problem: maplist raises uncaught exception: error(existence_error(procedure,maplist/2),top_...	maplist raises uncaught exception: error(existence_error(procedure,maplist/2),top_level/0) maplist raises uncaught exception: error(existence_error(procedure,maplist/2),top_level/0) prolog gnu-prolog existence_error top_level GNU Prolog Daniel Diaz Copyright maplist raises uncaught exception: error(existence_error(proc...	[ 0.01031494140625, 0.0189208984375, 0.0054931640625, 0.005279541015625, -0.0201416015625, 0.014892578125, 0.01263427734375, 0.017822265625, -0.0130615234375, -0.032958984375, 0.01348876953125, -0.0020751953125, -0.005950927734375, 0.005828857421875, 0.014404296875, -0.017333984375, 0....	[ 22288, 6562, 138804, 51, 408, 46526, 131527, 18499, 116311, 188800, 232578, 62346, 12477, 13784, 67919, 107838, 502, 4867, 104155, 3454, 2663, 165132, 1250, 11555, 4512, 169, 4189, 454, 132, 25632, 11814, 43240, 23, 91, 2452, 9, 959, 706 ]	[ 0.2095947265625, 0.270751953125, 0.1473388671875, 0.0545654296875, 0.1002197265625, 0.1236572265625, 0.1922607421875, 0.143310546875, 0.1697998046875, 0.1912841796875, 0.1142578125, 0.1461181640625, 0.115234375, 0.082275390625, 0.1402587890625, 0.1123046875, 0.1329345703125, 0.2169...	embed
29446036_c0	29446036	prolog	0	Title: prolog- break a list Problem title: prolog- break a list Tags: prolog, list Problem: prolog- break a list The example is like this ?- runs([3,4,5,4,2,7,5,6,6,8,3], RunList). RunList = [[3, 4, 5], [4], [2, 7], [5, 6, 6, 8], [3]] The list need to be broken in to a number of non-decreasing sequence of consecutive n...	prolog- break a list prolog- break a list prolog list RunList runs1 prolog- break a list The example is like this The list need to be broken in to a number of non-decreasing sequence of consecutive numbers. My code is: I tried lots of methods, but still do not know how to write it... Hope someone could help me. Thanks ...	[ -0.00113677978515625, 0.0030975341796875, 0.011962890625, 0.01312255859375, -0.012939453125, 0.0179443359375, -0.007568359375, -0.006378173828125, 0.01507568359375, -0.003448486328125, 0.033447265625, 0.0299072265625, -0.0264892578125, 0.01507568359375, 0.00628662109375, 0.013610839843...	[ 502, 4867, 9, 36356, 10, 5303, 28398, 154663, 127877, 418, 27781, 1884, 903, 3871, 186, 148431, 23, 47, 14012, 351, 50718, 1283, 40, 944, 148390, 101935, 18151, 37842, 71358, 150624, 959, 3714, 3642, 33022, 442, 75359, 4358 ]	[ 0.193603515625, 0.254638671875, 0.049530029296875, 0.2467041015625, 0.09552001953125, 0.23291015625, 0.1588134765625, 0.214599609375, 0.1905517578125, 0.08721923828125, 0.1387939453125, 0.0237884521484375, 0.003124237060546875, 0.0762939453125, 0.01403045654296875, 0.1978759765625, 0...	embed
78549871_c2	78549871	prolog	2	, latex_pred, TPTP, Formula, Proof, iteration:I, P_Proof, portray_clause, buss_tex_print, term_lower_upper, L_Proof, _LaTeX_output, LOGICAL, RULES, unify_with_occurs_check, FIRST, NON-BRANCHING, Conditional, Rule_applied, r_to, Disjunction, r_lor, Conjunction, l_land, Negation, r_neg, l_neg, SECOND, BRANCHING, PROPOSIT...	, latex_pred, TPTP, Formula, Proof, iteration:I, P_Proof, portray_clause, buss_tex_print, term_lower_upper, L_Proof, _LaTeX_output, LOGICAL, RULES, unify_with_occurs_check, FIRST, NON-BRANCHING, Conditional, Rule_applied, r_to, Disjunction, r_lor, Conjunction, l_land, Negation, r_neg, l_neg, SECOND, BRANCHING, PROPOSIT...	[ 0.01251220703125, 0.012451171875, 0.00159454345703125, 0.007171630859375, 0.0009765625, 0.01141357421875, 0.0279541015625, -0.00872802734375, -0.00518798828125, 0.0103759765625, 0.0027618408203125, 0.01165771484375, 0.01031494140625, -0.031494140625, 0.006317138671875, 0.0087890625, ...	[ 4, 21, 24371, 19714, 18303, 23658, 72791, 1250, 4390, 720, 2320, 568, 436, 10752, 11469, 7092, 18347, 4032, 79401, 35662, 13579, 17336, 56, 34, 8079, 339, 2729, 10476, 1542, 6056, 7077, 22215, 18027, 141029, 46845, 47138, 51, 40383, 76228, ...	[ 0.061187744140625, 0.1248779296875, 0.273681640625, 0.1978759765625, 0.0968017578125, 0.2208251953125, 0.2178955078125, 0.1685791015625, 0.2249755859375, 0.202392578125, 0.0169525146484375, 0.0989990234375, 0.06011962890625, 0.181640625, 0.1268310546875, 0.151611328125, 0.06530761718...	embed
8362797_c0	8362797	prolog	0	Title: Prolog lists Error: out of global stack Problem title: Prolog lists Error: out of global stack Tags: dcg, global, list, prolog, stack Problem: Prolog lists Error: out of global stack I'm trying to write a rule in prolog adjacent(X,Y,Zs) , as true if X and Y are adjacent to each other in the list Zs . I currently...	Prolog lists Error: out of global stack Prolog lists Error: out of global stack dcg global list prolog stack Prolog Error Out Prolog lists Error: out of global stack I'm trying to write a rule in prolog adjacent(X,Y,Zs) , as true if X and Y are adjacent to each other in the list Zs . I currently have: test: Do you guys...	[ 0.006988525390625, 0.0093994140625, 0.00070953369140625, -0.0029296875, -0.01361083984375, 0.010986328125, -0.00836181640625, 0.035400390625, 0.010986328125, -0.037353515625, 0.01446533203125, -0.0098876953125, -0.0021820068359375, 0.005859375, 0.0260009765625, 0.00860595703125, 0.02...	[ 1250, 4867, 5303, 212059, 1810, 111, 7964, 177261, 7, 104, 238, 177, 502, 13538, 31577, 33022, 79986, 123594, 16797, 1542, 1723, 1511, 29568, 2174, 1193, 136, 990, 12638, 3789, 23, 567, 82424, 3034, 25647, 129745 ]	[ 0.18017578125, 0.2457275390625, 0.229248046875, 0.1915283203125, 0.2174072265625, 0.2259521484375, 0.2188720703125, 0.2412109375, 0.09600830078125, 0.0298614501953125, 0.05792236328125, 0.1251220703125, 0.1453857421875, 0.1995849609375, 0.08087158203125, 0.1033935546875, 0.1832275390...	embed
16175239_c0	16175239	prolog	0	Title: Finding root of file and read in Prolog Problem title: Finding root of file and read in Prolog Tags: prolog Problem: Finding root of file and read in Prolog I need to read a file into database in prolog with code below: open('C:/Files/text.txt', read, S) it read perfectly but i have to use my pl into another com...	Finding root of file and read in Prolog Finding root of file and read in Prolog prolog Finding Prolog Files text.txt Finding root of file and read in Prolog I need to read a file into database in prolog with code below: it read perfectly but i have to use my pl into another computer and directory can be different for e...	[ 0.0263671875, -0.00958251953125, 0.0216064453125, 0.01708984375, -0.01031494140625, 0.004852294921875, 0.01409912109375, -0.0087890625, 0.0017852783203125, -0.076171875, 0.006439208984375, 0.029052734375, -0.01611328125, -0.00726318359375, 0.0218505859375, -0.032470703125, 0.00376892...	[ 26040, 74855, 111, 11435, 12301, 23, 1250, 4867, 214, 136, 502, 42724, 7986, 124326, 3871, 3934, 63399, 18151, 35064, 169123, 4527, 6456, 15700, 13909, 14364, 12921, 15549, 9803, 759, 174350, 22829, 35782, 26785, 1830, 5701, 78303, 26866 ]	[ 0.114501953125, 0.2431640625, 0.181396484375, 0.1351318359375, 0.165283203125, 0.042816162109375, 0.191162109375, 0.2432861328125, 0.0255584716796875, 0.041229248046875, 0.130859375, 0.142578125, 0.176025390625, 0.227783203125, 0.0205230712890625, 0.0584716796875, 0.10748291015625, ...	embed
65272973_c0	65272973	prolog	0	Title: How to do only 2 recursive calls in Prolog? Problem title: How to do only 2 recursive calls in Prolog? Tags: predicate, prolog, recursion Problem: How to do only 2 recursive calls in Prolog? isTallerThan2(X,Y) :- tallerThan(X,Y). isTallerThan2(X,Y) :- tallerThan(X,Z), isTallerThan2(Z,Y). Where I want to find whe...	How to do only 2 recursive calls in Prolog? How to do only 2 recursive calls in Prolog? predicate prolog recursion How Prolog isTallerThan2 How to do only 2 recursive calls in Prolog? Where I want to find where someone is taller than 2 people. If I have lots of relations where person X is taller than person Y like this...	[ 0.01177978515625, 0.000888824462890625, 0.01019287109375, 0.0220947265625, 0.003387451171875, 0.019775390625, -0.015869140625, -0.0093994140625, 0.01470947265625, -0.02734375, 0.0267333984375, -0.0181884765625, -0.00086212158203125, 0.004180908203125, 0.0341796875, -0.0120849609375, ...	[ 11249, 47, 54, 4734, 116, 195625, 5844, 11782, 7, 23, 1250, 4867, 1653, 2063, 502, 1830, 83, 618, 67665, 1121, 304, 78662, 3444, 7413, 7440, 22008, 49518, 3501, 3395, 71358, 91582, 3445, 1193, 990, 903, 1542, 1723, 876, 501, 756, 1284, ...	[ 0.07220458984375, 0.0273284912109375, 0.049713134765625, 0.1671142578125, 0.2100830078125, 0.2255859375, 0.155517578125, 0.211669921875, 0.0816650390625, 0.059326171875, 0.1856689453125, 0.28564453125, 0.0906982421875, 0.1287841796875, 0.1456298828125, 0.03326416015625, 0.07934570312...	embed
42938360_c0	42938360	prolog	0	Title: How to make a predcate which validates the values from one list to another in Prolog? Problem title: How to make a predcate which validates the values from one list to another in Prolog? Tags: list, prolog Problem: How to make a predcate which validates the values from one list to another in Prolog? I have 2 lis...	How to make a predcate which validates the values from one list to another in Prolog? How to make a predcate which validates the values from one list to another in Prolog? list prolog one How Prolog How to make a predcate which validates the values from one list to another in Prolog? I have 2 lists (A and B). I want to...	[ -0.0009918212890625, -0.00080108642578125, 0.004058837890625, 0.028076171875, -0.00439453125, 0.02197265625, -0.0030364990234375, 0.003631591796875, 0.012939453125, 0.0081787109375, 0.01055908203125, 0.01263427734375, 0.0274658203125, 0.01129150390625, -0.0089111328125, -0.010925292968...	[ 11249, 3249, 10, 1653, 33478, 44622, 1636, 142424, 1295, 1632, 5303, 47, 15700, 1250, 4867, 3129, 502, 23, 116, 284, 335, 4527, 12765, 2174, 62, 9969, 25720, 5443, 82825, 29568, 106, 136, 17262, 304, 98320, 13695, 12989 ]	[ 0.0865478515625, 0.1199951171875, 0.072998046875, 0.2388916015625, 0.2607421875, 0.2357177734375, 0.0709228515625, 0.1572265625, 0.10791015625, 0.09820556640625, 0.1788330078125, 0.10638427734375, 0.0699462890625, 0.18505859375, 0.2330322265625, 0.0203704833984375, 0.1353759765625, ...	embed
14638034_c0	14638034	prolog	0	Title: How do you save all possible solutions in SWI-Prolog? Problem title: How do you save all possible solutions in SWI-Prolog? Tags: prolog Problem: How do you save all possible solutions in SWI-Prolog? I have this predicate that has about a thousand possibilities and I need all possibilities as an output. It is not...	How do you save all possible solutions in SWI-Prolog? How do you save all possible solutions in SWI-Prolog? prolog How SWI-Prolog Fo2 How do you save all possible solutions in SWI-Prolog? I have this predicate that has about a thousand possibilities and I need all possibilities as an output. It is not possible to simpl...	[ 0.02685546875, 0.010009765625, 0.0223388671875, 0.0196533203125, -0.02099609375, 0.01202392578125, 0.00006866455078125, 0.0004062652587890625, 0.01318359375, -0.026611328125, 0.004852294921875, 0.00543212890625, -0.00022983551025390625, -0.0179443359375, 0.009033203125, 0.0115966796875...	[ 11249, 30098, 756, 7722, 51347, 23, 159, 38969, 9, 10752, 4867, 502, 9572, 304, 54, 398, 1653, 2063, 67, 199823, 97370, 3871, 237, 140992, 43658, 71099, 145870, 2449, 3773, 831, 4734, 192046, 1257, 221, 5045, 3917, 16750, 11435 ]	[ 0.08837890625, 0.2049560546875, 0.158203125, 0.202880859375, 0.23486328125, 0.0684814453125, 0.09033203125, 0.23974609375, 0.04254150390625, 0.16650390625, 0.238037109375, 0.1287841796875, 0.141845703125, 0.1337890625, 0.0268096923828125, 0.011138916015625, 0.06304931640625, 0.0823...	embed
27913479_c0	27913479	prolog	0	Title: Asterisks Triangle in prolog Problem title: Asterisks Triangle in prolog Tags: prolog Problem: Asterisks Triangle in prolog I have to define the prolog pyramid(N) that prints out a pyramid of asterisks of given height as in the following example. pyramid(4). * * * ***** true this is what i have done so f...	Asterisks Triangle in prolog Asterisks Triangle in prolog prolog Asterisks Triangle Asterisks Triangle in prolog I have to define the prolog pyramid(N) that prints out a pyramid of asterisks of given height as in the following example. this is what i have done so far... I can't find the way to print out the rest of sta...	[ 0.0111083984375, 0.002685546875, -0.01080322265625, -0.007476806640625, 0.001495361328125, 0.0079345703125, -0.005645751953125, 0.000919342041015625, -0.00927734375, -0.00958251953125, 0.006378173828125, -0.017822265625, -0.0137939453125, 0.0118408203125, -0.0164794921875, 0.0150756835...	[ 65473, 57786, 7, 4699, 109217, 23, 502, 4867, 61924, 242810, 839, 28412, 1810, 10, 1515, 6581, 155955, 27781, 2060, 3917, 10588, 6057, 44841, 12638, 124519, 8060, 1653, 2063, 34831, 1614, 17365, 1528, 165523 ]	[ 0.133056640625, 0.23779296875, 0.009490966796875, 0.201904296875, 0.2152099609375, 0.0318603515625, 0.17431640625, 0.2430419921875, 0.157470703125, 0.23779296875, 0.1170654296875, 0.1431884765625, 0.0777587890625, 0.0087890625, 0.1263427734375, 0.1650390625, 0.153564453125, 0.05282...	embed
6347091_c0	6347091	prolog	0	Title: Parse Variables Using DCG Problem title: Parse Variables Using DCG Tags: dcg, grammar, prolog Problem: Parse Variables Using DCG I am having trouble parsing sequences that begin with capital letters into variables using Prolog's DCG notation. For instance, if I have the string f a X y Z X and a DCG that parses t...	Parse Variables Using DCG Parse Variables Using DCG dcg grammar prolog Parse Variables Using DCG Head Args Parse Variables Using DCG I am having trouble parsing sequences that begin with capital letters into variables using Prolog's DCG notation. For instance, if I have the string and a DCG that parses this string, is ...	[ 0.00823974609375, -0.0037689208984375, -0.027587890625, 0.0277099609375, 0.01055908203125, 0.0255126953125, -0.0017852783203125, -0.008544921875, 0.0086669921875, -0.0260009765625, -0.01385498046875, -0.0262451171875, -0.01519775390625, 0.01318359375, 0.01055908203125, 0.0203857421875,...	[ 2392, 184, 111477, 13566, 345, 6953, 391, 56367, 104, 238, 177, 122092, 147, 502, 4867, 44816, 1172, 9405, 63134, 366, 40, 26513, 9842, 678, 10323, 120820, 3934, 77336, 1250, 110, 22062, 79315, 5908, 903, 2499, 3917, 12638, 31330, 36998, ...	[ 0.1591796875, 0.1129150390625, 0.21826171875, 0.1243896484375, 0.088623046875, 0.0601806640625, 0.126708984375, 0.2359619140625, 0.046112060546875, 0.0401611328125, 0.1070556640625, 0.0765380859375, 0.0400390625, 0.09063720703125, 0.2255859375, 0.0916748046875, 0.093017578125, 0.05...	embed
63882436_c0	63882436	prolog	0	Title: Prolog sum distance between list of nodes ids Problem title: Prolog sum distance between list of nodes ids Tags: prolog, instantiation-error Problem: Prolog sum distance between list of nodes ids node(1,22,44). node(2,43,53). node(3,23,12). distancePath([X,Y],D) :- distance(X,Y,D). distancePath([H,X\|T],Distance)...	Prolog sum distance between list of nodes ids Prolog sum distance between list of nodes ids prolog instantiation-error Prolog Id1 Id2 X2-X1 Y2-Y1 Distance Rest Aux Prolog sum distance between list of nodes ids I have some kind of problem on the distancePath because when i run distancePath([1,2,3],Distance). it give me ...	[ 0.0140380859375, -0.004608154296875, 0.00860595703125, 0.00958251953125, -0.0003910064697265625, 0.005340576171875, -0.016357421875, 0.01190185546875, 0.00157928466796875, -0.05859375, 0.0126953125, -0.00958251953125, -0.002166748046875, -0.004486083984375, -0.000911712646484375, 0.001...	[ 1250, 4867, 10554, 62488, 17721, 5303, 110, 988, 3447, 502, 34648, 14, 188800, 24799, 418, 304, 1193, 18504, 990, 1723, 154349, 49756, 6077, 8562, 111, 2967, 683, 10519, 11675, 133063, 96386, 14055, 116071, 4153, 4384, 118, 2320, 18499, 23,...	[ 0.1455078125, 0.2264404296875, 0.178466796875, 0.20263671875, 0.10888671875, 0.10443115234375, 0.1441650390625, 0.13037109375, 0.1121826171875, 0.118896484375, 0.1317138671875, 0.09765625, 0.162353515625, 0.081787109375, 0.018402099609375, 0.05682373046875, 0.023895263671875, 0.076...	embed
27263630_c0	27263630	prolog	0	Title: Prolog program to reverse and append the list Problem title: Prolog program to reverse and append the list Tags: prolog Problem: Prolog program to reverse and append the list I am new to prolog. I am trying to reverse the order of list and append them. For example : revappend([1,2], [3,4], X) Should give me resu...	Prolog program to reverse and append the list Prolog program to reverse and append the list prolog Prolog List InputListB Head InputListA OutputList Prolog program to reverse and append the list I am new to prolog. I am trying to reverse the order of list and append them. For example : revappend([1,2], [3,4], X) Should...	[ -0.0076904296875, 0.030029296875, 0.024658203125, 0.0035247802734375, -0.0194091796875, 0.029541015625, 0.01104736328125, 0.031494140625, 0.0245361328125, -0.00927734375, 0.033203125, -0.002471923828125, -0.01251220703125, 0.0137939453125, -0.002166748046875, -0.0022125244140625, 0.0...	[ 1250, 4867, 1528, 47, 39531, 184, 136, 114689, 71, 70, 5303, 502, 32036, 360, 7077, 154663, 571, 44816, 284, 13538, 3525, 31577, 12989, 111, 2856, 27781, 37868, 9007, 3611, 132, 133063, 82449, 1193, 151117, 8337, 16750, 1884, 18151, 54397, ...	[ 0.1798095703125, 0.268798828125, 0.1998291015625, 0.03955078125, 0.2362060546875, 0.19775390625, 0.1009521484375, 0.178955078125, 0.148193359375, 0.0286407470703125, 0.23095703125, 0.135009765625, 0.1461181640625, 0.050567626953125, 0.042633056640625, 0.1588134765625, 0.085693359375,...	embed
38075681_c0	38075681	prolog	0	Title: How would I create the database for this scenario in Prolog? Problem title: How would I create the database for this scenario in Prolog? Tags: prolog, database Problem: How would I create the database for this scenario in Prolog? The first image is an image of a symantic net diagram and is an image of a scenario...	How would I create the database for this scenario in Prolog? How would I create the database for this scenario in Prolog? prolog database How Prolog How would I create the database for this scenario in Prolog? The first image is an image of a symantic net diagram and is an image of a scenario from my college assignment...	[ 0.033203125, 0.016845703125, -0.004730224609375, 0.0380859375, -0.01483154296875, 0.0225830078125, 0.006011962890625, -0.00173187255859375, -0.0081787109375, -0.0301513671875, 0.024658203125, 0.00408935546875, -0.007568359375, -0.0006561279296875, 0.00112152099609375, -0.01220703125, ...	[ 11249, 2806, 87, 28282, 70, 63399, 100, 903, 106117, 23, 1250, 4867, 502, 5117, 29569, 83, 954, 39, 109109, 2043, 117233, 759, 40466, 95486, 149016, 35672, 19048, 4358, 31577, 30022, 1528, 17, 19441, 63134, 129745, 3293, 37842, 2060, 69407 ...	[ 0.1082763671875, 0.1044921875, 0.040679931640625, 0.1790771484375, 0.0947265625, 0.283447265625, 0.09423828125, 0.10986328125, 0.2203369140625, 0.08837890625, 0.1729736328125, 0.2430419921875, 0.140869140625, 0.04742431640625, 0.14697265625, 0.020111083984375, 0.01495361328125, 0.0...	embed
64783983_c0	64783983	prolog	0	Title: How to pass list's values one by one in another predicate prolog Problem title: How to pass list's values one by one in another predicate prolog Tags: prolog Problem: How to pass list's values one by one in another predicate prolog This is my prologdb file trip_to_nation(X,Y,T):- % X is a city ,T is a ...	How to pass list's values one by one in another predicate prolog How to pass list's values one by one in another predicate prolog prolog How trip_to_nation list_airport all_trip How to pass list's values one by one in another predicate prolog This is my prologdb file I want to pass the list's value one by one...	[ 0.0167236328125, -0.003265380859375, -0.00142669677734375, 0.025390625, -0.0216064453125, 0.0111083984375, 0.01123046875, 0.00738525390625, 0.02685546875, -0.03466796875, 0.013427734375, 0.0206298828125, -0.010986328125, 0.01007080078125, -0.00897216796875, 0.0084228515625, 0.0217285...	[ 11249, 47, 27875, 5303, 3768, 142424, 1632, 390, 15700, 1653, 2063, 502, 4867, 24745, 188, 19, 7341, 6982, 756, 59623, 67, 48073, 11435, 3444, 34292, 2046, 2053, 7722, 2389, 6562, 25256 ]	[ 0.086181640625, 0.03167724609375, 0.1710205078125, 0.2578125, 0.0748291015625, 0.1851806640625, 0.1202392578125, 0.1151123046875, 0.0860595703125, 0.122802734375, 0.1871337890625, 0.1658935546875, 0.2120361328125, 0.193115234375, 0.1563720703125, 0.05108642578125, 0.0672607421875, ...	embed
60659698_c0	60659698	prolog	0	Title: Prolog - Manipulating the same list for several times Problem title: Prolog - Manipulating the same list for several times Tags: prolog, immutability Problem: Prolog - Manipulating the same list for several times I am new to Prolog and trying to modify a list by deleting elements by indices. For example: remove(...	Prolog - Manipulating the same list for several times Prolog - Manipulating the same list for several times prolog immutability Prolog Manipulating Prolog - Manipulating the same list for several times I am new to Prolog and trying to modify a list by deleting elements by indices. For example: However, when I try to ru...	[ 0.00543212890625, 0.01953125, 0.00689697265625, 0.005218505859375, -0.0177001953125, -0.02099609375, -0.01409912109375, 0.0185546875, 0.0234375, -0.020751953125, 0.0126953125, 0.01031494140625, -0.004119873046875, 0.005950927734375, 0.01153564453125, 0.0169677734375, 0.0208740234375,...	[ 1250, 4867, 221169, 26518, 5701, 5303, 100, 40368, 20028, 502, 566, 14311, 41159, 3525, 31577, 2811, 40383, 24674, 80854, 136044, 3229, 9790, 11675, 903, 1653, 2063, 13438, 70, 9325, 237, 68252, 155761, 5351, 442, 45767, 29479, 297, 23, 295...	[ 0.19384765625, 0.260009765625, 0.2396240234375, 0.100341796875, 0.1490478515625, 0.186279296875, 0.07635498046875, 0.1683349609375, 0.2113037109375, 0.1439208984375, 0.050445556640625, 0.180419921875, 0.0906982421875, 0.050506591796875, 0.05621337890625, 0.13232421875, 0.090942382812...	embed
35026596_c0	35026596	prolog	0	Title: Solving Kakuro puzzle (5x5) in Prolog Problem title: Solving Kakuro puzzle (5x5) in Prolog Tags: clpfd, prolog Problem: Solving Kakuro puzzle (5x5) in Prolog Assuming that: A+B+C=24 E+F+G=11 J+K+L=22 N+O+P=14 A+E=17 B+F+J+N=26 C+G+K+O=15 L+P=13 How could i find a possible solution to the problem, given the const...	Solving Kakuro puzzle (5x5) in Prolog Solving Kakuro puzzle (5x5) in Prolog clpfd prolog Solving Kakuro Prolog B-C F-J-N G-K-O F-G K-L O-P Solving Kakuro puzzle (5x5) in Prolog Assuming that: How could i find a possible solution to the problem, given the constraints above, using the predicate solve/1 ? My first attempt...	[ 0.0022735595703125, 0.0101318359375, 0.00537109375, -0.0028839111328125, -0.0162353515625, -0.0169677734375, -0.034912109375, 0.0146484375, -0.0029754638671875, -0.0042724609375, 0.009521484375, -0.0166015625, 0.004608154296875, 0.021240234375, 0.01397705078125, 0.0078125, 0.00253295...	[ 6678, 6496, 40497, 11951, 104192, 11516, 425, 43317, 23, 1250, 4867, 71, 502, 335, 9, 441, 563, 1375, 839, 605, 724, 341, 866, 180, 683, 66596, 11249, 5809, 7413, 7722, 29806, 47, 2967, 2816, 17368, 1653, 2063, 67, 86869, 11583, 5117, ...	[ 0.1219482421875, 0.0882568359375, 0.173828125, 0.303955078125, 0.1875, 0.117431640625, 0.1240234375, 0.190185546875, 0.0421142578125, 0.1427001953125, 0.2037353515625, 0.0188140869140625, 0.06884765625, 0.053985595703125, 0.0269622802734375, 0.019439697265625, 0.0183868408203125, 0...	embed

40945905_c0

40945905

prolog

0

Title: How to test binary trees in prolog Problem title: How to test binary trees in prolog Tags: prolog, binary-tree Problem: How to test binary trees in prolog I want to test this prolog program: # binary_tree(void). binary_tree(tree(_Element,Left,Right)):-binary_tree(Left),binary_tree(Right). test(tree(a,tree(b,tree...

How to test binary trees in prolog How to test binary trees in prolog prolog binary-tree How binary_tree _Element Left Right How to test binary trees in prolog I want to test this prolog program: # # When I execute it with: I get (and I should get "true" instead) What am I doing wrong? Thanks

[ 0.02392578125, 0.009765625, -0.0048828125, 0.007720947265625, 0.0028533935546875, 0.024658203125, -0.0189208984375, -0.0032806396484375, -0.0029296875, -0.0220947265625, 0.00013256072998046875, -0.0145263671875, -0.0184326171875, 0.0211181640625, 0.0289306640625, 0.007476806640625, 0...

[ 11249, 47, 3034, 2394, 6635, 1360, 90, 23, 502, 4867, 62600, 19929, 2480, 90911, 3444, 1528, 71924, 678, 2046, 5608, 9774, 64457, 44691 ]

[ 0.04217529296875, 0.052337646484375, 0.2144775390625, 0.162353515625, 0.118896484375, 0.2015380859375, 0.0548095703125, 0.03076171875, 0.1546630859375, 0.216796875, 0.2337646484375, 0.1109619140625, 0.06658935546875, 0.0992431640625, 0.0107421875, 0.07061767578125, 0.0902099609375, ...

embed

46756842_c0

46756842

prolog

0

Title: what's the difference between #= and =:= in SWI prolog Problem title: what's the difference between #= and =:= in SWI prolog Tags: operator-keyword, math, clpfd, prolog Problem: what's the difference between #= and =:= in SWI prolog What is the difference between #= and =:= in SWI prolog. I have found ...

what's the difference between #= and =:= in SWI prolog what's the difference between #= and =:= in SWI prolog operator-keyword math clpfd prolog SWI what's the difference between #= and =:= in SWI prolog What is the difference between #= and =:= in SWI prolog. I have found the definition from SWI prolog, but ...

[ 0.0208740234375, -0.004638671875, 0.0181884765625, 0.0030059814453125, 0.00238037109375, -0.00872802734375, -0.008544921875, 0.00384521484375, 0.01141357421875, 0.017578125, 0.016357421875, -0.00775146484375, 0.01287841796875, 0.026611328125, 0.01171875, -0.00872802734375, 0.00476074...

[ 2367, 3768, 70, 60212, 17721, 468, 1369, 136, 2203, 12, 23, 159, 38969, 502, 4867, 39933, 19770, 47416, 48909, 33139, 39557, 71, 80934, 55681, 2452, 3454, 29713, 669, 8962, 19714, 2816, 4288 ]

[ 0.016387939453125, 0.0799560546875, 0.050201416015625, 0.21533203125, 0.10302734375, 0.1239013671875, 0.2421875, 0.1141357421875, 0.220703125, 0.15966796875, 0.07421875, 0.08038330078125, 0.2119140625, 0.1435546875, 0.194091796875, 0.14404296875, 0.008087158203125, 0.02496337890625...

embed

2694453_c0

2694453

prolog

0

Title: Looking for a good semantic parser for the Russian language Problem title: Looking for a good semantic parser for the Russian language Tags: semantic-analysis, nlp, parse-tree, prolog Problem: Looking for a good semantic parser for the Russian language Does anyone know of a semantic parser for the Russian langua...

Looking for a good semantic parser for the Russian language Looking for a good semantic parser for the Russian language semantic-analysis nlp parse-tree prolog Looking Russian Looking for a good semantic parser for the Russian language Does anyone know of a semantic parser for the Russian language? I've attempted to co...

[ -0.01495361328125, 0.0257568359375, -0.00188446044921875, 0.0224609375, 0.0079345703125, 0.03271484375, -0.004608154296875, 0.002960205078125, -0.00799560546875, -0.046142578125, -0.01251220703125, -0.01806640625, 0.0098876953125, -0.005035400390625, 0.00543212890625, 0.000755310058593...

[ 157268, 10, 4127, 484, 109109, 366, 2189, 100, 102374, 46876, 174976, 26775, 184, 62600, 502, 4867, 3714, 81887, 222495, 3126, 2500, 107415, 25820, 156377, 5426, 11675, 4727, 139392, 400, 7008, 5062, 18811, 53201, 92537, 140992, 5885 ]

[ 0.1094970703125, 0.048675537109375, 0.06768798828125, 0.1627197265625, 0.1612548828125, 0.1826171875, 0.2071533203125, 0.0908203125, 0.26171875, 0.1676025390625, 0.0789794921875, 0.1375732421875, 0.0692138671875, 0.1160888671875, 0.0986328125, 0.16748046875, 0.0262298583984375, 0.0...

embed

13057428_c0

13057428

prolog

0

Title: Prolog: Failure driven loops Problem title: Prolog: Failure driven loops Tags: prolog-setof, logic-programming, prolog Problem: Prolog: Failure driven loops I used the following failure driven loop to list everything without using semicolons. happiness(fred,5). happiness(john,3). happiness(grace,2). someGoal(X) ...

Prolog: Failure driven loops Prolog: Failure driven loops prolog-setof logic-programming prolog Prolog Failure Prolog: Failure driven loops I used the following failure driven loop to list everything without using semicolons. In query mode, I get this as expected How can I insert these numbers into a list rather than w...

[ 0.037841796875, 0.004119873046875, -0.00156402587890625, -0.0001964569091796875, -0.0030517578125, 0.006072998046875, 0.0016021728515625, 0.0038299560546875, 0.0128173828125, -0.0252685546875, 0.00518798828125, -0.0128173828125, -0.0113525390625, -0.002410888671875, 0.0024566650390625, ...

[ 1250, 4867, 190355, 3408, 22648, 40956, 502, 3509, 4390, 62775, 28966, 11814, 25632, 137578, 19, 5303, 26818, 15490, 17368, 36137, 22796, 1779, 41, 1294, 13736, 2046, 84751, 831, 183540, 6097, 101935, 43257, 32562, 49119, 34831, 28032, 3060, ...

[ 0.132568359375, 0.20703125, 0.1512451171875, 0.13330078125, 0.099609375, 0.182373046875, 0.0789794921875, 0.0287017822265625, 0.0204620361328125, 0.067138671875, 0.0028076171875, 0.0537109375, 0.06591796875, 0.22998046875, 0.011810302734375, 0.180908203125, 0.1103515625, 0.12207031...

embed

53615645_c0

53615645

prolog

0

Title: How do I make the recursion in prolog? Problem title: How do I make the recursion in prolog? Tags: prolog Problem: How do I make the recursion in prolog? I'm creating a recursive function that returns me a list in Mem. Cycle everything perfectly and then with the backtracking prolog returns the empty list. Help....

How do I make the recursion in prolog? How do I make the recursion in prolog? prolog How Iniz Mem string_chars A1_1 Operation Lista nth0 How do I make the recursion in prolog? I'm creating a recursive function that returns me a list in Mem. Cycle everything perfectly and then with the backtracking prolog returns the em...

[ 0.011474609375, -0.0026397705078125, 0.005859375, 0.040283203125, -0.0135498046875, -0.0016326904296875, -0.0026702880859375, 0.003173828125, 0.029296875, -0.03271484375, -0.0091552734375, -0.0157470703125, -0.0198974609375, 0.03369140625, 0.009521484375, 0.0029449462890625, 0.002105...

[ 11249, 54, 87, 3249, 70, 195625, 1830, 23, 502, 4867, 360, 1418, 17443, 79315, 9254, 62, 115187, 102203, 50085, 927, 2389, 105233, 5844, 32354, 30646, 5303, 151612, 13, 26818, 169123, 4420, 125728, 214, 201505, 39527 ]

[ 0.0760498046875, 0.031005859375, 0.0268096923828125, 0.1229248046875, 0.0654296875, 0.2177734375, 0.173828125, 0.055572509765625, 0.163330078125, 0.250244140625, 0.038360595703125, 0.1103515625, 0.179931640625, 0.0889892578125, 0.1058349609375, 0.0113525390625, 0.0245361328125, 0.1...

embed

8191746_c0

8191746

prolog

0

Title: Deeper Explanation of Prolog Count Problem title: Deeper Explanation of Prolog Count Tags: prolog Problem: Deeper Explanation of Prolog Count Currently playing around in Prolog... I'm having trouble groking the count list rule. I haven't been able to find a good explanation anywhere. Can someone give me a break ...

Deeper Explanation of Prolog Count Deeper Explanation of Prolog Count prolog Deeper Explanation Prolog Count Head Tail TailCount Deeper Explanation of Prolog Count Currently playing around in Prolog... I'm having trouble groking the count list rule. I haven't been able to find a good explanation anywhere. Can someone g...

[ 0.02880859375, 0.0201416015625, -0.00372314453125, 0.01361083984375, 0.014404296875, 0.0074462890625, -0.0126953125, -0.016845703125, 0.03369140625, -0.01904296875, 0.000377655029296875, -0.04931640625, 0.00732421875, 0.03271484375, 0.0274658203125, -0.0135498046875, 0.0205078125, ...

[ 62723, 56, 5443, 5868, 1250, 4867, 108210, 2320, 502, 44816, 1218, 379, 75169, 63134, 11969, 6048, 54529, 5303, 79986, 4127, 187136, 7565, 442, 12638, 195625, 1830, 5844, 10422, 56112, 18 ]

[ 0.1024169921875, 0.071044921875, 0.01702880859375, 0.1456298828125, 0.1483154296875, 0.22705078125, 0.2012939453125, 0.0042724609375, 0.1051025390625, 0.1456298828125, 0.1131591796875, 0.0565185546875, 0.0288848876953125, 0.055755615234375, 0.060821533203125, 0.03460693359375, 0.2188...

embed

46505809_c0

46505809

prolog

0

Title: Why is Prolog not recognizing these built-ins? Problem title: Why is Prolog not recognizing these built-ins? Tags: prolog Problem: Why is Prolog not recognizing these built-ins? I'm having trouble using the round/1 and floor/1 built-ins in SWI-Prolog. When using them in my code, they aren't recognized and when s...

Why is Prolog not recognizing these built-ins? Why is Prolog not recognizing these built-ins? prolog Why Prolog Why is Prolog not recognizing these built-ins? I'm having trouble using the round/1 and floor/1 built-ins in SWI-Prolog. When using them in my code, they aren't recognized and when submitting them as a query;...

[ -0.01104736328125, 0.0081787109375, 0.00848388671875, 0.005615234375, -0.0177001953125, 0.02490234375, -0.006195068359375, 0.0072021484375, -0.0126953125, 0.00518798828125, -0.005767822265625, -0.0242919921875, -0.0234375, -0.0084228515625, 0.0223388671875, -0.00830078125, -0.0109863...

[ 44084, 83, 1250, 4867, 959, 75530, 19, 84382, 6097, 88303, 9, 5425, 502, 63134, 17368, 70, 68807, 11583, 136, 74912, 159, 38969, 10752, 18151, 18, 125296, 137447, 41, 705, 122336, 50491, 44691, 1118, 114686, 11389, 54825, 20600, 18499 ]

[ 0.092529296875, 0.03631591796875, 0.188720703125, 0.2470703125, 0.1090087890625, 0.102294921875, 0.0751953125, 0.05517578125, 0.080078125, 0.1929931640625, 0.07354736328125, 0.1944580078125, 0.12939453125, 0.066650390625, 0.0745849609375, 0.00531005859375, 0.1768798828125, 0.163085...

embed

47951732_c2

47951732

prolog

2

_Content-Head_Subtree_Indeterminate, Head_Subtree_Content-Concatenation_Indeterminate, Head_Subtree_Indeterminate, TailResult, MinTree, Others, CurrentMin, Candidate, ResultMinTree, ResultOthers, CurrentMin_Priority, Candidate_Priority, BeforeTree, AfterTree, Dummy-Dummy, MinData, MinPriority, MinTreeSubTree_Content-Mi...

[ 0.0281982421875, -0.00787353515625, -0.004974365234375, 0.00872802734375, 0.002838134765625, 0.01153564453125, -0.003173828125, -0.023681640625, 0.042724609375, 0.007720947265625, 0.009765625, 0.018310546875, 0.00439453125, 0.009033203125, 0.029541015625, -0.0145263671875, 0.02661132...

[ 101, 11935, 25352, 13025, 712, 454, 96472, 62600, 4153, 145099, 67, 4, 44816, 4460, 33, 2320, 1218, 379, 4332, 7, 7136, 4211, 62731, 13, 64511, 114063, 59076, 194215, 126684, 9319, 33163, 748, 117371, 24372, 27919, 1176, 316, 137989, 26824,...

[ 0.07183837890625, 0.1141357421875, 0.252197265625, 0.1455078125, 0.1500244140625, 0.0277099609375, 0.217041015625, 0.289794921875, 0.0579833984375, 0.2476806640625, 0.0865478515625, 0.03765869140625, 0.2254638671875, 0.1243896484375, 0.1048583984375, 0.006927490234375, 0.117309570312...

embed

57209902_c0

57209902

prolog

0

Title: Prolog : querying if something doesn't satisfy a predicate Problem title: Prolog : querying if something doesn't satisfy a predicate Tags: prolog, logic-programming Problem: Prolog : querying if something doesn't satisfy a predicate I'm sure this is a n00b question, but how do I ask for things which sa...

Prolog : querying if something doesn't satisfy a predicate Prolog : querying if something doesn't satisfy a predicate prolog logic-programming Prolog Prolog : querying if something doesn't satisfy a predicate I'm sure this is a n00b question, but how do I ask for things which satisfy one predicate and not ano...

[ 0.00604248046875, 0.00836181640625, 0.003570556640625, 0.0037841796875, -0.018310546875, 0.034423828125, 0.0074462890625, 0.00122833251953125, -0.006805419921875, -0.02001953125, -0.0034637451171875, -0.0162353515625, -0.0113525390625, -0.0037384033203125, 0.0028839111328125, 0.0096435...

[ 1250, 4867, 152, 41, 1294, 214, 2174, 9844, 22027, 3768, 18, 40407, 53, 1653, 2063, 67, 10, 502, 62775, 28966, 9077, 7049, 275, 9655, 1284, 3642, 54, 87, 26458, 100, 8966, 3129, 1632, 136, 959, 15700, 63399, 111, 3395, 6, 2980, 114382...

[ 0.197998046875, 0.281494140625, 0.037689208984375, 0.13134765625, 0.164794921875, 0.06646728515625, 0.137939453125, 0.1029052734375, 0.1572265625, 0.06298828125, 0.19677734375, 0.2034912109375, 0.1685791015625, 0.17138671875, 0.21728515625, 0.102294921875, 0.048797607421875, 0.1389...

embed

55820947_c0

55820947

prolog

0

Title: Apply OR constraint over the variables in a list Problem title: Apply OR constraint over the variables in a list Tags: eclipse-clp, prolog Problem: Apply OR constraint over the variables in a list Suppose we have a list of variables. We want to apply a constraint over the variables, but the relation of these con...

Apply OR constraint over the variables in a list Apply OR constraint over the variables in a list eclipse-clp prolog Apply Apply OR constraint over the variables in a list Suppose we have a list of variables. We want to apply a constraint over the variables, but the relation of these constraints are or . How we can do ...

[ 0.001129150390625, -0.0037689208984375, 0.00848388671875, 0.01202392578125, -0.0025787353515625, -0.014404296875, -0.0205078125, 0.0289306640625, 0.020751953125, -0.0186767578125, -0.00640869140625, -0.00537109375, 0.0111083984375, 0.021484375, 0.0038299560546875, 0.002685546875, 0.0...

[ 5659, 538, 33172, 158, 2816, 4288, 645, 77336, 7, 23, 5303, 28, 106371, 184, 26775, 502, 4867, 111, 3444, 59911, 10, 41911, 621, 707, 831, 54, 903, 234962, 313, 37352, 3454, 60322, 2174, 16610, 62, 83, 1542, 990, 567, 1927, 686, 289, ...

[ 0.135986328125, 0.09698486328125, 0.300048828125, 0.1363525390625, 0.2144775390625, 0.1837158203125, 0.161376953125, 0.2320556640625, 0.052154541015625, 0.03363037109375, 0.2154541015625, 0.000701904296875, 0.1611328125, 0.0931396484375, 0.132568359375, 0.1119384765625, 0.20385742187...

embed

65108225_c0

65108225

prolog

0

Title: Prolog checking if 2 lists have same number of elements Problem title: Prolog checking if 2 lists have same number of elements Tags: prolog Problem: Prolog checking if 2 lists have same number of elements I am trying to figure out how to do this little thing. I have 2 lists for example [1,1,2,3,4] and [2,1,4,3,1...

Prolog checking if 2 lists have same number of elements Prolog checking if 2 lists have same number of elements prolog Prolog Prolog checking if 2 lists have same number of elements I am trying to figure out how to do this little thing. I have 2 lists for example [1,1,2,3,4] and [2,1,4,3,1] , I need to confirm if all e...

[ 0.0128173828125, 0.017822265625, -0.007598876953125, -0.0016021728515625, -0.0096435546875, 0.0184326171875, -0.0108642578125, 0.00469970703125, 0.005035400390625, -0.015625, 0.01300048828125, -0.0224609375, 0.003570556640625, 0.01318359375, -0.01043701171875, -0.0079345703125, 0.019...

[ 1250, 4867, 175199, 2174, 116, 5303, 7, 765, 5701, 14012, 80854, 502, 26366, 10176, 13580, 133063, 82449, 163324, 363, 47, 39563, 756, 106, 99201, 23, 8337, 36917, 107730, 29568, 1884, 107, 98320, 12096, 32354 ]

[ 0.158203125, 0.229736328125, 0.1593017578125, 0.0859375, 0.177490234375, 0.21142578125, 0.07733154296875, 0.0667724609375, 0.15625, 0.1448974609375, 0.201904296875, 0.125732421875, 0.027557373046875, 0.034576416015625, 0.007568359375, 0.03936767578125, 0.13525390625, 0.051300048828...

embed

27367412_c0

27367412

prolog

0

Title: Returning a list: Prolog Problem title: Returning a list: Prolog Tags: list, prolog Problem: Returning a list: Prolog Im trying to create a predicate that returns a list of all females. So far I have: female(elisabeth). female(queenmother). female(diana). female(anne). female(beatrice). female(sarah). female(zar...

Returning a list: Prolog Returning a list: Prolog list prolog Returning Prolog the_royal_females Returning a list: Prolog Im trying to create a predicate that returns a list of all females. So far I have: But this returns each female individuly like How can i get it to return [elisabeth,queenmother,diana] instead?

[ 0.020751953125, -0.01251220703125, -0.0002384185791015625, 0.01495361328125, 0.005126953125, 0.0341796875, -0.003875732421875, 0.01348876953125, 0.0022430419921875, -0.040283203125, -0.00274658203125, -0.0036163330078125, -0.01312255859375, 0.021240234375, 0.01416015625, 0.02783203125,...

[ 173340, 214, 10, 5303, 12, 1250, 4867, 502, 70, 516, 16300, 98357, 21183, 3370, 31577, 28282, 1653, 2063, 67, 30646, 7, 111, 756, 117776, 2060, 4966, 903, 12638, 12146, 1884, 11249, 831, 2046, 442, 47, 28967, 11, 86077, 944, 33, 432, ...

[ 0.2003173828125, 0.0814208984375, 0.0283203125, 0.2169189453125, 0.0213470458984375, 0.158447265625, 0.21630859375, 0.1177978515625, 0.06982421875, 0.109619140625, 0.15478515625, 0.161376953125, 0.1517333984375, 0.0133056640625, 0.062255859375, 0.1026611328125, 0.1351318359375, 0.1...

embed

66130847_c1

66130847

prolog

1

convert([],[]). % use the map to convert any Item convert(Item-_,R) :- cmap(Item,R). %processing Questions convert(drs([], [question(drs(_Refs,Conds))]), Res) :- convert(Conds, Res). %DRS processing convert(drs(Refs,Conds),Res) :- skolem(Refs), convert(Conds,Res). % process list of items convert([H|T],[RH|RT]) :- conv...

[ -0.009033203125, 0.008544921875, 0.010986328125, 0.01239013671875, 0.00640869140625, 0.01556396484375, -0.01361083984375, 0.0032806396484375, 0.01495361328125, -0.00787353515625, 0.0145263671875, -0.00154876708984375, 0.007720947265625, 0.012451171875, -0.012939453125, -0.0010452270507...

[ 96760, 132, 1065, 268, 194, 1745, 4527, 70, 22288, 47, 2499, 78426, 568, 2982, 9, 454, 1052, 15772, 1827, 2631, 63923, 214, 68185, 7, 7569, 7162, 1363, 190015, 11935, 6468, 9624, 397, 15396, 9433, 4332, 18700, 39, 5303, 111, 55769, 841,...

[ 0.31005859375, 0.019012451171875, 0.04302978515625, 0.04180908203125, 0.041534423828125, 0.1141357421875, 0.130615234375, 0.055084228515625, 0.22314453125, 0.06817626953125, 0.092529296875, 0.220947265625, 0.034210205078125, 0.19189453125, 0.0286865234375, 0.0191802978515625, 0.08068...

embed

72542714_c0

72542714

prolog

0

Title: Check if List C is the difference of List A and List B Problem title: Check if List C is the difference of List A and List B Tags: list, prolog Problem: Check if List C is the difference of List A and List B I am trying to write a Prolog program which returns true if list C is list A without List B ( so using se...

Check if List C is the difference of List A and List B Check if List C is the difference of List A and List B list prolog Check List Check if List C is the difference of List A and List B I am trying to write a Prolog program which returns true if list C is list A without List B ( so using set operators: C = A \ B ) Al...

[ 0.0189208984375, 0.0203857421875, 0.031005859375, 0.031982421875, -0.0118408203125, 0.01025390625, -0.002288818359375, 0.01373291015625, 0.0125732421875, 0.02099609375, -0.00180816650390625, 0.0038604736328125, -0.0024261474609375, 0.0181884765625, 0.001495361328125, -0.00567626953125,...

[ 38679, 2174, 32036, 313, 83, 70, 60212, 111, 62, 136, 335, 5303, 502, 4867, 31577, 33022, 1250, 1528, 30646, 29568, 15490, 17368, 5423, 39933, 2203, 41872, 2967, 33342, 8781, 22553, 26366, 5024 ]

[ 0.156982421875, 0.10430908203125, 0.2083740234375, 0.234130859375, 0.1221923828125, 0.080810546875, 0.212890625, 0.058929443359375, 0.1368408203125, 0.1256103515625, 0.1839599609375, 0.1529541015625, 0.1029052734375, 0.1407470703125, 0.0290374755859375, 0.044219970703125, 0.084716796...

embed

36272417_c0

36272417

prolog

0

Title: Does the predicate `contracting/1` restore deleted inconsistent values? Problem title: Does the predicate `contracting/1` restore deleted inconsistent values? Tags: clpfd, dynamic, prolog Problem: Does the predicate `contracting/1` restore deleted inconsistent values? This question is subsequent to another one I...

Does the predicate `contracting/1` restore deleted inconsistent values? Does the predicate `contracting/1` restore deleted inconsistent values? clpfd dynamic prolog Does Does the predicate `contracting/1` restore deleted inconsistent values? This question is subsequent to another one I posted earlier on custom labeling...

[ 0.006500244140625, 0.0009307861328125, 0.002532958984375, 0.006439208984375, -0.0294189453125, 0.0235595703125, 0.004302978515625, 0.0113525390625, 0.01904296875, 0.00323486328125, 0.0054931640625, -0.0030670166015625, 0.01116943359375, 0.00099945068359375, 0.0419921875, 0.005096435546...

[ 101790, 1653, 2063, 67, 184103, 214, 11583, 14359, 107, 154109, 23, 25553, 6892, 142424, 71, 18, 39557, 84079, 502, 4867, 114122, 67967, 1250, 18264, 11814, 7103, 34292, 95486, 77336, 73, 1295, 77758, 28123, 2822, 4420, 125728 ]

[ 0.057373046875, 0.1407470703125, 0.1669921875, 0.06329345703125, 0.191650390625, 0.1474609375, 0.18212890625, 0.1763916015625, 0.1107177734375, 0.14892578125, 0.096923828125, 0.1484375, 0.1875, 0.161376953125, 0.039886474609375, 0.044677734375, 0.00958251953125, 0.1229248046875, ...

embed

61509075_c0

61509075

prolog

0

Title: Can use a head variable as a functor name in a body? Problem title: Can use a head variable as a functor name in a body? Tags: prolog Problem: Can use a head variable as a functor name in a body? Prolog lets us unify compound terms to variables: token(1,2,3). token(4,5,6). token_term(Term, X, Y, Z) :- Term=token...

Can use a head variable as a functor name in a body? Can use a head variable as a functor name in a body? prolog Can token_term Term Can use a head variable as a functor name in a body? Prolog lets us unify compound terms to variables: How can we make a more general version for any functor name: It seems the following ...

[ 0.039794921875, 0.00921630859375, 0.012451171875, -0.0054931640625, -0.004364013671875, -0.00787353515625, -0.00335693359375, 0.00927734375, 0.002197265625, -0.052734375, 0.013427734375, 0.0157470703125, 0.00162506103515625, -0.0038909912109375, 0.0174560546875, -0.027587890625, 0.00...

[ 4171, 4527, 10336, 77336, 237, 7477, 18770, 9351, 14361, 23, 502, 4867, 47, 1098, 32166, 2994, 10, 1250, 2633, 51, 40383, 217773, 69407, 4537, 11389, 25632, 959, 107003, 6002, 86531 ]

[ 0.061767578125, 0.11279296875, 0.22314453125, 0.271240234375, 0.0633544921875, 0.19287109375, 0.1981201171875, 0.1544189453125, 0.1697998046875, 0.0350341796875, 0.04388427734375, 0.2037353515625, 0.0875244140625, 0.1593017578125, 0.1505126953125, 0.1082763671875, 0.008514404296875, ...

embed

18561323_c0

18561323

prolog

0

Title: Prolog error: Predicate Protected Problem title: Prolog error: Predicate Protected Tags: win-prolog, prolog, predicate Problem: Prolog error: Predicate Protected I'm new to prolog and I'm trying to write a predicate that returns "Yes" if two train stations are on the same line. line(1,[a,b,c,d,e]); line(2,[b,g,f...

Prolog error: Predicate Protected Prolog error: Predicate Protected win-prolog prolog predicate Prolog Predicate Protected same_line Prolog error: Predicate Protected I'm new to prolog and I'm trying to write a predicate that returns "Yes" if two train stations are on the same line. Example: ?- same_line(n,j). Yes Howe...

[ -0.000949859619140625, 0.00213623046875, -0.0002803802490234375, -0.000431060791015625, -0.00823974609375, 0.01263427734375, 0.011962890625, 0.0078125, 0.017822265625, -0.060302734375, -0.0087890625, 0.025634765625, 0.0086669921875, -0.01202392578125, 0, 0.015625, -0.005859375, 0.0...

[ 1250, 4867, 18499, 7145, 2063, 67, 127942, 297, 19916, 3454, 502, 1653, 5701, 2256, 3525, 31577, 33022, 30646, 91480, 2174, 6626, 25550, 29398, 13315, 89536, 705, 19, 170, 32635, 108568, 47970, 47510, 9969, 49725, 212059, 12661, 20594, 44691 ...

[ 0.1839599609375, 0.230712890625, 0.1806640625, 0.2115478515625, 0.246826171875, 0.1446533203125, 0.241455078125, 0.1285400390625, 0.1239013671875, 0.1219482421875, 0.1334228515625, 0.1824951171875, 0.1392822265625, 0.1707763671875, 0.023651123046875, 0.032318115234375, 0.10986328125,...

embed

35857498_c0

35857498

prolog

0

Title: How to automate semicolon in Prolog Problem title: How to automate semicolon in Prolog Tags: syntax, prolog-toplevel, prolog Problem: How to automate semicolon in Prolog I am learning about Prolog in class and was shown a way to automatically press the semicolon key until there are no more solutions. I have trie...

How to automate semicolon in Prolog How to automate semicolon in Prolog syntax prolog-toplevel prolog How Prolog How to automate semicolon in Prolog I am learning about Prolog in class and was shown a way to automatically press the semicolon key until there are no more solutions. I have tried searching on Google but I ...

[ -0.003753662109375, 0.0272216796875, 0.01385498046875, 0.0361328125, -0.0238037109375, 0.0189208984375, -0.0009918212890625, -0.007537841796875, -0.005126953125, -0.033447265625, 0.0263671875, -0.006591796875, -0.0017547607421875, 0.0186767578125, 0.00665283203125, -0.0196533203125, ...

[ 11249, 11408, 13, 40, 46029, 4759, 23, 1250, 4867, 86531, 502, 13784, 67919, 18507, 191082, 24234, 22799, 24189, 110, 1286, 51347, 1815, 27781, 7413, 5584, 127887, 2819, 128019, 141377, 15490, 119140 ]

[ 0.021453857421875, 0.2249755859375, 0.061279296875, 0.121337890625, 0.1915283203125, 0.205810546875, 0.040740966796875, 0.1563720703125, 0.2374267578125, 0.054840087890625, 0.07867431640625, 0.008056640625, 0.06378173828125, 0.047515869140625, 0.16015625, 0.1328125, 0.15478515625, ...

embed

65343982_c0

65343982

prolog

0

Title: DCG reversing a string of binary bits Problem title: DCG reversing a string of binary bits Tags: prolog, dcg Problem: DCG reversing a string of binary bits I want to write a (Prolog) DCG which takes in strings of the form a2rev(a) where a is a string of binary bits, e.g. 1012101, 001121100, 0111002001110. My ide...

DCG reversing a string of binary bits DCG reversing a string of binary bits prolog dcg DCG a2rev DCG reversing a string of binary bits I want to write a (Prolog) DCG which takes in strings of the form a2rev(a) where a is a string of binary bits, e.g. 1012101, 001121100, 0111002001110. My idea was the following : This d...

[ 0.00811767578125, 0.01708984375, 0.00225830078125, 0.0267333984375, -0.0027008056640625, 0.032958984375, 0.0045166015625, -0.002288818359375, 0.0294189453125, -0.0108642578125, -0.0162353515625, 0.00531005859375, -0.005401611328125, 0.014404296875, 0.0146484375, 0.0111083984375, 0.01...

[ 391, 56367, 39531, 6953, 79315, 111, 2394, 6635, 4785, 502, 4867, 104, 238, 177, 10, 304, 65381, 3444, 33022, 10752, 51776, 23, 3173, 11, 7440, 83, 209, 1530, 35046, 34479, 129697, 3559, 136485, 38824, 36053, 6528, 25632, 3293, 22027, 18,...

[ 0.098388671875, 0.2252197265625, 0.231201171875, 0.0657958984375, 0.199462890625, 0.03350830078125, 0.1514892578125, 0.0963134765625, 0.1695556640625, 0.1026611328125, 0.1915283203125, 0.041961669921875, 0.0325927734375, 0.03582763671875, 0.115478515625, 0.0980224609375, 0.2301025390...

embed

43779483_c0

43779483

prolog

0

Title: Counting adjacent duplicates in scheme and prolog Problem title: Counting adjacent duplicates in scheme and prolog Tags: scheme, prolog Problem: Counting adjacent duplicates in scheme and prolog I am new to scheme and prolog and have done only a few basic problems. I need to write a function in scheme and prolog...

Counting adjacent duplicates in scheme and prolog Counting adjacent duplicates in scheme and prolog scheme prolog Counting Count Counting adjacent duplicates in scheme and prolog I am new to scheme and prolog and have done only a few basic problems. I need to write a function in scheme and prolog for counting adjacent ...

[ 0.0107421875, -0.0031585693359375, 0.0011138916015625, -0.004180908203125, -0.006988525390625, 0.0074462890625, -0.013671875, 0.00069427490234375, 0.01031494140625, -0.03466796875, -0.033203125, 0.0003490447998046875, -0.0017547607421875, 0.017578125, 0.02734375, -0.00087738037109375, ...

[ 1311, 128396, 123594, 16797, 171763, 1636, 23, 150370, 136, 502, 4867, 108210, 3525, 62822, 44402, 3871, 33022, 32354, 54529, 214, 456, 64240, 69098, 5303, 89536, 242, 41600, 106, 116, 138, 4879, 76199, 86827, 4958, 8439, 18151, 5368, 18244, ...

[ 0.136474609375, 0.148681640625, 0.171142578125, 0.2135009765625, 0.280029296875, 0.1593017578125, 0.0284423828125, 0.2049560546875, 0.0804443359375, 0.1341552734375, 0.1912841796875, 0.1788330078125, 0.02703857421875, 0.020050048828125, 0.04034423828125, 0.056396484375, 0.08410644531...

embed

73552532_c0

73552532

prolog

0

Title: Getting possible product combinations of number in a list Prolog Problem title: Getting possible product combinations of number in a list Prolog Tags: list, prolog, sudoku, clpfd Problem: Getting possible product combinations of number in a list Prolog I am using constraint logic programming and I want to output...

Getting possible product combinations of number in a list Prolog Getting possible product combinations of number in a list Prolog list prolog sudoku clpfd Getting Prolog Getting possible product combinations of number in a list Prolog I am using constraint logic programming and I want to output a list with the product ...

[ -0.02099609375, 0.0203857421875, -0.0087890625, 0.025634765625, -0.0233154296875, -0.0035400390625, -0.024169921875, 0.0047607421875, -0.005279541015625, -0.01556396484375, -0.015625, -0.0021514892578125, -0.00101470947265625, 0.01220703125, -0.00506591796875, 0.0108642578125, 0.0039...

[ 210732, 7722, 12996, 162515, 7, 111, 14012, 23, 5303, 1250, 4867, 502, 8932, 38067, 33139, 39557, 71, 17368, 158, 2816, 4288, 62775, 56037, 3444, 140992, 10, 678, 158928, 5117, 12830, 105950, 47, 2357, 305, 101, 2806, 201, 707, 116, 31577...

[ 0.10546875, 0.1988525390625, 0.25537109375, 0.23046875, 0.07244873046875, 0.0111083984375, 0.177734375, 0.049285888671875, 0.2174072265625, 0.1448974609375, 0.2406005859375, 0.09759521484375, 0.111083984375, 0.2069091796875, 0.004730224609375, 0.0538330078125, 0.04962158203125, 0.0...

embed

45612584_c0

45612584

prolog

0

Title: Tokenize math expression - error undefined procedure Problem title: Tokenize math expression - error undefined procedure Tags: prolog Problem: Tokenize math expression - error undefined procedure I am trying to tokenize math expression from user's input. I have written this code, but I don't understand, why the ...

Tokenize math expression - error undefined procedure Tokenize math expression - error undefined procedure prolog Tokenize input_infix Enter Input Chars ERROR Undefined _1236 notation.pl:4 Tokenize math expression - error undefined procedure I am trying to tokenize math expression from user's input. I have written this ...

[ 0.006561279296875, -0.004241943359375, -0.005462646484375, 0.0087890625, 0.00011396408081054688, 0.010986328125, 0.0003070831298828125, 0.0125732421875, -0.0084228515625, -0.036376953125, 0.007415771484375, 0.01300048828125, -0.01116943359375, -0.006195068359375, 0.01214599609375, -0.0...

[ 717, 1098, 20650, 48909, 125195, 18499, 9232, 5983, 50491, 502, 4867, 107730, 73, 55923, 60816, 360, 7077, 21656, 151206, 24638, 79912, 1530, 8659, 110, 22062, 2424, 617, 297, 31577, 47, 1295, 38937, 59121, 18151, 28219, 15400, 1653, 2063, ...

[ 0.143798828125, 0.219970703125, 0.213623046875, 0.1541748046875, 0.219970703125, 0.1839599609375, 0.093505859375, 0.1690673828125, 0.1942138671875, 0.0889892578125, 0.1163330078125, 0.160400390625, 0.0261993408203125, 0.18505859375, 0.1173095703125, 0.02001953125, 0.0936279296875, ...

embed

8779114_c0

8779114

prolog

0

Title: arithmetic computer Problem title: arithmetic computer Tags: prolog, dcg Problem: arithmetic computer I need some help in prolog, which is pretty new to me. I have to design a small arithmetic computer. The expression to be evaluated will be represented as a list for example: ?-evaluate([2,+,4,*,5,+,1,*,2,*,3],R...

arithmetic computer arithmetic computer prolog dcg arithmetic computer I need some help in prolog, which is pretty new to me. I have to design a small arithmetic computer. The expression to be evaluated will be represented as a list for example: I am trying to do this by designing two predicates one called parse to tra...

[ -0.006439208984375, 0.00396728515625, -0.00107574462890625, 0.0289306640625, 0.0037689208984375, 0.025146484375, -0.004180908203125, -0.0033721923828125, 0.0107421875, -0.0306396484375, -0.01904296875, -0.0002689361572265625, 0.0033416748046875, -0.01165771484375, -0.00897216796875, -0...

[ 187, 8962, 282, 9523, 13909, 502, 4867, 104, 238, 177, 87, 3871, 3060, 4358, 23, 28875, 3525, 163, 4331, 19336, 125195, 47, 151575, 297, 1221, 33636, 237, 5303, 27781, 31577, 6626, 1653, 2063, 35839, 366, 184, 27198, 70, 44402, 2831, 18...

[ 0.04345703125, 0.1448974609375, 0.1292724609375, 0.123291015625, 0.1812744140625, 0.172119140625, 0.239990234375, 0.02276611328125, 0.025634765625, 0.1165771484375, 0.008148193359375, 0.0877685546875, 0.000152587890625, 0.134033203125, 0.04693603515625, 0.012939453125, 0.059295654296...

embed

22857912_c0

22857912

prolog

0

Title: prolog predicates - swap Problem title: prolog predicates - swap Tags: prolog Problem: prolog predicates - swap I have an exam in Prolog today and am revising for it using old questions. Would answer c be the incorrect answer? Can anyone please explain this to me? It would be very helpful. Thank you, Consider th...

prolog predicates - swap prolog predicates - swap prolog prolog predicates - swap I have an exam in Prolog today and am revising for it using old questions. Would answer c be the incorrect answer? Can anyone please explain this to me? It would be very helpful. Thank you, Consider the following predicate: Which of the f...

[ 0.00122833251953125, 0.0140380859375, 0.0033111572265625, -0.013427734375, -0.0257568359375, 0.004638671875, -0.01904296875, -0.00592041015625, -0.01226806640625, 0.0260009765625, 0.00811767578125, 0.0184326171875, -0.0140380859375, 0.0037841796875, 0.00543212890625, 0.01361083984375, ...

[ 502, 4867, 1653, 2063, 1636, 202317, 42276, 1250, 18925, 15226, 17368, 10332, 17582, 35166, 501, 214552, 73342, 137399, 67, 25632, 41, 1294, 136, 80836, 83 ]

[ 0.1837158203125, 0.244140625, 0.20166015625, 0.2440185546875, 0.150146484375, 0.252685546875, 0.1009521484375, 0.1517333984375, 0.01220703125, 0.0479736328125, 0.007537841796875, 0.06768798828125, 0.1180419921875, 0.1348876953125, 0.086181640625, 0.19873046875, 0.029052734375, 0.00...

embed

1544826_c0

1544826

prolog

0

Title: Prolog Problem with "is" function Problem title: Prolog Problem with "is" function Tags: prolog Problem: Prolog Problem with "is" function I am having a problem with prolog that I do not understand. I have used the tracer to follow the problem, and this is what happens .... (8) 8 NEXT value(d...

Prolog Problem with "is" function Prolog Problem with "is" function prolog Prolog Problem NEXT Orly EXIT CALL error_handler sepia_kernel Prolog Problem with "is" function I am having a problem with prolog that I do not understand. I have used the tracer to follow the problem, and this is what happen...

[ 0.00457763671875, -0.00122833251953125, -0.0057373046875, -0.01904296875, -0.018310546875, 0.01043701171875, -0.01031494140625, -0.0306396484375, 0.00634765625, -0.034423828125, 0.01513671875, 0.0145263671875, -0.00909423828125, -0.006866455078125, 0.0181884765625, -0.00012302398681640...

[ 1250, 4867, 15649, 678, 164, 32354, 502, 9960, 70981, 3347, 538, 29426, 6371, 313, 66437, 18499, 74258, 40, 12455, 72083, 2967, 28219, 1152, 3443, 28960, 96276, 44691, 11782, 683, 83, 27226 ]

[ 0.1568603515625, 0.269775390625, 0.130859375, 0.0535888671875, 0.215576171875, 0.1943359375, 0.1116943359375, 0.03704833984375, 0.092041015625, 0.1319580078125, 0.1741943359375, 0.1112060546875, 0.08795166015625, 0.047332763671875, 0.1324462890625, 0.110107421875, 0.1517333984375, ...

embed

72169915_c0

72169915

prolog

0

Title: How does the '!' (cut) operator exactly work in Prolog? Problem title: How does the '!' (cut) operator exactly work in Prolog? Tags: prolog-cut, prolog Problem: How does the '!' (cut) operator exactly work in Prolog? I'm learning Prolog and I'm having some difficulties to understand how this ...

How does the '!' (cut) operator exactly work in Prolog? How does the '!' (cut) operator exactly work in Prolog? prolog-cut prolog How Prolog How does the '!' (cut) operator exactly work in Prolog? I'm learning Prolog and I'm having some difficulties to understand how this particular operator works. ...

[ 0.0439453125, 0.0191650390625, 0.033203125, 0.0098876953125, 0.00433349609375, 0.0189208984375, -0.002349853515625, -0.0032501220703125, 0.009033203125, -0.006927490234375, -0.0067138671875, -0.0130615234375, -0.00738525390625, -0.003662109375, 0.01141357421875, 0.00323486328125, -0....

[ 11249, 14602, 70, 54764, 3768, 74, 38, 19774, 16, 39933, 66161, 4488, 23, 1250, 4867, 502, 25, 15, 52080, 19441, 34844, 3387, 47, 28219, 3642, 903, 17311, 43240, 30745, 442, 7, 11814, 7279, 4420, 125728, 214, 20271, 195625, 54613, 53, 4...

[ 0.135498046875, 0.124755859375, 0.09222412109375, 0.01031494140625, 0.169677734375, 0.0299072265625, 0.22021484375, 0.267578125, 0.10205078125, 0.265869140625, 0.175537109375, 0.1873779296875, 0.1085205078125, 0.2135009765625, 0.296875, 0.1400146484375, 0.0236358642578125, 0.021697...

embed

42490764_c0

42490764

prolog

0

Title: how to generate all combinations of 2 lists in prolog Problem title: how to generate all combinations of 2 lists in prolog Tags: prolog Problem: how to generate all combinations of 2 lists in prolog I need to generate combinations of 2 lists which have 4 elements each. For example, list([1,2,3,4],[x,y,w,z],L). s...

how to generate all combinations of 2 lists in prolog how to generate all combinations of 2 lists in prolog prolog how to generate all combinations of 2 lists in prolog I need to generate combinations of 2 lists which have 4 elements each. For example, list([1,2,3,4],[x,y,w,z],L). should return L = [(1,x),(1,y),(1,w),(...

[ -0.0072021484375, 0.027587890625, -0.000331878662109375, 0.00933837890625, -0.00799560546875, 0.028076171875, -0.0247802734375, 0.0069580078125, 0.001312255859375, -0.037841796875, 0.00787353515625, -0.005279541015625, 0.022705078125, 0.0135498046875, -0.0032501220703125, 0.00078201293...

[ 3642, 47, 139392, 756, 162515, 7, 111, 116, 5303, 23, 502, 4867, 3871, 201, 80854, 12638, 133063, 82449, 53, 434, 169, 866, 5608, 30646, 339, 2203, 425, 35166, 18151, 28412, 959, 26785, 30022 ]

[ 0.059326171875, 0.03216552734375, 0.2244873046875, 0.1510009765625, 0.2445068359375, 0.122314453125, 0.07476806640625, 0.1641845703125, 0.2332763671875, 0.053253173828125, 0.1590576171875, 0.2171630859375, 0.017303466796875, 0.130859375, 0.131103515625, 0.00213623046875, 0.0446166992...

embed

52955498_c0

52955498

prolog

0

Title: encoding given input using prolog Problem title: encoding given input using prolog Tags: prolog Problem: encoding given input using prolog count([_],[],1). count(H,[H1|T],N):- count(H1,T,N1),(H = H1 -> N is N1+1 ; H \=H1 -> N is 1). encode([]). encode([H|T]):- count(H,T,N1),encode(T),write("["),write(N1),write("...

encoding given input using prolog encoding given input using prolog prolog prolog Encoded Output encoding given input using prolog Above is my Prolog code to count and print the consecutive occurrence of the letters and giving the out put in desired manner. For example if Sample Input: should return

[ 0.0294189453125, 0.000942230224609375, -0.0167236328125, 0.02001953125, -0.006011962890625, 0.007354736328125, -0.00970458984375, 0.03173828125, -0.00738525390625, -0.023681640625, -0.006500244140625, -0.031494140625, 0.0022735595703125, 0.0255126953125, 0.00124359130859375, -0.0049133...

[ 22, 587, 6238, 34475, 107730, 17368, 502, 4867, 357, 40899, 71, 13538, 7077, 92437, 759, 1250, 18151, 54529, 28412, 148390, 74918, 42, 6620, 120820, 68772, 1810, 3884, 104851, 144996, 2174, 947, 33209, 360, 5608, 30646 ]

[ 0.07757568359375, 0.186279296875, 0.10882568359375, 0.1468505859375, 0.194091796875, 0.06744384765625, 0.1563720703125, 0.2099609375, 0.044891357421875, 0.2056884765625, 0.024993896484375, 0.13330078125, 0.11907958984375, 0.03131103515625, 0.004825592041015625, 0.1395263671875, 0.131...

embed

4261014_c0

4261014

prolog

0

Title: predicate with Prolog Problem title: predicate with Prolog Tags: prolog Problem: predicate with Prolog I have to write a program which has a predicate p(A,B,C,D,E,F) . A,B,C,D,E,F are lists. A contains D, E and F. (Something like A and B is D, A and C is E) F contains A without D and E. And also elements in list...

predicate with Prolog predicate with Prolog prolog Prolog predicate with Prolog I have to write a program which has a predicate p(A,B,C,D,E,F) . A,B,C,D,E,F are lists. A contains D, E and F. (Something like A and B is D, A and C is E) F contains A without D and E. And also elements in list F are in pairs (example if A ...

[ 0.0235595703125, 0.0103759765625, -0.0004673004150390625, 0.0017242431640625, -0.0174560546875, 0.0322265625, -0.01409912109375, -0.00994873046875, 0.00011014938354492188, -0.0145263671875, 0.016357421875, -0.01336669921875, -0.00714111328125, -0.01165771484375, 0.0023956298828125, 0.0...

[ 1653, 2063, 67, 678, 1250, 4867, 502, 87, 765, 47, 33022, 1528, 1556, 915, 284, 571, 441, 397, 647, 919, 62, 621, 5303, 70541, 391, 241, 136, 563, 1884, 335, 313, 15490, 80854, 80836, 11, 4034, 57143, 2046, 442, 27781 ]

[ 0.21435546875, 0.2490234375, 0.137939453125, 0.1181640625, 0.18896484375, 0.251220703125, 0.1375732421875, 0.016845703125, 0.03558349609375, 0.0233612060546875, 0.151123046875, 0.197998046875, 0.0206146240234375, 0.1136474609375, 0.021392822265625, 0.02545166015625, 0.026077270507812...

embed

2659713_c0

2659713

prolog

0

Title: Can you do Logic Programming in Scala? Problem title: Can you do Logic Programming in Scala? Tags: prolog, scala, programming-languages, logic-programming, language-features Problem: Can you do Logic Programming in Scala? I read somewhere that Pattern Matching like that supported by the match/case feature in Sca...

Can you do Logic Programming in Scala? Can you do Logic Programming in Scala? prolog scala programming-languages logic-programming language-features Can Logic Programming Scala Can you do Logic Programming in Scala? I read somewhere that Pattern Matching like that supported by the match/case feature in Scala was actual...

[ 0.0113525390625, 0.0260009765625, 0.009765625, 0.013671875, -0.007415771484375, -0.00830078125, -0.025146484375, 0.006072998046875, -0.0069580078125, -0.049560546875, 0.007598876953125, -0.01434326171875, -0.0079345703125, -0.010009765625, 0.0247802734375, -0.0003452301025390625, 0.0...

[ 4171, 398, 54, 50592, 238, 27958, 214, 23, 152653, 11, 502, 4867, 146232, 56037, 449, 196651, 62775, 28966, 46876, 88981, 12301, 9876, 22766, 67407, 1884, 8060, 14858, 58437, 60213, 20653, 3017, 15555, 1250, 4527, 27650, 86869, 44402, 62448, ...

[ 0.1243896484375, 0.09539794921875, 0.1259765625, 0.251220703125, 0.147216796875, 0.225830078125, 0.1287841796875, 0.1103515625, 0.2484130859375, 0.1949462890625, 0.06451416015625, 0.2227783203125, 0.2271728515625, 0.1407470703125, 0.04632568359375, 0.1138916015625, 0.207275390625, ...

embed

37232679_c1

37232679

prolog

1

? I have a set of garbage cans (which have a name, type, location, capacity). The idea is that given a zone (that has several locations) I could get the sum of all the capacities over 90 from the garbage cans in that area. So ecoZona would grab the zone and "send it" to listaEcos, this one would split the list of garba...

[ 0.01202392578125, 0.0076904296875, -0.00738525390625, 0.027099609375, -0.005096435546875, 0.0186767578125, -0.0263671875, 0.024169921875, 0.017333984375, -0.00958251953125, 0.01513671875, -0.005950927734375, 0.00421142578125, -0.015380859375, 0.0020599365234375, -0.00262451171875, 0....

[ 705, 87, 765, 5423, 111, 3671, 402, 429, 831, 7, 9351, 10644, 31913, 177399, 6528, 83, 34475, 20288, 40368, 5809, 2046, 10554, 756, 139049, 31075, 645, 2510, 16128, 49347, 1511, 2477, 2806, 59102, 39285, 5875, 132570, 65450, 5303, 183871, ...

[ 0.0841064453125, 0.02398681640625, 0.04669189453125, 0.0833740234375, 0.00860595703125, 0.0968017578125, 0.1805419921875, 0.1180419921875, 0.1968994140625, 0.110107421875, 0.044097900390625, 0.111083984375, 0.1702880859375, 0.19775390625, 0.143310546875, 0.028717041015625, 0.03053283...

embed

49066838_c0

49066838

prolog

0

Title: Depth First Search, my code cant find the path Problem title: Depth First Search, my code cant find the path Tags: depth-first-search, prolog Problem: Depth First Search, my code cant find the path I tried this code for depth first search in Prolog, but it is not complete. It did not show the path. This is my tr...

Depth First Search, my code cant find the path Depth First Search, my code cant find the path depth-first-search prolog Depth First Search Depth First Search, my code cant find the path I tried this code for depth first search in Prolog, but it is not complete. It did not show the path. This is my tree and Roles for de...

[ 0.033935546875, 0.013916015625, 0.0181884765625, 0.023681640625, 0.01214599609375, 0.01031494140625, -0.01373291015625, 0.00396728515625, -0.0145263671875, -0.030029296875, 0.006439208984375, -0.022216796875, -0.01007080078125, 0.0255126953125, 0.0145263671875, 0.0033111572265625, 0....

[ 262, 254, 927, 23972, 33086, 759, 18151, 45767, 7413, 70, 60875, 168867, 13448, 271, 86250, 502, 4867, 37842, 903, 5117, 33938, 1250, 1284, 83, 959, 28484, 7639, 3293, 53201, 136, 2777, 1577 ]

[ 0.139404296875, 0.2017822265625, 0.1331787109375, 0.18603515625, 0.22607421875, 0.0380859375, 0.1851806640625, 0.1351318359375, 0.162353515625, 0.0323486328125, 0.2230224609375, 0.2489013671875, 0.1260986328125, 0.08990478515625, 0.1748046875, 0.1192626953125, 0.2086181640625, 0.06...

embed

21263067_c0

21263067

prolog

0

Title: PROLOG how to "connect" similar objects Problem title: PROLOG how to "connect" similar objects Tags: transitive-closure, prolog Problem: PROLOG how to "connect" similar objects Hey im new to prolog and was wondering: Let's say i have this code: component(a,b). component(a,c). component(a,d). ...

PROLOG how to "connect" similar objects PROLOG how to "connect" similar objects transitive-closure prolog PROLOG PROLOG how to "connect" similar objects Hey im new to prolog and was wondering: Let's say i have this code: and i want to create an argument consistsof(X,Y):- component(X,Y); component(Y,...

[ 0.01104736328125, 0.007049560546875, 0.0172119140625, 0.0185546875, -0.01446533203125, 0.02587890625, -0.043212890625, 0.004730224609375, 0.0052490234375, -0.040283203125, 0.002532958984375, -0.0283203125, -0.007598876953125, 0.006439208984375, -0.0089111328125, -0.02099609375, -0.01...

[ 10514, 47510, 3642, 47, 135457, 21373, 36746, 62621, 5844, 170224, 502, 4867, 58, 7, 28240, 566, 3525, 149016, 18151, 3444, 28282, 10750, 58055, 54304, 1542, 1723, 82761, 1511, 76199, 163, 990, 1369, 876, 238, 420, 2046, 16750, 11, 1001, ...

[ 0.163330078125, 0.242919921875, 0.05780029296875, 0.03704833984375, 0.2347412109375, 0.2293701171875, 0.21533203125, 0.1221923828125, 0.080322265625, 0.173583984375, 0.12890625, 0.2088623046875, 0.006561279296875, 0.044921875, 0.00274658203125, 0.002899169921875, 0.0175323486328125, ...

embed

43111832_c1

43111832

prolog

1

help is greatly appreciated. EDITED The intention of this exercise is to write rules such that you can complete this family tree, though only minimal facts are given. As you can see, it only states that Warren is the father of Jerry, and from brother and sister facts, we know Jerry is the brother of Stuart and Kather....

[ 0.01708984375, 0.015869140625, -0.010009765625, 0.01190185546875, -0.0341796875, -0.002716064453125, -0.001922607421875, 0.0036468505859375, 0.024658203125, -0.048583984375, 0.006622314453125, -0.01312255859375, 0.00110626220703125, 0.03173828125, 0.016357421875, -0.00677490234375, 0...

[ 4358, 77947, 172864, 91177, 81979, 33022, 91736, 6044, 831, 28484, 903, 14449, 53201, 21208, 4734, 20187, 15824, 34475, 1957, 117249, 171458, 83, 70, 67373, 111, 138171, 1295, 82953, 136, 114015, 211524, 1136, 9319, 79986, 49129, 4390, 1542, ...

[ 0.084716796875, 0.02874755859375, 0.026214599609375, 0.10498046875, 0.11962890625, 0.160400390625, 0.1636962890625, 0.02740478515625, 0.00152587890625, 0.1201171875, 0.031158447265625, 0.1363525390625, 0.2183837890625, 0.007598876953125, 0.03082275390625, 0.12060546875, 0.1181640625,...

embed

19623302_c0

19623302

prolog

0

Title: Why am I getting a type error on pi in Prolog? Problem title: Why am I getting a type error on pi in Prolog? Tags: iso-prolog, prolog, pi Problem: Why am I getting a type error on pi in Prolog? I am using pi as part of a Prolog program I am writing. Here is my only mention of pi in the whole program: ArcDistance...

Why am I getting a type error on pi in Prolog? Why am I getting a type error on pi in Prolog? iso-prolog prolog pi Why Prolog ArcDistance Degree Diameter type_error Why am I getting a type error on pi in Prolog? I am using pi as part of a Prolog program I am writing. Here is my only mention of pi in the whole program: ...

[ -0.004669189453125, -0.0023651123046875, 0.0079345703125, -0.01031494140625, -0.008544921875, -0.013916015625, -0.00006008148193359375, -0.00927734375, -0.01153564453125, -0.053466796875, -0.009033203125, -0.01214599609375, -0.01544189453125, -0.006927490234375, 0.017333984375, 0.01208...

[ 44084, 444, 87, 20949, 10644, 18499, 98, 2147, 23, 1250, 4867, 10, 13882, 3454, 502, 51210, 14055, 116071, 262, 7134, 4512, 29089, 188800, 17368, 2831, 1528, 32562, 4734, 41392, 28271, 11675, 2046, 25632, 2022, 44691, 159029, 223, 4358 ]

[ 0.0947265625, 0.0221099853515625, 0.004241943359375, 0.044921875, 0.2257080078125, 0.208984375, 0.06622314453125, 0.2425537109375, 0.04022216796875, 0.14453125, 0.2315673828125, 0.003753662109375, 0.06451416015625, 0.103515625, 0.10418701171875, 0.090087890625, 0.09423828125, 0.089...

embed

66561076_c0

66561076

prolog

0

Title: list processing in Prolog Problem title: list processing in Prolog Tags: prolog Problem: list processing in Prolog I am new to prolog and I'm having trouble with this problem. I am taking a sentence as input and put [Anne,do,you,know] in front of the sentence and replace any occurrence of you to I. For example c...

list processing in Prolog list processing in Prolog prolog Prolog Head Tail TailX Anne list processing in Prolog I am new to prolog and I'm having trouble with this problem. I am taking a sentence as input and put [Anne,do,you,know] in front of the sentence and replace any occurrence of you to I. For example copycat([y...

[ -0.0019989013671875, 0.007354736328125, 0.015380859375, 0.036376953125, 0.00171661376953125, 0.0029754638671875, 0.00811767578125, 0.005218505859375, 0.009765625, -0.01470947265625, 0.0225830078125, -0.0206298828125, -0.0196533203125, 0.015625, 0.0130615234375, -0.0042724609375, 0.01...

[ 5303, 9433, 1250, 4867, 214, 23, 502, 44816, 1218, 379, 1542, 14245, 3525, 63134, 2967, 35971, 149357, 237, 107730, 3884, 7251, 86, 246, 53927, 69723, 12912, 91995, 2499, 74918, 111, 398, 47, 87, 1326, 43658, 4460, 25003, 282, 1193, 16, ...

[ 0.2286376953125, 0.1474609375, 0.17041015625, 0.249755859375, 0.04364013671875, 0.004302978515625, 0.1304931640625, 0.08880615234375, 0.0994873046875, 0.0933837890625, 0.1292724609375, 0.246826171875, 0.021484375, 0.07513427734375, 0.05987548828125, 0.04693603515625, 0.1727294921875,...

embed

17349357_c0

17349357

prolog

0

Title: prolog, how to correctly use escape sequences Problem title: prolog, how to correctly use escape sequences Tags: yap, prolog Problem: prolog, how to correctly use escape sequences I need (for design choices) to obtain a list who respects the following pattern: Uses = ['foo\/1', 'foobar\/2']. I'm able to build up...

prolog, how to correctly use escape sequences prolog, how to correctly use escape sequences yap prolog Uses Module prolog, how to correctly use escape sequences I need (for design choices) to obtain a list who respects the following pattern: I'm able to build up the name/number pattern doing: where rule is an internal ...

[ 0.02490234375, 0.007293701171875, 0.004119873046875, 0.01275634765625, -0.039306640625, 0.0269775390625, 0.005218505859375, 0.0198974609375, 0.0159912109375, -0.0341796875, 0.01165771484375, -0.0216064453125, -0.000881195068359375, 0.0164794921875, 0.000873565673828125, 0.0032958984375...

[ 502, 4867, 3642, 47, 26785, 538, 4527, 144281, 40, 26513, 5170, 15850, 36836, 63014, 3871, 4331, 44126, 113054, 5303, 15072, 25632, 103510, 19048, 45367, 1257, 9351, 2606, 1297, 79986, 70796, 15824, 345, 425, 14865, 114942, 72546, 17368, 64, ...

[ 0.163330078125, 0.2347412109375, 0.059783935546875, 0.014312744140625, 0.1220703125, 0.03363037109375, 0.1533203125, 0.23876953125, 0.099365234375, 0.1925048828125, 0.1064453125, 0.151611328125, 0.0450439453125, 0.09649658203125, 0.04498291015625, 0.0872802734375, 0.0247344970703125,...

embed

1801998_c0

1801998

prolog

0

Title: Parsing with DCGs in Scheme (without Prolog)? Problem title: Parsing with DCGs in Scheme (without Prolog)? Tags: dcg, scheme, parsing, prolog Problem: Parsing with DCGs in Scheme (without Prolog)? Lots of Prolog-in-Scheme implementations are out there. E.g. Kanren, Schelog. Apparently in "Paradigms of AI Program...

Parsing with DCGs in Scheme (without Prolog)? Parsing with DCGs in Scheme (without Prolog)? dcg scheme parsing prolog Parsing DCGs Scheme Prolog Parsing with DCGs in Scheme (without Prolog)? Lots of Prolog-in-Scheme implementations are out there. E.g. Kanren, Schelog. Apparently in "Paradigms of AI Programming" Norvig ...

[ 0.01470947265625, 0.00677490234375, 0.00299072265625, 0.0238037109375, 0.0035858154296875, 0.01806640625, -0.011962890625, -0.0159912109375, -0.004608154296875, -0.03515625, -0.0035858154296875, -0.005401611328125, -0.02197265625, -0.00799560546875, 0.00531005859375, 0.000579833984375,...

[ 2392, 6953, 678, 391, 56367, 7, 23, 34702, 282, 6056, 1250, 4867, 104, 238, 177, 150370, 366, 502, 73, 25452, 12549, 208124, 2685, 2734, 982, 4803, 38730, 27958, 12876, 24299, 29479, 188, 9506, 7008, 9969, 34759, 1261, 88606, 100700, 4807...

[ 0.1636962890625, 0.10052490234375, 0.08355712890625, 0.09375, 0.244140625, 0.0692138671875, 0.038177490234375, 0.1712646484375, 0.1361083984375, 0.081787109375, 0.153076171875, 0.2469482421875, 0.037567138671875, 0.0302734375, 0.121337890625, 0.1871337890625, 0.159912109375, 0.1077...

embed

47477933_c0

47477933

prolog

0

Title: output list element with more occurs in Prolog Problem title: output list element with more occurs in Prolog Tags: prolog Problem: output list element with more occurs in Prolog I would like to write a query which gives has output the element of a list which occurs more. I don't want to use the assert predicate....

output list element with more occurs in Prolog output list element with more occurs in Prolog prolog Prolog find_element output list element with more occurs in Prolog I would like to write a query which gives has output the element of a list which occurs more. I don't want to use the assert predicate. I write down thi...

[ 0.0198974609375, -0.00013446807861328125, -0.00052642822265625, 0.00811767578125, -0.0009765625, -0.005859375, -0.00128936767578125, -0.0098876953125, 0.0166015625, -0.055419921875, 0.0009613037109375, -0.0247802734375, 0.0185546875, 0.01007080078125, 0.00885009765625, -0.01123046875, ...

[ 140992, 5303, 12830, 678, 1286, 74918, 23, 1250, 4867, 502, 7413, 62766, 7, 1884, 33022, 41, 1294, 76199, 1556, 3444, 237, 33657, 1653, 2063, 67, 7565, 11343, 5117, 111, 27781 ]

[ 0.249755859375, 0.1844482421875, 0.1654052734375, 0.052642822265625, 0.2054443359375, 0.181396484375, 0.04937744140625, 0.1500244140625, 0.2364501953125, 0.1082763671875, 0.1041259765625, 0.1805419921875, 0.0239105224609375, 0.0228271484375, 0.045379638671875, 0.1015625, 0.1036987304...

embed

52802222_c1

52802222

prolog

1

4 2 Call: generate_perm([[1,2]],[3,1]) ? # 5 3 Call: member(_138349,[1,2]) ? ?# 5 3 Exit: member(1,[1,2]) ? # 6 3 Call: generate_perm([],[3,1,1]) ? # 6 3 Exit: generate_perm([],[3,1,1]) ? ?# 4 2 Exit: generate_perm([[1,2]],[3,1]) ? ?# 2 1 Exit: generate_perm([[1,2,3,4],[1,2]],[3]) ? P = [] ? So the answer is there (Cal...

[ -0.0157470703125, 0.0302734375, 0.01116943359375, 0.006622314453125, -0.01141357421875, 0.01806640625, -0.034912109375, -0.01483154296875, 0.0137939453125, -0.02734375, -0.006103515625, 0.01239013671875, 0.01611328125, 0.0302734375, -0.01806640625, -0.01348876953125, -0.01171875, -...

[ 201, 116, 26265, 12, 139392, 1264, 39, 133063, 4, 363, 76172, 190, 138, 32786, 141535, 117760, 5443, 217, 305, 106, 82449, 54968, 436, 2203, 35166, 2685, 441, 5584, 132, 418, 3688, 122101, 1284, 76199, 163, 201505, 5303, 831, 18, 26366, ...

[ 0.143798828125, 0.1466064453125, 0.211669921875, 0.0435791015625, 0.2646484375, 0.2308349609375, 0.2164306640625, 0.140380859375, 0.000579833984375, 0.0908203125, 0.06732177734375, 0.07049560546875, 0.10235595703125, 0.1871337890625, 0.1236572265625, 0.2327880859375, 0.1014404296875,...

embed

65678387_c0

65678387

prolog

0

Title: Convert complex term to List of lists and then back to term with modified functor Problem title: Convert complex term to List of lists and then back to term with modified functor Tags: functor, prolog, list Problem: Convert complex term to List of lists and then back to term with modified functor you can use =.....

Convert complex term to List of lists and then back to term with modified functor Convert complex term to List of lists and then back to term with modified functor functor prolog list Convert List Convert complex term to List of lists and then back to term with modified functor you can use =.. to convert simple terms. ...

[ 0.03466796875, 0.01458740234375, 0.00159454345703125, 0.00775146484375, -0.003143310546875, 0.000713348388671875, 0.005950927734375, -0.00003695487976074219, -0.003875732421875, -0.0115966796875, 0.005889892578125, -0.000743865966796875, -0.005157470703125, 0.02734375, 0.007080078125, ...

[ 1657, 11549, 27140, 13579, 47, 32036, 111, 5303, 7, 4420, 678, 73197, 297, 7477, 18770, 502, 4867, 831, 4527, 2203, 96760, 8781, 69407, 84797, 66211, 3444, 456, 48281, 98816 ]

[ 0.05999755859375, 0.15673828125, 0.2230224609375, 0.2020263671875, 0.0579833984375, 0.1690673828125, 0.051116943359375, 0.1766357421875, 0.0189666748046875, 0.07470703125, 0.03265380859375, 0.122802734375, 0.0196075439453125, 0.1138916015625, 0.1829833984375, 0.07696533203125, 0.1518...

embed

55079546_c0

55079546

prolog

0

Title: family tree /3 prolog Problem title: family tree /3 prolog Tags: family-tree, prolog Problem: family tree /3 prolog I'm sort of a beginner to Prolog and I have a quick question. I've built a family tree in prolog with parents(X,Y,Z). But when time comes to built uncle(Uncle,X). and aunt(Aunt,X). seems a bit diff...

family tree /3 prolog family tree /3 prolog family-tree prolog family tree /3 prolog I'm sort of a beginner to Prolog and I have a quick question. I've built a family tree in prolog with parents(X,Y,Z). But when time comes to built uncle(Uncle,X). and aunt(Aunt,X). seems a bit difficult for me. I've tried uncle(Uncle,X...

[ 0.02294921875, -0.00003933906555175781, 0.005767822265625, -0.005889892578125, -0.0264892578125, 0.006500244140625, 0.003265380859375, 0.0123291015625, 0.010498046875, -0.041748046875, -0.000759124755859375, -0.0306396484375, 0.004974365234375, 0.018310546875, 0.021484375, -0.000331878...

[ 14449, 53201, 18113, 502, 4867, 62600, 1679, 1250, 88303, 678, 27863, 1723, 1511, 51, 11030, 132, 14256, 1542, 136, 10, 9109, 37202, 4785, 34844, 100, 37842, 15772, 5117, 12600, 6700, 99547, 19095, 5701, 184345, 40368, 20028, 172337, 47644, ...

[ 0.0701904296875, 0.2042236328125, 0.13916015625, 0.1004638671875, 0.189208984375, 0.1654052734375, 0.03411865234375, 0.116455078125, 0.1488037109375, 0.043792724609375, 0.134033203125, 0.0655517578125, 0.0182647705078125, 0.1104736328125, 0.1510009765625, 0.00067138671875, 0.10351562...

embed

26449516_c1

26449516

prolog

1

Col,Row1,SolutionFile). show_result(_,_,MaxCol,_,Col,SolutionFile) :- Col > MaxCol, !. show_result(Squares,MaxRow,MaxCol,Row,Col,SolutionFile) :- ( memberchk(sq(Row,Col,X),Squares), !, open(SolutionFile,write,Stream), write(Stream,X), close(Stream) ; open(SolutionFile,write,Stream), write(Stream,'#'), close(Stream) ), ...

[ 0.017822265625, 0.0196533203125, 0.0262451171875, 0.00909423828125, -0.00775146484375, -0.003692626953125, -0.005279541015625, -0.01348876953125, 0.004974365234375, 0.0322265625, -0.004638671875, -0.002655029296875, -0.00665283203125, 0.01806640625, -0.00823974609375, -0.0213623046875,...

[ 11554, 12724, 434, 418, 102588, 34, 1363, 174350, 7639, 2109, 7136, 71346, 78457, 977, 9920, 711, 94727, 90, 32786, 206, 92, 864, 1542, 9803, 18781, 115061, 33022, 20903, 4904, 21748, 30646, 9774, 1284, 22027, 18, 23937, 47, 11435, 3871, ...

[ 0.188720703125, 0.13671875, 0.0955810546875, 0.10333251953125, 0.1138916015625, 0.09210205078125, 0.043670654296875, 0.1898193359375, 0.135498046875, 0.12255859375, 0.1536865234375, 0.09716796875, 0.189453125, 0.00579833984375, 0.1458740234375, 0.01959228515625, 0.116455078125, 0.0...

embed

62538102_c1

62538102

prolog

1

274,2))), :(clpfd,#\=(_25130,+(_25202,1))), :(clpfd,all_different([_25130,_25202,_25274,_25346])), :(clpfd,in(_25346,..(1,4))), :(clpfd,#\=(_25274,+(_25346,1))), :(clpfd,#\=(_25202,+(_25346,2))), :(clpfd,in(_25274,..(1,4))), :(clpfd,#\=(_25202,+(_25274,1))), :(clpfd,in(_25202,..(1,4))) ] as opposed to just: % Actual si...

[ 0.007781982421875, 0.01165771484375, -0.00897216796875, 0.0269775390625, -0.01190185546875, 0.00885009765625, -0.01470947265625, -0.000591278076171875, 0.004913330078125, -0.02490234375, 0.00836181640625, 0.004852294921875, 0.003021240234375, 0.0162353515625, -0.00665283203125, -0.0017...

[ 1438, 617, 4, 304, 32149, 31124, 34937, 39557, 71, 4904, 1369, 2588, 43955, 1328, 143179, 418, 5584, 238778, 3768, 363, 9271, 73, 163324, 144429, 1660, 1745, 100582, 26536, 18253, 30646, 34292, 284, 571, 441, 397, 3164, 4358, 77947, 38, 2...

[ 0.2276611328125, 0.234375, 0.02239990234375, 0.1673583984375, 0.1331787109375, 0.0217437744140625, 0.109619140625, 0.149169921875, 0.1231689453125, 0.053497314453125, 0.00531005859375, 0.1651611328125, 0.221923828125, 0.158203125, 0.23876953125, 0.05560302734375, 0.1409912109375, 0...

embed

22512726_c0

22512726

prolog

0

Title: Alternative to \+ in Prolog? Problem title: Alternative to \+ in Prolog? Tags: built-in, predicate, primes, prolog Problem: Alternative to \+ in Prolog? I have a program that returns true if an integer is prime, and else false. However I used the built-in predicate '\ +' which it turns out I am not allowed to us...

Alternative to \+ in Prolog? Alternative to \+ in Prolog? built-in predicate primes prolog Alternative Prolog is_prime has_factor Alternative to \+ in Prolog? I have a program that returns true if an integer is prime, and else false. However I used the built-in predicate '\ +' which it turns out I am not allowed to use...

[ -0.01165771484375, 0.0283203125, 0.0184326171875, -0.008544921875, -0.007293701171875, 0.0052490234375, -0.0076904296875, -0.0184326171875, 0.009033203125, -0.043701171875, -0.0033111572265625, 0.003753662109375, 0.001190185546875, -0.01171875, -0.0034332275390625, 0.0035552978515625, ...

[ 103905, 47, 41872, 1328, 23, 1250, 4867, 88303, 73, 1653, 2063, 67, 20809, 502, 83, 114654, 1556, 144810, 1528, 30646, 29568, 2174, 892, 1505, 37076, 98320, 11814, 997, 444, 959, 107003, 4527, 10932, 17368, 442, 4358, 77947 ]

[ 0.1678466796875, 0.04547119140625, 0.17578125, 0.2403564453125, 0.079345703125, 0.1873779296875, 0.25244140625, 0.135009765625, 0.1243896484375, 0.17578125, 0.224853515625, 0.10174560546875, 0.2193603515625, 0.1549072265625, 0.07733154296875, 0.212890625, 0.1502685546875, 0.2724609...

embed

3705023_c0

3705023

prolog

0

Title: fastest bidirectional java prolog implementation Problem title: fastest bidirectional java prolog implementation Tags: ffi, java, prolog Problem: fastest bidirectional java prolog implementation I am trying to use a a java-prolog layer on top of my current agent-based simulation. I am running Mac OS X Snow Leopa...

fastest bidirectional java prolog implementation fastest bidirectional java prolog implementation ffi java prolog fastest bidirectional java prolog implementation I am trying to use a a java-prolog layer on top of my current agent-based simulation. I am running Mac OS X Snow Leopard and Netbeans 6.9 and tried to use JP...

[ 0.0157470703125, 0.004913330078125, -0.0108642578125, -0.007232666015625, -0.012939453125, 0.01611328125, 0.007293701171875, 0.000469207763671875, 0.0028839111328125, -0.055419921875, 0.022216796875, 0.01458740234375, -0.0260009765625, -0.009033203125, 0.01202392578125, 0.0003471374511...

[ 4271, 525, 333, 80581, 110117, 79, 330, 502, 4867, 208124, 24500, 31577, 4527, 3454, 135355, 2663, 43581, 23882, 77007, 40226, 51042, 4727, 11787, 1193, 76935, 232425, 10086, 372, 10133, 165160, 37842, 821, 21130, 2452, 38246, 18, 145755, 303...

[ 0.1712646484375, 0.133544921875, 0.161376953125, 0.1546630859375, 0.1077880859375, 0.1397705078125, 0.2000732421875, 0.1678466796875, 0.2235107421875, 0.231201171875, 0.193115234375, 0.03680419921875, 0.05743408203125, 0.140625, 0.1710205078125, 0.0694580078125, 0.021026611328125, ...

embed

22443076_c1

22443076

prolog

1

X, member((Y,X), Sibs)). But when I do display_siblings I expected to see roelof-gerda . But the output is only x=roelof What did I do wrong. Im a beginner at Prolog and try to understand how this works. Roelof Edit 1: Could this be a solution: How can I prevent duplicates in prolog Edit 2: I will do but I still do not...

[ 0.00732421875, 0.01025390625, 0.019287109375, -0.00225830078125, -0.0234375, -0.002288818359375, -0.007720947265625, 0.004180908203125, 0.017822265625, -0.01019287109375, 0.0235595703125, -0.004486083984375, 0.014404296875, 0.0029296875, 0.00872802734375, 0.0164794921875, -0.00207519...

[ 1193, 32786, 1723, 1542, 602, 16145, 44116, 76103, 33992, 84751, 1957, 2062, 13, 64093, 1505, 85, 140992, 4734, 1022, 1369, 516, 44691, 1250, 4867, 28219, 43240, 2777, 29806, 56282, 171763, 1636, 502, 15400, 3509, 4390, 9, 1374, 16093, 990,...

[ 0.134521484375, 0.205810546875, 0.1680908203125, 0.12060546875, 0.1522216796875, 0.1722412109375, 0.1968994140625, 0.1768798828125, 0.2396240234375, 0.0931396484375, 0.06573486328125, 0.0164031982421875, 0.05255126953125, 0.258544921875, 0.1279296875, 0.156982421875, 0.1824951171875,...

embed

7759701_c0

7759701

prolog

0

Title: How to compute the sum of unpaired numbers up to N? Problem title: How to compute the sum of unpaired numbers up to N? Tags: prolog Problem: How to compute the sum of unpaired numbers up to N? I have some code on prolog, but this code does not work. sum(N,_):-N<0,fail. sum(N,S):-N=0,S=0,!. sum(N,S):-N1=N-1,sum(N...

How to compute the sum of unpaired numbers up to N? How to compute the sum of unpaired numbers up to N? prolog How N-1 n-2 How to compute the sum of unpaired numbers up to N? I have some code on prolog, but this code does not work. Correct recursive function on PHP I need to convert this function to prolog. For example...

[ -0.00921630859375, 0.0130615234375, 0.0242919921875, 0.00286865234375, 0.0031890869140625, 0.0186767578125, 0.0118408203125, 0.0177001953125, 0.023193359375, -0.026611328125, 0.01251220703125, -0.011962890625, -0.0034027099609375, 0.01007080078125, 0.0223388671875, 0.01239013671875, ...

[ 11249, 47, 9969, 6743, 10554, 111, 51, 109637, 297, 101935, 1257, 541, 502, 4867, 5759, 653, 5428, 70, 18151, 959, 4488, 46348, 195625, 5844, 32354, 98, 47302, 3871, 96760, 839, 126684, 705, 139303, 4332, 7, 7136, 18781, 84751, 483 ]

[ 0.076171875, 0.1077880859375, 0.1435546875, 0.146240234375, 0.222412109375, 0.07452392578125, 0.1138916015625, 0.226318359375, 0.1239013671875, 0.1654052734375, 0.1142578125, 0.18017578125, 0.135498046875, 0.1995849609375, 0.1588134765625, 0.05487060546875, 0.203369140625, 0.035614...

embed

23938093_c1

23938093

prolog

1

,0,0,1,1,1,1],[10],_) :- !. accessible(F,L,C) :- CC is C-1, or(G,H,F), accessible(G,M,CC), accessible(H,N,CC), L=[0, [M,N]]. accessible(F,L,C) :- CC is C-1, and(G,H,F), accessible(G,M,CC), accessible(H,N,CC), L=[1,[M,N]]. accessible(F,L,C) :- CC is C-1, not(F,X), accessible(X,M,CC), L=[2,M]. I would like to compute the...

[ 0.00714111328125, 0.0059814453125, 0.00787353515625, 0.0130615234375, -0.0164794921875, 0.01123046875, -0.01171875, 0.00274658203125, 0.00579833984375, -0.0269775390625, 0.00006246566772460938, -0.00014781951904296875, 0.01043701171875, 0.00156402587890625, 0.0038909912109375, -0.00396...

[ 4, 63527, 418, 76172, 63709, 454, 15772, 711, 81522, 919, 866, 441, 21581, 83, 313, 5759, 707, 724, 841, 594, 13709, 839, 339, 2389, 959, 1542, 304, 1884, 9969, 6743, 32354, 74706, 17721, 534, 1530, 9790, 25632, 69236, 132, 206808, 1193...

[ 0.0227813720703125, 0.2196044921875, 0.07275390625, 0.1014404296875, 0.173828125, 0.08526611328125, 0.1162109375, 0.108642578125, 0.288330078125, 0.1473388671875, 0.117431640625, 0.1094970703125, 0.210205078125, 0.12255859375, 0.1221923828125, 0.21630859375, 0.03314208984375, 0.110...

embed

10504656_c0

10504656

prolog

0

Title: Tree postorder traversal in Prolog Problem title: Tree postorder traversal in Prolog Tags: prolog, dcg Problem: Tree postorder traversal in Prolog Tree traversal refers to the process of visiting each node in a tree data structure in a systematic way. The postorder traversal in the following image Sorted_binary_...

Tree postorder traversal in Prolog Tree postorder traversal in Prolog prolog dcg Tree Prolog PREORDER Tree postorder traversal in Prolog Tree traversal refers to the process of visiting each node in a tree data structure in a systematic way. The postorder traversal in the following image Sorted_binary_tree returns A, C...

[ 0.0439453125, 0.00106048583984375, 0.0177001953125, -0.01177978515625, 0.00848388671875, 0.0286865234375, -0.01953125, -0.003570556640625, 0.009765625, -0.0341796875, -0.00482177734375, 0.009765625, -0.0181884765625, -0.0177001953125, 0.0198974609375, 0.0211181640625, -0.01123046875,...

[ 101344, 1305, 80596, 37317, 289, 23, 1250, 4867, 502, 238, 177, 23096, 24638, 18044, 15005, 9433, 150080, 12638, 110, 112, 53201, 2053, 45646, 242161, 3917, 25632, 29569, 53666, 19155, 1294, 62600, 30646, 313, 335, 572, 87, 527, 563, 2480, ...

[ 0.2578125, 0.194091796875, 0.264892578125, 0.251953125, 0.1602783203125, 0.01641845703125, 0.1846923828125, 0.2548828125, 0.1435546875, 0.0254058837890625, 0.0811767578125, 0.15869140625, 0.2034912109375, 0.1832275390625, 0.0423583984375, 0.0950927734375, 0.1917724609375, 0.0695800...

embed

9688526_c0

9688526

prolog

0

Title: Prolog sublists generation, multiply empty list - don't know why Problem title: Prolog sublists generation, multiply empty list - don't know why Tags: append, prolog, sublist Problem: Prolog sublists generation, multiply empty list - don't know why I want to make prolog returning me all possible sublis...

Prolog sublists generation, multiply empty list - don't know why Prolog sublists generation, multiply empty list - don't know why append prolog sublist Prolog Out Prolog sublists generation, multiply empty list - don't know why I want to make prolog returning me all possible sublists of given list so I wrote:...

[ 0.00616455078125, 0.0169677734375, 0.01092529296875, -0.0001201629638671875, -0.035400390625, -0.0028533935546875, -0.0072021484375, 0.00543212890625, 0.018798828125, -0.01165771484375, 0.00787353515625, 0.01446533203125, -0.006927490234375, 0.01116943359375, 0.00494384765625, 0.012634...

[ 1250, 4867, 1614, 6562, 58093, 6024, 62479, 201505, 5303, 3714, 15400, 114689, 502, 13538, 3444, 30646, 756, 7722, 16750, 2046, 31351, 119140, 214 ]

[ 0.0938720703125, 0.1947021484375, 0.17431640625, 0.2039794921875, 0.1199951171875, 0.0679931640625, 0.129638671875, 0.15234375, 0.165283203125, 0.00994873046875, 0.044403076171875, 0.066162109375, 0.07293701171875, 0.09954833984375, 0.017974853515625, 0.08203125, 0.001007080078125, ...

embed

13824568_c0

13824568

prolog

0

Title: Silly detail enquiry about Prolog unification Problem title: Silly detail enquiry about Prolog unification Tags: unification, prolog, list, cons Problem: Silly detail enquiry about Prolog unification In Prolog: ?-P=[A|B], P=[1,_]. P = [1, _G1091], A = 1, B = [_G1091] B is shown as [_G1091] showing it's an uninst...

Silly detail enquiry about Prolog unification Silly detail enquiry about Prolog unification unification prolog list cons Silly Prolog _G1091 Silly detail enquiry about Prolog unification In Prolog: B is shown as [_G1091] showing it's an uninstantiated variable. However, if I change a tiny bit... All of a sudden it's no...

[ 0.0245361328125, 0.02392578125, 0.0238037109375, -0.0054931640625, -0.00909423828125, -0.006195068359375, -0.0113525390625, -0.00286865234375, 0.00811767578125, 0.01611328125, 0.0022125244140625, 0.00811767578125, 0.0224609375, 0.00119781494140625, 0.00188446044921875, 0.008544921875, ...

[ 602, 12097, 22443, 3181, 1250, 4867, 51, 41274, 502, 5303, 158, 724, 963, 12183, 335, 127887, 237, 106000, 76172, 141377, 143034, 14, 27686, 77336, 2174, 15549, 57278, 4785, 8932, 959, 60892, 83, 1284, 7464, 43542, 40383, 678, 23937, 1380, ...

[ 0.10418701171875, 0.1788330078125, 0.1668701171875, 0.09564208984375, 0.1441650390625, 0.2396240234375, 0.156982421875, 0.112060546875, 0.05267333984375, 0.1075439453125, 0.1341552734375, 0.076171875, 0.065185546875, 0.171142578125, 0.1597900390625, 0.10546875, 0.0145111083984375, ...

embed

27710292_c0

27710292

prolog

0

Title: Prolog Out of local stack error Problem title: Prolog Out of local stack error Tags: prolog, transitive-closure Problem: Prolog Out of local stack error I tried some basic example from a book and it makes "Out of local stack" error (I'll tell more after the code). here is the code: edge(a,b). edge(a,e). edge(b,d...

Prolog Out of local stack error Prolog Out of local stack error prolog transitive-closure Prolog Out Node1 Node2 SomeNode Prolog Out of local stack error I tried some basic example from a book and it makes "Out of local stack" error (I'll tell more after the code). here is the code: I tried for example to write query e...

[ 0.0294189453125, 0.01220703125, 0.0031890869140625, 0.023193359375, 0.006439208984375, -0.00982666015625, -0.049072265625, 0.030517578125, 0.011474609375, -0.06396484375, 0.00885009765625, -0.0147705078125, 0.0216064453125, 0.01043701171875, 0.046142578125, 0.006927490234375, 0.00769...

[ 1250, 4867, 13538, 111, 4000, 177261, 18499, 502, 62621, 5844, 170224, 438, 112, 304, 5021, 37842, 62822, 27781, 12877, 79858, 18151, 33022, 41, 1294, 121303, 275, 176377, 29568, 30957, 74, 2967, 3688 ]

[ 0.154296875, 0.228759765625, 0.1783447265625, 0.2027587890625, 0.174072265625, 0.228759765625, 0.1871337890625, 0.1346435546875, 0.1217041015625, 0.045684814453125, 0.162841796875, 0.1146240234375, 0.0357666015625, 0.02227783203125, 0.1136474609375, 0.02569580078125, 0.04409790039062...

embed

18697784_c0

18697784

prolog

0

Title: Prolog unification exercise Problem title: Prolog unification exercise Tags: prolog Problem: Prolog unification exercise I not shure how in my exam answer to this qestion: Let's consider this prolog program: p(a,b). p(b,c). p(c,a). q(X,X). q(X,Y):-p(X,Z),q(Z,Y). and question: ?- q(X,X). And valid? answer is: Abo...

Prolog unification exercise Prolog unification exercise prolog Prolog Prolog unification exercise I not shure how in my exam answer to this qestion: and question: And valid? answer is: And I don't get it, really. IMO this predicate can be fullfilled in 3 ways: What I don't understand here? Or maybe the answer is wrong ...

[ 0.0074462890625, 0.0220947265625, 0.025390625, 0.004058837890625, -0.01446533203125, 0.00634765625, -0.01953125, -0.0169677734375, 0.00665283203125, -0.00390625, -0.0031585693359375, -0.0010223388671875, 0.01397705078125, -0.0159912109375, -0.02099609375, 0.0042724609375, 0.008728027...

[ 1250, 4867, 51, 41274, 81979, 502, 959, 107, 3642, 42276, 35166, 47, 9655, 3493, 35604, 2301, 18, 2046, 442, 6183, 59773, 903, 1653, 2063, 67, 831, 4393, 116115, 23, 138, 48322, 28219, 3688, 44691, 1733, 4127 ]

[ 0.1331787109375, 0.2313232421875, 0.1378173828125, 0.088134765625, 0.18310546875, 0.0826416015625, 0.0286865234375, 0.06378173828125, 0.08526611328125, 0.142822265625, 0.1580810546875, 0.006988525390625, 0.060699462890625, 0.1011962890625, 0.289794921875, 0.04644775390625, 0.06982421...

embed

55659980_c0

55659980

prolog

0

Title: The difference between dollar sign ($) and number (or hash) sign (#) in Prolog Problem title: The difference between dollar sign ($) and number (or hash) sign (#) in Prolog Tags: prolog, eclipse-clp Problem: The difference between dollar sign ($) and number (or hash) sign (#) in Prolog As I found I can use from ...

The difference between dollar sign ($) and number (or hash) sign (#) in Prolog The difference between dollar sign ($) and number (or hash) sign (#) in Prolog prolog eclipse-clp Prolog Yes The difference between dollar sign ($) and number (or hash) sign (#) in Prolog As I found I can use from $ and # in the shortened ve...

[ 0.00592041015625, 0.01239013671875, 0.01324462890625, 0.00653076171875, -0.01123046875, 0.0130615234375, -0.01104736328125, 0.018798828125, 0.0223388671875, 0.000514984130859375, 0.007659912109375, 0.001220703125, -0.0021209716796875, 0.0002384185791015625, 0.0113525390625, 0.013122558...

[ 60212, 17721, 15437, 24092, 4369, 136, 14012, 748, 1556, 127, 4904, 23, 1250, 4867, 502, 106371, 184, 26775, 32635, 831, 4527, 1295, 3650, 468, 16610, 11389, 45890, 41, 16750, 2367, 70, 15400, 25632, 1294, 83 ]

[ 0.2249755859375, 0.143798828125, 0.230224609375, 0.246826171875, 0.2371826171875, 0.1123046875, 0.2135009765625, 0.058807373046875, 0.1837158203125, 0.176513671875, 0.20263671875, 0.1021728515625, 0.159423828125, 0.237060546875, 0.1044921875, 0.109375, 0.033050537109375, 0.06262207...

embed

36065170_c0

36065170

prolog

0

Title: Prolog lexer can't find the error Problem title: Prolog lexer can't find the error Tags: prolog Problem: Prolog lexer can't find the error I have a lexer that I am trying to build. I just want to know why it doesn't create the second list. %TokenList=[int, add, '(', int, a, ',', int, b, ')']. lexer([H|...

Prolog lexer can't find the error Prolog lexer can't find the error prolog Prolog TokenList Output lexer_test TYPE_INT TYPE_BOOL COMMA ASSIGN LET_IN COND_IF COND_THEN COND_ELSE LOGIC_EQ LOGIC_NOT_EQ LOGIC_GT LOGIC_GTEQ ARITH_ADD ARITH_SUB OPEN_P CLOSE_P INTEGER IDENTIFIER Prolog lexer can't find the error I h...

[ 0.0166015625, -0.006622314453125, -0.00970458984375, 0.0255126953125, -0.015869140625, 0.00653076171875, -0.0093994140625, 0.00628662109375, 0.0196533203125, -0.01507568359375, 0.016845703125, 0.0015106201171875, -0.00390625, -0.0174560546875, 0.0274658203125, 0.008056640625, 0.00454...

[ 1250, 4867, 95, 34058, 3768, 18, 7413, 18499, 831, 502, 717, 1098, 154663, 13538, 6954, 95267, 59537, 137142, 31436, 8218, 151657, 27089, 397, 47510, 178102, 23415, 32338, 65441, 102686, 208585, 101868, 45367, 3714, 15400, 28282, 17932, 5303, ...

[ 0.1488037109375, 0.2083740234375, 0.1298828125, 0.23876953125, 0.051788330078125, 0.0831298828125, 0.1678466796875, 0.2279052734375, 0.0229339599609375, 0.126220703125, 0.075927734375, 0.1302490234375, 0.1505126953125, 0.0860595703125, 0.1575927734375, 0.05694580078125, 0.04678344726...

embed

19979548_c0

19979548

prolog

0

Title: Predicate that generates integers and tests if integer Problem title: Predicate that generates integers and tests if integer Tags: failure-slice, predicate, prolog, integer Problem: Predicate that generates integers and tests if integer I'm trying to make a Prolog predicate that will let me test if a given value...

Predicate that generates integers and tests if integer Predicate that generates integers and tests if integer failure-slice predicate prolog integer Predicate Predicate that generates integers and tests if integer I'm trying to make a Prolog predicate that will let me test if a given value is a integer bigger than 0, a...

[ -0.0036468505859375, 0.000278472900390625, -0.01031494140625, 0.0174560546875, -0.000667572021484375, 0.031982421875, -0.0022735595703125, -0.016357421875, -0.00469970703125, -0.0185546875, 0.0023040771484375, 0.0242919921875, -0.0302734375, 0.01434326171875, 0.0211181640625, 0.0189208...

[ 7145, 2063, 67, 139392, 892, 26255, 136, 109921, 2174, 1505, 450, 137578, 13348, 1653, 502, 4867, 7, 31577, 3249, 1250, 2633, 163, 3034, 34475, 34292, 83, 167785, 3501, 757, 8337, 35604, 77336, 5036, 33342, 1884, 3293, 1221, 756, 1284, 32...

[ 0.1534423828125, 0.199462890625, 0.07977294921875, 0.205810546875, 0.1441650390625, 0.1337890625, 0.124755859375, 0.2119140625, 0.1649169921875, 0.08843994140625, 0.0218505859375, 0.213134765625, 0.145751953125, 0.1590576171875, 0.13623046875, 0.1837158203125, 0.031341552734375, 0....

embed

79163408_c2

79163408

prolog

2

< 1, abs(X - X1) + abs(Y - Y1) \= 0. count_mines(X, Y, Count) :- findall(1, (adjacent(X, Y, AdjX, AdjY), mine(AdjX, AdjY)), Mines), length(Mines, Count). open_cell(X, Y) :- cell(X, Y, closed, _), count_mines(X, Y, Count), (Count > 0 -> retract(cell(X, Y, closed, _)), assert(cell(X, Y, open, Count)), write('open cell > ...

[ 0.0037078857421875, -0.00689697265625, 0.00506591796875, 0.0238037109375, 0.019287109375, -0.0015411376953125, -0.0101318359375, 0.01190185546875, 0.008056640625, -0.0001811981201171875, -0.0213623046875, 0.023193359375, 0.0185546875, -0.00150299072265625, 0.00830078125, -0.01391601562...

[ 4426, 106, 43719, 1542, 20, 1193, 17727, 997, 1723, 990, 1369, 757, 5, 54529, 2962, 7, 132, 4, 108210, 15772, 7413, 5584, 41600, 712, 145, 16797, 170, 5665, 56713, 140909, 59076, 194, 9803, 454, 34680, 38750, 155738, 41499, 15390, 33657, ...

[ 0.1192626953125, 0.0933837890625, 0.1641845703125, 0.146240234375, 0.085205078125, 0.0865478515625, 0.096435546875, 0.1212158203125, 0.13720703125, 0.177978515625, 0.078369140625, 0.1280517578125, 0.033447265625, 0.2178955078125, 0.2666015625, 0.14697265625, 0.0151519775390625, 0.0...

embed

67577974_c0

67577974

prolog

0

Title: Predicate concat in Prolog Problem title: Predicate concat in Prolog Tags: prolog Problem: Predicate concat in Prolog I'm trying to write a predicate concat/3 with header concat(whole, part1, part2) that succeeds if part1 and part2 are two not-empty subsequences which when concatenated form the sequence whole. F...

Predicate concat in Prolog Predicate concat in Prolog prolog Predicate Prolog Predicate concat in Prolog I'm trying to write a predicate concat/3 with header concat(whole, part1, part2) that succeeds if part1 and part2 are two not-empty subsequences which when concatenated form the sequence whole. For example concat(A,...

[ 0.01287841796875, 0.01165771484375, 0.00421142578125, 0.0123291015625, 0.0029449462890625, 0.030029296875, -0.01904296875, 0.0301513671875, 0.0218505859375, -0.02197265625, -0.003997802734375, 0.0089111328125, -0.031982421875, 0.007415771484375, 0.018310546875, 0.01171875, -0.0026550...

[ 7145, 2063, 67, 158, 4460, 1250, 4867, 502, 31577, 33022, 1653, 18113, 10336, 56, 70919, 2831, 10461, 214493, 2174, 136, 304, 6626, 959, 33548, 1614, 184, 26513, 33, 3173, 944, 28271, 284, 1530, 97, 116, 138, 201, 35166, 62, 2203, 11468...

[ 0.1358642578125, 0.171875, 0.07232666015625, 0.16455078125, 0.2181396484375, 0.1602783203125, 0.21728515625, 0.1165771484375, 0.016143798828125, 0.05743408203125, 0.1417236328125, 0.1829833984375, 0.095458984375, 0.038482666015625, 0.11669921875, 0.082275390625, 0.0280609130859375, ...

embed

50092359_c0

50092359

prolog

0

Title: Write a program in prolog that determines if there are exactly three values in such a way that they add upto a sum of N Problem title: Write a program in prolog that determines if there are exactly three values in such a way that they add upto a sum of N Tags: prolog Problem: Write a program in prolog that deter...

Write a program in prolog that determines if there are exactly three values in such a way that they add upto a sum of N Write a program in prolog that determines if there are exactly three values in such a way that they add upto a sum of N prolog Write Write a program in prolog that determines if there are exactly thre...

[ 0.0035400390625, 0.003662109375, 0.0098876953125, -0.006805419921875, -0.0189208984375, 0.01275634765625, -0.004241943359375, 0.01226806640625, 0.0186767578125, -0.01263427734375, 0.01470947265625, -0.0242919921875, 0.007568359375, 0.0019683837890625, 0, 0.0213623046875, 0.0209960937...

[ 601, 18781, 1528, 23, 502, 4867, 83324, 2174, 66161, 17262, 142424, 15190, 1257, 188, 10554, 541, 2685, 6044, 3917, 22221, 32036, 133063, 82449, 4, 104629, 678, 105950, 305, 5608, 28412, 29568, 6637, 138, 2289, 106, 54651, 85398, 71928, 166...

[ 0.10650634765625, 0.0863037109375, 0.231201171875, 0.06024169921875, 0.1827392578125, 0.275390625, 0.179931640625, 0.1053466796875, 0.198974609375, 0.24267578125, 0.255615234375, 0.1746826171875, 0.08984375, 0.1142578125, 0.2100830078125, 0.1480712890625, 0.0173187255859375, 0.0142...

embed

35125846_c0

35125846

prolog

0

Title: Unify variable if the condition is met Problem title: Unify variable if the condition is met Tags: prolog Problem: Unify variable if the condition is met I want to assign a value to a variable R , but the value depends on the condition. if (cond1) var = value1 + 5; else if (cond2) var = value1 + 10; else var = v...

Unify variable if the condition is met Unify variable if the condition is met prolog Unify cond1 value1 cond2 value2 value3 value4 Unify variable if the condition is met I want to assign a value to a variable R , but the value depends on the condition. This is how I tried, but if the first condition fails, var is assig...

[ 0.01214599609375, 0.0019989013671875, -0.0025787353515625, 0.00299072265625, 0.004241943359375, -0.0033721923828125, -0.007537841796875, 0.0272216796875, 0.0068359375, 0.0140380859375, 0.00145721435546875, -0.0045166015625, 0.009765625, 0.002197265625, 0.01312255859375, 0.0047607421875...

[ 992, 40383, 77336, 2174, 35431, 83, 435, 502, 4867, 158, 71, 418, 34292, 304, 363, 617, 3444, 95486, 47, 627, 56566, 37842, 70, 5117, 35782, 7, 285, 20802, 33770 ]

[ 0.1820068359375, 0.208984375, 0.26416015625, 0.116943359375, 0.236572265625, 0.06451416015625, 0.1837158203125, 0.1199951171875, 0.1585693359375, 0.1070556640625, 0.06982421875, 0.01422119140625, 0.1458740234375, 0.0235443115234375, 0.041717529296875, 0.114501953125, 0.03555297851562...

embed

37117901_c0

37117901

prolog

0

Title: What does it mean by express this puzzle as a CSP Problem title: What does it mean by express this puzzle as a CSP Tags: prolog, clpfd Problem: What does it mean by express this puzzle as a CSP What is meant by the below for the attached image. By labelling each cell with a variable, express the puzzle as a CSP....

What does it mean by express this puzzle as a CSP What does it mean by express this puzzle as a CSP prolog clpfd What CSP Hint What does it mean by express this puzzle as a CSP What is meant by the below for the attached image. I initially thought just add variables to each cell like A, B, C etc to each cell and then c...

[ 0.00506591796875, -0.00037384033203125, 0.0035552978515625, 0.0303955078125, 0.006317138671875, 0.00634765625, -0.0027618408203125, 0.004852294921875, -0.023193359375, -0.0047607421875, -0.0115966796875, 0.0015716552734375, 0.01141357421875, 0.033935546875, -0.0029449462890625, 0.00897...

[ 29459, 36510, 903, 104192, 237, 313, 9434, 502, 4867, 71, 19895, 18, 131148, 390, 35064, 220642, 29569, 17569, 15190, 77336, 12638, 38750, 2816, 187136, 56065 ]

[ 0.0958251953125, 0.1937255859375, 0.0855712890625, 0.2174072265625, 0.0701904296875, 0.0867919921875, 0.234130859375, 0.07470703125, 0.156494140625, 0.034637451171875, 0.151123046875, 0.09051513671875, 0.1046142578125, 0.0271759033203125, 0.133056640625, 0.07208251953125, 0.122558593...

embed

62313750_c0

62313750

prolog

0

Title: Prolog Sum value numbers smaller than limit Problem title: Prolog Sum value numbers smaller than limit Tags: prolog Problem: Prolog Sum value numbers smaller than limit Define predicate summy(List, Limit, N), where List is a list of absolute value numbers, and N is the sum of such numbers from List lists whose v...

Prolog Sum value numbers smaller than limit Prolog Sum value numbers smaller than limit prolog Prolog Sum Prolog Sum value numbers smaller than limit Define predicate summy(List, Limit, N), where List is a list of absolute value numbers, and N is the sum of such numbers from List lists whose value is smaller than Limit...

[ -0.01495361328125, -0.013427734375, 0.0284423828125, -0.007354736328125, -0.01287841796875, 0.00982666015625, 0.0059814453125, 0.029296875, 0.029296875, 0.035400390625, -0.0030059814453125, 0.002044677734375, -0.01116943359375, -0.02099609375, 0.0291748046875, 0.0036163330078125, 0.0...

[ 1250, 4867, 36335, 34292, 101935, 164917, 3501, 17475, 502, 64552, 1653, 2063, 67, 10554, 1176, 154663, 125177, 541, 7440, 32036, 83, 5303, 111, 89931, 6044, 765, 11675, 27781, 45831, 1193, 4046, 959, 1662, 5 ]

[ 0.135986328125, 0.21044921875, 0.2088623046875, 0.21630859375, 0.13818359375, 0.192138671875, 0.06866455078125, 0.2432861328125, 0.089599609375, 0.1392822265625, 0.148681640625, 0.1961669921875, 0.10089111328125, 0.216064453125, 0.25927734375, 0.212890625, 0.295166015625, 0.1722412...

embed

33749538_c0

33749538

prolog

0

Title: How to stop rec call in prolog Problem title: How to stop rec call in prolog Tags: recursion, prolog, list Problem: How to stop rec call in prolog I want to represent a number as a list of digits. I did most of the implementations but I do not know how to stop the recursive call after parsing the whole number. I...

How to stop rec call in prolog How to stop rec call in prolog recursion prolog list How NR1 How to stop rec call in prolog I want to represent a number as a list of digits. I did most of the implementations but I do not know how to stop the recursive call after parsing the whole number. I know this solution is not the ...

[ -0.013671875, 0.0008697509765625, 0.018798828125, -0.009765625, -0.0084228515625, 0.010009765625, -0.02294921875, 0.003662109375, 0.01324462890625, -0.02734375, 0.0004253387451171875, -0.00384521484375, -0.0201416015625, -0.00848388671875, 0.01348876953125, -0.0078125, 0.00439453125,...

[ 11249, 47, 7279, 21954, 11782, 23, 502, 4867, 195625, 1830, 5303, 71641, 418, 3444, 33636, 14012, 237, 153939, 7, 6777, 2684, 208124, 3714, 3642, 5844, 7103, 366, 6953, 28271, 29806, 2965, 6528, 11853, 6305, 88308, 22936, 705, 9, 3900, 10...

[ 0.06109619140625, 0.036376953125, 0.2347412109375, 0.2398681640625, 0.2435302734375, 0.06219482421875, 0.1749267578125, 0.2396240234375, 0.194580078125, 0.047271728515625, 0.15234375, 0.13671875, 0.0487060546875, 0.0751953125, 0.201904296875, 0.158935546875, 0.1019287109375, 0.1544...

embed

71893100_c0

71893100

prolog

0

Title: Prolog: Convert list into dictionary? Problem title: Prolog: Convert list into dictionary? Tags: prolog, list, dictionary, type-conversion Problem: Prolog: Convert list into dictionary? I am searching some swi-prolog predicate: list_to_dict(List, Dict) :- ?? Which is able to convert a list like l = [a, b, c, d] ...

Prolog: Convert list into dictionary? Prolog: Convert list into dictionary? prolog list dictionary type-conversion Prolog Convert list_to_dict List Dict dict_label Prolog: Convert list into dictionary? I am searching some swi-prolog predicate: Which is able to convert a list like into a Prolog dict d whose keys are equ...

[ -0.00836181640625, -0.006011962890625, -0.0076904296875, 0.003387451171875, -0.019287109375, -0.007110595703125, -0.0224609375, 0.0081787109375, -0.001129150390625, -0.022705078125, 0.0118408203125, 0.003173828125, -0.00543212890625, 0.00836181640625, 0.0235595703125, 0, 0.0112304687...

[ 1250, 4867, 12, 1657, 11549, 5303, 3934, 45, 10763, 6635, 502, 10644, 2271, 46354, 188, 61669, 32036, 60897, 18, 152526, 157318, 2452, 3454, 1653, 2063, 19048, 96760, 1884, 104, 22799, 105950, 63262, 72134, 99, 615, 27781, 36917, 3173, 7794...

[ 0.16650390625, 0.259521484375, 0.010498046875, 0.058013916015625, 0.13720703125, 0.233154296875, 0.1090087890625, 0.081787109375, 0.1539306640625, 0.1475830078125, 0.1297607421875, 0.1173095703125, 0.04241943359375, 0.10589599609375, 0.042877197265625, 0.16796875, 0.1575927734375, ...

embed

20154594_c0

20154594

prolog

0

Title: Get a list of numbers from a list of complex terms Problem title: Get a list of numbers from a list of complex terms Tags: prolog Problem: Get a list of numbers from a list of complex terms I have a list of complex terms with the same functor and arity, but different arguments. Something like this: Elements = [e...

Get a list of numbers from a list of complex terms Get a list of numbers from a list of complex terms prolog a Get Elements Numbers Get a list of numbers from a list of complex terms I have a list of complex terms with the same functor and arity, but different arguments. Something like this: And from it I wish to gener...

[ 0.004547119140625, 0.007720947265625, -0.01348876953125, 0.02099609375, 0.00010824203491210938, 0.0419921875, 0.003631591796875, 0.020263671875, 0.0162353515625, -0.0281982421875, -0.0026397705078125, -0.0206298828125, -0.025634765625, 0.01806640625, -0.00506591796875, 0.00031661987304...

[ 20779, 5303, 111, 101935, 1295, 27140, 69407, 502, 4867, 48325, 103332, 5701, 7477, 18770, 187, 2481, 1284, 12921, 10750, 32599, 139392, 3525, 70541, 4734, 17932, 12638, 13579, 3917, 4331, 1653, 2063, 67, 86869, 2967, 100, 2499, 140909, 10773...

[ 0.136474609375, 0.1669921875, 0.06494140625, 0.1763916015625, 0.10009765625, 0.2208251953125, 0.2247314453125, 0.12060546875, 0.1727294921875, 0.1802978515625, 0.1759033203125, 0.054595947265625, 0.080322265625, 0.10418701171875, 0.04864501953125, 0.099365234375, 0.002105712890625, ...

embed

43875886_c0

43875886

prolog

0

Title: How I get most repetitive element of this? (Prolog - Logic Paradigm) Problem title: How I get most repetitive element of this? (Prolog - Logic Paradigm) Tags: prolog Problem: How I get most repetitive element of this? (Prolog - Logic Paradigm) In predicate "sample", the first element is your id and the others, a...

How I get most repetitive element of this? (Prolog - Logic Paradigm) How I get most repetitive element of this? (Prolog - Logic Paradigm) prolog How Prolog Logic Paradigm How I get most repetitive element of this? (Prolog - Logic Paradigm) In predicate "sample", the first element is your id and the others, are the resu...

[ -0.0032501220703125, 0.002288818359375, -0.013427734375, 0.017578125, -0.00927734375, 0.01611328125, -0.0023040771484375, 0.0023193359375, 0.005950927734375, -0.05615234375, 0.0035552978515625, -0.0052490234375, -0.0123291015625, -0.0238037109375, 0.00323486328125, -0.0096435546875, ...

[ 11249, 2046, 2684, 57346, 4935, 12830, 111, 903, 10752, 4867, 50592, 238, 1720, 4803, 39, 87, 502, 1250, 1653, 2063, 433, 33209, 5117, 83, 935, 3447, 27060, 621, 16750, 121413, 3871, 119140, 34292, 8194, 6528, 3642 ]

[ 0.0860595703125, 0.1282958984375, 0.208740234375, 0.27490234375, 0.19189453125, 0.1966552734375, 0.06915283203125, 0.10760498046875, 0.0576171875, 0.1961669921875, 0.1141357421875, 0.002349853515625, 0.05230712890625, 0.1043701171875, 0.0343017578125, 0.03668212890625, 0.078735351562...

embed

30712311_c0

30712311

prolog

0

Title: Predicate that pick elements which are on list twice not less not more Problem title: Predicate that pick elements which are on list twice not less not more Tags: prolog Problem: Predicate that pick elements which are on list twice not less not more I'm trying to write a predicate twice(El,L) which will return t...

Predicate that pick elements which are on list twice not less not more Predicate that pick elements which are on list twice not less not more prolog Predicate Predicate that pick elements which are on list twice not less not more I'm trying to write a predicate twice(El,L) which will return true. when El is on list exa...

[ -0.004486083984375, 0.010009765625, 0.01373291015625, -0.01556396484375, 0.0087890625, 0.0311279296875, -0.0042724609375, -0.0023956298828125, 0.00445556640625, -0.036865234375, 0.0252685546875, 0.008544921875, 0.0004100799560546875, 0.020751953125, -0.004730224609375, 0.02392578125, ...

[ 7145, 2063, 67, 450, 39580, 80854, 98, 5303, 186351, 959, 40715, 1286, 502, 4867, 621, 31577, 33022, 1653, 7623, 866, 1221, 30646, 29568, 3229, 540, 83, 66161, 765, 43240, 26267, 100, 54753, 133063, 82449, 1284, 1542, 155761, 96386, 41929, ...

[ 0.19091796875, 0.2327880859375, 0.131103515625, 0.054168701171875, 0.2239990234375, 0.192138671875, 0.1451416015625, 0.192138671875, 0.216552734375, 0.14013671875, 0.1942138671875, 0.153564453125, 0.141357421875, 0.1812744140625, 0.0091552734375, 0.073486328125, 0.10498046875, 0.19...

embed

57670280_c0

57670280

prolog

0

Title: 7 liter and 5 liter jugs to 4 liter jug puzzle with depth-first search Problem title: 7 liter and 5 liter jugs to 4 liter jug puzzle with depth-first search Tags: prolog, water-jug-problem Problem: 7 liter and 5 liter jugs to 4 liter jug puzzle with depth-first search I want to use any kind of depth-first search...

7 liter and 5 liter jugs to 4 liter jug puzzle with depth-first search 7 liter and 5 liter jugs to 4 liter jug puzzle with depth-first search prolog water-jug-problem JUG1 JUG2 7 liter and 5 liter jugs to 4 liter jug puzzle with depth-first search I want to use any kind of depth-first search to solve the 7 Liter and 5 ...

[ 0.006256103515625, 0.0164794921875, -0.0142822265625, 0.01458740234375, -0.02294921875, 0.000782012939453125, -0.04443359375, 0.0166015625, -0.00799560546875, 0.010986328125, 0.024658203125, -0.0125732421875, -0.002105712890625, 0.0267333984375, 0.012451171875, 0.007354736328125, 0.0...

[ 361, 15659, 136, 190, 103863, 7, 47, 201, 104192, 678, 168867, 13448, 33938, 502, 4867, 7401, 461, 177, 38953, 30357, 724, 418, 304, 271, 87, 3444, 4527, 2499, 8562, 86869, 70, 104578, 179277, 23, 159, 38969, 9, 10752, 765, 110, 6528, ...

[ 0.1614990234375, 0.205078125, 0.1016845703125, 0.1884765625, 0.25732421875, 0.06927490234375, 0.1380615234375, 0.201904296875, 0.201416015625, 0.03656005859375, 0.165771484375, 0.1058349609375, 0.1800537109375, 0.1064453125, 0.197509765625, 0.115966796875, 0.175048828125, 0.1542968...

embed

7815824_c0

7815824

prolog

0

Title: Prolog return duplicate list Problem title: Prolog return duplicate list Tags: prolog, list Problem: Prolog return duplicate list I am getting duplicated list when I try to findall/3 possible path in a graph? Any idea what is wrong with the code? The pattern of duplicate was S:6 was duplicated with S:13, S:7 wit...

Prolog return duplicate list Prolog return duplicate list prolog list Prolog Vix Len long_p Prolog return duplicate list I am getting duplicated list when I try to findall/3 possible path in a graph? Any idea what is wrong with the code? The pattern of duplicate was S:6 was duplicated with S:13, S:7 with S:14, S:8 with...

[ 0.004241943359375, 0.028076171875, -0.0050048828125, 0.0166015625, -0.022705078125, -0.01611328125, -0.03125, 0.0118408203125, 0.0169677734375, -0.051513671875, 0.001373291015625, -0.007415771484375, 0.027587890625, 0.010986328125, 0.006072998046875, 0.038330078125, 0.0185546875, 0...

[ 1250, 4867, 30646, 171763, 67, 5303, 502, 582, 425, 18226, 4989, 254, 20949, 3674, 9790, 7413, 5584, 18113, 7722, 60875, 41382, 6528, 44691, 18151, 103510, 159, 910, 22618, 22635, 1019, 12221, 117781, 16750 ]

[ 0.1556396484375, 0.2734375, 0.15771484375, 0.226806640625, 0.144775390625, 0.1939697265625, 0.089111328125, 0.099609375, 0.0654296875, 0.1396484375, 0.032379150390625, 0.038604736328125, 0.0153961181640625, 0.0904541015625, 0.0638427734375, 0.09136962890625, 0.1226806640625, 0.2354...

embed

65066605_c0

65066605

prolog

0

Title: Why is my recursive prolog script not working? Problem title: Why is my recursive prolog script not working? Tags: prolog Problem: Why is my recursive prolog script not working? Can anyone help me out with Prolog recursive functions? I have to type in a recursive input and it should give me true, but it gives me...

Why is my recursive prolog script not working? Why is my recursive prolog script not working? prolog Why Bob Food Why is my recursive prolog script not working? Can anyone help me out with Prolog recursive functions? I have to type in a recursive input and it should give me true, but it gives me an error and I sitll do...

[ 0.0152587890625, 0.00579833984375, 0.004547119140625, 0.0234375, -0.0034332275390625, 0.0296630859375, 0.00506591796875, -0.000316619873046875, 0.0208740234375, -0.00799560546875, 0.015625, -0.00628662109375, -0.022216796875, 0.005462646484375, 0.02197265625, -0.01275634765625, 0.012...

[ 44084, 83, 759, 195625, 5844, 502, 4867, 26499, 959, 20697, 25027, 34562, 35672, 4358, 1810, 1250, 32354, 10644, 23, 107730, 29568, 76199, 18499, 3714, 26366, 2367, 765, 360, 7077, 204246, 13, 257, 26286, 1176, 16750, 212059, 992, 69723, 50...

[ 0.131591796875, 0.05816650390625, 0.09954833984375, 0.23193359375, 0.1705322265625, 0.1773681640625, 0.220458984375, 0.2335205078125, 0.1634521484375, 0.1591796875, 0.185791015625, 0.25146484375, 0.000152587890625, 0.04278564453125, 0.04010009765625, 0.1424560546875, 0.10400390625, ...

embed

71644928_c0

71644928

prolog

0

Title: Prolog: Cast term into string? Problem title: Prolog: Cast term into string? Tags: swi-prolog, string, prolog Problem: Prolog: Cast term into string? I have a Prolog program, which generates terms of this form: :-op(803, xfy, →). connect(X, Y, Result):- Result = (X → Y). if I now call connect(a,b,R) my result is...

Prolog: Cast term into string? Prolog: Cast term into string? swi-prolog string prolog Prolog Cast Result Prolog: Cast term into string? I have a Prolog program, which generates terms of this form: if I now call connect(a,b,R) my result is R = (a→b). Is their a possibility to convert terms like (a→b) into a string with...

[ 0.0306396484375, 0.0162353515625, 0.00701904296875, 0.01904296875, -0.006072998046875, 0.0042724609375, -0.0133056640625, 0.00958251953125, -0.013671875, -0.02392578125, 0.01129150390625, -0.0155029296875, -0.042236328125, 0.0106201171875, -0.021484375, -0.0006256103515625, -0.009643...

[ 1250, 4867, 32301, 13579, 3934, 79315, 2452, 3454, 502, 126684, 1528, 139392, 69407, 3173, 11782, 37067, 11, 275, 1052, 16750, 627, 2203, 23585, 207116, 96760, 1884, 28032, 64330, 4488, 50339, 145581, 12302, 2424, 39642, 254, 46576, 8562, 286...

[ 0.175048828125, 0.248291015625, 0.2218017578125, 0.273193359375, 0.158935546875, 0.259033203125, 0.1318359375, 0.1405029296875, 0.13525390625, 0.1737060546875, 0.11376953125, 0.0997314453125, 0.21923828125, 0.08990478515625, 0.10791015625, 0.1715087890625, 0.060760498046875, 0.1298...

embed

42960669_c0

42960669

prolog

0

Title: Prolog, how to read value pro function for use in other function Problem title: Prolog, how to read value pro function for use in other function Tags: prolog, function Problem: Prolog, how to read value pro function for use in other function I have this function: func1(X). After execution func1(a) return value X...

Prolog, how to read value pro function for use in other function Prolog, how to read value pro function for use in other function prolog function Prolog func1 other_func final_func Prolog, how to read value pro function for use in other function I have this function: After execution func1(a) return value X = n. This is...

[ 0.01324462890625, -0.0048828125, 0.00787353515625, 0.00775146484375, -0.00775146484375, -0.002960205078125, 0.0169677734375, -0.01165771484375, 0.01226806640625, -0.0274658203125, 0.01251220703125, 0.00946044921875, -0.0157470703125, -0.000133514404296875, 0.0233154296875, -0.005035400...

[ 1250, 4867, 3642, 12301, 34292, 502, 32354, 100, 4527, 23, 3789, 47, 7477, 418, 16498, 2704, 24372, 71924, 1830, 238, 11, 30646, 1193, 2203, 653, 17932, 169, 29568, 707, 98320, 3871, 2046, 11343 ]

[ 0.1505126953125, 0.2362060546875, 0.033050537109375, 0.2100830078125, 0.2371826171875, 0.21728515625, 0.1915283203125, 0.0182342529296875, 0.09228515625, 0.038330078125, 0.1044921875, 0.020477294921875, 0.114013671875, 0.0406494140625, 0.129638671875, 0.1300048828125, 0.0814208984375...

embed

48611847_c0

48611847

prolog

0

Title: Add following numbers to difference list in Prolog Problem title: Add following numbers to difference list in Prolog Tags: prolog Problem: Add following numbers to difference list in Prolog I created a program in Prolog which returns following powers of two starting from one: twos(N, L) :- twosH(N, 1, L). twosH(...

Add following numbers to difference list in Prolog Add following numbers to difference list in Prolog prolog Add Prolog N-1 A-B B-C A-C Add following numbers to difference list in Prolog I created a program in Prolog which returns following powers of two starting from one: I would like it to use difference list instead...

[ 0.00750732421875, 0.005584716796875, 0.006103515625, 0.0208740234375, -0.00191497802734375, 0.02978515625, -0.01519775390625, 0.036376953125, 0.017333984375, -0.031494140625, 0.01275634765625, 0.00124359130859375, 0.007293701171875, 0.025146484375, 0.004302978515625, 0.005035400390625,...

[ 29117, 25632, 101935, 47, 60212, 5303, 1250, 4867, 23, 502, 541, 5759, 62, 9, 571, 335, 441, 75935, 1528, 30646, 14537, 6626, 72134, 1295, 1632, 2806, 1884, 4527, 64457, 20324, 3714, 114689, 71, 12830, 49504, 3934 ]

[ 0.1119384765625, 0.1964111328125, 0.1934814453125, 0.0716552734375, 0.2447509765625, 0.2130126953125, 0.1754150390625, 0.265625, 0.0440673828125, 0.1331787109375, 0.05975341796875, 0.1341552734375, 0.032196044921875, 0.004058837890625, 0.0899658203125, 0.047637939453125, 0.0738525390...

embed

43482898_c0

43482898

prolog

0

Title: Prolog: How to create a program that doesn't allow for a number to be neighbour to another number Problem title: Prolog: How to create a program that doesn't allow for a number to be neighbour to another number Tags: prolog, between Problem: Prolog: How to create a program that doesn't allow for a numb...

Prolog: How to create a program that doesn't allow for a number to be neighbour to another number Prolog: How to create a program that doesn't allow for a number to be neighbour to another number prolog between Prolog How Prolog: How to create a program that doesn't allow for a number to be neighbour to anoth...

[ 0.01190185546875, 0.004791259765625, -0.0021820068359375, -0.00128173828125, -0.005889892578125, 0.019775390625, 0.00188446044921875, 0.01385498046875, 0.00933837890625, -0.031494140625, -0.02197265625, -0.01190185546875, -0.0159912109375, 0.008544921875, 0.003082275390625, 0.006408691...

[ 1250, 4867, 11249, 47, 28282, 1528, 3768, 18, 63769, 14012, 186, 108, 6958, 38648, 15700, 450, 22027, 502, 17721, 100, 3444, 33022, 27117, 24765, 116, 3789, 101935, 1284, 959, 29458, 237, 1919, 18632, 25568, 363, 80389, 190, 2499, 40494, ...

[ 0.1773681640625, 0.262451171875, 0.102294921875, 0.0689697265625, 0.1683349609375, 0.214111328125, 0.0228271484375, 0.10003662109375, 0.1302490234375, 0.1700439453125, 0.03619384765625, 0.0849609375, 0.1400146484375, 0.1707763671875, 0.052734375, 0.03009033203125, 0.046112060546875, ...

embed

23961630_c0

23961630

prolog

0

Title: Prolog List Squaring, Modifying element in List Problem title: Prolog List Squaring, Modifying element in List Tags: prolog Problem: Prolog List Squaring, Modifying element in List I am trying to write a short Prolog program which takes a list of numbers and returns a list where all numbers have been squared. Ie...

Prolog List Squaring, Modifying element in List Prolog List Squaring, Modifying element in List prolog Prolog List Squaring Modifying list_of_squares Prolog List Squaring, Modifying element in List I am trying to write a short Prolog program which takes a list of numbers and returns a list where all numbers have been s...

[ -0.00007867813110351562, 0.033203125, 0.01141357421875, -0.02099609375, 0.007110595703125, 0.00927734375, -0.0137939453125, 0.00555419921875, 0.0233154296875, -0.020751953125, 0.0152587890625, -0.00138092041015625, -0.01019287109375, -0.01409912109375, 0.0048828125, 0.00286865234375, ...

[ 1250, 4867, 32036, 159, 94727, 214, 16269, 151138, 12830, 23, 502, 5303, 4390, 108047, 31577, 33022, 16610, 1528, 51776, 101935, 30646, 756, 2809, 304, 80389, 44357, 617, 2485, 2588, 18151, 2060, 31635, 21208, 22027, 18, 1884, 163, 91, 1193...

[ 0.1763916015625, 0.246826171875, 0.2498779296875, 0.057586669921875, 0.2362060546875, 0.1234130859375, 0.1640625, 0.1053466796875, 0.1634521484375, 0.038665771484375, 0.1236572265625, 0.2042236328125, 0.103271484375, 0.220703125, 0.0634765625, 0.0654296875, 0.11279296875, 0.1311035...

embed

72321311_c1

72321311

prolog

1

|T], Cr, Index, Size, Sum):- Cr>= Size/2, Line is Size/2, Line =< Cr, Index =< Line, Index1 is Index + 1, row_sum(T, Cr, Index1, Size, S1), Sum is S1 + H. row_sum([_|T], Cr, Index, Size, Sum):- print(' Entering with no sum '), % Line is Size /2, print(' Houston?? '), Index > Size/2, print('Aaaaaa'), Index1 is Index + 1...

[ -0.01806640625, 0.009033203125, 0.03564453125, 0.003265380859375, -0.02294921875, -0.0172119140625, 0.00616455078125, 0.01611328125, 0.02099609375, 0.0211181640625, 0.0030517578125, -0.036865234375, -0.0072021484375, -0.002227783203125, 0.005523681640625, 0.0123291015625, 0.033203125...

[ 58745, 618, 268, 41802, 31471, 80378, 36335, 2077, 2740, 1369, 12477, 16777, 83, 4, 418, 997, 106, 15555, 11832, 159, 17727, 572, 28412, 357, 33558, 678, 110, 10554, 1745, 6, 122046, 4767, 284, 83151, 42, 127167, 316, 194, 77947, 4358, ...

[ 0.06622314453125, 0.1009521484375, 0.01385498046875, 0.2200927734375, 0.254150390625, 0.201416015625, 0.2060546875, 0.00909423828125, 0.0548095703125, 0.038848876953125, 0.1754150390625, 0.192138671875, 0.0478515625, 0.000457763671875, 0.05645751953125, 0.09912109375, 0.0289916992187...

embed

5168213_c0

5168213

prolog

0

Title: Downloading and installing VIP7Kernel.dll on my pc Problem title: Downloading and installing VIP7Kernel.dll on my pc Tags: dll, windows, prolog Problem: Downloading and installing VIP7Kernel.dll on my pc I have a VisualProlog program (exe executable) to run but when trying to execute the file windows (Seven in t...

Downloading and installing VIP7Kernel.dll on my pc Downloading and installing VIP7Kernel.dll on my pc dll windows prolog Downloading VIP7Kernel.dll System32 Downloading and installing VIP7Kernel.dll on my pc I have a VisualProlog program (exe executable) to run but when trying to execute the file windows (Seven in this...

[ 0.0234375, 0.01495361328125, -0.004730224609375, 0.01544189453125, 0.001739501953125, 0.0306396484375, -0.021484375, -0.00250244140625, -0.0169677734375, -0.04443359375, 0.00494384765625, 0.01507568359375, -0.025146484375, 0.011962890625, 0.00579833984375, 0.0081787109375, 0.01269531...

[ 4857, 214, 136, 20600, 33881, 966, 605, 3196, 141, 5, 71, 1181, 98, 759, 36719, 81717, 54825, 502, 4867, 12353, 6460, 87, 765, 73372, 10752, 1528, 46480, 71924, 2886, 47, 11675, 1284, 3229, 31577, 11435, 4233, 1353, 14192, 163, 450, 764...

[ 0.1212158203125, 0.03515625, 0.06646728515625, 0.149169921875, 0.25439453125, 0.225830078125, 0.0789794921875, 0.2415771484375, 0.2022705078125, 0.04437255859375, 0.079833984375, 0.190185546875, 0.0499267578125, 0.04742431640625, 0.143798828125, 0.221435546875, 0.1341552734375, 0.1...

embed

72866871_c0

72866871

prolog

0

Title: Comparing the number of nodes at a given depth in Prolog Problem title: Comparing the number of nodes at a given depth in Prolog Tags: prolog, depth, binary-tree Problem: Comparing the number of nodes at a given depth in Prolog Given two binary trees T1 and T2 having the same height, I would like to know how to ...

Comparing the number of nodes at a given depth in Prolog Comparing the number of nodes at a given depth in Prolog prolog depth binary-tree Comparing Prolog Comparing the number of nodes at a given depth in Prolog Given two binary trees T1 and T2 having the same height, I would like to know how to check if the number of...

[ 0.0238037109375, -0.00701904296875, -0.004180908203125, 0.00885009765625, 0.01348876953125, -0.01019287109375, -0.0036163330078125, -0.012939453125, -0.0013885498046875, -0.01495361328125, -0.00113677978515625, -0.02685546875, 0.01104736328125, 0.01123046875, 0.022705078125, -0.0060729...

[ 113307, 14012, 110, 988, 99, 34475, 168867, 1250, 4867, 502, 2394, 62600, 6626, 6635, 1360, 90, 384, 418, 136, 304, 5701, 155955, 3714, 12765, 2174, 105950, 34292, 391, 1653, 2063, 132887, 5021, 257, 397, 618, 541, 74481, 61924, 28, 16178...

[ 0.189208984375, 0.103759765625, 0.1737060546875, 0.16259765625, 0.02239990234375, 0.026336669921875, 0.2442626953125, 0.166748046875, 0.2330322265625, 0.1214599609375, 0.158447265625, 0.130859375, 0.02996826171875, 0.05078125, 0.166259765625, 0.01531982421875, 0.10040283203125, 0.0...

embed

26209403_c0

26209403

prolog

0

Title: Prolog find elements in the list with accumulator Problem title: Prolog find elements in the list with accumulator Tags: prolog Problem: Prolog find elements in the list with accumulator I am trying to understand accumulators, so I want this implementation to contain them. I have figured how to search through a ...

Prolog find elements in the list with accumulator Prolog find elements in the list with accumulator prolog Prolog Element Tail Prolog find elements in the list with accumulator I am trying to understand accumulators, so I want this implementation to contain them. I have figured how to search through a simple list. This...

[ -0.0064697265625, 0.0185546875, 0.003143310546875, 0.0257568359375, -0.00836181640625, 0.03125, -0.007720947265625, 0.006195068359375, 0.0004367828369140625, -0.048095703125, 0.0181884765625, -0.0303955078125, 0.013671875, 0.01806640625, 0.0169677734375, -0.0133056640625, 0.021484375...

[ 1250, 4867, 7413, 80854, 23, 5303, 678, 183278, 1290, 502, 48325, 1218, 379, 31577, 28219, 22230, 3444, 208124, 70541, 26366, 33938, 8305, 8781, 54529, 14012, 74918, 42, 69098, 34475, 12830, 3249, 4488, 8512, 71, 7 ]

[ 0.1514892578125, 0.220458984375, 0.1204833984375, 0.2197265625, 0.10430908203125, 0.19384765625, 0.111572265625, 0.244140625, 0.1702880859375, 0.10595703125, 0.1458740234375, 0.09881591796875, 0.104248046875, 0.006988525390625, 0.06463623046875, 0.1448974609375, 0.02496337890625, 0...

embed

9561031_c0

9561031

prolog

0

Title: Generating dynamic size permutations in SWI-Prolog results with ERROR: Out of global stack Problem title: Generating dynamic size permutations in SWI-Prolog results with ERROR: Out of global stack Tags: prolog, clpfd Problem: Generating dynamic size permutations in SWI-Prolog results with ERROR: Out of global st...

Generating dynamic size permutations in SWI-Prolog results with ERROR: Out of global stack Generating dynamic size permutations in SWI-Prolog results with ERROR: Out of global stack prolog clpfd Generating SWI-Prolog ERROR Out use_module Indexes Generating dynamic size permutations in SWI-Prolog results with ERROR: Out...

[ 0.00799560546875, 0.0228271484375, 0.011962890625, 0.0045166015625, -0.0081787109375, 0.0023651123046875, -0.0185546875, -0.002471923828125, 0.006683349609375, -0.05126953125, -0.005889892578125, -0.024169921875, 0.01104736328125, -0.00148773193359375, 0.025634765625, 0.003097534179687...

[ 155370, 84079, 13267, 117, 14311, 21094, 159, 38969, 10752, 4867, 50339, 151206, 24638, 13538, 111, 7964, 177261, 502, 33139, 39557, 71, 4527, 83279, 31471, 31577, 139392, 48716, 18151, 30646, 756, 3564, 150631 ]

[ 0.1356201171875, 0.1722412109375, 0.146240234375, 0.1092529296875, 0.202880859375, 0.05584716796875, 0.0626220703125, 0.227294921875, 0.1036376953125, 0.1787109375, 0.0833740234375, 0.122314453125, 0.103515625, 0.1929931640625, 0.1754150390625, 0.1864013671875, 0.2454833984375, 0.0...

embed

2441034_c0

2441034

prolog

0

Title: Prolog : Simple question Problem title: Prolog : Simple question Tags: prolog Problem: Prolog : Simple question I want to add any strings user entered into a list run :- write('How many students you have: '),read(x),nl. enterNameOfStudents(x). enterNameOfStudents(x) :- for(A, 1, x, 1),write('Please enter the nam...

Prolog : Simple question Prolog : Simple question prolog Prolog Simple How Please Prolog : Simple question I want to add any strings user entered into a list What do i put in the ?????? portion to ensure that whatever the user enter will go into a user-defined list which will be used for further processing later ? Plea...

[ 0.0167236328125, 0.01409912109375, -0.0030975341796875, 0.02490234375, -0.01416015625, 0.0244140625, 0.0087890625, 0.01324462890625, 0.0135498046875, -0.0361328125, 0.0079345703125, -0.01507568359375, -0.004852294921875, 0.01080322265625, 0.00799560546875, -0.01300048828125, 0.018920...

[ 1250, 4867, 60552, 9655, 502, 11249, 30607, 3444, 47, 15190, 2499, 79315, 7, 38937, 30957, 297, 3934, 10, 5303, 17, 3884, 23, 705, 85908, 126826, 63284, 89778, 1221, 738, 112, 5983, 11814, 9433, 4358, 37842, 183851, 41884, 114689, 71, 378...

[ 0.123291015625, 0.197509765625, 0.205078125, 0.1739501953125, 0.0789794921875, 0.0701904296875, 0.16845703125, 0.1015625, 0.008819580078125, 0.18212890625, 0.07257080078125, 0.2255859375, 0.08673095703125, 0.1580810546875, 0.1712646484375, 0.076416015625, 0.1129150390625, 0.0731811...

embed

11261926_c0

11261926

prolog

0

Title: How similar are Relational Database Languages and Logic Programming? Problem title: How similar are Relational Database Languages and Logic Programming? Tags: prolog, clojure-core.logic, relational-database, clojure Problem: How similar are Relational Database Languages and Logic Programming? What are the simila...

How similar are Relational Database Languages and Logic Programming? How similar are Relational Database Languages and Logic Programming? prolog clojure-core.logic relational-database clojure How Relational Database Languages Logic Programming core.logic clojure-core.logic How similar are Relational Database Languages ...

[ 0.0146484375, 0.0166015625, 0.0087890625, 0.01953125, -0.01055908203125, 0.0164794921875, -0.012451171875, -0.01019287109375, 0.0037384033203125, -0.0322265625, -0.001617431640625, 0.0009613037109375, -0.01055908203125, -0.0179443359375, 0.002349853515625, -0.01507568359375, -0.02087...

[ 21373, 116822, 289, 187781, 83658, 50592, 238, 27958, 214, 502, 4867, 20450, 461, 107, 30854, 137043, 41911, 10135, 37382, 11249, 56458, 136, 60212, 20531, 23755, 208124, 63399, 46876, 99247, 62775, 56037, 1940, 152028 ]

[ 0.15625, 0.2021484375, 0.130126953125, 0.2088623046875, 0.194580078125, 0.216064453125, 0.0966796875, 0.1912841796875, 0.0703125, 0.106689453125, 0.2210693359375, 0.118896484375, 0.151123046875, 0.1234130859375, 0.127685546875, 0.207763671875, 0.176025390625, 0.019805908203125, 0...

embed

34558948_c0

34558948

prolog

0

Title: make/0 functionality for SICStus Problem title: make/0 functionality for SICStus Tags: module, sicstus-prolog, prolog Problem: make/0 functionality for SICStus How can I ensure that all modules (and ideally also all other files that have been loaded or included) are up-to-date? When issuing use_module(mymodule) ...

make/0 functionality for SICStus make/0 functionality for SICStus module sicstus-prolog prolog mymodule SICStus use_module mymodule.pl make/0 functionality for SICStus How can I ensure that all modules (and ideally also all other files that have been loaded or included) are up-to-date? When issuing use_module(mymodule)...

[ -0.00567626953125, 0.0135498046875, 0.00982666015625, 0.00946044921875, -0.0079345703125, 0.0087890625, -0.005401611328125, 0.013671875, -0.0003490447998046875, -0.0439453125, -0.0098876953125, 0.004425048828125, -0.005279541015625, -0.0169677734375, 0.01953125, 0.00017261505126953125,...

[ 3249, 107838, 123309, 2481, 159, 102198, 2143, 100, 88996, 26536, 18253, 3454, 4867, 502, 759, 83279, 4527, 13, 2424, 831, 87, 63284, 450, 756, 6397, 3789, 102158, 72367, 99201, 621, 1257, 188, 17489, 1159, 1176, 69101, 129344, 5622, 11435,...

[ 0.1971435546875, 0.241455078125, 0.200927734375, 0.01788330078125, 0.1568603515625, 0.127197265625, 0.2401123046875, 0.002532958984375, 0.212158203125, 0.130615234375, 0.2098388671875, 0.07855224609375, 0.165283203125, 0.05938720703125, 0.142822265625, 0.1822509765625, 0.1357421875, ...

embed

15018251_c0

15018251

prolog

0

Title: maplist raises uncaught exception: error(existence_error(procedure,maplist/2),top_level/0) Problem title: maplist raises uncaught exception: error(existence_error(procedure,maplist/2),top_level/0) Tags: prolog, gnu-prolog Problem: maplist raises uncaught exception: error(existence_error(procedure,maplist/2),top_...

maplist raises uncaught exception: error(existence_error(procedure,maplist/2),top_level/0) maplist raises uncaught exception: error(existence_error(procedure,maplist/2),top_level/0) prolog gnu-prolog existence_error top_level GNU Prolog Daniel Diaz Copyright maplist raises uncaught exception: error(existence_error(proc...

[ 0.01031494140625, 0.0189208984375, 0.0054931640625, 0.005279541015625, -0.0201416015625, 0.014892578125, 0.01263427734375, 0.017822265625, -0.0130615234375, -0.032958984375, 0.01348876953125, -0.0020751953125, -0.005950927734375, 0.005828857421875, 0.014404296875, -0.017333984375, 0....

[ 22288, 6562, 138804, 51, 408, 46526, 131527, 18499, 116311, 188800, 232578, 62346, 12477, 13784, 67919, 107838, 502, 4867, 104155, 3454, 2663, 165132, 1250, 11555, 4512, 169, 4189, 454, 132, 25632, 11814, 43240, 23, 91, 2452, 9, 959, 706 ]

[ 0.2095947265625, 0.270751953125, 0.1473388671875, 0.0545654296875, 0.1002197265625, 0.1236572265625, 0.1922607421875, 0.143310546875, 0.1697998046875, 0.1912841796875, 0.1142578125, 0.1461181640625, 0.115234375, 0.082275390625, 0.1402587890625, 0.1123046875, 0.1329345703125, 0.2169...

embed

29446036_c0

29446036

prolog

0

Title: prolog- break a list Problem title: prolog- break a list Tags: prolog, list Problem: prolog- break a list The example is like this ?- runs([3,4,5,4,2,7,5,6,6,8,3], RunList). RunList = [[3, 4, 5], [4], [2, 7], [5, 6, 6, 8], [3]] The list need to be broken in to a number of non-decreasing sequence of consecutive n...

prolog- break a list prolog- break a list prolog list RunList runs1 prolog- break a list The example is like this The list need to be broken in to a number of non-decreasing sequence of consecutive numbers. My code is: I tried lots of methods, but still do not know how to write it... Hope someone could help me. Thanks ...

[ -0.00113677978515625, 0.0030975341796875, 0.011962890625, 0.01312255859375, -0.012939453125, 0.0179443359375, -0.007568359375, -0.006378173828125, 0.01507568359375, -0.003448486328125, 0.033447265625, 0.0299072265625, -0.0264892578125, 0.01507568359375, 0.00628662109375, 0.013610839843...

[ 502, 4867, 9, 36356, 10, 5303, 28398, 154663, 127877, 418, 27781, 1884, 903, 3871, 186, 148431, 23, 47, 14012, 351, 50718, 1283, 40, 944, 148390, 101935, 18151, 37842, 71358, 150624, 959, 3714, 3642, 33022, 442, 75359, 4358 ]

[ 0.193603515625, 0.254638671875, 0.049530029296875, 0.2467041015625, 0.09552001953125, 0.23291015625, 0.1588134765625, 0.214599609375, 0.1905517578125, 0.08721923828125, 0.1387939453125, 0.0237884521484375, 0.003124237060546875, 0.0762939453125, 0.01403045654296875, 0.1978759765625, 0...

embed

78549871_c2

78549871

prolog

2

, latex_pred, TPTP, Formula, Proof, iteration:I, P_Proof, portray_clause, buss_tex_print, term_lower_upper, L_Proof, _LaTeX_output, LOGICAL, RULES, unify_with_occurs_check, FIRST, NON-BRANCHING, Conditional, Rule_applied, r_to, Disjunction, r_lor, Conjunction, l_land, Negation, r_neg, l_neg, SECOND, BRANCHING, PROPOSIT...

[ 0.01251220703125, 0.012451171875, 0.00159454345703125, 0.007171630859375, 0.0009765625, 0.01141357421875, 0.0279541015625, -0.00872802734375, -0.00518798828125, 0.0103759765625, 0.0027618408203125, 0.01165771484375, 0.01031494140625, -0.031494140625, 0.006317138671875, 0.0087890625, ...

[ 4, 21, 24371, 19714, 18303, 23658, 72791, 1250, 4390, 720, 2320, 568, 436, 10752, 11469, 7092, 18347, 4032, 79401, 35662, 13579, 17336, 56, 34, 8079, 339, 2729, 10476, 1542, 6056, 7077, 22215, 18027, 141029, 46845, 47138, 51, 40383, 76228, ...

[ 0.061187744140625, 0.1248779296875, 0.273681640625, 0.1978759765625, 0.0968017578125, 0.2208251953125, 0.2178955078125, 0.1685791015625, 0.2249755859375, 0.202392578125, 0.0169525146484375, 0.0989990234375, 0.06011962890625, 0.181640625, 0.1268310546875, 0.151611328125, 0.06530761718...

embed

8362797_c0

8362797

prolog

0

Title: Prolog lists Error: out of global stack Problem title: Prolog lists Error: out of global stack Tags: dcg, global, list, prolog, stack Problem: Prolog lists Error: out of global stack I'm trying to write a rule in prolog adjacent(X,Y,Zs) , as true if X and Y are adjacent to each other in the list Zs . I currently...

Prolog lists Error: out of global stack Prolog lists Error: out of global stack dcg global list prolog stack Prolog Error Out Prolog lists Error: out of global stack I'm trying to write a rule in prolog adjacent(X,Y,Zs) , as true if X and Y are adjacent to each other in the list Zs . I currently have: test: Do you guys...

[ 0.006988525390625, 0.0093994140625, 0.00070953369140625, -0.0029296875, -0.01361083984375, 0.010986328125, -0.00836181640625, 0.035400390625, 0.010986328125, -0.037353515625, 0.01446533203125, -0.0098876953125, -0.0021820068359375, 0.005859375, 0.0260009765625, 0.00860595703125, 0.02...

[ 1250, 4867, 5303, 212059, 1810, 111, 7964, 177261, 7, 104, 238, 177, 502, 13538, 31577, 33022, 79986, 123594, 16797, 1542, 1723, 1511, 29568, 2174, 1193, 136, 990, 12638, 3789, 23, 567, 82424, 3034, 25647, 129745 ]

[ 0.18017578125, 0.2457275390625, 0.229248046875, 0.1915283203125, 0.2174072265625, 0.2259521484375, 0.2188720703125, 0.2412109375, 0.09600830078125, 0.0298614501953125, 0.05792236328125, 0.1251220703125, 0.1453857421875, 0.1995849609375, 0.08087158203125, 0.1033935546875, 0.1832275390...

embed

16175239_c0

16175239

prolog

0

Title: Finding root of file and read in Prolog Problem title: Finding root of file and read in Prolog Tags: prolog Problem: Finding root of file and read in Prolog I need to read a file into database in prolog with code below: open('C:/Files/text.txt', read, S) it read perfectly but i have to use my pl into another com...

Finding root of file and read in Prolog Finding root of file and read in Prolog prolog Finding Prolog Files text.txt Finding root of file and read in Prolog I need to read a file into database in prolog with code below: it read perfectly but i have to use my pl into another computer and directory can be different for e...

[ 0.0263671875, -0.00958251953125, 0.0216064453125, 0.01708984375, -0.01031494140625, 0.004852294921875, 0.01409912109375, -0.0087890625, 0.0017852783203125, -0.076171875, 0.006439208984375, 0.029052734375, -0.01611328125, -0.00726318359375, 0.0218505859375, -0.032470703125, 0.00376892...

[ 26040, 74855, 111, 11435, 12301, 23, 1250, 4867, 214, 136, 502, 42724, 7986, 124326, 3871, 3934, 63399, 18151, 35064, 169123, 4527, 6456, 15700, 13909, 14364, 12921, 15549, 9803, 759, 174350, 22829, 35782, 26785, 1830, 5701, 78303, 26866 ]

[ 0.114501953125, 0.2431640625, 0.181396484375, 0.1351318359375, 0.165283203125, 0.042816162109375, 0.191162109375, 0.2432861328125, 0.0255584716796875, 0.041229248046875, 0.130859375, 0.142578125, 0.176025390625, 0.227783203125, 0.0205230712890625, 0.0584716796875, 0.10748291015625, ...

embed

65272973_c0

65272973

prolog

0

Title: How to do only 2 recursive calls in Prolog? Problem title: How to do only 2 recursive calls in Prolog? Tags: predicate, prolog, recursion Problem: How to do only 2 recursive calls in Prolog? isTallerThan2(X,Y) :- tallerThan(X,Y). isTallerThan2(X,Y) :- tallerThan(X,Z), isTallerThan2(Z,Y). Where I want to find whe...

How to do only 2 recursive calls in Prolog? How to do only 2 recursive calls in Prolog? predicate prolog recursion How Prolog isTallerThan2 How to do only 2 recursive calls in Prolog? Where I want to find where someone is taller than 2 people. If I have lots of relations where person X is taller than person Y like this...

[ 0.01177978515625, 0.000888824462890625, 0.01019287109375, 0.0220947265625, 0.003387451171875, 0.019775390625, -0.015869140625, -0.0093994140625, 0.01470947265625, -0.02734375, 0.0267333984375, -0.0181884765625, -0.00086212158203125, 0.004180908203125, 0.0341796875, -0.0120849609375, ...

[ 11249, 47, 54, 4734, 116, 195625, 5844, 11782, 7, 23, 1250, 4867, 1653, 2063, 502, 1830, 83, 618, 67665, 1121, 304, 78662, 3444, 7413, 7440, 22008, 49518, 3501, 3395, 71358, 91582, 3445, 1193, 990, 903, 1542, 1723, 876, 501, 756, 1284, ...

[ 0.07220458984375, 0.0273284912109375, 0.049713134765625, 0.1671142578125, 0.2100830078125, 0.2255859375, 0.155517578125, 0.211669921875, 0.0816650390625, 0.059326171875, 0.1856689453125, 0.28564453125, 0.0906982421875, 0.1287841796875, 0.1456298828125, 0.03326416015625, 0.07934570312...

embed

42938360_c0

42938360

prolog

0

Title: How to make a predcate which validates the values from one list to another in Prolog? Problem title: How to make a predcate which validates the values from one list to another in Prolog? Tags: list, prolog Problem: How to make a predcate which validates the values from one list to another in Prolog? I have 2 lis...

How to make a predcate which validates the values from one list to another in Prolog? How to make a predcate which validates the values from one list to another in Prolog? list prolog one How Prolog How to make a predcate which validates the values from one list to another in Prolog? I have 2 lists (A and B). I want to...

[ -0.0009918212890625, -0.00080108642578125, 0.004058837890625, 0.028076171875, -0.00439453125, 0.02197265625, -0.0030364990234375, 0.003631591796875, 0.012939453125, 0.0081787109375, 0.01055908203125, 0.01263427734375, 0.0274658203125, 0.01129150390625, -0.0089111328125, -0.010925292968...

[ 11249, 3249, 10, 1653, 33478, 44622, 1636, 142424, 1295, 1632, 5303, 47, 15700, 1250, 4867, 3129, 502, 23, 116, 284, 335, 4527, 12765, 2174, 62, 9969, 25720, 5443, 82825, 29568, 106, 136, 17262, 304, 98320, 13695, 12989 ]

[ 0.0865478515625, 0.1199951171875, 0.072998046875, 0.2388916015625, 0.2607421875, 0.2357177734375, 0.0709228515625, 0.1572265625, 0.10791015625, 0.09820556640625, 0.1788330078125, 0.10638427734375, 0.0699462890625, 0.18505859375, 0.2330322265625, 0.0203704833984375, 0.1353759765625, ...

embed

14638034_c0

14638034

prolog

0

Title: How do you save all possible solutions in SWI-Prolog? Problem title: How do you save all possible solutions in SWI-Prolog? Tags: prolog Problem: How do you save all possible solutions in SWI-Prolog? I have this predicate that has about a thousand possibilities and I need all possibilities as an output. It is not...

How do you save all possible solutions in SWI-Prolog? How do you save all possible solutions in SWI-Prolog? prolog How SWI-Prolog Fo2 How do you save all possible solutions in SWI-Prolog? I have this predicate that has about a thousand possibilities and I need all possibilities as an output. It is not possible to simpl...

[ 0.02685546875, 0.010009765625, 0.0223388671875, 0.0196533203125, -0.02099609375, 0.01202392578125, 0.00006866455078125, 0.0004062652587890625, 0.01318359375, -0.026611328125, 0.004852294921875, 0.00543212890625, -0.00022983551025390625, -0.0179443359375, 0.009033203125, 0.0115966796875...

[ 11249, 30098, 756, 7722, 51347, 23, 159, 38969, 9, 10752, 4867, 502, 9572, 304, 54, 398, 1653, 2063, 67, 199823, 97370, 3871, 237, 140992, 43658, 71099, 145870, 2449, 3773, 831, 4734, 192046, 1257, 221, 5045, 3917, 16750, 11435 ]

[ 0.08837890625, 0.2049560546875, 0.158203125, 0.202880859375, 0.23486328125, 0.0684814453125, 0.09033203125, 0.23974609375, 0.04254150390625, 0.16650390625, 0.238037109375, 0.1287841796875, 0.141845703125, 0.1337890625, 0.0268096923828125, 0.011138916015625, 0.06304931640625, 0.0823...

embed

27913479_c0

27913479

prolog

0

Title: Asterisks Triangle in prolog Problem title: Asterisks Triangle in prolog Tags: prolog Problem: Asterisks Triangle in prolog I have to define the prolog pyramid(N) that prints out a pyramid of asterisks of given height as in the following example. pyramid(4). * *** ***** ******* true this is what i have done so f...

Asterisks Triangle in prolog Asterisks Triangle in prolog prolog Asterisks Triangle Asterisks Triangle in prolog I have to define the prolog pyramid(N) that prints out a pyramid of asterisks of given height as in the following example. this is what i have done so far... I can't find the way to print out the rest of sta...

[ 0.0111083984375, 0.002685546875, -0.01080322265625, -0.007476806640625, 0.001495361328125, 0.0079345703125, -0.005645751953125, 0.000919342041015625, -0.00927734375, -0.00958251953125, 0.006378173828125, -0.017822265625, -0.0137939453125, 0.0118408203125, -0.0164794921875, 0.0150756835...

[ 65473, 57786, 7, 4699, 109217, 23, 502, 4867, 61924, 242810, 839, 28412, 1810, 10, 1515, 6581, 155955, 27781, 2060, 3917, 10588, 6057, 44841, 12638, 124519, 8060, 1653, 2063, 34831, 1614, 17365, 1528, 165523 ]

[ 0.133056640625, 0.23779296875, 0.009490966796875, 0.201904296875, 0.2152099609375, 0.0318603515625, 0.17431640625, 0.2430419921875, 0.157470703125, 0.23779296875, 0.1170654296875, 0.1431884765625, 0.0777587890625, 0.0087890625, 0.1263427734375, 0.1650390625, 0.153564453125, 0.05282...

embed

6347091_c0

6347091

prolog

0

Title: Parse Variables Using DCG Problem title: Parse Variables Using DCG Tags: dcg, grammar, prolog Problem: Parse Variables Using DCG I am having trouble parsing sequences that begin with capital letters into variables using Prolog's DCG notation. For instance, if I have the string f a X y Z X and a DCG that parses t...

Parse Variables Using DCG Parse Variables Using DCG dcg grammar prolog Parse Variables Using DCG Head Args Parse Variables Using DCG I am having trouble parsing sequences that begin with capital letters into variables using Prolog's DCG notation. For instance, if I have the string and a DCG that parses this string, is ...

[ 0.00823974609375, -0.0037689208984375, -0.027587890625, 0.0277099609375, 0.01055908203125, 0.0255126953125, -0.0017852783203125, -0.008544921875, 0.0086669921875, -0.0260009765625, -0.01385498046875, -0.0262451171875, -0.01519775390625, 0.01318359375, 0.01055908203125, 0.0203857421875,...

[ 2392, 184, 111477, 13566, 345, 6953, 391, 56367, 104, 238, 177, 122092, 147, 502, 4867, 44816, 1172, 9405, 63134, 366, 40, 26513, 9842, 678, 10323, 120820, 3934, 77336, 1250, 110, 22062, 79315, 5908, 903, 2499, 3917, 12638, 31330, 36998, ...

[ 0.1591796875, 0.1129150390625, 0.21826171875, 0.1243896484375, 0.088623046875, 0.0601806640625, 0.126708984375, 0.2359619140625, 0.046112060546875, 0.0401611328125, 0.1070556640625, 0.0765380859375, 0.0400390625, 0.09063720703125, 0.2255859375, 0.0916748046875, 0.093017578125, 0.05...

embed

63882436_c0

63882436

prolog

0

Title: Prolog sum distance between list of nodes ids Problem title: Prolog sum distance between list of nodes ids Tags: prolog, instantiation-error Problem: Prolog sum distance between list of nodes ids node(1,22,44). node(2,43,53). node(3,23,12). distancePath([X,Y],D) :- distance(X,Y,D). distancePath([H,X|T],Distance)...

Prolog sum distance between list of nodes ids Prolog sum distance between list of nodes ids prolog instantiation-error Prolog Id1 Id2 X2-X1 Y2-Y1 Distance Rest Aux Prolog sum distance between list of nodes ids I have some kind of problem on the distancePath because when i run distancePath([1,2,3],Distance). it give me ...

[ 0.0140380859375, -0.004608154296875, 0.00860595703125, 0.00958251953125, -0.0003910064697265625, 0.005340576171875, -0.016357421875, 0.01190185546875, 0.00157928466796875, -0.05859375, 0.0126953125, -0.00958251953125, -0.002166748046875, -0.004486083984375, -0.000911712646484375, 0.001...

[ 1250, 4867, 10554, 62488, 17721, 5303, 110, 988, 3447, 502, 34648, 14, 188800, 24799, 418, 304, 1193, 18504, 990, 1723, 154349, 49756, 6077, 8562, 111, 2967, 683, 10519, 11675, 133063, 96386, 14055, 116071, 4153, 4384, 118, 2320, 18499, 23,...

[ 0.1455078125, 0.2264404296875, 0.178466796875, 0.20263671875, 0.10888671875, 0.10443115234375, 0.1441650390625, 0.13037109375, 0.1121826171875, 0.118896484375, 0.1317138671875, 0.09765625, 0.162353515625, 0.081787109375, 0.018402099609375, 0.05682373046875, 0.023895263671875, 0.076...

embed

27263630_c0

27263630

prolog

0

Title: Prolog program to reverse and append the list Problem title: Prolog program to reverse and append the list Tags: prolog Problem: Prolog program to reverse and append the list I am new to prolog. I am trying to reverse the order of list and append them. For example : revappend([1,2], [3,4], X) Should give me resu...

Prolog program to reverse and append the list Prolog program to reverse and append the list prolog Prolog List InputListB Head InputListA OutputList Prolog program to reverse and append the list I am new to prolog. I am trying to reverse the order of list and append them. For example : revappend([1,2], [3,4], X) Should...

[ -0.0076904296875, 0.030029296875, 0.024658203125, 0.0035247802734375, -0.0194091796875, 0.029541015625, 0.01104736328125, 0.031494140625, 0.0245361328125, -0.00927734375, 0.033203125, -0.002471923828125, -0.01251220703125, 0.0137939453125, -0.002166748046875, -0.0022125244140625, 0.0...

[ 1250, 4867, 1528, 47, 39531, 184, 136, 114689, 71, 70, 5303, 502, 32036, 360, 7077, 154663, 571, 44816, 284, 13538, 3525, 31577, 12989, 111, 2856, 27781, 37868, 9007, 3611, 132, 133063, 82449, 1193, 151117, 8337, 16750, 1884, 18151, 54397, ...

[ 0.1798095703125, 0.268798828125, 0.1998291015625, 0.03955078125, 0.2362060546875, 0.19775390625, 0.1009521484375, 0.178955078125, 0.148193359375, 0.0286407470703125, 0.23095703125, 0.135009765625, 0.1461181640625, 0.050567626953125, 0.042633056640625, 0.1588134765625, 0.085693359375,...

embed

38075681_c0

38075681

prolog

0

Title: How would I create the database for this scenario in Prolog? Problem title: How would I create the database for this scenario in Prolog? Tags: prolog, database Problem: How would I create the database for this scenario in Prolog? The first image is an image of a symantic net diagram and is an image of a scenario...

How would I create the database for this scenario in Prolog? How would I create the database for this scenario in Prolog? prolog database How Prolog How would I create the database for this scenario in Prolog? The first image is an image of a symantic net diagram and is an image of a scenario from my college assignment...

[ 0.033203125, 0.016845703125, -0.004730224609375, 0.0380859375, -0.01483154296875, 0.0225830078125, 0.006011962890625, -0.00173187255859375, -0.0081787109375, -0.0301513671875, 0.024658203125, 0.00408935546875, -0.007568359375, -0.0006561279296875, 0.00112152099609375, -0.01220703125, ...

[ 11249, 2806, 87, 28282, 70, 63399, 100, 903, 106117, 23, 1250, 4867, 502, 5117, 29569, 83, 954, 39, 109109, 2043, 117233, 759, 40466, 95486, 149016, 35672, 19048, 4358, 31577, 30022, 1528, 17, 19441, 63134, 129745, 3293, 37842, 2060, 69407 ...

[ 0.1082763671875, 0.1044921875, 0.040679931640625, 0.1790771484375, 0.0947265625, 0.283447265625, 0.09423828125, 0.10986328125, 0.2203369140625, 0.08837890625, 0.1729736328125, 0.2430419921875, 0.140869140625, 0.04742431640625, 0.14697265625, 0.020111083984375, 0.01495361328125, 0.0...

embed

64783983_c0

64783983

prolog

0

Title: How to pass list's values one by one in another predicate prolog Problem title: How to pass list's values one by one in another predicate prolog Tags: prolog Problem: How to pass list's values one by one in another predicate prolog This is my prologdb file trip_to_nation(X,Y,T):- % X is a city ,T is a ...

How to pass list's values one by one in another predicate prolog How to pass list's values one by one in another predicate prolog prolog How trip_to_nation list_airport all_trip How to pass list's values one by one in another predicate prolog This is my prologdb file I want to pass the list's value one by one...

[ 0.0167236328125, -0.003265380859375, -0.00142669677734375, 0.025390625, -0.0216064453125, 0.0111083984375, 0.01123046875, 0.00738525390625, 0.02685546875, -0.03466796875, 0.013427734375, 0.0206298828125, -0.010986328125, 0.01007080078125, -0.00897216796875, 0.0084228515625, 0.0217285...

[ 11249, 47, 27875, 5303, 3768, 142424, 1632, 390, 15700, 1653, 2063, 502, 4867, 24745, 188, 19, 7341, 6982, 756, 59623, 67, 48073, 11435, 3444, 34292, 2046, 2053, 7722, 2389, 6562, 25256 ]

[ 0.086181640625, 0.03167724609375, 0.1710205078125, 0.2578125, 0.0748291015625, 0.1851806640625, 0.1202392578125, 0.1151123046875, 0.0860595703125, 0.122802734375, 0.1871337890625, 0.1658935546875, 0.2120361328125, 0.193115234375, 0.1563720703125, 0.05108642578125, 0.0672607421875, ...

embed

60659698_c0

60659698

prolog

0

Title: Prolog - Manipulating the same list for several times Problem title: Prolog - Manipulating the same list for several times Tags: prolog, immutability Problem: Prolog - Manipulating the same list for several times I am new to Prolog and trying to modify a list by deleting elements by indices. For example: remove(...

Prolog - Manipulating the same list for several times Prolog - Manipulating the same list for several times prolog immutability Prolog Manipulating Prolog - Manipulating the same list for several times I am new to Prolog and trying to modify a list by deleting elements by indices. For example: However, when I try to ru...

[ 0.00543212890625, 0.01953125, 0.00689697265625, 0.005218505859375, -0.0177001953125, -0.02099609375, -0.01409912109375, 0.0185546875, 0.0234375, -0.020751953125, 0.0126953125, 0.01031494140625, -0.004119873046875, 0.005950927734375, 0.01153564453125, 0.0169677734375, 0.0208740234375,...

[ 1250, 4867, 221169, 26518, 5701, 5303, 100, 40368, 20028, 502, 566, 14311, 41159, 3525, 31577, 2811, 40383, 24674, 80854, 136044, 3229, 9790, 11675, 903, 1653, 2063, 13438, 70, 9325, 237, 68252, 155761, 5351, 442, 45767, 29479, 297, 23, 295...

[ 0.19384765625, 0.260009765625, 0.2396240234375, 0.100341796875, 0.1490478515625, 0.186279296875, 0.07635498046875, 0.1683349609375, 0.2113037109375, 0.1439208984375, 0.050445556640625, 0.180419921875, 0.0906982421875, 0.050506591796875, 0.05621337890625, 0.13232421875, 0.090942382812...

embed

35026596_c0

35026596

prolog

0

Title: Solving Kakuro puzzle (5x5) in Prolog Problem title: Solving Kakuro puzzle (5x5) in Prolog Tags: clpfd, prolog Problem: Solving Kakuro puzzle (5x5) in Prolog Assuming that: A+B+C=24 E+F+G=11 J+K+L=22 N+O+P=14 A+E=17 B+F+J+N=26 C+G+K+O=15 L+P=13 How could i find a possible solution to the problem, given the const...

Solving Kakuro puzzle (5x5) in Prolog Solving Kakuro puzzle (5x5) in Prolog clpfd prolog Solving Kakuro Prolog B-C F-J-N G-K-O F-G K-L O-P Solving Kakuro puzzle (5x5) in Prolog Assuming that: How could i find a possible solution to the problem, given the constraints above, using the predicate solve/1 ? My first attempt...

[ 0.0022735595703125, 0.0101318359375, 0.00537109375, -0.0028839111328125, -0.0162353515625, -0.0169677734375, -0.034912109375, 0.0146484375, -0.0029754638671875, -0.0042724609375, 0.009521484375, -0.0166015625, 0.004608154296875, 0.021240234375, 0.01397705078125, 0.0078125, 0.00253295...

[ 6678, 6496, 40497, 11951, 104192, 11516, 425, 43317, 23, 1250, 4867, 71, 502, 335, 9, 441, 563, 1375, 839, 605, 724, 341, 866, 180, 683, 66596, 11249, 5809, 7413, 7722, 29806, 47, 2967, 2816, 17368, 1653, 2063, 67, 86869, 11583, 5117, ...

[ 0.1219482421875, 0.0882568359375, 0.173828125, 0.303955078125, 0.1875, 0.117431640625, 0.1240234375, 0.190185546875, 0.0421142578125, 0.1427001953125, 0.2037353515625, 0.0188140869140625, 0.06884765625, 0.053985595703125, 0.0269622802734375, 0.019439697265625, 0.0183868408203125, 0...

embed