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
7872634_c0	7872634	prolog	0	Title: go/0 Undefined procedure save/1 Problem title: go/0 Undefined procedure save/1 Tags: prolog, swi-prolog Problem: go/0 Undefined procedure save/1 swi-prolog 5.10.2 I have typed this prolog program in. However, when I run option a I get the following error. go/0 Undefined Procedure save/1 I am sure that save is a ...	go/0 Undefined procedure save/1 go/0 Undefined procedure save/1 prolog swi-prolog list Undefined Procedure What Shopping go:-reconsult chap7 shopping.pl See Add Delete Choice Rules Enter Item Incorrect go/0 Undefined procedure save/1 swi-prolog 5.10.2 I have typed this prolog program in. However, when I run option a I ...	[ 0.0269775390625, 0.015380859375, 0.02587890625, -0.00421142578125, -0.0125732421875, 0.009765625, -0.0054931640625, 0.0106201171875, 0.01422119140625, -0.00787353515625, 0.0004367828369140625, 0.012451171875, -0.01531982421875, -0.0031585693359375, 0.01513671875, -0.00848388671875, 0...	[ 738, 107838, 79912, 5983, 297, 50491, 30098, 11583, 502, 4867, 91, 2452, 3454, 5303, 170470, 4865, 80298, 107, 147834, 107076, 966, 33652, 2424, 29117, 262, 46485, 181948, 139118, 60816, 78426, 32399, 68433, 133684, 10644, 71, 903, 1528, 23, ...	[ 0.140869140625, 0.166015625, 0.1092529296875, 0.207763671875, 0.0166473388671875, 0.2066650390625, 0.252685546875, 0.1051025390625, 0.1868896484375, 0.2493896484375, 0.038665771484375, 0.216064453125, 0.1673583984375, 0.1209716796875, 0.1839599609375, 0.0098876953125, 0.2000732421875...	embed
42655384_c0	42655384	prolog	0	Title: Evaluating s(N) within a predicate's response, without losing functionality Problem title: Evaluating s(N) within a predicate's response, without losing functionality Tags: prolog, list, clpfd, successor-arithmetics Problem: Evaluating s(N) within a predicate's response, without losing functionality I'...	Evaluating s(N) within a predicate's response, without losing functionality Evaluating s(N) within a predicate's response, without losing functionality prolog list clpfd successor-arithmetics Evaluating Evaluating s(N) within a predicate's response, without losing functionality I'm learning Prolog. I was expe...	[ -0.00604248046875, 0.01129150390625, -0.0009307861328125, -0.006744384765625, 0.0076904296875, 0.00872802734375, 0.0216064453125, -0.009033203125, -0.0037689208984375, -0.037841796875, 0.0111083984375, 0.01556396484375, -0.03466796875, -0.0050048828125, 0.025390625, -0.0013427734375, ...	[ 151228, 1916, 91, 132, 839, 28032, 1653, 2063, 67, 3768, 57553, 15490, 388, 123309, 502, 4867, 5303, 39557, 71, 39457, 8962, 52080, 1250, 28007, 88, 195, 4711, 3173, 62766, 63262, 206808, 133063, 363, 128188, 34648, 10588, 50256, 41, 1294, ...	[ 0.218994140625, 0.0411376953125, 0.1810302734375, 0.038970947265625, 0.1602783203125, 0.1419677734375, 0.1396484375, 0.1822509765625, 0.04376220703125, 0.049530029296875, 0.2017822265625, 0.059539794921875, 0.031829833984375, 0.1409912109375, 0.095458984375, 0.1988525390625, 0.120605...	embed
78212261_c0	78212261	prolog	0	Title: order of conditions in antecedent causes stackoverflow Problem title: order of conditions in antecedent causes stackoverflow Tags: prolog Problem: order of conditions in antecedent causes stackoverflow As a simple exercise, I wrote my own permutation. This stack overflows: without(_, [], []). without(A, [A\|T], T...	order of conditions in antecedent causes stackoverflow order of conditions in antecedent causes stackoverflow prolog my_permutation order of conditions in antecedent causes stackoverflow As a simple exercise, I wrote my own permutation. This stack overflows: this works partly, but still stack overflows after giving som...	[ -0.00113677978515625, 0.01495361328125, -0.0027008056640625, -0.0027008056640625, -0.0146484375, -0.021484375, -0.0186767578125, 0.005126953125, 0.00750732421875, -0.051025390625, 0.0177001953125, 0.00119781494140625, 0.016845703125, 0.0155029296875, 0.00946044921875, 0.01043701171875,...	[ 12989, 111, 27289, 23, 177047, 660, 113660, 177261, 5465, 118664, 502, 4867, 759, 1264, 561, 22062, 8781, 81979, 54397, 10002, 117, 645, 903, 43240, 2831, 1284, 7464, 7103, 68772, 3060, 29806, 32628, 169123, 28219, 15400 ]	[ 0.201416015625, 0.0731201171875, 0.225830078125, 0.0760498046875, 0.1864013671875, 0.09271240234375, 0.15234375, 0.156982421875, 0.121337890625, 0.20361328125, 0.0926513671875, 0.1239013671875, 0.0999755859375, 0.079345703125, 0.169921875, 0.0814208984375, 0.0221405029296875, 0.052...	embed
66968575_c0	66968575	prolog	0	Title: Prolog: decompose number into its digits Problem title: Prolog: decompose number into its digits Tags: prolog Problem: Prolog: decompose number into its digits I am studying prolog and I am faced with a problem that I cannot deal with. Given a number, I have to check if the sum of the factorial of each digit tha...	Prolog: decompose number into its digits Prolog: decompose number into its digits prolog Prolog _ListNumber ListNumber Sum Number Number1 Counter Counter1 Prolog: decompose number into its digits I am studying prolog and I am faced with a problem that I cannot deal with. Given a number, I have to check if the sum of th...	[ 0.00168609619140625, -0.01202392578125, 0.01446533203125, 0.0247802734375, -0.0113525390625, 0.01251220703125, 0.0004730224609375, 0.01708984375, 0.011962890625, -0.0162353515625, -0.007476806640625, -0.00408935546875, -0.0203857421875, 0.005340576171875, -0.01226806640625, 0.006988525...	[ 1250, 4867, 8, 277, 78381, 14012, 3934, 6863, 153939, 502, 154663, 18444, 26278, 32036, 36335, 103332, 418, 197956, 35187, 2577, 2967, 53418, 35142, 77878, 12765, 2174, 10554, 31461, 15403, 12638, 150350, 105950, 68034, 89536, 3642, 831, 31, ...	[ 0.15234375, 0.2279052734375, 0.1868896484375, 0.162841796875, 0.1260986328125, 0.1859130859375, 0.1513671875, 0.07879638671875, 0.1907958984375, 0.1136474609375, 0.08673095703125, 0.1490478515625, 0.0701904296875, 0.110107421875, 0.1761474609375, 0.1251220703125, 0.0465087890625, 0...	embed
53602958_c0	53602958	prolog	0	Title: Changing the number of parameters and unifying Problem title: Changing the number of parameters and unifying Tags: prolog Problem: Changing the number of parameters and unifying I'm having a problem with getting the right output. I get my result as you can see in the trace. But i cant figure out hot to stop it a...	Changing the number of parameters and unifying Changing the number of parameters and unifying prolog Changing Call _1804 Exit _2052 _2064 _2088 _2094 Fail Changing the number of parameters and unifying I'm having a problem with getting the right output. I get my result as you can see in the trace. But i cant figure out...	[ 0.00799560546875, 0.00506591796875, -0.002532958984375, -0.0164794921875, 0.01397705078125, -0.01544189453125, -0.01519775390625, 0.01239013671875, 0.01708984375, -0.0234375, 0.00689697265625, 0.004638671875, -0.007354736328125, 0.0086669921875, 0.0036163330078125, 0.010986328125, 0....	[ 108193, 14012, 171859, 136, 51, 151138, 7, 502, 4867, 26265, 1819, 7709, 5443, 12744, 13307, 12772, 14889, 190355, 2967, 20949, 7108, 140992, 2046, 16750, 1957, 144851, 45767, 26366, 8010, 47, 7279, 442, 24233, 6275, 5, 5608, 74481, 26168, ...	[ 0.1988525390625, 0.0863037109375, 0.2481689453125, 0.044189453125, 0.1575927734375, 0.2005615234375, 0.005615234375, 0.1326904296875, 0.1942138671875, 0.1668701171875, 0.0274658203125, 0.12890625, 0.032745361328125, 0.107421875, 0.0814208984375, 0.1220703125, 0.06768798828125, 0.12...	embed
26483806_c0	26483806	prolog	0	Title: Prolog's detecting change in list Problem title: Prolog's detecting change in list Tags: prolog Problem: Prolog's detecting change in list I would like to write a predicate find_difference([A\|B],[P\|Q],[C-D\|E-F]) to find the difference between the list [A\|B] and [P\|Q] , and give the result like [C-D\|E-F...	Prolog's detecting change in list Prolog's detecting change in list prolog Prolog find_difference C-D E-F Prolog's detecting change in list I would like to write a predicate find_difference([A\|B],[P\|Q],[C-D\|E-F]) to find the difference between the list [A\|B] and [P\|Q] , and give the result like [C-D\|E-F] , C ...	[ 0.0014190673828125, 0.0126953125, -0.00142669677734375, 0.01708984375, -0.004302978515625, 0.0262451171875, -0.019287109375, 0.0084228515625, 0.008544921875, 0.0150146484375, 0.005096435546875, 0.00885009765625, 0.00074005126953125, 0.017333984375, 0.005523681640625, 0.002532958984375,...	[ 1250, 4867, 3768, 96391, 214, 15549, 23, 5303, 502, 7413, 428, 18234, 313, 9, 397, 241, 919, 1884, 33022, 1653, 2063, 67, 6620, 58745, 571, 683, 2737, 60212, 17721, 16750, 117414, 53383, 541, 927, 1614, 6562, 12960, 391, 14192, 12830, 1...	[ 0.1727294921875, 0.2403564453125, 0.036773681640625, 0.1895751953125, 0.06048583984375, 0.205810546875, 0.07379150390625, 0.1947021484375, 0.1322021484375, 0.172607421875, 0.1199951171875, 0.195556640625, 0.1064453125, 0.0865478515625, 0.1495361328125, 0.09295654296875, 0.18322753906...	embed
58886711_c0	58886711	prolog	0	Title: How to set mutually exclusive probabilities in Problog? Problem title: How to set mutually exclusive probabilities in Problog? Tags: prolog, probability, logic Problem: How to set mutually exclusive probabilities in Problog? A person X can either be inpatient or outpatient . Given the fact location(X,outpatient)...	How to set mutually exclusive probabilities in Problog? How to set mutually exclusive probabilities in Problog? prolog probability logic How Problog P::location How to set mutually exclusive probabilities in Problog? A person X can either be inpatient or outpatient . Given the fact location(X,outpatient) how can Problo...	[ 0.006561279296875, -0.0081787109375, 0.01214599609375, -0.005462646484375, -0.01519775390625, 0.0230712890625, 0.0201416015625, 0.004058837890625, 0.0223388671875, -0.0220947265625, 0.006256103515625, 0.0133056640625, 0.000148773193359375, -0.016357421875, 0.013427734375, 0.00842285156...	[ 11249, 5423, 199849, 538, 97629, 37242, 31075, 23, 1250, 9883, 502, 4867, 2481, 62775, 436, 87632, 3445, 1193, 831, 40101, 186, 170250, 707, 1810, 15824, 31913, 1542, 6056, 3642, 53498, 73, 83, 757, 3444, 5609, 21543, 1556, 45234, 33022, ...	[ 0.087890625, 0.1737060546875, 0.1326904296875, 0.067138671875, 0.218505859375, 0.2529296875, 0.1722412109375, 0.1109619140625, 0.183349609375, 0.232177734375, 0.1336669921875, 0.2091064453125, 0.185546875, 0.11962890625, 0.1005859375, 0.1993408203125, 0.08502197265625, 0.0736694335...	embed
55772281_c0	55772281	prolog	0	Title: Finding whether a number is a multiple of another Problem title: Finding whether a number is a multiple of another Tags: successor-arithmetics, prolog, failure-slice Problem: Finding whether a number is a multiple of another Looking at the code below: multiple(X,0). multiple(X,Y) :- lt(0,X), lt(0,Y), diff(Y,X,D)...	Finding whether a number is a multiple of another Finding whether a number is a multiple of another successor-arithmetics prolog failure-slice Finding Finding whether a number is a multiple of another Looking at the code below: There happens to be something wrong. For your reference: lt/2 is whether the first argument ...	[ -0.01300048828125, 0.015869140625, 0.01544189453125, 0.0135498046875, 0.0076904296875, 0.01434326171875, 0.00830078125, -0.0091552734375, 0.032958984375, -0.024169921875, 0.00106048583984375, -0.021240234375, -0.0177001953125, -0.0019378662109375, 0.0179443359375, 0.01507568359375, 0...	[ 26040, 214, 36766, 14012, 83, 48716, 111, 15700, 10, 39457, 42, 8962, 41637, 502, 4867, 137578, 13348, 18151, 96276, 44691, 91067, 96, 18, 12477, 5117, 10750, 40715, 3501, 17932, 71337, 18113, 50960, 105950, 47, 26948, 61924, 26785, 62775, ...	[ 0.1317138671875, 0.0148162841796875, 0.178955078125, 0.1915283203125, 0.095458984375, 0.28515625, 0.14501953125, 0.143310546875, 0.009002685546875, 0.1995849609375, 0.05169677734375, 0.041534423828125, 0.00823974609375, 0.06451416015625, 0.1033935546875, 0.1820068359375, 0.0887451171...	embed
15555484_c1	15555484	prolog	1	consulted I want to return the following statistics to the user: attack(?), speed(?), defence(?). I was hoping to use an equation to work out the "?" areas of my program, to which the following equation would be used "(base_stat + level) * stat_bonus". So something like this:- compute(attribute) :- stat_bonus(stat bon...	consulted I want to return the following statistics to the user: attack(?), speed(?), defence(?). I was hoping to use an equation to work out the "?" areas of my program, to which the following equation would be used "(base_stat + level) * stat_bonus". So something like this:- compute(attribute) :- stat_bonus(stat bon...	[ 0.004486083984375, 0.004119873046875, -0.00921630859375, -0.001312255859375, -0.0224609375, 0.02685546875, 0.01092529296875, -0.017333984375, 0.009521484375, -0.0301513671875, -0.0032501220703125, -0.007232666015625, 0.00653076171875, 0.025390625, 0.001708984375, -0.0016326904296875, ...	[ 147008, 3444, 30646, 25632, 80835, 7, 47, 38937, 52875, 38352, 8, 6211, 156377, 4527, 5490, 2320, 4488, 1810, 2953, 58555, 1528, 11814, 37382, 17346, 997, 17366, 13254, 84686, 1884, 9969, 6743, 191145, 9396, 49129, 110, 56065, 27781, 257, 9...	[ 0.109375, 0.09820556640625, 0.1453857421875, 0.055389404296875, 0.224609375, 0.087158203125, 0.01959228515625, 0.12744140625, 0.1380615234375, 0.142578125, 0.0350341796875, 0.09521484375, 0.08319091796875, 0.031494140625, 0.1407470703125, 0.060546875, 0.025634765625, 0.040313720703...	embed
21226657_c0	21226657	prolog	0	Title: Prolog: find a supplier who supply all parts Problem title: Prolog: find a supplier who supply all parts Tags: prolog Problem: Prolog: find a supplier who supply all parts I'm new to Prolog. These are my facts. part_cost(Part, Supplier) part_cost(top_tube ,cinelli). part_cost(top_tube ,columbus). part_cost(down_...	Prolog: find a supplier who supply all parts Prolog: find a supplier who supply all parts prolog Prolog part_cost top_tube down_tube head_tube seat_mast Supplier Part PartRest Prolog: find a supplier who supply all parts I'm new to Prolog. These are my facts. part_cost(Part, Supplier) I want to find a supplier who supp...	[ 0.01806640625, 0.00579833984375, -0.00494384765625, 0.0208740234375, -0.0181884765625, 0.01141357421875, 0.01116943359375, -0.005889892578125, 0.0096435546875, -0.021484375, 0.006683349609375, 0.000568389892578125, -0.000324249267578125, 0.002471923828125, -0.00958251953125, -0.0082397...	[ 1250, 4867, 12, 7413, 10, 194223, 2750, 100677, 756, 63920, 502, 2831, 587, 271, 2663, 70485, 7565, 10336, 40, 257, 72000, 121691, 56786, 16995, 525, 3525, 15824, 58229, 3444, 120384, 8562, 20653, 3365, 48740, 7, 3714, 3642, 5154, 5584, 2...	[ 0.1748046875, 0.270751953125, 0.0076904296875, 0.13232421875, 0.050689697265625, 0.2454833984375, 0.08160400390625, 0.207275390625, 0.1341552734375, 0.191650390625, 0.1063232421875, 0.1785888671875, 0.1492919921875, 0.1365966796875, 0.0869140625, 0.185546875, 0.110107421875, 0.1141...	embed
19119660_c0	19119660	prolog	0	Title: Prolog termination domain: How can I know which questions will return a finite number of answers? Problem title: Prolog termination domain: How can I know which questions will return a finite number of answers? Tags: prolog, failure-slice, non-termination Problem: Prolog termination domain: How can I know which ...	Prolog termination domain: How can I know which questions will return a finite number of answers? Prolog termination domain: How can I know which questions will return a finite number of answers? prolog failure-slice non-termination Prolog How Head Tail _G24 _G30 _G36 _G42 _G48 _G54 Prolog termination domain: How can I...	[ 0.0302734375, 0.00518798828125, 0.007781982421875, 0.002288818359375, -0.016357421875, -0.00128173828125, 0.00543212890625, 0.0206298828125, 0.00689697265625, -0.041259765625, -0.00927734375, -0.00457763671875, -0.007049560546875, -0.002227783203125, 0.01495361328125, 0.016357421875, ...	[ 1250, 4867, 29527, 1363, 77758, 11249, 831, 87, 3714, 3129, 17582, 1221, 30646, 94418, 13, 14012, 35166, 502, 137578, 13348, 351, 720, 91407, 44816, 1218, 379, 724, 2357, 1197, 8659, 13023, 9285, 12338, 1528, 33478, 76, 5303, 113292, 20255,...	[ 0.15673828125, 0.22314453125, 0.1810302734375, 0.028076171875, 0.1561279296875, 0.05572509765625, 0.0546875, 0.045440673828125, 0.1326904296875, 0.05804443359375, 0.2137451171875, 0.06982421875, 0.2047119140625, 0.20263671875, 0.05450439453125, 0.11669921875, 0.18017578125, 0.11853...	embed
55783988_c0	55783988	prolog	0	Title: Possible bug with nth1 predicate in Eclipse-clp? Problem title: Possible bug with nth1 predicate in Eclipse-clp? Tags: prolog, eclipse-clp Problem: Possible bug with nth1 predicate in Eclipse-clp? I'm writing a sudoku solver in Prolog. The sudoku itself is given as a vector of vectors: P = [[1,_,_, _,_,_, _,_,_]...	Possible bug with nth1 predicate in Eclipse-clp? Possible bug with nth1 predicate in Eclipse-clp? prolog eclipse-clp Possible nth1 Eclipse-clp convert_to_matrix Puzzle RowI Elem Possible bug with nth1 predicate in Eclipse-clp? I'm writing a sudoku solver in Prolog. The sudoku itself is given as a vector of vectors: I'm...	[ -0.01019287109375, 0.01171875, 0.026123046875, 0.0152587890625, -0.0108642578125, -0.004241943359375, -0.0218505859375, 0.0017852783203125, -0.0072021484375, -0.044189453125, -0.01531982421875, 0.00054168701171875, -0.007293701171875, -0.003326416015625, 0, -0.0111083984375, 0.015991...	[ 115861, 2661, 54608, 678, 653, 927, 418, 1653, 2063, 234962, 26775, 67, 23, 9, 502, 4867, 106371, 184, 96760, 188, 192, 87427, 179277, 96190, 568, 540, 195, 32562, 8932, 38067, 3115, 814, 1250, 68034, 34475, 237, 173, 18770, 22834, 22230,...	[ 0.095947265625, 0.04364013671875, 0.1953125, 0.02447509765625, 0.1348876953125, 0.220458984375, 0.1568603515625, 0.1412353515625, 0.1795654296875, 0.2486572265625, 0.1641845703125, 0.00323486328125, 0.0301666259765625, 0.021240234375, 0.103759765625, 0.203857421875, 0.143798828125, ...	embed
67485022_c0	67485022	prolog	0	Title: Learning Prolog : solving crossword problem in prolog Problem title: Learning Prolog : solving crossword problem in prolog Tags: prolog Problem: Learning Prolog : solving crossword problem in prolog I'm trying to learn Prolog and I've an exercise and I couldn't solve it. Here's what I have to do:- https://i.ssta...	Learning Prolog : solving crossword problem in prolog Learning Prolog : solving crossword problem in prolog prolog Learning Prolog H1V1 H1V2 H1V3 H1V4 H2V1 H2V2 H2V3 H2V4 H3V1 H3V2 H3V3 H3V4 H4V1 H4V2 H4V3 H4V4 Learning Prolog : solving crossword problem in prolog I'm trying to learn Prolog and I've an exercise and I c...	[ 0.0009765625, 0.00159454345703125, -0.007354736328125, 0.01214599609375, -0.01519775390625, 0.005584716796875, -0.0269775390625, 0.01275634765625, 0.0004711151123046875, -0.033935546875, 0.0177001953125, -0.00665283203125, 0.023193359375, 0.00836181640625, -0.01544189453125, 0.01538085...	[ 114344, 1250, 4867, 3115, 6496, 41421, 47416, 2967, 23, 502, 572, 856, 418, 304, 617, 31577, 30698, 272, 81979, 69427, 18, 86869, 201939, 1179, 19283, 1375, 864, 605, 128468, 18151, 37842, 11343, 3229, 11675, 442, 30646, 98320, 2811, 40383,...	[ 0.146484375, 0.1800537109375, 0.2318115234375, 0.1181640625, 0.0625, 0.136474609375, 0.2039794921875, 0.17626953125, 0.0804443359375, 0.158203125, 0.044342041015625, 0.123779296875, 0.0236968994140625, 0.03350830078125, 0.09893798828125, 0.0277099609375, 0.05169677734375, 0.0128173...	embed
49838393_c1	49838393	prolog	1	+ Yellow, Number1_2 #= (Green * 10) + Purple, Number1_3 #= (Cyan * 100) + (Red * 10) + Purple, Number2_1 #= (Red * 1000) + (Brown * 100) + (White * 10) + Red, Number2_2 #= (Lime * 10) + Yellow, Number2_3 #= (Red * 1000) + (Lime * 100) + (Purple * 10) + Pink, Number3_1 #= (White * 1000) + (Purple * 100) + (Cyan * 10) +...	+ Yellow, Number1_2 #= (Green * 10) + Purple, Number1_3 #= (Cyan * 100) + (Red * 10) + Purple, Number2_1 #= (Red * 1000) + (Brown * 100) + (White * 10) + Red, Number2_2 #= (Lime * 10) + Yellow, Number2_3 #= (Red * 1000) + (Lime * 100) + (Purple * 10) + Pink, Number3_1 #= (White * 1000) + (Purple * 100) + (Cyan * 10) +...	[ -0.013427734375, 0.0024871826171875, -0.01141357421875, 0.01434326171875, -0.0057373046875, -0.00750732421875, -0.0218505859375, 0.002593994140625, 0.0115966796875, 0.026123046875, -0.00860595703125, 0.01263427734375, 0.01275634765625, 0.01129150390625, -0.0107421875, 0.013427734375, ...	[ 997, 146762, 103332, 418, 304, 468, 1369, 152061, 661, 209, 16, 16915, 8705, 363, 15, 1643, 805, 80852, 115187, 4382, 80009, 7710, 173473, 6096, 9506, 683, 474, 59849, 22392, 4, 69085, 41566, 3555, 9077, 4527, 74912, 707, 14617, 16336, 91...	[ 0.1981201171875, 0.291748046875, 0.193115234375, 0.05169677734375, 0.1419677734375, 0.043060302734375, 0.03131103515625, 0.1690673828125, 0.002655029296875, 0.1533203125, 0.0009765625, 0.1365966796875, 0.18603515625, 0.1680908203125, 0.000762939453125, 0.1793212890625, 0.180053710937...	embed
32831392_c0	32831392	prolog	0	Title: How do I stop an empty list from appending to a complete list in Prolog? Problem title: How do I stop an empty list from appending to a complete list in Prolog? Tags: prolog, list Problem: How do I stop an empty list from appending to a complete list in Prolog? I have this issue in Prolog where I'm creating a li...	How do I stop an empty list from appending to a complete list in Prolog? How do I stop an empty list from appending to a complete list in Prolog? prolog list appending How Prolog put_together Value1 Value2 Result How do I stop an empty list from appending to a complete list in Prolog? I have this issue in Prolog where ...	[ 0.0059814453125, -0.00689697265625, 0.004852294921875, -0.007415771484375, -0.00185394287109375, 0.0220947265625, -0.011474609375, -0.0036163330078125, 0.02685546875, -0.0001239776611328125, 0.005035400390625, -0.006927490234375, -0.021484375, -0.0034637451171875, 0.0157470703125, 0.01...	[ 11249, 54, 7279, 201505, 5303, 1295, 1747, 96819, 47, 28484, 1250, 4867, 23, 502, 3884, 239483, 190060, 304, 126684, 142, 31089, 105233, 68018, 1653, 2063, 162466, 166635, 30646, 3564, 33342, 1884, 116, 138, 27781, 43257, 678, 10588, 62775, ...	[ 0.0478515625, 0.06317138671875, 0.2197265625, 0.244873046875, 0.2371826171875, 0.09234619140625, 0.1240234375, 0.153076171875, 0.0667724609375, 0.1651611328125, 0.1807861328125, 0.2301025390625, 0.030181884765625, 0.1151123046875, 0.0994873046875, 0.196044921875, 0.1318359375, 0.03...	embed
68699249_c0	68699249	prolog	0	Title: Handle multiple choise answer in expert system prolog Problem title: Handle multiple choise answer in expert system prolog Tags: prolog, expert-system Problem: Handle multiple choise answer in expert system prolog I have to add a functionality to an already existing expert system, that is to manage questions wit...	Handle multiple choise answer in expert system prolog Handle multiple choise answer in expert system prolog prolog expert-system Handle Present general_behavior_6 diagnostic_ criterion_ ingestion_not_food_substances criterion_no_medical_condition Handle multiple choise answer in expert system prolog I have to add a fun...	[ 0.009765625, -0.0040283203125, 0.007415771484375, 0.024658203125, -0.012939453125, 0.036376953125, -0.0035858154296875, 0.007293701171875, 0.0196533203125, -0.017578125, -0.0048828125, 0.0181884765625, -0.005279541015625, 0.0184326171875, -0.0006256103515625, 0.0189208984375, 0.01055...	[ 10639, 133, 48716, 681, 3075, 35166, 23, 26808, 5426, 502, 4867, 16751, 97721, 4537, 372, 98409, 910, 52070, 166220, 19, 141933, 10869, 49558, 196842, 157, 167455, 126940, 765, 15190, 123309, 21771, 144573, 111240, 17582, 12921, 52895, 959, 7...	[ 0.1961669921875, 0.1375732421875, 0.233642578125, 0.195068359375, 0.1546630859375, 0.25244140625, 0.05743408203125, 0.208740234375, 0.1658935546875, 0.1470947265625, 0.22021484375, 0.1634521484375, 0.2305908203125, 0.1273193359375, 0.058349609375, 0.1441650390625, 0.1103515625, 0.1...	embed
38136163_c0	38136163	prolog	0	Title: Getting number of common items between lists in Prolog Problem title: Getting number of common items between lists in Prolog Tags: prolog Problem: Getting number of common items between lists in Prolog I want to modify the code on Creating a list from user input with swi-prolog : diagnose(Disease):- retractall(s...	Getting number of common items between lists in Prolog Getting number of common items between lists in Prolog prolog Getting Prolog Disease List Symptom Enter runny_nose sore_throat head_ache Getting number of common items between lists in Prolog I want to modify the code on Creating a list from user input with swi-pro...	[ -0.00023174285888671875, -0.0123291015625, 0.0076904296875, 0.01190185546875, -0.0068359375, 0.01611328125, -0.00787353515625, 0.01458740234375, 0.00531005859375, -0.05419921875, 0.01080322265625, 0.028564453125, -0.00022792816162109375, 0.00164794921875, 0.00909423828125, 0.0019683837...	[ 210732, 14012, 111, 39210, 55769, 17721, 5303, 7, 1250, 4867, 23, 502, 229200, 32036, 149450, 60816, 11675, 299, 157, 127124, 42294, 10336, 46994, 2811, 40383, 18151, 56781, 1295, 38937, 107730, 91, 2452, 3454, 30957, 138, 153698, 552, 58968,...	[ 0.09954833984375, 0.170654296875, 0.01287841796875, 0.1727294921875, 0.18505859375, 0.1785888671875, 0.2183837890625, 0.09356689453125, 0.1685791015625, 0.2352294921875, 0.009429931640625, 0.1185302734375, 0.1341552734375, 0.1771240234375, 0.150146484375, 0.1011962890625, 0.030609130...	embed
68658188_c1	68658188	prolog	1	nth0(ConsonantIndex, Consonant, ConsonantChar), nth0(UvularIndex, Uvular, UvularChar), nth0(VowelIndex, Vowel, VowelChar), Syllable = [ConsonantChar, UvularChar, VowelChar]. wordgen([], _). wordgen(SyllableNums, Word) :- SyllableNums = [Head\|Tail], syllablegen(Head, Syllable), append(Word, Syllable, NewWord), wordgen(...	nth0(ConsonantIndex, Consonant, ConsonantChar), nth0(UvularIndex, Uvular, UvularChar), nth0(VowelIndex, Vowel, VowelChar), Syllable = [ConsonantChar, UvularChar, VowelChar]. wordgen([], _). wordgen(SyllableNums, Word) :- SyllableNums = [Head\|Tail], syllablegen(Head, Syllable), append(Word, Syllable, NewWord), wordgen(...	[ -0.01165771484375, -0.00799560546875, 0.007537841796875, -0.0017852783203125, -0.0264892578125, 0.01275634765625, 0.00726318359375, 0.005706787109375, 0.015869140625, -0.0201416015625, 0.00555419921875, -0.0159912109375, 0.000820159912109375, -0.00170135498046875, -0.02294921875, -0.01...	[ 653, 927, 2389, 11935, 1681, 1236, 4153, 39659, 1657, 84068, 247, 1062, 1783, 320, 36635, 8420, 5346, 4843, 1165, 2661, 2203, 345, 268, 2565, 1409, 4, 101, 194, 132, 65183, 839, 10321, 22543, 16, 15772, 13025, 712, 58745, 9874, 379, 954...	[ 0.055206298828125, 0.17919921875, 0.182861328125, 0.03814697265625, 0.193603515625, 0.087158203125, 0.05096435546875, 0.2196044921875, 0.055419921875, 0.167236328125, 0.0089111328125, 0.0194091796875, 0.1385498046875, 0.1524658203125, 0.09613037109375, 0.1700439453125, 0.067749023437...	embed
26278667_c0	26278667	prolog	0	Title: SWI-Prolog: how to insert a new clause to a database Problem title: SWI-Prolog: how to insert a new clause to a database Tags: prolog Problem: SWI-Prolog: how to insert a new clause to a database I'm sorry, this has probably been asked before but I can't find a good answer. I'm writing a Prolog assignment, in wh...	SWI-Prolog: how to insert a new clause to a database SWI-Prolog: how to insert a new clause to a database prolog SWI-Prolog banco.pl SWI-Prolog: how to insert a new clause to a database I'm sorry, this has probably been asked before but I can't find a good answer. I'm writing a Prolog assignment, in which we must write...	[ 0.007232666015625, 0.00640869140625, 0.012451171875, 0.0252685546875, -0.03076171875, 0.0181884765625, -0.033203125, -0.01513671875, 0.0157470703125, -0.04736328125, -0.00144195556640625, 0.00823974609375, -0.02490234375, -0.010498046875, 0.0194091796875, 0.01416015625, 0.00994873046...	[ 159, 38969, 10752, 4867, 3642, 183540, 3525, 70731, 13, 47, 63399, 502, 66799, 2424, 10, 59090, 32562, 1250, 95486, 33022, 154109, 179933, 2831, 14192, 5303, 30745, 50339, 27983, 24674, 96759, 11435, 4393, 18151, 11675, 25632, 16750, 37842, 1...	[ 0.023101806640625, 0.1826171875, 0.1038818359375, 0.169921875, 0.052459716796875, 0.2398681640625, 0.158935546875, 0.22998046875, 0.167236328125, 0.09124755859375, 0.197021484375, 0.113525390625, 0.1407470703125, 0.0938720703125, 0.002105712890625, 0.01031494140625, 0.03265380859375,...	embed
48498573_c0	48498573	prolog	0	Title: How to use difference lists in recursion? Problem title: How to use difference lists in recursion? Tags: difference-lists, prolog Problem: How to use difference lists in recursion? The intent of the following program is as follows clist_d(f(a,f(a,a)),R) the result is a list of all ground arguments, e.g R = [a,a,...	How to use difference lists in recursion? How to use difference lists in recursion? difference-lists prolog How Difference X-Y Y-Z X-Z clist_d X-T How to use difference lists in recursion? The intent of the following program is as follows clist_d(f(a,f(a,a)),R) the result is a list of all ground arguments, e.g R = [a,a...	[ 0.013916015625, 0.0064697265625, 0.01190185546875, 0.012939453125, -0.01153564453125, 0.0137939453125, 0.001922607421875, 0.017822265625, 0.0262451171875, -0.010009765625, 0.0009918212890625, -0.0189208984375, -0.00909423828125, 0.0159912109375, 0.0184326171875, -0.00958251953125, 0....	[ 11249, 47, 4527, 60212, 5303, 7, 23, 195625, 1830, 6562, 502, 4867, 803, 18234, 6620, 1193, 1723, 990, 9, 1511, 501, 71, 618, 78091, 25632, 1528, 420, 11, 1052, 16750, 756, 61585, 10750, 627, 2203, 70541, 54608, 28398, 41, 103687, 13423...	[ 0.07354736328125, 0.014556884765625, 0.1575927734375, 0.269775390625, 0.257568359375, 0.124755859375, 0.0692138671875, 0.22509765625, 0.1456298828125, 0.2247314453125, 0.0999755859375, 0.1375732421875, 0.1168212890625, 0.193359375, 0.1224365234375, 0.056732177734375, 0.08447265625, ...	embed
56138140_c0	56138140	prolog	0	Title: How do I add a field to a Prolog (Pengines) response? Problem title: How do I add a field to a Prolog (Pengines) response? Tags: javascript, response, json, prolog Problem: How do I add a field to a Prolog (Pengines) response? I'm building a simple game on a prolog server running on Pengines. I have a template t...	How do I add a field to a Prolog (Pengines) response? How do I add a field to a Prolog (Pengines) response? javascript response json prolog How Prolog Pengines response.data Board pengine.ask Pengine.stringify How do I add a field to a Prolog (Pengines) response? I'm building a simple game on a prolog server running on...	[ 0.0026397705078125, 0.0145263671875, 0.01007080078125, 0.000637054443359375, 0.005950927734375, 0.00665283203125, 0.006011962890625, 0.01312255859375, -0.00628662109375, -0.037109375, 0.0284423828125, 0.0164794921875, -0.005523681640625, -0.00872802734375, 0.0191650390625, -0.006439208...	[ 11249, 15190, 44457, 47, 1250, 4867, 187889, 12741, 57553, 136951, 1681, 502, 27691, 10135, 62554, 10048, 1212, 1042, 91693, 40383, 54, 87, 10, 33976, 8781, 6712, 10723, 110934, 18151, 2389, 12647, 5861, 831, 4173, 30646, 4677, 19882, 35839, ...	[ 0.0740966796875, 0.1973876953125, 0.297607421875, 0.10638427734375, 0.1861572265625, 0.243896484375, 0.1767578125, 0.189697265625, 0.2432861328125, 0.2060546875, 0.08392333984375, 0.099853515625, 0.1756591796875, 0.07879638671875, 0.1856689453125, 0.1336669921875, 0.168701171875, 0...	embed
12868485_c0	12868485	prolog	0	Title: Prolog Recursion returns multiple results Problem title: Prolog Recursion returns multiple results Tags: prolog, recursion Problem: Prolog Recursion returns multiple results To start off this is a homework question poised to me. I am supposed to write a predicate btree_height\2 that takes a Binary tree and (for ...	Prolog Recursion returns multiple results Prolog Recursion returns multiple results prolog recursion Prolog Recursion btree_height Prolog Recursion returns multiple results To start off this is a homework question poised to me. I am supposed to write a predicate btree_height\2 that takes a Binary tree and (for now) jus...	[ 0.0113525390625, 0.005767822265625, -0.006439208984375, -0.00311279296875, -0.001953125, 0.0238037109375, -0.026611328125, -0.019287109375, 0.00970458984375, -0.036376953125, -0.007415771484375, -0.039306640625, 0.01239013671875, 0.006683349609375, 0.0174560546875, -0.005859375, 0.03...	[ 1250, 4867, 165428, 42, 6889, 30646, 48716, 50339, 502, 195625, 876, 62600, 1106, 22553, 18244, 134598, 33022, 1653, 2063, 304, 51776, 54092, 1294, 53201, 155955, 111, 2394, 6635, 33636, 1022, 892, 1505, 142424, 110, 27781, 18151, 2967, 19441...	[ 0.1768798828125, 0.224609375, 0.169921875, 0.165283203125, 0.121337890625, 0.180908203125, 0.206298828125, 0.192138671875, 0.1256103515625, 0.240234375, 0.064208984375, 0.23095703125, 0.1357421875, 0.1387939453125, 0.0501708984375, 0.03778076171875, 0.069580078125, 0.0797119140625,...	embed
53790416_c1	53790416	prolog	1	= e(_, _). rewrite(A, A) :- \+ wff_shallowly(A). I thought that this would prevent the catch-all clause from being applicable if and only if A isn't headed by an atom/constructor with special meaning. However, after making that change, the rewrite always fails if invoked recursively. ?- rewrite(4, Z). Z = 4. ?- rewrit...	= e(_, _). rewrite(A, A) :- \+ wff_shallowly(A). I thought that this would prevent the catch-all clause from being applicable if and only if A isn't headed by an atom/constructor with special meaning. However, after making that change, the rewrite always fails if invoked recursively. ?- rewrite(4, Z). Z = 4. ?- rewrit...	[ -0.035888671875, 0.023193359375, 0.01055908203125, 0.0146484375, -0.0029296875, -0.0040283203125, -0.000438690185546875, -0.00057220458984375, 0.0133056640625, 0.0164794921875, -0.002532958984375, 0.01214599609375, 0.0037689208984375, 0.022705078125, 0.007415771484375, 0.00198364257812...	[ 2203, 28, 101, 456, 434, 18781, 284, 62, 1328, 148, 4902, 2420, 41566, 538, 17569, 56282, 105556, 9, 5584, 70731, 13, 152431, 18, 10336, 34627, 36716, 748, 5361, 91084, 7103, 15549, 11343, 35782, 2174, 23253, 195625, 105801, 567, 1398, 23...	[ 0.058013916015625, 0.132568359375, 0.01190185546875, 0.160400390625, 0.1876220703125, 0.22412109375, 0.0821533203125, 0.09442138671875, 0.072509765625, 0.0275115966796875, 0.148193359375, 0.081787109375, 0.133544921875, 0.1646728515625, 0.02825927734375, 0.14794921875, 0.259765625, ...	embed
6874484_c0	6874484	prolog	0	Title: Efficient Mutable Graph Representation in Prolog? Problem title: Efficient Mutable Graph Representation in Prolog? Tags: graph-theory, performance, prolog-directive-dynamic, prolog Problem: Efficient Mutable Graph Representation in Prolog? I would like to represent a mutable graph in Prolog in an efficient manne...	Efficient Mutable Graph Representation in Prolog? Efficient Mutable Graph Representation in Prolog? graph-theory performance prolog-directive-dynamic prolog Efficient Mutable Graph Representation Prolog Type Name Step NextStep Efficient Mutable Graph Representation in Prolog? I would like to represent a mutable graph i...	[ 0.0113525390625, 0.01031494140625, 0.0140380859375, 0.0157470703125, -0.019287109375, -0.00025177001953125, -0.0159912109375, 0.0067138671875, 0.0191650390625, -0.031494140625, 0.006195068359375, 0.0277099609375, -0.0167236328125, -0.007537841796875, 0.00897216796875, 0.015869140625, ...	[ 24500, 45964, 2758, 22819, 6524, 11727, 130877, 23, 1250, 4867, 1363, 41382, 2347, 23718, 502, 936, 100034, 242554, 60457, 15757, 50478, 4997, 191644, 1884, 33636, 842, 93766, 157318, 1614, 3509, 133266, 20697, 63399, 237, 132096, 10846, 91736,...	[ 0.15576171875, 0.1002197265625, 0.160400390625, 0.1832275390625, 0.179931640625, 0.1593017578125, 0.224365234375, 0.040863037109375, 0.181884765625, 0.24462890625, 0.0166778564453125, 0.2296142578125, 0.0283203125, 0.1348876953125, 0.108154296875, 0.017547607421875, 0.015380859375, ...	embed
58978852_c0	58978852	prolog	0	Title: Remove / update all lists from a list that meet a certain criterion Problem title: Remove / update all lists from a list that meet a certain criterion Tags: prolog Problem: Remove / update all lists from a list that meet a certain criterion I want to remove / update all lists from a list that meet a certain crit...	Remove / update all lists from a list that meet a certain criterion Remove / update all lists from a list that meet a certain criterion prolog a Remove Small_List remove_lists Remove / update all lists from a list that meet a certain criterion I want to remove / update all lists from a list that meet a certain criterio...	[ -0.007049560546875, 0.01806640625, 0.0145263671875, 0.0224609375, -0.019287109375, -0.00592041015625, 0.0250244140625, 0.00640869140625, 0.0277099609375, 0.000644683837890625, 0.00177764892578125, -0.001129150390625, -0.015625, -0.0027313232421875, 0.014892578125, 0.003997802734375, ...	[ 181139, 248, 28350, 756, 5303, 7, 1295, 23356, 24233, 166220, 450, 502, 4867, 10, 105508, 154663, 87388, 6562, 19, 3444, 47, 89536, 32036, 275, 238, 53, 169, 26315, 720, 1830, 14602, 959, 70541, 126684, 37842, 9790, 144851, 11, 339, 17727...	[ 0.19140625, 0.056488037109375, 0.187744140625, 0.127197265625, 0.2396240234375, 0.03271484375, 0.0904541015625, 0.138916015625, 0.07232666015625, 0.1842041015625, 0.004150390625, 0.126220703125, 0.1453857421875, 0.044342041015625, 0.1453857421875, 0.1595458984375, 0.1995849609375, ...	embed
38413957_c1	38413957	prolog	1	1 max_set(_, N1, List2, N2, List, N) :- N2>N1, % if N2 is bigger List=List2, % then max set is List2 N=N2. % of length N2 % a helping predicate to find the max independent set of t(L,_,R), excluding the root mis_no_root(nil, [], 0). % the empty subtree has an empty max independent set of size 0 mis_no_root(t(L,_,R), Li...	1 max_set(_, N1, List2, N2, List, N) :- N2>N1, % if N2 is bigger List=List2, % then max set is List2 N=N2. % of length N2 % a helping predicate to find the max independent set of t(L,_,R), excluding the root mis_no_root(nil, [], 0). % the empty subtree has an empty max independent set of size 0 mis_no_root(t(L,_,R), Li...	[ 0.01123046875, 0.0079345703125, 0.0196533203125, 0.005096435546875, 0.0098876953125, 0.00799560546875, -0.0031585693359375, 0.0123291015625, 0.006561279296875, -0.00433349609375, 0.016357421875, -0.00457763671875, 0.01129150390625, -0.0218505859375, 0.0157470703125, -0.0167236328125, ...	[ 106, 18389, 454, 3509, 541, 418, 32036, 304, 4, 15772, 2740, 839, 1745, 2174, 167785, 154663, 5423, 5442, 140909, 120592, 1653, 2063, 7413, 41371, 808, 866, 1052, 39041, 74855, 1239, 157, 148920, 17324, 757, 201505, 1614, 62600, 13267, 18, ...	[ 0.07470703125, 0.244873046875, 0.056793212890625, 0.27490234375, 0.126220703125, 0.0653076171875, 0.206787109375, 0.1551513671875, 0.001617431640625, 0.06683349609375, 0.038421630859375, 0.09307861328125, 0.0673828125, 0.009490966796875, 0.119873046875, 0.1456298828125, 0.26708984375...	embed
69638577_c0	69638577	prolog	0	Title: Prolog. Comparing elements in a list Problem title: Prolog. Comparing elements in a list Tags: prolog Problem: Prolog. Comparing elements in a list I have a list of people that contains list of people that contains name+age. person(bob, 20). person(charlie, 15). person(steve, 21). person(david, 25). I want to cr...	Prolog. Comparing elements in a list Prolog. Comparing elements in a list prolog Prolog Comparing Name MaxName MaxAge Age Set Skipping MaxValue Prolog. Comparing elements in a list I have a list of people that contains list of people that contains name+age. I want to create a predicate oldest(List, Name) that will take...	[ -0.005889892578125, 0.003875732421875, 0.033935546875, 0.0284423828125, -0.0103759765625, 0.034423828125, -0.006561279296875, 0.00811767578125, 0.0091552734375, -0.038330078125, 0.0081787109375, 0.0108642578125, -0.004974365234375, -0.00885009765625, 0.0107421875, -0.006561279296875, ...	[ 1250, 4867, 5, 113307, 214, 80854, 23, 5303, 502, 15757, 9920, 163612, 284, 429, 72944, 19943, 20491, 26783, 856, 50770, 10, 87, 765, 3395, 70541, 9351, 1328, 4588, 3444, 28282, 1653, 2063, 10332, 525, 154663, 5646, 123055, 30646, 3445, 9...	[ 0.1710205078125, 0.2303466796875, 0.00177001953125, 0.2100830078125, 0.0911865234375, 0.1903076171875, 0.0701904296875, 0.2056884765625, 0.1275634765625, 0.120849609375, 0.127685546875, 0.13623046875, 0.034088134765625, 0.06182861328125, 0.09393310546875, 0.11572265625, 0.12536621093...	embed
74660753_c0	74660753	prolog	0	Title: why backtracking does / does not happen (ending search with false or not)? Problem title: why backtracking does / does not happen (ending search with false or not)? Tags: prolog, backtracking Problem: why backtracking does / does not happen (ending search with false or not)? This is a question asking why backtra...	why backtracking does / does not happen (ending search with false or not)? why backtracking does / does not happen (ending search with false or not)? prolog backtracking Temp why backtracking does / does not happen (ending search with false or not)? This is a question asking why backtracking happens in one simple progr...	[ 0.0299072265625, 0.021484375, 0.01104736328125, -0.00045013427734375, -0.0205078125, 0.00494384765625, 0.0167236328125, 0.00726318359375, -0.0019378662109375, 0.018798828125, 0.0106201171875, 0.007049560546875, -0.003997802734375, 0.034912109375, 0.00885009765625, 0.01025390625, 0.02...	[ 15400, 4420, 125728, 214, 14602, 248, 959, 53383, 33, 6238, 33938, 98320, 678, 502, 4867, 37446, 707, 96276, 8781, 1528, 89536, 787, 27781, 7413, 1193, 94385, 1632, 29806, 105876, 47, 1286, 51347, 14037, 30646, 26785, 66159, 21342, 25958, 1...	[ 0.12646484375, 0.213623046875, 0.2685546875, 0.15185546875, 0.08935546875, 0.03076171875, 0.0927734375, 0.1226806640625, 0.074951171875, 0.08282470703125, 0.1978759765625, 0.2314453125, 0.0411376953125, 0.121826171875, 0.178955078125, 0.1597900390625, 0.015167236328125, 0.105346679...	embed
1668428_c0	1668428	prolog	0	Title: Prolog Problem with combinding predicates that work on their own Problem title: Prolog Problem with combinding predicates that work on their own Tags: prolog, list Problem: Prolog Problem with combinding predicates that work on their own Here we go, bear with me. The over-all goal is to return the max alignment ...	Prolog Problem with combinding predicates that work on their own Prolog Problem with combinding predicates that work on their own prolog list Prolog Problem _Xs _Ys Prolog Problem with combinding predicates that work on their own Here we go, bear with me. The over-all goal is to return the max alignment between two lis...	[ 0.01373291015625, 0.006744384765625, 0.00072479248046875, 0.0233154296875, -0.0038604736328125, 0.0303955078125, 0.004058837890625, 0.01409912109375, 0.0196533203125, -0.02294921875, 0.0244140625, 0.01318359375, 0.006591796875, -0.00107574462890625, 0.007598876953125, 0.001861572265625...	[ 1250, 4867, 15649, 375, 128239, 1653, 2063, 1636, 4488, 98, 2363, 10002, 502, 5303, 1542, 1723, 81148, 678, 163, 5584, 69236, 30646, 18389, 143420, 674, 17721, 6626, 1286, 1632, 5701, 140909, 5117, 17106, 80854, 12008, 26785, 12989, 25568, ...	[ 0.1536865234375, 0.2322998046875, 0.1717529296875, 0.114013671875, 0.222412109375, 0.1900634765625, 0.2125244140625, 0.06292724609375, 0.1004638671875, 0.063232421875, 0.0321044921875, 0.1343994140625, 0.140380859375, 0.1810302734375, 0.08001708984375, 0.13232421875, 0.10162353515625...	embed
36896943_c0	36896943	prolog	0	Title: How do I find a substring between two characters using Prolog? Problem title: How do I find a substring between two characters using Prolog? Tags: swi-prolog, list, string, prolog Problem: How do I find a substring between two characters using Prolog? I have a variable being passed to a predicate that is a list ...	How do I find a substring between two characters using Prolog? How do I find a substring between two characters using Prolog? swi-prolog list string prolog Prolog How Canidae Canis Felidae Felinae Felis Equidae Equus How do I find a substring between two characters using Prolog? I have a variable being passed to a pred...	[ 0.00982666015625, -0.0113525390625, 0.005889892578125, 0.0279541015625, -0.007049560546875, 0.0159912109375, 0.007293701171875, 0.0079345703125, 0.0133056640625, -0.00151824951171875, 0.0089111328125, -0.01226806640625, -0.0162353515625, 0.00750732421875, 0.0220947265625, 0.00053787231...	[ 11249, 7413, 1614, 91693, 17721, 6626, 124850, 17368, 1250, 4867, 2452, 3454, 5303, 79315, 502, 4171, 1683, 164, 9593, 885, 145666, 85, 5490, 10, 77336, 115081, 1653, 2063, 12638, 125663, 53894, 525, 5423, 49129, 35412, 756, 360, 7077, 2178...	[ 0.058929443359375, 0.1654052734375, 0.23193359375, 0.25927734375, 0.206787109375, 0.1142578125, 0.180419921875, 0.06591796875, 0.15771484375, 0.2362060546875, 0.1177978515625, 0.109619140625, 0.1041259765625, 0.1881103515625, 0.0994873046875, 0.11865234375, 0.0703125, 0.07257080078...	embed
73345446_c1	73345446	prolog	1	1,3,2], What). and sortz([1,3,2], [], What). both return "no". Attempt 2: % Shortcut insertionsort(List, Result) :- insertionsort(List, [], Result). % Base case. Result will be the last parameter when first element is empty, thus all elements will have been sorted into the second list insertionsort([], Result, Result)....	1,3,2], What). and sortz([1,3,2], [], What). both return "no". Attempt 2: % Shortcut insertionsort(List, Result) :- insertionsort(List, [], Result). % Base case. Result will be the last parameter when first element is empty, thus all elements will have been sorted into the second list insertionsort([], Result, Result)....	[ -0.0084228515625, -0.004486083984375, 0.026123046875, -0.004669189453125, -0.01361083984375, 0.0272216796875, -0.00933837890625, -0.033935546875, 0.0174560546875, 0.01080322265625, 0.026123046875, 0.005218505859375, -0.018310546875, -0.00555419921875, 0.002593994140625, 0.0018997192382...	[ 46963, 90173, 4865, 12096, 169, 363, 15044, 30646, 157, 1913, 34224, 18, 15573, 1745, 82990, 19774, 241860, 62351, 154663, 126684, 44978, 7225, 4568, 171859, 5117, 12830, 201505, 756, 80854, 17497, 17932, 5303, 13025, 712, 9874, 379, 29899, 1...	[ 0.146484375, 0.07373046875, 0.1534423828125, 0.203369140625, 0.092041015625, 0.05316162109375, 0.017608642578125, 0.0897216796875, 0.0916748046875, 0.037872314453125, 0.2110595703125, 0.010528564453125, 0.07904052734375, 0.0360107421875, 0.1224365234375, 0.147705078125, 0.15808105468...	embed
29984768_c0	29984768	prolog	0	Title: Find permutations of list with unique Heads Problem title: Find permutations of list with unique Heads Tags: list, permutation, prolog Problem: Find permutations of list with unique Heads I have a list of unique elements, and I want to generate permutations of that list but I only want the elements to be the hea...	Find permutations of list with unique Heads Find permutations of list with unique Heads list permutation prolog Find Heads special_permutation Head Tail AltHead AltTail Find permutations of list with unique Heads I have a list of unique elements, and I want to generate permutations of that list but I only want the elem...	[ 0.0026702880859375, 0.0185546875, 0.0179443359375, -0.0274658203125, -0.007232666015625, 0.002960205078125, -0.02685546875, -0.00110626220703125, 0.01531982421875, -0.01806640625, -0.0034637451171875, 0.02880859375, 0.016845703125, 0.01214599609375, 0.00194549560546875, 0.018310546875,...	[ 26040, 117, 14311, 21094, 111, 5303, 678, 36998, 44816, 7, 561, 22062, 502, 4867, 5361, 1264, 1218, 379, 10544, 13025, 9874, 765, 80854, 3444, 139392, 4734, 47, 186, 10336, 24145, 1884, 12989, 46741, 26866, 163, 37842, 2060, 903, 30646, 1...	[ 0.1561279296875, 0.16845703125, 0.24609375, 0.1488037109375, 0.07647705078125, 0.1966552734375, 0.14404296875, 0.251953125, 0.250732421875, 0.04986572265625, 0.2152099609375, 0.1116943359375, 0.08697509765625, 0.1072998046875, 0.110595703125, 0.11181640625, 0.078125, 0.032073974609...	embed
47841539_c0	47841539	prolog	0	Title: Prolog finding duplicates in a stucture gives existence error Problem title: Prolog finding duplicates in a stucture gives existence error Tags: prolog Problem: Prolog finding duplicates in a stucture gives existence error I'm getting an existence error when I call my rule shareActors which should be true if two...	Prolog finding duplicates in a stucture gives existence error Prolog finding duplicates in a stucture gives existence error prolog Prolog Prolog finding duplicates in a stucture gives existence error I'm getting an existence error when I call my rule shareActors which should be true if two movies have the same actor. T...	[ -0.001678466796875, 0.02783203125, 0.00946044921875, 0.00634765625, 0.006683349609375, 0.0172119140625, 0.0030364990234375, 0.006072998046875, 0.0018768310546875, -0.0228271484375, -0.0013275146484375, 0.016357421875, 0.0272216796875, -0.01507568359375, 0.014404296875, 0.022216796875, ...	[ 1250, 4867, 90791, 171763, 1636, 23, 18784, 238, 6644, 76199, 116311, 18499, 502, 6, 20949, 11782, 79986, 12008, 39450, 22230, 5608, 29568, 2174, 6626, 72304, 765, 5701, 39329, 129745 ]	[ 0.1707763671875, 0.26708984375, 0.12481689453125, 0.263671875, 0.1705322265625, 0.060394287109375, 0.153076171875, 0.1025390625, 0.1083984375, 0.07208251953125, 0.205322265625, 0.2178955078125, 0.1253662109375, 0.0384521484375, 0.05059814453125, 0.1160888671875, 0.195068359375, 0.1...	embed
22236475_c0	22236475	prolog	0	Title: Append lists in Prolog Problem title: Append lists in Prolog Tags: prolog, list Problem: Append lists in Prolog Prolog SWI. Let's say I have a recursive function that adds X items to list in every iteration. Something that looks like: func(...,BigList):- func2(...,CurrentList), BigList = [ CurrentList \| Tail ], ...	Append lists in Prolog Append lists in Prolog prolog list Append Prolog BigList func2 CurrentList Tail iter1item1 iter1item2 iter1itemX iter2item1 iter2item2 iter2itemX iterXitem1 iterXitem2 Append lists in Prolog Prolog SWI. Let's say I have a recursive function that adds X items to list in every iteration. Something ...	[ 0.005462646484375, 0.00750732421875, 0.01519775390625, 0.009521484375, -0.009765625, 0.01953125, -0.0007781982421875, 0.008056640625, 0.01483154296875, -0.019775390625, 0.016845703125, -0.0098876953125, -0.0025634765625, 0.003448486328125, 0.0198974609375, 0.00897216796875, 0.0062561...	[ 5659, 3611, 5303, 7, 1250, 4867, 23, 502, 14195, 154663, 7477, 304, 114063, 1218, 379, 720, 217, 1542, 195, 159, 38969, 195625, 32354, 15190, 1193, 55769, 11907, 33342, 1884, 37842, 87388, 63920, 959, 5526, 99156, 12301, 238, 139124, 61475,...	[ 0.138671875, 0.1168212890625, 0.249267578125, 0.03692626953125, 0.185302734375, 0.2393798828125, 0.047027587890625, 0.1392822265625, 0.147705078125, 0.28271484375, 0.1151123046875, 0.148193359375, 0.1751708984375, 0.1107177734375, 0.1068115234375, 0.1888427734375, 0.035552978515625, ...	embed
67029329_c1	67029329	prolog	1	2 error messages indicate main.m:011: possible causes of this error. main.m:011: main.m:011: In clause for `getlist(out)': main.m:011: mode error in unification of `Xs' and `list.[V_10 \| V_16]'. main.m:011: Variable `Xs' has instantiatedness main.m:011: bound( main.m:011: [] main.m:011: ; main.m:011: '[\|]'( main.m:011...	2 error messages indicate main.m:011: possible causes of this error. main.m:011: main.m:011: In clause for `getlist(out)': main.m:011: mode error in unification of `Xs' and `list.[V_10 \| V_16]'. main.m:011: Variable `Xs' has instantiatedness main.m:011: bound( main.m:011: [] main.m:011: ; main.m:011: '[\|]'( main.m:011...	[ 0.00506591796875, 0.01507568359375, 0.006988525390625, 0.00119781494140625, -0.0035858154296875, 0.01483154296875, -0.004791259765625, -0.0032958984375, 0.014892578125, 0.002166748046875, 0.0208740234375, -0.0233154296875, 0.01025390625, -0.01318359375, 0.007781982421875, 0.00805664062...	[ 116, 18499, 89914, 117414, 5201, 39, 12, 136485, 7722, 113660, 903, 5, 360, 70731, 13, 3794, 6562, 132, 6056, 13736, 23, 51, 41274, 1542, 136, 856, 963, 58745, 310, 2485, 84572, 2886, 7, 1556, 34648, 14, 27686, 7432, 6, 99091, 4092, 2...	[ 0.143310546875, 0.2379150390625, 0.189453125, 0.1505126953125, 0.14599609375, 0.108154296875, 0.08245849609375, 0.2274169921875, 0.1734619140625, 0.1793212890625, 0.1053466796875, 0.010162353515625, 0.049591064453125, 0.1630859375, 0.037109375, 0.1422119140625, 0.265380859375, 0.05...	embed
13456231_c0	13456231	prolog	0	Title: Prolog - Search a list for an element, print the list if element is found Problem title: Prolog - Search a list for an element, print the list if element is found Tags: prolog, list Problem: Prolog - Search a list for an element, print the list if element is found So I am trying to write a small program that doe...	Prolog - Search a list for an element, print the list if element is found Prolog - Search a list for an element, print the list if element is found prolog list Prolog Search Item Rest DisregardHead Tail Prolog - Search a list for an element, print the list if element is found So I am trying to write a small program tha...	[ -0.0120849609375, 0.00970458984375, -0.001678466796875, 0.006072998046875, -0.006195068359375, 0.0296630859375, -0.004119873046875, -0.0023651123046875, 0.002197265625, -0.04150390625, 0.0322265625, -0.0262451171875, -0.01239013671875, 0.01300048828125, -0.003936767578125, 0.0069274902...	[ 1250, 4867, 20, 33086, 5303, 100, 12830, 28412, 2174, 83, 14037, 502, 78426, 49756, 42077, 13025, 1218, 379, 31577, 33022, 19336, 1528, 14602, 25632, 831, 33938, 46132, 1810, 39563, 62822, 74189, 80854, 13909, 114669, 149186, 21914, 140992, 1...	[ 0.181640625, 0.255615234375, 0.03155517578125, 0.2232666015625, 0.2017822265625, 0.134521484375, 0.1953125, 0.1842041015625, 0.12060546875, 0.038238525390625, 0.1610107421875, 0.1474609375, 0.1031494140625, 0.107421875, 0.0670166015625, 0.0215911865234375, 0.0533447265625, 0.083251...	embed
44084016_c0	44084016	prolog	0	Title: Semantic Representation for enlish sentences in Prolog Problem title: Semantic Representation for enlish sentences in Prolog Tags: dcg, syntax, prolog Problem: Semantic Representation for enlish sentences in Prolog I am trying to get a semantic representation for English sentences by using a DCG in Prolog. This ...	Semantic Representation for enlish sentences in Prolog Semantic Representation for enlish sentences in Prolog dcg syntax prolog Semantic Representation Prolog Sem OBJ Semantic Representation for enlish sentences in Prolog I am trying to get a semantic representation for English sentences by using a DCG in Prolog. This ...	[ 0.02490234375, 0.0185546875, 0.00732421875, 0.021240234375, -0.002838134765625, 0.00994873046875, -0.01409912109375, 0.00408935546875, -0.00360107421875, -0.0400390625, 0.00897216796875, -0.00457763671875, -0.0133056640625, 0.000095367431640625, 0.006378173828125, 0.002288818359375, ...	[ 10232, 109109, 130877, 1363, 100, 22, 15227, 149357, 1250, 4867, 104, 238, 177, 86531, 502, 150260, 31577, 2046, 484, 18811, 14941, 17368, 391, 56367, 23, 184345, 5608, 1300, 14578, 43581, 10778, 15649, 25632, 6183, 959, 2499, 6528, 3642, 1...	[ 0.152099609375, 0.1455078125, 0.2191162109375, 0.057373046875, 0.033935546875, 0.06219482421875, 0.11962890625, 0.1790771484375, 0.14892578125, 0.2362060546875, 0.0196990966796875, 0.029998779296875, 0.08477783203125, 0.0384521484375, 0.10791015625, 0.1312255859375, 0.0263671875, 0...	embed
10258298_c0	10258298	prolog	0	Title: simple dcg lexer Problem title: simple dcg lexer Tags: dcg, prolog Problem: simple dcg lexer Hi i'm writing a simple lexer :- module(lekser, [lekser/3]). lekser(Tokens) --> white_space, ( ( "{", !, { Token = tkLBrace } ; "}", !, { Token = tkRBrace } ; ")", !, { Token = tkRParen } ; "(", !, { Token = tkLParen } ;...	simple dcg lexer simple dcg lexer dcg prolog Tokens white_space Token Syntax style_check simple dcg lexer Hi i'm writing a simple lexer Here is the begining of code whell coudl someone tell me where i made mistake because swi code editor says there is an eror(even after putting only few empty nelines) Syntax error: Str...	[ 0.02197265625, -0.006500244140625, -0.006072998046875, 0.0026397705078125, -0.00125885009765625, 0.0059814453125, -0.003814697265625, -0.00848388671875, 0.0128173828125, -0.05224609375, -0.001953125, 0.00213623046875, -0.0205078125, -0.00531005859375, 0.0245361328125, 0.013671875, 0....	[ 8781, 238, 177, 95, 34058, 502, 4867, 84694, 35011, 65421, 717, 1098, 19010, 86531, 20623, 78292, 104, 32562, 9842, 214, 18151, 148, 79544, 31816, 20469, 7228, 121742, 2452, 30391, 72, 748, 7103, 4734, 10846, 201505, 108, 59801, 18499, 2335...	[ 0.181396484375, 0.0335693359375, 0.1085205078125, 0.1129150390625, 0.2379150390625, 0.08819580078125, 0.1427001953125, 0.1348876953125, 0.07427978515625, 0.1312255859375, 0.012542724609375, 0.1119384765625, 0.0870361328125, 0.1624755859375, 0.1693115234375, 0.1903076171875, 0.0125427...	embed
35843879_c0	35843879	prolog	0	Title: Prolog predicate - returns list with duplicates removed from specific predicate Problem title: Prolog predicate - returns list with duplicates removed from specific predicate Tags: return-value, prolog Problem: Prolog predicate - returns list with duplicates removed from specific predicate I'm a complete noob tr...	Prolog predicate - returns list with duplicates removed from specific predicate Prolog predicate - returns list with duplicates removed from specific predicate return-value prolog specific Prolog Prolog predicate - returns list with duplicates removed from specific predicate I'm a complete noob trying to write predicat...	[ 0.00787353515625, 0.02294921875, 0.00732421875, -0.01165771484375, -0.027099609375, 0.01239013671875, 0.0048828125, 0.000789642333984375, -0.00640869140625, -0.0262451171875, -0.0157470703125, -0.000396728515625, 0.0038299560546875, 0.000438690185546875, -0.00213623046875, 0.0354003906...	[ 1250, 4867, 1653, 2063, 67, 30646, 5303, 678, 171763, 1636, 184750, 1295, 29458, 27494, 502, 3522, 33022, 179933, 14194, 17726, 52721, 12477, 29568, 116, 2208, 28282, 3525, 87388, 115, 182867, 11001, 618, 11583, 171859, 6056, 81887 ]	[ 0.1712646484375, 0.2298583984375, 0.1697998046875, 0.19775390625, 0.0716552734375, 0.1722412109375, 0.1788330078125, 0.0670166015625, 0.23583984375, 0.1090087890625, 0.1602783203125, 0.0572509765625, 0.1556396484375, 0.125244140625, 0.130126953125, 0.040924072265625, 0.05624389648437...	embed
66664553_c0	66664553	prolog	0	Title: Prolog program to search book by book_title ,by book_author, by book_edition using recursion Problem title: Prolog program to search book by book_title ,by book_author, by book_edition using recursion Tags: prolog Problem: Prolog program to search book by book_title ,by book_author, by book_edition using recursi...	Prolog program to search book by book_title ,by book_author, by book_edition using recursion Prolog program to search book by book_title ,by book_author, by book_edition using recursion prolog recursion Prolog book_title book_author book_edition the_design_of_everyday_things don_normas third_edition elementary_statisti...	[ -0.0036163330078125, 0.01123046875, 0.01312255859375, 0.015869140625, -0.0133056640625, 0.01202392578125, -0.009033203125, 0.00225830078125, 0.0052490234375, -0.042724609375, 0.00732421875, -0.0244140625, -0.0267333984375, -0.0048828125, 0.040283203125, -0.00083160400390625, 0.006744...	[ 1250, 4867, 1528, 47, 33938, 12877, 390, 5440, 1272, 1003, 5922, 14660, 17368, 195625, 1830, 502, 34198, 4390, 104643, 5636, 64113, 2301, 60010, 162, 50960, 131830, 17346, 48242, 95528, 2182, 254, 516, 22759, 86595, 2397, 6077, 28966, 94090, ...	[ 0.183837890625, 0.261474609375, 0.14111328125, 0.033111572265625, 0.224365234375, 0.19091796875, 0.111328125, 0.208251953125, 0.0899658203125, 0.1199951171875, 0.085693359375, 0.1614990234375, 0.031890869140625, 0.252197265625, 0.11181640625, 0.1231689453125, 0.158935546875, 0.0552...	embed
37499482_c1	37499482	prolog	1	% a disk from FromIdx to ToIdx starting at state Start moved(FromIdx, ToIdx, Start, Result) :- allowedMove(FromIdx, ToIdx, Start), nth1(FromIdx, Start, [Disk\|OtherDisks]), nth1(ToIdx, Start, ToStack), nth1(FromIdx, Result, OtherDisks), nth1(ToIdx, Result, [Disk\|ToStack]). allowedMove(FromIdx, ToIdx, State) :- number(F...	% a disk from FromIdx to ToIdx starting at state Start moved(FromIdx, ToIdx, Start, Result) :- allowedMove(FromIdx, ToIdx, Start), nth1(FromIdx, Start, [Disk\|OtherDisks]), nth1(ToIdx, Start, ToStack), nth1(FromIdx, Result, OtherDisks), nth1(ToIdx, Result, [Disk\|ToStack]). allowedMove(FromIdx, ToIdx, State) :- number(F...	[ -0.0224609375, 0.000965118408203125, 0.01287841796875, 0.017822265625, -0.00799560546875, 0.0159912109375, -0.006500244140625, 0.00927734375, 0.0208740234375, -0.050537109375, 0.0024566650390625, 0.041259765625, -0.011474609375, 0.00159454345703125, -0.02197265625, -0.0152587890625, ...	[ 1745, 28338, 1295, 28090, 568, 71, 425, 47, 717, 72134, 99, 11341, 13794, 109133, 168407, 126684, 107003, 9083, 272, 653, 927, 418, 6581, 9319, 44456, 7763, 42378, 64511, 22836, 14012, 397, 1528, 37202, 4488, 5792, 72803, 26818, 31635, 2714...	[ 0.0848388671875, 0.1876220703125, 0.07568359375, 0.2113037109375, 0.0860595703125, 0.0941162109375, 0.19384765625, 0.05389404296875, 0.16064453125, 0.07171630859375, 0.002685546875, 0.1348876953125, 0.148193359375, 0.1854248046875, 0.2095947265625, 0.1717529296875, 0.19287109375, 0...	embed
52614867_c1	52614867	prolog	1	father(X,Y) :- parent(X,Y), male(X). % grandfather(X,Y) :- X is the grandfather of Y. grandfather(X,Y) :- father(X,P), parent(P,Y). % brother(X,Y) :- X is the brother of Y. brother(X,Y) :- parent(P,X), parent(P,Y), male(X), X \= Y. % uncle(X,Y) :- X is the uncle of Y. uncle(X,Y) :- brother(X,P), parent(P,Y). % female(...	father(X,Y) :- parent(X,Y), male(X). % grandfather(X,Y) :- X is the grandfather of Y. grandfather(X,Y) :- father(X,P), parent(P,Y). % brother(X,Y) :- X is the brother of Y. brother(X,Y) :- parent(P,X), parent(P,Y), male(X), X \= Y. % uncle(X,Y) :- X is the uncle of Y. uncle(X,Y) :- brother(X,P), parent(P,Y). % female(...	[ 0.01470947265625, 0.00927734375, 0.01611328125, 0.01141357421875, -0.0252685546875, 0.0093994140625, -0.018310546875, 0.0021514892578125, 0.0031585693359375, -0.0203857421875, -0.00066375732421875, -0.0252685546875, -0.002838134765625, 0.018310546875, 0.0036468505859375, -0.00014495849...	[ 67373, 132, 1542, 4, 1723, 15772, 49129, 247, 11280, 194, 1745, 9963, 1021, 9319, 1193, 83, 70, 111, 990, 5, 683, 82953, 51, 11030, 117776, 3445, 1328, 114015, 1556, 454, 1681, 10, 775, 139505, 136, 3789, 71390, 19729, 60502, 1290, 3584...	[ 0.271484375, 0.04541015625, 0.1614990234375, 0.0933837890625, 0.1956787109375, 0.1904296875, 0.23828125, 0.07672119140625, 0.1585693359375, 0.0892333984375, 0.147216796875, 0.1552734375, 0.19677734375, 0.1865234375, 0.1646728515625, 0.1331787109375, 0.050384521484375, 0.09478759765...	embed
56221482_c0	56221482	prolog	0	Title: Hints to understand splendid program to solve Queens Problem title: Hints to understand splendid program to solve Queens Tags: n-queens, prolog Problem: Hints to understand splendid program to solve Queens In Art of Prolog of Sterling & Shapiro, exercise Section 14.1 (v): queens(N,Qs) :- length(Qs,N), place_quee...	Hints to understand splendid program to solve Queens Hints to understand splendid program to solve Queens n-queens prolog Hints Queens place_queens _Qs _Ups _Downs Ups Downs I-1 place_queen UnplacedQs SafeQs UnplacedQs1 Y-N Hints to understand splendid program to solve Queens In Art of Prolog of Sterling & Shapiro, exe...	[ 0.008056640625, 0.007568359375, 0.0233154296875, 0.0037841796875, -0.000354766845703125, -0.00970458984375, 0.007110595703125, -0.01153564453125, 0.01470947265625, -0.0269775390625, -0.00390625, 0.01300048828125, 0.001708984375, -0.00836181640625, -0.005523681640625, -0.001800537109375...	[ 19895, 933, 28219, 85453, 1528, 86869, 44109, 7, 653, 944, 1755, 502, 4867, 3687, 2737, 53234, 8331, 7710, 10091, 49472, 87, 5759, 23935, 115527, 990, 839, 4713, 111, 1250, 94358, 2069, 619, 102444, 81979, 6370, 418, 334, 10, 534, 124519,...	[ 0.1671142578125, 0.06439208984375, 0.1463623046875, 0.225341796875, 0.2274169921875, 0.169921875, 0.194091796875, 0.0909423828125, 0.0782470703125, 0.1285400390625, 0.1240234375, 0.1158447265625, 0.181640625, 0.1195068359375, 0.110595703125, 0.0953369140625, 0.01519775390625, 0.065...	embed
70105487_c0	70105487	prolog	0	Title: Find non overlapping times Problem title: Find non overlapping times Tags: prolog, schedule Problem: Find non overlapping times I'm given a serie of university subjects with their lessons time and I have to find all non overlapping subjects to make a schedule. This is what I have so far %% lesson(+Day: atom, +Be...	Find non overlapping times Find non overlapping times prolog schedule Find Day Begin End Lessons Name Course SRE PAV DSI COM TSB TCO PYE LEG Subjects Find non overlapping times I'm given a serie of university subjects with their lessons time and I have to find all non overlapping subjects to make a schedule. This is wh...	[ -0.0137939453125, 0.0211181640625, 0.014404296875, 0.00262451171875, -0.030029296875, -0.0274658203125, -0.0089111328125, -0.00156402587890625, -0.005279541015625, -0.036865234375, -0.000385284423828125, 0.006744384765625, 0.0037841796875, -0.00186920166015625, 0.0027008056640625, 0.01...	[ 26040, 351, 645, 143, 26783, 20028, 502, 4867, 80889, 10013, 121427, 18878, 1734, 42182, 15757, 154162, 11766, 856, 9902, 31436, 36474, 9688, 46445, 133573, 94341, 34475, 6432, 152363, 28368, 182417, 1733, 765, 7413, 756, 2060 ]	[ 0.14794921875, 0.2059326171875, 0.12359619140625, 0.157470703125, 0.1595458984375, 0.19873046875, 0.1328125, 0.1712646484375, 0.2215576171875, 0.0753173828125, 0.05157470703125, 0.0751953125, 0.04766845703125, 0.047393798828125, 0.0162353515625, 0.10003662109375, 0.0760498046875, 0...	embed
12055249_c0	12055249	prolog	0	Title: SWI-Prolog, first delete an element then reverse the resulting list Problem title: SWI-Prolog, first delete an element then reverse the resulting list Tags: prolog, list Problem: SWI-Prolog, first delete an element then reverse the resulting list I currently have my head wrapped around this issue - its driving m...	SWI-Prolog, first delete an element then reverse the resulting list SWI-Prolog, first delete an element then reverse the resulting list prolog list SWI-Prolog List RevList Elements Accu Element Tail Tail1 delete_reverse SWI-Prolog, first delete an element then reverse the resulting list I currently have my head wrapped...	[ -0.0010528564453125, 0.025390625, 0.00032806396484375, 0.0029754638671875, -0.0247802734375, 0.0152587890625, 0.007080078125, 0.00029754638671875, 0.027587890625, -0.021240234375, 0.0172119140625, 0.0184326171875, -0.004486083984375, -0.000896453857421875, 0.01708984375, 0.000915527343...	[ 159, 38969, 10752, 4867, 5117, 154109, 12830, 7068, 39531, 184, 16750, 5303, 502, 32036, 80893, 154663, 48325, 29899, 34, 1218, 379, 418, 107, 37676, 31089, 6863, 132442, 116666, 1250, 100094, 62822, 31577, 1295, 442, 54, 6097, 32354, 84797, ...	[ 0.046051025390625, 0.21728515625, 0.1358642578125, 0.1929931640625, 0.099609375, 0.2347412109375, 0.190185546875, 0.09521484375, 0.2437744140625, 0.16552734375, 0.10888671875, 0.1793212890625, 0.103271484375, 0.06298828125, 0.083984375, 0.1021728515625, 0.1461181640625, 0.059631347...	embed
23243326_c0	23243326	prolog	0	Title: Can Prolog make rules based on the facts available? Problem title: Can Prolog make rules based on the facts available? Tags: prolog, logic, artificial-intelligence Problem: Can Prolog make rules based on the facts available? For example if there are facts of who likes which color and everyone likes green, but no...	Can Prolog make rules based on the facts available? Can Prolog make rules based on the facts available? prolog logic artificial-intelligence Can Prolog Can Prolog make rules based on the facts available? For example if there are facts of who likes which color and everyone likes green, but not everyone likes pink: likes...	[ 0.01611328125, 0.015380859375, 0.001434326171875, 0.0277099609375, -0.0002593994140625, 0.0235595703125, 0.00439453125, 0.00823974609375, -0.0019683837890625, -0.0283203125, -0.01416015625, -0.0213623046875, -0.004730224609375, 0.01287841796875, 0.01239013671875, 0.0159912109375, 0.0...	[ 4171, 1250, 4867, 3249, 91736, 35509, 98, 15824, 7, 19882, 502, 62775, 66733, 130687, 2750, 1884, 10576, 30309, 50997, 1284, 959, 77233, 1542, 29568, 756, 1193, 831, 209303, 16750, 100, 90, 4677, 127501, 3395, 3173, 117776, 112, 1272, 11280...	[ 0.10137939453125, 0.19970703125, 0.283203125, 0.097900390625, 0.2271728515625, 0.1561279296875, 0.07586669921875, 0.2071533203125, 0.1279296875, 0.2081298828125, 0.1312255859375, 0.130859375, 0.1038818359375, 0.111328125, 0.032318115234375, 0.2081298828125, 0.157958984375, 0.135253...	embed
33738611_c0	33738611	prolog	0	Title: Term-expansion workflows Problem title: Term-expansion workflows Tags: prolog, logtalk Problem: Term-expansion workflows I'm adding library support for common term-expansion workflows (1). Currently, I have defined a "set" workflow, where sets of term-expansion rules (2) are tried until one of them succeeds, and...	Term-expansion workflows Term-expansion workflows prolog logtalk Term-expansion term_expansion goal_expansion Term-expansion workflows I'm adding library support for common term-expansion workflows (1). Currently, I have defined a "set" workflow, where sets of term-expansion rules (2) are tried until one of them succee...	[ 0.0283203125, 0.01055908203125, -0.019775390625, 0.041259765625, -0.004852294921875, -0.0205078125, -0.0062255859375, 0.0034027099609375, 0.003082275390625, -0.007232666015625, 0.0242919921875, 0.015869140625, -0.00115203857421875, 0.0068359375, -0.005157470703125, 0.00604248046875, ...	[ 2994, 39, 83613, 66, 6889, 4488, 118664, 502, 4867, 12684, 139109, 13579, 69236, 154107, 35773, 1294, 8060, 39210, 61924, 3509, 5423, 91736, 1737, 37842, 214493, 1434, 26338, 86, 14700, 50339, 115081, 11737, 137158, 2256, 82091, 40715, 138155, ...	[ 0.171875, 0.0736083984375, 0.1248779296875, 0.175537109375, 0.0740966796875, 0.1204833984375, 0.251708984375, 0.07025146484375, 0.1787109375, 0.09686279296875, 0.25732421875, 0.242431640625, 0.2125244140625, 0.0626220703125, 0.1429443359375, 0.0689697265625, 0.147705078125, 0.09667...	embed
53008160_c0	53008160	prolog	0	Title: Cannot get right output while doing prolog implementation of getting all unique vertices from the graph Problem title: Cannot get right output while doing prolog implementation of getting all unique vertices from the graph Tags: prolog Problem: Cannot get right output while doing prolog implementation of getting...	Cannot get right output while doing prolog implementation of getting all unique vertices from the graph Cannot get right output while doing prolog implementation of getting all unique vertices from the graph prolog the Cannot Cannot get right output while doing prolog implementation of getting all unique vertices from ...	[ 0.004302978515625, 0.0142822265625, 0.0242919921875, -0.017578125, -0.0037384033203125, -0.0101318359375, -0.0101318359375, 0.0113525390625, 0.00238037109375, -0.0120849609375, 0.01275634765625, 0.0084228515625, 0.017333984375, -0.000934600830078125, -0.0036468505859375, 0.028076171875...	[ 10869, 2046, 7108, 140992, 502, 4867, 208124, 20949, 756, 36998, 95378, 5170, 1295, 41382, 12960, 20594, 33022, 1653, 2063, 67, 11549, 724, 339, 8110, 214493, 10750, 527, 3173, 116, 138, 201, 5303, 81887, 86869, 2967, 20653, 6713, 144851, 1...	[ 0.1055908203125, 0.085693359375, 0.148681640625, 0.218505859375, 0.1412353515625, 0.21337890625, 0.1419677734375, 0.0621337890625, 0.093994140625, 0.2060546875, 0.1822509765625, 0.06549072265625, 0.0258331298828125, 0.1729736328125, 0.011383056640625, 0.00115966796875, 0.079711914062...	embed
46510034_c0	46510034	prolog	0	Title: Reducing Predicate calls Problem title: Reducing Predicate calls Tags: prolog, list Problem: Reducing Predicate calls I have this predicate: check_matrix([[_, E2, E3], [E4, E5, E6], [E7, E8, E9]]) :- E5 = E9, is_valid([E4, E5, E6]), is_valid([E7, E8, R9]), is_valid([E2, E5, E8]), is_valid([E3, E6, E9]). Which ch...	Reducing Predicate calls Reducing Predicate calls prolog list Reducing Predicate check_matrix is_valid Reducing Predicate calls I have this predicate: Which checks if my 2 x 2 matrix is valid, with the top left cell, _ being completely ignored.The E2 , E3 , E4 and E7 cells are just headers for the 2 x 2 matrix. Is thei...	[ -0.01214599609375, -0.0130615234375, 0.0250244140625, 0.01348876953125, -0.004638671875, 0.003936767578125, -0.03515625, -0.005706787109375, 0.0196533203125, -0.0224609375, 0.0191650390625, -0.005523681640625, 0.0035858154296875, 0.0002841949462890625, -0.0218505859375, 0.0089721679687...	[ 6096, 34, 21896, 7145, 2063, 67, 11782, 502, 4867, 5303, 12765, 192, 87427, 83, 7013, 1653, 2174, 759, 116, 1022, 50944, 425, 35604, 2663, 25737, 38750, 101, 8035, 64557, 124962, 241, 304, 363, 617, 966, 10336, 1314, 2363, 10443, 71, 20...	[ 0.15185546875, 0.1488037109375, 0.1031494140625, 0.1728515625, 0.1944580078125, 0.061370849609375, 0.1827392578125, 0.116455078125, 0.1883544921875, 0.13720703125, 0.19384765625, 0.0697021484375, 0.1121826171875, 0.160400390625, 0.1842041015625, 0.1519775390625, 0.03961181640625, 0...	embed
8295069_c0	8295069	prolog	0	Title: prolog list out every possible path of the recursion Problem title: prolog list out every possible path of the recursion Tags: prolog, recursion, path Problem: prolog list out every possible path of the recursion I would like to list out every possible path country(england,france). country(france,bulgaria). coun...	prolog list out every possible path of the recursion prolog list out every possible path of the recursion prolog recursion path get_waypoints Start End Waypoint Result _31242 _31243 _31332 _31333 _31422 _31423 _31602 _31603 prolog list out every possible path of the recursion I would like to list out every possible pat...	[ 0.018310546875, 0.0010833740234375, 0.00592041015625, 0.0004730224609375, -0.0198974609375, -0.0020751953125, -0.02099609375, -0.003204345703125, 0.006866455078125, -0.03662109375, -0.00128173828125, -0.0186767578125, -0.03369140625, -0.00567626953125, -0.008544921875, -0.0186767578125...	[ 502, 4867, 5303, 1810, 11907, 7722, 60875, 111, 195625, 1830, 2046, 7514, 38496, 13794, 18878, 42261, 126684, 5016, 2357, 304, 363, 123128, 66000, 101, 4015, 3742, 37321, 1884, 2146, 19236, 18929, 188, 1193, 47, 990, 3794, 1542, 1723, 22489...	[ 0.1761474609375, 0.2396240234375, 0.14697265625, 0.1134033203125, 0.156982421875, 0.190185546875, 0.252197265625, 0.048553466796875, 0.2056884765625, 0.10302734375, 0.0611572265625, 0.137451171875, 0.214599609375, 0.1038818359375, 0.1260986328125, 0.142578125, 0.1483154296875, 0.07...	embed
42266204_c0	42266204	prolog	0	Title: Solving an arithmetic expression with multiple answers (Vietnamese Math Maze) Problem title: Solving an arithmetic expression with multiple answers (Vietnamese Math Maze) Tags: prolog Problem: Solving an arithmetic expression with multiple answers (Vietnamese Math Maze) I have to try and solve this Vietnamese ma...	Solving an arithmetic expression with multiple answers (Vietnamese Math Maze) Solving an arithmetic expression with multiple answers (Vietnamese Math Maze) prolog Solving Vietnamese Math Maze Solving an arithmetic expression with multiple answers (Vietnamese Math Maze) I have to try and solve this Vietnamese math chall...	[ -0.0040283203125, -0.021484375, -0.0031585693359375, 0.02294921875, 0.028076171875, 0.037841796875, -0.01220703125, 0.0245361328125, -0.00112152099609375, -0.04248046875, 0.01287841796875, 0.00799560546875, 0.00176239013671875, 0.000713348388671875, 0.0087890625, 0.01165771484375, -0...	[ 6678, 6496, 8962, 282, 125195, 678, 48716, 35166, 6609, 126, 11627, 78804, 29678, 13, 502, 4867, 39272, 7717, 142, 9790, 86869, 903, 48909, 66801, 32116, 3378, 175201, 74070, 7, 43210, 73, 2606, 1297, 1760, 24301, 11354, 4398, 53927, 246, ...	[ 0.1177978515625, 0.056427001953125, 0.108642578125, 0.016571044921875, 0.201904296875, 0.089111328125, 0.2032470703125, 0.2059326171875, 0.1221923828125, 0.1563720703125, 0.14111328125, 0.1326904296875, 0.135986328125, 0.1055908203125, 0.1656494140625, 0.22265625, 0.268310546875, 0...	embed
65238264_c0	65238264	prolog	0	Title: Why Do i receive "Singleton variable" warning and incorrect result? Problem title: Why Do i receive "Singleton variable" warning and incorrect result? Tags: prolog Problem: Why Do i receive "Singleton variable" warning and incorrect result? i'm writing a simple function in prolog (beginer). F...	Why Do i receive "Singleton variable" warning and incorrect result? Why Do i receive "Singleton variable" warning and incorrect result? prolog Why Singleton Delta _1344 _1346 Why Do i receive "Singleton variable" warning and incorrect result? i'm writing a simple function in prolog (beginer). Functi...	[ -0.0026397705078125, -0.00909423828125, -0.00787353515625, -0.010009765625, -0.03515625, -0.005615234375, 0.0021820068359375, -0.0194091796875, 0.005584716796875, 0.0010223388671875, -0.00860595703125, 0.00164031982421875, -0.010986328125, -0.02001953125, 0.01104736328125, 0.0036621093...	[ 44084, 17, 53299, 213039, 1507, 77336, 1631, 592, 136, 214552, 16750, 502, 4867, 43609, 56588, 2681, 12465, 9271, 32562, 8781, 32354, 43934, 20037, 28670, 10763, 74481, 29458, 10644, 68587, 9523, 5490, 5526, 26785, 11675, 6977, 114453, 8966, ...	[ 0.09912109375, 0.042205810546875, 0.0889892578125, 0.2451171875, 0.24951171875, 0.2880859375, 0.1580810546875, 0.1116943359375, 0.0469970703125, 0.2021484375, 0.1546630859375, 0.125244140625, 0.1973876953125, 0.2147216796875, 0.211181640625, 0.07623291015625, 0.2135009765625, 0.170...	embed
41132468_c1	41132468	prolog	1	findall(edge(Grafo,X,Y),(X = A1),ListaAux2), % Pueden haber repetidos y no se eliminan. append(ListaAux2,ListaAux1,AristasArana). zpider(edge(Grafo,X1,Y1),AristasTotales,AristasArana) :- member(edge(Grafo,A1,A2), AristasTotales), X1 = A1, Y1 \= A2, findall(edge(Grafo,X,Y),(Y = A1),ListaAux1), findall(edge(Grafo,X,Y),(...	findall(edge(Grafo,X,Y),(X = A1),ListaAux2), % Pueden haber repetidos y no se eliminan. append(ListaAux2,ListaAux1,AristasArana). zpider(edge(Grafo,X1,Y1),AristasTotales,AristasArana) :- member(edge(Grafo,A1,A2), AristasTotales), X1 = A1, Y1 \= A2, findall(edge(Grafo,X,Y),(Y = A1),ListaAux1), findall(edge(Grafo,X,Y),(...	[ 0, -0.00384521484375, 0.015869140625, 0.012451171875, -0.00823974609375, -0.0125732421875, -0.0089111328125, 0.0034637451171875, 0.015869140625, -0.0286865234375, 0.0277099609375, 0.0303955078125, 0.00390625, -0.0135498046875, 0.028076171875, 0.0128173828125, 0.005279541015625, 0.0...	[ 7413, 5584, 297, 429, 37878, 3584, 1542, 1723, 62, 17727, 866, 1035, 6077, 10461, 1745, 103685, 13461, 57346, 1140, 110, 40, 27169, 19, 114689, 304, 7614, 12803, 15846, 97, 26715, 42, 169473, 32786, 284, 1172, 1193, 418, 990, 28271, 1528,...	[ 0.187744140625, 0.2132568359375, 0.1748046875, 0.119873046875, 0.13525390625, 0.1405029296875, 0.1092529296875, 0.0880126953125, 0.0941162109375, 0.061676025390625, 0.0872802734375, 0.09710693359375, 0.137451171875, 0.07427978515625, 0.071533203125, 0.087646484375, 0.1429443359375, ...	embed
37148350_c0	37148350	prolog	0	Title: How to determine the outcome of queries for constraint logic programming Problem title: How to determine the outcome of queries for constraint logic programming Tags: clpfd, prolog, swi-prolog Problem: How to determine the outcome of queries for constraint logic programming I am doing some revision for constrain...	How to determine the outcome of queries for constraint logic programming How to determine the outcome of queries for constraint logic programming clpfd prolog swi-prolog How Consider Some SWI-Prolog Indicate How to determine the outcome of queries for constraint logic programming I am doing some revision for constraint...	[ 0.0152587890625, 0.01348876953125, 0.01263427734375, 0.00927734375, 0.00162506103515625, -0.00173187255859375, -0.01300048828125, -0.01458740234375, -0.0024871826171875, 0.006439208984375, -0.005340576171875, -0.0211181640625, 0.0002956390380859375, 0.009765625, 0.01055908203125, 0.021...	[ 11249, 47, 83324, 70, 184345, 111, 41, 10484, 100, 158, 2816, 4288, 62775, 56037, 33139, 39557, 71, 502, 4867, 2452, 3454, 137399, 159, 38969, 10752, 110061, 111666, 12301, 25632, 1653, 2063, 50339, 26785, 9655, 26458, 36766, 959, 35166, 12...	[ 0.0640869140625, 0.0130615234375, 0.1630859375, 0.033660888671875, 0.224609375, 0.0858154296875, 0.156494140625, 0.1600341796875, 0.054443359375, 0.06512451171875, 0.173095703125, 0.098388671875, 0.158203125, 0.12451171875, 0.0079345703125, 0.047119140625, 0.064453125, 0.1072998046...	embed
19634452_c0	19634452	prolog	0	Title: Sorting in Prolog Problem title: Sorting in Prolog Tags: prolog, sorting, list Problem: Sorting in Prolog I have a data structure in Prolog like this: racks = [ [ (1-1), 1, [ shelf((0-0), 1, [ware_a:[0,10]]), shelf((0-1), 2, []), shelf((0-2), 3, []) ] ], [ (2-1), 2, [ shelf((0-0), 4, []), shelf((0-1), 5, []), sh...	Sorting in Prolog Sorting in Prolog prolog sorting list Sorting Prolog ware_a ware_c ware_b Sorting in Prolog I have a data structure in Prolog like this: One rack has coordinate (x-y) (for example (1-1)) and a cost value and a list of shelfs. A shelf itself has the same, a coordinate (within the rack), a cost value an...	[ 0.01556396484375, 0.01214599609375, -0.000850677490234375, -0.0074462890625, 0.00830078125, -0.017333984375, -0.01324462890625, -0.00469970703125, -0.002655029296875, -0.014892578125, 0.0147705078125, 0.0244140625, -0.0120849609375, -0.01312255859375, 0.00153350830078125, -0.0153198242...	[ 53666, 214, 23, 1250, 4867, 502, 12096, 5303, 105816, 11, 238, 275, 2053, 45646, 6561, 86147, 176866, 13, 53, 110218, 11034, 34292, 2412, 17463, 68034, 5701, 76228, 10941, 15876, 71924, 1528, 7722, 12989, 673, 22824, 55681, 157318, 207116, ...	[ 0.2138671875, 0.08355712890625, 0.057403564453125, 0.178466796875, 0.2568359375, 0.118408203125, 0.2152099609375, 0.197998046875, 0.2081298828125, 0.027191162109375, 0.02178955078125, 0.0743408203125, 0.0872802734375, 0.1307373046875, 0.0251617431640625, 0.1513671875, 0.1700439453125...	embed
33979305_c0	33979305	prolog	0	Title: Prolog Second Minimum value on a list Problem title: Prolog Second Minimum value on a list Tags: prolog, logic Problem: Prolog Second Minimum value on a list I am new to prolog and Im looking for some advice. I am working in building a code that defines a predicate secondMin/2 with the signature secondMin(list, ...	Prolog Second Minimum value on a list Prolog Second Minimum value on a list prolog logic Prolog Second Minimum Min2 Error List Min Min1 Prolog Second Minimum value on a list I am new to prolog and Im looking for some advice. I am working in building a code that defines a predicate secondMin/2 with the signature secondM...	[ -0.004608154296875, -0.009033203125, 0.0181884765625, 0.01007080078125, -0.005645751953125, 0.037841796875, -0.00616455078125, -0.0101318359375, 0.0034332275390625, -0.004669189453125, 0.00701904296875, -0.002655029296875, 0.017822265625, -0.01953125, 0.01519775390625, 0.0225830078125,...	[ 1250, 4867, 77648, 173858, 34292, 98, 5303, 502, 62775, 4211, 304, 212059, 32036, 418, 3525, 67660, 20697, 33976, 18151, 61924, 1653, 2063, 17932, 59076, 12477, 138256, 6562, 10461, 459, 25617, 12830, 101935, 10846, 6626, 80854, 44116, 18468, ...	[ 0.1412353515625, 0.2015380859375, 0.19482421875, 0.2464599609375, 0.1905517578125, 0.036895751953125, 0.1947021484375, 0.121337890625, 0.124267578125, 0.218017578125, 0.1417236328125, 0.1866455078125, 0.1295166015625, 0.05810546875, 0.02374267578125, 0.04150390625, 0.0076904296875, ...	embed
4060102_c0	4060102	prolog	0	Title: Logically Handling Lists Problem title: Logically Handling Lists Tags: list, prolog, prolog-findall Problem: Logically Handling Lists I have a large number of facts within my program, listing developers and designers in a company, as well as previous projects, like so.. % project(Project Name,Year) project(efnet...	Logically Handling Lists Logically Handling Lists list prolog prolog-findall Logically Handling Lists Project Name Year Role jane_cole alex_tobbs Single List Employees projects_of_all Staff Projects Logically Handling Lists I have a large number of facts within my program, listing developers and designers in a company,...	[ 0.0126953125, 0.0027008056640625, -0.0023651123046875, 0.032958984375, -0.0128173828125, 0.01422119140625, -0.0189208984375, -0.01287841796875, 0.01153564453125, -0.02734375, -0.0034027099609375, -0.020751953125, 0.0019683837890625, 0.01708984375, 0.009033203125, 0.0059814453125, 0.0...	[ 13146, 71407, 193237, 32036, 5303, 502, 4867, 111607, 5584, 27331, 15757, 42552, 2777, 47363, 46813, 662, 425, 188, 5125, 7, 43609, 31678, 365, 1033, 77635, 4390, 112006, 765, 21334, 14012, 15824, 28032, 759, 1528, 106001, 136, 51517, 14380, ...	[ 0.21044921875, 0.149169921875, 0.270263671875, 0.252685546875, 0.1932373046875, 0.12255859375, 0.1949462890625, 0.1260986328125, 0.2279052734375, 0.16650390625, 0.037109375, 0.080078125, 0.0706787109375, 0.1644287109375, 0.1910400390625, 0.0777587890625, 0.1038818359375, 0.08703613...	embed
21686479_c0	21686479	prolog	0	Title: Prolog, testing labeling heuristics Problem title: Prolog, testing labeling heuristics Tags: sicstus-prolog, clpfd, prolog Problem: Prolog, testing labeling heuristics I'm working on some experiments for comparing different labeling heuristics in Sicstus Prolog. But I keep getting into 'Resource error: insuffici...	Prolog, testing labeling heuristics Prolog, testing labeling heuristics sicstus-prolog clpfd prolog Prolog use_module all_distinct _SinceLast SinceLast Labeling Testcode Prolog, testing labeling heuristics I'm working on some experiments for comparing different labeling heuristics in Sicstus Prolog. But I keep getting ...	[ -0.0029449462890625, -0.00970458984375, -0.0106201171875, 0.00225830078125, -0.00032806396484375, -0.0174560546875, -0.013671875, 0.014404296875, 0.0030517578125, -0.06640625, 0.0274658203125, -0.007476806640625, -0.0029754638671875, 0.00482177734375, 0.01531982421875, 0.00059509277343...	[ 1250, 4867, 134234, 67967, 214, 764, 62210, 26536, 18253, 3454, 33139, 39557, 71, 502, 4527, 83279, 756, 46295, 38893, 42380, 2729, 271, 66016, 129214, 8647, 40899, 41637, 20697, 28007, 37397, 12921, 63457, 13695, 4332, 60427, 18499, 129980, ...	[ 0.171142578125, 0.24951171875, 0.1378173828125, 0.2293701171875, 0.0811767578125, 0.04083251953125, 0.1710205078125, 0.07244873046875, 0.234619140625, 0.121826171875, 0.001861572265625, 0.042572021484375, 0.07171630859375, 0.12060546875, 0.0677490234375, 0.114501953125, 0.08282470703...	embed
75213885_c0	75213885	prolog	0	Title: Reversible CSV parsing Problem title: Reversible CSV parsing Tags: prolog, csv, swi-prolog Problem: Reversible CSV parsing Prolog newbie here. In SWI Prolog, I'm trying to figure out how to parse a simple line of CSV reversibly, but I'm stuck. Here's what I've got: csvstring1(S, L) :- split_string(S, ',', ',', T...	Reversible CSV parsing Reversible CSV parsing prolog csv swi-prolog Reversible CSV csvstring1 split_string atom_number csvstring2 atomic_list_concat csvstring3 ERROR Arguments Reversible CSV parsing Prolog newbie here. In SWI Prolog, I'm trying to figure out how to parse a simple line of CSV reversibly, but I'm stuck. ...	[ -0.00823974609375, 0.019287109375, 0.0147705078125, 0.0296630859375, -0.01324462890625, 0.020263671875, 0.0113525390625, 0.01806640625, 0.0029144287109375, -0.000919342041015625, -0.01409912109375, 0.00004124641418457031, 0.003814697265625, 0.016357421875, 0.00156402587890625, 0.018554...	[ 853, 814, 55356, 313, 43486, 366, 502, 4867, 20763, 334, 2452, 3454, 91693, 418, 65450, 34627, 2606, 304, 6562, 4460, 363, 151206, 24638, 112140, 1250, 9014, 159, 38969, 26366, 184, 8781, 13315, 39531, 172, 38526, 179933, 136, 4488, 2472, ...	[ 0.076171875, 0.202392578125, 0.17919921875, 0.06866455078125, 0.273681640625, 0.15478515625, 0.09320068359375, 0.169677734375, 0.072265625, 0.1783447265625, 0.1697998046875, 0.111328125, 0.16259765625, 0.0162506103515625, 0.1085205078125, 0.1419677734375, 0.06256103515625, 0.060058...	embed
65789776_c0	65789776	prolog	0	Title: Can Prolog facts be used for adversarial search? Problem title: Can Prolog facts be used for adversarial search? Tags: prolog, search Problem: Can Prolog facts be used for adversarial search? One can search the full tic tac toe game tree, using only fail fast optimization of negation as failure, in less that 100...	Can Prolog facts be used for adversarial search? Can Prolog facts be used for adversarial search? prolog search Can Prolog CPU Lips Can Prolog facts be used for adversarial search? One can search the full tic tac toe game tree, using only fail fast optimization of negation as failure, in less that 100ms. Thats what thi...	[ 0.01806640625, -0.0162353515625, 0.020263671875, 0.029541015625, -0.0059814453125, -0.0167236328125, 0.004180908203125, -0.01507568359375, -0.0074462890625, -0.04833984375, -0.00396728515625, 0.029541015625, -0.019775390625, 0.01416015625, -0.00750732421875, -0.01708984375, 0.0192871...	[ 4171, 1250, 4867, 15824, 7, 11814, 100, 172096, 289, 33938, 502, 86039, 156903, 831, 4393, 96212, 36322, 4375, 6712, 53201, 17368, 4734, 35782, 4271, 87235, 108, 125682, 237, 137578, 40715, 805, 4432, 29806, 14505, 18811, 11341, 11001, 13579,...	[ 0.0531005859375, 0.1732177734375, 0.266845703125, 0.2034912109375, 0.1015625, 0.1370849609375, 0.035888671875, 0.1929931640625, 0.1180419921875, 0.2288818359375, 0.109619140625, 0.1624755859375, 0.1783447265625, 0.031097412109375, 0.0791015625, 0.1268310546875, 0.1434326171875, 0.1...	embed
5985749_c0	5985749	prolog	0	Title: creating lists, searching sth which has been given and making combination on prolog Problem title: creating lists, searching sth which has been given and making combination on prolog Tags: prolog Problem: creating lists, searching sth which has been given and making combination on prolog I want to make a Prolog ...	creating lists, searching sth which has been given and making combination on prolog creating lists, searching sth which has been given and making combination on prolog prolog creating lists, searching sth which has been given and making combination on prolog I want to make a Prolog program. Predicate will be like this:...	[ 0.0062255859375, -0.01019287109375, 0.00970458984375, 0.036376953125, -0.0203857421875, 0.0230712890625, -0.0038909912109375, 0.01239013671875, 0.00445556640625, -0.03125, 0.01556396484375, -0.005401611328125, 0.0186767578125, -0.000263214111328125, -0.00885009765625, 0.0010986328125, ...	[ 105233, 5303, 7, 157318, 927, 3129, 1556, 2809, 34475, 20662, 162515, 98, 502, 4867, 3444, 3249, 1250, 1528, 7145, 2063, 67, 1884, 187781, 70, 29479, 1653, 9351, 154663, 284, 335, 62, 26950, 123055, 14012, 36663, 450, 96853, 756, 63399, 7...	[ 0.161376953125, 0.23583984375, 0.08160400390625, 0.20947265625, 0.113037109375, 0.0556640625, 0.0936279296875, 0.09619140625, 0.142578125, 0.0673828125, 0.18212890625, 0.04736328125, 0.14990234375, 0.2401123046875, 0.0670166015625, 0.0770263671875, 0.1591796875, 0.1639404296875, ...	embed
40199978_c0	40199978	prolog	0	Title: Filtering and modifiying a list in Prolog Problem title: Filtering and modifiying a list in Prolog Tags: prolog Problem: Filtering and modifiying a list in Prolog Good Day, I have a task such that given a list [3,9,11,2,14], I want to filter out any value greater than 6. I have that working right now. sift([],[]...	Filtering and modifiying a list in Prolog Filtering and modifiying a list in Prolog prolog Filtering Prolog Result CCC ThrowAway Tail Results _G2271 _G2276 _G2281 Filtering and modifiying a list in Prolog Good Day, I have a task such that given a list [3,9,11,2,14], I want to filter out any value greater than 6. I have...	[ 0.01092529296875, 0.029296875, 0.01953125, -0.01031494140625, 0.0184326171875, 0.0002288818359375, -0.0019378662109375, 0.0076904296875, 0.0162353515625, 0.01202392578125, 0.0216064453125, -0.00457763671875, -0.033203125, -0.004730224609375, 0.023681640625, 0.000911712646484375, 0.03...	[ 128896, 136, 73197, 38543, 5303, 1250, 4867, 502, 126684, 134982, 15555, 284, 7514, 1218, 379, 146104, 15770, 11835, 134712, 23, 10013, 66211, 34475, 125157, 1662, 304, 2592, 3444, 46312, 1810, 2499, 34292, 117396, 3501, 2289, 20697, 5036, 30...	[ 0.2646484375, 0.011993408203125, 0.195068359375, 0.08990478515625, 0.2178955078125, 0.1842041015625, 0.266845703125, 0.1304931640625, 0.1112060546875, 0.20751953125, 0.106201171875, 0.003204345703125, 0.15380859375, 0.125, 0.075927734375, 0.1123046875, 0.044830322265625, 0.03001403...	embed
56300386_c0	56300386	prolog	0	Title: How can i make a program in Prolog that recognizes the gender, plurality and case of a noun which the user inputs? Problem title: How can i make a program in Prolog that recognizes the gender, plurality and case of a noun which the user inputs? Tags: prolog, lexicon Problem: How can i make a program in Prolog th...	How can i make a program in Prolog that recognizes the gender, plurality and case of a noun which the user inputs? How can i make a program in Prolog that recognizes the gender, plurality and case of a noun which the user inputs? prolog lexicon How Prolog gr_noun_suffix gr_noun Gender Plurality Singularity Case How can...	[ -0.013427734375, -0.0035858154296875, -0.015380859375, -0.0034332275390625, -0.0024566650390625, 0.0274658203125, 0.004180908203125, 0.01287841796875, -0.00531005859375, -0.020751953125, 0.01019287109375, -0.04052734375, -0.030517578125, -0.0184326171875, -0.00689697265625, 0.009216308...	[ 11249, 17, 3249, 1528, 23, 1250, 4867, 125296, 127501, 97308, 2481, 7225, 110, 309, 38937, 107730, 502, 95, 73140, 19, 4452, 157, 77745, 55923, 527, 23894, 42473, 42, 134393, 53427, 35975, 43731, 831, 91736, 8337, 27781, 2046, 3871, 4568, ...	[ 0.026123046875, 0.0284881591796875, 0.0640869140625, 0.1915283203125, 0.03631591796875, 0.169921875, 0.255126953125, 0.1387939453125, 0.2161865234375, 0.18603515625, 0.042236328125, 0.113525390625, 0.047576904296875, 0.1160888671875, 0.1075439453125, 0.16064453125, 0.1185302734375, ...	embed
42044887_c0	42044887	prolog	0	Title: Prolog - Printing Result After Two Recursive Rules \| Sum of Squares Problem title: Prolog - Printing Result After Two Recursive Rules \| Sum of Squares Tags: prolog, recursion Problem: Prolog - Printing Result After Two Recursive Rules \| Sum of Squares I am brand new to prolog and I feel like there is a concept t...	Prolog - Printing Result After Two Recursive Rules \| Sum of Squares Prolog - Printing Result After Two Recursive Rules \| Sum of Squares prolog recursion Prolog Printing Result After Two Recursive Rules Sum Squares Prolog - Printing Result After Two Recursive Rules \| Sum of Squares I am brand new to prolog and I feel li...	[ -0.005157470703125, 0.0194091796875, 0.01104736328125, 0.0086669921875, -0.017333984375, 0.01275634765625, -0.02197265625, 0.00506591796875, -0.01129150390625, -0.00946044921875, 0.0087890625, -0.02001953125, -0.0037078857421875, 0.00182342529296875, 0.0211181640625, -0.01153564453125,...	[ 1250, 4867, 39754, 126684, 24372, 32964, 853, 48650, 5844, 139118, 36335, 111, 68305, 502, 195625, 3525, 12319, 23755, 35782, 28219, 56282, 27689, 10366, 1830, 31577, 30646, 159, 10554, 108047, 12638, 153939, 39958, 5303, 892, 30957, 38937, 41,...	[ 0.1558837890625, 0.2392578125, 0.1973876953125, 0.183837890625, 0.10498046875, 0.1348876953125, 0.0303955078125, 0.1644287109375, 0.0927734375, 0.181396484375, 0.2181396484375, 0.13720703125, 0.183837890625, 0.14111328125, 0.2125244140625, 0.044158935546875, 0.0235748291015625, 0.1...	embed
39809730_c0	39809730	prolog	0	Title: How to permute in Prolog the elements of a list composed of sub-list and atoms Problem title: How to permute in Prolog the elements of a list composed of sub-list and atoms Tags: prolog, permutation Problem: How to permute in Prolog the elements of a list composed of sub-list and atoms Let us consider lists such...	How to permute in Prolog the elements of a list composed of sub-list and atoms How to permute in Prolog the elements of a list composed of sub-list and atoms prolog permutation How Prolog OriginalList PermutedList How to permute in Prolog the elements of a list composed of sub-list and atoms Let us consider lists such ...	[ -0.005340576171875, 0.005859375, 0.01556396484375, 0.0164794921875, -0.0284423828125, 0.0166015625, -0.0235595703125, 0.003173828125, -0.002044677734375, -0.0233154296875, 0.0098876953125, 0.00830078125, 0.021484375, 0.0255126953125, -0.01422119140625, 0.01190185546875, -0.0015792846...	[ 11249, 47, 117, 561, 67, 23, 1250, 4867, 80854, 5303, 150350, 1614, 6562, 136, 34627, 71, 502, 22062, 34525, 154663, 908, 3674, 16916, 339, 82449, 1126, 80389, 92714, 617, 82761, 5809, 27489, 10644, 50339, 2806, 1884, 756, 7722, 14311, 56...	[ 0.0830078125, 0.00555419921875, 0.1376953125, 0.216064453125, 0.1143798828125, 0.05706787109375, 0.1712646484375, 0.238525390625, 0.1912841796875, 0.189697265625, 0.133056640625, 0.2108154296875, 0.174560546875, 0.05133056640625, 0.194091796875, 0.0113525390625, 0.1312255859375, 0....	embed
33448127_c0	33448127	prolog	0	Title: How to properly express inequality in prolog? Problem title: How to properly express inequality in prolog? Tags: prolog, prolog-dif Problem: How to properly express inequality in prolog? TL;DR: sibling(a,X) succeeds with the answer X = a , but sibling(a,a) fails. I have the following Prolog file: children(a, c)....	How to properly express inequality in prolog? How to properly express inequality in prolog? prolog prolog-dif How How to properly express inequality in prolog? TL;DR: sibling(a,X) succeeds with the answer X = a , but sibling(a,a) fails. I have the following Prolog file: It seems clear enough to me, two person are sibli...	[ 0.01129150390625, 0.00439453125, 0.0169677734375, 0.00762939453125, -0.0283203125, -0.015380859375, -0.006683349609375, -0.00860595703125, 0.0021209716796875, -0.01385498046875, 0.01043701171875, 0.0006256103515625, -0.01385498046875, 0.0281982421875, 0.016357421875, -0.0023193359375, ...	[ 11249, 155965, 36510, 23, 13, 161789, 502, 4867, 420, 23498, 78, 79298, 11, 1542, 214493, 678, 35166, 1193, 2203, 10, 1284, 35782, 1250, 11435, 34735, 6626, 3445, 621, 27863, 5701, 959, 10002, 41, 165132, 114453, 50339, 179140, 123166, 136,...	[ 0.037445068359375, 0.138916015625, 0.1976318359375, 0.10760498046875, 0.131591796875, 0.23388671875, 0.15478515625, 0.23046875, 0.05303955078125, 0.019195556640625, 0.09814453125, 0.1856689453125, 0.07012939453125, 0.105712890625, 0.20166015625, 0.0249176025390625, 0.117431640625, ...	embed
47683361_c0	47683361	prolog	0	Title: Prolog - How can I save results from recursive calls? Problem title: Prolog - How can I save results from recursive calls? Tags: prolog, recursion Problem: Prolog - How can I save results from recursive calls? I am still trying to understand the Prolog logic and have stumbled upon a problem. I am trying to save ...	Prolog - How can I save results from recursive calls? Prolog - How can I save results from recursive calls? prolog recursion recursive main Prolog How Tail Lin Lout Head Prolog - How can I save results from recursive calls? I am still trying to understand the Prolog logic and have stumbled upon a problem. I am trying t...	[ 0.01214599609375, 0.024658203125, 0.0087890625, 0.00012969970703125, -0.01416015625, 0.00677490234375, 0.00194549560546875, -0.001708984375, 0.0147705078125, -0.0238037109375, 0.007110595703125, -0.005340576171875, -0.018310546875, -0.006011962890625, 0.0244140625, -0.009521484375, 0...	[ 1250, 4867, 11249, 831, 30098, 50339, 1295, 195625, 5844, 11782, 7, 87, 502, 1830, 5201, 1218, 379, 25497, 42225, 18, 44816, 28219, 62775, 2967, 31577, 142424, 14037, 28032, 27875, 98, 914, 9319, 7413, 5584, 2046, 856, 50770, 4332, 987, 7...	[ 0.151611328125, 0.2452392578125, 0.0843505859375, 0.07965087890625, 0.2181396484375, 0.2222900390625, 0.1683349609375, 0.2293701171875, 0.181884765625, 0.1893310546875, 0.087158203125, 0.05804443359375, 0.1102294921875, 0.0966796875, 0.1060791015625, 0.065673828125, 0.0701904296875, ...	embed
53947621_c0	53947621	prolog	0	Title: Stop Prolog from inferring values Problem title: Stop Prolog from inferring values Tags: prolog, clpfd Problem: Stop Prolog from inferring values If I run solved([[x, o, o], [o, o, o], [o, o, o]]) it should output true as there is only x and if I run solved([[x, o, o], [o, o, o], [o, o, x]]) it should output fal...	Stop Prolog from inferring values Stop Prolog from inferring values prolog clpfd inferring Stop Prolog use_module rotate_clock Xss Zss Yss rotate_anti BRJ num_x sum_list Sum Rest Stop Prolog from inferring values If I run solved([[x, o, o], [o, o, o], [o, o, o]]) it should output true as there is only x and if I run so...	[ -0.007110595703125, 0.01190185546875, 0.0177001953125, 0.01007080078125, -0.02587890625, 0.018798828125, -0.00604248046875, 0.0086669921875, 0.0048828125, -0.0274658203125, -0.012451171875, -0.0177001953125, 0.01043701171875, 0.00848388671875, 0.01141357421875, 0.01446533203125, 0.00...	[ 42284, 1250, 4867, 1295, 53498, 2852, 142424, 502, 39557, 71, 4527, 83279, 47014, 67, 21135, 1193, 7, 567, 990, 5772, 60310, 13269, 425, 10554, 6562, 36335, 49756, 11675, 86869, 132, 36, 31, 5608, 140992, 29568, 2685, 4734, 1022, 98320, 1...	[ 0.184814453125, 0.1756591796875, 0.260498046875, 0.08770751953125, 0.2235107421875, 0.1353759765625, 0.1971435546875, 0.1201171875, 0.06640625, 0.1046142578125, 0.052520751953125, 0.1112060546875, 0.1256103515625, 0.0692138671875, 0.1656494140625, 0.01983642578125, 0.000152587890625,...	embed
46266676_c1	46266676	prolog	1	_35900) ? creep Call: (12) lists:member(c, [a]) ? creep Fail: (12) lists:member(c, [a]) ? creep Redo: (11) redu([c, a], _35900) ? creep Call: (12) redu([a], _35906) ? creep Call: (13) lists:member(a, []) ? creep Fail: (13) lists:member(a, []) ? creep Redo: (12) redu([a], _35906) ? creep Call: (13) redu([], _35912) ? c...	_35900) ? creep Call: (12) lists:member(c, [a]) ? creep Fail: (12) lists:member(c, [a]) ? creep Redo: (11) redu([c, a], _35900) ? creep Call: (12) redu([a], _35906) ? creep Call: (13) lists:member(a, []) ? creep Fail: (13) lists:member(a, []) ? creep Redo: (12) redu([a], _35906) ? creep Call: (13) redu([], _35912) ? c...	[ -0.003875732421875, 0.0211181640625, 0.021728515625, 0.0250244140625, -0.0086669921875, 0.01031494140625, 0.0223388671875, -0.00164031982421875, 0.02880859375, -0.00445556640625, -0.000835418701171875, -0.0194091796875, 0.0038909912109375, 0.003692626953125, 0.0133056640625, -0.0086669...	[ 101, 5843, 20543, 705, 49512, 254, 26265, 23676, 5303, 27417, 238, 190355, 6096, 31, 21282, 28969, 10, 120301, 110156, 28261, 5443, 17857, 11438, 1193, 501, 6183, 77947, 73342, 163, 6083, 46876, 195625, 1830, 14602, 12301, 70731, 90, 17932, ...	[ 0.049835205078125, 0.1424560546875, 0.2310791015625, 0.0283203125, 0.1773681640625, 0.123046875, 0.195068359375, 0.1376953125, 0.1806640625, 0.14599609375, 0.051788330078125, 0.144775390625, 0.0826416015625, 0.134765625, 0.052001953125, 0.1646728515625, 0.027496337890625, 0.1296386...	embed
29083309_c0	29083309	prolog	0	Title: Generate list of numbers to fit certain criteria Problem title: Generate list of numbers to fit certain criteria Tags: prolog Problem: Generate list of numbers to fit certain criteria I had a predicate to generate a list of numbers, generate_numbers(0,[]). generate_numbers(N,[Head\|Tail]):- N > 0, Head is N, N1 i...	Generate list of numbers to fit certain criteria Generate list of numbers to fit certain criteria prolog Generate generate_numbers Head Tail N-1 X-1 Generate list of numbers to fit certain criteria I had a predicate to generate a list of numbers, I am trying to modify it so that it generates numbers X and Y up to a lim...	[ 0.00174713134765625, -0.00433349609375, -0.0022125244140625, -0.007476806640625, 0.01483154296875, 0.01507568359375, -0.0203857421875, -0.01458740234375, 0.019287109375, -0.0032806396484375, 0.011474609375, 0.0037384033203125, -0.0250244140625, -0.017822265625, 0.020263671875, -0.00402...	[ 155370, 67, 5303, 111, 101935, 47, 11177, 24233, 55738, 11, 502, 4867, 139392, 2606, 1297, 44816, 1218, 379, 541, 5759, 1193, 1653, 2063, 31577, 2811, 40383, 136, 990, 1257, 17475, 27289, 106, 4426, 159, 997, 805, 237875, 26785, 12765, 11...	[ 0.18701171875, 0.038177490234375, 0.2030029296875, 0.047821044921875, 0.2122802734375, 0.0675048828125, 0.189697265625, 0.1224365234375, 0.1898193359375, 0.06829833984375, 0.081787109375, 0.1064453125, 0.2342529296875, 0.1663818359375, 0.165283203125, 0.111572265625, 0.10205078125, ...	embed
63056311_c0	63056311	prolog	0	Title: finding depth of object without use of arithmetics Problem title: finding depth of object without use of arithmetics Tags: prolog, recursion Problem: finding depth of object without use of arithmetics Without using arithmetics (=< , =>, etc.)! I have a few separate piles of blocks, for example two piles. I need ...	finding depth of object without use of arithmetics finding depth of object without use of arithmetics prolog recursion is_on_top Block1 Pile Block2 is_bellow is_higher Any SAME finding depth of object without use of arithmetics Without using arithmetics (=< , =>, etc.)! I have a few separate piles of blocks, for exampl...	[ 0.0011138916015625, 0.0146484375, 0.01513671875, -0.004119873046875, 0.0024871826171875, -0.00689697265625, -0.017578125, -0.0279541015625, 0.00762939453125, -0.0294189453125, 0.005889892578125, -0.01116943359375, 0.0125732421875, -0.01031494140625, 0.0159912109375, -0.02490234375, 0...	[ 90791, 168867, 111, 36746, 15490, 4527, 187, 8962, 282, 41637, 502, 4867, 195625, 1830, 83, 191, 13784, 80231, 418, 13289, 13, 304, 372, 41566, 84396, 56, 28541, 159, 70171, 177417, 17368, 16093, 44357, 84797, 81502, 46389, 6626, 3917, 2636...	[ 0.1624755859375, 0.271240234375, 0.14794921875, 0.198486328125, 0.12109375, 0.074951171875, 0.03900146484375, 0.140625, 0.091064453125, 0.08477783203125, 0.1097412109375, 0.1622314453125, 0.1427001953125, 0.045166015625, 0.04864501953125, 0.116455078125, 0.16455078125, 0.1474609375...	embed
14070576_c0	14070576	prolog	0	Title: Difficulty in Prolog Problem title: Difficulty in Prolog Tags: logic, prolog Problem: Difficulty in Prolog I need to solve a logic problem using Prolog. I have just one problem: In the answer, the name of the attributes doesn't appear. My code to generate the attributes is: gera(p(Prof, AlunosProf, Tema, AlunosT...	Difficulty in Prolog Difficulty in Prolog logic prolog Difficulty Prolog Prof AlunosProf Tema AlunosTema _G2046 _G2053 _G2056 _G2058 Q12 Q22 gera_ef Difficulty in Prolog I need to solve a logic problem using Prolog. I have just one problem: In the answer, the name of the attributes doesn't appear. My code to generate t...	[ 0.0157470703125, 0.000797271728515625, -0.002349853515625, 0.01116943359375, 0.00139617919921875, -0.004913330078125, -0.0400390625, -0.0133056640625, 0.0074462890625, -0.01348876953125, 0.00390625, 0.0155029296875, -0.0005645751953125, 0.004608154296875, -0.0089111328125, 0.0169677734...	[ 191144, 71333, 939, 23, 1250, 4867, 62775, 502, 11739, 53928, 2245, 147161, 17533, 10476, 192, 724, 1549, 9271, 14226, 13683, 10057, 2396, 1530, 4015, 10110, 4240, 3871, 86869, 2967, 17368, 1660, 1632, 35166, 70, 9351, 111, 150380, 90, 2202...	[ 0.189208984375, 0.194091796875, 0.0634765625, 0.1044921875, 0.192138671875, 0.277099609375, 0.1539306640625, 0.1375732421875, 0.12841796875, 0.0989990234375, 0.1439208984375, 0.11572265625, 0.15625, 0.10760498046875, 0.1295166015625, 0.106689453125, 0.048797607421875, 0.16064453125...	embed
59326895_c0	59326895	prolog	0	Title: Sort a list in Prolog Problem title: Sort a list in Prolog Tags: prolog Problem: Sort a list in Prolog The fact base stores exam schedule information in the form: exam ('group', 'subject', 'teacher', date). Write a program that allows you to select exam information for the group / teacher, sorting it by date. So...	Sort a list in Prolog Sort a list in Prolog prolog Sort Prolog PROGRAMMING John MATH ENG Gabe LITERATURE Homer Number Exams Name Before After Sort a list in Prolog The fact base stores exam schedule information in the form: exam ('group', 'subject', 'teacher', date). Write a program that allows you to select exam infor...	[ 0.023681640625, 0.00579833984375, 0.0036773681640625, 0.01287841796875, -0.0233154296875, 0.0068359375, -0.0296630859375, 0.0157470703125, 0.0002899169921875, -0.00946044921875, -0.00830078125, 0.007110595703125, 0.00225830078125, -0.0096435546875, -0.0194091796875, 0.00006055831909179...	[ 53666, 5303, 1250, 4867, 23, 502, 59677, 4939, 139909, 48262, 53186, 13, 16970, 136265, 165471, 2005, 42, 103332, 89536, 15757, 117371, 24372, 15824, 3647, 4343, 42276, 80889, 4677, 3173, 51588, 75161, 17615, 5372, 5622, 18781, 1528, 114864, ...	[ 0.259033203125, 0.2095947265625, 0.186279296875, 0.262939453125, 0.024383544921875, 0.137939453125, 0.10107421875, 0.0869140625, 0.11181640625, 0.06292724609375, 0.0850830078125, 0.08477783203125, 0.01165771484375, 0.037872314453125, 0.0202789306640625, 0.077392578125, 0.090698242187...	embed
78258027_c0	78258027	prolog	0	Title: How to get Prolog to return false when user attempts to backtrack? Problem title: How to get Prolog to return false when user attempts to backtrack? Tags: prolog-toplevel, prolog Problem: How to get Prolog to return false when user attempts to backtrack? I want to make a program in Prolog that prints false when ...	How to get Prolog to return false when user attempts to backtrack? How to get Prolog to return false when user attempts to backtrack? prolog-toplevel prolog How Prolog Predicate backtrack_attempted Reset reset_backtrack_flag Set set_backtrack_flag likes_food Person Food Attempt How to get Prolog to return false when us...	[ 0.017578125, 0.027099609375, 0.016357421875, 0.0062255859375, -0.011962890625, -0.00396728515625, 0.021240234375, 0.00099945068359375, -0.0172119140625, -0.036376953125, -0.0081787109375, 0.0098876953125, -0.0244140625, 0.00537109375, 0.0177001953125, 0.00787353515625, -0.00662231445...	[ 11249, 2046, 1250, 4867, 30646, 98320, 3229, 38937, 81887, 7, 47, 4420, 125728, 502, 13784, 67919, 7145, 2063, 257, 34224, 9624, 126, 168398, 12620, 190872, 19943, 5423, 1884, 49558, 15270, 34562, 1913, 3444, 1528, 28412, 18151, 156377, 100, ...	[ 0.0350341796875, 0.066650390625, 0.19140625, 0.2322998046875, 0.1881103515625, 0.2352294921875, 0.040771484375, 0.118408203125, 0.17626953125, 0.0162811279296875, 0.0528564453125, 0.158447265625, 0.264404296875, 0.098388671875, 0.009735107421875, 0.0845947265625, 0.0914306640625, 0...	embed
27929178_c0	27929178	prolog	0	Title: Step By Step Help For Recursion Problem title: Step By Step Help For Recursion Tags: prolog, recursion Problem: Step By Step Help For Recursion I have gone to many online text tutorials, asked my teacher, attempted to go through questions to gain a more thorough knowledge of recursion however I am still struggli...	Step By Step Help For Recursion Step By Step Help For Recursion prolog recursion Step Help Recursion Step By Step Help For Recursion I have gone to many online text tutorials, asked my teacher, attempted to go through questions to gain a more thorough knowledge of recursion however I am still struggling with understand...	[ 0.01422119140625, 0.01177978515625, 0.00982666015625, 0.017822265625, 0.0067138671875, 0.0218505859375, -0.00909423828125, -0.00555419921875, 0.0167236328125, -0.0174560546875, 0.021484375, -0.0390625, -0.0208740234375, 0.0240478515625, 0.0179443359375, 0.0023651123046875, 0.02148437...	[ 50478, 3311, 39527, 1326, 165428, 42, 6889, 502, 4867, 195625, 1830, 1118, 7986, 57143, 117914, 51359, 7464, 237875, 100094, 3642, 29479, 28219, 80934, 83687, 32354, 159029, 68034, 11814, 33022, 63920, 18151, 93766, 94928, 63134, 43240, 8305, 5...	[ 0.182861328125, 0.0855712890625, 0.1986083984375, 0.09051513671875, 0.1827392578125, 0.18017578125, 0.1605224609375, 0.1456298828125, 0.21533203125, 0.267822265625, 0.1912841796875, 0.040740966796875, 0.115234375, 0.096435546875, 0.060394287109375, 0.0391845703125, 0.006439208984375,...	embed
22199085_c1	22199085	prolog	1	a,b,c,d,e,f. getBook(p3) :- a,b,c,d,e,f. getBook(p4) :- a,b,c,d,e,f. getBook(p5) :- a,b,c,d,e,f. getBook(p6) :- a,b,c,d,e,f. % Add your facts: not(touching(position(a),position(d))). position(e):- p5,p2. % C touches exactly two books: eventually something like aggregate_all(count, touching(e,X), Count):-2. position(c)...	a,b,c,d,e,f. getBook(p3) :- a,b,c,d,e,f. getBook(p4) :- a,b,c,d,e,f. getBook(p5) :- a,b,c,d,e,f. getBook(p6) :- a,b,c,d,e,f. % Add your facts: not(touching(position(a),position(d))). position(e):- p5,p2. % C touches exactly two books: eventually something like aggregate_all(count, touching(e,X), Count):-2. position(c)...	[ 0.01519775390625, 0.01708984375, 0.019775390625, 0.0137939453125, -0.01068115234375, -0.00445556640625, 0.0025177001953125, -0.0030059814453125, 0.00133514404296875, -0.041748046875, -0.0093994140625, 0.0030670166015625, 0.003082275390625, -0.015869140625, 0.000644683837890625, -0.0035...	[ 10, 275, 238, 71, 13, 420, 2046, 37975, 254, 21320, 15772, 29557, 43317, 59690, 1745, 29117, 15824, 959, 185188, 214, 40322, 19069, 915, 758, 5442, 313, 116281, 7, 66161, 6626, 42840, 155605, 197564, 5584, 71013, 23996, 1542, 108210, 5428, ...	[ 0.0242462158203125, 0.0863037109375, 0.0894775390625, 0.09423828125, 0.0894775390625, 0.1290283203125, 0.11669921875, 0.2081298828125, 0.046112060546875, 0.16650390625, 0.035888671875, 0.084228515625, 0.08831787109375, 0.089111328125, 0.00384521484375, 0.152099609375, 0.1763916015625...	embed
4493404_c0	4493404	prolog	0	Title: Prolog print out 2 dimension table Problem title: Prolog print out 2 dimension table Tags: printing, prolog, arrays Problem: Prolog print out 2 dimension table i have a square with start and finish points, also places where i can't go. And my program must find a way to reach finish: ar_galima([], _, _):-!. ar_ga...	Prolog print out 2 dimension table Prolog print out 2 dimension table printing prolog arrays Prolog ar_galima Prad Galas Kelias Stac_M Stac_K Tikslas Draudziama Kelias2 Ilgis Aukstis Prolog print out 2 dimension table i have a square with start and finish points, also places where i can't go. And my program must find a...	[ 0.01025390625, -0.004913330078125, 0.007537841796875, 0.00167083740234375, -0.01239013671875, 0.0038299560546875, -0.005523681640625, 0.0024566650390625, 0.0030517578125, 0.000759124755859375, 0.009033203125, 0.0118408203125, -0.01385498046875, -0.00897216796875, -0.000640869140625, 0....	[ 1250, 4867, 28412, 1810, 116, 91403, 23180, 2448, 1916, 502, 10298, 4778, 187, 21045, 4061, 71, 30733, 7, 93530, 162, 6512, 594, 605, 19591, 2512, 154383, 8984, 2887, 304, 12964, 65101, 63125, 765, 108047, 678, 4034, 136, 67229, 26847, 44...	[ 0.174560546875, 0.259521484375, 0.1884765625, 0.1158447265625, 0.177490234375, 0.2196044921875, 0.251953125, 0.1422119140625, 0.013427734375, 0.14111328125, 0.086181640625, 0.01953125, 0.059326171875, 0.1546630859375, 0.10986328125, 0.05810546875, 0.113037109375, 0.0325927734375, ...	embed
16367580_c0	16367580	prolog	0	Title: Prolog - neighbours in matrix Problem title: Prolog - neighbours in matrix Tags: prolog, neighbours, coordinates Problem: Prolog - neighbours in matrix I need a query, which help me resolve following problem: I have list of coordinates [(1,1),(1,2),(1,3),(2,1),(2,2),(2,3)] (1,1) (1,2) (1,3) (3,1) (3,2) (3,3) I w...	Prolog - neighbours in matrix Prolog - neighbours in matrix prolog neighbours coordinates Prolog XSS Rows Columns get_configuration Head Tail Used Neighbour Tail2 Used2 CountOfCoords Coords Result CountOfPairs List Coord Ngbs Ngb Tail3 nth1 Prolog - neighbours in matrix I need a query, which help me resolve following p...	[ 0.00567626953125, 0.01446533203125, 0.023681640625, -0.0196533203125, -0.00421142578125, -0.01544189453125, -0.00341796875, 0.0162353515625, 0.0289306640625, -0.025634765625, -0.016845703125, 0.00958251953125, -0.009765625, 0.002410888671875, -0.0005950927734375, 0.00628662109375, 0....	[ 1250, 4867, 108, 6958, 38648, 23, 50944, 425, 502, 176866, 1193, 15268, 96190, 233987, 2046, 153837, 34, 44816, 1218, 379, 5281, 304, 345, 108210, 132887, 10625, 6651, 1311, 126684, 8335, 481, 32036, 16145, 275, 363, 927, 3871, 41, 1294, ...	[ 0.1702880859375, 0.2469482421875, 0.0921630859375, 0.16259765625, 0.2325439453125, 0.05535888671875, 0.20068359375, 0.0699462890625, 0.1378173828125, 0.225830078125, 0.052398681640625, 0.1502685546875, 0.153564453125, 0.1580810546875, 0.0611572265625, 0.1173095703125, 0.037353515625,...	embed
47911117_c0	47911117	prolog	0	Title: Generate a list based on constraint result, using Prolog's CLPFD Problem title: Generate a list based on constraint result, using Prolog's CLPFD Tags: clpfd, prolog, constraints Problem: Generate a list based on constraint result, using Prolog's CLPFD I'm attempting to implement a Skyscraper puzzle sol...	Generate a list based on constraint result, using Prolog's CLPFD Generate a list based on constraint result, using Prolog's CLPFD clpfd prolog constraints Prolog Generate CLPFD calculate_max_switches List Switches Generate a list based on constraint result, using Prolog's CLPFD I'm attempting to implement a S...	[ 0.0093994140625, -0.004608154296875, 0.0031890869140625, 0.00469970703125, -0.014892578125, -0.00653076171875, -0.0223388671875, -0.005126953125, 0.006805419921875, -0.03271484375, -0.004791259765625, -0.01409912109375, -0.0181884765625, -0.0020294189453125, 0.0135498046875, 0.00315856...	[ 155370, 5303, 35509, 98, 158, 2816, 4288, 16750, 17368, 1250, 4867, 3768, 46323, 41265, 397, 33139, 39557, 71, 502, 74481, 24084, 131519, 32036, 106101, 29479, 17689, 15182, 1264, 104192, 3115, 814, 37486, 14012, 20028, 38132, 101089, 37317, ...	[ 0.1883544921875, 0.21435546875, 0.1153564453125, 0.060577392578125, 0.09185791015625, 0.217041015625, 0.1282958984375, 0.150146484375, 0.012237548828125, 0.1201171875, 0.2130126953125, 0.020416259765625, 0.094482421875, 0.1417236328125, 0.1927490234375, 0.012603759765625, 0.081909179...	embed
70353119_c0	70353119	prolog	0	Title: Additional check in Prolog Problem title: Additional check in Prolog Tags: prolog Problem: Additional check in Prolog I was given a task to write a Prolog program that would put given domino pieces in a loop . I figured I would first put them in order and then check for answers where the last number and the firs...	Additional check in Prolog Additional check in Prolog prolog Additional Prolog domino_order2 end_match domino_order X-Y Y-X Out Piece Remaining swap_or_not Additional check in Prolog I was given a task to write a Prolog program that would put given domino pieces in a loop . I figured I would first put them in order and...	[ 0.005615234375, -0.0089111328125, 0.0050048828125, 0.000247955322265625, -0.0289306640625, 0.011474609375, -0.0208740234375, 0.01287841796875, 0.0234375, -0.002105712890625, 0.023193359375, 0.034423828125, -0.004974365234375, -0.016357421875, 0.006683349609375, 0.0045166015625, 0.014...	[ 29117, 14, 43315, 12765, 23, 1250, 4867, 502, 96889, 80596, 304, 3564, 98753, 1193, 1723, 990, 1542, 13538, 10374, 329, 853, 192, 14653, 202317, 748, 10869, 34475, 66211, 33022, 1528, 3884, 126371, 40956, 87, 26366, 5117, 12989, 35166, 4568...	[ 0.08648681640625, 0.1029052734375, 0.1251220703125, 0.26318359375, 0.04949951171875, 0.17041015625, 0.25439453125, 0.119873046875, 0.22509765625, 0.2255859375, 0.133544921875, 0.147705078125, 0.224609375, 0.0283355712890625, 0.121337890625, 0.05072021484375, 0.0928955078125, 0.1563...	embed
36757912_c0	36757912	prolog	0	Title: Prolog Type Error Problem title: Prolog Type Error Tags: types, prolog Problem: Prolog Type Error I'm working on a prolog algorithm that will perform a "swap" on a list. Example: Input: [1,2,3,4] -> Output: [3,4,1,2] Input: [1,2,3,4,5] -> Output: [4,5,3,1,2] The first half and second half of the list swap places...	Prolog Type Error Prolog Type Error types prolog Prolog Type Error Length Prolog Type Error I'm working on a prolog algorithm that will perform a "swap" on a list. Example: Input: [1,2,3,4] -> Output: [3,4,1,2] Input: [1,2,3,4,5] -> Output: [4,5,3,1,2] The first half and second half of the list swap places, if there is...	[ -0.005767822265625, 0.03515625, 0.01458740234375, 0.000644683837890625, -0.005615234375, 0.007537841796875, -0.01507568359375, 0.0146484375, 0.00506591796875, -0.005645751953125, -0.0014190673828125, 0.000904083251953125, -0.01025390625, -0.0037689208984375, 0.02783203125, 0.0167236328...	[ 1250, 4867, 60457, 212059, 52895, 502, 77554, 20697, 234873, 51339, 7, 634, 254, 98, 5303, 89536, 360, 133063, 82449, 13538, 155761, 80389, 5117, 23552, 136, 17932, 202317, 44677, 70270, 14012, 27585, 12830, 112033, 5425, 19069, 18499, 18151, ...	[ 0.1751708984375, 0.253173828125, 0.2435302734375, 0.203369140625, 0.1614990234375, 0.13427734375, 0.1563720703125, 0.06024169921875, 0.1988525390625, 0.037445068359375, 0.001861572265625, 0.1552734375, 0.1273193359375, 0.01092529296875, 0.172119140625, 0.023712158203125, 0.0484924316...	embed
43026951_c0	43026951	prolog	0	Title: I'm new to Prolog. Trying to run this code but gives - ERROR: Undefined procedure: teaches/2 (DWIM could not correct goal) Problem title: I'm new to Prolog. Trying to run this code but gives - ERROR: Undefined procedure: teaches/2 (DWIM could not correct goal) Tags: procedure, undefined, prolog Problem...	I'm new to Prolog. Trying to run this code but gives - ERROR: Undefined procedure: teaches/2 (DWIM could not correct goal) I'm new to Prolog. Trying to run this code but gives - ERROR: Undefined procedure: teaches/2 (DWIM could not correct goal) procedure undefined prolog Prolog Trying ERROR Undefined DWIM cs...	[ 0.02099609375, 0.010009765625, -0.003936767578125, 0.0234375, -0.025634765625, 0.0260009765625, -0.02001953125, -0.0152587890625, -0.00335693359375, -0.05078125, 0.00341796875, -0.007537841796875, -0.006439208984375, -0.005859375, 0.01031494140625, 0.0196533203125, 0.0252685546875, ...	[ 3768, 3525, 1250, 4867, 40858, 11675, 18151, 76199, 151206, 24638, 79912, 5983, 50491, 94957, 90, 12477, 38969, 594, 5809, 959, 26785, 69236, 9232, 502, 30439, 17199, 20763, 35046, 363, 1662, 15824, 91736, 41, 6138, 71, 3447, 1392, 153808, ...	[ 0.037841796875, 0.0814208984375, 0.1328125, 0.224609375, 0.0875244140625, 0.07342529296875, 0.1490478515625, 0.06787109375, 0.135498046875, 0.092041015625, 0.08367919921875, 0.1912841796875, 0.215576171875, 0.205810546875, 0.14013671875, 0.2410888671875, 0.142578125, 0.184204101562...	embed
9615002_c0	9615002	prolog	0	Title: Intersection and union of 2 lists Problem title: Intersection and union of 2 lists Tags: prolog, list Problem: Intersection and union of 2 lists i'm starting up learning prolog (i use SWI-prolog) and i did a simple exercise in which i have 2 lists and i want to calculate their intersection and union. Here is my ...	Intersection and union of 2 lists Intersection and union of 2 lists prolog list Intersection Res Intersection and union of 2 lists i'm starting up learning prolog (i use SWI-prolog) and i did a simple exercise in which i have 2 lists and i want to calculate their intersection and union. Here is my code that works prett...	[ -0.00177001953125, 0.012451171875, 0.0203857421875, -0.000621795654296875, -0.006500244140625, 0.007537841796875, -0.01422119140625, -0.005218505859375, -0.00080108642578125, -0.048828125, 0.0064697265625, 0.01025390625, -0.0079345703125, 0.007171630859375, 0.0235595703125, 0.024047851...	[ 5337, 7, 58994, 136, 69941, 111, 116, 5303, 502, 4867, 9624, 52080, 159, 38969, 3454, 8781, 81979, 765, 3444, 74481, 2363, 1940, 18151, 43240, 28875, 5299, 11522, 3917, 1884, 4527, 313, 17632, 39933, 1660, 106, 16750, 48716, 50339, 26785, ...	[ 0.1495361328125, 0.173583984375, 0.16357421875, 0.10595703125, 0.26220703125, 0.08953857421875, 0.1546630859375, 0.223876953125, 0.1326904296875, 0.1864013671875, 0.1407470703125, 0.0721435546875, 0.0311126708984375, 0.16943359375, 0.08587646484375, 0.027069091796875, 0.0787353515625...	embed
77934313_c0	77934313	prolog	0	Title: Can reification predicates from CLP(FD) be used to check equality of logic expressions? Problem title: Can reification predicates from CLP(FD) be used to check equality of logic expressions? Tags: clpfd, swi-prolog, prolog, boolean-expression Problem: Can reification predicates from CLP(FD) be used to check equa...	Can reification predicates from CLP(FD) be used to check equality of logic expressions? Can reification predicates from CLP(FD) be used to check equality of logic expressions? clpfd swi-prolog prolog boolean-expression CLP Can Can reification predicates from CLP(FD) be used to check equality of logic expressions? Accor...	[ -0.0111083984375, -0.006988525390625, 0.00567626953125, 0.0220947265625, 0.00946044921875, -0.003875732421875, -0.005157470703125, -0.007568359375, -0.0031890869140625, -0.004119873046875, 0.003997802734375, -0.00041961669921875, -0.003692626953125, 0.0234375, 0.022216796875, 0.0034790...	[ 4171, 456, 41274, 1653, 2063, 1636, 1295, 313, 37352, 132, 98553, 11814, 12765, 28, 161789, 62775, 125195, 7, 33139, 39557, 71, 2452, 3454, 4867, 502, 31, 34677, 204629, 47, 209806, 38331, 1530, 158, 2816, 4288, 468, 2740, 831, 47314, 165...	[ 0.062347412109375, 0.163330078125, 0.2371826171875, 0.1724853515625, 0.200439453125, 0.0955810546875, 0.04205322265625, 0.0673828125, 0.260009765625, 0.01995849609375, 0.2135009765625, 0.1431884765625, 0.18408203125, 0.08740234375, 0.214111328125, 0.1861572265625, 0.2239990234375, ...	embed
10686773_c0	10686773	prolog	0	Title: End View Puzzle, Prolog Problem title: End View Puzzle, Prolog Tags: prolog, logic, lambda, constraints, clpfd Problem: End View Puzzle, Prolog I'm trying to write a solver for End View Puzzles, using CLPFD (for those who are unfamiliar, here's a simple description http://www.funwithpuzzles.com/2009/12/abcd-end-...	End View Puzzle, Prolog End View Puzzle, Prolog prolog logic lambda constraints clpfd 0 End View Puzzle Prolog NxN Left Right List stop_repeats left_value RList End View Puzzle, Prolog I'm trying to write a solver for End View Puzzles, using CLPFD (for those who are unfamiliar, here's a simple description http://www.fu...	[ 0.00885009765625, 0.000537872314453125, 0.022705078125, -0.012939453125, -0.00897216796875, -0.0074462890625, 0.00106048583984375, 0.00396728515625, 0.00592041015625, -0.044189453125, -0.015625, 0.0034942626953125, 0.01422119140625, -0.015380859375, 0.0032958984375, -0.003021240234375,...	[ 18878, 29805, 179277, 1250, 4867, 502, 62775, 6492, 85, 158, 2816, 4288, 33139, 39557, 71, 757, 425, 839, 2480, 90911, 32036, 7279, 107, 1081, 25737, 27494, 627, 154663, 31577, 33022, 3115, 814, 46323, 41265, 397, 8781, 76811, 16498, 76228,...	[ 0.157958984375, 0.2998046875, 0.1951904296875, 0.130615234375, 0.1964111328125, 0.08184814453125, 0.1229248046875, 0.14208984375, 0.104736328125, 0.062744140625, 0.1695556640625, 0.05767822265625, 0.0478515625, 0.0980224609375, 0.1275634765625, 0.1048583984375, 0.0157318115234375, ...	embed
13664870_c1	13664870	prolog	1	2do the I must be large enough to provoke a resource error for the local stack: ?- 22=I,N is 2^I,length(L,N), maplist(=(a),L), ( Length=ok ; occurrences(a,L,M) ). I = 22, N = 4194304, L = [a, a, a, a, a, a, a, a, a\|...], Length = ok ; ERROR: Out of local stack To overcome this problem and still retain the nice declarat...	2do the I must be large enough to provoke a resource error for the local stack: ?- 22=I,N is 2^I,length(L,N), maplist(=(a),L), ( Length=ok ; occurrences(a,L,M) ). I = 22, N = 4194304, L = [a, a, a, a, a, a, a, a, a\|...], Length = ok ; ERROR: Out of local stack To overcome this problem and still retain the nice declarat...	[ -0.019775390625, 0.0172119140625, 0.01336669921875, 0.0223388671875, 0.003387451171875, -0.000507354736328125, -0.0145263671875, 0.0032196044921875, 0.01507568359375, -0.0301513671875, 0.0294189453125, 0.00946044921875, -0.0003910064697265625, 0.01324462890625, 0.03271484375, 0.0015563...	[ 116, 246, 87, 8110, 21334, 20174, 80675, 177953, 18499, 4000, 177261, 705, 9, 1039, 1369, 568, 839, 83, 8353, 23986, 866, 22288, 6562, 11, 77554, 685, 74918, 42, 69098, 594, 2203, 24470, 541, 201, 210298, 7709, 339, 10, 3664, 151206, 24...	[ 0.1573486328125, 0.183837890625, 0.1922607421875, 0.09136962890625, 0.1488037109375, 0.074951171875, 0.1632080078125, 0.2186279296875, 0.20263671875, 0.1807861328125, 0.2349853515625, 0.09716796875, 0.057342529296875, 0.223876953125, 0.060882568359375, 0.17626953125, 0.1124267578125,...	embed
61325677_c0	61325677	prolog	0	Title: checking if two lists have common elements Problem title: checking if two lists have common elements Tags: prolog, list Problem: checking if two lists have common elements So basically, I have a predicate called common_elements(List1,List2), and the purpose of this predicate is to check if List1 has at least an ...	checking if two lists have common elements checking if two lists have common elements prolog list common_elements NAC checking if two lists have common elements So basically, I have a predicate called common_elements(List1,List2), and the purpose of this predicate is to check if List1 has at least an element that belon...	[ 0.004150390625, 0.006683349609375, -0.0013427734375, 0.0076904296875, -0.0013580322265625, 0.022705078125, -0.0186767578125, 0.0012969970703125, 0.007598876953125, -0.039794921875, 0.02685546875, 0.01104736328125, 0.01043701171875, -0.014404296875, 0.00933837890625, 0.004974365234375, ...	[ 175199, 2174, 6626, 5303, 765, 39210, 80854, 502, 4867, 62766, 184777, 198343, 1653, 2063, 67, 7, 154663, 418, 10461, 60042, 47, 12765, 32036, 1556, 19713, 12830, 10617, 5442, 89536, 101935, 903, 43240, 5299, 10644, 77336, 442, 51, 27430, 6...	[ 0.1793212890625, 0.09063720703125, 0.113037109375, 0.185302734375, 0.0482177734375, 0.187744140625, 0.188232421875, 0.10791015625, 0.160400390625, 0.20849609375, 0.156982421875, 0.04632568359375, 0.113037109375, 0.154541015625, 0.073486328125, 0.05059814453125, 0.140625, 0.03475952...	embed
8553244_c0	8553244	prolog	0	Title: Check input numbers in prolog Problem title: Check input numbers in prolog Tags: prolog, numbers Problem: Check input numbers in prolog I would like to define a initial state in a problem. My code is isDigit(X) :- ( number(X), X >= 0, X =< 8 ); ( writeln('[0-8] AND Number'),!,fail). define_initial_state(INITIAL_...	Check input numbers in prolog Check input numbers in prolog prolog numbers Check Number define_initial_state INITIAL_STATE Pos A11 A12 A13 A21 A22 A23 A31 A32 A33 row1 row2 row3 Check input numbers in prolog I would like to define a initial state in a problem. My code is The problem I have is that is printed many times...	[ -0.021240234375, 0.007232666015625, -0.00011920928955078125, 0.014892578125, -0.0181884765625, 0.0089111328125, 0.0018768310546875, 0.00543212890625, 0.002471923828125, -0.00811767578125, 0.004180908203125, 0.00982666015625, -0.01361083984375, 0.019775390625, -0.0042724609375, 0.009094...	[ 38679, 107730, 101935, 23, 502, 4867, 103332, 61924, 943, 118, 289, 61340, 5881, 35522, 7842, 176523, 13498, 1662, 1530, 2681, 3117, 4015, 3742, 5016, 6460, 9185, 15555, 363, 1884, 61475, 11341, 2967, 18151, 28412, 5941, 20028, 26008, 27781, ...	[ 0.19921875, 0.260986328125, 0.2117919921875, 0.05419921875, 0.1771240234375, 0.2310791015625, 0.1490478515625, 0.1607666015625, 0.04791259765625, 0.08734130859375, 0.069091796875, 0.180419921875, 0.047698974609375, 0.10321044921875, 0.056396484375, 0.1456298828125, 0.1094970703125, ...	embed
45391973_c1	45391973	prolog	1	9) location(_7998, _8000) ? creep Exit: (9) location(flashlight, desk) ? creep Call: (9) door(kitchen, desk) ? creep Fail: (9) door(kitchen, desk) ? creep Redo: (9) location(_7998, _8000) ? creep Exit: (9) location('washing machine', cellar) ? creep Call: (9) door(kitchen, cellar) ? creep Exit: (9) door(kitchen, cellar...	9) location(_7998, _8000) ? creep Exit: (9) location(flashlight, desk) ? creep Call: (9) door(kitchen, desk) ? creep Fail: (9) door(kitchen, desk) ? creep Redo: (9) location(_7998, _8000) ? creep Exit: (9) location('washing machine', cellar) ? creep Call: (9) door(kitchen, cellar) ? creep Exit: (9) door(kitchen, cellar...	[ -0.0059814453125, 0.004547119140625, 0.0159912109375, 0.029052734375, 0.0216064453125, 0.0283203125, -0.0076904296875, 0.0101318359375, -0.006866455078125, 0.012451171875, -0.0045166015625, 0.011474609375, -0.02880859375, -0.0025787353515625, 0.00677490234375, -0.01055908203125, 0.01...	[ 77816, 31913, 454, 966, 158931, 101, 87774, 705, 49512, 254, 5443, 217, 11438, 5544, 20016, 8, 1042, 26265, 1911, 9488, 4834, 190355, 132, 6096, 31, 634, 54700, 36279, 2927, 1193, 2203, 990, 320, 69112, 116, 76, 93, 6369, 13400, 150, 98...	[ 0.24853515625, 0.201171875, 0.0303497314453125, 0.0797119140625, 0.251708984375, 0.0408935546875, 0.2476806640625, 0.0079345703125, 0.2122802734375, 0.16650390625, 0.1600341796875, 0.10888671875, 0.2088623046875, 0.09466552734375, 0.1763916015625, 0.151611328125, 0.0789794921875, 0...	embed
55984385_c0	55984385	prolog	0	Title: How to make this function return the coordinates instead of an empty list Problem title: How to make this function return the coordinates instead of an empty list Tags: prolog Problem: How to make this function return the coordinates instead of an empty list I want the function to return the pairs (1, X) in a li...	How to make this function return the coordinates instead of an empty list How to make this function return the coordinates instead of an empty list prolog How propaga_posicoes_aux Pos Fila N_Fila N_Pos compara_listas N_Pos_aux N_P Call _722 Redo Exit How to make this function return the coordinates instead of an empty ...	[ -0.00138092041015625, -0.01556396484375, 0.02197265625, 0.003936767578125, -0.00927734375, 0.0125732421875, -0.0238037109375, 0.00799560546875, 0.015625, 0.01123046875, 0.016357421875, -0.005096435546875, 0.0007171630859375, -0.0179443359375, 0.006011962890625, 0.013427734375, 0.0057...	[ 11249, 3249, 903, 32354, 30646, 176866, 90, 64457, 201505, 5303, 70, 502, 4867, 175648, 67890, 587, 10442, 13498, 24158, 11, 541, 6159, 143, 7192, 7, 31898, 16651, 683, 26265, 191539, 6096, 31, 5443, 217, 3444, 80836, 2858, 1193, 23, 1906...	[ 0.03143310546875, 0.10284423828125, 0.06353759765625, 0.2049560546875, 0.21728515625, 0.25146484375, 0.1265869140625, 0.164794921875, 0.1781005859375, 0.20849609375, 0.00079345703125, 0.140625, 0.1920166015625, 0.240966796875, 0.1571044921875, 0.05474853515625, 0.1505126953125, 0.1...	embed
41000244_c1	41000244	prolog	1	:- use_module(library(uri)). :- http_handler(root(block_plan), get_block_planner_solution, []). server(Port) :- http_server(http_dispatch, [port(Port)]). get_block_planner_solution(_Request) :- format('content-type: text/plain~n~n'), http_parameters(_Request, [ init(Init,[optional(false)]), goal(Goal,[optional(false)]...	:- use_module(library(uri)). :- http_handler(root(block_plan), get_block_planner_solution, []). server(Port) :- http_server(http_dispatch, [port(Port)]). get_block_planner_solution(_Request) :- format('content-type: text/plain~n~n'), http_parameters(_Request, [ init(Init,[optional(false)]), goal(Goal,[optional(false)]...	[ -0.0062255859375, 0.0205078125, -0.00164031982421875, -0.006195068359375, -0.02783203125, 0.009765625, 0.019287109375, -0.0283203125, 0.0023040771484375, -0.0341796875, 0.01025390625, -0.007476806640625, -0.0048828125, 0.006195068359375, -0.0216064453125, 0.0166015625, 0.001800537109...	[ 15772, 4527, 83279, 13, 150, 2844, 1294, 1162, 1621, 74258, 148920, 81409, 5868, 2046, 1679, 166589, 10723, 60006, 39642, 5475, 4453, 6982, 4332, 75616, 9384, 69246, 50986, 7986, 7290, 19, 6276, 29089, 23, 4153, 109585, 8710, 69236, 17903, ...	[ 0.0870361328125, 0.1104736328125, 0.1727294921875, 0.0418701171875, 0.06463623046875, 0.1387939453125, 0.06304931640625, 0.1619873046875, 0.1436767578125, 0.1922607421875, 0.1444091796875, 0.1378173828125, 0.18896484375, 0.0584716796875, 0.0909423828125, 0.1585693359375, 0.1842041015...	embed
15935053_c0	15935053	prolog	0	Title: not stop after true answer in prolog Problem title: not stop after true answer in prolog Tags: transitive-closure, prolog Problem: not stop after true answer in prolog i write this programm for give me this result : "X=john" "Y=jane" likes(john,mary). likes(mary,jane). likes(l,k). likes(X,Y) :- likes(X,Z), likes...	not stop after true answer in prolog not stop after true answer in prolog transitive-closure prolog ERROR Out Call _G2162 Exit Redo _G2267 not stop after true answer in prolog i write this programm for give me this result : "X=john" "Y=jane" but if run this programm such that this result: i think the programm get in lo...	[ 0.0042724609375, 0.0017547607421875, 0.015869140625, 0.053955078125, 0.00007581710815429688, 0.00872802734375, -0.015869140625, 0.016357421875, -0.01141357421875, -0.0269775390625, 0.0076904296875, 0.01287841796875, -0.00537109375, 0.01373291015625, 0.04833984375, 0.0238037109375, 0....	[ 959, 7279, 7103, 29568, 35166, 23, 502, 4867, 62621, 5844, 170224, 151206, 13538, 26265, 724, 3117, 10837, 5443, 217, 6096, 31, 4015, 18197, 33022, 28966, 16750, 1542, 66159, 19, 1723, 145, 86, 11675, 5351, 2046, 40956, 3444, 47, 18499, 3...	[ 0.1064453125, 0.216552734375, 0.169189453125, 0.214599609375, 0.215576171875, 0.068115234375, 0.1463623046875, 0.2200927734375, 0.1483154296875, 0.10699462890625, 0.1898193359375, 0.0909423828125, 0.06549072265625, 0.1121826171875, 0.0069580078125, 0.05096435546875, 0.175537109375, ...	embed
33879097_c0	33879097	prolog	0	Title: Magic Hexagon can't constrain itself Problem title: Magic Hexagon can't constrain itself Tags: prolog, clpfd, constraints, list, logic Problem: Magic Hexagon can't constrain itself I am trying to solve the Magic Hexagon problem in Prolog, in dimension 5, for now(?). I first create the layout, by using ...	Magic Hexagon can't constrain itself Magic Hexagon can't constrain itself prolog clpfd constraints list logic Magic Hexagon use_module Dim Offset Flag constraint_sum Sum sum_list Len all_different NewLen Magic Hexagon can't constrain itself I am trying to solve the Magic Hexagon problem in Prolog, in dimensio...	[ -0.0118408203125, 0.016845703125, 0.0135498046875, 0.0001850128173828125, -0.0027618408203125, -0.01409912109375, -0.0208740234375, 0.016357421875, 0.01611328125, -0.0108642578125, -0.0033416748046875, 0.0004405975341796875, 0.0250244140625, 0.00897216796875, 0.0128173828125, 0.0126953...	[ 61707, 1529, 3798, 6126, 831, 3768, 18, 158, 2816, 73, 68034, 502, 4867, 39557, 71, 4288, 5303, 62775, 4527, 83279, 45247, 9791, 3509, 125726, 11832, 36335, 10554, 6562, 18226, 756, 238778, 2356, 866, 33, 31577, 86869, 2967, 1250, 91403, ...	[ 0.2178955078125, 0.1412353515625, 0.1878662109375, 0.2249755859375, 0.059326171875, 0.05718994140625, 0.057220458984375, 0.113525390625, 0.2025146484375, 0.10150146484375, 0.1326904296875, 0.087158203125, 0.19580078125, 0.0237884521484375, 0.0443115234375, 0.1181640625, 0.14184570312...	embed
44142130_c0	44142130	prolog	0	Title: Set size and position of gui elements Problem title: Set size and position of gui elements Tags: prolog, swi-prolog, xpce Problem: Set size and position of gui elements I've written some code to create a GUI in swi-prolog, but my main window is too small for all my buttons and text fields. How I can draw, for ex...	Set size and position of gui elements Set size and position of gui elements prolog swi-prolog xpce Set Test Main Europe Etiq text_item Enter Result Path Path1 From1 To1 Path1Res Set size and position of gui elements I've written some code to create a GUI in swi-prolog, but my main window is too small for all my buttons...	[ 0.02734375, -0.00537109375, 0.007293701171875, 0.01361083984375, 0.004241943359375, -0.004669189453125, 0.0166015625, 0.01239013671875, 0.0150146484375, 0.0007781982421875, 0.03662109375, -0.0198974609375, -0.00640869140625, -0.0033111572265625, 0.0031585693359375, -0.01904296875, 0....	[ 19943, 13267, 136, 19069, 111, 17086, 80854, 502, 4867, 2452, 3454, 329, 8647, 12321, 14713, 61941, 7986, 217, 60816, 126684, 108421, 28090, 717, 4332, 59121, 18151, 28282, 195490, 91, 5201, 76896, 5792, 19336, 77679, 44457, 11249, 831, 79442...	[ 0.1580810546875, 0.1917724609375, 0.048126220703125, 0.1871337890625, 0.020355224609375, 0.24365234375, 0.2052001953125, 0.1044921875, 0.22705078125, 0.20947265625, 0.120849609375, 0.051666259765625, 0.1351318359375, 0.0198211669921875, 0.1019287109375, 0.1571044921875, 0.10241699218...	embed
62825933_c0	62825933	prolog	0	Title: How to output theory by using Aleph with SWI-Prolog? Problem title: How to output theory by using Aleph with SWI-Prolog? Tags: swi-prolog, prolog, logic, aleph-ilp Problem: How to output theory by using Aleph with SWI-Prolog? I would like to use Aleph to get a theory with SWI-Prolog. My OS is MacOS 10.15. Here i...	How to output theory by using Aleph with SWI-Prolog? How to output theory by using Aleph with SWI-Prolog? swi-prolog prolog logic aleph-ilp Aleph How SWI-Prolog Mode RecallNumber PredicateMode begin_bg end_bg begin_in_pos end_in_pos begin_in_neg end_in_neg aleph_read_all use_module Users scfang6 Desktop test1.pl How to...	[ 0.01446533203125, 0.0098876953125, 0.01318359375, 0.037353515625, -0.022216796875, 0.0223388671875, 0.0252685546875, 0.017333984375, 0.000823974609375, -0.04296875, 0.01470947265625, 0.006500244140625, -0.00151824951171875, -0.00116729736328125, 0.02294921875, -0.00775146484375, 0.01...	[ 11249, 47, 140992, 154453, 17368, 4733, 11727, 678, 159, 38969, 10752, 4867, 91, 2452, 3454, 502, 62775, 662, 254, 36024, 853, 85763, 18444, 26278, 7145, 2063, 9083, 9842, 11821, 3564, 7522, 39116, 4527, 83279, 28944, 910, 141423, 3034, 188...	[ 0.067138671875, 0.0087890625, 0.2470703125, 0.27099609375, 0.083740234375, 0.1578369140625, 0.23388671875, 0.0360107421875, 0.06805419921875, 0.2257080078125, 0.1356201171875, 0.2098388671875, 0.011444091796875, 0.174072265625, 0.1053466796875, 0.10693359375, 0.1312255859375, 0.102...	embed
16520763_c1	16520763	prolog	1	_deepening/2 predicate I generate all the solution from the start node to the end node ordered by length (from the shortest one to the longest one). Ok, so I have to modify this program in such a way that imposes a limit on the length of the solution I must have a depth_first_iterative_deepening2/3 predicate like this:...	_deepening/2 predicate I generate all the solution from the start node to the end node ordered by length (from the shortest one to the longest one). Ok, so I have to modify this program in such a way that imposes a limit on the length of the solution I must have a depth_first_iterative_deepening2/3 predicate like this:...	[ -0.00008344650268554688, 0.00311279296875, 0.0108642578125, 0.0174560546875, 0.01104736328125, 0.033935546875, -0.005157470703125, -0.0025787353515625, 0.027587890625, -0.03515625, 0.01318359375, -0.0196533203125, 0.00714111328125, 0.00628662109375, 0.0240478515625, -0.0106201171875, ...	[ 101, 123041, 33, 214, 12477, 1653, 2063, 67, 139392, 756, 29806, 1295, 4034, 110, 112, 47, 3564, 12989, 140909, 16610, 525, 4989, 2811, 40383, 1528, 178451, 17475, 168867, 13448, 271, 16840, 45023, 304, 18113, 5021, 9920, 187895, 38132, 140...	[ 0.000823974609375, 0.1651611328125, 0.1395263671875, 0.06658935546875, 0.2198486328125, 0.1400146484375, 0.18359375, 0.060150146484375, 0.1710205078125, 0.034271240234375, 0.2197265625, 0.06268310546875, 0.1151123046875, 0.11181640625, 0.1097412109375, 0.0819091796875, 0.11279296875,...	embed
2951407_c0	2951407	prolog	0	Title: What is more interesting or powerful: Curry, Mercury or Lambda-Prolog? Problem title: What is more interesting or powerful: Curry, Mercury or Lambda-Prolog? Tags: prolog, mercury, logic-programming, lambda-prolog, curry Problem: What is more interesting or powerful: Curry, Mercury or Lambda-Prolog? I would like ...	What is more interesting or powerful: Curry, Mercury or Lambda-Prolog? What is more interesting or powerful: Curry, Mercury or Lambda-Prolog? prolog mercury logic-programming lambda-prolog curry What Curry Mercury Lambda-Prolog What is more interesting or powerful: Curry, Mercury or Lambda-Prolog? I would like to ask y...	[ 0.0284423828125, 0.01116943359375, 0.0140380859375, 0.014404296875, -0.0001506805419921875, 0.005828857421875, -0.0113525390625, -0.00372314453125, 0.005767822265625, 0.0084228515625, 0.010986328125, -0.0024566650390625, -0.01025390625, -0.021240234375, 0.01171875, -0.00053787231445312...	[ 4865, 1286, 49041, 707, 113138, 17065, 1294, 123106, 53, 122930, 85, 9, 10752, 4867, 83, 502, 1143, 16820, 62775, 28966, 214, 21, 6492, 3454, 198555, 23113, 5426, 5809, 29479, 1295, 206597, 107, 37676, 185118, 144573, 9803, 60427, 77635, 50...	[ 0.052978515625, 0.1356201171875, 0.2379150390625, 0.08428955078125, 0.235595703125, 0.1846923828125, 0.2452392578125, 0.2298583984375, 0.210693359375, 0.2025146484375, 0.1893310546875, 0.0243682861328125, 0.1649169921875, 0.255859375, 0.0258331298828125, 0.1513671875, 0.1051635742187...	embed
41637402_c1	41637402	prolog	1	I tried integer("0"). false. integer('0'). false. integer(`0`). false. integer("1"). false. integer('1'). false. integer(`1`). false. ISO INTERNATIONAL STANDARD ISO/IEC 13211-1 First edition 1995-06-01 Information technology - Programming languages - Prolog Part 1: General Core INTERNATIONAL STANDARD ISO/IEC 13211-1:1...	I tried integer("0"). false. integer('0'). false. integer(`0`). false. integer("1"). false. integer('1'). false. integer(`1`). false. ISO INTERNATIONAL STANDARD ISO/IEC 13211-1 First edition 1995-06-01 Information technology - Programming languages - Prolog Part 1: General Core INTERNATIONAL STANDARD ISO/IEC 13211-1:1...	[ 0.000514984130859375, -0.01336669921875, 0.00616455078125, 0.0196533203125, -0.001495361328125, 0.00970458984375, 0.003631591796875, -0.0101318359375, 0.002410888671875, 0.016845703125, -0.003082275390625, -0.00543212890625, -0.04052734375, 0.013427734375, 0.01202392578125, 0.009033203...	[ 87, 37842, 892, 1505, 2389, 51029, 98320, 25, 194, 132, 5, 418, 17408, 239939, 16992, 34860, 40756, 64, 126109, 702, 3117, 115727, 23972, 79737, 11857, 6746, 32007, 55556, 27958, 46876, 7, 1250, 4867, 16995, 13806, 9082, 31365, 69606, 79445...	[ 0.059478759765625, 0.1759033203125, 0.170654296875, 0.12646484375, 0.195068359375, 0.0120849609375, 0.238037109375, 0.000274658203125, 0.000823974609375, 0.000335693359375, 0.000457763671875, 0.1339111328125, 0.1708984375, 0.03558349609375, 0.05615234375, 0.1158447265625, 0.053497314...	embed
49376894_c0	49376894	prolog	0	Title: Basic Prolog Nth Number of Tribonacci Series Problem title: Basic Prolog Nth Number of Tribonacci Series Tags: prolog, fibonacci Problem: Basic Prolog Nth Number of Tribonacci Series In my Principles of Programming class we have started learning Prolog, and we were tasked with creating a query trib(N, T) which i...	Basic Prolog Nth Number of Tribonacci Series Basic Prolog Nth Number of Tribonacci Series prolog fibonacci Basic Prolog Nth Number Tribonacci Series Count Goal Basic Prolog Nth Number of Tribonacci Series In my Principles of Programming class we have started learning Prolog, and we were tasked with creating a query tri...	[ 0.0101318359375, 0.0238037109375, 0.00054931640625, -0.004974365234375, -0.003997802734375, 0.0018310546875, -0.00714111328125, -0.0103759765625, 0.0218505859375, -0.0257568359375, 0.0089111328125, -0.0159912109375, -0.01470947265625, 0.029052734375, 0.0137939453125, 0.0069580078125, ...	[ 91692, 1250, 4867, 541, 927, 103332, 4699, 20990, 52544, 64876, 502, 809, 108210, 2016, 289, 759, 79680, 27958, 18507, 52080, 136, 66211, 105233, 41, 109120, 839, 384, 29568, 2174, 83, 14012, 36549, 757, 106, 116, 201, 59121, 2806, 765, 1...	[ 0.1341552734375, 0.1715087890625, 0.2174072265625, 0.224365234375, 0.1865234375, 0.17041015625, 0.2041015625, 0.16015625, 0.200439453125, 0.1490478515625, 0.113037109375, 0.04034423828125, 0.1793212890625, 0.139892578125, 0.1033935546875, 0.00299072265625, 0.0150146484375, 0.093322...	embed
54809516_c0	54809516	prolog	0	Title: Accessing coefficients in a numerical expression (clpr) Problem title: Accessing coefficients in a numerical expression (clpr) Tags: clpr, prolog Problem: Accessing coefficients in a numerical expression (clpr) I have some clauses where the head represents the names and values of a set of variables in a linear e...	Accessing coefficients in a numerical expression (clpr) Accessing coefficients in a numerical expression (clpr) clpr prolog Accessing use_module VARNAME COEFFICIENT Accessing coefficients in a numerical expression (clpr) I have some clauses where the head represents the names and values of a set of variables in a linea...	[ -0.0020599365234375, 0.01031494140625, 0.019287109375, 0.00994873046875, 0.0120849609375, 0.0250244140625, 0.012451171875, 0.0167236328125, 0.0185546875, -0.025390625, -0.0036163330078125, 0.018798828125, -0.001129150390625, -0.029296875, 0.0089111328125, 0.0147705078125, -0.01879882...	[ 40266, 214, 552, 4240, 11044, 35066, 54744, 125195, 10287, 34937, 33139, 502, 4867, 4527, 83279, 61745, 182512, 8244, 28482, 193327, 70731, 90, 10336, 33636, 123055, 142424, 5423, 77336, 192617, 5490, 14361, 8561, 80560, 2472, 3917, 80581, 2046...	[ 0.204345703125, 0.003753662109375, 0.1661376953125, 0.1279296875, 0.1336669921875, 0.1666259765625, 0.10498046875, 0.1905517578125, 0.1875, 0.0177154541015625, 0.0283203125, 0.114013671875, 0.202392578125, 0.0787353515625, 0.1029052734375, 0.131103515625, 0.1873779296875, 0.1082763...	embed

7872634_c0

7872634

prolog

0

Title: go/0 Undefined procedure save/1 Problem title: go/0 Undefined procedure save/1 Tags: prolog, swi-prolog Problem: go/0 Undefined procedure save/1 swi-prolog 5.10.2 I have typed this prolog program in. However, when I run option a I get the following error. go/0 Undefined Procedure save/1 I am sure that save is a ...

go/0 Undefined procedure save/1 go/0 Undefined procedure save/1 prolog swi-prolog list Undefined Procedure What Shopping go:-reconsult chap7 shopping.pl See Add Delete Choice Rules Enter Item Incorrect go/0 Undefined procedure save/1 swi-prolog 5.10.2 I have typed this prolog program in. However, when I run option a I ...

[ 0.0269775390625, 0.015380859375, 0.02587890625, -0.00421142578125, -0.0125732421875, 0.009765625, -0.0054931640625, 0.0106201171875, 0.01422119140625, -0.00787353515625, 0.0004367828369140625, 0.012451171875, -0.01531982421875, -0.0031585693359375, 0.01513671875, -0.00848388671875, 0...

[ 738, 107838, 79912, 5983, 297, 50491, 30098, 11583, 502, 4867, 91, 2452, 3454, 5303, 170470, 4865, 80298, 107, 147834, 107076, 966, 33652, 2424, 29117, 262, 46485, 181948, 139118, 60816, 78426, 32399, 68433, 133684, 10644, 71, 903, 1528, 23, ...

[ 0.140869140625, 0.166015625, 0.1092529296875, 0.207763671875, 0.0166473388671875, 0.2066650390625, 0.252685546875, 0.1051025390625, 0.1868896484375, 0.2493896484375, 0.038665771484375, 0.216064453125, 0.1673583984375, 0.1209716796875, 0.1839599609375, 0.0098876953125, 0.2000732421875...

embed

42655384_c0

42655384

prolog

0

Title: Evaluating s(N) within a predicate's response, without losing functionality Problem title: Evaluating s(N) within a predicate's response, without losing functionality Tags: prolog, list, clpfd, successor-arithmetics Problem: Evaluating s(N) within a predicate's response, without losing functionality I'...

Evaluating s(N) within a predicate's response, without losing functionality Evaluating s(N) within a predicate's response, without losing functionality prolog list clpfd successor-arithmetics Evaluating Evaluating s(N) within a predicate's response, without losing functionality I'm learning Prolog. I was expe...

[ -0.00604248046875, 0.01129150390625, -0.0009307861328125, -0.006744384765625, 0.0076904296875, 0.00872802734375, 0.0216064453125, -0.009033203125, -0.0037689208984375, -0.037841796875, 0.0111083984375, 0.01556396484375, -0.03466796875, -0.0050048828125, 0.025390625, -0.0013427734375, ...

[ 151228, 1916, 91, 132, 839, 28032, 1653, 2063, 67, 3768, 57553, 15490, 388, 123309, 502, 4867, 5303, 39557, 71, 39457, 8962, 52080, 1250, 28007, 88, 195, 4711, 3173, 62766, 63262, 206808, 133063, 363, 128188, 34648, 10588, 50256, 41, 1294, ...

[ 0.218994140625, 0.0411376953125, 0.1810302734375, 0.038970947265625, 0.1602783203125, 0.1419677734375, 0.1396484375, 0.1822509765625, 0.04376220703125, 0.049530029296875, 0.2017822265625, 0.059539794921875, 0.031829833984375, 0.1409912109375, 0.095458984375, 0.1988525390625, 0.120605...

embed

78212261_c0

78212261

prolog

0

Title: order of conditions in antecedent causes stackoverflow Problem title: order of conditions in antecedent causes stackoverflow Tags: prolog Problem: order of conditions in antecedent causes stackoverflow As a simple exercise, I wrote my own permutation. This stack overflows: without(_, [], []). without(A, [A|T], T...

order of conditions in antecedent causes stackoverflow order of conditions in antecedent causes stackoverflow prolog my_permutation order of conditions in antecedent causes stackoverflow As a simple exercise, I wrote my own permutation. This stack overflows: this works partly, but still stack overflows after giving som...

[ -0.00113677978515625, 0.01495361328125, -0.0027008056640625, -0.0027008056640625, -0.0146484375, -0.021484375, -0.0186767578125, 0.005126953125, 0.00750732421875, -0.051025390625, 0.0177001953125, 0.00119781494140625, 0.016845703125, 0.0155029296875, 0.00946044921875, 0.01043701171875,...

[ 12989, 111, 27289, 23, 177047, 660, 113660, 177261, 5465, 118664, 502, 4867, 759, 1264, 561, 22062, 8781, 81979, 54397, 10002, 117, 645, 903, 43240, 2831, 1284, 7464, 7103, 68772, 3060, 29806, 32628, 169123, 28219, 15400 ]

[ 0.201416015625, 0.0731201171875, 0.225830078125, 0.0760498046875, 0.1864013671875, 0.09271240234375, 0.15234375, 0.156982421875, 0.121337890625, 0.20361328125, 0.0926513671875, 0.1239013671875, 0.0999755859375, 0.079345703125, 0.169921875, 0.0814208984375, 0.0221405029296875, 0.052...

embed

66968575_c0

66968575

prolog

0

Title: Prolog: decompose number into its digits Problem title: Prolog: decompose number into its digits Tags: prolog Problem: Prolog: decompose number into its digits I am studying prolog and I am faced with a problem that I cannot deal with. Given a number, I have to check if the sum of the factorial of each digit tha...

Prolog: decompose number into its digits Prolog: decompose number into its digits prolog Prolog _ListNumber ListNumber Sum Number Number1 Counter Counter1 Prolog: decompose number into its digits I am studying prolog and I am faced with a problem that I cannot deal with. Given a number, I have to check if the sum of th...

[ 0.00168609619140625, -0.01202392578125, 0.01446533203125, 0.0247802734375, -0.0113525390625, 0.01251220703125, 0.0004730224609375, 0.01708984375, 0.011962890625, -0.0162353515625, -0.007476806640625, -0.00408935546875, -0.0203857421875, 0.005340576171875, -0.01226806640625, 0.006988525...

[ 1250, 4867, 8, 277, 78381, 14012, 3934, 6863, 153939, 502, 154663, 18444, 26278, 32036, 36335, 103332, 418, 197956, 35187, 2577, 2967, 53418, 35142, 77878, 12765, 2174, 10554, 31461, 15403, 12638, 150350, 105950, 68034, 89536, 3642, 831, 31, ...

[ 0.15234375, 0.2279052734375, 0.1868896484375, 0.162841796875, 0.1260986328125, 0.1859130859375, 0.1513671875, 0.07879638671875, 0.1907958984375, 0.1136474609375, 0.08673095703125, 0.1490478515625, 0.0701904296875, 0.110107421875, 0.1761474609375, 0.1251220703125, 0.0465087890625, 0...

embed

53602958_c0

53602958

prolog

0

Title: Changing the number of parameters and unifying Problem title: Changing the number of parameters and unifying Tags: prolog Problem: Changing the number of parameters and unifying I'm having a problem with getting the right output. I get my result as you can see in the trace. But i cant figure out hot to stop it a...

Changing the number of parameters and unifying Changing the number of parameters and unifying prolog Changing Call _1804 Exit _2052 _2064 _2088 _2094 Fail Changing the number of parameters and unifying I'm having a problem with getting the right output. I get my result as you can see in the trace. But i cant figure out...

[ 0.00799560546875, 0.00506591796875, -0.002532958984375, -0.0164794921875, 0.01397705078125, -0.01544189453125, -0.01519775390625, 0.01239013671875, 0.01708984375, -0.0234375, 0.00689697265625, 0.004638671875, -0.007354736328125, 0.0086669921875, 0.0036163330078125, 0.010986328125, 0....

[ 108193, 14012, 171859, 136, 51, 151138, 7, 502, 4867, 26265, 1819, 7709, 5443, 12744, 13307, 12772, 14889, 190355, 2967, 20949, 7108, 140992, 2046, 16750, 1957, 144851, 45767, 26366, 8010, 47, 7279, 442, 24233, 6275, 5, 5608, 74481, 26168, ...

[ 0.1988525390625, 0.0863037109375, 0.2481689453125, 0.044189453125, 0.1575927734375, 0.2005615234375, 0.005615234375, 0.1326904296875, 0.1942138671875, 0.1668701171875, 0.0274658203125, 0.12890625, 0.032745361328125, 0.107421875, 0.0814208984375, 0.1220703125, 0.06768798828125, 0.12...

embed

26483806_c0

26483806

prolog

0

Title: Prolog's detecting change in list Problem title: Prolog's detecting change in list Tags: prolog Problem: Prolog's detecting change in list I would like to write a predicate find_difference([A|B],[P|Q],[C-D|E-F]) to find the difference between the list [A|B] and [P|Q] , and give the result like [C-D|E-F...

Prolog's detecting change in list Prolog's detecting change in list prolog Prolog find_difference C-D E-F Prolog's detecting change in list I would like to write a predicate find_difference([A|B],[P|Q],[C-D|E-F]) to find the difference between the list [A|B] and [P|Q] , and give the result like [C-D|E-F] , C ...

[ 0.0014190673828125, 0.0126953125, -0.00142669677734375, 0.01708984375, -0.004302978515625, 0.0262451171875, -0.019287109375, 0.0084228515625, 0.008544921875, 0.0150146484375, 0.005096435546875, 0.00885009765625, 0.00074005126953125, 0.017333984375, 0.005523681640625, 0.002532958984375,...

[ 1250, 4867, 3768, 96391, 214, 15549, 23, 5303, 502, 7413, 428, 18234, 313, 9, 397, 241, 919, 1884, 33022, 1653, 2063, 67, 6620, 58745, 571, 683, 2737, 60212, 17721, 16750, 117414, 53383, 541, 927, 1614, 6562, 12960, 391, 14192, 12830, 1...

[ 0.1727294921875, 0.2403564453125, 0.036773681640625, 0.1895751953125, 0.06048583984375, 0.205810546875, 0.07379150390625, 0.1947021484375, 0.1322021484375, 0.172607421875, 0.1199951171875, 0.195556640625, 0.1064453125, 0.0865478515625, 0.1495361328125, 0.09295654296875, 0.18322753906...

embed

58886711_c0

58886711

prolog

0

Title: How to set mutually exclusive probabilities in Problog? Problem title: How to set mutually exclusive probabilities in Problog? Tags: prolog, probability, logic Problem: How to set mutually exclusive probabilities in Problog? A person X can either be inpatient or outpatient . Given the fact location(X,outpatient)...

How to set mutually exclusive probabilities in Problog? How to set mutually exclusive probabilities in Problog? prolog probability logic How Problog P::location How to set mutually exclusive probabilities in Problog? A person X can either be inpatient or outpatient . Given the fact location(X,outpatient) how can Problo...

[ 0.006561279296875, -0.0081787109375, 0.01214599609375, -0.005462646484375, -0.01519775390625, 0.0230712890625, 0.0201416015625, 0.004058837890625, 0.0223388671875, -0.0220947265625, 0.006256103515625, 0.0133056640625, 0.000148773193359375, -0.016357421875, 0.013427734375, 0.00842285156...

[ 11249, 5423, 199849, 538, 97629, 37242, 31075, 23, 1250, 9883, 502, 4867, 2481, 62775, 436, 87632, 3445, 1193, 831, 40101, 186, 170250, 707, 1810, 15824, 31913, 1542, 6056, 3642, 53498, 73, 83, 757, 3444, 5609, 21543, 1556, 45234, 33022, ...

[ 0.087890625, 0.1737060546875, 0.1326904296875, 0.067138671875, 0.218505859375, 0.2529296875, 0.1722412109375, 0.1109619140625, 0.183349609375, 0.232177734375, 0.1336669921875, 0.2091064453125, 0.185546875, 0.11962890625, 0.1005859375, 0.1993408203125, 0.08502197265625, 0.0736694335...

embed

55772281_c0

55772281

prolog

0

Title: Finding whether a number is a multiple of another Problem title: Finding whether a number is a multiple of another Tags: successor-arithmetics, prolog, failure-slice Problem: Finding whether a number is a multiple of another Looking at the code below: multiple(X,0). multiple(X,Y) :- lt(0,X), lt(0,Y), diff(Y,X,D)...

Finding whether a number is a multiple of another Finding whether a number is a multiple of another successor-arithmetics prolog failure-slice Finding Finding whether a number is a multiple of another Looking at the code below: There happens to be something wrong. For your reference: lt/2 is whether the first argument ...

[ -0.01300048828125, 0.015869140625, 0.01544189453125, 0.0135498046875, 0.0076904296875, 0.01434326171875, 0.00830078125, -0.0091552734375, 0.032958984375, -0.024169921875, 0.00106048583984375, -0.021240234375, -0.0177001953125, -0.0019378662109375, 0.0179443359375, 0.01507568359375, 0...

[ 26040, 214, 36766, 14012, 83, 48716, 111, 15700, 10, 39457, 42, 8962, 41637, 502, 4867, 137578, 13348, 18151, 96276, 44691, 91067, 96, 18, 12477, 5117, 10750, 40715, 3501, 17932, 71337, 18113, 50960, 105950, 47, 26948, 61924, 26785, 62775, ...

[ 0.1317138671875, 0.0148162841796875, 0.178955078125, 0.1915283203125, 0.095458984375, 0.28515625, 0.14501953125, 0.143310546875, 0.009002685546875, 0.1995849609375, 0.05169677734375, 0.041534423828125, 0.00823974609375, 0.06451416015625, 0.1033935546875, 0.1820068359375, 0.0887451171...

embed

15555484_c1

15555484

prolog

1

consulted I want to return the following statistics to the user: attack(?), speed(?), defence(?). I was hoping to use an equation to work out the "?" areas of my program, to which the following equation would be used "(base_stat + level) * stat_bonus". So something like this:- compute(attribute) :- stat_bonus(stat bon...

[ 0.004486083984375, 0.004119873046875, -0.00921630859375, -0.001312255859375, -0.0224609375, 0.02685546875, 0.01092529296875, -0.017333984375, 0.009521484375, -0.0301513671875, -0.0032501220703125, -0.007232666015625, 0.00653076171875, 0.025390625, 0.001708984375, -0.0016326904296875, ...

[ 147008, 3444, 30646, 25632, 80835, 7, 47, 38937, 52875, 38352, 8, 6211, 156377, 4527, 5490, 2320, 4488, 1810, 2953, 58555, 1528, 11814, 37382, 17346, 997, 17366, 13254, 84686, 1884, 9969, 6743, 191145, 9396, 49129, 110, 56065, 27781, 257, 9...

[ 0.109375, 0.09820556640625, 0.1453857421875, 0.055389404296875, 0.224609375, 0.087158203125, 0.01959228515625, 0.12744140625, 0.1380615234375, 0.142578125, 0.0350341796875, 0.09521484375, 0.08319091796875, 0.031494140625, 0.1407470703125, 0.060546875, 0.025634765625, 0.040313720703...

embed

21226657_c0

21226657

prolog

0

Title: Prolog: find a supplier who supply all parts Problem title: Prolog: find a supplier who supply all parts Tags: prolog Problem: Prolog: find a supplier who supply all parts I'm new to Prolog. These are my facts. part_cost(Part, Supplier) part_cost(top_tube ,cinelli). part_cost(top_tube ,columbus). part_cost(down_...

Prolog: find a supplier who supply all parts Prolog: find a supplier who supply all parts prolog Prolog part_cost top_tube down_tube head_tube seat_mast Supplier Part PartRest Prolog: find a supplier who supply all parts I'm new to Prolog. These are my facts. part_cost(Part, Supplier) I want to find a supplier who supp...

[ 0.01806640625, 0.00579833984375, -0.00494384765625, 0.0208740234375, -0.0181884765625, 0.01141357421875, 0.01116943359375, -0.005889892578125, 0.0096435546875, -0.021484375, 0.006683349609375, 0.000568389892578125, -0.000324249267578125, 0.002471923828125, -0.00958251953125, -0.0082397...

[ 1250, 4867, 12, 7413, 10, 194223, 2750, 100677, 756, 63920, 502, 2831, 587, 271, 2663, 70485, 7565, 10336, 40, 257, 72000, 121691, 56786, 16995, 525, 3525, 15824, 58229, 3444, 120384, 8562, 20653, 3365, 48740, 7, 3714, 3642, 5154, 5584, 2...

[ 0.1748046875, 0.270751953125, 0.0076904296875, 0.13232421875, 0.050689697265625, 0.2454833984375, 0.08160400390625, 0.207275390625, 0.1341552734375, 0.191650390625, 0.1063232421875, 0.1785888671875, 0.1492919921875, 0.1365966796875, 0.0869140625, 0.185546875, 0.110107421875, 0.1141...

embed

19119660_c0

19119660

prolog

0

Title: Prolog termination domain: How can I know which questions will return a finite number of answers? Problem title: Prolog termination domain: How can I know which questions will return a finite number of answers? Tags: prolog, failure-slice, non-termination Problem: Prolog termination domain: How can I know which ...

Prolog termination domain: How can I know which questions will return a finite number of answers? Prolog termination domain: How can I know which questions will return a finite number of answers? prolog failure-slice non-termination Prolog How Head Tail _G24 _G30 _G36 _G42 _G48 _G54 Prolog termination domain: How can I...

[ 0.0302734375, 0.00518798828125, 0.007781982421875, 0.002288818359375, -0.016357421875, -0.00128173828125, 0.00543212890625, 0.0206298828125, 0.00689697265625, -0.041259765625, -0.00927734375, -0.00457763671875, -0.007049560546875, -0.002227783203125, 0.01495361328125, 0.016357421875, ...

[ 1250, 4867, 29527, 1363, 77758, 11249, 831, 87, 3714, 3129, 17582, 1221, 30646, 94418, 13, 14012, 35166, 502, 137578, 13348, 351, 720, 91407, 44816, 1218, 379, 724, 2357, 1197, 8659, 13023, 9285, 12338, 1528, 33478, 76, 5303, 113292, 20255,...

[ 0.15673828125, 0.22314453125, 0.1810302734375, 0.028076171875, 0.1561279296875, 0.05572509765625, 0.0546875, 0.045440673828125, 0.1326904296875, 0.05804443359375, 0.2137451171875, 0.06982421875, 0.2047119140625, 0.20263671875, 0.05450439453125, 0.11669921875, 0.18017578125, 0.11853...

embed

55783988_c0

55783988

prolog

0

Title: Possible bug with nth1 predicate in Eclipse-clp? Problem title: Possible bug with nth1 predicate in Eclipse-clp? Tags: prolog, eclipse-clp Problem: Possible bug with nth1 predicate in Eclipse-clp? I'm writing a sudoku solver in Prolog. The sudoku itself is given as a vector of vectors: P = [[1,_,_, _,_,_, _,_,_]...

Possible bug with nth1 predicate in Eclipse-clp? Possible bug with nth1 predicate in Eclipse-clp? prolog eclipse-clp Possible nth1 Eclipse-clp convert_to_matrix Puzzle RowI Elem Possible bug with nth1 predicate in Eclipse-clp? I'm writing a sudoku solver in Prolog. The sudoku itself is given as a vector of vectors: I'm...

[ -0.01019287109375, 0.01171875, 0.026123046875, 0.0152587890625, -0.0108642578125, -0.004241943359375, -0.0218505859375, 0.0017852783203125, -0.0072021484375, -0.044189453125, -0.01531982421875, 0.00054168701171875, -0.007293701171875, -0.003326416015625, 0, -0.0111083984375, 0.015991...

[ 115861, 2661, 54608, 678, 653, 927, 418, 1653, 2063, 234962, 26775, 67, 23, 9, 502, 4867, 106371, 184, 96760, 188, 192, 87427, 179277, 96190, 568, 540, 195, 32562, 8932, 38067, 3115, 814, 1250, 68034, 34475, 237, 173, 18770, 22834, 22230,...

[ 0.095947265625, 0.04364013671875, 0.1953125, 0.02447509765625, 0.1348876953125, 0.220458984375, 0.1568603515625, 0.1412353515625, 0.1795654296875, 0.2486572265625, 0.1641845703125, 0.00323486328125, 0.0301666259765625, 0.021240234375, 0.103759765625, 0.203857421875, 0.143798828125, ...

embed

67485022_c0

67485022

prolog

0

Title: Learning Prolog : solving crossword problem in prolog Problem title: Learning Prolog : solving crossword problem in prolog Tags: prolog Problem: Learning Prolog : solving crossword problem in prolog I'm trying to learn Prolog and I've an exercise and I couldn't solve it. Here's what I have to do:- https://i.ssta...

Learning Prolog : solving crossword problem in prolog Learning Prolog : solving crossword problem in prolog prolog Learning Prolog H1V1 H1V2 H1V3 H1V4 H2V1 H2V2 H2V3 H2V4 H3V1 H3V2 H3V3 H3V4 H4V1 H4V2 H4V3 H4V4 Learning Prolog : solving crossword problem in prolog I'm trying to learn Prolog and I've an exercise and I c...

[ 0.0009765625, 0.00159454345703125, -0.007354736328125, 0.01214599609375, -0.01519775390625, 0.005584716796875, -0.0269775390625, 0.01275634765625, 0.0004711151123046875, -0.033935546875, 0.0177001953125, -0.00665283203125, 0.023193359375, 0.00836181640625, -0.01544189453125, 0.01538085...

[ 114344, 1250, 4867, 3115, 6496, 41421, 47416, 2967, 23, 502, 572, 856, 418, 304, 617, 31577, 30698, 272, 81979, 69427, 18, 86869, 201939, 1179, 19283, 1375, 864, 605, 128468, 18151, 37842, 11343, 3229, 11675, 442, 30646, 98320, 2811, 40383,...

[ 0.146484375, 0.1800537109375, 0.2318115234375, 0.1181640625, 0.0625, 0.136474609375, 0.2039794921875, 0.17626953125, 0.0804443359375, 0.158203125, 0.044342041015625, 0.123779296875, 0.0236968994140625, 0.03350830078125, 0.09893798828125, 0.0277099609375, 0.05169677734375, 0.0128173...

embed

49838393_c1

49838393

prolog

1

+ Yellow, Number1_2 #= (Green * 10) + Purple, Number1_3 #= (Cyan * 100) + (Red * 10) + Purple, Number2_1 #= (Red * 1000) + (Brown * 100) + (White * 10) + Red, Number2_2 #= (Lime * 10) + Yellow, Number2_3 #= (Red * 1000) + (Lime * 100) + (Purple * 10) + Pink, Number3_1 #= (White * 1000) + (Purple * 100) + (Cyan * 10) +...

[ -0.013427734375, 0.0024871826171875, -0.01141357421875, 0.01434326171875, -0.0057373046875, -0.00750732421875, -0.0218505859375, 0.002593994140625, 0.0115966796875, 0.026123046875, -0.00860595703125, 0.01263427734375, 0.01275634765625, 0.01129150390625, -0.0107421875, 0.013427734375, ...

[ 997, 146762, 103332, 418, 304, 468, 1369, 152061, 661, 209, 16, 16915, 8705, 363, 15, 1643, 805, 80852, 115187, 4382, 80009, 7710, 173473, 6096, 9506, 683, 474, 59849, 22392, 4, 69085, 41566, 3555, 9077, 4527, 74912, 707, 14617, 16336, 91...

[ 0.1981201171875, 0.291748046875, 0.193115234375, 0.05169677734375, 0.1419677734375, 0.043060302734375, 0.03131103515625, 0.1690673828125, 0.002655029296875, 0.1533203125, 0.0009765625, 0.1365966796875, 0.18603515625, 0.1680908203125, 0.000762939453125, 0.1793212890625, 0.180053710937...

embed

32831392_c0

32831392

prolog

0

Title: How do I stop an empty list from appending to a complete list in Prolog? Problem title: How do I stop an empty list from appending to a complete list in Prolog? Tags: prolog, list Problem: How do I stop an empty list from appending to a complete list in Prolog? I have this issue in Prolog where I'm creating a li...

How do I stop an empty list from appending to a complete list in Prolog? How do I stop an empty list from appending to a complete list in Prolog? prolog list appending How Prolog put_together Value1 Value2 Result How do I stop an empty list from appending to a complete list in Prolog? I have this issue in Prolog where ...

[ 0.0059814453125, -0.00689697265625, 0.004852294921875, -0.007415771484375, -0.00185394287109375, 0.0220947265625, -0.011474609375, -0.0036163330078125, 0.02685546875, -0.0001239776611328125, 0.005035400390625, -0.006927490234375, -0.021484375, -0.0034637451171875, 0.0157470703125, 0.01...

[ 11249, 54, 7279, 201505, 5303, 1295, 1747, 96819, 47, 28484, 1250, 4867, 23, 502, 3884, 239483, 190060, 304, 126684, 142, 31089, 105233, 68018, 1653, 2063, 162466, 166635, 30646, 3564, 33342, 1884, 116, 138, 27781, 43257, 678, 10588, 62775, ...

[ 0.0478515625, 0.06317138671875, 0.2197265625, 0.244873046875, 0.2371826171875, 0.09234619140625, 0.1240234375, 0.153076171875, 0.0667724609375, 0.1651611328125, 0.1807861328125, 0.2301025390625, 0.030181884765625, 0.1151123046875, 0.0994873046875, 0.196044921875, 0.1318359375, 0.03...

embed

68699249_c0

68699249

prolog

0

Title: Handle multiple choise answer in expert system prolog Problem title: Handle multiple choise answer in expert system prolog Tags: prolog, expert-system Problem: Handle multiple choise answer in expert system prolog I have to add a functionality to an already existing expert system, that is to manage questions wit...

Handle multiple choise answer in expert system prolog Handle multiple choise answer in expert system prolog prolog expert-system Handle Present general_behavior_6 diagnostic_ criterion_ ingestion_not_food_substances criterion_no_medical_condition Handle multiple choise answer in expert system prolog I have to add a fun...

[ 0.009765625, -0.0040283203125, 0.007415771484375, 0.024658203125, -0.012939453125, 0.036376953125, -0.0035858154296875, 0.007293701171875, 0.0196533203125, -0.017578125, -0.0048828125, 0.0181884765625, -0.005279541015625, 0.0184326171875, -0.0006256103515625, 0.0189208984375, 0.01055...

[ 10639, 133, 48716, 681, 3075, 35166, 23, 26808, 5426, 502, 4867, 16751, 97721, 4537, 372, 98409, 910, 52070, 166220, 19, 141933, 10869, 49558, 196842, 157, 167455, 126940, 765, 15190, 123309, 21771, 144573, 111240, 17582, 12921, 52895, 959, 7...

[ 0.1961669921875, 0.1375732421875, 0.233642578125, 0.195068359375, 0.1546630859375, 0.25244140625, 0.05743408203125, 0.208740234375, 0.1658935546875, 0.1470947265625, 0.22021484375, 0.1634521484375, 0.2305908203125, 0.1273193359375, 0.058349609375, 0.1441650390625, 0.1103515625, 0.1...

embed

38136163_c0

38136163

prolog

0

Title: Getting number of common items between lists in Prolog Problem title: Getting number of common items between lists in Prolog Tags: prolog Problem: Getting number of common items between lists in Prolog I want to modify the code on Creating a list from user input with swi-prolog : diagnose(Disease):- retractall(s...

Getting number of common items between lists in Prolog Getting number of common items between lists in Prolog prolog Getting Prolog Disease List Symptom Enter runny_nose sore_throat head_ache Getting number of common items between lists in Prolog I want to modify the code on Creating a list from user input with swi-pro...

[ -0.00023174285888671875, -0.0123291015625, 0.0076904296875, 0.01190185546875, -0.0068359375, 0.01611328125, -0.00787353515625, 0.01458740234375, 0.00531005859375, -0.05419921875, 0.01080322265625, 0.028564453125, -0.00022792816162109375, 0.00164794921875, 0.00909423828125, 0.0019683837...

[ 210732, 14012, 111, 39210, 55769, 17721, 5303, 7, 1250, 4867, 23, 502, 229200, 32036, 149450, 60816, 11675, 299, 157, 127124, 42294, 10336, 46994, 2811, 40383, 18151, 56781, 1295, 38937, 107730, 91, 2452, 3454, 30957, 138, 153698, 552, 58968,...

[ 0.09954833984375, 0.170654296875, 0.01287841796875, 0.1727294921875, 0.18505859375, 0.1785888671875, 0.2183837890625, 0.09356689453125, 0.1685791015625, 0.2352294921875, 0.009429931640625, 0.1185302734375, 0.1341552734375, 0.1771240234375, 0.150146484375, 0.1011962890625, 0.030609130...

embed

68658188_c1

68658188

prolog

1

nth0(ConsonantIndex, Consonant, ConsonantChar), nth0(UvularIndex, Uvular, UvularChar), nth0(VowelIndex, Vowel, VowelChar), Syllable = [ConsonantChar, UvularChar, VowelChar]. wordgen([], _). wordgen(SyllableNums, Word) :- SyllableNums = [Head|Tail], syllablegen(Head, Syllable), append(Word, Syllable, NewWord), wordgen(...

[ -0.01165771484375, -0.00799560546875, 0.007537841796875, -0.0017852783203125, -0.0264892578125, 0.01275634765625, 0.00726318359375, 0.005706787109375, 0.015869140625, -0.0201416015625, 0.00555419921875, -0.0159912109375, 0.000820159912109375, -0.00170135498046875, -0.02294921875, -0.01...

[ 653, 927, 2389, 11935, 1681, 1236, 4153, 39659, 1657, 84068, 247, 1062, 1783, 320, 36635, 8420, 5346, 4843, 1165, 2661, 2203, 345, 268, 2565, 1409, 4, 101, 194, 132, 65183, 839, 10321, 22543, 16, 15772, 13025, 712, 58745, 9874, 379, 954...

[ 0.055206298828125, 0.17919921875, 0.182861328125, 0.03814697265625, 0.193603515625, 0.087158203125, 0.05096435546875, 0.2196044921875, 0.055419921875, 0.167236328125, 0.0089111328125, 0.0194091796875, 0.1385498046875, 0.1524658203125, 0.09613037109375, 0.1700439453125, 0.067749023437...

embed

26278667_c0

26278667

prolog

0

Title: SWI-Prolog: how to insert a new clause to a database Problem title: SWI-Prolog: how to insert a new clause to a database Tags: prolog Problem: SWI-Prolog: how to insert a new clause to a database I'm sorry, this has probably been asked before but I can't find a good answer. I'm writing a Prolog assignment, in wh...

SWI-Prolog: how to insert a new clause to a database SWI-Prolog: how to insert a new clause to a database prolog SWI-Prolog banco.pl SWI-Prolog: how to insert a new clause to a database I'm sorry, this has probably been asked before but I can't find a good answer. I'm writing a Prolog assignment, in which we must write...

[ 0.007232666015625, 0.00640869140625, 0.012451171875, 0.0252685546875, -0.03076171875, 0.0181884765625, -0.033203125, -0.01513671875, 0.0157470703125, -0.04736328125, -0.00144195556640625, 0.00823974609375, -0.02490234375, -0.010498046875, 0.0194091796875, 0.01416015625, 0.00994873046...

[ 159, 38969, 10752, 4867, 3642, 183540, 3525, 70731, 13, 47, 63399, 502, 66799, 2424, 10, 59090, 32562, 1250, 95486, 33022, 154109, 179933, 2831, 14192, 5303, 30745, 50339, 27983, 24674, 96759, 11435, 4393, 18151, 11675, 25632, 16750, 37842, 1...

[ 0.023101806640625, 0.1826171875, 0.1038818359375, 0.169921875, 0.052459716796875, 0.2398681640625, 0.158935546875, 0.22998046875, 0.167236328125, 0.09124755859375, 0.197021484375, 0.113525390625, 0.1407470703125, 0.0938720703125, 0.002105712890625, 0.01031494140625, 0.03265380859375,...

embed

48498573_c0

48498573

prolog

0

Title: How to use difference lists in recursion? Problem title: How to use difference lists in recursion? Tags: difference-lists, prolog Problem: How to use difference lists in recursion? The intent of the following program is as follows clist_d(f(a,f(a,a)),R) the result is a list of all ground arguments, e.g R = [a,a,...

How to use difference lists in recursion? How to use difference lists in recursion? difference-lists prolog How Difference X-Y Y-Z X-Z clist_d X-T How to use difference lists in recursion? The intent of the following program is as follows clist_d(f(a,f(a,a)),R) the result is a list of all ground arguments, e.g R = [a,a...

[ 0.013916015625, 0.0064697265625, 0.01190185546875, 0.012939453125, -0.01153564453125, 0.0137939453125, 0.001922607421875, 0.017822265625, 0.0262451171875, -0.010009765625, 0.0009918212890625, -0.0189208984375, -0.00909423828125, 0.0159912109375, 0.0184326171875, -0.00958251953125, 0....

[ 11249, 47, 4527, 60212, 5303, 7, 23, 195625, 1830, 6562, 502, 4867, 803, 18234, 6620, 1193, 1723, 990, 9, 1511, 501, 71, 618, 78091, 25632, 1528, 420, 11, 1052, 16750, 756, 61585, 10750, 627, 2203, 70541, 54608, 28398, 41, 103687, 13423...

[ 0.07354736328125, 0.014556884765625, 0.1575927734375, 0.269775390625, 0.257568359375, 0.124755859375, 0.0692138671875, 0.22509765625, 0.1456298828125, 0.2247314453125, 0.0999755859375, 0.1375732421875, 0.1168212890625, 0.193359375, 0.1224365234375, 0.056732177734375, 0.08447265625, ...

embed

56138140_c0

56138140

prolog

0

Title: How do I add a field to a Prolog (Pengines) response? Problem title: How do I add a field to a Prolog (Pengines) response? Tags: javascript, response, json, prolog Problem: How do I add a field to a Prolog (Pengines) response? I'm building a simple game on a prolog server running on Pengines. I have a template t...

How do I add a field to a Prolog (Pengines) response? How do I add a field to a Prolog (Pengines) response? javascript response json prolog How Prolog Pengines response.data Board pengine.ask Pengine.stringify How do I add a field to a Prolog (Pengines) response? I'm building a simple game on a prolog server running on...

[ 0.0026397705078125, 0.0145263671875, 0.01007080078125, 0.000637054443359375, 0.005950927734375, 0.00665283203125, 0.006011962890625, 0.01312255859375, -0.00628662109375, -0.037109375, 0.0284423828125, 0.0164794921875, -0.005523681640625, -0.00872802734375, 0.0191650390625, -0.006439208...

[ 11249, 15190, 44457, 47, 1250, 4867, 187889, 12741, 57553, 136951, 1681, 502, 27691, 10135, 62554, 10048, 1212, 1042, 91693, 40383, 54, 87, 10, 33976, 8781, 6712, 10723, 110934, 18151, 2389, 12647, 5861, 831, 4173, 30646, 4677, 19882, 35839, ...

[ 0.0740966796875, 0.1973876953125, 0.297607421875, 0.10638427734375, 0.1861572265625, 0.243896484375, 0.1767578125, 0.189697265625, 0.2432861328125, 0.2060546875, 0.08392333984375, 0.099853515625, 0.1756591796875, 0.07879638671875, 0.1856689453125, 0.1336669921875, 0.168701171875, 0...

embed

12868485_c0

12868485

prolog

0

Title: Prolog Recursion returns multiple results Problem title: Prolog Recursion returns multiple results Tags: prolog, recursion Problem: Prolog Recursion returns multiple results To start off this is a homework question poised to me. I am supposed to write a predicate btree_height\2 that takes a Binary tree and (for ...

Prolog Recursion returns multiple results Prolog Recursion returns multiple results prolog recursion Prolog Recursion btree_height Prolog Recursion returns multiple results To start off this is a homework question poised to me. I am supposed to write a predicate btree_height\2 that takes a Binary tree and (for now) jus...

[ 0.0113525390625, 0.005767822265625, -0.006439208984375, -0.00311279296875, -0.001953125, 0.0238037109375, -0.026611328125, -0.019287109375, 0.00970458984375, -0.036376953125, -0.007415771484375, -0.039306640625, 0.01239013671875, 0.006683349609375, 0.0174560546875, -0.005859375, 0.03...

[ 1250, 4867, 165428, 42, 6889, 30646, 48716, 50339, 502, 195625, 876, 62600, 1106, 22553, 18244, 134598, 33022, 1653, 2063, 304, 51776, 54092, 1294, 53201, 155955, 111, 2394, 6635, 33636, 1022, 892, 1505, 142424, 110, 27781, 18151, 2967, 19441...

[ 0.1768798828125, 0.224609375, 0.169921875, 0.165283203125, 0.121337890625, 0.180908203125, 0.206298828125, 0.192138671875, 0.1256103515625, 0.240234375, 0.064208984375, 0.23095703125, 0.1357421875, 0.1387939453125, 0.0501708984375, 0.03778076171875, 0.069580078125, 0.0797119140625,...

embed

53790416_c1

53790416

prolog

1

= e(_, _). rewrite(A, A) :- \+ wff_shallowly(A). I thought that this would prevent the catch-all clause from being applicable if and only if A isn't headed by an atom/constructor with special meaning. However, after making that change, the rewrite always fails if invoked recursively. ?- rewrite(4, Z). Z = 4. ?- rewrit...

[ -0.035888671875, 0.023193359375, 0.01055908203125, 0.0146484375, -0.0029296875, -0.0040283203125, -0.000438690185546875, -0.00057220458984375, 0.0133056640625, 0.0164794921875, -0.002532958984375, 0.01214599609375, 0.0037689208984375, 0.022705078125, 0.007415771484375, 0.00198364257812...

[ 2203, 28, 101, 456, 434, 18781, 284, 62, 1328, 148, 4902, 2420, 41566, 538, 17569, 56282, 105556, 9, 5584, 70731, 13, 152431, 18, 10336, 34627, 36716, 748, 5361, 91084, 7103, 15549, 11343, 35782, 2174, 23253, 195625, 105801, 567, 1398, 23...

[ 0.058013916015625, 0.132568359375, 0.01190185546875, 0.160400390625, 0.1876220703125, 0.22412109375, 0.0821533203125, 0.09442138671875, 0.072509765625, 0.0275115966796875, 0.148193359375, 0.081787109375, 0.133544921875, 0.1646728515625, 0.02825927734375, 0.14794921875, 0.259765625, ...

embed

6874484_c0

6874484

prolog

0

Title: Efficient Mutable Graph Representation in Prolog? Problem title: Efficient Mutable Graph Representation in Prolog? Tags: graph-theory, performance, prolog-directive-dynamic, prolog Problem: Efficient Mutable Graph Representation in Prolog? I would like to represent a mutable graph in Prolog in an efficient manne...

Efficient Mutable Graph Representation in Prolog? Efficient Mutable Graph Representation in Prolog? graph-theory performance prolog-directive-dynamic prolog Efficient Mutable Graph Representation Prolog Type Name Step NextStep Efficient Mutable Graph Representation in Prolog? I would like to represent a mutable graph i...

[ 0.0113525390625, 0.01031494140625, 0.0140380859375, 0.0157470703125, -0.019287109375, -0.00025177001953125, -0.0159912109375, 0.0067138671875, 0.0191650390625, -0.031494140625, 0.006195068359375, 0.0277099609375, -0.0167236328125, -0.007537841796875, 0.00897216796875, 0.015869140625, ...

[ 24500, 45964, 2758, 22819, 6524, 11727, 130877, 23, 1250, 4867, 1363, 41382, 2347, 23718, 502, 936, 100034, 242554, 60457, 15757, 50478, 4997, 191644, 1884, 33636, 842, 93766, 157318, 1614, 3509, 133266, 20697, 63399, 237, 132096, 10846, 91736,...

[ 0.15576171875, 0.1002197265625, 0.160400390625, 0.1832275390625, 0.179931640625, 0.1593017578125, 0.224365234375, 0.040863037109375, 0.181884765625, 0.24462890625, 0.0166778564453125, 0.2296142578125, 0.0283203125, 0.1348876953125, 0.108154296875, 0.017547607421875, 0.015380859375, ...

embed

58978852_c0

58978852

prolog

0

Title: Remove / update all lists from a list that meet a certain criterion Problem title: Remove / update all lists from a list that meet a certain criterion Tags: prolog Problem: Remove / update all lists from a list that meet a certain criterion I want to remove / update all lists from a list that meet a certain crit...

Remove / update all lists from a list that meet a certain criterion Remove / update all lists from a list that meet a certain criterion prolog a Remove Small_List remove_lists Remove / update all lists from a list that meet a certain criterion I want to remove / update all lists from a list that meet a certain criterio...

[ -0.007049560546875, 0.01806640625, 0.0145263671875, 0.0224609375, -0.019287109375, -0.00592041015625, 0.0250244140625, 0.00640869140625, 0.0277099609375, 0.000644683837890625, 0.00177764892578125, -0.001129150390625, -0.015625, -0.0027313232421875, 0.014892578125, 0.003997802734375, ...

[ 181139, 248, 28350, 756, 5303, 7, 1295, 23356, 24233, 166220, 450, 502, 4867, 10, 105508, 154663, 87388, 6562, 19, 3444, 47, 89536, 32036, 275, 238, 53, 169, 26315, 720, 1830, 14602, 959, 70541, 126684, 37842, 9790, 144851, 11, 339, 17727...

[ 0.19140625, 0.056488037109375, 0.187744140625, 0.127197265625, 0.2396240234375, 0.03271484375, 0.0904541015625, 0.138916015625, 0.07232666015625, 0.1842041015625, 0.004150390625, 0.126220703125, 0.1453857421875, 0.044342041015625, 0.1453857421875, 0.1595458984375, 0.1995849609375, ...

embed

38413957_c1

38413957

prolog

1

1 max_set(_, N1, List2, N2, List, N) :- N2>N1, % if N2 is bigger List=List2, % then max set is List2 N=N2. % of length N2 % a helping predicate to find the max independent set of t(L,_,R), excluding the root mis_no_root(nil, [], 0). % the empty subtree has an empty max independent set of size 0 mis_no_root(t(L,_,R), Li...

[ 0.01123046875, 0.0079345703125, 0.0196533203125, 0.005096435546875, 0.0098876953125, 0.00799560546875, -0.0031585693359375, 0.0123291015625, 0.006561279296875, -0.00433349609375, 0.016357421875, -0.00457763671875, 0.01129150390625, -0.0218505859375, 0.0157470703125, -0.0167236328125, ...

[ 106, 18389, 454, 3509, 541, 418, 32036, 304, 4, 15772, 2740, 839, 1745, 2174, 167785, 154663, 5423, 5442, 140909, 120592, 1653, 2063, 7413, 41371, 808, 866, 1052, 39041, 74855, 1239, 157, 148920, 17324, 757, 201505, 1614, 62600, 13267, 18, ...

[ 0.07470703125, 0.244873046875, 0.056793212890625, 0.27490234375, 0.126220703125, 0.0653076171875, 0.206787109375, 0.1551513671875, 0.001617431640625, 0.06683349609375, 0.038421630859375, 0.09307861328125, 0.0673828125, 0.009490966796875, 0.119873046875, 0.1456298828125, 0.26708984375...

embed

69638577_c0

69638577

prolog

0

Title: Prolog. Comparing elements in a list Problem title: Prolog. Comparing elements in a list Tags: prolog Problem: Prolog. Comparing elements in a list I have a list of people that contains list of people that contains name+age. person(bob, 20). person(charlie, 15). person(steve, 21). person(david, 25). I want to cr...

Prolog. Comparing elements in a list Prolog. Comparing elements in a list prolog Prolog Comparing Name MaxName MaxAge Age Set Skipping MaxValue Prolog. Comparing elements in a list I have a list of people that contains list of people that contains name+age. I want to create a predicate oldest(List, Name) that will take...

[ -0.005889892578125, 0.003875732421875, 0.033935546875, 0.0284423828125, -0.0103759765625, 0.034423828125, -0.006561279296875, 0.00811767578125, 0.0091552734375, -0.038330078125, 0.0081787109375, 0.0108642578125, -0.004974365234375, -0.00885009765625, 0.0107421875, -0.006561279296875, ...

[ 1250, 4867, 5, 113307, 214, 80854, 23, 5303, 502, 15757, 9920, 163612, 284, 429, 72944, 19943, 20491, 26783, 856, 50770, 10, 87, 765, 3395, 70541, 9351, 1328, 4588, 3444, 28282, 1653, 2063, 10332, 525, 154663, 5646, 123055, 30646, 3445, 9...

[ 0.1710205078125, 0.2303466796875, 0.00177001953125, 0.2100830078125, 0.0911865234375, 0.1903076171875, 0.0701904296875, 0.2056884765625, 0.1275634765625, 0.120849609375, 0.127685546875, 0.13623046875, 0.034088134765625, 0.06182861328125, 0.09393310546875, 0.11572265625, 0.12536621093...

embed

74660753_c0

74660753

prolog

0

Title: why backtracking does / does not happen (ending search with false or not)? Problem title: why backtracking does / does not happen (ending search with false or not)? Tags: prolog, backtracking Problem: why backtracking does / does not happen (ending search with false or not)? This is a question asking why backtra...

why backtracking does / does not happen (ending search with false or not)? why backtracking does / does not happen (ending search with false or not)? prolog backtracking Temp why backtracking does / does not happen (ending search with false or not)? This is a question asking why backtracking happens in one simple progr...

[ 0.0299072265625, 0.021484375, 0.01104736328125, -0.00045013427734375, -0.0205078125, 0.00494384765625, 0.0167236328125, 0.00726318359375, -0.0019378662109375, 0.018798828125, 0.0106201171875, 0.007049560546875, -0.003997802734375, 0.034912109375, 0.00885009765625, 0.01025390625, 0.02...

[ 15400, 4420, 125728, 214, 14602, 248, 959, 53383, 33, 6238, 33938, 98320, 678, 502, 4867, 37446, 707, 96276, 8781, 1528, 89536, 787, 27781, 7413, 1193, 94385, 1632, 29806, 105876, 47, 1286, 51347, 14037, 30646, 26785, 66159, 21342, 25958, 1...

[ 0.12646484375, 0.213623046875, 0.2685546875, 0.15185546875, 0.08935546875, 0.03076171875, 0.0927734375, 0.1226806640625, 0.074951171875, 0.08282470703125, 0.1978759765625, 0.2314453125, 0.0411376953125, 0.121826171875, 0.178955078125, 0.1597900390625, 0.015167236328125, 0.105346679...

embed

1668428_c0

1668428

prolog

0

Title: Prolog Problem with combinding predicates that work on their own Problem title: Prolog Problem with combinding predicates that work on their own Tags: prolog, list Problem: Prolog Problem with combinding predicates that work on their own Here we go, bear with me. The over-all goal is to return the max alignment ...

Prolog Problem with combinding predicates that work on their own Prolog Problem with combinding predicates that work on their own prolog list Prolog Problem _Xs _Ys Prolog Problem with combinding predicates that work on their own Here we go, bear with me. The over-all goal is to return the max alignment between two lis...

[ 0.01373291015625, 0.006744384765625, 0.00072479248046875, 0.0233154296875, -0.0038604736328125, 0.0303955078125, 0.004058837890625, 0.01409912109375, 0.0196533203125, -0.02294921875, 0.0244140625, 0.01318359375, 0.006591796875, -0.00107574462890625, 0.007598876953125, 0.001861572265625...

[ 1250, 4867, 15649, 375, 128239, 1653, 2063, 1636, 4488, 98, 2363, 10002, 502, 5303, 1542, 1723, 81148, 678, 163, 5584, 69236, 30646, 18389, 143420, 674, 17721, 6626, 1286, 1632, 5701, 140909, 5117, 17106, 80854, 12008, 26785, 12989, 25568, ...

[ 0.1536865234375, 0.2322998046875, 0.1717529296875, 0.114013671875, 0.222412109375, 0.1900634765625, 0.2125244140625, 0.06292724609375, 0.1004638671875, 0.063232421875, 0.0321044921875, 0.1343994140625, 0.140380859375, 0.1810302734375, 0.08001708984375, 0.13232421875, 0.10162353515625...

embed

36896943_c0

36896943

prolog

0

Title: How do I find a substring between two characters using Prolog? Problem title: How do I find a substring between two characters using Prolog? Tags: swi-prolog, list, string, prolog Problem: How do I find a substring between two characters using Prolog? I have a variable being passed to a predicate that is a list ...

How do I find a substring between two characters using Prolog? How do I find a substring between two characters using Prolog? swi-prolog list string prolog Prolog How Canidae Canis Felidae Felinae Felis Equidae Equus How do I find a substring between two characters using Prolog? I have a variable being passed to a pred...

[ 0.00982666015625, -0.0113525390625, 0.005889892578125, 0.0279541015625, -0.007049560546875, 0.0159912109375, 0.007293701171875, 0.0079345703125, 0.0133056640625, -0.00151824951171875, 0.0089111328125, -0.01226806640625, -0.0162353515625, 0.00750732421875, 0.0220947265625, 0.00053787231...

[ 11249, 7413, 1614, 91693, 17721, 6626, 124850, 17368, 1250, 4867, 2452, 3454, 5303, 79315, 502, 4171, 1683, 164, 9593, 885, 145666, 85, 5490, 10, 77336, 115081, 1653, 2063, 12638, 125663, 53894, 525, 5423, 49129, 35412, 756, 360, 7077, 2178...

[ 0.058929443359375, 0.1654052734375, 0.23193359375, 0.25927734375, 0.206787109375, 0.1142578125, 0.180419921875, 0.06591796875, 0.15771484375, 0.2362060546875, 0.1177978515625, 0.109619140625, 0.1041259765625, 0.1881103515625, 0.0994873046875, 0.11865234375, 0.0703125, 0.07257080078...

embed

73345446_c1

73345446

prolog

1

1,3,2], What). and sortz([1,3,2], [], What). both return "no". Attempt 2: % Shortcut insertionsort(List, Result) :- insertionsort(List, [], Result). % Base case. Result will be the last parameter when first element is empty, thus all elements will have been sorted into the second list insertionsort([], Result, Result)....

[ -0.0084228515625, -0.004486083984375, 0.026123046875, -0.004669189453125, -0.01361083984375, 0.0272216796875, -0.00933837890625, -0.033935546875, 0.0174560546875, 0.01080322265625, 0.026123046875, 0.005218505859375, -0.018310546875, -0.00555419921875, 0.002593994140625, 0.0018997192382...

[ 46963, 90173, 4865, 12096, 169, 363, 15044, 30646, 157, 1913, 34224, 18, 15573, 1745, 82990, 19774, 241860, 62351, 154663, 126684, 44978, 7225, 4568, 171859, 5117, 12830, 201505, 756, 80854, 17497, 17932, 5303, 13025, 712, 9874, 379, 29899, 1...

[ 0.146484375, 0.07373046875, 0.1534423828125, 0.203369140625, 0.092041015625, 0.05316162109375, 0.017608642578125, 0.0897216796875, 0.0916748046875, 0.037872314453125, 0.2110595703125, 0.010528564453125, 0.07904052734375, 0.0360107421875, 0.1224365234375, 0.147705078125, 0.15808105468...

embed

29984768_c0

29984768

prolog

0

Title: Find permutations of list with unique Heads Problem title: Find permutations of list with unique Heads Tags: list, permutation, prolog Problem: Find permutations of list with unique Heads I have a list of unique elements, and I want to generate permutations of that list but I only want the elements to be the hea...

Find permutations of list with unique Heads Find permutations of list with unique Heads list permutation prolog Find Heads special_permutation Head Tail AltHead AltTail Find permutations of list with unique Heads I have a list of unique elements, and I want to generate permutations of that list but I only want the elem...

[ 0.0026702880859375, 0.0185546875, 0.0179443359375, -0.0274658203125, -0.007232666015625, 0.002960205078125, -0.02685546875, -0.00110626220703125, 0.01531982421875, -0.01806640625, -0.0034637451171875, 0.02880859375, 0.016845703125, 0.01214599609375, 0.00194549560546875, 0.018310546875,...

[ 26040, 117, 14311, 21094, 111, 5303, 678, 36998, 44816, 7, 561, 22062, 502, 4867, 5361, 1264, 1218, 379, 10544, 13025, 9874, 765, 80854, 3444, 139392, 4734, 47, 186, 10336, 24145, 1884, 12989, 46741, 26866, 163, 37842, 2060, 903, 30646, 1...

[ 0.1561279296875, 0.16845703125, 0.24609375, 0.1488037109375, 0.07647705078125, 0.1966552734375, 0.14404296875, 0.251953125, 0.250732421875, 0.04986572265625, 0.2152099609375, 0.1116943359375, 0.08697509765625, 0.1072998046875, 0.110595703125, 0.11181640625, 0.078125, 0.032073974609...

embed

47841539_c0

47841539

prolog

0

Title: Prolog finding duplicates in a stucture gives existence error Problem title: Prolog finding duplicates in a stucture gives existence error Tags: prolog Problem: Prolog finding duplicates in a stucture gives existence error I'm getting an existence error when I call my rule shareActors which should be true if two...

Prolog finding duplicates in a stucture gives existence error Prolog finding duplicates in a stucture gives existence error prolog Prolog Prolog finding duplicates in a stucture gives existence error I'm getting an existence error when I call my rule shareActors which should be true if two movies have the same actor. T...

[ -0.001678466796875, 0.02783203125, 0.00946044921875, 0.00634765625, 0.006683349609375, 0.0172119140625, 0.0030364990234375, 0.006072998046875, 0.0018768310546875, -0.0228271484375, -0.0013275146484375, 0.016357421875, 0.0272216796875, -0.01507568359375, 0.014404296875, 0.022216796875, ...

[ 1250, 4867, 90791, 171763, 1636, 23, 18784, 238, 6644, 76199, 116311, 18499, 502, 6, 20949, 11782, 79986, 12008, 39450, 22230, 5608, 29568, 2174, 6626, 72304, 765, 5701, 39329, 129745 ]

[ 0.1707763671875, 0.26708984375, 0.12481689453125, 0.263671875, 0.1705322265625, 0.060394287109375, 0.153076171875, 0.1025390625, 0.1083984375, 0.07208251953125, 0.205322265625, 0.2178955078125, 0.1253662109375, 0.0384521484375, 0.05059814453125, 0.1160888671875, 0.195068359375, 0.1...

embed

22236475_c0

22236475

prolog

0

Title: Append lists in Prolog Problem title: Append lists in Prolog Tags: prolog, list Problem: Append lists in Prolog Prolog SWI. Let's say I have a recursive function that adds X items to list in every iteration. Something that looks like: func(...,BigList):- func2(...,CurrentList), BigList = [ CurrentList | Tail ], ...

Append lists in Prolog Append lists in Prolog prolog list Append Prolog BigList func2 CurrentList Tail iter1item1 iter1item2 iter1itemX iter2item1 iter2item2 iter2itemX iterXitem1 iterXitem2 Append lists in Prolog Prolog SWI. Let's say I have a recursive function that adds X items to list in every iteration. Something ...

[ 0.005462646484375, 0.00750732421875, 0.01519775390625, 0.009521484375, -0.009765625, 0.01953125, -0.0007781982421875, 0.008056640625, 0.01483154296875, -0.019775390625, 0.016845703125, -0.0098876953125, -0.0025634765625, 0.003448486328125, 0.0198974609375, 0.00897216796875, 0.0062561...

[ 5659, 3611, 5303, 7, 1250, 4867, 23, 502, 14195, 154663, 7477, 304, 114063, 1218, 379, 720, 217, 1542, 195, 159, 38969, 195625, 32354, 15190, 1193, 55769, 11907, 33342, 1884, 37842, 87388, 63920, 959, 5526, 99156, 12301, 238, 139124, 61475,...

[ 0.138671875, 0.1168212890625, 0.249267578125, 0.03692626953125, 0.185302734375, 0.2393798828125, 0.047027587890625, 0.1392822265625, 0.147705078125, 0.28271484375, 0.1151123046875, 0.148193359375, 0.1751708984375, 0.1107177734375, 0.1068115234375, 0.1888427734375, 0.035552978515625, ...

embed

67029329_c1

67029329

prolog

1

2 error messages indicate main.m:011: possible causes of this error. main.m:011: main.m:011: In clause for `getlist(out)': main.m:011: mode error in unification of `Xs' and `list.[V_10 | V_16]'. main.m:011: Variable `Xs' has instantiatedness main.m:011: bound( main.m:011: [] main.m:011: ; main.m:011: '[|]'( main.m:011...

[ 0.00506591796875, 0.01507568359375, 0.006988525390625, 0.00119781494140625, -0.0035858154296875, 0.01483154296875, -0.004791259765625, -0.0032958984375, 0.014892578125, 0.002166748046875, 0.0208740234375, -0.0233154296875, 0.01025390625, -0.01318359375, 0.007781982421875, 0.00805664062...

[ 116, 18499, 89914, 117414, 5201, 39, 12, 136485, 7722, 113660, 903, 5, 360, 70731, 13, 3794, 6562, 132, 6056, 13736, 23, 51, 41274, 1542, 136, 856, 963, 58745, 310, 2485, 84572, 2886, 7, 1556, 34648, 14, 27686, 7432, 6, 99091, 4092, 2...

[ 0.143310546875, 0.2379150390625, 0.189453125, 0.1505126953125, 0.14599609375, 0.108154296875, 0.08245849609375, 0.2274169921875, 0.1734619140625, 0.1793212890625, 0.1053466796875, 0.010162353515625, 0.049591064453125, 0.1630859375, 0.037109375, 0.1422119140625, 0.265380859375, 0.05...

embed

13456231_c0

13456231

prolog

0

Title: Prolog - Search a list for an element, print the list if element is found Problem title: Prolog - Search a list for an element, print the list if element is found Tags: prolog, list Problem: Prolog - Search a list for an element, print the list if element is found So I am trying to write a small program that doe...

Prolog - Search a list for an element, print the list if element is found Prolog - Search a list for an element, print the list if element is found prolog list Prolog Search Item Rest DisregardHead Tail Prolog - Search a list for an element, print the list if element is found So I am trying to write a small program tha...

[ -0.0120849609375, 0.00970458984375, -0.001678466796875, 0.006072998046875, -0.006195068359375, 0.0296630859375, -0.004119873046875, -0.0023651123046875, 0.002197265625, -0.04150390625, 0.0322265625, -0.0262451171875, -0.01239013671875, 0.01300048828125, -0.003936767578125, 0.0069274902...

[ 1250, 4867, 20, 33086, 5303, 100, 12830, 28412, 2174, 83, 14037, 502, 78426, 49756, 42077, 13025, 1218, 379, 31577, 33022, 19336, 1528, 14602, 25632, 831, 33938, 46132, 1810, 39563, 62822, 74189, 80854, 13909, 114669, 149186, 21914, 140992, 1...

[ 0.181640625, 0.255615234375, 0.03155517578125, 0.2232666015625, 0.2017822265625, 0.134521484375, 0.1953125, 0.1842041015625, 0.12060546875, 0.038238525390625, 0.1610107421875, 0.1474609375, 0.1031494140625, 0.107421875, 0.0670166015625, 0.0215911865234375, 0.0533447265625, 0.083251...

embed

44084016_c0

44084016

prolog

0

Title: Semantic Representation for enlish sentences in Prolog Problem title: Semantic Representation for enlish sentences in Prolog Tags: dcg, syntax, prolog Problem: Semantic Representation for enlish sentences in Prolog I am trying to get a semantic representation for English sentences by using a DCG in Prolog. This ...

Semantic Representation for enlish sentences in Prolog Semantic Representation for enlish sentences in Prolog dcg syntax prolog Semantic Representation Prolog Sem OBJ Semantic Representation for enlish sentences in Prolog I am trying to get a semantic representation for English sentences by using a DCG in Prolog. This ...

[ 0.02490234375, 0.0185546875, 0.00732421875, 0.021240234375, -0.002838134765625, 0.00994873046875, -0.01409912109375, 0.00408935546875, -0.00360107421875, -0.0400390625, 0.00897216796875, -0.00457763671875, -0.0133056640625, 0.000095367431640625, 0.006378173828125, 0.002288818359375, ...

[ 10232, 109109, 130877, 1363, 100, 22, 15227, 149357, 1250, 4867, 104, 238, 177, 86531, 502, 150260, 31577, 2046, 484, 18811, 14941, 17368, 391, 56367, 23, 184345, 5608, 1300, 14578, 43581, 10778, 15649, 25632, 6183, 959, 2499, 6528, 3642, 1...

[ 0.152099609375, 0.1455078125, 0.2191162109375, 0.057373046875, 0.033935546875, 0.06219482421875, 0.11962890625, 0.1790771484375, 0.14892578125, 0.2362060546875, 0.0196990966796875, 0.029998779296875, 0.08477783203125, 0.0384521484375, 0.10791015625, 0.1312255859375, 0.0263671875, 0...

embed

10258298_c0

10258298

prolog

0

Title: simple dcg lexer Problem title: simple dcg lexer Tags: dcg, prolog Problem: simple dcg lexer Hi i'm writing a simple lexer :- module(lekser, [lekser/3]). lekser(Tokens) --> white_space, ( ( "{", !, { Token = tkLBrace } ; "}", !, { Token = tkRBrace } ; ")", !, { Token = tkRParen } ; "(", !, { Token = tkLParen } ;...

simple dcg lexer simple dcg lexer dcg prolog Tokens white_space Token Syntax style_check simple dcg lexer Hi i'm writing a simple lexer Here is the begining of code whell coudl someone tell me where i made mistake because swi code editor says there is an eror(even after putting only few empty nelines) Syntax error: Str...

[ 0.02197265625, -0.006500244140625, -0.006072998046875, 0.0026397705078125, -0.00125885009765625, 0.0059814453125, -0.003814697265625, -0.00848388671875, 0.0128173828125, -0.05224609375, -0.001953125, 0.00213623046875, -0.0205078125, -0.00531005859375, 0.0245361328125, 0.013671875, 0....

[ 8781, 238, 177, 95, 34058, 502, 4867, 84694, 35011, 65421, 717, 1098, 19010, 86531, 20623, 78292, 104, 32562, 9842, 214, 18151, 148, 79544, 31816, 20469, 7228, 121742, 2452, 30391, 72, 748, 7103, 4734, 10846, 201505, 108, 59801, 18499, 2335...

[ 0.181396484375, 0.0335693359375, 0.1085205078125, 0.1129150390625, 0.2379150390625, 0.08819580078125, 0.1427001953125, 0.1348876953125, 0.07427978515625, 0.1312255859375, 0.012542724609375, 0.1119384765625, 0.0870361328125, 0.1624755859375, 0.1693115234375, 0.1903076171875, 0.0125427...

embed

35843879_c0

35843879

prolog

0

Title: Prolog predicate - returns list with duplicates removed from specific predicate Problem title: Prolog predicate - returns list with duplicates removed from specific predicate Tags: return-value, prolog Problem: Prolog predicate - returns list with duplicates removed from specific predicate I'm a complete noob tr...

Prolog predicate - returns list with duplicates removed from specific predicate Prolog predicate - returns list with duplicates removed from specific predicate return-value prolog specific Prolog Prolog predicate - returns list with duplicates removed from specific predicate I'm a complete noob trying to write predicat...

[ 0.00787353515625, 0.02294921875, 0.00732421875, -0.01165771484375, -0.027099609375, 0.01239013671875, 0.0048828125, 0.000789642333984375, -0.00640869140625, -0.0262451171875, -0.0157470703125, -0.000396728515625, 0.0038299560546875, 0.000438690185546875, -0.00213623046875, 0.0354003906...

[ 1250, 4867, 1653, 2063, 67, 30646, 5303, 678, 171763, 1636, 184750, 1295, 29458, 27494, 502, 3522, 33022, 179933, 14194, 17726, 52721, 12477, 29568, 116, 2208, 28282, 3525, 87388, 115, 182867, 11001, 618, 11583, 171859, 6056, 81887 ]

[ 0.1712646484375, 0.2298583984375, 0.1697998046875, 0.19775390625, 0.0716552734375, 0.1722412109375, 0.1788330078125, 0.0670166015625, 0.23583984375, 0.1090087890625, 0.1602783203125, 0.0572509765625, 0.1556396484375, 0.125244140625, 0.130126953125, 0.040924072265625, 0.05624389648437...

embed

66664553_c0

66664553

prolog

0

Title: Prolog program to search book by book_title ,by book_author, by book_edition using recursion Problem title: Prolog program to search book by book_title ,by book_author, by book_edition using recursion Tags: prolog Problem: Prolog program to search book by book_title ,by book_author, by book_edition using recursi...

Prolog program to search book by book_title ,by book_author, by book_edition using recursion Prolog program to search book by book_title ,by book_author, by book_edition using recursion prolog recursion Prolog book_title book_author book_edition the_design_of_everyday_things don_normas third_edition elementary_statisti...

[ -0.0036163330078125, 0.01123046875, 0.01312255859375, 0.015869140625, -0.0133056640625, 0.01202392578125, -0.009033203125, 0.00225830078125, 0.0052490234375, -0.042724609375, 0.00732421875, -0.0244140625, -0.0267333984375, -0.0048828125, 0.040283203125, -0.00083160400390625, 0.006744...

[ 1250, 4867, 1528, 47, 33938, 12877, 390, 5440, 1272, 1003, 5922, 14660, 17368, 195625, 1830, 502, 34198, 4390, 104643, 5636, 64113, 2301, 60010, 162, 50960, 131830, 17346, 48242, 95528, 2182, 254, 516, 22759, 86595, 2397, 6077, 28966, 94090, ...

[ 0.183837890625, 0.261474609375, 0.14111328125, 0.033111572265625, 0.224365234375, 0.19091796875, 0.111328125, 0.208251953125, 0.0899658203125, 0.1199951171875, 0.085693359375, 0.1614990234375, 0.031890869140625, 0.252197265625, 0.11181640625, 0.1231689453125, 0.158935546875, 0.0552...

embed

37499482_c1

37499482

prolog

1

% a disk from FromIdx to ToIdx starting at state Start moved(FromIdx, ToIdx, Start, Result) :- allowedMove(FromIdx, ToIdx, Start), nth1(FromIdx, Start, [Disk|OtherDisks]), nth1(ToIdx, Start, ToStack), nth1(FromIdx, Result, OtherDisks), nth1(ToIdx, Result, [Disk|ToStack]). allowedMove(FromIdx, ToIdx, State) :- number(F...

[ -0.0224609375, 0.000965118408203125, 0.01287841796875, 0.017822265625, -0.00799560546875, 0.0159912109375, -0.006500244140625, 0.00927734375, 0.0208740234375, -0.050537109375, 0.0024566650390625, 0.041259765625, -0.011474609375, 0.00159454345703125, -0.02197265625, -0.0152587890625, ...

[ 1745, 28338, 1295, 28090, 568, 71, 425, 47, 717, 72134, 99, 11341, 13794, 109133, 168407, 126684, 107003, 9083, 272, 653, 927, 418, 6581, 9319, 44456, 7763, 42378, 64511, 22836, 14012, 397, 1528, 37202, 4488, 5792, 72803, 26818, 31635, 2714...

[ 0.0848388671875, 0.1876220703125, 0.07568359375, 0.2113037109375, 0.0860595703125, 0.0941162109375, 0.19384765625, 0.05389404296875, 0.16064453125, 0.07171630859375, 0.002685546875, 0.1348876953125, 0.148193359375, 0.1854248046875, 0.2095947265625, 0.1717529296875, 0.19287109375, 0...

embed

52614867_c1

52614867

prolog

1

father(X,Y) :- parent(X,Y), male(X). % grandfather(X,Y) :- X is the grandfather of Y. grandfather(X,Y) :- father(X,P), parent(P,Y). % brother(X,Y) :- X is the brother of Y. brother(X,Y) :- parent(P,X), parent(P,Y), male(X), X \= Y. % uncle(X,Y) :- X is the uncle of Y. uncle(X,Y) :- brother(X,P), parent(P,Y). % female(...

[ 0.01470947265625, 0.00927734375, 0.01611328125, 0.01141357421875, -0.0252685546875, 0.0093994140625, -0.018310546875, 0.0021514892578125, 0.0031585693359375, -0.0203857421875, -0.00066375732421875, -0.0252685546875, -0.002838134765625, 0.018310546875, 0.0036468505859375, -0.00014495849...

[ 67373, 132, 1542, 4, 1723, 15772, 49129, 247, 11280, 194, 1745, 9963, 1021, 9319, 1193, 83, 70, 111, 990, 5, 683, 82953, 51, 11030, 117776, 3445, 1328, 114015, 1556, 454, 1681, 10, 775, 139505, 136, 3789, 71390, 19729, 60502, 1290, 3584...

[ 0.271484375, 0.04541015625, 0.1614990234375, 0.0933837890625, 0.1956787109375, 0.1904296875, 0.23828125, 0.07672119140625, 0.1585693359375, 0.0892333984375, 0.147216796875, 0.1552734375, 0.19677734375, 0.1865234375, 0.1646728515625, 0.1331787109375, 0.050384521484375, 0.09478759765...

embed

56221482_c0

56221482

prolog

0

Title: Hints to understand splendid program to solve Queens Problem title: Hints to understand splendid program to solve Queens Tags: n-queens, prolog Problem: Hints to understand splendid program to solve Queens In Art of Prolog of Sterling & Shapiro, exercise Section 14.1 (v): queens(N,Qs) :- length(Qs,N), place_quee...

Hints to understand splendid program to solve Queens Hints to understand splendid program to solve Queens n-queens prolog Hints Queens place_queens _Qs _Ups _Downs Ups Downs I-1 place_queen UnplacedQs SafeQs UnplacedQs1 Y-N Hints to understand splendid program to solve Queens In Art of Prolog of Sterling & Shapiro, exe...

[ 0.008056640625, 0.007568359375, 0.0233154296875, 0.0037841796875, -0.000354766845703125, -0.00970458984375, 0.007110595703125, -0.01153564453125, 0.01470947265625, -0.0269775390625, -0.00390625, 0.01300048828125, 0.001708984375, -0.00836181640625, -0.005523681640625, -0.001800537109375...

[ 19895, 933, 28219, 85453, 1528, 86869, 44109, 7, 653, 944, 1755, 502, 4867, 3687, 2737, 53234, 8331, 7710, 10091, 49472, 87, 5759, 23935, 115527, 990, 839, 4713, 111, 1250, 94358, 2069, 619, 102444, 81979, 6370, 418, 334, 10, 534, 124519,...

[ 0.1671142578125, 0.06439208984375, 0.1463623046875, 0.225341796875, 0.2274169921875, 0.169921875, 0.194091796875, 0.0909423828125, 0.0782470703125, 0.1285400390625, 0.1240234375, 0.1158447265625, 0.181640625, 0.1195068359375, 0.110595703125, 0.0953369140625, 0.01519775390625, 0.065...

embed

70105487_c0

70105487

prolog

0

Title: Find non overlapping times Problem title: Find non overlapping times Tags: prolog, schedule Problem: Find non overlapping times I'm given a serie of university subjects with their lessons time and I have to find all non overlapping subjects to make a schedule. This is what I have so far %% lesson(+Day: atom, +Be...

Find non overlapping times Find non overlapping times prolog schedule Find Day Begin End Lessons Name Course SRE PAV DSI COM TSB TCO PYE LEG Subjects Find non overlapping times I'm given a serie of university subjects with their lessons time and I have to find all non overlapping subjects to make a schedule. This is wh...

[ -0.0137939453125, 0.0211181640625, 0.014404296875, 0.00262451171875, -0.030029296875, -0.0274658203125, -0.0089111328125, -0.00156402587890625, -0.005279541015625, -0.036865234375, -0.000385284423828125, 0.006744384765625, 0.0037841796875, -0.00186920166015625, 0.0027008056640625, 0.01...

[ 26040, 351, 645, 143, 26783, 20028, 502, 4867, 80889, 10013, 121427, 18878, 1734, 42182, 15757, 154162, 11766, 856, 9902, 31436, 36474, 9688, 46445, 133573, 94341, 34475, 6432, 152363, 28368, 182417, 1733, 765, 7413, 756, 2060 ]

[ 0.14794921875, 0.2059326171875, 0.12359619140625, 0.157470703125, 0.1595458984375, 0.19873046875, 0.1328125, 0.1712646484375, 0.2215576171875, 0.0753173828125, 0.05157470703125, 0.0751953125, 0.04766845703125, 0.047393798828125, 0.0162353515625, 0.10003662109375, 0.0760498046875, 0...

embed

12055249_c0

12055249

prolog

0

Title: SWI-Prolog, first delete an element then reverse the resulting list Problem title: SWI-Prolog, first delete an element then reverse the resulting list Tags: prolog, list Problem: SWI-Prolog, first delete an element then reverse the resulting list I currently have my head wrapped around this issue - its driving m...

SWI-Prolog, first delete an element then reverse the resulting list SWI-Prolog, first delete an element then reverse the resulting list prolog list SWI-Prolog List RevList Elements Accu Element Tail Tail1 delete_reverse SWI-Prolog, first delete an element then reverse the resulting list I currently have my head wrapped...

[ -0.0010528564453125, 0.025390625, 0.00032806396484375, 0.0029754638671875, -0.0247802734375, 0.0152587890625, 0.007080078125, 0.00029754638671875, 0.027587890625, -0.021240234375, 0.0172119140625, 0.0184326171875, -0.004486083984375, -0.000896453857421875, 0.01708984375, 0.000915527343...

[ 159, 38969, 10752, 4867, 5117, 154109, 12830, 7068, 39531, 184, 16750, 5303, 502, 32036, 80893, 154663, 48325, 29899, 34, 1218, 379, 418, 107, 37676, 31089, 6863, 132442, 116666, 1250, 100094, 62822, 31577, 1295, 442, 54, 6097, 32354, 84797, ...

[ 0.046051025390625, 0.21728515625, 0.1358642578125, 0.1929931640625, 0.099609375, 0.2347412109375, 0.190185546875, 0.09521484375, 0.2437744140625, 0.16552734375, 0.10888671875, 0.1793212890625, 0.103271484375, 0.06298828125, 0.083984375, 0.1021728515625, 0.1461181640625, 0.059631347...

embed

23243326_c0

23243326

prolog

0

Title: Can Prolog make rules based on the facts available? Problem title: Can Prolog make rules based on the facts available? Tags: prolog, logic, artificial-intelligence Problem: Can Prolog make rules based on the facts available? For example if there are facts of who likes which color and everyone likes green, but no...

Can Prolog make rules based on the facts available? Can Prolog make rules based on the facts available? prolog logic artificial-intelligence Can Prolog Can Prolog make rules based on the facts available? For example if there are facts of who likes which color and everyone likes green, but not everyone likes pink: likes...

[ 0.01611328125, 0.015380859375, 0.001434326171875, 0.0277099609375, -0.0002593994140625, 0.0235595703125, 0.00439453125, 0.00823974609375, -0.0019683837890625, -0.0283203125, -0.01416015625, -0.0213623046875, -0.004730224609375, 0.01287841796875, 0.01239013671875, 0.0159912109375, 0.0...

[ 4171, 1250, 4867, 3249, 91736, 35509, 98, 15824, 7, 19882, 502, 62775, 66733, 130687, 2750, 1884, 10576, 30309, 50997, 1284, 959, 77233, 1542, 29568, 756, 1193, 831, 209303, 16750, 100, 90, 4677, 127501, 3395, 3173, 117776, 112, 1272, 11280...

[ 0.10137939453125, 0.19970703125, 0.283203125, 0.097900390625, 0.2271728515625, 0.1561279296875, 0.07586669921875, 0.2071533203125, 0.1279296875, 0.2081298828125, 0.1312255859375, 0.130859375, 0.1038818359375, 0.111328125, 0.032318115234375, 0.2081298828125, 0.157958984375, 0.135253...

embed

33738611_c0

33738611

prolog

0

Title: Term-expansion workflows Problem title: Term-expansion workflows Tags: prolog, logtalk Problem: Term-expansion workflows I'm adding library support for common term-expansion workflows (1). Currently, I have defined a "set" workflow, where sets of term-expansion rules (2) are tried until one of them succeeds, and...

Term-expansion workflows Term-expansion workflows prolog logtalk Term-expansion term_expansion goal_expansion Term-expansion workflows I'm adding library support for common term-expansion workflows (1). Currently, I have defined a "set" workflow, where sets of term-expansion rules (2) are tried until one of them succee...

[ 0.0283203125, 0.01055908203125, -0.019775390625, 0.041259765625, -0.004852294921875, -0.0205078125, -0.0062255859375, 0.0034027099609375, 0.003082275390625, -0.007232666015625, 0.0242919921875, 0.015869140625, -0.00115203857421875, 0.0068359375, -0.005157470703125, 0.00604248046875, ...

[ 2994, 39, 83613, 66, 6889, 4488, 118664, 502, 4867, 12684, 139109, 13579, 69236, 154107, 35773, 1294, 8060, 39210, 61924, 3509, 5423, 91736, 1737, 37842, 214493, 1434, 26338, 86, 14700, 50339, 115081, 11737, 137158, 2256, 82091, 40715, 138155, ...

[ 0.171875, 0.0736083984375, 0.1248779296875, 0.175537109375, 0.0740966796875, 0.1204833984375, 0.251708984375, 0.07025146484375, 0.1787109375, 0.09686279296875, 0.25732421875, 0.242431640625, 0.2125244140625, 0.0626220703125, 0.1429443359375, 0.0689697265625, 0.147705078125, 0.09667...

embed

53008160_c0

53008160

prolog

0

Title: Cannot get right output while doing prolog implementation of getting all unique vertices from the graph Problem title: Cannot get right output while doing prolog implementation of getting all unique vertices from the graph Tags: prolog Problem: Cannot get right output while doing prolog implementation of getting...

Cannot get right output while doing prolog implementation of getting all unique vertices from the graph Cannot get right output while doing prolog implementation of getting all unique vertices from the graph prolog the Cannot Cannot get right output while doing prolog implementation of getting all unique vertices from ...

[ 0.004302978515625, 0.0142822265625, 0.0242919921875, -0.017578125, -0.0037384033203125, -0.0101318359375, -0.0101318359375, 0.0113525390625, 0.00238037109375, -0.0120849609375, 0.01275634765625, 0.0084228515625, 0.017333984375, -0.000934600830078125, -0.0036468505859375, 0.028076171875...

[ 10869, 2046, 7108, 140992, 502, 4867, 208124, 20949, 756, 36998, 95378, 5170, 1295, 41382, 12960, 20594, 33022, 1653, 2063, 67, 11549, 724, 339, 8110, 214493, 10750, 527, 3173, 116, 138, 201, 5303, 81887, 86869, 2967, 20653, 6713, 144851, 1...

[ 0.1055908203125, 0.085693359375, 0.148681640625, 0.218505859375, 0.1412353515625, 0.21337890625, 0.1419677734375, 0.0621337890625, 0.093994140625, 0.2060546875, 0.1822509765625, 0.06549072265625, 0.0258331298828125, 0.1729736328125, 0.011383056640625, 0.00115966796875, 0.079711914062...

embed

46510034_c0

46510034

prolog

0

Title: Reducing Predicate calls Problem title: Reducing Predicate calls Tags: prolog, list Problem: Reducing Predicate calls I have this predicate: check_matrix([[_, E2, E3], [E4, E5, E6], [E7, E8, E9]]) :- E5 = E9, is_valid([E4, E5, E6]), is_valid([E7, E8, R9]), is_valid([E2, E5, E8]), is_valid([E3, E6, E9]). Which ch...

Reducing Predicate calls Reducing Predicate calls prolog list Reducing Predicate check_matrix is_valid Reducing Predicate calls I have this predicate: Which checks if my 2 x 2 matrix is valid, with the top left cell, _ being completely ignored.The E2 , E3 , E4 and E7 cells are just headers for the 2 x 2 matrix. Is thei...

[ -0.01214599609375, -0.0130615234375, 0.0250244140625, 0.01348876953125, -0.004638671875, 0.003936767578125, -0.03515625, -0.005706787109375, 0.0196533203125, -0.0224609375, 0.0191650390625, -0.005523681640625, 0.0035858154296875, 0.0002841949462890625, -0.0218505859375, 0.0089721679687...

[ 6096, 34, 21896, 7145, 2063, 67, 11782, 502, 4867, 5303, 12765, 192, 87427, 83, 7013, 1653, 2174, 759, 116, 1022, 50944, 425, 35604, 2663, 25737, 38750, 101, 8035, 64557, 124962, 241, 304, 363, 617, 966, 10336, 1314, 2363, 10443, 71, 20...

[ 0.15185546875, 0.1488037109375, 0.1031494140625, 0.1728515625, 0.1944580078125, 0.061370849609375, 0.1827392578125, 0.116455078125, 0.1883544921875, 0.13720703125, 0.19384765625, 0.0697021484375, 0.1121826171875, 0.160400390625, 0.1842041015625, 0.1519775390625, 0.03961181640625, 0...

embed

8295069_c0

8295069

prolog

0

Title: prolog list out every possible path of the recursion Problem title: prolog list out every possible path of the recursion Tags: prolog, recursion, path Problem: prolog list out every possible path of the recursion I would like to list out every possible path country(england,france). country(france,bulgaria). coun...

prolog list out every possible path of the recursion prolog list out every possible path of the recursion prolog recursion path get_waypoints Start End Waypoint Result _31242 _31243 _31332 _31333 _31422 _31423 _31602 _31603 prolog list out every possible path of the recursion I would like to list out every possible pat...

[ 0.018310546875, 0.0010833740234375, 0.00592041015625, 0.0004730224609375, -0.0198974609375, -0.0020751953125, -0.02099609375, -0.003204345703125, 0.006866455078125, -0.03662109375, -0.00128173828125, -0.0186767578125, -0.03369140625, -0.00567626953125, -0.008544921875, -0.0186767578125...

[ 502, 4867, 5303, 1810, 11907, 7722, 60875, 111, 195625, 1830, 2046, 7514, 38496, 13794, 18878, 42261, 126684, 5016, 2357, 304, 363, 123128, 66000, 101, 4015, 3742, 37321, 1884, 2146, 19236, 18929, 188, 1193, 47, 990, 3794, 1542, 1723, 22489...

[ 0.1761474609375, 0.2396240234375, 0.14697265625, 0.1134033203125, 0.156982421875, 0.190185546875, 0.252197265625, 0.048553466796875, 0.2056884765625, 0.10302734375, 0.0611572265625, 0.137451171875, 0.214599609375, 0.1038818359375, 0.1260986328125, 0.142578125, 0.1483154296875, 0.07...

embed

42266204_c0

42266204

prolog

0

Title: Solving an arithmetic expression with multiple answers (Vietnamese Math Maze) Problem title: Solving an arithmetic expression with multiple answers (Vietnamese Math Maze) Tags: prolog Problem: Solving an arithmetic expression with multiple answers (Vietnamese Math Maze) I have to try and solve this Vietnamese ma...

Solving an arithmetic expression with multiple answers (Vietnamese Math Maze) Solving an arithmetic expression with multiple answers (Vietnamese Math Maze) prolog Solving Vietnamese Math Maze Solving an arithmetic expression with multiple answers (Vietnamese Math Maze) I have to try and solve this Vietnamese math chall...

[ -0.0040283203125, -0.021484375, -0.0031585693359375, 0.02294921875, 0.028076171875, 0.037841796875, -0.01220703125, 0.0245361328125, -0.00112152099609375, -0.04248046875, 0.01287841796875, 0.00799560546875, 0.00176239013671875, 0.000713348388671875, 0.0087890625, 0.01165771484375, -0...

[ 6678, 6496, 8962, 282, 125195, 678, 48716, 35166, 6609, 126, 11627, 78804, 29678, 13, 502, 4867, 39272, 7717, 142, 9790, 86869, 903, 48909, 66801, 32116, 3378, 175201, 74070, 7, 43210, 73, 2606, 1297, 1760, 24301, 11354, 4398, 53927, 246, ...

[ 0.1177978515625, 0.056427001953125, 0.108642578125, 0.016571044921875, 0.201904296875, 0.089111328125, 0.2032470703125, 0.2059326171875, 0.1221923828125, 0.1563720703125, 0.14111328125, 0.1326904296875, 0.135986328125, 0.1055908203125, 0.1656494140625, 0.22265625, 0.268310546875, 0...

embed

65238264_c0

65238264

prolog

0

Title: Why Do i receive "Singleton variable" warning and incorrect result? Problem title: Why Do i receive "Singleton variable" warning and incorrect result? Tags: prolog Problem: Why Do i receive "Singleton variable" warning and incorrect result? i'm writing a simple function in prolog (beginer). F...

Why Do i receive "Singleton variable" warning and incorrect result? Why Do i receive "Singleton variable" warning and incorrect result? prolog Why Singleton Delta _1344 _1346 Why Do i receive "Singleton variable" warning and incorrect result? i'm writing a simple function in prolog (beginer). Functi...

[ -0.0026397705078125, -0.00909423828125, -0.00787353515625, -0.010009765625, -0.03515625, -0.005615234375, 0.0021820068359375, -0.0194091796875, 0.005584716796875, 0.0010223388671875, -0.00860595703125, 0.00164031982421875, -0.010986328125, -0.02001953125, 0.01104736328125, 0.0036621093...

[ 44084, 17, 53299, 213039, 1507, 77336, 1631, 592, 136, 214552, 16750, 502, 4867, 43609, 56588, 2681, 12465, 9271, 32562, 8781, 32354, 43934, 20037, 28670, 10763, 74481, 29458, 10644, 68587, 9523, 5490, 5526, 26785, 11675, 6977, 114453, 8966, ...

[ 0.09912109375, 0.042205810546875, 0.0889892578125, 0.2451171875, 0.24951171875, 0.2880859375, 0.1580810546875, 0.1116943359375, 0.0469970703125, 0.2021484375, 0.1546630859375, 0.125244140625, 0.1973876953125, 0.2147216796875, 0.211181640625, 0.07623291015625, 0.2135009765625, 0.170...

embed

41132468_c1

41132468

prolog

1

findall(edge(Grafo,X,Y),(X = A1),ListaAux2), % Pueden haber repetidos y no se eliminan. append(ListaAux2,ListaAux1,AristasArana). zpider(edge(Grafo,X1,Y1),AristasTotales,AristasArana) :- member(edge(Grafo,A1,A2), AristasTotales), X1 = A1, Y1 \= A2, findall(edge(Grafo,X,Y),(Y = A1),ListaAux1), findall(edge(Grafo,X,Y),(...

[ 0, -0.00384521484375, 0.015869140625, 0.012451171875, -0.00823974609375, -0.0125732421875, -0.0089111328125, 0.0034637451171875, 0.015869140625, -0.0286865234375, 0.0277099609375, 0.0303955078125, 0.00390625, -0.0135498046875, 0.028076171875, 0.0128173828125, 0.005279541015625, 0.0...

[ 7413, 5584, 297, 429, 37878, 3584, 1542, 1723, 62, 17727, 866, 1035, 6077, 10461, 1745, 103685, 13461, 57346, 1140, 110, 40, 27169, 19, 114689, 304, 7614, 12803, 15846, 97, 26715, 42, 169473, 32786, 284, 1172, 1193, 418, 990, 28271, 1528,...

[ 0.187744140625, 0.2132568359375, 0.1748046875, 0.119873046875, 0.13525390625, 0.1405029296875, 0.1092529296875, 0.0880126953125, 0.0941162109375, 0.061676025390625, 0.0872802734375, 0.09710693359375, 0.137451171875, 0.07427978515625, 0.071533203125, 0.087646484375, 0.1429443359375, ...

embed

37148350_c0

37148350

prolog

0

Title: How to determine the outcome of queries for constraint logic programming Problem title: How to determine the outcome of queries for constraint logic programming Tags: clpfd, prolog, swi-prolog Problem: How to determine the outcome of queries for constraint logic programming I am doing some revision for constrain...

How to determine the outcome of queries for constraint logic programming How to determine the outcome of queries for constraint logic programming clpfd prolog swi-prolog How Consider Some SWI-Prolog Indicate How to determine the outcome of queries for constraint logic programming I am doing some revision for constraint...

[ 0.0152587890625, 0.01348876953125, 0.01263427734375, 0.00927734375, 0.00162506103515625, -0.00173187255859375, -0.01300048828125, -0.01458740234375, -0.0024871826171875, 0.006439208984375, -0.005340576171875, -0.0211181640625, 0.0002956390380859375, 0.009765625, 0.01055908203125, 0.021...

[ 11249, 47, 83324, 70, 184345, 111, 41, 10484, 100, 158, 2816, 4288, 62775, 56037, 33139, 39557, 71, 502, 4867, 2452, 3454, 137399, 159, 38969, 10752, 110061, 111666, 12301, 25632, 1653, 2063, 50339, 26785, 9655, 26458, 36766, 959, 35166, 12...

[ 0.0640869140625, 0.0130615234375, 0.1630859375, 0.033660888671875, 0.224609375, 0.0858154296875, 0.156494140625, 0.1600341796875, 0.054443359375, 0.06512451171875, 0.173095703125, 0.098388671875, 0.158203125, 0.12451171875, 0.0079345703125, 0.047119140625, 0.064453125, 0.1072998046...

embed

19634452_c0

19634452

prolog

0

Title: Sorting in Prolog Problem title: Sorting in Prolog Tags: prolog, sorting, list Problem: Sorting in Prolog I have a data structure in Prolog like this: racks = [ [ (1-1), 1, [ shelf((0-0), 1, [ware_a:[0,10]]), shelf((0-1), 2, []), shelf((0-2), 3, []) ] ], [ (2-1), 2, [ shelf((0-0), 4, []), shelf((0-1), 5, []), sh...

Sorting in Prolog Sorting in Prolog prolog sorting list Sorting Prolog ware_a ware_c ware_b Sorting in Prolog I have a data structure in Prolog like this: One rack has coordinate (x-y) (for example (1-1)) and a cost value and a list of shelfs. A shelf itself has the same, a coordinate (within the rack), a cost value an...

[ 0.01556396484375, 0.01214599609375, -0.000850677490234375, -0.0074462890625, 0.00830078125, -0.017333984375, -0.01324462890625, -0.00469970703125, -0.002655029296875, -0.014892578125, 0.0147705078125, 0.0244140625, -0.0120849609375, -0.01312255859375, 0.00153350830078125, -0.0153198242...

[ 53666, 214, 23, 1250, 4867, 502, 12096, 5303, 105816, 11, 238, 275, 2053, 45646, 6561, 86147, 176866, 13, 53, 110218, 11034, 34292, 2412, 17463, 68034, 5701, 76228, 10941, 15876, 71924, 1528, 7722, 12989, 673, 22824, 55681, 157318, 207116, ...

[ 0.2138671875, 0.08355712890625, 0.057403564453125, 0.178466796875, 0.2568359375, 0.118408203125, 0.2152099609375, 0.197998046875, 0.2081298828125, 0.027191162109375, 0.02178955078125, 0.0743408203125, 0.0872802734375, 0.1307373046875, 0.0251617431640625, 0.1513671875, 0.1700439453125...

embed

33979305_c0

33979305

prolog

0

Title: Prolog Second Minimum value on a list Problem title: Prolog Second Minimum value on a list Tags: prolog, logic Problem: Prolog Second Minimum value on a list I am new to prolog and Im looking for some advice. I am working in building a code that defines a predicate secondMin/2 with the signature secondMin(list, ...

Prolog Second Minimum value on a list Prolog Second Minimum value on a list prolog logic Prolog Second Minimum Min2 Error List Min Min1 Prolog Second Minimum value on a list I am new to prolog and Im looking for some advice. I am working in building a code that defines a predicate secondMin/2 with the signature secondM...

[ -0.004608154296875, -0.009033203125, 0.0181884765625, 0.01007080078125, -0.005645751953125, 0.037841796875, -0.00616455078125, -0.0101318359375, 0.0034332275390625, -0.004669189453125, 0.00701904296875, -0.002655029296875, 0.017822265625, -0.01953125, 0.01519775390625, 0.0225830078125,...

[ 1250, 4867, 77648, 173858, 34292, 98, 5303, 502, 62775, 4211, 304, 212059, 32036, 418, 3525, 67660, 20697, 33976, 18151, 61924, 1653, 2063, 17932, 59076, 12477, 138256, 6562, 10461, 459, 25617, 12830, 101935, 10846, 6626, 80854, 44116, 18468, ...

[ 0.1412353515625, 0.2015380859375, 0.19482421875, 0.2464599609375, 0.1905517578125, 0.036895751953125, 0.1947021484375, 0.121337890625, 0.124267578125, 0.218017578125, 0.1417236328125, 0.1866455078125, 0.1295166015625, 0.05810546875, 0.02374267578125, 0.04150390625, 0.0076904296875, ...

embed

4060102_c0

4060102

prolog

0

Title: Logically Handling Lists Problem title: Logically Handling Lists Tags: list, prolog, prolog-findall Problem: Logically Handling Lists I have a large number of facts within my program, listing developers and designers in a company, as well as previous projects, like so.. % project(Project Name,Year) project(efnet...

Logically Handling Lists Logically Handling Lists list prolog prolog-findall Logically Handling Lists Project Name Year Role jane_cole alex_tobbs Single List Employees projects_of_all Staff Projects Logically Handling Lists I have a large number of facts within my program, listing developers and designers in a company,...

[ 0.0126953125, 0.0027008056640625, -0.0023651123046875, 0.032958984375, -0.0128173828125, 0.01422119140625, -0.0189208984375, -0.01287841796875, 0.01153564453125, -0.02734375, -0.0034027099609375, -0.020751953125, 0.0019683837890625, 0.01708984375, 0.009033203125, 0.0059814453125, 0.0...

[ 13146, 71407, 193237, 32036, 5303, 502, 4867, 111607, 5584, 27331, 15757, 42552, 2777, 47363, 46813, 662, 425, 188, 5125, 7, 43609, 31678, 365, 1033, 77635, 4390, 112006, 765, 21334, 14012, 15824, 28032, 759, 1528, 106001, 136, 51517, 14380, ...

[ 0.21044921875, 0.149169921875, 0.270263671875, 0.252685546875, 0.1932373046875, 0.12255859375, 0.1949462890625, 0.1260986328125, 0.2279052734375, 0.16650390625, 0.037109375, 0.080078125, 0.0706787109375, 0.1644287109375, 0.1910400390625, 0.0777587890625, 0.1038818359375, 0.08703613...

embed

21686479_c0

21686479

prolog

0

Title: Prolog, testing labeling heuristics Problem title: Prolog, testing labeling heuristics Tags: sicstus-prolog, clpfd, prolog Problem: Prolog, testing labeling heuristics I'm working on some experiments for comparing different labeling heuristics in Sicstus Prolog. But I keep getting into 'Resource error: insuffici...

Prolog, testing labeling heuristics Prolog, testing labeling heuristics sicstus-prolog clpfd prolog Prolog use_module all_distinct _SinceLast SinceLast Labeling Testcode Prolog, testing labeling heuristics I'm working on some experiments for comparing different labeling heuristics in Sicstus Prolog. But I keep getting ...

[ -0.0029449462890625, -0.00970458984375, -0.0106201171875, 0.00225830078125, -0.00032806396484375, -0.0174560546875, -0.013671875, 0.014404296875, 0.0030517578125, -0.06640625, 0.0274658203125, -0.007476806640625, -0.0029754638671875, 0.00482177734375, 0.01531982421875, 0.00059509277343...

[ 1250, 4867, 134234, 67967, 214, 764, 62210, 26536, 18253, 3454, 33139, 39557, 71, 502, 4527, 83279, 756, 46295, 38893, 42380, 2729, 271, 66016, 129214, 8647, 40899, 41637, 20697, 28007, 37397, 12921, 63457, 13695, 4332, 60427, 18499, 129980, ...

[ 0.171142578125, 0.24951171875, 0.1378173828125, 0.2293701171875, 0.0811767578125, 0.04083251953125, 0.1710205078125, 0.07244873046875, 0.234619140625, 0.121826171875, 0.001861572265625, 0.042572021484375, 0.07171630859375, 0.12060546875, 0.0677490234375, 0.114501953125, 0.08282470703...

embed

75213885_c0

75213885

prolog

0

Title: Reversible CSV parsing Problem title: Reversible CSV parsing Tags: prolog, csv, swi-prolog Problem: Reversible CSV parsing Prolog newbie here. In SWI Prolog, I'm trying to figure out how to parse a simple line of CSV reversibly, but I'm stuck. Here's what I've got: csvstring1(S, L) :- split_string(S, ',', ',', T...

Reversible CSV parsing Reversible CSV parsing prolog csv swi-prolog Reversible CSV csvstring1 split_string atom_number csvstring2 atomic_list_concat csvstring3 ERROR Arguments Reversible CSV parsing Prolog newbie here. In SWI Prolog, I'm trying to figure out how to parse a simple line of CSV reversibly, but I'm stuck. ...

[ -0.00823974609375, 0.019287109375, 0.0147705078125, 0.0296630859375, -0.01324462890625, 0.020263671875, 0.0113525390625, 0.01806640625, 0.0029144287109375, -0.000919342041015625, -0.01409912109375, 0.00004124641418457031, 0.003814697265625, 0.016357421875, 0.00156402587890625, 0.018554...

[ 853, 814, 55356, 313, 43486, 366, 502, 4867, 20763, 334, 2452, 3454, 91693, 418, 65450, 34627, 2606, 304, 6562, 4460, 363, 151206, 24638, 112140, 1250, 9014, 159, 38969, 26366, 184, 8781, 13315, 39531, 172, 38526, 179933, 136, 4488, 2472, ...

[ 0.076171875, 0.202392578125, 0.17919921875, 0.06866455078125, 0.273681640625, 0.15478515625, 0.09320068359375, 0.169677734375, 0.072265625, 0.1783447265625, 0.1697998046875, 0.111328125, 0.16259765625, 0.0162506103515625, 0.1085205078125, 0.1419677734375, 0.06256103515625, 0.060058...

embed

65789776_c0

65789776

prolog

0

Title: Can Prolog facts be used for adversarial search? Problem title: Can Prolog facts be used for adversarial search? Tags: prolog, search Problem: Can Prolog facts be used for adversarial search? One can search the full tic tac toe game tree, using only fail fast optimization of negation as failure, in less that 100...

Can Prolog facts be used for adversarial search? Can Prolog facts be used for adversarial search? prolog search Can Prolog CPU Lips Can Prolog facts be used for adversarial search? One can search the full tic tac toe game tree, using only fail fast optimization of negation as failure, in less that 100ms. Thats what thi...

[ 0.01806640625, -0.0162353515625, 0.020263671875, 0.029541015625, -0.0059814453125, -0.0167236328125, 0.004180908203125, -0.01507568359375, -0.0074462890625, -0.04833984375, -0.00396728515625, 0.029541015625, -0.019775390625, 0.01416015625, -0.00750732421875, -0.01708984375, 0.0192871...

[ 4171, 1250, 4867, 15824, 7, 11814, 100, 172096, 289, 33938, 502, 86039, 156903, 831, 4393, 96212, 36322, 4375, 6712, 53201, 17368, 4734, 35782, 4271, 87235, 108, 125682, 237, 137578, 40715, 805, 4432, 29806, 14505, 18811, 11341, 11001, 13579,...

[ 0.0531005859375, 0.1732177734375, 0.266845703125, 0.2034912109375, 0.1015625, 0.1370849609375, 0.035888671875, 0.1929931640625, 0.1180419921875, 0.2288818359375, 0.109619140625, 0.1624755859375, 0.1783447265625, 0.031097412109375, 0.0791015625, 0.1268310546875, 0.1434326171875, 0.1...

embed

5985749_c0

5985749

prolog

0

Title: creating lists, searching sth which has been given and making combination on prolog Problem title: creating lists, searching sth which has been given and making combination on prolog Tags: prolog Problem: creating lists, searching sth which has been given and making combination on prolog I want to make a Prolog ...

creating lists, searching sth which has been given and making combination on prolog creating lists, searching sth which has been given and making combination on prolog prolog creating lists, searching sth which has been given and making combination on prolog I want to make a Prolog program. Predicate will be like this:...

[ 0.0062255859375, -0.01019287109375, 0.00970458984375, 0.036376953125, -0.0203857421875, 0.0230712890625, -0.0038909912109375, 0.01239013671875, 0.00445556640625, -0.03125, 0.01556396484375, -0.005401611328125, 0.0186767578125, -0.000263214111328125, -0.00885009765625, 0.0010986328125, ...

[ 105233, 5303, 7, 157318, 927, 3129, 1556, 2809, 34475, 20662, 162515, 98, 502, 4867, 3444, 3249, 1250, 1528, 7145, 2063, 67, 1884, 187781, 70, 29479, 1653, 9351, 154663, 284, 335, 62, 26950, 123055, 14012, 36663, 450, 96853, 756, 63399, 7...

[ 0.161376953125, 0.23583984375, 0.08160400390625, 0.20947265625, 0.113037109375, 0.0556640625, 0.0936279296875, 0.09619140625, 0.142578125, 0.0673828125, 0.18212890625, 0.04736328125, 0.14990234375, 0.2401123046875, 0.0670166015625, 0.0770263671875, 0.1591796875, 0.1639404296875, ...

embed

40199978_c0

40199978

prolog

0

Title: Filtering and modifiying a list in Prolog Problem title: Filtering and modifiying a list in Prolog Tags: prolog Problem: Filtering and modifiying a list in Prolog Good Day, I have a task such that given a list [3,9,11,2,14], I want to filter out any value greater than 6. I have that working right now. sift([],[]...

Filtering and modifiying a list in Prolog Filtering and modifiying a list in Prolog prolog Filtering Prolog Result CCC ThrowAway Tail Results _G2271 _G2276 _G2281 Filtering and modifiying a list in Prolog Good Day, I have a task such that given a list [3,9,11,2,14], I want to filter out any value greater than 6. I have...

[ 0.01092529296875, 0.029296875, 0.01953125, -0.01031494140625, 0.0184326171875, 0.0002288818359375, -0.0019378662109375, 0.0076904296875, 0.0162353515625, 0.01202392578125, 0.0216064453125, -0.00457763671875, -0.033203125, -0.004730224609375, 0.023681640625, 0.000911712646484375, 0.03...

[ 128896, 136, 73197, 38543, 5303, 1250, 4867, 502, 126684, 134982, 15555, 284, 7514, 1218, 379, 146104, 15770, 11835, 134712, 23, 10013, 66211, 34475, 125157, 1662, 304, 2592, 3444, 46312, 1810, 2499, 34292, 117396, 3501, 2289, 20697, 5036, 30...

[ 0.2646484375, 0.011993408203125, 0.195068359375, 0.08990478515625, 0.2178955078125, 0.1842041015625, 0.266845703125, 0.1304931640625, 0.1112060546875, 0.20751953125, 0.106201171875, 0.003204345703125, 0.15380859375, 0.125, 0.075927734375, 0.1123046875, 0.044830322265625, 0.03001403...

embed

56300386_c0

56300386

prolog

0

Title: How can i make a program in Prolog that recognizes the gender, plurality and case of a noun which the user inputs? Problem title: How can i make a program in Prolog that recognizes the gender, plurality and case of a noun which the user inputs? Tags: prolog, lexicon Problem: How can i make a program in Prolog th...

How can i make a program in Prolog that recognizes the gender, plurality and case of a noun which the user inputs? How can i make a program in Prolog that recognizes the gender, plurality and case of a noun which the user inputs? prolog lexicon How Prolog gr_noun_suffix gr_noun Gender Plurality Singularity Case How can...

[ -0.013427734375, -0.0035858154296875, -0.015380859375, -0.0034332275390625, -0.0024566650390625, 0.0274658203125, 0.004180908203125, 0.01287841796875, -0.00531005859375, -0.020751953125, 0.01019287109375, -0.04052734375, -0.030517578125, -0.0184326171875, -0.00689697265625, 0.009216308...

[ 11249, 17, 3249, 1528, 23, 1250, 4867, 125296, 127501, 97308, 2481, 7225, 110, 309, 38937, 107730, 502, 95, 73140, 19, 4452, 157, 77745, 55923, 527, 23894, 42473, 42, 134393, 53427, 35975, 43731, 831, 91736, 8337, 27781, 2046, 3871, 4568, ...

[ 0.026123046875, 0.0284881591796875, 0.0640869140625, 0.1915283203125, 0.03631591796875, 0.169921875, 0.255126953125, 0.1387939453125, 0.2161865234375, 0.18603515625, 0.042236328125, 0.113525390625, 0.047576904296875, 0.1160888671875, 0.1075439453125, 0.16064453125, 0.1185302734375, ...

embed

42044887_c0

42044887

prolog

0

Title: Prolog - Printing Result After Two Recursive Rules | Sum of Squares Problem title: Prolog - Printing Result After Two Recursive Rules | Sum of Squares Tags: prolog, recursion Problem: Prolog - Printing Result After Two Recursive Rules | Sum of Squares I am brand new to prolog and I feel like there is a concept t...

Prolog - Printing Result After Two Recursive Rules | Sum of Squares Prolog - Printing Result After Two Recursive Rules | Sum of Squares prolog recursion Prolog Printing Result After Two Recursive Rules Sum Squares Prolog - Printing Result After Two Recursive Rules | Sum of Squares I am brand new to prolog and I feel li...

[ -0.005157470703125, 0.0194091796875, 0.01104736328125, 0.0086669921875, -0.017333984375, 0.01275634765625, -0.02197265625, 0.00506591796875, -0.01129150390625, -0.00946044921875, 0.0087890625, -0.02001953125, -0.0037078857421875, 0.00182342529296875, 0.0211181640625, -0.01153564453125,...

[ 1250, 4867, 39754, 126684, 24372, 32964, 853, 48650, 5844, 139118, 36335, 111, 68305, 502, 195625, 3525, 12319, 23755, 35782, 28219, 56282, 27689, 10366, 1830, 31577, 30646, 159, 10554, 108047, 12638, 153939, 39958, 5303, 892, 30957, 38937, 41,...

[ 0.1558837890625, 0.2392578125, 0.1973876953125, 0.183837890625, 0.10498046875, 0.1348876953125, 0.0303955078125, 0.1644287109375, 0.0927734375, 0.181396484375, 0.2181396484375, 0.13720703125, 0.183837890625, 0.14111328125, 0.2125244140625, 0.044158935546875, 0.0235748291015625, 0.1...

embed

39809730_c0

39809730

prolog

0

Title: How to permute in Prolog the elements of a list composed of sub-list and atoms Problem title: How to permute in Prolog the elements of a list composed of sub-list and atoms Tags: prolog, permutation Problem: How to permute in Prolog the elements of a list composed of sub-list and atoms Let us consider lists such...

How to permute in Prolog the elements of a list composed of sub-list and atoms How to permute in Prolog the elements of a list composed of sub-list and atoms prolog permutation How Prolog OriginalList PermutedList How to permute in Prolog the elements of a list composed of sub-list and atoms Let us consider lists such ...

[ -0.005340576171875, 0.005859375, 0.01556396484375, 0.0164794921875, -0.0284423828125, 0.0166015625, -0.0235595703125, 0.003173828125, -0.002044677734375, -0.0233154296875, 0.0098876953125, 0.00830078125, 0.021484375, 0.0255126953125, -0.01422119140625, 0.01190185546875, -0.0015792846...

[ 11249, 47, 117, 561, 67, 23, 1250, 4867, 80854, 5303, 150350, 1614, 6562, 136, 34627, 71, 502, 22062, 34525, 154663, 908, 3674, 16916, 339, 82449, 1126, 80389, 92714, 617, 82761, 5809, 27489, 10644, 50339, 2806, 1884, 756, 7722, 14311, 56...

[ 0.0830078125, 0.00555419921875, 0.1376953125, 0.216064453125, 0.1143798828125, 0.05706787109375, 0.1712646484375, 0.238525390625, 0.1912841796875, 0.189697265625, 0.133056640625, 0.2108154296875, 0.174560546875, 0.05133056640625, 0.194091796875, 0.0113525390625, 0.1312255859375, 0....

embed

33448127_c0

33448127

prolog

0

Title: How to properly express inequality in prolog? Problem title: How to properly express inequality in prolog? Tags: prolog, prolog-dif Problem: How to properly express inequality in prolog? TL;DR: sibling(a,X) succeeds with the answer X = a , but sibling(a,a) fails. I have the following Prolog file: children(a, c)....

How to properly express inequality in prolog? How to properly express inequality in prolog? prolog prolog-dif How How to properly express inequality in prolog? TL;DR: sibling(a,X) succeeds with the answer X = a , but sibling(a,a) fails. I have the following Prolog file: It seems clear enough to me, two person are sibli...

[ 0.01129150390625, 0.00439453125, 0.0169677734375, 0.00762939453125, -0.0283203125, -0.015380859375, -0.006683349609375, -0.00860595703125, 0.0021209716796875, -0.01385498046875, 0.01043701171875, 0.0006256103515625, -0.01385498046875, 0.0281982421875, 0.016357421875, -0.0023193359375, ...

[ 11249, 155965, 36510, 23, 13, 161789, 502, 4867, 420, 23498, 78, 79298, 11, 1542, 214493, 678, 35166, 1193, 2203, 10, 1284, 35782, 1250, 11435, 34735, 6626, 3445, 621, 27863, 5701, 959, 10002, 41, 165132, 114453, 50339, 179140, 123166, 136,...

[ 0.037445068359375, 0.138916015625, 0.1976318359375, 0.10760498046875, 0.131591796875, 0.23388671875, 0.15478515625, 0.23046875, 0.05303955078125, 0.019195556640625, 0.09814453125, 0.1856689453125, 0.07012939453125, 0.105712890625, 0.20166015625, 0.0249176025390625, 0.117431640625, ...

embed

47683361_c0

47683361

prolog

0

Title: Prolog - How can I save results from recursive calls? Problem title: Prolog - How can I save results from recursive calls? Tags: prolog, recursion Problem: Prolog - How can I save results from recursive calls? I am still trying to understand the Prolog logic and have stumbled upon a problem. I am trying to save ...

Prolog - How can I save results from recursive calls? Prolog - How can I save results from recursive calls? prolog recursion recursive main Prolog How Tail Lin Lout Head Prolog - How can I save results from recursive calls? I am still trying to understand the Prolog logic and have stumbled upon a problem. I am trying t...

[ 0.01214599609375, 0.024658203125, 0.0087890625, 0.00012969970703125, -0.01416015625, 0.00677490234375, 0.00194549560546875, -0.001708984375, 0.0147705078125, -0.0238037109375, 0.007110595703125, -0.005340576171875, -0.018310546875, -0.006011962890625, 0.0244140625, -0.009521484375, 0...

[ 1250, 4867, 11249, 831, 30098, 50339, 1295, 195625, 5844, 11782, 7, 87, 502, 1830, 5201, 1218, 379, 25497, 42225, 18, 44816, 28219, 62775, 2967, 31577, 142424, 14037, 28032, 27875, 98, 914, 9319, 7413, 5584, 2046, 856, 50770, 4332, 987, 7...

[ 0.151611328125, 0.2452392578125, 0.0843505859375, 0.07965087890625, 0.2181396484375, 0.2222900390625, 0.1683349609375, 0.2293701171875, 0.181884765625, 0.1893310546875, 0.087158203125, 0.05804443359375, 0.1102294921875, 0.0966796875, 0.1060791015625, 0.065673828125, 0.0701904296875, ...

embed

53947621_c0

53947621

prolog

0

Title: Stop Prolog from inferring values Problem title: Stop Prolog from inferring values Tags: prolog, clpfd Problem: Stop Prolog from inferring values If I run solved([[x, o, o], [o, o, o], [o, o, o]]) it should output true as there is only x and if I run solved([[x, o, o], [o, o, o], [o, o, x]]) it should output fal...

Stop Prolog from inferring values Stop Prolog from inferring values prolog clpfd inferring Stop Prolog use_module rotate_clock Xss Zss Yss rotate_anti BRJ num_x sum_list Sum Rest Stop Prolog from inferring values If I run solved([[x, o, o], [o, o, o], [o, o, o]]) it should output true as there is only x and if I run so...

[ -0.007110595703125, 0.01190185546875, 0.0177001953125, 0.01007080078125, -0.02587890625, 0.018798828125, -0.00604248046875, 0.0086669921875, 0.0048828125, -0.0274658203125, -0.012451171875, -0.0177001953125, 0.01043701171875, 0.00848388671875, 0.01141357421875, 0.01446533203125, 0.00...

[ 42284, 1250, 4867, 1295, 53498, 2852, 142424, 502, 39557, 71, 4527, 83279, 47014, 67, 21135, 1193, 7, 567, 990, 5772, 60310, 13269, 425, 10554, 6562, 36335, 49756, 11675, 86869, 132, 36, 31, 5608, 140992, 29568, 2685, 4734, 1022, 98320, 1...

[ 0.184814453125, 0.1756591796875, 0.260498046875, 0.08770751953125, 0.2235107421875, 0.1353759765625, 0.1971435546875, 0.1201171875, 0.06640625, 0.1046142578125, 0.052520751953125, 0.1112060546875, 0.1256103515625, 0.0692138671875, 0.1656494140625, 0.01983642578125, 0.000152587890625,...

embed

46266676_c1

46266676

prolog

1

_35900) ? creep Call: (12) lists:member(c, [a]) ? creep Fail: (12) lists:member(c, [a]) ? creep Redo: (11) redu([c, a], _35900) ? creep Call: (12) redu([a], _35906) ? creep Call: (13) lists:member(a, []) ? creep Fail: (13) lists:member(a, []) ? creep Redo: (12) redu([a], _35906) ? creep Call: (13) redu([], _35912) ? c...

[ -0.003875732421875, 0.0211181640625, 0.021728515625, 0.0250244140625, -0.0086669921875, 0.01031494140625, 0.0223388671875, -0.00164031982421875, 0.02880859375, -0.00445556640625, -0.000835418701171875, -0.0194091796875, 0.0038909912109375, 0.003692626953125, 0.0133056640625, -0.0086669...

[ 101, 5843, 20543, 705, 49512, 254, 26265, 23676, 5303, 27417, 238, 190355, 6096, 31, 21282, 28969, 10, 120301, 110156, 28261, 5443, 17857, 11438, 1193, 501, 6183, 77947, 73342, 163, 6083, 46876, 195625, 1830, 14602, 12301, 70731, 90, 17932, ...

[ 0.049835205078125, 0.1424560546875, 0.2310791015625, 0.0283203125, 0.1773681640625, 0.123046875, 0.195068359375, 0.1376953125, 0.1806640625, 0.14599609375, 0.051788330078125, 0.144775390625, 0.0826416015625, 0.134765625, 0.052001953125, 0.1646728515625, 0.027496337890625, 0.1296386...

embed

29083309_c0

29083309

prolog

0

Title: Generate list of numbers to fit certain criteria Problem title: Generate list of numbers to fit certain criteria Tags: prolog Problem: Generate list of numbers to fit certain criteria I had a predicate to generate a list of numbers, generate_numbers(0,[]). generate_numbers(N,[Head|Tail]):- N > 0, Head is N, N1 i...

Generate list of numbers to fit certain criteria Generate list of numbers to fit certain criteria prolog Generate generate_numbers Head Tail N-1 X-1 Generate list of numbers to fit certain criteria I had a predicate to generate a list of numbers, I am trying to modify it so that it generates numbers X and Y up to a lim...

[ 0.00174713134765625, -0.00433349609375, -0.0022125244140625, -0.007476806640625, 0.01483154296875, 0.01507568359375, -0.0203857421875, -0.01458740234375, 0.019287109375, -0.0032806396484375, 0.011474609375, 0.0037384033203125, -0.0250244140625, -0.017822265625, 0.020263671875, -0.00402...

[ 155370, 67, 5303, 111, 101935, 47, 11177, 24233, 55738, 11, 502, 4867, 139392, 2606, 1297, 44816, 1218, 379, 541, 5759, 1193, 1653, 2063, 31577, 2811, 40383, 136, 990, 1257, 17475, 27289, 106, 4426, 159, 997, 805, 237875, 26785, 12765, 11...

[ 0.18701171875, 0.038177490234375, 0.2030029296875, 0.047821044921875, 0.2122802734375, 0.0675048828125, 0.189697265625, 0.1224365234375, 0.1898193359375, 0.06829833984375, 0.081787109375, 0.1064453125, 0.2342529296875, 0.1663818359375, 0.165283203125, 0.111572265625, 0.10205078125, ...

embed

63056311_c0

63056311

prolog

0

Title: finding depth of object without use of arithmetics Problem title: finding depth of object without use of arithmetics Tags: prolog, recursion Problem: finding depth of object without use of arithmetics Without using arithmetics (=< , =>, etc.)! I have a few separate piles of blocks, for example two piles. I need ...

finding depth of object without use of arithmetics finding depth of object without use of arithmetics prolog recursion is_on_top Block1 Pile Block2 is_bellow is_higher Any SAME finding depth of object without use of arithmetics Without using arithmetics (=< , =>, etc.)! I have a few separate piles of blocks, for exampl...

[ 0.0011138916015625, 0.0146484375, 0.01513671875, -0.004119873046875, 0.0024871826171875, -0.00689697265625, -0.017578125, -0.0279541015625, 0.00762939453125, -0.0294189453125, 0.005889892578125, -0.01116943359375, 0.0125732421875, -0.01031494140625, 0.0159912109375, -0.02490234375, 0...

[ 90791, 168867, 111, 36746, 15490, 4527, 187, 8962, 282, 41637, 502, 4867, 195625, 1830, 83, 191, 13784, 80231, 418, 13289, 13, 304, 372, 41566, 84396, 56, 28541, 159, 70171, 177417, 17368, 16093, 44357, 84797, 81502, 46389, 6626, 3917, 2636...

[ 0.1624755859375, 0.271240234375, 0.14794921875, 0.198486328125, 0.12109375, 0.074951171875, 0.03900146484375, 0.140625, 0.091064453125, 0.08477783203125, 0.1097412109375, 0.1622314453125, 0.1427001953125, 0.045166015625, 0.04864501953125, 0.116455078125, 0.16455078125, 0.1474609375...

embed

14070576_c0

14070576

prolog

0

Title: Difficulty in Prolog Problem title: Difficulty in Prolog Tags: logic, prolog Problem: Difficulty in Prolog I need to solve a logic problem using Prolog. I have just one problem: In the answer, the name of the attributes doesn't appear. My code to generate the attributes is: gera(p(Prof, AlunosProf, Tema, AlunosT...

Difficulty in Prolog Difficulty in Prolog logic prolog Difficulty Prolog Prof AlunosProf Tema AlunosTema _G2046 _G2053 _G2056 _G2058 Q12 Q22 gera_ef Difficulty in Prolog I need to solve a logic problem using Prolog. I have just one problem: In the answer, the name of the attributes doesn't appear. My code to generate t...

[ 0.0157470703125, 0.000797271728515625, -0.002349853515625, 0.01116943359375, 0.00139617919921875, -0.004913330078125, -0.0400390625, -0.0133056640625, 0.0074462890625, -0.01348876953125, 0.00390625, 0.0155029296875, -0.0005645751953125, 0.004608154296875, -0.0089111328125, 0.0169677734...

[ 191144, 71333, 939, 23, 1250, 4867, 62775, 502, 11739, 53928, 2245, 147161, 17533, 10476, 192, 724, 1549, 9271, 14226, 13683, 10057, 2396, 1530, 4015, 10110, 4240, 3871, 86869, 2967, 17368, 1660, 1632, 35166, 70, 9351, 111, 150380, 90, 2202...

[ 0.189208984375, 0.194091796875, 0.0634765625, 0.1044921875, 0.192138671875, 0.277099609375, 0.1539306640625, 0.1375732421875, 0.12841796875, 0.0989990234375, 0.1439208984375, 0.11572265625, 0.15625, 0.10760498046875, 0.1295166015625, 0.106689453125, 0.048797607421875, 0.16064453125...

embed

59326895_c0

59326895

prolog

0

Title: Sort a list in Prolog Problem title: Sort a list in Prolog Tags: prolog Problem: Sort a list in Prolog The fact base stores exam schedule information in the form: exam ('group', 'subject', 'teacher', date). Write a program that allows you to select exam information for the group / teacher, sorting it by date. So...

Sort a list in Prolog Sort a list in Prolog prolog Sort Prolog PROGRAMMING John MATH ENG Gabe LITERATURE Homer Number Exams Name Before After Sort a list in Prolog The fact base stores exam schedule information in the form: exam ('group', 'subject', 'teacher', date). Write a program that allows you to select exam infor...

[ 0.023681640625, 0.00579833984375, 0.0036773681640625, 0.01287841796875, -0.0233154296875, 0.0068359375, -0.0296630859375, 0.0157470703125, 0.0002899169921875, -0.00946044921875, -0.00830078125, 0.007110595703125, 0.00225830078125, -0.0096435546875, -0.0194091796875, 0.00006055831909179...

[ 53666, 5303, 1250, 4867, 23, 502, 59677, 4939, 139909, 48262, 53186, 13, 16970, 136265, 165471, 2005, 42, 103332, 89536, 15757, 117371, 24372, 15824, 3647, 4343, 42276, 80889, 4677, 3173, 51588, 75161, 17615, 5372, 5622, 18781, 1528, 114864, ...

[ 0.259033203125, 0.2095947265625, 0.186279296875, 0.262939453125, 0.024383544921875, 0.137939453125, 0.10107421875, 0.0869140625, 0.11181640625, 0.06292724609375, 0.0850830078125, 0.08477783203125, 0.01165771484375, 0.037872314453125, 0.0202789306640625, 0.077392578125, 0.090698242187...

embed

78258027_c0

78258027

prolog

0

Title: How to get Prolog to return false when user attempts to backtrack? Problem title: How to get Prolog to return false when user attempts to backtrack? Tags: prolog-toplevel, prolog Problem: How to get Prolog to return false when user attempts to backtrack? I want to make a program in Prolog that prints false when ...

How to get Prolog to return false when user attempts to backtrack? How to get Prolog to return false when user attempts to backtrack? prolog-toplevel prolog How Prolog Predicate backtrack_attempted Reset reset_backtrack_flag Set set_backtrack_flag likes_food Person Food Attempt How to get Prolog to return false when us...

[ 0.017578125, 0.027099609375, 0.016357421875, 0.0062255859375, -0.011962890625, -0.00396728515625, 0.021240234375, 0.00099945068359375, -0.0172119140625, -0.036376953125, -0.0081787109375, 0.0098876953125, -0.0244140625, 0.00537109375, 0.0177001953125, 0.00787353515625, -0.00662231445...

[ 11249, 2046, 1250, 4867, 30646, 98320, 3229, 38937, 81887, 7, 47, 4420, 125728, 502, 13784, 67919, 7145, 2063, 257, 34224, 9624, 126, 168398, 12620, 190872, 19943, 5423, 1884, 49558, 15270, 34562, 1913, 3444, 1528, 28412, 18151, 156377, 100, ...

[ 0.0350341796875, 0.066650390625, 0.19140625, 0.2322998046875, 0.1881103515625, 0.2352294921875, 0.040771484375, 0.118408203125, 0.17626953125, 0.0162811279296875, 0.0528564453125, 0.158447265625, 0.264404296875, 0.098388671875, 0.009735107421875, 0.0845947265625, 0.0914306640625, 0...

embed

27929178_c0

27929178

prolog

0

Title: Step By Step Help For Recursion Problem title: Step By Step Help For Recursion Tags: prolog, recursion Problem: Step By Step Help For Recursion I have gone to many online text tutorials, asked my teacher, attempted to go through questions to gain a more thorough knowledge of recursion however I am still struggli...

Step By Step Help For Recursion Step By Step Help For Recursion prolog recursion Step Help Recursion Step By Step Help For Recursion I have gone to many online text tutorials, asked my teacher, attempted to go through questions to gain a more thorough knowledge of recursion however I am still struggling with understand...

[ 0.01422119140625, 0.01177978515625, 0.00982666015625, 0.017822265625, 0.0067138671875, 0.0218505859375, -0.00909423828125, -0.00555419921875, 0.0167236328125, -0.0174560546875, 0.021484375, -0.0390625, -0.0208740234375, 0.0240478515625, 0.0179443359375, 0.0023651123046875, 0.02148437...

[ 50478, 3311, 39527, 1326, 165428, 42, 6889, 502, 4867, 195625, 1830, 1118, 7986, 57143, 117914, 51359, 7464, 237875, 100094, 3642, 29479, 28219, 80934, 83687, 32354, 159029, 68034, 11814, 33022, 63920, 18151, 93766, 94928, 63134, 43240, 8305, 5...

[ 0.182861328125, 0.0855712890625, 0.1986083984375, 0.09051513671875, 0.1827392578125, 0.18017578125, 0.1605224609375, 0.1456298828125, 0.21533203125, 0.267822265625, 0.1912841796875, 0.040740966796875, 0.115234375, 0.096435546875, 0.060394287109375, 0.0391845703125, 0.006439208984375,...

embed

22199085_c1

22199085

prolog

1

a,b,c,d,e,f. getBook(p3) :- a,b,c,d,e,f. getBook(p4) :- a,b,c,d,e,f. getBook(p5) :- a,b,c,d,e,f. getBook(p6) :- a,b,c,d,e,f. % Add your facts: not(touching(position(a),position(d))). position(e):- p5,p2. % C touches exactly two books: eventually something like aggregate_all(count, touching(e,X), Count):-2. position(c)...

[ 0.01519775390625, 0.01708984375, 0.019775390625, 0.0137939453125, -0.01068115234375, -0.00445556640625, 0.0025177001953125, -0.0030059814453125, 0.00133514404296875, -0.041748046875, -0.0093994140625, 0.0030670166015625, 0.003082275390625, -0.015869140625, 0.000644683837890625, -0.0035...

[ 10, 275, 238, 71, 13, 420, 2046, 37975, 254, 21320, 15772, 29557, 43317, 59690, 1745, 29117, 15824, 959, 185188, 214, 40322, 19069, 915, 758, 5442, 313, 116281, 7, 66161, 6626, 42840, 155605, 197564, 5584, 71013, 23996, 1542, 108210, 5428, ...

[ 0.0242462158203125, 0.0863037109375, 0.0894775390625, 0.09423828125, 0.0894775390625, 0.1290283203125, 0.11669921875, 0.2081298828125, 0.046112060546875, 0.16650390625, 0.035888671875, 0.084228515625, 0.08831787109375, 0.089111328125, 0.00384521484375, 0.152099609375, 0.1763916015625...

embed

4493404_c0

4493404

prolog

0

Title: Prolog print out 2 dimension table Problem title: Prolog print out 2 dimension table Tags: printing, prolog, arrays Problem: Prolog print out 2 dimension table i have a square with start and finish points, also places where i can't go. And my program must find a way to reach finish: ar_galima([], _, _):-!. ar_ga...

Prolog print out 2 dimension table Prolog print out 2 dimension table printing prolog arrays Prolog ar_galima Prad Galas Kelias Stac_M Stac_K Tikslas Draudziama Kelias2 Ilgis Aukstis Prolog print out 2 dimension table i have a square with start and finish points, also places where i can't go. And my program must find a...

[ 0.01025390625, -0.004913330078125, 0.007537841796875, 0.00167083740234375, -0.01239013671875, 0.0038299560546875, -0.005523681640625, 0.0024566650390625, 0.0030517578125, 0.000759124755859375, 0.009033203125, 0.0118408203125, -0.01385498046875, -0.00897216796875, -0.000640869140625, 0....

[ 1250, 4867, 28412, 1810, 116, 91403, 23180, 2448, 1916, 502, 10298, 4778, 187, 21045, 4061, 71, 30733, 7, 93530, 162, 6512, 594, 605, 19591, 2512, 154383, 8984, 2887, 304, 12964, 65101, 63125, 765, 108047, 678, 4034, 136, 67229, 26847, 44...

[ 0.174560546875, 0.259521484375, 0.1884765625, 0.1158447265625, 0.177490234375, 0.2196044921875, 0.251953125, 0.1422119140625, 0.013427734375, 0.14111328125, 0.086181640625, 0.01953125, 0.059326171875, 0.1546630859375, 0.10986328125, 0.05810546875, 0.113037109375, 0.0325927734375, ...

embed

16367580_c0

16367580

prolog

0

Title: Prolog - neighbours in matrix Problem title: Prolog - neighbours in matrix Tags: prolog, neighbours, coordinates Problem: Prolog - neighbours in matrix I need a query, which help me resolve following problem: I have list of coordinates [(1,1),(1,2),(1,3),(2,1),(2,2),(2,3)] (1,1) (1,2) (1,3) (3,1) (3,2) (3,3) I w...

Prolog - neighbours in matrix Prolog - neighbours in matrix prolog neighbours coordinates Prolog XSS Rows Columns get_configuration Head Tail Used Neighbour Tail2 Used2 CountOfCoords Coords Result CountOfPairs List Coord Ngbs Ngb Tail3 nth1 Prolog - neighbours in matrix I need a query, which help me resolve following p...

[ 0.00567626953125, 0.01446533203125, 0.023681640625, -0.0196533203125, -0.00421142578125, -0.01544189453125, -0.00341796875, 0.0162353515625, 0.0289306640625, -0.025634765625, -0.016845703125, 0.00958251953125, -0.009765625, 0.002410888671875, -0.0005950927734375, 0.00628662109375, 0....

[ 1250, 4867, 108, 6958, 38648, 23, 50944, 425, 502, 176866, 1193, 15268, 96190, 233987, 2046, 153837, 34, 44816, 1218, 379, 5281, 304, 345, 108210, 132887, 10625, 6651, 1311, 126684, 8335, 481, 32036, 16145, 275, 363, 927, 3871, 41, 1294, ...

[ 0.1702880859375, 0.2469482421875, 0.0921630859375, 0.16259765625, 0.2325439453125, 0.05535888671875, 0.20068359375, 0.0699462890625, 0.1378173828125, 0.225830078125, 0.052398681640625, 0.1502685546875, 0.153564453125, 0.1580810546875, 0.0611572265625, 0.1173095703125, 0.037353515625,...

embed

47911117_c0

47911117

prolog

0

Title: Generate a list based on constraint result, using Prolog's CLPFD Problem title: Generate a list based on constraint result, using Prolog's CLPFD Tags: clpfd, prolog, constraints Problem: Generate a list based on constraint result, using Prolog's CLPFD I'm attempting to implement a Skyscraper puzzle sol...

Generate a list based on constraint result, using Prolog's CLPFD Generate a list based on constraint result, using Prolog's CLPFD clpfd prolog constraints Prolog Generate CLPFD calculate_max_switches List Switches Generate a list based on constraint result, using Prolog's CLPFD I'm attempting to implement a S...

[ 0.0093994140625, -0.004608154296875, 0.0031890869140625, 0.00469970703125, -0.014892578125, -0.00653076171875, -0.0223388671875, -0.005126953125, 0.006805419921875, -0.03271484375, -0.004791259765625, -0.01409912109375, -0.0181884765625, -0.0020294189453125, 0.0135498046875, 0.00315856...

[ 155370, 5303, 35509, 98, 158, 2816, 4288, 16750, 17368, 1250, 4867, 3768, 46323, 41265, 397, 33139, 39557, 71, 502, 74481, 24084, 131519, 32036, 106101, 29479, 17689, 15182, 1264, 104192, 3115, 814, 37486, 14012, 20028, 38132, 101089, 37317, ...

[ 0.1883544921875, 0.21435546875, 0.1153564453125, 0.060577392578125, 0.09185791015625, 0.217041015625, 0.1282958984375, 0.150146484375, 0.012237548828125, 0.1201171875, 0.2130126953125, 0.020416259765625, 0.094482421875, 0.1417236328125, 0.1927490234375, 0.012603759765625, 0.081909179...

embed

70353119_c0

70353119

prolog

0

Title: Additional check in Prolog Problem title: Additional check in Prolog Tags: prolog Problem: Additional check in Prolog I was given a task to write a Prolog program that would put given domino pieces in a loop . I figured I would first put them in order and then check for answers where the last number and the firs...

Additional check in Prolog Additional check in Prolog prolog Additional Prolog domino_order2 end_match domino_order X-Y Y-X Out Piece Remaining swap_or_not Additional check in Prolog I was given a task to write a Prolog program that would put given domino pieces in a loop . I figured I would first put them in order and...

[ 0.005615234375, -0.0089111328125, 0.0050048828125, 0.000247955322265625, -0.0289306640625, 0.011474609375, -0.0208740234375, 0.01287841796875, 0.0234375, -0.002105712890625, 0.023193359375, 0.034423828125, -0.004974365234375, -0.016357421875, 0.006683349609375, 0.0045166015625, 0.014...

[ 29117, 14, 43315, 12765, 23, 1250, 4867, 502, 96889, 80596, 304, 3564, 98753, 1193, 1723, 990, 1542, 13538, 10374, 329, 853, 192, 14653, 202317, 748, 10869, 34475, 66211, 33022, 1528, 3884, 126371, 40956, 87, 26366, 5117, 12989, 35166, 4568...

[ 0.08648681640625, 0.1029052734375, 0.1251220703125, 0.26318359375, 0.04949951171875, 0.17041015625, 0.25439453125, 0.119873046875, 0.22509765625, 0.2255859375, 0.133544921875, 0.147705078125, 0.224609375, 0.0283355712890625, 0.121337890625, 0.05072021484375, 0.0928955078125, 0.1563...

embed

36757912_c0

36757912

prolog

0

Title: Prolog Type Error Problem title: Prolog Type Error Tags: types, prolog Problem: Prolog Type Error I'm working on a prolog algorithm that will perform a "swap" on a list. Example: Input: [1,2,3,4] -> Output: [3,4,1,2] Input: [1,2,3,4,5] -> Output: [4,5,3,1,2] The first half and second half of the list swap places...

Prolog Type Error Prolog Type Error types prolog Prolog Type Error Length Prolog Type Error I'm working on a prolog algorithm that will perform a "swap" on a list. Example: Input: [1,2,3,4] -> Output: [3,4,1,2] Input: [1,2,3,4,5] -> Output: [4,5,3,1,2] The first half and second half of the list swap places, if there is...

[ -0.005767822265625, 0.03515625, 0.01458740234375, 0.000644683837890625, -0.005615234375, 0.007537841796875, -0.01507568359375, 0.0146484375, 0.00506591796875, -0.005645751953125, -0.0014190673828125, 0.000904083251953125, -0.01025390625, -0.0037689208984375, 0.02783203125, 0.0167236328...

[ 1250, 4867, 60457, 212059, 52895, 502, 77554, 20697, 234873, 51339, 7, 634, 254, 98, 5303, 89536, 360, 133063, 82449, 13538, 155761, 80389, 5117, 23552, 136, 17932, 202317, 44677, 70270, 14012, 27585, 12830, 112033, 5425, 19069, 18499, 18151, ...

[ 0.1751708984375, 0.253173828125, 0.2435302734375, 0.203369140625, 0.1614990234375, 0.13427734375, 0.1563720703125, 0.06024169921875, 0.1988525390625, 0.037445068359375, 0.001861572265625, 0.1552734375, 0.1273193359375, 0.01092529296875, 0.172119140625, 0.023712158203125, 0.0484924316...

embed

43026951_c0

43026951

prolog

0

Title: I'm new to Prolog. Trying to run this code but gives - ERROR: Undefined procedure: teaches/2 (DWIM could not correct goal) Problem title: I'm new to Prolog. Trying to run this code but gives - ERROR: Undefined procedure: teaches/2 (DWIM could not correct goal) Tags: procedure, undefined, prolog Problem...

I'm new to Prolog. Trying to run this code but gives - ERROR: Undefined procedure: teaches/2 (DWIM could not correct goal) I'm new to Prolog. Trying to run this code but gives - ERROR: Undefined procedure: teaches/2 (DWIM could not correct goal) procedure undefined prolog Prolog Trying ERROR Undefined DWIM cs...

[ 0.02099609375, 0.010009765625, -0.003936767578125, 0.0234375, -0.025634765625, 0.0260009765625, -0.02001953125, -0.0152587890625, -0.00335693359375, -0.05078125, 0.00341796875, -0.007537841796875, -0.006439208984375, -0.005859375, 0.01031494140625, 0.0196533203125, 0.0252685546875, ...

[ 3768, 3525, 1250, 4867, 40858, 11675, 18151, 76199, 151206, 24638, 79912, 5983, 50491, 94957, 90, 12477, 38969, 594, 5809, 959, 26785, 69236, 9232, 502, 30439, 17199, 20763, 35046, 363, 1662, 15824, 91736, 41, 6138, 71, 3447, 1392, 153808, ...

[ 0.037841796875, 0.0814208984375, 0.1328125, 0.224609375, 0.0875244140625, 0.07342529296875, 0.1490478515625, 0.06787109375, 0.135498046875, 0.092041015625, 0.08367919921875, 0.1912841796875, 0.215576171875, 0.205810546875, 0.14013671875, 0.2410888671875, 0.142578125, 0.184204101562...

embed

9615002_c0

9615002

prolog

0

Title: Intersection and union of 2 lists Problem title: Intersection and union of 2 lists Tags: prolog, list Problem: Intersection and union of 2 lists i'm starting up learning prolog (i use SWI-prolog) and i did a simple exercise in which i have 2 lists and i want to calculate their intersection and union. Here is my ...

Intersection and union of 2 lists Intersection and union of 2 lists prolog list Intersection Res Intersection and union of 2 lists i'm starting up learning prolog (i use SWI-prolog) and i did a simple exercise in which i have 2 lists and i want to calculate their intersection and union. Here is my code that works prett...

[ -0.00177001953125, 0.012451171875, 0.0203857421875, -0.000621795654296875, -0.006500244140625, 0.007537841796875, -0.01422119140625, -0.005218505859375, -0.00080108642578125, -0.048828125, 0.0064697265625, 0.01025390625, -0.0079345703125, 0.007171630859375, 0.0235595703125, 0.024047851...

[ 5337, 7, 58994, 136, 69941, 111, 116, 5303, 502, 4867, 9624, 52080, 159, 38969, 3454, 8781, 81979, 765, 3444, 74481, 2363, 1940, 18151, 43240, 28875, 5299, 11522, 3917, 1884, 4527, 313, 17632, 39933, 1660, 106, 16750, 48716, 50339, 26785, ...

[ 0.1495361328125, 0.173583984375, 0.16357421875, 0.10595703125, 0.26220703125, 0.08953857421875, 0.1546630859375, 0.223876953125, 0.1326904296875, 0.1864013671875, 0.1407470703125, 0.0721435546875, 0.0311126708984375, 0.16943359375, 0.08587646484375, 0.027069091796875, 0.0787353515625...

embed

77934313_c0

77934313

prolog

0

Title: Can reification predicates from CLP(FD) be used to check equality of logic expressions? Problem title: Can reification predicates from CLP(FD) be used to check equality of logic expressions? Tags: clpfd, swi-prolog, prolog, boolean-expression Problem: Can reification predicates from CLP(FD) be used to check equa...

Can reification predicates from CLP(FD) be used to check equality of logic expressions? Can reification predicates from CLP(FD) be used to check equality of logic expressions? clpfd swi-prolog prolog boolean-expression CLP Can Can reification predicates from CLP(FD) be used to check equality of logic expressions? Accor...

[ -0.0111083984375, -0.006988525390625, 0.00567626953125, 0.0220947265625, 0.00946044921875, -0.003875732421875, -0.005157470703125, -0.007568359375, -0.0031890869140625, -0.004119873046875, 0.003997802734375, -0.00041961669921875, -0.003692626953125, 0.0234375, 0.022216796875, 0.0034790...

[ 4171, 456, 41274, 1653, 2063, 1636, 1295, 313, 37352, 132, 98553, 11814, 12765, 28, 161789, 62775, 125195, 7, 33139, 39557, 71, 2452, 3454, 4867, 502, 31, 34677, 204629, 47, 209806, 38331, 1530, 158, 2816, 4288, 468, 2740, 831, 47314, 165...

[ 0.062347412109375, 0.163330078125, 0.2371826171875, 0.1724853515625, 0.200439453125, 0.0955810546875, 0.04205322265625, 0.0673828125, 0.260009765625, 0.01995849609375, 0.2135009765625, 0.1431884765625, 0.18408203125, 0.08740234375, 0.214111328125, 0.1861572265625, 0.2239990234375, ...

embed

10686773_c0

10686773

prolog

0

Title: End View Puzzle, Prolog Problem title: End View Puzzle, Prolog Tags: prolog, logic, lambda, constraints, clpfd Problem: End View Puzzle, Prolog I'm trying to write a solver for End View Puzzles, using CLPFD (for those who are unfamiliar, here's a simple description http://www.funwithpuzzles.com/2009/12/abcd-end-...

End View Puzzle, Prolog End View Puzzle, Prolog prolog logic lambda constraints clpfd 0 End View Puzzle Prolog NxN Left Right List stop_repeats left_value RList End View Puzzle, Prolog I'm trying to write a solver for End View Puzzles, using CLPFD (for those who are unfamiliar, here's a simple description http://www.fu...

[ 0.00885009765625, 0.000537872314453125, 0.022705078125, -0.012939453125, -0.00897216796875, -0.0074462890625, 0.00106048583984375, 0.00396728515625, 0.00592041015625, -0.044189453125, -0.015625, 0.0034942626953125, 0.01422119140625, -0.015380859375, 0.0032958984375, -0.003021240234375,...

[ 18878, 29805, 179277, 1250, 4867, 502, 62775, 6492, 85, 158, 2816, 4288, 33139, 39557, 71, 757, 425, 839, 2480, 90911, 32036, 7279, 107, 1081, 25737, 27494, 627, 154663, 31577, 33022, 3115, 814, 46323, 41265, 397, 8781, 76811, 16498, 76228,...

[ 0.157958984375, 0.2998046875, 0.1951904296875, 0.130615234375, 0.1964111328125, 0.08184814453125, 0.1229248046875, 0.14208984375, 0.104736328125, 0.062744140625, 0.1695556640625, 0.05767822265625, 0.0478515625, 0.0980224609375, 0.1275634765625, 0.1048583984375, 0.0157318115234375, ...

embed

13664870_c1

13664870

prolog

1

2do the I must be large enough to provoke a resource error for the local stack: ?- 22=I,N is 2^I,length(L,N), maplist(=(a),L), ( Length=ok ; occurrences(a,L,M) ). I = 22, N = 4194304, L = [a, a, a, a, a, a, a, a, a|...], Length = ok ; ERROR: Out of local stack To overcome this problem and still retain the nice declarat...

[ -0.019775390625, 0.0172119140625, 0.01336669921875, 0.0223388671875, 0.003387451171875, -0.000507354736328125, -0.0145263671875, 0.0032196044921875, 0.01507568359375, -0.0301513671875, 0.0294189453125, 0.00946044921875, -0.0003910064697265625, 0.01324462890625, 0.03271484375, 0.0015563...

[ 116, 246, 87, 8110, 21334, 20174, 80675, 177953, 18499, 4000, 177261, 705, 9, 1039, 1369, 568, 839, 83, 8353, 23986, 866, 22288, 6562, 11, 77554, 685, 74918, 42, 69098, 594, 2203, 24470, 541, 201, 210298, 7709, 339, 10, 3664, 151206, 24...

[ 0.1573486328125, 0.183837890625, 0.1922607421875, 0.09136962890625, 0.1488037109375, 0.074951171875, 0.1632080078125, 0.2186279296875, 0.20263671875, 0.1807861328125, 0.2349853515625, 0.09716796875, 0.057342529296875, 0.223876953125, 0.060882568359375, 0.17626953125, 0.1124267578125,...

embed

61325677_c0

61325677

prolog

0

Title: checking if two lists have common elements Problem title: checking if two lists have common elements Tags: prolog, list Problem: checking if two lists have common elements So basically, I have a predicate called common_elements(List1,List2), and the purpose of this predicate is to check if List1 has at least an ...

checking if two lists have common elements checking if two lists have common elements prolog list common_elements NAC checking if two lists have common elements So basically, I have a predicate called common_elements(List1,List2), and the purpose of this predicate is to check if List1 has at least an element that belon...

[ 0.004150390625, 0.006683349609375, -0.0013427734375, 0.0076904296875, -0.0013580322265625, 0.022705078125, -0.0186767578125, 0.0012969970703125, 0.007598876953125, -0.039794921875, 0.02685546875, 0.01104736328125, 0.01043701171875, -0.014404296875, 0.00933837890625, 0.004974365234375, ...

[ 175199, 2174, 6626, 5303, 765, 39210, 80854, 502, 4867, 62766, 184777, 198343, 1653, 2063, 67, 7, 154663, 418, 10461, 60042, 47, 12765, 32036, 1556, 19713, 12830, 10617, 5442, 89536, 101935, 903, 43240, 5299, 10644, 77336, 442, 51, 27430, 6...

[ 0.1793212890625, 0.09063720703125, 0.113037109375, 0.185302734375, 0.0482177734375, 0.187744140625, 0.188232421875, 0.10791015625, 0.160400390625, 0.20849609375, 0.156982421875, 0.04632568359375, 0.113037109375, 0.154541015625, 0.073486328125, 0.05059814453125, 0.140625, 0.03475952...

embed

8553244_c0

8553244

prolog

0

Title: Check input numbers in prolog Problem title: Check input numbers in prolog Tags: prolog, numbers Problem: Check input numbers in prolog I would like to define a initial state in a problem. My code is isDigit(X) :- ( number(X), X >= 0, X =< 8 ); ( writeln('[0-8] AND Number'),!,fail). define_initial_state(INITIAL_...

Check input numbers in prolog Check input numbers in prolog prolog numbers Check Number define_initial_state INITIAL_STATE Pos A11 A12 A13 A21 A22 A23 A31 A32 A33 row1 row2 row3 Check input numbers in prolog I would like to define a initial state in a problem. My code is The problem I have is that is printed many times...

[ -0.021240234375, 0.007232666015625, -0.00011920928955078125, 0.014892578125, -0.0181884765625, 0.0089111328125, 0.0018768310546875, 0.00543212890625, 0.002471923828125, -0.00811767578125, 0.004180908203125, 0.00982666015625, -0.01361083984375, 0.019775390625, -0.0042724609375, 0.009094...

[ 38679, 107730, 101935, 23, 502, 4867, 103332, 61924, 943, 118, 289, 61340, 5881, 35522, 7842, 176523, 13498, 1662, 1530, 2681, 3117, 4015, 3742, 5016, 6460, 9185, 15555, 363, 1884, 61475, 11341, 2967, 18151, 28412, 5941, 20028, 26008, 27781, ...

[ 0.19921875, 0.260986328125, 0.2117919921875, 0.05419921875, 0.1771240234375, 0.2310791015625, 0.1490478515625, 0.1607666015625, 0.04791259765625, 0.08734130859375, 0.069091796875, 0.180419921875, 0.047698974609375, 0.10321044921875, 0.056396484375, 0.1456298828125, 0.1094970703125, ...

embed

45391973_c1

45391973

prolog

1

9) location(_7998, _8000) ? creep Exit: (9) location(flashlight, desk) ? creep Call: (9) door(kitchen, desk) ? creep Fail: (9) door(kitchen, desk) ? creep Redo: (9) location(_7998, _8000) ? creep Exit: (9) location('washing machine', cellar) ? creep Call: (9) door(kitchen, cellar) ? creep Exit: (9) door(kitchen, cellar...

[ -0.0059814453125, 0.004547119140625, 0.0159912109375, 0.029052734375, 0.0216064453125, 0.0283203125, -0.0076904296875, 0.0101318359375, -0.006866455078125, 0.012451171875, -0.0045166015625, 0.011474609375, -0.02880859375, -0.0025787353515625, 0.00677490234375, -0.01055908203125, 0.01...

[ 77816, 31913, 454, 966, 158931, 101, 87774, 705, 49512, 254, 5443, 217, 11438, 5544, 20016, 8, 1042, 26265, 1911, 9488, 4834, 190355, 132, 6096, 31, 634, 54700, 36279, 2927, 1193, 2203, 990, 320, 69112, 116, 76, 93, 6369, 13400, 150, 98...

[ 0.24853515625, 0.201171875, 0.0303497314453125, 0.0797119140625, 0.251708984375, 0.0408935546875, 0.2476806640625, 0.0079345703125, 0.2122802734375, 0.16650390625, 0.1600341796875, 0.10888671875, 0.2088623046875, 0.09466552734375, 0.1763916015625, 0.151611328125, 0.0789794921875, 0...

embed

55984385_c0

55984385

prolog

0

Title: How to make this function return the coordinates instead of an empty list Problem title: How to make this function return the coordinates instead of an empty list Tags: prolog Problem: How to make this function return the coordinates instead of an empty list I want the function to return the pairs (1, X) in a li...

How to make this function return the coordinates instead of an empty list How to make this function return the coordinates instead of an empty list prolog How propaga_posicoes_aux Pos Fila N_Fila N_Pos compara_listas N_Pos_aux N_P Call _722 Redo Exit How to make this function return the coordinates instead of an empty ...

[ -0.00138092041015625, -0.01556396484375, 0.02197265625, 0.003936767578125, -0.00927734375, 0.0125732421875, -0.0238037109375, 0.00799560546875, 0.015625, 0.01123046875, 0.016357421875, -0.005096435546875, 0.0007171630859375, -0.0179443359375, 0.006011962890625, 0.013427734375, 0.0057...

[ 11249, 3249, 903, 32354, 30646, 176866, 90, 64457, 201505, 5303, 70, 502, 4867, 175648, 67890, 587, 10442, 13498, 24158, 11, 541, 6159, 143, 7192, 7, 31898, 16651, 683, 26265, 191539, 6096, 31, 5443, 217, 3444, 80836, 2858, 1193, 23, 1906...

[ 0.03143310546875, 0.10284423828125, 0.06353759765625, 0.2049560546875, 0.21728515625, 0.25146484375, 0.1265869140625, 0.164794921875, 0.1781005859375, 0.20849609375, 0.00079345703125, 0.140625, 0.1920166015625, 0.240966796875, 0.1571044921875, 0.05474853515625, 0.1505126953125, 0.1...

embed

41000244_c1

41000244

prolog

1

:- use_module(library(uri)). :- http_handler(root(block_plan), get_block_planner_solution, []). server(Port) :- http_server(http_dispatch, [port(Port)]). get_block_planner_solution(_Request) :- format('content-type: text/plain~n~n'), http_parameters(_Request, [ init(Init,[optional(false)]), goal(Goal,[optional(false)]...

[ -0.0062255859375, 0.0205078125, -0.00164031982421875, -0.006195068359375, -0.02783203125, 0.009765625, 0.019287109375, -0.0283203125, 0.0023040771484375, -0.0341796875, 0.01025390625, -0.007476806640625, -0.0048828125, 0.006195068359375, -0.0216064453125, 0.0166015625, 0.001800537109...

[ 15772, 4527, 83279, 13, 150, 2844, 1294, 1162, 1621, 74258, 148920, 81409, 5868, 2046, 1679, 166589, 10723, 60006, 39642, 5475, 4453, 6982, 4332, 75616, 9384, 69246, 50986, 7986, 7290, 19, 6276, 29089, 23, 4153, 109585, 8710, 69236, 17903, ...

[ 0.0870361328125, 0.1104736328125, 0.1727294921875, 0.0418701171875, 0.06463623046875, 0.1387939453125, 0.06304931640625, 0.1619873046875, 0.1436767578125, 0.1922607421875, 0.1444091796875, 0.1378173828125, 0.18896484375, 0.0584716796875, 0.0909423828125, 0.1585693359375, 0.1842041015...

embed

15935053_c0

15935053

prolog

0

Title: not stop after true answer in prolog Problem title: not stop after true answer in prolog Tags: transitive-closure, prolog Problem: not stop after true answer in prolog i write this programm for give me this result : "X=john" "Y=jane" likes(john,mary). likes(mary,jane). likes(l,k). likes(X,Y) :- likes(X,Z), likes...

not stop after true answer in prolog not stop after true answer in prolog transitive-closure prolog ERROR Out Call _G2162 Exit Redo _G2267 not stop after true answer in prolog i write this programm for give me this result : "X=john" "Y=jane" but if run this programm such that this result: i think the programm get in lo...

[ 0.0042724609375, 0.0017547607421875, 0.015869140625, 0.053955078125, 0.00007581710815429688, 0.00872802734375, -0.015869140625, 0.016357421875, -0.01141357421875, -0.0269775390625, 0.0076904296875, 0.01287841796875, -0.00537109375, 0.01373291015625, 0.04833984375, 0.0238037109375, 0....

[ 959, 7279, 7103, 29568, 35166, 23, 502, 4867, 62621, 5844, 170224, 151206, 13538, 26265, 724, 3117, 10837, 5443, 217, 6096, 31, 4015, 18197, 33022, 28966, 16750, 1542, 66159, 19, 1723, 145, 86, 11675, 5351, 2046, 40956, 3444, 47, 18499, 3...

[ 0.1064453125, 0.216552734375, 0.169189453125, 0.214599609375, 0.215576171875, 0.068115234375, 0.1463623046875, 0.2200927734375, 0.1483154296875, 0.10699462890625, 0.1898193359375, 0.0909423828125, 0.06549072265625, 0.1121826171875, 0.0069580078125, 0.05096435546875, 0.175537109375, ...

embed

33879097_c0

33879097

prolog

0

Title: Magic Hexagon can't constrain itself Problem title: Magic Hexagon can't constrain itself Tags: prolog, clpfd, constraints, list, logic Problem: Magic Hexagon can't constrain itself I am trying to solve the Magic Hexagon problem in Prolog, in dimension 5, for now(?). I first create the layout, by using ...

Magic Hexagon can't constrain itself Magic Hexagon can't constrain itself prolog clpfd constraints list logic Magic Hexagon use_module Dim Offset Flag constraint_sum Sum sum_list Len all_different NewLen Magic Hexagon can't constrain itself I am trying to solve the Magic Hexagon problem in Prolog, in dimensio...

[ -0.0118408203125, 0.016845703125, 0.0135498046875, 0.0001850128173828125, -0.0027618408203125, -0.01409912109375, -0.0208740234375, 0.016357421875, 0.01611328125, -0.0108642578125, -0.0033416748046875, 0.0004405975341796875, 0.0250244140625, 0.00897216796875, 0.0128173828125, 0.0126953...

[ 61707, 1529, 3798, 6126, 831, 3768, 18, 158, 2816, 73, 68034, 502, 4867, 39557, 71, 4288, 5303, 62775, 4527, 83279, 45247, 9791, 3509, 125726, 11832, 36335, 10554, 6562, 18226, 756, 238778, 2356, 866, 33, 31577, 86869, 2967, 1250, 91403, ...

[ 0.2178955078125, 0.1412353515625, 0.1878662109375, 0.2249755859375, 0.059326171875, 0.05718994140625, 0.057220458984375, 0.113525390625, 0.2025146484375, 0.10150146484375, 0.1326904296875, 0.087158203125, 0.19580078125, 0.0237884521484375, 0.0443115234375, 0.1181640625, 0.14184570312...

embed

44142130_c0

44142130

prolog

0

Title: Set size and position of gui elements Problem title: Set size and position of gui elements Tags: prolog, swi-prolog, xpce Problem: Set size and position of gui elements I've written some code to create a GUI in swi-prolog, but my main window is too small for all my buttons and text fields. How I can draw, for ex...

Set size and position of gui elements Set size and position of gui elements prolog swi-prolog xpce Set Test Main Europe Etiq text_item Enter Result Path Path1 From1 To1 Path1Res Set size and position of gui elements I've written some code to create a GUI in swi-prolog, but my main window is too small for all my buttons...

[ 0.02734375, -0.00537109375, 0.007293701171875, 0.01361083984375, 0.004241943359375, -0.004669189453125, 0.0166015625, 0.01239013671875, 0.0150146484375, 0.0007781982421875, 0.03662109375, -0.0198974609375, -0.00640869140625, -0.0033111572265625, 0.0031585693359375, -0.01904296875, 0....

[ 19943, 13267, 136, 19069, 111, 17086, 80854, 502, 4867, 2452, 3454, 329, 8647, 12321, 14713, 61941, 7986, 217, 60816, 126684, 108421, 28090, 717, 4332, 59121, 18151, 28282, 195490, 91, 5201, 76896, 5792, 19336, 77679, 44457, 11249, 831, 79442...

[ 0.1580810546875, 0.1917724609375, 0.048126220703125, 0.1871337890625, 0.020355224609375, 0.24365234375, 0.2052001953125, 0.1044921875, 0.22705078125, 0.20947265625, 0.120849609375, 0.051666259765625, 0.1351318359375, 0.0198211669921875, 0.1019287109375, 0.1571044921875, 0.10241699218...

embed

62825933_c0

62825933

prolog

0

Title: How to output theory by using Aleph with SWI-Prolog? Problem title: How to output theory by using Aleph with SWI-Prolog? Tags: swi-prolog, prolog, logic, aleph-ilp Problem: How to output theory by using Aleph with SWI-Prolog? I would like to use Aleph to get a theory with SWI-Prolog. My OS is MacOS 10.15. Here i...

How to output theory by using Aleph with SWI-Prolog? How to output theory by using Aleph with SWI-Prolog? swi-prolog prolog logic aleph-ilp Aleph How SWI-Prolog Mode RecallNumber PredicateMode begin_bg end_bg begin_in_pos end_in_pos begin_in_neg end_in_neg aleph_read_all use_module Users scfang6 Desktop test1.pl How to...

[ 0.01446533203125, 0.0098876953125, 0.01318359375, 0.037353515625, -0.022216796875, 0.0223388671875, 0.0252685546875, 0.017333984375, 0.000823974609375, -0.04296875, 0.01470947265625, 0.006500244140625, -0.00151824951171875, -0.00116729736328125, 0.02294921875, -0.00775146484375, 0.01...

[ 11249, 47, 140992, 154453, 17368, 4733, 11727, 678, 159, 38969, 10752, 4867, 91, 2452, 3454, 502, 62775, 662, 254, 36024, 853, 85763, 18444, 26278, 7145, 2063, 9083, 9842, 11821, 3564, 7522, 39116, 4527, 83279, 28944, 910, 141423, 3034, 188...

[ 0.067138671875, 0.0087890625, 0.2470703125, 0.27099609375, 0.083740234375, 0.1578369140625, 0.23388671875, 0.0360107421875, 0.06805419921875, 0.2257080078125, 0.1356201171875, 0.2098388671875, 0.011444091796875, 0.174072265625, 0.1053466796875, 0.10693359375, 0.1312255859375, 0.102...

embed

16520763_c1

16520763

prolog

1

_deepening/2 predicate I generate all the solution from the start node to the end node ordered by length (from the shortest one to the longest one). Ok, so I have to modify this program in such a way that imposes a limit on the length of the solution I must have a depth_first_iterative_deepening2/3 predicate like this:...

[ -0.00008344650268554688, 0.00311279296875, 0.0108642578125, 0.0174560546875, 0.01104736328125, 0.033935546875, -0.005157470703125, -0.0025787353515625, 0.027587890625, -0.03515625, 0.01318359375, -0.0196533203125, 0.00714111328125, 0.00628662109375, 0.0240478515625, -0.0106201171875, ...

[ 101, 123041, 33, 214, 12477, 1653, 2063, 67, 139392, 756, 29806, 1295, 4034, 110, 112, 47, 3564, 12989, 140909, 16610, 525, 4989, 2811, 40383, 1528, 178451, 17475, 168867, 13448, 271, 16840, 45023, 304, 18113, 5021, 9920, 187895, 38132, 140...

[ 0.000823974609375, 0.1651611328125, 0.1395263671875, 0.06658935546875, 0.2198486328125, 0.1400146484375, 0.18359375, 0.060150146484375, 0.1710205078125, 0.034271240234375, 0.2197265625, 0.06268310546875, 0.1151123046875, 0.11181640625, 0.1097412109375, 0.0819091796875, 0.11279296875,...

embed

2951407_c0

2951407

prolog

0

Title: What is more interesting or powerful: Curry, Mercury or Lambda-Prolog? Problem title: What is more interesting or powerful: Curry, Mercury or Lambda-Prolog? Tags: prolog, mercury, logic-programming, lambda-prolog, curry Problem: What is more interesting or powerful: Curry, Mercury or Lambda-Prolog? I would like ...

What is more interesting or powerful: Curry, Mercury or Lambda-Prolog? What is more interesting or powerful: Curry, Mercury or Lambda-Prolog? prolog mercury logic-programming lambda-prolog curry What Curry Mercury Lambda-Prolog What is more interesting or powerful: Curry, Mercury or Lambda-Prolog? I would like to ask y...

[ 0.0284423828125, 0.01116943359375, 0.0140380859375, 0.014404296875, -0.0001506805419921875, 0.005828857421875, -0.0113525390625, -0.00372314453125, 0.005767822265625, 0.0084228515625, 0.010986328125, -0.0024566650390625, -0.01025390625, -0.021240234375, 0.01171875, -0.00053787231445312...

[ 4865, 1286, 49041, 707, 113138, 17065, 1294, 123106, 53, 122930, 85, 9, 10752, 4867, 83, 502, 1143, 16820, 62775, 28966, 214, 21, 6492, 3454, 198555, 23113, 5426, 5809, 29479, 1295, 206597, 107, 37676, 185118, 144573, 9803, 60427, 77635, 50...

[ 0.052978515625, 0.1356201171875, 0.2379150390625, 0.08428955078125, 0.235595703125, 0.1846923828125, 0.2452392578125, 0.2298583984375, 0.210693359375, 0.2025146484375, 0.1893310546875, 0.0243682861328125, 0.1649169921875, 0.255859375, 0.0258331298828125, 0.1513671875, 0.1051635742187...

embed

41637402_c1

41637402

prolog

1

I tried integer("0"). false. integer('0'). false. integer(`0`). false. integer("1"). false. integer('1'). false. integer(`1`). false. ISO INTERNATIONAL STANDARD ISO/IEC 13211-1 First edition 1995-06-01 Information technology - Programming languages - Prolog Part 1: General Core INTERNATIONAL STANDARD ISO/IEC 13211-1:1...

[ 0.000514984130859375, -0.01336669921875, 0.00616455078125, 0.0196533203125, -0.001495361328125, 0.00970458984375, 0.003631591796875, -0.0101318359375, 0.002410888671875, 0.016845703125, -0.003082275390625, -0.00543212890625, -0.04052734375, 0.013427734375, 0.01202392578125, 0.009033203...

[ 87, 37842, 892, 1505, 2389, 51029, 98320, 25, 194, 132, 5, 418, 17408, 239939, 16992, 34860, 40756, 64, 126109, 702, 3117, 115727, 23972, 79737, 11857, 6746, 32007, 55556, 27958, 46876, 7, 1250, 4867, 16995, 13806, 9082, 31365, 69606, 79445...

[ 0.059478759765625, 0.1759033203125, 0.170654296875, 0.12646484375, 0.195068359375, 0.0120849609375, 0.238037109375, 0.000274658203125, 0.000823974609375, 0.000335693359375, 0.000457763671875, 0.1339111328125, 0.1708984375, 0.03558349609375, 0.05615234375, 0.1158447265625, 0.053497314...

embed

49376894_c0

49376894

prolog

0

Title: Basic Prolog Nth Number of Tribonacci Series Problem title: Basic Prolog Nth Number of Tribonacci Series Tags: prolog, fibonacci Problem: Basic Prolog Nth Number of Tribonacci Series In my Principles of Programming class we have started learning Prolog, and we were tasked with creating a query trib(N, T) which i...

Basic Prolog Nth Number of Tribonacci Series Basic Prolog Nth Number of Tribonacci Series prolog fibonacci Basic Prolog Nth Number Tribonacci Series Count Goal Basic Prolog Nth Number of Tribonacci Series In my Principles of Programming class we have started learning Prolog, and we were tasked with creating a query tri...

[ 0.0101318359375, 0.0238037109375, 0.00054931640625, -0.004974365234375, -0.003997802734375, 0.0018310546875, -0.00714111328125, -0.0103759765625, 0.0218505859375, -0.0257568359375, 0.0089111328125, -0.0159912109375, -0.01470947265625, 0.029052734375, 0.0137939453125, 0.0069580078125, ...

[ 91692, 1250, 4867, 541, 927, 103332, 4699, 20990, 52544, 64876, 502, 809, 108210, 2016, 289, 759, 79680, 27958, 18507, 52080, 136, 66211, 105233, 41, 109120, 839, 384, 29568, 2174, 83, 14012, 36549, 757, 106, 116, 201, 59121, 2806, 765, 1...

[ 0.1341552734375, 0.1715087890625, 0.2174072265625, 0.224365234375, 0.1865234375, 0.17041015625, 0.2041015625, 0.16015625, 0.200439453125, 0.1490478515625, 0.113037109375, 0.04034423828125, 0.1793212890625, 0.139892578125, 0.1033935546875, 0.00299072265625, 0.0150146484375, 0.093322...

embed

54809516_c0

54809516

prolog

0

Title: Accessing coefficients in a numerical expression (clpr) Problem title: Accessing coefficients in a numerical expression (clpr) Tags: clpr, prolog Problem: Accessing coefficients in a numerical expression (clpr) I have some clauses where the head represents the names and values of a set of variables in a linear e...

Accessing coefficients in a numerical expression (clpr) Accessing coefficients in a numerical expression (clpr) clpr prolog Accessing use_module VARNAME COEFFICIENT Accessing coefficients in a numerical expression (clpr) I have some clauses where the head represents the names and values of a set of variables in a linea...

[ -0.0020599365234375, 0.01031494140625, 0.019287109375, 0.00994873046875, 0.0120849609375, 0.0250244140625, 0.012451171875, 0.0167236328125, 0.0185546875, -0.025390625, -0.0036163330078125, 0.018798828125, -0.001129150390625, -0.029296875, 0.0089111328125, 0.0147705078125, -0.01879882...

[ 40266, 214, 552, 4240, 11044, 35066, 54744, 125195, 10287, 34937, 33139, 502, 4867, 4527, 83279, 61745, 182512, 8244, 28482, 193327, 70731, 90, 10336, 33636, 123055, 142424, 5423, 77336, 192617, 5490, 14361, 8561, 80560, 2472, 3917, 80581, 2046...

[ 0.204345703125, 0.003753662109375, 0.1661376953125, 0.1279296875, 0.1336669921875, 0.1666259765625, 0.10498046875, 0.1905517578125, 0.1875, 0.0177154541015625, 0.0283203125, 0.114013671875, 0.202392578125, 0.0787353515625, 0.1029052734375, 0.131103515625, 0.1873779296875, 0.1082763...

embed