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
39191184_c1	39191184	prolog	1	:- M #= max(X, Y). This works correctly in both cases, and can even be used in more situations: ?- integer_integer_maximum(0, 1, M), M = 0. false. ?- M = 0, integer_integer_maximum(0, 1, M). false. \| ?- X in 0..2, Y in 3..4, integer_integer_maximum(X, Y, M). X in 0..2, Y in 3..4, M in 3..4 ? ; no Now the paper Coding ...	:- M #= max(X, Y). This works correctly in both cases, and can even be used in more situations: ?- integer_integer_maximum(0, 1, M), M = 0. false. ?- M = 0, integer_integer_maximum(0, 1, M). false. \| ?- X in 0..2, Y in 3..4, integer_integer_maximum(X, Y, M). X in 0..2, Y in 3..4, M in 3..4 ? ; no Now the paper Coding ...	[ -0.0167236328125, 0.010009765625, 0.021484375, 0.005828857421875, 0.01300048828125, 0.0167236328125, 0.0003147125244140625, -0.005462646484375, 0.0216064453125, -0.0027008056640625, 0.016357421875, 0.003753662109375, -0.0069580078125, 0.006103515625, 0.046630859375, 0.000732421875, 0...	[ 15772, 276, 468, 1369, 18389, 1542, 4, 990, 3293, 43240, 26785, 15044, 50218, 831, 11814, 1286, 113949, 892, 1505, 6191, 192, 53950, 316, 2389, 106, 2203, 757, 98320, 1193, 23, 304, 1031, 617, 15122, 1311, 6238, 44583, 59801, 1250, 4867, ...	[ 0.091796875, 0.1817626953125, 0.1400146484375, 0.09063720703125, 0.25390625, 0.126708984375, 0.01275634765625, 0.1676025390625, 0.023529052734375, 0.1285400390625, 0.10986328125, 0.1004638671875, 0.053314208984375, 0.030029296875, 0.1177978515625, 0.0192718505859375, 0.07861328125, ...	embed
46158403_c0	46158403	prolog	0	Title: Manipulating Prolog code output Problem title: Manipulating Prolog code output Tags: prolog, clpfd Problem: Manipulating Prolog code output I am trying to run code on this page: https://swish.swi-prolog.org/example/clpfd_queens.pl in swipl on a Linux terminal. :- use_module(library(clpfd)). n_queens(N, Qs) :- le...	Manipulating Prolog code output Manipulating Prolog code output prolog clpfd Manipulating Prolog use_module n_queens safe_queens _G1470 _G1473 _G1476 _G1479 _G1470-_G1479 _G1470-_G1476 _G1470-_G1473 _G1476-_G1479 _G1473-_G1479 _G1473-_G1476 Manipulating Prolog code output I am trying to run code on this page: https://s...	[ 0.02099609375, 0.005218505859375, 0.027099609375, 0.0033416748046875, -0.00982666015625, -0.006988525390625, 0.01141357421875, -0.00469970703125, -0.0004634857177734375, -0.01409912109375, -0.004608154296875, -0.007476806640625, 0.0027008056640625, -0.004608154296875, -0.003143310546875,...	[ 221169, 26518, 1250, 4867, 18151, 140992, 502, 39557, 71, 4527, 83279, 653, 944, 1755, 46002, 2592, 5757, 13574, 11835, 22377, 128497, 31577, 11675, 9191, 114686, 2452, 3454, 11, 2424, 29908, 33949, 77168, 75101, 43240, 105801, 2396, 44084, 6...	[ 0.2320556640625, 0.1153564453125, 0.1636962890625, 0.23486328125, 0.197509765625, 0.2103271484375, 0.1053466796875, 0.044219970703125, 0.0751953125, 0.05224609375, 0.1177978515625, 0.007843017578125, 0.157958984375, 0.1392822265625, 0.1771240234375, 0.054473876953125, 0.1353759765625...	embed
21068169_c0	21068169	prolog	0	Title: Difference between 2 consecutive elements in Prolog Problem title: Difference between 2 consecutive elements in Prolog Tags: turbo-prolog, prolog Problem: Difference between 2 consecutive elements in Prolog So my problem sounds like this: Given a list of integer numbers, generate the list of permutations with th...	Difference between 2 consecutive elements in Prolog Difference between 2 consecutive elements in Prolog turbo-prolog prolog Difference Prolog perm_aux Difference between 2 consecutive elements in Prolog So my problem sounds like this: Given a list of integer numbers, generate the list of permutations with the property ...	[ -0.003875732421875, 0.01416015625, 0.0068359375, 0.00775146484375, -0.00933837890625, 0.015625, -0.0133056640625, 0.0137939453125, 0.0341796875, -0.029052734375, 0.002716064453125, 0.02001953125, 0.003082275390625, 0.0125732421875, 0.0005950927734375, 0.013671875, 0.00274658203125, ...	[ 803, 18234, 6620, 17721, 116, 148390, 80854, 23, 1250, 4867, 94779, 3454, 502, 117, 39, 10442, 2967, 102678, 5303, 892, 1505, 101935, 139392, 14311, 21094, 57266, 89931, 34292, 60212, 142424, 1295, 561, 22062, 4426, 76067, 339, 304, 109631, ...	[ 0.0941162109375, 0.1943359375, 0.012939453125, 0.1094970703125, 0.1680908203125, 0.2403564453125, 0.20849609375, 0.007476806640625, 0.1728515625, 0.2420654296875, 0.1710205078125, 0.0966796875, 0.0965576171875, 0.126708984375, 0.0843505859375, 0.19482421875, 0.0433349609375, 0.0333...	embed
40444003_c0	40444003	prolog	0	Title: (Prolog) How to find if a connection exists between 2 predicates Problem title: (Prolog) How to find if a connection exists between 2 predicates Tags: transitive-closure, prolog Problem: (Prolog) How to find if a connection exists between 2 predicates This is what I have so far. I need to show that if two statio...	(Prolog) How to find if a connection exists between 2 predicates (Prolog) How to find if a connection exists between 2 predicates transitive-closure prolog Prolog How adjacent_ (Prolog) How to find if a connection exists between 2 predicates This is what I have so far. I need to show that if two stations are connected ...	[ -0.014404296875, -0.01251220703125, 0.0257568359375, 0.0299072265625, 0.000537872314453125, 0.02294921875, -0.00982666015625, 0.0034027099609375, 0.01336669921875, -0.052734375, 0.01397705078125, 0.00811767578125, -0.0194091796875, -0.005462646484375, 0.0150146484375, 0.002670288085937...	[ 10752, 4867, 11249, 47, 7413, 2174, 10, 94878, 32316, 7, 17721, 116, 1653, 2063, 1636, 62621, 5844, 170224, 502, 1250, 123594, 16797, 2060, 3871, 7639, 6626, 29398, 162711, 1829, 50960, 12638, 3789 ]	[ 0.0833740234375, 0.1668701171875, 0.027099609375, 0.05084228515625, 0.1500244140625, 0.112548828125, 0.0164642333984375, 0.2342529296875, 0.1973876953125, 0.044677734375, 0.179931640625, 0.1419677734375, 0.15478515625, 0.1824951171875, 0.0535888671875, 0.109619140625, 0.1047973632812...	embed
46515188_c0	46515188	prolog	0	Title: Return a list from base case in Prolog Problem title: Return a list from base case in Prolog Tags: prolog Problem: Return a list from base case in Prolog I have some doubts about how Prolog works. I have this code bellow (NEW VERSION): listaPessIdade([], Lista). listaPessIdade([X\|Xs], []) :- findall((X, Idade), ...	Return a list from base case in Prolog Return a list from base case in Prolog prolog base Prolog Lista Idade List Return a list from base case in Prolog I have some doubts about how Prolog works. I have this code bellow (NEW VERSION): (OLD VERSION): And I have a collection of predicates in my KB of the type: age(person...	[ 0.0126953125, 0.00848388671875, 0.0057373046875, 0.024658203125, -0.004150390625, 0.0206298828125, -0.036865234375, 0.004364013671875, 0.012939453125, -0.046630859375, 0.01007080078125, -0.00011968612670898438, -0.005889892578125, 0.01239013671875, 0.01422119140625, 0.01220703125, 0....	[ 173340, 5303, 1295, 3647, 7225, 1250, 4867, 23, 502, 50085, 87, 16018, 32036, 92814, 43240, 18151, 41566, 34237, 42486, 1653, 2063, 759, 30742, 10644, 32070, 30816, 14012, 75463, 15277, 284, 429, 154663, 3445, 123055, 16750, 29568, 959, 678, ...	[ 0.1962890625, 0.228759765625, 0.15185546875, 0.2109375, 0.2103271484375, 0.1776123046875, 0.241455078125, 0.02313232421875, 0.1231689453125, 0.1890869140625, 0.058013916015625, 0.1834716796875, 0.169189453125, 0.05426025390625, 0.09136962890625, 0.09576416015625, 0.07293701171875, ...	embed
43724301_c0	43724301	prolog	0	Title: Setting types of unbound variables in Prolog Problem title: Setting types of unbound variables in Prolog Tags: prolog-defaulty, prolog Problem: Setting types of unbound variables in Prolog I'm trying to find a way to set the type of a variable before it has been bound to a value. Unfortunately, the integer/1 pre...	Setting types of unbound variables in Prolog Setting types of unbound variables in Prolog prolog-defaulty prolog Setting Prolog get_first_int List is_int is_integer Setting types of unbound variables in Prolog I'm trying to find a way to set the type of a variable before it has been bound to a value. Unfortunately, the...	[ 0.00714111328125, 0.001953125, 0.0177001953125, 0.018798828125, -0.0230712890625, -0.00909423828125, 0.0032958984375, -0.0037994384765625, -0.0023956298828125, -0.017578125, -0.0076904296875, -0.002685546875, -0.006011962890625, 0.0074462890625, 0.029541015625, 0.0164794921875, 0.009...	[ 503, 19514, 52895, 51, 99091, 77336, 1250, 4867, 502, 214810, 53, 2046, 13448, 271, 4288, 32036, 83, 6191, 1505, 5423, 10644, 8108, 1556, 2809, 47, 34292, 892, 11583, 1653, 2063, 67, 53418, 11814, 60042, 54397, 454, 81887, 12765, 129745, ...	[ 0.1241455078125, 0.018524169921875, 0.208251953125, 0.098876953125, 0.1922607421875, 0.2474365234375, 0.14599609375, 0.2327880859375, 0.1044921875, 0.15478515625, 0.043212890625, 0.00048828125, 0.0657958984375, 0.0750732421875, 0.185546875, 0.1065673828125, 0.1217041015625, 0.13403...	embed
60886536_c0	60886536	prolog	0	Title: Prolog Programming loop through a specific fact Problem title: Prolog Programming loop through a specific fact Tags: prolog Problem: Prolog Programming loop through a specific fact I am trying to define 4 offsprings charles,andrew,ann,edward in their order of birth. offspring(andrew). offspring(ann). offspring(e...	Prolog Programming loop through a specific fact Prolog Programming loop through a specific fact prolog Prolog Programming older_than successor_first Prolog Programming loop through a specific fact I am trying to define 4 offsprings charles,andrew,ann,edward in their order of birth. I am trying to get the succession ord...	[ 0.03515625, -0.000514984130859375, 0.006500244140625, 0.0230712890625, 0.0029449462890625, -0.0081787109375, -0.006317138671875, 0.01220703125, 0.0167236328125, -0.055908203125, 0.0009613037109375, -0.0001850128173828125, -0.01806640625, -0.01312255859375, 0.0208740234375, -0.006652832...	[ 1250, 4867, 27958, 40956, 8305, 29458, 15824, 502, 114210, 21732, 39457, 42, 13448, 271, 214, 31577, 47, 61924, 201, 5773, 79832, 7, 21441, 1577, 129083, 434, 6763, 297, 19364, 12989, 127319, 2046, 206846, 7440, 11280, 2750, 621, 214493, 51...	[ 0.17919921875, 0.262939453125, 0.1934814453125, 0.2071533203125, 0.1282958984375, 0.176513671875, 0.2144775390625, 0.153076171875, 0.1968994140625, 0.176025390625, 0.2265625, 0.1243896484375, 0.12451171875, 0.0810546875, 0.0673828125, 0.09466552734375, 0.000640869140625, 0.18872070...	embed
59989349_c1	59989349	prolog	1	't know how to implement the part % go through the entire data of books defined % find the book whose name matches the user input , though I know that in a Java-like language you could write like for(int i=0; i<bookList.length;i++){ Book result = new Book(); if(bookList[i].name == Booktitle){ result = bookList[i]; } re...	't know how to implement the part % go through the entire data of books defined % find the book whose name matches the user input , though I know that in a Java-like language you could write like for(int i=0; i<bookList.length;i++){ Book result = new Book(); if(bookList[i].name == Booktitle){ result = bookList[i]; } re...	[ 0.01080322265625, 0.004241943359375, 0.0162353515625, 0.00421142578125, -0.00131988525390625, 0.030029296875, 0.005401611328125, 0.0164794921875, 0.005218505859375, -0.046875, 0.019287109375, -0.01312255859375, -0.0194091796875, -0.006500244140625, 0.02685546875, 0.0078125, -0.006134...	[ 18, 3714, 3642, 29479, 2831, 1745, 738, 8305, 64194, 2053, 111, 42840, 61924, 7413, 70, 12877, 124901, 9351, 14858, 90, 38937, 107730, 6, 41925, 5062, 46876, 5809, 33022, 1884, 100, 4288, 17, 145407, 74, 14137, 154663, 23986, 14, 37223, 2...	[ 0.06976318359375, 0.07904052734375, 0.0606689453125, 0.2154541015625, 0.1883544921875, 0.1580810546875, 0.03131103515625, 0.152587890625, 0.126220703125, 0.1669921875, 0.0733642578125, 0.2271728515625, 0.155029296875, 0.1939697265625, 0.04241943359375, 0.239990234375, 0.0948486328125...	embed
30427177_c0	30427177	prolog	0	Title: How to concat two lists in Prolog Problem title: How to concat two lists in Prolog Tags: prolog Problem: How to concat two lists in Prolog I was reading a prolog code about concatenation of two lists. It works well but I cannot understand how it works : concatenation([ ], Lista, Lista). concatenation([ Elem \| Li...	How to concat two lists in Prolog How to concat two lists in Prolog prolog How Prolog Lista Elem Lista1 Lista2 Lista3 Result How to concat two lists in Prolog I was reading a prolog code about concatenation of two lists. It works well but I cannot understand how it works : First I cannot understand that in the goal par...	[ 0.011962890625, 0.0126953125, 0.002166748046875, 0.00909423828125, 0.000080108642578125, 0.0189208984375, -0.025634765625, 0.0150146484375, 0.009033203125, -0.040283203125, 0.00421142578125, -0.0302734375, -0.01068115234375, 0.00072479248046875, 0.0147705078125, -0.01226806640625, 0....	[ 11249, 47, 158, 4460, 6626, 5303, 7, 23, 1250, 4867, 502, 50085, 540, 195, 304, 363, 126684, 18151, 33, 43240, 53418, 28219, 3642, 69236, 15400, 3638, 77336, 74481, 7108, 5609, 10336, 46741, 2016, 289, 195625, 8337, 11737, 12830, 720, 234...	[ 0.0648193359375, 0.00811767578125, 0.1666259765625, 0.27490234375, 0.169921875, 0.246826171875, 0.049957275390625, 0.019073486328125, 0.1685791015625, 0.2391357421875, 0.136474609375, 0.175048828125, 0.008941650390625, 0.049774169921875, 0.0283660888671875, 0.0919189453125, 0.1004638...	embed
21507372_c1	21507372	prolog	1	1 =\= X2; Y1 =\= Y2), ((X1 < Limit, X is X1 + 1, doesnt_contain(L, X, Y1), build_paths(X, Y1, X2, Y2, Limit, [[X, Y1]\|L], AL)); (Y1 < Limit, Y is Y1 + 1, doesnt_contain(L, X1, Y), build_paths(X1, Y, X2, Y2, Limit, [[X1, Y]\|L], AL)); (X1 > 1, X is X1 - 1, doesnt_contain(L, X, Y1), build_paths(X, Y1, X2, Y2, Limit, [[X, ...	1 =\= X2; Y1 =\= Y2), ((X1 < Limit, X is X1 + 1, doesnt_contain(L, X, Y1), build_paths(X, Y1, X2, Y2, Limit, [[X, Y1]\|L], AL)); (Y1 < Limit, Y is Y1 + 1, doesnt_contain(L, X1, Y), build_paths(X1, Y, X2, Y2, Limit, [[X1, Y]\|L], AL)); (X1 > 1, X is X1 - 1, doesnt_contain(L, X, Y1), build_paths(X, Y1, X2, Y2, Limit, [[X, ...	[ -0.00616455078125, 0.02978515625, 0.00885009765625, -0.00994873046875, 0.00113677978515625, 0.00958251953125, -0.00299072265625, -0.008056640625, 0.008056640625, -0.0223388671875, 0.021240234375, -0.0002498626708984375, 0.00372314453125, 0.01458740234375, 0.020263671875, 0.007537841796...	[ 106, 2203, 1193, 304, 74, 990, 418, 1369, 10461, 1542, 4426, 125177, 83, 997, 22027, 18, 98102, 73, 866, 17727, 45367, 128405, 76172, 9804, 1723, 32149, 27781, 140992, 171859, 12989, 17137, 3611, 120067, 17475, 118, 60875, 4034, 5303, 756, ...	[ 0.1107177734375, 0.0174713134765625, 0.1285400390625, 0.1566162109375, 0.111572265625, 0.122314453125, 0.1005859375, 0.018218994140625, 0.12353515625, 0.111572265625, 0.032012939453125, 0.211181640625, 0.04815673828125, 0.126953125, 0.0831298828125, 0.0596923828125, 0.1468505859375, ...	embed
72555579_c2	72555579	prolog	2	to OutStream augment([], _). augment([row(_, ID, Name, HW1, HW2, HW3, Midterm, Final)\|Rows], OutStream) :- Score is round(HW1 * 0.1 + HW2 * 0.1 + HW3 * 0.1 + Midterm * 0.3 + Final * 0.4), Grade is grade(Score), write(OutStream, ID), write(OutStream, ','), write(OutStream, Name), write(OutStream, ','), write(OutStream,...	to OutStream augment([], _). augment([row(_, ID, Name, HW1, HW2, HW3, Midterm, Final)\|Rows], OutStream) :- Score is round(HW1 * 0.1 + HW2 * 0.1 + HW3 * 0.1 + Midterm * 0.3 + Final * 0.4), Grade is grade(Score), write(OutStream, ID), write(OutStream, ','), write(OutStream, Name), write(OutStream, ','), write(OutStream,...	[ 0.0205078125, 0.003936767578125, 0.00787353515625, 0.006317138671875, -0.01300048828125, -0.003631591796875, 0.0103759765625, 0.0223388671875, -0.01708984375, 0.042724609375, 0.003997802734375, -0.0235595703125, -0.0031280517578125, 0.00140380859375, -0.01611328125, -0.0172119140625, ...	[ 47, 13538, 115061, 9620, 674, 101, 194, 15555, 11338, 15757, 572, 1456, 418, 304, 363, 23166, 32166, 27188, 12724, 19725, 268, 15772, 168071, 83, 68807, 841, 661, 107754, 997, 127089, 121254, 22453, 44000, 30854, 33022, 79858, 13169, 132, 1...	[ 0.201904296875, 0.2900390625, 0.34375, 0.2303466796875, 0.2440185546875, 0.0872802734375, 0.027252197265625, 0.1988525390625, 0.1083984375, 0.0982666015625, 0.0272369384765625, 0.1197509765625, 0.0994873046875, 0.11767578125, 0.124267578125, 0.0677490234375, 0.2130126953125, 0.1962...	embed
44231680_c0	44231680	prolog	0	Title: Prolog. Nodes of a Binary Tree Problem title: Prolog. Nodes of a Binary Tree Tags: tree, prolog Problem: Prolog. Nodes of a Binary Tree Im new using Prolog and I wish you could help me. I need to get all nodes in a binary tree with a predicate called listofnodes(A4,L) . The tree A4 is made like this: [[[[[],1,[]...	Prolog. Nodes of a Binary Tree Prolog. Nodes of a Binary Tree tree prolog Prolog Nodes Binary Tree Abn Prolog. Nodes of a Binary Tree Im new using Prolog and I wish you could help me. I need to get all nodes in a binary tree with a predicate called listofnodes(A4,L) . The tree A4 is made like this: And has this form Ok...	[ 0.013427734375, 0.0023040771484375, -0.0034942626953125, 0.0010986328125, 0.002349853515625, 0.01239013671875, -0.01251220703125, 0.00701904296875, 0.007080078125, -0.05517578125, -0.0177001953125, -0.0247802734375, -0.005706787109375, -0.0009918212890625, 0.01422119140625, -0.01300048...	[ 1250, 4867, 438, 988, 111, 10, 54092, 1294, 101344, 53201, 502, 3157, 19, 3525, 17368, 32599, 5809, 4358, 3871, 2046, 756, 110, 23, 2394, 6635, 1653, 2063, 400, 36834, 157, 284, 617, 866, 62, 83, 7228, 1884, 903, 3173, 9972, 102678, 2...	[ 0.1563720703125, 0.212158203125, 0.2005615234375, 0.1817626953125, 0.1131591796875, 0.0254058837890625, 0.1885986328125, 0.1123046875, 0.216064453125, 0.2314453125, 0.1143798828125, 0.0557861328125, 0.049102783203125, 0.006622314453125, 0.05072021484375, 0.0673828125, 0.0035400390625...	embed
58785006_c0	58785006	prolog	0	Title: How is the day of the week unicorn? Problem title: How is the day of the week unicorn? Tags: prolog, zebra-puzzle Problem: How is the day of the week unicorn? Task: The Unicorn is known to lie on Mondays, Tuesdays, and Wednesdays and tells the truth on all other days of the week. He can say: “Yesterday I lied. A...	How is the day of the week unicorn? How is the day of the week unicorn? prolog zebra-puzzle How Day Tomorrow unicornLies1 Days unicornLies2 How is the day of the week unicorn? Task: The Unicorn is known to lie on Mondays, Tuesdays, and Wednesdays and tells the truth on all other days of the week. He can say: “Yesterday...	[ -0.0025634765625, -0.003875732421875, 0.0074462890625, 0.036865234375, -0.01953125, -0.00103759765625, 0.0057373046875, 0.00921630859375, -0.0036773681640625, -0.007659912109375, -0.0106201171875, 0.02783203125, -0.0169677734375, 0.00482177734375, 0.0042724609375, 0.0184326171875, -0...	[ 11249, 83, 5155, 111, 70, 5895, 60347, 42, 19, 502, 4867, 116232, 1766, 13894, 10013, 237215, 92314, 418, 97292, 304, 9598, 92, 581, 11789, 10517, 51529, 47, 28127, 98, 68318, 97001, 136, 64227, 14192, 85027, 3789, 13312, 831, 5154, 91480...	[ 0.1275634765625, 0.10400390625, 0.1910400390625, 0.193115234375, 0.08648681640625, 0.2215576171875, 0.1787109375, 0.162841796875, 0.15185546875, 0.0537109375, 0.0858154296875, 0.1141357421875, 0.00927734375, 0.0494384765625, 0.127197265625, 0.20458984375, 0.16064453125, 0.030899047...	embed
4278921_c1	4278921	prolog	1	in Prolog and trying to be a fast learner. this is the code i have tried to come up with :-dynamic(node/3). :-dynamic(way/2). % some nodes node(46315543, 52.35548, 4.84315). node(46315968, 52.35558, 4.84068). node(46315971, 52.35531, 4.84986). % predicate to add a node to a way add_node_to_way(WayID, NodeID) :- way(Wa...	in Prolog and trying to be a fast learner. this is the code i have tried to come up with :-dynamic(node/3). :-dynamic(way/2). % some nodes node(46315543, 52.35548, 4.84315). node(46315968, 52.35558, 4.84068). node(46315971, 52.35531, 4.84986). % predicate to add a node to a way add_node_to_way(WayID, NodeID) :- way(Wa...	[ 0.004974365234375, -0.00885009765625, 0.014892578125, 0.007354736328125, -0.008544921875, 0.00274658203125, 0.003204345703125, -0.016357421875, 0.00445556640625, -0.053955078125, 0.02099609375, -0.0213623046875, -0.0247802734375, -0.0283203125, 0.00689697265625, -0.00994873046875, 0....	[ 23, 1250, 4867, 31577, 4271, 30698, 56, 903, 18151, 17, 765, 37842, 1380, 1257, 678, 242554, 157, 112, 18113, 7514, 12477, 1745, 3060, 110, 988, 174333, 167316, 7221, 104043, 9285, 13903, 363, 62155, 16028, 5016, 178764, 1653, 2063, 67, 1...	[ 0.054595947265625, 0.1787109375, 0.273681640625, 0.055908203125, 0.046234130859375, 0.095947265625, 0.03497314453125, 0.018798828125, 0.2239990234375, 0.00750732421875, 0.010223388671875, 0.1334228515625, 0.018707275390625, 0.065673828125, 0.0263824462890625, 0.2066650390625, 0.16662...	embed
16145119_c1	16145119	prolog	1	? creep Exit: (8) nl ? creep Call: (8) printList([]) ? creep Exit: (8) printList([]) ? creep Exit: (7) printList([[2, b]]) ? creep Exit: (6) printList([[1, a], [2, b]]) ? creep true. This is quite clear for me (I think that my previous reasoning is right) but I am not understanding why whenever it reaches an element i...	? creep Exit: (8) nl ? creep Call: (8) printList([]) ? creep Exit: (8) printList([]) ? creep Exit: (7) printList([[2, b]]) ? creep Exit: (6) printList([[1, a], [2, b]]) ? creep true. This is quite clear for me (I think that my previous reasoning is right) but I am not understanding why whenever it reaches an element i...	[ 0.00885009765625, 0.006683349609375, -0.0089111328125, 0.0255126953125, -0.005096435546875, 0.0272216796875, -0.0026702880859375, -0.01708984375, -0.006195068359375, -0.00958251953125, 0.008544921875, -0.0172119140625, -0.0185546875, 0.01007080078125, 0.008544921875, -0.01312255859375,...	[ 705, 49512, 254, 5443, 217, 10021, 13169, 26265, 28412, 154663, 8696, 304, 876, 6791, 29568, 34735, 31635, 7108, 959, 100094, 15400, 217684, 58359, 90, 12830, 23, 70796, 5303, 11782, 41911, 98, 442, 8781, 27750, 190355, 1528, 90698, 5117, 7...	[ 0.007781982421875, 0.2388916015625, 0.204345703125, 0.1591796875, 0.1253662109375, 0.1734619140625, 0.115966796875, 0.1624755859375, 0.2181396484375, 0.260498046875, 0.049224853515625, 0.0249786376953125, 0.06158447265625, 0.049407958984375, 0.076416015625, 0.05035400390625, 0.000671...	embed
74501307_c0	74501307	prolog	0	Title: How to create an installer for a project generating PROLOG code? Problem title: How to create an installer for a project generating PROLOG code? Tags: inno-setup, java, prolog, swing Problem: How to create an installer for a project generating PROLOG code? I'm creating a project that generates a prolog file that...	How to create an installer for a project generating PROLOG code? How to create an installer for a project generating PROLOG code? inno-setup java prolog swing How PROLOG How to create an installer for a project generating PROLOG code? I'm creating a project that generates a prolog file that will be audited by swi prolo...	[ 0.01409912109375, 0.000919342041015625, -0.00201416015625, 0.00482177734375, -0.024658203125, 0.0142822265625, -0.00384521484375, -0.00787353515625, -0.003997802734375, -0.0203857421875, 0.0106201171875, -0.0050048828125, -0.007476806640625, -0.01031494140625, 0.032958984375, -0.002151...	[ 11249, 47, 28282, 142, 74022, 100, 13452, 12663, 1916, 10514, 47510, 18151, 23, 157, 3509, 2037, 79, 330, 502, 4867, 144291, 105233, 139392, 11435, 44200, 91, 2452, 17368, 10332, 3642, 831, 43824, 35125, 102158, 9969, 34759, 25842, 38937, 2...	[ 0.0948486328125, 0.02130126953125, 0.2041015625, 0.070068359375, 0.291015625, 0.06182861328125, 0.170654296875, 0.144287109375, 0.0374755859375, 0.1865234375, 0.23974609375, 0.1953125, 0.0745849609375, 0.1004638671875, 0.050872802734375, 0.0909423828125, 0.0986328125, 0.15869140625...	embed
31230913_c0	31230913	prolog	0	Title: Prolog list concat Problem title: Prolog list concat Tags: prolog Problem: Prolog list concat I am learning Prolog and I have stumbled upon this piece of code and I cannot make sense of it: Code: append([],Ys,Ys). append([X\|Xs],Ys,[X\|Zs]):- append(Xs, Ys, Zs). In the example, the instruction given is: Code: appe...	Prolog list concat Prolog list concat prolog Prolog _G5166 _G5112 Prolog list concat I am learning Prolog and I have stumbled upon this piece of code and I cannot make sense of it: Code: In the example, the instruction given is: Code: and the output is Ys = [1,2,3,4] And I don't understand how that happens. I understan...	[ 0.01190185546875, 0.00023365020751953125, 0.01092529296875, 0.00031280517578125, 0.00147247314453125, 0.0140380859375, -0.01312255859375, 0.0216064453125, 0.024658203125, -0.01275634765625, 0.00970458984375, -0.01519775390625, -0.0174560546875, -0.017822265625, 0.00130462646484375, 0.0...	[ 1250, 4867, 5303, 158, 4460, 502, 724, 758, 156215, 11703, 1530, 52080, 40099, 63847, 18151, 53418, 3249, 10422, 442, 28864, 27781, 188336, 140992, 83, 990, 7, 2203, 133063, 82449, 2301, 18, 28219, 96276, 142424, 98, 1193, 184750, 390, 1632...	[ 0.1619873046875, 0.226318359375, 0.172607421875, 0.119873046875, 0.1719970703125, 0.118896484375, 0.0445556640625, 0.0841064453125, 0.2279052734375, 0.1304931640625, 0.137939453125, 0.043243408203125, 0.018798828125, 0.0093994140625, 0.1395263671875, 0.055084228515625, 0.033386230468...	embed
4716245_c0	4716245	prolog	0	Title: Solving logic puzzle in Prolog Problem title: Solving logic puzzle in Prolog Tags: prolog, zebra-puzzle Problem: Solving logic puzzle in Prolog I am reading "Learn Prolog Now" and one of its exercises I haven't been able to solve myself is the following: There is a street with three neighboring houses that all h...	Solving logic puzzle in Prolog Solving logic puzzle in Prolog prolog zebra-puzzle Solving Prolog Solving logic puzzle in Prolog I am reading "Learn Prolog Now" and one of its exercises I haven't been able to solve myself is the following: Any ideas how to code it under Prolog? Thanks.	[ 0.00927734375, -0.003326416015625, 0.00067901611328125, 0.00640869140625, -0.01336669921875, 0.01263427734375, -0.0306396484375, 0.00848388671875, -0.002227783203125, -0.0299072265625, 0.00469970703125, 0.00946044921875, -0.00152587890625, -0.00555419921875, 0.0024261474609375, 0.02783...	[ 6678, 6496, 62775, 104192, 23, 1250, 4867, 502, 116232, 9, 1766, 13894, 133, 16454, 14240, 81979, 87, 38246, 18, 19048, 47, 86869, 35978, 83, 25632, 25647, 3642, 18151, 442, 1379 ]	[ 0.0972900390625, 0.0570068359375, 0.1849365234375, 0.186767578125, 0.06781005859375, 0.1617431640625, 0.2442626953125, 0.10675048828125, 0.214599609375, 0.02166748046875, 0.11212158203125, 0.12164306640625, 0.00821685791015625, 0.04058837890625, 0.0924072265625, 0.08795166015625, 0.0...	embed
37071371_c1	37071371	prolog	1	it at the moment: safe_square(Xa,Ya,X,Y,N) :- maxBound(N), adjacent(Xa,Ya,X,Y,N), safe(X,Y), move(Xa,Ya,X,Y), retract(show(L)), append([[X,Y]],L,NewL), assert(show(NewL)). move(Xa,Ya,X,Y) :- retract(square(Xa,Ya,ListFrom)), delete(ListFrom,a,Existing), retract(square(X,Y,ListTo)), append([a],ListTo,NextPositionList), ...	it at the moment: safe_square(Xa,Ya,X,Y,N) :- maxBound(N), adjacent(Xa,Ya,X,Y,N), safe(X,Y), move(Xa,Ya,X,Y), retract(show(L)), append([[X,Y]],L,NewL), assert(show(NewL)). move(Xa,Ya,X,Y) :- retract(square(Xa,Ya,ListFrom)), delete(ListFrom,a,Existing), retract(square(X,Y,ListTo)), append([a],ListTo,NextPositionList), ...	[ -0.020263671875, 0.01068115234375, 0.0244140625, 0.0216064453125, -0.00958251953125, 0.01123046875, 0.008544921875, 0.0181884765625, 0.017822265625, -0.0203857421875, 0.0014801025390625, 0.040283203125, -0.015380859375, -0.009033203125, 0.0030517578125, -0.0191650390625, -0.017089843...	[ 442, 99, 3095, 46002, 454, 108047, 1542, 11, 21566, 1723, 839, 15772, 18389, 12647, 7030, 123594, 16797, 25813, 41499, 15390, 31374, 866, 114689, 46568, 33657, 154663, 168407, 154109, 19279, 1419, 7763, 81280, 7192, 172, 237, 711, 418, 647, ...	[ 0.107177734375, 0.138671875, 0.148193359375, 0.24658203125, 0.01226806640625, 0.26318359375, 0.1087646484375, 0.0745849609375, 0.176025390625, 0.0986328125, 0.09130859375, 0.05133056640625, 0.1734619140625, 0.07257080078125, 0.1634521484375, 0.1162109375, 0.1685791015625, 0.1309814...	embed
13786024_c0	13786024	prolog	0	Title: output when all possibilities have been searched in the search tree in the prolog Problem title: output when all possibilities have been searched in the search tree in the prolog Tags: prolog Problem: output when all possibilities have been searched in the search tree in the prolog I have written the following p...	output when all possibilities have been searched in the search tree in the prolog output when all possibilities have been searched in the search tree in the prolog prolog CSE1 DIC CVIP output when all possibilities have been searched in the search tree in the prolog I have written the following program for verifying if...	[ 0.01318359375, -0.000019431114196777344, 0.00323486328125, 0.0247802734375, -0.0135498046875, 0.000469207763671875, 0.0108642578125, -0.017822265625, -0.009521484375, 0.020263671875, 0.00946044921875, 0.00102996826171875, 0.000904083251953125, -0.00003886222839355469, 0.003875732421875, ...	[ 140992, 3229, 756, 97370, 2449, 765, 33938, 53201, 502, 4867, 2809, 297, 23, 9127, 418, 138943, 163175, 59121, 1528, 493, 151138, 2174, 9836, 58735, 294, 1556, 75204, 44000, 284, 28368, 8337, 9774, 60875, 151575, 69307, 959, 59226, 1653, 20...	[ 0.2340087890625, 0.085693359375, 0.161865234375, 0.2340087890625, 0.1668701171875, 0.035308837890625, 0.2037353515625, 0.2318115234375, 0.1444091796875, 0.2279052734375, 0.0306549072265625, 0.029266357421875, 0.028228759765625, 0.08209228515625, 0.0166168212890625, 0.04437255859375, ...	embed
40427006_c0	40427006	prolog	0	Title: gprolog error for default functions: error(existence_error... Problem title: gprolog error for default functions: error(existence_error... Tags: gnu-prolog, prolog Problem: gprolog error for default functions: error(existence_error... I keep running into an existence error for many different default functions in...	gprolog error for default functions: error(existence_error... gprolog error for default functions: error(existence_error... gnu-prolog prolog existence_error top_level g_assign GVarName instantiation_error b_setval List gprolog error for default functions: error(existence_error... I keep running into an existence error...	[ 0.021240234375, 0.0150146484375, -0.001983642578125, 0.0034027099609375, 0.00101470947265625, 0.0029449462890625, -0.006683349609375, -0.00433349609375, 0.0087890625, -0.026611328125, 0.0208740234375, 0.0035247802734375, 0.000690460205078125, -0.00061798095703125, 0.0263671875, 0.00121...	[ 706, 3454, 4867, 18499, 100, 114977, 32354, 132, 116311, 188800, 104155, 502, 2663, 67919, 162, 31304, 527, 81827, 163612, 34648, 876, 3509, 1405, 32036, 13695, 51042, 3934, 5941, 12921, 3871, 20600, 9844, 37076, 179769, 61924, 7964, 77336, 2...	[ 0.10009765625, 0.186279296875, 0.2200927734375, 0.203125, 0.027008056640625, 0.2340087890625, 0.1710205078125, 0.057891845703125, 0.224853515625, 0.2301025390625, 0.14892578125, 0.1568603515625, 0.04437255859375, 0.0631103515625, 0.01300048828125, 0.1287841796875, 0.017059326171875, ...	embed
13220883_c0	13220883	prolog	0	Title: Process List in Prolog Problem title: Process List in Prolog Tags: prolog, list, wumpus-world Problem: Process List in Prolog I'm having trouble using lists in Prolog. I am implementing a Wumpus World example and need to move the wumpus during each user movement. The movement for the wumpus is predefined in a li...	Process List in Prolog Process List in Prolog prolog list wumpus-world Process List Prolog CheckX CheckY Process List in Prolog I'm having trouble using lists in Prolog. I am implementing a Wumpus World example and need to move the wumpus during each user movement. The movement for the wumpus is predefined in a list, a...	[ 0.01470947265625, 0.0003566741943359375, -0.0159912109375, 0.034912109375, -0.036376953125, 0.022705078125, -0.0033416748046875, -0.002655029296875, 0.003387451171875, -0.0177001953125, -0.004791259765625, 0.040771484375, -0.027099609375, -0.008056640625, -0.009033203125, 0.00799560546...	[ 123996, 32036, 1250, 4867, 23, 502, 5303, 148, 316, 7332, 32554, 38679, 1542, 1723, 63134, 17368, 7, 29479, 601, 6661, 27781, 25813, 20271, 12638, 38937, 112664, 1653, 13, 5983, 6528, 3642, 7426, 5773, 10336, 5423, 31913, 2806, 186, 133, ...	[ 0.2330322265625, 0.23681640625, 0.171630859375, 0.2445068359375, 0.0396728515625, 0.120849609375, 0.250732421875, 0.063232421875, 0.1383056640625, 0.2117919921875, 0.1500244140625, 0.1585693359375, 0.1268310546875, 0.1416015625, 0.119384765625, 0.0675048828125, 0.0726318359375, 0.0...	embed
30862098_c0	30862098	prolog	0	Title: prolog misunderstanding. Split list into two list with even and odd positions. where is my mistake? Problem title: prolog misunderstanding. Split list into two list with even and odd positions. where is my mistake? Tags: list, split, prolog Problem: prolog misunderstanding. Split list into two list with even and...	prolog misunderstanding. Split list into two list with even and odd positions. where is my mistake? prolog misunderstanding. Split list into two list with even and odd positions. where is my mistake? list split prolog Split List Odd Even Oddlist Evenlist prolog misunderstanding. Split list into two list with even and o...	[ -0.00058746337890625, 0.017333984375, 0.004913330078125, -0.00130462646484375, -0.0234375, 0.03369140625, -0.0107421875, 0.0208740234375, 0.01263427734375, 0.0145263671875, 0.027099609375, -0.0052490234375, -0.00628662109375, 0.0213623046875, 0.0101318359375, 0.01336669921875, 0.0288...	[ 502, 4867, 1239, 24658, 144057, 46474, 5303, 3934, 6626, 678, 3853, 136, 70270, 19069, 7440, 83, 759, 121742, 65450, 32036, 67948, 31267, 6562, 31577, 3789, 88, 195, 58387, 27060, 116153, 29806, 48903, 1658, 28219, 4734, 30646, 966, 2681, 4...	[ 0.1544189453125, 0.197021484375, 0.06292724609375, 0.12890625, 0.10546875, 0.221435546875, 0.2208251953125, 0.112060546875, 0.1556396484375, 0.05023193359375, 0.194091796875, 0.0357666015625, 0.20166015625, 0.1573486328125, 0.0677490234375, 0.0009765625, 0.0249786376953125, 0.18713...	embed
32827699_c0	32827699	prolog	0	Title: Implement a Prolog program to verify whether primitive expressions are type-correct Problem title: Implement a Prolog program to verify whether primitive expressions are type-correct Tags: prolog Problem: Implement a Prolog program to verify whether primitive expressions are type-correct Input format: The first ...	Implement a Prolog program to verify whether primitive expressions are type-correct Implement a Prolog program to verify whether primitive expressions are type-correct prolog Implement Prolog is_correct Implement a Prolog program to verify whether primitive expressions are type-correct Input format: The first term in t...	[ 0.01080322265625, 0.005706787109375, 0.024169921875, 0.03515625, -0.005859375, 0.0145263671875, -0.01263427734375, 0.006439208984375, 0.00634765625, -0.0189208984375, 0.0205078125, -0.00726318359375, 0.004150390625, -0.0013275146484375, 0.004241943359375, 0.0118408203125, 0.023071289...	[ 153941, 1250, 4867, 1528, 47, 493, 40383, 36766, 128489, 13, 125195, 7, 621, 10644, 9, 32399, 15390, 502, 83, 360, 7077, 9384, 5117, 13579, 79986, 5303, 12638, 1614, 6562, 8035, 3173, 21690, 2886, 50986, 17932, 80854, 69407, 71864, 169463, ...	[ 0.2449951171875, 0.2115478515625, 0.279052734375, 0.195556640625, 0.0111083984375, 0.158935546875, 0.152587890625, 0.08538818359375, 0.2352294921875, 0.1044921875, 0.248046875, 0.0275115966796875, 0.09820556640625, 0.2215576171875, 0.048309326171875, 0.1976318359375, 0.0216064453125,...	embed
42819814_c0	42819814	prolog	0	Title: Prolog: removing all elements that occur in list A from list B Problem title: Prolog: removing all elements that occur in list A from list B Tags: list, predicate, prolog Problem: Prolog: removing all elements that occur in list A from list B I'm trying to define a predicate "delete(L1, L2, L3)" that is valid wh...	Prolog: removing all elements that occur in list A from list B Prolog: removing all elements that occur in list A from list B list predicate prolog list Prolog Prolog: removing all elements that occur in list A from list B I'm trying to define a predicate "delete(L1, L2, L3)" that is valid when L3 equals L2 minus any o...	[ -0.0179443359375, 0.0198974609375, -0.000637054443359375, 0.010986328125, -0.01324462890625, 0.01446533203125, 0.00677490234375, -0.007476806640625, 0.005889892578125, 0.00127410888671875, 0.0184326171875, 0.005889892578125, -0.0009307861328125, -0.004638671875, -0.006256103515625, 0.0...	[ 1250, 4867, 49146, 6496, 756, 80854, 74918, 5303, 62, 1295, 335, 12, 23, 1653, 2063, 502, 31577, 61924, 67, 8520, 866, 418, 339, 304, 21320, 35604, 363, 105950, 26948, 70541, 154109, 132, 25256, 155761, 1193, 2806, 51, 40383, 100, 2203, ...	[ 0.195556640625, 0.257080078125, 0.141357421875, 0.1142578125, 0.10888671875, 0.1781005859375, 0.14453125, 0.148193359375, 0.0968017578125, 0.10284423828125, 0.1014404296875, 0.008544921875, 0.024383544921875, 0.1767578125, 0.2147216796875, 0.15234375, 0.062255859375, 0.147094726562...	embed
54559532_c0	54559532	prolog	0	Title: Putting SWI-Prolog's JPL interface to work Problem title: Putting SWI-Prolog's JPL interface to work Tags: prolog, swi-prolog, java, jpl Problem: Putting SWI-Prolog's JPL interface to work I want to use JPL to create a graphic interface to my project, so I went and searched a code example to start work...	Putting SWI-Prolog's JPL interface to work Putting SWI-Prolog's JPL interface to work prolog swi-prolog java jpl Putting SWI-Prolog JPL ERROR jpl.pl:4243 open_shared_object Initialization Please java.dll PATH User system.pl:4 Exported jpl:jpl_c_lib_version Undefined jpl:jni_func JFrame _10490 jpl:jFindClass _...	[ 0.00970458984375, 0.0194091796875, -0.0019989013671875, 0.016845703125, -0.012939453125, 0.00701904296875, -0.01226806640625, -0.007781982421875, 0.0194091796875, -0.04150390625, -0.00176239013671875, -0.00738525390625, -0.015380859375, -0.01165771484375, 0.0174560546875, 0.00677490234...	[ 19577, 1916, 159, 38969, 9, 10752, 4867, 3768, 821, 21130, 101758, 47, 4488, 502, 2452, 3454, 79, 330, 1647, 2424, 151206, 24638, 5, 33529, 11548, 9803, 67886, 71, 454, 187694, 360, 1890, 289, 30607, 1181, 436, 139909, 5426, 617, 134456, ...	[ 0.133544921875, 0.05487060546875, 0.1075439453125, 0.273193359375, 0.0276031494140625, 0.1727294921875, 0.208251953125, 0.08837890625, 0.1552734375, 0.273681640625, 0.2437744140625, 0.0670166015625, 0.150390625, 0.1241455078125, 0.223388671875, 0.143310546875, 0.154541015625, 0.236...	embed
49518852_c0	49518852	prolog	0	Title: Finding permutations of a list using insertion of element in Prolog Problem title: Finding permutations of a list using insertion of element in Prolog Tags: prolog Problem: Finding permutations of a list using insertion of element in Prolog For an assignment I'm asked to define a permutation function in two diff...	Finding permutations of a list using insertion of element in Prolog Finding permutations of a list using insertion of element in Prolog prolog insertion Finding Prolog L2-L1 Finding permutations of a list using insertion of element in Prolog For an assignment I'm asked to define a permutation function in two different ...	[ -0.0098876953125, 0.01226806640625, 0.013671875, -0.0059814453125, -0.024169921875, 0.014404296875, -0.0458984375, -0.0162353515625, 0.01116943359375, -0.039306640625, 0.00982666015625, 0.004150390625, -0.0000820159912109375, -0.0194091796875, -0.01348876953125, 0.0191650390625, 0.00...	[ 26040, 117, 14311, 21094, 5303, 17368, 241860, 111, 12830, 1250, 4867, 502, 339, 18504, 866, 418, 95486, 37170, 61924, 561, 22062, 32354, 6626, 12921, 48322, 4527, 154109, 1542, 10461, 29568, 32920, 304, 183540, 2060, 26818, 20697, 145823, 43...	[ 0.1300048828125, 0.15283203125, 0.2425537109375, 0.1143798828125, 0.1617431640625, 0.03497314453125, 0.2042236328125, 0.023193359375, 0.1734619140625, 0.1622314453125, 0.233154296875, 0.1234130859375, 0.0574951171875, 0.126953125, 0.07080078125, 0.066650390625, 0.08746337890625, 0....	embed
23207576_c1	23207576	prolog	1	it. For example in ECLiPSe CLP: :- lib(ic). solve(Vars, Ineqs, Result) :- Vars :: 0..9, ( foreach((A, B), Ineqs) do A #< B ), labeling(Vars), concat_string(Vars, Result). [eclipse]: Vars = [__, ___, __, ___], Ineqs = [(__, ___)], solve(Vars, Ineqs, Result). Vars = [0, 1, 0, 1] __ = 0 ___ = 1 Ineqs = [(0, 1)] Result = ...	it. For example in ECLiPSe CLP: :- lib(ic). solve(Vars, Ineqs, Result) :- Vars :: 0..9, ( foreach((A, B), Ineqs) do A #< B ), labeling(Vars), concat_string(Vars, Result). [eclipse]: Vars = [__, ___, __, ___], Ineqs = [(__, ___)], solve(Vars, Ineqs, Result). Vars = [0, 1, 0, 1] __ = 0 ___ = 1 Ineqs = [(0, 1)] Result = ...	[ 0.0079345703125, -0.0091552734375, -0.0042724609375, 0.0272216796875, -0.019287109375, 0.0240478515625, -0.01446533203125, 0.007293701171875, 0.0045166015625, -0.02880859375, 0.00555419921875, -0.0003757476806640625, 0.01611328125, 0.0260009765625, 0.004974365234375, 0.01397705078125, ...	[ 442, 27781, 59947, 9506, 9059, 13, 313, 37352, 25474, 1771, 86869, 81827, 7, 360, 864, 126684, 3323, 1984, 757, 1126, 100, 41581, 335, 54, 16093, 67967, 158, 4460, 91693, 106371, 116185, 2203, 2389, 106, 4879, 76327, 418, 9077, 3642, 2046...	[ 0.18408203125, 0.099609375, 0.085693359375, 0.1312255859375, 0.1065673828125, 0.129150390625, 0.0032958984375, 0.1741943359375, 0.1336669921875, 0.0897216796875, 0.16064453125, 0.20654296875, 0.15185546875, 0.1619873046875, 0.214599609375, 0.2008056640625, 0.2568359375, 0.057556152...	embed
57740302_c1	57740302	prolog	1	b, acc\|...] My first implementation is different, but I can't make it work on any case. letter(X) :- member(X, [a, b, c]). generateWord(0, []) :- !. generateWord(N, [H\|T]) :- letter(H), NextN is N - 1, generateWord(NextN, T), !. generateAtomicWord(N, Word) :- generateWord(N, WList), atomic_list_concat(WList, Word). max...	b, acc\|...] My first implementation is different, but I can't make it work on any case. letter(X) :- member(X, [a, b, c]). generateWord(0, []) :- !. generateWord(N, [H\|T]) :- letter(H), NextN is N - 1, generateWord(NextN, T), !. generateAtomicWord(N, Word) :- generateWord(N, WList), atomic_list_concat(WList, Word). max...	[ 0.0037384033203125, 0.0040283203125, 0.003997802734375, 0.017822265625, -0.013916015625, 0.0225830078125, 0.00299072265625, -0.0169677734375, 0.01611328125, -0.056396484375, -0.004974365234375, 0.017578125, 0.001434326171875, 0.01361083984375, -0.004364013671875, 0.000446319580078125, ...	[ 876, 50015, 58745, 75606, 5117, 208124, 12921, 831, 18, 3249, 442, 4488, 2499, 7225, 31330, 1542, 15772, 32786, 501, 139392, 164805, 2389, 711, 839, 841, 618, 4997, 83, 541, 106, 81280, 384, 12078, 22543, 601, 154663, 34627, 6562, 2271, 4...	[ 0.139892578125, 0.1500244140625, 0.076171875, 0.09063720703125, 0.0751953125, 0.203369140625, 0.144287109375, 0.0753173828125, 0.07171630859375, 0.04290771484375, 0.007843017578125, 0.1064453125, 0.002655029296875, 0.095947265625, 0.1856689453125, 0.113525390625, 0.0310211181640625, ...	embed
70596545_c0	70596545	prolog	0	Title: Drop out the N-th element from a list and display its value in a variable Problem title: Drop out the N-th element from a list and display its value in a variable Tags: prolog Problem: Drop out the N-th element from a list and display its value in a variable I have a predicate drop_at(X, L, N, R) which should dr...	Drop out the N-th element from a list and display its value in a variable Drop out the N-th element from a list and display its value in a variable prolog a Drop N-th drop_at P-1 Drop out the N-th element from a list and display its value in a variable I have a predicate drop_at(X, L, N, R) which should drop out the N-...	[ -0.007659912109375, 0.010498046875, -0.004638671875, -0.0189208984375, -0.020751953125, 0.02197265625, 0.0052490234375, -0.00634765625, 0.00018215179443359375, -0.01220703125, 0.0225830078125, -0.006439208984375, -0.0225830078125, -0.01239013671875, 0.012451171875, 0.0230712890625, 0...	[ 130403, 1810, 541, 9, 927, 12830, 1295, 5303, 44116, 34292, 77336, 502, 4867, 36069, 257, 436, 5759, 23, 1653, 2063, 1542, 339, 627, 1193, 99091, 34648, 18632, 5809, 29479, 15044, 10366, 20802, 33770, 47, 154109, 653, 17368, 903, 8, 74635...	[ 0.177978515625, 0.1641845703125, 0.2081298828125, 0.050811767578125, 0.179443359375, 0.1708984375, 0.055908203125, 0.1392822265625, 0.1434326171875, 0.140625, 0.2320556640625, 0.1148681640625, 0.1563720703125, 0.1611328125, 0.0880126953125, 0.04730224609375, 0.0997314453125, 0.0071...	embed
41847580_c1	41847580	prolog	1	(wa,bakerloo). station(em,northern). station(eu,northern). station(ke,northern). station(tc,northern). station(ws,northern). %adjecent stations % % Central line adjacent(nh,lg,central,4). adjacent(lg,oc,central,4). adjacent(oc,tc,central,4). adjacent(tc,cl,central,4). adjacent(cl,ls,central,4). adjacent(ls,bg,central,4...	(wa,bakerloo). station(em,northern). station(eu,northern). station(ke,northern). station(tc,northern). station(ws,northern). %adjecent stations % % Central line adjacent(nh,lg,central,4). adjacent(lg,oc,central,4). adjacent(oc,tc,central,4). adjacent(tc,cl,central,4). adjacent(cl,ls,central,4). adjacent(ls,bg,central,4...	[ -0.0213623046875, -0.006378173828125, 0.0220947265625, 0.010986328125, -0.003631591796875, 0.0032501220703125, 0.01068115234375, 0.0078125, 0.0014495849609375, -0.01300048828125, -0.022216796875, 0.0206298828125, -0.01904296875, -0.0081787109375, -0.0003147125244140625, -0.019165039062...	[ 15, 634, 4, 10075, 56, 47673, 194, 29398, 195, 13665, 9319, 19, 4615, 350, 238, 19725, 1745, 14963, 16797, 15881, 13315, 123594, 6457, 14686, 58905, 29557, 6652, 31485, 16777, 3267, 686, 21605, 13333, 425, 182688, 115364, 289, 8080, 74132, ...	[ 0.058624267578125, 0.2122802734375, 0.0153045654296875, 0.1195068359375, 0.142333984375, 0.265380859375, 0.08154296875, 0.2181396484375, 0.1195068359375, 0.0921630859375, 0.10009765625, 0.028961181640625, 0.0970458984375, 0.07470703125, 0.0560302734375, 0.078369140625, 0.067260742187...	embed
56241542_c0	56241542	prolog	0	Title: Prolog Create Dictionaries Problem title: Prolog Create Dictionaries Tags: data-generation, swi-prolog, prolog, functional-programming Problem: Prolog Create Dictionaries I understand that Prolog is not an object-oriented language, and after reading a few StackOverflow posts, it is not clear to me that this is f...	Prolog Create Dictionaries Prolog Create Dictionaries data-generation swi-prolog prolog functional-programming Prolog Create Dictionaries Customer Customer.age Customer.name What Wot Prolog Create Dictionaries I understand that Prolog is not an object-oriented language, and after reading a few StackOverflow posts, it i...	[ 0.0260009765625, -0.0115966796875, 0.00897216796875, 0.0014495849609375, 0.001251220703125, 0.0150146484375, -0.0155029296875, 0.005767822265625, 0.01611328125, -0.0206298828125, 0.0081787109375, 0.00775146484375, 0.0078125, -0.005157470703125, 0.037109375, -0.004730224609375, -0.001...	[ 1250, 4867, 151313, 67437, 2053, 48281, 2452, 3454, 502, 123309, 28966, 124765, 4588, 11627, 28219, 959, 36746, 49133, 46876, 156673, 118664, 34735, 3820, 11, 55356, 26458, 4263, 1556, 4734, 9351, 2832, 79315, 32070, 6191, 7722, 8337, 27781, ...	[ 0.1571044921875, 0.244384765625, 0.20947265625, 0.24560546875, 0.080322265625, 0.0845947265625, 0.11328125, 0.10205078125, 0.1002197265625, 0.102294921875, 0.075927734375, 0.254150390625, 0.11328125, 0.1170654296875, 0.0380859375, 0.01361083984375, 0.13134765625, 0.0750732421875, ...	embed
68218135_c0	68218135	prolog	0	Title: Monkey and banana solution doesn't stop after grabbing the banana (Prolog) Problem title: Monkey and banana solution doesn't stop after grabbing the banana (Prolog) Tags: prolog Problem: Monkey and banana solution doesn't stop after grabbing the banana (Prolog) I have this code to represent the famous ...	Monkey and banana solution doesn't stop after grabbing the banana (Prolog) Monkey and banana solution doesn't stop after grabbing the banana (Prolog) prolog Monkey Prolog Pos Has State State1 Move State2 Monkey and banana solution doesn't stop after grabbing the banana (Prolog) I have this code to represent t...	[ 0.008056640625, 0.0223388671875, 0.00714111328125, 0.0299072265625, -0.0230712890625, 0.025146484375, -0.00567626953125, -0.006988525390625, 0.0013885498046875, -0.0257568359375, 0.012939453125, 0.01416015625, -0.01904296875, 0.0068359375, 0.00653076171875, 0.0299072265625, 0.0051574...	[ 213289, 136, 134399, 29806, 22027, 3768, 18, 7279, 7103, 59102, 23709, 10752, 4867, 502, 1250, 13498, 20625, 22836, 418, 135828, 304, 70, 903, 18151, 33636, 170277, 2667, 19770, 2967, 185688, 31635, 159029, 86869, 678, 61475, 11341, 30646, 7,...	[ 0.1956787109375, 0.170166015625, 0.20849609375, 0.188232421875, 0.026641845703125, 0.020904541015625, 0.04608154296875, 0.1396484375, 0.08935546875, 0.1566162109375, 0.08355712890625, 0.1044921875, 0.194580078125, 0.093994140625, 0.1363525390625, 0.1629638671875, 0.019775390625, 0....	embed
37284969_c0	37284969	prolog	0	Title: Prolog: a rule containing assert adds only first result to facts Problem title: Prolog: a rule containing assert adds only first result to facts Tags: sicstus-prolog, prolog, prolog-assert Problem: Prolog: a rule containing assert adds only first result to facts I'm trying to precompute some stuff and save the r...	Prolog: a rule containing assert adds only first result to facts Prolog: a rule containing assert adds only first result to facts sicstus-prolog prolog prolog-assert Prolog Cost assert_all Prolog: a rule containing assert adds only first result to facts I'm trying to precompute some stuff and save the results as facts ...	[ 0.027587890625, 0.0019989013671875, 0.01251220703125, 0.030029296875, -0.00250244140625, 0.00457763671875, -0.0186767578125, 0.0294189453125, 0.0126953125, -0.0284423828125, 0.00860595703125, 0.007568359375, -0.01904296875, 0.004150390625, 0.0245361328125, 0.0010986328125, 0.01324462...	[ 1250, 4867, 79986, 70541, 214, 237, 33657, 15190, 4734, 5117, 16750, 47, 15824, 26536, 18253, 3454, 502, 162, 63099, 5584, 10, 31577, 118562, 65970, 41884, 30098, 50339, 86595, 1528, 116120, 18151, 11034, 73419, 16865, 75463, 11435, 159, 1021...	[ 0.1915283203125, 0.26416015625, 0.21142578125, 0.1241455078125, 0.0640869140625, 0.1065673828125, 0.25830078125, 0.1700439453125, 0.0906982421875, 0.14306640625, 0.2227783203125, 0.0833740234375, 0.173095703125, 0.05108642578125, 0.1708984375, 0.06390380859375, 0.1051025390625, 0.0...	embed
43333614_c0	43333614	prolog	0	Title: Prolog - Constraint Library - Variable Scope Problem title: Prolog - Constraint Library - Variable Scope Tags: prolog, clpfd Problem: Prolog - Constraint Library - Variable Scope I'm working on trying to solve an LSAT logic problem with Prolog. I'm trying to get Prolog to tell me whether possible values for acto...	Prolog - Constraint Library - Variable Scope Prolog - Constraint Library - Variable Scope prolog clpfd Prolog Constraint Library Variable Scope use_module Jeff Rich Prolog - Constraint Library - Variable Scope I'm working on trying to solve an LSAT logic problem with Prolog. I'm trying to get Prolog to tell me whether ...	[ 0.00616455078125, 0.0189208984375, -0.00921630859375, 0.026611328125, 0.0093994140625, 0.0032958984375, 0.007293701171875, 0.0220947265625, -0.004547119140625, -0.0208740234375, 0.01220703125, -0.0125732421875, 0.0072021484375, 0.02197265625, 0.0281982421875, -0.00872802734375, -0.00...	[ 1250, 4867, 1657, 2816, 4288, 103835, 84572, 2886, 182783, 502, 39557, 71, 4527, 83279, 101681, 52774, 13, 20697, 86869, 339, 65727, 62775, 2967, 14192, 7722, 142424, 39329, 13315, 35604, 54397, 25632, 41, 1294, 7108, 4426, 3501, 757, 53418, ...	[ 0.139404296875, 0.243408203125, 0.03680419921875, 0.1591796875, 0.043975830078125, 0.1865234375, 0.128662109375, 0.1051025390625, 0.1107177734375, 0.05078125, 0.00823974609375, 0.02008056640625, 0.04205322265625, 0.0897216796875, 0.260986328125, 0.259765625, 0.008026123046875, 0.01...	embed
1786365_c0	1786365	prolog	0	Title: Compute a list of distinct odd numbers (if one exists), such that their sum is equal to a given number Problem title: Compute a list of distinct odd numbers (if one exists), such that their sum is equal to a given number Tags: prolog, constraints, clpfd Problem: Compute a list of distinct odd numbers (if one exi...	Compute a list of distinct odd numbers (if one exists), such that their sum is equal to a given number Compute a list of distinct odd numbers (if one exists), such that their sum is equal to a given number prolog constraints clpfd Compute use_module Num Counter NewN InputList TempL Compute a list of distinct odd number...	[ -0.0155029296875, -0.00160980224609375, 0.0177001953125, -0.006561279296875, 0.006805419921875, 0.00811767578125, -0.0198974609375, 0.022216796875, 0.0274658203125, -0.0322265625, -0.0032501220703125, -0.0203857421875, 0.021240234375, 0.013427734375, 0.006439208984375, 0.021484375, 0...	[ 159415, 13, 5303, 117781, 70270, 101935, 3190, 32316, 6044, 2363, 10554, 105950, 47, 34475, 14012, 111, 1632, 502, 4867, 158, 2816, 4288, 33139, 39557, 71, 4527, 83279, 52782, 197956, 2356, 839, 360, 7077, 154663, 37446, 866, 83, 759, 18151...	[ 0.224609375, 0.049560546875, 0.1710205078125, 0.1937255859375, 0.2401123046875, 0.19677734375, 0.0750732421875, 0.157470703125, 0.054351806640625, 0.0301055908203125, 0.1925048828125, 0.1490478515625, 0.0841064453125, 0.08013916015625, 0.1260986328125, 0.021026611328125, 0.0249481201...	embed
34485686_c0	34485686	prolog	0	Title: current_predicate/1 does not work with :- dynamic? Problem title: current_predicate/1 does not work with :- dynamic? Tags: swi-prolog, prolog, prolog-directive-dynamic Problem: current_predicate/1 does not work with :- dynamic? I have some predicates that I define using asserts in Prolog. I am using current_pred...	current_predicate/1 does not work with :- dynamic? current_predicate/1 does not work with :- dynamic? swi-prolog prolog prolog-directive-dynamic assert/1 current_predicate Warning Name Arity current_predicate/1 does not work with :- dynamic? I have some predicates that I define using asserts in Prolog. I am using curre...	[ 0.00836181640625, 0.000576019287109375, 0.0238037109375, 0.032958984375, -0.01507568359375, 0.02685546875, 0.015380859375, 0.0240478515625, -0.00799560546875, -0.043701171875, 0.00179290771484375, 0.0245361328125, -0.021728515625, -0.0115966796875, 0.0167236328125, 0.0213623046875, 0...	[ 43581, 19714, 2063, 67, 11583, 959, 4488, 678, 84079, 91, 2452, 3454, 4867, 502, 936, 100034, 242554, 237, 33657, 5550, 592, 15757, 1172, 2481, 1653, 1636, 61924, 1250, 17368, 3714, 11675, 1632, 34292, 16865, 2424, 13695, 186992, 49814, 411...	[ 0.25439453125, 0.2203369140625, 0.2021484375, 0.0894775390625, 0.1812744140625, 0.11328125, 0.145751953125, 0.1494140625, 0.2454833984375, 0.025054931640625, 0.171142578125, 0.128662109375, 0.1981201171875, 0.11279296875, 0.0633544921875, 0.05517578125, 0.1611328125, 0.0634765625, ...	embed
30444443_c0	30444443	prolog	0	Title: In SWI-Prolog, how to transform, convert, mutate, evolute, change a set list [ 1, ( 2, 3 ) ] to [ 1, 2, 3 ]? Problem title: In SWI-Prolog, how to transform, convert, mutate, evolute, change a set list [ 1, ( 2, 3 ) ] to [ 1, 2, 3 ]? Tags: prolog, swi-prolog Problem: In SWI-Prolog, how to transform, convert, muta...	In SWI-Prolog, how to transform, convert, mutate, evolute, change a set list [ 1, ( 2, 3 ) ] to [ 1, 2, 3 ]? In SWI-Prolog, how to transform, convert, mutate, evolute, change a set list [ 1, ( 2, 3 ) ] to [ 1, 2, 3 ]? prolog swi-prolog SWI-Prolog Input Folks database.pl.pl Predic Inform Name Bussi Juc Rockstar Desprogr...	[ 0.0096435546875, -0.006866455078125, 0.00970458984375, 0.0267333984375, 0.0003108978271484375, 0.0172119140625, -0.007781982421875, 0.00830078125, 0.00555419921875, -0.02685546875, 0.023193359375, 0.0244140625, -0.021728515625, 0.00131988525390625, 0.007293701171875, -0.005706787109375...	[ 159, 38969, 9, 10752, 4867, 3642, 47, 27198, 96760, 31158, 13, 20749, 67, 15549, 5423, 5303, 106, 116, 138, 502, 91, 2452, 3454, 360, 7077, 36854, 63399, 2424, 7145, 1771, 29833, 15757, 132461, 14, 3314, 238, 14434, 5613, 5581, 75620, 2...	[ 0.08935546875, 0.2269287109375, 0.021453857421875, 0.136474609375, 0.2119140625, 0.10711669921875, 0.0297698974609375, 0.260986328125, 0.2159423828125, 0.16650390625, 0.10357666015625, 0.18798828125, 0.1339111328125, 0.2052001953125, 0.1925048828125, 0.2320556640625, 0.091064453125, ...	embed
41065806_c0	41065806	prolog	0	Title: All subsets of collinear points - Prolog Problem title: All subsets of collinear points - Prolog Tags: backtracking, points, prolog Problem: All subsets of collinear points - Prolog I am trying to make a backtracking program in Prolog to determine all subsets of collinear points. The problem: Are given n points ...	All subsets of collinear points - Prolog All subsets of collinear points - Prolog backtracking points prolog All Prolog All subsets of collinear points - Prolog I am trying to make a backtracking program in Prolog to determine all subsets of collinear points. The problem: Are given n points in a plan (represented using...	[ 0.017333984375, -0.007354736328125, 0.01214599609375, 0.00732421875, -0.0242919921875, 0.004608154296875, 0.0157470703125, 0.0024261474609375, 0.0081787109375, -0.0235595703125, 0.014404296875, -0.00860595703125, -0.007720947265625, -0.0206298828125, -0.00750732421875, 0.009521484375, ...	[ 3164, 1614, 3509, 61770, 86, 147, 26847, 1250, 4867, 4420, 125728, 214, 502, 31577, 1528, 23, 83324, 756, 2967, 34475, 653, 1774, 55247, 176866, 18781, 1653, 2063, 89536, 360, 76172, 63527, 116574, 136555, 145180, 1662, 13538, 175199, 2174, ...	[ 0.1177978515625, 0.15283203125, 0.216064453125, 0.2135009765625, 0.17333984375, 0.2144775390625, 0.2099609375, 0.1116943359375, 0.2125244140625, 0.1273193359375, 0.207763671875, 0.0843505859375, 0.066162109375, 0.0257110595703125, 0.0963134765625, 0.002410888671875, 0.1185302734375, ...	embed
53814478_c1	53814478	prolog	1	([],[],[1,2,3,4,5,6])). valid([], _). valid([H\|_], X) :- X < H. changeState((s([A\|T1], T2, T3)), s(T1, [A\|T2], T3)) :- valid(T2, A). changeState((s([A\|T1], T2, T3)), s(T1, T2, [A\|T3])) :- valid(T3, A). changeState(s(T1, [A\|T2], [B\|T3]), s(T1, T2, [A,B\|T3])) :- valid(A,B). changeState(s([A\|T1], T2, [B\|T3]), s([B,A\|T1], ...	([],[],[1,2,3,4,5,6])). valid([], _). valid([H\|_], X) :- X < H. changeState((s([A\|T1], T2, T3)), s(T1, [A\|T2], T3)) :- valid(T2, A). changeState((s([A\|T1], T2, T3)), s(T1, T2, [A\|T3])) :- valid(T3, A). changeState(s(T1, [A\|T2], [B\|T3]), s(T1, T2, [A,B\|T3])) :- valid(A,B). changeState(s([A\|T1], T2, [B\|T3]), s([B,A\|T1], ...	[ -0.0205078125, 0.004913330078125, 0.0272216796875, 0.01318359375, 0.005096435546875, 0.0025177001953125, -0.04736328125, -0.01123046875, 0.00390625, 0.0025177001953125, 0.018310546875, 0.040283203125, -0.00131988525390625, 0.0181884765625, -0.01177978515625, -0.004913330078125, 0.002...	[ 15, 1065, 268, 4, 133063, 82449, 104629, 16, 194, 35604, 132, 101, 841, 58745, 454, 1193, 15772, 4426, 572, 5, 15549, 135206, 13, 7, 284, 618, 76172, 384, 304, 21320, 91, 418, 90173, 62, 247, 96386, 363, 571, 378 ]	[ 0.07275390625, 0.08251953125, 0.060302734375, 0.0633544921875, 0.198974609375, 0.232666015625, 0.260498046875, 0.009429931640625, 0.0860595703125, 0.3046875, 0.0887451171875, 0.0758056640625, 0.1798095703125, 0.06585693359375, 0.05169677734375, 0.187744140625, 0.1175537109375, 0.19...	embed
41748822_c0	41748822	prolog	0	Title: Prolog rule to find which stations are on a particular Underground line Problem title: Prolog rule to find which stations are on a particular Underground line Tags: prolog Problem: Prolog rule to find which stations are on a particular Underground line I'm currently trying to answer a segment for a piece of cour...	Prolog rule to find which stations are on a particular Underground line Prolog rule to find which stations are on a particular Underground line prolog Prolog Underground Line ListOfStations Prolog rule to find which stations are on a particular Underground line I'm currently trying to answer a segment for a piece of co...	[ 0.0020904541015625, -0.0118408203125, 0.0120849609375, 0.0120849609375, -0.0091552734375, 0.0057373046875, 0.0103759765625, 0.00009775161743164062, 0.0108642578125, -0.036376953125, -0.0169677734375, -0.01220703125, 0.0027313232421875, 0.004974365234375, 0, 0.0059814453125, 0.0172119...	[ 1250, 4867, 79986, 7413, 3129, 29398, 7, 621, 98, 17311, 9626, 64330, 13315, 502, 16777, 32036, 132887, 42378, 35166, 33180, 18244, 3871, 28282, 11341, 107730, 2053, 44841, 26499, 5584, 32354, 44691, 17997, 18151 ]	[ 0.1376953125, 0.238037109375, 0.1885986328125, 0.1363525390625, 0.060791015625, 0.2344970703125, 0.04541015625, 0.053192138671875, 0.1500244140625, 0.1434326171875, 0.1629638671875, 0.1715087890625, 0.157470703125, 0.0806884765625, 0.090576171875, 0.08056640625, 0.1468505859375, 0....	embed
46852870_c0	46852870	prolog	0	Title: How to count and sum recursively in Prolog Problem title: How to count and sum recursively in Prolog Tags: recursion, prolog Problem: How to count and sum recursively in Prolog I'm trying to figure out how to use recursion on count and sum rules. I usually do it with lists, using findall and length or findall an...	How to count and sum recursively in Prolog How to count and sum recursively in Prolog recursion prolog How Prolog count_person Total_count List sum_ages Total_sum Age sum_list How to count and sum recursively in Prolog I'm trying to figure out how to use recursion on count and sum rules. I usually do it with lists, usi...	[ 0.0072021484375, 0.0189208984375, 0.006866455078125, 0.028564453125, -0.0135498046875, 0.00360107421875, -0.01470947265625, 0.017822265625, 0.017333984375, -0.07861328125, -0.0013275146484375, -0.03466796875, 0.00653076171875, 0.0224609375, 0.038330078125, -0.00811767578125, 0.016967...	[ 11249, 47, 54529, 136, 10554, 195625, 5844, 538, 23, 1250, 4867, 1830, 502, 30816, 33867, 71013, 32036, 52467, 11832, 72944, 6562, 4527, 91736, 5303, 7413, 5584, 140909, 2965, 35829, 51515, 114686, 2452, 3454, 27751, 5608, 17368 ]	[ 0.060455322265625, 0.055206298828125, 0.2105712890625, 0.138427734375, 0.23095703125, 0.2340087890625, 0.1761474609375, 0.0787353515625, 0.0294189453125, 0.1488037109375, 0.232666015625, 0.138916015625, 0.09661865234375, 0.1600341796875, 0.10235595703125, 0.151611328125, 0.1030273437...	embed
16591868_c0	16591868	prolog	0	Title: "Or" procedure in prolog Problem title: "Or" procedure in prolog Tags: prolog, list Problem: "Or" procedure in prolog I'm doing a prolog program for college that is a bit like the cluedo game. I have six suspects with different traits: suspect(Name, Age, Weapon, Shape, Object, Shoes) The goal...	"Or" procedure in prolog "Or" procedure in prolog prolog list Name Age Weapon Shape Object Shoes Hannibal Lecter suspect1 suspect2 suspect3 "Or" procedure in prolog I'm doing a prolog program for college that is a bit like the cluedo game. I have six suspects with different traits: The goal is to im...	[ 0.02490234375, 0.0101318359375, -0.00433349609375, 0.00013256072998046875, -0.0263671875, 0.0213623046875, -0.01708984375, 0.0130615234375, 0.01007080078125, -0.01202392578125, -0.008544921875, -0.00113677978515625, -0.001556396484375, 0.005462646484375, 0.019775390625, 0.0071716308593...	[ 41502, 19060, 1230, 50491, 23, 502, 4867, 5303, 15757, 72944, 1401, 11, 5416, 7224, 134549, 17779, 238713, 75625, 720, 92610, 418, 304, 363, 20594, 1528, 100, 40466, 4785, 1884, 29786, 37421, 6712, 765, 37195, 7, 12921, 110106, 69236, 29479...	[ 0.123046875, 0.302490234375, 0.097900390625, 0.2744140625, 0.08642578125, 0.17333984375, 0.25390625, 0.1907958984375, 0.05194091796875, 0.1146240234375, 0.060791015625, 0.0777587890625, 0.0965576171875, 0.110107421875, 0.1712646484375, 0.175537109375, 0.19921875, 0.1429443359375, ...	embed
39435709_c0	39435709	prolog	0	Title: How to remove duplicates from a list in SWI-Prolog? Problem title: How to remove duplicates from a list in SWI-Prolog? Tags: prolog Problem: How to remove duplicates from a list in SWI-Prolog? I need to write a predicate remove_duplicates/2 that removes duplicate elements form a given list. For example: ?- remov...	How to remove duplicates from a list in SWI-Prolog? How to remove duplicates from a list in SWI-Prolog? prolog a How SWI-Prolog remove_duplicates List Yes List1 How to remove duplicates from a list in SWI-Prolog? I need to write a predicate remove_duplicates/2 that removes duplicate elements form a given list. For exam...	[ 0.00927734375, 0.025146484375, 0.0174560546875, 0.004425048828125, -0.021484375, 0.002471923828125, 0.01019287109375, 0.0089111328125, 0.0033111572265625, -0.019775390625, -0.005767822265625, 0.010986328125, -0.00007963180541992188, 0.01190185546875, -0.003936767578125, 0.001220703125,...	[ 11249, 47, 87388, 171763, 1636, 1295, 5303, 159, 38969, 9, 10752, 4867, 23, 502, 10, 693, 52721, 32036, 32635, 418, 3871, 33022, 1653, 2063, 67, 12477, 80854, 3173, 705, 238, 52080, 13312, 62822, 1250, 841, 384, 32786, 114689, 618, 43240,...	[ 0.0751953125, 0.0186614990234375, 0.2274169921875, 0.3037109375, 0.179931640625, 0.10540771484375, 0.2257080078125, 0.08599853515625, 0.231201171875, 0.022247314453125, 0.1622314453125, 0.1986083984375, 0.03216552734375, 0.0946044921875, 0.002471923828125, 0.14794921875, 0.2369384765...	embed
33301526_c0	33301526	prolog	0	Title: Length ordered subsets? Problem title: Length ordered subsets? Tags: list, prolog Problem: Length ordered subsets? I'm trying to make a code that generates all subsets of a set in order . That is, calling subset([1,2,3], X) should generate X = []; X = [1]; X = [2]; X = [3]; X = [1,2]; X = [1,3]; X = [2,3]; X = [...	Length ordered subsets? Length ordered subsets? list prolog Length List Rest nth0 NewList subset2 Length ordered subsets? I'm trying to make a code that generates all subsets of a set in order . That is, calling subset([1,2,3], X) should generate The internal order isn't all that important, only that the smallest subse...	[ 0.0162353515625, 0.0174560546875, 0.015869140625, -0.000025272369384765625, 0.006805419921875, 0.010498046875, 0.00537109375, -0.01373291015625, 0.0286865234375, -0.0220947265625, 0.00811767578125, 0.01275634765625, -0.0113525390625, -0.00909423828125, -0.00885009765625, 0.003326416015...	[ 77554, 927, 12989, 297, 1614, 3509, 7, 32, 5303, 502, 4867, 32036, 49756, 2389, 2356, 154663, 304, 31577, 3249, 18151, 139392, 756, 111, 5423, 23, 159029, 133063, 96386, 1193, 5608, 70796, 5526, 19336, 525, 145870, 5117, 517, 155761, 32497,...	[ 0.180419921875, 0.1435546875, 0.25732421875, 0.1300048828125, 0.22412109375, 0.2459716796875, 0.03460693359375, 0.01422119140625, 0.142333984375, 0.118896484375, 0.16650390625, 0.13720703125, 0.10040283203125, 0.052093505859375, 0.068359375, 0.1298828125, 0.072998046875, 0.06390380...	embed
36109518_c0	36109518	prolog	0	Title: Prolog stream does not exist error Problem title: Prolog stream does not exist error Tags: io, list, prolog Problem: Prolog stream does not exist error I am working on a tokenizer in prolog, and i keep getting the following error when attempting to open a file and pass the stream into a predicate: ERROR: at_end_...	Prolog stream does not exist error Prolog stream does not exist error io list prolog Prolog File Str Tokenlist Newlist rem_consec_white No2white Stream at_end_of_stream List get0 List1 Prolog stream does not exist error I am working on a tokenizer in prolog, and i keep getting the following error when attempting to ope...	[ 0.0264892578125, 0.00457763671875, 0.00154876708984375, -0.01190185546875, 0.00112152099609375, -0.0098876953125, -0.004302978515625, 0.013916015625, -0.000667572021484375, -0.0301513671875, 0.0201416015625, 0.0086669921875, -0.00008296966552734375, -0.02294921875, 0.0206298828125, -0....	[ 1250, 4867, 75973, 14602, 959, 32316, 18499, 22995, 5303, 502, 42724, 23351, 717, 1098, 6562, 14194, 3240, 148477, 438, 115061, 3611, 4390, 86429, 32036, 2389, 418, 20697, 47, 52825, 13695, 25632, 81887, 9803, 11435, 27875, 1653, 2063, 151206...	[ 0.1912841796875, 0.2315673828125, 0.246337890625, 0.012237548828125, 0.1004638671875, 0.184814453125, 0.1463623046875, 0.1524658203125, 0.1220703125, 0.1390380859375, 0.0731201171875, 0.036773681640625, 0.0251617431640625, 0.1292724609375, 0.12548828125, 0.06280517578125, 0.082763671...	embed
16778782_c0	16778782	prolog	0	Title: Basic PROLOG counting Problem title: Basic PROLOG counting Tags: prolog, successor-arithmetics Problem: Basic PROLOG counting I'm new to prolog I'm trying to write a predicate which counts the following: the predicates name is s2int when given: s2int(0,Y) it shoud "return" Y=0. s2int(s(0),Y) => Y=1. s2int(s(s(0)...	Basic PROLOG counting Basic PROLOG counting prolog successor-arithmetics Basic PROLOG s2intAux s2int s2intA Basic PROLOG counting I'm new to prolog I'm trying to write a predicate which counts the following: the predicates name is s2int when given: s2int(0,Y) it shoud "return" Y=0. s2int(s(0),Y) => Y=1. s2int(s(s(0)),Y...	[ 0.007354736328125, 0.0011444091796875, -0.001007080078125, 0.0172119140625, -0.00122833251953125, 0.020263671875, -0.0162353515625, 0.00160980224609375, 0.0211181640625, -0.0250244140625, 0.017822265625, -0.005462646484375, -0.0108642578125, 0.01153564453125, 0.0296630859375, -0.002136...	[ 91692, 10514, 47510, 54529, 214, 502, 4867, 39457, 42, 8962, 91, 304, 4288, 6077, 284, 3525, 31577, 33022, 1653, 2063, 67, 25632, 1636, 9351, 34475, 2389, 1723, 77242, 65395, 990, 145407, 177609, 33000, 55257, 294, 76067, 37842, 104643, 704...	[ 0.1614990234375, 0.1719970703125, 0.232666015625, 0.19580078125, 0.0279083251953125, 0.167236328125, 0.2183837890625, 0.1915283203125, 0.0679931640625, 0.0758056640625, 0.1226806640625, 0.197998046875, 0.211181640625, 0.229248046875, 0.06610107421875, 0.07000732421875, 0.073364257812...	embed
1989576_c0	1989576	prolog	0	Title: Becoming operational in Prolog quickly Problem title: Becoming operational in Prolog quickly Tags: predicate, prolog, logic Problem: Becoming operational in Prolog quickly My company has a project running in Prolog and I want to clarify few things about how to go about learning it. I know Prolog is different. It...	Becoming operational in Prolog quickly Becoming operational in Prolog quickly predicate prolog logic Becoming Prolog Becoming operational in Prolog quickly My company has a project running in Prolog and I want to clarify few things about how to go about learning it. I know Prolog is different. It should not be learnt j...	[ 0.03662109375, 0.00750732421875, 0.0123291015625, -0.004974365234375, -0.00139617919921875, 0.00909423828125, 0.0208740234375, -0.005035400390625, 0.0101318359375, -0.054443359375, 0.0164794921875, -0.016845703125, -0.0196533203125, -0.007110595703125, 0.015869140625, 0.00885009765625,...	[ 873, 277, 214, 41018, 289, 23, 1250, 4867, 69405, 1653, 2063, 67, 502, 62775, 14380, 13452, 51042, 17306, 10846, 3642, 1672, 52080, 442, 12921, 1650, 5608, 959, 30698, 1884, 46876, 44540, 12877, 1118, 177953, 831, 3917, 313, 64, 441, 3722...	[ 0.04998779296875, 0.1378173828125, 0.0089111328125, 0.23486328125, 0.173828125, 0.08905029296875, 0.202392578125, 0.2900390625, 0.1807861328125, 0.14208984375, 0.1868896484375, 0.00750732421875, 0.165771484375, 0.1968994140625, 0.07684326171875, 0.052886962890625, 0.012420654296875, ...	embed
48263093_c0	48263093	prolog	0	Title: Enumerate solutions in Prolog Problem title: Enumerate solutions in Prolog Tags: swi-prolog, prolog Problem: Enumerate solutions in Prolog I wanted to enumerate solutions of a non-deterministic goal nondet_goal as pairs (Index, Value) where Index is the index of each value returned. I managed to do it using nb_s...	Enumerate solutions in Prolog Enumerate solutions in Prolog swi-prolog prolog Enumerate Prolog nondet_goal Index Value nb_setval nb_getval g_idx Idx Val Idx1 Out Enumerate solutions in Prolog I wanted to enumerate solutions of a non-deterministic goal nondet_goal as pairs (Index, Value) where Index is the index of each...	[ -0.005645751953125, 0.00927734375, 0.0057373046875, -0.00179290771484375, -0.018798828125, 0.0103759765625, -0.005828857421875, -0.0025482177734375, 0.002105712890625, -0.04443359375, 0.005889892578125, 0.01220703125, 0.00165557861328125, 0.003570556640625, 0.01904296875, 0.00127410888...	[ 357, 15537, 17957, 51347, 1250, 4867, 23, 2452, 3454, 502, 351, 3667, 519, 31471, 190060, 275, 3509, 1405, 3794, 24799, 425, 4769, 13538, 36663, 189085, 67, 112, 30524, 48242, 69236, 289, 237, 80836, 4153, 39659, 63262, 12638, 34292, 176377...	[ 0.02972412109375, 0.1739501953125, 0.110595703125, 0.20947265625, 0.1478271484375, 0.2247314453125, 0.007720947265625, 0.111328125, 0.1014404296875, 0.09918212890625, 0.1131591796875, 0.1722412109375, 0.1156005859375, 0.1920166015625, 0.1724853515625, 0.040740966796875, 0.11145019531...	embed
50891941_c0	50891941	prolog	0	Title: Prolog rule is `true` and not return it as an argument Problem title: Prolog rule is `true` and not return it as an argument Tags: prolog Problem: Prolog rule is `true` and not return it as an argument I have an assignment to collage to build a relation sub(Sublist, List) for all Sublist s of List such that the ...	Prolog rule is `true` and not return it as an argument Prolog rule is `true` and not return it as an argument prolog Prolog Sublist List Subset Prolog rule is `true` and not return it as an argument I have an assignment to collage to build a relation sub(Sublist, List) for all Sublist s of List such that the order of t...	[ 0.0206298828125, 0.0146484375, 0.018798828125, 0.01068115234375, -0.018310546875, 0.006378173828125, -0.002166748046875, 0.007293701171875, 0.027099609375, 0.005218505859375, -0.006439208984375, 0.0067138671875, 0.0013275146484375, 0.00677490234375, 0.02001953125, -0.0022125244140625, ...	[ 1250, 4867, 79986, 9774, 13, 959, 30646, 237, 10750, 502, 8273, 6562, 32036, 3509, 95486, 674, 167102, 45367, 41911, 1614, 96472, 756, 12989, 43032, 5701, 214521, 88303, 41, 1542, 155761, 57553, 4734, 1193, 183114, 4966, 3229, 1294, 39556, ...	[ 0.1826171875, 0.268798828125, 0.1917724609375, 0.1783447265625, 0.1304931640625, 0.1181640625, 0.219482421875, 0.0784912109375, 0.2237548828125, 0.1243896484375, 0.188232421875, 0.1876220703125, 0.1173095703125, 0.1590576171875, 0.10595703125, 0.027557373046875, 0.16796875, 0.08813...	embed
61330644_c1	61330644	prolog	1	palavras_uni([[d,a,y], [n,i,g,h,t]],[P12,P13]). false. As for my 2nd problem i have a predicate called espacos_uni(LS,LP) in which Ls is a list of lits containing variables for example [[P11, P21, P31, P41, P51], [P13, P23, P33, P43, P53]] and LP is list of list containing words just like before, for example [[d,a,y],...	palavras_uni([[d,a,y], [n,i,g,h,t]],[P12,P13]). false. As for my 2nd problem i have a predicate called espacos_uni(LS,LP) in which Ls is a list of lits containing variables for example [[P11, P21, P31, P41, P51], [P13, P23, P33, P43, P53]] and LP is list of list containing words just like before, for example [[d,a,y],...	[ -0.00848388671875, 0.006317138671875, -0.0010833740234375, -0.01495361328125, -0.01611328125, -0.00244140625, 0.0079345703125, -0.00543212890625, 0.00872802734375, -0.0120849609375, 0.0120849609375, 0.021484375, 0.03466796875, -0.013916015625, -0.00154876708984375, 0.0240478515625, 0...	[ 78549, 454, 5980, 71, 11, 53, 268, 4, 19, 14, 177, 127, 18, 86245, 683, 1530, 2681, 98320, 116, 2208, 2967, 1653, 2063, 67, 35839, 101404, 7840, 19759, 37352, 339, 7, 83, 5303, 111, 16060, 70541, 77336, 100, 1662, 436, 3117, 5016, 8...	[ 0.287841796875, 0.05548095703125, 0.302734375, 0.1103515625, 0.0904541015625, 0.096923828125, 0.00958251953125, 0.00946044921875, 0.035400390625, 0.03118896484375, 0.05657958984375, 0.0679931640625, 0.062255859375, 0.009490966796875, 0.06182861328125, 0.1346435546875, 0.139892578125,...	embed
27072272_c1	27072272	prolog	1	). move(threeg,fourn). move(fourm,fivem). move(fourn,fiven). move(threeh,fouro). move(threeh,fourp). move(fouro,fiveo). move(fourp,fivep). move(threei,fourq). move(threei,fourr). move(fourq,fiveq). move(fourr,fiver). move(twod,threej). move(twod,threek). move(twod,threel). move(threej,fours). move(threej,fourt). move(f...	). move(threeg,fourn). move(fourm,fivem). move(fourn,fiven). move(threeh,fouro). move(threeh,fourp). move(fouro,fiveo). move(fourp,fivep). move(threei,fourq). move(threei,fourr). move(fourq,fiveq). move(fourr,fiver). move(twod,threej). move(twod,threek). move(twod,threel). move(threej,fours). move(threej,fourt). move(f...	[ 0.0064697265625, 0.01312255859375, 0.00732421875, 0.030517578125, 0.00335693359375, 0.01165771484375, -0.00592041015625, -0.00732421875, 0.01239013671875, -0.018310546875, 0.0037689208984375, 0.007537841796875, -0.0024566650390625, 0.0106201171875, -0.0166015625, 0.006591796875, 0.01...	[ 194, 25813, 927, 107, 2507, 160018, 19, 39, 1029, 66262, 1353, 132, 11036, 31, 254, 272, 1399, 864, 42, 814, 18, 15263, 1334, 343, 583, 7, 3132, 4, 3618, 34, 334, 434, 425, 104, 17447, 284, 108421, 16, 15772, 69236, 38679, 297, 1745...	[ 0.1268310546875, 0.22265625, 0.08319091796875, 0.12939453125, 0.1185302734375, 0.1368408203125, 0.0660400390625, 0.0927734375, 0.07958984375, 0.1715087890625, 0.129638671875, 0.002471923828125, 0.1041259765625, 0.1170654296875, 0.184326171875, 0.11962890625, 0.0618896484375, 0.0797...	embed
66021720_c0	66021720	prolog	0	Title: compilation failed in GNU Prolog Problem title: compilation failed in GNU Prolog Tags: river-crossing-puzzle, prolog Problem: compilation failed in GNU Prolog other_bank(e,w). other_bank(w,e). % farmer,wolf,goat,cabbage move([X,X,Goat,Cabbage],wolf,[Y,Y,Goat,Cabbage]) :- other_bank(X,Y). move([X,Wolf,X,Cabbage],...	compilation failed in GNU Prolog compilation failed in GNU Prolog river-crossing-puzzle prolog GNU Prolog other_bank Goat Cabbage Wolf safety_check safe_status Man Config Move OtherMoves NextConfig compilation failed in GNU Prolog Compilation error while loading the .pl file in GNU Prolog Farmer-wolf-goat-cabbage probl...	[ 0.006866455078125, 0.0296630859375, -0.0054931640625, 0.0115966796875, -0.0244140625, 0.015869140625, -0.0196533203125, -0.00177764892578125, 0.009521484375, -0.0238037109375, -0.01513671875, -0.006805419921875, -0.006011962890625, -0.004547119140625, 0.00836181640625, -0.0010299682617...	[ 98352, 165523, 165132, 1250, 4867, 96113, 95665, 214, 1766, 13894, 133, 502, 3789, 9802, 2016, 257, 30438, 402, 429, 45492, 81900, 78292, 46002, 45215, 1572, 139403, 135828, 64511, 9083, 3132, 4997, 83671, 15612, 14, 18499, 72367, 2424, 11435...	[ 0.2071533203125, 0.1749267578125, 0.162841796875, 0.13134765625, 0.1949462890625, 0.0863037109375, 0.0975341796875, 0.01995849609375, 0.03338623046875, 0.06317138671875, 0.00872802734375, 0.08953857421875, 0.025848388671875, 0.1297607421875, 0.08709716796875, 0.07940673828125, 0.0958...	embed
40019059_c1	40019059	prolog	1	,T,[]). walk(A,B,Time,V) :- aRoute(A,X,Time), not(member(X,V)), ( B = X; connection(A,X,_,S), walk(X,B,S,[A\|V]) ). Whenever I ask my knowledge base if there is a route between two points, it returns whether that's possible; true or false : testRoute(kerkrade, sittard, 900). true; (signifies that there are three routes,...	,T,[]). walk(A,B,Time,V) :- aRoute(A,X,Time), not(member(X,V)), ( B = X; connection(A,X,_,S), walk(X,B,S,[A\|V]) ). Whenever I ask my knowledge base if there is a route between two points, it returns whether that's possible; true or false : testRoute(kerkrade, sittard, 900). true; (signifies that there are three routes,...	[ -0.004547119140625, 0.0150146484375, 0.01348876953125, 0.0211181640625, -0.011474609375, -0.00384521484375, -0.031982421875, -0.0166015625, 0.000720977783203125, -0.05029296875, 0.011474609375, 0.007720947265625, -0.021240234375, 0.0028076171875, -0.002410888671875, -0.0002899169921875...	[ 618, 1065, 35691, 284, 571, 70059, 856, 15772, 10, 12724, 6743, 1542, 959, 27417, 335, 2203, 1193, 94878, 294, 26458, 51359, 3647, 2174, 2685, 36439, 17721, 6626, 26847, 30646, 36766, 450, 7722, 29568, 98320, 3034, 125464, 15244, 8147, 5861...	[ 0.063232421875, 0.002532958984375, 0.20751953125, 0.06610107421875, 0.08935546875, 0.194580078125, 0.1715087890625, 0.004638671875, 0.052154541015625, 0.154541015625, 0.1666259765625, 0.0401611328125, 0.05712890625, 0.1580810546875, 0.059234619140625, 0.001953125, 0.105224609375, 0...	embed
29857372_c0	29857372	prolog	0	Title: How to go back to "repeat" in Prolog? Problem title: How to go back to "repeat" in Prolog? Tags: repeat, prolog Problem: How to go back to "repeat" in Prolog? Is it possible to go back to a repeat in Prolog without calling the predicate and without making a new predicate? I have the following...	How to go back to "repeat" in Prolog? How to go back to "repeat" in Prolog? repeat prolog How Prolog Welcome Print Ans You How to go back to "repeat" in Prolog? Is it possible to go back to a repeat in Prolog without calling the predicate and without making a new predicate? I have the following code...	[ 0.00262451171875, 0.036376953125, 0.01507568359375, 0.02099609375, -0.005889892578125, 0.0126953125, 0.0272216796875, 0.0050048828125, -0.003692626953125, -0.047607421875, -0.004241943359375, 0.01153564453125, -0.021728515625, -0.012451171875, 0.02685546875, 0.00537109375, 0.01586914...	[ 11249, 47, 738, 4420, 107, 1081, 257, 23, 1250, 4867, 119140, 502, 91334, 39754, 893, 2583, 7722, 10, 15490, 159029, 1653, 2063, 25632, 18151, 43581, 140992, 2046, 7663, 3564, 3444, 7, 23468, 3917, 71864, 18, 45831, 48716, 20028 ]	[ 0.08294677734375, 0.1619873046875, 0.1048583984375, 0.20166015625, 0.107421875, 0.23193359375, 0.205078125, 0.05316162109375, 0.1741943359375, 0.247314453125, 0.295166015625, 0.1365966796875, 0.2283935546875, 0.12451171875, 0.036651611328125, 0.0128173828125, 0.057037353515625, 0.0...	embed
13554709_c0	13554709	prolog	0	Title: Hiding Variables in a Prolog Query Problem title: Hiding Variables in a Prolog Query Tags: lambda, prolog Problem: Hiding Variables in a Prolog Query I am working on an assignment with prolog which involves an airport database (it has airport cities, and flight links which includes airport tax and duration time)...	Hiding Variables in a Prolog Query Hiding Variables in a Prolog Query lambda prolog Hiding Variables Prolog Query Hiding Variables in a Prolog Query I am working on an assignment with prolog which involves an airport database (it has airport cities, and flight links which includes airport tax and duration time) and the...	[ 0.016845703125, 0.02685546875, 0.0025634765625, 0.01287841796875, -0.005706787109375, -0.005828857421875, -0.0078125, 0.0113525390625, -0.00070953369140625, -0.0244140625, -0.02099609375, -0.03564453125, -0.0286865234375, -0.006988525390625, -0.007537841796875, -0.000362396240234375, ...	[ 72483, 214, 111477, 13566, 1250, 4867, 58836, 53, 23, 6492, 85, 502, 20697, 95486, 146619, 63399, 162708, 113014, 22317, 24643, 115, 1733, 5117, 9655, 41, 10484, 134598, 33022, 1294, 35166, 21771, 3714, 2967, 140992, 1286, 4677, 7068, 3444, ...	[ 0.24365234375, 0.1126708984375, 0.222412109375, 0.20068359375, 0.1754150390625, 0.256103515625, 0.2010498046875, 0.013031005859375, 0.042266845703125, 0.14013671875, 0.0648193359375, 0.12744140625, 0.048553466796875, 0.055267333984375, 0.1251220703125, 0.1121826171875, 0.174560546875...	embed
64251931_c2	64251931	prolog	2	44321). city('Addis Ababa',ethiopia,'Addis Ababa',2084588). city('Adelaide',australia,'South Australia',1050000). city('Aden',yemen,'Yemen',550744). city('Adiyaman',turkey,'Adiyaman',128000). city('Ado-Ekiti',nigeria,'Ekiti',156122). my logic to achieve this task: pop(Country,Pop) :- city(_,C,_,Pop), Country = C. setof...	44321). city('Addis Ababa',ethiopia,'Addis Ababa',2084588). city('Adelaide',australia,'South Australia',1050000). city('Aden',yemen,'Yemen',550744). city('Adiyaman',turkey,'Adiyaman',128000). city('Ado-Ekiti',nigeria,'Ekiti',156122). my logic to achieve this task: pop(Country,Pop) :- city(_,C,_,Pop), Country = C. setof...	[ 0.00958251953125, -0.0125732421875, 0.0042724609375, 0.01116943359375, -0.027099609375, 0.01507568359375, 0.00933837890625, -0.001312255859375, 0.00830078125, -0.00055694580078125, 0.0218505859375, -0.0167236328125, 0.001617431640625, -0.037353515625, -0.005035400390625, -0.02294921875...	[ 5896, 103705, 194, 26349, 22409, 3827, 62, 21369, 13, 4450, 128482, 4, 154782, 4633, 123641, 284, 26561, 2506, 916, 2816, 7884, 218128, 28173, 46659, 28568, 555, 1033, 1055, 69085, 90393, 195953, 49778, 669, 987, 1530, 87774, 246, 9, 42595,...	[ 0.25537109375, 0.316162109375, 0.086669921875, 0.2059326171875, 0.1318359375, 0.211181640625, 0.1473388671875, 0.278076171875, 0.01715087890625, 0.1434326171875, 0.2047119140625, 0.078369140625, 0.1756591796875, 0.211669921875, 0.1748046875, 0.124267578125, 0.256103515625, 0.291992...	embed
42287919_c0	42287919	prolog	0	Title: Goldbach’s Conjecture in prolog Problem title: Goldbach’s Conjecture in prolog Tags: primality-test, goldbach-conjecture, primes, prolog Problem: Goldbach’s Conjecture in prolog Goldbach’s Conjecture : Every positive even number greater than 2 is the sum of two prime numbers. Eg 28 (5,23 and 11,17) I want Prolog...	Goldbach’s Conjecture in prolog Goldbach’s Conjecture in prolog primality-test goldbach-conjecture primes prolog Goldbach Conjecture Output is_prime has_factor next_prime Goldbach’s Conjecture in prolog Goldbach’s Conjecture : Every positive even number greater than 2 is the sum of two prime numbers. Eg 28 (5,23 and 11...	[ 0.007537841796875, 0.0166015625, 0.028076171875, 0.00469970703125, 0.004486083984375, 0.0244140625, 0.004119873046875, 0.007476806640625, 0.0033721923828125, -0.016845703125, -0.0004425048828125, -0.009765625, -0.0015411376953125, -0.0120849609375, -0.01446533203125, 0.0234375, -0.01...	[ 18217, 31731, 26, 1657, 75161, 3408, 23, 502, 4867, 29810, 134393, 6954, 86761, 20809, 13538, 83, 114654, 1556, 144810, 11737, 7, 87769, 24491, 3853, 14012, 117396, 116, 10554, 6626, 101935, 22221, 1372, 11516, 3742, 136, 534, 59741, 3444, ...	[ 0.175048828125, 0.291748046875, 0.06915283203125, 0.071533203125, 0.207763671875, 0.1201171875, 0.018341064453125, 0.1668701171875, 0.22900390625, 0.139892578125, 0.1182861328125, 0.1595458984375, 0.118408203125, 0.21044921875, 0.07110595703125, 0.1072998046875, 0.19091796875, 0.11...	embed
75651380_c0	75651380	prolog	0	Title: Finding Paths in Prolog Problem title: Finding Paths in Prolog Tags: path-finding, prolog, transitive-closure, nodes, path Problem: Finding Paths in Prolog I'm relatively new to Prolog and my aim from this code is to try and find all routes between all defined edges. Prolog should output me the full route from t...	Finding Paths in Prolog Finding Paths in Prolog path-finding prolog transitive-closure nodes path Finding Paths Prolog Path Visited Finding Paths in Prolog I'm relatively new to Prolog and my aim from this code is to try and find all routes between all defined edges. Prolog should output me the full route from the inpu...	[ 0.02294921875, 0.0186767578125, 0.0107421875, 0.0185546875, 0.00909423828125, 0.00799560546875, -0.022216796875, -0.011474609375, 0.00390625, -0.0625, 0.007232666015625, -0.009765625, -0.021728515625, 0.00518798828125, 0.0029296875, 0.00628662109375, 0.01251220703125, 0.01434326171...	[ 26040, 108421, 7, 1250, 4867, 214, 23, 60875, 111607, 502, 62621, 5844, 170224, 110, 988, 98684, 3525, 464, 18151, 9790, 7413, 756, 36439, 17721, 61924, 121303, 5608, 140992, 4393, 107730, 4034, 47, 78869, 13695, 18499, 87109, 20, 238, 1331...	[ 0.1055908203125, 0.219482421875, 0.0260772705078125, 0.1527099609375, 0.2373046875, 0.007720947265625, 0.0161285400390625, 0.17724609375, 0.1103515625, 0.1173095703125, 0.126220703125, 0.0748291015625, 0.161865234375, 0.096923828125, 0.080810546875, 0.1123046875, 0.0013427734375, 0...	embed
70499763_c0	70499763	prolog	0	Title: Prolog findall solutions within time limit Problem title: Prolog findall solutions within time limit Tags: prolog-findall, prolog, swi-prolog Problem: Prolog findall solutions within time limit I would like to find all solutions to a goal within some time limit. I mean that I would like to search for solutions f...	Prolog findall solutions within time limit Prolog findall solutions within time limit prolog-findall prolog swi-prolog Prolog call_with_time_limit my_goal Sol time_limit_exceeded Prolog findall solutions within time limit I would like to find all solutions to a goal within some time limit. I mean that I would like to s...	[ -0.00341796875, 0.00396728515625, 0.0242919921875, -0.0128173828125, -0.0137939453125, -0.0225830078125, 0.0030670166015625, -0.0028839111328125, -0.00909423828125, -0.060791015625, 0.01031494140625, 0.0003032684326171875, -0.00823974609375, 0.0040283203125, 0.032958984375, 0.010620117...	[ 1250, 4867, 7413, 5584, 51347, 28032, 1733, 17475, 502, 111607, 2452, 3454, 11782, 76228, 6032, 93343, 759, 519, 6678, 3355, 329, 1884, 756, 47, 69236, 33938, 100, 2684, 30646, 14037, 157578, 5303, 28484, 37842, 25632, 959, 2878, 2174, 8710...	[ 0.162109375, 0.24169921875, 0.146728515625, 0.201904296875, 0.2264404296875, 0.1519775390625, 0.1324462890625, 0.2158203125, 0.099609375, 0.122802734375, 0.113037109375, 0.0718994140625, 0.149658203125, 0.0843505859375, 0.1162109375, 0.2109375, 0.0740966796875, 0.107666015625, 0....	embed
53962384_c0	53962384	prolog	0	Title: How can I compute all the lengths of lists in list? Problem title: How can I compute all the lengths of lists in list? Tags: prolog Problem: How can I compute all the lengths of lists in list? I am trying to compute a list that contains the length of each list that are inside a list. My code is: length_list(A, B...	How can I compute all the lengths of lists in list? How can I compute all the lengths of lists in list? prolog How length_list Path Length PathAB PathCB LengthCB _6624 _6588 _6546 _6498 _6456 How can I compute all the lengths of lists in list? I am trying to compute a list that contains the length of each list that are...	[ 0.006744384765625, 0.01251220703125, 0.0108642578125, 0.030029296875, 0.004791259765625, 0.0142822265625, -0.0152587890625, 0.01611328125, 0.0135498046875, -0.060791015625, 0.0001888275146484375, -0.007171630859375, 0.0107421875, 0.0303955078125, 0.006561279296875, 0.002288818359375, ...	[ 11249, 831, 87, 9969, 6743, 756, 70, 140909, 7, 111, 5303, 23, 502, 4867, 6562, 108421, 77554, 927, 11040, 47307, 14604, 2357, 153354, 9271, 165611, 121317, 31577, 70541, 12638, 46132, 18151, 60875, 284, 335, 32316, 17721, 6275, 62, 136, ...	[ 0.058349609375, 0.07373046875, 0.0286865234375, 0.1392822265625, 0.150634765625, 0.150146484375, 0.0760498046875, 0.2333984375, 0.1231689453125, 0.1190185546875, 0.251953125, 0.0986328125, 0.0849609375, 0.1199951171875, 0.18798828125, 0.15185546875, 0.123779296875, 0.01022338867187...	embed
28643034_c0	28643034	prolog	0	Title: How to initialize a String array with unknown length to null? Problem title: How to initialize a String array with unknown length to null? Tags: java, prolog, string, initialization, arrays Problem: How to initialize a String array with unknown length to null? I'mm working on this program in which connects Prolo...	How to initialize a String array with unknown length to null? How to initialize a String array with unknown length to null? java prolog string initialization arrays How Query Compound Term Variable qMeat.hasMoreSolution qMeat.nextSolution java.util.Arrays.fill How to initialize a String array with unknown length to nul...	[ 0.0262451171875, 0.008056640625, -0.007110595703125, 0.0361328125, -0.01361083984375, 0.005859375, 0.00726318359375, -0.0074462890625, 0.0030670166015625, -0.0157470703125, -0.006622314453125, -0.0181884765625, -0.0177001953125, 0.001617431640625, 0.0005950927734375, -0.00311279296875,...	[ 11249, 47, 61475, 20650, 23351, 214, 10298, 53, 678, 51, 69723, 140909, 56574, 79, 330, 502, 4867, 79315, 47691, 4778, 58836, 15612, 31, 2994, 84572, 8096, 6696, 257, 10557, 122880, 102588, 34, 29062, 3675, 7614, 7092, 116115, 20697, 1528, ...	[ 0.07086181640625, 0.1390380859375, 0.1925048828125, 0.10888671875, 0.2265625, 0.1192626953125, 0.198974609375, 0.1766357421875, 0.07611083984375, 0.084716796875, 0.1905517578125, 0.1546630859375, 0.258544921875, 0.062744140625, 0.13330078125, 0.1005859375, 0.2030029296875, 0.212280...	embed
60865465_c0	60865465	prolog	0	Title: Why my predicate div/4 enters an infinite loop after giving me one answer? Problem title: Why my predicate div/4 enters an infinite loop after giving me one answer? Tags: successor-arithmetics, prolog Problem: Why my predicate div/4 enters an infinite loop after giving me one answer? I'm trying to implement the ...	Why my predicate div/4 enters an infinite loop after giving me one answer? Why my predicate div/4 enters an infinite loop after giving me one answer? successor-arithmetics prolog Why Why my predicate div/4 enters an infinite loop after giving me one answer? I'm trying to implement the Euclidean division (a = bq + r) us...	[ -0.01348876953125, 0.0087890625, 0.00811767578125, -0.002593994140625, 0.005859375, -0.004486083984375, 0.009521484375, 0.00732421875, 0.004791259765625, -0.0517578125, 0.0159912109375, 0.005584716796875, -0.0036163330078125, 0.005096435546875, 0.0150146484375, 0.008544921875, 0.0208...	[ 44084, 759, 1653, 2063, 67, 18221, 17357, 30957, 7, 54241, 13, 40956, 7103, 68772, 1632, 35166, 142, 163, 39457, 42, 8962, 282, 502, 4867, 31577, 29479, 34937, 130265, 91853, 11, 2203, 864, 997, 1690, 1460, 3922, 5134, 28016, 1636, 37202,...	[ 0.1317138671875, 0.02899169921875, 0.1444091796875, 0.160400390625, 0.09075927734375, 0.1849365234375, 0.2449951171875, 0.1593017578125, 0.016632080078125, 0.13427734375, 0.0706787109375, 0.1982421875, 0.090576171875, 0.0958251953125, 0.1170654296875, 0.1824951171875, 0.0581359863281...	embed
55695837_c0	55695837	prolog	0	Title: How to add a 'Functor' object from prolog to a JSON in python Problem title: How to add a 'Functor' object from prolog to a JSON in python Tags: json, prolog, python Problem: How to add a 'Functor' object from prolog to a JSON in python I'm consulting a Knowledge Base in Prolog and when I pri...	How to add a 'Functor' object from prolog to a JSON in python How to add a 'Functor' object from prolog to a JSON in python json prolog python prolog How Functor JSON build_response pl.consult color.pl pl.query response_list How to add a 'Functor' object from prolog to a JSON in python I'm consultin...	[ 0.021240234375, 0.010498046875, -0.000751495361328125, -0.01312255859375, 0.00836181640625, 0.0120849609375, -0.026611328125, 0.007537841796875, 0.0040283203125, -0.03564453125, 0.021484375, 0.0213623046875, 0.007415771484375, -0.01458740234375, 0.005279541015625, 0.013671875, -0.008...	[ 11249, 15190, 3768, 97249, 18770, 36746, 1295, 502, 4867, 47, 821, 58627, 17198, 50828, 1647, 1681, 28670, 45367, 134719, 6456, 147834, 10576, 2424, 944, 57553, 6562, 10, 23, 75463, 191428, 44978, 1250, 28412, 140992, 7477, 959, 35686, 1418, ...	[ 0.04229736328125, 0.1939697265625, 0.051788330078125, 0.2239990234375, 0.2421875, 0.21240234375, 0.086181640625, 0.1590576171875, 0.2213134765625, 0.084228515625, 0.146240234375, 0.2232666015625, 0.0980224609375, 0.155029296875, 0.07073974609375, 0.1328125, 0.195068359375, 0.123291...	embed
67890256_c0	67890256	prolog	0	Title: How to list all people that have a specific number of descendants in prolog? Problem title: How to list all people that have a specific number of descendants in prolog? Tags: prolog Problem: How to list all people that have a specific number of descendants in prolog? I can check if X is a ancestor of Y and can c...	How to list all people that have a specific number of descendants in prolog? How to list all people that have a specific number of descendants in prolog? prolog How aggregate_all COUNT List list_people How to list all people that have a specific number of descendants in prolog? I can check if X is a ancestor of Y and c...	[ 0.0301513671875, -0.00799560546875, -0.004119873046875, 0.02294921875, -0.004150390625, 0.0108642578125, 0.000347137451171875, -0.00347900390625, 0.0260009765625, -0.057373046875, -0.0008087158203125, -0.05029296875, 0.0029449462890625, 0.0303955078125, 0.013427734375, -0.0015945434570...	[ 11249, 47, 5303, 756, 3395, 450, 765, 29458, 14012, 60887, 10840, 502, 4867, 23, 197564, 13, 5584, 8244, 64163, 32036, 223354, 831, 12765, 2174, 1193, 60502, 1290, 111, 990, 54529, 3642, 5941, 1556, 3714, 34475, 541, 2203, 959, 4488, 7998...	[ 0.0911865234375, 0.0672607421875, 0.2252197265625, 0.143310546875, 0.139404296875, 0.05712890625, 0.10400390625, 0.170654296875, 0.1448974609375, 0.2393798828125, 0.187744140625, 0.18896484375, 0.232421875, 0.064697265625, 0.16455078125, 0.053497314453125, 0.1414794921875, 0.084838...	embed
43035679_c0	43035679	prolog	0	Title: How can two lists be compared in Prolog considering the subterms? Problem title: How can two lists be compared in Prolog considering the subterms? Tags: compare, comparison, sicstus-prolog, prolog Problem: How can two lists be compared in Prolog considering the subterms? I would like to compare two lists conside...	How can two lists be compared in Prolog considering the subterms? How can two lists be compared in Prolog considering the subterms? compare comparison sicstus-prolog prolog How Prolog How can two lists be compared in Prolog considering the subterms? I would like to compare two lists considering and comparing every one ...	[ 0.0025634765625, 0.02587890625, 0.005096435546875, 0.00933837890625, 0.0017547607421875, 0.003753662109375, 0.01031494140625, 0.00933837890625, 0.00347900390625, 0.006072998046875, 0.0130615234375, 0.00830078125, -0.00927734375, -0.004425048828125, 0.0040283203125, -0.01458740234375, ...	[ 11249, 831, 6626, 5303, 7, 186, 154186, 1250, 4867, 179635, 153224, 4432, 69101, 225490, 26536, 18253, 3454, 502, 23, 47, 37397, 808, 418, 304, 69829, 13956, 40970, 16750, 117396, 977, 3501, 17932, 138, 116, 69407, 13579, 17569, 107730, 140...	[ 0.056549072265625, 0.06695556640625, 0.14111328125, 0.248779296875, 0.05987548828125, 0.0576171875, 0.23876953125, 0.1566162109375, 0.248291015625, 0.125732421875, 0.16796875, 0.1260986328125, 0.2232666015625, 0.1904296875, 0.0594482421875, 0.184814453125, 0.1160888671875, 0.117675...	embed
53668887_c0	53668887	prolog	0	Title: A combination of a list given a length followed by a permutation in Prolog? Problem title: A combination of a list given a length followed by a permutation in Prolog? Tags: list, combinations, permutation, prolog Problem: A combination of a list given a length followed by a permutation in Prolog? I need a predic...	A combination of a list given a length followed by a permutation in Prolog? A combination of a list given a length followed by a permutation in Prolog? list combinations permutation prolog Prolog ListResult N-1 A combination of a list given a length followed by a permutation in Prolog? I need a predicate to return a li...	[ -0.01312255859375, 0.0206298828125, 0.01171875, 0.01446533203125, -0.013916015625, 0, -0.0135498046875, -0.00927734375, 0.0185546875, -0.0245361328125, -0.0017852783203125, -0.006195068359375, 0.0030517578125, 0.014892578125, -0.01165771484375, 0.00848388671875, 0.0234375, 0.012451...	[ 162515, 111, 5303, 34475, 140909, 134629, 117, 561, 22062, 23, 1250, 4867, 32, 502, 32036, 7, 7136, 541, 5759, 390, 3871, 1653, 2063, 67, 30646, 678, 756, 107730, 16750, 13267, 17932, 121, 27781, 106935, 19, 68252, 155761, 339, 116, 110, ...	[ 0.2498779296875, 0.01141357421875, 0.2088623046875, 0.1123046875, 0.176025390625, 0.146728515625, 0.1181640625, 0.2060546875, 0.1019287109375, 0.044830322265625, 0.1724853515625, 0.2462158203125, 0.00189208984375, 0.1190185546875, 0.1407470703125, 0.091552734375, 0.1322021484375, 0...	embed
9354526_c0	9354526	prolog	0	Title: Sub-lists of Unique Length Problem title: Sub-lists of Unique Length Tags: prolog Problem: Sub-lists of Unique Length I'm writing a program that checks if a list contains sub-lists of unique length: e.g. diffLengthLists([[2],[3,4]]) should return true whereas diffLengthLists([[3],[4]]) should return false. Here'...	Sub-lists of Unique Length Sub-lists of Unique Length prolog Sub-lists Unique Length is_list Sub-lists of Unique Length I'm writing a program that checks if a list contains sub-lists of unique length: e.g. diffLengthLists([[2],[3,4]]) should return true whereas diffLengthLists([[3],[4]]) should return false. Here's my ...	[ -0.00982666015625, 0.0174560546875, 0.03173828125, -0.00823974609375, -0.0191650390625, 0.006011962890625, 0.003570556640625, 0.0029449462890625, 0.0341796875, -0.0118408203125, -0.00555419921875, 0.00592041015625, 0.0274658203125, 0.0206298828125, 0.01611328125, -0.0035858154296875, ...	[ 8273, 6562, 111, 11789, 944, 77554, 927, 502, 4867, 83, 32562, 1528, 12765, 2174, 5303, 70541, 1614, 9, 36998, 140909, 71337, 5267, 449, 154663, 82449, 30646, 29568, 54968, 68714, 98320, 18151, 154107, 12638, 15700, 58745, 397, 80854, 759, ...	[ 0.248779296875, 0.252197265625, 0.0301361083984375, 0.21630859375, 0.13037109375, 0.1494140625, 0.078125, 0.11328125, 0.1507568359375, 0.08740234375, 0.1248779296875, 0.154296875, 0.1790771484375, 0.08953857421875, 0.1971435546875, 0.1102294921875, 0.23095703125, 0.020294189453125,...	embed
54725668_c0	54725668	prolog	0	Title: Avoid findall overflow with n-fractions problem Problem title: Avoid findall overflow with n-fractions problem Tags: prolog-findall, eclipse-clp, prolog Problem: Avoid findall overflow with n-fractions problem I am trying to print all solutions of the n-fractions problem for n=4: :- lib(ic). fractions(Digits) :-...	Avoid findall overflow with n-fractions problem Avoid findall overflow with n-fractions problem prolog-findall eclipse-clp prolog Avoid Digits ic:alldifferent input_order List Overflow You LOCALSIZE Peak Avoid findall overflow with n-fractions problem I am trying to print all solutions of the n-fractions problem for n=...	[ -0.0189208984375, 0.007110595703125, 0.01068115234375, 0.0089111328125, -0.01312255859375, -0.004058837890625, -0.01312255859375, 0.0084228515625, -0.0010833740234375, -0.0341796875, 0.004364013671875, -0.00909423828125, 0.0245361328125, -0.01531982421875, 0.0194091796875, 0.0130004882...	[ 84361, 532, 7413, 5584, 645, 118664, 678, 653, 175921, 2967, 502, 4867, 111607, 106371, 184, 26775, 51174, 6, 238778, 107730, 80596, 32036, 9578, 2583, 230588, 9902, 19157, 162737, 7, 31577, 28412, 756, 51347, 107947, 11675, 70, 41, 25632, ...	[ 0.192626953125, 0.1392822265625, 0.1695556640625, 0.20361328125, 0.154052734375, 0.2626953125, 0.0748291015625, 0.152099609375, 0.255859375, 0.1966552734375, 0.113525390625, 0.1729736328125, 0.1365966796875, 0.19677734375, 0.143310546875, 0.109130859375, 0.050537109375, 0.017807006...	embed
14802370_c0	14802370	prolog	0	Title: Prolog: List recursion and modification Problem title: Prolog: List recursion and modification Tags: recursion, prolog, list Problem: Prolog: List recursion and modification I'm having a little trouble understanding list recursion and modification in Prolog. I'm trying to take a list of lists, then with each lis...	Prolog: List recursion and modification Prolog: List recursion and modification recursion prolog list Prolog List Find Multiply Take Attach First Tset MFirst Prolog: List recursion and modification I'm having a little trouble understanding list recursion and modification in Prolog. I'm trying to take a list of lists, t...	[ -0.017822265625, 0.038818359375, 0.009521484375, -0.00457763671875, -0.0106201171875, 0.001922607421875, -0.01507568359375, 0.00360107421875, 0.0196533203125, -0.001739501953125, 0.007171630859375, -0.0081787109375, -0.0087890625, -0.00127410888671875, 0.0086669921875, 0.00576782226562...	[ 1250, 4867, 32036, 195625, 1830, 129344, 136, 502, 5303, 26040, 19335, 62479, 46673, 9208, 934, 23972, 384, 3509, 276, 207263, 10176, 63134, 100094, 31577, 5646, 678, 12638, 6024, 12830, 390, 4568, 18151, 9790, 756, 2046, 98320, 6275, 28219, ...	[ 0.1666259765625, 0.239990234375, 0.1790771484375, 0.228515625, 0.093994140625, 0.2232666015625, 0.04150390625, 0.1302490234375, 0.2005615234375, 0.104248046875, 0.123046875, 0.181396484375, 0.095703125, 0.07415771484375, 0.09814453125, 0.0792236328125, 0.008453369140625, 0.15930175...	embed
66219009_c1	66219009	prolog	1	log seeing two differently instantiated terms with the same structure as the same term. Therefore, defining a variant-based subtitution predicate like so: variant_replace(A,B, [], []). variant_replace(A,B, [H\|T], [B\|T2]) :- (H=@=A)->variant_replace(A, B, T, T2). variant_replace(A,B, [H\|T], [H\|T2]) :- (H\=@=A)->variant_...	log seeing two differently instantiated terms with the same structure as the same term. Therefore, defining a variant-based subtitution predicate like so: variant_replace(A,B, [], []). variant_replace(A,B, [H\|T], [B\|T2]) :- (H=@=A)->variant_replace(A, B, T, T2). variant_replace(A,B, [H\|T], [H\|T2]) :- (H\=@=A)->variant_...	[ 0.0026397705078125, 0.0145263671875, -0.00543212890625, 0.0025634765625, 0.0029754638671875, 0.006378173828125, -0.0174560546875, 0.00970458984375, 0.01007080078125, -0.0208740234375, 0.0166015625, 0.01263427734375, -0.005218505859375, -0.0079345703125, 0.0186767578125, -0.001045227050...	[ 12684, 86681, 6626, 12921, 34648, 14, 69407, 5701, 45646, 13579, 13204, 20117, 77007, 1614, 118, 458, 1363, 1653, 2063, 67, 1884, 221, 107, 23935, 284, 571, 841, 618, 90173, 981, 162591, 335, 384, 10461, 209828, 1542, 62, 154663, 271, 119...	[ 0.1588134765625, 0.117431640625, 0.1099853515625, 0.130859375, 0.118408203125, 0.0819091796875, 0.1710205078125, 0.066650390625, 0.1290283203125, 0.149169921875, 0.0982666015625, 0.26904296875, 0.1304931640625, 0.196044921875, 0.1236572265625, 0.1239013671875, 0.03460693359375, 0.1...	embed
67944572_c0	67944572	prolog	0	Title: Prolog - Infinite loop with very basic rule definition Problem title: Prolog - Infinite loop with very basic rule definition Tags: failure-slice, prolog Problem: Prolog - Infinite loop with very basic rule definition I was trying to practice Prolog, as suggested by my TA, I am trying to create the rule append3(A...	Prolog - Infinite loop with very basic rule definition Prolog - Infinite loop with very basic rule definition failure-slice prolog Prolog Infinite append3 Prolog - Infinite loop with very basic rule definition I was trying to practice Prolog, as suggested by my TA, I am trying to create the rule append3(A,B,C,D) which ...	[ 0.01458740234375, 0.002716064453125, 0.010498046875, 0.0087890625, -0.0036468505859375, -0.006195068359375, 0.0098876953125, 0.01312255859375, 0.038330078125, -0.042236328125, -0.002105712890625, -0.0250244140625, -0.00750732421875, 0.01251220703125, 0.0238037109375, 0.01025390625, 0...	[ 1250, 4867, 134322, 40956, 678, 4552, 62822, 79986, 80934, 13, 137578, 13348, 502, 114689, 71, 363, 31577, 41361, 42459, 12998, 28282, 284, 571, 397, 26950, 391, 16750, 111, 62, 136, 313, 441, 34475, 54397, 25632, 10422, 237, 41, 171581, ...	[ 0.131591796875, 0.2120361328125, 0.147705078125, 0.23193359375, 0.0214385986328125, 0.0723876953125, 0.1402587890625, 0.1722412109375, 0.16455078125, 0.05230712890625, 0.189697265625, 0.0928955078125, 0.06494140625, 0.160400390625, 0.1165771484375, 0.1754150390625, 0.049713134765625,...	embed
36682087_c0	36682087	prolog	0	Title: Family tree with SWI-Prolog Problem title: Family tree with SWI-Prolog Tags: family-tree, prolog, logic Problem: Family tree with SWI-Prolog I am trying to get a simple family tree to work with Prolog using a maximum of 3 facts being allowed, however I can't seem to be able to define my sister as the child of my...	Family tree with SWI-Prolog Family tree with SWI-Prolog family-tree prolog logic Family SWI-Prolog ZFather ZChild Family tree with SWI-Prolog I am trying to get a simple family tree to work with Prolog using a maximum of 3 facts being allowed, however I can't seem to be able to define my sister as the child of my paren...	[ 0.0301513671875, 0.005828857421875, -0.0096435546875, 0.01373291015625, -0.0181884765625, -0.0037689208984375, -0.007354736328125, 0.00421142578125, 0.01239013671875, -0.04638671875, 0.00677490234375, -0.031982421875, -0.01336669921875, 0.0118408203125, 0.01953125, 0.01611328125, 0.0...	[ 59745, 53201, 678, 159, 38969, 10752, 4867, 14449, 62600, 502, 62775, 567, 17647, 9319, 441, 102656, 8781, 4488, 1250, 38132, 138, 15824, 107003, 61924, 759, 114015, 237, 29041, 111, 27863, 10644, 23, 67373, 1511, 4734, 45831, 163, 959, 78,...	[ 0.098876953125, 0.231201171875, 0.044403076171875, 0.05767822265625, 0.2025146484375, 0.1187744140625, 0.2047119140625, 0.0933837890625, 0.191162109375, 0.0872802734375, 0.1116943359375, 0.1297607421875, 0.1527099609375, 0.1295166015625, 0.0225982666015625, 0.155517578125, 0.06671142...	embed
35768069_c0	35768069	prolog	0	Title: create list without findall in prolog Problem title: create list without findall in prolog Tags: prolog, recursion Problem: create list without findall in prolog I'm working on a predicate to generate a list of values from rules. I have these rules: casilla(1,4,1,1,3). casilla(1,4,1,2,1). casilla(1,4,1,3,2). cas...	create list without findall in prolog create list without findall in prolog prolog recursion BOARD createBoard2 Difficulty VALUE create list without findall in prolog I'm working on a predicate to generate a list of values from rules. I have these rules: and I need to save the last value of each rule in a list, for exa...	[ 0.01129150390625, -0.0028076171875, -0.00994873046875, 0.0186767578125, -0.0062255859375, 0.0033416748046875, -0.026123046875, 0.0234375, 0.01116943359375, -0.034912109375, -0.009521484375, -0.01416015625, 0.008544921875, -0.008056640625, 0.0186767578125, 0.01531982421875, 0.01263427...	[ 28282, 5303, 15490, 7413, 5584, 502, 4867, 23, 195625, 14216, 49444, 12647, 5861, 304, 191144, 71333, 55991, 20697, 2063, 139392, 142424, 91736, 30098, 4568, 34292, 111, 12638, 79986, 9790, 5844, 11907, 12830, 3173, 28219, 18499, 4734, 30646, ...	[ 0.1202392578125, 0.210205078125, 0.12451171875, 0.1334228515625, 0.20263671875, 0.134033203125, 0.2283935546875, 0.00433349609375, 0.1376953125, 0.084228515625, 0.0831298828125, 0.0933837890625, 0.1180419921875, 0.0811767578125, 0.0718994140625, 0.09564208984375, 0.14013671875, 0.0...	embed
62031110_c0	62031110	prolog	0	Title: How to exclude all countries that have flag with primary colour in prolog? Problem title: How to exclude all countries that have flag with primary colour in prolog? Tags: prolog Problem: How to exclude all countries that have flag with primary colour in prolog? I have a set of facts on prolog as follows: primary...	How to exclude all countries that have flag with primary colour in prolog? How to exclude all countries that have flag with primary colour in prolog? prolog How How to exclude all countries that have flag with primary colour in prolog? I have a set of facts on prolog as follows: i want to run a query to return a list o...	[ -0.01446533203125, 0.006683349609375, 0.00087738037109375, 0.0125732421875, -0.003143310546875, -0.0128173828125, -0.000640869140625, 0.01190185546875, -0.00726318359375, -0.0089111328125, -0.00177001953125, -0.00885009765625, -0.0184326171875, -0.0225830078125, 0.0027008056640625, 0.0...	[ 11249, 47, 39041, 112, 756, 76726, 450, 765, 49938, 678, 158978, 134855, 23, 502, 4867, 15824, 98, 11675, 41, 30646, 5303, 124901, 959, 70541, 1528, 68360, 4734, 18151, 4488, 2967, 37863, 13, 214, 351, 42072 ]	[ 0.087158203125, 0.0638427734375, 0.191650390625, 0.1214599609375, 0.09808349609375, 0.189208984375, 0.04962158203125, 0.06878662109375, 0.2371826171875, 0.08642578125, 0.16015625, 0.203125, 0.041107177734375, 0.1656494140625, 0.2340087890625, 0.08758544921875, 0.04632568359375, 0.0...	embed
63314500_c0	63314500	prolog	0	Title: How to join rules and print out outputs in prolog Problem title: How to join rules and print out outputs in prolog Tags: prolog Problem: How to join rules and print out outputs in prolog I have list of facts as follows. items(itemId('P01'),prodName('Pots'),stockQty(50),price(8200)). items(itemId('P02'),prodName(...	How to join rules and print out outputs in prolog How to join rules and print out outputs in prolog prolog How P01 Pots P02 Pans P03 Spoons P04 Forks P05 Kettles P06 Plates print_all_products How to join rules and print out outputs in prolog I have list of facts as follows. How to print on the console something like th...	[ 0.0224609375, -0.0013275146484375, 0.0003948211669921875, 0.0257568359375, 0.00933837890625, 0.0159912109375, -0.0206298828125, 0.002044677734375, 0.003936767578125, -0.00787353515625, 0.02490234375, -0.0181884765625, 0.017822265625, -0.01068115234375, -0.01177978515625, 0.005401611328...	[ 11249, 33284, 91736, 136, 28412, 1810, 140992, 502, 4867, 7, 436, 6746, 13762, 9550, 4378, 9513, 23172, 5245, 7709, 1326, 1224, 8194, 171056, 1577, 9016, 22387, 5584, 57877, 23, 5303, 15824, 98, 130250, 1884, 25632, 3229, 75101, 34475, 1575...	[ 0.06329345703125, 0.2073974609375, 0.1947021484375, 0.04437255859375, 0.2236328125, 0.1646728515625, 0.2119140625, 0.160400390625, 0.254638671875, 0.0251007080078125, 0.009490966796875, 0.0648193359375, 0.118408203125, 0.008636474609375, 0.0677490234375, 0.02972412109375, 0.096557617...	embed
15674669_c1	15674669	prolog	1	stack clauselist (counter + 1) substitutions variablesinquery answers else raise BackTrack with Queue.Empty -> let answers = buildanswer substitutions variablesinquery :: answers in raise BackTrack The only computation that's happening on tempstack is that new goals are being inserted into it using another function (s...	stack clauselist (counter + 1) substitutions variablesinquery answers else raise BackTrack with Queue.Empty -> let answers = buildanswer substitutions variablesinquery :: answers in raise BackTrack The only computation that's happening on tempstack is that new goals are being inserted into it using another function (s...	[ 0.0115966796875, 0.0299072265625, 0.016357421875, 0.0263671875, -0.0002422332763671875, -0.0184326171875, -0.0123291015625, -0.0224609375, 0.013916015625, -0.005950927734375, -0.015869140625, 0.02685546875, 0.00604248046875, 0.005523681640625, 0.00408935546875, 0.002685546875, -0.014...	[ 177261, 70731, 13, 6562, 71013, 997, 161740, 17514, 77336, 944, 35166, 138804, 26828, 618, 86147, 5813, 13388, 134332, 939, 2633, 45367, 10133, 6488, 4734, 181135, 1363, 123087, 4109, 102, 2594, 3525, 109458, 183540, 15700, 32354, 590, 7177, ...	[ 0.2340087890625, 0.084228515625, 0.0153045654296875, 0.1396484375, 0.03656005859375, 0.0706787109375, 0.143798828125, 0.0293731689453125, 0.1619873046875, 0.11328125, 0.1416015625, 0.183349609375, 0.1240234375, 0.0657958984375, 0.201416015625, 0.10711669921875, 0.1300048828125, 0.0...	embed
11021330_c0	11021330	prolog	0	Title: Is there a library/technique to collect statistics for optimal clause ordering in Prolog? Problem title: Is there a library/technique to collect statistics for optimal clause ordering in Prolog? Tags: swi-prolog, sicstus-prolog, prolog, performance, optimization Problem: Is there a library/technique to collect s...	Is there a library/technique to collect statistics for optimal clause ordering in Prolog? Is there a library/technique to collect statistics for optimal clause ordering in Prolog? swi-prolog sicstus-prolog prolog performance optimization Prolog Is there a library/technique to collect statistics for optimal clause order...	[ 0.0289306640625, 0.00946044921875, -0.0008392333984375, -0.004730224609375, -0.0301513671875, 0.0000362396240234375, -0.00787353515625, -0.0189208984375, -0.002593994140625, -0.0086669921875, 0.01220703125, 0.0052490234375, -0.007171630859375, -0.0322265625, 0.00799560546875, 0.0035095...	[ 35773, 1294, 20489, 45602, 43799, 80835, 7, 100, 24087, 70731, 13, 12989, 214, 1250, 4867, 47, 2452, 3454, 26536, 18253, 502, 23718, 87235, 2685, 10, 64, 23, 32562, 1528, 1957, 2174, 79315, 14858, 17311, 103510, 29479, 79986, 90, 8335, 30...	[ 0.2099609375, 0.1279296875, 0.1114501953125, 0.1260986328125, 0.1898193359375, 0.259521484375, 0.1341552734375, 0.03515625, 0.1871337890625, 0.2044677734375, 0.12158203125, 0.2181396484375, 0.08935546875, 0.175048828125, 0.26220703125, 0.009796142578125, 0.1131591796875, 0.11132812...	embed
58875339_c0	58875339	prolog	0	Title: Why is my prolog predicate stop when it gets the first answer? Problem title: Why is my prolog predicate stop when it gets the first answer? Tags: prolog, chatbot Problem: Why is my prolog predicate stop when it gets the first answer? I have this predicate: ans(["Hello"],0). ans(["Hello", "dear", "customer"],0)....	Why is my prolog predicate stop when it gets the first answer? Why is my prolog predicate stop when it gets the first answer? prolog chatbot Why Hello Good Morning Afternoon Night List Why is my prolog predicate stop when it gets the first answer? I have this predicate: This predicate receives a list of atoms and shoul...	[ 0.0040283203125, -0.0169677734375, 0.0123291015625, 0.0230712890625, -0.0091552734375, 0.0277099609375, 0.0034332275390625, 0.0123291015625, 0.01068115234375, -0.046630859375, 0.00408935546875, 0.004150390625, 0.0062255859375, 0.001129150390625, 0.03173828125, 0.0240478515625, 0.0288...	[ 44084, 83, 759, 502, 4867, 1653, 2063, 67, 7279, 3229, 62163, 5117, 35166, 3245, 9190, 35378, 18621, 163710, 24372, 157, 36151, 32036, 70, 53299, 5303, 34627, 30646, 45646, 7210, 14858, 678, 13817, 866, 339, 2203, 10133, 757, 147, 5928, 4...	[ 0.1280517578125, 0.032470703125, 0.03875732421875, 0.1898193359375, 0.229736328125, 0.184326171875, 0.20458984375, 0.09765625, 0.2154541015625, 0.0458984375, 0.0899658203125, 0.1483154296875, 0.1934814453125, 0.0634765625, 0.1148681640625, 0.16162109375, 0.0943603515625, 0.16479492...	embed
7777991_c0	7777991	prolog	0	Title: read line to atomic list in prolog Problem title: read line to atomic list in prolog Tags: swi-prolog, prolog Problem: read line to atomic list in prolog I need to read any line (from user_input) into an atomic list, e.g.: Example line, which contains any ASCII chars. into: [Example,'line,',which,contains,any,AS...	read line to atomic list in prolog read line to atomic list in prolog swi-prolog prolog Example ASCII read_line_to_codes user_input Input atom_codes atomic_list_concat AlistI string_to_atom read line to atomic list in prolog I need to read any line (from user_input) into an atomic list, e.g.: into: what I've got so far...	[ -0.01513671875, -0.0184326171875, -0.00017070770263671875, 0.03173828125, -0.0177001953125, 0.01544189453125, 0.019775390625, 0.01373291015625, -0.0072021484375, -0.058837890625, -0.005126953125, 0.000827789306640625, -0.01458740234375, 0.00115966796875, -0.00262451171875, -0.017822265...	[ 12301, 13315, 47, 34627, 1771, 5303, 23, 502, 4867, 2452, 3454, 89536, 125429, 10001, 2256, 188, 40899, 38937, 73, 7077, 6562, 2271, 4460, 568, 79315, 11, 5928, 3871, 2499, 161063, 3934, 2367, 87, 4163, 221, 2060, 4734, 43240, 11001, 3415...	[ 0.2200927734375, 0.2008056640625, 0.1270751953125, 0.2005615234375, 0.1376953125, 0.230224609375, 0.04339599609375, 0.162353515625, 0.221923828125, 0.142822265625, 0.13232421875, 0.05523681640625, 0.04437255859375, 0.08587646484375, 0.186279296875, 0.156982421875, 0.204833984375, 0...	embed
34892545_c0	34892545	prolog	0	Title: Prolog. In a query, how to put a condition on a variable that I do not want in the results? Problem title: Prolog. In a query, how to put a condition on a variable that I do not want in the results? Tags: prolog-toplevel, prolog Problem: Prolog. In a query, how to put a condition on a variable that I do not want...	Prolog. In a query, how to put a condition on a variable that I do not want in the results? Prolog. In a query, how to put a condition on a variable that I do not want in the results? prolog-toplevel prolog Prolog Prolog. In a query, how to put a condition on a variable that I do not want in the results? Imagine that I...	[ 0.024169921875, 0.0216064453125, 0.0086669921875, 0.01007080078125, -0.006744384765625, 0.0137939453125, -0.005157470703125, 0.015625, -0.003997802734375, -0.0299072265625, 0.0152587890625, 0.0002593994140625, -0.01385498046875, 0.006591796875, 0.021240234375, 0.00167083740234375, 0....	[ 1250, 4867, 41, 1294, 3642, 47, 3884, 35431, 98, 77336, 450, 87, 54, 959, 3444, 50339, 10, 502, 13784, 67919, 360, 23, 133196, 25632, 51359, 3647, 76199, 12638, 3445, 1919, 5117, 9351, 32070, 456, 3996, 3134, 756, 114210, 3501, 387, 536...	[ 0.1744384765625, 0.26025390625, 0.17138671875, 0.138671875, 0.111572265625, 0.032470703125, 0.191162109375, 0.263916015625, 0.1612548828125, 0.266845703125, 0.106689453125, 0.0830078125, 0.1580810546875, 0.21923828125, 0.218017578125, 0.1474609375, 0.076171875, 0.09735107421875, ...	embed
61447526_c0	61447526	prolog	0	Title: Accessing elements inside parenthesis in Prolog Problem title: Accessing elements inside parenthesis in Prolog Tags: prolog, list Problem: Accessing elements inside parenthesis in Prolog So i have this predicate letras_comuns(Lst_Pals, Letras_comuns) in which Lst_Pals is a list of like [[a,t,o],[a,c,o],[a,n,o]] ...	Accessing elements inside parenthesis in Prolog Accessing elements inside parenthesis in Prolog prolog list Accessing Prolog letras_comuns Lst_Pals Accessing elements inside parenthesis in Prolog So i have this predicate letras_comuns(Lst_Pals, Letras_comuns) in which Lst_Pals is a list of like [[a,t,o],[a,c,o],[a,n,o]...	[ -0.01019287109375, -0.0181884765625, -0.00396728515625, 0.03564453125, 0.00408935546875, 0.0245361328125, 0.001739501953125, 0.005859375, 0.0030517578125, -0.048095703125, 0.0240478515625, 0.0031890869140625, 0.003143310546875, -0.00982666015625, -0.00848388671875, 0.01092529296875, ...	[ 40266, 214, 80854, 46132, 49129, 160291, 7, 1250, 4867, 502, 5303, 111154, 277, 309, 339, 271, 81841, 1653, 2063, 866, 102690, 18, 31, 756, 39210, 11907, 2565, 63262, 11, 6896, 26950, 34153, 454, 5007, 10, 36, 138, 4216, 19777, 2967, 34...	[ 0.2142333984375, 0.000762939453125, 0.1837158203125, 0.1640625, 0.1650390625, 0.2008056640625, 0.1114501953125, 0.160888671875, 0.266357421875, 0.119140625, 0.119140625, 0.228271484375, 0.14306640625, 0.1671142578125, 0.057830810546875, 0.1072998046875, 0.2005615234375, 0.043090820...	embed
25945167_c0	25945167	prolog	0	Title: Prolog beginner here Problem title: Prolog beginner here Tags: prolog Problem: Prolog beginner here hasAccount(Person,Bank,Amount) – the Person has an account at the Bank with the balance Amount, lives(Person,City) – the Person lives in the City, created(Person,Bank,Month,Year) – the Person opened an account at ...	Prolog beginner here Prolog beginner here prolog Prolog Person Bank Amount City Month Year Someone Bank1 Balance1 Bank2 Balance2 metro_credit_union toronto_dominion Yes Prolog beginner here hasAccount(Person,Bank,Amount) – the Person has an account at the Bank with the balance Amount, lives(Person,City) – the Person li...	[ 0.0177001953125, 0.000553131103515625, -0.00018310546875, 0.0157470703125, -0.01324462890625, 0.004730224609375, 0.00168609619140625, 0.034423828125, 0.0191650390625, -0.00860595703125, 0.0255126953125, 0.005950927734375, -0.0020599365234375, -0.00787353515625, 0.00732421875, -0.006744...	[ 1250, 4867, 9842, 1679, 3688, 502, 15270, 4932, 121147, 6406, 12982, 42552, 3630, 131176, 23205, 45639, 87046, 9983, 40863, 68131, 1830, 32635, 1556, 39450, 71013, 160054, 70323, 284, 15426, 99, 40197, 60742, 115411, 75935, 146794, 69085, 14209...	[ 0.20068359375, 0.2685546875, 0.1392822265625, 0.130126953125, 0.1668701171875, 0.162109375, 0.14453125, 0.177978515625, 0.18310546875, 0.112060546875, 0.0550537109375, 0.088623046875, 0.0163421630859375, 0.1376953125, 0.07940673828125, 0.101806640625, 0.09478759765625, 0.0739746093...	embed
13690350_c0	13690350	prolog	0	Title: Plausible scenario for Prolog or any other logical programing language Problem title: Plausible scenario for Prolog or any other logical programing language Tags: 3d, animation, declarative, prolog Problem: Plausible scenario for Prolog or any other logical programing language As someone who does computer animat...	Plausible scenario for Prolog or any other logical programing language Plausible scenario for Prolog or any other logical programing language 3d animation declarative prolog Plausible Prolog Plausible scenario for Prolog or any other logical programing language As someone who does computer animation, is the following s...	[ 0.005767822265625, 0.017822265625, -0.00145721435546875, 0.0201416015625, 0.0032196044921875, 0.0269775390625, -0.004302978515625, -0.0115966796875, 0.002471923828125, -0.047119140625, 0.0045166015625, 0.0205078125, -0.015380859375, 0.002410888671875, 0.005615234375, 0.00665283203125, ...	[ 8950, 34, 55356, 106117, 1250, 4867, 62775, 1528, 46876, 100, 138, 71, 114205, 21635, 502, 14602, 13909, 25632, 65933, 28282, 28302, 678, 397, 3299, 10269, 49520, 4393, 62816, 34053, 27744, 6226, 7228, 65998, 26698, 756, 77336, 234873, 36746,...	[ 0.1632080078125, 0.156982421875, 0.1790771484375, 0.2261962890625, 0.1756591796875, 0.2431640625, 0.20361328125, 0.1798095703125, 0.1396484375, 0.00274658203125, 0.1151123046875, 0.06878662109375, 0.1795654296875, 0.148193359375, 0.108154296875, 0.008087158203125, 0.0947265625, 0.0...	embed
61743499_c0	61743499	prolog	0	Title: Prolog File not being read despite file existing Problem title: Prolog File not being read despite file existing Tags: prolog Problem: Prolog File not being read despite file existing Good day! I wrote a load_rules to be able to read files that I would be utilizing in my Prolog program. However, it seems that Pr...	Prolog File not being read despite file existing Prolog File not being read despite file existing prolog a Prolog File load_rules clear_db lod_ruls read_word_list formal_english joggers_facts_and_rules ERROR source_sink formal_english.pl:88 Note Re-run Undefined Directives See FAQ www.swi-prolog.org ToplevelMode.txt ex...	[ 0.040283203125, -0.00335693359375, 0.0020751953125, 0.013671875, -0.01348876953125, 0.01904296875, -0.0021209716796875, 0.005828857421875, 0.006927490234375, -0.0361328125, 0.0177001953125, -0.00799560546875, -0.0179443359375, -0.0361328125, 0.0263671875, -0.020263671875, 0.002593994...	[ 1250, 4867, 42724, 959, 8035, 12301, 61518, 11435, 144573, 502, 72367, 13500, 34735, 48073, 45314, 47416, 6562, 23113, 13305, 8344, 26255, 114700, 151206, 31344, 14068, 2424, 12772, 16428, 5983, 42666, 60877, 2452, 3454, 4792, 67919, 9083, 1243...	[ 0.184326171875, 0.24853515625, 0.180908203125, 0.0953369140625, 0.050628662109375, 0.19677734375, 0.1326904296875, 0.18798828125, 0.188232421875, 0.1695556640625, 0.1319580078125, 0.12646484375, 0.09051513671875, 0.060455322265625, 0.0694580078125, 0.0745849609375, 0.09375, 0.15124...	embed
9518216_c0	9518216	prolog	0	Title: SWI Prolog ensure_loaded error Problem title: SWI Prolog ensure_loaded error Tags: swi-prolog, prolog, module Problem: SWI Prolog ensure_loaded error I am using SWI Prolog for a mathematical logic book and the book provided source code for some of the algorithms in Prolog. The problem is that when I try to load ...	SWI Prolog ensure_loaded error SWI Prolog ensure_loaded error swi-prolog prolog module SWI Prolog ensure_loaded load_files Non-module user:file_search_path SWI Prolog ensure_loaded error I am using SWI Prolog for a mathematical logic book and the book provided source code for some of the algorithms in Prolog. The probl...	[ 0.0208740234375, 0.014404296875, -0.004180908203125, 0.02734375, -0.01953125, 0.01373291015625, -0.0014495849609375, 0.003326416015625, -0.00677490234375, -0.07421875, 0.01263427734375, -0.00439453125, -0.01312255859375, -0.0174560546875, 0.0218505859375, 0.013427734375, -0.015197753...	[ 159, 38969, 1250, 4867, 63284, 63033, 297, 18499, 91, 2452, 3454, 502, 88996, 72367, 29822, 3775, 83279, 38937, 86250, 128405, 17368, 140363, 62775, 12877, 31344, 18151, 234873, 2967, 9790, 11435, 29481, 56, 105876, 1884, 2684, 102158, 4034, ...	[ 0.0760498046875, 0.244140625, 0.1810302734375, 0.2178955078125, 0.2880859375, 0.237060546875, 0.0684814453125, 0.1805419921875, 0.00335693359375, 0.1917724609375, 0.07562255859375, 0.1064453125, 0.1654052734375, 0.216796875, 0.1226806640625, 0.038787841796875, 0.1678466796875, 0.09...	embed
52917203_c0	52917203	prolog	0	Title: Prolog search key/value list and output a list of values Problem title: Prolog search key/value list and output a list of values Tags: prolog Problem: Prolog search key/value list and output a list of values I'm once again stuck with a pretty simple Prolog task. I want to define a predicate kv_search/3 that take...	Prolog search key/value list and output a list of values Prolog search key/value list and output a list of values prolog Prolog kv_search kv_find Rest Result Prolog search key/value list and output a list of values I'm once again stuck with a pretty simple Prolog task. I want to define a predicate kv_search/3 that take...	[ 0.004730224609375, -0.000865936279296875, 0.0059814453125, -0.027099609375, -0.01385498046875, 0.0048828125, -0.0159912109375, -0.005462646484375, 0.007598876953125, 0.007293701171875, 0.0098876953125, -0.0235595703125, 0.0113525390625, -0.00070953369140625, 0.007476806640625, -0.00308...	[ 1250, 4867, 33938, 22799, 64, 27494, 13, 5303, 140992, 142424, 111, 502, 26687, 86250, 111607, 49756, 126684, 179933, 8781, 66211, 3444, 61924, 1653, 2063, 67, 18113, 51776, 275, 617, 1019, 1126, 963, 5117, 10750, 17932, 756, 50960, 43581, ...	[ 0.1552734375, 0.2257080078125, 0.1907958984375, 0.1851806640625, 0.00048828125, 0.184814453125, 0.01275634765625, 0.1787109375, 0.192138671875, 0.2015380859375, 0.014862060546875, 0.11181640625, 0.1446533203125, 0.1993408203125, 0.1041259765625, 0.1756591796875, 0.1546630859375, 0....	embed
23019878_c0	23019878	prolog	0	Title: Prolog - implementing formula of area Problem title: Prolog - implementing formula of area Tags: prolog Problem: Prolog - implementing formula of area I want to calculate the area of a polygon in Prolog. The area of a polygon is given by the formula: \| {(x1y2-y1x2) + (x2y3-y2x3) + .... + (xny1 - ynx1)}/2 \|...	Prolog - implementing formula of area Prolog - implementing formula of area prolog Prolog y2-y1 y3-y2 Points Area List Acc areaAcc2 FirstX FirstY NewAcc Prolog - implementing formula of area I want to calculate the area of a polygon in Prolog. The area of a polygon is given by the formula: where (x1,y1),(x2,y2)....(xn,...	[ 0.02587890625, 0.0052490234375, -0.0047607421875, 0.0098876953125, -0.01220703125, 0.01513671875, -0.00665283203125, 0.0228271484375, 0.03125, -0.01483154296875, 0.0283203125, -0.006011962890625, -0.00836181640625, -0.0174560546875, 0.005401611328125, 0.004241943359375, 0.00277709960...	[ 1250, 4867, 29479, 26168, 111, 16128, 20, 214, 502, 113, 18504, 53, 418, 27495, 304, 41097, 79200, 32036, 29899, 10060, 23972, 1542, 1723, 2356, 87, 3444, 74481, 67, 70, 10, 35874, 6126, 23, 83, 34475, 390, 7440, 425, 17727, 10461, 19, ...	[ 0.213623046875, 0.282470703125, 0.1912841796875, 0.233154296875, 0.124755859375, 0.2486572265625, 0.001007080078125, 0.019256591796875, 0.136474609375, 0.05413818359375, 0.1181640625, 0.06622314453125, 0.05267333984375, 0.06939697265625, 0.1353759765625, 0.1533203125, 0.2646484375, ...	embed
71596841_c0	71596841	prolog	0	Title: prolog store a list in a variable Problem title: prolog store a list in a variable Tags: prolog Problem: prolog store a list in a variable prod([[vin(110 "Mercurey", 1978, 13), vin(120, "Macon", 1977, 12)], [viticulteur("Nicolas","Pouilly","Bourgogne"), viticulteur("Martin","Bordaux","Bordelais")]], R) This pred...	prolog store a list in a variable prolog store a list in a variable prolog Mercurey Macon Nicolas Pouilly Bourgogne Martin Bordaux Bordelais Python vin6 prolog store a list in a variable This predicate is returning a list: I want to store this list "R" in a variable on my program. How can I do that? What I want to do i...	[ 0.015625, -0.00176239013671875, 0.01397705078125, 0.031494140625, 0.000591278076171875, 0.012939453125, -0.0264892578125, 0.000728607177734375, 0.01397705078125, -0.031494140625, 0.020263671875, 0.01513671875, -0.002471923828125, -0.01275634765625, -0.006927490234375, 0.00860595703125,...	[ 502, 4867, 4343, 5303, 23, 10, 77336, 123106, 7460, 4727, 191, 115963, 37962, 114833, 182359, 1663, 86, 6470, 48606, 10442, 13, 19164, 145581, 3862, 910, 1653, 2063, 67, 30646, 3444, 47, 903, 1052, 759, 1528, 831, 54, 450, 1660, 1884 ]	[ 0.200927734375, 0.296630859375, 0.23046875, 0.25439453125, 0.1241455078125, 0.0335693359375, 0.313232421875, 0.17578125, 0.1141357421875, 0.087646484375, 0.13330078125, 0.1224365234375, 0.0948486328125, 0.14794921875, 0.02813720703125, 0.045654296875, 0.0218963623046875, 0.11767578...	embed
24322526_c0	24322526	prolog	0	Title: Reading from user_input causes ":\|" to appear in output Problem title: Reading from user_input causes ":\|" to appear in output Tags: swi-prolog, prolog Problem: Reading from user_input causes ":\|" to appear in output My code is using read_line_to_codes/2 and read_stream_to_codes/2 in order to...	Reading from user_input causes ":\|" to appear in output Reading from user_input causes ":\|" to appear in output swi-prolog prolog user_input Reading read_line_to_codes read_stream_to_codes Some program.pl Reading from user_input causes ":\|" to appear in output My code is using read_line_to_codes/2 a...	[ 0.004974365234375, 0.00823974609375, 0.007476806640625, -0.000827789306640625, -0.024658203125, -0.0062255859375, 0.004791259765625, 0.0174560546875, -0.01031494140625, -0.033447265625, 0.0031280517578125, -0.00750732421875, -0.0035400390625, 0.003173828125, 0.0113525390625, -0.0144653...	[ 104951, 1295, 38937, 73, 7077, 113660, 41502, 12, 58745, 1230, 108975, 140992, 2452, 3454, 4867, 502, 12301, 2256, 188, 40899, 86429, 1528, 2424, 23, 18151, 12477, 7, 5808, 9969, 49725, 75101, 127877, 5885, 5201, 678, 124850, 91, 130250, 45...	[ 0.219482421875, 0.16552734375, 0.20458984375, 0.1741943359375, 0.1917724609375, 0.1419677734375, 0.08917236328125, 0.11669921875, 0.175537109375, 0.056121826171875, 0.136962890625, 0.2227783203125, 0.1693115234375, 0.090087890625, 0.1663818359375, 0.0791015625, 0.1922607421875, 0.1...	embed
61851162_c1	61851162	prolog	1	and "the step is positive" is given by the following subset of clauses matching the terms int(End) and pos(Step) : % --- % Case of "positive step" pos(Step) and "integer end" int(End) (not infinite end) % --- % Past end of sequence. Occurs only if the sequence is empty on entry. between_enum(Start,int(End),pos(_),_) :...	and "the step is positive" is given by the following subset of clauses matching the terms int(End) and pos(Step) : % --- % Case of "positive step" pos(Step) and "integer end" int(End) (not infinite end) % --- % Past end of sequence. Occurs only if the sequence is empty on entry. between_enum(Start,int(End),pos(_),_) :...	[ -0.0172119140625, -0.00836181640625, 0.015869140625, 0.01025390625, 0.0003223419189453125, 0.0150146484375, 0.006134033203125, 0.0019989013671875, 0.0181884765625, 0.0167236328125, 0.0078125, 0.0198974609375, -0.0126953125, 0.018798828125, 0.0191650390625, -0.004119873046875, 0.02087...	[ 136, 2347, 29954, 83, 24491, 34475, 390, 25632, 1614, 3509, 70731, 90, 14858, 69407, 23, 18, 152378, 3864, 191644, 1745, 43731, 67890, 4935, 6191, 1505, 3564, 10869, 54241, 3805, 40, 944, 3956, 48650, 4734, 201505, 42805, 17721, 316, 126597...	[ 0.0199737548828125, 0.1087646484375, 0.287109375, 0.10662841796875, 0.279541015625, 0.140869140625, 0.0281829833984375, 0.038421630859375, 0.056915283203125, 0.05523681640625, 0.138427734375, 0.049957275390625, 0.1119384765625, 0.1046142578125, 0.0750732421875, 0.10205078125, 0.18615...	embed
39780250_c1	39780250	prolog	1	= X, L = B. removespider([A\|B],X,L) :- not(A = X), removespider(B,X,M), L = [A\|M]. removeconspirators([],D,L) :- L = []. removeconspirators(E,[],L) :- L = E. removeconspirators([A],[B],L) :- A = B, L = []. removeconspirators([A],[B],L) :- not(A = B), L = [A]. removeconspirators([A,B\|C],[D],L) :- A = D, L = [B\|C]. remo...	= X, L = B. removespider([A\|B],X,L) :- not(A = X), removespider(B,X,M), L = [A\|M]. removeconspirators([],D,L) :- L = []. removeconspirators(E,[],L) :- L = E. removeconspirators([A],[B],L) :- A = B, L = []. removeconspirators([A],[B],L) :- not(A = B), L = [A]. removeconspirators([A,B\|C],[D],L) :- A = D, L = [B\|C]. remo...	[ -0.00555419921875, 0.0213623046875, -0.0015106201171875, 0.016357421875, -0.022216796875, -0.002227783203125, -0.004547119140625, -0.007568359375, 0.0019989013671875, -0.025146484375, -0.000629425048828125, 0.0146484375, -0.0169677734375, 0.00384521484375, 0.01446533203125, 0.023071289...	[ 2203, 1193, 339, 335, 87388, 44689, 820, 58745, 571, 1542, 866, 15772, 959, 284, 594, 54547, 22230, 397, 241, 62, 391, 541, 26265, 47, 16195, 1090, 68998, 408, 1229, 756, 84797, 30646, 29568, 5, 11782, 132, 2301, 18, 2046, 17262, 51347,...	[ 0.15576171875, 0.1654052734375, 0.1397705078125, 0.1234130859375, 0.17236328125, 0.118896484375, 0.1484375, 0.0305023193359375, 0.09033203125, 0.169677734375, 0.1156005859375, 0.05999755859375, 0.10009765625, 0.0276947021484375, 0.0423583984375, 0.1558837890625, 0.0733642578125, 0....	embed
16085748_c1	16085748	prolog	1	= henry ; X = elizabeth, Y = andrew ; X = elizabeth, Y = beatrice ; X = elizabeth, Y = eugenie ; X = elizabeth, Y = edward ; X = elizabeth, Y = viscount ; X = elizabeth, Y = louise ; After this point, when i try to go the Anne family it goes wrong. X = anne, Y = peter ; X = anne, Y = savanna ; X = anne, Y = isla ; X =...	= henry ; X = elizabeth, Y = andrew ; X = elizabeth, Y = beatrice ; X = elizabeth, Y = eugenie ; X = elizabeth, Y = edward ; X = elizabeth, Y = viscount ; X = elizabeth, Y = louise ; After this point, when i try to go the Anne family it goes wrong. X = anne, Y = peter ; X = anne, Y = savanna ; X = anne, Y = isla ; X =...	[ 0.0022735595703125, 0.008056640625, -0.000843048095703125, 0.022216796875, -0.004119873046875, -0.004364013671875, -0.0247802734375, 0.01129150390625, 0.0031585693359375, -0.00958251953125, -0.001434326171875, 0.0025787353515625, -0.003509521484375, 0.0057373046875, 0.004180908203125, ...	[ 2203, 8311, 1294, 2819, 1193, 88, 7337, 86077, 4, 990, 2528, 434, 42659, 32512, 1175, 429, 701, 2223, 19364, 4498, 71013, 459, 34, 3075, 24372, 903, 6275, 3229, 17, 9790, 738, 70, 14245, 14449, 442, 60899, 44691, 42230, 154643, 14880, 6...	[ 0.1956787109375, 0.138671875, 0.2083740234375, 0.058197021484375, 0.1982421875, 0.053009033203125, 0.1256103515625, 0.22265625, 0.02325439453125, 0.2122802734375, 0.1375732421875, 0.159423828125, 0.084228515625, 0.1533203125, 0.0303497314453125, 0.10400390625, 0.10369873046875, 0.0...	embed
49225025_c0	49225025	prolog	0	Title: Create a predicate that returns lists that meet certain conditions Problem title: Create a predicate that returns lists that meet certain conditions Tags: prolog, list Problem: Create a predicate that returns lists that meet certain conditions I was trying to create a predicate example(N, L) , where L is a list ...	Create a predicate that returns lists that meet certain conditions Create a predicate that returns lists that meet certain conditions prolog list Create Create a predicate that returns lists that meet certain conditions I was trying to create a predicate example(N, L) , where L is a list that for given N: has length 2*...	[ -0.00250244140625, 0.00958251953125, -0.014892578125, -0.00372314453125, -0.01312255859375, 0.0302734375, 0.005706787109375, 0.00665283203125, 0.00897216796875, -0.0184326171875, 0.0211181640625, 0.0036163330078125, 0.0120849609375, -0.00921630859375, -0.01458740234375, 0.0311279296875...	[ 151313, 1653, 2063, 67, 450, 30646, 5303, 7, 23356, 24233, 27289, 502, 4867, 10, 31577, 28282, 27781, 839, 339, 34475, 541, 1556, 140909, 116, 1639, 11907, 14012, 106, 47, 83, 14037, 66161, 186351, 17721, 6626, 108975, 5701, 3853, 3789, 1...	[ 0.1724853515625, 0.2296142578125, 0.259033203125, 0.1448974609375, 0.0379638671875, 0.1861572265625, 0.256103515625, 0.054656982421875, 0.1722412109375, 0.1199951171875, 0.21875, 0.1492919921875, 0.2198486328125, 0.005126953125, 0.0828857421875, 0.1583251953125, 0.1646728515625, 0....	embed
50238915_c0	50238915	prolog	0	Title: Prolog recursive list shuffling Problem title: Prolog recursive list shuffling Tags: prolog Problem: Prolog recursive list shuffling Revising for a prolog exam and working through past papers that we don't have answers for and I've got stuck halfway through a problem and I was really hoping for some help! The qu...	Prolog recursive list shuffling Prolog recursive list shuffling prolog Prolog Prolog recursive list shuffling Revising for a prolog exam and working through past papers that we don't have answers for and I've got stuck halfway through a problem and I was really hoping for some help! The question: Write a predicate perm...	[ -0.005584716796875, 0.0057373046875, 0.025390625, -0.006561279296875, 0.0030059814453125, 0.0186767578125, -0.04638671875, -0.019287109375, 0.005584716796875, -0.0216064453125, 0.01397705078125, -0.00004649162292480469, 0.00180816650390625, 0.00121307373046875, 0.00171661376953125, 0.0...	[ 1250, 4867, 195625, 5844, 5303, 8633, 4902, 2069, 502, 63441, 42276, 11015, 15122, 765, 35166, 179933, 2967, 509, 6183, 156377, 100, 4358, 9655, 18781, 1653, 2063, 67, 117, 561, 1542, 990, 7, 9023, 2198, 13566, 80854, 1193, 113054, 91, 15...	[ 0.165283203125, 0.21484375, 0.2191162109375, 0.08984375, 0.189453125, 0.139404296875, 0.184814453125, 0.0208892822265625, 0.1380615234375, 0.046356201171875, 0.09405517578125, 0.013153076171875, 0.03717041015625, 0.006988525390625, 0.1416015625, 0.06561279296875, 0.04840087890625, ...	embed
55304542_c0	55304542	prolog	0	Title: turn Predicate; How do you append a sublist of reversed elements to a list? Problem title: turn Predicate; How do you append a sublist of reversed elements to a list? Tags: prolog Problem: turn Predicate; How do you append a sublist of reversed elements to a list? turn\3 takes two lists as input, the original, a...	turn Predicate; How do you append a sublist of reversed elements to a list? turn Predicate; How do you append a sublist of reversed elements to a list? prolog Predicate How Reversed turn Predicate; How do you append a sublist of reversed elements to a list? turn\3 takes two lists as input, the original, and the toggles...	[ -0.00433349609375, 0.009521484375, 0.036376953125, 0.000946044921875, -0.0201416015625, 0.0228271484375, -0.005767822265625, 0.02392578125, 0.0125732421875, -0.005035400390625, 0.004302978515625, 0.02978515625, -0.01165771484375, 0.01361083984375, 0.004241943359375, 0.0133056640625, ...	[ 15504, 7145, 2063, 67, 11249, 114689, 71, 1614, 6562, 39531, 5281, 80854, 47, 5303, 54, 502, 4867, 853, 7864, 297, 41872, 363, 51776, 6626, 237, 107730, 7311, 129384, 12830, 32786, 5908, 12989, 756, 7103, 3642, 184, 2831, 83324, 9815, 206...	[ 0.2333984375, 0.1622314453125, 0.158447265625, 0.0865478515625, 0.07012939453125, 0.1348876953125, 0.0806884765625, 0.16064453125, 0.198486328125, 0.2099609375, 0.158935546875, 0.1627197265625, 0.09893798828125, 0.168701171875, 0.00146484375, 0.0272674560546875, 0.095458984375, 0.0...	embed
50304875_c0	50304875	prolog	0	Title: Prolog: Matrix operations Problem title: Prolog: Matrix operations Tags: prolog, matrix Problem: Prolog: Matrix operations I don't have a lot of experience in porgramming in Prolog. I am struggeling with writing rules for basic matrix operations. So I need these three operations for a matrix N : size(+N,-Num): r...	Prolog: Matrix operations Prolog: Matrix operations prolog matrix Prolog Matrix Num Value NewN size2 size1 Mss Mat Row Col Val nth1 ARow Prolog: Matrix operations I don't have a lot of experience in porgramming in Prolog. I am struggeling with writing rules for basic matrix operations. So I need these three operations ...	[ 0.01092529296875, -0.0028228759765625, 0.0244140625, -0.002838134765625, 0.0189208984375, -0.0098876953125, -0.00970458984375, 0.01220703125, 0.01275634765625, -0.00604248046875, 0.00897216796875, -0.01226806640625, -0.01409912109375, -0.0267333984375, -0.00439453125, 0.00262451171875,...	[ 1250, 4867, 12, 194234, 41018, 502, 50944, 52782, 190060, 2356, 839, 13267, 304, 418, 70802, 7656, 96190, 11554, 4769, 927, 8770, 5915, 16981, 196, 107415, 29686, 23359, 32562, 91736, 62822, 425, 3871, 6097, 17262, 541, 27781, 765, 1884, 90...	[ 0.1766357421875, 0.2340087890625, 0.0179290771484375, 0.2315673828125, 0.2314453125, 0.1265869140625, 0.1929931640625, 0.170166015625, 0.1978759765625, 0.110595703125, 0.1607666015625, 0.143310546875, 0.0219268798828125, 0.010162353515625, 0.056427001953125, 0.135986328125, 0.1514892...	embed
41284117_c0	41284117	prolog	0	Title: Finding the largest even number in list Problem title: Finding the largest even number in list Tags: prolog Problem: Finding the largest even number in list The point of this program is supposed to be to find the largest even number inside a list. For example, the query: ? - evenmax([1, 3, 9, 16, 25, -5, 18], X]...	Finding the largest even number in list Finding the largest even number in list prolog Finding seperate_list separate_list Even Odd find_max Max Finding the largest even number in list The point of this program is supposed to be to find the largest even number inside a list. For example, the query: The way I thought to...	[ 0.006561279296875, 0.0234375, 0.017578125, 0.00010013580322265625, -0.00799560546875, 0.045654296875, -0.0184326171875, 0.0123291015625, 0.00836181640625, -0.01483154296875, 0.0084228515625, -0.0234375, 0.00677490234375, -0.002044677734375, 0.0164794921875, -0.00811767578125, 0.00332...	[ 26040, 142105, 3853, 14012, 23, 5303, 70, 502, 4867, 40, 143870, 13, 6562, 84797, 31267, 67948, 7413, 24084, 9920, 6275, 1528, 134598, 46132, 41, 1294, 3917, 17569, 3934, 6626, 70270, 101935, 148436, 6528, 5646, 2606, 1297, 183037, 38132, 8...	[ 0.116455078125, 0.199462890625, 0.2230224609375, 0.1907958984375, 0.048583984375, 0.1993408203125, 0.04864501953125, 0.113037109375, 0.2003173828125, 0.001068115234375, 0.1175537109375, 0.0003662109375, 0.1844482421875, 0.127197265625, 0.1055908203125, 0.16650390625, 0.12646484375, ...	embed
24120534_c1	24120534	prolog	1	Id's %this seems wasteful protein_reactome_Id_to_Uniprot_Id(Reactome_Id, UniprotId), % a set of facts matching two types of id %used to generate uniprot ids findall(Value, uniProt_Sample_Probes(UniprotId,X,_,Value),Vs), Vs = [_\|_], %Check list is not empty already delete(Vs,0,ListOfOnes), (ListOfOnes=[]-> (State is 0,...	Id's %this seems wasteful protein_reactome_Id_to_Uniprot_Id(Reactome_Id, UniprotId), % a set of facts matching two types of id %used to generate uniprot ids findall(Value, uniProt_Sample_Probes(UniprotId,X,_,Value),Vs), Vs = [_\|_], %Check list is not empty already delete(Vs,0,ListOfOnes), (ListOfOnes=[]-> (State is 0,...	[ -0.00153350830078125, -0.005828857421875, 0.00494384765625, 0.0106201171875, -0.0264892578125, -0.0004711151123046875, -0.00628662109375, -0.00323486328125, 0.0228271484375, -0.0283203125, -0.004150390625, 0.023681640625, 0.0036468505859375, 0.00171661376953125, 0.0169677734375, 0.0063...	[ 24799, 25, 1745, 100231, 37202, 509, 67, 7844, 21308, 1283, 44150, 282, 568, 71, 188, 85600, 18606, 4332, 47013, 13450, 11789, 10, 5423, 15824, 14858, 6626, 52895, 3447, 33740, 139392, 19844, 7413, 5584, 856, 50770, 10752, 18, 5464, 33209, ...	[ 0.1929931640625, 0.0274505615234375, 0.0836181640625, 0.1226806640625, 0.15478515625, 0.07598876953125, 0.08648681640625, 0.1422119140625, 0.2208251953125, 0.1104736328125, 0.10516357421875, 0.1177978515625, 0.10052490234375, 0.1541748046875, 0.10736083984375, 0.16748046875, 0.242431...	embed
49710365_c1	49710365	prolog	1	, 4, open). maze(small, 3, 5, open). maze(small, 3, 6, open). maze(small, 3, 7, open). maze(small, 4, 1, open). maze(small, 4, 2, barrier). maze(small, 4, 3, open). maze(small, 4, 4, open). maze(small, 4, 5, open). maze(small, 4, 6, open). maze(small, 4, 7, open). Each maze relation shown above first shows the size of ...	, 4, open). maze(small, 3, 5, open). maze(small, 3, 6, open). maze(small, 3, 7, open). maze(small, 4, 1, open). maze(small, 4, 2, barrier). maze(small, 4, 3, open). maze(small, 4, 4, open). maze(small, 4, 5, open). maze(small, 4, 6, open). maze(small, 4, 7, open). Each maze relation shown above first shows the size of ...	[ -0.005767822265625, -0.00482177734375, 0.006988525390625, 0.0146484375, 0.0172119140625, 0.0093994140625, 0.00164794921875, -0.002838134765625, 0.0140380859375, -0.00994873046875, -0.010986328125, -0.0106201171875, -0.00457763671875, -0.002288818359375, 0.009521484375, -0.0043640136718...	[ 201, 9803, 291, 731, 69070, 138, 190, 194, 305, 361, 125861, 98423, 41911, 5117, 45831, 13267, 176866, 12638, 6275, 17378, 59636, 1299, 25388, 8035, 32628, 7440, 831, 25813, 3687, 450, 18, 56136, 47, 2060, 24941, 80934, 28412, 441, 6796, ...	[ 0.15673828125, 0.1978759765625, 0.181640625, 0.26171875, 0.062744140625, 0.06658935546875, 0.0799560546875, 0.00653076171875, 0.038177490234375, 0.05474853515625, 0.2392578125, 0.0460205078125, 0.2093505859375, 0.000030517578125, 0.09210205078125, 0.09698486328125, 0.105224609375, ...	embed

39191184_c1

39191184

prolog

1

:- M #= max(X, Y). This works correctly in both cases, and can even be used in more situations: ?- integer_integer_maximum(0, 1, M), M = 0. false. ?- M = 0, integer_integer_maximum(0, 1, M). false. | ?- X in 0..2, Y in 3..4, integer_integer_maximum(X, Y, M). X in 0..2, Y in 3..4, M in 3..4 ? ; no Now the paper Coding ...

[ -0.0167236328125, 0.010009765625, 0.021484375, 0.005828857421875, 0.01300048828125, 0.0167236328125, 0.0003147125244140625, -0.005462646484375, 0.0216064453125, -0.0027008056640625, 0.016357421875, 0.003753662109375, -0.0069580078125, 0.006103515625, 0.046630859375, 0.000732421875, 0...

[ 15772, 276, 468, 1369, 18389, 1542, 4, 990, 3293, 43240, 26785, 15044, 50218, 831, 11814, 1286, 113949, 892, 1505, 6191, 192, 53950, 316, 2389, 106, 2203, 757, 98320, 1193, 23, 304, 1031, 617, 15122, 1311, 6238, 44583, 59801, 1250, 4867, ...

[ 0.091796875, 0.1817626953125, 0.1400146484375, 0.09063720703125, 0.25390625, 0.126708984375, 0.01275634765625, 0.1676025390625, 0.023529052734375, 0.1285400390625, 0.10986328125, 0.1004638671875, 0.053314208984375, 0.030029296875, 0.1177978515625, 0.0192718505859375, 0.07861328125, ...

embed

46158403_c0

46158403

prolog

0

Title: Manipulating Prolog code output Problem title: Manipulating Prolog code output Tags: prolog, clpfd Problem: Manipulating Prolog code output I am trying to run code on this page: https://swish.swi-prolog.org/example/clpfd_queens.pl in swipl on a Linux terminal. :- use_module(library(clpfd)). n_queens(N, Qs) :- le...

Manipulating Prolog code output Manipulating Prolog code output prolog clpfd Manipulating Prolog use_module n_queens safe_queens _G1470 _G1473 _G1476 _G1479 _G1470-_G1479 _G1470-_G1476 _G1470-_G1473 _G1476-_G1479 _G1473-_G1479 _G1473-_G1476 Manipulating Prolog code output I am trying to run code on this page: https://s...

[ 0.02099609375, 0.005218505859375, 0.027099609375, 0.0033416748046875, -0.00982666015625, -0.006988525390625, 0.01141357421875, -0.00469970703125, -0.0004634857177734375, -0.01409912109375, -0.004608154296875, -0.007476806640625, 0.0027008056640625, -0.004608154296875, -0.003143310546875,...

[ 221169, 26518, 1250, 4867, 18151, 140992, 502, 39557, 71, 4527, 83279, 653, 944, 1755, 46002, 2592, 5757, 13574, 11835, 22377, 128497, 31577, 11675, 9191, 114686, 2452, 3454, 11, 2424, 29908, 33949, 77168, 75101, 43240, 105801, 2396, 44084, 6...

[ 0.2320556640625, 0.1153564453125, 0.1636962890625, 0.23486328125, 0.197509765625, 0.2103271484375, 0.1053466796875, 0.044219970703125, 0.0751953125, 0.05224609375, 0.1177978515625, 0.007843017578125, 0.157958984375, 0.1392822265625, 0.1771240234375, 0.054473876953125, 0.1353759765625...

embed

21068169_c0

21068169

prolog

0

Title: Difference between 2 consecutive elements in Prolog Problem title: Difference between 2 consecutive elements in Prolog Tags: turbo-prolog, prolog Problem: Difference between 2 consecutive elements in Prolog So my problem sounds like this: Given a list of integer numbers, generate the list of permutations with th...

Difference between 2 consecutive elements in Prolog Difference between 2 consecutive elements in Prolog turbo-prolog prolog Difference Prolog perm_aux Difference between 2 consecutive elements in Prolog So my problem sounds like this: Given a list of integer numbers, generate the list of permutations with the property ...

[ -0.003875732421875, 0.01416015625, 0.0068359375, 0.00775146484375, -0.00933837890625, 0.015625, -0.0133056640625, 0.0137939453125, 0.0341796875, -0.029052734375, 0.002716064453125, 0.02001953125, 0.003082275390625, 0.0125732421875, 0.0005950927734375, 0.013671875, 0.00274658203125, ...

[ 803, 18234, 6620, 17721, 116, 148390, 80854, 23, 1250, 4867, 94779, 3454, 502, 117, 39, 10442, 2967, 102678, 5303, 892, 1505, 101935, 139392, 14311, 21094, 57266, 89931, 34292, 60212, 142424, 1295, 561, 22062, 4426, 76067, 339, 304, 109631, ...

[ 0.0941162109375, 0.1943359375, 0.012939453125, 0.1094970703125, 0.1680908203125, 0.2403564453125, 0.20849609375, 0.007476806640625, 0.1728515625, 0.2420654296875, 0.1710205078125, 0.0966796875, 0.0965576171875, 0.126708984375, 0.0843505859375, 0.19482421875, 0.0433349609375, 0.0333...

embed

40444003_c0

40444003

prolog

0

Title: (Prolog) How to find if a connection exists between 2 predicates Problem title: (Prolog) How to find if a connection exists between 2 predicates Tags: transitive-closure, prolog Problem: (Prolog) How to find if a connection exists between 2 predicates This is what I have so far. I need to show that if two statio...

(Prolog) How to find if a connection exists between 2 predicates (Prolog) How to find if a connection exists between 2 predicates transitive-closure prolog Prolog How adjacent_ (Prolog) How to find if a connection exists between 2 predicates This is what I have so far. I need to show that if two stations are connected ...

[ -0.014404296875, -0.01251220703125, 0.0257568359375, 0.0299072265625, 0.000537872314453125, 0.02294921875, -0.00982666015625, 0.0034027099609375, 0.01336669921875, -0.052734375, 0.01397705078125, 0.00811767578125, -0.0194091796875, -0.005462646484375, 0.0150146484375, 0.002670288085937...

[ 10752, 4867, 11249, 47, 7413, 2174, 10, 94878, 32316, 7, 17721, 116, 1653, 2063, 1636, 62621, 5844, 170224, 502, 1250, 123594, 16797, 2060, 3871, 7639, 6626, 29398, 162711, 1829, 50960, 12638, 3789 ]

[ 0.0833740234375, 0.1668701171875, 0.027099609375, 0.05084228515625, 0.1500244140625, 0.112548828125, 0.0164642333984375, 0.2342529296875, 0.1973876953125, 0.044677734375, 0.179931640625, 0.1419677734375, 0.15478515625, 0.1824951171875, 0.0535888671875, 0.109619140625, 0.1047973632812...

embed

46515188_c0

46515188

prolog

0

Title: Return a list from base case in Prolog Problem title: Return a list from base case in Prolog Tags: prolog Problem: Return a list from base case in Prolog I have some doubts about how Prolog works. I have this code bellow (NEW VERSION): listaPessIdade([], Lista). listaPessIdade([X|Xs], []) :- findall((X, Idade), ...

Return a list from base case in Prolog Return a list from base case in Prolog prolog base Prolog Lista Idade List Return a list from base case in Prolog I have some doubts about how Prolog works. I have this code bellow (NEW VERSION): (OLD VERSION): And I have a collection of predicates in my KB of the type: age(person...

[ 0.0126953125, 0.00848388671875, 0.0057373046875, 0.024658203125, -0.004150390625, 0.0206298828125, -0.036865234375, 0.004364013671875, 0.012939453125, -0.046630859375, 0.01007080078125, -0.00011968612670898438, -0.005889892578125, 0.01239013671875, 0.01422119140625, 0.01220703125, 0....

[ 173340, 5303, 1295, 3647, 7225, 1250, 4867, 23, 502, 50085, 87, 16018, 32036, 92814, 43240, 18151, 41566, 34237, 42486, 1653, 2063, 759, 30742, 10644, 32070, 30816, 14012, 75463, 15277, 284, 429, 154663, 3445, 123055, 16750, 29568, 959, 678, ...

[ 0.1962890625, 0.228759765625, 0.15185546875, 0.2109375, 0.2103271484375, 0.1776123046875, 0.241455078125, 0.02313232421875, 0.1231689453125, 0.1890869140625, 0.058013916015625, 0.1834716796875, 0.169189453125, 0.05426025390625, 0.09136962890625, 0.09576416015625, 0.07293701171875, ...

embed

43724301_c0

43724301

prolog

0

Title: Setting types of unbound variables in Prolog Problem title: Setting types of unbound variables in Prolog Tags: prolog-defaulty, prolog Problem: Setting types of unbound variables in Prolog I'm trying to find a way to set the type of a variable before it has been bound to a value. Unfortunately, the integer/1 pre...

Setting types of unbound variables in Prolog Setting types of unbound variables in Prolog prolog-defaulty prolog Setting Prolog get_first_int List is_int is_integer Setting types of unbound variables in Prolog I'm trying to find a way to set the type of a variable before it has been bound to a value. Unfortunately, the...

[ 0.00714111328125, 0.001953125, 0.0177001953125, 0.018798828125, -0.0230712890625, -0.00909423828125, 0.0032958984375, -0.0037994384765625, -0.0023956298828125, -0.017578125, -0.0076904296875, -0.002685546875, -0.006011962890625, 0.0074462890625, 0.029541015625, 0.0164794921875, 0.009...

[ 503, 19514, 52895, 51, 99091, 77336, 1250, 4867, 502, 214810, 53, 2046, 13448, 271, 4288, 32036, 83, 6191, 1505, 5423, 10644, 8108, 1556, 2809, 47, 34292, 892, 11583, 1653, 2063, 67, 53418, 11814, 60042, 54397, 454, 81887, 12765, 129745, ...

[ 0.1241455078125, 0.018524169921875, 0.208251953125, 0.098876953125, 0.1922607421875, 0.2474365234375, 0.14599609375, 0.2327880859375, 0.1044921875, 0.15478515625, 0.043212890625, 0.00048828125, 0.0657958984375, 0.0750732421875, 0.185546875, 0.1065673828125, 0.1217041015625, 0.13403...

embed

60886536_c0

60886536

prolog

0

Title: Prolog Programming loop through a specific fact Problem title: Prolog Programming loop through a specific fact Tags: prolog Problem: Prolog Programming loop through a specific fact I am trying to define 4 offsprings charles,andrew,ann,edward in their order of birth. offspring(andrew). offspring(ann). offspring(e...

Prolog Programming loop through a specific fact Prolog Programming loop through a specific fact prolog Prolog Programming older_than successor_first Prolog Programming loop through a specific fact I am trying to define 4 offsprings charles,andrew,ann,edward in their order of birth. I am trying to get the succession ord...

[ 0.03515625, -0.000514984130859375, 0.006500244140625, 0.0230712890625, 0.0029449462890625, -0.0081787109375, -0.006317138671875, 0.01220703125, 0.0167236328125, -0.055908203125, 0.0009613037109375, -0.0001850128173828125, -0.01806640625, -0.01312255859375, 0.0208740234375, -0.006652832...

[ 1250, 4867, 27958, 40956, 8305, 29458, 15824, 502, 114210, 21732, 39457, 42, 13448, 271, 214, 31577, 47, 61924, 201, 5773, 79832, 7, 21441, 1577, 129083, 434, 6763, 297, 19364, 12989, 127319, 2046, 206846, 7440, 11280, 2750, 621, 214493, 51...

[ 0.17919921875, 0.262939453125, 0.1934814453125, 0.2071533203125, 0.1282958984375, 0.176513671875, 0.2144775390625, 0.153076171875, 0.1968994140625, 0.176025390625, 0.2265625, 0.1243896484375, 0.12451171875, 0.0810546875, 0.0673828125, 0.09466552734375, 0.000640869140625, 0.18872070...

embed

59989349_c1

59989349

prolog

1

't know how to implement the part % go through the entire data of books defined % find the book whose name matches the user input , though I know that in a Java-like language you could write like for(int i=0; i<bookList.length;i++){ Book result = new Book(); if(bookList[i].name == Booktitle){ result = bookList[i]; } re...

[ 0.01080322265625, 0.004241943359375, 0.0162353515625, 0.00421142578125, -0.00131988525390625, 0.030029296875, 0.005401611328125, 0.0164794921875, 0.005218505859375, -0.046875, 0.019287109375, -0.01312255859375, -0.0194091796875, -0.006500244140625, 0.02685546875, 0.0078125, -0.006134...

[ 18, 3714, 3642, 29479, 2831, 1745, 738, 8305, 64194, 2053, 111, 42840, 61924, 7413, 70, 12877, 124901, 9351, 14858, 90, 38937, 107730, 6, 41925, 5062, 46876, 5809, 33022, 1884, 100, 4288, 17, 145407, 74, 14137, 154663, 23986, 14, 37223, 2...

[ 0.06976318359375, 0.07904052734375, 0.0606689453125, 0.2154541015625, 0.1883544921875, 0.1580810546875, 0.03131103515625, 0.152587890625, 0.126220703125, 0.1669921875, 0.0733642578125, 0.2271728515625, 0.155029296875, 0.1939697265625, 0.04241943359375, 0.239990234375, 0.0948486328125...

embed

30427177_c0

30427177

prolog

0

Title: How to concat two lists in Prolog Problem title: How to concat two lists in Prolog Tags: prolog Problem: How to concat two lists in Prolog I was reading a prolog code about concatenation of two lists. It works well but I cannot understand how it works : concatenation([ ], Lista, Lista). concatenation([ Elem | Li...

How to concat two lists in Prolog How to concat two lists in Prolog prolog How Prolog Lista Elem Lista1 Lista2 Lista3 Result How to concat two lists in Prolog I was reading a prolog code about concatenation of two lists. It works well but I cannot understand how it works : First I cannot understand that in the goal par...

[ 0.011962890625, 0.0126953125, 0.002166748046875, 0.00909423828125, 0.000080108642578125, 0.0189208984375, -0.025634765625, 0.0150146484375, 0.009033203125, -0.040283203125, 0.00421142578125, -0.0302734375, -0.01068115234375, 0.00072479248046875, 0.0147705078125, -0.01226806640625, 0....

[ 11249, 47, 158, 4460, 6626, 5303, 7, 23, 1250, 4867, 502, 50085, 540, 195, 304, 363, 126684, 18151, 33, 43240, 53418, 28219, 3642, 69236, 15400, 3638, 77336, 74481, 7108, 5609, 10336, 46741, 2016, 289, 195625, 8337, 11737, 12830, 720, 234...

[ 0.0648193359375, 0.00811767578125, 0.1666259765625, 0.27490234375, 0.169921875, 0.246826171875, 0.049957275390625, 0.019073486328125, 0.1685791015625, 0.2391357421875, 0.136474609375, 0.175048828125, 0.008941650390625, 0.049774169921875, 0.0283660888671875, 0.0919189453125, 0.1004638...

embed

21507372_c1

21507372

prolog

1

1 =\= X2; Y1 =\= Y2), ((X1 < Limit, X is X1 + 1, doesnt_contain(L, X, Y1), build_paths(X, Y1, X2, Y2, Limit, [[X, Y1]|L], AL)); (Y1 < Limit, Y is Y1 + 1, doesnt_contain(L, X1, Y), build_paths(X1, Y, X2, Y2, Limit, [[X1, Y]|L], AL)); (X1 > 1, X is X1 - 1, doesnt_contain(L, X, Y1), build_paths(X, Y1, X2, Y2, Limit, [[X, ...

[ -0.00616455078125, 0.02978515625, 0.00885009765625, -0.00994873046875, 0.00113677978515625, 0.00958251953125, -0.00299072265625, -0.008056640625, 0.008056640625, -0.0223388671875, 0.021240234375, -0.0002498626708984375, 0.00372314453125, 0.01458740234375, 0.020263671875, 0.007537841796...

[ 106, 2203, 1193, 304, 74, 990, 418, 1369, 10461, 1542, 4426, 125177, 83, 997, 22027, 18, 98102, 73, 866, 17727, 45367, 128405, 76172, 9804, 1723, 32149, 27781, 140992, 171859, 12989, 17137, 3611, 120067, 17475, 118, 60875, 4034, 5303, 756, ...

[ 0.1107177734375, 0.0174713134765625, 0.1285400390625, 0.1566162109375, 0.111572265625, 0.122314453125, 0.1005859375, 0.018218994140625, 0.12353515625, 0.111572265625, 0.032012939453125, 0.211181640625, 0.04815673828125, 0.126953125, 0.0831298828125, 0.0596923828125, 0.1468505859375, ...

embed

72555579_c2

72555579

prolog

2

to OutStream augment([], _). augment([row(_, ID, Name, HW1, HW2, HW3, Midterm, Final)|Rows], OutStream) :- Score is round(HW1 * 0.1 + HW2 * 0.1 + HW3 * 0.1 + Midterm * 0.3 + Final * 0.4), Grade is grade(Score), write(OutStream, ID), write(OutStream, ','), write(OutStream, Name), write(OutStream, ','), write(OutStream,...

[ 0.0205078125, 0.003936767578125, 0.00787353515625, 0.006317138671875, -0.01300048828125, -0.003631591796875, 0.0103759765625, 0.0223388671875, -0.01708984375, 0.042724609375, 0.003997802734375, -0.0235595703125, -0.0031280517578125, 0.00140380859375, -0.01611328125, -0.0172119140625, ...

[ 47, 13538, 115061, 9620, 674, 101, 194, 15555, 11338, 15757, 572, 1456, 418, 304, 363, 23166, 32166, 27188, 12724, 19725, 268, 15772, 168071, 83, 68807, 841, 661, 107754, 997, 127089, 121254, 22453, 44000, 30854, 33022, 79858, 13169, 132, 1...

[ 0.201904296875, 0.2900390625, 0.34375, 0.2303466796875, 0.2440185546875, 0.0872802734375, 0.027252197265625, 0.1988525390625, 0.1083984375, 0.0982666015625, 0.0272369384765625, 0.1197509765625, 0.0994873046875, 0.11767578125, 0.124267578125, 0.0677490234375, 0.2130126953125, 0.1962...

embed

44231680_c0

44231680

prolog

0

Title: Prolog. Nodes of a Binary Tree Problem title: Prolog. Nodes of a Binary Tree Tags: tree, prolog Problem: Prolog. Nodes of a Binary Tree Im new using Prolog and I wish you could help me. I need to get all nodes in a binary tree with a predicate called listofnodes(A4,L) . The tree A4 is made like this: [[[[[],1,[]...

Prolog. Nodes of a Binary Tree Prolog. Nodes of a Binary Tree tree prolog Prolog Nodes Binary Tree Abn Prolog. Nodes of a Binary Tree Im new using Prolog and I wish you could help me. I need to get all nodes in a binary tree with a predicate called listofnodes(A4,L) . The tree A4 is made like this: And has this form Ok...

[ 0.013427734375, 0.0023040771484375, -0.0034942626953125, 0.0010986328125, 0.002349853515625, 0.01239013671875, -0.01251220703125, 0.00701904296875, 0.007080078125, -0.05517578125, -0.0177001953125, -0.0247802734375, -0.005706787109375, -0.0009918212890625, 0.01422119140625, -0.01300048...

[ 1250, 4867, 438, 988, 111, 10, 54092, 1294, 101344, 53201, 502, 3157, 19, 3525, 17368, 32599, 5809, 4358, 3871, 2046, 756, 110, 23, 2394, 6635, 1653, 2063, 400, 36834, 157, 284, 617, 866, 62, 83, 7228, 1884, 903, 3173, 9972, 102678, 2...

[ 0.1563720703125, 0.212158203125, 0.2005615234375, 0.1817626953125, 0.1131591796875, 0.0254058837890625, 0.1885986328125, 0.1123046875, 0.216064453125, 0.2314453125, 0.1143798828125, 0.0557861328125, 0.049102783203125, 0.006622314453125, 0.05072021484375, 0.0673828125, 0.0035400390625...

embed

58785006_c0

58785006

prolog

0

Title: How is the day of the week unicorn? Problem title: How is the day of the week unicorn? Tags: prolog, zebra-puzzle Problem: How is the day of the week unicorn? Task: The Unicorn is known to lie on Mondays, Tuesdays, and Wednesdays and tells the truth on all other days of the week. He can say: “Yesterday I lied. A...

How is the day of the week unicorn? How is the day of the week unicorn? prolog zebra-puzzle How Day Tomorrow unicornLies1 Days unicornLies2 How is the day of the week unicorn? Task: The Unicorn is known to lie on Mondays, Tuesdays, and Wednesdays and tells the truth on all other days of the week. He can say: “Yesterday...

[ -0.0025634765625, -0.003875732421875, 0.0074462890625, 0.036865234375, -0.01953125, -0.00103759765625, 0.0057373046875, 0.00921630859375, -0.0036773681640625, -0.007659912109375, -0.0106201171875, 0.02783203125, -0.0169677734375, 0.00482177734375, 0.0042724609375, 0.0184326171875, -0...

[ 11249, 83, 5155, 111, 70, 5895, 60347, 42, 19, 502, 4867, 116232, 1766, 13894, 10013, 237215, 92314, 418, 97292, 304, 9598, 92, 581, 11789, 10517, 51529, 47, 28127, 98, 68318, 97001, 136, 64227, 14192, 85027, 3789, 13312, 831, 5154, 91480...

[ 0.1275634765625, 0.10400390625, 0.1910400390625, 0.193115234375, 0.08648681640625, 0.2215576171875, 0.1787109375, 0.162841796875, 0.15185546875, 0.0537109375, 0.0858154296875, 0.1141357421875, 0.00927734375, 0.0494384765625, 0.127197265625, 0.20458984375, 0.16064453125, 0.030899047...

embed

4278921_c1

4278921

prolog

1

in Prolog and trying to be a fast learner. this is the code i have tried to come up with :-dynamic(node/3). :-dynamic(way/2). % some nodes node(46315543, 52.35548, 4.84315). node(46315968, 52.35558, 4.84068). node(46315971, 52.35531, 4.84986). % predicate to add a node to a way add_node_to_way(WayID, NodeID) :- way(Wa...

[ 0.004974365234375, -0.00885009765625, 0.014892578125, 0.007354736328125, -0.008544921875, 0.00274658203125, 0.003204345703125, -0.016357421875, 0.00445556640625, -0.053955078125, 0.02099609375, -0.0213623046875, -0.0247802734375, -0.0283203125, 0.00689697265625, -0.00994873046875, 0....

[ 23, 1250, 4867, 31577, 4271, 30698, 56, 903, 18151, 17, 765, 37842, 1380, 1257, 678, 242554, 157, 112, 18113, 7514, 12477, 1745, 3060, 110, 988, 174333, 167316, 7221, 104043, 9285, 13903, 363, 62155, 16028, 5016, 178764, 1653, 2063, 67, 1...

[ 0.054595947265625, 0.1787109375, 0.273681640625, 0.055908203125, 0.046234130859375, 0.095947265625, 0.03497314453125, 0.018798828125, 0.2239990234375, 0.00750732421875, 0.010223388671875, 0.1334228515625, 0.018707275390625, 0.065673828125, 0.0263824462890625, 0.2066650390625, 0.16662...

embed

16145119_c1

16145119

prolog

1

? creep Exit: (8) nl ? creep Call: (8) printList([]) ? creep Exit: (8) printList([]) ? creep Exit: (7) printList([[2, b]]) ? creep Exit: (6) printList([[1, a], [2, b]]) ? creep true. This is quite clear for me (I think that my previous reasoning is right) but I am not understanding why whenever it reaches an element i...

[ 0.00885009765625, 0.006683349609375, -0.0089111328125, 0.0255126953125, -0.005096435546875, 0.0272216796875, -0.0026702880859375, -0.01708984375, -0.006195068359375, -0.00958251953125, 0.008544921875, -0.0172119140625, -0.0185546875, 0.01007080078125, 0.008544921875, -0.01312255859375,...

[ 705, 49512, 254, 5443, 217, 10021, 13169, 26265, 28412, 154663, 8696, 304, 876, 6791, 29568, 34735, 31635, 7108, 959, 100094, 15400, 217684, 58359, 90, 12830, 23, 70796, 5303, 11782, 41911, 98, 442, 8781, 27750, 190355, 1528, 90698, 5117, 7...

[ 0.007781982421875, 0.2388916015625, 0.204345703125, 0.1591796875, 0.1253662109375, 0.1734619140625, 0.115966796875, 0.1624755859375, 0.2181396484375, 0.260498046875, 0.049224853515625, 0.0249786376953125, 0.06158447265625, 0.049407958984375, 0.076416015625, 0.05035400390625, 0.000671...

embed

74501307_c0

74501307

prolog

0

Title: How to create an installer for a project generating PROLOG code? Problem title: How to create an installer for a project generating PROLOG code? Tags: inno-setup, java, prolog, swing Problem: How to create an installer for a project generating PROLOG code? I'm creating a project that generates a prolog file that...

How to create an installer for a project generating PROLOG code? How to create an installer for a project generating PROLOG code? inno-setup java prolog swing How PROLOG How to create an installer for a project generating PROLOG code? I'm creating a project that generates a prolog file that will be audited by swi prolo...

[ 0.01409912109375, 0.000919342041015625, -0.00201416015625, 0.00482177734375, -0.024658203125, 0.0142822265625, -0.00384521484375, -0.00787353515625, -0.003997802734375, -0.0203857421875, 0.0106201171875, -0.0050048828125, -0.007476806640625, -0.01031494140625, 0.032958984375, -0.002151...

[ 11249, 47, 28282, 142, 74022, 100, 13452, 12663, 1916, 10514, 47510, 18151, 23, 157, 3509, 2037, 79, 330, 502, 4867, 144291, 105233, 139392, 11435, 44200, 91, 2452, 17368, 10332, 3642, 831, 43824, 35125, 102158, 9969, 34759, 25842, 38937, 2...

[ 0.0948486328125, 0.02130126953125, 0.2041015625, 0.070068359375, 0.291015625, 0.06182861328125, 0.170654296875, 0.144287109375, 0.0374755859375, 0.1865234375, 0.23974609375, 0.1953125, 0.0745849609375, 0.1004638671875, 0.050872802734375, 0.0909423828125, 0.0986328125, 0.15869140625...

embed

31230913_c0

31230913

prolog

0

Title: Prolog list concat Problem title: Prolog list concat Tags: prolog Problem: Prolog list concat I am learning Prolog and I have stumbled upon this piece of code and I cannot make sense of it: Code: append([],Ys,Ys). append([X|Xs],Ys,[X|Zs]):- append(Xs, Ys, Zs). In the example, the instruction given is: Code: appe...

Prolog list concat Prolog list concat prolog Prolog _G5166 _G5112 Prolog list concat I am learning Prolog and I have stumbled upon this piece of code and I cannot make sense of it: Code: In the example, the instruction given is: Code: and the output is Ys = [1,2,3,4] And I don't understand how that happens. I understan...

[ 0.01190185546875, 0.00023365020751953125, 0.01092529296875, 0.00031280517578125, 0.00147247314453125, 0.0140380859375, -0.01312255859375, 0.0216064453125, 0.024658203125, -0.01275634765625, 0.00970458984375, -0.01519775390625, -0.0174560546875, -0.017822265625, 0.00130462646484375, 0.0...

[ 1250, 4867, 5303, 158, 4460, 502, 724, 758, 156215, 11703, 1530, 52080, 40099, 63847, 18151, 53418, 3249, 10422, 442, 28864, 27781, 188336, 140992, 83, 990, 7, 2203, 133063, 82449, 2301, 18, 28219, 96276, 142424, 98, 1193, 184750, 390, 1632...

[ 0.1619873046875, 0.226318359375, 0.172607421875, 0.119873046875, 0.1719970703125, 0.118896484375, 0.0445556640625, 0.0841064453125, 0.2279052734375, 0.1304931640625, 0.137939453125, 0.043243408203125, 0.018798828125, 0.0093994140625, 0.1395263671875, 0.055084228515625, 0.033386230468...

embed

4716245_c0

4716245

prolog

0

Title: Solving logic puzzle in Prolog Problem title: Solving logic puzzle in Prolog Tags: prolog, zebra-puzzle Problem: Solving logic puzzle in Prolog I am reading "Learn Prolog Now" and one of its exercises I haven't been able to solve myself is the following: There is a street with three neighboring houses that all h...

Solving logic puzzle in Prolog Solving logic puzzle in Prolog prolog zebra-puzzle Solving Prolog Solving logic puzzle in Prolog I am reading "Learn Prolog Now" and one of its exercises I haven't been able to solve myself is the following: Any ideas how to code it under Prolog? Thanks.

[ 0.00927734375, -0.003326416015625, 0.00067901611328125, 0.00640869140625, -0.01336669921875, 0.01263427734375, -0.0306396484375, 0.00848388671875, -0.002227783203125, -0.0299072265625, 0.00469970703125, 0.00946044921875, -0.00152587890625, -0.00555419921875, 0.0024261474609375, 0.02783...

[ 6678, 6496, 62775, 104192, 23, 1250, 4867, 502, 116232, 9, 1766, 13894, 133, 16454, 14240, 81979, 87, 38246, 18, 19048, 47, 86869, 35978, 83, 25632, 25647, 3642, 18151, 442, 1379 ]

[ 0.0972900390625, 0.0570068359375, 0.1849365234375, 0.186767578125, 0.06781005859375, 0.1617431640625, 0.2442626953125, 0.10675048828125, 0.214599609375, 0.02166748046875, 0.11212158203125, 0.12164306640625, 0.00821685791015625, 0.04058837890625, 0.0924072265625, 0.08795166015625, 0.0...

embed

37071371_c1

37071371

prolog

1

it at the moment: safe_square(Xa,Ya,X,Y,N) :- maxBound(N), adjacent(Xa,Ya,X,Y,N), safe(X,Y), move(Xa,Ya,X,Y), retract(show(L)), append([[X,Y]],L,NewL), assert(show(NewL)). move(Xa,Ya,X,Y) :- retract(square(Xa,Ya,ListFrom)), delete(ListFrom,a,Existing), retract(square(X,Y,ListTo)), append([a],ListTo,NextPositionList), ...

[ -0.020263671875, 0.01068115234375, 0.0244140625, 0.0216064453125, -0.00958251953125, 0.01123046875, 0.008544921875, 0.0181884765625, 0.017822265625, -0.0203857421875, 0.0014801025390625, 0.040283203125, -0.015380859375, -0.009033203125, 0.0030517578125, -0.0191650390625, -0.017089843...

[ 442, 99, 3095, 46002, 454, 108047, 1542, 11, 21566, 1723, 839, 15772, 18389, 12647, 7030, 123594, 16797, 25813, 41499, 15390, 31374, 866, 114689, 46568, 33657, 154663, 168407, 154109, 19279, 1419, 7763, 81280, 7192, 172, 237, 711, 418, 647, ...

[ 0.107177734375, 0.138671875, 0.148193359375, 0.24658203125, 0.01226806640625, 0.26318359375, 0.1087646484375, 0.0745849609375, 0.176025390625, 0.0986328125, 0.09130859375, 0.05133056640625, 0.1734619140625, 0.07257080078125, 0.1634521484375, 0.1162109375, 0.1685791015625, 0.1309814...

embed

13786024_c0

13786024

prolog

0

Title: output when all possibilities have been searched in the search tree in the prolog Problem title: output when all possibilities have been searched in the search tree in the prolog Tags: prolog Problem: output when all possibilities have been searched in the search tree in the prolog I have written the following p...

output when all possibilities have been searched in the search tree in the prolog output when all possibilities have been searched in the search tree in the prolog prolog CSE1 DIC CVIP output when all possibilities have been searched in the search tree in the prolog I have written the following program for verifying if...

[ 0.01318359375, -0.000019431114196777344, 0.00323486328125, 0.0247802734375, -0.0135498046875, 0.000469207763671875, 0.0108642578125, -0.017822265625, -0.009521484375, 0.020263671875, 0.00946044921875, 0.00102996826171875, 0.000904083251953125, -0.00003886222839355469, 0.003875732421875, ...

[ 140992, 3229, 756, 97370, 2449, 765, 33938, 53201, 502, 4867, 2809, 297, 23, 9127, 418, 138943, 163175, 59121, 1528, 493, 151138, 2174, 9836, 58735, 294, 1556, 75204, 44000, 284, 28368, 8337, 9774, 60875, 151575, 69307, 959, 59226, 1653, 20...

[ 0.2340087890625, 0.085693359375, 0.161865234375, 0.2340087890625, 0.1668701171875, 0.035308837890625, 0.2037353515625, 0.2318115234375, 0.1444091796875, 0.2279052734375, 0.0306549072265625, 0.029266357421875, 0.028228759765625, 0.08209228515625, 0.0166168212890625, 0.04437255859375, ...

embed

40427006_c0

40427006

prolog

0

Title: gprolog error for default functions: error(existence_error... Problem title: gprolog error for default functions: error(existence_error... Tags: gnu-prolog, prolog Problem: gprolog error for default functions: error(existence_error... I keep running into an existence error for many different default functions in...

gprolog error for default functions: error(existence_error... gprolog error for default functions: error(existence_error... gnu-prolog prolog existence_error top_level g_assign GVarName instantiation_error b_setval List gprolog error for default functions: error(existence_error... I keep running into an existence error...

[ 0.021240234375, 0.0150146484375, -0.001983642578125, 0.0034027099609375, 0.00101470947265625, 0.0029449462890625, -0.006683349609375, -0.00433349609375, 0.0087890625, -0.026611328125, 0.0208740234375, 0.0035247802734375, 0.000690460205078125, -0.00061798095703125, 0.0263671875, 0.00121...

[ 706, 3454, 4867, 18499, 100, 114977, 32354, 132, 116311, 188800, 104155, 502, 2663, 67919, 162, 31304, 527, 81827, 163612, 34648, 876, 3509, 1405, 32036, 13695, 51042, 3934, 5941, 12921, 3871, 20600, 9844, 37076, 179769, 61924, 7964, 77336, 2...

[ 0.10009765625, 0.186279296875, 0.2200927734375, 0.203125, 0.027008056640625, 0.2340087890625, 0.1710205078125, 0.057891845703125, 0.224853515625, 0.2301025390625, 0.14892578125, 0.1568603515625, 0.04437255859375, 0.0631103515625, 0.01300048828125, 0.1287841796875, 0.017059326171875, ...

embed

13220883_c0

13220883

prolog

0

Title: Process List in Prolog Problem title: Process List in Prolog Tags: prolog, list, wumpus-world Problem: Process List in Prolog I'm having trouble using lists in Prolog. I am implementing a Wumpus World example and need to move the wumpus during each user movement. The movement for the wumpus is predefined in a li...

Process List in Prolog Process List in Prolog prolog list wumpus-world Process List Prolog CheckX CheckY Process List in Prolog I'm having trouble using lists in Prolog. I am implementing a Wumpus World example and need to move the wumpus during each user movement. The movement for the wumpus is predefined in a list, a...

[ 0.01470947265625, 0.0003566741943359375, -0.0159912109375, 0.034912109375, -0.036376953125, 0.022705078125, -0.0033416748046875, -0.002655029296875, 0.003387451171875, -0.0177001953125, -0.004791259765625, 0.040771484375, -0.027099609375, -0.008056640625, -0.009033203125, 0.00799560546...

[ 123996, 32036, 1250, 4867, 23, 502, 5303, 148, 316, 7332, 32554, 38679, 1542, 1723, 63134, 17368, 7, 29479, 601, 6661, 27781, 25813, 20271, 12638, 38937, 112664, 1653, 13, 5983, 6528, 3642, 7426, 5773, 10336, 5423, 31913, 2806, 186, 133, ...

[ 0.2330322265625, 0.23681640625, 0.171630859375, 0.2445068359375, 0.0396728515625, 0.120849609375, 0.250732421875, 0.063232421875, 0.1383056640625, 0.2117919921875, 0.1500244140625, 0.1585693359375, 0.1268310546875, 0.1416015625, 0.119384765625, 0.0675048828125, 0.0726318359375, 0.0...

embed

30862098_c0

30862098

prolog

0

Title: prolog misunderstanding. Split list into two list with even and odd positions. where is my mistake? Problem title: prolog misunderstanding. Split list into two list with even and odd positions. where is my mistake? Tags: list, split, prolog Problem: prolog misunderstanding. Split list into two list with even and...

prolog misunderstanding. Split list into two list with even and odd positions. where is my mistake? prolog misunderstanding. Split list into two list with even and odd positions. where is my mistake? list split prolog Split List Odd Even Oddlist Evenlist prolog misunderstanding. Split list into two list with even and o...

[ -0.00058746337890625, 0.017333984375, 0.004913330078125, -0.00130462646484375, -0.0234375, 0.03369140625, -0.0107421875, 0.0208740234375, 0.01263427734375, 0.0145263671875, 0.027099609375, -0.0052490234375, -0.00628662109375, 0.0213623046875, 0.0101318359375, 0.01336669921875, 0.0288...

[ 502, 4867, 1239, 24658, 144057, 46474, 5303, 3934, 6626, 678, 3853, 136, 70270, 19069, 7440, 83, 759, 121742, 65450, 32036, 67948, 31267, 6562, 31577, 3789, 88, 195, 58387, 27060, 116153, 29806, 48903, 1658, 28219, 4734, 30646, 966, 2681, 4...

[ 0.1544189453125, 0.197021484375, 0.06292724609375, 0.12890625, 0.10546875, 0.221435546875, 0.2208251953125, 0.112060546875, 0.1556396484375, 0.05023193359375, 0.194091796875, 0.0357666015625, 0.20166015625, 0.1573486328125, 0.0677490234375, 0.0009765625, 0.0249786376953125, 0.18713...

embed

32827699_c0

32827699

prolog

0

Title: Implement a Prolog program to verify whether primitive expressions are type-correct Problem title: Implement a Prolog program to verify whether primitive expressions are type-correct Tags: prolog Problem: Implement a Prolog program to verify whether primitive expressions are type-correct Input format: The first ...

Implement a Prolog program to verify whether primitive expressions are type-correct Implement a Prolog program to verify whether primitive expressions are type-correct prolog Implement Prolog is_correct Implement a Prolog program to verify whether primitive expressions are type-correct Input format: The first term in t...

[ 0.01080322265625, 0.005706787109375, 0.024169921875, 0.03515625, -0.005859375, 0.0145263671875, -0.01263427734375, 0.006439208984375, 0.00634765625, -0.0189208984375, 0.0205078125, -0.00726318359375, 0.004150390625, -0.0013275146484375, 0.004241943359375, 0.0118408203125, 0.023071289...

[ 153941, 1250, 4867, 1528, 47, 493, 40383, 36766, 128489, 13, 125195, 7, 621, 10644, 9, 32399, 15390, 502, 83, 360, 7077, 9384, 5117, 13579, 79986, 5303, 12638, 1614, 6562, 8035, 3173, 21690, 2886, 50986, 17932, 80854, 69407, 71864, 169463, ...

[ 0.2449951171875, 0.2115478515625, 0.279052734375, 0.195556640625, 0.0111083984375, 0.158935546875, 0.152587890625, 0.08538818359375, 0.2352294921875, 0.1044921875, 0.248046875, 0.0275115966796875, 0.09820556640625, 0.2215576171875, 0.048309326171875, 0.1976318359375, 0.0216064453125,...

embed

42819814_c0

42819814

prolog

0

Title: Prolog: removing all elements that occur in list A from list B Problem title: Prolog: removing all elements that occur in list A from list B Tags: list, predicate, prolog Problem: Prolog: removing all elements that occur in list A from list B I'm trying to define a predicate "delete(L1, L2, L3)" that is valid wh...

Prolog: removing all elements that occur in list A from list B Prolog: removing all elements that occur in list A from list B list predicate prolog list Prolog Prolog: removing all elements that occur in list A from list B I'm trying to define a predicate "delete(L1, L2, L3)" that is valid when L3 equals L2 minus any o...

[ -0.0179443359375, 0.0198974609375, -0.000637054443359375, 0.010986328125, -0.01324462890625, 0.01446533203125, 0.00677490234375, -0.007476806640625, 0.005889892578125, 0.00127410888671875, 0.0184326171875, 0.005889892578125, -0.0009307861328125, -0.004638671875, -0.006256103515625, 0.0...

[ 1250, 4867, 49146, 6496, 756, 80854, 74918, 5303, 62, 1295, 335, 12, 23, 1653, 2063, 502, 31577, 61924, 67, 8520, 866, 418, 339, 304, 21320, 35604, 363, 105950, 26948, 70541, 154109, 132, 25256, 155761, 1193, 2806, 51, 40383, 100, 2203, ...

[ 0.195556640625, 0.257080078125, 0.141357421875, 0.1142578125, 0.10888671875, 0.1781005859375, 0.14453125, 0.148193359375, 0.0968017578125, 0.10284423828125, 0.1014404296875, 0.008544921875, 0.024383544921875, 0.1767578125, 0.2147216796875, 0.15234375, 0.062255859375, 0.147094726562...

embed

54559532_c0

54559532

prolog

0

Title: Putting SWI-Prolog's JPL interface to work Problem title: Putting SWI-Prolog's JPL interface to work Tags: prolog, swi-prolog, java, jpl Problem: Putting SWI-Prolog's JPL interface to work I want to use JPL to create a graphic interface to my project, so I went and searched a code example to start work...

Putting SWI-Prolog's JPL interface to work Putting SWI-Prolog's JPL interface to work prolog swi-prolog java jpl Putting SWI-Prolog JPL ERROR jpl.pl:4243 open_shared_object Initialization Please java.dll PATH User system.pl:4 Exported jpl:jpl_c_lib_version Undefined jpl:jni_func JFrame _10490 jpl:jFindClass _...

[ 0.00970458984375, 0.0194091796875, -0.0019989013671875, 0.016845703125, -0.012939453125, 0.00701904296875, -0.01226806640625, -0.007781982421875, 0.0194091796875, -0.04150390625, -0.00176239013671875, -0.00738525390625, -0.015380859375, -0.01165771484375, 0.0174560546875, 0.00677490234...

[ 19577, 1916, 159, 38969, 9, 10752, 4867, 3768, 821, 21130, 101758, 47, 4488, 502, 2452, 3454, 79, 330, 1647, 2424, 151206, 24638, 5, 33529, 11548, 9803, 67886, 71, 454, 187694, 360, 1890, 289, 30607, 1181, 436, 139909, 5426, 617, 134456, ...

[ 0.133544921875, 0.05487060546875, 0.1075439453125, 0.273193359375, 0.0276031494140625, 0.1727294921875, 0.208251953125, 0.08837890625, 0.1552734375, 0.273681640625, 0.2437744140625, 0.0670166015625, 0.150390625, 0.1241455078125, 0.223388671875, 0.143310546875, 0.154541015625, 0.236...

embed

49518852_c0

49518852

prolog

0

Title: Finding permutations of a list using insertion of element in Prolog Problem title: Finding permutations of a list using insertion of element in Prolog Tags: prolog Problem: Finding permutations of a list using insertion of element in Prolog For an assignment I'm asked to define a permutation function in two diff...

Finding permutations of a list using insertion of element in Prolog Finding permutations of a list using insertion of element in Prolog prolog insertion Finding Prolog L2-L1 Finding permutations of a list using insertion of element in Prolog For an assignment I'm asked to define a permutation function in two different ...

[ -0.0098876953125, 0.01226806640625, 0.013671875, -0.0059814453125, -0.024169921875, 0.014404296875, -0.0458984375, -0.0162353515625, 0.01116943359375, -0.039306640625, 0.00982666015625, 0.004150390625, -0.0000820159912109375, -0.0194091796875, -0.01348876953125, 0.0191650390625, 0.00...

[ 26040, 117, 14311, 21094, 5303, 17368, 241860, 111, 12830, 1250, 4867, 502, 339, 18504, 866, 418, 95486, 37170, 61924, 561, 22062, 32354, 6626, 12921, 48322, 4527, 154109, 1542, 10461, 29568, 32920, 304, 183540, 2060, 26818, 20697, 145823, 43...

[ 0.1300048828125, 0.15283203125, 0.2425537109375, 0.1143798828125, 0.1617431640625, 0.03497314453125, 0.2042236328125, 0.023193359375, 0.1734619140625, 0.1622314453125, 0.233154296875, 0.1234130859375, 0.0574951171875, 0.126953125, 0.07080078125, 0.066650390625, 0.08746337890625, 0....

embed

23207576_c1

23207576

prolog

1

it. For example in ECLiPSe CLP: :- lib(ic). solve(Vars, Ineqs, Result) :- Vars :: 0..9, ( foreach((A, B), Ineqs) do A #< B ), labeling(Vars), concat_string(Vars, Result). [eclipse]: Vars = [__, ___, __, ___], Ineqs = [(__, ___)], solve(Vars, Ineqs, Result). Vars = [0, 1, 0, 1] __ = 0 ___ = 1 Ineqs = [(0, 1)] Result = ...

[ 0.0079345703125, -0.0091552734375, -0.0042724609375, 0.0272216796875, -0.019287109375, 0.0240478515625, -0.01446533203125, 0.007293701171875, 0.0045166015625, -0.02880859375, 0.00555419921875, -0.0003757476806640625, 0.01611328125, 0.0260009765625, 0.004974365234375, 0.01397705078125, ...

[ 442, 27781, 59947, 9506, 9059, 13, 313, 37352, 25474, 1771, 86869, 81827, 7, 360, 864, 126684, 3323, 1984, 757, 1126, 100, 41581, 335, 54, 16093, 67967, 158, 4460, 91693, 106371, 116185, 2203, 2389, 106, 4879, 76327, 418, 9077, 3642, 2046...

[ 0.18408203125, 0.099609375, 0.085693359375, 0.1312255859375, 0.1065673828125, 0.129150390625, 0.0032958984375, 0.1741943359375, 0.1336669921875, 0.0897216796875, 0.16064453125, 0.20654296875, 0.15185546875, 0.1619873046875, 0.214599609375, 0.2008056640625, 0.2568359375, 0.057556152...

embed

57740302_c1

57740302

prolog

1

b, acc|...] My first implementation is different, but I can't make it work on any case. letter(X) :- member(X, [a, b, c]). generateWord(0, []) :- !. generateWord(N, [H|T]) :- letter(H), NextN is N - 1, generateWord(NextN, T), !. generateAtomicWord(N, Word) :- generateWord(N, WList), atomic_list_concat(WList, Word). max...

[ 0.0037384033203125, 0.0040283203125, 0.003997802734375, 0.017822265625, -0.013916015625, 0.0225830078125, 0.00299072265625, -0.0169677734375, 0.01611328125, -0.056396484375, -0.004974365234375, 0.017578125, 0.001434326171875, 0.01361083984375, -0.004364013671875, 0.000446319580078125, ...

[ 876, 50015, 58745, 75606, 5117, 208124, 12921, 831, 18, 3249, 442, 4488, 2499, 7225, 31330, 1542, 15772, 32786, 501, 139392, 164805, 2389, 711, 839, 841, 618, 4997, 83, 541, 106, 81280, 384, 12078, 22543, 601, 154663, 34627, 6562, 2271, 4...

[ 0.139892578125, 0.1500244140625, 0.076171875, 0.09063720703125, 0.0751953125, 0.203369140625, 0.144287109375, 0.0753173828125, 0.07171630859375, 0.04290771484375, 0.007843017578125, 0.1064453125, 0.002655029296875, 0.095947265625, 0.1856689453125, 0.113525390625, 0.0310211181640625, ...

embed

70596545_c0

70596545

prolog

0

Title: Drop out the N-th element from a list and display its value in a variable Problem title: Drop out the N-th element from a list and display its value in a variable Tags: prolog Problem: Drop out the N-th element from a list and display its value in a variable I have a predicate drop_at(X, L, N, R) which should dr...

Drop out the N-th element from a list and display its value in a variable Drop out the N-th element from a list and display its value in a variable prolog a Drop N-th drop_at P-1 Drop out the N-th element from a list and display its value in a variable I have a predicate drop_at(X, L, N, R) which should drop out the N-...

[ -0.007659912109375, 0.010498046875, -0.004638671875, -0.0189208984375, -0.020751953125, 0.02197265625, 0.0052490234375, -0.00634765625, 0.00018215179443359375, -0.01220703125, 0.0225830078125, -0.006439208984375, -0.0225830078125, -0.01239013671875, 0.012451171875, 0.0230712890625, 0...

[ 130403, 1810, 541, 9, 927, 12830, 1295, 5303, 44116, 34292, 77336, 502, 4867, 36069, 257, 436, 5759, 23, 1653, 2063, 1542, 339, 627, 1193, 99091, 34648, 18632, 5809, 29479, 15044, 10366, 20802, 33770, 47, 154109, 653, 17368, 903, 8, 74635...

[ 0.177978515625, 0.1641845703125, 0.2081298828125, 0.050811767578125, 0.179443359375, 0.1708984375, 0.055908203125, 0.1392822265625, 0.1434326171875, 0.140625, 0.2320556640625, 0.1148681640625, 0.1563720703125, 0.1611328125, 0.0880126953125, 0.04730224609375, 0.0997314453125, 0.0071...

embed

41847580_c1

41847580

prolog

1

(wa,bakerloo). station(em,northern). station(eu,northern). station(ke,northern). station(tc,northern). station(ws,northern). %adjecent stations % % Central line adjacent(nh,lg,central,4). adjacent(lg,oc,central,4). adjacent(oc,tc,central,4). adjacent(tc,cl,central,4). adjacent(cl,ls,central,4). adjacent(ls,bg,central,4...

[ -0.0213623046875, -0.006378173828125, 0.0220947265625, 0.010986328125, -0.003631591796875, 0.0032501220703125, 0.01068115234375, 0.0078125, 0.0014495849609375, -0.01300048828125, -0.022216796875, 0.0206298828125, -0.01904296875, -0.0081787109375, -0.0003147125244140625, -0.019165039062...

[ 15, 634, 4, 10075, 56, 47673, 194, 29398, 195, 13665, 9319, 19, 4615, 350, 238, 19725, 1745, 14963, 16797, 15881, 13315, 123594, 6457, 14686, 58905, 29557, 6652, 31485, 16777, 3267, 686, 21605, 13333, 425, 182688, 115364, 289, 8080, 74132, ...

[ 0.058624267578125, 0.2122802734375, 0.0153045654296875, 0.1195068359375, 0.142333984375, 0.265380859375, 0.08154296875, 0.2181396484375, 0.1195068359375, 0.0921630859375, 0.10009765625, 0.028961181640625, 0.0970458984375, 0.07470703125, 0.0560302734375, 0.078369140625, 0.067260742187...

embed

56241542_c0

56241542

prolog

0

Title: Prolog Create Dictionaries Problem title: Prolog Create Dictionaries Tags: data-generation, swi-prolog, prolog, functional-programming Problem: Prolog Create Dictionaries I understand that Prolog is not an object-oriented language, and after reading a few StackOverflow posts, it is not clear to me that this is f...

Prolog Create Dictionaries Prolog Create Dictionaries data-generation swi-prolog prolog functional-programming Prolog Create Dictionaries Customer Customer.age Customer.name What Wot Prolog Create Dictionaries I understand that Prolog is not an object-oriented language, and after reading a few StackOverflow posts, it i...

[ 0.0260009765625, -0.0115966796875, 0.00897216796875, 0.0014495849609375, 0.001251220703125, 0.0150146484375, -0.0155029296875, 0.005767822265625, 0.01611328125, -0.0206298828125, 0.0081787109375, 0.00775146484375, 0.0078125, -0.005157470703125, 0.037109375, -0.004730224609375, -0.001...

[ 1250, 4867, 151313, 67437, 2053, 48281, 2452, 3454, 502, 123309, 28966, 124765, 4588, 11627, 28219, 959, 36746, 49133, 46876, 156673, 118664, 34735, 3820, 11, 55356, 26458, 4263, 1556, 4734, 9351, 2832, 79315, 32070, 6191, 7722, 8337, 27781, ...

[ 0.1571044921875, 0.244384765625, 0.20947265625, 0.24560546875, 0.080322265625, 0.0845947265625, 0.11328125, 0.10205078125, 0.1002197265625, 0.102294921875, 0.075927734375, 0.254150390625, 0.11328125, 0.1170654296875, 0.0380859375, 0.01361083984375, 0.13134765625, 0.0750732421875, ...

embed

68218135_c0

68218135

prolog

0

Title: Monkey and banana solution doesn't stop after grabbing the banana (Prolog) Problem title: Monkey and banana solution doesn't stop after grabbing the banana (Prolog) Tags: prolog Problem: Monkey and banana solution doesn't stop after grabbing the banana (Prolog) I have this code to represent the famous ...

Monkey and banana solution doesn't stop after grabbing the banana (Prolog) Monkey and banana solution doesn't stop after grabbing the banana (Prolog) prolog Monkey Prolog Pos Has State State1 Move State2 Monkey and banana solution doesn't stop after grabbing the banana (Prolog) I have this code to represent t...

[ 0.008056640625, 0.0223388671875, 0.00714111328125, 0.0299072265625, -0.0230712890625, 0.025146484375, -0.00567626953125, -0.006988525390625, 0.0013885498046875, -0.0257568359375, 0.012939453125, 0.01416015625, -0.01904296875, 0.0068359375, 0.00653076171875, 0.0299072265625, 0.0051574...

[ 213289, 136, 134399, 29806, 22027, 3768, 18, 7279, 7103, 59102, 23709, 10752, 4867, 502, 1250, 13498, 20625, 22836, 418, 135828, 304, 70, 903, 18151, 33636, 170277, 2667, 19770, 2967, 185688, 31635, 159029, 86869, 678, 61475, 11341, 30646, 7,...

[ 0.1956787109375, 0.170166015625, 0.20849609375, 0.188232421875, 0.026641845703125, 0.020904541015625, 0.04608154296875, 0.1396484375, 0.08935546875, 0.1566162109375, 0.08355712890625, 0.1044921875, 0.194580078125, 0.093994140625, 0.1363525390625, 0.1629638671875, 0.019775390625, 0....

embed

37284969_c0

37284969

prolog

0

Title: Prolog: a rule containing assert adds only first result to facts Problem title: Prolog: a rule containing assert adds only first result to facts Tags: sicstus-prolog, prolog, prolog-assert Problem: Prolog: a rule containing assert adds only first result to facts I'm trying to precompute some stuff and save the r...

Prolog: a rule containing assert adds only first result to facts Prolog: a rule containing assert adds only first result to facts sicstus-prolog prolog prolog-assert Prolog Cost assert_all Prolog: a rule containing assert adds only first result to facts I'm trying to precompute some stuff and save the results as facts ...

[ 0.027587890625, 0.0019989013671875, 0.01251220703125, 0.030029296875, -0.00250244140625, 0.00457763671875, -0.0186767578125, 0.0294189453125, 0.0126953125, -0.0284423828125, 0.00860595703125, 0.007568359375, -0.01904296875, 0.004150390625, 0.0245361328125, 0.0010986328125, 0.01324462...

[ 1250, 4867, 79986, 70541, 214, 237, 33657, 15190, 4734, 5117, 16750, 47, 15824, 26536, 18253, 3454, 502, 162, 63099, 5584, 10, 31577, 118562, 65970, 41884, 30098, 50339, 86595, 1528, 116120, 18151, 11034, 73419, 16865, 75463, 11435, 159, 1021...

[ 0.1915283203125, 0.26416015625, 0.21142578125, 0.1241455078125, 0.0640869140625, 0.1065673828125, 0.25830078125, 0.1700439453125, 0.0906982421875, 0.14306640625, 0.2227783203125, 0.0833740234375, 0.173095703125, 0.05108642578125, 0.1708984375, 0.06390380859375, 0.1051025390625, 0.0...

embed

43333614_c0

43333614

prolog

0

Title: Prolog - Constraint Library - Variable Scope Problem title: Prolog - Constraint Library - Variable Scope Tags: prolog, clpfd Problem: Prolog - Constraint Library - Variable Scope I'm working on trying to solve an LSAT logic problem with Prolog. I'm trying to get Prolog to tell me whether possible values for acto...

Prolog - Constraint Library - Variable Scope Prolog - Constraint Library - Variable Scope prolog clpfd Prolog Constraint Library Variable Scope use_module Jeff Rich Prolog - Constraint Library - Variable Scope I'm working on trying to solve an LSAT logic problem with Prolog. I'm trying to get Prolog to tell me whether ...

[ 0.00616455078125, 0.0189208984375, -0.00921630859375, 0.026611328125, 0.0093994140625, 0.0032958984375, 0.007293701171875, 0.0220947265625, -0.004547119140625, -0.0208740234375, 0.01220703125, -0.0125732421875, 0.0072021484375, 0.02197265625, 0.0281982421875, -0.00872802734375, -0.00...

[ 1250, 4867, 1657, 2816, 4288, 103835, 84572, 2886, 182783, 502, 39557, 71, 4527, 83279, 101681, 52774, 13, 20697, 86869, 339, 65727, 62775, 2967, 14192, 7722, 142424, 39329, 13315, 35604, 54397, 25632, 41, 1294, 7108, 4426, 3501, 757, 53418, ...

[ 0.139404296875, 0.243408203125, 0.03680419921875, 0.1591796875, 0.043975830078125, 0.1865234375, 0.128662109375, 0.1051025390625, 0.1107177734375, 0.05078125, 0.00823974609375, 0.02008056640625, 0.04205322265625, 0.0897216796875, 0.260986328125, 0.259765625, 0.008026123046875, 0.01...

embed

1786365_c0

1786365

prolog

0

Title: Compute a list of distinct odd numbers (if one exists), such that their sum is equal to a given number Problem title: Compute a list of distinct odd numbers (if one exists), such that their sum is equal to a given number Tags: prolog, constraints, clpfd Problem: Compute a list of distinct odd numbers (if one exi...

Compute a list of distinct odd numbers (if one exists), such that their sum is equal to a given number Compute a list of distinct odd numbers (if one exists), such that their sum is equal to a given number prolog constraints clpfd Compute use_module Num Counter NewN InputList TempL Compute a list of distinct odd number...

[ -0.0155029296875, -0.00160980224609375, 0.0177001953125, -0.006561279296875, 0.006805419921875, 0.00811767578125, -0.0198974609375, 0.022216796875, 0.0274658203125, -0.0322265625, -0.0032501220703125, -0.0203857421875, 0.021240234375, 0.013427734375, 0.006439208984375, 0.021484375, 0...

[ 159415, 13, 5303, 117781, 70270, 101935, 3190, 32316, 6044, 2363, 10554, 105950, 47, 34475, 14012, 111, 1632, 502, 4867, 158, 2816, 4288, 33139, 39557, 71, 4527, 83279, 52782, 197956, 2356, 839, 360, 7077, 154663, 37446, 866, 83, 759, 18151...

[ 0.224609375, 0.049560546875, 0.1710205078125, 0.1937255859375, 0.2401123046875, 0.19677734375, 0.0750732421875, 0.157470703125, 0.054351806640625, 0.0301055908203125, 0.1925048828125, 0.1490478515625, 0.0841064453125, 0.08013916015625, 0.1260986328125, 0.021026611328125, 0.0249481201...

embed

34485686_c0

34485686

prolog

0

Title: current_predicate/1 does not work with :- dynamic? Problem title: current_predicate/1 does not work with :- dynamic? Tags: swi-prolog, prolog, prolog-directive-dynamic Problem: current_predicate/1 does not work with :- dynamic? I have some predicates that I define using asserts in Prolog. I am using current_pred...

current_predicate/1 does not work with :- dynamic? current_predicate/1 does not work with :- dynamic? swi-prolog prolog prolog-directive-dynamic assert/1 current_predicate Warning Name Arity current_predicate/1 does not work with :- dynamic? I have some predicates that I define using asserts in Prolog. I am using curre...

[ 0.00836181640625, 0.000576019287109375, 0.0238037109375, 0.032958984375, -0.01507568359375, 0.02685546875, 0.015380859375, 0.0240478515625, -0.00799560546875, -0.043701171875, 0.00179290771484375, 0.0245361328125, -0.021728515625, -0.0115966796875, 0.0167236328125, 0.0213623046875, 0...

[ 43581, 19714, 2063, 67, 11583, 959, 4488, 678, 84079, 91, 2452, 3454, 4867, 502, 936, 100034, 242554, 237, 33657, 5550, 592, 15757, 1172, 2481, 1653, 1636, 61924, 1250, 17368, 3714, 11675, 1632, 34292, 16865, 2424, 13695, 186992, 49814, 411...

[ 0.25439453125, 0.2203369140625, 0.2021484375, 0.0894775390625, 0.1812744140625, 0.11328125, 0.145751953125, 0.1494140625, 0.2454833984375, 0.025054931640625, 0.171142578125, 0.128662109375, 0.1981201171875, 0.11279296875, 0.0633544921875, 0.05517578125, 0.1611328125, 0.0634765625, ...

embed

30444443_c0

30444443

prolog

0

Title: In SWI-Prolog, how to transform, convert, mutate, evolute, change a set list [ 1, ( 2, 3 ) ] to [ 1, 2, 3 ]? Problem title: In SWI-Prolog, how to transform, convert, mutate, evolute, change a set list [ 1, ( 2, 3 ) ] to [ 1, 2, 3 ]? Tags: prolog, swi-prolog Problem: In SWI-Prolog, how to transform, convert, muta...

In SWI-Prolog, how to transform, convert, mutate, evolute, change a set list [ 1, ( 2, 3 ) ] to [ 1, 2, 3 ]? In SWI-Prolog, how to transform, convert, mutate, evolute, change a set list [ 1, ( 2, 3 ) ] to [ 1, 2, 3 ]? prolog swi-prolog SWI-Prolog Input Folks database.pl.pl Predic Inform Name Bussi Juc Rockstar Desprogr...

[ 0.0096435546875, -0.006866455078125, 0.00970458984375, 0.0267333984375, 0.0003108978271484375, 0.0172119140625, -0.007781982421875, 0.00830078125, 0.00555419921875, -0.02685546875, 0.023193359375, 0.0244140625, -0.021728515625, 0.00131988525390625, 0.007293701171875, -0.005706787109375...

[ 159, 38969, 9, 10752, 4867, 3642, 47, 27198, 96760, 31158, 13, 20749, 67, 15549, 5423, 5303, 106, 116, 138, 502, 91, 2452, 3454, 360, 7077, 36854, 63399, 2424, 7145, 1771, 29833, 15757, 132461, 14, 3314, 238, 14434, 5613, 5581, 75620, 2...

[ 0.08935546875, 0.2269287109375, 0.021453857421875, 0.136474609375, 0.2119140625, 0.10711669921875, 0.0297698974609375, 0.260986328125, 0.2159423828125, 0.16650390625, 0.10357666015625, 0.18798828125, 0.1339111328125, 0.2052001953125, 0.1925048828125, 0.2320556640625, 0.091064453125, ...

embed

41065806_c0

41065806

prolog

0

Title: All subsets of collinear points - Prolog Problem title: All subsets of collinear points - Prolog Tags: backtracking, points, prolog Problem: All subsets of collinear points - Prolog I am trying to make a backtracking program in Prolog to determine all subsets of collinear points. The problem: Are given n points ...

All subsets of collinear points - Prolog All subsets of collinear points - Prolog backtracking points prolog All Prolog All subsets of collinear points - Prolog I am trying to make a backtracking program in Prolog to determine all subsets of collinear points. The problem: Are given n points in a plan (represented using...

[ 0.017333984375, -0.007354736328125, 0.01214599609375, 0.00732421875, -0.0242919921875, 0.004608154296875, 0.0157470703125, 0.0024261474609375, 0.0081787109375, -0.0235595703125, 0.014404296875, -0.00860595703125, -0.007720947265625, -0.0206298828125, -0.00750732421875, 0.009521484375, ...

[ 3164, 1614, 3509, 61770, 86, 147, 26847, 1250, 4867, 4420, 125728, 214, 502, 31577, 1528, 23, 83324, 756, 2967, 34475, 653, 1774, 55247, 176866, 18781, 1653, 2063, 89536, 360, 76172, 63527, 116574, 136555, 145180, 1662, 13538, 175199, 2174, ...

[ 0.1177978515625, 0.15283203125, 0.216064453125, 0.2135009765625, 0.17333984375, 0.2144775390625, 0.2099609375, 0.1116943359375, 0.2125244140625, 0.1273193359375, 0.207763671875, 0.0843505859375, 0.066162109375, 0.0257110595703125, 0.0963134765625, 0.002410888671875, 0.1185302734375, ...

embed

53814478_c1

53814478

prolog

1

[ -0.0205078125, 0.004913330078125, 0.0272216796875, 0.01318359375, 0.005096435546875, 0.0025177001953125, -0.04736328125, -0.01123046875, 0.00390625, 0.0025177001953125, 0.018310546875, 0.040283203125, -0.00131988525390625, 0.0181884765625, -0.01177978515625, -0.004913330078125, 0.002...

[ 15, 1065, 268, 4, 133063, 82449, 104629, 16, 194, 35604, 132, 101, 841, 58745, 454, 1193, 15772, 4426, 572, 5, 15549, 135206, 13, 7, 284, 618, 76172, 384, 304, 21320, 91, 418, 90173, 62, 247, 96386, 363, 571, 378 ]

[ 0.07275390625, 0.08251953125, 0.060302734375, 0.0633544921875, 0.198974609375, 0.232666015625, 0.260498046875, 0.009429931640625, 0.0860595703125, 0.3046875, 0.0887451171875, 0.0758056640625, 0.1798095703125, 0.06585693359375, 0.05169677734375, 0.187744140625, 0.1175537109375, 0.19...

embed

41748822_c0

41748822

prolog

0

Title: Prolog rule to find which stations are on a particular Underground line Problem title: Prolog rule to find which stations are on a particular Underground line Tags: prolog Problem: Prolog rule to find which stations are on a particular Underground line I'm currently trying to answer a segment for a piece of cour...

Prolog rule to find which stations are on a particular Underground line Prolog rule to find which stations are on a particular Underground line prolog Prolog Underground Line ListOfStations Prolog rule to find which stations are on a particular Underground line I'm currently trying to answer a segment for a piece of co...

[ 0.0020904541015625, -0.0118408203125, 0.0120849609375, 0.0120849609375, -0.0091552734375, 0.0057373046875, 0.0103759765625, 0.00009775161743164062, 0.0108642578125, -0.036376953125, -0.0169677734375, -0.01220703125, 0.0027313232421875, 0.004974365234375, 0, 0.0059814453125, 0.0172119...

[ 1250, 4867, 79986, 7413, 3129, 29398, 7, 621, 98, 17311, 9626, 64330, 13315, 502, 16777, 32036, 132887, 42378, 35166, 33180, 18244, 3871, 28282, 11341, 107730, 2053, 44841, 26499, 5584, 32354, 44691, 17997, 18151 ]

[ 0.1376953125, 0.238037109375, 0.1885986328125, 0.1363525390625, 0.060791015625, 0.2344970703125, 0.04541015625, 0.053192138671875, 0.1500244140625, 0.1434326171875, 0.1629638671875, 0.1715087890625, 0.157470703125, 0.0806884765625, 0.090576171875, 0.08056640625, 0.1468505859375, 0....

embed

46852870_c0

46852870

prolog

0

Title: How to count and sum recursively in Prolog Problem title: How to count and sum recursively in Prolog Tags: recursion, prolog Problem: How to count and sum recursively in Prolog I'm trying to figure out how to use recursion on count and sum rules. I usually do it with lists, using findall and length or findall an...

How to count and sum recursively in Prolog How to count and sum recursively in Prolog recursion prolog How Prolog count_person Total_count List sum_ages Total_sum Age sum_list How to count and sum recursively in Prolog I'm trying to figure out how to use recursion on count and sum rules. I usually do it with lists, usi...

[ 0.0072021484375, 0.0189208984375, 0.006866455078125, 0.028564453125, -0.0135498046875, 0.00360107421875, -0.01470947265625, 0.017822265625, 0.017333984375, -0.07861328125, -0.0013275146484375, -0.03466796875, 0.00653076171875, 0.0224609375, 0.038330078125, -0.00811767578125, 0.016967...

[ 11249, 47, 54529, 136, 10554, 195625, 5844, 538, 23, 1250, 4867, 1830, 502, 30816, 33867, 71013, 32036, 52467, 11832, 72944, 6562, 4527, 91736, 5303, 7413, 5584, 140909, 2965, 35829, 51515, 114686, 2452, 3454, 27751, 5608, 17368 ]

[ 0.060455322265625, 0.055206298828125, 0.2105712890625, 0.138427734375, 0.23095703125, 0.2340087890625, 0.1761474609375, 0.0787353515625, 0.0294189453125, 0.1488037109375, 0.232666015625, 0.138916015625, 0.09661865234375, 0.1600341796875, 0.10235595703125, 0.151611328125, 0.1030273437...

embed

16591868_c0

16591868

prolog

0

Title: "Or" procedure in prolog Problem title: "Or" procedure in prolog Tags: prolog, list Problem: "Or" procedure in prolog I'm doing a prolog program for college that is a bit like the cluedo game. I have six suspects with different traits: suspect(Name, Age, Weapon, Shape, Object, Shoes) The goal...

"Or" procedure in prolog "Or" procedure in prolog prolog list Name Age Weapon Shape Object Shoes Hannibal Lecter suspect1 suspect2 suspect3 "Or" procedure in prolog I'm doing a prolog program for college that is a bit like the cluedo game. I have six suspects with different traits: The goal is to im...

[ 0.02490234375, 0.0101318359375, -0.00433349609375, 0.00013256072998046875, -0.0263671875, 0.0213623046875, -0.01708984375, 0.0130615234375, 0.01007080078125, -0.01202392578125, -0.008544921875, -0.00113677978515625, -0.001556396484375, 0.005462646484375, 0.019775390625, 0.0071716308593...

[ 41502, 19060, 1230, 50491, 23, 502, 4867, 5303, 15757, 72944, 1401, 11, 5416, 7224, 134549, 17779, 238713, 75625, 720, 92610, 418, 304, 363, 20594, 1528, 100, 40466, 4785, 1884, 29786, 37421, 6712, 765, 37195, 7, 12921, 110106, 69236, 29479...

[ 0.123046875, 0.302490234375, 0.097900390625, 0.2744140625, 0.08642578125, 0.17333984375, 0.25390625, 0.1907958984375, 0.05194091796875, 0.1146240234375, 0.060791015625, 0.0777587890625, 0.0965576171875, 0.110107421875, 0.1712646484375, 0.175537109375, 0.19921875, 0.1429443359375, ...

embed

39435709_c0

39435709

prolog

0

Title: How to remove duplicates from a list in SWI-Prolog? Problem title: How to remove duplicates from a list in SWI-Prolog? Tags: prolog Problem: How to remove duplicates from a list in SWI-Prolog? I need to write a predicate remove_duplicates/2 that removes duplicate elements form a given list. For example: ?- remov...

How to remove duplicates from a list in SWI-Prolog? How to remove duplicates from a list in SWI-Prolog? prolog a How SWI-Prolog remove_duplicates List Yes List1 How to remove duplicates from a list in SWI-Prolog? I need to write a predicate remove_duplicates/2 that removes duplicate elements form a given list. For exam...

[ 0.00927734375, 0.025146484375, 0.0174560546875, 0.004425048828125, -0.021484375, 0.002471923828125, 0.01019287109375, 0.0089111328125, 0.0033111572265625, -0.019775390625, -0.005767822265625, 0.010986328125, -0.00007963180541992188, 0.01190185546875, -0.003936767578125, 0.001220703125,...

[ 11249, 47, 87388, 171763, 1636, 1295, 5303, 159, 38969, 9, 10752, 4867, 23, 502, 10, 693, 52721, 32036, 32635, 418, 3871, 33022, 1653, 2063, 67, 12477, 80854, 3173, 705, 238, 52080, 13312, 62822, 1250, 841, 384, 32786, 114689, 618, 43240,...

[ 0.0751953125, 0.0186614990234375, 0.2274169921875, 0.3037109375, 0.179931640625, 0.10540771484375, 0.2257080078125, 0.08599853515625, 0.231201171875, 0.022247314453125, 0.1622314453125, 0.1986083984375, 0.03216552734375, 0.0946044921875, 0.002471923828125, 0.14794921875, 0.2369384765...

embed

33301526_c0

33301526

prolog

0

Title: Length ordered subsets? Problem title: Length ordered subsets? Tags: list, prolog Problem: Length ordered subsets? I'm trying to make a code that generates all subsets of a set in order . That is, calling subset([1,2,3], X) should generate X = []; X = [1]; X = [2]; X = [3]; X = [1,2]; X = [1,3]; X = [2,3]; X = [...

Length ordered subsets? Length ordered subsets? list prolog Length List Rest nth0 NewList subset2 Length ordered subsets? I'm trying to make a code that generates all subsets of a set in order . That is, calling subset([1,2,3], X) should generate The internal order isn't all that important, only that the smallest subse...

[ 0.0162353515625, 0.0174560546875, 0.015869140625, -0.000025272369384765625, 0.006805419921875, 0.010498046875, 0.00537109375, -0.01373291015625, 0.0286865234375, -0.0220947265625, 0.00811767578125, 0.01275634765625, -0.0113525390625, -0.00909423828125, -0.00885009765625, 0.003326416015...

[ 77554, 927, 12989, 297, 1614, 3509, 7, 32, 5303, 502, 4867, 32036, 49756, 2389, 2356, 154663, 304, 31577, 3249, 18151, 139392, 756, 111, 5423, 23, 159029, 133063, 96386, 1193, 5608, 70796, 5526, 19336, 525, 145870, 5117, 517, 155761, 32497,...

[ 0.180419921875, 0.1435546875, 0.25732421875, 0.1300048828125, 0.22412109375, 0.2459716796875, 0.03460693359375, 0.01422119140625, 0.142333984375, 0.118896484375, 0.16650390625, 0.13720703125, 0.10040283203125, 0.052093505859375, 0.068359375, 0.1298828125, 0.072998046875, 0.06390380...

embed

36109518_c0

36109518

prolog

0

Title: Prolog stream does not exist error Problem title: Prolog stream does not exist error Tags: io, list, prolog Problem: Prolog stream does not exist error I am working on a tokenizer in prolog, and i keep getting the following error when attempting to open a file and pass the stream into a predicate: ERROR: at_end_...

Prolog stream does not exist error Prolog stream does not exist error io list prolog Prolog File Str Tokenlist Newlist rem_consec_white No2white Stream at_end_of_stream List get0 List1 Prolog stream does not exist error I am working on a tokenizer in prolog, and i keep getting the following error when attempting to ope...

[ 0.0264892578125, 0.00457763671875, 0.00154876708984375, -0.01190185546875, 0.00112152099609375, -0.0098876953125, -0.004302978515625, 0.013916015625, -0.000667572021484375, -0.0301513671875, 0.0201416015625, 0.0086669921875, -0.00008296966552734375, -0.02294921875, 0.0206298828125, -0....

[ 1250, 4867, 75973, 14602, 959, 32316, 18499, 22995, 5303, 502, 42724, 23351, 717, 1098, 6562, 14194, 3240, 148477, 438, 115061, 3611, 4390, 86429, 32036, 2389, 418, 20697, 47, 52825, 13695, 25632, 81887, 9803, 11435, 27875, 1653, 2063, 151206...

[ 0.1912841796875, 0.2315673828125, 0.246337890625, 0.012237548828125, 0.1004638671875, 0.184814453125, 0.1463623046875, 0.1524658203125, 0.1220703125, 0.1390380859375, 0.0731201171875, 0.036773681640625, 0.0251617431640625, 0.1292724609375, 0.12548828125, 0.06280517578125, 0.082763671...

embed

16778782_c0

16778782

prolog

0

Title: Basic PROLOG counting Problem title: Basic PROLOG counting Tags: prolog, successor-arithmetics Problem: Basic PROLOG counting I'm new to prolog I'm trying to write a predicate which counts the following: the predicates name is s2int when given: s2int(0,Y) it shoud "return" Y=0. s2int(s(0),Y) => Y=1. s2int(s(s(0)...

Basic PROLOG counting Basic PROLOG counting prolog successor-arithmetics Basic PROLOG s2intAux s2int s2intA Basic PROLOG counting I'm new to prolog I'm trying to write a predicate which counts the following: the predicates name is s2int when given: s2int(0,Y) it shoud "return" Y=0. s2int(s(0),Y) => Y=1. s2int(s(s(0)),Y...

[ 0.007354736328125, 0.0011444091796875, -0.001007080078125, 0.0172119140625, -0.00122833251953125, 0.020263671875, -0.0162353515625, 0.00160980224609375, 0.0211181640625, -0.0250244140625, 0.017822265625, -0.005462646484375, -0.0108642578125, 0.01153564453125, 0.0296630859375, -0.002136...

[ 91692, 10514, 47510, 54529, 214, 502, 4867, 39457, 42, 8962, 91, 304, 4288, 6077, 284, 3525, 31577, 33022, 1653, 2063, 67, 25632, 1636, 9351, 34475, 2389, 1723, 77242, 65395, 990, 145407, 177609, 33000, 55257, 294, 76067, 37842, 104643, 704...

[ 0.1614990234375, 0.1719970703125, 0.232666015625, 0.19580078125, 0.0279083251953125, 0.167236328125, 0.2183837890625, 0.1915283203125, 0.0679931640625, 0.0758056640625, 0.1226806640625, 0.197998046875, 0.211181640625, 0.229248046875, 0.06610107421875, 0.07000732421875, 0.073364257812...

embed

1989576_c0

1989576

prolog

0

Title: Becoming operational in Prolog quickly Problem title: Becoming operational in Prolog quickly Tags: predicate, prolog, logic Problem: Becoming operational in Prolog quickly My company has a project running in Prolog and I want to clarify few things about how to go about learning it. I know Prolog is different. It...

Becoming operational in Prolog quickly Becoming operational in Prolog quickly predicate prolog logic Becoming Prolog Becoming operational in Prolog quickly My company has a project running in Prolog and I want to clarify few things about how to go about learning it. I know Prolog is different. It should not be learnt j...

[ 0.03662109375, 0.00750732421875, 0.0123291015625, -0.004974365234375, -0.00139617919921875, 0.00909423828125, 0.0208740234375, -0.005035400390625, 0.0101318359375, -0.054443359375, 0.0164794921875, -0.016845703125, -0.0196533203125, -0.007110595703125, 0.015869140625, 0.00885009765625,...

[ 873, 277, 214, 41018, 289, 23, 1250, 4867, 69405, 1653, 2063, 67, 502, 62775, 14380, 13452, 51042, 17306, 10846, 3642, 1672, 52080, 442, 12921, 1650, 5608, 959, 30698, 1884, 46876, 44540, 12877, 1118, 177953, 831, 3917, 313, 64, 441, 3722...

[ 0.04998779296875, 0.1378173828125, 0.0089111328125, 0.23486328125, 0.173828125, 0.08905029296875, 0.202392578125, 0.2900390625, 0.1807861328125, 0.14208984375, 0.1868896484375, 0.00750732421875, 0.165771484375, 0.1968994140625, 0.07684326171875, 0.052886962890625, 0.012420654296875, ...

embed

48263093_c0

48263093

prolog

0

Title: Enumerate solutions in Prolog Problem title: Enumerate solutions in Prolog Tags: swi-prolog, prolog Problem: Enumerate solutions in Prolog I wanted to enumerate solutions of a non-deterministic goal nondet_goal as pairs (Index, Value) where Index is the index of each value returned. I managed to do it using nb_s...

Enumerate solutions in Prolog Enumerate solutions in Prolog swi-prolog prolog Enumerate Prolog nondet_goal Index Value nb_setval nb_getval g_idx Idx Val Idx1 Out Enumerate solutions in Prolog I wanted to enumerate solutions of a non-deterministic goal nondet_goal as pairs (Index, Value) where Index is the index of each...

[ -0.005645751953125, 0.00927734375, 0.0057373046875, -0.00179290771484375, -0.018798828125, 0.0103759765625, -0.005828857421875, -0.0025482177734375, 0.002105712890625, -0.04443359375, 0.005889892578125, 0.01220703125, 0.00165557861328125, 0.003570556640625, 0.01904296875, 0.00127410888...

[ 357, 15537, 17957, 51347, 1250, 4867, 23, 2452, 3454, 502, 351, 3667, 519, 31471, 190060, 275, 3509, 1405, 3794, 24799, 425, 4769, 13538, 36663, 189085, 67, 112, 30524, 48242, 69236, 289, 237, 80836, 4153, 39659, 63262, 12638, 34292, 176377...

[ 0.02972412109375, 0.1739501953125, 0.110595703125, 0.20947265625, 0.1478271484375, 0.2247314453125, 0.007720947265625, 0.111328125, 0.1014404296875, 0.09918212890625, 0.1131591796875, 0.1722412109375, 0.1156005859375, 0.1920166015625, 0.1724853515625, 0.040740966796875, 0.11145019531...

embed

50891941_c0

50891941

prolog

0

Title: Prolog rule is `true` and not return it as an argument Problem title: Prolog rule is `true` and not return it as an argument Tags: prolog Problem: Prolog rule is `true` and not return it as an argument I have an assignment to collage to build a relation sub(Sublist, List) for all Sublist s of List such that the ...

Prolog rule is `true` and not return it as an argument Prolog rule is `true` and not return it as an argument prolog Prolog Sublist List Subset Prolog rule is `true` and not return it as an argument I have an assignment to collage to build a relation sub(Sublist, List) for all Sublist s of List such that the order of t...

[ 0.0206298828125, 0.0146484375, 0.018798828125, 0.01068115234375, -0.018310546875, 0.006378173828125, -0.002166748046875, 0.007293701171875, 0.027099609375, 0.005218505859375, -0.006439208984375, 0.0067138671875, 0.0013275146484375, 0.00677490234375, 0.02001953125, -0.0022125244140625, ...

[ 1250, 4867, 79986, 9774, 13, 959, 30646, 237, 10750, 502, 8273, 6562, 32036, 3509, 95486, 674, 167102, 45367, 41911, 1614, 96472, 756, 12989, 43032, 5701, 214521, 88303, 41, 1542, 155761, 57553, 4734, 1193, 183114, 4966, 3229, 1294, 39556, ...

[ 0.1826171875, 0.268798828125, 0.1917724609375, 0.1783447265625, 0.1304931640625, 0.1181640625, 0.219482421875, 0.0784912109375, 0.2237548828125, 0.1243896484375, 0.188232421875, 0.1876220703125, 0.1173095703125, 0.1590576171875, 0.10595703125, 0.027557373046875, 0.16796875, 0.08813...

embed

61330644_c1

61330644

prolog

1

palavras_uni([[d,a,y], [n,i,g,h,t]],[P12,P13]). false. As for my 2nd problem i have a predicate called espacos_uni(LS,LP) in which Ls is a list of lits containing variables for example [[P11, P21, P31, P41, P51], [P13, P23, P33, P43, P53]] and LP is list of list containing words just like before, for example [[d,a,y],...

[ -0.00848388671875, 0.006317138671875, -0.0010833740234375, -0.01495361328125, -0.01611328125, -0.00244140625, 0.0079345703125, -0.00543212890625, 0.00872802734375, -0.0120849609375, 0.0120849609375, 0.021484375, 0.03466796875, -0.013916015625, -0.00154876708984375, 0.0240478515625, 0...

[ 78549, 454, 5980, 71, 11, 53, 268, 4, 19, 14, 177, 127, 18, 86245, 683, 1530, 2681, 98320, 116, 2208, 2967, 1653, 2063, 67, 35839, 101404, 7840, 19759, 37352, 339, 7, 83, 5303, 111, 16060, 70541, 77336, 100, 1662, 436, 3117, 5016, 8...

[ 0.287841796875, 0.05548095703125, 0.302734375, 0.1103515625, 0.0904541015625, 0.096923828125, 0.00958251953125, 0.00946044921875, 0.035400390625, 0.03118896484375, 0.05657958984375, 0.0679931640625, 0.062255859375, 0.009490966796875, 0.06182861328125, 0.1346435546875, 0.139892578125,...

embed

27072272_c1

27072272

prolog

1

). move(threeg,fourn). move(fourm,fivem). move(fourn,fiven). move(threeh,fouro). move(threeh,fourp). move(fouro,fiveo). move(fourp,fivep). move(threei,fourq). move(threei,fourr). move(fourq,fiveq). move(fourr,fiver). move(twod,threej). move(twod,threek). move(twod,threel). move(threej,fours). move(threej,fourt). move(f...

[ 0.0064697265625, 0.01312255859375, 0.00732421875, 0.030517578125, 0.00335693359375, 0.01165771484375, -0.00592041015625, -0.00732421875, 0.01239013671875, -0.018310546875, 0.0037689208984375, 0.007537841796875, -0.0024566650390625, 0.0106201171875, -0.0166015625, 0.006591796875, 0.01...

[ 194, 25813, 927, 107, 2507, 160018, 19, 39, 1029, 66262, 1353, 132, 11036, 31, 254, 272, 1399, 864, 42, 814, 18, 15263, 1334, 343, 583, 7, 3132, 4, 3618, 34, 334, 434, 425, 104, 17447, 284, 108421, 16, 15772, 69236, 38679, 297, 1745...

[ 0.1268310546875, 0.22265625, 0.08319091796875, 0.12939453125, 0.1185302734375, 0.1368408203125, 0.0660400390625, 0.0927734375, 0.07958984375, 0.1715087890625, 0.129638671875, 0.002471923828125, 0.1041259765625, 0.1170654296875, 0.184326171875, 0.11962890625, 0.0618896484375, 0.0797...

embed

66021720_c0

66021720

prolog

0

Title: compilation failed in GNU Prolog Problem title: compilation failed in GNU Prolog Tags: river-crossing-puzzle, prolog Problem: compilation failed in GNU Prolog other_bank(e,w). other_bank(w,e). % farmer,wolf,goat,cabbage move([X,X,Goat,Cabbage],wolf,[Y,Y,Goat,Cabbage]) :- other_bank(X,Y). move([X,Wolf,X,Cabbage],...

compilation failed in GNU Prolog compilation failed in GNU Prolog river-crossing-puzzle prolog GNU Prolog other_bank Goat Cabbage Wolf safety_check safe_status Man Config Move OtherMoves NextConfig compilation failed in GNU Prolog Compilation error while loading the .pl file in GNU Prolog Farmer-wolf-goat-cabbage probl...

[ 0.006866455078125, 0.0296630859375, -0.0054931640625, 0.0115966796875, -0.0244140625, 0.015869140625, -0.0196533203125, -0.00177764892578125, 0.009521484375, -0.0238037109375, -0.01513671875, -0.006805419921875, -0.006011962890625, -0.004547119140625, 0.00836181640625, -0.0010299682617...

[ 98352, 165523, 165132, 1250, 4867, 96113, 95665, 214, 1766, 13894, 133, 502, 3789, 9802, 2016, 257, 30438, 402, 429, 45492, 81900, 78292, 46002, 45215, 1572, 139403, 135828, 64511, 9083, 3132, 4997, 83671, 15612, 14, 18499, 72367, 2424, 11435...

[ 0.2071533203125, 0.1749267578125, 0.162841796875, 0.13134765625, 0.1949462890625, 0.0863037109375, 0.0975341796875, 0.01995849609375, 0.03338623046875, 0.06317138671875, 0.00872802734375, 0.08953857421875, 0.025848388671875, 0.1297607421875, 0.08709716796875, 0.07940673828125, 0.0958...

embed

40019059_c1

40019059

prolog

1

,T,[]). walk(A,B,Time,V) :- aRoute(A,X,Time), not(member(X,V)), ( B = X; connection(A,X,_,S), walk(X,B,S,[A|V]) ). Whenever I ask my knowledge base if there is a route between two points, it returns whether that's possible; true or false : testRoute(kerkrade, sittard, 900). true; (signifies that there are three routes,...

[ -0.004547119140625, 0.0150146484375, 0.01348876953125, 0.0211181640625, -0.011474609375, -0.00384521484375, -0.031982421875, -0.0166015625, 0.000720977783203125, -0.05029296875, 0.011474609375, 0.007720947265625, -0.021240234375, 0.0028076171875, -0.002410888671875, -0.0002899169921875...

[ 618, 1065, 35691, 284, 571, 70059, 856, 15772, 10, 12724, 6743, 1542, 959, 27417, 335, 2203, 1193, 94878, 294, 26458, 51359, 3647, 2174, 2685, 36439, 17721, 6626, 26847, 30646, 36766, 450, 7722, 29568, 98320, 3034, 125464, 15244, 8147, 5861...

[ 0.063232421875, 0.002532958984375, 0.20751953125, 0.06610107421875, 0.08935546875, 0.194580078125, 0.1715087890625, 0.004638671875, 0.052154541015625, 0.154541015625, 0.1666259765625, 0.0401611328125, 0.05712890625, 0.1580810546875, 0.059234619140625, 0.001953125, 0.105224609375, 0...

embed

29857372_c0

29857372

prolog

0

Title: How to go back to "repeat" in Prolog? Problem title: How to go back to "repeat" in Prolog? Tags: repeat, prolog Problem: How to go back to "repeat" in Prolog? Is it possible to go back to a repeat in Prolog without calling the predicate and without making a new predicate? I have the following...

How to go back to "repeat" in Prolog? How to go back to "repeat" in Prolog? repeat prolog How Prolog Welcome Print Ans You How to go back to "repeat" in Prolog? Is it possible to go back to a repeat in Prolog without calling the predicate and without making a new predicate? I have the following code...

[ 0.00262451171875, 0.036376953125, 0.01507568359375, 0.02099609375, -0.005889892578125, 0.0126953125, 0.0272216796875, 0.0050048828125, -0.003692626953125, -0.047607421875, -0.004241943359375, 0.01153564453125, -0.021728515625, -0.012451171875, 0.02685546875, 0.00537109375, 0.01586914...

[ 11249, 47, 738, 4420, 107, 1081, 257, 23, 1250, 4867, 119140, 502, 91334, 39754, 893, 2583, 7722, 10, 15490, 159029, 1653, 2063, 25632, 18151, 43581, 140992, 2046, 7663, 3564, 3444, 7, 23468, 3917, 71864, 18, 45831, 48716, 20028 ]

[ 0.08294677734375, 0.1619873046875, 0.1048583984375, 0.20166015625, 0.107421875, 0.23193359375, 0.205078125, 0.05316162109375, 0.1741943359375, 0.247314453125, 0.295166015625, 0.1365966796875, 0.2283935546875, 0.12451171875, 0.036651611328125, 0.0128173828125, 0.057037353515625, 0.0...

embed

13554709_c0

13554709

prolog

0

Title: Hiding Variables in a Prolog Query Problem title: Hiding Variables in a Prolog Query Tags: lambda, prolog Problem: Hiding Variables in a Prolog Query I am working on an assignment with prolog which involves an airport database (it has airport cities, and flight links which includes airport tax and duration time)...

Hiding Variables in a Prolog Query Hiding Variables in a Prolog Query lambda prolog Hiding Variables Prolog Query Hiding Variables in a Prolog Query I am working on an assignment with prolog which involves an airport database (it has airport cities, and flight links which includes airport tax and duration time) and the...

[ 0.016845703125, 0.02685546875, 0.0025634765625, 0.01287841796875, -0.005706787109375, -0.005828857421875, -0.0078125, 0.0113525390625, -0.00070953369140625, -0.0244140625, -0.02099609375, -0.03564453125, -0.0286865234375, -0.006988525390625, -0.007537841796875, -0.000362396240234375, ...

[ 72483, 214, 111477, 13566, 1250, 4867, 58836, 53, 23, 6492, 85, 502, 20697, 95486, 146619, 63399, 162708, 113014, 22317, 24643, 115, 1733, 5117, 9655, 41, 10484, 134598, 33022, 1294, 35166, 21771, 3714, 2967, 140992, 1286, 4677, 7068, 3444, ...

[ 0.24365234375, 0.1126708984375, 0.222412109375, 0.20068359375, 0.1754150390625, 0.256103515625, 0.2010498046875, 0.013031005859375, 0.042266845703125, 0.14013671875, 0.0648193359375, 0.12744140625, 0.048553466796875, 0.055267333984375, 0.1251220703125, 0.1121826171875, 0.174560546875...

embed

64251931_c2

64251931

prolog

2

44321). city('Addis Ababa',ethiopia,'Addis Ababa',2084588). city('Adelaide',australia,'South Australia',1050000). city('Aden',yemen,'Yemen',550744). city('Adiyaman',turkey,'Adiyaman',128000). city('Ado-Ekiti',nigeria,'Ekiti',156122). my logic to achieve this task: pop(Country,Pop) :- city(_,C,_,Pop), Country = C. setof...

[ 0.00958251953125, -0.0125732421875, 0.0042724609375, 0.01116943359375, -0.027099609375, 0.01507568359375, 0.00933837890625, -0.001312255859375, 0.00830078125, -0.00055694580078125, 0.0218505859375, -0.0167236328125, 0.001617431640625, -0.037353515625, -0.005035400390625, -0.02294921875...

[ 5896, 103705, 194, 26349, 22409, 3827, 62, 21369, 13, 4450, 128482, 4, 154782, 4633, 123641, 284, 26561, 2506, 916, 2816, 7884, 218128, 28173, 46659, 28568, 555, 1033, 1055, 69085, 90393, 195953, 49778, 669, 987, 1530, 87774, 246, 9, 42595,...

[ 0.25537109375, 0.316162109375, 0.086669921875, 0.2059326171875, 0.1318359375, 0.211181640625, 0.1473388671875, 0.278076171875, 0.01715087890625, 0.1434326171875, 0.2047119140625, 0.078369140625, 0.1756591796875, 0.211669921875, 0.1748046875, 0.124267578125, 0.256103515625, 0.291992...

embed

42287919_c0

42287919

prolog

0

Title: Goldbach’s Conjecture in prolog Problem title: Goldbach’s Conjecture in prolog Tags: primality-test, goldbach-conjecture, primes, prolog Problem: Goldbach’s Conjecture in prolog Goldbach’s Conjecture : Every positive even number greater than 2 is the sum of two prime numbers. Eg 28 (5,23 and 11,17) I want Prolog...

Goldbach’s Conjecture in prolog Goldbach’s Conjecture in prolog primality-test goldbach-conjecture primes prolog Goldbach Conjecture Output is_prime has_factor next_prime Goldbach’s Conjecture in prolog Goldbach’s Conjecture : Every positive even number greater than 2 is the sum of two prime numbers. Eg 28 (5,23 and 11...

[ 0.007537841796875, 0.0166015625, 0.028076171875, 0.00469970703125, 0.004486083984375, 0.0244140625, 0.004119873046875, 0.007476806640625, 0.0033721923828125, -0.016845703125, -0.0004425048828125, -0.009765625, -0.0015411376953125, -0.0120849609375, -0.01446533203125, 0.0234375, -0.01...

[ 18217, 31731, 26, 1657, 75161, 3408, 23, 502, 4867, 29810, 134393, 6954, 86761, 20809, 13538, 83, 114654, 1556, 144810, 11737, 7, 87769, 24491, 3853, 14012, 117396, 116, 10554, 6626, 101935, 22221, 1372, 11516, 3742, 136, 534, 59741, 3444, ...

[ 0.175048828125, 0.291748046875, 0.06915283203125, 0.071533203125, 0.207763671875, 0.1201171875, 0.018341064453125, 0.1668701171875, 0.22900390625, 0.139892578125, 0.1182861328125, 0.1595458984375, 0.118408203125, 0.21044921875, 0.07110595703125, 0.1072998046875, 0.19091796875, 0.11...

embed

75651380_c0

75651380

prolog

0

Title: Finding Paths in Prolog Problem title: Finding Paths in Prolog Tags: path-finding, prolog, transitive-closure, nodes, path Problem: Finding Paths in Prolog I'm relatively new to Prolog and my aim from this code is to try and find all routes between all defined edges. Prolog should output me the full route from t...

Finding Paths in Prolog Finding Paths in Prolog path-finding prolog transitive-closure nodes path Finding Paths Prolog Path Visited Finding Paths in Prolog I'm relatively new to Prolog and my aim from this code is to try and find all routes between all defined edges. Prolog should output me the full route from the inpu...

[ 0.02294921875, 0.0186767578125, 0.0107421875, 0.0185546875, 0.00909423828125, 0.00799560546875, -0.022216796875, -0.011474609375, 0.00390625, -0.0625, 0.007232666015625, -0.009765625, -0.021728515625, 0.00518798828125, 0.0029296875, 0.00628662109375, 0.01251220703125, 0.01434326171...

[ 26040, 108421, 7, 1250, 4867, 214, 23, 60875, 111607, 502, 62621, 5844, 170224, 110, 988, 98684, 3525, 464, 18151, 9790, 7413, 756, 36439, 17721, 61924, 121303, 5608, 140992, 4393, 107730, 4034, 47, 78869, 13695, 18499, 87109, 20, 238, 1331...

[ 0.1055908203125, 0.219482421875, 0.0260772705078125, 0.1527099609375, 0.2373046875, 0.007720947265625, 0.0161285400390625, 0.17724609375, 0.1103515625, 0.1173095703125, 0.126220703125, 0.0748291015625, 0.161865234375, 0.096923828125, 0.080810546875, 0.1123046875, 0.0013427734375, 0...

embed

70499763_c0

70499763

prolog

0

Title: Prolog findall solutions within time limit Problem title: Prolog findall solutions within time limit Tags: prolog-findall, prolog, swi-prolog Problem: Prolog findall solutions within time limit I would like to find all solutions to a goal within some time limit. I mean that I would like to search for solutions f...

Prolog findall solutions within time limit Prolog findall solutions within time limit prolog-findall prolog swi-prolog Prolog call_with_time_limit my_goal Sol time_limit_exceeded Prolog findall solutions within time limit I would like to find all solutions to a goal within some time limit. I mean that I would like to s...

[ -0.00341796875, 0.00396728515625, 0.0242919921875, -0.0128173828125, -0.0137939453125, -0.0225830078125, 0.0030670166015625, -0.0028839111328125, -0.00909423828125, -0.060791015625, 0.01031494140625, 0.0003032684326171875, -0.00823974609375, 0.0040283203125, 0.032958984375, 0.010620117...

[ 1250, 4867, 7413, 5584, 51347, 28032, 1733, 17475, 502, 111607, 2452, 3454, 11782, 76228, 6032, 93343, 759, 519, 6678, 3355, 329, 1884, 756, 47, 69236, 33938, 100, 2684, 30646, 14037, 157578, 5303, 28484, 37842, 25632, 959, 2878, 2174, 8710...

[ 0.162109375, 0.24169921875, 0.146728515625, 0.201904296875, 0.2264404296875, 0.1519775390625, 0.1324462890625, 0.2158203125, 0.099609375, 0.122802734375, 0.113037109375, 0.0718994140625, 0.149658203125, 0.0843505859375, 0.1162109375, 0.2109375, 0.0740966796875, 0.107666015625, 0....

embed

53962384_c0

53962384

prolog

0

Title: How can I compute all the lengths of lists in list? Problem title: How can I compute all the lengths of lists in list? Tags: prolog Problem: How can I compute all the lengths of lists in list? I am trying to compute a list that contains the length of each list that are inside a list. My code is: length_list(A, B...

How can I compute all the lengths of lists in list? How can I compute all the lengths of lists in list? prolog How length_list Path Length PathAB PathCB LengthCB _6624 _6588 _6546 _6498 _6456 How can I compute all the lengths of lists in list? I am trying to compute a list that contains the length of each list that are...

[ 0.006744384765625, 0.01251220703125, 0.0108642578125, 0.030029296875, 0.004791259765625, 0.0142822265625, -0.0152587890625, 0.01611328125, 0.0135498046875, -0.060791015625, 0.0001888275146484375, -0.007171630859375, 0.0107421875, 0.0303955078125, 0.006561279296875, 0.002288818359375, ...

[ 11249, 831, 87, 9969, 6743, 756, 70, 140909, 7, 111, 5303, 23, 502, 4867, 6562, 108421, 77554, 927, 11040, 47307, 14604, 2357, 153354, 9271, 165611, 121317, 31577, 70541, 12638, 46132, 18151, 60875, 284, 335, 32316, 17721, 6275, 62, 136, ...

[ 0.058349609375, 0.07373046875, 0.0286865234375, 0.1392822265625, 0.150634765625, 0.150146484375, 0.0760498046875, 0.2333984375, 0.1231689453125, 0.1190185546875, 0.251953125, 0.0986328125, 0.0849609375, 0.1199951171875, 0.18798828125, 0.15185546875, 0.123779296875, 0.01022338867187...

embed

28643034_c0

28643034

prolog

0

Title: How to initialize a String array with unknown length to null? Problem title: How to initialize a String array with unknown length to null? Tags: java, prolog, string, initialization, arrays Problem: How to initialize a String array with unknown length to null? I'mm working on this program in which connects Prolo...

How to initialize a String array with unknown length to null? How to initialize a String array with unknown length to null? java prolog string initialization arrays How Query Compound Term Variable qMeat.hasMoreSolution qMeat.nextSolution java.util.Arrays.fill How to initialize a String array with unknown length to nul...

[ 0.0262451171875, 0.008056640625, -0.007110595703125, 0.0361328125, -0.01361083984375, 0.005859375, 0.00726318359375, -0.0074462890625, 0.0030670166015625, -0.0157470703125, -0.006622314453125, -0.0181884765625, -0.0177001953125, 0.001617431640625, 0.0005950927734375, -0.00311279296875,...

[ 11249, 47, 61475, 20650, 23351, 214, 10298, 53, 678, 51, 69723, 140909, 56574, 79, 330, 502, 4867, 79315, 47691, 4778, 58836, 15612, 31, 2994, 84572, 8096, 6696, 257, 10557, 122880, 102588, 34, 29062, 3675, 7614, 7092, 116115, 20697, 1528, ...

[ 0.07086181640625, 0.1390380859375, 0.1925048828125, 0.10888671875, 0.2265625, 0.1192626953125, 0.198974609375, 0.1766357421875, 0.07611083984375, 0.084716796875, 0.1905517578125, 0.1546630859375, 0.258544921875, 0.062744140625, 0.13330078125, 0.1005859375, 0.2030029296875, 0.212280...

embed

60865465_c0

60865465

prolog

0

Title: Why my predicate div/4 enters an infinite loop after giving me one answer? Problem title: Why my predicate div/4 enters an infinite loop after giving me one answer? Tags: successor-arithmetics, prolog Problem: Why my predicate div/4 enters an infinite loop after giving me one answer? I'm trying to implement the ...

Why my predicate div/4 enters an infinite loop after giving me one answer? Why my predicate div/4 enters an infinite loop after giving me one answer? successor-arithmetics prolog Why Why my predicate div/4 enters an infinite loop after giving me one answer? I'm trying to implement the Euclidean division (a = bq + r) us...

[ -0.01348876953125, 0.0087890625, 0.00811767578125, -0.002593994140625, 0.005859375, -0.004486083984375, 0.009521484375, 0.00732421875, 0.004791259765625, -0.0517578125, 0.0159912109375, 0.005584716796875, -0.0036163330078125, 0.005096435546875, 0.0150146484375, 0.008544921875, 0.0208...

[ 44084, 759, 1653, 2063, 67, 18221, 17357, 30957, 7, 54241, 13, 40956, 7103, 68772, 1632, 35166, 142, 163, 39457, 42, 8962, 282, 502, 4867, 31577, 29479, 34937, 130265, 91853, 11, 2203, 864, 997, 1690, 1460, 3922, 5134, 28016, 1636, 37202,...

[ 0.1317138671875, 0.02899169921875, 0.1444091796875, 0.160400390625, 0.09075927734375, 0.1849365234375, 0.2449951171875, 0.1593017578125, 0.016632080078125, 0.13427734375, 0.0706787109375, 0.1982421875, 0.090576171875, 0.0958251953125, 0.1170654296875, 0.1824951171875, 0.0581359863281...

embed

55695837_c0

55695837

prolog

0

Title: How to add a 'Functor' object from prolog to a JSON in python Problem title: How to add a 'Functor' object from prolog to a JSON in python Tags: json, prolog, python Problem: How to add a 'Functor' object from prolog to a JSON in python I'm consulting a Knowledge Base in Prolog and when I pri...

How to add a 'Functor' object from prolog to a JSON in python How to add a 'Functor' object from prolog to a JSON in python json prolog python prolog How Functor JSON build_response pl.consult color.pl pl.query response_list How to add a 'Functor' object from prolog to a JSON in python I'm consultin...

[ 0.021240234375, 0.010498046875, -0.000751495361328125, -0.01312255859375, 0.00836181640625, 0.0120849609375, -0.026611328125, 0.007537841796875, 0.0040283203125, -0.03564453125, 0.021484375, 0.0213623046875, 0.007415771484375, -0.01458740234375, 0.005279541015625, 0.013671875, -0.008...

[ 11249, 15190, 3768, 97249, 18770, 36746, 1295, 502, 4867, 47, 821, 58627, 17198, 50828, 1647, 1681, 28670, 45367, 134719, 6456, 147834, 10576, 2424, 944, 57553, 6562, 10, 23, 75463, 191428, 44978, 1250, 28412, 140992, 7477, 959, 35686, 1418, ...

[ 0.04229736328125, 0.1939697265625, 0.051788330078125, 0.2239990234375, 0.2421875, 0.21240234375, 0.086181640625, 0.1590576171875, 0.2213134765625, 0.084228515625, 0.146240234375, 0.2232666015625, 0.0980224609375, 0.155029296875, 0.07073974609375, 0.1328125, 0.195068359375, 0.123291...

embed

67890256_c0

67890256

prolog

0

Title: How to list all people that have a specific number of descendants in prolog? Problem title: How to list all people that have a specific number of descendants in prolog? Tags: prolog Problem: How to list all people that have a specific number of descendants in prolog? I can check if X is a ancestor of Y and can c...

How to list all people that have a specific number of descendants in prolog? How to list all people that have a specific number of descendants in prolog? prolog How aggregate_all COUNT List list_people How to list all people that have a specific number of descendants in prolog? I can check if X is a ancestor of Y and c...

[ 0.0301513671875, -0.00799560546875, -0.004119873046875, 0.02294921875, -0.004150390625, 0.0108642578125, 0.000347137451171875, -0.00347900390625, 0.0260009765625, -0.057373046875, -0.0008087158203125, -0.05029296875, 0.0029449462890625, 0.0303955078125, 0.013427734375, -0.0015945434570...

[ 11249, 47, 5303, 756, 3395, 450, 765, 29458, 14012, 60887, 10840, 502, 4867, 23, 197564, 13, 5584, 8244, 64163, 32036, 223354, 831, 12765, 2174, 1193, 60502, 1290, 111, 990, 54529, 3642, 5941, 1556, 3714, 34475, 541, 2203, 959, 4488, 7998...

[ 0.0911865234375, 0.0672607421875, 0.2252197265625, 0.143310546875, 0.139404296875, 0.05712890625, 0.10400390625, 0.170654296875, 0.1448974609375, 0.2393798828125, 0.187744140625, 0.18896484375, 0.232421875, 0.064697265625, 0.16455078125, 0.053497314453125, 0.1414794921875, 0.084838...

embed

43035679_c0

43035679

prolog

0

Title: How can two lists be compared in Prolog considering the subterms? Problem title: How can two lists be compared in Prolog considering the subterms? Tags: compare, comparison, sicstus-prolog, prolog Problem: How can two lists be compared in Prolog considering the subterms? I would like to compare two lists conside...

How can two lists be compared in Prolog considering the subterms? How can two lists be compared in Prolog considering the subterms? compare comparison sicstus-prolog prolog How Prolog How can two lists be compared in Prolog considering the subterms? I would like to compare two lists considering and comparing every one ...

[ 0.0025634765625, 0.02587890625, 0.005096435546875, 0.00933837890625, 0.0017547607421875, 0.003753662109375, 0.01031494140625, 0.00933837890625, 0.00347900390625, 0.006072998046875, 0.0130615234375, 0.00830078125, -0.00927734375, -0.004425048828125, 0.0040283203125, -0.01458740234375, ...

[ 11249, 831, 6626, 5303, 7, 186, 154186, 1250, 4867, 179635, 153224, 4432, 69101, 225490, 26536, 18253, 3454, 502, 23, 47, 37397, 808, 418, 304, 69829, 13956, 40970, 16750, 117396, 977, 3501, 17932, 138, 116, 69407, 13579, 17569, 107730, 140...

[ 0.056549072265625, 0.06695556640625, 0.14111328125, 0.248779296875, 0.05987548828125, 0.0576171875, 0.23876953125, 0.1566162109375, 0.248291015625, 0.125732421875, 0.16796875, 0.1260986328125, 0.2232666015625, 0.1904296875, 0.0594482421875, 0.184814453125, 0.1160888671875, 0.117675...

embed

53668887_c0

53668887

prolog

0

Title: A combination of a list given a length followed by a permutation in Prolog? Problem title: A combination of a list given a length followed by a permutation in Prolog? Tags: list, combinations, permutation, prolog Problem: A combination of a list given a length followed by a permutation in Prolog? I need a predic...

A combination of a list given a length followed by a permutation in Prolog? A combination of a list given a length followed by a permutation in Prolog? list combinations permutation prolog Prolog ListResult N-1 A combination of a list given a length followed by a permutation in Prolog? I need a predicate to return a li...

[ -0.01312255859375, 0.0206298828125, 0.01171875, 0.01446533203125, -0.013916015625, 0, -0.0135498046875, -0.00927734375, 0.0185546875, -0.0245361328125, -0.0017852783203125, -0.006195068359375, 0.0030517578125, 0.014892578125, -0.01165771484375, 0.00848388671875, 0.0234375, 0.012451...

[ 162515, 111, 5303, 34475, 140909, 134629, 117, 561, 22062, 23, 1250, 4867, 32, 502, 32036, 7, 7136, 541, 5759, 390, 3871, 1653, 2063, 67, 30646, 678, 756, 107730, 16750, 13267, 17932, 121, 27781, 106935, 19, 68252, 155761, 339, 116, 110, ...

[ 0.2498779296875, 0.01141357421875, 0.2088623046875, 0.1123046875, 0.176025390625, 0.146728515625, 0.1181640625, 0.2060546875, 0.1019287109375, 0.044830322265625, 0.1724853515625, 0.2462158203125, 0.00189208984375, 0.1190185546875, 0.1407470703125, 0.091552734375, 0.1322021484375, 0...

embed

9354526_c0

9354526

prolog

0

Title: Sub-lists of Unique Length Problem title: Sub-lists of Unique Length Tags: prolog Problem: Sub-lists of Unique Length I'm writing a program that checks if a list contains sub-lists of unique length: e.g. diffLengthLists([[2],[3,4]]) should return true whereas diffLengthLists([[3],[4]]) should return false. Here'...

Sub-lists of Unique Length Sub-lists of Unique Length prolog Sub-lists Unique Length is_list Sub-lists of Unique Length I'm writing a program that checks if a list contains sub-lists of unique length: e.g. diffLengthLists([[2],[3,4]]) should return true whereas diffLengthLists([[3],[4]]) should return false. Here's my ...

[ -0.00982666015625, 0.0174560546875, 0.03173828125, -0.00823974609375, -0.0191650390625, 0.006011962890625, 0.003570556640625, 0.0029449462890625, 0.0341796875, -0.0118408203125, -0.00555419921875, 0.00592041015625, 0.0274658203125, 0.0206298828125, 0.01611328125, -0.0035858154296875, ...

[ 8273, 6562, 111, 11789, 944, 77554, 927, 502, 4867, 83, 32562, 1528, 12765, 2174, 5303, 70541, 1614, 9, 36998, 140909, 71337, 5267, 449, 154663, 82449, 30646, 29568, 54968, 68714, 98320, 18151, 154107, 12638, 15700, 58745, 397, 80854, 759, ...

[ 0.248779296875, 0.252197265625, 0.0301361083984375, 0.21630859375, 0.13037109375, 0.1494140625, 0.078125, 0.11328125, 0.1507568359375, 0.08740234375, 0.1248779296875, 0.154296875, 0.1790771484375, 0.08953857421875, 0.1971435546875, 0.1102294921875, 0.23095703125, 0.020294189453125,...

embed

54725668_c0

54725668

prolog

0

Title: Avoid findall overflow with n-fractions problem Problem title: Avoid findall overflow with n-fractions problem Tags: prolog-findall, eclipse-clp, prolog Problem: Avoid findall overflow with n-fractions problem I am trying to print all solutions of the n-fractions problem for n=4: :- lib(ic). fractions(Digits) :-...

Avoid findall overflow with n-fractions problem Avoid findall overflow with n-fractions problem prolog-findall eclipse-clp prolog Avoid Digits ic:alldifferent input_order List Overflow You LOCALSIZE Peak Avoid findall overflow with n-fractions problem I am trying to print all solutions of the n-fractions problem for n=...

[ -0.0189208984375, 0.007110595703125, 0.01068115234375, 0.0089111328125, -0.01312255859375, -0.004058837890625, -0.01312255859375, 0.0084228515625, -0.0010833740234375, -0.0341796875, 0.004364013671875, -0.00909423828125, 0.0245361328125, -0.01531982421875, 0.0194091796875, 0.0130004882...

[ 84361, 532, 7413, 5584, 645, 118664, 678, 653, 175921, 2967, 502, 4867, 111607, 106371, 184, 26775, 51174, 6, 238778, 107730, 80596, 32036, 9578, 2583, 230588, 9902, 19157, 162737, 7, 31577, 28412, 756, 51347, 107947, 11675, 70, 41, 25632, ...

[ 0.192626953125, 0.1392822265625, 0.1695556640625, 0.20361328125, 0.154052734375, 0.2626953125, 0.0748291015625, 0.152099609375, 0.255859375, 0.1966552734375, 0.113525390625, 0.1729736328125, 0.1365966796875, 0.19677734375, 0.143310546875, 0.109130859375, 0.050537109375, 0.017807006...

embed

14802370_c0

14802370

prolog

0

Title: Prolog: List recursion and modification Problem title: Prolog: List recursion and modification Tags: recursion, prolog, list Problem: Prolog: List recursion and modification I'm having a little trouble understanding list recursion and modification in Prolog. I'm trying to take a list of lists, then with each lis...

Prolog: List recursion and modification Prolog: List recursion and modification recursion prolog list Prolog List Find Multiply Take Attach First Tset MFirst Prolog: List recursion and modification I'm having a little trouble understanding list recursion and modification in Prolog. I'm trying to take a list of lists, t...

[ -0.017822265625, 0.038818359375, 0.009521484375, -0.00457763671875, -0.0106201171875, 0.001922607421875, -0.01507568359375, 0.00360107421875, 0.0196533203125, -0.001739501953125, 0.007171630859375, -0.0081787109375, -0.0087890625, -0.00127410888671875, 0.0086669921875, 0.00576782226562...

[ 1250, 4867, 32036, 195625, 1830, 129344, 136, 502, 5303, 26040, 19335, 62479, 46673, 9208, 934, 23972, 384, 3509, 276, 207263, 10176, 63134, 100094, 31577, 5646, 678, 12638, 6024, 12830, 390, 4568, 18151, 9790, 756, 2046, 98320, 6275, 28219, ...

[ 0.1666259765625, 0.239990234375, 0.1790771484375, 0.228515625, 0.093994140625, 0.2232666015625, 0.04150390625, 0.1302490234375, 0.2005615234375, 0.104248046875, 0.123046875, 0.181396484375, 0.095703125, 0.07415771484375, 0.09814453125, 0.0792236328125, 0.008453369140625, 0.15930175...

embed

66219009_c1

66219009

prolog

1

log seeing two differently instantiated terms with the same structure as the same term. Therefore, defining a variant-based subtitution predicate like so: variant_replace(A,B, [], []). variant_replace(A,B, [H|T], [B|T2]) :- (H=@=A)->variant_replace(A, B, T, T2). variant_replace(A,B, [H|T], [H|T2]) :- (H\=@=A)->variant_...

[ 0.0026397705078125, 0.0145263671875, -0.00543212890625, 0.0025634765625, 0.0029754638671875, 0.006378173828125, -0.0174560546875, 0.00970458984375, 0.01007080078125, -0.0208740234375, 0.0166015625, 0.01263427734375, -0.005218505859375, -0.0079345703125, 0.0186767578125, -0.001045227050...

[ 12684, 86681, 6626, 12921, 34648, 14, 69407, 5701, 45646, 13579, 13204, 20117, 77007, 1614, 118, 458, 1363, 1653, 2063, 67, 1884, 221, 107, 23935, 284, 571, 841, 618, 90173, 981, 162591, 335, 384, 10461, 209828, 1542, 62, 154663, 271, 119...

[ 0.1588134765625, 0.117431640625, 0.1099853515625, 0.130859375, 0.118408203125, 0.0819091796875, 0.1710205078125, 0.066650390625, 0.1290283203125, 0.149169921875, 0.0982666015625, 0.26904296875, 0.1304931640625, 0.196044921875, 0.1236572265625, 0.1239013671875, 0.03460693359375, 0.1...

embed

67944572_c0

67944572

prolog

0

Title: Prolog - Infinite loop with very basic rule definition Problem title: Prolog - Infinite loop with very basic rule definition Tags: failure-slice, prolog Problem: Prolog - Infinite loop with very basic rule definition I was trying to practice Prolog, as suggested by my TA, I am trying to create the rule append3(A...

Prolog - Infinite loop with very basic rule definition Prolog - Infinite loop with very basic rule definition failure-slice prolog Prolog Infinite append3 Prolog - Infinite loop with very basic rule definition I was trying to practice Prolog, as suggested by my TA, I am trying to create the rule append3(A,B,C,D) which ...

[ 0.01458740234375, 0.002716064453125, 0.010498046875, 0.0087890625, -0.0036468505859375, -0.006195068359375, 0.0098876953125, 0.01312255859375, 0.038330078125, -0.042236328125, -0.002105712890625, -0.0250244140625, -0.00750732421875, 0.01251220703125, 0.0238037109375, 0.01025390625, 0...

[ 1250, 4867, 134322, 40956, 678, 4552, 62822, 79986, 80934, 13, 137578, 13348, 502, 114689, 71, 363, 31577, 41361, 42459, 12998, 28282, 284, 571, 397, 26950, 391, 16750, 111, 62, 136, 313, 441, 34475, 54397, 25632, 10422, 237, 41, 171581, ...

[ 0.131591796875, 0.2120361328125, 0.147705078125, 0.23193359375, 0.0214385986328125, 0.0723876953125, 0.1402587890625, 0.1722412109375, 0.16455078125, 0.05230712890625, 0.189697265625, 0.0928955078125, 0.06494140625, 0.160400390625, 0.1165771484375, 0.1754150390625, 0.049713134765625,...

embed

36682087_c0

36682087

prolog

0

Title: Family tree with SWI-Prolog Problem title: Family tree with SWI-Prolog Tags: family-tree, prolog, logic Problem: Family tree with SWI-Prolog I am trying to get a simple family tree to work with Prolog using a maximum of 3 facts being allowed, however I can't seem to be able to define my sister as the child of my...

Family tree with SWI-Prolog Family tree with SWI-Prolog family-tree prolog logic Family SWI-Prolog ZFather ZChild Family tree with SWI-Prolog I am trying to get a simple family tree to work with Prolog using a maximum of 3 facts being allowed, however I can't seem to be able to define my sister as the child of my paren...

[ 0.0301513671875, 0.005828857421875, -0.0096435546875, 0.01373291015625, -0.0181884765625, -0.0037689208984375, -0.007354736328125, 0.00421142578125, 0.01239013671875, -0.04638671875, 0.00677490234375, -0.031982421875, -0.01336669921875, 0.0118408203125, 0.01953125, 0.01611328125, 0.0...

[ 59745, 53201, 678, 159, 38969, 10752, 4867, 14449, 62600, 502, 62775, 567, 17647, 9319, 441, 102656, 8781, 4488, 1250, 38132, 138, 15824, 107003, 61924, 759, 114015, 237, 29041, 111, 27863, 10644, 23, 67373, 1511, 4734, 45831, 163, 959, 78,...

[ 0.098876953125, 0.231201171875, 0.044403076171875, 0.05767822265625, 0.2025146484375, 0.1187744140625, 0.2047119140625, 0.0933837890625, 0.191162109375, 0.0872802734375, 0.1116943359375, 0.1297607421875, 0.1527099609375, 0.1295166015625, 0.0225982666015625, 0.155517578125, 0.06671142...

embed

35768069_c0

35768069

prolog

0

Title: create list without findall in prolog Problem title: create list without findall in prolog Tags: prolog, recursion Problem: create list without findall in prolog I'm working on a predicate to generate a list of values from rules. I have these rules: casilla(1,4,1,1,3). casilla(1,4,1,2,1). casilla(1,4,1,3,2). cas...

create list without findall in prolog create list without findall in prolog prolog recursion BOARD createBoard2 Difficulty VALUE create list without findall in prolog I'm working on a predicate to generate a list of values from rules. I have these rules: and I need to save the last value of each rule in a list, for exa...

[ 0.01129150390625, -0.0028076171875, -0.00994873046875, 0.0186767578125, -0.0062255859375, 0.0033416748046875, -0.026123046875, 0.0234375, 0.01116943359375, -0.034912109375, -0.009521484375, -0.01416015625, 0.008544921875, -0.008056640625, 0.0186767578125, 0.01531982421875, 0.01263427...

[ 28282, 5303, 15490, 7413, 5584, 502, 4867, 23, 195625, 14216, 49444, 12647, 5861, 304, 191144, 71333, 55991, 20697, 2063, 139392, 142424, 91736, 30098, 4568, 34292, 111, 12638, 79986, 9790, 5844, 11907, 12830, 3173, 28219, 18499, 4734, 30646, ...

[ 0.1202392578125, 0.210205078125, 0.12451171875, 0.1334228515625, 0.20263671875, 0.134033203125, 0.2283935546875, 0.00433349609375, 0.1376953125, 0.084228515625, 0.0831298828125, 0.0933837890625, 0.1180419921875, 0.0811767578125, 0.0718994140625, 0.09564208984375, 0.14013671875, 0.0...

embed

62031110_c0

62031110

prolog

0

Title: How to exclude all countries that have flag with primary colour in prolog? Problem title: How to exclude all countries that have flag with primary colour in prolog? Tags: prolog Problem: How to exclude all countries that have flag with primary colour in prolog? I have a set of facts on prolog as follows: primary...

How to exclude all countries that have flag with primary colour in prolog? How to exclude all countries that have flag with primary colour in prolog? prolog How How to exclude all countries that have flag with primary colour in prolog? I have a set of facts on prolog as follows: i want to run a query to return a list o...

[ -0.01446533203125, 0.006683349609375, 0.00087738037109375, 0.0125732421875, -0.003143310546875, -0.0128173828125, -0.000640869140625, 0.01190185546875, -0.00726318359375, -0.0089111328125, -0.00177001953125, -0.00885009765625, -0.0184326171875, -0.0225830078125, 0.0027008056640625, 0.0...

[ 11249, 47, 39041, 112, 756, 76726, 450, 765, 49938, 678, 158978, 134855, 23, 502, 4867, 15824, 98, 11675, 41, 30646, 5303, 124901, 959, 70541, 1528, 68360, 4734, 18151, 4488, 2967, 37863, 13, 214, 351, 42072 ]

[ 0.087158203125, 0.0638427734375, 0.191650390625, 0.1214599609375, 0.09808349609375, 0.189208984375, 0.04962158203125, 0.06878662109375, 0.2371826171875, 0.08642578125, 0.16015625, 0.203125, 0.041107177734375, 0.1656494140625, 0.2340087890625, 0.08758544921875, 0.04632568359375, 0.0...

embed

63314500_c0

63314500

prolog

0

Title: How to join rules and print out outputs in prolog Problem title: How to join rules and print out outputs in prolog Tags: prolog Problem: How to join rules and print out outputs in prolog I have list of facts as follows. items(itemId('P01'),prodName('Pots'),stockQty(50),price(8200)). items(itemId('P02'),prodName(...

How to join rules and print out outputs in prolog How to join rules and print out outputs in prolog prolog How P01 Pots P02 Pans P03 Spoons P04 Forks P05 Kettles P06 Plates print_all_products How to join rules and print out outputs in prolog I have list of facts as follows. How to print on the console something like th...

[ 0.0224609375, -0.0013275146484375, 0.0003948211669921875, 0.0257568359375, 0.00933837890625, 0.0159912109375, -0.0206298828125, 0.002044677734375, 0.003936767578125, -0.00787353515625, 0.02490234375, -0.0181884765625, 0.017822265625, -0.01068115234375, -0.01177978515625, 0.005401611328...

[ 11249, 33284, 91736, 136, 28412, 1810, 140992, 502, 4867, 7, 436, 6746, 13762, 9550, 4378, 9513, 23172, 5245, 7709, 1326, 1224, 8194, 171056, 1577, 9016, 22387, 5584, 57877, 23, 5303, 15824, 98, 130250, 1884, 25632, 3229, 75101, 34475, 1575...

[ 0.06329345703125, 0.2073974609375, 0.1947021484375, 0.04437255859375, 0.2236328125, 0.1646728515625, 0.2119140625, 0.160400390625, 0.254638671875, 0.0251007080078125, 0.009490966796875, 0.0648193359375, 0.118408203125, 0.008636474609375, 0.0677490234375, 0.02972412109375, 0.096557617...

embed

15674669_c1

15674669

prolog

1

stack clauselist (counter + 1) substitutions variablesinquery answers else raise BackTrack with Queue.Empty -> let answers = buildanswer substitutions variablesinquery :: answers in raise BackTrack The only computation that's happening on tempstack is that new goals are being inserted into it using another function (s...

[ 0.0115966796875, 0.0299072265625, 0.016357421875, 0.0263671875, -0.0002422332763671875, -0.0184326171875, -0.0123291015625, -0.0224609375, 0.013916015625, -0.005950927734375, -0.015869140625, 0.02685546875, 0.00604248046875, 0.005523681640625, 0.00408935546875, 0.002685546875, -0.014...

[ 177261, 70731, 13, 6562, 71013, 997, 161740, 17514, 77336, 944, 35166, 138804, 26828, 618, 86147, 5813, 13388, 134332, 939, 2633, 45367, 10133, 6488, 4734, 181135, 1363, 123087, 4109, 102, 2594, 3525, 109458, 183540, 15700, 32354, 590, 7177, ...

[ 0.2340087890625, 0.084228515625, 0.0153045654296875, 0.1396484375, 0.03656005859375, 0.0706787109375, 0.143798828125, 0.0293731689453125, 0.1619873046875, 0.11328125, 0.1416015625, 0.183349609375, 0.1240234375, 0.0657958984375, 0.201416015625, 0.10711669921875, 0.1300048828125, 0.0...

embed

11021330_c0

11021330

prolog

0

Title: Is there a library/technique to collect statistics for optimal clause ordering in Prolog? Problem title: Is there a library/technique to collect statistics for optimal clause ordering in Prolog? Tags: swi-prolog, sicstus-prolog, prolog, performance, optimization Problem: Is there a library/technique to collect s...

Is there a library/technique to collect statistics for optimal clause ordering in Prolog? Is there a library/technique to collect statistics for optimal clause ordering in Prolog? swi-prolog sicstus-prolog prolog performance optimization Prolog Is there a library/technique to collect statistics for optimal clause order...

[ 0.0289306640625, 0.00946044921875, -0.0008392333984375, -0.004730224609375, -0.0301513671875, 0.0000362396240234375, -0.00787353515625, -0.0189208984375, -0.002593994140625, -0.0086669921875, 0.01220703125, 0.0052490234375, -0.007171630859375, -0.0322265625, 0.00799560546875, 0.0035095...

[ 35773, 1294, 20489, 45602, 43799, 80835, 7, 100, 24087, 70731, 13, 12989, 214, 1250, 4867, 47, 2452, 3454, 26536, 18253, 502, 23718, 87235, 2685, 10, 64, 23, 32562, 1528, 1957, 2174, 79315, 14858, 17311, 103510, 29479, 79986, 90, 8335, 30...

[ 0.2099609375, 0.1279296875, 0.1114501953125, 0.1260986328125, 0.1898193359375, 0.259521484375, 0.1341552734375, 0.03515625, 0.1871337890625, 0.2044677734375, 0.12158203125, 0.2181396484375, 0.08935546875, 0.175048828125, 0.26220703125, 0.009796142578125, 0.1131591796875, 0.11132812...

embed

58875339_c0

58875339

prolog

0

Title: Why is my prolog predicate stop when it gets the first answer? Problem title: Why is my prolog predicate stop when it gets the first answer? Tags: prolog, chatbot Problem: Why is my prolog predicate stop when it gets the first answer? I have this predicate: ans(["Hello"],0). ans(["Hello", "dear", "customer"],0)....

Why is my prolog predicate stop when it gets the first answer? Why is my prolog predicate stop when it gets the first answer? prolog chatbot Why Hello Good Morning Afternoon Night List Why is my prolog predicate stop when it gets the first answer? I have this predicate: This predicate receives a list of atoms and shoul...

[ 0.0040283203125, -0.0169677734375, 0.0123291015625, 0.0230712890625, -0.0091552734375, 0.0277099609375, 0.0034332275390625, 0.0123291015625, 0.01068115234375, -0.046630859375, 0.00408935546875, 0.004150390625, 0.0062255859375, 0.001129150390625, 0.03173828125, 0.0240478515625, 0.0288...

[ 44084, 83, 759, 502, 4867, 1653, 2063, 67, 7279, 3229, 62163, 5117, 35166, 3245, 9190, 35378, 18621, 163710, 24372, 157, 36151, 32036, 70, 53299, 5303, 34627, 30646, 45646, 7210, 14858, 678, 13817, 866, 339, 2203, 10133, 757, 147, 5928, 4...

[ 0.1280517578125, 0.032470703125, 0.03875732421875, 0.1898193359375, 0.229736328125, 0.184326171875, 0.20458984375, 0.09765625, 0.2154541015625, 0.0458984375, 0.0899658203125, 0.1483154296875, 0.1934814453125, 0.0634765625, 0.1148681640625, 0.16162109375, 0.0943603515625, 0.16479492...

embed

7777991_c0

7777991

prolog

0

Title: read line to atomic list in prolog Problem title: read line to atomic list in prolog Tags: swi-prolog, prolog Problem: read line to atomic list in prolog I need to read any line (from user_input) into an atomic list, e.g.: Example line, which contains any ASCII chars. into: [Example,'line,',which,contains,any,AS...

read line to atomic list in prolog read line to atomic list in prolog swi-prolog prolog Example ASCII read_line_to_codes user_input Input atom_codes atomic_list_concat AlistI string_to_atom read line to atomic list in prolog I need to read any line (from user_input) into an atomic list, e.g.: into: what I've got so far...

[ -0.01513671875, -0.0184326171875, -0.00017070770263671875, 0.03173828125, -0.0177001953125, 0.01544189453125, 0.019775390625, 0.01373291015625, -0.0072021484375, -0.058837890625, -0.005126953125, 0.000827789306640625, -0.01458740234375, 0.00115966796875, -0.00262451171875, -0.017822265...

[ 12301, 13315, 47, 34627, 1771, 5303, 23, 502, 4867, 2452, 3454, 89536, 125429, 10001, 2256, 188, 40899, 38937, 73, 7077, 6562, 2271, 4460, 568, 79315, 11, 5928, 3871, 2499, 161063, 3934, 2367, 87, 4163, 221, 2060, 4734, 43240, 11001, 3415...

[ 0.2200927734375, 0.2008056640625, 0.1270751953125, 0.2005615234375, 0.1376953125, 0.230224609375, 0.04339599609375, 0.162353515625, 0.221923828125, 0.142822265625, 0.13232421875, 0.05523681640625, 0.04437255859375, 0.08587646484375, 0.186279296875, 0.156982421875, 0.204833984375, 0...

embed

34892545_c0

34892545

prolog

0

Title: Prolog. In a query, how to put a condition on a variable that I do not want in the results? Problem title: Prolog. In a query, how to put a condition on a variable that I do not want in the results? Tags: prolog-toplevel, prolog Problem: Prolog. In a query, how to put a condition on a variable that I do not want...

Prolog. In a query, how to put a condition on a variable that I do not want in the results? Prolog. In a query, how to put a condition on a variable that I do not want in the results? prolog-toplevel prolog Prolog Prolog. In a query, how to put a condition on a variable that I do not want in the results? Imagine that I...

[ 0.024169921875, 0.0216064453125, 0.0086669921875, 0.01007080078125, -0.006744384765625, 0.0137939453125, -0.005157470703125, 0.015625, -0.003997802734375, -0.0299072265625, 0.0152587890625, 0.0002593994140625, -0.01385498046875, 0.006591796875, 0.021240234375, 0.00167083740234375, 0....

[ 1250, 4867, 41, 1294, 3642, 47, 3884, 35431, 98, 77336, 450, 87, 54, 959, 3444, 50339, 10, 502, 13784, 67919, 360, 23, 133196, 25632, 51359, 3647, 76199, 12638, 3445, 1919, 5117, 9351, 32070, 456, 3996, 3134, 756, 114210, 3501, 387, 536...

[ 0.1744384765625, 0.26025390625, 0.17138671875, 0.138671875, 0.111572265625, 0.032470703125, 0.191162109375, 0.263916015625, 0.1612548828125, 0.266845703125, 0.106689453125, 0.0830078125, 0.1580810546875, 0.21923828125, 0.218017578125, 0.1474609375, 0.076171875, 0.09735107421875, ...

embed

61447526_c0

61447526

prolog

0

Title: Accessing elements inside parenthesis in Prolog Problem title: Accessing elements inside parenthesis in Prolog Tags: prolog, list Problem: Accessing elements inside parenthesis in Prolog So i have this predicate letras_comuns(Lst_Pals, Letras_comuns) in which Lst_Pals is a list of like [[a,t,o],[a,c,o],[a,n,o]] ...

Accessing elements inside parenthesis in Prolog Accessing elements inside parenthesis in Prolog prolog list Accessing Prolog letras_comuns Lst_Pals Accessing elements inside parenthesis in Prolog So i have this predicate letras_comuns(Lst_Pals, Letras_comuns) in which Lst_Pals is a list of like [[a,t,o],[a,c,o],[a,n,o]...

[ -0.01019287109375, -0.0181884765625, -0.00396728515625, 0.03564453125, 0.00408935546875, 0.0245361328125, 0.001739501953125, 0.005859375, 0.0030517578125, -0.048095703125, 0.0240478515625, 0.0031890869140625, 0.003143310546875, -0.00982666015625, -0.00848388671875, 0.01092529296875, ...

[ 40266, 214, 80854, 46132, 49129, 160291, 7, 1250, 4867, 502, 5303, 111154, 277, 309, 339, 271, 81841, 1653, 2063, 866, 102690, 18, 31, 756, 39210, 11907, 2565, 63262, 11, 6896, 26950, 34153, 454, 5007, 10, 36, 138, 4216, 19777, 2967, 34...

[ 0.2142333984375, 0.000762939453125, 0.1837158203125, 0.1640625, 0.1650390625, 0.2008056640625, 0.1114501953125, 0.160888671875, 0.266357421875, 0.119140625, 0.119140625, 0.228271484375, 0.14306640625, 0.1671142578125, 0.057830810546875, 0.1072998046875, 0.2005615234375, 0.043090820...

embed

25945167_c0

25945167

prolog

0

Title: Prolog beginner here Problem title: Prolog beginner here Tags: prolog Problem: Prolog beginner here hasAccount(Person,Bank,Amount) – the Person has an account at the Bank with the balance Amount, lives(Person,City) – the Person lives in the City, created(Person,Bank,Month,Year) – the Person opened an account at ...

Prolog beginner here Prolog beginner here prolog Prolog Person Bank Amount City Month Year Someone Bank1 Balance1 Bank2 Balance2 metro_credit_union toronto_dominion Yes Prolog beginner here hasAccount(Person,Bank,Amount) – the Person has an account at the Bank with the balance Amount, lives(Person,City) – the Person li...

[ 0.0177001953125, 0.000553131103515625, -0.00018310546875, 0.0157470703125, -0.01324462890625, 0.004730224609375, 0.00168609619140625, 0.034423828125, 0.0191650390625, -0.00860595703125, 0.0255126953125, 0.005950927734375, -0.0020599365234375, -0.00787353515625, 0.00732421875, -0.006744...

[ 1250, 4867, 9842, 1679, 3688, 502, 15270, 4932, 121147, 6406, 12982, 42552, 3630, 131176, 23205, 45639, 87046, 9983, 40863, 68131, 1830, 32635, 1556, 39450, 71013, 160054, 70323, 284, 15426, 99, 40197, 60742, 115411, 75935, 146794, 69085, 14209...

[ 0.20068359375, 0.2685546875, 0.1392822265625, 0.130126953125, 0.1668701171875, 0.162109375, 0.14453125, 0.177978515625, 0.18310546875, 0.112060546875, 0.0550537109375, 0.088623046875, 0.0163421630859375, 0.1376953125, 0.07940673828125, 0.101806640625, 0.09478759765625, 0.0739746093...

embed

13690350_c0

13690350

prolog

0

Title: Plausible scenario for Prolog or any other logical programing language Problem title: Plausible scenario for Prolog or any other logical programing language Tags: 3d, animation, declarative, prolog Problem: Plausible scenario for Prolog or any other logical programing language As someone who does computer animat...

Plausible scenario for Prolog or any other logical programing language Plausible scenario for Prolog or any other logical programing language 3d animation declarative prolog Plausible Prolog Plausible scenario for Prolog or any other logical programing language As someone who does computer animation, is the following s...

[ 0.005767822265625, 0.017822265625, -0.00145721435546875, 0.0201416015625, 0.0032196044921875, 0.0269775390625, -0.004302978515625, -0.0115966796875, 0.002471923828125, -0.047119140625, 0.0045166015625, 0.0205078125, -0.015380859375, 0.002410888671875, 0.005615234375, 0.00665283203125, ...

[ 8950, 34, 55356, 106117, 1250, 4867, 62775, 1528, 46876, 100, 138, 71, 114205, 21635, 502, 14602, 13909, 25632, 65933, 28282, 28302, 678, 397, 3299, 10269, 49520, 4393, 62816, 34053, 27744, 6226, 7228, 65998, 26698, 756, 77336, 234873, 36746,...

[ 0.1632080078125, 0.156982421875, 0.1790771484375, 0.2261962890625, 0.1756591796875, 0.2431640625, 0.20361328125, 0.1798095703125, 0.1396484375, 0.00274658203125, 0.1151123046875, 0.06878662109375, 0.1795654296875, 0.148193359375, 0.108154296875, 0.008087158203125, 0.0947265625, 0.0...

embed

61743499_c0

61743499

prolog

0

Title: Prolog File not being read despite file existing Problem title: Prolog File not being read despite file existing Tags: prolog Problem: Prolog File not being read despite file existing Good day! I wrote a load_rules to be able to read files that I would be utilizing in my Prolog program. However, it seems that Pr...

Prolog File not being read despite file existing Prolog File not being read despite file existing prolog a Prolog File load_rules clear_db lod_ruls read_word_list formal_english joggers_facts_and_rules ERROR source_sink formal_english.pl:88 Note Re-run Undefined Directives See FAQ www.swi-prolog.org ToplevelMode.txt ex...

[ 0.040283203125, -0.00335693359375, 0.0020751953125, 0.013671875, -0.01348876953125, 0.01904296875, -0.0021209716796875, 0.005828857421875, 0.006927490234375, -0.0361328125, 0.0177001953125, -0.00799560546875, -0.0179443359375, -0.0361328125, 0.0263671875, -0.020263671875, 0.002593994...

[ 1250, 4867, 42724, 959, 8035, 12301, 61518, 11435, 144573, 502, 72367, 13500, 34735, 48073, 45314, 47416, 6562, 23113, 13305, 8344, 26255, 114700, 151206, 31344, 14068, 2424, 12772, 16428, 5983, 42666, 60877, 2452, 3454, 4792, 67919, 9083, 1243...

[ 0.184326171875, 0.24853515625, 0.180908203125, 0.0953369140625, 0.050628662109375, 0.19677734375, 0.1326904296875, 0.18798828125, 0.188232421875, 0.1695556640625, 0.1319580078125, 0.12646484375, 0.09051513671875, 0.060455322265625, 0.0694580078125, 0.0745849609375, 0.09375, 0.15124...

embed

9518216_c0

9518216

prolog

0

Title: SWI Prolog ensure_loaded error Problem title: SWI Prolog ensure_loaded error Tags: swi-prolog, prolog, module Problem: SWI Prolog ensure_loaded error I am using SWI Prolog for a mathematical logic book and the book provided source code for some of the algorithms in Prolog. The problem is that when I try to load ...

SWI Prolog ensure_loaded error SWI Prolog ensure_loaded error swi-prolog prolog module SWI Prolog ensure_loaded load_files Non-module user:file_search_path SWI Prolog ensure_loaded error I am using SWI Prolog for a mathematical logic book and the book provided source code for some of the algorithms in Prolog. The probl...

[ 0.0208740234375, 0.014404296875, -0.004180908203125, 0.02734375, -0.01953125, 0.01373291015625, -0.0014495849609375, 0.003326416015625, -0.00677490234375, -0.07421875, 0.01263427734375, -0.00439453125, -0.01312255859375, -0.0174560546875, 0.0218505859375, 0.013427734375, -0.015197753...

[ 159, 38969, 1250, 4867, 63284, 63033, 297, 18499, 91, 2452, 3454, 502, 88996, 72367, 29822, 3775, 83279, 38937, 86250, 128405, 17368, 140363, 62775, 12877, 31344, 18151, 234873, 2967, 9790, 11435, 29481, 56, 105876, 1884, 2684, 102158, 4034, ...

[ 0.0760498046875, 0.244140625, 0.1810302734375, 0.2178955078125, 0.2880859375, 0.237060546875, 0.0684814453125, 0.1805419921875, 0.00335693359375, 0.1917724609375, 0.07562255859375, 0.1064453125, 0.1654052734375, 0.216796875, 0.1226806640625, 0.038787841796875, 0.1678466796875, 0.09...

embed

52917203_c0

52917203

prolog

0

Title: Prolog search key/value list and output a list of values Problem title: Prolog search key/value list and output a list of values Tags: prolog Problem: Prolog search key/value list and output a list of values I'm once again stuck with a pretty simple Prolog task. I want to define a predicate kv_search/3 that take...

Prolog search key/value list and output a list of values Prolog search key/value list and output a list of values prolog Prolog kv_search kv_find Rest Result Prolog search key/value list and output a list of values I'm once again stuck with a pretty simple Prolog task. I want to define a predicate kv_search/3 that take...

[ 0.004730224609375, -0.000865936279296875, 0.0059814453125, -0.027099609375, -0.01385498046875, 0.0048828125, -0.0159912109375, -0.005462646484375, 0.007598876953125, 0.007293701171875, 0.0098876953125, -0.0235595703125, 0.0113525390625, -0.00070953369140625, 0.007476806640625, -0.00308...

[ 1250, 4867, 33938, 22799, 64, 27494, 13, 5303, 140992, 142424, 111, 502, 26687, 86250, 111607, 49756, 126684, 179933, 8781, 66211, 3444, 61924, 1653, 2063, 67, 18113, 51776, 275, 617, 1019, 1126, 963, 5117, 10750, 17932, 756, 50960, 43581, ...

[ 0.1552734375, 0.2257080078125, 0.1907958984375, 0.1851806640625, 0.00048828125, 0.184814453125, 0.01275634765625, 0.1787109375, 0.192138671875, 0.2015380859375, 0.014862060546875, 0.11181640625, 0.1446533203125, 0.1993408203125, 0.1041259765625, 0.1756591796875, 0.1546630859375, 0....

embed

23019878_c0

23019878

prolog

0

Title: Prolog - implementing formula of area Problem title: Prolog - implementing formula of area Tags: prolog Problem: Prolog - implementing formula of area I want to calculate the area of a polygon in Prolog. The area of a polygon is given by the formula: | {(x1*y2-y1*x2) + (x2*y3-y2*x3) + .... + (xn*y1 - yn*x1)}/2 |...

Prolog - implementing formula of area Prolog - implementing formula of area prolog Prolog y2-y1 y3-y2 Points Area List Acc areaAcc2 FirstX FirstY NewAcc Prolog - implementing formula of area I want to calculate the area of a polygon in Prolog. The area of a polygon is given by the formula: where (x1,y1),(x2,y2)....(xn,...

[ 0.02587890625, 0.0052490234375, -0.0047607421875, 0.0098876953125, -0.01220703125, 0.01513671875, -0.00665283203125, 0.0228271484375, 0.03125, -0.01483154296875, 0.0283203125, -0.006011962890625, -0.00836181640625, -0.0174560546875, 0.005401611328125, 0.004241943359375, 0.00277709960...

[ 1250, 4867, 29479, 26168, 111, 16128, 20, 214, 502, 113, 18504, 53, 418, 27495, 304, 41097, 79200, 32036, 29899, 10060, 23972, 1542, 1723, 2356, 87, 3444, 74481, 67, 70, 10, 35874, 6126, 23, 83, 34475, 390, 7440, 425, 17727, 10461, 19, ...

[ 0.213623046875, 0.282470703125, 0.1912841796875, 0.233154296875, 0.124755859375, 0.2486572265625, 0.001007080078125, 0.019256591796875, 0.136474609375, 0.05413818359375, 0.1181640625, 0.06622314453125, 0.05267333984375, 0.06939697265625, 0.1353759765625, 0.1533203125, 0.2646484375, ...

embed

71596841_c0

71596841

prolog

0

Title: prolog store a list in a variable Problem title: prolog store a list in a variable Tags: prolog Problem: prolog store a list in a variable prod([[vin(110 "Mercurey", 1978, 13), vin(120, "Macon", 1977, 12)], [viticulteur("Nicolas","Pouilly","Bourgogne"), viticulteur("Martin","Bordaux","Bordelais")]], R) This pred...

prolog store a list in a variable prolog store a list in a variable prolog Mercurey Macon Nicolas Pouilly Bourgogne Martin Bordaux Bordelais Python vin6 prolog store a list in a variable This predicate is returning a list: I want to store this list "R" in a variable on my program. How can I do that? What I want to do i...

[ 0.015625, -0.00176239013671875, 0.01397705078125, 0.031494140625, 0.000591278076171875, 0.012939453125, -0.0264892578125, 0.000728607177734375, 0.01397705078125, -0.031494140625, 0.020263671875, 0.01513671875, -0.002471923828125, -0.01275634765625, -0.006927490234375, 0.00860595703125,...

[ 502, 4867, 4343, 5303, 23, 10, 77336, 123106, 7460, 4727, 191, 115963, 37962, 114833, 182359, 1663, 86, 6470, 48606, 10442, 13, 19164, 145581, 3862, 910, 1653, 2063, 67, 30646, 3444, 47, 903, 1052, 759, 1528, 831, 54, 450, 1660, 1884 ]

[ 0.200927734375, 0.296630859375, 0.23046875, 0.25439453125, 0.1241455078125, 0.0335693359375, 0.313232421875, 0.17578125, 0.1141357421875, 0.087646484375, 0.13330078125, 0.1224365234375, 0.0948486328125, 0.14794921875, 0.02813720703125, 0.045654296875, 0.0218963623046875, 0.11767578...

embed

24322526_c0

24322526

prolog

0

Title: Reading from user_input causes ":|" to appear in output Problem title: Reading from user_input causes ":|" to appear in output Tags: swi-prolog, prolog Problem: Reading from user_input causes ":|" to appear in output My code is using read_line_to_codes/2 and read_stream_to_codes/2 in order to...

Reading from user_input causes ":|" to appear in output Reading from user_input causes ":|" to appear in output swi-prolog prolog user_input Reading read_line_to_codes read_stream_to_codes Some program.pl Reading from user_input causes ":|" to appear in output My code is using read_line_to_codes/2 a...

[ 0.004974365234375, 0.00823974609375, 0.007476806640625, -0.000827789306640625, -0.024658203125, -0.0062255859375, 0.004791259765625, 0.0174560546875, -0.01031494140625, -0.033447265625, 0.0031280517578125, -0.00750732421875, -0.0035400390625, 0.003173828125, 0.0113525390625, -0.0144653...

[ 104951, 1295, 38937, 73, 7077, 113660, 41502, 12, 58745, 1230, 108975, 140992, 2452, 3454, 4867, 502, 12301, 2256, 188, 40899, 86429, 1528, 2424, 23, 18151, 12477, 7, 5808, 9969, 49725, 75101, 127877, 5885, 5201, 678, 124850, 91, 130250, 45...

[ 0.219482421875, 0.16552734375, 0.20458984375, 0.1741943359375, 0.1917724609375, 0.1419677734375, 0.08917236328125, 0.11669921875, 0.175537109375, 0.056121826171875, 0.136962890625, 0.2227783203125, 0.1693115234375, 0.090087890625, 0.1663818359375, 0.0791015625, 0.1922607421875, 0.1...

embed

61851162_c1

61851162

prolog

1

and "the step is positive" is given by the following subset of clauses matching the terms int(End) and pos(Step) : % --- % Case of "positive step" pos(Step) and "integer end" int(End) (not infinite end) % --- % Past end of sequence. Occurs only if the sequence is empty on entry. between_enum(Start,int(End),pos(_),_) :...

[ -0.0172119140625, -0.00836181640625, 0.015869140625, 0.01025390625, 0.0003223419189453125, 0.0150146484375, 0.006134033203125, 0.0019989013671875, 0.0181884765625, 0.0167236328125, 0.0078125, 0.0198974609375, -0.0126953125, 0.018798828125, 0.0191650390625, -0.004119873046875, 0.02087...

[ 136, 2347, 29954, 83, 24491, 34475, 390, 25632, 1614, 3509, 70731, 90, 14858, 69407, 23, 18, 152378, 3864, 191644, 1745, 43731, 67890, 4935, 6191, 1505, 3564, 10869, 54241, 3805, 40, 944, 3956, 48650, 4734, 201505, 42805, 17721, 316, 126597...

[ 0.0199737548828125, 0.1087646484375, 0.287109375, 0.10662841796875, 0.279541015625, 0.140869140625, 0.0281829833984375, 0.038421630859375, 0.056915283203125, 0.05523681640625, 0.138427734375, 0.049957275390625, 0.1119384765625, 0.1046142578125, 0.0750732421875, 0.10205078125, 0.18615...

embed

39780250_c1

39780250

prolog

1

= X, L = B. removespider([A|B],X,L) :- not(A = X), removespider(B,X,M), L = [A|M]. removeconspirators([],D,L) :- L = []. removeconspirators(E,[],L) :- L = E. removeconspirators([A],[B],L) :- A = B, L = []. removeconspirators([A],[B],L) :- not(A = B), L = [A]. removeconspirators([A,B|C],[D],L) :- A = D, L = [B|C]. remo...

[ -0.00555419921875, 0.0213623046875, -0.0015106201171875, 0.016357421875, -0.022216796875, -0.002227783203125, -0.004547119140625, -0.007568359375, 0.0019989013671875, -0.025146484375, -0.000629425048828125, 0.0146484375, -0.0169677734375, 0.00384521484375, 0.01446533203125, 0.023071289...

[ 2203, 1193, 339, 335, 87388, 44689, 820, 58745, 571, 1542, 866, 15772, 959, 284, 594, 54547, 22230, 397, 241, 62, 391, 541, 26265, 47, 16195, 1090, 68998, 408, 1229, 756, 84797, 30646, 29568, 5, 11782, 132, 2301, 18, 2046, 17262, 51347,...

[ 0.15576171875, 0.1654052734375, 0.1397705078125, 0.1234130859375, 0.17236328125, 0.118896484375, 0.1484375, 0.0305023193359375, 0.09033203125, 0.169677734375, 0.1156005859375, 0.05999755859375, 0.10009765625, 0.0276947021484375, 0.0423583984375, 0.1558837890625, 0.0733642578125, 0....

embed

16085748_c1

16085748

prolog

1

= henry ; X = elizabeth, Y = andrew ; X = elizabeth, Y = beatrice ; X = elizabeth, Y = eugenie ; X = elizabeth, Y = edward ; X = elizabeth, Y = viscount ; X = elizabeth, Y = louise ; After this point, when i try to go the Anne family it goes wrong. X = anne, Y = peter ; X = anne, Y = savanna ; X = anne, Y = isla ; X =...

[ 0.0022735595703125, 0.008056640625, -0.000843048095703125, 0.022216796875, -0.004119873046875, -0.004364013671875, -0.0247802734375, 0.01129150390625, 0.0031585693359375, -0.00958251953125, -0.001434326171875, 0.0025787353515625, -0.003509521484375, 0.0057373046875, 0.004180908203125, ...

[ 2203, 8311, 1294, 2819, 1193, 88, 7337, 86077, 4, 990, 2528, 434, 42659, 32512, 1175, 429, 701, 2223, 19364, 4498, 71013, 459, 34, 3075, 24372, 903, 6275, 3229, 17, 9790, 738, 70, 14245, 14449, 442, 60899, 44691, 42230, 154643, 14880, 6...

[ 0.1956787109375, 0.138671875, 0.2083740234375, 0.058197021484375, 0.1982421875, 0.053009033203125, 0.1256103515625, 0.22265625, 0.02325439453125, 0.2122802734375, 0.1375732421875, 0.159423828125, 0.084228515625, 0.1533203125, 0.0303497314453125, 0.10400390625, 0.10369873046875, 0.0...

embed

49225025_c0

49225025

prolog

0

Title: Create a predicate that returns lists that meet certain conditions Problem title: Create a predicate that returns lists that meet certain conditions Tags: prolog, list Problem: Create a predicate that returns lists that meet certain conditions I was trying to create a predicate example(N, L) , where L is a list ...

Create a predicate that returns lists that meet certain conditions Create a predicate that returns lists that meet certain conditions prolog list Create Create a predicate that returns lists that meet certain conditions I was trying to create a predicate example(N, L) , where L is a list that for given N: has length 2*...

[ -0.00250244140625, 0.00958251953125, -0.014892578125, -0.00372314453125, -0.01312255859375, 0.0302734375, 0.005706787109375, 0.00665283203125, 0.00897216796875, -0.0184326171875, 0.0211181640625, 0.0036163330078125, 0.0120849609375, -0.00921630859375, -0.01458740234375, 0.0311279296875...

[ 151313, 1653, 2063, 67, 450, 30646, 5303, 7, 23356, 24233, 27289, 502, 4867, 10, 31577, 28282, 27781, 839, 339, 34475, 541, 1556, 140909, 116, 1639, 11907, 14012, 106, 47, 83, 14037, 66161, 186351, 17721, 6626, 108975, 5701, 3853, 3789, 1...

[ 0.1724853515625, 0.2296142578125, 0.259033203125, 0.1448974609375, 0.0379638671875, 0.1861572265625, 0.256103515625, 0.054656982421875, 0.1722412109375, 0.1199951171875, 0.21875, 0.1492919921875, 0.2198486328125, 0.005126953125, 0.0828857421875, 0.1583251953125, 0.1646728515625, 0....

embed

50238915_c0

50238915

prolog

0

Title: Prolog recursive list shuffling Problem title: Prolog recursive list shuffling Tags: prolog Problem: Prolog recursive list shuffling Revising for a prolog exam and working through past papers that we don't have answers for and I've got stuck halfway through a problem and I was really hoping for some help! The qu...

Prolog recursive list shuffling Prolog recursive list shuffling prolog Prolog Prolog recursive list shuffling Revising for a prolog exam and working through past papers that we don't have answers for and I've got stuck halfway through a problem and I was really hoping for some help! The question: Write a predicate perm...

[ -0.005584716796875, 0.0057373046875, 0.025390625, -0.006561279296875, 0.0030059814453125, 0.0186767578125, -0.04638671875, -0.019287109375, 0.005584716796875, -0.0216064453125, 0.01397705078125, -0.00004649162292480469, 0.00180816650390625, 0.00121307373046875, 0.00171661376953125, 0.0...

[ 1250, 4867, 195625, 5844, 5303, 8633, 4902, 2069, 502, 63441, 42276, 11015, 15122, 765, 35166, 179933, 2967, 509, 6183, 156377, 100, 4358, 9655, 18781, 1653, 2063, 67, 117, 561, 1542, 990, 7, 9023, 2198, 13566, 80854, 1193, 113054, 91, 15...

[ 0.165283203125, 0.21484375, 0.2191162109375, 0.08984375, 0.189453125, 0.139404296875, 0.184814453125, 0.0208892822265625, 0.1380615234375, 0.046356201171875, 0.09405517578125, 0.013153076171875, 0.03717041015625, 0.006988525390625, 0.1416015625, 0.06561279296875, 0.04840087890625, ...

embed

55304542_c0

55304542

prolog

0

Title: turn Predicate; How do you append a sublist of reversed elements to a list? Problem title: turn Predicate; How do you append a sublist of reversed elements to a list? Tags: prolog Problem: turn Predicate; How do you append a sublist of reversed elements to a list? turn\3 takes two lists as input, the original, a...

turn Predicate; How do you append a sublist of reversed elements to a list? turn Predicate; How do you append a sublist of reversed elements to a list? prolog Predicate How Reversed turn Predicate; How do you append a sublist of reversed elements to a list? turn\3 takes two lists as input, the original, and the toggles...

[ -0.00433349609375, 0.009521484375, 0.036376953125, 0.000946044921875, -0.0201416015625, 0.0228271484375, -0.005767822265625, 0.02392578125, 0.0125732421875, -0.005035400390625, 0.004302978515625, 0.02978515625, -0.01165771484375, 0.01361083984375, 0.004241943359375, 0.0133056640625, ...

[ 15504, 7145, 2063, 67, 11249, 114689, 71, 1614, 6562, 39531, 5281, 80854, 47, 5303, 54, 502, 4867, 853, 7864, 297, 41872, 363, 51776, 6626, 237, 107730, 7311, 129384, 12830, 32786, 5908, 12989, 756, 7103, 3642, 184, 2831, 83324, 9815, 206...

[ 0.2333984375, 0.1622314453125, 0.158447265625, 0.0865478515625, 0.07012939453125, 0.1348876953125, 0.0806884765625, 0.16064453125, 0.198486328125, 0.2099609375, 0.158935546875, 0.1627197265625, 0.09893798828125, 0.168701171875, 0.00146484375, 0.0272674560546875, 0.095458984375, 0.0...

embed

50304875_c0

50304875

prolog

0

Title: Prolog: Matrix operations Problem title: Prolog: Matrix operations Tags: prolog, matrix Problem: Prolog: Matrix operations I don't have a lot of experience in porgramming in Prolog. I am struggeling with writing rules for basic matrix operations. So I need these three operations for a matrix N : size(+N,-Num): r...

Prolog: Matrix operations Prolog: Matrix operations prolog matrix Prolog Matrix Num Value NewN size2 size1 Mss Mat Row Col Val nth1 ARow Prolog: Matrix operations I don't have a lot of experience in porgramming in Prolog. I am struggeling with writing rules for basic matrix operations. So I need these three operations ...

[ 0.01092529296875, -0.0028228759765625, 0.0244140625, -0.002838134765625, 0.0189208984375, -0.0098876953125, -0.00970458984375, 0.01220703125, 0.01275634765625, -0.00604248046875, 0.00897216796875, -0.01226806640625, -0.01409912109375, -0.0267333984375, -0.00439453125, 0.00262451171875,...

[ 1250, 4867, 12, 194234, 41018, 502, 50944, 52782, 190060, 2356, 839, 13267, 304, 418, 70802, 7656, 96190, 11554, 4769, 927, 8770, 5915, 16981, 196, 107415, 29686, 23359, 32562, 91736, 62822, 425, 3871, 6097, 17262, 541, 27781, 765, 1884, 90...

[ 0.1766357421875, 0.2340087890625, 0.0179290771484375, 0.2315673828125, 0.2314453125, 0.1265869140625, 0.1929931640625, 0.170166015625, 0.1978759765625, 0.110595703125, 0.1607666015625, 0.143310546875, 0.0219268798828125, 0.010162353515625, 0.056427001953125, 0.135986328125, 0.1514892...

embed

41284117_c0

41284117

prolog

0

Title: Finding the largest even number in list Problem title: Finding the largest even number in list Tags: prolog Problem: Finding the largest even number in list The point of this program is supposed to be to find the largest even number inside a list. For example, the query: ? - evenmax([1, 3, 9, 16, 25, -5, 18], X]...

Finding the largest even number in list Finding the largest even number in list prolog Finding seperate_list separate_list Even Odd find_max Max Finding the largest even number in list The point of this program is supposed to be to find the largest even number inside a list. For example, the query: The way I thought to...

[ 0.006561279296875, 0.0234375, 0.017578125, 0.00010013580322265625, -0.00799560546875, 0.045654296875, -0.0184326171875, 0.0123291015625, 0.00836181640625, -0.01483154296875, 0.0084228515625, -0.0234375, 0.00677490234375, -0.002044677734375, 0.0164794921875, -0.00811767578125, 0.00332...

[ 26040, 142105, 3853, 14012, 23, 5303, 70, 502, 4867, 40, 143870, 13, 6562, 84797, 31267, 67948, 7413, 24084, 9920, 6275, 1528, 134598, 46132, 41, 1294, 3917, 17569, 3934, 6626, 70270, 101935, 148436, 6528, 5646, 2606, 1297, 183037, 38132, 8...

[ 0.116455078125, 0.199462890625, 0.2230224609375, 0.1907958984375, 0.048583984375, 0.1993408203125, 0.04864501953125, 0.113037109375, 0.2003173828125, 0.001068115234375, 0.1175537109375, 0.0003662109375, 0.1844482421875, 0.127197265625, 0.1055908203125, 0.16650390625, 0.12646484375, ...

embed

24120534_c1

24120534

prolog

1

Id's %this seems wasteful protein_reactome_Id_to_Uniprot_Id(Reactome_Id, UniprotId), % a set of facts matching two types of id %used to generate uniprot ids findall(Value, uniProt_Sample_Probes(UniprotId,X,_,Value),Vs), Vs = [_|_], %Check list is not empty already delete(Vs,0,ListOfOnes), (ListOfOnes=[]-> (State is 0,...

[ -0.00153350830078125, -0.005828857421875, 0.00494384765625, 0.0106201171875, -0.0264892578125, -0.0004711151123046875, -0.00628662109375, -0.00323486328125, 0.0228271484375, -0.0283203125, -0.004150390625, 0.023681640625, 0.0036468505859375, 0.00171661376953125, 0.0169677734375, 0.0063...

[ 24799, 25, 1745, 100231, 37202, 509, 67, 7844, 21308, 1283, 44150, 282, 568, 71, 188, 85600, 18606, 4332, 47013, 13450, 11789, 10, 5423, 15824, 14858, 6626, 52895, 3447, 33740, 139392, 19844, 7413, 5584, 856, 50770, 10752, 18, 5464, 33209, ...

[ 0.1929931640625, 0.0274505615234375, 0.0836181640625, 0.1226806640625, 0.15478515625, 0.07598876953125, 0.08648681640625, 0.1422119140625, 0.2208251953125, 0.1104736328125, 0.10516357421875, 0.1177978515625, 0.10052490234375, 0.1541748046875, 0.10736083984375, 0.16748046875, 0.242431...

embed

49710365_c1

49710365

prolog

1

, 4, open). maze(small, 3, 5, open). maze(small, 3, 6, open). maze(small, 3, 7, open). maze(small, 4, 1, open). maze(small, 4, 2, barrier). maze(small, 4, 3, open). maze(small, 4, 4, open). maze(small, 4, 5, open). maze(small, 4, 6, open). maze(small, 4, 7, open). Each maze relation shown above first shows the size of ...

[ -0.005767822265625, -0.00482177734375, 0.006988525390625, 0.0146484375, 0.0172119140625, 0.0093994140625, 0.00164794921875, -0.002838134765625, 0.0140380859375, -0.00994873046875, -0.010986328125, -0.0106201171875, -0.00457763671875, -0.002288818359375, 0.009521484375, -0.0043640136718...

[ 201, 9803, 291, 731, 69070, 138, 190, 194, 305, 361, 125861, 98423, 41911, 5117, 45831, 13267, 176866, 12638, 6275, 17378, 59636, 1299, 25388, 8035, 32628, 7440, 831, 25813, 3687, 450, 18, 56136, 47, 2060, 24941, 80934, 28412, 441, 6796, ...

[ 0.15673828125, 0.1978759765625, 0.181640625, 0.26171875, 0.062744140625, 0.06658935546875, 0.0799560546875, 0.00653076171875, 0.038177490234375, 0.05474853515625, 0.2392578125, 0.0460205078125, 0.2093505859375, 0.000030517578125, 0.09210205078125, 0.09698486328125, 0.105224609375, ...

embed