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
60680114_c1	60680114	prolog	1	1, 0), parent(FirstCousin, B), A \= B. cousins(A, B, 1, 1) :- var(P1), parent(P1, A), cousin(P1, B, 1, 0), A \= B, A \= P1, B \= P1. (2) I have also tried an if -statement to call the other function if the first one fails, but it crashes if the first case fails again. cousins(A, B, 1, 1) :- cousinsCase1(A, B, 1, 1) ->...	1, 0), parent(FirstCousin, B), A \= B. cousins(A, B, 1, 1) :- var(P1), parent(P1, A), cousin(P1, B, 1, 0), A \= B, A \= P1, B \= P1. (2) I have also tried an if -statement to call the other function if the first one fails, but it crashes if the first case fails again. cousins(A, B, 1, 1) :- cousinsCase1(A, B, 1, 1) ->...	[ 0.017822265625, 0.005096435546875, -0.00136566162109375, 0.029296875, 0.00003933906555175781, -0.0036163330078125, 0.003143310546875, 0.00640869140625, 0.0289306640625, -0.0098876953125, -0.00439453125, -0.01336669921875, -0.0019378662109375, 0.000614166259765625, 0.0167236328125, -0.0...	[ 106, 757, 49129, 207263, 10625, 223, 73, 335, 62, 1369, 193429, 7, 284, 4879, 15772, 285, 683, 17727, 418, 436, 37842, 2174, 61340, 11782, 3789, 32354, 5117, 1632, 35782, 150631, 7225, 13438, 441, 6991, 29568, 304, 12921, 79986, 172864, 6...	[ 0.1070556640625, 0.126708984375, 0.1884765625, 0.07232666015625, 0.0716552734375, 0.14501953125, 0.1146240234375, 0.133544921875, 0.08087158203125, 0.057891845703125, 0.2445068359375, 0.0916748046875, 0.076904296875, 0.1285400390625, 0.0189971923828125, 0.1453857421875, 0.02549743652...	embed
58357900_c1	58357900	prolog	1	made a reasonable attempt at the solution. Here's what I have been trying so far: % Exercise 1 Solution add2(X,Y,Z):- add(X,Y,Z). add2(A+B,Y,Z):- add2(A,B,X), add2(X,Y,Z). add2(X,A+B,Z):- add2(A,B,Y), add2(X,Y,Z). Now, this above code works quite nicely for the first 3 inputs provided. I am having difficulty trying to...	made a reasonable attempt at the solution. Here's what I have been trying so far: % Exercise 1 Solution add2(X,Y,Z):- add(X,Y,Z). add2(A+B,Y,Z):- add2(A,B,X), add2(X,Y,Z). add2(X,A+B,Z):- add2(A,B,Y), add2(X,Y,Z). Now, this above code works quite nicely for the first 3 inputs provided. I am having difficulty trying to...	[ -0.007171630859375, 0.0169677734375, -0.00836181640625, 0.0191650390625, -0.000850677490234375, 0.03466796875, -0.00860595703125, -0.01214599609375, 0.0218505859375, -0.00927734375, 0.0262451171875, -0.012939453125, -0.0101318359375, 0.0218505859375, 0.00762939453125, 0.013671875, 0....	[ 7228, 169022, 81887, 99, 29806, 31577, 2060, 1745, 155534, 184, 106, 187895, 15190, 304, 1542, 1723, 1511, 1328, 571, 284, 903, 36917, 18151, 43240, 32233, 26267, 5117, 138, 107730, 62952, 34844, 5351, 502, 4867, 13648, 29481, 4568, 5646, 9...	[ 0.02947998046875, 0.1241455078125, 0.1483154296875, 0.0198211669921875, 0.169677734375, 0.104248046875, 0.05419921875, 0.0577392578125, 0.1800537109375, 0.02166748046875, 0.05865478515625, 0.183837890625, 0.1806640625, 0.20166015625, 0.11376953125, 0.1038818359375, 0.1463623046875, ...	embed
66422579_c0	66422579	prolog	0	Title: Why does this rule with `not` always return false? Problem title: Why does this rule with `not` always return false? Tags: negation, prolog Problem: Why does this rule with `not` always return false? I have this prolog file: daughter(anna, vera). daughter(vera, oleg). daughter(olga, pavel). daughter(olga, alla)....	Why does this rule with `not` always return false? Why does this rule with `not` always return false? negation prolog Why mothers_names Why does this rule with `not` always return false? I have this prolog file: ?- woman(X). always returns false. ?- man(X). returns all three male entries though. I also tried woman(X) :...	[ 0.0011444091796875, 0.0174560546875, 0.022705078125, 0.01446533203125, -0.01904296875, 0.036376953125, 0.01019287109375, 0.003387451171875, 0.00811767578125, -0.039306640625, -0.0172119140625, -0.020751953125, -0.00119781494140625, 0.00701904296875, 0.01806640625, 0.007171630859375, ...	[ 44084, 903, 79986, 678, 10869, 11343, 30646, 98320, 14602, 108, 125682, 502, 4867, 42732, 7, 11627, 11435, 46667, 132, 1542, 9, 332, 17262, 11280, 112820, 37842, 15772, 1328, 669, 6002, 86531, 12765, 24233, 3445, 43240, 6201, 29568, 44691, ...	[ 0.0916748046875, 0.07635498046875, 0.1751708984375, 0.046905517578125, 0.279541015625, 0.1875, 0.1923828125, 0.22998046875, 0.047119140625, 0.1478271484375, 0.1455078125, 0.1458740234375, 0.1849365234375, 0.1666259765625, 0.033447265625, 0.1881103515625, 0.1002197265625, 0.18884277...	embed
16265548_c0	16265548	prolog	0	Title: Prolog - DCG - random sentence Problem title: Prolog - DCG - random sentence Tags: random, dcg, prolog Problem: Prolog - DCG - random sentence I'm new to Prolog, and I'm trying to write a small program that will give a random sentence from a DCG. My previous way of thinking was to use findall/3 to make a list of...	Prolog - DCG - random sentence Prolog - DCG - random sentence random dcg prolog Prolog DCG List Set random_member Pick List2 Prolog - DCG - random sentence I'm new to Prolog, and I'm trying to write a small program that will give a random sentence from a DCG. My previous way of thinking was to use findall/3 to make a l...	[ 0.035400390625, -0.00897216796875, 0.0106201171875, 0.015380859375, -0.002685546875, 0.01129150390625, -0.002899169921875, -0.01171875, 0.0118408203125, -0.050048828125, 0.007171630859375, 0.01361083984375, -0.00640869140625, 0.006378173828125, 0.0177001953125, 0.015625, -0.001426696...	[ 1250, 4867, 391, 56367, 96759, 149357, 104, 177, 502, 32036, 19943, 39, 27417, 122554, 304, 3525, 31577, 33022, 19336, 1528, 8337, 3917, 47644, 4527, 7413, 5584, 18113, 3249, 5303, 756, 7722, 12477, 79786, 10176, 122092, 147, 167785, 177261, ...	[ 0.146484375, 0.2208251953125, 0.0888671875, 0.1812744140625, 0.2039794921875, 0.1788330078125, 0.006622314453125, 0.047149658203125, 0.0946044921875, 0.15625, 0.114013671875, 0.0162506103515625, 0.1768798828125, 0.1297607421875, 0.0628662109375, 0.034912109375, 0.024993896484375, 0...	embed
30438955_c0	30438955	prolog	0	Title: Prolog C# Interface retract from file Problem title: Prolog C# Interface retract from file Tags: prolog, c%23 Problem: Prolog C# Interface retract from file I just established a connection to SWI Prolog and want to manipulate facts. e.g. retract and assert them. I have some function like this: String[] param = {...	Prolog C# Interface retract from file Prolog C# Interface retract from file prolog c%23 file Prolog Interface PlEngine.Initialize PlQuery.PlCall tablets.pl n1ewatomic n2ewatomic Prolog C# Interface retract from file I just established a connection to SWI Prolog and want to manipulate facts. e.g. retract and assert them...	[ 0.036376953125, 0.000021219253540039062, 0.011474609375, 0.0218505859375, -0.0098876953125, -0.01361083984375, 0.01312255859375, 0.01483154296875, 0.001861572265625, -0.0242919921875, 0.021728515625, 0.011474609375, -0.039794921875, -0.01129150390625, 0.0252685546875, -0.00019836425781...	[ 1250, 4867, 4904, 220237, 41499, 15390, 1295, 11435, 502, 3742, 29016, 91384, 1212, 40705, 41732, 1294, 141, 441, 5584, 115301, 2424, 188, 21068, 634, 170920, 94878, 159, 38969, 3444, 45258, 15824, 136, 237, 33657, 32354, 20697, 10, 16865, ...	[ 0.1448974609375, 0.207275390625, 0.17431640625, 0.1817626953125, 0.2259521484375, 0.1640625, 0.16357421875, 0.1954345703125, 0.1015625, 0.120361328125, 0.08758544921875, 0.090576171875, 0.07305908203125, 0.041656494140625, 0.0970458984375, 0.0828857421875, 0.0677490234375, 0.064514...	embed
35429404_c0	35429404	prolog	0	Title: Prolog: Passing Implicit Parameter / Predicated Evaluation Problem title: Prolog: Passing Implicit Parameter / Predicated Evaluation Tags: parameter-passing, swi-prolog, prolog Problem: Prolog: Passing Implicit Parameter / Predicated Evaluation I am looking for a reliable way to pass an implicit parameter among ...	Prolog: Passing Implicit Parameter / Predicated Evaluation Prolog: Passing Implicit Parameter / Predicated Evaluation parameter-passing swi-prolog prolog Prolog Passing Implicit Parameter Predicated Evaluation Context Args term_expansion Head Body CompoundTerm set_term_attribute on_evaluate get_term_attribute Prolog: P...	[ 0.0135498046875, 0.0225830078125, 0.007293701171875, 0.01708984375, -0.0115966796875, -0.01165771484375, 0.0113525390625, -0.004730224609375, -0.00927734375, -0.06884765625, 0.01141357421875, 0.0140380859375, -0.0244140625, 0.00677490234375, -0.0081787109375, 0.0032196044921875, -0.0...	[ 1250, 4867, 28872, 29128, 60923, 1720, 29089, 248, 7145, 2063, 3674, 151228, 171859, 13409, 2452, 3454, 502, 1657, 22829, 1172, 9405, 13579, 83613, 66, 44816, 43960, 15612, 31, 35484, 5423, 32166, 191145, 98, 159258, 2046, 214, 16487, 215543,...	[ 0.1761474609375, 0.241943359375, 0.1307373046875, 0.12744140625, 0.2086181640625, 0.1246337890625, 0.163330078125, 0.00152587890625, 0.1207275390625, 0.2132568359375, 0.03753662109375, 0.2105712890625, 0.25439453125, 0.0777587890625, 0.13818359375, 0.1268310546875, 0.128662109375, ...	embed
39495782_c0	39495782	prolog	0	Title: Prolog recursive function not behaving as expected Problem title: Prolog recursive function not behaving as expected Tags: recursion, prolog, trace, fibonacci Problem: Prolog recursive function not behaving as expected I'm trying to implement the recursive version of the Fibonacci sequence in Prolog. Below is th...	Prolog recursive function not behaving as expected Prolog recursive function not behaving as expected recursion prolog trace fibonacci Prolog Call Exit _G2569 _G2572 _G2573 _G2575 _G2578 _G2579 Prolog recursive function not behaving as expected I'm trying to implement the recursive version of the Fibonacci sequence in ...	[ 0.0189208984375, -0.0033111572265625, 0.01226806640625, -0.007476806640625, -0.0050048828125, 0.0054931640625, -0.00469970703125, -0.007171630859375, 0.00726318359375, -0.0018310546875, 0.0185546875, -0.000751495361328125, -0.02734375, 0.00555419921875, 0.047607421875, -0.01416015625, ...	[ 1250, 4867, 195625, 5844, 32354, 959, 186, 528, 6496, 237, 84751, 502, 144851, 809, 20990, 52544, 26265, 5443, 217, 724, 2588, 14212, 12825, 13574, 6873, 19051, 304, 172070, 31577, 29479, 11389, 3698, 944, 3956, 18151, 2967, 12684, 41206, 1...	[ 0.164306640625, 0.248779296875, 0.2249755859375, 0.118896484375, 0.1571044921875, 0.09344482421875, 0.0496826171875, 0.1331787109375, 0.059661865234375, 0.1002197265625, 0.152099609375, 0.1260986328125, 0.19970703125, 0.13916015625, 0.129638671875, 0.161865234375, 0.1717529296875, ...	embed
23803539_c0	23803539	prolog	0	Title: Moving a robot on a specific path Problem title: Moving a robot on a specific path Tags: prolog Problem: Moving a robot on a specific path Supose I have a grid like this one(I don't know the size of the grid) (-1,1) (0,1) (1,1) (-1,0) (0,0) (1,0) (-1,-1) (0,-1) (1,-1) In this grid are N boxes. I want to write so...	Moving a robot on a specific path Moving a robot on a specific path prolog Moving ProgramData ContainsBox Action ProgramDataUpdated N-1 Moving a robot on a specific path Supose I have a grid like this one(I don't know the size of the grid) In this grid are N boxes. I want to write some predicates in order to move the r...	[ 0.00750732421875, 0.004302978515625, 0.006439208984375, 0.033447265625, -0.00360107421875, 0.00156402587890625, 0.010986328125, 0.0234375, 0.01446533203125, -0.0225830078125, 0.0033111572265625, 0.030029296875, -0.030517578125, -0.0225830078125, -0.005615234375, 0.006561279296875, 0....	[ 2501, 6496, 11329, 98, 29458, 60875, 502, 4867, 7663, 137989, 34749, 72295, 57945, 152872, 541, 5759, 1832, 78381, 765, 120067, 1884, 903, 1632, 2301, 18, 3714, 13267, 621, 16530, 90, 3444, 33022, 1653, 2063, 25813, 11907, 38750, 12765, 217...	[ 0.1563720703125, 0.0771484375, 0.265625, 0.11572265625, 0.192138671875, 0.198974609375, 0.1300048828125, 0.1864013671875, 0.1055908203125, 0.129150390625, 0.0894775390625, 0.1593017578125, 0.1326904296875, 0.1116943359375, 0.1180419921875, 0.1285400390625, 0.003936767578125, 0.0301...	embed
62834430_c0	62834430	prolog	0	Title: A list on which there are duplicates(on sequence),a part of which is needed to be transferred Problem title: A list on which there are duplicates(on sequence),a part of which is needed to be transferred Tags: duplicates, list, prolog Problem: A list on which there are duplicates(on sequence),a part of which is n...	A list on which there are duplicates(on sequence),a part of which is needed to be transferred A list on which there are duplicates(on sequence),a part of which is needed to be transferred duplicates list prolog List Empty_at_first Arxh Telos Result_ml Result A list on which there are duplicates(on sequence),a part of w...	[ -0.0047607421875, -0.003265380859375, 0.003387451171875, -0.01092529296875, -0.01129150390625, -0.01361083984375, -0.00604248046875, 0.0279541015625, -0.0020294189453125, -0.016845703125, -0.0031280517578125, 0.01434326171875, 0.019287109375, 0.031005859375, -0.0014190673828125, 0.0102...	[ 5303, 98, 2685, 621, 171763, 1636, 191, 40, 944, 3956, 2831, 44841, 12302, 2822, 62, 502, 4867, 32036, 31678, 939, 257, 13448, 271, 1172, 425, 127, 9344, 232, 126684, 7237, 10644, 114122, 136791, 87168, 2565, 1556, 67, 120820, 24372, 2896...	[ 0.197509765625, 0.0308837890625, 0.030731201171875, 0.033782958984375, 0.284423828125, 0.2056884765625, 0.076904296875, 0.0255584716796875, 0.0816650390625, 0.051513671875, 0.07159423828125, 0.146240234375, 0.1617431640625, 0.09002685546875, 0.021697998046875, 0.11181640625, 0.163452...	embed
63999218_c0	63999218	prolog	0	Title: How to define a string concatenation operator in prolog? Problem title: How to define a string concatenation operator in prolog? Tags: operators, prolog, string-concatenation Problem: How to define a string concatenation operator in prolog? I am manipulating strings of characters in prolog, and I would like to a...	How to define a string concatenation operator in prolog? How to define a string concatenation operator in prolog? operators prolog string-concatenation How process_str Str Next is_valid_pattern0 Pattern0 Tail0 Tail1 is_valid_pattern1 Pattern1 Tail2 How to define a string concatenation operator in prolog? I am manipulat...	[ 0.0216064453125, -0.001617431640625, 0.0157470703125, 0.029296875, 0.0029144287109375, 0.00408935546875, -0.0220947265625, 0.0031585693359375, 0.0179443359375, -0.033447265625, -0.0057373046875, -0.0224609375, 0.0086669921875, -0.017333984375, 0.007293701171875, 0.003204345703125, -0...	[ 11249, 61924, 10, 79315, 158, 4460, 33, 2320, 39933, 23, 502, 4867, 2271, 9433, 9297, 23351, 4997, 83, 7013, 71, 4453, 22766, 2389, 9876, 1218, 379, 304, 45258, 124850, 71864, 142458, 77336, 91736, 27198, 80934, 1286, 12301, 41018, 209806, ...	[ 0.02734375, 0.1881103515625, 0.01953125, 0.21875, 0.097412109375, 0.1685791015625, 0.14404296875, 0.0650634765625, 0.255126953125, 0.04095458984375, 0.134033203125, 0.1904296875, 0.0293426513671875, 0.093017578125, 0.09381103515625, 0.08807373046875, 0.1712646484375, 0.010040283203...	embed
27838667_c0	27838667	prolog	0	Title: Prolog: Select rule randomly from list and pass parameter Problem title: Prolog: Select rule randomly from list and pass parameter Tags: rule, list, parameter-passing, prolog Problem: Prolog: Select rule randomly from list and pass parameter I am trying to write prolog code to select a random rule from a list an...	Prolog: Select rule randomly from list and pass parameter Prolog: Select rule randomly from list and pass parameter rule list parameter-passing prolog list Prolog Select Rules rule1 rule2 rule3 Rule random_between Elem nth0 hallo2 Prolog: Select rule randomly from list and pass parameter I am trying to write prolog cod...	[ 0.00182342529296875, 0.006805419921875, 0.006561279296875, -0.0013885498046875, -0.007476806640625, 0.0152587890625, 0.00142669677734375, -0.010498046875, 0.00011920928955078125, -0.0380859375, 0.01226806640625, -0.0164794921875, -0.00775146484375, 0.0030059814453125, 0.01031494140625, ...	[ 1250, 4867, 12, 51620, 79986, 96759, 538, 5303, 27875, 171859, 1295, 13409, 502, 139118, 304, 363, 4626, 1177, 33, 540, 195, 927, 2389, 23664, 31, 136, 31577, 33022, 18151, 36849, 71924, 3642, 2060, 765, 4488, 103687, 27781, 903, 184345, ...	[ 0.1898193359375, 0.255126953125, 0.03485107421875, 0.205078125, 0.2213134765625, 0.19580078125, 0.014312744140625, 0.1663818359375, 0.153564453125, 0.227783203125, 0.05877685546875, 0.082763671875, 0.1585693359375, 0.189697265625, 0.037872314453125, 0.08203125, 0.047027587890625, 0...	embed
10322472_c0	10322472	prolog	0	Title: I have a List of lists containing 4170 elements and I want to divide them to 139 lists each containing 30 different elements? Problem title: I have a List of lists containing 4170 elements and I want to divide them to 139 lists each containing 30 different elements? Tags: recursion, list, prolog Problem: I have ...	I have a List of lists containing 4170 elements and I want to divide them to 139 lists each containing 30 different elements? I have a List of lists containing 4170 elements and I want to divide them to 139 lists each containing 30 different elements? recursion list prolog List are_different List1 List2 nth0 Slot1 Slot...	[ -0.03125, 0.012451171875, 0.00102996826171875, 0.01190185546875, -0.04638671875, 0.000629425048828125, -0.00012063980102539062, -0.004730224609375, 0.001861572265625, 0.021484375, -0.0137939453125, -0.013671875, 0.0069580078125, 0.0203857421875, -0.0068359375, -0.0011444091796875, 0....	[ 87, 765, 32036, 111, 5303, 7, 70541, 214, 201, 43243, 80854, 3444, 47, 101637, 58166, 12638, 496, 12921, 32, 10, 195625, 1830, 502, 4867, 621, 238778, 418, 304, 927, 2389, 69623, 70, 46132, 6957, 12830, 25632, 3173, 1295, 3789, 5117, 40...	[ 0.033050537109375, 0.0732421875, 0.1795654296875, 0.041717529296875, 0.253662109375, 0.094482421875, 0.0870361328125, 0.03680419921875, 0.1077880859375, 0.2412109375, 0.1986083984375, 0.0902099609375, 0.1685791015625, 0.202392578125, 0.2344970703125, 0.040771484375, 0.215576171875, ...	embed
12884340_c0	12884340	prolog	0	Title: Creating list of data with recursion in Prolog Problem title: Creating list of data with recursion in Prolog Tags: list, prolog, recursion Problem: Creating list of data with recursion in Prolog I'm trying to write a recursive function that passes a list down to itself and at each level adds an element to that l...	Creating list of data with recursion in Prolog Creating list of data with recursion in Prolog list prolog recursion Creating Prolog List NumberOfSteps Stops NumberOfStepsIncremented Creating list of data with recursion in Prolog I'm trying to write a recursive function that passes a list down to itself and at each leve...	[ -0.000919342041015625, 0.03173828125, 0.00051116943359375, 0.00830078125, -0.001251220703125, 0.01519775390625, -0.01226806640625, -0.00311279296875, 0.01275634765625, -0.030517578125, 0.003631591796875, -0.0361328125, -0.0162353515625, 0.02392578125, 0.0135498046875, 0.006866455078125...	[ 56781, 5303, 2053, 678, 195625, 1830, 1250, 4867, 502, 32036, 103332, 132887, 191644, 42284, 7612, 1183, 31577, 33022, 5844, 32354, 10922, 7565, 68034, 12638, 17366, 15190, 12830, 2704, 113771, 4420, 29806, 1653, 2063, 26366, 3173, 2967, 33342,...	[ 0.1480712890625, 0.2060546875, 0.1444091796875, 0.08209228515625, 0.2275390625, 0.124267578125, 0.1715087890625, 0.2362060546875, 0.113037109375, 0.18603515625, 0.0936279296875, 0.1405029296875, 0.1697998046875, 0.14794921875, 0.08892822265625, 0.07574462890625, 0.04119873046875, 0...	embed
5259453_c0	5259453	prolog	0	Title: How can I use a GUI debugger on the Prolog code that runs inside a Java app through JPL? Problem title: How can I use a GUI debugger on the Prolog code that runs inside a Java app through JPL? Tags: eclipse, java, jpl, prolog, swi-prolog Problem: How can I use a GUI debugger on the Prolog code that runs inside a...	How can I use a GUI debugger on the Prolog code that runs inside a Java app through JPL? How can I use a GUI debugger on the Prolog code that runs inside a Java app through JPL? eclipse java jpl prolog swi-prolog jpl.PrologException PrologException How GUI Prolog Java JPL Query.oneSolution Query.hasSolution Exception e...	[ 0.00823974609375, 0.0191650390625, 0.00396728515625, -0.01422119140625, 0.00823974609375, -0.0040283203125, 0.0047607421875, -0.00153350830078125, 0.0023040771484375, -0.04833984375, 0.0162353515625, 0.01373291015625, -0.0184326171875, -0.0172119140625, 0.0137939453125, 0.011474609375,...	[ 11249, 831, 4527, 195490, 8, 978, 21407, 98, 1250, 4867, 18151, 127877, 46132, 41925, 4027, 8305, 821, 21130, 10, 106371, 184, 79, 330, 1647, 2424, 502, 2452, 3454, 10752, 63928, 58836, 3630, 102588, 10557, 5443, 116311, 188800, 85763, 4173...	[ 0.037353515625, 0.03131103515625, 0.1063232421875, 0.231201171875, 0.144775390625, 0.2132568359375, 0.189697265625, 0.019866943359375, 0.163330078125, 0.2249755859375, 0.150634765625, 0.049591064453125, 0.11328125, 0.2047119140625, 0.1246337890625, 0.040069580078125, 0.1064453125, ...	embed
40956860_c0	40956860	prolog	0	Title: cannot be redefined on prolog Problem title: cannot be redefined on prolog Tags: list, prolog Problem: cannot be redefined on prolog I'm pretty new on prolog and haven't quite understood some of its logic. I got this code for list in prolog: guardians([starlord, gamora, rocket, groot, drax]). avengers([rogers, s...	cannot be redefined on prolog cannot be redefined on prolog list prolog group1 group2 group3 rank1 rank2 rank3 is_member is_positioned has_position_in sample.pl:16 cannot be redefined on prolog I'm pretty new on prolog and haven't quite understood some of its logic. I got this code for list in prolog: I got an error: W...	[ 0.009521484375, 0.003021240234375, 0.018310546875, 0.01263427734375, -0.00836181640625, -0.015625, -0.0189208984375, 0.0169677734375, 0.00775146484375, -0.029052734375, 0.01904296875, -0.006927490234375, 0.0167236328125, -0.0174560546875, 0.012451171875, 0.004669189453125, -0.0043945...	[ 53418, 15265, 5983, 297, 98, 502, 4867, 186, 5303, 21115, 363, 30648, 39, 27417, 40322, 1556, 121413, 2424, 22354, 217064, 62775, 18151, 18499, 5351, 15005, 903, 117414, 71864, 22690, 110527 ]	[ 0.128662109375, 0.1453857421875, 0.187255859375, 0.0721435546875, 0.0273284912109375, 0.1322021484375, 0.2315673828125, 0.0189361572265625, 0.1783447265625, 0.1138916015625, 0.037689208984375, 0.108642578125, 0.0299835205078125, 0.176025390625, 0.147705078125, 0.031097412109375, 0.18...	embed
7655998_c0	7655998	prolog	0	Title: Running CG graphics on BProlog? Problem title: Running CG graphics on BProlog? Tags: cg, b-prolog, prolog Problem: Running CG graphics on BProlog? i recently installed B-prolog and tried CG graphics examples from here http://www.probp.com/ According to their manual, i've installed B prolog in C:/ drive and its c...	Running CG graphics on BProlog? Running CG graphics on BProlog? cg b-prolog prolog Running BProlog Win Frame WhiteBox Tri point1 point2 Star Type cuba.pl Compiling::cuba.pl loading::cuba.out Undefined Running CG graphics on BProlog? i recently installed B-prolog and tried CG graphics examples from here http://www.probp...	[ 0.0185546875, -0.0135498046875, 0.00396728515625, 0.00396728515625, -0.01373291015625, 0.0128173828125, 0.0068359375, -0.015869140625, 0.01507568359375, -0.007080078125, -0.0032958984375, 0.009765625, -0.005157470703125, -0.0184326171875, 0.0167236328125, 0.0079345703125, 0.001747131...	[ 28398, 592, 56367, 48461, 7, 98, 335, 10752, 4867, 177, 876, 3454, 502, 17686, 42557, 22392, 72295, 4699, 6275, 4612, 60457, 33160, 2424, 15612, 49725, 90351, 72367, 6056, 79912, 5983, 20600, 9, 37842, 27781, 79122, 254, 23009, 23, 313, 1...	[ 0.1334228515625, 0.05535888671875, 0.228271484375, 0.23046875, 0.1148681640625, 0.09521484375, 0.1806640625, 0.201904296875, 0.2374267578125, 0.098388671875, 0.1121826171875, 0.15185546875, 0.1492919921875, 0.06488037109375, 0.0950927734375, 0.1077880859375, 0.1646728515625, 0.1156...	embed
23985197_c0	23985197	prolog	0	Title: Two different behaviors of the same Prolog code with and without debugging Problem title: Two different behaviors of the same Prolog code with and without debugging Tags: debugging, prolog, swi-prolog, xpce Problem: Two different behaviors of the same Prolog code with and without debugging I am using the latets ...	Two different behaviors of the same Prolog code with and without debugging Two different behaviors of the same Prolog code with and without debugging debugging prolog swi-prolog xpce Two Prolog Frame Test Pic _Ref1 _Ref2 Good Two different behaviors of the same Prolog code with and without debugging I am using the late...	[ 0.018310546875, -0.0020904541015625, -0.0032501220703125, 0.02294921875, -0.007232666015625, 0.01043701171875, 0.00147247314453125, 0.0118408203125, -0.005035400390625, -0.0235595703125, 0.0177001953125, 0.0086669921875, -0.00811767578125, -0.00537109375, 0.031494140625, 0.003021240234...	[ 32964, 12921, 123166, 5701, 1250, 4867, 18151, 678, 15490, 8, 978, 502, 2452, 3454, 329, 42557, 8647, 27860, 190015, 304, 18621, 36659, 21, 3263, 7, 144142, 2289, 156960, 7911, 4785, 159, 38969, 9, 10752, 54825, 25632, 14602, 3017, 214, 2...	[ 0.1072998046875, 0.1153564453125, 0.16552734375, 0.110595703125, 0.152587890625, 0.216064453125, 0.1651611328125, 0.0175323486328125, 0.07574462890625, 0.1295166015625, 0.203125, 0.0966796875, 0.1416015625, 0.07086181640625, 0.058563232421875, 0.08551025390625, 0.10400390625, 0.084...	embed
62681650_c0	62681650	prolog	0	Title: Two DCG rules for `(ab)`. Can it be one? Problem title: Two DCG rules for `(ab)`. Can it be one? Tags: prolog, dcg Problem: Two DCG rules for `(ab)`. Can it be one? I want to generate or test strings obeying the Perl Regex (ab) The code below works perfectly well: Generate ?- phrase_acceptable(Text,6). Text ...	Two DCG rules for `(ab)`. Can it be one? Two DCG rules for `(ab)`. Can it be one? prolog dcg 2 Two DCG Can phrase_acceptable Text atom_codes Codes Two DCG rules for `(ab)`. Can it be one? I want to generate or test strings obeying the Perl Regex (ab) The code below works perfectly well: Generate Test (or compress?)...	[ 0.0311279296875, -0.004364013671875, 0.000732421875, 0.029052734375, 0.004425048828125, 0.0291748046875, 0.005157470703125, -0.01171875, 0.0223388671875, -0.025390625, -0.007781982421875, 0.006591796875, 0.01025390625, 0.0074462890625, 0.022216796875, -0.00055694580078125, 0.00253295...	[ 32964, 391, 56367, 91736, 2055, 1639, 4171, 186, 1632, 502, 4867, 104, 238, 177, 116, 113860, 135372, 2661, 24129, 34627, 40899, 28864, 100, 3444, 139392, 3034, 79315, 31192, 908, 141, 11678, 3355, 18151, 35064, 43240, 169123, 155370, 67, 8...	[ 0.13916015625, 0.079833984375, 0.215576171875, 0.1690673828125, 0.1949462890625, 0.1026611328125, 0.0948486328125, 0.01849365234375, 0.0811767578125, 0.1094970703125, 0.150634765625, 0.0125732421875, 0.0181427001953125, 0.0662841796875, 0.05413818359375, 0.1456298828125, 0.1461181640...	embed
26892994_c0	26892994	prolog	0	Title: Prolog - alternative conslusions to a relation Problem title: Prolog - alternative conslusions to a relation Tags: prolog Problem: Prolog - alternative conslusions to a relation I decided to learn basic Prolog because the idea of it seemed interesting. The language itself is difficult to put my head around thoug...	Prolog - alternative conslusions to a relation Prolog - alternative conslusions to a relation prolog Prolog Prolog - alternative conslusions to a relation I decided to learn basic Prolog because the idea of it seemed interesting. The language itself is difficult to put my head around though. As an excercise I decided t...	[ -0.0034942626953125, 0.0220947265625, 0.01190185546875, -0.00060272216796875, 0.00170135498046875, 0.00555419921875, -0.0247802734375, -0.007110595703125, -0.0184326171875, -0.04736328125, -0.0120849609375, 0.01153564453125, -0.009765625, 0.01123046875, 0.0211181640625, 0.0057983398437...	[ 1250, 4867, 30700, 158, 10791, 63239, 47, 41911, 502, 30698, 62822, 6528, 115058, 49041, 46876, 34844, 10336, 3443, 8781, 1528, 86869, 54350, 48408, 272, 36417, 104192, 3647, 3115, 2811, 27117, 91736, 51529, 11343, 14192, 85027, 17075, 8216, ...	[ 0.1646728515625, 0.24853515625, 0.1934814453125, 0.1058349609375, 0.1712646484375, 0.1085205078125, 0.047760009765625, 0.181640625, 0.082275390625, 0.04815673828125, 0.06756591796875, 0.013153076171875, 0.0113525390625, 0.0253753662109375, 0.112548828125, 0.050628662109375, 0.0022583...	embed
60822829_c0	60822829	prolog	0	Title: Simple predicate that returns all possible splits of a list Problem title: Simple predicate that returns all possible splits of a list Tags: prolog Problem: Simple predicate that returns all possible splits of a list In prolog, not using any predefined predicates, how might one go about finding all possible ways...	Simple predicate that returns all possible splits of a list Simple predicate that returns all possible splits of a list prolog Simple all_possibilities Simple predicate that returns all possible splits of a list In prolog, not using any predefined predicates, how might one go about finding all possible ways of splittin...	[ -0.0023193359375, 0.019775390625, 0.006378173828125, 0.023681640625, -0.0262451171875, 0.0262451171875, 0.0057373046875, -0.004302978515625, 0.03857421875, -0.0113525390625, 0.0172119140625, -0.01263427734375, -0.001953125, 0.03515625, 0.009521484375, 0.006195068359375, 0.02062988281...	[ 60552, 1653, 2063, 67, 30646, 756, 7722, 65450, 7, 5303, 502, 4867, 171702, 959, 5983, 3642, 13648, 738, 1672, 90791, 48322, 1916, 3934, 116, 3789, 7103, 51042, 9007, 133, 16446, 7515, 10269, 62, 335, 166904, 6528, 237875, 29479, 195625, ...	[ 0.1708984375, 0.156982421875, 0.1776123046875, 0.060211181640625, 0.1676025390625, 0.1353759765625, 0.1839599609375, 0.2196044921875, 0.09228515625, 0.204345703125, 0.1229248046875, 0.171875, 0.2379150390625, 0.018157958984375, 0.0682373046875, 0.008453369140625, 0.034942626953125, ...	embed
69137776_c0	69137776	prolog	0	Title: Is there a Prolog name for atom/1 or stream/1 etc (SWI-Prolog) Problem title: Is there a Prolog name for atom/1 or stream/1 etc (SWI-Prolog) Tags: swi-prolog, prolog Problem: Is there a Prolog name for atom/1 or stream/1 etc (SWI-Prolog) Just made a funny observation. SWI-Prolog allows other things than atom as ...	Is there a Prolog name for atom/1 or stream/1 etc (SWI-Prolog) Is there a Prolog name for atom/1 or stream/1 etc (SWI-Prolog) swi-prolog prolog Prolog SWI-Prolog current_input ERROR Type Is there a Prolog name for atom/1 or stream/1 etc (SWI-Prolog) Just made a funny observation. SWI-Prolog allows other things than ato...	[ 0.0167236328125, -0.0013427734375, 0.018310546875, 0.01275634765625, 0.0020294189453125, 0.00323486328125, 0.0135498046875, -0.01458740234375, -0.00640869140625, -0.01239013671875, 0.0126953125, -0.0264892578125, -0.0031890869140625, -0.00099945068359375, 0.00927734375, -0.002914428710...	[ 2071, 2685, 10, 1250, 4867, 9351, 100, 34627, 11583, 707, 75973, 294, 38969, 9, 10752, 3021, 2452, 3454, 502, 43581, 73, 7077, 151206, 24638, 60457, 99864, 150556, 159, 114864, 3789, 8966, 3501, 237, 7477, 18770, 23, 217773, 54, 32195, 23...	[ 0.008514404296875, 0.049163818359375, 0.031280517578125, 0.1942138671875, 0.2388916015625, 0.180908203125, 0.04534912109375, 0.2364501953125, 0.1937255859375, 0.0282745361328125, 0.2403564453125, 0.035247802734375, 0.2044677734375, 0.05841064453125, 0.16064453125, 0.002471923828125, ...	embed
51961176_c1	51961176	prolog	1	, Out) :- S =.. [submit \| Ls], subtract1(Ls, Label, Tmp), Out =.. [submit \| Tmp]. ========================================================== update on 8/30: we are using three different approach on gerrit 2.11, no syntax error now. but none of them works, new label keeps there what ever the code change size. Suspect co...	, Out) :- S =.. [submit \| Ls], subtract1(Ls, Label, Tmp), Out =.. [submit \| Tmp]. ========================================================== update on 8/30: we are using three different approach on gerrit 2.11, no syntax error now. but none of them works, new label keeps there what ever the code change size. Suspect co...	[ -0.0037841796875, 0.00970458984375, 0.01544189453125, 0.00157928466796875, -0.0224609375, 0.003021240234375, -0.0035552978515625, 0.00640869140625, 0.007232666015625, 0.033203125, 0.025146484375, -0.01348876953125, 0.0174560546875, -0.0242919921875, 0.025634765625, 0.0125732421875, 0...	[ 4, 13538, 15772, 159, 2203, 22144, 4007, 339, 1614, 39989, 18, 418, 866, 7, 129214, 384, 2676, 28350, 17368, 17262, 12921, 51515, 4155, 2783, 787, 1662, 6002, 86531, 18499, 43240, 3525, 67967, 13695, 2685, 18151, 15549, 13267, 1832, 16711, ...	[ 0.0626220703125, 0.22998046875, 0.017791748046875, 0.1395263671875, 0.104736328125, 0.1697998046875, 0.219482421875, 0.05499267578125, 0.11181640625, 0.1602783203125, 0.06903076171875, 0.0201416015625, 0.06866455078125, 0.006378173828125, 0.1912841796875, 0.0163116455078125, 0.169921...	embed
53509214_c0	53509214	prolog	0	Title: prolog error from classifying a subclass of an atom Problem title: prolog error from classifying a subclass of an atom Tags: prolog Problem: prolog error from classifying a subclass of an atom I'm still learning prolog but am coming across this error. Warning: /usr/local/home/jay275/SDRIVE/cs3500/hw7/part1.pl:23...	prolog error from classifying a subclass of an atom prolog error from classifying a subclass of an atom prolog classifying Warning jay275 SDRIVE cs3500 hw7 part1.pl:23 Clauses Earlier part1.pl:10 Current Use Mammal Animal prolog error from classifying a subclass of an atom I'm still learning prolog but am coming across...	[ 0.025390625, 0.009765625, 0.00677490234375, 0.014404296875, 0.0037994384765625, 0.0205078125, -0.00665283203125, 0.00185394287109375, 0.0033416748046875, -0.03369140625, 0.0002841949462890625, -0.0260009765625, 0.01123046875, -0.0166015625, 0.0263671875, -0.0196533203125, 0.007934570...	[ 502, 4867, 18499, 1295, 18507, 151138, 1614, 67413, 34627, 5550, 592, 79, 53, 304, 6873, 159, 23498, 96479, 20763, 363, 4283, 434, 966, 2831, 24864, 100700, 15110, 114063, 36836, 101860, 141, 82821, 111, 52080, 36880, 903, 31577, 5154, 2174...	[ 0.1512451171875, 0.240234375, 0.1885986328125, 0.0537109375, 0.1627197265625, 0.1287841796875, 0.185791015625, 0.2081298828125, 0.193115234375, 0.120849609375, 0.0281524658203125, 0.07958984375, 0.03302001953125, 0.0086669921875, 0.1474609375, 0.003875732421875, 0.08135986328125, 0...	embed
64177449_c0	64177449	prolog	0	Title: typing period in VSCode is accidentally bound to something? Problem title: typing period in VSCode is accidentally bound to something? Tags: visual-studio-code, prolog Problem: typing period in VSCode is accidentally bound to something? I accidentally bound the period on VSCode on my Mac to something and can't f...	typing period in VSCode is accidentally bound to something? typing period in VSCode is accidentally bound to something? visual-studio-code prolog VSCode renderer1 KeybindingService Received Period Converted Resolving typing period in VSCode is accidentally bound to something? I accidentally bound the period on VSCode o...	[ 0.01019287109375, 0.0322265625, 0.004119873046875, 0.0003948211669921875, 0.009765625, -0.0019073486328125, -0.0155029296875, 0.00064849853515625, -0.021484375, -0.004058837890625, 0.00035858154296875, 0.00946044921875, 0.00128936767578125, 0.00067901611328125, -0.005401611328125, 0.01...	[ 11417, 214, 14922, 23, 44160, 114211, 83, 27998, 25958, 99091, 47, 9844, 21176, 52629, 40899, 502, 4867, 79516, 26824, 128239, 121979, 93908, 92329, 814, 132944, 4727, 39531, 20697, 10644, 1379, 15824, 8, 74635, 79986, 91995, 32354, 17198, 50...	[ 0.1890869140625, 0.0802001953125, 0.240478515625, 0.037628173828125, 0.1942138671875, 0.27490234375, 0.0228424072265625, 0.1644287109375, 0.07354736328125, 0.2025146484375, 0.09259033203125, 0.07843017578125, 0.1456298828125, 0.1146240234375, 0.1844482421875, 0.10455322265625, 0.1580...	embed
77289456_c0	77289456	prolog	0	Title: Moving elements in a list-of-lists in prolog Problem title: Moving elements in a list-of-lists in prolog Tags: prolog, list, matrix Problem: Moving elements in a list-of-lists in prolog I'm making a 8-puzzle solver in prolog, and I'm having a hard time figuring out how to program the rules of the game. The initi...	Moving elements in a list-of-lists in prolog Moving elements in a list-of-lists in prolog prolog list matrix Moving line_matching list_count wrong_position Line Moving elements in a list-of-lists in prolog I'm making a 8-puzzle solver in prolog, and I'm having a hard time figuring out how to program the rules of the ga...	[ -0.009521484375, 0.01611328125, 0.0057373046875, -0.00125885009765625, -0.01287841796875, 0.006011962890625, -0.01190185546875, 0.031005859375, 0.0030059814453125, 0.003265380859375, -0.005859375, 0.00159454345703125, -0.0052490234375, -0.006988525390625, -0.02880859375, -0.00387573242...	[ 2501, 6496, 80854, 23, 5303, 4390, 6562, 7, 502, 4867, 50944, 13315, 98753, 71013, 44691, 40322, 16777, 20662, 15045, 1766, 13894, 133, 3115, 814, 7941, 26747, 1528, 91736, 6712, 61475, 11341, 33636, 237, 185723, 363, 150643, 124940, 3871, ...	[ 0.1622314453125, 0.097412109375, 0.2147216796875, 0.048187255859375, 0.21337890625, 0.229736328125, 0.23388671875, 0.050872802734375, 0.1705322265625, 0.2281494140625, 0.2152099609375, 0.16259765625, 0.173828125, 0.125, 0.1666259765625, 0.1446533203125, 0.1785888671875, 0.002502441...	embed
70844056_c1	70844056	prolog	1	) exceeded Stack sizes: local: 1.4Mb, global: 0.3Mb, trail: 67Kb Stack depth: 5,534, last-call: 0%, Choice points: 8,270 Possible non-terminating recursion: [5,532] path([length:2\|_1460], _1452, []) [5,531] path([length:3\|_1494], _1486, []) I think the chain rule is doing 1 -> 2 -> 1 -> 2 -> 1 ... forever. I don't seem...	) exceeded Stack sizes: local: 1.4Mb, global: 0.3Mb, trail: 67Kb Stack depth: 5,534, last-call: 0%, Choice points: 8,270 Possible non-terminating recursion: [5,532] path([length:2\|_1460], _1452, []) [5,531] path([length:3\|_1494], _1486, []) I think the chain rule is doing 1 -> 2 -> 1 -> 2 -> 1 ... forever. I don't seem...	[ 0.0087890625, 0.0157470703125, -0.004974365234375, 0.027099609375, -0.0004596710205078125, 0.00592041015625, -0.0002651214599609375, -0.0264892578125, 0.0166015625, -0.0654296875, -0.016845703125, 0.0269775390625, -0.00445556640625, 0.0308837890625, 0.024658203125, 0.0068359375, 0.00...	[ 1388, 204839, 297, 6512, 2594, 13267, 4000, 48733, 147197, 7964, 127089, 141037, 12661, 168867, 78646, 10289, 4568, 85763, 83137, 181948, 26847, 104283, 115861, 351, 30524, 26518, 195625, 1830, 125592, 6460, 60875, 23986, 158332, 117444, 304, 501...	[ 0.041900634765625, 0.244140625, 0.1024169921875, 0.141845703125, 0.14697265625, 0.123291015625, 0.06732177734375, 0.011871337890625, 0.07110595703125, 0.070068359375, 0.006866455078125, 0.1744384765625, 0.000457763671875, 0.1549072265625, 0.035400390625, 0.048492431640625, 0.04934692...	embed
14850207_c0	14850207	prolog	0	Title: Deducing facts from a set via a predicate by metaprogramming Problem title: Deducing facts from a set via a predicate by metaprogramming Tags: metaprogramming, prolog Problem: Deducing facts from a set via a predicate by metaprogramming Suppose I have a set of Literals (represented as a list for instance) and a ...	Deducing facts from a set via a predicate by metaprogramming Deducing facts from a set via a predicate by metaprogramming metaprogramming prolog a Deducing deduce_set Set Pred DeducedSet Deducing facts from a set via a predicate by metaprogramming Suppose I have a set of Literals (represented as a list for instance) an...	[ 0.016357421875, -0.0191650390625, 0.00537109375, 0.0155029296875, -0.0225830078125, 0.00946044921875, -0.0206298828125, 0.0167236328125, 0.01202392578125, -0.0458984375, 0.00885009765625, 0.00982666015625, -0.00482177734375, -0.0120849609375, -0.006378173828125, 0.0196533203125, 0.01...	[ 262, 39367, 15824, 7, 1295, 5423, 1829, 1653, 2063, 67, 390, 23550, 28966, 502, 4867, 214, 8, 106357, 3509, 19943, 7145, 294, 126, 135940, 8080, 55247, 5303, 58735, 84079, 3444, 27489, 15659, 16765, 70541, 756, 96362, 66044, 77193, 59911, ...	[ 0.16943359375, 0.209228515625, 0.192138671875, 0.02508544921875, 0.10272216796875, 0.2115478515625, 0.09234619140625, 0.1995849609375, 0.2244873046875, 0.0977783203125, 0.0279388427734375, 0.2061767578125, 0.2344970703125, 0.120849609375, 0.1666259765625, 0.036712646484375, 0.1676025...	embed
22670696_c1	22670696	prolog	1	), female(Mother). % Looks if there are siblings of a person. % Persons are siblings if they have the same father or % if they have the same mother and not the same father. siblings(X,Y) :- ( same_father(X, Y), X \= Y ; same_mother(X, Y), \+ same_father(X, Y) ). % Displays the output of siblings(X,Y) and takes care tha...	), female(Mother). % Looks if there are siblings of a person. % Persons are siblings if they have the same father or % if they have the same mother and not the same father. siblings(X,Y) :- ( same_father(X, Y), X \= Y ; same_mother(X, Y), \+ same_father(X, Y) ). % Displays the output of siblings(X,Y) and takes care tha...	[ 0.0010223388671875, 0.0185546875, 0.0234375, 0.000736236572265625, -0.0123291015625, 0.00182342529296875, 0.0021209716796875, -0.00762939453125, -0.0037078857421875, -0.0194091796875, 0.010498046875, -0.0157470703125, -0.0079345703125, 0.00128173828125, 0.01416015625, 0.022216796875, ...	[ 247, 117776, 132, 594, 126340, 194, 1745, 60818, 7, 2174, 2685, 621, 78, 79298, 111, 3445, 5, 15270, 5701, 67373, 42732, 1542, 4, 1723, 15772, 1021, 9319, 990, 1193, 432, 1328, 90045, 140992, 517, 110, 171763, 44116, 76103, 33992, 160054,...	[ 0.045806884765625, 0.1806640625, 0.004913330078125, 0.05352783203125, 0.11865234375, 0.048919677734375, 0.1407470703125, 0.2001953125, 0.1158447265625, 0.06488037109375, 0.075439453125, 0.08740234375, 0.1573486328125, 0.249755859375, 0.04376220703125, 0.1068115234375, 0.0178070068359...	embed
41407226_c0	41407226	prolog	0	Title: How to convert if else to fully declarative in Prolog? Problem title: How to convert if else to fully declarative in Prolog? Tags: logical-purity, prolog, declarative Problem: How to convert if else to fully declarative in Prolog? It's one of my classroom question. I was able to create my own Prolog program with...	How to convert if else to fully declarative in Prolog? How to convert if else to fully declarative in Prolog? logical-purity prolog declarative How Prolog is_spicy Preference Curry Kurma is_fry StirFry Chicken is_chili Sambal Singgang Food Which FoodType Please How to convert if else to fully declarative in Prolog? It'...	[ 0.01043701171875, 0.00823974609375, 0.0162353515625, 0.022216796875, -0.0028076171875, 0.016845703125, -0.00020503997802734375, -0.0081787109375, -0.01141357421875, 0.0155029296875, 0.0263671875, 0.003936767578125, -0.015869140625, -0.00927734375, 0.01806640625, -0.01104736328125, -0...	[ 11249, 47, 96760, 2174, 37076, 89554, 21635, 4935, 23, 1250, 4867, 62775, 289, 4717, 2481, 502, 83, 44689, 2408, 239879, 17065, 1294, 5375, 192, 77843, 2826, 197527, 1861, 150, 3362, 3571, 87760, 34562, 130078, 196707, 30607, 217212, 10002, ...	[ 0.061431884765625, 0.0819091796875, 0.157958984375, 0.2135009765625, 0.2274169921875, 0.1593017578125, 0.1966552734375, 0.1434326171875, 0.064697265625, 0.1378173828125, 0.2445068359375, 0.120361328125, 0.055877685546875, 0.116943359375, 0.090087890625, 0.10205078125, 0.0528259277343...	embed
10134495_c0	10134495	prolog	0	Title: prolog puzzle, can't find error Problem title: prolog puzzle, can't find error Tags: debugging, prolog, puzzle Problem: prolog puzzle, can't find error Here's my code for my assignment, its not working correctly. What it is supposed to do is take a family fact in the form of family(Title,[Name/Speed\|_]...	prolog puzzle, can't find error prolog puzzle, can't find error debugging prolog puzzle Title Name Speed assert_family Key Journey TotalTime Person Time Left LTime P1-T1 P2-T2 P1-P2 Right MLeft1 MLeft2 P3-RT MRight List prolog puzzle, can't find error Here's my code for my assignment, its not working correctl...	[ 0.014404296875, -0.00250244140625, -0.0028076171875, 0.01171875, -0.03076171875, 0.0050048828125, -0.01556396484375, 0.01348876953125, -0.0027313232421875, -0.02197265625, -0.00726318359375, 0.0145263671875, 0.006866455078125, 0.0022125244140625, 0.01483154296875, 0.0019378662109375, ...	[ 502, 4867, 104192, 831, 3768, 18, 7413, 18499, 8, 978, 48962, 15757, 63349, 237, 33657, 212122, 26824, 212595, 33867, 70059, 15270, 19055, 2480, 436, 20268, 418, 18504, 304, 90911, 27495, 20503, 22553, 32036, 11853, 759, 18151, 95486, 6863, ...	[ 0.16845703125, 0.2196044921875, 0.206298828125, 0.09002685546875, 0.0576171875, 0.08544921875, 0.1566162109375, 0.2275390625, 0.10736083984375, 0.12548828125, 0.107666015625, 0.0614013671875, 0.167236328125, 0.016754150390625, 0.176025390625, 0.118896484375, 0.087158203125, 0.16455...	embed
37374713_c1	37374713	prolog	1	000)), findall(Subseq-Dis, ea_smallseq_largeseq_dis_h(Sseq,Lseq,10000,Subseq,Dis),Pairs), append(_,[Subseq-Dis\|[]],Pairs). ea_smallseq_largeseq_dis_h(Sseq,Lseq,BestSofar1,Subseq,Dis):- same_length(Sseq,Subseq), seq_subseq(Lseq,Subseq), best(_,BestSofar2), ( ( BestSofar2 < BestSofar1) -> accumulate_dis(Sseq,Subseq,BestS...	000)), findall(Subseq-Dis, ea_smallseq_largeseq_dis_h(Sseq,Lseq,10000,Subseq,Dis),Pairs), append(_,[Subseq-Dis\|[]],Pairs). ea_smallseq_largeseq_dis_h(Sseq,Lseq,BestSofar1,Subseq,Dis):- same_length(Sseq,Subseq), seq_subseq(Lseq,Subseq), best(_,BestSofar2), ( ( BestSofar2 < BestSofar1) -> accumulate_dis(Sseq,Subseq,BestS...	[ 0.0244140625, 0.015625, -0.0003757476806640625, 0.01116943359375, -0.000827789306640625, 0.00860595703125, -0.026123046875, 0.0135498046875, 0.04248046875, -0.00335693359375, 0.006805419921875, 0.0380859375, 0.0120849609375, 0.0211181640625, 0.00933837890625, -0.002716064453125, 0.01...	[ 2445, 247, 7413, 5584, 96472, 184, 864, 9, 44456, 8394, 69070, 13, 3827, 127, 191281, 8335, 481, 114689, 320, 110601, 8912, 3814, 418, 5701, 23986, 40, 22144, 2965, 10461, 11345, 304, 33079, 183278, 67, 41499, 91569, 32168, 237, 33657, 42...	[ 0.20703125, 0.06024169921875, 0.1876220703125, 0.242431640625, 0.2235107421875, 0.187744140625, 0.2005615234375, 0.042572021484375, 0.1962890625, 0.1610107421875, 0.1373291015625, 0.03704833984375, 0.1837158203125, 0.08575439453125, 0.192138671875, 0.0966796875, 0.1080322265625, 0....	embed
22923052_c0	22923052	prolog	0	Title: Prolog Refine ( to be used in a grammar to parse prop logic formula Problem title: Prolog Refine ( to be used in a grammar to parse prop logic formula Tags: prolog, logic Problem: Prolog Refine ( to be used in a grammar to parse prop logic formula Below is my grammar to parse a propositional logic statement. At ...	Prolog Refine ( to be used in a grammar to parse prop logic formula Prolog Refine ( to be used in a grammar to parse prop logic formula prolog logic the Prolog Refine Not ERROR parser.pl:7 set_predicate_attribute parser.pl:8 parser.pl:9 parser.pl:10 parser.pl:20:20 Syntax Operator parser.pl:21:20 parser.pl:23:17 Illega...	[ 0.0211181640625, -0.005523681640625, -0.0078125, 0.0107421875, 0, 0.0133056640625, 0.005645751953125, -0.003570556640625, 0.000164031982421875, -0.022705078125, 0.0211181640625, 0.002410888671875, -0.01458740234375, -0.0118408203125, 0.016357421875, 0.00970458984375, -0.0155029296875...	[ 1250, 4867, 853, 64552, 11814, 122092, 147, 366, 184, 25793, 62775, 26168, 502, 11205, 151206, 24638, 2189, 2424, 966, 5423, 19714, 2063, 191145, 1019, 1126, 16619, 150922, 891, 86966, 15, 17336, 89261, 289, 63805, 103136, 18499, 44136, 282, ...	[ 0.1849365234375, 0.26318359375, 0.120361328125, 0.26611328125, 0.0977783203125, 0.112060546875, 0.1173095703125, 0.15625, 0.0704345703125, 0.220458984375, 0.1923828125, 0.1435546875, 0.136962890625, 0.07489013671875, 0.1171875, 0.0853271484375, 0.049072265625, 0.04095458984375, 0...	embed
20954389_c0	20954389	prolog	0	Title: Creating and printing a list from dates Problem title: Creating and printing a list from dates Tags: list, date, prolog Problem: Creating and printing a list from dates This is what I've done so far: daycompare(D,D1):- parse_time(D,iso_8601,DateCode) @< parse_time(D1,iso_8601,DateCode1). listdates(P1,P2,D1) :- m...	Creating and printing a list from dates Creating and printing a list from dates list date prolog dates Creating parse_time iso_8601 DateCode DateCode1 Creating and printing a list from dates This is what I've done so far: I'm trying to list out all the dates (D) when (P1) or (P2) message each other. I have so far used ...	[ 0.0167236328125, -0.0074462890625, -0.00433349609375, 0.0322265625, 0.004547119140625, 0.02099609375, -0.029052734375, 0.0228271484375, -0.00433349609375, -0.0206298828125, -0.00762939453125, 0.0020751953125, 0.01007080078125, -0.0087890625, -0.0128173828125, 0.00567626953125, 0.0139...	[ 56781, 136, 2448, 5303, 1295, 112474, 5622, 502, 4867, 366, 184, 6032, 13882, 15276, 6746, 25512, 114211, 418, 2060, 31577, 1810, 756, 397, 683, 17727, 10461, 26008, 12638, 3789, 11814, 70, 1653, 2063, 5155, 277, 16082, 69101, 6626, 25842, ...	[ 0.1126708984375, 0.02618408203125, 0.1551513671875, 0.18994140625, 0.1336669921875, 0.22900390625, 0.1102294921875, 0.1170654296875, 0.166015625, 0.0576171875, 0.007598876953125, 0.1109619140625, 0.1015625, 0.103515625, 0.116943359375, 0.13232421875, 0.158447265625, 0.0299987792968...	embed
74765572_c0	74765572	prolog	0	Title: Non-branching version of 'bagof' Problem title: Non-branching version of 'bagof' Tags: backtracking, sudoku, prolog, clpfd Problem: Non-branching version of 'bagof' I'm trying to implement a sudoku-like puzzle solver that involves groups in prolog, and where one of the rules is that the same ...	Non-branching version of 'bagof' Non-branching version of 'bagof' backtracking sudoku prolog clpfd Non-branching use_module Input Items G-V Group Len all_distinct a-1 b-_ a-_ b-1 a-2 b-2 c-_ a-4 b-3 b-4 a-3 c-1 Non-branching version of 'bagof' I'm trying to implement a sudoku-like puzzle solver that...	[ -0.021484375, 0.018798828125, -0.00341796875, 0.0021209716796875, -0.00732421875, 0.011962890625, -0.00323486328125, -0.017578125, 0.006683349609375, -0.0380859375, -0.0196533203125, 0.0028228759765625, 0.0091552734375, -0.001556396484375, -0.01348876953125, 0.032958984375, -0.003341...	[ 3775, 21684, 59207, 11389, 3768, 120968, 420, 4420, 125728, 214, 8932, 38067, 502, 4867, 39557, 71, 4527, 83279, 7077, 78426, 527, 856, 10760, 18226, 756, 38893, 5759, 5428, 11565, 8316, 31577, 29479, 5062, 104192, 3115, 814, 83687, 94407, ...	[ 0.2021484375, 0.2088623046875, 0.1741943359375, 0.201416015625, 0.044189453125, 0.1805419921875, 0.2685546875, 0.06201171875, 0.1866455078125, 0.025390625, 0.08209228515625, 0.2091064453125, 0.1239013671875, 0.1807861328125, 0.037078857421875, 0.03338623046875, 0.0611572265625, 0.0...	embed
58805565_c1	58805565	prolog	1	'). parent('Yuriy Dolgoruky', 'Mikhail I'). parent('Yuriy Dolgoruky', 'Vsevolod Bolshoe Gnezdo'). parent('Vsevolod Bolshoe Gnezdo', 'Yuriy II'). parent('Vsevolod Bolshoe Gnezdo', 'Yaroslav II'). parent('Vsevolod Bolshoe Gnezdo', 'Konstantin I'). parent('Yaroslav II', 'Andrey'). parent('Andrey', 'Vasiliy'). parent('Vasi...	'). parent('Yuriy Dolgoruky', 'Mikhail I'). parent('Yuriy Dolgoruky', 'Vsevolod Bolshoe Gnezdo'). parent('Vsevolod Bolshoe Gnezdo', 'Yuriy II'). parent('Vsevolod Bolshoe Gnezdo', 'Yaroslav II'). parent('Vsevolod Bolshoe Gnezdo', 'Konstantin I'). parent('Yaroslav II', 'Andrey'). parent('Andrey', 'Vasiliy'). parent('Vasi...	[ -0.018310546875, 0.01318359375, 0.0177001953125, 0.0201416015625, -0.009765625, -0.00872802734375, -0.0106201171875, 0.0198974609375, -0.0120849609375, -0.0439453125, 0.01214599609375, -0.00799560546875, -0.01483154296875, 0.00225830078125, -0.000682830810546875, -0.0010986328125, 0....	[ 242, 194, 49129, 132, 25, 1723, 1162, 53, 20384, 6504, 34, 1002, 4, 594, 783, 68365, 87, 856, 184, 3784, 2199, 12981, 11412, 13, 527, 19417, 246, 1995, 147, 103073, 42539, 73, 148233, 28563, 21050, 4007, 85751, 1832, 2465, 1336, 2198, ...	[ 0.1553955078125, 0.1768798828125, 0.31884765625, 0.1007080078125, 0.114013671875, 0.1258544921875, 0.2298583984375, 0.185546875, 0.1566162109375, 0.146728515625, 0.151123046875, 0.1942138671875, 0.09649658203125, 0.099853515625, 0.121337890625, 0.274169921875, 0.2099609375, 0.04022...	embed
70131348_c0	70131348	prolog	0	Title: Logical task. Why is my code giving the wrong result? Problem title: Logical task. Why is my code giving the wrong result? Tags: prolog Problem: Logical task. Why is my code giving the wrong result? Unfortunately, I cannot give the full text of the problem for some reason. Therefore, I will try to describe the m...	Logical task. Why is my code giving the wrong result? Logical task. Why is my code giving the wrong result? prolog Logical Why Guests Logical task. Why is my code giving the wrong result? Unfortunately, I cannot give the full text of the problem for some reason. Therefore, I will try to describe the main point. There w...	[ 0.000301361083984375, 0.0233154296875, 0.0206298828125, 0.006744384765625, 0.00927734375, 0.00811767578125, -0.0234375, 0.00151824951171875, 0.016845703125, -0.027099609375, -0.0040283203125, -0.013427734375, 0.0029144287109375, -0.0028076171875, 0.01324462890625, 0.00396728515625, 0...	[ 13146, 21533, 66211, 44084, 83, 759, 18151, 68772, 44691, 16750, 502, 4867, 83054, 7, 185397, 53418, 8337, 4393, 7986, 2967, 31635, 9790, 98363, 5201, 6275, 8622, 509, 10, 162882, 99, 3018, 17155, 1398, 305, 144994, 92610, 21449, 19922, 220...	[ 0.214599609375, 0.18017578125, 0.2030029296875, 0.1741943359375, 0.061767578125, 0.06402587890625, 0.204345703125, 0.101806640625, 0.22021484375, 0.183837890625, 0.1048583984375, 0.153076171875, 0.2431640625, 0.0697021484375, 0.005584716796875, 0.046905517578125, 0.033599853515625, ...	embed
52324647_c0	52324647	prolog	0	Title: How to get rid of duplicates in prolog? Problem title: How to get rid of duplicates in prolog? Tags: prolog Problem: How to get rid of duplicates in prolog? I am new to prolog and I have a hierarchical database that lists employees and their supervisors: employee(employee1, employee4). employee(employee2, employ...	How to get rid of duplicates in prolog? How to get rid of duplicates in prolog? prolog How employee1 employee4 employee2 employee3 employee8 employee5 employee7 employee6 employee9 employee10 Who How to get rid of duplicates in prolog? I am new to prolog and I have a hierarchical database that lists employees and their...	[ 0.004150390625, 0.025146484375, 0.00946044921875, 0.015380859375, -0.00439453125, 0.00592041015625, -0.0186767578125, 0.01434326171875, -0.015869140625, -0.051513671875, -0.0218505859375, 0.01019287109375, 0.0081787109375, 0.01263427734375, 0.003265380859375, 0.010498046875, 0.007202...	[ 11249, 47, 2046, 31351, 111, 171763, 1636, 23, 502, 4867, 32, 188183, 418, 617, 304, 363, 1019, 758, 966, 910, 1126, 963, 40469, 3525, 1791, 54689, 63399, 5303, 93215, 136, 1601, 51858, 3444, 1653, 2063, 35839, 552, 18244, 56, 284, 335,...	[ 0.0955810546875, 0.04638671875, 0.09869384765625, 0.1903076171875, 0.09832763671875, 0.2744140625, 0.1953125, 0.074462890625, 0.1927490234375, 0.25537109375, 0.0155029296875, 0.1468505859375, 0.03179931640625, 0.0784912109375, 0.0321044921875, 0.044097900390625, 0.05059814453125, 0...	embed
54541268_c0	54541268	prolog	0	Title: How to permanently save changes of dynamic predicates to .pl file? (Tau-Prolog) Problem title: How to permanently save changes of dynamic predicates to .pl file? (Tau-Prolog) Tags: tau-prolog, prolog Problem: How to permanently save changes of dynamic predicates to .pl file? (Tau-Prolog) Question - Asserted dyna...	How to permanently save changes of dynamic predicates to .pl file? (Tau-Prolog) How to permanently save changes of dynamic predicates to .pl file? (Tau-Prolog) tau-prolog prolog external internal How Tau-Prolog pl.create session.consult baza.pl session.query load_dyn use_module How to permanently save changes of dynami...	[ 0.02294921875, 0.00885009765625, 0.0106201171875, 0.0164794921875, -0.0140380859375, 0.00762939453125, -0.0157470703125, 0.007354736328125, 0.003082275390625, -0.061767578125, 0.01422119140625, 0.0272216796875, -0.01336669921875, -0.01202392578125, 0.03271484375, 0.0181884765625, 0.0...	[ 11249, 28123, 538, 30098, 65572, 84079, 1653, 2063, 1636, 47, 5, 2424, 11435, 9874, 34, 10752, 4867, 5705, 3454, 502, 173591, 70796, 21139, 9, 6456, 7612, 56002, 147834, 12170, 72367, 17872, 4527, 83279, 62, 16865, 3674, 2301, 18, 7103, 1...	[ 0.0626220703125, 0.189208984375, 0.035919189453125, 0.1881103515625, 0.2001953125, 0.2276611328125, 0.2147216796875, 0.2249755859375, 0.1427001953125, 0.10479736328125, 0.04400634765625, 0.1884765625, 0.138427734375, 0.09332275390625, 0.1761474609375, 0.15673828125, 0.207275390625, ...	embed
43029488_c0	43029488	prolog	0	Title: Read a list from stream using Yap-Prolog Problem title: Read a list from stream using Yap-Prolog Tags: pipe, prolog, stream, yap Problem: Read a list from stream using Yap-Prolog I want to run a (python3) process from my (yap) prolog script and read its output formatted as a list of integers, e.g. [1,2,3,4,5,6] ...	Read a list from stream using Yap-Prolog Read a list from stream using Yap-Prolog pipe prolog stream yap BrokenPipeError stream Yap-Prolog Read process_create python3 my_script.py MyParam Out OutputList PL_unify_term PL_int64 Exception _io.TextIOWrapper UTF-8 Errno Broken constant_term read_term read_string Read a list...	[ 0.021728515625, 0.000888824462890625, -0.002685546875, 0.0029754638671875, -0.01507568359375, -0.0142822265625, 0.0030364990234375, -0.00860595703125, -0.011962890625, -0.0299072265625, 0.01239013671875, -0.0035400390625, -0.0128173828125, 0.0037994384765625, 0.018310546875, -0.0105590...	[ 4764, 5303, 1295, 75973, 17368, 47246, 10752, 4867, 137158, 502, 15850, 13177, 1098, 683, 48672, 18468, 31611, 9433, 7612, 2182, 17198, 50828, 363, 759, 32032, 6493, 2646, 55292, 39, 13538, 7077, 154663, 33106, 309, 40383, 32166, 4288, 13307,...	[ 0.1920166015625, 0.2037353515625, 0.165283203125, 0.253173828125, 0.06494140625, 0.2529296875, 0.1558837890625, 0.2171630859375, 0.159912109375, 0.121826171875, 0.19189453125, 0.1475830078125, 0.04296875, 0.0771484375, 0.1234130859375, 0.110595703125, 0.009124755859375, 0.143188476...	embed
40821462_c0	40821462	prolog	0	Title: Why doesn't it unify? Prolog issue Problem title: Why doesn't it unify? Prolog issue Tags: prolog, polynomials Problem: Why doesn't it unify? Prolog issue I'm trying to do a predicate in prolog which substitute the value I give to the variables of the polynomial and then it calculate the result. Here i...	Why doesn't it unify? Prolog issue Why doesn't it unify? Prolog issue prolog polynomials Why Prolog as_monomial Vars compress_monomial ordina_m List Sorted ordina_var compress_monomial2 is_monomial VPs is_list is_polynomial Monomio Poly1 Result as_polynomial Result1 compress_polynomial compress_polynomial2 po...	[ -0.01348876953125, -0.0033721923828125, 0.025390625, 0.00124359130859375, 0.00811767578125, 0.0045166015625, -0.0032958984375, -0.0196533203125, 0.0194091796875, -0.01318359375, 0.0101318359375, 0.0198974609375, -0.0015869140625, -0.0194091796875, -0.0054931640625, 0.0037078857421875, ...	[ 44084, 22027, 3768, 18, 442, 51, 40383, 1250, 4867, 31089, 502, 35874, 1687, 15403, 237, 64176, 266, 3323, 375, 11856, 289, 23335, 39, 32036, 53666, 1961, 304, 83, 41195, 6562, 135545, 77879, 35883, 63306, 418, 126684, 1405, 2667, 310, 47...	[ 0.0994873046875, 0.080810546875, 0.0064697265625, 0.09576416015625, 0.060394287109375, 0.1453857421875, 0.1968994140625, 0.1341552734375, 0.2281494140625, 0.10211181640625, 0.09600830078125, 0.1595458984375, 0.1112060546875, 0.09423828125, 0.05877685546875, 0.069580078125, 0.06677246...	embed
54071696_c0	54071696	prolog	0	Title: Prolog maze problem : code gives infinite paths from start to end and doesn't backtrack Problem title: Prolog maze problem : code gives infinite paths from start to end and doesn't backtrack Tags: maze, prolog Problem: Prolog maze problem : code gives infinite paths from start to end and doesn't backtr...	Prolog maze problem : code gives infinite paths from start to end and doesn't backtrack Prolog maze problem : code gives infinite paths from start to end and doesn't backtrack maze prolog start Prolog Dest Row0 Col0 Row1 Col1 Path next_move Rnew Cnew is_available Ret Prolog maze problem : code gives infinite ...	[ 0.0224609375, 0.005279541015625, 0.01251220703125, 0.0074462890625, -0.0020599365234375, 0.00994873046875, 0.00640869140625, 0.006439208984375, 0.0174560546875, -0.047119140625, 0.013671875, 0.0296630859375, 0.002532958984375, -0.003814697265625, 0.02490234375, 0.0125732421875, 0.007...	[ 1250, 4867, 291, 731, 2967, 18151, 76199, 54241, 60875, 7, 4034, 3564, 22027, 3768, 18, 4420, 125728, 13, 502, 262, 271, 96190, 108421, 11737, 432, 54936, 5528, 379, 47131, 1295, 86869, 214, 11675, 1528, 127877, 26785, 5117, 1733, 51776, ...	[ 0.1693115234375, 0.2333984375, 0.10009765625, 0.1778564453125, 0.1734619140625, 0.1328125, 0.0814208984375, 0.1138916015625, 0.1822509765625, 0.013580322265625, 0.04595947265625, 0.10675048828125, 0.045013427734375, 0.003509521484375, 0.056884765625, 0.1162109375, 0.1802978515625, ...	embed
23071799_c0	23071799	prolog	0	Title: Prolog: Swap first and last elements in list Problem title: Prolog: Swap first and last elements in list Tags: dcg, prolog Problem: Prolog: Swap first and last elements in list I'm trying to write a program that swaps the 1st and last elements. The function takes 2 parameters. A list and a variable that's displa...	Prolog: Swap first and last elements in list Prolog: Swap first and last elements in list dcg prolog Prolog Swap GET HEAD LAST TAIL ELEM REMOVED ELEMENT NEW_LASTELEMENT WILL NEWHEAD CUT END OFF REST Prolog: Swap first and last elements in list I'm trying to write a program that swaps the 1st and last elements. The func...	[ 0.019775390625, 0.0196533203125, 0.01263427734375, 0.005615234375, -0.0198974609375, 0.006988525390625, -0.0257568359375, 0.002593994140625, 0.0135498046875, 0.004669189453125, 0.00726318359375, 0, -0.021484375, 0.000865936279296875, 0.01324462890625, 0.0008087158203125, 0.0109863281...	[ 1250, 4867, 43062, 254, 5117, 136, 4568, 80854, 5303, 104, 238, 177, 502, 79794, 572, 188328, 172905, 12998, 16444, 241, 100191, 9069, 12013, 9780, 124661, 80111, 46705, 98395, 33827, 57912, 841, 313, 17632, 39015, 111031, 21828, 23, 31577, ...	[ 0.156982421875, 0.21875, 0.2144775390625, 0.0941162109375, 0.1494140625, 0.1124267578125, 0.231201171875, 0.2109375, 0.2039794921875, 0.006591796875, 0.008819580078125, 0.06640625, 0.1229248046875, 0.041351318359375, 0.0718994140625, 0.1588134765625, 0.1553955078125, 0.135620117187...	embed
38371779_c0	38371779	prolog	0	Title: How to print out a limited number of searches in Prolog Problem title: How to print out a limited number of searches in Prolog Tags: prolog Problem: How to print out a limited number of searches in Prolog I have following data: item(one, 50, 40). item(two, 80, 70). item(three, 100, 55). item(four, 50, 45). item(...	How to print out a limited number of searches in Prolog How to print out a limited number of searches in Prolog prolog How Prolog head2 nth0 Item How to print out a limited number of searches in Prolog I have following data: I use following command to display all values: However, it displays all items. This can be a pr...	[ 0.00689697265625, 0.0103759765625, 0.01025390625, -0.005035400390625, 0.00421142578125, 0.0003261566162109375, -0.005767822265625, -0.007232666015625, 0.0076904296875, -0.0233154296875, 0.01336669921875, -0.0272216796875, 0.0164794921875, 0.001617431640625, 0.0296630859375, 0.000240325...	[ 11249, 28412, 1810, 84046, 14012, 33938, 90, 1250, 4867, 502, 10336, 304, 927, 2389, 78426, 23, 25632, 2053, 75101, 44116, 756, 142424, 33306, 55769, 831, 2967, 75281, 6044, 112820, 138, 36917, 111607, 5584, 100, 51347, 26040, 541, 36998, 6...	[ 0.041595458984375, 0.1953125, 0.1412353515625, 0.2110595703125, 0.152587890625, 0.2264404296875, 0.13232421875, 0.178955078125, 0.25244140625, 0.1270751953125, 0.1348876953125, 0.07110595703125, 0.100341796875, 0.07818603515625, 0.1275634765625, 0.048370361328125, 0.021759033203125, ...	embed
60699241_c1	60699241	prolog	1	station('OC',[bakerloo,central,victoria]).%Oxford Circus on the Bakerloo, Central and Victoria Lines station('PA',[bakerloo]).%Paddington on the Bakerloo Line station('TC',[central,northern]).%Tottenham Court Road on the Central and Northern Lines station('VI',[victoria]).%Victoria on the Victoria Line station('WA',[b...	station('OC',[bakerloo,central,victoria]).%Oxford Circus on the Bakerloo, Central and Victoria Lines station('PA',[bakerloo]).%Paddington on the Bakerloo Line station('TC',[central,northern]).%Tottenham Court Road on the Central and Northern Lines station('VI',[victoria]).%Victoria on the Victoria Line station('WA',[b...	[ -0.00054931640625, -0.00811767578125, 0.016357421875, 0.028076171875, 0.01025390625, -0.008544921875, 0.00157928466796875, -0.0028533935546875, 0.01171875, -0.044189453125, -0.0189208984375, 0.000732421875, -0.024658203125, -0.00823974609375, -0.0033416748046875, -0.006103515625, 0.0...	[ 29398, 132, 25, 29065, 4, 10075, 56, 47673, 58905, 21605, 13333, 268, 194, 3949, 205061, 79512, 223, 98, 70, 133840, 15881, 136, 31485, 16777, 7, 12236, 113954, 71, 42562, 20499, 13665, 9319, 19, 7763, 12216, 3915, 52341, 17119, 182688, 1...	[ 0.258056640625, 0.0185699462890625, 0.049591064453125, 0.210205078125, 0.015350341796875, 0.1053466796875, 0.120361328125, 0.228271484375, 0.1331787109375, 0.089599609375, 0.1756591796875, 0.00341796875, 0.06201171875, 0.0673828125, 0.22607421875, 0.19482421875, 0.16015625, 0.08282...	embed
70705978_c0	70705978	prolog	0	Title: Using NOT in Pytholog Problem title: Using NOT in Pytholog Tags: logic, python, prolog Problem: Using NOT in Pytholog I recently fell in love with Prolog when introduced to Symbolic A.I. I think that if Python can combine with Prolog, I can be able to make A.I. understand things. I found the library "Pytholog", ...	Using NOT in Pytholog Using NOT in Pytholog logic python prolog pytholog Using NOT medicine_bash pl.KnowledgeBase new_med peptic_ulcer should_not_take Person Drug Precondition should_take suffers_from Symptom medicine_bash.query pl.Expr Using NOT in Pytholog I recently fell in love with Prolog when introduced to Symbol...	[ 0.00823974609375, 0.01239013671875, 0.015869140625, 0.025390625, -0.00634765625, 0.003997802734375, 0.0093994140625, 0.00238037109375, -0.015625, -0.047607421875, -0.0062255859375, 0.00531005859375, -0.0036773681640625, 0.004669189453125, 0.0035552978515625, -0.00274658203125, 0.0103...	[ 345, 86725, 23, 27512, 927, 14071, 62775, 17198, 50828, 502, 4867, 54411, 87109, 6456, 35613, 181606, 63473, 3525, 4806, 280, 112569, 202, 3443, 5608, 10869, 78219, 15270, 125183, 1914, 126940, 134729, 149450, 19279, 10287, 77736, 5161, 1250, ...	[ 0.111083984375, 0.306884765625, 0.06396484375, 0.1475830078125, 0.1295166015625, 0.2491455078125, 0.1630859375, 0.093017578125, 0.11865234375, 0.09014892578125, 0.209716796875, 0.188720703125, 0.1199951171875, 0.008544921875, 0.02069091796875, 0.042327880859375, 0.0965576171875, 0....	embed
23188384_c0	23188384	prolog	0	Title: How to find list of shortest length from an infinite set (Prolog) Problem title: How to find list of shortest length from an infinite set (Prolog) Tags: iterative-deepening, prolog, shortest-path Problem: How to find list of shortest length from an infinite set (Prolog) I have a Prolog function path(A,B,Path) th...	How to find list of shortest length from an infinite set (Prolog) How to find list of shortest length from an infinite set (Prolog) iterative-deepening prolog shortest-path an How Prolog Path MinPath How to find list of shortest length from an infinite set (Prolog) I have a Prolog function path(A,B,Path) that yields al...	[ 0.0238037109375, -0.00634765625, 0.02587890625, -0.0030059814453125, 0.006744384765625, -0.006561279296875, 0.023193359375, -0.0162353515625, 0.023681640625, -0.0556640625, 0.007080078125, 0.0089111328125, 0.005218505859375, 0.0004215240478515625, 0.0035247802734375, 0.0211181640625, ...	[ 11249, 7413, 5303, 111, 16610, 525, 140909, 1295, 54241, 13, 5423, 10752, 4867, 720, 45023, 123041, 33, 502, 128405, 1250, 108421, 4211, 683, 10519, 32354, 60875, 571, 11180, 19388, 35604, 45443, 62, 47, 335, 140992, 33342, 1884, 139392, 20...	[ 0.034912109375, 0.1190185546875, 0.1937255859375, 0.03741455078125, 0.2244873046875, 0.1807861328125, 0.195068359375, 0.08367919921875, 0.1431884765625, 0.061004638671875, 0.1805419921875, 0.13427734375, 0.217529296875, 0.08038330078125, 0.039154052734375, 0.036376953125, 0.026565551...	embed
67672961_c0	67672961	prolog	0	Title: How to get a specific value from a database? Problem title: How to get a specific value from a database? Tags: prolog Problem: How to get a specific value from a database? I want to get the weight of an user who is saved on usersData usersData([]). :-dynamic usersData/1. buildUser(Id, Name, Age, Weight, Height, ...	How to get a specific value from a database? How to get a specific value from a database? prolog a How Name Age Weight Height Plan Training User Data What Current NewWeight Press Enter System.out.println You How to get a specific value from a database? I want to get the weight of an user who is saved on usersData and c...	[ 0.01043701171875, 0.00750732421875, -0.00390625, 0.0179443359375, -0.00396728515625, 0.03662109375, -0.0128173828125, 0.00689697265625, 0.00148773193359375, -0.035888671875, -0.000637054443359375, 0.010986328125, -0.0203857421875, -0.041015625, 0.010498046875, -0.009033203125, 0.0378...	[ 11249, 47, 2046, 10, 29458, 34292, 1295, 63399, 502, 4867, 15757, 72944, 150533, 1529, 22553, 5586, 44284, 53400, 11809, 4865, 114063, 2356, 12137, 21072, 60816, 12353, 6056, 35662, 2583, 3444, 57888, 38937, 57, 4126, 72095, 137989, 69101, 43...	[ 0.1182861328125, 0.0953369140625, 0.1942138671875, 0.0745849609375, 0.262939453125, 0.248779296875, 0.1673583984375, 0.259521484375, 0.087890625, 0.1263427734375, 0.042694091796875, 0.0694580078125, 0.2161865234375, 0.0709228515625, 0.145751953125, 0.12109375, 0.1221923828125, 0.09...	embed
2044643_c0	2044643	prolog	0	Title: Prolog Arguments are not sufficiently instantiated Problem title: Prolog Arguments are not sufficiently instantiated Tags: prolog, instantiation-error Problem: Prolog Arguments are not sufficiently instantiated I'm trying to match a subset of the facts I'm creating, and my testcase was working great! x([1,2,3,4]...	Prolog Arguments are not sufficiently instantiated Prolog Arguments are not sufficiently instantiated prolog instantiation-error Prolog Arguments bleah2 bleah8 bleah3 bleah5 bleah6 Output REST ERROR Exception _G260 Execution Aborted _G270 Prolog Arguments are not sufficiently instantiated I'm trying to match a subset o...	[ 0.0174560546875, 0.016845703125, 0.00104522705078125, -0.005615234375, -0.0037841796875, 0.00958251953125, -0.00384521484375, -0.000949859619140625, 0.031494140625, 0.023681640625, 0.0296630859375, 0.008056640625, -0.011474609375, -0.010986328125, 0.00927734375, -0.01055908203125, 0....	[ 1250, 4867, 112140, 7, 959, 129980, 538, 34648, 14, 502, 188800, 2586, 1366, 304, 1019, 363, 758, 910, 13538, 627, 21828, 151206, 24638, 5443, 63928, 724, 97544, 211603, 3422, 3674, 104283, 27686, 31577, 14858, 1614, 3509, 15824, 105233, 75...	[ 0.1669921875, 0.240234375, 0.244384765625, 0.03363037109375, 0.10107421875, 0.1708984375, 0.04400634765625, 0.154052734375, 0.129150390625, 0.1396484375, 0.1705322265625, 0.129150390625, 0.05224609375, 0.06689453125, 0.1217041015625, 0.04522705078125, 0.05712890625, 0.0474548339843...	embed
15083028_c0	15083028	prolog	0	Title: Is there an automatic parallel prolog implementation? Problem title: Is there an automatic parallel prolog implementation? Tags: concurrency, parallel-processing, prolog, multithreading, logic Problem: Is there an automatic parallel prolog implementation? I'm currently doing some research in theoretical computer...	Is there an automatic parallel prolog implementation? Is there an automatic parallel prolog implementation? concurrency parallel-processing prolog multithreading logic Is there an automatic parallel prolog implementation? I'm currently doing some research in theoretical computer science, and one of the main tools I'm u...	[ 0.0218505859375, 0.01904296875, 0.01214599609375, -0.0037384033203125, -0.0277099609375, 0.01544189453125, 0.0035400390625, -0.01318359375, -0.009033203125, -0.061767578125, -0.0032501220703125, 0.025390625, -0.0115966796875, -0.002899169921875, 0.008056640625, 0.005950927734375, 0.0...	[ 2071, 2685, 142, 101038, 95103, 502, 4867, 208124, 108636, 982, 63923, 3869, 65847, 62775, 25188, 4524, 41664, 5201, 72977, 17368, 106480, 3535, 32562, 4552, 63773, 109921, 2837, 66187, 75161, 55042, 50930, 33938, 20949, 5792, 72803, 12921, 468...	[ 0.035919189453125, 0.0753173828125, 0.06549072265625, 0.267578125, 0.285888671875, 0.197265625, 0.255859375, 0.2327880859375, 0.1097412109375, 0.06182861328125, 0.05419921875, 0.05438232421875, 0.09271240234375, 0.0845947265625, 0.051788330078125, 0.00701904296875, 0.0215911865234375...	embed
51846556_c1	51846556	prolog	1	argument is a list of operations and the second list is a list of shapes. It recursively goes over the list of operations getting the shape ids on both sides of the operation. eg circle 1 - below - sqaure 1 and sends the two shapes to the correct function to calculate the locations using CLPFD. For two shapes with a r...	argument is a list of operations and the second list is a list of shapes. It recursively goes over the list of operations getting the shape ids on both sides of the operation. eg circle 1 - below - sqaure 1 and sends the two shapes to the correct function to calculate the locations using CLPFD. For two shapes with a r...	[ -0.009765625, 0.00823974609375, -0.00970458984375, 0.028076171875, -0.00775146484375, 0.0196533203125, 0.005859375, 0.00933837890625, 0.0289306640625, 0.01470947265625, 0.01507568359375, 0.003509521484375, 0.0147705078125, -0.0179443359375, 0.0003204345703125, 0.0003299713134765625, ...	[ 10750, 83, 5303, 41018, 7, 17932, 10, 111, 115700, 1650, 195625, 5844, 645, 20949, 3447, 98, 15044, 5609, 42154, 133, 106, 35064, 5498, 3408, 25379, 6626, 47, 70, 26785, 32354, 74481, 67, 31913, 17368, 46323, 41265, 397, 35845, 19069, 214...	[ 0.38232421875, 0.10400390625, 0.2384033203125, 0.202392578125, 0.07373046875, 0.1666259765625, 0.00482177734375, 0.005340576171875, 0.2484130859375, 0.0130615234375, 0.08038330078125, 0.01904296875, 0.0545654296875, 0.056427001953125, 0.1602783203125, 0.0003662109375, 0.0634765625, ...	embed
43528158_c1	43528158	prolog	1	:- verify(eats_meat), !. carnivore :- verify(has_pointed_teeth), verify(has_claws), verify(has_forward_eyes). ungulate :- mammal, verify(has_hooves), !. ungulate :- mammal, verify(chews_cud). /* how to ask questions */ ask(Question) :- write('Does the animal have the following attribute: '), write(Question), write('? ...	:- verify(eats_meat), !. carnivore :- verify(has_pointed_teeth), verify(has_claws), verify(has_forward_eyes). ungulate :- mammal, verify(has_hooves), !. ungulate :- mammal, verify(chews_cud). /* how to ask questions */ ask(Question) :- write('Does the animal have the following attribute: '), write(Question), write('? ...	[ 0.0106201171875, 0.0302734375, -0.004058837890625, 0.02392578125, -0.004119873046875, 0.006195068359375, 0.01190185546875, 0.013427734375, -0.004608154296875, -0.0162353515625, 0.020263671875, 0.00933837890625, -0.00921630859375, -0.01177978515625, 0.0230712890625, 0.009033203125, 0....	[ 15772, 493, 40383, 13, 9821, 282, 257, 711, 2258, 93, 104297, 10557, 38496, 67, 12421, 18347, 19725, 2472, 19364, 31463, 127728, 19309, 21968, 141, 68336, 3132, 1430, 1010, 71, 3642, 26458, 17582, 195136, 33022, 8331, 90, 70, 26249, 765, ...	[ 0.09844970703125, 0.2025146484375, 0.2464599609375, 0.0950927734375, 0.1103515625, 0.1077880859375, 0.074951171875, 0.048004150390625, 0.084228515625, 0.08251953125, 0.1912841796875, 0.1146240234375, 0.149658203125, 0.09124755859375, 0.1400146484375, 0.126708984375, 0.08349609375, ...	embed
53934948_c1	53934948	prolog	1	, Place], % because entities 1468, 1052, 1069 are Places [ relationship(wasIn, id_0, 1468), relationship(wasIn, id_0, 1052), relationship(wasIn, id_0, 1069)] ], [ [id_0, wasIn, Some Other Subject Label], [relationship(wasIn, id_0, ...), ...] ], [ [1468, wasIn, Place], [relationship(wasIn, 1468, ...), ...] ], ... ] and ...	, Place], % because entities 1468, 1052, 1069 are Places [ relationship(wasIn, id_0, 1468), relationship(wasIn, id_0, 1052), relationship(wasIn, id_0, 1069)] ], [ [id_0, wasIn, Some Other Subject Label], [relationship(wasIn, id_0, ...), ...] ], [ [1468, wasIn, Place], [relationship(wasIn, 1468, ...), ...] ], ... ] and ...	[ -0.007354736328125, -0.000568389892578125, 0.003814697265625, 0.00396728515625, -0.0169677734375, -0.00244140625, 0.00023365020751953125, -0.0021820068359375, 0.017333984375, -0.041015625, -0.020751953125, 0.013427734375, -0.01177978515625, -0.037353515625, 0.0036163330078125, 0.018676...	[ 4, 41076, 1745, 6637, 77630, 2449, 616, 16028, 209, 12744, 14212, 621, 7, 76755, 13689, 4153, 3447, 2389, 90419, 69622, 84772, 532, 509, 64511, 94341, 129214, 57860, 157041, 5036, 145755, 47, 21115, 390, 28368, 136, 10644, 4734, 25627, 1717...	[ 0.00201416015625, 0.233642578125, 0.1275634765625, 0.0740966796875, 0.1844482421875, 0.087890625, 0.157958984375, 0.27685546875, 0.1170654296875, 0.2489013671875, 0.2587890625, 0.0634765625, 0.10272216796875, 0.2147216796875, 0.135986328125, 0.2266845703125, 0.05596923828125, 0.115...	embed
37648917_c0	37648917	prolog	0	Title: Prolog- nested if and else replacement Problem title: Prolog- nested if and else replacement Tags: prolog Problem: Prolog- nested if and else replacement I have a grid which it's size(N,M) and my goal is to find the first cells that are in the same row and column example: if i have a cell in the middle of the bo...	Prolog- nested if and else replacement Prolog- nested if and else replacement prolog Prolog Y-1 X-1 Assign in_grid neighbor1 Prolog- nested if and else replacement I have a grid which it's size(N,M) and my goal is to find the first cells that are in the same row and column example: if i have a cell in the middle of the...	[ -0.00775146484375, 0.0093994140625, 0.020263671875, 0.004486083984375, 0.01007080078125, -0.00982666015625, -0.002227783203125, 0.0322265625, 0.003387451171875, 0.00139617919921875, 0.00762939453125, 0.00518798828125, -0.0179443359375, 0.005767822265625, 0.011474609375, 0.00439453125, ...	[ 1250, 4867, 8512, 71, 2174, 136, 37076, 91995, 9, 502, 990, 5759, 1193, 1301, 31304, 23, 120067, 208244, 418, 13267, 839, 594, 69236, 7413, 5117, 38750, 7, 621, 5701, 15555, 3365, 316, 27781, 86991, 45443, 22759, 10932, 156634, 79259, 979...	[ 0.169677734375, 0.2442626953125, 0.263671875, 0.1488037109375, 0.209716796875, 0.166748046875, 0.2086181640625, 0.1763916015625, 0.0089111328125, 0.11279296875, 0.0716552734375, 0.07073974609375, 0.0140533447265625, 0.00616455078125, 0.1859130859375, 0.156494140625, 0.251220703125, ...	embed
65180949_c1	65180949	prolog	1	] L = [[1, 2, 2], [2, 2, 3], [2, 3, 2], [3, 2, 2], [2, 2, 4], [2, 4, 2], [4, 2, 2], [2, 2, 3]] I checked all my predicates and they all seem to work (at least for the test cases I'm using), the problem occurs with the check predicate. It seems to work fine until it gets to N>=P (when this is NOT true, works fine when i...	] L = [[1, 2, 2], [2, 2, 3], [2, 3, 2], [3, 2, 2], [2, 2, 4], [2, 4, 2], [4, 2, 2], [2, 2, 3]] I checked all my predicates and they all seem to work (at least for the test cases I'm using), the problem occurs with the check predicate. It seems to work fine until it gets to N>=P (when this is NOT true, works fine when i...	[ -0.005340576171875, 0.0023956298828125, 0.0054931640625, -0.0146484375, -0.0150146484375, 0.01611328125, 0.0017242431640625, -0.006378173828125, 0.01202392578125, -0.020751953125, 0.0174560546875, 0.021728515625, 0.0023651123046875, 0.000461578369140625, -0.004791259765625, 0.011291503...	[ 339, 2203, 418, 116, 304, 138, 122101, 201, 617, 12765, 756, 759, 1653, 2063, 1636, 48903, 4488, 19713, 3034, 50218, 17368, 2967, 74918, 67, 37202, 5885, 24189, 62163, 47, 541, 2740, 1369, 683, 86725, 29568, 43240, 41206, 1528, 11737, 137...	[ 0.1890869140625, 0.09222412109375, 0.02978515625, 0.07513427734375, 0.038818359375, 0.10498046875, 0.0141448974609375, 0.079345703125, 0.059539794921875, 0.266845703125, 0.039825439453125, 0.033782958984375, 0.1827392578125, 0.2132568359375, 0.0693359375, 0.04730224609375, 0.11193847...	embed
54688982_c1	54688982	prolog	1	new Query("consult", new Term[]{new Atom("/home/mark/Documents/JavaProjects/SudokuSolver/src/com/company/sudoku.pl")}); System.out.println("consult " + (q0.hasSolution() ? "succeeded" : "failed")); // Query q1 = new Query("problem(1, Rows), sudoku(Rows)."); Query q1 = new Query("sudoku", rowsTerm); System.out.println(...	new Query("consult", new Term[]{new Atom("/home/mark/Documents/JavaProjects/SudokuSolver/src/com/company/sudoku.pl")}); System.out.println("consult " + (q0.hasSolution() ? "succeeded" : "failed")); // Query q1 = new Query("problem(1, Rows), sudoku(Rows)."); Query q1 = new Query("sudoku", rowsTerm); System.out.println(...	[ 0.0198974609375, 0.027099609375, 0.00799560546875, 0.020751953125, -0.02197265625, -0.0196533203125, 0.0034332275390625, -0.0023345947265625, 0.003692626953125, -0.0311279296875, 0.0002899169921875, -0.005523681640625, -0.002777099609375, -0.017578125, -0.0245361328125, 0.0181884765625...	[ 3525, 58836, 53, 147834, 2994, 39, 54936, 69728, 29552, 10015, 239469, 7, 156202, 223353, 294, 11547, 319, 102588, 814, 19437, 277, 146365, 2424, 3142, 12353, 6056, 35662, 19, 997, 864, 2389, 10557, 34, 16, 705, 1159, 39884, 297, 58, 1205...	[ 0.1160888671875, 0.208251953125, 0.1246337890625, 0.28076171875, 0.1417236328125, 0.07916259765625, 0.052154541015625, 0.1746826171875, 0.0294647216796875, 0.1317138671875, 0.0311431884765625, 0.042205810546875, 0.2025146484375, 0.135498046875, 0.0592041015625, 0.1658935546875, 0.215...	embed
26484974_c0	26484974	prolog	0	Title: How to compare user input with rules and facts? Problem title: How to compare user input with rules and facts? Tags: prolog Problem: How to compare user input with rules and facts? i want to build this solution: Prolog ask me for my preferred weather dates and show me the best match (not the exact match, depends...	How to compare user input with rules and facts? How to compare user input with rules and facts? prolog How Monday Tuesday Wednesday Ask Questions How to compare user input with rules and facts? i want to build this solution: Prolog ask me for my preferred weather dates and show me the best match (not the exact match, d...	[ 0.00148773193359375, -0.01080322265625, 0.01165771484375, 0.01806640625, -0.00372314453125, 0.007568359375, 0.0002002716064453125, 0.00689697265625, 0.006439208984375, -0.01220703125, 0.005950927734375, 0.0238037109375, -0.007049560546875, 0.010009765625, 0.0087890625, 0.00373840332031...	[ 11249, 47, 69101, 38937, 107730, 678, 91736, 136, 15824, 7, 502, 4867, 68318, 97001, 64227, 105219, 68185, 3444, 45367, 29806, 1250, 26458, 163, 759, 12601, 92949, 112474, 7639, 2965, 14858, 24763, 56566, 79385, 27781, 5303, 1884, 442, 8010, ...	[ 0.1156005859375, 0.06854248046875, 0.240966796875, 0.188720703125, 0.2396240234375, 0.146484375, 0.197509765625, 0.1077880859375, 0.209228515625, 0.045074462890625, 0.1456298828125, 0.2386474609375, 0.1190185546875, 0.1240234375, 0.1556396484375, 0.1510009765625, 0.197998046875, 0....	embed
76183029_c0	76183029	prolog	0	Title: Do Prolog variables within 'nested' predicates co-refer? Problem title: Do Prolog variables within 'nested' predicates co-refer? Tags: prolog, variables Problem: Do Prolog variables within 'nested' predicates co-refer? In the following code, I have two occurrences of the 'state' predicate wit...	Do Prolog variables within 'nested' predicates co-refer? Do Prolog variables within 'nested' predicates co-refer? prolog variables Prolog can_do Photographer_location Camera_location Holding_camera_or_not CameraState Last_place_photographed Place Do Prolog variables within 'nested' predicates co-ref...	[ -0.0111083984375, 0.01263427734375, -0.0076904296875, 0.0091552734375, -0.0150146484375, 0.021240234375, -0.0048828125, -0.00933837890625, 0.0167236328125, -0.034912109375, -0.00836181640625, 0.01397705078125, -0.00823974609375, 0.007171630859375, 0.00848388671875, -0.0042724609375, ...	[ 984, 1250, 4867, 77336, 7, 28032, 3768, 86, 14437, 1653, 2063, 1636, 552, 107, 2875, 502, 831, 246, 143965, 56, 87632, 44813, 73436, 124999, 748, 10869, 135206, 21672, 23935, 57595, 41382, 41076, 9, 18151, 6626, 74918, 61340, 67, 70731, 4...	[ 0.06475830078125, 0.174560546875, 0.265869140625, 0.2646484375, 0.0183868408203125, 0.1468505859375, 0.0958251953125, 0.16064453125, 0.187255859375, 0.164306640625, 0.1873779296875, 0.0775146484375, 0.166259765625, 0.1104736328125, 0.20849609375, 0.1434326171875, 0.135009765625, 0....	embed
6709488_c0	6709488	prolog	0	Title: prolog programming there is someone? Problem title: prolog programming there is someone? Tags: prolog Problem: prolog programming there is someone? maintaining a variable sorry for my English this is my code stampa_diagnosi(X) :- gia_chiesto(S, 'si'), sintomo(S, M), not(sintomo(S, X)), M \= X, nl, write('Una pos...	prolog programming there is someone? prolog programming there is someone? prolog stampa_diagnosi gia_chiesto Una Possibile cura1 cura2 cura3 centaurea_minore prolog programming there is someone? maintaining a variable sorry for my English this is my code how do I maintain the value of X of diagnosis that is lost when I...	[ 0.0174560546875, 0.0096435546875, 0.0054931640625, 0.02392578125, -0.0001220703125, 0.00726318359375, 0.002532958984375, 0.01251220703125, 0.014892578125, -0.039306640625, 0.0245361328125, -0.0152587890625, -0.012939453125, -0.016357421875, 0.0224609375, 0.025146484375, 0.02807617187...	[ 502, 4867, 56037, 449, 2685, 83, 22008, 58176, 47099, 14, 3529, 1861, 32296, 4228, 115861, 5462, 13943, 418, 304, 363, 21126, 916, 1283, 1249, 4524, 76104, 214, 77336, 59090, 14941, 18151, 3642, 54, 34292, 111, 1193, 164, 72856, 26458, 96...	[ 0.1552734375, 0.23291015625, 0.17724609375, 0.1287841796875, 0.1436767578125, 0.1156005859375, 0.1748046875, 0.190673828125, 0.161865234375, 0.042083740234375, 0.0872802734375, 0.0643310546875, 0.096923828125, 0.054534912109375, 0.115478515625, 0.0926513671875, 0.1376953125, 0.0001...	embed
69740530_c0	69740530	prolog	0	Title: Replacing elements in matrix in prolog Problem title: Replacing elements in matrix in prolog Tags: prolog, matrix Problem: Replacing elements in matrix in prolog I am new to prolog and I'm trying to create a specific matrix. What I already have: a matrix filled with all 0-s a list of pairs of number, for expl. [...	Replacing elements in matrix in prolog Replacing elements in matrix in prolog prolog matrix Replacing RowId ColumnId Value ResultMx ListOfPairs ResMx I-J Tail Res Res1 Res2 Replacing elements in matrix in prolog I am new to prolog and I'm trying to create a specific matrix. What I already have: a matrix filled with all...	[ -0.01397705078125, 0.01177978515625, 0.016357421875, -0.0123291015625, -0.006866455078125, -0.00016880035400390625, -0.033447265625, 0.01708984375, 0.01361083984375, -0.005126953125, 0.0087890625, 0.0211181640625, -0.0020294189453125, -0.035888671875, 0.007720947265625, 0.0009765625, ...	[ 853, 133266, 80854, 23, 50944, 425, 502, 4867, 96190, 568, 71, 233987, 190060, 126684, 594, 32036, 132887, 8335, 481, 9624, 87, 9, 1375, 1218, 379, 418, 304, 3525, 31577, 28282, 21771, 765, 152382, 756, 757, 5303, 80836, 14012, 115727, 10...	[ 0.0828857421875, 0.173095703125, 0.207763671875, 0.043792724609375, 0.2086181640625, 0.112060546875, 0.173583984375, 0.23583984375, 0.1571044921875, 0.07257080078125, 0.062744140625, 0.1353759765625, 0.1341552734375, 0.1605224609375, 0.036712646484375, 0.0767822265625, 0.0947265625, ...	embed
51009766_c0	51009766	prolog	0	Title: How to use if statement - loops Problem title: How to use if statement - loops Tags: prolog, loops Problem: How to use if statement - loops i am trying to understand how to use if statement or loops in prolog but i can't get it,cause there are a bunch of different situations.Example in java if you want to say so...	How to use if statement - loops How to use if statement - loops prolog loops How List1 List2 How to use if statement - loops i am trying to understand how to use if statement or loops in prolog but i can't get it,cause there are a bunch of different situations.Example in java if you want to say something you could say ...	[ 0.021728515625, -0.004638671875, -0.0128173828125, 0.0186767578125, 0.003082275390625, 0.02490234375, 0.0035400390625, 0.0218505859375, 0.01104736328125, 0.00506591796875, -0.003509521484375, -0.0224609375, -0.0137939453125, 0.0076904296875, 0.00970458984375, 0.0033416748046875, 0.01...	[ 11249, 47, 4527, 2174, 63805, 20, 40956, 7, 502, 4867, 32036, 418, 304, 28219, 3642, 23, 831, 2046, 12921, 113949, 11, 79, 330, 3444, 5154, 5809, 72546, 425, 2740, 107947, 37076, 54, 204610, 24189, 29557, 5941, 37348, 34735, 81979, 106, ...	[ 0.072021484375, 0.01055908203125, 0.16943359375, 0.231201171875, 0.25927734375, 0.046356201171875, 0.2205810546875, 0.07147216796875, 0.147216796875, 0.211669921875, 0.1260986328125, 0.05755615234375, 0.1123046875, 0.039093017578125, 0.013885498046875, 0.015716552734375, 0.0324401855...	embed
22851732_c0	22851732	prolog	0	Title: Optimal planning with incrementally tabled abductive logic programming Problem title: Optimal planning with incrementally tabled abductive logic programming Tags: prolog-tabling, prolog Problem: Optimal planning with incrementally tabled abductive logic programming I'd like to use abductive logic programming to ...	Optimal planning with incrementally tabled abductive logic programming Optimal planning with incrementally tabled abductive logic programming prolog-tabling prolog Optimal Optimal planning with incrementally tabled abductive logic programming I'd like to use abductive logic programming to find optimal plans. Exhaustive...	[ 0.013427734375, -0.002044677734375, -0.004058837890625, -0.006683349609375, -0.02392578125, 0.015380859375, 0.024169921875, -0.01318359375, -0.003997802734375, 0.0026092529296875, 0.00024127960205078125, 0.0164794921875, -0.02490234375, -0.01556396484375, -0.00135040283203125, 0.007324...	[ 43938, 289, 58136, 678, 145322, 12097, 23180, 71, 1563, 39367, 4935, 62775, 56037, 502, 4867, 102, 79298, 1884, 4527, 449, 7413, 24087, 38627, 18391, 157318, 32628, 2806, 566, 14170, 12989, 214, 764, 62210, 23335, 11814, 33636, 15824, 64330, ...	[ 0.1761474609375, 0.0228118896484375, 0.20166015625, 0.06085205078125, 0.220947265625, 0.0582275390625, 0.2354736328125, 0.074462890625, 0.1568603515625, 0.177490234375, 0.129638671875, 0.1866455078125, 0.1817626953125, 0.130615234375, 0.218505859375, 0.1630859375, 0.17236328125, 0....	embed
20848439_c0	20848439	prolog	0	Title: prolog:search in binary search tree Problem title: prolog:search in binary search tree Tags: prolog Problem: prolog:search in binary search tree i need to covert list to binary search tree ,then search about range of ages in this tree and return the a list contain these values, and also return number of checks i...	prolog:search in binary search tree prolog:search in binary search tree prolog prolog:search my_list Root _R1 _R2 Age Name prolog:search in binary search tree i need to covert list to binary search tree ,then search about range of ages in this tree and return the a list contain these values, and also return number of c...	[ 0.007049560546875, 0.0101318359375, 0.006256103515625, 0.0089111328125, -0.000040531158447265625, 0.0186767578125, -0.0247802734375, 0.019775390625, 0.00933837890625, -0.0341796875, 0.0087890625, -0.00102996826171875, 0.0087890625, 0.01708984375, 0.0380859375, -0.0028076171875, 0.027...	[ 502, 4867, 86250, 23, 2394, 6635, 33938, 53201, 12, 759, 6562, 150948, 1052, 418, 304, 72944, 15757, 3871, 29256, 18, 5303, 47, 1672, 37457, 10, 4188, 30646, 70541, 142424, 14012, 12765, 45367, 140992, 47445, 31577, 11343, 98320, 4568, 1815...	[ 0.138916015625, 0.2037353515625, 0.1962890625, 0.03839111328125, 0.148681640625, 0.125, 0.1785888671875, 0.214111328125, 0.00872802734375, 0.110107421875, 0.1796875, 0.178466796875, 0.006622314453125, 0.01727294921875, 0.036285400390625, 0.14599609375, 0.000640869140625, 0.07055664...	embed
16367580_c1	16367580	prolog	1	Y1), abs(Y1 - Y) =< 1, \+ (X, Y) = (X1, Y1). get_configuration([], _, _, _, []). get_configuration([Head\|Tail], Used, Rows, Columns, [(Head, Neighbour)\|Tail2]) :- neighbour(Head, Rows, Columns, Neighbour), \+ member(Neighbour, Used), append(Used, [Neighbour], Used2), get_configuration(Tail, Used2, Rows, Columns, Tail2...	Y1), abs(Y1 - Y) =< 1, \+ (X, Y) = (X1, Y1). get_configuration([], _, _, _, []). get_configuration([Head\|Tail], Used, Rows, Columns, [(Head, Neighbour)\|Tail2]) :- neighbour(Head, Rows, Columns, Neighbour), \+ member(Neighbour, Used), append(Used, [Neighbour], Used2), get_configuration(Tail, Used2, Rows, Columns, Tail2...	[ -0.006500244140625, 0.007781982421875, 0.022216796875, -0.0252685546875, 0.004638671875, -0.01220703125, 0.01055908203125, 0.003173828125, 0.038330078125, -0.0150146484375, -0.0216064453125, 0.023193359375, -0.017578125, -0.005767822265625, -0.00518798828125, -0.00250244140625, 0.003...	[ 990, 17727, 43719, 132, 1723, 418, 20, 2203, 16093, 106, 1328, 1542, 5, 2046, 153837, 34, 194, 30494, 13025, 712, 9874, 379, 345, 5281, 96190, 233987, 6958, 38648, 90173, 15772, 108, 32786, 114689, 1062, 1218, 9226, 108210, 132887, 10625, ...	[ 0.192138671875, 0.1434326171875, 0.221435546875, 0.0298004150390625, 0.1722412109375, 0.1063232421875, 0.0765380859375, 0.058837890625, 0.1402587890625, 0.0599365234375, 0.1502685546875, 0.093017578125, 0.02288818359375, 0.10394287109375, 0.165771484375, 0.088623046875, 0.01147460937...	embed
53622733_c0	53622733	prolog	0	Title: Prolog trying values until they are correct and then return them Problem title: Prolog trying values until they are correct and then return them Tags: prolog Problem: Prolog trying values until they are correct and then return them I am trying to do a rule in Prolog , where I check if it fits, if it does not, I ...	Prolog trying values until they are correct and then return them Prolog trying values until they are correct and then return them prolog Prolog make_it_fit does_it_fit Nums Check find_new Prolog trying values until they are correct and then return them I am trying to do a rule in Prolog , where I check if it fits, if i...	[ 0.001953125, 0.0014190673828125, -0.00020885467529296875, 0.004608154296875, -0.00159454345703125, 0.024169921875, -0.0186767578125, -0.002105712890625, 0.02783203125, -0.0096435546875, -0.0052490234375, -0.004486083984375, 0.0113525390625, 0.009765625, 0.0283203125, -0.006500244140625...	[ 1250, 4867, 31577, 142424, 24189, 26785, 30646, 502, 3249, 217, 16086, 14602, 52782, 38679, 7413, 54936, 79986, 12765, 2174, 11177, 959, 51312, 13438, 2967, 1810, 101935, 7440, 9790, 7311, 24765, 5701, 8781, 45646, 8110, 47143, 3229, 11782, 6...	[ 0.1767578125, 0.24169921875, 0.142333984375, 0.1494140625, 0.08154296875, 0.144775390625, 0.155517578125, 0.128173828125, 0.081787109375, 0.1727294921875, 0.26220703125, 0.0936279296875, 0.1063232421875, 0.121337890625, 0.08111572265625, 0.087890625, 0.184326171875, 0.14404296875, ...	embed
64443700_c0	64443700	prolog	0	Title: How to get data from library(persistency) in SWI-Prolog? Problem title: How to get data from library(persistency) in SWI-Prolog? Tags: swi-prolog, prolog Problem: How to get data from library(persistency) in SWI-Prolog? I have this module: :- module(data_db, [ attach_data_db/1, % +File current_user_role/2, % ?Us...	How to get data from library(persistency) in SWI-Prolog? How to get data from library(persistency) in SWI-Prolog? swi-prolog prolog library How SWI-Prolog data_db attach_data_db File current_user_role User Role add_user set_user_role use_module user_role name:atom role:oneof db_attach Name with_mutex assert_user_role r...	[ 0.019775390625, 0.011962890625, 0.0096435546875, 0.01251220703125, -0.00921630859375, 0.00909423828125, 0.0120849609375, 0.01531982421875, -0.0002307891845703125, -0.0703125, 0.0211181640625, 0.0093994140625, -0.030029296875, -0.006439208984375, 0.0228271484375, -0.00537109375, 0.000...	[ 11249, 2046, 2053, 1295, 35773, 1294, 21777, 6892, 2408, 159, 38969, 9, 10752, 4867, 23, 2452, 3454, 502, 48073, 243, 934, 10135, 42724, 43581, 65918, 516, 53400, 2777, 15190, 5423, 83279, 38937, 5928, 31486, 40041, 257, 52438, 561, 24371, ...	[ 0.05548095703125, 0.142578125, 0.18505859375, 0.1676025390625, 0.2255859375, 0.15234375, 0.140869140625, 0.1939697265625, 0.1405029296875, 0.06585693359375, 0.2403564453125, 0.001708984375, 0.1409912109375, 0.1939697265625, 0.024139404296875, 0.16748046875, 0.10595703125, 0.0947265...	embed
29113339_c1	29113339	prolog	1	_,_), write('choose room'),nl, read(Room), room(Room,_), %%assertz(lecture(GroupName,Subject)). asserta(lecture(TeachersName,TeachersGroup,TeachSubject,Period,Room)). my problem is that I want it that 'Paul' will only be able to teach AI to 'Bsc4' and only able to teach 'Games_dev' to 'Bsc1'. So in this case if I were ...	_,_), write('choose room'),nl, read(Room), room(Room,_), %%assertz(lecture(GroupName,Subject)). asserta(lecture(TeachersName,TeachersGroup,TeachSubject,Period,Room)). my problem is that I want it that 'Paul' will only be able to teach AI to 'Bsc4' and only able to teach 'Games_dev' to 'Bsc1'. So in this case if I were ...	[ -0.005279541015625, 0.021240234375, 0.00176239013671875, -0.005645751953125, -0.0233154296875, 0.0196533203125, -0.0206298828125, 0.00531005859375, 0.0003070831298828125, -0.001190185546875, 0.004547119140625, -0.00003933906555175781, 0.008544921875, -0.01116943359375, -0.005096435546875...	[ 33022, 3089, 8364, 17155, 13169, 12301, 12724, 306, 33657, 169, 8996, 6644, 205072, 163612, 110965, 10476, 934, 2967, 3444, 115043, 4734, 19048, 94957, 38730, 47, 10382, 617, 107576, 18548, 571, 418, 107730, 95486, 10208, 67, 9351, 335, 21115...	[ 0.081298828125, 0.08123779296875, 0.0980224609375, 0.2471923828125, 0.0438232421875, 0.1092529296875, 0.183349609375, 0.144775390625, 0.011444091796875, 0.019439697265625, 0.08453369140625, 0.059783935546875, 0.0823974609375, 0.060760498046875, 0.133056640625, 0.0280914306640625, 0.1...	embed
29993566_c0	29993566	prolog	0	Title: Is there a way or an algorithm to convert DCG into normal definite clauses in Prolog? Problem title: Is there a way or an algorithm to convert DCG into normal definite clauses in Prolog? Tags: algorithm, prolog, dcg, grammar, parsing Problem: Is there a way or an algorithm to convert DCG into normal definite cla...	Is there a way or an algorithm to convert DCG into normal definite clauses in Prolog? Is there a way or an algorithm to convert DCG into normal definite clauses in Prolog? algorithm prolog dcg grammar parsing DCG Prolog Is there a way or an algorithm to convert DCG into normal definite clauses in Prolog? I am a newbie ...	[ 0.0020294189453125, 0.0150146484375, 0.00408935546875, 0.0233154296875, 0.01214599609375, 0.0196533203125, -0.0296630859375, -0.007720947265625, -0.00299072265625, -0.031982421875, -0.02294921875, -0.0079345703125, -0.0194091796875, -0.00064849853515625, -0.00457763671875, 0.0055847167...	[ 3917, 234873, 96760, 391, 56367, 3934, 3638, 71496, 13, 70731, 90, 1250, 4867, 23, 502, 104, 238, 177, 122092, 147, 366, 9014, 28219, 3900, 143, 1295, 217064, 110, 22062, 102, 49086, 101087, 21373, 21816, 165523, 59911, 103510, 91736, 13228...	[ 0.0885009765625, 0.226806640625, 0.1719970703125, 0.1268310546875, 0.236572265625, 0.0814208984375, 0.162841796875, 0.1942138671875, 0.0927734375, 0.19921875, 0.0802001953125, 0.1529541015625, 0.2392578125, 0.0291900634765625, 0.09149169921875, 0.061767578125, 0.05780029296875, 0.1...	embed
58985392_c0	58985392	prolog	0	Title: How can I return a number in prolog? Problem title: How can I return a number in prolog? Tags: integer, predicate, prolog, recursion, return Problem: How can I return a number in prolog? I Have a very simple prolog program(I'm still learning) where I have a knowledge base that specifies you can take the bike to ...	How can I return a number in prolog? How can I return a number in prolog? integer predicate prolog recursion return How route_by_bike How can I return a number in prolog? I Have a very simple prolog program(I'm still learning) where I have a knowledge base that specifies you can take the bike to your destination or you...	[ 0.017822265625, 0.00016307830810546875, 0.007537841796875, 0.03173828125, -0.005889892578125, -0.0023193359375, -0.01153564453125, 0.00052642822265625, 0.0106201171875, -0.07568359375, -0.004730224609375, -0.006988525390625, -0.040771484375, 0.0052490234375, 0.01416015625, 0.0047607421...	[ 11249, 831, 87, 30646, 10, 14012, 23, 502, 4867, 892, 1505, 1653, 2063, 67, 195625, 1830, 36439, 1272, 60142, 8781, 1528, 7464, 52080, 51359, 3647, 58735, 5646, 15528, 78869, 35691, 69236, 3714, 738, 1295, 876, 678, 122395, 26458, 2685, 4...	[ 0.13037109375, 0.1143798828125, 0.059814453125, 0.272216796875, 0.048187255859375, 0.253662109375, 0.1124267578125, 0.216552734375, 0.26708984375, 0.1318359375, 0.08349609375, 0.1363525390625, 0.1639404296875, 0.06622314453125, 0.1990966796875, 0.06549072265625, 0.2198486328125, 0....	embed
79249342_c0	79249342	prolog	0	Title: How to express "not" in Prolog DCG without using a cut Problem title: How to express "not" in Prolog DCG without using a cut Tags: dcg, prolog Problem: How to express "not" in Prolog DCG without using a cut I'm working on a Prolog DCG parser to tokenize a string into specific patterns. My goa...	How to express "not" in Prolog DCG without using a cut How to express "not" in Prolog DCG without using a cut dcg prolog a How Prolog DCG Number Token Rest not_token Codes Tokens Incorrect How to express "not" in Prolog DCG without using a cut I'm working on a Prolog DCG parser to tokenize a string ...	[ 0.001190185546875, 0.01177978515625, 0.0238037109375, 0.01092529296875, -0.00811767578125, 0.01507568359375, -0.007415771484375, -0.016845703125, 0.0021209716796875, -0.0269775390625, -0.028076171875, -0.0015869140625, -0.0133056640625, -0.003997802734375, 0.0213623046875, 0.0186767578...	[ 11249, 36510, 10869, 1230, 41502, 1250, 4867, 391, 56367, 15490, 17368, 59226, 23, 177, 502, 103332, 717, 1098, 49756, 959, 6448, 33, 28864, 84694, 32399, 20697, 366, 2189, 47, 79315, 29458, 103510, 69236, 184, 1884, 16690, 18444, 26278, 54...	[ 0.02935791015625, 0.160888671875, 0.2607421875, 0.00445556640625, 0.021575927734375, 0.1370849609375, 0.203125, 0.081298828125, 0.1754150390625, 0.09417724609375, 0.0404052734375, 0.1715087890625, 0.03582763671875, 0.0638427734375, 0.07342529296875, 0.10498046875, 0.06298828125, 0....	embed
37326510_c0	37326510	prolog	0	Title: How to check if element is not in a list, if it isn't, insert it Problem title: How to check if element is not in a list, if it isn't, insert it Tags: prolog Problem: How to check if element is not in a list, if it isn't, insert it I want, given a list formed by A-B elements ([a-b,b-c,c-d]), check if s...	How to check if element is not in a list, if it isn't, insert it How to check if element is not in a list, if it isn't, insert it prolog How EnumNodes EnumArcs How to check if element is not in a list, if it isn't, insert it I want, given a list formed by A-B elements ([a-b,b-c,c-d]), check if some given elem...	[ -0.013427734375, 0.00043487548828125, 0.00074005126953125, 0.0169677734375, -0.023681640625, 0.0303955078125, -0.008544921875, -0.00689697265625, 0.006866455078125, -0.00946044921875, 0.01104736328125, -0.0185546875, 0.0159912109375, 0.006561279296875, -0.004547119140625, 0.00091171264...	[ 11249, 47, 12765, 2174, 12830, 83, 959, 23, 10, 5303, 56112, 3768, 18, 183540, 442, 502, 4867, 357, 316, 5021, 988, 7614, 4439, 3444, 34475, 100, 62, 9, 571, 80854, 21771, 30646, 15190, 284, 140992, 14373, 162, 35166, 28219, 291, 51592,...	[ 0.06878662109375, 0.02099609375, 0.2396240234375, 0.1436767578125, 0.238525390625, 0.1429443359375, 0.240234375, 0.1986083984375, 0.058258056640625, 0.214111328125, 0.1673583984375, 0.045684814453125, 0.16064453125, 0.25537109375, 0.04925537109375, 0.07940673828125, 0.1077880859375, ...	embed
24402587_c0	24402587	prolog	0	Title: How do I code rec/3 in the presence of a meta_predicate declaration? Problem title: How do I code rec/3 in the presence of a meta_predicate declaration? Tags: prolog, meta-predicate, swi-prolog, module Problem: How do I code rec/3 in the presence of a meta_predicate declaration? I have the following code which w...	How do I code rec/3 in the presence of a meta_predicate declaration? How do I code rec/3 in the presence of a meta_predicate declaration? prolog meta-predicate swi-prolog module How meta_predicate use_module N-1 How do I code rec/3 in the presence of a meta_predicate declaration? I have the following code which works f...	[ -0.01092529296875, 0.00799560546875, 0.010498046875, 0.006683349609375, -0.00494384765625, 0.01141357421875, 0.01202392578125, 0.020263671875, 0.010009765625, -0.04638671875, 0.01116943359375, -0.004669189453125, -0.03271484375, -0.0267333984375, 0.0205078125, -0.01220703125, 0.00347...	[ 11249, 18151, 21954, 18113, 169424, 23550, 19714, 2063, 67, 21635, 23, 502, 4867, 2452, 3454, 88996, 4527, 83279, 541, 5759, 25632, 43240, 5885, 15490, 61924, 1653, 29479, 77546, 80596, 195625, 5490, 166577, 6626, 91582, 11814, 66044, 39457, ...	[ 0.0552978515625, 0.2271728515625, 0.1988525390625, 0.292724609375, 0.1351318359375, 0.21630859375, 0.1695556640625, 0.1514892578125, 0.07232666015625, 0.1707763671875, 0.00091552734375, 0.07012939453125, 0.1534423828125, 0.108154296875, 0.0689697265625, 0.1265869140625, 0.08215332031...	embed
75145822_c1	75145822	prolog	1	:- day_constraint(10, e, D), maplist(rest_if_not_work, D). day_constraint(Min, Element, Lst) :- employees_num(EmpsNum), list_has_ge_elements_being(Min, Element, EmpsNum, Lst). two_days(D1, D2) :- % Set the full number of employees, otherwise prevent_double_shift can shorten the list employees_num(EmpsNum), length(D1, ...	:- day_constraint(10, e, D), maplist(rest_if_not_work, D). day_constraint(Min, Element, Lst) :- employees_num(EmpsNum), list_has_ge_elements_being(Min, Element, EmpsNum, Lst). two_days(D1, D2) :- % Set the full number of employees, otherwise prevent_double_shift can shorten the list employees_num(EmpsNum), length(D1, ...	[ 0.006011962890625, -0.0157470703125, 0.002410888671875, 0.03173828125, -0.00885009765625, 0.01129150390625, -0.02734375, 0.002777099609375, 0.0031890869140625, -0.0006866455078125, -0.006866455078125, 0.031494140625, 0.00408935546875, 0.020263671875, -0.01300048828125, 0.0228271484375,...	[ 15772, 5155, 454, 2271, 2816, 4288, 90980, 28, 391, 247, 22288, 6562, 56644, 3190, 10869, 18244, 194, 59076, 48325, 339, 271, 93215, 2606, 134332, 7, 839, 316, 5303, 10557, 429, 62766, 31678, 6626, 5636, 397, 418, 10461, 1745, 19943, 4393...	[ 0.152587890625, 0.211669921875, 0.023040771484375, 0.1494140625, 0.2259521484375, 0.1868896484375, 0.1331787109375, 0.1104736328125, 0.104248046875, 0.0362548828125, 0.1212158203125, 0.191650390625, 0.1544189453125, 0.09832763671875, 0.1241455078125, 0.1558837890625, 0.0889892578125,...	embed
24457149_c0	24457149	prolog	0	Title: Collecting Items and Counting the Number of Occurrences Problem title: Collecting Items and Counting the Number of Occurrences Tags: prolog, failure-slice Problem: Collecting Items and Counting the Number of Occurrences I am trying to write a recursive rule collCount/2 which groups identical items in a list with...	Collecting Items and Counting the Number of Occurrences Collecting Items and Counting the Number of Occurrences prolog failure-slice Collecting Items Counting Number Occurrences Rest Ans Num Collecting Items and Counting the Number of Occurrences I am trying to write a recursive rule collCount/2 which groups identical ...	[ 0.00494384765625, 0.002655029296875, 0.0004329681396484375, -0.00194549560546875, 0.01507568359375, 0.007781982421875, -0.0147705078125, -0.01263427734375, 0.015625, -0.02294921875, -0.0010986328125, -0.01318359375, 0.0177001953125, 0.027099609375, 0.0177001953125, -0.006317138671875, ...	[ 138521, 214, 78426, 1311, 128396, 103332, 180, 238, 64240, 69098, 502, 4867, 137578, 13348, 49756, 893, 52782, 136, 31577, 33022, 195625, 5844, 79986, 122907, 108210, 12477, 94407, 31943, 55769, 5303, 107013, 101935, 74918, 42, 3934, 370, 99726...	[ 0.22705078125, 0.02032470703125, 0.1951904296875, 0.1285400390625, 0.15771484375, 0.1142578125, 0.104248046875, 0.100341796875, 0.22265625, 0.07781982421875, 0.085205078125, 0.2071533203125, 0.192626953125, 0.1053466796875, 0.115966796875, 0.030731201171875, 0.1373291015625, 0.0017...	embed
28727834_c0	28727834	prolog	0	Title: Prolog logical task Problem title: Prolog logical task Tags: prolog, visual-prolog Problem: Prolog logical task There is a logical problem: four friends: Ivan, Petr, Mikhail, Sergey spent their time in different ways: two were playing chess, one read books, one watched TV. Find who does what if Sergey does not p...	Prolog logical task Prolog logical task prolog visual-prolog Prolog PREDICATES CLAUSES GOAL Solutions Prolog logical task There is a logical problem: four friends: Ivan, Petr, Mikhail, Sergey spent their time in different ways: two were playing chess, one read books, one watched TV. Find who does what if Sergey does no...	[ -0.0010528564453125, 0.01336669921875, 0.017333984375, 0.0291748046875, -0.001953125, -0.017333984375, -0.035888671875, 0.02490234375, -0.006011962890625, -0.03173828125, 0.00958251953125, 0.00958251953125, -0.00823974609375, -0.002288818359375, 0.00408935546875, 0.0184326171875, 0.0...	[ 1250, 4867, 62775, 289, 66211, 502, 21176, 3454, 134366, 30941, 129636, 78441, 25052, 7842, 109339, 2967, 22759, 23902, 23698, 4, 35007, 1208, 11395, 379, 184865, 66933, 2363, 1733, 12921, 48322, 6626, 3542, 75169, 290, 1632, 12301, 42840, 19...	[ 0.138671875, 0.2315673828125, 0.18359375, 0.1126708984375, 0.18310546875, 0.090087890625, 0.1512451171875, 0.0748291015625, 0.126953125, 0.1256103515625, 0.0494384765625, 0.04022216796875, 0.10516357421875, 0.0858154296875, 0.1236572265625, 0.1827392578125, 0.2127685546875, 0.24157...	embed
26938380_c0	26938380	prolog	0	Title: Prolog program: another way to define a functor Problem title: Prolog program: another way to define a functor Tags: prolog, prolog-cut Problem: Prolog program: another way to define a functor In my last exam I had to write a Prolog predicate called double/2 , according to the following instructions: double(X, Y...	Prolog program: another way to define a functor Prolog program: another way to define a functor prolog prolog-cut Prolog Prolog program: another way to define a functor In my last exam I had to write a Prolog predicate called double/2 , according to the following instructions: double(X, Y) should be true if Y is a list...	[ 0.0235595703125, 0.0208740234375, 0.0211181640625, -0.003662109375, 0.025390625, 0.038818359375, -0.032470703125, 0.0004119873046875, 0.01300048828125, -0.026123046875, 0.006317138671875, -0.005828857421875, -0.0228271484375, -0.027099609375, 0.0096435546875, 0.0230712890625, 0.00227...	[ 1250, 4867, 1528, 15700, 3917, 61924, 7477, 18770, 502, 19774, 47, 4568, 42276, 1902, 33022, 1653, 2063, 67, 35839, 41929, 12477, 167934, 132, 1542, 4, 990, 5608, 29568, 2174, 5303, 892, 26255, 5701, 140909, 1193, 11907, 3853, 14012, 91995,...	[ 0.183837890625, 0.231689453125, 0.20068359375, 0.107666015625, 0.07733154296875, 0.222412109375, 0.2330322265625, 0.1968994140625, 0.1475830078125, 0.1947021484375, 0.0054931640625, 0.1162109375, 0.1661376953125, 0.013916015625, 0.1424560546875, 0.173828125, 0.187744140625, 0.06591...	embed
47485614_c0	47485614	prolog	0	Title: toAncestor predicate in SWI-Prolog Problem title: toAncestor predicate in SWI-Prolog Tags: prolog, ancestor Problem: toAncestor predicate in SWI-Prolog Example 1st: predicate: belongs(X,[X\|_]). belongs(X,[_\|Ytail]):-belongs(X,Ytail). Check: belongs(a,[x,c,a,b]). Recursion: 1st step: belongs(a,[c,a,b]). 2nd step ...	toAncestor predicate in SWI-Prolog toAncestor predicate in SWI-Prolog prolog ancestor SWI-Prolog Ytail _4644 Call Exit _4916 _5108 toAncestor predicate in SWI-Prolog Example 1st: predicate: Check: belongs(a,[x,c,a,b]). Recursion: 1st step: 2nd step returns true and here SWI-Prolog ends It cuts the head. In the 1st step...	[ 0.00775146484375, 0.009521484375, 0.00531005859375, 0.0145263671875, -0.0137939453125, 0.000904083251953125, -0.00238037109375, 0.0078125, 0.0033721923828125, -0.031005859375, 0.01513671875, 0.007049560546875, 0.0106201171875, 0.00872802734375, 0.01556396484375, -0.0341796875, 0.0159...	[ 47, 284, 3956, 20820, 1653, 2063, 67, 159, 38969, 9, 10752, 4867, 23, 502, 60502, 1290, 990, 46741, 160775, 617, 26265, 5443, 217, 12977, 2485, 758, 69139, 89536, 271, 38679, 10617, 165428, 42, 106, 29954, 30646, 29568, 3564, 314, 933, ...	[ 0.2291259765625, 0.062408447265625, 0.1688232421875, 0.213134765625, 0.194580078125, 0.2257080078125, 0.07470703125, 0.0782470703125, 0.2281494140625, 0.01275634765625, 0.15234375, 0.191650390625, 0.0018310546875, 0.133056640625, 0.1888427734375, 0.1414794921875, 0.07861328125, 0.1...	embed
39711616_c1	39711616	prolog	1	1. poly_red([0], [0]). poly_red(Poly, Out) :- mult_GCD(Poly, GCD), scal_div(Poly, GCD, Out). poly_sub(Poly,[],Poly) :- Poly = [_\|_]. poly_sub([],Poly,Poly). poly_sub([P1_head\|P1_rest], [P2_head\|P2_rest], [PSub_head\|PSub_rest]) :- PSub_head is P1_head-P2_head, poly_sub(P1_rest, P2_rest, PSub_rest). scal_prod([],_Sc,[])...	1. poly_red([0], [0]). poly_red(Poly, Out) :- mult_GCD(Poly, GCD), scal_div(Poly, GCD, Out). poly_sub(Poly,[],Poly) :- Poly = [_\|_]. poly_sub([],Poly,Poly). poly_sub([P1_head\|P1_rest], [P2_head\|P2_rest], [PSub_head\|PSub_rest]) :- PSub_head is P1_head-P2_head, poly_sub(P1_rest, P2_rest, PSub_rest). scal_prod([],_Sc,[])...	[ -0.00982666015625, 0.00872802734375, 0.0186767578125, 0.001251220703125, 0.004608154296875, 0.0174560546875, -0.011962890625, -0.010009765625, 0.0128173828125, -0.0140380859375, 0.0234375, -0.000347137451171875, -0.007080078125, 0.00028228759765625, 0.006561279296875, -0.0076904296875,...	[ 615, 35874, 454, 2822, 2389, 4, 147352, 194, 7192, 538, 13538, 15772, 3869, 724, 16069, 527, 117906, 30618, 22144, 63306, 2203, 58745, 683, 418, 31251, 56644, 304, 9059, 5829, 436, 96472, 83, 112348, 61278, 238, 10752, 1250, 71, 248, 316,...	[ 0.1553955078125, 0.258544921875, 0.07147216796875, 0.23974609375, 0.12548828125, 0.0243377685546875, 0.1158447265625, 0.0748291015625, 0.1572265625, 0.2353515625, 0.263671875, 0.108154296875, 0.2061767578125, 0.032379150390625, 0.1717529296875, 0.005523681640625, 0.183349609375, 0....	embed
72745291_c0	72745291	prolog	0	Title: Problems on simple Prolog planning question Problem title: Problems on simple Prolog planning question Tags: prolog Problem: Problems on simple Prolog planning question I have recently encountered a question written by Hector J. Levesque in his book Thinking as computation : I have written some code in response ...	Problems on simple Prolog planning question Problems on simple Prolog planning question prolog Problems Prolog initial_state goal_state legal_move LocFox LocHen LocGrain LocCart Loc Loc1 go_alone LocNew Problems on simple Prolog planning question I have recently encountered a question written by Hector J. Levesque in h...	[ -0.00738525390625, 0.005859375, 0.0057373046875, 0.0211181640625, -0.019775390625, 0.014404296875, -0.01165771484375, -0.01519775390625, 0.0230712890625, -0.047607421875, -0.0033416748046875, 0.0181884765625, -0.0115966796875, 0.0142822265625, -0.00555419921875, 0.0125732421875, 0.00...	[ 15649, 7, 8781, 1250, 4867, 58136, 9655, 502, 61475, 61340, 69236, 8437, 432, 88784, 27591, 425, 841, 33, 37878, 21851, 418, 738, 51684, 46568, 190647, 59121, 1529, 18770, 821, 46736, 105397, 12877, 87062, 214, 237, 181135, 18151, 57553, 13...	[ 0.20263671875, 0.013763427734375, 0.184814453125, 0.181640625, 0.279052734375, 0.2347412109375, 0.1722412109375, 0.1339111328125, 0.076904296875, 0.102783203125, 0.1878662109375, 0.1478271484375, 0.1407470703125, 0.1158447265625, 0.1602783203125, 0.032470703125, 0.08990478515625, 0...	embed
47046061_c1	47046061	prolog	1	/cg/root/3832463/main.pg:5: warning: singleton variables [Peter,Mark] for parent/2 /home/cg/root/3832463/main.pg:7: warning: singleton variables [Zara,Anne] for parent/2 /home/cg/root/3832463/main.pg:8: warning: singleton variables [Zara,Mark] for parent/2 /home/cg/root/3832463/main.pg:11: warning: singleton variables ...	/cg/root/3832463/main.pg:5: warning: singleton variables [Peter,Mark] for parent/2 /home/cg/root/3832463/main.pg:7: warning: singleton variables [Zara,Anne] for parent/2 /home/cg/root/3832463/main.pg:8: warning: singleton variables [Zara,Mark] for parent/2 /home/cg/root/3832463/main.pg:11: warning: singleton variables ...	[ -0.0002689361572265625, 0.0208740234375, -0.00063323974609375, 0.00179290771484375, -0.0274658203125, 0.0220947265625, -0.0087890625, 0.00482177734375, 0.00555419921875, -0.0546875, -0.00872802734375, -0.00885009765625, 0.01055908203125, -0.0008392333984375, 0.0107421875, -0.0233154296...	[ 248, 177, 148920, 162982, 2357, 15748, 24931, 254, 758, 1631, 592, 12, 11001, 1507, 77336, 7, 128503, 4, 73484, 100, 49129, 12477, 29552, 966, 16737, 219, 7251, 86, 19993, 6766, 19077, 148233, 434, 5464, 3962, 22635, 429, 12221, 701, 2403...	[ 0.0032958984375, 0.07177734375, 0.18994140625, 0.1732177734375, 0.126220703125, 0.17529296875, 0.14599609375, 0.011322021484375, 0.1278076171875, 0.1746826171875, 0.102783203125, 0.00006103515625, 0.191650390625, 0.212646484375, 0.299560546875, 0.05224609375, 0.1856689453125, 0.022...	embed
13976733_c1	13976733	prolog	1	positive(does,eat_meat). it_is(carnivore):- positive(has,pointed_teeth), positive(has, claws), positive(has,forward_eyes). it_is(ungulate):- it_is(mammal), positive(has,hooves). it_is(ungulate):- it_is(mammal), positive(does,chew_cud). positive(X,Y):- xpositive(X,Y),!. positive(X,Y):- not(xnegative(X,Y)), ask(X,Y,yes)...	positive(does,eat_meat). it_is(carnivore):- positive(has,pointed_teeth), positive(has, claws), positive(has,forward_eyes). it_is(ungulate):- it_is(mammal), positive(has,hooves). it_is(ungulate):- it_is(mammal), positive(does,chew_cud). positive(X,Y):- xpositive(X,Y),!. positive(X,Y):- not(xnegative(X,Y)), ask(X,Y,yes)...	[ -0.0015716552734375, 0.00408935546875, 0.000804901123046875, 0.0244140625, -0.00396728515625, 0.0186767578125, 0.00634765625, 0.00836181640625, -0.0013885498046875, -0.052001953125, 0.01092529296875, 0.0223388671875, -0.01611328125, 0.00140380859375, 0.016357421875, -0.0024871826171875...	[ 24491, 246, 90, 13, 257, 282, 442, 454, 164, 3284, 93, 104297, 10557, 38496, 67, 12421, 26580, 19725, 2472, 19364, 31463, 51642, 19309, 19066, 2749, 68336, 3132, 1430, 1010, 1723, 1022, 67890, 38, 959, 3331, 26458, 63736, 40907, 33022, 15...	[ 0.2421875, 0.07366943359375, 0.0667724609375, 0.11669921875, 0.1331787109375, 0.122802734375, 0.213623046875, 0.001190185546875, 0.21728515625, 0.10400390625, 0.1136474609375, 0.1907958984375, 0.1268310546875, 0.1290283203125, 0.091552734375, 0.1337890625, 0.119384765625, 0.0613098...	embed
52973897_c0	52973897	prolog	0	Title: How to create anonymous variables from a string? Problem title: How to create anonymous variables from a string? Tags: prolog Problem: How to create anonymous variables from a string? I have defined a predicate find_word/2 that when given a list of letters (with some letters possibly ungrounded), produces possib...	How to create anonymous variables from a string? How to create anonymous variables from a string? prolog a How find_word Example LetterList Word atom_chars app_e How to create anonymous variables from a string? I have defined a predicate find_word/2 that when given a list of letters (with some letters possibly unground...	[ 0.002777099609375, -0.0028228759765625, -0.0059814453125, 0.0244140625, -0.0048828125, 0.0306396484375, 0.007659912109375, 0.00640869140625, -0.002410888671875, -0.033447265625, 0.00921630859375, -0.0123291015625, 0.002105712890625, 0.0028839111328125, 0.0022430419921875, 0.00677490234...	[ 11249, 28282, 52184, 10821, 77336, 7, 1295, 79315, 502, 4867, 7413, 47416, 89536, 105451, 154663, 22543, 34627, 9254, 4027, 13, 61924, 1653, 2063, 12477, 5303, 120820, 144681, 64330, 27489, 7722, 34153, 14858, 103510, 10756, 669, 3115, 814, 1...	[ 0.06439208984375, 0.169921875, 0.2200927734375, 0.1748046875, 0.2783203125, 0.086669921875, 0.124755859375, 0.242431640625, 0.0704345703125, 0.180419921875, 0.124267578125, 0.17138671875, 0.09197998046875, 0.08831787109375, 0.15185546875, 0.120361328125, 0.1585693359375, 0.16308593...	embed
67350966_c1	67350966	prolog	1	X, neg Y). components(X imp Y, neg X, Y). components(neg(X imp Y), X, neg Y). components(X revimp Y, X, neg Y). components(neg(X revimp Y), neg X, Y). components(X uparrow Y, neg X, neg Y). components(neg(X uparrow Y), X, Y). components(X downarrow Y,neg X, neg Y). components(neg(X downarrow Y), X, Y). components(X no...	X, neg Y). components(X imp Y, neg X, Y). components(neg(X imp Y), X, neg Y). components(X revimp Y, X, neg Y). components(neg(X revimp Y), neg X, Y). components(X uparrow Y, neg X, neg Y). components(neg(X uparrow Y), X, Y). components(X downarrow Y,neg X, neg Y). components(neg(X downarrow Y), X, Y). components(X no...	[ -0.01904296875, 0.00164031982421875, 0.01141357421875, 0.0130615234375, -0.0145263671875, 0.0260009765625, -0.003875732421875, -0.0000053942203521728516, 0.01507568359375, 0.00811767578125, -0.031494140625, -0.0028076171875, 0.0001678466796875, -0.021484375, 0.00628662109375, -0.009155...	[ 1193, 108, 177, 990, 82761, 1542, 21980, 86, 15226, 2676, 1257, 118201, 7565, 959, 64357, 7169, 686, 6, 60715, 334, 2837, 461, 8766, 158, 32149, 20537, 3181, 1723, 194, 18499, 87, 2046, 151206, 501, 223, 129083, 162, 133850, 4439, 46799, ...	[ 0.1522216796875, 0.1339111328125, 0.1468505859375, 0.197265625, 0.2060546875, 0.148193359375, 0.1722412109375, 0.097900390625, 0.09698486328125, 0.1600341796875, 0.04425048828125, 0.14990234375, 0.07061767578125, 0.0643310546875, 0.136474609375, 0.0845947265625, 0.0604248046875, 0....	embed
50078654_c0	50078654	prolog	0	Title: Pattern matching space character Problem title: Pattern matching space character Tags: prolog Problem: Pattern matching space character Here is my problem: etp(V W,[V W\|G]). etp(W V,[V W\|G]). etp(V W,[_\|G]):- etp(V W,G). Prolog says Syntax error: Operator expected . I tried to escape the blank symbol like '\s' ,...	Pattern matching space character Pattern matching space character prolog Pattern Syntax Operator read_line get_char atom_codes Tests EOF end_of_file char_code read_lines LLs Unexpected Pattern matching space character Here is my problem: Prolog says Syntax error: Operator expected . I tried to escape the blank symbol l...	[ -0.00909423828125, -0.0036773681640625, 0.0126953125, -0.003692626953125, -0.01708984375, 0.0018768310546875, 0.00775146484375, -0.003662109375, -0.000629425048828125, -0.01300048828125, 0.019775390625, 0.01055908203125, -0.03759765625, -0.026123046875, -0.0157470703125, 0.007690429687...	[ 9876, 22766, 14858, 214, 32628, 62816, 502, 4867, 19010, 86531, 150922, 12301, 2256, 9254, 34627, 40899, 8647, 82341, 3564, 4390, 29822, 21441, 59801, 99954, 83613, 13, 2967, 1250, 18499, 84751, 37842, 144281, 44237, 26582, 41872, 7, 97370, 4...	[ 0.1470947265625, 0.1107177734375, 0.22509765625, 0.0304718017578125, 0.191162109375, 0.171630859375, 0.09320068359375, 0.2000732421875, 0.079345703125, 0.176513671875, 0.23095703125, 0.141845703125, 0.1146240234375, 0.069580078125, 0.103759765625, 0.080322265625, 0.06494140625, 0.1...	embed
78644553_c0	78644553	prolog	0	Title: Comparing list of lists Problem title: Comparing list of lists Tags: constraints, prolog Problem: Comparing list of lists What I'm trying to do is given a list of lists like the one bellow: inicialState(e([5, 5, 5], [6, 5, 5])). I want to calculate the some of all the elements of one list and compare it to a cer...	Comparing list of lists Comparing list of lists constraints prolog Comparing Sum Rest Target Size List equal2 Comparing list of lists What I'm trying to do is given a list of lists like the one bellow: I want to calculate the some of all the elements of one list and compare it to a certain value, for that I want to ana...	[ -0.01129150390625, 0.0016632080078125, 0.01080322265625, 0.00848388671875, -0.0250244140625, 0.000797271728515625, -0.005523681640625, -0.0040283203125, 0.01361083984375, -0.00360107421875, 0.01953125, -0.0023956298828125, 0.0072021484375, 0.00836181640625, 0.005828857421875, -0.008789...	[ 113307, 214, 5303, 111, 7, 158, 2816, 4288, 502, 4867, 36335, 49756, 160017, 80378, 32036, 105950, 304, 31577, 34475, 41566, 3444, 47, 74481, 3060, 756, 80854, 1632, 69101, 34292, 7968, 36917, 1957, 190, 131815, 839, 28412, 882, 17647, 1197...	[ 0.2279052734375, 0.05645751953125, 0.2298583984375, 0.1094970703125, 0.0357666015625, 0.011962890625, 0.1314697265625, 0.07177734375, 0.1015625, 0.167724609375, 0.0946044921875, 0.1322021484375, 0.187744140625, 0.09234619140625, 0.1507568359375, 0.074462890625, 0.017059326171875, 0...	embed
41701805_c0	41701805	prolog	0	Title: List is empty out of the clause, isn't being modified - PROLOG Problem title: List is empty out of the clause, isn't being modified - PROLOG Tags: prolog Problem: List is empty out of the clause, isn't being modified - PROLOG I'm trying create a list of coordinate doing this: insert(X,L,[X\|L]). % L is ...	List is empty out of the clause, isn't being modified - PROLOG List is empty out of the clause, isn't being modified - PROLOG prolog List PROLOG Q-1 Done List is empty out of the clause, isn't being modified - PROLOG I'm trying create a list of coordinate doing this: When I print the list inside the clause, a...	[ 0.015625, 0.0022430419921875, 0.017333984375, 0.00787353515625, -0.0255126953125, -0.005523681640625, -0.00396728515625, -0.0086669921875, 0.00677490234375, -0.004180908203125, 0.00127410888671875, -0.004180908203125, -0.009765625, -0.044189453125, -0.003448486328125, 0.0189208984375, ...	[ 32036, 83, 201505, 1810, 111, 70731, 13, 56112, 3768, 18, 73197, 297, 10514, 47510, 502, 4867, 2396, 5759, 984, 86, 8035, 31577, 28282, 5303, 176866, 28412, 46132, 756, 80854, 2685, 8, 978, 1884, 110833, 18499, 110, 10422 ]	[ 0.226318359375, 0.05877685546875, 0.2105712890625, 0.1435546875, 0.1068115234375, 0.140625, 0.07623291015625, 0.052490234375, 0.013092041015625, 0.0743408203125, 0.1466064453125, 0.0313720703125, 0.1173095703125, 0.1771240234375, 0.089599609375, 0.155029296875, 0.038848876953125, 0...	embed
49411811_c0	49411811	prolog	0	Title: Sierpinski Carpet in Prolog Problem title: Sierpinski Carpet in Prolog Tags: prolog, recursion Problem: Sierpinski Carpet in Prolog Saw this problem here and since I am a prolog newbie, I tried formulating a solution unsuccesfully. Here's what I have managed to make of this so far: rewrite('X', [['X','X','X'],['...	Sierpinski Carpet in Prolog Sierpinski Carpet in Prolog prolog recursion Sierpinski Carpet Prolog CurrentList Result Temp Item Sierpinski Carpet in Prolog Saw this problem here and since I am a prolog newbie, I tried formulating a solution unsuccesfully. Here's what I have managed to make of this so far: Essentially, I...	[ -0.005950927734375, -0.004425048828125, 0.005462646484375, 0.0037384033203125, -0.0009918212890625, 0.0194091796875, 0.0023651123046875, 0.024658203125, 0.0150146484375, 0.007415771484375, 0.0166015625, -0.004669189453125, -0.0260009765625, -0.0172119140625, -0.012939453125, -0.0006523...	[ 727, 10681, 54871, 131947, 126, 1250, 4867, 23, 502, 195625, 1830, 114063, 154663, 126684, 37446, 78426, 2967, 9014, 29806, 226534, 179769, 9790, 71062, 5117, 12830, 75935, 96362, 14700, 66, 54397, 21954, 15824, 3687, 756, 80854, 47, 4568, 53...	[ 0.08074951171875, 0.1448974609375, 0.1964111328125, 0.196533203125, 0.143798828125, 0.134765625, 0.1810302734375, 0.037200927734375, 0.118408203125, 0.2393798828125, 0.0308380126953125, 0.1639404296875, 0.1519775390625, 0.1640625, 0.1756591796875, 0.16455078125, 0.0662841796875, 0....	embed
43220441_c1	43220441	prolog	1	PerMatch - 1, get_match_allocation(NumTeams, Remaining1, NewMatches, Matches). %recursively store/ add matches into allocation list store_allocation_1(_, []). store_allocation_1(T, [X \| MatchesTail]) :- assertz(match_table(T, X)), store_allocation_1(T, MatchesTail). %recursively store allocation from match list store_a...	PerMatch - 1, get_match_allocation(NumTeams, Remaining1, NewMatches, Matches). %recursively store/ add matches into allocation list store_allocation_1(_, []). store_allocation_1(T, [X \| MatchesTail]) :- assertz(match_table(T, X)), store_allocation_1(T, MatchesTail). %recursively store allocation from match list store_a...	[ 0.00069427490234375, 0.01007080078125, 0.0201416015625, 0.01068115234375, -0.02294921875, -0.0107421875, -0.0078125, 0.0126953125, 0.0294189453125, 0.028564453125, 0.0250244140625, 0.00098419189453125, 0.0198974609375, -0.00787353515625, 0.00119781494140625, 0.00157928466796875, 0.01...	[ 908, 79520, 206, 20, 106, 2046, 98753, 289, 87632, 316, 101409, 853, 192, 14653, 418, 2356, 17007, 67407, 1745, 48650, 5844, 538, 4343, 64, 15190, 14858, 144, 5303, 115187, 618, 1542, 9874, 379, 15772, 33657, 169, 22819, 1193, 12765, 756,...	[ 0.2093505859375, 0.259765625, 0.1566162109375, 0.034027099609375, 0.10113525390625, 0.1016845703125, 0.2548828125, 0.1217041015625, 0.190673828125, 0.091064453125, 0.2305908203125, 0.027679443359375, 0.09271240234375, 0.14697265625, 0.04913330078125, 0.0662841796875, 0.121826171875, ...	embed
61028457_c0	61028457	prolog	0	Title: An easier way to split a list at the N-th place in Prolog? Problem title: An easier way to split a list at the N-th place in Prolog? Tags: prolog, list Problem: An easier way to split a list at the N-th place in Prolog? Here is a predicate to split a list into: a "front list" Front the element at position N (0-b...	An easier way to split a list at the N-th place in Prolog? An easier way to split a list at the N-th place in Prolog? prolog list N-th Prolog Front Element Back split_list List Index N-1 begin_tests empty0 empty1 trivial1 trivial2 trivial3 long1 Llen Nmax Llen-1 end_tests run_tests PL-Unit All Elem An easier way to spl...	[ -0.01116943359375, 0.0216064453125, 0.00408935546875, -0.0238037109375, -0.025634765625, 0.0021514892578125, 0.002288818359375, 0.00872802734375, 0.0260009765625, -0.01483154296875, 0.0147705078125, 0.0017852783203125, -0.0174560546875, 0.0164794921875, 0.02685546875, -0.00811767578125...	[ 99156, 3917, 65450, 5303, 99, 541, 927, 3687, 1250, 4867, 9, 502, 43643, 48325, 26828, 6562, 32036, 31471, 5759, 9842, 6954, 201505, 1927, 686, 1977, 24084, 3564, 33106, 85600, 3164, 540, 195, 70, 1653, 2063, 67, 3934, 20549, 12830, 19069...	[ 0.153564453125, 0.05072021484375, 0.2342529296875, 0.22314453125, 0.05328369140625, 0.2344970703125, 0.1649169921875, 0.1290283203125, 0.1475830078125, 0.2144775390625, 0.02984619140625, 0.109375, 0.1492919921875, 0.161865234375, 0.1522216796875, 0.1552734375, 0.128173828125, 0.113...	embed
22789275_c0	22789275	prolog	0	Title: Why doesn't Prolog find a solution for 'Fox, goose and bag of beans puzzle' and shows 'true' instead? Problem title: Why doesn't Prolog find a solution for 'Fox, goose and bag of beans puzzle' and shows 'true' instead? Tags: river-crossing-puzzle, prolog Problem:...	Why doesn't Prolog find a solution for 'Fox, goose and bag of beans puzzle' and shows 'true' instead? Why doesn't Prolog find a solution for 'Fox, goose and bag of beans puzzle' and shows 'true' instead? river-crossing-puzzle prolog Why Prolog Fox Man Goose Beans Man1 M...	[ 0.01031494140625, 0.01068115234375, 0.0169677734375, 0.01153564453125, -0.01434326171875, 0.0225830078125, -0.0179443359375, -0.0322265625, 0.0111083984375, -0.008544921875, 0.0206298828125, 0.005706787109375, 0.007293701171875, 0.01544189453125, 0.0196533203125, 0.0101318359375, -0....	[ 44084, 22027, 3768, 18, 1250, 4867, 7413, 29806, 27591, 425, 738, 8364, 136, 6157, 186, 10133, 104192, 45831, 9774, 64457, 96113, 95665, 214, 1766, 13894, 502, 49049, 1572, 2016, 131806, 304, 98684, 50478, 2676, 53577, 70643, 13794, 154663, ...	[ 0.0987548828125, 0.05181884765625, 0.0548095703125, 0.0833740234375, 0.184326171875, 0.2271728515625, 0.10150146484375, 0.1878662109375, 0.138916015625, 0.1044921875, 0.0933837890625, 0.1485595703125, 0.095703125, 0.12109375, 0.11669921875, 0.1307373046875, 0.180908203125, 0.114868...	embed
31652482_c0	31652482	prolog	0	Title: A "Building" Riddle in Prolog Problem title: A "Building" Riddle in Prolog Tags: prolog, zebra-puzzle Problem: A "Building" Riddle in Prolog I'm trying to solve a riddle in Prolog. the riddle is: There are two buildings, each one has tree apartments (apartment per floor): one apartment of 3 r...	A "Building" Riddle in Prolog A "Building" Riddle in Prolog prolog zebra-puzzle Building Riddle Prolog building1 building2 R6-1 List1 List2 List3 List4 List5 Error Instantiation A "Building" Riddle in Prolog I'm trying to solve a riddle in Prolog. the riddle is: There are two buildings, each one has...	[ -0.004302978515625, 0.01806640625, -0.01446533203125, -0.01007080078125, 0.004150390625, 0.015625, -0.03662109375, 0.0169677734375, 0.005340576171875, -0.0235595703125, 0.008056640625, 0.00115966796875, -0.00189208984375, -0.0021209716796875, 0.00225830078125, 0.018310546875, -0.0079...	[ 62, 41502, 121137, 214, 41231, 19298, 23, 1250, 4867, 502, 116232, 1766, 13894, 104919, 33976, 418, 304, 627, 126188, 32036, 617, 758, 212059, 166945, 14, 31577, 86869, 31351, 6626, 12638, 1632, 53201, 127451, 17365, 74912, 138, 112875, 201, ...	[ 0.057891845703125, 0.008453369140625, 0.2169189453125, 0.149169921875, 0.1798095703125, 0.177490234375, 0.07525634765625, 0.188720703125, 0.2474365234375, 0.14599609375, 0.2039794921875, 0.06591796875, 0.0897216796875, 0.1939697265625, 0.2249755859375, 0.04541015625, 0.1163330078125,...	embed
76970136_c1	76970136	prolog	1	among possible values best_value([Value-_\|Rest], BestValue) :- best_value(Rest, Value, BestValue). best_value([], BestValue, BestValue). best_value([Value-_\|Rest], CurrentBest, BestValue) :- Value > CurrentBest, best_value(Rest, Value, BestValue). best_value([_\|Rest], CurrentBest, BestValue) :- best_value(Rest, Curren...	among possible values best_value([Value-_\|Rest], BestValue) :- best_value(Rest, Value, BestValue). best_value([], BestValue, BestValue). best_value([Value-_\|Rest], CurrentBest, BestValue) :- Value > CurrentBest, best_value(Rest, Value, BestValue). best_value([_\|Rest], CurrentBest, BestValue) :- best_value(Rest, Curren...	[ -0.01214599609375, -0.01373291015625, 0.0213623046875, 0.00494384765625, 0.0076904296875, 0.023681640625, -0.018310546875, -0.0274658203125, 0.0264892578125, 0.0146484375, -0.0001621246337890625, 0.039306640625, 0.004302978515625, -0.001556396484375, 0.00439453125, -0.009765625, 0.01...	[ 54940, 7722, 142424, 2965, 454, 27494, 13, 132, 856, 50770, 9, 58745, 1052, 525, 4, 11345, 15772, 190060, 114063, 110601, 194, 1745, 38679, 2174, 25813, 83, 35604, 432, 272, 135206, 57945, 22836, 106, 1031, 169033, 3249, 2356, 87377, 36457,...	[ 0.1724853515625, 0.2193603515625, 0.253662109375, 0.203125, 0.05194091796875, 0.290771484375, 0.0836181640625, 0.00286865234375, 0.2271728515625, 0.277099609375, 0.08489990234375, 0.0684814453125, 0.1116943359375, 0.1907958984375, 0.03350830078125, 0.2164306640625, 0.1329345703125, ...	embed
22568157_c0	22568157	prolog	0	Title: How do I deal with one predicate with multiple answers? Problem title: How do I deal with one predicate with multiple answers? Tags: prolog Problem: How do I deal with one predicate with multiple answers? Let's say I have a predicate which looks to see if someone has a sister. Then there are - in my opinion - tw...	How do I deal with one predicate with multiple answers? How do I deal with one predicate with multiple answers? prolog How display_sisters sisters_of Sisters There How do I deal with one predicate with multiple answers? Let's say I have a predicate which looks to see if someone has a sister. Then there are - in my opin...	[ 0.0172119140625, -0.0125732421875, 0.017333984375, 0.00604248046875, -0.0137939453125, 0.01513671875, 0.01239013671875, -0.009521484375, 0.0024871826171875, -0.0224609375, 0.0008087158203125, 0.000576019287109375, -0.0140380859375, 0.01177978515625, 0.0087890625, 0.02392578125, 0.034...	[ 11249, 35142, 678, 1632, 1653, 2063, 67, 48716, 35166, 7, 502, 4867, 44116, 172, 37499, 114015, 4390, 602, 8622, 33342, 1957, 2174, 1556, 33153, 6626, 97370, 4527, 1723, 38937, 86171, 5303, 3445, 160054, 756, 184345, 17262, 6561, 14037, 193...	[ 0.04345703125, 0.173095703125, 0.1279296875, 0.14111328125, 0.1712646484375, 0.2047119140625, 0.10498046875, 0.252685546875, 0.2174072265625, 0.03326416015625, 0.08123779296875, 0.177490234375, 0.1339111328125, 0.0888671875, 0.11474609375, 0.2069091796875, 0.12109375, 0.09777832031...	embed
64401189_c0	64401189	prolog	0	Title: Split a list on an index in Prolog Problem title: Split a list on an index in Prolog Tags: prolog Problem: Split a list on an index in Prolog I am writing a split predicate with 4 parameters. The first parameter (Index) is the index at which the complete list should be split. The second parameter (CompleteList) ...	Split a list on an index in Prolog Split a list on an index in Prolog prolog Split Prolog CompleteList FirstHalfList Index CompleteListHead CompleteListTail SecondHalfList NewFirstHalfList NewIndex Index-1 Split a list on an index in Prolog I am writing a split predicate with 4 parameters. The first parameter (Index) i...	[ -0.0081787109375, -0.004730224609375, 0.005859375, 0.00119781494140625, -0.03759765625, 0.01324462890625, -0.01007080078125, -0.00933837890625, 0.0196533203125, -0.0024261474609375, 0.00653076171875, -0.00848388671875, -0.033935546875, 0.0167236328125, 0.0272216796875, -0.0026245117187...	[ 46474, 5303, 98, 63262, 1250, 4867, 10, 142, 23, 502, 168318, 154663, 23972, 106670, 31471, 13025, 9874, 379, 77648, 2356, 207263, 39659, 5759, 32562, 65450, 1653, 2063, 67, 201, 171859, 5117, 4153, 28484, 5608, 17932, 10770, 131801, 1720, ...	[ 0.26953125, 0.234375, 0.1324462890625, 0.228515625, 0.1690673828125, 0.2393798828125, 0.027435302734375, 0.00054931640625, 0.047882080078125, 0.128173828125, 0.1444091796875, 0.16796875, 0.07366943359375, 0.146484375, 0.177490234375, 0.041351318359375, 0.0087890625, 0.0204620361328...	embed
36368614_c0	36368614	prolog	0	Title: Get list of atoms by index from i to j in Prolog Problem title: Get list of atoms by index from i to j in Prolog Tags: list, prolog, split Problem: Get list of atoms by index from i to j in Prolog I want to get a list of atoms from my atom list based on given index_from i to index_to j. I tried many times but it...	Get list of atoms by index from i to j in Prolog Get list of atoms by index from i to j in Prolog list prolog split i Get Prolog INPUT_LIST INDEX_FROM INDEX_TO OUTPUTLIST LIST nth0 ELEMENT NLIST TYPE_INT IDENTIFIER OPEN_P COMMA output_list Get list of atoms by index from i to j in Prolog I want to get a list of atoms f...	[ -0.020751953125, 0.024169921875, -0.00531005859375, 0.0145263671875, -0.037841796875, 0.004791259765625, -0.00262451171875, 0.037353515625, -0.006439208984375, -0.01458740234375, 0.025390625, 0.00848388671875, -0.0223388671875, 0.01708984375, 0.0211181640625, 0.010498046875, 0.027587...	[ 20779, 5303, 111, 34627, 7, 390, 63262, 1295, 17, 47, 1647, 23, 1250, 4867, 502, 65450, 5881, 124599, 195977, 51383, 26939, 61607, 8727, 52001, 927, 2389, 9780, 124661, 95267, 59537, 208585, 65441, 683, 31436, 8218, 140992, 6562, 3444, 2046...	[ 0.08251953125, 0.1710205078125, 0.03338623046875, 0.224365234375, 0.10205078125, 0.058135986328125, 0.20068359375, 0.07989501953125, 0.1121826171875, 0.107666015625, 0.1812744140625, 0.041595458984375, 0.135009765625, 0.2269287109375, 0.10565185546875, 0.13232421875, 0.0355224609375,...	embed
57316504_c0	57316504	prolog	0	Title: Zebra puzzle - who lives on which floor? Problem title: Zebra puzzle - who lives on which floor? Tags: zebra-puzzle, prolog Problem: Zebra puzzle - who lives on which floor? I have a zebra/Einstein type Prolog puzzle very similar to the one depicted here: A "Building" Riddle in Prolog . The riddle is: There are ...	Zebra puzzle - who lives on which floor? Zebra puzzle - who lives on which floor? zebra-puzzle prolog Zebra building1 building2 R6-1 Digs Vars Digs1 Type empty_list Zebra puzzle - who lives on which floor? I have a zebra/Einstein type Prolog puzzle very similar to the one depicted here: A "Building" Riddle in Prolog . ...	[ -0.010009765625, 0.01019287109375, -0.01043701171875, -0.015869140625, 0.002777099609375, -0.00020503997802734375, -0.03857421875, 0.0203857421875, 0.013427734375, -0.011962890625, 0.0164794921875, 0.001953125, 0.007568359375, 0.00628662109375, -0.000942230224609375, 0.011474609375, ...	[ 3786, 2844, 104192, 2750, 60742, 98, 3129, 74912, 116232, 1766, 13894, 502, 4867, 33976, 418, 304, 627, 126188, 49688, 3323, 60457, 201505, 6562, 61061, 18055, 10644, 1250, 21373, 18695, 121137, 214, 41231, 19298, 31351, 3871, 7413, 23, 30309...	[ 0.15234375, 0.2333984375, 0.2069091796875, 0.1336669921875, 0.193603515625, 0.14111328125, 0.123779296875, 0.2281494140625, 0.2137451171875, 0.0675048828125, 0.1085205078125, 0.07415771484375, 0.1883544921875, 0.135498046875, 0.0281524658203125, 0.078125, 0.00457763671875, 0.098449...	embed
26367865_c1	26367865	prolog	1	],1). member(_,[],0). member(ITEM,[_\|T],R):- member(ITEM,T,R). both([],[],[]). both([song(NAME,_)\|T1], L2,[NAME\|T3]):- member(NAME,L2,R),R=1,both(T1, L2, T3). both([_\|T], L2, T3):- both(T, L2, T3). ?- top10eu(L1),top10us(L2),both(L1,L2,RESULT),write(RESULT). // the result is false here Attempt 2: both(_,[],[],[]). both...	],1). member(_,[],0). member(ITEM,[_\|T],R):- member(ITEM,T,R). both([],[],[]). both([song(NAME,_)\|T1], L2,[NAME\|T3]):- member(NAME,L2,R),R=1,both(T1, L2, T3). both([_\|T], L2, T3):- both(T, L2, T3). ?- top10eu(L1),top10us(L2),both(L1,L2,RESULT),write(RESULT). // the result is false here Attempt 2: both(_,[],[],[]). both...	[ -0.01104736328125, 0.022705078125, 0.01422119140625, -0.00506591796875, -0.0205078125, 0.009521484375, -0.013916015625, -0.0037078857421875, -0.0010833740234375, -0.0159912109375, 0.0016021728515625, -0.00138092041015625, 0.007110595703125, 0.0025482177734375, -0.002349853515625, 0.003...	[ 10114, 17727, 32786, 454, 268, 77495, 25216, 594, 618, 1052, 2077, 194, 15044, 132, 4, 35821, 182512, 16, 76172, 339, 304, 1065, 58745, 9, 866, 247, 33000, 927, 418, 384, 21320, 5, 12, 2663, 963, 4615, 13784, 223, 34465, 82643, 18781, ...	[ 0.037841796875, 0.0946044921875, 0.246337890625, 0.060028076171875, 0.0098876953125, 0.1182861328125, 0.1317138671875, 0.1383056640625, 0.0809326171875, 0.06689453125, 0.009796142578125, 0.0280609130859375, 0.20654296875, 0.00946044921875, 0.009765625, 0.197265625, 0.0966796875, 0....	embed
26501308_c0	26501308	prolog	0	Title: In Prolog how can I cut redundant answers Problem title: In Prolog how can I cut redundant answers Tags: non-repetitive, backtracking, prolog Problem: In Prolog how can I cut redundant answers I am working on a dictionary-like program with prolog, and my code goes like this: define(car,vehicle). define(car,that)...	In Prolog how can I cut redundant answers In Prolog how can I cut redundant answers non-repetitive backtracking prolog Prolog List In Prolog how can I cut redundant answers I am working on a dictionary-like program with prolog, and my code goes like this: I am trying to write a defined/1 predicate which will give me: Y...	[ 0.00689697265625, -0.01171875, 0.018310546875, 0.01190185546875, 0.00122833251953125, 0.0004596710205078125, 0.002838134765625, 0.01092529296875, 0.01275634765625, -0.041015625, -0.01507568359375, -0.002227783203125, -0.01361083984375, -0.00555419921875, 0.0137939453125, 0.031982421875...	[ 360, 1250, 4867, 3642, 831, 59226, 4842, 35405, 18, 35166, 351, 90197, 4420, 125728, 502, 32036, 7, 10763, 1528, 18151, 31577, 33022, 61924, 71, 11583, 1653, 2063, 8337, 76199, 1193, 1369, 3284, 43606, 20028, 84832, 11907, 6032, 105416, 157...	[ 0.03802490234375, 0.1680908203125, 0.2344970703125, 0.037811279296875, 0.033416748046875, 0.211181640625, 0.1077880859375, 0.2161865234375, 0.101318359375, 0.216064453125, 0.0261993408203125, 0.000579833984375, 0.099365234375, 0.190673828125, 0.1273193359375, 0.094482421875, 0.034210...	embed
51201134_c0	51201134	prolog	0	Title: What am I missing about equality and unification in Prolog? Problem title: What am I missing about equality and unification in Prolog? Tags: prolog-dif, prolog Problem: What am I missing about equality and unification in Prolog? I'm working through Clocksin and Mellish to try and finally go beyond just dabbling ...	What am I missing about equality and unification in Prolog? What am I missing about equality and unification in Prolog? prolog-dif prolog What Prolog sister_of Mum Dad Who What am I missing about equality and unification in Prolog? I'm working through Clocksin and Mellish to try and finally go beyond just dabbling in P...	[ 0.02001953125, 0.0024261474609375, 0.0230712890625, 0.01226806640625, -0.0164794921875, -0.0118408203125, -0.01202392578125, 0.0028533935546875, 0.0113525390625, -0.0311279296875, -0.01190185546875, -0.006134033203125, 0.0093994140625, 0.0057373046875, 0.00830078125, 0.004608154296875,...	[ 4865, 444, 87, 132283, 28, 161789, 136, 51, 41274, 1250, 4867, 502, 428, 420, 114015, 454, 4390, 83678, 40960, 40469, 1672, 23, 20697, 21135, 1596, 13892, 15227, 51042, 159, 38969, 10752, 29479, 71337, 12477, 1653, 2063, 67, 81979, 48733, ...	[ 0.004180908203125, 0.031341552734375, 0.00091552734375, 0.1552734375, 0.072998046875, 0.2333984375, 0.0364990234375, 0.1414794921875, 0.1572265625, 0.1490478515625, 0.2364501953125, 0.1204833984375, 0.082275390625, 0.1348876953125, 0.201904296875, 0.01654052734375, 0.1903076171875, ...	embed
22240579_c0	22240579	prolog	0	Title: Multiplying lists and list of lists in Prolog Problem title: Multiplying lists and list of lists in Prolog Tags: list, matrix-multiplication, prolog Problem: Multiplying lists and list of lists in Prolog I'm currently working on a Prolog program and having a lot of trouble figuring out how to implement it. I wan...	Multiplying lists and list of lists in Prolog Multiplying lists and list of lists in Prolog list matrix-multiplication prolog Multiplying Prolog Multiplying lists and list of lists in Prolog I'm currently working on a Prolog program and having a lot of trouble figuring out how to implement it. I want to put a list such...	[ -0.01025390625, 0.0106201171875, 0.005615234375, 0.018310546875, -0.01953125, 0.002532958984375, -0.0159912109375, 0.013671875, -0.0023651123046875, -0.00135040283203125, -0.005889892578125, -0.010009765625, -0.01458740234375, -0.00860595703125, -0.0130615234375, -0.008056640625, 0.0...	[ 19335, 62479, 5303, 136, 23, 1250, 4867, 50944, 425, 144227, 182867, 502, 20697, 1528, 63134, 26747, 29479, 3444, 3884, 133063, 304, 76172, 3934, 32354, 6024, 68034, 3249, 3525, 27781, 28282, 756, 25842, 21672, 45234, 1810, 116, 2208, 13162, ...	[ 0.1044921875, 0.15771484375, 0.2220458984375, 0.059539794921875, 0.0252685546875, 0.1568603515625, 0.235595703125, 0.1805419921875, 0.0992431640625, 0.07177734375, 0.051300048828125, 0.106689453125, 0.045867919921875, 0.0728759765625, 0.005615234375, 0.01959228515625, 0.1064453125, ...	embed
16063542_c0	16063542	prolog	0	Title: Can't access a file in Prolog Problem title: Can't access a file in Prolog Tags: prolog Problem: Can't access a file in Prolog I am studying Prolog using SWI-Prolog. I am finding some problems with the following example that simply access to a file and write in it what the user put in the Prolog Shell....	Can't access a file in Prolog Can't access a file in Prolog prolog Can Prolog File Query end_of_file myFile.txt ERROR Syntax Operator source_sink Can't access a file in Prolog I am studying Prolog using SWI-Prolog. I am finding some problems with the following example that simply access to a file and write in...	[ 0.03125, 0.00010251998901367188, 0.0113525390625, 0.0262451171875, -0.010986328125, -0.0036773681640625, 0.004547119140625, 0.01324462890625, -0.010498046875, -0.0439453125, 0.0140380859375, 0.0283203125, -0.02197265625, 0.00439453125, 0.01092529296875, 0.0069580078125, 0.01263427734...	[ 4171, 3768, 18, 17203, 11435, 23, 1250, 4867, 502, 42724, 58836, 3564, 4390, 29822, 759, 174350, 124326, 151206, 19010, 86531, 150922, 31344, 7, 14068, 10, 38969, 10752, 44402, 27781, 33022, 38937, 108362, 2967, 128019, 9790, 71924, 9433, 638...	[ 0.1031494140625, 0.04144287109375, 0.0975341796875, 0.243408203125, 0.221435546875, 0.1036376953125, 0.1998291015625, 0.260498046875, 0.1456298828125, 0.1844482421875, 0.1114501953125, 0.1270751953125, 0.1396484375, 0.1363525390625, 0.160888671875, 0.233642578125, 0.20068359375, 0....	embed

60680114_c1

60680114

prolog

1

1, 0), parent(FirstCousin, B), A \= B. cousins(A, B, 1, 1) :- var(P1), parent(P1, A), cousin(P1, B, 1, 0), A \= B, A \= P1, B \= P1. (2) I have also tried an if -statement to call the other function if the first one fails, but it crashes if the first case fails again. cousins(A, B, 1, 1) :- cousinsCase1(A, B, 1, 1) ->...

[ 0.017822265625, 0.005096435546875, -0.00136566162109375, 0.029296875, 0.00003933906555175781, -0.0036163330078125, 0.003143310546875, 0.00640869140625, 0.0289306640625, -0.0098876953125, -0.00439453125, -0.01336669921875, -0.0019378662109375, 0.000614166259765625, 0.0167236328125, -0.0...

[ 106, 757, 49129, 207263, 10625, 223, 73, 335, 62, 1369, 193429, 7, 284, 4879, 15772, 285, 683, 17727, 418, 436, 37842, 2174, 61340, 11782, 3789, 32354, 5117, 1632, 35782, 150631, 7225, 13438, 441, 6991, 29568, 304, 12921, 79986, 172864, 6...

[ 0.1070556640625, 0.126708984375, 0.1884765625, 0.07232666015625, 0.0716552734375, 0.14501953125, 0.1146240234375, 0.133544921875, 0.08087158203125, 0.057891845703125, 0.2445068359375, 0.0916748046875, 0.076904296875, 0.1285400390625, 0.0189971923828125, 0.1453857421875, 0.02549743652...

embed

58357900_c1

58357900

prolog

1

made a reasonable attempt at the solution. Here's what I have been trying so far: % Exercise 1 Solution add2(X,Y,Z):- add(X,Y,Z). add2(A+B,Y,Z):- add2(A,B,X), add2(X,Y,Z). add2(X,A+B,Z):- add2(A,B,Y), add2(X,Y,Z). Now, this above code works quite nicely for the first 3 inputs provided. I am having difficulty trying to...

[ -0.007171630859375, 0.0169677734375, -0.00836181640625, 0.0191650390625, -0.000850677490234375, 0.03466796875, -0.00860595703125, -0.01214599609375, 0.0218505859375, -0.00927734375, 0.0262451171875, -0.012939453125, -0.0101318359375, 0.0218505859375, 0.00762939453125, 0.013671875, 0....

[ 7228, 169022, 81887, 99, 29806, 31577, 2060, 1745, 155534, 184, 106, 187895, 15190, 304, 1542, 1723, 1511, 1328, 571, 284, 903, 36917, 18151, 43240, 32233, 26267, 5117, 138, 107730, 62952, 34844, 5351, 502, 4867, 13648, 29481, 4568, 5646, 9...

[ 0.02947998046875, 0.1241455078125, 0.1483154296875, 0.0198211669921875, 0.169677734375, 0.104248046875, 0.05419921875, 0.0577392578125, 0.1800537109375, 0.02166748046875, 0.05865478515625, 0.183837890625, 0.1806640625, 0.20166015625, 0.11376953125, 0.1038818359375, 0.1463623046875, ...

embed

66422579_c0

66422579

prolog

0

Title: Why does this rule with `not` always return false? Problem title: Why does this rule with `not` always return false? Tags: negation, prolog Problem: Why does this rule with `not` always return false? I have this prolog file: daughter(anna, vera). daughter(vera, oleg). daughter(olga, pavel). daughter(olga, alla)....

Why does this rule with `not` always return false? Why does this rule with `not` always return false? negation prolog Why mothers_names Why does this rule with `not` always return false? I have this prolog file: ?- woman(X). always returns false. ?- man(X). returns all three male entries though. I also tried woman(X) :...

[ 0.0011444091796875, 0.0174560546875, 0.022705078125, 0.01446533203125, -0.01904296875, 0.036376953125, 0.01019287109375, 0.003387451171875, 0.00811767578125, -0.039306640625, -0.0172119140625, -0.020751953125, -0.00119781494140625, 0.00701904296875, 0.01806640625, 0.007171630859375, ...

[ 44084, 903, 79986, 678, 10869, 11343, 30646, 98320, 14602, 108, 125682, 502, 4867, 42732, 7, 11627, 11435, 46667, 132, 1542, 9, 332, 17262, 11280, 112820, 37842, 15772, 1328, 669, 6002, 86531, 12765, 24233, 3445, 43240, 6201, 29568, 44691, ...

[ 0.0916748046875, 0.07635498046875, 0.1751708984375, 0.046905517578125, 0.279541015625, 0.1875, 0.1923828125, 0.22998046875, 0.047119140625, 0.1478271484375, 0.1455078125, 0.1458740234375, 0.1849365234375, 0.1666259765625, 0.033447265625, 0.1881103515625, 0.1002197265625, 0.18884277...

embed

16265548_c0

16265548

prolog

0

Title: Prolog - DCG - random sentence Problem title: Prolog - DCG - random sentence Tags: random, dcg, prolog Problem: Prolog - DCG - random sentence I'm new to Prolog, and I'm trying to write a small program that will give a random sentence from a DCG. My previous way of thinking was to use findall/3 to make a list of...

Prolog - DCG - random sentence Prolog - DCG - random sentence random dcg prolog Prolog DCG List Set random_member Pick List2 Prolog - DCG - random sentence I'm new to Prolog, and I'm trying to write a small program that will give a random sentence from a DCG. My previous way of thinking was to use findall/3 to make a l...

[ 0.035400390625, -0.00897216796875, 0.0106201171875, 0.015380859375, -0.002685546875, 0.01129150390625, -0.002899169921875, -0.01171875, 0.0118408203125, -0.050048828125, 0.007171630859375, 0.01361083984375, -0.00640869140625, 0.006378173828125, 0.0177001953125, 0.015625, -0.001426696...

[ 1250, 4867, 391, 56367, 96759, 149357, 104, 177, 502, 32036, 19943, 39, 27417, 122554, 304, 3525, 31577, 33022, 19336, 1528, 8337, 3917, 47644, 4527, 7413, 5584, 18113, 3249, 5303, 756, 7722, 12477, 79786, 10176, 122092, 147, 167785, 177261, ...

[ 0.146484375, 0.2208251953125, 0.0888671875, 0.1812744140625, 0.2039794921875, 0.1788330078125, 0.006622314453125, 0.047149658203125, 0.0946044921875, 0.15625, 0.114013671875, 0.0162506103515625, 0.1768798828125, 0.1297607421875, 0.0628662109375, 0.034912109375, 0.024993896484375, 0...

embed

30438955_c0

30438955

prolog

0

Title: Prolog C# Interface retract from file Problem title: Prolog C# Interface retract from file Tags: prolog, c%23 Problem: Prolog C# Interface retract from file I just established a connection to SWI Prolog and want to manipulate facts. e.g. retract and assert them. I have some function like this: String[] param = {...

Prolog C# Interface retract from file Prolog C# Interface retract from file prolog c%23 file Prolog Interface PlEngine.Initialize PlQuery.PlCall tablets.pl n1ewatomic n2ewatomic Prolog C# Interface retract from file I just established a connection to SWI Prolog and want to manipulate facts. e.g. retract and assert them...

[ 0.036376953125, 0.000021219253540039062, 0.011474609375, 0.0218505859375, -0.0098876953125, -0.01361083984375, 0.01312255859375, 0.01483154296875, 0.001861572265625, -0.0242919921875, 0.021728515625, 0.011474609375, -0.039794921875, -0.01129150390625, 0.0252685546875, -0.00019836425781...

[ 1250, 4867, 4904, 220237, 41499, 15390, 1295, 11435, 502, 3742, 29016, 91384, 1212, 40705, 41732, 1294, 141, 441, 5584, 115301, 2424, 188, 21068, 634, 170920, 94878, 159, 38969, 3444, 45258, 15824, 136, 237, 33657, 32354, 20697, 10, 16865, ...

[ 0.1448974609375, 0.207275390625, 0.17431640625, 0.1817626953125, 0.2259521484375, 0.1640625, 0.16357421875, 0.1954345703125, 0.1015625, 0.120361328125, 0.08758544921875, 0.090576171875, 0.07305908203125, 0.041656494140625, 0.0970458984375, 0.0828857421875, 0.0677490234375, 0.064514...

embed

35429404_c0

35429404

prolog

0

Title: Prolog: Passing Implicit Parameter / Predicated Evaluation Problem title: Prolog: Passing Implicit Parameter / Predicated Evaluation Tags: parameter-passing, swi-prolog, prolog Problem: Prolog: Passing Implicit Parameter / Predicated Evaluation I am looking for a reliable way to pass an implicit parameter among ...

Prolog: Passing Implicit Parameter / Predicated Evaluation Prolog: Passing Implicit Parameter / Predicated Evaluation parameter-passing swi-prolog prolog Prolog Passing Implicit Parameter Predicated Evaluation Context Args term_expansion Head Body CompoundTerm set_term_attribute on_evaluate get_term_attribute Prolog: P...

[ 0.0135498046875, 0.0225830078125, 0.007293701171875, 0.01708984375, -0.0115966796875, -0.01165771484375, 0.0113525390625, -0.004730224609375, -0.00927734375, -0.06884765625, 0.01141357421875, 0.0140380859375, -0.0244140625, 0.00677490234375, -0.0081787109375, 0.0032196044921875, -0.0...

[ 1250, 4867, 28872, 29128, 60923, 1720, 29089, 248, 7145, 2063, 3674, 151228, 171859, 13409, 2452, 3454, 502, 1657, 22829, 1172, 9405, 13579, 83613, 66, 44816, 43960, 15612, 31, 35484, 5423, 32166, 191145, 98, 159258, 2046, 214, 16487, 215543,...

[ 0.1761474609375, 0.241943359375, 0.1307373046875, 0.12744140625, 0.2086181640625, 0.1246337890625, 0.163330078125, 0.00152587890625, 0.1207275390625, 0.2132568359375, 0.03753662109375, 0.2105712890625, 0.25439453125, 0.0777587890625, 0.13818359375, 0.1268310546875, 0.128662109375, ...

embed

39495782_c0

39495782

prolog

0

Title: Prolog recursive function not behaving as expected Problem title: Prolog recursive function not behaving as expected Tags: recursion, prolog, trace, fibonacci Problem: Prolog recursive function not behaving as expected I'm trying to implement the recursive version of the Fibonacci sequence in Prolog. Below is th...

Prolog recursive function not behaving as expected Prolog recursive function not behaving as expected recursion prolog trace fibonacci Prolog Call Exit _G2569 _G2572 _G2573 _G2575 _G2578 _G2579 Prolog recursive function not behaving as expected I'm trying to implement the recursive version of the Fibonacci sequence in ...

[ 0.0189208984375, -0.0033111572265625, 0.01226806640625, -0.007476806640625, -0.0050048828125, 0.0054931640625, -0.00469970703125, -0.007171630859375, 0.00726318359375, -0.0018310546875, 0.0185546875, -0.000751495361328125, -0.02734375, 0.00555419921875, 0.047607421875, -0.01416015625, ...

[ 1250, 4867, 195625, 5844, 32354, 959, 186, 528, 6496, 237, 84751, 502, 144851, 809, 20990, 52544, 26265, 5443, 217, 724, 2588, 14212, 12825, 13574, 6873, 19051, 304, 172070, 31577, 29479, 11389, 3698, 944, 3956, 18151, 2967, 12684, 41206, 1...

[ 0.164306640625, 0.248779296875, 0.2249755859375, 0.118896484375, 0.1571044921875, 0.09344482421875, 0.0496826171875, 0.1331787109375, 0.059661865234375, 0.1002197265625, 0.152099609375, 0.1260986328125, 0.19970703125, 0.13916015625, 0.129638671875, 0.161865234375, 0.1717529296875, ...

embed

23803539_c0

23803539

prolog

0

Title: Moving a robot on a specific path Problem title: Moving a robot on a specific path Tags: prolog Problem: Moving a robot on a specific path Supose I have a grid like this one(I don't know the size of the grid) (-1,1) (0,1) (1,1) (-1,0) (0,0) (1,0) (-1,-1) (0,-1) (1,-1) In this grid are N boxes. I want to write so...

Moving a robot on a specific path Moving a robot on a specific path prolog Moving ProgramData ContainsBox Action ProgramDataUpdated N-1 Moving a robot on a specific path Supose I have a grid like this one(I don't know the size of the grid) In this grid are N boxes. I want to write some predicates in order to move the r...

[ 0.00750732421875, 0.004302978515625, 0.006439208984375, 0.033447265625, -0.00360107421875, 0.00156402587890625, 0.010986328125, 0.0234375, 0.01446533203125, -0.0225830078125, 0.0033111572265625, 0.030029296875, -0.030517578125, -0.0225830078125, -0.005615234375, 0.006561279296875, 0....

[ 2501, 6496, 11329, 98, 29458, 60875, 502, 4867, 7663, 137989, 34749, 72295, 57945, 152872, 541, 5759, 1832, 78381, 765, 120067, 1884, 903, 1632, 2301, 18, 3714, 13267, 621, 16530, 90, 3444, 33022, 1653, 2063, 25813, 11907, 38750, 12765, 217...

[ 0.1563720703125, 0.0771484375, 0.265625, 0.11572265625, 0.192138671875, 0.198974609375, 0.1300048828125, 0.1864013671875, 0.1055908203125, 0.129150390625, 0.0894775390625, 0.1593017578125, 0.1326904296875, 0.1116943359375, 0.1180419921875, 0.1285400390625, 0.003936767578125, 0.0301...

embed

62834430_c0

62834430

prolog

0

Title: A list on which there are duplicates(on sequence),a part of which is needed to be transferred Problem title: A list on which there are duplicates(on sequence),a part of which is needed to be transferred Tags: duplicates, list, prolog Problem: A list on which there are duplicates(on sequence),a part of which is n...

A list on which there are duplicates(on sequence),a part of which is needed to be transferred A list on which there are duplicates(on sequence),a part of which is needed to be transferred duplicates list prolog List Empty_at_first Arxh Telos Result_ml Result A list on which there are duplicates(on sequence),a part of w...

[ -0.0047607421875, -0.003265380859375, 0.003387451171875, -0.01092529296875, -0.01129150390625, -0.01361083984375, -0.00604248046875, 0.0279541015625, -0.0020294189453125, -0.016845703125, -0.0031280517578125, 0.01434326171875, 0.019287109375, 0.031005859375, -0.0014190673828125, 0.0102...

[ 5303, 98, 2685, 621, 171763, 1636, 191, 40, 944, 3956, 2831, 44841, 12302, 2822, 62, 502, 4867, 32036, 31678, 939, 257, 13448, 271, 1172, 425, 127, 9344, 232, 126684, 7237, 10644, 114122, 136791, 87168, 2565, 1556, 67, 120820, 24372, 2896...

[ 0.197509765625, 0.0308837890625, 0.030731201171875, 0.033782958984375, 0.284423828125, 0.2056884765625, 0.076904296875, 0.0255584716796875, 0.0816650390625, 0.051513671875, 0.07159423828125, 0.146240234375, 0.1617431640625, 0.09002685546875, 0.021697998046875, 0.11181640625, 0.163452...

embed

63999218_c0

63999218

prolog

0

Title: How to define a string concatenation operator in prolog? Problem title: How to define a string concatenation operator in prolog? Tags: operators, prolog, string-concatenation Problem: How to define a string concatenation operator in prolog? I am manipulating strings of characters in prolog, and I would like to a...

How to define a string concatenation operator in prolog? How to define a string concatenation operator in prolog? operators prolog string-concatenation How process_str Str Next is_valid_pattern0 Pattern0 Tail0 Tail1 is_valid_pattern1 Pattern1 Tail2 How to define a string concatenation operator in prolog? I am manipulat...

[ 0.0216064453125, -0.001617431640625, 0.0157470703125, 0.029296875, 0.0029144287109375, 0.00408935546875, -0.0220947265625, 0.0031585693359375, 0.0179443359375, -0.033447265625, -0.0057373046875, -0.0224609375, 0.0086669921875, -0.017333984375, 0.007293701171875, 0.003204345703125, -0...

[ 11249, 61924, 10, 79315, 158, 4460, 33, 2320, 39933, 23, 502, 4867, 2271, 9433, 9297, 23351, 4997, 83, 7013, 71, 4453, 22766, 2389, 9876, 1218, 379, 304, 45258, 124850, 71864, 142458, 77336, 91736, 27198, 80934, 1286, 12301, 41018, 209806, ...

[ 0.02734375, 0.1881103515625, 0.01953125, 0.21875, 0.097412109375, 0.1685791015625, 0.14404296875, 0.0650634765625, 0.255126953125, 0.04095458984375, 0.134033203125, 0.1904296875, 0.0293426513671875, 0.093017578125, 0.09381103515625, 0.08807373046875, 0.1712646484375, 0.010040283203...

embed

27838667_c0

27838667

prolog

0

Title: Prolog: Select rule randomly from list and pass parameter Problem title: Prolog: Select rule randomly from list and pass parameter Tags: rule, list, parameter-passing, prolog Problem: Prolog: Select rule randomly from list and pass parameter I am trying to write prolog code to select a random rule from a list an...

Prolog: Select rule randomly from list and pass parameter Prolog: Select rule randomly from list and pass parameter rule list parameter-passing prolog list Prolog Select Rules rule1 rule2 rule3 Rule random_between Elem nth0 hallo2 Prolog: Select rule randomly from list and pass parameter I am trying to write prolog cod...

[ 0.00182342529296875, 0.006805419921875, 0.006561279296875, -0.0013885498046875, -0.007476806640625, 0.0152587890625, 0.00142669677734375, -0.010498046875, 0.00011920928955078125, -0.0380859375, 0.01226806640625, -0.0164794921875, -0.00775146484375, 0.0030059814453125, 0.01031494140625, ...

[ 1250, 4867, 12, 51620, 79986, 96759, 538, 5303, 27875, 171859, 1295, 13409, 502, 139118, 304, 363, 4626, 1177, 33, 540, 195, 927, 2389, 23664, 31, 136, 31577, 33022, 18151, 36849, 71924, 3642, 2060, 765, 4488, 103687, 27781, 903, 184345, ...

[ 0.1898193359375, 0.255126953125, 0.03485107421875, 0.205078125, 0.2213134765625, 0.19580078125, 0.014312744140625, 0.1663818359375, 0.153564453125, 0.227783203125, 0.05877685546875, 0.082763671875, 0.1585693359375, 0.189697265625, 0.037872314453125, 0.08203125, 0.047027587890625, 0...

embed

10322472_c0

10322472

prolog

0

Title: I have a List of lists containing 4170 elements and I want to divide them to 139 lists each containing 30 different elements? Problem title: I have a List of lists containing 4170 elements and I want to divide them to 139 lists each containing 30 different elements? Tags: recursion, list, prolog Problem: I have ...

I have a List of lists containing 4170 elements and I want to divide them to 139 lists each containing 30 different elements? I have a List of lists containing 4170 elements and I want to divide them to 139 lists each containing 30 different elements? recursion list prolog List are_different List1 List2 nth0 Slot1 Slot...

[ -0.03125, 0.012451171875, 0.00102996826171875, 0.01190185546875, -0.04638671875, 0.000629425048828125, -0.00012063980102539062, -0.004730224609375, 0.001861572265625, 0.021484375, -0.0137939453125, -0.013671875, 0.0069580078125, 0.0203857421875, -0.0068359375, -0.0011444091796875, 0....

[ 87, 765, 32036, 111, 5303, 7, 70541, 214, 201, 43243, 80854, 3444, 47, 101637, 58166, 12638, 496, 12921, 32, 10, 195625, 1830, 502, 4867, 621, 238778, 418, 304, 927, 2389, 69623, 70, 46132, 6957, 12830, 25632, 3173, 1295, 3789, 5117, 40...

[ 0.033050537109375, 0.0732421875, 0.1795654296875, 0.041717529296875, 0.253662109375, 0.094482421875, 0.0870361328125, 0.03680419921875, 0.1077880859375, 0.2412109375, 0.1986083984375, 0.0902099609375, 0.1685791015625, 0.202392578125, 0.2344970703125, 0.040771484375, 0.215576171875, ...

embed

12884340_c0

12884340

prolog

0

Title: Creating list of data with recursion in Prolog Problem title: Creating list of data with recursion in Prolog Tags: list, prolog, recursion Problem: Creating list of data with recursion in Prolog I'm trying to write a recursive function that passes a list down to itself and at each level adds an element to that l...

Creating list of data with recursion in Prolog Creating list of data with recursion in Prolog list prolog recursion Creating Prolog List NumberOfSteps Stops NumberOfStepsIncremented Creating list of data with recursion in Prolog I'm trying to write a recursive function that passes a list down to itself and at each leve...

[ -0.000919342041015625, 0.03173828125, 0.00051116943359375, 0.00830078125, -0.001251220703125, 0.01519775390625, -0.01226806640625, -0.00311279296875, 0.01275634765625, -0.030517578125, 0.003631591796875, -0.0361328125, -0.0162353515625, 0.02392578125, 0.0135498046875, 0.006866455078125...

[ 56781, 5303, 2053, 678, 195625, 1830, 1250, 4867, 502, 32036, 103332, 132887, 191644, 42284, 7612, 1183, 31577, 33022, 5844, 32354, 10922, 7565, 68034, 12638, 17366, 15190, 12830, 2704, 113771, 4420, 29806, 1653, 2063, 26366, 3173, 2967, 33342,...

[ 0.1480712890625, 0.2060546875, 0.1444091796875, 0.08209228515625, 0.2275390625, 0.124267578125, 0.1715087890625, 0.2362060546875, 0.113037109375, 0.18603515625, 0.0936279296875, 0.1405029296875, 0.1697998046875, 0.14794921875, 0.08892822265625, 0.07574462890625, 0.04119873046875, 0...

embed

5259453_c0

5259453

prolog

0

Title: How can I use a GUI debugger on the Prolog code that runs inside a Java app through JPL? Problem title: How can I use a GUI debugger on the Prolog code that runs inside a Java app through JPL? Tags: eclipse, java, jpl, prolog, swi-prolog Problem: How can I use a GUI debugger on the Prolog code that runs inside a...

How can I use a GUI debugger on the Prolog code that runs inside a Java app through JPL? How can I use a GUI debugger on the Prolog code that runs inside a Java app through JPL? eclipse java jpl prolog swi-prolog jpl.PrologException PrologException How GUI Prolog Java JPL Query.oneSolution Query.hasSolution Exception e...

[ 0.00823974609375, 0.0191650390625, 0.00396728515625, -0.01422119140625, 0.00823974609375, -0.0040283203125, 0.0047607421875, -0.00153350830078125, 0.0023040771484375, -0.04833984375, 0.0162353515625, 0.01373291015625, -0.0184326171875, -0.0172119140625, 0.0137939453125, 0.011474609375,...

[ 11249, 831, 4527, 195490, 8, 978, 21407, 98, 1250, 4867, 18151, 127877, 46132, 41925, 4027, 8305, 821, 21130, 10, 106371, 184, 79, 330, 1647, 2424, 502, 2452, 3454, 10752, 63928, 58836, 3630, 102588, 10557, 5443, 116311, 188800, 85763, 4173...

[ 0.037353515625, 0.03131103515625, 0.1063232421875, 0.231201171875, 0.144775390625, 0.2132568359375, 0.189697265625, 0.019866943359375, 0.163330078125, 0.2249755859375, 0.150634765625, 0.049591064453125, 0.11328125, 0.2047119140625, 0.1246337890625, 0.040069580078125, 0.1064453125, ...

embed

40956860_c0

40956860

prolog

0

Title: cannot be redefined on prolog Problem title: cannot be redefined on prolog Tags: list, prolog Problem: cannot be redefined on prolog I'm pretty new on prolog and haven't quite understood some of its logic. I got this code for list in prolog: guardians([starlord, gamora, rocket, groot, drax]). avengers([rogers, s...

cannot be redefined on prolog cannot be redefined on prolog list prolog group1 group2 group3 rank1 rank2 rank3 is_member is_positioned has_position_in sample.pl:16 cannot be redefined on prolog I'm pretty new on prolog and haven't quite understood some of its logic. I got this code for list in prolog: I got an error: W...

[ 0.009521484375, 0.003021240234375, 0.018310546875, 0.01263427734375, -0.00836181640625, -0.015625, -0.0189208984375, 0.0169677734375, 0.00775146484375, -0.029052734375, 0.01904296875, -0.006927490234375, 0.0167236328125, -0.0174560546875, 0.012451171875, 0.004669189453125, -0.0043945...

[ 53418, 15265, 5983, 297, 98, 502, 4867, 186, 5303, 21115, 363, 30648, 39, 27417, 40322, 1556, 121413, 2424, 22354, 217064, 62775, 18151, 18499, 5351, 15005, 903, 117414, 71864, 22690, 110527 ]

[ 0.128662109375, 0.1453857421875, 0.187255859375, 0.0721435546875, 0.0273284912109375, 0.1322021484375, 0.2315673828125, 0.0189361572265625, 0.1783447265625, 0.1138916015625, 0.037689208984375, 0.108642578125, 0.0299835205078125, 0.176025390625, 0.147705078125, 0.031097412109375, 0.18...

embed

7655998_c0

7655998

prolog

0

Title: Running CG graphics on BProlog? Problem title: Running CG graphics on BProlog? Tags: cg, b-prolog, prolog Problem: Running CG graphics on BProlog? i recently installed B-prolog and tried CG graphics examples from here http://www.probp.com/ According to their manual, i've installed B prolog in C:/ drive and its c...

Running CG graphics on BProlog? Running CG graphics on BProlog? cg b-prolog prolog Running BProlog Win Frame WhiteBox Tri point1 point2 Star Type cuba.pl Compiling::cuba.pl loading::cuba.out Undefined Running CG graphics on BProlog? i recently installed B-prolog and tried CG graphics examples from here http://www.probp...

[ 0.0185546875, -0.0135498046875, 0.00396728515625, 0.00396728515625, -0.01373291015625, 0.0128173828125, 0.0068359375, -0.015869140625, 0.01507568359375, -0.007080078125, -0.0032958984375, 0.009765625, -0.005157470703125, -0.0184326171875, 0.0167236328125, 0.0079345703125, 0.001747131...

[ 28398, 592, 56367, 48461, 7, 98, 335, 10752, 4867, 177, 876, 3454, 502, 17686, 42557, 22392, 72295, 4699, 6275, 4612, 60457, 33160, 2424, 15612, 49725, 90351, 72367, 6056, 79912, 5983, 20600, 9, 37842, 27781, 79122, 254, 23009, 23, 313, 1...

[ 0.1334228515625, 0.05535888671875, 0.228271484375, 0.23046875, 0.1148681640625, 0.09521484375, 0.1806640625, 0.201904296875, 0.2374267578125, 0.098388671875, 0.1121826171875, 0.15185546875, 0.1492919921875, 0.06488037109375, 0.0950927734375, 0.1077880859375, 0.1646728515625, 0.1156...

embed

23985197_c0

23985197

prolog

0

Title: Two different behaviors of the same Prolog code with and without debugging Problem title: Two different behaviors of the same Prolog code with and without debugging Tags: debugging, prolog, swi-prolog, xpce Problem: Two different behaviors of the same Prolog code with and without debugging I am using the latets ...

Two different behaviors of the same Prolog code with and without debugging Two different behaviors of the same Prolog code with and without debugging debugging prolog swi-prolog xpce Two Prolog Frame Test Pic _Ref1 _Ref2 Good Two different behaviors of the same Prolog code with and without debugging I am using the late...

[ 0.018310546875, -0.0020904541015625, -0.0032501220703125, 0.02294921875, -0.007232666015625, 0.01043701171875, 0.00147247314453125, 0.0118408203125, -0.005035400390625, -0.0235595703125, 0.0177001953125, 0.0086669921875, -0.00811767578125, -0.00537109375, 0.031494140625, 0.003021240234...

[ 32964, 12921, 123166, 5701, 1250, 4867, 18151, 678, 15490, 8, 978, 502, 2452, 3454, 329, 42557, 8647, 27860, 190015, 304, 18621, 36659, 21, 3263, 7, 144142, 2289, 156960, 7911, 4785, 159, 38969, 9, 10752, 54825, 25632, 14602, 3017, 214, 2...

[ 0.1072998046875, 0.1153564453125, 0.16552734375, 0.110595703125, 0.152587890625, 0.216064453125, 0.1651611328125, 0.0175323486328125, 0.07574462890625, 0.1295166015625, 0.203125, 0.0966796875, 0.1416015625, 0.07086181640625, 0.058563232421875, 0.08551025390625, 0.10400390625, 0.084...

embed

62681650_c0

62681650

prolog

0

Title: Two DCG rules for `(ab)*`. Can it be one? Problem title: Two DCG rules for `(ab)*`. Can it be one? Tags: prolog, dcg Problem: Two DCG rules for `(ab)*`. Can it be one? I want to generate or test strings obeying the Perl Regex (ab)* The code below works perfectly well: Generate ?- phrase_acceptable(Text,6). Text ...

Two DCG rules for `(ab)*`. Can it be one? Two DCG rules for `(ab)*`. Can it be one? prolog dcg 2 Two DCG Can phrase_acceptable Text atom_codes Codes Two DCG rules for `(ab)*`. Can it be one? I want to generate or test strings obeying the Perl Regex (ab)* The code below works perfectly well: Generate Test (or compress?)...

[ 0.0311279296875, -0.004364013671875, 0.000732421875, 0.029052734375, 0.004425048828125, 0.0291748046875, 0.005157470703125, -0.01171875, 0.0223388671875, -0.025390625, -0.007781982421875, 0.006591796875, 0.01025390625, 0.0074462890625, 0.022216796875, -0.00055694580078125, 0.00253295...

[ 32964, 391, 56367, 91736, 2055, 1639, 4171, 186, 1632, 502, 4867, 104, 238, 177, 116, 113860, 135372, 2661, 24129, 34627, 40899, 28864, 100, 3444, 139392, 3034, 79315, 31192, 908, 141, 11678, 3355, 18151, 35064, 43240, 169123, 155370, 67, 8...

[ 0.13916015625, 0.079833984375, 0.215576171875, 0.1690673828125, 0.1949462890625, 0.1026611328125, 0.0948486328125, 0.01849365234375, 0.0811767578125, 0.1094970703125, 0.150634765625, 0.0125732421875, 0.0181427001953125, 0.0662841796875, 0.05413818359375, 0.1456298828125, 0.1461181640...

embed

26892994_c0

26892994

prolog

0

Title: Prolog - alternative conslusions to a relation Problem title: Prolog - alternative conslusions to a relation Tags: prolog Problem: Prolog - alternative conslusions to a relation I decided to learn basic Prolog because the idea of it seemed interesting. The language itself is difficult to put my head around thoug...

Prolog - alternative conslusions to a relation Prolog - alternative conslusions to a relation prolog Prolog Prolog - alternative conslusions to a relation I decided to learn basic Prolog because the idea of it seemed interesting. The language itself is difficult to put my head around though. As an excercise I decided t...

[ -0.0034942626953125, 0.0220947265625, 0.01190185546875, -0.00060272216796875, 0.00170135498046875, 0.00555419921875, -0.0247802734375, -0.007110595703125, -0.0184326171875, -0.04736328125, -0.0120849609375, 0.01153564453125, -0.009765625, 0.01123046875, 0.0211181640625, 0.0057983398437...

[ 1250, 4867, 30700, 158, 10791, 63239, 47, 41911, 502, 30698, 62822, 6528, 115058, 49041, 46876, 34844, 10336, 3443, 8781, 1528, 86869, 54350, 48408, 272, 36417, 104192, 3647, 3115, 2811, 27117, 91736, 51529, 11343, 14192, 85027, 17075, 8216, ...

[ 0.1646728515625, 0.24853515625, 0.1934814453125, 0.1058349609375, 0.1712646484375, 0.1085205078125, 0.047760009765625, 0.181640625, 0.082275390625, 0.04815673828125, 0.06756591796875, 0.013153076171875, 0.0113525390625, 0.0253753662109375, 0.112548828125, 0.050628662109375, 0.0022583...

embed

60822829_c0

60822829

prolog

0

Title: Simple predicate that returns all possible splits of a list Problem title: Simple predicate that returns all possible splits of a list Tags: prolog Problem: Simple predicate that returns all possible splits of a list In prolog, not using any predefined predicates, how might one go about finding all possible ways...

Simple predicate that returns all possible splits of a list Simple predicate that returns all possible splits of a list prolog Simple all_possibilities Simple predicate that returns all possible splits of a list In prolog, not using any predefined predicates, how might one go about finding all possible ways of splittin...

[ -0.0023193359375, 0.019775390625, 0.006378173828125, 0.023681640625, -0.0262451171875, 0.0262451171875, 0.0057373046875, -0.004302978515625, 0.03857421875, -0.0113525390625, 0.0172119140625, -0.01263427734375, -0.001953125, 0.03515625, 0.009521484375, 0.006195068359375, 0.02062988281...

[ 60552, 1653, 2063, 67, 30646, 756, 7722, 65450, 7, 5303, 502, 4867, 171702, 959, 5983, 3642, 13648, 738, 1672, 90791, 48322, 1916, 3934, 116, 3789, 7103, 51042, 9007, 133, 16446, 7515, 10269, 62, 335, 166904, 6528, 237875, 29479, 195625, ...

[ 0.1708984375, 0.156982421875, 0.1776123046875, 0.060211181640625, 0.1676025390625, 0.1353759765625, 0.1839599609375, 0.2196044921875, 0.09228515625, 0.204345703125, 0.1229248046875, 0.171875, 0.2379150390625, 0.018157958984375, 0.0682373046875, 0.008453369140625, 0.034942626953125, ...

embed

69137776_c0

69137776

prolog

0

Title: Is there a Prolog name for atom/1 or stream/1 etc (SWI-Prolog) Problem title: Is there a Prolog name for atom/1 or stream/1 etc (SWI-Prolog) Tags: swi-prolog, prolog Problem: Is there a Prolog name for atom/1 or stream/1 etc (SWI-Prolog) Just made a funny observation. SWI-Prolog allows other things than atom as ...

Is there a Prolog name for atom/1 or stream/1 etc (SWI-Prolog) Is there a Prolog name for atom/1 or stream/1 etc (SWI-Prolog) swi-prolog prolog Prolog SWI-Prolog current_input ERROR Type Is there a Prolog name for atom/1 or stream/1 etc (SWI-Prolog) Just made a funny observation. SWI-Prolog allows other things than ato...

[ 0.0167236328125, -0.0013427734375, 0.018310546875, 0.01275634765625, 0.0020294189453125, 0.00323486328125, 0.0135498046875, -0.01458740234375, -0.00640869140625, -0.01239013671875, 0.0126953125, -0.0264892578125, -0.0031890869140625, -0.00099945068359375, 0.00927734375, -0.002914428710...

[ 2071, 2685, 10, 1250, 4867, 9351, 100, 34627, 11583, 707, 75973, 294, 38969, 9, 10752, 3021, 2452, 3454, 502, 43581, 73, 7077, 151206, 24638, 60457, 99864, 150556, 159, 114864, 3789, 8966, 3501, 237, 7477, 18770, 23, 217773, 54, 32195, 23...

[ 0.008514404296875, 0.049163818359375, 0.031280517578125, 0.1942138671875, 0.2388916015625, 0.180908203125, 0.04534912109375, 0.2364501953125, 0.1937255859375, 0.0282745361328125, 0.2403564453125, 0.035247802734375, 0.2044677734375, 0.05841064453125, 0.16064453125, 0.002471923828125, ...

embed

51961176_c1

51961176

prolog

1

, Out) :- S =.. [submit | Ls], subtract1(Ls, Label, Tmp), Out =.. [submit | Tmp]. ========================================================== update on 8/30: we are using three different approach on gerrit 2.11, no syntax error now. but none of them works, new label keeps there what ever the code change size. Suspect co...

[ -0.0037841796875, 0.00970458984375, 0.01544189453125, 0.00157928466796875, -0.0224609375, 0.003021240234375, -0.0035552978515625, 0.00640869140625, 0.007232666015625, 0.033203125, 0.025146484375, -0.01348876953125, 0.0174560546875, -0.0242919921875, 0.025634765625, 0.0125732421875, 0...

[ 4, 13538, 15772, 159, 2203, 22144, 4007, 339, 1614, 39989, 18, 418, 866, 7, 129214, 384, 2676, 28350, 17368, 17262, 12921, 51515, 4155, 2783, 787, 1662, 6002, 86531, 18499, 43240, 3525, 67967, 13695, 2685, 18151, 15549, 13267, 1832, 16711, ...

[ 0.0626220703125, 0.22998046875, 0.017791748046875, 0.1395263671875, 0.104736328125, 0.1697998046875, 0.219482421875, 0.05499267578125, 0.11181640625, 0.1602783203125, 0.06903076171875, 0.0201416015625, 0.06866455078125, 0.006378173828125, 0.1912841796875, 0.0163116455078125, 0.169921...

embed

53509214_c0

53509214

prolog

0

Title: prolog error from classifying a subclass of an atom Problem title: prolog error from classifying a subclass of an atom Tags: prolog Problem: prolog error from classifying a subclass of an atom I'm still learning prolog but am coming across this error. Warning: /usr/local/home/jay275/SDRIVE/cs3500/hw7/part1.pl:23...

prolog error from classifying a subclass of an atom prolog error from classifying a subclass of an atom prolog classifying Warning jay275 SDRIVE cs3500 hw7 part1.pl:23 Clauses Earlier part1.pl:10 Current Use Mammal Animal prolog error from classifying a subclass of an atom I'm still learning prolog but am coming across...

[ 0.025390625, 0.009765625, 0.00677490234375, 0.014404296875, 0.0037994384765625, 0.0205078125, -0.00665283203125, 0.00185394287109375, 0.0033416748046875, -0.03369140625, 0.0002841949462890625, -0.0260009765625, 0.01123046875, -0.0166015625, 0.0263671875, -0.0196533203125, 0.007934570...

[ 502, 4867, 18499, 1295, 18507, 151138, 1614, 67413, 34627, 5550, 592, 79, 53, 304, 6873, 159, 23498, 96479, 20763, 363, 4283, 434, 966, 2831, 24864, 100700, 15110, 114063, 36836, 101860, 141, 82821, 111, 52080, 36880, 903, 31577, 5154, 2174...

[ 0.1512451171875, 0.240234375, 0.1885986328125, 0.0537109375, 0.1627197265625, 0.1287841796875, 0.185791015625, 0.2081298828125, 0.193115234375, 0.120849609375, 0.0281524658203125, 0.07958984375, 0.03302001953125, 0.0086669921875, 0.1474609375, 0.003875732421875, 0.08135986328125, 0...

embed

64177449_c0

64177449

prolog

0

Title: typing period in VSCode is accidentally bound to something? Problem title: typing period in VSCode is accidentally bound to something? Tags: visual-studio-code, prolog Problem: typing period in VSCode is accidentally bound to something? I accidentally bound the period on VSCode on my Mac to something and can't f...

typing period in VSCode is accidentally bound to something? typing period in VSCode is accidentally bound to something? visual-studio-code prolog VSCode renderer1 KeybindingService Received Period Converted Resolving typing period in VSCode is accidentally bound to something? I accidentally bound the period on VSCode o...

[ 0.01019287109375, 0.0322265625, 0.004119873046875, 0.0003948211669921875, 0.009765625, -0.0019073486328125, -0.0155029296875, 0.00064849853515625, -0.021484375, -0.004058837890625, 0.00035858154296875, 0.00946044921875, 0.00128936767578125, 0.00067901611328125, -0.005401611328125, 0.01...

[ 11417, 214, 14922, 23, 44160, 114211, 83, 27998, 25958, 99091, 47, 9844, 21176, 52629, 40899, 502, 4867, 79516, 26824, 128239, 121979, 93908, 92329, 814, 132944, 4727, 39531, 20697, 10644, 1379, 15824, 8, 74635, 79986, 91995, 32354, 17198, 50...

[ 0.1890869140625, 0.0802001953125, 0.240478515625, 0.037628173828125, 0.1942138671875, 0.27490234375, 0.0228424072265625, 0.1644287109375, 0.07354736328125, 0.2025146484375, 0.09259033203125, 0.07843017578125, 0.1456298828125, 0.1146240234375, 0.1844482421875, 0.10455322265625, 0.1580...

embed

77289456_c0

77289456

prolog

0

Title: Moving elements in a list-of-lists in prolog Problem title: Moving elements in a list-of-lists in prolog Tags: prolog, list, matrix Problem: Moving elements in a list-of-lists in prolog I'm making a 8-puzzle solver in prolog, and I'm having a hard time figuring out how to program the rules of the game. The initi...

Moving elements in a list-of-lists in prolog Moving elements in a list-of-lists in prolog prolog list matrix Moving line_matching list_count wrong_position Line Moving elements in a list-of-lists in prolog I'm making a 8-puzzle solver in prolog, and I'm having a hard time figuring out how to program the rules of the ga...

[ -0.009521484375, 0.01611328125, 0.0057373046875, -0.00125885009765625, -0.01287841796875, 0.006011962890625, -0.01190185546875, 0.031005859375, 0.0030059814453125, 0.003265380859375, -0.005859375, 0.00159454345703125, -0.0052490234375, -0.006988525390625, -0.02880859375, -0.00387573242...

[ 2501, 6496, 80854, 23, 5303, 4390, 6562, 7, 502, 4867, 50944, 13315, 98753, 71013, 44691, 40322, 16777, 20662, 15045, 1766, 13894, 133, 3115, 814, 7941, 26747, 1528, 91736, 6712, 61475, 11341, 33636, 237, 185723, 363, 150643, 124940, 3871, ...

[ 0.1622314453125, 0.097412109375, 0.2147216796875, 0.048187255859375, 0.21337890625, 0.229736328125, 0.23388671875, 0.050872802734375, 0.1705322265625, 0.2281494140625, 0.2152099609375, 0.16259765625, 0.173828125, 0.125, 0.1666259765625, 0.1446533203125, 0.1785888671875, 0.002502441...

embed

70844056_c1

70844056

prolog

1

) exceeded Stack sizes: local: 1.4Mb, global: 0.3Mb, trail: 67Kb Stack depth: 5,534, last-call: 0%, Choice points: 8,270 Possible non-terminating recursion: [5,532] path([length:2|_1460], _1452, []) [5,531] path([length:3|_1494], _1486, []) I think the chain rule is doing 1 -> 2 -> 1 -> 2 -> 1 ... forever. I don't seem...

[ 0.0087890625, 0.0157470703125, -0.004974365234375, 0.027099609375, -0.0004596710205078125, 0.00592041015625, -0.0002651214599609375, -0.0264892578125, 0.0166015625, -0.0654296875, -0.016845703125, 0.0269775390625, -0.00445556640625, 0.0308837890625, 0.024658203125, 0.0068359375, 0.00...

[ 1388, 204839, 297, 6512, 2594, 13267, 4000, 48733, 147197, 7964, 127089, 141037, 12661, 168867, 78646, 10289, 4568, 85763, 83137, 181948, 26847, 104283, 115861, 351, 30524, 26518, 195625, 1830, 125592, 6460, 60875, 23986, 158332, 117444, 304, 501...

[ 0.041900634765625, 0.244140625, 0.1024169921875, 0.141845703125, 0.14697265625, 0.123291015625, 0.06732177734375, 0.011871337890625, 0.07110595703125, 0.070068359375, 0.006866455078125, 0.1744384765625, 0.000457763671875, 0.1549072265625, 0.035400390625, 0.048492431640625, 0.04934692...

embed

14850207_c0

14850207

prolog

0

Title: Deducing facts from a set via a predicate by metaprogramming Problem title: Deducing facts from a set via a predicate by metaprogramming Tags: metaprogramming, prolog Problem: Deducing facts from a set via a predicate by metaprogramming Suppose I have a set of Literals (represented as a list for instance) and a ...

Deducing facts from a set via a predicate by metaprogramming Deducing facts from a set via a predicate by metaprogramming metaprogramming prolog a Deducing deduce_set Set Pred DeducedSet Deducing facts from a set via a predicate by metaprogramming Suppose I have a set of Literals (represented as a list for instance) an...

[ 0.016357421875, -0.0191650390625, 0.00537109375, 0.0155029296875, -0.0225830078125, 0.00946044921875, -0.0206298828125, 0.0167236328125, 0.01202392578125, -0.0458984375, 0.00885009765625, 0.00982666015625, -0.00482177734375, -0.0120849609375, -0.006378173828125, 0.0196533203125, 0.01...

[ 262, 39367, 15824, 7, 1295, 5423, 1829, 1653, 2063, 67, 390, 23550, 28966, 502, 4867, 214, 8, 106357, 3509, 19943, 7145, 294, 126, 135940, 8080, 55247, 5303, 58735, 84079, 3444, 27489, 15659, 16765, 70541, 756, 96362, 66044, 77193, 59911, ...

[ 0.16943359375, 0.209228515625, 0.192138671875, 0.02508544921875, 0.10272216796875, 0.2115478515625, 0.09234619140625, 0.1995849609375, 0.2244873046875, 0.0977783203125, 0.0279388427734375, 0.2061767578125, 0.2344970703125, 0.120849609375, 0.1666259765625, 0.036712646484375, 0.1676025...

embed

22670696_c1

22670696

prolog

1

), female(Mother). % Looks if there are siblings of a person. % Persons are siblings if they have the same father or % if they have the same mother and not the same father. siblings(X,Y) :- ( same_father(X, Y), X \= Y ; same_mother(X, Y), \+ same_father(X, Y) ). % Displays the output of siblings(X,Y) and takes care tha...

[ 0.0010223388671875, 0.0185546875, 0.0234375, 0.000736236572265625, -0.0123291015625, 0.00182342529296875, 0.0021209716796875, -0.00762939453125, -0.0037078857421875, -0.0194091796875, 0.010498046875, -0.0157470703125, -0.0079345703125, 0.00128173828125, 0.01416015625, 0.022216796875, ...

[ 247, 117776, 132, 594, 126340, 194, 1745, 60818, 7, 2174, 2685, 621, 78, 79298, 111, 3445, 5, 15270, 5701, 67373, 42732, 1542, 4, 1723, 15772, 1021, 9319, 990, 1193, 432, 1328, 90045, 140992, 517, 110, 171763, 44116, 76103, 33992, 160054,...

[ 0.045806884765625, 0.1806640625, 0.004913330078125, 0.05352783203125, 0.11865234375, 0.048919677734375, 0.1407470703125, 0.2001953125, 0.1158447265625, 0.06488037109375, 0.075439453125, 0.08740234375, 0.1573486328125, 0.249755859375, 0.04376220703125, 0.1068115234375, 0.0178070068359...

embed

41407226_c0

41407226

prolog

0

Title: How to convert if else to fully declarative in Prolog? Problem title: How to convert if else to fully declarative in Prolog? Tags: logical-purity, prolog, declarative Problem: How to convert if else to fully declarative in Prolog? It's one of my classroom question. I was able to create my own Prolog program with...

How to convert if else to fully declarative in Prolog? How to convert if else to fully declarative in Prolog? logical-purity prolog declarative How Prolog is_spicy Preference Curry Kurma is_fry StirFry Chicken is_chili Sambal Singgang Food Which FoodType Please How to convert if else to fully declarative in Prolog? It'...

[ 0.01043701171875, 0.00823974609375, 0.0162353515625, 0.022216796875, -0.0028076171875, 0.016845703125, -0.00020503997802734375, -0.0081787109375, -0.01141357421875, 0.0155029296875, 0.0263671875, 0.003936767578125, -0.015869140625, -0.00927734375, 0.01806640625, -0.01104736328125, -0...

[ 11249, 47, 96760, 2174, 37076, 89554, 21635, 4935, 23, 1250, 4867, 62775, 289, 4717, 2481, 502, 83, 44689, 2408, 239879, 17065, 1294, 5375, 192, 77843, 2826, 197527, 1861, 150, 3362, 3571, 87760, 34562, 130078, 196707, 30607, 217212, 10002, ...

[ 0.061431884765625, 0.0819091796875, 0.157958984375, 0.2135009765625, 0.2274169921875, 0.1593017578125, 0.1966552734375, 0.1434326171875, 0.064697265625, 0.1378173828125, 0.2445068359375, 0.120361328125, 0.055877685546875, 0.116943359375, 0.090087890625, 0.10205078125, 0.0528259277343...

embed

10134495_c0

10134495

prolog

0

Title: prolog puzzle, can't find error Problem title: prolog puzzle, can't find error Tags: debugging, prolog, puzzle Problem: prolog puzzle, can't find error Here's my code for my assignment, its not working correctly. What it is supposed to do is take a family fact in the form of family(Title,[Name/Speed|_]...

prolog puzzle, can't find error prolog puzzle, can't find error debugging prolog puzzle Title Name Speed assert_family Key Journey TotalTime Person Time Left LTime P1-T1 P2-T2 P1-P2 Right MLeft1 MLeft2 P3-RT MRight List prolog puzzle, can't find error Here's my code for my assignment, its not working correctl...

[ 0.014404296875, -0.00250244140625, -0.0028076171875, 0.01171875, -0.03076171875, 0.0050048828125, -0.01556396484375, 0.01348876953125, -0.0027313232421875, -0.02197265625, -0.00726318359375, 0.0145263671875, 0.006866455078125, 0.0022125244140625, 0.01483154296875, 0.0019378662109375, ...

[ 502, 4867, 104192, 831, 3768, 18, 7413, 18499, 8, 978, 48962, 15757, 63349, 237, 33657, 212122, 26824, 212595, 33867, 70059, 15270, 19055, 2480, 436, 20268, 418, 18504, 304, 90911, 27495, 20503, 22553, 32036, 11853, 759, 18151, 95486, 6863, ...

[ 0.16845703125, 0.2196044921875, 0.206298828125, 0.09002685546875, 0.0576171875, 0.08544921875, 0.1566162109375, 0.2275390625, 0.10736083984375, 0.12548828125, 0.107666015625, 0.0614013671875, 0.167236328125, 0.016754150390625, 0.176025390625, 0.118896484375, 0.087158203125, 0.16455...

embed

37374713_c1

37374713

prolog

1

000)), findall(Subseq-Dis, ea_smallseq_largeseq_dis_h(Sseq,Lseq,10000,Subseq,Dis),Pairs), append(_,[Subseq-Dis|[]],Pairs). ea_smallseq_largeseq_dis_h(Sseq,Lseq,BestSofar1,Subseq,Dis):- same_length(Sseq,Subseq), seq_subseq(Lseq,Subseq), best(_,BestSofar2), ( ( BestSofar2 < BestSofar1) -> accumulate_dis(Sseq,Subseq,BestS...

[ 0.0244140625, 0.015625, -0.0003757476806640625, 0.01116943359375, -0.000827789306640625, 0.00860595703125, -0.026123046875, 0.0135498046875, 0.04248046875, -0.00335693359375, 0.006805419921875, 0.0380859375, 0.0120849609375, 0.0211181640625, 0.00933837890625, -0.002716064453125, 0.01...

[ 2445, 247, 7413, 5584, 96472, 184, 864, 9, 44456, 8394, 69070, 13, 3827, 127, 191281, 8335, 481, 114689, 320, 110601, 8912, 3814, 418, 5701, 23986, 40, 22144, 2965, 10461, 11345, 304, 33079, 183278, 67, 41499, 91569, 32168, 237, 33657, 42...

[ 0.20703125, 0.06024169921875, 0.1876220703125, 0.242431640625, 0.2235107421875, 0.187744140625, 0.2005615234375, 0.042572021484375, 0.1962890625, 0.1610107421875, 0.1373291015625, 0.03704833984375, 0.1837158203125, 0.08575439453125, 0.192138671875, 0.0966796875, 0.1080322265625, 0....

embed

22923052_c0

22923052

prolog

0

Title: Prolog Refine ( to be used in a grammar to parse prop logic formula Problem title: Prolog Refine ( to be used in a grammar to parse prop logic formula Tags: prolog, logic Problem: Prolog Refine ( to be used in a grammar to parse prop logic formula Below is my grammar to parse a propositional logic statement. At ...

Prolog Refine ( to be used in a grammar to parse prop logic formula Prolog Refine ( to be used in a grammar to parse prop logic formula prolog logic the Prolog Refine Not ERROR parser.pl:7 set_predicate_attribute parser.pl:8 parser.pl:9 parser.pl:10 parser.pl:20:20 Syntax Operator parser.pl:21:20 parser.pl:23:17 Illega...

[ 0.0211181640625, -0.005523681640625, -0.0078125, 0.0107421875, 0, 0.0133056640625, 0.005645751953125, -0.003570556640625, 0.000164031982421875, -0.022705078125, 0.0211181640625, 0.002410888671875, -0.01458740234375, -0.0118408203125, 0.016357421875, 0.00970458984375, -0.0155029296875...

[ 1250, 4867, 853, 64552, 11814, 122092, 147, 366, 184, 25793, 62775, 26168, 502, 11205, 151206, 24638, 2189, 2424, 966, 5423, 19714, 2063, 191145, 1019, 1126, 16619, 150922, 891, 86966, 15, 17336, 89261, 289, 63805, 103136, 18499, 44136, 282, ...

[ 0.1849365234375, 0.26318359375, 0.120361328125, 0.26611328125, 0.0977783203125, 0.112060546875, 0.1173095703125, 0.15625, 0.0704345703125, 0.220458984375, 0.1923828125, 0.1435546875, 0.136962890625, 0.07489013671875, 0.1171875, 0.0853271484375, 0.049072265625, 0.04095458984375, 0...

embed

20954389_c0

20954389

prolog

0

Title: Creating and printing a list from dates Problem title: Creating and printing a list from dates Tags: list, date, prolog Problem: Creating and printing a list from dates This is what I've done so far: daycompare(D,D1):- parse_time(D,iso_8601,DateCode) @< parse_time(D1,iso_8601,DateCode1). listdates(P1,P2,D1) :- m...

Creating and printing a list from dates Creating and printing a list from dates list date prolog dates Creating parse_time iso_8601 DateCode DateCode1 Creating and printing a list from dates This is what I've done so far: I'm trying to list out all the dates (D) when (P1) or (P2) message each other. I have so far used ...

[ 0.0167236328125, -0.0074462890625, -0.00433349609375, 0.0322265625, 0.004547119140625, 0.02099609375, -0.029052734375, 0.0228271484375, -0.00433349609375, -0.0206298828125, -0.00762939453125, 0.0020751953125, 0.01007080078125, -0.0087890625, -0.0128173828125, 0.00567626953125, 0.0139...

[ 56781, 136, 2448, 5303, 1295, 112474, 5622, 502, 4867, 366, 184, 6032, 13882, 15276, 6746, 25512, 114211, 418, 2060, 31577, 1810, 756, 397, 683, 17727, 10461, 26008, 12638, 3789, 11814, 70, 1653, 2063, 5155, 277, 16082, 69101, 6626, 25842, ...

[ 0.1126708984375, 0.02618408203125, 0.1551513671875, 0.18994140625, 0.1336669921875, 0.22900390625, 0.1102294921875, 0.1170654296875, 0.166015625, 0.0576171875, 0.007598876953125, 0.1109619140625, 0.1015625, 0.103515625, 0.116943359375, 0.13232421875, 0.158447265625, 0.0299987792968...

embed

74765572_c0

74765572

prolog

0

Title: Non-branching version of 'bagof' Problem title: Non-branching version of 'bagof' Tags: backtracking, sudoku, prolog, clpfd Problem: Non-branching version of 'bagof' I'm trying to implement a sudoku-like puzzle solver that involves groups in prolog, and where one of the rules is that the same ...

Non-branching version of 'bagof' Non-branching version of 'bagof' backtracking sudoku prolog clpfd Non-branching use_module Input Items G-V Group Len all_distinct a-1 b-_ a-_ b-1 a-2 b-2 c-_ a-4 b-3 b-4 a-3 c-1 Non-branching version of 'bagof' I'm trying to implement a sudoku-like puzzle solver that...

[ -0.021484375, 0.018798828125, -0.00341796875, 0.0021209716796875, -0.00732421875, 0.011962890625, -0.00323486328125, -0.017578125, 0.006683349609375, -0.0380859375, -0.0196533203125, 0.0028228759765625, 0.0091552734375, -0.001556396484375, -0.01348876953125, 0.032958984375, -0.003341...

[ 3775, 21684, 59207, 11389, 3768, 120968, 420, 4420, 125728, 214, 8932, 38067, 502, 4867, 39557, 71, 4527, 83279, 7077, 78426, 527, 856, 10760, 18226, 756, 38893, 5759, 5428, 11565, 8316, 31577, 29479, 5062, 104192, 3115, 814, 83687, 94407, ...

[ 0.2021484375, 0.2088623046875, 0.1741943359375, 0.201416015625, 0.044189453125, 0.1805419921875, 0.2685546875, 0.06201171875, 0.1866455078125, 0.025390625, 0.08209228515625, 0.2091064453125, 0.1239013671875, 0.1807861328125, 0.037078857421875, 0.03338623046875, 0.0611572265625, 0.0...

embed

58805565_c1

58805565

prolog

1

'). parent('Yuriy Dolgoruky', 'Mikhail I'). parent('Yuriy Dolgoruky', 'Vsevolod Bolshoe Gnezdo'). parent('Vsevolod Bolshoe Gnezdo', 'Yuriy II'). parent('Vsevolod Bolshoe Gnezdo', 'Yaroslav II'). parent('Vsevolod Bolshoe Gnezdo', 'Konstantin I'). parent('Yaroslav II', 'Andrey'). parent('Andrey', 'Vasiliy'). parent('Vasi...

[ -0.018310546875, 0.01318359375, 0.0177001953125, 0.0201416015625, -0.009765625, -0.00872802734375, -0.0106201171875, 0.0198974609375, -0.0120849609375, -0.0439453125, 0.01214599609375, -0.00799560546875, -0.01483154296875, 0.00225830078125, -0.000682830810546875, -0.0010986328125, 0....

[ 242, 194, 49129, 132, 25, 1723, 1162, 53, 20384, 6504, 34, 1002, 4, 594, 783, 68365, 87, 856, 184, 3784, 2199, 12981, 11412, 13, 527, 19417, 246, 1995, 147, 103073, 42539, 73, 148233, 28563, 21050, 4007, 85751, 1832, 2465, 1336, 2198, ...

[ 0.1553955078125, 0.1768798828125, 0.31884765625, 0.1007080078125, 0.114013671875, 0.1258544921875, 0.2298583984375, 0.185546875, 0.1566162109375, 0.146728515625, 0.151123046875, 0.1942138671875, 0.09649658203125, 0.099853515625, 0.121337890625, 0.274169921875, 0.2099609375, 0.04022...

embed

70131348_c0

70131348

prolog

0

Title: Logical task. Why is my code giving the wrong result? Problem title: Logical task. Why is my code giving the wrong result? Tags: prolog Problem: Logical task. Why is my code giving the wrong result? Unfortunately, I cannot give the full text of the problem for some reason. Therefore, I will try to describe the m...

Logical task. Why is my code giving the wrong result? Logical task. Why is my code giving the wrong result? prolog Logical Why Guests Logical task. Why is my code giving the wrong result? Unfortunately, I cannot give the full text of the problem for some reason. Therefore, I will try to describe the main point. There w...

[ 0.000301361083984375, 0.0233154296875, 0.0206298828125, 0.006744384765625, 0.00927734375, 0.00811767578125, -0.0234375, 0.00151824951171875, 0.016845703125, -0.027099609375, -0.0040283203125, -0.013427734375, 0.0029144287109375, -0.0028076171875, 0.01324462890625, 0.00396728515625, 0...

[ 13146, 21533, 66211, 44084, 83, 759, 18151, 68772, 44691, 16750, 502, 4867, 83054, 7, 185397, 53418, 8337, 4393, 7986, 2967, 31635, 9790, 98363, 5201, 6275, 8622, 509, 10, 162882, 99, 3018, 17155, 1398, 305, 144994, 92610, 21449, 19922, 220...

[ 0.214599609375, 0.18017578125, 0.2030029296875, 0.1741943359375, 0.061767578125, 0.06402587890625, 0.204345703125, 0.101806640625, 0.22021484375, 0.183837890625, 0.1048583984375, 0.153076171875, 0.2431640625, 0.0697021484375, 0.005584716796875, 0.046905517578125, 0.033599853515625, ...

embed

52324647_c0

52324647

prolog

0

Title: How to get rid of duplicates in prolog? Problem title: How to get rid of duplicates in prolog? Tags: prolog Problem: How to get rid of duplicates in prolog? I am new to prolog and I have a hierarchical database that lists employees and their supervisors: employee(employee1, employee4). employee(employee2, employ...

How to get rid of duplicates in prolog? How to get rid of duplicates in prolog? prolog How employee1 employee4 employee2 employee3 employee8 employee5 employee7 employee6 employee9 employee10 Who How to get rid of duplicates in prolog? I am new to prolog and I have a hierarchical database that lists employees and their...

[ 0.004150390625, 0.025146484375, 0.00946044921875, 0.015380859375, -0.00439453125, 0.00592041015625, -0.0186767578125, 0.01434326171875, -0.015869140625, -0.051513671875, -0.0218505859375, 0.01019287109375, 0.0081787109375, 0.01263427734375, 0.003265380859375, 0.010498046875, 0.007202...

[ 11249, 47, 2046, 31351, 111, 171763, 1636, 23, 502, 4867, 32, 188183, 418, 617, 304, 363, 1019, 758, 966, 910, 1126, 963, 40469, 3525, 1791, 54689, 63399, 5303, 93215, 136, 1601, 51858, 3444, 1653, 2063, 35839, 552, 18244, 56, 284, 335,...

[ 0.0955810546875, 0.04638671875, 0.09869384765625, 0.1903076171875, 0.09832763671875, 0.2744140625, 0.1953125, 0.074462890625, 0.1927490234375, 0.25537109375, 0.0155029296875, 0.1468505859375, 0.03179931640625, 0.0784912109375, 0.0321044921875, 0.044097900390625, 0.05059814453125, 0...

embed

54541268_c0

54541268

prolog

0

Title: How to permanently save changes of dynamic predicates to .pl file? (Tau-Prolog) Problem title: How to permanently save changes of dynamic predicates to .pl file? (Tau-Prolog) Tags: tau-prolog, prolog Problem: How to permanently save changes of dynamic predicates to .pl file? (Tau-Prolog) Question - Asserted dyna...

How to permanently save changes of dynamic predicates to .pl file? (Tau-Prolog) How to permanently save changes of dynamic predicates to .pl file? (Tau-Prolog) tau-prolog prolog external internal How Tau-Prolog pl.create session.consult baza.pl session.query load_dyn use_module How to permanently save changes of dynami...

[ 0.02294921875, 0.00885009765625, 0.0106201171875, 0.0164794921875, -0.0140380859375, 0.00762939453125, -0.0157470703125, 0.007354736328125, 0.003082275390625, -0.061767578125, 0.01422119140625, 0.0272216796875, -0.01336669921875, -0.01202392578125, 0.03271484375, 0.0181884765625, 0.0...

[ 11249, 28123, 538, 30098, 65572, 84079, 1653, 2063, 1636, 47, 5, 2424, 11435, 9874, 34, 10752, 4867, 5705, 3454, 502, 173591, 70796, 21139, 9, 6456, 7612, 56002, 147834, 12170, 72367, 17872, 4527, 83279, 62, 16865, 3674, 2301, 18, 7103, 1...

[ 0.0626220703125, 0.189208984375, 0.035919189453125, 0.1881103515625, 0.2001953125, 0.2276611328125, 0.2147216796875, 0.2249755859375, 0.1427001953125, 0.10479736328125, 0.04400634765625, 0.1884765625, 0.138427734375, 0.09332275390625, 0.1761474609375, 0.15673828125, 0.207275390625, ...

embed

43029488_c0

43029488

prolog

0

Title: Read a list from stream using Yap-Prolog Problem title: Read a list from stream using Yap-Prolog Tags: pipe, prolog, stream, yap Problem: Read a list from stream using Yap-Prolog I want to run a (python3) process from my (yap) prolog script and read its output formatted as a list of integers, e.g. [1,2,3,4,5,6] ...

Read a list from stream using Yap-Prolog Read a list from stream using Yap-Prolog pipe prolog stream yap BrokenPipeError stream Yap-Prolog Read process_create python3 my_script.py MyParam Out OutputList PL_unify_term PL_int64 Exception _io.TextIOWrapper UTF-8 Errno Broken constant_term read_term read_string Read a list...

[ 0.021728515625, 0.000888824462890625, -0.002685546875, 0.0029754638671875, -0.01507568359375, -0.0142822265625, 0.0030364990234375, -0.00860595703125, -0.011962890625, -0.0299072265625, 0.01239013671875, -0.0035400390625, -0.0128173828125, 0.0037994384765625, 0.018310546875, -0.0105590...

[ 4764, 5303, 1295, 75973, 17368, 47246, 10752, 4867, 137158, 502, 15850, 13177, 1098, 683, 48672, 18468, 31611, 9433, 7612, 2182, 17198, 50828, 363, 759, 32032, 6493, 2646, 55292, 39, 13538, 7077, 154663, 33106, 309, 40383, 32166, 4288, 13307,...

[ 0.1920166015625, 0.2037353515625, 0.165283203125, 0.253173828125, 0.06494140625, 0.2529296875, 0.1558837890625, 0.2171630859375, 0.159912109375, 0.121826171875, 0.19189453125, 0.1475830078125, 0.04296875, 0.0771484375, 0.1234130859375, 0.110595703125, 0.009124755859375, 0.143188476...

embed

40821462_c0

40821462

prolog

0

Title: Why doesn't it unify? Prolog issue Problem title: Why doesn't it unify? Prolog issue Tags: prolog, polynomials Problem: Why doesn't it unify? Prolog issue I'm trying to do a predicate in prolog which substitute the value I give to the variables of the polynomial and then it calculate the result. Here i...

Why doesn't it unify? Prolog issue Why doesn't it unify? Prolog issue prolog polynomials Why Prolog as_monomial Vars compress_monomial ordina_m List Sorted ordina_var compress_monomial2 is_monomial VPs is_list is_polynomial Monomio Poly1 Result as_polynomial Result1 compress_polynomial compress_polynomial2 po...

[ -0.01348876953125, -0.0033721923828125, 0.025390625, 0.00124359130859375, 0.00811767578125, 0.0045166015625, -0.0032958984375, -0.0196533203125, 0.0194091796875, -0.01318359375, 0.0101318359375, 0.0198974609375, -0.0015869140625, -0.0194091796875, -0.0054931640625, 0.0037078857421875, ...

[ 44084, 22027, 3768, 18, 442, 51, 40383, 1250, 4867, 31089, 502, 35874, 1687, 15403, 237, 64176, 266, 3323, 375, 11856, 289, 23335, 39, 32036, 53666, 1961, 304, 83, 41195, 6562, 135545, 77879, 35883, 63306, 418, 126684, 1405, 2667, 310, 47...

[ 0.0994873046875, 0.080810546875, 0.0064697265625, 0.09576416015625, 0.060394287109375, 0.1453857421875, 0.1968994140625, 0.1341552734375, 0.2281494140625, 0.10211181640625, 0.09600830078125, 0.1595458984375, 0.1112060546875, 0.09423828125, 0.05877685546875, 0.069580078125, 0.06677246...

embed

54071696_c0

54071696

prolog

0

Title: Prolog maze problem : code gives infinite paths from start to end and doesn't backtrack Problem title: Prolog maze problem : code gives infinite paths from start to end and doesn't backtrack Tags: maze, prolog Problem: Prolog maze problem : code gives infinite paths from start to end and doesn't backtr...

Prolog maze problem : code gives infinite paths from start to end and doesn't backtrack Prolog maze problem : code gives infinite paths from start to end and doesn't backtrack maze prolog start Prolog Dest Row0 Col0 Row1 Col1 Path next_move Rnew Cnew is_available Ret Prolog maze problem : code gives infinite ...

[ 0.0224609375, 0.005279541015625, 0.01251220703125, 0.0074462890625, -0.0020599365234375, 0.00994873046875, 0.00640869140625, 0.006439208984375, 0.0174560546875, -0.047119140625, 0.013671875, 0.0296630859375, 0.002532958984375, -0.003814697265625, 0.02490234375, 0.0125732421875, 0.007...

[ 1250, 4867, 291, 731, 2967, 18151, 76199, 54241, 60875, 7, 4034, 3564, 22027, 3768, 18, 4420, 125728, 13, 502, 262, 271, 96190, 108421, 11737, 432, 54936, 5528, 379, 47131, 1295, 86869, 214, 11675, 1528, 127877, 26785, 5117, 1733, 51776, ...

[ 0.1693115234375, 0.2333984375, 0.10009765625, 0.1778564453125, 0.1734619140625, 0.1328125, 0.0814208984375, 0.1138916015625, 0.1822509765625, 0.013580322265625, 0.04595947265625, 0.10675048828125, 0.045013427734375, 0.003509521484375, 0.056884765625, 0.1162109375, 0.1802978515625, ...

embed

23071799_c0

23071799

prolog

0

Title: Prolog: Swap first and last elements in list Problem title: Prolog: Swap first and last elements in list Tags: dcg, prolog Problem: Prolog: Swap first and last elements in list I'm trying to write a program that swaps the 1st and last elements. The function takes 2 parameters. A list and a variable that's displa...

Prolog: Swap first and last elements in list Prolog: Swap first and last elements in list dcg prolog Prolog Swap GET HEAD LAST TAIL ELEM REMOVED ELEMENT NEW_LASTELEMENT WILL NEWHEAD CUT END OFF REST Prolog: Swap first and last elements in list I'm trying to write a program that swaps the 1st and last elements. The func...

[ 0.019775390625, 0.0196533203125, 0.01263427734375, 0.005615234375, -0.0198974609375, 0.006988525390625, -0.0257568359375, 0.002593994140625, 0.0135498046875, 0.004669189453125, 0.00726318359375, 0, -0.021484375, 0.000865936279296875, 0.01324462890625, 0.0008087158203125, 0.0109863281...

[ 1250, 4867, 43062, 254, 5117, 136, 4568, 80854, 5303, 104, 238, 177, 502, 79794, 572, 188328, 172905, 12998, 16444, 241, 100191, 9069, 12013, 9780, 124661, 80111, 46705, 98395, 33827, 57912, 841, 313, 17632, 39015, 111031, 21828, 23, 31577, ...

[ 0.156982421875, 0.21875, 0.2144775390625, 0.0941162109375, 0.1494140625, 0.1124267578125, 0.231201171875, 0.2109375, 0.2039794921875, 0.006591796875, 0.008819580078125, 0.06640625, 0.1229248046875, 0.041351318359375, 0.0718994140625, 0.1588134765625, 0.1553955078125, 0.135620117187...

embed

38371779_c0

38371779

prolog

0

Title: How to print out a limited number of searches in Prolog Problem title: How to print out a limited number of searches in Prolog Tags: prolog Problem: How to print out a limited number of searches in Prolog I have following data: item(one, 50, 40). item(two, 80, 70). item(three, 100, 55). item(four, 50, 45). item(...

How to print out a limited number of searches in Prolog How to print out a limited number of searches in Prolog prolog How Prolog head2 nth0 Item How to print out a limited number of searches in Prolog I have following data: I use following command to display all values: However, it displays all items. This can be a pr...

[ 0.00689697265625, 0.0103759765625, 0.01025390625, -0.005035400390625, 0.00421142578125, 0.0003261566162109375, -0.005767822265625, -0.007232666015625, 0.0076904296875, -0.0233154296875, 0.01336669921875, -0.0272216796875, 0.0164794921875, 0.001617431640625, 0.0296630859375, 0.000240325...

[ 11249, 28412, 1810, 84046, 14012, 33938, 90, 1250, 4867, 502, 10336, 304, 927, 2389, 78426, 23, 25632, 2053, 75101, 44116, 756, 142424, 33306, 55769, 831, 2967, 75281, 6044, 112820, 138, 36917, 111607, 5584, 100, 51347, 26040, 541, 36998, 6...

[ 0.041595458984375, 0.1953125, 0.1412353515625, 0.2110595703125, 0.152587890625, 0.2264404296875, 0.13232421875, 0.178955078125, 0.25244140625, 0.1270751953125, 0.1348876953125, 0.07110595703125, 0.100341796875, 0.07818603515625, 0.1275634765625, 0.048370361328125, 0.021759033203125, ...

embed

60699241_c1

60699241

prolog

1

station('OC',[bakerloo,central,victoria]).%Oxford Circus on the Bakerloo, Central and Victoria Lines station('PA',[bakerloo]).%Paddington on the Bakerloo Line station('TC',[central,northern]).%Tottenham Court Road on the Central and Northern Lines station('VI',[victoria]).%Victoria on the Victoria Line station('WA',[b...

[ -0.00054931640625, -0.00811767578125, 0.016357421875, 0.028076171875, 0.01025390625, -0.008544921875, 0.00157928466796875, -0.0028533935546875, 0.01171875, -0.044189453125, -0.0189208984375, 0.000732421875, -0.024658203125, -0.00823974609375, -0.0033416748046875, -0.006103515625, 0.0...

[ 29398, 132, 25, 29065, 4, 10075, 56, 47673, 58905, 21605, 13333, 268, 194, 3949, 205061, 79512, 223, 98, 70, 133840, 15881, 136, 31485, 16777, 7, 12236, 113954, 71, 42562, 20499, 13665, 9319, 19, 7763, 12216, 3915, 52341, 17119, 182688, 1...

[ 0.258056640625, 0.0185699462890625, 0.049591064453125, 0.210205078125, 0.015350341796875, 0.1053466796875, 0.120361328125, 0.228271484375, 0.1331787109375, 0.089599609375, 0.1756591796875, 0.00341796875, 0.06201171875, 0.0673828125, 0.22607421875, 0.19482421875, 0.16015625, 0.08282...

embed

70705978_c0

70705978

prolog

0

Title: Using NOT in Pytholog Problem title: Using NOT in Pytholog Tags: logic, python, prolog Problem: Using NOT in Pytholog I recently fell in love with Prolog when introduced to Symbolic A.I. I think that if Python can combine with Prolog, I can be able to make A.I. understand things. I found the library "Pytholog", ...

Using NOT in Pytholog Using NOT in Pytholog logic python prolog pytholog Using NOT medicine_bash pl.KnowledgeBase new_med peptic_ulcer should_not_take Person Drug Precondition should_take suffers_from Symptom medicine_bash.query pl.Expr Using NOT in Pytholog I recently fell in love with Prolog when introduced to Symbol...

[ 0.00823974609375, 0.01239013671875, 0.015869140625, 0.025390625, -0.00634765625, 0.003997802734375, 0.0093994140625, 0.00238037109375, -0.015625, -0.047607421875, -0.0062255859375, 0.00531005859375, -0.0036773681640625, 0.004669189453125, 0.0035552978515625, -0.00274658203125, 0.0103...

[ 345, 86725, 23, 27512, 927, 14071, 62775, 17198, 50828, 502, 4867, 54411, 87109, 6456, 35613, 181606, 63473, 3525, 4806, 280, 112569, 202, 3443, 5608, 10869, 78219, 15270, 125183, 1914, 126940, 134729, 149450, 19279, 10287, 77736, 5161, 1250, ...

[ 0.111083984375, 0.306884765625, 0.06396484375, 0.1475830078125, 0.1295166015625, 0.2491455078125, 0.1630859375, 0.093017578125, 0.11865234375, 0.09014892578125, 0.209716796875, 0.188720703125, 0.1199951171875, 0.008544921875, 0.02069091796875, 0.042327880859375, 0.0965576171875, 0....

embed

23188384_c0

23188384

prolog

0

Title: How to find list of shortest length from an infinite set (Prolog) Problem title: How to find list of shortest length from an infinite set (Prolog) Tags: iterative-deepening, prolog, shortest-path Problem: How to find list of shortest length from an infinite set (Prolog) I have a Prolog function path(A,B,Path) th...

How to find list of shortest length from an infinite set (Prolog) How to find list of shortest length from an infinite set (Prolog) iterative-deepening prolog shortest-path an How Prolog Path MinPath How to find list of shortest length from an infinite set (Prolog) I have a Prolog function path(A,B,Path) that yields al...

[ 0.0238037109375, -0.00634765625, 0.02587890625, -0.0030059814453125, 0.006744384765625, -0.006561279296875, 0.023193359375, -0.0162353515625, 0.023681640625, -0.0556640625, 0.007080078125, 0.0089111328125, 0.005218505859375, 0.0004215240478515625, 0.0035247802734375, 0.0211181640625, ...

[ 11249, 7413, 5303, 111, 16610, 525, 140909, 1295, 54241, 13, 5423, 10752, 4867, 720, 45023, 123041, 33, 502, 128405, 1250, 108421, 4211, 683, 10519, 32354, 60875, 571, 11180, 19388, 35604, 45443, 62, 47, 335, 140992, 33342, 1884, 139392, 20...

[ 0.034912109375, 0.1190185546875, 0.1937255859375, 0.03741455078125, 0.2244873046875, 0.1807861328125, 0.195068359375, 0.08367919921875, 0.1431884765625, 0.061004638671875, 0.1805419921875, 0.13427734375, 0.217529296875, 0.08038330078125, 0.039154052734375, 0.036376953125, 0.026565551...

embed

67672961_c0

67672961

prolog

0

Title: How to get a specific value from a database? Problem title: How to get a specific value from a database? Tags: prolog Problem: How to get a specific value from a database? I want to get the weight of an user who is saved on usersData usersData([]). :-dynamic usersData/1. buildUser(Id, Name, Age, Weight, Height, ...

How to get a specific value from a database? How to get a specific value from a database? prolog a How Name Age Weight Height Plan Training User Data What Current NewWeight Press Enter System.out.println You How to get a specific value from a database? I want to get the weight of an user who is saved on usersData and c...

[ 0.01043701171875, 0.00750732421875, -0.00390625, 0.0179443359375, -0.00396728515625, 0.03662109375, -0.0128173828125, 0.00689697265625, 0.00148773193359375, -0.035888671875, -0.000637054443359375, 0.010986328125, -0.0203857421875, -0.041015625, 0.010498046875, -0.009033203125, 0.0378...

[ 11249, 47, 2046, 10, 29458, 34292, 1295, 63399, 502, 4867, 15757, 72944, 150533, 1529, 22553, 5586, 44284, 53400, 11809, 4865, 114063, 2356, 12137, 21072, 60816, 12353, 6056, 35662, 2583, 3444, 57888, 38937, 57, 4126, 72095, 137989, 69101, 43...

[ 0.1182861328125, 0.0953369140625, 0.1942138671875, 0.0745849609375, 0.262939453125, 0.248779296875, 0.1673583984375, 0.259521484375, 0.087890625, 0.1263427734375, 0.042694091796875, 0.0694580078125, 0.2161865234375, 0.0709228515625, 0.145751953125, 0.12109375, 0.1221923828125, 0.09...

embed

2044643_c0

2044643

prolog

0

Title: Prolog Arguments are not sufficiently instantiated Problem title: Prolog Arguments are not sufficiently instantiated Tags: prolog, instantiation-error Problem: Prolog Arguments are not sufficiently instantiated I'm trying to match a subset of the facts I'm creating, and my testcase was working great! x([1,2,3,4]...

Prolog Arguments are not sufficiently instantiated Prolog Arguments are not sufficiently instantiated prolog instantiation-error Prolog Arguments bleah2 bleah8 bleah3 bleah5 bleah6 Output REST ERROR Exception _G260 Execution Aborted _G270 Prolog Arguments are not sufficiently instantiated I'm trying to match a subset o...

[ 0.0174560546875, 0.016845703125, 0.00104522705078125, -0.005615234375, -0.0037841796875, 0.00958251953125, -0.00384521484375, -0.000949859619140625, 0.031494140625, 0.023681640625, 0.0296630859375, 0.008056640625, -0.011474609375, -0.010986328125, 0.00927734375, -0.01055908203125, 0....

[ 1250, 4867, 112140, 7, 959, 129980, 538, 34648, 14, 502, 188800, 2586, 1366, 304, 1019, 363, 758, 910, 13538, 627, 21828, 151206, 24638, 5443, 63928, 724, 97544, 211603, 3422, 3674, 104283, 27686, 31577, 14858, 1614, 3509, 15824, 105233, 75...

[ 0.1669921875, 0.240234375, 0.244384765625, 0.03363037109375, 0.10107421875, 0.1708984375, 0.04400634765625, 0.154052734375, 0.129150390625, 0.1396484375, 0.1705322265625, 0.129150390625, 0.05224609375, 0.06689453125, 0.1217041015625, 0.04522705078125, 0.05712890625, 0.0474548339843...

embed

15083028_c0

15083028

prolog

0

Title: Is there an automatic parallel prolog implementation? Problem title: Is there an automatic parallel prolog implementation? Tags: concurrency, parallel-processing, prolog, multithreading, logic Problem: Is there an automatic parallel prolog implementation? I'm currently doing some research in theoretical computer...

Is there an automatic parallel prolog implementation? Is there an automatic parallel prolog implementation? concurrency parallel-processing prolog multithreading logic Is there an automatic parallel prolog implementation? I'm currently doing some research in theoretical computer science, and one of the main tools I'm u...

[ 0.0218505859375, 0.01904296875, 0.01214599609375, -0.0037384033203125, -0.0277099609375, 0.01544189453125, 0.0035400390625, -0.01318359375, -0.009033203125, -0.061767578125, -0.0032501220703125, 0.025390625, -0.0115966796875, -0.002899169921875, 0.008056640625, 0.005950927734375, 0.0...

[ 2071, 2685, 142, 101038, 95103, 502, 4867, 208124, 108636, 982, 63923, 3869, 65847, 62775, 25188, 4524, 41664, 5201, 72977, 17368, 106480, 3535, 32562, 4552, 63773, 109921, 2837, 66187, 75161, 55042, 50930, 33938, 20949, 5792, 72803, 12921, 468...

[ 0.035919189453125, 0.0753173828125, 0.06549072265625, 0.267578125, 0.285888671875, 0.197265625, 0.255859375, 0.2327880859375, 0.1097412109375, 0.06182861328125, 0.05419921875, 0.05438232421875, 0.09271240234375, 0.0845947265625, 0.051788330078125, 0.00701904296875, 0.0215911865234375...

embed

51846556_c1

51846556

prolog

1

argument is a list of operations and the second list is a list of shapes. It recursively goes over the list of operations getting the shape ids on both sides of the operation. eg circle 1 - below - sqaure 1 and sends the two shapes to the correct function to calculate the locations using CLPFD. For two shapes with a r...

[ -0.009765625, 0.00823974609375, -0.00970458984375, 0.028076171875, -0.00775146484375, 0.0196533203125, 0.005859375, 0.00933837890625, 0.0289306640625, 0.01470947265625, 0.01507568359375, 0.003509521484375, 0.0147705078125, -0.0179443359375, 0.0003204345703125, 0.0003299713134765625, ...

[ 10750, 83, 5303, 41018, 7, 17932, 10, 111, 115700, 1650, 195625, 5844, 645, 20949, 3447, 98, 15044, 5609, 42154, 133, 106, 35064, 5498, 3408, 25379, 6626, 47, 70, 26785, 32354, 74481, 67, 31913, 17368, 46323, 41265, 397, 35845, 19069, 214...

[ 0.38232421875, 0.10400390625, 0.2384033203125, 0.202392578125, 0.07373046875, 0.1666259765625, 0.00482177734375, 0.005340576171875, 0.2484130859375, 0.0130615234375, 0.08038330078125, 0.01904296875, 0.0545654296875, 0.056427001953125, 0.1602783203125, 0.0003662109375, 0.0634765625, ...

embed

43528158_c1

43528158

prolog

1

:- verify(eats_meat), !. carnivore :- verify(has_pointed_teeth), verify(has_claws), verify(has_forward_eyes). ungulate :- mammal, verify(has_hooves), !. ungulate :- mammal, verify(chews_cud). /* how to ask questions */ ask(Question) :- write('Does the animal have the following attribute: '), write(Question), write('? ...

[ 0.0106201171875, 0.0302734375, -0.004058837890625, 0.02392578125, -0.004119873046875, 0.006195068359375, 0.01190185546875, 0.013427734375, -0.004608154296875, -0.0162353515625, 0.020263671875, 0.00933837890625, -0.00921630859375, -0.01177978515625, 0.0230712890625, 0.009033203125, 0....

[ 15772, 493, 40383, 13, 9821, 282, 257, 711, 2258, 93, 104297, 10557, 38496, 67, 12421, 18347, 19725, 2472, 19364, 31463, 127728, 19309, 21968, 141, 68336, 3132, 1430, 1010, 71, 3642, 26458, 17582, 195136, 33022, 8331, 90, 70, 26249, 765, ...

[ 0.09844970703125, 0.2025146484375, 0.2464599609375, 0.0950927734375, 0.1103515625, 0.1077880859375, 0.074951171875, 0.048004150390625, 0.084228515625, 0.08251953125, 0.1912841796875, 0.1146240234375, 0.149658203125, 0.09124755859375, 0.1400146484375, 0.126708984375, 0.08349609375, ...

embed

53934948_c1

53934948

prolog

1

, Place], % because entities 1468, 1052, 1069 are Places [ relationship(wasIn, id_0, 1468), relationship(wasIn, id_0, 1052), relationship(wasIn, id_0, 1069)] ], [ [id_0, wasIn, Some Other Subject Label], [relationship(wasIn, id_0, ...), ...] ], [ [1468, wasIn, Place], [relationship(wasIn, 1468, ...), ...] ], ... ] and ...

[ -0.007354736328125, -0.000568389892578125, 0.003814697265625, 0.00396728515625, -0.0169677734375, -0.00244140625, 0.00023365020751953125, -0.0021820068359375, 0.017333984375, -0.041015625, -0.020751953125, 0.013427734375, -0.01177978515625, -0.037353515625, 0.0036163330078125, 0.018676...

[ 4, 41076, 1745, 6637, 77630, 2449, 616, 16028, 209, 12744, 14212, 621, 7, 76755, 13689, 4153, 3447, 2389, 90419, 69622, 84772, 532, 509, 64511, 94341, 129214, 57860, 157041, 5036, 145755, 47, 21115, 390, 28368, 136, 10644, 4734, 25627, 1717...

[ 0.00201416015625, 0.233642578125, 0.1275634765625, 0.0740966796875, 0.1844482421875, 0.087890625, 0.157958984375, 0.27685546875, 0.1170654296875, 0.2489013671875, 0.2587890625, 0.0634765625, 0.10272216796875, 0.2147216796875, 0.135986328125, 0.2266845703125, 0.05596923828125, 0.115...

embed

37648917_c0

37648917

prolog

0

Title: Prolog- nested if and else replacement Problem title: Prolog- nested if and else replacement Tags: prolog Problem: Prolog- nested if and else replacement I have a grid which it's size(N,M) and my goal is to find the first cells that are in the same row and column example: if i have a cell in the middle of the bo...

Prolog- nested if and else replacement Prolog- nested if and else replacement prolog Prolog Y-1 X-1 Assign in_grid neighbor1 Prolog- nested if and else replacement I have a grid which it's size(N,M) and my goal is to find the first cells that are in the same row and column example: if i have a cell in the middle of the...

[ -0.00775146484375, 0.0093994140625, 0.020263671875, 0.004486083984375, 0.01007080078125, -0.00982666015625, -0.002227783203125, 0.0322265625, 0.003387451171875, 0.00139617919921875, 0.00762939453125, 0.00518798828125, -0.0179443359375, 0.005767822265625, 0.011474609375, 0.00439453125, ...

[ 1250, 4867, 8512, 71, 2174, 136, 37076, 91995, 9, 502, 990, 5759, 1193, 1301, 31304, 23, 120067, 208244, 418, 13267, 839, 594, 69236, 7413, 5117, 38750, 7, 621, 5701, 15555, 3365, 316, 27781, 86991, 45443, 22759, 10932, 156634, 79259, 979...

[ 0.169677734375, 0.2442626953125, 0.263671875, 0.1488037109375, 0.209716796875, 0.166748046875, 0.2086181640625, 0.1763916015625, 0.0089111328125, 0.11279296875, 0.0716552734375, 0.07073974609375, 0.0140533447265625, 0.00616455078125, 0.1859130859375, 0.156494140625, 0.251220703125, ...

embed

65180949_c1

65180949

prolog

1

] L = [[1, 2, 2], [2, 2, 3], [2, 3, 2], [3, 2, 2], [2, 2, 4], [2, 4, 2], [4, 2, 2], [2, 2, 3]] I checked all my predicates and they all seem to work (at least for the test cases I'm using), the problem occurs with the check predicate. It seems to work fine until it gets to N>=P (when this is NOT true, works fine when i...

[ -0.005340576171875, 0.0023956298828125, 0.0054931640625, -0.0146484375, -0.0150146484375, 0.01611328125, 0.0017242431640625, -0.006378173828125, 0.01202392578125, -0.020751953125, 0.0174560546875, 0.021728515625, 0.0023651123046875, 0.000461578369140625, -0.004791259765625, 0.011291503...

[ 339, 2203, 418, 116, 304, 138, 122101, 201, 617, 12765, 756, 759, 1653, 2063, 1636, 48903, 4488, 19713, 3034, 50218, 17368, 2967, 74918, 67, 37202, 5885, 24189, 62163, 47, 541, 2740, 1369, 683, 86725, 29568, 43240, 41206, 1528, 11737, 137...

[ 0.1890869140625, 0.09222412109375, 0.02978515625, 0.07513427734375, 0.038818359375, 0.10498046875, 0.0141448974609375, 0.079345703125, 0.059539794921875, 0.266845703125, 0.039825439453125, 0.033782958984375, 0.1827392578125, 0.2132568359375, 0.0693359375, 0.04730224609375, 0.11193847...

embed

54688982_c1

54688982

prolog

1

new Query("consult", new Term[]{new Atom("/home/mark/Documents/JavaProjects/SudokuSolver/src/com/company/sudoku.pl")}); System.out.println("consult " + (q0.hasSolution() ? "succeeded" : "failed")); // Query q1 = new Query("problem(1, Rows), sudoku(Rows)."); Query q1 = new Query("sudoku", rowsTerm); System.out.println(...

[ 0.0198974609375, 0.027099609375, 0.00799560546875, 0.020751953125, -0.02197265625, -0.0196533203125, 0.0034332275390625, -0.0023345947265625, 0.003692626953125, -0.0311279296875, 0.0002899169921875, -0.005523681640625, -0.002777099609375, -0.017578125, -0.0245361328125, 0.0181884765625...

[ 3525, 58836, 53, 147834, 2994, 39, 54936, 69728, 29552, 10015, 239469, 7, 156202, 223353, 294, 11547, 319, 102588, 814, 19437, 277, 146365, 2424, 3142, 12353, 6056, 35662, 19, 997, 864, 2389, 10557, 34, 16, 705, 1159, 39884, 297, 58, 1205...

[ 0.1160888671875, 0.208251953125, 0.1246337890625, 0.28076171875, 0.1417236328125, 0.07916259765625, 0.052154541015625, 0.1746826171875, 0.0294647216796875, 0.1317138671875, 0.0311431884765625, 0.042205810546875, 0.2025146484375, 0.135498046875, 0.0592041015625, 0.1658935546875, 0.215...

embed

26484974_c0

26484974

prolog

0

Title: How to compare user input with rules and facts? Problem title: How to compare user input with rules and facts? Tags: prolog Problem: How to compare user input with rules and facts? i want to build this solution: Prolog ask me for my preferred weather dates and show me the best match (not the exact match, depends...

How to compare user input with rules and facts? How to compare user input with rules and facts? prolog How Monday Tuesday Wednesday Ask Questions How to compare user input with rules and facts? i want to build this solution: Prolog ask me for my preferred weather dates and show me the best match (not the exact match, d...

[ 0.00148773193359375, -0.01080322265625, 0.01165771484375, 0.01806640625, -0.00372314453125, 0.007568359375, 0.0002002716064453125, 0.00689697265625, 0.006439208984375, -0.01220703125, 0.005950927734375, 0.0238037109375, -0.007049560546875, 0.010009765625, 0.0087890625, 0.00373840332031...

[ 11249, 47, 69101, 38937, 107730, 678, 91736, 136, 15824, 7, 502, 4867, 68318, 97001, 64227, 105219, 68185, 3444, 45367, 29806, 1250, 26458, 163, 759, 12601, 92949, 112474, 7639, 2965, 14858, 24763, 56566, 79385, 27781, 5303, 1884, 442, 8010, ...

[ 0.1156005859375, 0.06854248046875, 0.240966796875, 0.188720703125, 0.2396240234375, 0.146484375, 0.197509765625, 0.1077880859375, 0.209228515625, 0.045074462890625, 0.1456298828125, 0.2386474609375, 0.1190185546875, 0.1240234375, 0.1556396484375, 0.1510009765625, 0.197998046875, 0....

embed

76183029_c0

76183029

prolog

0

Title: Do Prolog variables within 'nested' predicates co-refer? Problem title: Do Prolog variables within 'nested' predicates co-refer? Tags: prolog, variables Problem: Do Prolog variables within 'nested' predicates co-refer? In the following code, I have two occurrences of the 'state' predicate wit...

Do Prolog variables within 'nested' predicates co-refer? Do Prolog variables within 'nested' predicates co-refer? prolog variables Prolog can_do Photographer_location Camera_location Holding_camera_or_not CameraState Last_place_photographed Place Do Prolog variables within 'nested' predicates co-ref...

[ -0.0111083984375, 0.01263427734375, -0.0076904296875, 0.0091552734375, -0.0150146484375, 0.021240234375, -0.0048828125, -0.00933837890625, 0.0167236328125, -0.034912109375, -0.00836181640625, 0.01397705078125, -0.00823974609375, 0.007171630859375, 0.00848388671875, -0.0042724609375, ...

[ 984, 1250, 4867, 77336, 7, 28032, 3768, 86, 14437, 1653, 2063, 1636, 552, 107, 2875, 502, 831, 246, 143965, 56, 87632, 44813, 73436, 124999, 748, 10869, 135206, 21672, 23935, 57595, 41382, 41076, 9, 18151, 6626, 74918, 61340, 67, 70731, 4...

[ 0.06475830078125, 0.174560546875, 0.265869140625, 0.2646484375, 0.0183868408203125, 0.1468505859375, 0.0958251953125, 0.16064453125, 0.187255859375, 0.164306640625, 0.1873779296875, 0.0775146484375, 0.166259765625, 0.1104736328125, 0.20849609375, 0.1434326171875, 0.135009765625, 0....

embed

6709488_c0

6709488

prolog

0

Title: prolog programming there is someone? Problem title: prolog programming there is someone? Tags: prolog Problem: prolog programming there is someone? maintaining a variable sorry for my English this is my code stampa_diagnosi(X) :- gia_chiesto(S, 'si'), sintomo(S, M), not(sintomo(S, X)), M \= X, nl, write('Una pos...

prolog programming there is someone? prolog programming there is someone? prolog stampa_diagnosi gia_chiesto Una Possibile cura1 cura2 cura3 centaurea_minore prolog programming there is someone? maintaining a variable sorry for my English this is my code how do I maintain the value of X of diagnosis that is lost when I...

[ 0.0174560546875, 0.0096435546875, 0.0054931640625, 0.02392578125, -0.0001220703125, 0.00726318359375, 0.002532958984375, 0.01251220703125, 0.014892578125, -0.039306640625, 0.0245361328125, -0.0152587890625, -0.012939453125, -0.016357421875, 0.0224609375, 0.025146484375, 0.02807617187...

[ 502, 4867, 56037, 449, 2685, 83, 22008, 58176, 47099, 14, 3529, 1861, 32296, 4228, 115861, 5462, 13943, 418, 304, 363, 21126, 916, 1283, 1249, 4524, 76104, 214, 77336, 59090, 14941, 18151, 3642, 54, 34292, 111, 1193, 164, 72856, 26458, 96...

[ 0.1552734375, 0.23291015625, 0.17724609375, 0.1287841796875, 0.1436767578125, 0.1156005859375, 0.1748046875, 0.190673828125, 0.161865234375, 0.042083740234375, 0.0872802734375, 0.0643310546875, 0.096923828125, 0.054534912109375, 0.115478515625, 0.0926513671875, 0.1376953125, 0.0001...

embed

69740530_c0

69740530

prolog

0

Title: Replacing elements in matrix in prolog Problem title: Replacing elements in matrix in prolog Tags: prolog, matrix Problem: Replacing elements in matrix in prolog I am new to prolog and I'm trying to create a specific matrix. What I already have: a matrix filled with all 0-s a list of pairs of number, for expl. [...

Replacing elements in matrix in prolog Replacing elements in matrix in prolog prolog matrix Replacing RowId ColumnId Value ResultMx ListOfPairs ResMx I-J Tail Res Res1 Res2 Replacing elements in matrix in prolog I am new to prolog and I'm trying to create a specific matrix. What I already have: a matrix filled with all...

[ -0.01397705078125, 0.01177978515625, 0.016357421875, -0.0123291015625, -0.006866455078125, -0.00016880035400390625, -0.033447265625, 0.01708984375, 0.01361083984375, -0.005126953125, 0.0087890625, 0.0211181640625, -0.0020294189453125, -0.035888671875, 0.007720947265625, 0.0009765625, ...

[ 853, 133266, 80854, 23, 50944, 425, 502, 4867, 96190, 568, 71, 233987, 190060, 126684, 594, 32036, 132887, 8335, 481, 9624, 87, 9, 1375, 1218, 379, 418, 304, 3525, 31577, 28282, 21771, 765, 152382, 756, 757, 5303, 80836, 14012, 115727, 10...

[ 0.0828857421875, 0.173095703125, 0.207763671875, 0.043792724609375, 0.2086181640625, 0.112060546875, 0.173583984375, 0.23583984375, 0.1571044921875, 0.07257080078125, 0.062744140625, 0.1353759765625, 0.1341552734375, 0.1605224609375, 0.036712646484375, 0.0767822265625, 0.0947265625, ...

embed

51009766_c0

51009766

prolog

0

Title: How to use if statement - loops Problem title: How to use if statement - loops Tags: prolog, loops Problem: How to use if statement - loops i am trying to understand how to use if statement or loops in prolog but i can't get it,cause there are a bunch of different situations.Example in java if you want to say so...

How to use if statement - loops How to use if statement - loops prolog loops How List1 List2 How to use if statement - loops i am trying to understand how to use if statement or loops in prolog but i can't get it,cause there are a bunch of different situations.Example in java if you want to say something you could say ...

[ 0.021728515625, -0.004638671875, -0.0128173828125, 0.0186767578125, 0.003082275390625, 0.02490234375, 0.0035400390625, 0.0218505859375, 0.01104736328125, 0.00506591796875, -0.003509521484375, -0.0224609375, -0.0137939453125, 0.0076904296875, 0.00970458984375, 0.0033416748046875, 0.01...

[ 11249, 47, 4527, 2174, 63805, 20, 40956, 7, 502, 4867, 32036, 418, 304, 28219, 3642, 23, 831, 2046, 12921, 113949, 11, 79, 330, 3444, 5154, 5809, 72546, 425, 2740, 107947, 37076, 54, 204610, 24189, 29557, 5941, 37348, 34735, 81979, 106, ...

[ 0.072021484375, 0.01055908203125, 0.16943359375, 0.231201171875, 0.25927734375, 0.046356201171875, 0.2205810546875, 0.07147216796875, 0.147216796875, 0.211669921875, 0.1260986328125, 0.05755615234375, 0.1123046875, 0.039093017578125, 0.013885498046875, 0.015716552734375, 0.0324401855...

embed

22851732_c0

22851732

prolog

0

Title: Optimal planning with incrementally tabled abductive logic programming Problem title: Optimal planning with incrementally tabled abductive logic programming Tags: prolog-tabling, prolog Problem: Optimal planning with incrementally tabled abductive logic programming I'd like to use abductive logic programming to ...

Optimal planning with incrementally tabled abductive logic programming Optimal planning with incrementally tabled abductive logic programming prolog-tabling prolog Optimal Optimal planning with incrementally tabled abductive logic programming I'd like to use abductive logic programming to find optimal plans. Exhaustive...

[ 0.013427734375, -0.002044677734375, -0.004058837890625, -0.006683349609375, -0.02392578125, 0.015380859375, 0.024169921875, -0.01318359375, -0.003997802734375, 0.0026092529296875, 0.00024127960205078125, 0.0164794921875, -0.02490234375, -0.01556396484375, -0.00135040283203125, 0.007324...

[ 43938, 289, 58136, 678, 145322, 12097, 23180, 71, 1563, 39367, 4935, 62775, 56037, 502, 4867, 102, 79298, 1884, 4527, 449, 7413, 24087, 38627, 18391, 157318, 32628, 2806, 566, 14170, 12989, 214, 764, 62210, 23335, 11814, 33636, 15824, 64330, ...

[ 0.1761474609375, 0.0228118896484375, 0.20166015625, 0.06085205078125, 0.220947265625, 0.0582275390625, 0.2354736328125, 0.074462890625, 0.1568603515625, 0.177490234375, 0.129638671875, 0.1866455078125, 0.1817626953125, 0.130615234375, 0.218505859375, 0.1630859375, 0.17236328125, 0....

embed

20848439_c0

20848439

prolog

0

Title: prolog:search in binary search tree Problem title: prolog:search in binary search tree Tags: prolog Problem: prolog:search in binary search tree i need to covert list to binary search tree ,then search about range of ages in this tree and return the a list contain these values, and also return number of checks i...

prolog:search in binary search tree prolog:search in binary search tree prolog prolog:search my_list Root _R1 _R2 Age Name prolog:search in binary search tree i need to covert list to binary search tree ,then search about range of ages in this tree and return the a list contain these values, and also return number of c...

[ 0.007049560546875, 0.0101318359375, 0.006256103515625, 0.0089111328125, -0.000040531158447265625, 0.0186767578125, -0.0247802734375, 0.019775390625, 0.00933837890625, -0.0341796875, 0.0087890625, -0.00102996826171875, 0.0087890625, 0.01708984375, 0.0380859375, -0.0028076171875, 0.027...

[ 502, 4867, 86250, 23, 2394, 6635, 33938, 53201, 12, 759, 6562, 150948, 1052, 418, 304, 72944, 15757, 3871, 29256, 18, 5303, 47, 1672, 37457, 10, 4188, 30646, 70541, 142424, 14012, 12765, 45367, 140992, 47445, 31577, 11343, 98320, 4568, 1815...

[ 0.138916015625, 0.2037353515625, 0.1962890625, 0.03839111328125, 0.148681640625, 0.125, 0.1785888671875, 0.214111328125, 0.00872802734375, 0.110107421875, 0.1796875, 0.178466796875, 0.006622314453125, 0.01727294921875, 0.036285400390625, 0.14599609375, 0.000640869140625, 0.07055664...

embed

16367580_c1

16367580

prolog

1

Y1), abs(Y1 - Y) =< 1, \+ (X, Y) = (X1, Y1). get_configuration([], _, _, _, []). get_configuration([Head|Tail], Used, Rows, Columns, [(Head, Neighbour)|Tail2]) :- neighbour(Head, Rows, Columns, Neighbour), \+ member(Neighbour, Used), append(Used, [Neighbour], Used2), get_configuration(Tail, Used2, Rows, Columns, Tail2...

[ -0.006500244140625, 0.007781982421875, 0.022216796875, -0.0252685546875, 0.004638671875, -0.01220703125, 0.01055908203125, 0.003173828125, 0.038330078125, -0.0150146484375, -0.0216064453125, 0.023193359375, -0.017578125, -0.005767822265625, -0.00518798828125, -0.00250244140625, 0.003...

[ 990, 17727, 43719, 132, 1723, 418, 20, 2203, 16093, 106, 1328, 1542, 5, 2046, 153837, 34, 194, 30494, 13025, 712, 9874, 379, 345, 5281, 96190, 233987, 6958, 38648, 90173, 15772, 108, 32786, 114689, 1062, 1218, 9226, 108210, 132887, 10625, ...

[ 0.192138671875, 0.1434326171875, 0.221435546875, 0.0298004150390625, 0.1722412109375, 0.1063232421875, 0.0765380859375, 0.058837890625, 0.1402587890625, 0.0599365234375, 0.1502685546875, 0.093017578125, 0.02288818359375, 0.10394287109375, 0.165771484375, 0.088623046875, 0.01147460937...

embed

53622733_c0

53622733

prolog

0

Title: Prolog trying values until they are correct and then return them Problem title: Prolog trying values until they are correct and then return them Tags: prolog Problem: Prolog trying values until they are correct and then return them I am trying to do a rule in Prolog , where I check if it fits, if it does not, I ...

Prolog trying values until they are correct and then return them Prolog trying values until they are correct and then return them prolog Prolog make_it_fit does_it_fit Nums Check find_new Prolog trying values until they are correct and then return them I am trying to do a rule in Prolog , where I check if it fits, if i...

[ 0.001953125, 0.0014190673828125, -0.00020885467529296875, 0.004608154296875, -0.00159454345703125, 0.024169921875, -0.0186767578125, -0.002105712890625, 0.02783203125, -0.0096435546875, -0.0052490234375, -0.004486083984375, 0.0113525390625, 0.009765625, 0.0283203125, -0.006500244140625...

[ 1250, 4867, 31577, 142424, 24189, 26785, 30646, 502, 3249, 217, 16086, 14602, 52782, 38679, 7413, 54936, 79986, 12765, 2174, 11177, 959, 51312, 13438, 2967, 1810, 101935, 7440, 9790, 7311, 24765, 5701, 8781, 45646, 8110, 47143, 3229, 11782, 6...

[ 0.1767578125, 0.24169921875, 0.142333984375, 0.1494140625, 0.08154296875, 0.144775390625, 0.155517578125, 0.128173828125, 0.081787109375, 0.1727294921875, 0.26220703125, 0.0936279296875, 0.1063232421875, 0.121337890625, 0.08111572265625, 0.087890625, 0.184326171875, 0.14404296875, ...

embed

64443700_c0

64443700

prolog

0

Title: How to get data from library(persistency) in SWI-Prolog? Problem title: How to get data from library(persistency) in SWI-Prolog? Tags: swi-prolog, prolog Problem: How to get data from library(persistency) in SWI-Prolog? I have this module: :- module(data_db, [ attach_data_db/1, % +File current_user_role/2, % ?Us...

How to get data from library(persistency) in SWI-Prolog? How to get data from library(persistency) in SWI-Prolog? swi-prolog prolog library How SWI-Prolog data_db attach_data_db File current_user_role User Role add_user set_user_role use_module user_role name:atom role:oneof db_attach Name with_mutex assert_user_role r...

[ 0.019775390625, 0.011962890625, 0.0096435546875, 0.01251220703125, -0.00921630859375, 0.00909423828125, 0.0120849609375, 0.01531982421875, -0.0002307891845703125, -0.0703125, 0.0211181640625, 0.0093994140625, -0.030029296875, -0.006439208984375, 0.0228271484375, -0.00537109375, 0.000...

[ 11249, 2046, 2053, 1295, 35773, 1294, 21777, 6892, 2408, 159, 38969, 9, 10752, 4867, 23, 2452, 3454, 502, 48073, 243, 934, 10135, 42724, 43581, 65918, 516, 53400, 2777, 15190, 5423, 83279, 38937, 5928, 31486, 40041, 257, 52438, 561, 24371, ...

[ 0.05548095703125, 0.142578125, 0.18505859375, 0.1676025390625, 0.2255859375, 0.15234375, 0.140869140625, 0.1939697265625, 0.1405029296875, 0.06585693359375, 0.2403564453125, 0.001708984375, 0.1409912109375, 0.1939697265625, 0.024139404296875, 0.16748046875, 0.10595703125, 0.0947265...

embed

29113339_c1

29113339

prolog

1

_,_), write('choose room'),nl, read(Room), room(Room,_), %%assertz(lecture(GroupName,Subject)). asserta(lecture(TeachersName,TeachersGroup,TeachSubject,Period,Room)). my problem is that I want it that 'Paul' will only be able to teach AI to 'Bsc4' and only able to teach 'Games_dev' to 'Bsc1'. So in this case if I were ...

[ -0.005279541015625, 0.021240234375, 0.00176239013671875, -0.005645751953125, -0.0233154296875, 0.0196533203125, -0.0206298828125, 0.00531005859375, 0.0003070831298828125, -0.001190185546875, 0.004547119140625, -0.00003933906555175781, 0.008544921875, -0.01116943359375, -0.005096435546875...

[ 33022, 3089, 8364, 17155, 13169, 12301, 12724, 306, 33657, 169, 8996, 6644, 205072, 163612, 110965, 10476, 934, 2967, 3444, 115043, 4734, 19048, 94957, 38730, 47, 10382, 617, 107576, 18548, 571, 418, 107730, 95486, 10208, 67, 9351, 335, 21115...

[ 0.081298828125, 0.08123779296875, 0.0980224609375, 0.2471923828125, 0.0438232421875, 0.1092529296875, 0.183349609375, 0.144775390625, 0.011444091796875, 0.019439697265625, 0.08453369140625, 0.059783935546875, 0.0823974609375, 0.060760498046875, 0.133056640625, 0.0280914306640625, 0.1...

embed

29993566_c0

29993566

prolog

0

Title: Is there a way or an algorithm to convert DCG into normal definite clauses in Prolog? Problem title: Is there a way or an algorithm to convert DCG into normal definite clauses in Prolog? Tags: algorithm, prolog, dcg, grammar, parsing Problem: Is there a way or an algorithm to convert DCG into normal definite cla...

Is there a way or an algorithm to convert DCG into normal definite clauses in Prolog? Is there a way or an algorithm to convert DCG into normal definite clauses in Prolog? algorithm prolog dcg grammar parsing DCG Prolog Is there a way or an algorithm to convert DCG into normal definite clauses in Prolog? I am a newbie ...

[ 0.0020294189453125, 0.0150146484375, 0.00408935546875, 0.0233154296875, 0.01214599609375, 0.0196533203125, -0.0296630859375, -0.007720947265625, -0.00299072265625, -0.031982421875, -0.02294921875, -0.0079345703125, -0.0194091796875, -0.00064849853515625, -0.00457763671875, 0.0055847167...

[ 3917, 234873, 96760, 391, 56367, 3934, 3638, 71496, 13, 70731, 90, 1250, 4867, 23, 502, 104, 238, 177, 122092, 147, 366, 9014, 28219, 3900, 143, 1295, 217064, 110, 22062, 102, 49086, 101087, 21373, 21816, 165523, 59911, 103510, 91736, 13228...

[ 0.0885009765625, 0.226806640625, 0.1719970703125, 0.1268310546875, 0.236572265625, 0.0814208984375, 0.162841796875, 0.1942138671875, 0.0927734375, 0.19921875, 0.0802001953125, 0.1529541015625, 0.2392578125, 0.0291900634765625, 0.09149169921875, 0.061767578125, 0.05780029296875, 0.1...

embed

58985392_c0

58985392

prolog

0

Title: How can I return a number in prolog? Problem title: How can I return a number in prolog? Tags: integer, predicate, prolog, recursion, return Problem: How can I return a number in prolog? I Have a very simple prolog program(I'm still learning) where I have a knowledge base that specifies you can take the bike to ...

How can I return a number in prolog? How can I return a number in prolog? integer predicate prolog recursion return How route_by_bike How can I return a number in prolog? I Have a very simple prolog program(I'm still learning) where I have a knowledge base that specifies you can take the bike to your destination or you...

[ 0.017822265625, 0.00016307830810546875, 0.007537841796875, 0.03173828125, -0.005889892578125, -0.0023193359375, -0.01153564453125, 0.00052642822265625, 0.0106201171875, -0.07568359375, -0.004730224609375, -0.006988525390625, -0.040771484375, 0.0052490234375, 0.01416015625, 0.0047607421...

[ 11249, 831, 87, 30646, 10, 14012, 23, 502, 4867, 892, 1505, 1653, 2063, 67, 195625, 1830, 36439, 1272, 60142, 8781, 1528, 7464, 52080, 51359, 3647, 58735, 5646, 15528, 78869, 35691, 69236, 3714, 738, 1295, 876, 678, 122395, 26458, 2685, 4...

[ 0.13037109375, 0.1143798828125, 0.059814453125, 0.272216796875, 0.048187255859375, 0.253662109375, 0.1124267578125, 0.216552734375, 0.26708984375, 0.1318359375, 0.08349609375, 0.1363525390625, 0.1639404296875, 0.06622314453125, 0.1990966796875, 0.06549072265625, 0.2198486328125, 0....

embed

79249342_c0

79249342

prolog

0

Title: How to express "not" in Prolog DCG without using a cut Problem title: How to express "not" in Prolog DCG without using a cut Tags: dcg, prolog Problem: How to express "not" in Prolog DCG without using a cut I'm working on a Prolog DCG parser to tokenize a string into specific patterns. My goa...

How to express "not" in Prolog DCG without using a cut How to express "not" in Prolog DCG without using a cut dcg prolog a How Prolog DCG Number Token Rest not_token Codes Tokens Incorrect How to express "not" in Prolog DCG without using a cut I'm working on a Prolog DCG parser to tokenize a string ...

[ 0.001190185546875, 0.01177978515625, 0.0238037109375, 0.01092529296875, -0.00811767578125, 0.01507568359375, -0.007415771484375, -0.016845703125, 0.0021209716796875, -0.0269775390625, -0.028076171875, -0.0015869140625, -0.0133056640625, -0.003997802734375, 0.0213623046875, 0.0186767578...

[ 11249, 36510, 10869, 1230, 41502, 1250, 4867, 391, 56367, 15490, 17368, 59226, 23, 177, 502, 103332, 717, 1098, 49756, 959, 6448, 33, 28864, 84694, 32399, 20697, 366, 2189, 47, 79315, 29458, 103510, 69236, 184, 1884, 16690, 18444, 26278, 54...

[ 0.02935791015625, 0.160888671875, 0.2607421875, 0.00445556640625, 0.021575927734375, 0.1370849609375, 0.203125, 0.081298828125, 0.1754150390625, 0.09417724609375, 0.0404052734375, 0.1715087890625, 0.03582763671875, 0.0638427734375, 0.07342529296875, 0.10498046875, 0.06298828125, 0....

embed

37326510_c0

37326510

prolog

0

Title: How to check if element is not in a list, if it isn't, insert it Problem title: How to check if element is not in a list, if it isn't, insert it Tags: prolog Problem: How to check if element is not in a list, if it isn't, insert it I want, given a list formed by A-B elements ([a-b,b-c,c-d]), check if s...

How to check if element is not in a list, if it isn't, insert it How to check if element is not in a list, if it isn't, insert it prolog How EnumNodes EnumArcs How to check if element is not in a list, if it isn't, insert it I want, given a list formed by A-B elements ([a-b,b-c,c-d]), check if some given elem...

[ -0.013427734375, 0.00043487548828125, 0.00074005126953125, 0.0169677734375, -0.023681640625, 0.0303955078125, -0.008544921875, -0.00689697265625, 0.006866455078125, -0.00946044921875, 0.01104736328125, -0.0185546875, 0.0159912109375, 0.006561279296875, -0.004547119140625, 0.00091171264...

[ 11249, 47, 12765, 2174, 12830, 83, 959, 23, 10, 5303, 56112, 3768, 18, 183540, 442, 502, 4867, 357, 316, 5021, 988, 7614, 4439, 3444, 34475, 100, 62, 9, 571, 80854, 21771, 30646, 15190, 284, 140992, 14373, 162, 35166, 28219, 291, 51592,...

[ 0.06878662109375, 0.02099609375, 0.2396240234375, 0.1436767578125, 0.238525390625, 0.1429443359375, 0.240234375, 0.1986083984375, 0.058258056640625, 0.214111328125, 0.1673583984375, 0.045684814453125, 0.16064453125, 0.25537109375, 0.04925537109375, 0.07940673828125, 0.1077880859375, ...

embed

24402587_c0

24402587

prolog

0

Title: How do I code rec/3 in the presence of a meta_predicate declaration? Problem title: How do I code rec/3 in the presence of a meta_predicate declaration? Tags: prolog, meta-predicate, swi-prolog, module Problem: How do I code rec/3 in the presence of a meta_predicate declaration? I have the following code which w...

How do I code rec/3 in the presence of a meta_predicate declaration? How do I code rec/3 in the presence of a meta_predicate declaration? prolog meta-predicate swi-prolog module How meta_predicate use_module N-1 How do I code rec/3 in the presence of a meta_predicate declaration? I have the following code which works f...

[ -0.01092529296875, 0.00799560546875, 0.010498046875, 0.006683349609375, -0.00494384765625, 0.01141357421875, 0.01202392578125, 0.020263671875, 0.010009765625, -0.04638671875, 0.01116943359375, -0.004669189453125, -0.03271484375, -0.0267333984375, 0.0205078125, -0.01220703125, 0.00347...

[ 11249, 18151, 21954, 18113, 169424, 23550, 19714, 2063, 67, 21635, 23, 502, 4867, 2452, 3454, 88996, 4527, 83279, 541, 5759, 25632, 43240, 5885, 15490, 61924, 1653, 29479, 77546, 80596, 195625, 5490, 166577, 6626, 91582, 11814, 66044, 39457, ...

[ 0.0552978515625, 0.2271728515625, 0.1988525390625, 0.292724609375, 0.1351318359375, 0.21630859375, 0.1695556640625, 0.1514892578125, 0.07232666015625, 0.1707763671875, 0.00091552734375, 0.07012939453125, 0.1534423828125, 0.108154296875, 0.0689697265625, 0.1265869140625, 0.08215332031...

embed

75145822_c1

75145822

prolog

1

:- day_constraint(10, e, D), maplist(rest_if_not_work, D). day_constraint(Min, Element, Lst) :- employees_num(EmpsNum), list_has_ge_elements_being(Min, Element, EmpsNum, Lst). two_days(D1, D2) :- % Set the full number of employees, otherwise prevent_double_shift can shorten the list employees_num(EmpsNum), length(D1, ...

[ 0.006011962890625, -0.0157470703125, 0.002410888671875, 0.03173828125, -0.00885009765625, 0.01129150390625, -0.02734375, 0.002777099609375, 0.0031890869140625, -0.0006866455078125, -0.006866455078125, 0.031494140625, 0.00408935546875, 0.020263671875, -0.01300048828125, 0.0228271484375,...

[ 15772, 5155, 454, 2271, 2816, 4288, 90980, 28, 391, 247, 22288, 6562, 56644, 3190, 10869, 18244, 194, 59076, 48325, 339, 271, 93215, 2606, 134332, 7, 839, 316, 5303, 10557, 429, 62766, 31678, 6626, 5636, 397, 418, 10461, 1745, 19943, 4393...

[ 0.152587890625, 0.211669921875, 0.023040771484375, 0.1494140625, 0.2259521484375, 0.1868896484375, 0.1331787109375, 0.1104736328125, 0.104248046875, 0.0362548828125, 0.1212158203125, 0.191650390625, 0.1544189453125, 0.09832763671875, 0.1241455078125, 0.1558837890625, 0.0889892578125,...

embed

24457149_c0

24457149

prolog

0

Title: Collecting Items and Counting the Number of Occurrences Problem title: Collecting Items and Counting the Number of Occurrences Tags: prolog, failure-slice Problem: Collecting Items and Counting the Number of Occurrences I am trying to write a recursive rule collCount/2 which groups identical items in a list with...

Collecting Items and Counting the Number of Occurrences Collecting Items and Counting the Number of Occurrences prolog failure-slice Collecting Items Counting Number Occurrences Rest Ans Num Collecting Items and Counting the Number of Occurrences I am trying to write a recursive rule collCount/2 which groups identical ...

[ 0.00494384765625, 0.002655029296875, 0.0004329681396484375, -0.00194549560546875, 0.01507568359375, 0.007781982421875, -0.0147705078125, -0.01263427734375, 0.015625, -0.02294921875, -0.0010986328125, -0.01318359375, 0.0177001953125, 0.027099609375, 0.0177001953125, -0.006317138671875, ...

[ 138521, 214, 78426, 1311, 128396, 103332, 180, 238, 64240, 69098, 502, 4867, 137578, 13348, 49756, 893, 52782, 136, 31577, 33022, 195625, 5844, 79986, 122907, 108210, 12477, 94407, 31943, 55769, 5303, 107013, 101935, 74918, 42, 3934, 370, 99726...

[ 0.22705078125, 0.02032470703125, 0.1951904296875, 0.1285400390625, 0.15771484375, 0.1142578125, 0.104248046875, 0.100341796875, 0.22265625, 0.07781982421875, 0.085205078125, 0.2071533203125, 0.192626953125, 0.1053466796875, 0.115966796875, 0.030731201171875, 0.1373291015625, 0.0017...

embed

28727834_c0

28727834

prolog

0

Title: Prolog logical task Problem title: Prolog logical task Tags: prolog, visual-prolog Problem: Prolog logical task There is a logical problem: four friends: Ivan, Petr, Mikhail, Sergey spent their time in different ways: two were playing chess, one read books, one watched TV. Find who does what if Sergey does not p...

Prolog logical task Prolog logical task prolog visual-prolog Prolog PREDICATES CLAUSES GOAL Solutions Prolog logical task There is a logical problem: four friends: Ivan, Petr, Mikhail, Sergey spent their time in different ways: two were playing chess, one read books, one watched TV. Find who does what if Sergey does no...

[ -0.0010528564453125, 0.01336669921875, 0.017333984375, 0.0291748046875, -0.001953125, -0.017333984375, -0.035888671875, 0.02490234375, -0.006011962890625, -0.03173828125, 0.00958251953125, 0.00958251953125, -0.00823974609375, -0.002288818359375, 0.00408935546875, 0.0184326171875, 0.0...

[ 1250, 4867, 62775, 289, 66211, 502, 21176, 3454, 134366, 30941, 129636, 78441, 25052, 7842, 109339, 2967, 22759, 23902, 23698, 4, 35007, 1208, 11395, 379, 184865, 66933, 2363, 1733, 12921, 48322, 6626, 3542, 75169, 290, 1632, 12301, 42840, 19...

[ 0.138671875, 0.2315673828125, 0.18359375, 0.1126708984375, 0.18310546875, 0.090087890625, 0.1512451171875, 0.0748291015625, 0.126953125, 0.1256103515625, 0.0494384765625, 0.04022216796875, 0.10516357421875, 0.0858154296875, 0.1236572265625, 0.1827392578125, 0.2127685546875, 0.24157...

embed

26938380_c0

26938380

prolog

0

Title: Prolog program: another way to define a functor Problem title: Prolog program: another way to define a functor Tags: prolog, prolog-cut Problem: Prolog program: another way to define a functor In my last exam I had to write a Prolog predicate called double/2 , according to the following instructions: double(X, Y...

Prolog program: another way to define a functor Prolog program: another way to define a functor prolog prolog-cut Prolog Prolog program: another way to define a functor In my last exam I had to write a Prolog predicate called double/2 , according to the following instructions: double(X, Y) should be true if Y is a list...

[ 0.0235595703125, 0.0208740234375, 0.0211181640625, -0.003662109375, 0.025390625, 0.038818359375, -0.032470703125, 0.0004119873046875, 0.01300048828125, -0.026123046875, 0.006317138671875, -0.005828857421875, -0.0228271484375, -0.027099609375, 0.0096435546875, 0.0230712890625, 0.00227...

[ 1250, 4867, 1528, 15700, 3917, 61924, 7477, 18770, 502, 19774, 47, 4568, 42276, 1902, 33022, 1653, 2063, 67, 35839, 41929, 12477, 167934, 132, 1542, 4, 990, 5608, 29568, 2174, 5303, 892, 26255, 5701, 140909, 1193, 11907, 3853, 14012, 91995,...

[ 0.183837890625, 0.231689453125, 0.20068359375, 0.107666015625, 0.07733154296875, 0.222412109375, 0.2330322265625, 0.1968994140625, 0.1475830078125, 0.1947021484375, 0.0054931640625, 0.1162109375, 0.1661376953125, 0.013916015625, 0.1424560546875, 0.173828125, 0.187744140625, 0.06591...

embed

47485614_c0

47485614

prolog

0

Title: toAncestor predicate in SWI-Prolog Problem title: toAncestor predicate in SWI-Prolog Tags: prolog, ancestor Problem: toAncestor predicate in SWI-Prolog Example 1st: predicate: belongs(X,[X|_]). belongs(X,[_|Ytail]):-belongs(X,Ytail). Check: belongs(a,[x,c,a,b]). Recursion: 1st step: belongs(a,[c,a,b]). 2nd step ...

toAncestor predicate in SWI-Prolog toAncestor predicate in SWI-Prolog prolog ancestor SWI-Prolog Ytail _4644 Call Exit _4916 _5108 toAncestor predicate in SWI-Prolog Example 1st: predicate: Check: belongs(a,[x,c,a,b]). Recursion: 1st step: 2nd step returns true and here SWI-Prolog ends It cuts the head. In the 1st step...

[ 0.00775146484375, 0.009521484375, 0.00531005859375, 0.0145263671875, -0.0137939453125, 0.000904083251953125, -0.00238037109375, 0.0078125, 0.0033721923828125, -0.031005859375, 0.01513671875, 0.007049560546875, 0.0106201171875, 0.00872802734375, 0.01556396484375, -0.0341796875, 0.0159...

[ 47, 284, 3956, 20820, 1653, 2063, 67, 159, 38969, 9, 10752, 4867, 23, 502, 60502, 1290, 990, 46741, 160775, 617, 26265, 5443, 217, 12977, 2485, 758, 69139, 89536, 271, 38679, 10617, 165428, 42, 106, 29954, 30646, 29568, 3564, 314, 933, ...

[ 0.2291259765625, 0.062408447265625, 0.1688232421875, 0.213134765625, 0.194580078125, 0.2257080078125, 0.07470703125, 0.0782470703125, 0.2281494140625, 0.01275634765625, 0.15234375, 0.191650390625, 0.0018310546875, 0.133056640625, 0.1888427734375, 0.1414794921875, 0.07861328125, 0.1...

embed

39711616_c1

39711616

prolog

1

1. poly_red([0], [0]). poly_red(Poly, Out) :- mult_GCD(Poly, GCD), scal_div(Poly, GCD, Out). poly_sub(Poly,[],Poly) :- Poly = [_|_]. poly_sub([],Poly,Poly). poly_sub([P1_head|P1_rest], [P2_head|P2_rest], [PSub_head|PSub_rest]) :- PSub_head is P1_head-P2_head, poly_sub(P1_rest, P2_rest, PSub_rest). scal_prod([],_Sc,[])...

[ -0.00982666015625, 0.00872802734375, 0.0186767578125, 0.001251220703125, 0.004608154296875, 0.0174560546875, -0.011962890625, -0.010009765625, 0.0128173828125, -0.0140380859375, 0.0234375, -0.000347137451171875, -0.007080078125, 0.00028228759765625, 0.006561279296875, -0.0076904296875,...

[ 615, 35874, 454, 2822, 2389, 4, 147352, 194, 7192, 538, 13538, 15772, 3869, 724, 16069, 527, 117906, 30618, 22144, 63306, 2203, 58745, 683, 418, 31251, 56644, 304, 9059, 5829, 436, 96472, 83, 112348, 61278, 238, 10752, 1250, 71, 248, 316,...

[ 0.1553955078125, 0.258544921875, 0.07147216796875, 0.23974609375, 0.12548828125, 0.0243377685546875, 0.1158447265625, 0.0748291015625, 0.1572265625, 0.2353515625, 0.263671875, 0.108154296875, 0.2061767578125, 0.032379150390625, 0.1717529296875, 0.005523681640625, 0.183349609375, 0....

embed

72745291_c0

72745291

prolog

0

Title: Problems on simple Prolog planning question Problem title: Problems on simple Prolog planning question Tags: prolog Problem: Problems on simple Prolog planning question I have recently encountered a question written by Hector J. Levesque in his book Thinking as computation : I have written some code in response ...

Problems on simple Prolog planning question Problems on simple Prolog planning question prolog Problems Prolog initial_state goal_state legal_move LocFox LocHen LocGrain LocCart Loc Loc1 go_alone LocNew Problems on simple Prolog planning question I have recently encountered a question written by Hector J. Levesque in h...

[ -0.00738525390625, 0.005859375, 0.0057373046875, 0.0211181640625, -0.019775390625, 0.014404296875, -0.01165771484375, -0.01519775390625, 0.0230712890625, -0.047607421875, -0.0033416748046875, 0.0181884765625, -0.0115966796875, 0.0142822265625, -0.00555419921875, 0.0125732421875, 0.00...

[ 15649, 7, 8781, 1250, 4867, 58136, 9655, 502, 61475, 61340, 69236, 8437, 432, 88784, 27591, 425, 841, 33, 37878, 21851, 418, 738, 51684, 46568, 190647, 59121, 1529, 18770, 821, 46736, 105397, 12877, 87062, 214, 237, 181135, 18151, 57553, 13...

[ 0.20263671875, 0.013763427734375, 0.184814453125, 0.181640625, 0.279052734375, 0.2347412109375, 0.1722412109375, 0.1339111328125, 0.076904296875, 0.102783203125, 0.1878662109375, 0.1478271484375, 0.1407470703125, 0.1158447265625, 0.1602783203125, 0.032470703125, 0.08990478515625, 0...

embed

47046061_c1

47046061

prolog

1

/cg/root/3832463/main.pg:5: warning: singleton variables [Peter,Mark] for parent/2 /home/cg/root/3832463/main.pg:7: warning: singleton variables [Zara,Anne] for parent/2 /home/cg/root/3832463/main.pg:8: warning: singleton variables [Zara,Mark] for parent/2 /home/cg/root/3832463/main.pg:11: warning: singleton variables ...

[ -0.0002689361572265625, 0.0208740234375, -0.00063323974609375, 0.00179290771484375, -0.0274658203125, 0.0220947265625, -0.0087890625, 0.00482177734375, 0.00555419921875, -0.0546875, -0.00872802734375, -0.00885009765625, 0.01055908203125, -0.0008392333984375, 0.0107421875, -0.0233154296...

[ 248, 177, 148920, 162982, 2357, 15748, 24931, 254, 758, 1631, 592, 12, 11001, 1507, 77336, 7, 128503, 4, 73484, 100, 49129, 12477, 29552, 966, 16737, 219, 7251, 86, 19993, 6766, 19077, 148233, 434, 5464, 3962, 22635, 429, 12221, 701, 2403...

[ 0.0032958984375, 0.07177734375, 0.18994140625, 0.1732177734375, 0.126220703125, 0.17529296875, 0.14599609375, 0.011322021484375, 0.1278076171875, 0.1746826171875, 0.102783203125, 0.00006103515625, 0.191650390625, 0.212646484375, 0.299560546875, 0.05224609375, 0.1856689453125, 0.022...

embed

13976733_c1

13976733

prolog

1

positive(does,eat_meat). it_is(carnivore):- positive(has,pointed_teeth), positive(has, claws), positive(has,forward_eyes). it_is(ungulate):- it_is(mammal), positive(has,hooves). it_is(ungulate):- it_is(mammal), positive(does,chew_cud). positive(X,Y):- xpositive(X,Y),!. positive(X,Y):- not(xnegative(X,Y)), ask(X,Y,yes)...

[ -0.0015716552734375, 0.00408935546875, 0.000804901123046875, 0.0244140625, -0.00396728515625, 0.0186767578125, 0.00634765625, 0.00836181640625, -0.0013885498046875, -0.052001953125, 0.01092529296875, 0.0223388671875, -0.01611328125, 0.00140380859375, 0.016357421875, -0.0024871826171875...

[ 24491, 246, 90, 13, 257, 282, 442, 454, 164, 3284, 93, 104297, 10557, 38496, 67, 12421, 26580, 19725, 2472, 19364, 31463, 51642, 19309, 19066, 2749, 68336, 3132, 1430, 1010, 1723, 1022, 67890, 38, 959, 3331, 26458, 63736, 40907, 33022, 15...

[ 0.2421875, 0.07366943359375, 0.0667724609375, 0.11669921875, 0.1331787109375, 0.122802734375, 0.213623046875, 0.001190185546875, 0.21728515625, 0.10400390625, 0.1136474609375, 0.1907958984375, 0.1268310546875, 0.1290283203125, 0.091552734375, 0.1337890625, 0.119384765625, 0.0613098...

embed

52973897_c0

52973897

prolog

0

Title: How to create anonymous variables from a string? Problem title: How to create anonymous variables from a string? Tags: prolog Problem: How to create anonymous variables from a string? I have defined a predicate find_word/2 that when given a list of letters (with some letters possibly ungrounded), produces possib...

How to create anonymous variables from a string? How to create anonymous variables from a string? prolog a How find_word Example LetterList Word atom_chars app_e How to create anonymous variables from a string? I have defined a predicate find_word/2 that when given a list of letters (with some letters possibly unground...

[ 0.002777099609375, -0.0028228759765625, -0.0059814453125, 0.0244140625, -0.0048828125, 0.0306396484375, 0.007659912109375, 0.00640869140625, -0.002410888671875, -0.033447265625, 0.00921630859375, -0.0123291015625, 0.002105712890625, 0.0028839111328125, 0.0022430419921875, 0.00677490234...

[ 11249, 28282, 52184, 10821, 77336, 7, 1295, 79315, 502, 4867, 7413, 47416, 89536, 105451, 154663, 22543, 34627, 9254, 4027, 13, 61924, 1653, 2063, 12477, 5303, 120820, 144681, 64330, 27489, 7722, 34153, 14858, 103510, 10756, 669, 3115, 814, 1...

[ 0.06439208984375, 0.169921875, 0.2200927734375, 0.1748046875, 0.2783203125, 0.086669921875, 0.124755859375, 0.242431640625, 0.0704345703125, 0.180419921875, 0.124267578125, 0.17138671875, 0.09197998046875, 0.08831787109375, 0.15185546875, 0.120361328125, 0.1585693359375, 0.16308593...

embed

67350966_c1

67350966

prolog

1

X, neg Y). components(X imp Y, neg X, Y). components(neg(X imp Y), X, neg Y). components(X revimp Y, X, neg Y). components(neg(X revimp Y), neg X, Y). components(X uparrow Y, neg X, neg Y). components(neg(X uparrow Y), X, Y). components(X downarrow Y,neg X, neg Y). components(neg(X downarrow Y), X, Y). components(X no...

[ -0.01904296875, 0.00164031982421875, 0.01141357421875, 0.0130615234375, -0.0145263671875, 0.0260009765625, -0.003875732421875, -0.0000053942203521728516, 0.01507568359375, 0.00811767578125, -0.031494140625, -0.0028076171875, 0.0001678466796875, -0.021484375, 0.00628662109375, -0.009155...

[ 1193, 108, 177, 990, 82761, 1542, 21980, 86, 15226, 2676, 1257, 118201, 7565, 959, 64357, 7169, 686, 6, 60715, 334, 2837, 461, 8766, 158, 32149, 20537, 3181, 1723, 194, 18499, 87, 2046, 151206, 501, 223, 129083, 162, 133850, 4439, 46799, ...

[ 0.1522216796875, 0.1339111328125, 0.1468505859375, 0.197265625, 0.2060546875, 0.148193359375, 0.1722412109375, 0.097900390625, 0.09698486328125, 0.1600341796875, 0.04425048828125, 0.14990234375, 0.07061767578125, 0.0643310546875, 0.136474609375, 0.0845947265625, 0.0604248046875, 0....

embed

50078654_c0

50078654

prolog

0

Title: Pattern matching space character Problem title: Pattern matching space character Tags: prolog Problem: Pattern matching space character Here is my problem: etp(V W,[V W|G]). etp(W V,[V W|G]). etp(V W,[_|G]):- etp(V W,G). Prolog says Syntax error: Operator expected . I tried to escape the blank symbol like '\s' ,...

Pattern matching space character Pattern matching space character prolog Pattern Syntax Operator read_line get_char atom_codes Tests EOF end_of_file char_code read_lines LLs Unexpected Pattern matching space character Here is my problem: Prolog says Syntax error: Operator expected . I tried to escape the blank symbol l...

[ -0.00909423828125, -0.0036773681640625, 0.0126953125, -0.003692626953125, -0.01708984375, 0.0018768310546875, 0.00775146484375, -0.003662109375, -0.000629425048828125, -0.01300048828125, 0.019775390625, 0.01055908203125, -0.03759765625, -0.026123046875, -0.0157470703125, 0.007690429687...

[ 9876, 22766, 14858, 214, 32628, 62816, 502, 4867, 19010, 86531, 150922, 12301, 2256, 9254, 34627, 40899, 8647, 82341, 3564, 4390, 29822, 21441, 59801, 99954, 83613, 13, 2967, 1250, 18499, 84751, 37842, 144281, 44237, 26582, 41872, 7, 97370, 4...

[ 0.1470947265625, 0.1107177734375, 0.22509765625, 0.0304718017578125, 0.191162109375, 0.171630859375, 0.09320068359375, 0.2000732421875, 0.079345703125, 0.176513671875, 0.23095703125, 0.141845703125, 0.1146240234375, 0.069580078125, 0.103759765625, 0.080322265625, 0.06494140625, 0.1...

embed

78644553_c0

78644553

prolog

0

Title: Comparing list of lists Problem title: Comparing list of lists Tags: constraints, prolog Problem: Comparing list of lists What I'm trying to do is given a list of lists like the one bellow: inicialState(e([5, 5, 5], [6, 5, 5])). I want to calculate the some of all the elements of one list and compare it to a cer...

Comparing list of lists Comparing list of lists constraints prolog Comparing Sum Rest Target Size List equal2 Comparing list of lists What I'm trying to do is given a list of lists like the one bellow: I want to calculate the some of all the elements of one list and compare it to a certain value, for that I want to ana...

[ -0.01129150390625, 0.0016632080078125, 0.01080322265625, 0.00848388671875, -0.0250244140625, 0.000797271728515625, -0.005523681640625, -0.0040283203125, 0.01361083984375, -0.00360107421875, 0.01953125, -0.0023956298828125, 0.0072021484375, 0.00836181640625, 0.005828857421875, -0.008789...

[ 113307, 214, 5303, 111, 7, 158, 2816, 4288, 502, 4867, 36335, 49756, 160017, 80378, 32036, 105950, 304, 31577, 34475, 41566, 3444, 47, 74481, 3060, 756, 80854, 1632, 69101, 34292, 7968, 36917, 1957, 190, 131815, 839, 28412, 882, 17647, 1197...

[ 0.2279052734375, 0.05645751953125, 0.2298583984375, 0.1094970703125, 0.0357666015625, 0.011962890625, 0.1314697265625, 0.07177734375, 0.1015625, 0.167724609375, 0.0946044921875, 0.1322021484375, 0.187744140625, 0.09234619140625, 0.1507568359375, 0.074462890625, 0.017059326171875, 0...

embed

41701805_c0

41701805

prolog

0

Title: List is empty out of the clause, isn't being modified - PROLOG Problem title: List is empty out of the clause, isn't being modified - PROLOG Tags: prolog Problem: List is empty out of the clause, isn't being modified - PROLOG I'm trying create a list of coordinate doing this: insert(X,L,[X|L]). % L is ...

List is empty out of the clause, isn't being modified - PROLOG List is empty out of the clause, isn't being modified - PROLOG prolog List PROLOG Q-1 Done List is empty out of the clause, isn't being modified - PROLOG I'm trying create a list of coordinate doing this: When I print the list inside the clause, a...

[ 0.015625, 0.0022430419921875, 0.017333984375, 0.00787353515625, -0.0255126953125, -0.005523681640625, -0.00396728515625, -0.0086669921875, 0.00677490234375, -0.004180908203125, 0.00127410888671875, -0.004180908203125, -0.009765625, -0.044189453125, -0.003448486328125, 0.0189208984375, ...

[ 32036, 83, 201505, 1810, 111, 70731, 13, 56112, 3768, 18, 73197, 297, 10514, 47510, 502, 4867, 2396, 5759, 984, 86, 8035, 31577, 28282, 5303, 176866, 28412, 46132, 756, 80854, 2685, 8, 978, 1884, 110833, 18499, 110, 10422 ]

[ 0.226318359375, 0.05877685546875, 0.2105712890625, 0.1435546875, 0.1068115234375, 0.140625, 0.07623291015625, 0.052490234375, 0.013092041015625, 0.0743408203125, 0.1466064453125, 0.0313720703125, 0.1173095703125, 0.1771240234375, 0.089599609375, 0.155029296875, 0.038848876953125, 0...

embed

49411811_c0

49411811

prolog

0

Title: Sierpinski Carpet in Prolog Problem title: Sierpinski Carpet in Prolog Tags: prolog, recursion Problem: Sierpinski Carpet in Prolog Saw this problem here and since I am a prolog newbie, I tried formulating a solution unsuccesfully. Here's what I have managed to make of this so far: rewrite('X', [['X','X','X'],['...

Sierpinski Carpet in Prolog Sierpinski Carpet in Prolog prolog recursion Sierpinski Carpet Prolog CurrentList Result Temp Item Sierpinski Carpet in Prolog Saw this problem here and since I am a prolog newbie, I tried formulating a solution unsuccesfully. Here's what I have managed to make of this so far: Essentially, I...

[ -0.005950927734375, -0.004425048828125, 0.005462646484375, 0.0037384033203125, -0.0009918212890625, 0.0194091796875, 0.0023651123046875, 0.024658203125, 0.0150146484375, 0.007415771484375, 0.0166015625, -0.004669189453125, -0.0260009765625, -0.0172119140625, -0.012939453125, -0.0006523...

[ 727, 10681, 54871, 131947, 126, 1250, 4867, 23, 502, 195625, 1830, 114063, 154663, 126684, 37446, 78426, 2967, 9014, 29806, 226534, 179769, 9790, 71062, 5117, 12830, 75935, 96362, 14700, 66, 54397, 21954, 15824, 3687, 756, 80854, 47, 4568, 53...

[ 0.08074951171875, 0.1448974609375, 0.1964111328125, 0.196533203125, 0.143798828125, 0.134765625, 0.1810302734375, 0.037200927734375, 0.118408203125, 0.2393798828125, 0.0308380126953125, 0.1639404296875, 0.1519775390625, 0.1640625, 0.1756591796875, 0.16455078125, 0.0662841796875, 0....

embed

43220441_c1

43220441

prolog

1

PerMatch - 1, get_match_allocation(NumTeams, Remaining1, NewMatches, Matches). %recursively store/ add matches into allocation list store_allocation_1(_, []). store_allocation_1(T, [X | MatchesTail]) :- assertz(match_table(T, X)), store_allocation_1(T, MatchesTail). %recursively store allocation from match list store_a...

[ 0.00069427490234375, 0.01007080078125, 0.0201416015625, 0.01068115234375, -0.02294921875, -0.0107421875, -0.0078125, 0.0126953125, 0.0294189453125, 0.028564453125, 0.0250244140625, 0.00098419189453125, 0.0198974609375, -0.00787353515625, 0.00119781494140625, 0.00157928466796875, 0.01...

[ 908, 79520, 206, 20, 106, 2046, 98753, 289, 87632, 316, 101409, 853, 192, 14653, 418, 2356, 17007, 67407, 1745, 48650, 5844, 538, 4343, 64, 15190, 14858, 144, 5303, 115187, 618, 1542, 9874, 379, 15772, 33657, 169, 22819, 1193, 12765, 756,...

[ 0.2093505859375, 0.259765625, 0.1566162109375, 0.034027099609375, 0.10113525390625, 0.1016845703125, 0.2548828125, 0.1217041015625, 0.190673828125, 0.091064453125, 0.2305908203125, 0.027679443359375, 0.09271240234375, 0.14697265625, 0.04913330078125, 0.0662841796875, 0.121826171875, ...

embed

61028457_c0

61028457

prolog

0

Title: An easier way to split a list at the N-th place in Prolog? Problem title: An easier way to split a list at the N-th place in Prolog? Tags: prolog, list Problem: An easier way to split a list at the N-th place in Prolog? Here is a predicate to split a list into: a "front list" Front the element at position N (0-b...

An easier way to split a list at the N-th place in Prolog? An easier way to split a list at the N-th place in Prolog? prolog list N-th Prolog Front Element Back split_list List Index N-1 begin_tests empty0 empty1 trivial1 trivial2 trivial3 long1 Llen Nmax Llen-1 end_tests run_tests PL-Unit All Elem An easier way to spl...

[ -0.01116943359375, 0.0216064453125, 0.00408935546875, -0.0238037109375, -0.025634765625, 0.0021514892578125, 0.002288818359375, 0.00872802734375, 0.0260009765625, -0.01483154296875, 0.0147705078125, 0.0017852783203125, -0.0174560546875, 0.0164794921875, 0.02685546875, -0.00811767578125...

[ 99156, 3917, 65450, 5303, 99, 541, 927, 3687, 1250, 4867, 9, 502, 43643, 48325, 26828, 6562, 32036, 31471, 5759, 9842, 6954, 201505, 1927, 686, 1977, 24084, 3564, 33106, 85600, 3164, 540, 195, 70, 1653, 2063, 67, 3934, 20549, 12830, 19069...

[ 0.153564453125, 0.05072021484375, 0.2342529296875, 0.22314453125, 0.05328369140625, 0.2344970703125, 0.1649169921875, 0.1290283203125, 0.1475830078125, 0.2144775390625, 0.02984619140625, 0.109375, 0.1492919921875, 0.161865234375, 0.1522216796875, 0.1552734375, 0.128173828125, 0.113...

embed

22789275_c0

22789275

prolog

0

Title: Why doesn't Prolog find a solution for 'Fox, goose and bag of beans puzzle' and shows 'true' instead? Problem title: Why doesn't Prolog find a solution for 'Fox, goose and bag of beans puzzle' and shows 'true' instead? Tags: river-crossing-puzzle, prolog Problem:...

Why doesn't Prolog find a solution for 'Fox, goose and bag of beans puzzle' and shows 'true' instead? Why doesn't Prolog find a solution for 'Fox, goose and bag of beans puzzle' and shows 'true' instead? river-crossing-puzzle prolog Why Prolog Fox Man Goose Beans Man1 M...

[ 0.01031494140625, 0.01068115234375, 0.0169677734375, 0.01153564453125, -0.01434326171875, 0.0225830078125, -0.0179443359375, -0.0322265625, 0.0111083984375, -0.008544921875, 0.0206298828125, 0.005706787109375, 0.007293701171875, 0.01544189453125, 0.0196533203125, 0.0101318359375, -0....

[ 44084, 22027, 3768, 18, 1250, 4867, 7413, 29806, 27591, 425, 738, 8364, 136, 6157, 186, 10133, 104192, 45831, 9774, 64457, 96113, 95665, 214, 1766, 13894, 502, 49049, 1572, 2016, 131806, 304, 98684, 50478, 2676, 53577, 70643, 13794, 154663, ...

[ 0.0987548828125, 0.05181884765625, 0.0548095703125, 0.0833740234375, 0.184326171875, 0.2271728515625, 0.10150146484375, 0.1878662109375, 0.138916015625, 0.1044921875, 0.0933837890625, 0.1485595703125, 0.095703125, 0.12109375, 0.11669921875, 0.1307373046875, 0.180908203125, 0.114868...

embed

31652482_c0

31652482

prolog

0

Title: A "Building" Riddle in Prolog Problem title: A "Building" Riddle in Prolog Tags: prolog, zebra-puzzle Problem: A "Building" Riddle in Prolog I'm trying to solve a riddle in Prolog. the riddle is: There are two buildings, each one has tree apartments (apartment per floor): one apartment of 3 r...

A "Building" Riddle in Prolog A "Building" Riddle in Prolog prolog zebra-puzzle Building Riddle Prolog building1 building2 R6-1 List1 List2 List3 List4 List5 Error Instantiation A "Building" Riddle in Prolog I'm trying to solve a riddle in Prolog. the riddle is: There are two buildings, each one has...

[ -0.004302978515625, 0.01806640625, -0.01446533203125, -0.01007080078125, 0.004150390625, 0.015625, -0.03662109375, 0.0169677734375, 0.005340576171875, -0.0235595703125, 0.008056640625, 0.00115966796875, -0.00189208984375, -0.0021209716796875, 0.00225830078125, 0.018310546875, -0.0079...

[ 62, 41502, 121137, 214, 41231, 19298, 23, 1250, 4867, 502, 116232, 1766, 13894, 104919, 33976, 418, 304, 627, 126188, 32036, 617, 758, 212059, 166945, 14, 31577, 86869, 31351, 6626, 12638, 1632, 53201, 127451, 17365, 74912, 138, 112875, 201, ...

[ 0.057891845703125, 0.008453369140625, 0.2169189453125, 0.149169921875, 0.1798095703125, 0.177490234375, 0.07525634765625, 0.188720703125, 0.2474365234375, 0.14599609375, 0.2039794921875, 0.06591796875, 0.0897216796875, 0.1939697265625, 0.2249755859375, 0.04541015625, 0.1163330078125,...

embed

76970136_c1

76970136

prolog

1

among possible values best_value([Value-_|Rest], BestValue) :- best_value(Rest, Value, BestValue). best_value([], BestValue, BestValue). best_value([Value-_|Rest], CurrentBest, BestValue) :- Value > CurrentBest, best_value(Rest, Value, BestValue). best_value([_|Rest], CurrentBest, BestValue) :- best_value(Rest, Curren...

[ -0.01214599609375, -0.01373291015625, 0.0213623046875, 0.00494384765625, 0.0076904296875, 0.023681640625, -0.018310546875, -0.0274658203125, 0.0264892578125, 0.0146484375, -0.0001621246337890625, 0.039306640625, 0.004302978515625, -0.001556396484375, 0.00439453125, -0.009765625, 0.01...

[ 54940, 7722, 142424, 2965, 454, 27494, 13, 132, 856, 50770, 9, 58745, 1052, 525, 4, 11345, 15772, 190060, 114063, 110601, 194, 1745, 38679, 2174, 25813, 83, 35604, 432, 272, 135206, 57945, 22836, 106, 1031, 169033, 3249, 2356, 87377, 36457,...

[ 0.1724853515625, 0.2193603515625, 0.253662109375, 0.203125, 0.05194091796875, 0.290771484375, 0.0836181640625, 0.00286865234375, 0.2271728515625, 0.277099609375, 0.08489990234375, 0.0684814453125, 0.1116943359375, 0.1907958984375, 0.03350830078125, 0.2164306640625, 0.1329345703125, ...

embed

22568157_c0

22568157

prolog

0

Title: How do I deal with one predicate with multiple answers? Problem title: How do I deal with one predicate with multiple answers? Tags: prolog Problem: How do I deal with one predicate with multiple answers? Let's say I have a predicate which looks to see if someone has a sister. Then there are - in my opinion - tw...

How do I deal with one predicate with multiple answers? How do I deal with one predicate with multiple answers? prolog How display_sisters sisters_of Sisters There How do I deal with one predicate with multiple answers? Let's say I have a predicate which looks to see if someone has a sister. Then there are - in my opin...

[ 0.0172119140625, -0.0125732421875, 0.017333984375, 0.00604248046875, -0.0137939453125, 0.01513671875, 0.01239013671875, -0.009521484375, 0.0024871826171875, -0.0224609375, 0.0008087158203125, 0.000576019287109375, -0.0140380859375, 0.01177978515625, 0.0087890625, 0.02392578125, 0.034...

[ 11249, 35142, 678, 1632, 1653, 2063, 67, 48716, 35166, 7, 502, 4867, 44116, 172, 37499, 114015, 4390, 602, 8622, 33342, 1957, 2174, 1556, 33153, 6626, 97370, 4527, 1723, 38937, 86171, 5303, 3445, 160054, 756, 184345, 17262, 6561, 14037, 193...

[ 0.04345703125, 0.173095703125, 0.1279296875, 0.14111328125, 0.1712646484375, 0.2047119140625, 0.10498046875, 0.252685546875, 0.2174072265625, 0.03326416015625, 0.08123779296875, 0.177490234375, 0.1339111328125, 0.0888671875, 0.11474609375, 0.2069091796875, 0.12109375, 0.09777832031...

embed

64401189_c0

64401189

prolog

0

Title: Split a list on an index in Prolog Problem title: Split a list on an index in Prolog Tags: prolog Problem: Split a list on an index in Prolog I am writing a split predicate with 4 parameters. The first parameter (Index) is the index at which the complete list should be split. The second parameter (CompleteList) ...

Split a list on an index in Prolog Split a list on an index in Prolog prolog Split Prolog CompleteList FirstHalfList Index CompleteListHead CompleteListTail SecondHalfList NewFirstHalfList NewIndex Index-1 Split a list on an index in Prolog I am writing a split predicate with 4 parameters. The first parameter (Index) i...

[ -0.0081787109375, -0.004730224609375, 0.005859375, 0.00119781494140625, -0.03759765625, 0.01324462890625, -0.01007080078125, -0.00933837890625, 0.0196533203125, -0.0024261474609375, 0.00653076171875, -0.00848388671875, -0.033935546875, 0.0167236328125, 0.0272216796875, -0.0026245117187...

[ 46474, 5303, 98, 63262, 1250, 4867, 10, 142, 23, 502, 168318, 154663, 23972, 106670, 31471, 13025, 9874, 379, 77648, 2356, 207263, 39659, 5759, 32562, 65450, 1653, 2063, 67, 201, 171859, 5117, 4153, 28484, 5608, 17932, 10770, 131801, 1720, ...

[ 0.26953125, 0.234375, 0.1324462890625, 0.228515625, 0.1690673828125, 0.2393798828125, 0.027435302734375, 0.00054931640625, 0.047882080078125, 0.128173828125, 0.1444091796875, 0.16796875, 0.07366943359375, 0.146484375, 0.177490234375, 0.041351318359375, 0.0087890625, 0.0204620361328...

embed

36368614_c0

36368614

prolog

0

Title: Get list of atoms by index from i to j in Prolog Problem title: Get list of atoms by index from i to j in Prolog Tags: list, prolog, split Problem: Get list of atoms by index from i to j in Prolog I want to get a list of atoms from my atom list based on given index_from i to index_to j. I tried many times but it...

Get list of atoms by index from i to j in Prolog Get list of atoms by index from i to j in Prolog list prolog split i Get Prolog INPUT_LIST INDEX_FROM INDEX_TO OUTPUTLIST LIST nth0 ELEMENT NLIST TYPE_INT IDENTIFIER OPEN_P COMMA output_list Get list of atoms by index from i to j in Prolog I want to get a list of atoms f...

[ -0.020751953125, 0.024169921875, -0.00531005859375, 0.0145263671875, -0.037841796875, 0.004791259765625, -0.00262451171875, 0.037353515625, -0.006439208984375, -0.01458740234375, 0.025390625, 0.00848388671875, -0.0223388671875, 0.01708984375, 0.0211181640625, 0.010498046875, 0.027587...

[ 20779, 5303, 111, 34627, 7, 390, 63262, 1295, 17, 47, 1647, 23, 1250, 4867, 502, 65450, 5881, 124599, 195977, 51383, 26939, 61607, 8727, 52001, 927, 2389, 9780, 124661, 95267, 59537, 208585, 65441, 683, 31436, 8218, 140992, 6562, 3444, 2046...

[ 0.08251953125, 0.1710205078125, 0.03338623046875, 0.224365234375, 0.10205078125, 0.058135986328125, 0.20068359375, 0.07989501953125, 0.1121826171875, 0.107666015625, 0.1812744140625, 0.041595458984375, 0.135009765625, 0.2269287109375, 0.10565185546875, 0.13232421875, 0.0355224609375,...

embed

57316504_c0

57316504

prolog

0

Title: Zebra puzzle - who lives on which floor? Problem title: Zebra puzzle - who lives on which floor? Tags: zebra-puzzle, prolog Problem: Zebra puzzle - who lives on which floor? I have a zebra/Einstein type Prolog puzzle very similar to the one depicted here: A "Building" Riddle in Prolog . The riddle is: There are ...

Zebra puzzle - who lives on which floor? Zebra puzzle - who lives on which floor? zebra-puzzle prolog Zebra building1 building2 R6-1 Digs Vars Digs1 Type empty_list Zebra puzzle - who lives on which floor? I have a zebra/Einstein type Prolog puzzle very similar to the one depicted here: A "Building" Riddle in Prolog . ...

[ -0.010009765625, 0.01019287109375, -0.01043701171875, -0.015869140625, 0.002777099609375, -0.00020503997802734375, -0.03857421875, 0.0203857421875, 0.013427734375, -0.011962890625, 0.0164794921875, 0.001953125, 0.007568359375, 0.00628662109375, -0.000942230224609375, 0.011474609375, ...

[ 3786, 2844, 104192, 2750, 60742, 98, 3129, 74912, 116232, 1766, 13894, 502, 4867, 33976, 418, 304, 627, 126188, 49688, 3323, 60457, 201505, 6562, 61061, 18055, 10644, 1250, 21373, 18695, 121137, 214, 41231, 19298, 31351, 3871, 7413, 23, 30309...

[ 0.15234375, 0.2333984375, 0.2069091796875, 0.1336669921875, 0.193603515625, 0.14111328125, 0.123779296875, 0.2281494140625, 0.2137451171875, 0.0675048828125, 0.1085205078125, 0.07415771484375, 0.1883544921875, 0.135498046875, 0.0281524658203125, 0.078125, 0.00457763671875, 0.098449...

embed

26367865_c1

26367865

prolog

1

],1). member(_,[],0). member(ITEM,[_|T],R):- member(ITEM,T,R). both([],[],[]). both([song(NAME,_)|T1], L2,[NAME|T3]):- member(NAME,L2,R),R=1,both(T1, L2, T3). both([_|T], L2, T3):- both(T, L2, T3). ?- top10eu(L1),top10us(L2),both(L1,L2,RESULT),write(RESULT). // the result is false here Attempt 2: both(_,[],[],[]). both...

[ -0.01104736328125, 0.022705078125, 0.01422119140625, -0.00506591796875, -0.0205078125, 0.009521484375, -0.013916015625, -0.0037078857421875, -0.0010833740234375, -0.0159912109375, 0.0016021728515625, -0.00138092041015625, 0.007110595703125, 0.0025482177734375, -0.002349853515625, 0.003...

[ 10114, 17727, 32786, 454, 268, 77495, 25216, 594, 618, 1052, 2077, 194, 15044, 132, 4, 35821, 182512, 16, 76172, 339, 304, 1065, 58745, 9, 866, 247, 33000, 927, 418, 384, 21320, 5, 12, 2663, 963, 4615, 13784, 223, 34465, 82643, 18781, ...

[ 0.037841796875, 0.0946044921875, 0.246337890625, 0.060028076171875, 0.0098876953125, 0.1182861328125, 0.1317138671875, 0.1383056640625, 0.0809326171875, 0.06689453125, 0.009796142578125, 0.0280609130859375, 0.20654296875, 0.00946044921875, 0.009765625, 0.197265625, 0.0966796875, 0....

embed

26501308_c0

26501308

prolog

0

Title: In Prolog how can I cut redundant answers Problem title: In Prolog how can I cut redundant answers Tags: non-repetitive, backtracking, prolog Problem: In Prolog how can I cut redundant answers I am working on a dictionary-like program with prolog, and my code goes like this: define(car,vehicle). define(car,that)...

In Prolog how can I cut redundant answers In Prolog how can I cut redundant answers non-repetitive backtracking prolog Prolog List In Prolog how can I cut redundant answers I am working on a dictionary-like program with prolog, and my code goes like this: I am trying to write a defined/1 predicate which will give me: Y...

[ 0.00689697265625, -0.01171875, 0.018310546875, 0.01190185546875, 0.00122833251953125, 0.0004596710205078125, 0.002838134765625, 0.01092529296875, 0.01275634765625, -0.041015625, -0.01507568359375, -0.002227783203125, -0.01361083984375, -0.00555419921875, 0.0137939453125, 0.031982421875...

[ 360, 1250, 4867, 3642, 831, 59226, 4842, 35405, 18, 35166, 351, 90197, 4420, 125728, 502, 32036, 7, 10763, 1528, 18151, 31577, 33022, 61924, 71, 11583, 1653, 2063, 8337, 76199, 1193, 1369, 3284, 43606, 20028, 84832, 11907, 6032, 105416, 157...

[ 0.03802490234375, 0.1680908203125, 0.2344970703125, 0.037811279296875, 0.033416748046875, 0.211181640625, 0.1077880859375, 0.2161865234375, 0.101318359375, 0.216064453125, 0.0261993408203125, 0.000579833984375, 0.099365234375, 0.190673828125, 0.1273193359375, 0.094482421875, 0.034210...

embed

51201134_c0

51201134

prolog

0

Title: What am I missing about equality and unification in Prolog? Problem title: What am I missing about equality and unification in Prolog? Tags: prolog-dif, prolog Problem: What am I missing about equality and unification in Prolog? I'm working through Clocksin and Mellish to try and finally go beyond just dabbling ...

What am I missing about equality and unification in Prolog? What am I missing about equality and unification in Prolog? prolog-dif prolog What Prolog sister_of Mum Dad Who What am I missing about equality and unification in Prolog? I'm working through Clocksin and Mellish to try and finally go beyond just dabbling in P...

[ 0.02001953125, 0.0024261474609375, 0.0230712890625, 0.01226806640625, -0.0164794921875, -0.0118408203125, -0.01202392578125, 0.0028533935546875, 0.0113525390625, -0.0311279296875, -0.01190185546875, -0.006134033203125, 0.0093994140625, 0.0057373046875, 0.00830078125, 0.004608154296875,...

[ 4865, 444, 87, 132283, 28, 161789, 136, 51, 41274, 1250, 4867, 502, 428, 420, 114015, 454, 4390, 83678, 40960, 40469, 1672, 23, 20697, 21135, 1596, 13892, 15227, 51042, 159, 38969, 10752, 29479, 71337, 12477, 1653, 2063, 67, 81979, 48733, ...

[ 0.004180908203125, 0.031341552734375, 0.00091552734375, 0.1552734375, 0.072998046875, 0.2333984375, 0.0364990234375, 0.1414794921875, 0.1572265625, 0.1490478515625, 0.2364501953125, 0.1204833984375, 0.082275390625, 0.1348876953125, 0.201904296875, 0.01654052734375, 0.1903076171875, ...

embed

22240579_c0

22240579

prolog

0

Title: Multiplying lists and list of lists in Prolog Problem title: Multiplying lists and list of lists in Prolog Tags: list, matrix-multiplication, prolog Problem: Multiplying lists and list of lists in Prolog I'm currently working on a Prolog program and having a lot of trouble figuring out how to implement it. I wan...

Multiplying lists and list of lists in Prolog Multiplying lists and list of lists in Prolog list matrix-multiplication prolog Multiplying Prolog Multiplying lists and list of lists in Prolog I'm currently working on a Prolog program and having a lot of trouble figuring out how to implement it. I want to put a list such...

[ -0.01025390625, 0.0106201171875, 0.005615234375, 0.018310546875, -0.01953125, 0.002532958984375, -0.0159912109375, 0.013671875, -0.0023651123046875, -0.00135040283203125, -0.005889892578125, -0.010009765625, -0.01458740234375, -0.00860595703125, -0.0130615234375, -0.008056640625, 0.0...

[ 19335, 62479, 5303, 136, 23, 1250, 4867, 50944, 425, 144227, 182867, 502, 20697, 1528, 63134, 26747, 29479, 3444, 3884, 133063, 304, 76172, 3934, 32354, 6024, 68034, 3249, 3525, 27781, 28282, 756, 25842, 21672, 45234, 1810, 116, 2208, 13162, ...

[ 0.1044921875, 0.15771484375, 0.2220458984375, 0.059539794921875, 0.0252685546875, 0.1568603515625, 0.235595703125, 0.1805419921875, 0.0992431640625, 0.07177734375, 0.051300048828125, 0.106689453125, 0.045867919921875, 0.0728759765625, 0.005615234375, 0.01959228515625, 0.1064453125, ...

embed

16063542_c0

16063542

prolog

0

Title: Can't access a file in Prolog Problem title: Can't access a file in Prolog Tags: prolog Problem: Can't access a file in Prolog I am studying Prolog using SWI-Prolog. I am finding some problems with the following example that simply access to a file and write in it what the user put in the Prolog Shell....

Can't access a file in Prolog Can't access a file in Prolog prolog Can Prolog File Query end_of_file myFile.txt ERROR Syntax Operator source_sink Can't access a file in Prolog I am studying Prolog using SWI-Prolog. I am finding some problems with the following example that simply access to a file and write in...

[ 0.03125, 0.00010251998901367188, 0.0113525390625, 0.0262451171875, -0.010986328125, -0.0036773681640625, 0.004547119140625, 0.01324462890625, -0.010498046875, -0.0439453125, 0.0140380859375, 0.0283203125, -0.02197265625, 0.00439453125, 0.01092529296875, 0.0069580078125, 0.01263427734...

[ 4171, 3768, 18, 17203, 11435, 23, 1250, 4867, 502, 42724, 58836, 3564, 4390, 29822, 759, 174350, 124326, 151206, 19010, 86531, 150922, 31344, 7, 14068, 10, 38969, 10752, 44402, 27781, 33022, 38937, 108362, 2967, 128019, 9790, 71924, 9433, 638...

[ 0.1031494140625, 0.04144287109375, 0.0975341796875, 0.243408203125, 0.221435546875, 0.1036376953125, 0.1998291015625, 0.260498046875, 0.1456298828125, 0.1844482421875, 0.1114501953125, 0.1270751953125, 0.1396484375, 0.1363525390625, 0.160888671875, 0.233642578125, 0.20068359375, 0....

embed