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
75271024_c0	75271024	prolog	0	Title: How does prolog resolution use proof by contradiction? Problem title: How does prolog resolution use proof by contradiction? Tags: proof, prolog, logic-programming Problem: How does prolog resolution use proof by contradiction? I'm learning prolog, and I'm confused by the claim that prolog uses proof by contradi...	How does prolog resolution use proof by contradiction? How does prolog resolution use proof by contradiction? proof prolog logic-programming How tottenham_court_road leicester_square Therefore How does prolog resolution use proof by contradiction? I'm learning prolog, and I'm confused by the claim that prolog uses proo...	[ 0.0167236328125, 0.0157470703125, 0.00628662109375, 0.0159912109375, -0.002777099609375, -0.00836181640625, 0.007293701171875, 0.00787353515625, -0.0004329681396484375, -0.0223388671875, -0.021240234375, -0.0211181640625, -0.012939453125, 0.0115966796875, 0.002044677734375, 0.002288818...	[ 11249, 502, 4867, 158839, 4527, 6, 98869, 390, 2304, 428, 10763, 14602, 62775, 28966, 1186, 510, 3915, 118383, 52562, 95, 2980, 1515, 108047, 228072, 55681, 63043, 25632, 117233, 35509, 91736, 15824, 170920, 110680, 12301, 98441, 4420, 19364, ...	[ 0.079345703125, 0.1502685546875, 0.23291015625, 0.20166015625, 0.122802734375, 0.047637939453125, 0.2010498046875, 0.1356201171875, 0.1607666015625, 0.1448974609375, 0.168212890625, 0.03790283203125, 0.0892333984375, 0.09326171875, 0.028594970703125, 0.0916748046875, 0.141357421875, ...	embed
43214278_c1	43214278	prolog	1	#### */ ( semicolon(A,OUT) ) :- ( OUT = ( goal_true_false(A,(true),(throw({ problem: false , culprit: (A) , reporter: ';' }))) ) ) . ( goal_expansion(IIN,OUT) ) :- ( IIN = ( A ; B ; C ) , semicolon(A,A_SEMICOLON) , semicolon(B,B_SEMICOLON) , OUT = ( A_SEMICOLON , B_SEMICOLON ; C ) ) . ( goal_expansion(IIN,OUT) ) :- ( ...	#### */ ( semicolon(A,OUT) ) :- ( OUT = ( goal_true_false(A,(true),(throw({ problem: false , culprit: (A) , reporter: ';' }))) ) ) . ( goal_expansion(IIN,OUT) ) :- ( IIN = ( A ; B ; C ) , semicolon(A,A_SEMICOLON) , semicolon(B,B_SEMICOLON) , OUT = ( A_SEMICOLON , B_SEMICOLON ; C ) ) . ( goal_expansion(IIN,OUT) ) :- ( ...	[ 0.004852294921875, 0.04296875, 0.012939453125, 0.03515625, -0.0162353515625, 0.018798828125, -0.0067138671875, 0.01373291015625, -0.001312255859375, -0.0174560546875, 0.0283203125, 0.00150299072265625, -0.013671875, 0.006500244140625, 0.00811767578125, -0.01239013671875, 0.013671875,...	[ 187284, 661, 64, 15, 40, 46029, 4759, 284, 4, 52001, 15772, 2203, 69236, 9774, 8710, 184, 927, 15555, 2967, 98320, 57940, 5293, 18, 105757, 74, 32149, 83613, 66, 6889, 568, 8852, 87, 313, 454, 150576, 33028, 106699, 571, 62, 335, 32354,...	[ 0.1234130859375, 0.013427734375, 0.038787841796875, 0.0161895751953125, 0.126953125, 0.1851806640625, 0.2027587890625, 0.15185546875, 0.053955078125, 0.26904296875, 0.06756591796875, 0.05712890625, 0.2423095703125, 0.145751953125, 0.1204833984375, 0.060333251953125, 0.04150390625, ...	embed
7869709_c0	7869709	prolog	0	Title: Geometry analogy, why don't I get more answer? Problem title: Geometry analogy, why don't I get more answer? Tags: prolog Problem: Geometry analogy, why don't I get more answer? Here is my prolog code : figure(1, middle(circle, circle)). figure(2, top_left(circle, circle)). figure(3, bottom_right(circl...	Geometry analogy, why don't I get more answer? Geometry analogy, why don't I get more answer? prolog Geometry top_left bottom_right top_right bottom_left Relation same_in_out Geometry analogy, why don't I get more answer? Here is my prolog code : Which represent this set And here is a simple execution : And m...	[ -0.00482177734375, -0.003936767578125, 0.01055908203125, -0.0003070831298828125, -0.004119873046875, -0.00002086162567138672, -0.01007080078125, 0.00982666015625, 0.01251220703125, 0.000614166259765625, 0.016357421875, 0.0142822265625, 0.00823974609375, -0.01123046875, 0.0009536743164062...	[ 2206, 87739, 60223, 53, 15400, 2301, 3768, 18, 2046, 1286, 35166, 87, 502, 4867, 2663, 103136, 54969, 116822, 5701, 73, 6056, 18151, 33636, 903, 5423, 8781, 71924, 9655, 765, 1193, 2203, 361, 990, 198274, 33444, 54753 ]	[ 0.0673828125, 0.1334228515625, 0.2010498046875, 0.0877685546875, 0.12060546875, 0.06109619140625, 0.0235137939453125, 0.0877685546875, 0.09234619140625, 0.1278076171875, 0.18603515625, 0.0246124267578125, 0.1064453125, 0.148681640625, 0.05682373046875, 0.09405517578125, 0.01521301269...	embed
73339538_c0	73339538	prolog	0	Title: Chain of dominos Problem title: Chain of dominos Tags: prolog Problem: Chain of dominos I am learning prolog and solving some exercises on exercism.io. And I am stuck. I don't want to search for a solution on the internet, thus I will only a little help on the part of the exercise, since I don't understand where...	Chain of dominos Chain of dominos prolog Chain is_chain is_loop is_chain_no_loop _1370 _1372 _1384 _1396 _1408 _1420 _552 _502 Pile Chain of dominos I am learning prolog and solving some exercises on exercism.io. And I am stuck. I don't want to search for a solution on the internet, thus I will only a little help on th...	[ -0.0009613037109375, -0.000010192394256591797, 0.00897216796875, 0.01434326171875, -0.0115966796875, 0.0155029296875, -0.005096435546875, 0.0013885498046875, 0.01953125, -0.0263671875, 0.004364013671875, 0.000858306884765625, 0.00543212890625, -0.002288818359375, 0.0028228759765625, -0...	[ 4841, 73, 111, 96889, 7, 502, 4867, 83, 115097, 28354, 157, 2681, 5757, 12825, 13903, 11648, 2592, 8318, 1549, 150230, 2525, 304, 13289, 13, 52080, 81979, 56785, 39, 846, 179933, 29806, 28219, 759, 121742, 8, 85779, 28282, 8437, 121293, 8...	[ 0.2120361328125, 0.125, 0.1612548828125, 0.24267578125, 0.109130859375, 0.151123046875, 0.21533203125, 0.125732421875, 0.2509765625, 0.262451171875, 0.0888671875, 0.06256103515625, 0.180908203125, 0.1522216796875, 0.143310546875, 0.162353515625, 0.1214599609375, 0.177978515625, 0...	embed
13446507_c0	13446507	prolog	0	Title: Stuck with Prolog Program Problem title: Stuck with Prolog Program Tags: prolog Problem: Stuck with Prolog Program I am fluent with Java and C#, so coding in Prolog has been quite a struggle for me so far as it seems to be a completely different way of thinking. The problem I need to solve is simple, and I could...	Stuck with Prolog Program Stuck with Prolog Program prolog Stuck Prolog Program best_candidates BestMatches match_single_entry Stuck with Prolog Program I am fluent with Java and C#, so coding in Prolog has been quite a struggle for me so far as it seems to be a completely different way of thinking. The problem I need ...	[ 0.0135498046875, -0.004730224609375, 0.0267333984375, -0.005889892578125, -0.00958251953125, 0.003143310546875, -0.01708984375, -0.000701904296875, 0.01953125, -0.0096435546875, 0.01190185546875, 0.00103759765625, -0.007659912109375, -0.00732421875, 0.00113677978515625, -0.022216796875...	[ 26085, 2594, 678, 1250, 4867, 7663, 502, 2965, 79647, 1683, 1636, 11345, 79520, 17007, 14858, 6953, 133, 33, 15123, 155283, 41925, 136, 4904, 552, 6238, 2809, 32233, 151994, 2060, 37202, 64557, 12921, 3917, 47644, 2967, 3871, 86869, 8781, 5...	[ 0.15771484375, 0.1290283203125, 0.1243896484375, 0.1890869140625, 0.2464599609375, 0.1590576171875, 0.150146484375, 0.2003173828125, 0.1478271484375, 0.15869140625, 0.143798828125, 0.1707763671875, 0.210205078125, 0.183349609375, 0.18212890625, 0.1407470703125, 0.063232421875, 0.12...	embed
27607292_c0	27607292	prolog	0	Title: Sum of salaries in family structure in Prolog Problem title: Sum of salaries in family structure in Prolog Tags: sum, structure, list, addition, prolog Problem: Sum of salaries in family structure in Prolog I want to get a sum of salaries of children of family. I work in Turbo Prolog. As I understand, howManyChi...	Sum of salaries in family structure in Prolog Sum of salaries in family structure in Prolog sum structure list addition prolog Sum Prolog Ivan Ivanov Anna Oleg Antin Inna Salary Children Surname Average Year SalaryMom ChildrenSalary Sum of salaries in family structure in Prolog I want to get a sum of salaries of childr...	[ 0.0169677734375, -0.01080322265625, -0.0146484375, -0.003082275390625, -0.0201416015625, 0.0089111328125, -0.01153564453125, 0.01708984375, 0.035400390625, -0.028564453125, 0.0019378662109375, -0.006072998046875, -0.0203857421875, -0.0029754638671875, 0.0205078125, -0.0172119140625, ...	[ 36335, 111, 4559, 10484, 23, 14449, 45646, 1250, 4867, 10554, 5303, 66044, 502, 23698, 148803, 7714, 2828, 8332, 19, 360, 76, 13294, 1294, 91345, 8018, 11627, 40168, 29838, 42552, 594, 306, 52779, 6635, 3444, 2046, 10, 20020, 4488, 102228, ...	[ 0.2093505859375, 0.0845947265625, 0.2344970703125, 0.1849365234375, 0.0556640625, 0.16064453125, 0.1981201171875, 0.17333984375, 0.2626953125, 0.20703125, 0.08477783203125, 0.10552978515625, 0.0850830078125, 0.13623046875, 0.2012939453125, 0.1319580078125, 0.082275390625, 0.0985107...	embed
48637276_c0	48637276	prolog	0	Title: How to use String (atom) terms in Gnu Prolog for java Problem title: How to use String (atom) terms in Gnu Prolog for java Tags: swi-prolog, prolog, jpl, java, gnu-prolog Problem: How to use String (atom) terms in Gnu Prolog for java I'm a newbie in prolog and wanted to write wampus AI with prolog + java , tryin...	How to use String (atom) terms in Gnu Prolog for java How to use String (atom) terms in Gnu Prolog for java swi-prolog prolog jpl java gnu-prolog How Gnu Prolog VariableTerm IntegerTerm FloatTerm How to use String (atom) terms in Gnu Prolog for java I'm a newbie in prolog and wanted to write wampus AI with prolog + jav...	[ 0.0205078125, 0.0185546875, -0.0106201171875, 0.0277099609375, -0.005462646484375, 0.0068359375, 0.0250244140625, 0.0091552734375, -0.0174560546875, -0.029541015625, 0.032958984375, -0.0101318359375, -0.0216064453125, -0.0025787353515625, -0.0021820068359375, 0.00640869140625, 0.0235...	[ 11249, 4527, 23351, 214, 11, 5928, 69407, 23, 527, 539, 1250, 4867, 100, 79, 330, 47, 2452, 3454, 502, 2424, 104155, 84572, 2886, 35484, 44401, 38699, 9014, 33022, 259, 44901, 7, 38730, 997, 62775, 195490, 179933, 62822, 17366, 51359, 364...	[ 0.06097412109375, 0.155029296875, 0.23828125, 0.1490478515625, 0.03277587890625, 0.1898193359375, 0.2314453125, 0.0455322265625, 0.0810546875, 0.22021484375, 0.1514892578125, 0.181396484375, 0.057373046875, 0.1185302734375, 0.170166015625, 0.009246826171875, 0.1243896484375, 0.0899...	embed
53449457_c0	53449457	prolog	0	Title: Breadth First Search code won't output BFS result Problem title: Breadth First Search code won't output BFS result Tags: prolog, breadth-first-search Problem: Breadth First Search code won't output BFS result This is the code I found, and it was fixed in another post I made. s(a, b). s(a, c). s(b, g). ...	Breadth First Search code won't output BFS result Breadth First Search code won't output BFS result prolog breadth-first-search Breadth First Search BFS Start Solution Node Path Paths NewPaths Pathsl Breadth First Search code won't output BFS result This is the code I found, and it was fixed in another post I...	[ 0.025634765625, 0.0255126953125, -0.00110626220703125, 0.0244140625, -0.0228271484375, 0.004608154296875, -0.01361083984375, -0.01904296875, -0.0106201171875, -0.0091552734375, 0.00628662109375, -0.010498046875, -0.00732421875, 0.0093994140625, 0.0013580322265625, -0.00830078125, -0....	[ 6499, 712, 927, 23972, 33086, 18151, 23742, 3768, 18, 140992, 335, 36381, 16750, 502, 4867, 179967, 13448, 271, 86250, 13794, 187895, 438, 108421, 2356, 683, 10519, 24861, 188347, 83, 15824, 79442, 53201, 33636, 10, 76199, 876, 136, 501, 57...	[ 0.17236328125, 0.1292724609375, 0.1556396484375, 0.1898193359375, 0.2083740234375, 0.1756591796875, 0.06182861328125, 0.053253173828125, 0.0721435546875, 0.194091796875, 0.085693359375, 0.2332763671875, 0.161376953125, 0.1185302734375, 0.1385498046875, 0.1973876953125, 0.114501953125...	embed
73096861_c0	73096861	prolog	0	Title: Why does Prolog duplicate all the answers when the number of print directives is more than one? Problem title: Why does Prolog duplicate all the answers when the number of print directives is more than one? Tags: duplicates, non-interactive, prolog, swi-prolog Problem: Why does Prolog duplicate all the answers w...	Why does Prolog duplicate all the answers when the number of print directives is more than one? Why does Prolog duplicate all the answers when the number of print directives is more than one? duplicates non-interactive prolog swi-prolog Why Prolog exercise-family-tree.pl Why does Prolog duplicate all the answers when t...	[ 0.01446533203125, 0.0186767578125, 0.0023651123046875, 0.01348876953125, -0.0245361328125, 0.0244140625, -0.004058837890625, -0.0027008056640625, -0.003875732421875, -0.05712890625, -0.0191650390625, -0.01324462890625, 0.0103759765625, 0.0174560546875, 0.0029144287109375, 0.01495361328...	[ 44084, 1250, 4867, 171763, 67, 756, 35166, 14012, 28412, 8951, 60877, 1286, 3501, 1632, 351, 71232, 502, 2452, 3454, 81979, 212122, 62600, 2424, 5201, 1660, 71924, 864, 177, 693, 52721, 50339, 41, 6626, 20028, 12921, 77336, 10750, 3674, 181...	[ 0.08251953125, 0.162841796875, 0.2376708984375, 0.2327880859375, 0.085693359375, 0.05767822265625, 0.15771484375, 0.06884765625, 0.1712646484375, 0.12939453125, 0.114990234375, 0.109130859375, 0.0809326171875, 0.088134765625, 0.004547119140625, 0.04510498046875, 0.09405517578125, 0...	embed
48756649_c0	48756649	prolog	0	Title: PROLOG Finite automata compile error Problem title: PROLOG Finite automata compile error Tags: finite-automata, state-machine, prolog Problem: PROLOG Finite automata compile error I need help with my Prolog homework. So I have to represent a finite automata with 4 states. It is a simple laughing automata. But i ...	PROLOG Finite automata compile error PROLOG Finite automata compile error finite-automata state-machine prolog PROLOG Finite Warning p1_ex2.pl:20 Singleton Current p1_ex2.pl:32 ListNodes ERROR Rest Node NextNode Node-1 Facts PROLOG Finite automata compile error I need help with my Prolog homework. So I have to represen...	[ 0.007232666015625, -0.006256103515625, 0.00008249282836914062, 0.046630859375, -0.0172119140625, 0.0147705078125, -0.0120849609375, 0.01483154296875, 0.00390625, -0.031494140625, -0.00830078125, -0.0189208984375, -0.005096435546875, 0.01025390625, 0.007568359375, -0.01025390625, 0.02...	[ 10514, 47510, 13316, 1486, 11408, 11, 9969, 1340, 18499, 94418, 13, 52344, 11341, 103149, 502, 4867, 5550, 915, 3355, 5442, 2424, 16619, 43609, 1507, 114063, 29902, 32036, 5021, 988, 151206, 49756, 438, 112, 4997, 5759, 132640, 3871, 4358, ...	[ 0.1827392578125, 0.2376708984375, 0.170166015625, 0.1634521484375, 0.236572265625, 0.132568359375, 0.1873779296875, 0.1573486328125, 0.1951904296875, 0.1927490234375, 0.080322265625, 0.2032470703125, 0.1146240234375, 0.10357666015625, 0.1475830078125, 0.221923828125, 0.134033203125, ...	embed
9064492_c0	9064492	prolog	0	Title: Limits to expressibility in Cyc, or similar knowledge-base projects? Problem title: Limits to expressibility in Cyc, or similar knowledge-base projects? Tags: artificial-intelligence, knowledge-management, prolog, wordnet Problem: Limits to expressibility in Cyc, or similar knowledge-base projects? What are the ...	Limits to expressibility in Cyc, or similar knowledge-base projects? Limits to expressibility in Cyc, or similar knowledge-base projects? artificial-intelligence knowledge-management prolog wordnet Limits Cyc CAT DomesticCat Meat Limits to expressibility in Cyc, or similar knowledge-base projects? What are the limits t...	[ 0.0322265625, -0.000865936279296875, 0.0115966796875, 0.019775390625, 0.00946044921875, -0.00469970703125, 0.0145263671875, -0.01104736328125, 0.00933837890625, -0.0185546875, 0.0087890625, 0.0019683837890625, -0.021728515625, -0.00653076171875, 0.00146484375, 0.0203857421875, -0.006...	[ 125177, 7, 47, 36510, 14, 83259, 23, 27939, 238, 21373, 51359, 37382, 77635, 66733, 130687, 87140, 502, 4867, 2565, 1179, 100632, 96270, 28692, 76775, 1215, 257, 17475, 23755, 831, 18, 186, 13452, 86531, 27781, 5351, 26950, 85727, 7515, 621...	[ 0.2205810546875, 0.0985107421875, 0.05859375, 0.2264404296875, 0.113525390625, 0.1566162109375, 0.054901123046875, 0.1778564453125, 0.149658203125, 0.02252197265625, 0.1796875, 0.1494140625, 0.145263671875, 0.070068359375, 0.0933837890625, 0.08837890625, 0.07330322265625, 0.1616210...	embed
10328040_c0	10328040	prolog	0	Title: How to go about a type checker in prolog? Problem title: How to go about a type checker in prolog? Tags: typechecking, prolog Problem: How to go about a type checker in prolog? So I am new to prolog and I am suppose to implement a type checker. How exactly should I go about it? This would be an example: String s...	How to go about a type checker in prolog? How to go about a type checker in prolog? typechecking prolog How s.length How to go about a type checker in prolog? So I am new to prolog and I am suppose to implement a type checker. How exactly should I go about it? This would be an example: When I asked the professor how th...	[ 0.0159912109375, 0.02734375, 0.005157470703125, 0.0224609375, -0.01544189453125, -0.017822265625, -0.004791259765625, 0.00909423828125, 0.0007781982421875, -0.05224609375, -0.003936767578125, -0.022705078125, 0.00433349609375, -0.023681640625, 0.005706787109375, -0.01202392578125, 0....	[ 11249, 47, 738, 1672, 10644, 12765, 56, 23, 502, 4867, 78292, 214, 23986, 10, 3525, 139124, 29479, 66161, 5608, 442, 27781, 37170, 16030, 3642, 8966, 1221, 107730, 6713, 1884, 903, 9925, 6782, 51, 41274, 17, 72856, 20903, 41, 1294, 5154, ...	[ 0.093505859375, 0.0111083984375, 0.05853271484375, 0.1439208984375, 0.265625, 0.23095703125, 0.20361328125, 0.076904296875, 0.17236328125, 0.2490234375, 0.235107421875, 0.035980224609375, 0.022247314453125, 0.008697509765625, 0.03985595703125, 0.035003662109375, 0.09814453125, 0.00...	embed
75853298_c0	75853298	prolog	0	Title: Avoiding duplicate results in prolog Problem title: Avoiding duplicate results in prolog Tags: prolog Problem: Avoiding duplicate results in prolog I have the following code: male(prince_charles). male(prince_andrew). male(prince_edward). female(princess_ann). female(queen_elizabeth). child_of(prince_charles, qu...	Avoiding duplicate results in prolog Avoiding duplicate results in prolog prolog Avoiding prince_charles prince_andrew prince_edward princess_ann queen_elizabeth child_of List Avoiding duplicate results in prolog I have the following code: Running findall(X,successor(X), List). gets me this result : List = [prince_char...	[ 0.00469970703125, 0.015869140625, 0.021728515625, 0.00628662109375, 0.01513671875, -0.004486083984375, -0.00872802734375, 0.00390625, 0.00909423828125, -0.05224609375, -0.007080078125, 0.005462646484375, -0.004638671875, -0.006317138671875, 0.00775146484375, 0.033935546875, 0.0093383...	[ 84361, 86675, 171763, 67, 50339, 502, 4867, 54631, 9254, 1577, 129083, 434, 297, 19364, 2448, 26531, 6763, 41, 39998, 86077, 29041, 4390, 32036, 25632, 18151, 28398, 7413, 5584, 1542, 226534, 4970, 62163, 16750, 2203, 5293, 3956, 4, 41206, ...	[ 0.1771240234375, 0.07672119140625, 0.1973876953125, 0.111328125, 0.155029296875, 0.181640625, 0.21533203125, 0.164306640625, 0.1156005859375, 0.1607666015625, 0.0577392578125, 0.0987548828125, 0.0814208984375, 0.2412109375, 0.052947998046875, 0.05047607421875, 0.1370849609375, 0.00...	embed
8684206_c0	8684206	prolog	0	Title: SWI-Prolog How Prolog handles logical comparisons Problem title: SWI-Prolog How Prolog handles logical comparisons Tags: prolog, logical-operators, comparison Problem: SWI-Prolog How Prolog handles logical comparisons I have written the following code in SWI-Prolog: :- dynamic state_a/1 . :- dynamic state_b/1 . ...	SWI-Prolog How Prolog handles logical comparisons SWI-Prolog How Prolog handles logical comparisons prolog logical-operators comparison SWI-Prolog How Prolog state_a state_b state_c LIST HEAD TAIL move_ab Wrong Move.Choose Another SWI-Prolog How Prolog handles logical comparisons I have written the following code in SW...	[ 0.0166015625, 0.00482177734375, 0.006072998046875, 0.0277099609375, -0.0218505859375, 0.01611328125, -0.01483154296875, 0.018798828125, 0.0047607421875, 0.0062255859375, 0.01324462890625, 0.0225830078125, -0.0107421875, -0.0086669921875, 0.0201416015625, -0.01611328125, 0.03002929687...	[ 159, 38969, 10752, 4867, 11249, 1250, 34831, 7, 62775, 289, 225490, 502, 206469, 11341, 11, 275, 238, 195977, 188328, 12998, 16444, 25813, 2055, 35133, 135828, 107522, 8364, 116267, 59121, 18151, 9, 116, 33172, 132, 74, 26458, 454, 23, 5117...	[ 0.03875732421875, 0.2052001953125, 0.1573486328125, 0.262939453125, 0.0233917236328125, 0.180419921875, 0.1239013671875, 0.002655029296875, 0.1722412109375, 0.1243896484375, 0.2479248046875, 0.08740234375, 0.1513671875, 0.090576171875, 0.0293121337890625, 0.042572021484375, 0.0307617...	embed
26289772_c0	26289772	prolog	0	Title: Why must facts be grouped together in Prolog? Problem title: Why must facts be grouped together in Prolog? Tags: iso-prolog, prolog Problem: Why must facts be grouped together in Prolog? Say I am listing facts: letter(a). letter(b). letter(c). ... letter(z). vowel(a). consonant(b). consonant(c). consonant(d). vo...	Why must facts be grouped together in Prolog? Why must facts be grouped together in Prolog? iso-prolog prolog Why Prolog Warning Users prolog-example.pl:31 Clauses prolog-example.pl:32 prolog-example.pl:35 prolog-example.pl:36 prolog-example.pl:51 Why must facts be grouped together in Prolog? Say I am listing facts: If...	[ 0.050537109375, -0.0089111328125, -0.007080078125, 0.0186767578125, -0.01104736328125, 0.01080322265625, -0.00015544891357421875, -0.010986328125, 0.01708984375, 0.004425048828125, -0.01507568359375, 0.0157470703125, -0.0089111328125, -0.011474609375, -0.00150299072265625, -0.006103515...	[ 44084, 8110, 15824, 7, 37769, 71, 25842, 23, 1250, 4867, 13882, 3454, 502, 5550, 592, 53400, 27321, 100700, 29902, 32944, 37374, 5303, 214, 159978, 91736, 229231, 12989, 25632, 1631, 6977, 130250, 2174, 13319, 18499 ]	[ 0.1148681640625, 0.1162109375, 0.1787109375, 0.0947265625, 0.2171630859375, 0.0887451171875, 0.1602783203125, 0.047027587890625, 0.161376953125, 0.245361328125, 0.090576171875, 0.1043701171875, 0.08685302734375, 0.1392822265625, 0.0789794921875, 0.115966796875, 0.048583984375, 0.05...	embed
64420394_c1	64420394	prolog	1	_move(Pos), Val > Alpha, !. % Mazximizer increased lower bound newbounds(Alpha, Beta, Pos, Val, Alpha, Val):- max_to_move(Pos), Val < Beta, !. % Minimizer decreased upper bound newbounds( Alpha, Beta, _,_,Alpha, Beta). % otherwise bounds unchanged. betterof(Pos, Val, Pos1, Val1, Pos, Val) :- % Pos better than Pos1 min_...	_move(Pos), Val > Alpha, !. % Mazximizer increased lower bound newbounds(Alpha, Beta, Pos, Val, Alpha, Val):- max_to_move(Pos), Val < Beta, !. % Minimizer decreased upper bound newbounds( Alpha, Beta, _,_,Alpha, Beta). % otherwise bounds unchanged. betterof(Pos, Val, Pos1, Val1, Pos, Val) :- % Pos better than Pos1 min_...	[ -0.0159912109375, 0.004730224609375, 0.0390625, 0.01116943359375, 0.0147705078125, 0.0274658203125, 0.0120849609375, -0.010986328125, 0.0262451171875, 0.029296875, -0.003936767578125, 0.0126953125, 0.01263427734375, -0.00592041015625, 0.0147705078125, -0.017578125, -0.011474609375, ...	[ 101, 432, 272, 7192, 7, 4769, 977, 76569, 711, 1745, 29678, 53950, 52825, 124735, 92319, 99091, 3525, 6210, 14612, 48941, 13498, 18389, 188, 4211, 8559, 56, 227204, 1407, 120262, 152028, 11522, 4390, 418, 881, 42272, 106, 2646, 81887, 2811,...	[ 0.0360107421875, 0.1190185546875, 0.1348876953125, 0.146728515625, 0.0989990234375, 0.18603515625, 0.030853271484375, 0.216552734375, 0.0484619140625, 0.039520263671875, 0.1627197265625, 0.1845703125, 0.2218017578125, 0.1533203125, 0.1412353515625, 0.19189453125, 0.05029296875, 0.0...	embed
70462570_c0	70462570	prolog	0	Title: I ran the program as instructed in the book but it didn't work, error : unknown procedure Problem title: I ran the program as instructed in the book but it didn't work, error : unknown procedure Tags: prolog Problem: I ran the program as instructed in the book but it didn't work, error : unknown proced...	I ran the program as instructed in the book but it didn't work, error : unknown procedure I ran the program as instructed in the book but it didn't work, error : unknown procedure prolog Start Goal Path Solution write_path Visited Next I ran the program as instructed in the book but it didn't work, error : un...	[ -0.00008058547973632812, 0.0177001953125, -0.0079345703125, 0.02392578125, -0.02978515625, 0.0303955078125, -0.015625, -0.0242919921875, 0.00127410888671875, -0.041259765625, 0.0028839111328125, 0.01300048828125, -0.0245361328125, 0.00032806396484375, 0.000942230224609375, -0.009765625...	[ 87, 13028, 1528, 237, 20819, 89829, 23, 12877, 1284, 442, 15935, 3768, 18, 4488, 18499, 51, 69723, 19, 50491, 502, 4867, 13794, 2016, 289, 108421, 187895, 33022, 128405, 98684, 4997, 717, 11675, 3871, 116, 75101, 683, 10519, 136, 4034, 41...	[ 0.0179901123046875, 0.1383056640625, 0.20947265625, 0.1138916015625, 0.1156005859375, 0.09954833984375, 0.01824951171875, 0.141845703125, 0.0396728515625, 0.036895751953125, 0.07391357421875, 0.0760498046875, 0.1187744140625, 0.1513671875, 0.18359375, 0.08782958984375, 0.211669921875...	embed
66146716_c1	66146716	prolog	1	toolshed('a jar of mandragore'). toolshed('a fresh toadstool'). helper.pl :- module(helper, [ helper/2 ]). helper(friar_tuck,help) :- format("I will help you rout the Sheriff of Nottingham's men!~n"), setof(X,toolshed(X),Tools), format("I found these tools: ~q~n",[Tools]), format("Have at them!~n"). helper(merlin,help...	toolshed('a jar of mandragore'). toolshed('a fresh toadstool'). helper.pl :- module(helper, [ helper/2 ]). helper(friar_tuck,help) :- format("I will help you rout the Sheriff of Nottingham's men!~n"), setof(X,toolshed(X),Tools), format("I found these tools: ~q~n",[Tools]), format("Have at them!~n"). helper(merlin,help...	[ 0.01416015625, 0.017822265625, -0.0062255859375, 0.02001953125, -0.0191650390625, 0.0157470703125, 0.00799560546875, 0.0091552734375, -0.000640869140625, -0.04736328125, -0.01190185546875, 0.0230712890625, -0.005828857421875, 0.004638671875, 0.029296875, -0.0047607421875, 0.013732910...	[ 72977, 5252, 11, 35125, 111, 158924, 519, 107, 63335, 47, 712, 7, 89110, 4358, 56, 2424, 88996, 73866, 12477, 7151, 147, 458, 2594, 9384, 1221, 22629, 18, 53257, 32920, 438, 19514, 3915, 453, 5423, 4390, 1542, 67175, 186490, 568, 14037, ...	[ 0.30126953125, 0.296142578125, 0.03643798828125, 0.1893310546875, 0.1239013671875, 0.1422119140625, 0.143798828125, 0.1483154296875, 0.152099609375, 0.10198974609375, 0.10235595703125, 0.0126953125, 0.2333984375, 0.2171630859375, 0.170654296875, 0.1746826171875, 0.2037353515625, 0....	embed
26260407_c1	26260407	prolog	1	(_,_,_,B),B). % keelte faktid (andmebaas) possible_language(vene). possible_language(inglise). possible_language(hispaania). possible_language(prantsuse). possible_language(saksa). % tabeli täitmine solve(S):- structure(S), fill_structure(S), fact1(S), fact2(S), fact3(S), fact4(S), fact5(S), fact6(S), fact7(S), fact8(S...	(_,_,_,B),B). % keelte faktid (andmebaas) possible_language(vene). possible_language(inglise). possible_language(hispaania). possible_language(prantsuse). possible_language(saksa). % tabeli täitmine solve(S):- structure(S), fill_structure(S), fact1(S), fact2(S), fact3(S), fact4(S), fact5(S), fact6(S), fact7(S), fact8(S...	[ -0.003570556640625, 0.00775146484375, 0.0167236328125, 0.0250244140625, -0.0093994140625, 0.0107421875, -0.0296630859375, -0.0025482177734375, 0.003021240234375, -0.00494384765625, -0.0024261474609375, 0.007476806640625, -0.002838134765625, 0.003021240234375, -0.0164794921875, 0.009399...	[ 454, 571, 1745, 153200, 13, 6802, 532, 2940, 282, 402, 162, 7722, 196651, 39118, 214, 12811, 979, 19341, 7925, 15212, 76167, 110008, 53659, 14, 68680, 2962, 86869, 294, 45646, 26292, 137656, 15824, 418, 304, 363, 617, 758, 910, 966, 1019,...	[ 0.0149993896484375, 0.0712890625, 0.1148681640625, 0.279541015625, 0.12060546875, 0.2003173828125, 0.0712890625, 0.105224609375, 0.1573486328125, 0.157470703125, 0.07598876953125, 0.1817626953125, 0.26611328125, 0.2283935546875, 0.0849609375, 0.1214599609375, 0.012115478515625, 0.1...	embed
48227836_c0	48227836	prolog	0	Title: How to output all solutions for Goal from non-interactive script Problem title: How to output all solutions for Goal from non-interactive script Tags: swi-prolog, prolog Problem: How to output all solutions for Goal from non-interactive script I have a Node.JS application that I want to do the following with: 1....	How to output all solutions for Goal from non-interactive script How to output all solutions for Goal from non-interactive script swi-prolog prolog non-interactive How Goal data.pro triangular.pro How to output all solutions for Goal from non-interactive script I have a Node.JS application that I want to do the followi...	[ 0.0091552734375, 0.0277099609375, 0.00335693359375, -0.0014190673828125, -0.029296875, 0.00537109375, 0.011474609375, -0.0220947265625, -0.000713348388671875, -0.025146484375, 0.00872802734375, 0.006744384765625, -0.00982666015625, -0.00433349609375, 0.0028839111328125, 0.0245361328125...	[ 11249, 140992, 756, 51347, 100, 2016, 289, 1295, 351, 10433, 71232, 26499, 2452, 3454, 4867, 502, 2053, 1927, 1463, 35975, 438, 112, 64977, 38415, 5813, 61687, 12301, 70731, 33022, 11435, 28398, 91, 2424, 75101, 16750, 2392, 71924, 21771, 1...	[ 0.07958984375, 0.2181396484375, 0.1519775390625, 0.2376708984375, 0.040496826171875, 0.1981201171875, 0.19482421875, 0.1031494140625, 0.1341552734375, 0.0869140625, 0.1455078125, 0.201171875, 0.1964111328125, 0.1544189453125, 0.205078125, 0.10174560546875, 0.085205078125, 0.0440979...	embed
70378645_c0	70378645	prolog	0	Title: Prolog: recursion is not working properly Problem title: Prolog: recursion is not working properly Tags: recursion, prolog Problem: Prolog: recursion is not working properly I want to write change_state(+L1, +L2, -L3). L1 contains states e.g: [milled, burned] L2 contains predicates e.g: [del(milled), add(shifted...	Prolog: recursion is not working properly Prolog: recursion is not working properly recursion prolog Prolog change_state State NewState remove_from_list add_to_list Prolog: recursion is not working properly I want to write change_state(+L1, +L2, -L3). L1 contains states e.g: [milled, burned] L2 contains predicates e.g:...	[ -0.02001953125, -0.0019073486328125, -0.000392913818359375, 0.009765625, -0.004058837890625, 0.022705078125, -0.0284423828125, -0.000743865966796875, -0.00494384765625, -0.01214599609375, 0.0177001953125, 0.021728515625, -0.00738525390625, 0.0169677734375, 0.01080322265625, -0.01293945...	[ 1250, 4867, 195625, 1830, 83, 959, 20697, 155965, 502, 15549, 61340, 22836, 2356, 135206, 87388, 161063, 6562, 15190, 188, 3444, 33022, 1328, 866, 418, 997, 304, 21320, 339, 70541, 117249, 74877, 96865, 1653, 2063, 1743, 3767, 363, 30646, 5...	[ 0.168701171875, 0.2415771484375, 0.259765625, 0.175048828125, 0.0287017822265625, 0.08294677734375, 0.146240234375, 0.1617431640625, 0.1298828125, 0.191162109375, 0.171142578125, 0.134033203125, 0.06158447265625, 0.1226806640625, 0.126708984375, 0.07025146484375, 0.12548828125, 0.1...	embed
38265695_c0	38265695	prolog	0	Title: Foreach not working in Prolog Problem title: Foreach not working in Prolog Tags: swi-prolog, prolog Problem: Foreach not working in Prolog I am trying following code, where foreach and string_codes are working separately: 7 ?- string_codes("acid", D). D = [97, 99, 105, 100]. 8 ?- string_codes(S, [116, 101, 115, ...	Foreach not working in Prolog Foreach not working in Prolog swi-prolog prolog Foreach Prolog string_codes ERROR Type Outl character_code Foreach not working in Prolog I am trying following code, where foreach and string_codes are working separately: But not together: Only first letter is printed with this code: Where i...	[ 0.0078125, -0.01019287109375, 0.01336669921875, 0.0125732421875, -0.00946044921875, 0.00494384765625, 0.0157470703125, 0.01129150390625, 0.00058746337890625, -0.0228271484375, 0.028076171875, 0.0186767578125, -0.00104522705078125, 0.00823974609375, 0.01519775390625, -0.0181884765625, ...	[ 52445, 934, 959, 20697, 23, 1250, 4867, 2452, 3454, 502, 79315, 40899, 151206, 60457, 13538, 141, 62816, 31577, 25632, 18151, 100, 41581, 84797, 25842, 87293, 5117, 31330, 28412, 678, 903, 2967, 86869, 22288, 6562, 43240, 1632, 3917, 192728, ...	[ 0.2265625, 0.271240234375, 0.0906982421875, 0.1431884765625, 0.04473876953125, 0.169189453125, 0.2320556640625, 0.1107177734375, 0.1129150390625, 0.111328125, 0.1475830078125, 0.177001953125, 0.0626220703125, 0.08935546875, 0.1064453125, 0.0389404296875, 0.0885009765625, 0.04815673...	embed
74428074_c0	74428074	prolog	0	Title: Create Basic Catalog System with Prolog Problem title: Create Basic Catalog System with Prolog Tags: prolog Problem: Create Basic Catalog System with Prolog So we have an assignment to create a catalog system wherein we are supposed to add, edit, delete records of books in a system we created and compute for the...	Create Basic Catalog System with Prolog Create Basic Catalog System with Prolog prolog the Create Basic Catalog System Prolog Online Add Records Edit Delete Display Calculate Exit Choose Choice Input Book Title Author Create Basic Catalog System with Prolog So we have an assignment to create a catalog system wherein we...	[ 0.006072998046875, 0.0185546875, 0.00396728515625, 0.01007080078125, -0.0169677734375, -0.004852294921875, -0.0245361328125, 0.004180908203125, 0.0027008056640625, -0.0400390625, 0.01019287109375, -0.025146484375, -0.019775390625, -0.00738525390625, 0.020263671875, -0.00018119812011718...	[ 151313, 91692, 150917, 12353, 678, 1250, 4867, 502, 2823, 29117, 89916, 42079, 262, 46485, 90045, 212467, 5443, 211525, 181948, 360, 27432, 48962, 61804, 95486, 28282, 71426, 5426, 134598, 15190, 27211, 154109, 115923, 42840, 75935, 9969, 3622, ...	[ 0.175048828125, 0.2220458984375, 0.27001953125, 0.216064453125, 0.1103515625, 0.1737060546875, 0.24609375, 0.1409912109375, 0.1142578125, 0.0916748046875, 0.171142578125, 0.09423828125, 0.09600830078125, 0.1192626953125, 0.1278076171875, 0.151123046875, 0.109130859375, 0.0684814453...	embed
75132866_c0	75132866	prolog	0	Title: How can I solve the Syntax error in Prolog SWI? Problem title: How can I solve the Syntax error in Prolog SWI? Tags: prolog Problem: How can I solve the Syntax error in Prolog SWI? I'm getting 'Syntax error: Operator expected' and also the Warnings: 'Singleton variables: ... ". Here's my code: schwester_von(A,B)...	How can I solve the Syntax error in Prolog SWI? How can I solve the Syntax error in Prolog SWI? prolog How Syntax Prolog SWI schwester_von mutter_von grossvater_von vorfahr_von vater_von bruder_von Stefan Barbara Anna-Lena Marianne Timo Christopher Ursula Thomas Christian Uta Ralf Sven Sabrina How can I solve the Synta...	[ -0.00628662109375, 0.016845703125, -0.01055908203125, 0.021484375, -0.01153564453125, 0.0019073486328125, -0.021728515625, -0.005126953125, 0.00148773193359375, -0.039794921875, 0.00128936767578125, -0.026611328125, -0.013671875, -0.0198974609375, 0.0164794921875, -0.00732421875, 0.0...	[ 831, 86869, 19010, 86531, 18499, 1250, 4867, 159, 38969, 502, 11249, 45786, 43855, 8540, 187352, 55215, 2107, 56, 1248, 33688, 307, 720, 89827, 36947, 73149, 7714, 5267, 133733, 51189, 114411, 60243, 14978, 14949, 102, 17463, 78133, 171102, 7...	[ 0.05078125, 0.1627197265625, 0.1590576171875, 0.254150390625, 0.2061767578125, 0.16259765625, 0.2069091796875, 0.0928955078125, 0.25390625, 0.0859375, 0.001190185546875, 0.010101318359375, 0.1282958984375, 0.1219482421875, 0.1141357421875, 0.0258941650390625, 0.1053466796875, 0.039...	embed
10544452_c0	10544452	prolog	0	Title: Flowpattern doesn't exist Problem title: Flowpattern doesn't exist Tags: prolog Problem: Flowpattern doesn't exist I have been working on a code in prolog for a while now and it is near compiling worthy and all my ideas seem to be solid so it should work when it compiles. It is a program that consults ...	Flowpattern doesn't exist Flowpattern doesn't exist prolog Flowpattern STR LIST LISroT1 LIST1 LIST2 QUERY TOK SYMB STR1 upper_lower Flowpattern doesn't exist I have been working on a code in prolog for a while now and it is near compiling worthy and all my ideas seem to be solid so it should work when it comp...	[ 0.0322265625, 0.0223388671875, -0.006866455078125, 0.0205078125, -0.02001953125, 0.01031494140625, 0.000274658203125, 0.00787353515625, 0.00144195556640625, -0.049072265625, 0.01513671875, 0.004638671875, 0.002227783203125, -0.007537841796875, 0.015625, -0.00439453125, 0.004730224609...	[ 563, 17336, 4453, 22766, 22027, 3768, 18, 32316, 502, 4867, 46549, 195977, 67616, 516, 618, 304, 21389, 72071, 55858, 12689, 418, 1407, 56, 20697, 18151, 43573, 9969, 41965, 25647, 18652, 4488, 1340, 1528, 75463, 63399, 11435, 5303, 70731, ...	[ 0.1041259765625, 0.2315673828125, 0.260498046875, 0.2027587890625, 0.1046142578125, 0.1002197265625, 0.0888671875, 0.22265625, 0.1712646484375, 0.2120361328125, 0.1683349609375, 0.1890869140625, 0.03466796875, 0.0552978515625, 0.0653076171875, 0.002410888671875, 0.0670166015625, 0....	embed
49830667_c0	49830667	prolog	0	Title: PROLOG store nth element of list if string is found in list Problem title: PROLOG store nth element of list if string is found in list Tags: prolog Problem: PROLOG store nth element of list if string is found in list What im trying to do is: fromHistory/2 fromHistory(HL,FL) FL is the 3rd element of the list if t...	PROLOG store nth element of list if string is found in list PROLOG store nth element of list if string is found in list prolog PROLOG Tail HL1 FL1 FL2 PROLOG store nth element of list if string is found in list What im trying to do is: fromHistory/2 fromHistory(HL,FL) FL is the 3rd element of the list if the list conta...	[ -0.000728607177734375, 0.0037841796875, 0.000720977783203125, 0.003936767578125, 0.01318359375, 0.01470947265625, 0.017578125, 0.0036468505859375, 0.01507568359375, -0.015869140625, 0.01336669921875, -0.0230712890625, -0.003936767578125, -0.00885009765625, -0.0079345703125, -0.00222778...	[ 10514, 47510, 4343, 653, 927, 12830, 5303, 2174, 79315, 14037, 23, 111, 502, 4867, 1218, 379, 48599, 418, 63674, 304, 31577, 1295, 20861, 86385, 12477, 69466, 83, 138, 4216, 70541, 2565, 2182, 201, 756, 34153, 53927, 4398, 68991, 1653, 20...	[ 0.185302734375, 0.26220703125, 0.1937255859375, 0.17919921875, 0.169189453125, 0.1990966796875, 0.1990966796875, 0.094970703125, 0.2015380859375, 0.136962890625, 0.0667724609375, 0.042449951171875, 0.1558837890625, 0.2271728515625, 0.122314453125, 0.08203125, 0.1676025390625, 0.033...	embed
78136605_c0	78136605	prolog	0	Title: Constraints in Prolog Problem title: Constraints in Prolog Tags: prolog, constraints Problem: Constraints in Prolog I am trying to generate 6 vectors of 0 and 1 of size 2N checking constraints written with the XOR operation, the lexicographic order and the symplectic product (close to the scalar product) defined...	Constraints in Prolog Constraints in Prolog prolog constraints Constraints Prolog Appel CLP use_module U2N v2N Res Res2 Moitie1 Moitie2 NewO2 Constraints in Prolog I am trying to generate 6 vectors of 0 and 1 of size 2N checking constraints written with the XOR operation, the lexicographic order and the symplectic prod...	[ 0.0059814453125, 0.00885009765625, -0.00909423828125, -0.0157470703125, 0.00104522705078125, -0.00152587890625, 0.010498046875, 0.00799560546875, 0.00555419921875, -0.033447265625, -0.0177001953125, 0.0031890869140625, 0.002593994140625, 0.003448486328125, 0.01416015625, 0.002716064453...	[ 1657, 2816, 4288, 23, 1250, 4867, 502, 158, 36737, 37352, 4527, 83279, 345, 304, 839, 81, 9624, 32129, 2061, 2356, 670, 31577, 139392, 305, 22834, 22230, 757, 136, 13267, 116, 175199, 59121, 1193, 24638, 41018, 95, 73140, 48461, 12989, 33...	[ 0.13427734375, 0.2479248046875, 0.19482421875, 0.0216827392578125, 0.1878662109375, 0.281494140625, 0.14599609375, 0.1363525390625, 0.1578369140625, 0.1495361328125, 0.045562744140625, 0.1195068359375, 0.032257080078125, 0.136962890625, 0.1258544921875, 0.1590576171875, 0.06958007812...	embed
8280172_c0	8280172	prolog	0	Title: Recursion Problems in Prolog Problem title: Recursion Problems in Prolog Tags: backtracking, prolog, recursion Problem: Recursion Problems in Prolog I'm having some difficulties in prolog, I'm trying to write a predicate that will return all paths between two cities, although at the moment it returns the first p...	Recursion Problems in Prolog Recursion Problems in Prolog backtracking prolog recursion Recursion Problems Prolog Ci_Vi PaO Cities_Visited Distance Start Destination Output_Path Output_Distance not_member New_Distance List Recursion Problems in Prolog I'm having some difficulties in prolog, I'm trying to write a predic...	[ 0.007232666015625, 0.01092529296875, 0.0028839111328125, 0.0125732421875, -0.008056640625, -0.004119873046875, -0.005401611328125, -0.008056640625, 0.00982666015625, -0.044677734375, 0.01806640625, 0.00041961669921875, -0.017333984375, 0.0107421875, 0.01239013671875, 0.0022125244140625...	[ 165428, 42, 6889, 15649, 23, 1250, 4867, 4420, 125728, 502, 195625, 2079, 6609, 1342, 670, 44156, 65331, 154349, 13794, 145778, 13538, 7077, 10519, 14055, 116071, 27417, 32036, 19441, 34844, 3387, 31577, 33022, 1653, 2063, 67, 30646, 756, 608...	[ 0.190185546875, 0.190185546875, 0.123779296875, 0.2034912109375, 0.01348876953125, 0.1748046875, 0.2578125, 0.1051025390625, 0.204833984375, 0.150146484375, 0.23779296875, 0.04400634765625, 0.16796875, 0.058441162109375, 0.0997314453125, 0.0765380859375, 0.0611572265625, 0.13623046...	embed
44147207_c1	44147207	prolog	1	uninstall previous audio drivers <<'), nl, question_1('is the audio driver working now?'). diagnosis(['incompatable audio driver']) :- problem('Audio Driver Warning'), nl, write('>> install the appropriate audio driver for your computer <<'), nl, question_2('is your computer still showing driver Warning?'). %%%%%%%%%%...	uninstall previous audio drivers <<'), nl, question_1('is the audio driver working now?'). diagnosis(['incompatable audio driver']) :- problem('Audio Driver Warning'), nl, write('>> install the appropriate audio driver for your computer <<'), nl, question_2('is your computer still showing driver Warning?'). %%%%%%%%%%...	[ -0.0079345703125, 0.0137939453125, -0.0003643035888671875, 0.032470703125, -0.00946044921875, 0.020263671875, -0.0194091796875, 0.00787353515625, 0.011962890625, -0.01165771484375, 0.0179443359375, 0.0054931640625, 0.007598876953125, -0.01129150390625, 0.0145263671875, 0.00038337707519...	[ 51, 80383, 96362, 18215, 27941, 7, 56473, 13169, 9655, 115187, 164, 70, 20697, 5036, 194, 47099, 73, 277, 4453, 2886, 15772, 2967, 119516, 31, 131470, 5550, 592, 33022, 20600, 95307, 13909, 304, 7464, 141377, 1745, 240085, 53, 42413, 165992...	[ 0.10711669921875, 0.199462890625, 0.165283203125, 0.2403564453125, 0.2310791015625, 0.044921875, 0.002044677734375, 0.08526611328125, 0.108642578125, 0.04742431640625, 0.07427978515625, 0.007415771484375, 0.1563720703125, 0.1343994140625, 0.0264129638671875, 0.15625, 0.04898071289062...	embed
36822397_c0	36822397	prolog	0	Title: Make prolog ignore alternatives, but still backtrack Problem title: Make prolog ignore alternatives, but still backtrack Tags: prolog Problem: Make prolog ignore alternatives, but still backtrack So I have a recursive predicate that looks like this: top_predicate(A, B, C):- finish(A, B, C). top_predicate(A, B, C...	Make prolog ignore alternatives, but still backtrack Make prolog ignore alternatives, but still backtrack prolog Make top_predicate sub_predicate_1 Make prolog ignore alternatives, but still backtrack So I have a recursive predicate that looks like this: sub_predicate_1 has a lot of alternatives. I would like Prolog to...	[ 0.0274658203125, 0.017822265625, 0.01708984375, 0.0003108978271484375, -0.010498046875, -0.00384521484375, 0.005889892578125, 0.0087890625, 0.0030364990234375, -0.0299072265625, -0.018798828125, 0.021484375, -0.0123291015625, 0.0186767578125, 0.0162353515625, 0.00012493133544921875, ...	[ 26176, 502, 4867, 124962, 30700, 1284, 7464, 4420, 125728, 2663, 19714, 2063, 1614, 67, 115187, 195625, 5844, 1653, 33342, 5915, 1884, 1250, 4734, 16916, 5117, 35166, 62163, 1295, 19048, 28560, 50155, 40715, 209, 756, 2965, 11343, 154107, 592...	[ 0.0802001953125, 0.158447265625, 0.2393798828125, 0.1715087890625, 0.168701171875, 0.00762939453125, 0.108642578125, 0.103271484375, 0.2227783203125, 0.1298828125, 0.1400146484375, 0.1578369140625, 0.208984375, 0.037994384765625, 0.1221923828125, 0.14501953125, 0.0665283203125, 0.1...	embed
69832395_c0	69832395	prolog	0	Title: Prolog chess pieces movements Problem title: Prolog chess pieces movements Tags: prolog, chess Problem: Prolog chess pieces movements I am making an ai chess game while using prolog. I've got this board: Board = [piece(white, rook, 1, 1), piece(white, knight, 2, 1), piece(white, bishop, 3, 1), piece(white, queen...	Prolog chess pieces movements Prolog chess pieces movements prolog chess Prolog Board in_boundaries Col Row create_board Piece Pawn NewRow Check Row-1 NewCol Col-1 Prolog chess pieces movements I am making an ai chess game while using prolog. I've got this board: As you can see, the board represented by a list. I am tr...	[ 0.004180908203125, -0.000766754150390625, 0.0218505859375, 0.010986328125, -0.0147705078125, 0.01190185546875, -0.0086669921875, 0.017333984375, -0.0033721923828125, -0.041015625, -0.027587890625, 0.0291748046875, 0.0037384033203125, -0.00982666015625, -0.009521484375, -0.0012283325195...	[ 1250, 4867, 290, 7, 126371, 112664, 502, 62554, 23, 99091, 11, 11554, 96190, 28282, 24351, 10374, 138413, 19, 2356, 12724, 38679, 5759, 78457, 20662, 1300, 6712, 17368, 45443, 33636, 5303, 31577, 1653, 2063, 30646, 7722, 25813, 34475, 63847, ...	[ 0.174072265625, 0.254150390625, 0.1708984375, 0.07562255859375, 0.176513671875, 0.1973876953125, 0.1265869140625, 0.14501953125, 0.03509521484375, 0.126220703125, 0.0484619140625, 0.108154296875, 0.164306640625, 0.08428955078125, 0.15576171875, 0.0810546875, 0.138916015625, 0.04116...	embed
71341011_c0	71341011	prolog	0	Title: Why does SWI-Prolog fail when mentioning a predicate without any facts in a rule? Problem title: Why does SWI-Prolog fail when mentioning a predicate without any facts in a rule? Tags: prolog Problem: Why does SWI-Prolog fail when mentioning a predicate without any facts in a rule? Here is my Prolog program: :- ...	Why does SWI-Prolog fail when mentioning a predicate without any facts in a rule? Why does SWI-Prolog fail when mentioning a predicate without any facts in a rule? prolog Why SWI-Prolog set_prolog_flag use_module links.pl Initialization ERROR Undefined amd64 Why does SWI-Prolog fail when mentioning a predicate without ...	[ 0.01434326171875, 0.0078125, 0.0037841796875, 0.03369140625, -0.0240478515625, 0.009521484375, 0.0341796875, 0.0003108978271484375, -0.00023555755615234375, -0.035400390625, 0.0030059814453125, 0.002410888671875, -0.0206298828125, 0.01458740234375, 0.0186767578125, -0.00102996826171875...	[ 44084, 159, 38969, 10752, 4867, 35782, 41392, 1653, 2063, 67, 15490, 2499, 15824, 79986, 502, 9, 5423, 3454, 190872, 4527, 83279, 22317, 2424, 360, 1890, 289, 151206, 24638, 79912, 5983, 444, 71, 13307, 14602, 3229, 23, 1250, 1528, 28398, ...	[ 0.055755615234375, 0.06561279296875, 0.196533203125, 0.1488037109375, 0.2064208984375, 0.1766357421875, 0.130859375, 0.1290283203125, 0.1749267578125, 0.0718994140625, 0.1292724609375, 0.0782470703125, 0.161865234375, 0.1568603515625, 0.0841064453125, 0.02850341796875, 0.108154296875...	embed
38482311_c0	38482311	prolog	0	Title: Flattening a list Problem title: Flattening a list Tags: prolog, list Problem: Flattening a list Trying to solve exercise 07 from http://www.ic.unicamp.br/~meidanis/courses/mc336/2009s2/prolog/problemas/ I've started with a single iteration which looks like following my_flatten1([], []). my_flatten1([[A\|T]\|U], [...	Flattening a list Flattening a list prolog list Flattening my_flatten1 is_list is_flat my_flatten Flattening a list Trying to solve exercise 07 from http://www.ic.unicamp.br/~meidanis/courses/mc336/2009s2/prolog/problemas/ I've started with a single iteration which looks like following it seems to work just fine for th...	[ -0.00830078125, 0.0201416015625, 0.0213623046875, -0.0031890869140625, -0.004150390625, -0.0035247802734375, 0.0016632080078125, -0.0045166015625, 0.01806640625, -0.01165771484375, 0.015625, -0.00022125244140625, -0.0068359375, 0.0128173828125, 0.005401611328125, -0.005767822265625, ...	[ 106516, 67, 592, 5303, 502, 4867, 759, 150632, 510, 418, 83, 6562, 86869, 81979, 4719, 27034, 164, 8659, 40148, 3454, 38953, 11001, 720, 33342, 25632, 4488, 5885, 41, 10484, 18, 65771, 45367, 35509, 11343, 35782, 3564, 9393, 40956, 27489, ...	[ 0.215087890625, 0.182861328125, 0.0156097412109375, 0.22119140625, 0.11474609375, 0.1826171875, 0.15576171875, 0.264404296875, 0.2369384765625, 0.1124267578125, 0.1068115234375, 0.2364501953125, 0.053955078125, 0.125732421875, 0.117919921875, 0.1180419921875, 0.030548095703125, 0.0...	embed
32586326_c1	32586326	prolog	1	2,[i21,i22,i23]). Diagram: https://docs.google.com/drawings/d/10wBpmFxxbDqrlpPVqpkVo_r8I-qcalWAz7Lro9myjMs/edit?usp=sharing Inputs into a device are also like an AND gate but they are always the 'top' level of the circuit tree. I want to implement a predicate that would result in something like: ?- device_structure(D,O...	2,[i21,i22,i23]). Diagram: https://docs.google.com/drawings/d/10wBpmFxxbDqrlpPVqpkVo_r8I-qcalWAz7Lro9myjMs/edit?usp=sharing Inputs into a device are also like an AND gate but they are always the 'top' level of the circuit tree. I want to implement a predicate that would result in something like: ?- device_structure(D,O...	[ 0.00799560546875, -0.00127410888671875, -0.01190185546875, 0.013671875, 0.01251220703125, 0.02392578125, 0.01507568359375, -0.0181884765625, 0.01177978515625, -0.047607421875, 0.0030670166015625, -0.003143310546875, -0.007049560546875, -0.0074462890625, 0.0028228759765625, 0.0035705566...	[ 116, 14, 3117, 4015, 3742, 4512, 25561, 29713, 59875, 86905, 5180, 45082, 2420, 360, 7077, 3934, 75186, 621, 2843, 1884, 48762, 70836, 1284, 11343, 13784, 17366, 61404, 53201, 3444, 29479, 1653, 2063, 67, 16750, 705, 137656, 397, 20320, 125...	[ 0.1448974609375, 0.042327880859375, 0.1146240234375, 0.10491943359375, 0.1319580078125, 0.10406494140625, 0.1527099609375, 0.017486572265625, 0.01373291015625, 0.09771728515625, 0.007293701171875, 0.00091552734375, 0.024505615234375, 0.14990234375, 0.2403564453125, 0.1778564453125, 0...	embed
16526720_c1	16526720	prolog	1	the head of the first path is not a goal node) remove the first path from the candidates set and generate the set of all possible one-step extensions of this paths, add this set of extension at the end of the candidate set, and execute breath-first search on this updated set */ breadthfirst([Path\|Paths], Solution) :- ...	the head of the first path is not a goal node) remove the first path from the candidates set and generate the set of all possible one-step extensions of this paths, add this set of extension at the end of the candidate set, and execute breath-first search on this updated set */ breadthfirst([Path\|Paths], Solution) :- ...	[ 0.036865234375, 0.018310546875, 0.026123046875, 0.038330078125, -0.0205078125, -0.00665283203125, -0.0262451171875, -0.01470947265625, -0.000675201416015625, -0.042724609375, 0.01483154296875, 0.00136566162109375, -0.00799560546875, 0.00433349609375, -0.0146484375, -0.0137939453125, ...	[ 10336, 111, 5117, 60875, 83, 959, 10, 69236, 110, 112, 87388, 25469, 90, 5423, 139392, 7722, 1632, 95528, 111938, 15190, 3564, 71924, 71191, 13448, 33938, 150011, 179967, 927, 271, 10519, 187895, 15772, 181139, 108421, 7, 5303, 65042, 48281, ...	[ 0.1986083984375, 0.03759765625, 0.136474609375, 0.251220703125, 0.0828857421875, 0.134765625, 0.04803466796875, 0.2413330078125, 0.150146484375, 0.1795654296875, 0.14306640625, 0.201416015625, 0.0732421875, 0.1336669921875, 0.1280517578125, 0.12158203125, 0.056915283203125, 0.16381...	embed
43978568_c0	43978568	prolog	0	Title: Prolog: How to get a path from a start node to a Goal Node Problem title: Prolog: How to get a path from a start node to a Goal Node Tags: predicate, nodes, prolog, artificial-intelligence, search Problem: Prolog: How to get a path from a start node to a Goal Node I'm trying to write a prolog program that will r...	Prolog: How to get a path from a start node to a Goal Node Prolog: How to get a path from a start node to a Goal Node predicate nodes prolog artificial-intelligence search a Prolog How Goal Node get_path StartNode Path Prolog: How to get a path from a start node to a Goal Node I'm trying to write a prolog program that ...	[ 0.021728515625, 0.004669189453125, -0.01068115234375, 0.0096435546875, -0.00323486328125, 0.0123291015625, -0.0021209716796875, -0.0277099609375, 0.00927734375, -0.05322265625, 0.0177001953125, -0.0111083984375, -0.0390625, -0.005157470703125, 0.006195068359375, -0.0093994140625, -0....	[ 1250, 4867, 11249, 2046, 60875, 1295, 4034, 110, 112, 47, 2016, 289, 438, 1653, 2063, 988, 502, 66733, 130687, 33938, 128405, 13794, 5021, 108421, 31577, 33022, 1528, 33636, 69236, 527, 30646, 5303, 126597, 5423, 764, 474, 34292, 39457, 42,...	[ 0.173828125, 0.2276611328125, 0.047576904296875, 0.1021728515625, 0.2320556640625, 0.09918212890625, 0.1802978515625, 0.1666259765625, 0.1217041015625, 0.08734130859375, 0.1531982421875, 0.1390380859375, 0.18408203125, 0.13330078125, 0.1558837890625, 0.125244140625, 0.13330078125, ...	embed
52464619_c1	52464619	prolog	1	I-Prolog being relocatable (and thus having path relative to the executable). The output of otool -L of the libjpl.dylib give me this output: /Applications/SWI-Prolog.app/Contents/swipl/lib/x86_64-darwin15.6.0/libjpl.dylib: @rpath/libjsig.dylib (compatibility version 1.0.0, current version 1.0.0) @rpath/libjvm.dylib (c...	I-Prolog being relocatable (and thus having path relative to the executable). The output of otool -L of the libjpl.dylib give me this output: /Applications/SWI-Prolog.app/Contents/swipl/lib/x86_64-darwin15.6.0/libjpl.dylib: @rpath/libjsig.dylib (compatibility version 1.0.0, current version 1.0.0) @rpath/libjvm.dylib (c...	[ -0.0157470703125, 0.0133056640625, -0.0029144287109375, 0.00775146484375, -0.01434326171875, -0.01287841796875, -0.006561279296875, 0.007232666015625, -0.0120849609375, -0.03662109375, -0.00119781494140625, -0.007049560546875, -0.00311279296875, -0.0010528564453125, 0.0133056640625, 0....	[ 87, 9, 10752, 4867, 8035, 456, 116292, 2886, 19441, 60875, 35845, 71924, 140992, 36, 89110, 20, 866, 25474, 170, 2424, 1459, 5612, 163, 47677, 182867, 294, 38969, 9007, 25352, 2452, 15276, 13307, 1506, 9494, 1837, 43652, 2389, 128405, 20561...	[ 0.1533203125, 0.0426025390625, 0.1953125, 0.282470703125, 0.072509765625, 0.091064453125, 0.2298583984375, 0.18701171875, 0.06658935546875, 0.2047119140625, 0.09375, 0.1492919921875, 0.1304931640625, 0.059356689453125, 0.29296875, 0.024749755859375, 0.1358642578125, 0.107666015625,...	embed
28024224_c0	28024224	prolog	0	Title: Coroutining in Prolog: when argument is a list (it has fixed length) Problem title: Coroutining in Prolog: when argument is a list (it has fixed length) Tags: prolog-coroutining, prolog, logical-purity Problem: Coroutining in Prolog: when argument is a list (it has fixed length) Question Is it possible to schedu...	Coroutining in Prolog: when argument is a list (it has fixed length) Coroutining in Prolog: when argument is a list (it has fixed length) prolog-coroutining prolog logical-purity Coroutining Prolog fixed_length Coroutining in Prolog: when argument is a list (it has fixed length) Question Is it possible to schedule a go...	[ 0.0123291015625, 0.0081787109375, 0.0019073486328125, 0.003265380859375, 0.002471923828125, -0.0002269744873046875, 0.0030364990234375, 0.015625, 0.017822265625, -0.0302734375, 0.001251220703125, -0.0234375, -0.004364013671875, 0.0162353515625, 0.0172119140625, -0.00823974609375, 0.0...	[ 5631, 6056, 14653, 1250, 4867, 3229, 10750, 83, 5303, 1556, 188347, 140909, 10, 502, 10517, 62775, 289, 4717, 2481, 23986, 7722, 80889, 69236, 47, 71924, 33662, 237, 51529, 8710, 34475, 24209, 36290, 14847, 126940, 831, 64549, 17368, 705, 1...	[ 0.076416015625, 0.1578369140625, 0.182373046875, 0.1326904296875, 0.2265625, 0.092529296875, 0.289794921875, 0.041900634765625, 0.2381591796875, 0.0391845703125, 0.271484375, 0.173583984375, 0.0150909423828125, 0.0814208984375, 0.0107421875, 0.165771484375, 0.07220458984375, 0.1789...	embed
36222035_c0	36222035	prolog	0	Title: Node has no descendant Problem title: Node has no descendant Tags: prolog Problem: Node has no descendant I have a rule % X is descendant of Y descendant(X,Y) :- I am trying to write a rule that will find out which node has no descendant. How do I tell prolog that I want to find every X that fails descendant(X,_...	Node has no descendant Node has no descendant prolog Node child2 jr_child cyborg_descendant is_human_or_cyborg has_no_cyborg_descendants Node has no descendant I have a rule I am trying to write a rule that will find out which node has no descendant. How do I tell prolog that I want to find every X that fails descendan...	[ 0.0230712890625, 0.0135498046875, 0.01007080078125, 0.02001953125, -0.00653076171875, 0.026611328125, 0.01123046875, -0.004119873046875, -0.0068359375, -0.0181884765625, -0.01287841796875, -0.0294189453125, -0.025146484375, 0.0096435546875, 0.00457763671875, 0.00384521484375, 0.01623...	[ 438, 112, 1556, 110, 60887, 1236, 502, 4867, 29041, 304, 1647, 42, 206, 38472, 19932, 10164, 31146, 58349, 69790, 748, 2408, 157, 79986, 31577, 33022, 7413, 1810, 3129, 14192, 3444, 11907, 1193, 450, 35782, 1542, 81113, 91736, 11675, 756, ...	[ 0.18798828125, 0.189208984375, 0.1253662109375, 0.1644287109375, 0.2088623046875, 0.1217041015625, 0.137939453125, 0.1407470703125, 0.1302490234375, 0.146484375, 0.021575927734375, 0.0244293212890625, 0.019134521484375, 0.08056640625, 0.055694580078125, 0.2001953125, 0.1651611328125,...	embed
75038367_c0	75038367	prolog	0	Title: Why does this prolog rule using include/3 evaluate to false, but not when exploding it into individual comparisons? Problem title: Why does this prolog rule using include/3 evaluate to false, but not when exploding it into individual comparisons? Tags: clpfd, prolog Problem: Why does this prolog rule using inclu...	Why does this prolog rule using include/3 evaluate to false, but not when exploding it into individual comparisons? Why does this prolog rule using include/3 evaluate to false, but not when exploding it into individual comparisons? clpfd prolog include/3 X Why position_that_is_equals_to_two AllElementsWhichHaveAValueOf...	[ -0.0004024505615234375, 0.0084228515625, 0.0091552734375, 0.041748046875, -0.0057373046875, 0.0142822265625, 0.0025482177734375, 0.00018405914306640625, 0.007293701171875, -0.022705078125, 0.041259765625, 0.0179443359375, 0.0034942626953125, 0.019775390625, 0.005950927734375, 0.0007972...	[ 44084, 502, 4867, 79986, 26698, 18113, 151575, 98320, 24649, 11651, 225490, 47, 959, 3934, 33139, 39557, 71, 1193, 19069, 86673, 164, 71723, 188, 55547, 3164, 647, 19929, 6495, 272, 50770, 132887, 3613, 927, 2389, 903, 17368, 5423, 14012, 1...	[ 0.08251953125, 0.1212158203125, 0.194091796875, 0.1512451171875, 0.1943359375, 0.2318115234375, 0.1402587890625, 0.2099609375, 0.1405029296875, 0.0958251953125, 0.1964111328125, 0.027618408203125, 0.0240478515625, 0.0135498046875, 0.00518798828125, 0.042694091796875, 0.0946044921875,...	embed
70711630_c1	70711630	prolog	1	), Reply='y'. symptom(Patient,sore_throat) :- write_list(['Does ',Patient,' have a sore_throat (y/n) ?']), response(Reply), Reply='y'. symptom(Patient,sneezing) :- write_list(['Does ',Patient,' have a sneezing (y/n) ?']), response(Reply), Reply='y'. symptom(Patient,swollen_glands) :- write_list(['Does ',Patient,' have ...	), Reply='y'. symptom(Patient,sore_throat) :- write_list(['Does ',Patient,' have a sore_throat (y/n) ?']), response(Reply), Reply='y'. symptom(Patient,sneezing) :- write_list(['Does ',Patient,' have a sneezing (y/n) ?']), response(Reply), Reply='y'. symptom(Patient,swollen_glands) :- write_list(['Does ',Patient,' have ...	[ 0.0023040771484375, 0.0002651214599609375, 0.0181884765625, 0.0162353515625, -0.0130615234375, 0.0152587890625, -0.01434326171875, -0.005157470703125, -0.0146484375, -0.030517578125, 0.002166748046875, 0.00830078125, -0.0133056640625, 0.0019989013671875, -0.001708984375, 0.006011962890...	[ 247, 122813, 128668, 8335, 118, 2517, 46797, 42294, 257, 15772, 33022, 6562, 8331, 90, 765, 10, 127124, 53, 64, 57553, 62479, 86, 1255, 214, 34614, 3613, 177, 15534, 112141, 8405, 170933, 6023, 282, 162, 1577, 2242, 814, 72089, 17043, 446...	[ 0.0152587890625, 0.1988525390625, 0.24755859375, 0.052947998046875, 0.1114501953125, 0.0872802734375, 0.176025390625, 0.2041015625, 0.1094970703125, 0.0552978515625, 0.158935546875, 0.2044677734375, 0.053924560546875, 0.06158447265625, 0.082275390625, 0.04852294921875, 0.158935546875...	embed
41211454_c0	41211454	prolog	0	Title: Prolog doesn't pass variables Problem title: Prolog doesn't pass variables Tags: prolog Problem: Prolog doesn't pass variables In a Prolog rule, I tried to pass variable from case to another but it doesn't work plane(c130,propeller,high,conventional,conventional,under-wing). plane(c141,jet,high,sweptba...	Prolog doesn't pass variables Prolog doesn't pass variables prolog Prolog c130 c141 c5a b747 Name Eng Wing Shape Tail Bulges Plane Not Found Please Retry _L155_L156c130 Prolog doesn't pass variables In a Prolog rule, I tried to pass variable from case to another but it doesn't work and here is the output in a...	[ 0.02001953125, 0.0034942626953125, -0.0223388671875, 0.006683349609375, -0.0021209716796875, 0.0012054443359375, -0.0162353515625, -0.00311279296875, 0.00384521484375, -0.0020904541015625, 0.009033203125, 0.00604248046875, -0.0211181640625, -0.00933837890625, 0.0106201171875, 0.0114746...	[ 1250, 4867, 22027, 3768, 18, 27875, 77336, 502, 43955, 146893, 758, 139091, 15757, 25024, 601, 214, 7224, 1218, 379, 166599, 90, 5586, 11205, 215624, 15123, 119477, 155740, 79986, 37842, 1295, 7225, 47, 15700, 4488, 3688, 140992, 66044, 44691...	[ 0.1837158203125, 0.27490234375, 0.05023193359375, 0.048614501953125, 0.0899658203125, 0.174560546875, 0.27197265625, 0.1365966796875, 0.1964111328125, 0.1451416015625, 0.022003173828125, 0.178466796875, 0.016326904296875, 0.0372314453125, 0.04827880859375, 0.00665283203125, 0.0771484...	embed
70221446_c0	70221446	prolog	0	Title: Graph representations in Prolog Problem title: Graph representations in Prolog Tags: list, prolog, adjacency-list, graph-theory, swi-prolog Problem: Graph representations in Prolog Consider the following graph and that it is described by the below Prolog term : graph([connected(a,[b,c]), connected(b,[a,c]), conn...	Graph representations in Prolog Graph representations in Prolog list prolog adjacency-list graph-theory swi-prolog Graph Prolog map2ne Pair map3n Map Pairs PairX Graph representations in Prolog Consider the following graph and that it is described by the below Prolog term : graph([connected(a,[b,c]), connected(b,[a,c])...	[ -0.019287109375, 0.0184326171875, 0.005462646484375, -0.002197265625, -0.021728515625, 0.0135498046875, -0.03515625, 0.00848388671875, 0.01043701171875, -0.041259765625, -0.004119873046875, -0.015625, -0.0216064453125, -0.005615234375, -0.003875732421875, 0.01904296875, 0.01574707031...	[ 6524, 11727, 18811, 1250, 4867, 5303, 502, 123594, 329, 6562, 41382, 2452, 3454, 22288, 86, 1342, 42719, 37897, 481, 1542, 25632, 151552, 35064, 13579, 135457, 238, 162711, 275, 71, 1884, 61924, 1653, 2063, 67, 27198, 36917, 94878, 3934, 42...	[ 0.1898193359375, 0.1544189453125, 0.239501953125, 0.171875, 0.2484130859375, 0.18115234375, 0.1087646484375, 0.027191162109375, 0.0272369384765625, 0.130126953125, 0.244140625, 0.09429931640625, 0.071044921875, 0.132568359375, 0.03717041015625, 0.1038818359375, 0.1265869140625, 0.1...	embed
20256667_c0	20256667	prolog	0	Title: Prolog: Removing Duplicates Problem title: Prolog: Removing Duplicates Tags: prolog Problem: Prolog: Removing Duplicates I am trying to remove duplicate entries from a list in prolog. So a list [a,b,a,c,b,a] would return [a,b,c]. I can not use any built in functions. I searched here and found this code. member(X...	Prolog: Removing Duplicates Prolog: Removing Duplicates prolog Prolog Removing Duplicates Out x::xs x::remv x::remvdub Ans Ans1 Prolog: Removing Duplicates I am trying to remove duplicate entries from a list in prolog. So a list [a,b,a,c,b,a] would return [a,b,c]. I can not use any built in functions. I searched here a...	[ 0.0045166015625, 0.0198974609375, 0.020263671875, 0.0020599365234375, -0.0189208984375, 0.0022735595703125, -0.0113525390625, 0.0179443359375, 0.0096435546875, -0.023193359375, -0.01318359375, -0.00135040283203125, 0.01953125, 0.006103515625, -0.0023193359375, 0.00689697265625, 0.024...	[ 1250, 4867, 853, 432, 6496, 786, 52721, 1636, 502, 13538, 1022, 7328, 334, 42629, 893, 31577, 87388, 171763, 67, 112820, 1295, 5303, 275, 238, 30646, 831, 959, 4527, 88303, 23, 32354, 33938, 18151, 5646, 12830, 136, 74918, 184750, 49504, ...	[ 0.1624755859375, 0.22119140625, 0.03485107421875, 0.132568359375, 0.082275390625, 0.174560546875, 0.252685546875, 0.08447265625, 0.15283203125, 0.108154296875, 0.005401611328125, 0.0836181640625, 0.140869140625, 0.1405029296875, 0.0189208984375, 0.06658935546875, 0.1678466796875, 0...	embed
8434772_c0	8434772	prolog	0	Title: Extensional DCG Test Cases Problem title: Extensional DCG Test Cases Tags: unit-testing, prolog, grammar, dcg Problem: Extensional DCG Test Cases I am looking for extensional DCG test cases. Means test cases that check the right functioning of a DCG processor in terms of the behaviour of the resulting converted ...	Extensional DCG Test Cases Extensional DCG Test Cases unit-testing prolog grammar dcg Extensional DCG Test Cases _608 _609 _619 _617 Extensional DCG Test Cases I am looking for extensional DCG test cases. Means test cases that check the right functioning of a DCG processor in terms of the behaviour of the resulting con...	[ 0.0255126953125, 0.004669189453125, 0.005096435546875, 0.0224609375, 0.0027618408203125, -0.00135040283203125, 0.00144195556640625, -0.002471923828125, 0.006805419921875, -0.0009613037109375, -0.00025177001953125, 0.01141357421875, -0.027099609375, 0.00726318359375, 0.0159912109375, 0....	[ 224545, 289, 391, 56367, 8647, 43731, 25072, 6954, 502, 4867, 122092, 147, 104, 238, 177, 170285, 186198, 910, 2947, 2489, 16487, 100, 111938, 3034, 50218, 12765, 7108, 32354, 14543, 224833, 16750, 117176, 91736, 959, 224, 16565, 2852, 3540, ...	[ 0.2161865234375, 0.1436767578125, 0.1021728515625, 0.225341796875, 0.19482421875, 0.2086181640625, 0.1209716796875, 0.1644287109375, 0.10791015625, 0.202880859375, 0.100341796875, 0.023284912109375, 0.012603759765625, 0.0291595458984375, 0.07354736328125, 0.1414794921875, 0.136108398...	embed
60904783_c1	60904783	prolog	1	site: <html> <head> <meta charset="utf-8"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <title>Playground</title> </head> <body> <script type="text/javascript" src="tau-prolog.js"></script> <h1>Playground4</h1> <script> function queryRG() { var session = pl.create(1000) var code_pl = ` robot(...	site: <html> <head> <meta charset="utf-8"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <title>Playground</title> </head> <body> <script type="text/javascript" src="tau-prolog.js"></script> <h1>Playground4</h1> <script> function queryRG() { var session = pl.create(1000) var code_pl = ` robot(...	[ 0.010986328125, 0.021240234375, 0.00191497802734375, 0.0101318359375, 0.0015411376953125, -0.00555419921875, -0.002471923828125, -0.003814697265625, 0.0162353515625, -0.07177734375, 0.0037841796875, -0.0030975341796875, -0.0302734375, -0.0230712890625, 0.0028533935546875, 0.01611328125...	[ 1764, 12, 4426, 7693, 31251, 35273, 21441, 1003, 420, 17376, 9351, 22751, 6982, 10941, 146984, 1369, 112, 20375, 61475, 57965, 102107, 5440, 97054, 64330, 37873, 32032, 10644, 22829, 24071, 19437, 50104, 9, 3454, 4867, 28175, 127, 418, 617, ...	[ 0.2181396484375, 0.0853271484375, 0.003570556640625, 0.2086181640625, 0.135986328125, 0.18603515625, 0.1160888671875, 0.0859375, 0.08013916015625, 0.1407470703125, 0.03515625, 0.1314697265625, 0.152587890625, 0.1048583984375, 0.132080078125, 0.004913330078125, 0.00384521484375, 0.1...	embed
50075064_c0	50075064	prolog	0	Title: Grammar in prolog Problem title: Grammar in prolog Tags: prolog, grammar Problem: Grammar in prolog I want to be able to translate arrays like [int(2), sep(<), int(1), sep(-), id(N)] into conditions (in this example [int(2) < int(1)-id(N)] ) using grammar. I have the grammar below: cond(_, A > B) --> expr(_,A), ...	Grammar in prolog Grammar in prolog prolog grammar Grammar Call _G2290032 Fail _G2313 _G2314 _G2336 _L254 _G2482 _L235 Exit _G2488 Redo _L279 _G2485 _L260 _G2491 _L304 _L285 _G2494 _L329 _L310 _G2497 _L354 _L335 _G2500 Grammar in prolog I want to be able to translate arrays like [int(2), sep(<), int(1), sep(-), id(N)] ...	[ 0.01312255859375, 0.00194549560546875, -0.00592041015625, 0.006744384765625, 0.0016632080078125, 0.00138092041015625, -0.006744384765625, 0.0038299560546875, 0.0023956298828125, -0.015869140625, 0.01043701171875, 0.021484375, -0.00335693359375, -0.0233154296875, 0.0264892578125, 0.0000...	[ 48078, 1727, 23, 502, 4867, 122092, 147, 26265, 724, 20543, 6460, 190355, 3742, 2681, 2592, 8659, 2588, 617, 12012, 149265, 5443, 12772, 31, 116518, 12951, 167555, 101800, 14889, 4235, 119527, 14773, 5843, 143589, 3444, 3900, 19309, 10298, 47...	[ 0.19140625, 0.117919921875, 0.0792236328125, 0.1746826171875, 0.239501953125, 0.1793212890625, 0.1397705078125, 0.1729736328125, 0.001129150390625, 0.0706787109375, 0.0894775390625, 0.14599609375, 0.03271484375, 0.06292724609375, 0.059295654296875, 0.05560302734375, 0.06512451171875,...	embed
50939220_c1	50939220	prolog	1	No permission to load source `'/home/vimos/git/SP/mooney/chill/orig-db.i'' (Non-module file already loaded into module test; trying to load into thetheory) ERROR: In: ERROR: [36] throw(error(permission_error(load,source,'/home/vimos/git/SP/mooney/chill/orig-db.i'),context(...,'Non-module file already loaded into modul...	>:compile(Filename) clause, which I suspect could be a reason for the error. There are two dynamic compiled modules test and thetheory . They are both compiled from the same file orig-db.i . If I force one of them to read from a different file like orig-db.ii , the error will be different. I tried the same code with ya...	[ -0.004547119140625, 0.00946044921875, 0.01348876953125, 0.0233154296875, -0.0031280517578125, 0.01336669921875, -0.00396728515625, -0.0011749267578125, -0.006744384765625, -0.06787109375, 0.005828857421875, -0.0078125, -0.0189208984375, -0.03173828125, 0.009521484375, 0.012451171875, ...	[ 977, 12, 58875, 1340, 132, 174350, 11627, 70731, 13, 92610, 5809, 31635, 18499, 6626, 84079, 375, 5974, 297, 88996, 3034, 136, 70, 2347, 30675, 5701, 11435, 36, 10384, 48073, 14, 37772, 12301, 12921, 1573, 18151, 15850, 853, 133266, 63284, ...	[ 0.099365234375, 0.0232696533203125, 0.176513671875, 0.2000732421875, 0.02008056640625, 0.1844482421875, 0.2276611328125, 0.1524658203125, 0.037933349609375, 0.08331298828125, 0.035858154296875, 0.037017822265625, 0.1812744140625, 0.035736083984375, 0.18115234375, 0.0799560546875, 0.2...	embed
11713849_c0	11713849	prolog	0	Title: Package Searching in Prolog Problem title: Package Searching in Prolog Tags: package, prolog, search, list, comparison Problem: Package Searching in Prolog I have the following packages: package('python', '2.6.5'). package('python', '2.5.4'). package('python', '1.5.2'). package('python', '3.1.0'). And I wrote so...	Package Searching in Prolog Package Searching in Prolog package prolog search list comparison Package Searching Prolog Integer-like-atom atom_integer Atom atom_chars number_chars Split split2 split3 gollem.swi.psy.uva.nl SWI-Prolog BAC ABAC NewABAC NewR split_version Ver VParts integer_list Lst1 RLst1 Lst2 RLst2 cmp_li...	[ 0.01275634765625, -0.004241943359375, 0.0247802734375, 0.009521484375, -0.01556396484375, 0.005218505859375, 0.010498046875, -0.0096435546875, 0.01165771484375, 0.01373291015625, 0.010009765625, 0.014404296875, 0.0016326904296875, -0.019287109375, 0.006988525390625, -0.003814697265625,...	[ 56607, 4588, 33086, 214, 23, 1250, 4867, 98169, 502, 33938, 5303, 225490, 44401, 5062, 5928, 34627, 6191, 69728, 9254, 14012, 46474, 65450, 304, 363, 6153, 2452, 51775, 26247, 38969, 10752, 8678, 441, 11321, 15012, 49068, 2356, 1052, 46354, ...	[ 0.180908203125, 0.045013427734375, 0.187255859375, 0.11279296875, 0.068603515625, 0.1763916015625, 0.259033203125, 0.189208984375, 0.1337890625, 0.173828125, 0.092041015625, 0.140380859375, 0.1219482421875, 0.15673828125, 0.1241455078125, 0.1568603515625, 0.107177734375, 0.15173339...	embed
17175790_c0	17175790	prolog	0	Title: How to create rule that returns each value as unique Problem title: How to create rule that returns each value as unique Tags: prolog-dif, prolog, crossword Problem: How to create rule that returns each value as unique I'm following along with Learn Prolog Now! and was looking at Exercise 2.4 . A solution I foun...	How to create rule that returns each value as unique How to create rule that returns each value as unique prolog-dif prolog crossword How V1H1 V1H2 V1H3 V2H1 V2H2 V2H3 V3H1 V3H2 V3H3 How to create rule that returns each value as unique I'm following along with Learn Prolog Now! and was looking at Exercise 2.4 . A solut...	[ 0.00482177734375, -0.0159912109375, 0.0022735595703125, -0.0011138916015625, -0.00811767578125, -0.00189971923828125, -0.01507568359375, 0.0111083984375, 0.0208740234375, -0.0169677734375, -0.006805419921875, 0.00168609619140625, 0.0400390625, 0.00396728515625, 0.002471923828125, 0.024...	[ 11249, 28282, 79986, 450, 30646, 12638, 34292, 237, 36998, 47, 7, 502, 4867, 428, 420, 41421, 47416, 310, 418, 841, 304, 363, 25632, 134031, 1250, 14240, 155534, 66207, 29806, 37202, 86869, 27489, 50339, 4734, 116, 138155, 138, 51347, 70541...	[ 0.040191650390625, 0.195556640625, 0.2430419921875, 0.0699462890625, 0.2315673828125, 0.1475830078125, 0.206298828125, 0.116943359375, 0.291259765625, 0.012908935546875, 0.0369873046875, 0.12451171875, 0.1820068359375, 0.0350341796875, 0.08245849609375, 0.1019287109375, 0.18371582031...	embed
52742937_c0	52742937	prolog	0	Title: How to calculate flight time and path length in Prolog Problem title: How to calculate flight time and path length in Prolog Tags: prolog, shortest-path Problem: How to calculate flight time and path length in Prolog I have this database in prolog and i would like to calculate: 1) flightTime(Start, Destination, ...	How to calculate flight time and path length in Prolog How to calculate flight time and path length in Prolog prolog shortest-path How Prolog How to calculate flight time and path length in Prolog I have this database in prolog and i would like to calculate: 1) flightTime(Start, Destination, Time, Path) to compute the ...	[ 0.01806640625, 0.0201416015625, 0.006439208984375, 0.01019287109375, -0.004608154296875, -0.01239013671875, -0.01300048828125, -0.02197265625, -0.00090789794921875, -0.048583984375, 0.001251220703125, -0.01129150390625, -0.02099609375, 0.0029296875, 0.004913330078125, -0.017578125, 0...	[ 11249, 74481, 67, 113014, 1733, 136, 60875, 140909, 23, 1250, 4867, 502, 16610, 525, 128405, 63399, 1884, 70059, 126597, 145778, 19055, 108421, 9969, 6743, 7722, 449, 10519, 5303, 683, 28412, 17721, 6626, 146619, 145755, 2046, 8951, 116361, 1...	[ 0.05169677734375, 0.17431640625, 0.0631103515625, 0.1968994140625, 0.182373046875, 0.0869140625, 0.198974609375, 0.170166015625, 0.011505126953125, 0.1580810546875, 0.219482421875, 0.11328125, 0.1463623046875, 0.0784912109375, 0.16552734375, 0.1102294921875, 0.005828857421875, 0.17...	embed
26648556_c0	26648556	prolog	0	Title: understand the running trace of quicksort in prolog Problem title: understand the running trace of quicksort in prolog Tags: prolog, sorting, trace, quicksort Problem: understand the running trace of quicksort in prolog I have the following prolog code for quicksort: gt(X,Y):- X @> Y. conc([], List, List). conc(...	understand the running trace of quicksort in prolog understand the running trace of quicksort in prolog prolog sorting trace quicksort List Head Tail List1 List2 Sorted Small Big SortedSmall SortedBig Redo _G3785 _G3782 Call _G3788 Exit understand the running trace of quicksort in prolog I have the following prolog cod...	[ 0.00958251953125, 0.00927734375, 0.020263671875, -0.01519775390625, -0.016845703125, 0.0108642578125, -0.011474609375, -0.0028076171875, 0.0120849609375, 0.0162353515625, -0.00106048583984375, 0.011962890625, -0.0201416015625, -0.0281982421875, 0.01806640625, 0.0007781982421875, 0.01...	[ 28219, 70, 51042, 144851, 111, 63773, 62351, 23, 502, 4867, 12096, 32036, 44816, 1218, 379, 53666, 69070, 297, 6096, 31, 164814, 134808, 26265, 146406, 5443, 217, 18151, 10298, 53, 27781, 83, 617, 57626, 363, 1528, 39555, 6275, 2831, 44084,...	[ 0.1629638671875, 0.0291900634765625, 0.177978515625, 0.251708984375, 0.0465087890625, 0.202880859375, 0.290771484375, 0.039642333984375, 0.1475830078125, 0.21484375, 0.1895751953125, 0.1204833984375, 0.1214599609375, 0.0809326171875, 0.07305908203125, 0.1834716796875, 0.015869140625,...	embed
50320905_c0	50320905	prolog	0	Title: Use dynamic/1 and var/1 Create Prolog clauses that allow the following Problem title: Use dynamic/1 and var/1 Create Prolog clauses that allow the following Tags: prolog-directive-dynamic, prolog Problem: Use dynamic/1 and var/1 Create Prolog clauses that allow the following ?- say([the, capital, of, switzerland...	Use dynamic/1 and var/1 Create Prolog clauses that allow the following Use dynamic/1 and var/1 Create Prolog clauses that allow the following prolog-directive-dynamic prolog Use Create Prolog Thank What Bern Use dynamic/1 and var/1 Create Prolog clauses that allow the following The last two is easy, I use say([the, cap...	[ 0.004974365234375, 0.01422119140625, 0.000835418701171875, 0.01019287109375, 0.006622314453125, 0.0272216796875, 0.014892578125, 0.0255126953125, 0.0030975341796875, -0.0301513671875, -0.01416015625, -0.0098876953125, -0.024658203125, 0.000051021575927734375, 0.02001953125, 0.015991210...	[ 36836, 84079, 11583, 136, 285, 151313, 1250, 4867, 70731, 90, 63769, 25632, 502, 936, 100034, 242554, 25689, 4865, 71342, 4568, 23468, 4527, 5154, 2347, 10323, 111, 91, 147595, 53303, 83, 770, 19, 3642, 3249, 140992, 398, 64457, 29568, 3789...	[ 0.06207275390625, 0.2066650390625, 0.1593017578125, 0.026580810546875, 0.164306640625, 0.1746826171875, 0.177001953125, 0.23876953125, 0.18408203125, 0.048919677734375, 0.14208984375, 0.103515625, 0.16259765625, 0.0865478515625, 0.08544921875, 0.1917724609375, 0.1787109375, 0.10290...	embed
28662785_c0	28662785	prolog	0	Title: PROLOG: addOne predicate, what happens when temp. variable hits the base clause, how does Prolog call values? Problem title: PROLOG: addOne predicate, what happens when temp. variable hits the base clause, how does Prolog call values? Tags: prolog Problem: PROLOG: addOne predicate, what happens when temp. variab...	PROLOG: addOne predicate, what happens when temp. variable hits the base clause, how does Prolog call values? PROLOG: addOne predicate, what happens when temp. variable hits the base clause, how does Prolog call values? prolog PROLOG Call _G1196 _G1273 Exit _G1274 _G1279 _G1280 _G1285 _G1286 PROLOG: addOne predicate, w...	[ 0.033935546875, 0.0111083984375, 0.0013427734375, 0.0036468505859375, 0.0003757476806640625, 0.01531982421875, -0.007537841796875, -0.0115966796875, 0.02197265625, -0.011962890625, 0.0185546875, -0.007232666015625, -0.0146484375, 0.0242919921875, 0.0181884765625, -0.0169677734375, 0....	[ 10514, 47510, 15190, 62068, 1653, 2063, 67, 2367, 96276, 3229, 20805, 77336, 5962, 7, 3647, 70731, 13, 3642, 1250, 4867, 11782, 142424, 5, 502, 26265, 11648, 1530, 13574, 5443, 217, 16360, 22377, 4836, 12951, 15276, 100094, 31344, 18151, 51...	[ 0.154541015625, 0.224853515625, 0.1695556640625, 0.2230224609375, 0.1478271484375, 0.159423828125, 0.07373046875, 0.018280029296875, 0.115234375, 0.043792724609375, 0.1861572265625, 0.232421875, 0.146484375, 0.037200927734375, 0.190673828125, 0.1796875, 0.0736083984375, 0.069763183...	embed
42343042_c0	42343042	prolog	0	Title: Clausify Prolog Error Problem title: Clausify Prolog Error Tags: prolog Problem: Clausify Prolog Error I have a project in PROLOG to convert an FBF function to a CNF function, where fbf2cnf is the predicate to change the function. When I run this instruction: fbf2cnf(every(X, exist(Y, foo(Y, X))), F). ... it thr...	Clausify Prolog Error Clausify Prolog Error prolog Clausify Prolog Error fbf2cnf Type skf1 _G1758 Exception _G1558 _G1557 _G1567 FBF skolem_function exist_private Final NL2 CNFFBF valid_fbf fbf2cnf_private NFBF FBF2 CNF CNF1 CNF2 flatten_and Temp flatten_or not_counter Clausify Prolog Error I have a project in PROLOG t...	[ 0.0260009765625, 0.01287841796875, 0.0062255859375, 0.016845703125, -0.0140380859375, 0.005889892578125, -0.0019989013671875, 0.0014495849609375, 0.01513671875, -0.04248046875, 0.01318359375, -0.0103759765625, 0.00244140625, -0.0264892578125, 0.01806640625, -0.03271484375, -0.0092773...	[ 100700, 40383, 1250, 4867, 212059, 502, 108642, 420, 304, 27765, 60457, 11380, 418, 2489, 10057, 5443, 63928, 1837, 12243, 18197, 36718, 919, 18700, 39, 137175, 32316, 158559, 27188, 39102, 61658, 30110, 82350, 35604, 150598, 73493, 49878, 510,...	[ 0.2066650390625, 0.287109375, 0.177001953125, 0.239501953125, 0.1807861328125, 0.1199951171875, 0.0760498046875, 0.138427734375, 0.080322265625, 0.04986572265625, 0.09619140625, 0.050750732421875, 0.029876708984375, 0.04736328125, 0.166259765625, 0.01312255859375, 0.1583251953125, ...	embed
50254680_c0	50254680	prolog	0	Title: Prolog scheduling without pressing ';' every time Problem title: Prolog scheduling without pressing ';' every time Tags: prolog, prolog-setof Problem: Prolog scheduling without pressing ';' every time I have the following file with the predicate attends which symbolizes that every student att...	Prolog scheduling without pressing ';' every time Prolog scheduling without pressing ';' every time prolog prolog-setof Prolog c216 Week-1 List Number Prolog scheduling without pressing ';' every time I have the following file with the predicate attends which symbolizes that every student attends a ...	[ 0.0128173828125, -0.0201416015625, 0.0017547607421875, 0.017578125, -0.033935546875, 0.00872802734375, -0.0201416015625, -0.0162353515625, 0.0164794921875, -0.049560546875, -0.0072021484375, 0.009033203125, 0.01116943359375, -0.007598876953125, 0.0147705078125, 0.0020294189453125, -0...	[ 1250, 4867, 5094, 15246, 15490, 24234, 214, 11907, 1733, 502, 3509, 304, 2485, 58417, 5759, 32036, 103332, 2069, 74, 25632, 11435, 1653, 2063, 67, 29966, 128201, 9836, 15411, 10750, 26696, 7146, 154162, 3444, 28282, 137175, 601, 418, 12137, ...	[ 0.1669921875, 0.2374267578125, 0.11328125, 0.1474609375, 0.08148193359375, 0.175048828125, 0.001007080078125, 0.0723876953125, 0.12890625, 0.1207275390625, 0.00457763671875, 0.0626220703125, 0.1531982421875, 0.1319580078125, 0.090087890625, 0.1175537109375, 0.0994873046875, 0.01974...	embed
34730012_c0	34730012	prolog	0	Title: Counting within a list. Help me understand this code Problem title: Counting within a list. Help me understand this code Tags: prolog-dif, prolog Problem: Counting within a list. Help me understand this code I found a 3 year old question that helps me count the number of occurrences of variables within a list . ...	Counting within a list. Help me understand this code Counting within a list. Help me understand this code prolog-dif prolog Counting Help use_module List List1 Counting within a list. Help me understand this code I found a 3 year old question that helps me count the number of occurrences of variables within a list . Th...	[ 0.0247802734375, -0.00084686279296875, 0.005828857421875, 0.00311279296875, 0.00921630859375, 0.002166748046875, -0.00872802734375, -0.005218505859375, 0.02294921875, -0.0263671875, -0.01220703125, -0.032958984375, 0.014892578125, 0.0196533203125, 0.00616455078125, -0.007720947265625, ...	[ 1311, 128396, 28032, 5303, 39527, 28219, 18151, 502, 4867, 428, 420, 4527, 83279, 32036, 418, 10, 14037, 138, 6602, 9655, 112397, 54529, 14012, 74918, 42, 69098, 77336, 35166, 35064, 43240, 10422, 32562, 81732, 16188, 20537, 17932, 10750, 119...	[ 0.1475830078125, 0.2159423828125, 0.1983642578125, 0.2113037109375, 0.05975341796875, 0.111083984375, 0.13818359375, 0.1005859375, 0.179443359375, 0.05413818359375, 0.09503173828125, 0.07061767578125, 0.08843994140625, 0.1591796875, 0.0269927978515625, 0.004791259765625, 0.0421752929...	embed
32565418_c0	32565418	prolog	0	Title: Can you use clpfd to implement a coverage algorithm? Problem title: Can you use clpfd to implement a coverage algorithm? Tags: prolog, prolog-findall, clpfd, swi-prolog Problem: Can you use clpfd to implement a coverage algorithm? Positives =[ExampleA,ExampleB,ExampleC], Negatives = [ExampleD,ExampleE,ExampleQ],...	Can you use clpfd to implement a coverage algorithm? Can you use clpfd to implement a coverage algorithm? prolog prolog-findall clpfd swi-prolog Can c_s_mining Features Value ExampleA ExampleB ExampleC ExampleD ExampleE ExampleQ Positives Negatives inf..sup TP-FP Examples Number_covered Covers _G1 _G2 _G3 Can you use c...	[ -0.00518798828125, 0.00885009765625, 0.0140380859375, 0.016845703125, -0.0064697265625, -0.000469207763671875, 0.025390625, 0.00157928466796875, 0.0125732421875, -0.0174560546875, -0.023681640625, 0.00125885009765625, -0.00518798828125, 0.0179443359375, 0.02197265625, 0.01904296875, ...	[ 4171, 4527, 33139, 39557, 71, 29479, 154271, 234873, 502, 4867, 111607, 5584, 2452, 3454, 501, 454, 7, 266, 592, 106594, 190060, 89536, 571, 2737, 156060, 221717, 34128, 2037, 18303, 51006, 103332, 63127, 76417, 418, 304, 363, 3444, 7413, 5...	[ 0.0836181640625, 0.0992431640625, 0.1236572265625, 0.1619873046875, 0.2115478515625, 0.1202392578125, 0.2685546875, 0.23046875, 0.14453125, 0.2091064453125, 0.030364990234375, 0.09429931640625, 0.121826171875, 0.07623291015625, 0.045013427734375, 0.021942138671875, 0.059814453125, ...	embed
26827514_c0	26827514	prolog	0	Title: Prolog infinite loop issue Problem title: Prolog infinite loop issue Tags: failure-slice, prolog Problem: Prolog infinite loop issue I have the below functions. When I call it with final_filter([(2, 2)], R) , it prints a lot of "2 2" pairs. When I comment get_all_sums(S, _) it works fine, however if I test separ...	Prolog infinite loop issue Prolog infinite loop issue failure-slice prolog Prolog final_filter get_all_sums get_all_sums_R NR-IT NEXT_IT R_NEXT get_all_divisors TMP_RES get_all_products_R NEXT_R get_all_products R_LEFT single_element PRODUCTS Prolog infinite loop issue I have the below functions. When I call it with fi...	[ -0.01123046875, 0.002166748046875, 0.006561279296875, -0.005615234375, -0.015380859375, -0.01263427734375, -0.01287841796875, -0.00604248046875, 0.01025390625, -0.0242919921875, 0.040283203125, 0.0238037109375, 0.00335693359375, -0.01190185546875, 0.0184326171875, 0.015869140625, 0.0...	[ 1250, 4867, 54241, 13, 40956, 31089, 137578, 13348, 502, 2704, 120337, 2046, 5584, 7, 10321, 71641, 6371, 51858, 9088, 34465, 57877, 1052, 627, 25217, 62766, 183575, 35064, 32354, 11782, 54753, 4958, 28412, 5915, 304, 116, 80836, 6868, 294, ...	[ 0.160400390625, 0.2255859375, 0.1429443359375, 0.08837890625, 0.2091064453125, 0.13525390625, 0.134765625, 0.09136962890625, 0.081298828125, 0.13427734375, 0.189208984375, 0.06317138671875, 0.130615234375, 0.07958984375, 0.171142578125, 0.037689208984375, 0.05340576171875, 0.108642...	embed
15325878_c0	15325878	prolog	0	Title: Remove of the occurences of an element in a list containing lists in prolog Problem title: Remove of the occurences of an element in a list containing lists in prolog Tags: prolog Problem: Remove of the occurences of an element in a list containing lists in prolog I've been working with this for a while. I came ...	Remove of the occurences of an element in a list containing lists in prolog Remove of the occurences of an element in a list containing lists in prolog prolog Remove Lres is_list Call Fail _G1276 Exit Remove of the occurences of an element in a list containing lists in prolog I've been working with this for a while. I ...	[ 0.0033416748046875, 0.0211181640625, -0.0028076171875, 0.00299072265625, -0.0036773681640625, -0.000705718994140625, -0.0001888275146484375, -0.0002269744873046875, 0.01324462890625, -0.02978515625, 0.01513671875, 0.0238037109375, -0.0159912109375, -0.00860595703125, 0.01190185546875, ...	[ 181139, 111, 74918, 69098, 12830, 5303, 70541, 502, 4867, 23, 214, 339, 2109, 83, 6562, 26265, 190355, 11835, 5443, 20697, 29806, 222201, 125415, 87388, 756, 120155, 3956, 2856, 2174, 46132, 35412, 11782, 35782, 903, 3917, 15549, 34292, 77336...	[ 0.20458984375, 0.04534912109375, 0.195556640625, 0.1422119140625, 0.1845703125, 0.1966552734375, 0.1180419921875, 0.157470703125, 0.21240234375, 0.04278564453125, 0.027313232421875, 0.09649658203125, 0.22314453125, 0.090576171875, 0.20849609375, 0.117919921875, 0.1357421875, 0.1042...	embed
26790014_c0	26790014	prolog	0	Title: Family database prolog query Problem title: Family database prolog query Tags: logic, prolog Problem: Family database prolog query I am using the below family database to practice prolog. I want to... 'Find the first name and surname of mothers whose children’s combined incomes are greater than £140,000, where a...	Family database prolog query Family database prolog query logic prolog Family Fname Sname Income Children Person List Sum Rest pat_jr world_of_food bean_counters sell_cell ted_jr boat_house green_machine sparrow_hotel Family database prolog query I am using the below family database to practice prolog. I want to... 'Fi...	[ 0.025390625, -0.00159454345703125, -0.006011962890625, 0.006591796875, -0.0279541015625, 0.00006151199340820312, -0.010986328125, 0.00122833251953125, 0.00634765625, -0.0225830078125, 0.006103515625, 0.0034027099609375, -0.0281982421875, -0.01043701171875, 0.01385498046875, 0.001922607...	[ 59745, 63399, 502, 4867, 41, 1294, 62775, 563, 11627, 360, 45738, 91345, 15270, 32036, 36335, 49756, 2340, 8999, 4390, 49558, 186, 66, 71013, 74703, 34680, 3674, 42, 139098, 23923, 50997, 103149, 15555, 19815, 17368, 35064, 14449, 41361, 3444...	[ 0.166259765625, 0.215576171875, 0.1673583984375, 0.22119140625, 0.12353515625, 0.07861328125, 0.1546630859375, 0.000274658203125, 0.1591796875, 0.013763427734375, 0.1290283203125, 0.09942626953125, 0.044647216796875, 0.1075439453125, 0.1024169921875, 0.1011962890625, 0.04852294921875...	embed
64824792_c0	64824792	prolog	0	Title: finding a cycle path in prolog Problem title: finding a cycle path in prolog Tags: prolog, path-finding Problem: finding a cycle path in prolog atom_elements(h1,hydrogen,[c1]). atom_elements(n1,nitrogen,[o1, o2, c2]). atom_elements(o1,oxygen,[n1]). atom_elements(o2,oxygen,[n1]). atom_elements(n2,nitrogen,[o3, o4...	finding a cycle path in prolog finding a cycle path in prolog prolog path-finding atom_elements Out Start Output List Find Privious Visited finding a cycle path in prolog Example query on the 2,4,6-Trinitrotoluene: My first step is to find a cycle path and show as a List. But the result is shown as fault . It cannot sa...	[ 0.020263671875, 0.00159454345703125, -0.000148773193359375, 0.0299072265625, 0.0030517578125, -0.0032958984375, -0.01416015625, 0.001129150390625, 0.004425048828125, -0.042724609375, -0.0078125, 0.01324462890625, -0.010986328125, 0.014404296875, 0.024658203125, 0.03369140625, -0.0131...	[ 90791, 105823, 60875, 23, 502, 4867, 10, 111607, 34627, 62766, 13538, 13794, 7077, 32036, 26040, 2319, 10023, 98684, 89536, 41, 1294, 128191, 74257, 6773, 16210, 21201, 1151, 5117, 29954, 7413, 7639, 237, 16750, 127887, 193857, 53418, 30098, ...	[ 0.099365234375, 0.2169189453125, 0.2548828125, 0.035858154296875, 0.1395263671875, 0.2308349609375, 0.03619384765625, 0.0828857421875, 0.1668701171875, 0.1614990234375, 0.05535888671875, 0.06976318359375, 0.019744873046875, 0.12255859375, 0.055572509765625, 0.005889892578125, 0.07525...	embed
26119110_c1	26119110	prolog	1	,[],['200']), element(unit,[],[ml]),]), element(item,[],['pea']) ]) ] )] )] ), element('recipe',[],... )] )]). What I want to do is to look easily for recipes based on user input. The user might give an ingredient or part of the recipe name as input. Actually I ran throught the elements by ask_element(Name, Child, Pare...	,[],['200']), element(unit,[],[ml]),]), element(item,[],['pea']) ]) ] )] )] ), element('recipe',[],... )] )]). What I want to do is to look easily for recipes based on user input. The user might give an ingredient or part of the recipe name as input. Actually I ran throught the elements by ask_element(Name, Child, Pare...	[ -0.0081787109375, 0.0125732421875, 0.00946044921875, -0.00750732421875, 0.00946044921875, 0.0306396484375, -0.0157470703125, 0.003173828125, 0.0081787109375, -0.03857421875, 0.01806640625, 0.004669189453125, -0.0220947265625, 0.01397705078125, 0.01171875, -0.00799560546875, 0.0153198...	[ 5955, 12830, 309, 217, 7237, 195, 29518, 107, 115052, 3444, 6713, 72546, 100, 48564, 7, 35509, 38937, 107730, 13648, 8337, 186227, 2831, 9351, 237, 8305, 80854, 26458, 62766, 163612, 123829, 170918, 32786, 102656, 28636, 2517, 2356, 4163, 756...	[ 0.208984375, 0.1981201171875, 0.114501953125, 0.119384765625, 0.1439208984375, 0.072509765625, 0.219482421875, 0.00958251953125, 0.1944580078125, 0.0771484375, 0.163818359375, 0.15576171875, 0.1007080078125, 0.248291015625, 0.080322265625, 0.1290283203125, 0.1851806640625, 0.245483...	embed
66747101_c0	66747101	prolog	0	Title: Problem in generating verses of a poem in prolog Problem title: Problem in generating verses of a poem in prolog Tags: prolog Problem: Problem in generating verses of a poem in prolog Given a problem in Prolog, In a lost-world language, a poem can have any number of verses, each of which takes the following form...	Problem in generating verses of a poem in prolog Problem in generating verses of a poem in prolog prolog Problem Kura Y-1 Problem in generating verses of a poem in prolog Given a problem in Prolog, In a lost-world language, a poem can have any number of verses, each of which takes the following form: A B B C D E E C F ...	[ 0.017578125, 0.01318359375, -0.0194091796875, 0.00531005859375, -0.0113525390625, 0.0108642578125, -0.0166015625, -0.0020599365234375, 0.01031494140625, -0.0166015625, 0.01708984375, -0.01165771484375, 0.021728515625, -0.0031890869140625, 0.00738525390625, 0.0036163330078125, 0.01623...	[ 15649, 12663, 1916, 51389, 7, 111, 85745, 502, 4867, 23, 88810, 990, 5759, 2967, 1250, 72856, 32554, 46876, 10, 831, 765, 2499, 14012, 12638, 3173, 62, 335, 313, 5701, 31330, 33636, 119556, 34153, 142, 309, 11908, 56992, 166, 51, 1162, ...	[ 0.1544189453125, 0.192626953125, 0.0770263671875, 0.2396240234375, 0.0914306640625, 0.054046630859375, 0.221923828125, 0.159423828125, 0.2379150390625, 0.0687255859375, 0.203125, 0.1351318359375, 0.1378173828125, 0.138671875, 0.1488037109375, 0.1265869140625, 0.08953857421875, 0.13...	embed
9803795_c0	9803795	prolog	0	Title: Why does this prolog function in my belief base fail to execute in 2apl? Problem title: Why does this prolog function in my belief base fail to execute in 2apl? Tags: prolog, multi-agent Problem: Why does this prolog function in my belief base fail to execute in 2apl? I am writing a multi-agent system in 2APL. I...	Why does this prolog function in my belief base fail to execute in 2apl? Why does this prolog function in my belief base fail to execute in 2apl? prolog multi-agent Why Location Destination Amount PriceCorrection PrevOrders Price Afz Best Aant Bod Max Best-Afz Aantal Afzender Bestemming Prijs OudeMaat Bestemming-Afzend...	[ 0.0263671875, -0.001556396484375, 0.01025390625, 0.0206298828125, -0.0034942626953125, 0.021484375, -0.01239013671875, -0.0142822265625, 0.0181884765625, -0.0181884765625, 0.01556396484375, 0.026611328125, -0.004058837890625, -0.01361083984375, 0.02001953125, -0.00457763671875, 0.005...	[ 44084, 14602, 903, 502, 4867, 32354, 23, 759, 144239, 3647, 35782, 47, 71924, 116, 2424, 11, 6024, 83963, 90788, 145778, 121147, 48025, 50886, 107, 74717, 143045, 6121, 169, 11345, 1236, 80609, 9920, 69909, 1803, 3121, 147006, 2319, 164804, ...	[ 0.0938720703125, 0.025970458984375, 0.06805419921875, 0.1722412109375, 0.2464599609375, 0.1575927734375, 0.026153564453125, 0.0182952880859375, 0.1829833984375, 0.149658203125, 0.2279052734375, 0.039215087890625, 0.1646728515625, 0.140380859375, 0.16015625, 0.00225830078125, 0.111938...	embed
30676903_c0	30676903	prolog	0	Title: Wait the end of a predicate Prolog Problem title: Wait the end of a predicate Prolog Tags: predicate, wait, prolog Problem: Wait the end of a predicate Prolog I have a predicate list_moves(Move) , that gives all the possible moves for a game. Then I have the following predicates : find_best_move:- nb_setval(best...	Wait the end of a predicate Prolog Wait the end of a predicate Prolog predicate wait prolog Wait Prolog list_moves Move find_best_move nb_setval NewMove nb_getval OldMove get_best_move Wait the end of a predicate Prolog I have a predicate list_moves(Move) , that gives all the possible moves for a game. Then I have the ...	[ 0.0081787109375, 0.0096435546875, 0.011962890625, 0.005645751953125, -0.017333984375, 0.019287109375, 0.01397705078125, 0.002349853515625, 0.01409912109375, -0.05712890625, 0.0098876953125, 0.0299072265625, 0.00048828125, -0.00982666015625, 0.00872802734375, -0.0031890869140625, 0.00...	[ 175254, 3564, 111, 10, 1653, 2063, 1250, 4867, 40485, 502, 5303, 432, 135828, 7413, 32168, 275, 3509, 1405, 9083, 3794, 25074, 272, 2046, 3132, 76199, 7722, 25813, 6712, 3444, 4734, 1632, 11782, 2965, 2967, 71358, 3789, 12989, 167785, 34292...	[ 0.2371826171875, 0.1685791015625, 0.01898193359375, 0.001373291015625, 0.1468505859375, 0.19775390625, 0.1229248046875, 0.1888427734375, 0.2357177734375, 0.0882568359375, 0.1414794921875, 0.1318359375, 0.181640625, 0.0855712890625, 0.1544189453125, 0.0240478515625, 0.05633544921875, ...	embed
74130089_c0	74130089	prolog	0	Title: Why do I get multiple true and false and I don't get the Result of how many occurence in the list? Problem title: Why do I get multiple true and false and I don't get the Result of how many occurence in the list? Tags: prolog Problem: Why do I get multiple true and false and I don't get the Result of h...	Why do I get multiple true and false and I don't get the Result of how many occurence in the list? Why do I get multiple true and false and I don't get the Result of how many occurence in the list? prolog Why Result count_element Element List Counter Head Rest NewCounter Why do I get multiple true and false a...	[ 0.004119873046875, 0.005615234375, -0.005615234375, 0.0218505859375, 0.00347900390625, 0.005615234375, 0.00189971923828125, 0.0003185272216796875, 0.0252685546875, -0.0194091796875, -0.01470947265625, -0.0281982421875, 0.007171630859375, 0.0289306640625, 0.004241943359375, -0.006744384...	[ 44084, 2046, 48716, 29568, 136, 98320, 3768, 18, 126684, 3642, 5941, 74918, 6620, 5303, 54, 2301, 111, 502, 4867, 54529, 62766, 48325, 32036, 197956, 44816, 49756, 2356, 108210, 56, 87, 1284, 110, 69098, 49041, 50339 ]	[ 0.111572265625, 0.0853271484375, 0.227294921875, 0.2091064453125, 0.1148681640625, 0.232421875, 0.030548095703125, 0.1136474609375, 0.198974609375, 0.0391845703125, 0.0938720703125, 0.1488037109375, 0.0728759765625, 0.171630859375, 0.03765869140625, 0.07794189453125, 0.02642822265625...	embed
28482631_c0	28482631	prolog	0	Title: How to use SPARQL Filter query function in prolog query Problem title: How to use SPARQL Filter query function in prolog query Tags: sparql, allegrograph, prolog, rdf Problem: How to use SPARQL Filter query function in prolog query I want to query those persons from RDF graphdatabse who are traveled at the same ...	How to use SPARQL Filter query function in prolog query How to use SPARQL Filter query function in prolog query sparql allegrograph prolog rdf How SPARQL Filter SELECT DISTINCT fd1 td1 fd2 td2 WHERE ns:hasTravelledAt ns:hasLocation ns:fromDate ns:toDate How to use SPARQL Filter query function in prolog query I want to ...	[ 0.0091552734375, 0.009521484375, -0.0103759765625, 0.00469970703125, 0.0029449462890625, -0.0167236328125, -0.0093994140625, 0.00567626953125, 0.00927734375, -0.041748046875, -0.005096435546875, 0.02490234375, -0.005035400390625, -0.02587890625, 0.0057373046875, 0.006591796875, 0.009...	[ 11249, 4527, 159, 60436, 2737, 866, 128896, 41, 1294, 32354, 23, 502, 4867, 27148, 99247, 747, 8407, 41382, 4216, 420, 6755, 144832, 54390, 1238, 71, 418, 304, 1779, 10557, 201142, 6259, 28848, 15363, 161063, 86291, 188, 3444, 8382, 3445, ...	[ 0.056854248046875, 0.1309814453125, 0.036224365234375, 0.1663818359375, 0.182861328125, 0.158935546875, 0.288818359375, 0.1395263671875, 0.1201171875, 0.1607666015625, 0.0225982666015625, 0.1474609375, 0.20703125, 0.1434326171875, 0.2425537109375, 0.07464599609375, 0.1143798828125, ...	embed
61101139_c0	61101139	prolog	0	Title: Recursion problem in Prolog - getting False instead of True when going out of recursion Problem title: Recursion problem in Prolog - getting False instead of True when going out of recursion Tags: prolog, recursion Problem: Recursion problem in Prolog - getting False instead of True when going out of recursion I...	Recursion problem in Prolog - getting False instead of True when going out of recursion Recursion problem in Prolog - getting False instead of True when going out of recursion prolog recursion Recursion Prolog Finally List Recursion problem in Prolog - getting False instead of True when going out of recursion I am tryi...	[ -0.0086669921875, -0.0113525390625, 0.025634765625, 0.015380859375, -0.018798828125, 0.0091552734375, -0.002655029296875, 0.00872802734375, 0.0004482269287109375, -0.006561279296875, 0.032470703125, 0.0233154296875, -0.021728515625, -0.01422119140625, 0.0228271484375, 0.002273559570312...	[ 165428, 42, 6889, 2967, 1250, 4867, 20949, 22225, 184, 64457, 87599, 3229, 7730, 1810, 111, 195625, 1830, 502, 32036, 23, 8781, 1528, 28288, 2174, 1653, 2063, 67, 707, 86869, 107730, 959, 4488, 6528, 66211, 27781, 26785, 149842, 647, 1636, ...	[ 0.1717529296875, 0.1767578125, 0.12841796875, 0.1826171875, 0.1636962890625, 0.23095703125, 0.0714111328125, 0.200439453125, 0.165771484375, 0.1427001953125, 0.2274169921875, 0.04034423828125, 0.1004638671875, 0.1748046875, 0.0780029296875, 0.2191162109375, 0.10394287109375, 0.0915...	embed
31040079_c0	31040079	prolog	0	Title: One recursive algorithm better than the other, why? Problem title: One recursive algorithm better than the other, why? Tags: prolog, optimization, recursion Problem: One recursive algorithm better than the other, why? Here are two similar algorithms for last/2 . Why does last_element0/2 perform better than last_...	One recursive algorithm better than the other, why? One recursive algorithm better than the other, why? prolog optimization recursion One last_element0 last_element1 Last CPU Lips One recursive algorithm better than the other, why? Here are two similar algorithms for last/2 . Why does last_element0/2 perform better tha...	[ 0.00421142578125, 0.0205078125, 0.007598876953125, 0.007080078125, 0.004791259765625, -0.00799560546875, -0.0284423828125, -0.008056640625, 0.0079345703125, -0.007171630859375, 0.01495361328125, -0.0062255859375, -0.0003757476806640625, 0.005279541015625, 0.0286865234375, -0.0151367187...	[ 6561, 195625, 5844, 234873, 11522, 3501, 3789, 15400, 502, 4867, 87235, 4568, 62766, 2389, 418, 21672, 86039, 156903, 11853, 6626, 21373, 7, 12477, 44084, 14602, 51339, 118551, 4173, 18151, 39555, 5299, 1284, 959, 237, 27650, 104250, 10, 1772...	[ 0.1180419921875, 0.2249755859375, 0.143798828125, 0.265869140625, 0.19970703125, 0.04833984375, 0.06414794921875, 0.1201171875, 0.1103515625, 0.1776123046875, 0.1473388671875, 0.2137451171875, 0.2066650390625, 0.1075439453125, 0.000701904296875, 0.157470703125, 0.1822509765625, 0.1...	embed
67854824_c0	67854824	prolog	0	Title: Why is exporting fixity declarations a "bad idea"? Problem title: Why is exporting fixity declarations a "bad idea"? Tags: sml, prolog, haskell, infix-notation Problem: Why is exporting fixity declarations a "bad idea"? According to David MacQueen in his Reflections on Standard ML report 1 , ...	Why is exporting fixity declarations a "bad idea"? Why is exporting fixity declarations a "bad idea"? sml prolog haskell infix-notation Why Why is exporting fixity declarations a "bad idea"? According to David MacQueen in his Reflections on Standard ML report 1 , Now I do agree with him on the claim...	[ 0.029541015625, 0.0013275146484375, 0.0089111328125, 0.006805419921875, 0.0072021484375, 0.006256103515625, 0.006195068359375, -0.00640869140625, 0.0035400390625, 0.0247802734375, 0.0169677734375, -0.010498046875, -0.00099945068359375, 0.02294921875, 0.0191650390625, 0.010986328125, ...	[ 44084, 31255, 214, 30022, 2481, 21635, 5256, 12283, 6528, 7237, 502, 4867, 1556, 142508, 23, 55923, 157, 6765, 4727, 41732, 33, 53295, 8996, 20744, 39456, 13416, 53520, 63043, 14375, 191, 44679, 42, 6494, 89159, 76242, 38937, 5983, 39933, 4...	[ 0.09381103515625, 0.269287109375, 0.09716796875, 0.2392578125, 0.1380615234375, 0.2078857421875, 0.1009521484375, 0.1513671875, 0.1439208984375, 0.100830078125, 0.08056640625, 0.1827392578125, 0.0833740234375, 0.212158203125, 0.118408203125, 0.205810546875, 0.1361083984375, 0.09625...	embed
56061112_c0	56061112	prolog	0	Title: Modules exporting identical predicates in Prolog Problem title: Modules exporting identical predicates in Prolog Tags: prolog, swi-prolog Problem: Modules exporting identical predicates in Prolog I have a (large) number of Prolog files each of which contains a uniquely named module. All modules export the same s...	Modules exporting identical predicates in Prolog Modules exporting identical predicates in Prolog prolog swi-prolog Modules Prolog N-1 use_module Modules exporting identical predicates in Prolog I have a (large) number of Prolog files each of which contains a uniquely named module. All modules export the same set of pr...	[ 0.0101318359375, -0.0007476806640625, 0.01129150390625, 0.0101318359375, -0.009765625, -0.0002689361572265625, 0.019287109375, 0.002960205078125, 0.006927490234375, -0.034423828125, 0.0068359375, 0.01019287109375, -0.0001544952392578125, -0.0028076171875, 0.00762939453125, 0.0090332031...	[ 63014, 31255, 31943, 6827, 1653, 2063, 1636, 1250, 4867, 23, 502, 2452, 3454, 541, 5759, 4527, 83279, 14012, 102158, 36998, 88996, 5701, 5423, 1884, 1614, 3509, 5201, 159, 38969, 10752, 20187, 27781, 69307, 876, 149766, 61924, 1238, 12477, ...	[ 0.2152099609375, 0.231201171875, 0.1763916015625, 0.107177734375, 0.183349609375, 0.2047119140625, 0.0755615234375, 0.1685791015625, 0.2322998046875, 0.0170440673828125, 0.1090087890625, 0.1396484375, 0.06695556640625, 0.0232086181640625, 0.0870361328125, 0.1051025390625, 0.095581054...	embed
51218876_c0	51218876	prolog	0	Title: How can I avoid nontermination with an integer base case? Problem title: How can I avoid nontermination with an integer base case? Tags: prolog, failure-slice Problem: How can I avoid nontermination with an integer base case? I want to write a predicate that recurses until 0, but it consistently fails to termina...	How can I avoid nontermination with an integer base case? How can I avoid nontermination with an integer base case? prolog failure-slice How test.pl NewY use_module int_int_prod Num1 Num2 Result NewNum2 NewResult How can I avoid nontermination with an integer base case? I want to write a predicate that recurses until 0...	[ -0.004638671875, 0.01220703125, 0.01104736328125, 0.00012063980102539062, -0.0220947265625, 0.000553131103515625, 0.00927734375, -0.00555419921875, 0.0203857421875, -0.004058837890625, 0.01239013671875, 0.005279541015625, -0.0162353515625, 0.00897216796875, 0.023681640625, 0.0009994506...	[ 11249, 831, 71864, 351, 720, 91407, 678, 892, 1505, 3647, 7225, 502, 4867, 137578, 13348, 3034, 2424, 2356, 1723, 4527, 83279, 23, 18, 4288, 112348, 52782, 418, 304, 126684, 316, 7, 7136, 3444, 33022, 1653, 2063, 195625, 24189, 757, 74729...	[ 0.041656494140625, 0.06170654296875, 0.25732421875, 0.1663818359375, 0.2108154296875, 0.1802978515625, 0.098388671875, 0.1229248046875, 0.09075927734375, 0.2127685546875, 0.198486328125, 0.08795166015625, 0.1365966796875, 0.179931640625, 0.1226806640625, 0.1983642578125, 0.1369628906...	embed
20033623_c0	20033623	prolog	0	Title: Fluents of more than one goal in prolog Problem title: Fluents of more than one goal in prolog Tags: infinite-loop, prolog Problem: Fluents of more than one goal in prolog This is a block world problem which is going to move the blocks where we want them to be. The predicate located_on tells us the locations of ...	Fluents of more than one goal in prolog Fluents of more than one goal in prolog infinite-loop prolog Fluents located_on goal_state Successor Goal area2 _G4037 _G4036 _G4040 _G4039 _G4043 _G4042 _G4046 _G4045 _G4049 _G344 _G343 _G347 _G346 _G350 _G349 _G353 _G352 _G356 _G355 _G359 Initial initial_state area1 Poss area3 ...	[ -0.0059814453125, 0.004638671875, -0.00836181640625, 0.0159912109375, -0.005462646484375, -0.0224609375, -0.002197265625, -0.0026702880859375, 0.0031280517578125, -0.034912109375, 0.00164794921875, 0.01458740234375, 0.000701904296875, -0.01214599609375, 0.0074462890625, 0.0027770996093...	[ 36157, 35066, 1286, 3501, 1632, 69236, 502, 4867, 54241, 13, 28354, 105866, 191, 61340, 144053, 748, 2016, 289, 16128, 304, 2839, 10945, 8659, 9323, 11548, 9271, 4633, 12977, 132993, 10289, 125450, 45160, 117760, 127875, 5843, 129971, 104043, ...	[ 0.24072265625, 0.1929931640625, 0.146240234375, 0.1160888671875, 0.12109375, 0.250244140625, 0.182861328125, 0.219970703125, 0.1534423828125, 0.050201416015625, 0.191162109375, 0.2327880859375, 0.23681640625, 0.1500244140625, 0.17236328125, 0.0828857421875, 0.1339111328125, 0.03881...	embed
64718517_c0	64718517	prolog	0	Title: Concatenate two lists with determined values in prolog Problem title: Concatenate two lists with determined values in prolog Tags: prolog Problem: Concatenate two lists with determined values in prolog So I just tried Prolog and here, I wanted to try making my own concatenate function, that combines two lists (F...	Concatenate two lists with determined values in prolog Concatenate two lists with determined values in prolog prolog Concatenate These Element Result Queue Head Tail Tail2 FList SList Y-1 X-1 Query Concatenate two lists with determined values in prolog So I just tried Prolog and here, I wanted to try making my own conc...	[ 0.0299072265625, 0.00677490234375, -0.004180908203125, 0.01470947265625, -0.01055908203125, 0.0205078125, -0.0034942626953125, 0.0145263671875, 0.0087890625, -0.0203857421875, 0.01129150390625, -0.01287841796875, -0.02685546875, -0.0096435546875, 0.01251220703125, -0.0137939453125, 0...	[ 1657, 33478, 76, 67, 6626, 5303, 7, 678, 83324, 71, 142424, 502, 4867, 32255, 48325, 126684, 5813, 44816, 1218, 304, 63674, 1419, 154663, 990, 5759, 1193, 58836, 37842, 1250, 9790, 20662, 10002, 158, 32354, 70163, 207263, 32036, 5117, 80854...	[ 0.115966796875, 0.2076416015625, 0.1585693359375, 0.1224365234375, 0.15771484375, 0.22998046875, 0.00732421875, 0.07305908203125, 0.177001953125, 0.088134765625, 0.14697265625, 0.15185546875, 0.226806640625, 0.05145263671875, 0.1580810546875, 0.10723876953125, 0.064453125, 0.060913...	embed
3800105_c0	3800105	prolog	0	Title: Prolog: Doubling the value of each element in a list of lists and returning a single list Problem title: Prolog: Doubling the value of each element in a list of lists and returning a single list Tags: prolog Problem: Prolog: Doubling the value of each element in a list of lists and returning a single list I need...	Prolog: Doubling the value of each element in a list of lists and returning a single list Prolog: Doubling the value of each element in a list of lists and returning a single list prolog Prolog Doubling Yes mega_append List m_a Prolog: Doubling the value of each element in a list of lists and returning a single list I ...	[ 0.005157470703125, 0.023681640625, 0.0140380859375, 0.003814697265625, 0.00994873046875, 0.03515625, -0.0140380859375, -0.00738525390625, 0.041259765625, -0.0037841796875, 0.01275634765625, -0.00799560546875, -0.00421142578125, -0.01019287109375, 0.0079345703125, -0.0025482177734375, ...	[ 1250, 4867, 40641, 79298, 34292, 12638, 12830, 5303, 30646, 11001, 502, 32635, 31534, 9007, 3611, 32036, 347, 454, 11, 23, 3871, 33022, 5423, 70731, 90, 5646, 892, 1505, 678, 756, 80854, 41929, 71, 1295, 42658, 39, 16610, 73342, 3642, 175...	[ 0.1810302734375, 0.2386474609375, 0.181640625, 0.1734619140625, 0.1976318359375, 0.08544921875, 0.183837890625, 0.2039794921875, 0.1666259765625, 0.1907958984375, 0.1337890625, 0.1451416015625, 0.1627197265625, 0.152099609375, 0.201171875, 0.2022705078125, 0.050567626953125, 0.0892...	embed
47621388_c0	47621388	prolog	0	Title: Prolog: Checking if the first and last character of a string are left and right squiggly brackets('{' & '}') Problem title: Prolog: Checking if the first and last character of a string are left and right squiggly brackets('{' & '}') Tags: string, prolog, equality P...	Prolog: Checking if the first and last character of a string are left and right squiggly brackets('{' & '}') Prolog: Checking if the first and last character of a string are left and right squiggly brackets('{' & '}') string prolog equality Prolog Checking start_left_squi...	[ -0.0084228515625, 0.0037841796875, -0.00653076171875, 0.007415771484375, -0.0166015625, 0.01806640625, -0.00653076171875, 0.00262451171875, 0.01318359375, 0.0120849609375, 0.017822265625, 0.01055908203125, -0.01177978515625, -0.00994873046875, 0.01312255859375, 0.001434326171875, -0....	[ 1250, 4867, 38679, 214, 2174, 5117, 136, 4568, 62816, 79315, 621, 25737, 7108, 91, 3181, 9815, 538, 1620, 27853, 7, 3768, 502, 161789, 4034, 133, 2480, 129384, 105451, 9254, 3564, 54969, 13485, 71, 21672, 619, 3525, 3714, 2452, 2424, 3896...	[ 0.142822265625, 0.1981201171875, 0.1793212890625, 0.0196533203125, 0.06597900390625, 0.1077880859375, 0.10308837890625, 0.1805419921875, 0.1796875, 0.235595703125, 0.0150604248046875, 0.173095703125, 0.1329345703125, 0.032989501953125, 0.1573486328125, 0.1593017578125, 0.12890625, ...	embed
60809926_c1	60809926	prolog	1	) % Function that tests if A is to the right of B (will be used in the final question) right(A, B, List) :- nextto(B, A, List). % The Brit lives in the red house hint1([(brit, red, _, _, _)\|_]) . hint1([_\|T]) :- hint1(T) . % The Swede keeps dogs as pets hint2([(swede, _, _, _, dog)\|_]) . hint2([_\|T]) :- hint2(T) . % Th...	) % Function that tests if A is to the right of B (will be used in the final question) right(A, B, List) :- nextto(B, A, List). % The Brit lives in the red house hint1([(brit, red, _, _, _)\|_]) . hint1([_\|T]) :- hint1(T) . % The Swede keeps dogs as pets hint2([(swede, _, _, _, dog)\|_]) . hint2([_\|T]) :- hint2(T) . % Th...	[ -0.0084228515625, -0.01300048828125, 0.03662109375, 0.032470703125, 0.01019287109375, 0.00262451171875, -0.0262451171875, 0.0208740234375, 0.0038604736328125, -0.016845703125, -0.005889892578125, 0.005706787109375, -0.00408935546875, 0.01116943359375, -0.00640869140625, 0.016357421875,...	[ 1388, 1745, 28670, 10763, 450, 109921, 2174, 62, 83, 47, 70, 7108, 111, 335, 110641, 11814, 23, 2704, 9655, 16, 284, 32036, 15772, 11737, 188, 571, 194, 581, 21689, 60742, 4842, 18276, 5122, 18, 418, 80971, 618, 74412, 112, 13695, 7, ...	[ 0.05889892578125, 0.1668701171875, 0.2138671875, 0.1846923828125, 0.086181640625, 0.26220703125, 0.142333984375, 0.08599853515625, 0.1148681640625, 0.195068359375, 0.100830078125, 0.218505859375, 0.197998046875, 0.134521484375, 0.03173828125, 0.140625, 0.1070556640625, 0.1778564453...	embed
61210286_c0	61210286	prolog	0	Title: How to formulate an exception for findall/3 correctly? Problem title: How to formulate an exception for findall/3 correctly? Tags: prolog-findall, prolog Problem: How to formulate an exception for findall/3 correctly? I have startet to learn Prolog and I want to get a list of opponents of players with findall/3....	How to formulate an exception for findall/3 correctly? How to formulate an exception for findall/3 correctly? prolog-findall prolog the How Only OpponentList How to formulate an exception for findall/3 correctly? I have startet to learn Prolog and I want to get a list of opponents of players with findall/3. In the Gene...	[ 0.0047607421875, 0.007110595703125, 0.011474609375, -0.00286865234375, 0.0225830078125, 0.0027313232421875, 0.0020904541015625, 0.01611328125, 0.006072998046875, -0.00164031982421875, -0.0019683837890625, -0.0159912109375, -0.00142669677734375, 0.00830078125, 0.002197265625, -0.0011291...	[ 11249, 26168, 67, 142, 131527, 100, 7413, 5584, 18113, 26785, 502, 4867, 111607, 87293, 2331, 54137, 154663, 1250, 5303, 233, 92865, 9082, 47691, 15190, 4734, 20653, 40494, 58585, 68034, 108, 125682, 137578, 23755, 84751, 158839, 132283 ]	[ 0.045379638671875, 0.18896484375, 0.060272216796875, 0.0305633544921875, 0.2481689453125, 0.0240936279296875, 0.1474609375, 0.1756591796875, 0.19677734375, 0.0938720703125, 0.057037353515625, 0.134521484375, 0.0947265625, 0.1431884765625, 0.1319580078125, 0.2078857421875, 0.119262695...	embed
16970790_c1	16970790	prolog	1	XX) , insert_at(L,XX,K,L1) , my_flatten(L1,R). get_num_spaces(L,N,X):-sum(L,S), X is N-S. generate_spaces(N,L,X):- insert_at_mul(L,'',1,X,N). vecLine2BitLineAux([],[],_,_,_). vecLine2BitLineAux([X\|Tail1],[Y\|Tail2],N,L,Lnew):- insert_at_mul(L,'*',Y,Lnew,X) ,vecLine2BitLineAux(Tail1,Tail2,N,Lnew,R). // problem here!!! ve...	XX) , insert_at(L,XX,K,L1) , my_flatten(L1,R). get_num_spaces(L,N,X):-sum(L,S), X is N-S. generate_spaces(N,L,X):- insert_at_mul(L,'',1,X,N). vecLine2BitLineAux([],[],_,_,_). vecLine2BitLineAux([X\|Tail1],[Y\|Tail2],N,L,Lnew):- insert_at_mul(L,'*',Y,Lnew,X) ,vecLine2BitLineAux(Tail1,Tail2,N,Lnew,R). // problem here!!! ve...	[ -0.023681640625, 0.007080078125, -0.01544189453125, 0.010498046875, 0.00543212890625, 0.02734375, -0.02001953125, -0.0235595703125, 0.007110595703125, -0.0181884765625, -0.006683349609375, 0.007568359375, -0.00008249282836914062, -0.024169921875, -0.00994873046875, 0.00921630859375, ...	[ 14214, 183540, 257, 866, 42918, 605, 17727, 759, 150632, 510, 418, 1052, 2046, 2606, 65421, 839, 1542, 11832, 294, 1193, 541, 9, 139392, 15458, 22834, 93232, 304, 571, 217, 6077, 9874, 1723, 54936, 35259, 379, 2967, 1564, 1511, 76362, 323...	[ 0.1375732421875, 0.23876953125, 0.135498046875, 0.07977294921875, 0.111572265625, 0.0623779296875, 0.048828125, 0.098388671875, 0.09063720703125, 0.145263671875, 0.04736328125, 0.04400634765625, 0.031097412109375, 0.1217041015625, 0.2242431640625, 0.06298828125, 0.09326171875, 0.15...	embed
47767711_c0	47767711	prolog	0	Title: Prolog predicate that will check if a list A is a list of the prefix sums of a list D Problem title: Prolog predicate that will check if a list A is a list of the prefix sums of a list D Tags: clpfd, list, prolog Problem: Prolog predicate that will check if a list A is a list of the prefix sums of a list D So I'...	Prolog predicate that will check if a list A is a list of the prefix sums of a list D Prolog predicate that will check if a list A is a list of the prefix sums of a list D clpfd list prolog Prolog TOTAL Prolog predicate that will check if a list A is a list of the prefix sums of a list D So I'm very new to prolog and h...	[ 0.0072021484375, 0.0078125, 0.00860595703125, 0.009765625, -0.0240478515625, 0.0023193359375, -0.015625, -0.0023345947265625, 0.01068115234375, -0.0064697265625, 0.00848388671875, -0.00110626220703125, 0.002349853515625, -0.00469970703125, 0.015869140625, 0.01324462890625, 0.00531005...	[ 1250, 4867, 1653, 2063, 67, 12765, 2174, 5303, 62, 83, 183114, 10554, 391, 39557, 71, 502, 9926, 30487, 33022, 40407, 2886, 892, 59121, 645, 3121, 12921, 48322, 25820, 82424, 208806, 43240, 5117, 142424, 12638, 105950, 17932, 12830, 26785, ...	[ 0.1708984375, 0.228271484375, 0.1527099609375, 0.1746826171875, 0.05609130859375, 0.19384765625, 0.085693359375, 0.1962890625, 0.112060546875, 0.051422119140625, 0.2264404296875, 0.1583251953125, 0.156982421875, 0.040924072265625, 0.060211181640625, 0.1173095703125, 0.07275390625, ...	embed
68618525_c0	68618525	prolog	0	Title: How to selectively run a goal in a clause Problem title: How to selectively run a goal in a clause Tags: nested-lists, prolog, list Problem: How to selectively run a goal in a clause I'm trying to generate some latex code with prolog. I'm generating nodes connected by edges with the world they belong to. My code...	How to selectively run a goal in a clause How to selectively run a goal in a clause nested-lists prolog list How print_valutations Stream Number_of_nodes Head Tail Number_of_nodes1 single_valutation Number_of_nodes-1 Node display_val FileName How to selectively run a goal in a clause I'm trying to generate some latex c...	[ -0.0042724609375, 0.01544189453125, 0.009521484375, 0.01251220703125, -0.025634765625, 0.01080322265625, -0.006500244140625, -0.0281982421875, 0.001617431640625, 0.000579833984375, -0.00408935546875, -0.017578125, -0.0084228515625, -0.017333984375, 0.00084686279296875, -0.0103759765625...	[ 11249, 47, 36849, 5844, 538, 11675, 69236, 23, 70731, 13, 10, 8512, 71, 6562, 502, 4867, 5303, 28412, 27494, 22062, 115061, 103332, 4390, 157, 44816, 1218, 988, 11001, 5759, 438, 112, 44116, 1405, 42724, 163612, 31577, 139392, 21, 24371, ...	[ 0.06231689453125, 0.0292510986328125, 0.191650390625, 0.167236328125, 0.0228271484375, 0.1883544921875, 0.273193359375, 0.1070556640625, 0.2186279296875, 0.118408203125, 0.0631103515625, 0.135498046875, 0.025665283203125, 0.1114501953125, 0.1080322265625, 0.1685791015625, 0.075500488...	embed
61644753_c0	61644753	prolog	0	Title: Printing a binary tree in Prolog based on a matrix Problem title: Printing a binary tree in Prolog based on a matrix Tags: binary-tree, prolog, matrix Problem: Printing a binary tree in Prolog based on a matrix I wanted to print a binary tree by making a matrix based on coordinates which will corresponding nodes...	Printing a binary tree in Prolog based on a matrix Printing a binary tree in Prolog based on a matrix binary-tree prolog matrix Printing Prolog Printing a binary tree in Prolog based on a matrix I wanted to print a binary tree by making a matrix based on coordinates which will corresponding nodes have in the tree. The ...	[ 0.029052734375, 0.016357421875, -0.00035858154296875, -0.01556396484375, 0.00543212890625, 0.01239013671875, -0.01312255859375, 0.0032196044921875, -0.01422119140625, -0.01031494140625, -0.0130615234375, -0.053466796875, -0.0103759765625, -0.0155029296875, 0.000576019287109375, 0.01171...	[ 39754, 2394, 6635, 53201, 1250, 4867, 35509, 50944, 425, 23, 62600, 502, 36663, 28412, 176866, 110, 40197, 25737, 40715, 7108, 117396, 33636, 45646, 91, 339, 157, 32845, 541, 391, 3564, 67229, 17324, 8781, 138, 54092, 27781, 112, 361, 10461...	[ 0.206787109375, 0.1851806640625, 0.1324462890625, 0.25048828125, 0.1439208984375, 0.2159423828125, 0.08441162109375, 0.1650390625, 0.0579833984375, 0.0216217041015625, 0.185791015625, 0.1129150390625, 0.041412353515625, 0.1890869140625, 0.144287109375, 0.06976318359375, 0.17199707031...	embed
77129393_c0	77129393	prolog	0	Title: Prolog: How do I make repeating print/input statements? Problem title: Prolog: How do I make repeating print/input statements? Tags: recursion, io, prolog Problem: Prolog: How do I make repeating print/input statements? I'm using SWISH Prolog to create a 'chatbot' that stops when the user writes "quit." So far t...	Prolog: How do I make repeating print/input statements? Prolog: How do I make repeating print/input statements? recursion io prolog Prolog How Goodbye Newx Prolog: How do I make repeating print/input statements? I'm using SWISH Prolog to create a 'chatbot' that stops when the user writes "quit." So far this is my code:...	[ -0.01324462890625, 0.00860595703125, -0.00933837890625, 0.0145263671875, -0.005523681640625, 0.0208740234375, 0.017333984375, -0.0157470703125, 0.0137939453125, -0.00970458984375, 0.0091552734375, -0.00921630859375, -0.021240234375, 0.0048828125, 0.023681640625, 0.016845703125, 0.024...	[ 1250, 4867, 11249, 3249, 119140, 214, 28412, 64, 73, 7077, 63805, 7, 87, 195625, 1830, 22995, 502, 18621, 1272, 2356, 425, 54, 17368, 61595, 79909, 28282, 21393, 9190, 7279, 3229, 38937, 33022, 3181, 18, 2060, 18151, 14847, 127877, 41206, ...	[ 0.1851806640625, 0.2431640625, 0.0982666015625, 0.1197509765625, 0.28857421875, 0.1693115234375, 0.225830078125, 0.09222412109375, 0.1171875, 0.1724853515625, 0.26123046875, 0.02276611328125, 0.045501708984375, 0.223876953125, 0.080322265625, 0.151611328125, 0.133056640625, 0.04394...	embed
54690229_c0	54690229	prolog	0	Title: How to backtrack over a NxN board in Prolog? Problem title: How to backtrack over a NxN board in Prolog? Tags: prolog Problem: How to backtrack over a NxN board in Prolog? I currently have to make some sort of Wumpus World implementation in SWI Prolog and give all possible paths over a board of size NxN , I have...	How to backtrack over a NxN board in Prolog? How to backtrack over a NxN board in Prolog? prolog How NxN Prolog Found GOLD How to backtrack over a NxN board in Prolog? I currently have to make some sort of Wumpus World implementation in SWI Prolog and give all possible paths over a board of size NxN , I have done sever...	[ 0.02099609375, 0.01708984375, 0.009521484375, 0.01153564453125, -0.0052490234375, 0.00634765625, 0.01324462890625, 0.00994873046875, 0.002349853515625, -0.0537109375, -0.002410888671875, 0.0137939453125, -0.012451171875, -0.008056640625, 0.0009307861328125, 0.0008697509765625, 0.0058...	[ 11249, 47, 4420, 125728, 645, 541, 425, 839, 45443, 23, 1250, 4867, 502, 215624, 213865, 601, 316, 7332, 6661, 208124, 159, 38969, 8337, 756, 7722, 60875, 13267, 57143, 26366, 86869, 66211, 2046, 23882, 70, 86761, 1556, 4034, 1295, 61475, ...	[ 0.1080322265625, 0.08660888671875, 0.1719970703125, 0.27001953125, 0.1805419921875, 0.0797119140625, 0.151611328125, 0.21923828125, 0.228515625, 0.0654296875, 0.1463623046875, 0.2271728515625, 0.07171630859375, 0.137451171875, 0.1966552734375, 0.011138916015625, 0.052093505859375, ...	embed
73871212_c0	73871212	prolog	0	Title: How to implement SKI combinators in Prolog? Problem title: How to implement SKI combinators in Prolog? Tags: prolog, lambda-calculus, combinators Problem: How to implement SKI combinators in Prolog? I want to implement SKI combinators in Prolog. There are just 3 simple rules: (I x) = x ((K x) y) = x (S x y z) = ...	How to implement SKI combinators in Prolog? How to implement SKI combinators in Prolog? prolog lambda-calculus combinators How SKI Prolog How to implement SKI combinators in Prolog? I want to implement SKI combinators in Prolog. There are just 3 simple rules: (I x) = x ((K x) y) = x (S x y z) = (x z (y z)) I came up wi...	[ 0.004547119140625, 0.029052734375, 0.01177978515625, -0.005645751953125, -0.0016326904296875, 0.009521484375, -0.00634765625, 0.0101318359375, 0.0034027099609375, -0.03076171875, 0.0223388671875, 0.00677490234375, -0.0224609375, 0.005126953125, 0.00653076171875, 0.00885009765625, 0.0...	[ 11249, 47, 29479, 39963, 22321, 22230, 23, 1250, 4867, 502, 6492, 85, 6827, 94739, 3444, 138, 8781, 91736, 568, 1022, 605, 113, 97, 1257, 18151, 25277, 43240, 116, 37348, 51776, 5792, 5045, 1733, 71924, 41, 4382, 7709, 51, 41274, 144570, ...	[ 0.09661865234375, 0.0281829833984375, 0.22802734375, 0.2978515625, 0.250244140625, 0.170166015625, 0.06097412109375, 0.172119140625, 0.259765625, 0.111328125, 0.116943359375, 0.08740234375, 0.1051025390625, 0.154052734375, 0.0322265625, 0.0947265625, 0.07196044921875, 0.162109375, ...	embed
67629429_c0	67629429	prolog	0	Title: Prolog comparing and returning true or false conditionally Problem title: Prolog comparing and returning true or false conditionally Tags: prolog Problem: Prolog comparing and returning true or false conditionally I am new to the prolog and trying to solve some problems. I have two lists for example List1 and Li...	Prolog comparing and returning true or false conditionally Prolog comparing and returning true or false conditionally prolog Prolog List1 List2 Factor1 B-L Factor2 R-B comp_lims Left Right Prolog comparing and returning true or false conditionally I am new to the prolog and trying to solve some problems. I have two lis...	[ -0.013671875, -0.00689697265625, 0.00396728515625, 0.0031280517578125, 0.0072021484375, 0.0322265625, 0.0096435546875, 0.00885009765625, 0.011962890625, 0.0213623046875, 0.0211181640625, 0.02685546875, 0.0205078125, 0.0003986358642578125, 0.00592041015625, -0.0030517578125, 0.0170898...	[ 1250, 4867, 37397, 30646, 29568, 707, 98320, 35431, 502, 32036, 304, 117969, 866, 571, 9969, 3141, 2480, 90911, 25958, 86869, 44402, 6626, 5303, 418, 12765, 2174, 653, 927, 12830, 17721, 37457, 19, 14012, 80836, 21748, 40407, 5701, 959, 387...	[ 0.1644287109375, 0.235107421875, 0.23681640625, 0.1771240234375, 0.2032470703125, 0.065185546875, 0.23193359375, 0.173095703125, 0.127197265625, 0.1309814453125, 0.1175537109375, 0.126708984375, 0.0263671875, 0.029815673828125, 0.134033203125, 0.1878662109375, 0.0299072265625, 0.08...	embed
37156243_c0	37156243	prolog	0	Title: Sorting a list of key-value-pairs according to preference facts? Problem title: Sorting a list of key-value-pairs according to preference facts? Tags: swi-prolog, sorting, prolog, predicate Problem: Sorting a list of key-value-pairs according to preference facts? I have this list (read from a file): [a-3,a-2,a-1...	Sorting a list of key-value-pairs according to preference facts? Sorting a list of key-value-pairs according to preference facts? swi-prolog sorting prolog predicate Sorting end_of_file c-3 a-3 b-3 b-2 a-2 X-I X-J Out b-1 _E1 _E2 Sorted a-1 c-2 c-1 Sorting a list of key-value-pairs according to preference facts? I have...	[ 0.012939453125, 0.003662109375, 0.00152587890625, -0.015625, -0.0194091796875, -0.01806640625, -0.0026092529296875, 0.000743865966796875, -0.000667572021484375, 0.0103759765625, 0.00970458984375, 0.04638671875, 0.006561279296875, -0.011962890625, -0.0003261566162109375, -0.008544921875...	[ 53666, 214, 5303, 22799, 27494, 109637, 59499, 47, 205537, 15824, 7, 91, 2452, 3454, 4867, 12096, 502, 1653, 2063, 3564, 4390, 29822, 501, 8316, 10, 876, 5428, 1193, 1375, 13538, 5759, 304, 39116, 11435, 275, 3611, 67, 30648, 4153, 4527, ...	[ 0.2340087890625, 0.0292205810546875, 0.1656494140625, 0.16552734375, 0.1693115234375, 0.209716796875, 0.1219482421875, 0.046173095703125, 0.283203125, 0.1920166015625, 0.054779052734375, 0.0369873046875, 0.1904296875, 0.1485595703125, 0.2001953125, 0.2025146484375, 0.169189453125, ...	embed
36119519_c0	36119519	prolog	0	Title: Prolog: remove integers from list Problem title: Prolog: remove integers from list Tags: recursion, prolog Problem: Prolog: remove integers from list I am trying to remove the integers from a list using recursion. I made this remove_integers predicate and can't figure out why it does not work. Obviously I am mis...	Prolog: remove integers from list Prolog: remove integers from list recursion prolog list Prolog remove_integers Call _G8188 Fail Redo Exit Prolog: remove integers from list I am trying to remove the integers from a list using recursion. I made this remove_integers predicate and can't figure out why it does not work. O...	[ -0.01116943359375, 0.0162353515625, -0.0037384033203125, 0.01434326171875, -0.01202392578125, 0.0186767578125, -0.005340576171875, 0.0087890625, -0.0157470703125, -0.0177001953125, 0.021240234375, -0.01019287109375, -0.0185546875, -0.0045166015625, 0.0208740234375, -0.0010986328125, ...	[ 1250, 4867, 87388, 892, 26255, 1295, 5303, 195625, 1830, 502, 6191, 26265, 1019, 112511, 190355, 6096, 31, 5443, 217, 31577, 1653, 2063, 26366, 15400, 14602, 959, 4488, 132283, 85590, 144851, 81814, 6635, 33342, 179459, 3584, 1299, 28219, 403...	[ 0.1796875, 0.24072265625, 0.1920166015625, 0.17236328125, 0.1588134765625, 0.12841796875, 0.193115234375, 0.201904296875, 0.09588623046875, 0.1134033203125, 0.187255859375, 0.0849609375, 0.016387939453125, 0.16162109375, 0.1689453125, 0.1192626953125, 0.1343994140625, 0.10827636718...	embed
24012317_c0	24012317	prolog	0	Title: Solving Einstein Riddle with SWI Prolog Problem title: Solving Einstein Riddle with SWI Prolog Tags: zebra-puzzle, prolog Problem: Solving Einstein Riddle with SWI Prolog So I tried solving another Einstein Puzzle by using tutorial that I learned myself from this site. But, I dont seem to get the answer. When I ...	Solving Einstein Riddle with SWI Prolog Solving Einstein Riddle with SWI Prolog zebra-puzzle prolog Solving Einstein Riddle SWI Prolog LikeViolet Couples _H1 _W1 _S1 _E1 _C1 _CL1 _B1 _BR1 _H2 _W2 _S2 _E2 _C2 _CL2 _B2 _BR2 _H3 _W3 _S3 _E3 _C3 _CL3 _B3 _BR3 _H4 _W4 _S4 _E4 _C4 _CL4 _B4 _BR4 _H5 _W5 _S5 _E5 _C5 _CL5 _B5 _...	[ 0.0157470703125, 0.0024566650390625, 0.0032501220703125, 0.022216796875, -0.01287841796875, 0.00653076171875, -0.03564453125, 0.01123046875, 0.013427734375, -0.038330078125, 0.00494384765625, 0.0001468658447265625, 0.000324249267578125, 0.01214599609375, 0.016357421875, 0.0184326171875...	[ 6678, 6496, 119225, 41231, 19298, 678, 159, 38969, 1250, 4867, 116232, 1766, 13894, 502, 18852, 6609, 31, 1974, 1311, 34, 99726, 841, 418, 101, 1456, 294, 647, 37486, 38101, 304, 441, 571, 363, 617, 758, 910, 966, 1019, 37842, 3115, 157...	[ 0.1358642578125, 0.08184814453125, 0.25439453125, 0.1507568359375, 0.1531982421875, 0.0819091796875, 0.09661865234375, 0.240234375, 0.1466064453125, 0.22314453125, 0.2081298828125, 0.0643310546875, 0.105712890625, 0.1259765625, 0.1986083984375, 0.19482421875, 0.157470703125, 0.2056...	embed
33386303_c0	33386303	prolog	0	Title: Issue with output in Prolog Problem title: Issue with output in Prolog Tags: prolog Problem: Issue with output in Prolog I recently wanted to experiment with Prolog to understand how the process of unification works so I wrote the following code to return the nth element from a list. getfromarray([X\|_],1,X). get...	Issue with output in Prolog Issue with output in Prolog prolog Issue Prolog N-1 _G5129 _G5132 _G5136 Issue with output in Prolog I recently wanted to experiment with Prolog to understand how the process of unification works so I wrote the following code to return the nth element from a list. However, upon entering the ...	[ 0.0164794921875, 0.003143310546875, 0.013916015625, -0.007568359375, -0.01129150390625, -0.007598876953125, 0.0006256103515625, 0.0027313232421875, 0.00142669677734375, -0.0150146484375, 0.020263671875, -0.00811767578125, -0.00081634521484375, -0.02490234375, -0.002410888671875, -0.013...	[ 223317, 678, 140992, 1250, 4867, 502, 5759, 11703, 4235, 6460, 131281, 28007, 51, 41274, 54397, 18151, 30646, 653, 927, 12830, 5303, 22, 33558, 107730, 1528, 237, 2046, 161063, 19305, 284, 363, 647, 28219, 79986, 62, 1723, 47314, 40407, 272...	[ 0.1380615234375, 0.0948486328125, 0.254638671875, 0.1551513671875, 0.2489013671875, 0.09490966796875, 0.058319091796875, 0.0282440185546875, 0.1131591796875, 0.051849365234375, 0.030303955078125, 0.06817626953125, 0.1402587890625, 0.1318359375, 0.0963134765625, 0.09521484375, 0.17907...	embed
33636078_c0	33636078	prolog	0	Title: How can I prevent this Prolog code to give multiple duplicate answer? Problem title: How can I prevent this Prolog code to give multiple duplicate answer? Tags: clpfd, cryptarithmetic-puzzle, prolog Problem: How can I prevent this Prolog code to give multiple duplicate answer? I am learning Prolog. I am working ...	How can I prevent this Prolog code to give multiple duplicate answer? How can I prevent this Prolog code to give multiple duplicate answer? clpfd cryptarithmetic-puzzle prolog How Prolog Every Digit Leading Write i.e jobs1 solution1 puzzle1 Erg How can I prevent this Prolog code to give multiple duplicate answer? I am ...	[ -0.0157470703125, 0.01043701171875, 0.004852294921875, -0.00007963180541992188, -0.0177001953125, -0.00982666015625, -0.024658203125, 0.00482177734375, -0.0010833740234375, -0.04541015625, -0.025146484375, 0.01239013671875, 0.0189208984375, 0.031005859375, 0.007080078125, 0.01794433593...	[ 11249, 831, 56282, 903, 1250, 4867, 18151, 47, 8337, 48716, 171763, 67, 35166, 39557, 71, 136791, 8962, 1766, 13894, 133, 502, 87769, 51174, 18, 165507, 214, 18781, 74464, 418, 29806, 104192, 1004, 177, 52080, 20697, 95486, 21771, 181653, 2...	[ 0.058929443359375, 0.045806884765625, 0.2191162109375, 0.059783935546875, 0.1844482421875, 0.2235107421875, 0.17822265625, 0.0206146240234375, 0.060638427734375, 0.2059326171875, 0.2274169921875, 0.121826171875, 0.1846923828125, 0.047637939453125, 0.0750732421875, 0.0908203125, 0.040...	embed
79404579_c1	79404579	prolog	1	1], % Assign to slot 1. % Slot 2 select_two_students(S2_1, S2_2, _Remaining2), Slot2 = [S2_1-S2_2, S2_2-S2_1], % Assign to slot 2. % Slot 3 select_two_students(S3_1, S3_2, _Remaining3), Slot3 = [S3_1-S3_2, S3_2-S3_1], % Assign to slot 3. all_different([S1_1, S1_2, S2_1, S2_2, S3_1, S3_2]), % All students must be differ...	1], % Assign to slot 1. % Slot 2 select_two_students(S2_1, S2_2, _Remaining2), Slot2 = [S2_1-S2_2, S2_2-S2_1], % Assign to slot 2. % Slot 3 select_two_students(S3_1, S3_2, _Remaining3), Slot3 = [S3_1-S3_2, S3_2-S3_1], % Assign to slot 3. all_different([S1_1, S1_2, S2_1, S2_2, S3_1, S3_2]), % All students must be differ...	[ -0.01141357421875, 0.0162353515625, 0.00982666015625, 0.0203857421875, -0.0146484375, -0.00958251953125, -0.0244140625, -0.0230712890625, 0.0107421875, -0.00634765625, -0.00958251953125, 0.0206298828125, 0.0191650390625, 0.010009765625, -0.0089111328125, -0.0018310546875, 0.004821777...	[ 106, 1745, 1301, 31304, 47, 24897, 615, 69623, 116, 36849, 55547, 96610, 7, 294, 304, 115187, 159, 4332, 192, 14653, 10461, 18504, 787, 138, 363, 21320, 1031, 756, 238778, 418, 3164, 25921, 8110, 12921, 158, 2816, 4288, 12631, 617, 109339...	[ 0.081298828125, 0.1168212890625, 0.064697265625, 0.2183837890625, 0.053131103515625, 0.271484375, 0.048675537109375, 0.259765625, 0.1434326171875, 0.155029296875, 0.1392822265625, 0.2242431640625, 0.0731201171875, 0.0546875, 0.120361328125, 0.07781982421875, 0.0701904296875, 0.0073...	embed
65815657_c0	65815657	prolog	0	Title: I wrote a prolog code for my family tree. What's the problem with this code? Problem title: I wrote a prolog code for my family tree. What's the problem with this code? Tags: prolog Problem: I wrote a prolog code for my family tree. What's the problem with this code? /facts/ female(Sufia). female(Bil...	I wrote a prolog code for my family tree. What's the problem with this code? I wrote a prolog code for my family tree. What's the problem with this code? prolog What Sufia Bilkis Nasima Rabeya NWife Eva Rekha Shammi Shanta TWife NSWife Jui SHWife TSWife Anowar Shahidul Khazal Shafik Nahid Jahorul Naim Tanim R...	[ 0.033447265625, 0.000560760498046875, 0.000240325927734375, 0.00616455078125, -0.01153564453125, 0.01007080078125, -0.01495361328125, 0.005584716796875, -0.0164794921875, -0.03466796875, -0.00640869140625, -0.031982421875, -0.004669189453125, 0.0166015625, 0.0206298828125, 0.0053405761...	[ 87, 54397, 10, 502, 4867, 18151, 100, 759, 14449, 53201, 4865, 3768, 2967, 678, 903, 7, 70, 142830, 399, 10746, 9637, 84067, 192, 62171, 21082, 186620, 33632, 28120, 853, 11395, 68346, 266, 41115, 102, 541, 89023, 3314, 14, 1456, 11576, ...	[ 0.048309326171875, 0.165283203125, 0.0689697265625, 0.20361328125, 0.272705078125, 0.25537109375, 0.07586669921875, 0.06915283203125, 0.1064453125, 0.2491455078125, 0.0941162109375, 0.10687255859375, 0.2156982421875, 0.0975341796875, 0.0980224609375, 0.0059814453125, 0.01217651367187...	embed
47587290_c0	47587290	prolog	0	Title: How do I prevent this prolog code, that replaces elements in a list, from giving an additional output? Problem title: How do I prevent this prolog code, that replaces elements in a list, from giving an additional output? Tags: prolog, loops Problem: How do I prevent this prolog code, that replaces elements in a ...	How do I prevent this prolog code, that replaces elements in a list, from giving an additional output? How do I prevent this prolog code, that replaces elements in a list, from giving an additional output? prolog loops giving How I-1 Line Index NumElm Elm NLine BLine Index1 NumElm1 NumElm-1 How do I prevent this prolog...	[ -0.00970458984375, 0.00823974609375, 0.0074462890625, -0.00897216796875, -0.002105712890625, 0.00830078125, 0.000820159912109375, -0.0022125244140625, 0.0230712890625, 0.030029296875, 0.012451171875, 0.00201416015625, 0.005126953125, -0.026123046875, 0.010498046875, 0.018798828125, 0...	[ 11249, 54, 87, 56282, 903, 502, 4867, 18151, 91995, 7, 80854, 5303, 1295, 68772, 78301, 140992, 40956, 5759, 16777, 31471, 52782, 7623, 39, 540, 541, 93232, 418, 31089, 360, 7077, 60075, 13, 13538, 5120, 5868, 3293, 51776, 142424, 4331, 3...	[ 0.0791015625, 0.0125732421875, 0.06591796875, 0.2095947265625, 0.088134765625, 0.176025390625, 0.244140625, 0.1973876953125, 0.2220458984375, 0.020904541015625, 0.181884765625, 0.20361328125, 0.0673828125, 0.106201171875, 0.1229248046875, 0.1796875, 0.1865234375, 0.123291015625, ...	embed
54893794_c1	54893794	prolog	1	be the logic itself, but I think that I am having trouble grasping how arithmetic is used in prolog. Is there anything with the logic or the arithmetic that I am obviously not grasping? Edit: This is the code relevant to the issue. I had renamed the variables above for clarity and their original names were part of the...	be the logic itself, but I think that I am having trouble grasping how arithmetic is used in prolog. Is there anything with the logic or the arithmetic that I am obviously not grasping? Edit: This is the code relevant to the issue. I had renamed the variables above for clarity and their original names were part of the...	[ -0.010009765625, -0.0004825592041015625, -0.0008544921875, 0.00494384765625, -0.014404296875, 0.0045166015625, -0.028564453125, 0.003173828125, 0.004730224609375, -0.00138092041015625, -0.006683349609375, 0.0079345703125, 0.00897216796875, -0.0087890625, 0.00080108642578125, 0.00610351...	[ 186, 62775, 68034, 5351, 19441, 63134, 27689, 10366, 3642, 187, 8962, 282, 9523, 83, 11814, 23, 502, 4867, 678, 171259, 959, 18151, 29191, 31089, 120514, 4806, 77336, 7, 36917, 17306, 7311, 123055, 29806, 1542, 1745, 97868, 5303, 79843, 129...	[ 0.132080078125, 0.22705078125, 0.1324462890625, 0.059356689453125, 0.0217742919921875, 0.116455078125, 0.1307373046875, 0.135986328125, 0.05938720703125, 0.0823974609375, 0.1842041015625, 0.1705322265625, 0.1611328125, 0.04962158203125, 0.170166015625, 0.05816650390625, 0.20349121093...	embed
10758749_c1	10758749	prolog	1	display the appropriate message as listed above. Am i gonna do it by writting one more predicate processGuess ? % This top-level predicate runs the game. It prints a % welcome message, picks a phrase, and calls getGuess. % Ans = Answer % AnsList = AnswerList hangman(CountFailed):- getPhrase(Ans), !, write('Welcome to ...	display the appropriate message as listed above. Am i gonna do it by writting one more predicate processGuess ? % This top-level predicate runs the game. It prints a % welcome message, picks a phrase, and calls getGuess. % Ans = Answer % AnsList = AnswerList hangman(CountFailed):- getPhrase(Ans), !, write('Welcome to ...	[ 0.0087890625, -0.004241943359375, 0.00616455078125, -0.0054931640625, 0.01513671875, 0.0113525390625, 0.01953125, -0.00836181640625, -0.00185394287109375, -0.0037689208984375, -0.0086669921875, -0.00909423828125, 0.0035858154296875, 0.0081787109375, -0.0003147125244140625, 0.03125, 0...	[ 44116, 95307, 26008, 145870, 36917, 132294, 54, 148, 2783, 1286, 1653, 2063, 67, 9433, 22769, 90, 7, 1745, 2663, 67919, 127877, 70, 6712, 28412, 81907, 39580, 113860, 11782, 2046, 893, 130373, 154663, 10756, 669, 108210, 17647, 14, 6259, 45...	[ 0.2362060546875, 0.2083740234375, 0.21484375, 0.0278472900390625, 0.034637451171875, 0.032135009765625, 0.0162506103515625, 0.013824462890625, 0.092529296875, 0.04437255859375, 0.1552734375, 0.2113037109375, 0.0966796875, 0.18310546875, 0.2237548828125, 0.2177734375, 0.17919921875, ...	embed
37083598_c1	37083598	prolog	1	_ = console::readChar(), console::clearOutput, console::close. do_animal():- find_animal, have_found(X),!,console::nl, console::write(" Your animal may be a(n) ",X,"."), console::nl, _ = console::readChar(), clear_facts. do_animal() :- console::nl,console::write(" Sorry , unable to determine the animal."), console::nl...	_ = console::readChar(), console::clearOutput, console::close. do_animal():- find_animal, have_found(X),!,console::nl, console::write(" Your animal may be a(n) ",X,"."), console::nl, _ = console::readChar(), clear_facts. do_animal() :- console::nl,console::write(" Sorry , unable to determine the animal."), console::nl...	[ -0.00151824951171875, 0.019287109375, 0.00982666015625, 0.022216796875, -0.00046539306640625, 0.0098876953125, 0.019775390625, 0.01055908203125, 0.004791259765625, -0.01806640625, 0.0010833740234375, 0.005859375, -0.005157470703125, -0.0064697265625, 0.0269775390625, 0.002899169921875,...	[ 101, 2203, 130250, 12, 39116, 84068, 119488, 79858, 7077, 155648, 54, 161834, 7413, 765, 151645, 1542, 38, 40777, 13169, 434, 18781, 14804, 26249, 1543, 186, 10, 19, 34735, 114700, 90502, 51, 2886, 47, 83324, 70, 3249, 56851, 1723, 40041, ...	[ 0.1448974609375, 0.08721923828125, 0.2493896484375, 0.0277252197265625, 0.18212890625, 0.197998046875, 0.1722412109375, 0.087646484375, 0.059814453125, 0.1201171875, 0.103515625, 0.281005859375, 0.1771240234375, 0.1790771484375, 0.1708984375, 0.109130859375, 0.02288818359375, 0.147...	embed
64889439_c0	64889439	prolog	0	Title: Decoding raw bytes received by udp_receive with as( codes ) Problem title: Decoding raw bytes received by udp_receive with as( codes ) Tags: udp, prolog, ieee-754 Problem: Decoding raw bytes received by udp_receive with as( codes ) I'm trying to decode myself a list of raw bytes received by udp_received . Two qu...	Decoding raw bytes received by udp_receive with as( codes ) Decoding raw bytes received by udp_receive with as( codes ) udp prolog ieee-754 Decoding udp_receive udp_received Remaining Long Double Sign Fraction Exponent ExponentBias Exponent-ExponentBias IEEE RawBytes Remaining0 Remaining1 ieee-754 Decoding raw bytes re...	[ 0.01068115234375, 0.004913330078125, 0.00897216796875, 0.004608154296875, 0.00616455078125, 0.009033203125, -0.02734375, 0.005645751953125, 0.023193359375, 0.04296875, -0.00104522705078125, -0.03466796875, -0.0006866455078125, -0.0042724609375, 0.004547119140625, -0.00074005126953125, ...	[ 262, 587, 6238, 49649, 390, 1636, 75204, 1872, 254, 74105, 5844, 678, 237, 18151, 502, 4867, 7039, 188609, 192, 14407, 107172, 48838, 7868, 54137, 16882, 129969, 109997, 75358, 14653, 2389, 31577, 8, 40899, 35978, 5303, 4126, 32964, 17582, ...	[ 0.1473388671875, 0.17724609375, 0.0294342041015625, 0.186767578125, 0.1129150390625, 0.0838623046875, 0.129638671875, 0.1392822265625, 0.145751953125, 0.146728515625, 0.1495361328125, 0.05010986328125, 0.12451171875, 0.192626953125, 0.0777587890625, 0.149658203125, 0.08038330078125, ...	embed
27682160_c0	27682160	prolog	0	Title: Test that term is a list of distinct variables Problem title: Test that term is a list of distinct variables Tags: iso-prolog, prolog Problem: Test that term is a list of distinct variables What is the most compact and canonical way in ISO Prolog to test for a list of distinct variables? Let's call this meta-log...	Test that term is a list of distinct variables Test that term is a list of distinct variables iso-prolog prolog Test is_varset Test that term is a list of distinct variables What is the most compact and canonical way in ISO Prolog to test for a list of distinct variables? Let's call this meta-logical predicate is_varse...	[ 0.0224609375, -0.01611328125, -0.002960205078125, -0.015625, -0.0106201171875, -0.016845703125, -0.011962890625, 0.00872802734375, 0.01031494140625, -0.000732421875, 0.0172119140625, 0.0126953125, 0.0089111328125, 0.01043701171875, -0.01263427734375, 0.037109375, 0.017822265625, 0....	[ 8647, 450, 13579, 83, 5303, 111, 117781, 77336, 13882, 3454, 4867, 502, 1961, 3509, 10, 2684, 94928, 136, 74413, 3917, 17408, 1250, 47, 3034, 100, 11782, 23550, 137043, 1653, 2063, 67, 11583, 5608, 214493, 2174, 10750, 756, 12921, 11343, ...	[ 0.2352294921875, 0.143798828125, 0.23486328125, 0.1474609375, 0.203125, 0.026031494140625, 0.2049560546875, 0.255126953125, 0.1097412109375, 0.1002197265625, 0.2030029296875, 0.1065673828125, 0.188232421875, 0.2337646484375, 0.058074951171875, 0.0826416015625, 0.192626953125, 0.007...	embed

75271024_c0

75271024

prolog

0

Title: How does prolog resolution use proof by contradiction? Problem title: How does prolog resolution use proof by contradiction? Tags: proof, prolog, logic-programming Problem: How does prolog resolution use proof by contradiction? I'm learning prolog, and I'm confused by the claim that prolog uses proof by contradi...

How does prolog resolution use proof by contradiction? How does prolog resolution use proof by contradiction? proof prolog logic-programming How tottenham_court_road leicester_square Therefore How does prolog resolution use proof by contradiction? I'm learning prolog, and I'm confused by the claim that prolog uses proo...

[ 0.0167236328125, 0.0157470703125, 0.00628662109375, 0.0159912109375, -0.002777099609375, -0.00836181640625, 0.007293701171875, 0.00787353515625, -0.0004329681396484375, -0.0223388671875, -0.021240234375, -0.0211181640625, -0.012939453125, 0.0115966796875, 0.002044677734375, 0.002288818...

[ 11249, 502, 4867, 158839, 4527, 6, 98869, 390, 2304, 428, 10763, 14602, 62775, 28966, 1186, 510, 3915, 118383, 52562, 95, 2980, 1515, 108047, 228072, 55681, 63043, 25632, 117233, 35509, 91736, 15824, 170920, 110680, 12301, 98441, 4420, 19364, ...

[ 0.079345703125, 0.1502685546875, 0.23291015625, 0.20166015625, 0.122802734375, 0.047637939453125, 0.2010498046875, 0.1356201171875, 0.1607666015625, 0.1448974609375, 0.168212890625, 0.03790283203125, 0.0892333984375, 0.09326171875, 0.028594970703125, 0.0916748046875, 0.141357421875, ...

embed

43214278_c1

43214278

prolog

1

#### */ ( semicolon(A,OUT) ) :- ( OUT = ( goal_true_false(A,(true),(throw({ problem: false , culprit: (A) , reporter: ';' }))) ) ) . ( goal_expansion(IIN,OUT) ) :- ( IIN = ( A ; B ; C ) , semicolon(A,A_SEMICOLON) , semicolon(B,B_SEMICOLON) , OUT = ( A_SEMICOLON , B_SEMICOLON ; C ) ) . ( goal_expansion(IIN,OUT) ) :- ( ...

[ 0.004852294921875, 0.04296875, 0.012939453125, 0.03515625, -0.0162353515625, 0.018798828125, -0.0067138671875, 0.01373291015625, -0.001312255859375, -0.0174560546875, 0.0283203125, 0.00150299072265625, -0.013671875, 0.006500244140625, 0.00811767578125, -0.01239013671875, 0.013671875,...

[ 187284, 661, 64, 15, 40, 46029, 4759, 284, 4, 52001, 15772, 2203, 69236, 9774, 8710, 184, 927, 15555, 2967, 98320, 57940, 5293, 18, 105757, 74, 32149, 83613, 66, 6889, 568, 8852, 87, 313, 454, 150576, 33028, 106699, 571, 62, 335, 32354,...

[ 0.1234130859375, 0.013427734375, 0.038787841796875, 0.0161895751953125, 0.126953125, 0.1851806640625, 0.2027587890625, 0.15185546875, 0.053955078125, 0.26904296875, 0.06756591796875, 0.05712890625, 0.2423095703125, 0.145751953125, 0.1204833984375, 0.060333251953125, 0.04150390625, ...

embed

7869709_c0

7869709

prolog

0

Title: Geometry analogy, why don't I get more answer? Problem title: Geometry analogy, why don't I get more answer? Tags: prolog Problem: Geometry analogy, why don't I get more answer? Here is my prolog code : figure(1, middle(circle, circle)). figure(2, top_left(circle, circle)). figure(3, bottom_right(circl...

Geometry analogy, why don't I get more answer? Geometry analogy, why don't I get more answer? prolog Geometry top_left bottom_right top_right bottom_left Relation same_in_out Geometry analogy, why don't I get more answer? Here is my prolog code : Which represent this set And here is a simple execution : And m...

[ -0.00482177734375, -0.003936767578125, 0.01055908203125, -0.0003070831298828125, -0.004119873046875, -0.00002086162567138672, -0.01007080078125, 0.00982666015625, 0.01251220703125, 0.000614166259765625, 0.016357421875, 0.0142822265625, 0.00823974609375, -0.01123046875, 0.0009536743164062...

[ 2206, 87739, 60223, 53, 15400, 2301, 3768, 18, 2046, 1286, 35166, 87, 502, 4867, 2663, 103136, 54969, 116822, 5701, 73, 6056, 18151, 33636, 903, 5423, 8781, 71924, 9655, 765, 1193, 2203, 361, 990, 198274, 33444, 54753 ]

[ 0.0673828125, 0.1334228515625, 0.2010498046875, 0.0877685546875, 0.12060546875, 0.06109619140625, 0.0235137939453125, 0.0877685546875, 0.09234619140625, 0.1278076171875, 0.18603515625, 0.0246124267578125, 0.1064453125, 0.148681640625, 0.05682373046875, 0.09405517578125, 0.01521301269...

embed

73339538_c0

73339538

prolog

0

Title: Chain of dominos Problem title: Chain of dominos Tags: prolog Problem: Chain of dominos I am learning prolog and solving some exercises on exercism.io. And I am stuck. I don't want to search for a solution on the internet, thus I will only a little help on the part of the exercise, since I don't understand where...

Chain of dominos Chain of dominos prolog Chain is_chain is_loop is_chain_no_loop _1370 _1372 _1384 _1396 _1408 _1420 _552 _502 Pile Chain of dominos I am learning prolog and solving some exercises on exercism.io. And I am stuck. I don't want to search for a solution on the internet, thus I will only a little help on th...

[ -0.0009613037109375, -0.000010192394256591797, 0.00897216796875, 0.01434326171875, -0.0115966796875, 0.0155029296875, -0.005096435546875, 0.0013885498046875, 0.01953125, -0.0263671875, 0.004364013671875, 0.000858306884765625, 0.00543212890625, -0.002288818359375, 0.0028228759765625, -0...

[ 4841, 73, 111, 96889, 7, 502, 4867, 83, 115097, 28354, 157, 2681, 5757, 12825, 13903, 11648, 2592, 8318, 1549, 150230, 2525, 304, 13289, 13, 52080, 81979, 56785, 39, 846, 179933, 29806, 28219, 759, 121742, 8, 85779, 28282, 8437, 121293, 8...

[ 0.2120361328125, 0.125, 0.1612548828125, 0.24267578125, 0.109130859375, 0.151123046875, 0.21533203125, 0.125732421875, 0.2509765625, 0.262451171875, 0.0888671875, 0.06256103515625, 0.180908203125, 0.1522216796875, 0.143310546875, 0.162353515625, 0.1214599609375, 0.177978515625, 0...

embed

13446507_c0

13446507

prolog

0

Title: Stuck with Prolog Program Problem title: Stuck with Prolog Program Tags: prolog Problem: Stuck with Prolog Program I am fluent with Java and C#, so coding in Prolog has been quite a struggle for me so far as it seems to be a completely different way of thinking. The problem I need to solve is simple, and I could...

Stuck with Prolog Program Stuck with Prolog Program prolog Stuck Prolog Program best_candidates BestMatches match_single_entry Stuck with Prolog Program I am fluent with Java and C#, so coding in Prolog has been quite a struggle for me so far as it seems to be a completely different way of thinking. The problem I need ...

[ 0.0135498046875, -0.004730224609375, 0.0267333984375, -0.005889892578125, -0.00958251953125, 0.003143310546875, -0.01708984375, -0.000701904296875, 0.01953125, -0.0096435546875, 0.01190185546875, 0.00103759765625, -0.007659912109375, -0.00732421875, 0.00113677978515625, -0.022216796875...

[ 26085, 2594, 678, 1250, 4867, 7663, 502, 2965, 79647, 1683, 1636, 11345, 79520, 17007, 14858, 6953, 133, 33, 15123, 155283, 41925, 136, 4904, 552, 6238, 2809, 32233, 151994, 2060, 37202, 64557, 12921, 3917, 47644, 2967, 3871, 86869, 8781, 5...

[ 0.15771484375, 0.1290283203125, 0.1243896484375, 0.1890869140625, 0.2464599609375, 0.1590576171875, 0.150146484375, 0.2003173828125, 0.1478271484375, 0.15869140625, 0.143798828125, 0.1707763671875, 0.210205078125, 0.183349609375, 0.18212890625, 0.1407470703125, 0.063232421875, 0.12...

embed

27607292_c0

27607292

prolog

0

Title: Sum of salaries in family structure in Prolog Problem title: Sum of salaries in family structure in Prolog Tags: sum, structure, list, addition, prolog Problem: Sum of salaries in family structure in Prolog I want to get a sum of salaries of children of family. I work in Turbo Prolog. As I understand, howManyChi...

Sum of salaries in family structure in Prolog Sum of salaries in family structure in Prolog sum structure list addition prolog Sum Prolog Ivan Ivanov Anna Oleg Antin Inna Salary Children Surname Average Year SalaryMom ChildrenSalary Sum of salaries in family structure in Prolog I want to get a sum of salaries of childr...

[ 0.0169677734375, -0.01080322265625, -0.0146484375, -0.003082275390625, -0.0201416015625, 0.0089111328125, -0.01153564453125, 0.01708984375, 0.035400390625, -0.028564453125, 0.0019378662109375, -0.006072998046875, -0.0203857421875, -0.0029754638671875, 0.0205078125, -0.0172119140625, ...

[ 36335, 111, 4559, 10484, 23, 14449, 45646, 1250, 4867, 10554, 5303, 66044, 502, 23698, 148803, 7714, 2828, 8332, 19, 360, 76, 13294, 1294, 91345, 8018, 11627, 40168, 29838, 42552, 594, 306, 52779, 6635, 3444, 2046, 10, 20020, 4488, 102228, ...

[ 0.2093505859375, 0.0845947265625, 0.2344970703125, 0.1849365234375, 0.0556640625, 0.16064453125, 0.1981201171875, 0.17333984375, 0.2626953125, 0.20703125, 0.08477783203125, 0.10552978515625, 0.0850830078125, 0.13623046875, 0.2012939453125, 0.1319580078125, 0.082275390625, 0.0985107...

embed

48637276_c0

48637276

prolog

0

Title: How to use String (atom) terms in Gnu Prolog for java Problem title: How to use String (atom) terms in Gnu Prolog for java Tags: swi-prolog, prolog, jpl, java, gnu-prolog Problem: How to use String (atom) terms in Gnu Prolog for java I'm a newbie in prolog and wanted to write wampus AI with prolog + java , tryin...

How to use String (atom) terms in Gnu Prolog for java How to use String (atom) terms in Gnu Prolog for java swi-prolog prolog jpl java gnu-prolog How Gnu Prolog VariableTerm IntegerTerm FloatTerm How to use String (atom) terms in Gnu Prolog for java I'm a newbie in prolog and wanted to write wampus AI with prolog + jav...

[ 0.0205078125, 0.0185546875, -0.0106201171875, 0.0277099609375, -0.005462646484375, 0.0068359375, 0.0250244140625, 0.0091552734375, -0.0174560546875, -0.029541015625, 0.032958984375, -0.0101318359375, -0.0216064453125, -0.0025787353515625, -0.0021820068359375, 0.00640869140625, 0.0235...

[ 11249, 4527, 23351, 214, 11, 5928, 69407, 23, 527, 539, 1250, 4867, 100, 79, 330, 47, 2452, 3454, 502, 2424, 104155, 84572, 2886, 35484, 44401, 38699, 9014, 33022, 259, 44901, 7, 38730, 997, 62775, 195490, 179933, 62822, 17366, 51359, 364...

[ 0.06097412109375, 0.155029296875, 0.23828125, 0.1490478515625, 0.03277587890625, 0.1898193359375, 0.2314453125, 0.0455322265625, 0.0810546875, 0.22021484375, 0.1514892578125, 0.181396484375, 0.057373046875, 0.1185302734375, 0.170166015625, 0.009246826171875, 0.1243896484375, 0.0899...

embed

53449457_c0

53449457

prolog

0

Title: Breadth First Search code won't output BFS result Problem title: Breadth First Search code won't output BFS result Tags: prolog, breadth-first-search Problem: Breadth First Search code won't output BFS result This is the code I found, and it was fixed in another post I made. s(a, b). s(a, c). s(b, g). ...

Breadth First Search code won't output BFS result Breadth First Search code won't output BFS result prolog breadth-first-search Breadth First Search BFS Start Solution Node Path Paths NewPaths Pathsl Breadth First Search code won't output BFS result This is the code I found, and it was fixed in another post I...

[ 0.025634765625, 0.0255126953125, -0.00110626220703125, 0.0244140625, -0.0228271484375, 0.004608154296875, -0.01361083984375, -0.01904296875, -0.0106201171875, -0.0091552734375, 0.00628662109375, -0.010498046875, -0.00732421875, 0.0093994140625, 0.0013580322265625, -0.00830078125, -0....

[ 6499, 712, 927, 23972, 33086, 18151, 23742, 3768, 18, 140992, 335, 36381, 16750, 502, 4867, 179967, 13448, 271, 86250, 13794, 187895, 438, 108421, 2356, 683, 10519, 24861, 188347, 83, 15824, 79442, 53201, 33636, 10, 76199, 876, 136, 501, 57...

[ 0.17236328125, 0.1292724609375, 0.1556396484375, 0.1898193359375, 0.2083740234375, 0.1756591796875, 0.06182861328125, 0.053253173828125, 0.0721435546875, 0.194091796875, 0.085693359375, 0.2332763671875, 0.161376953125, 0.1185302734375, 0.1385498046875, 0.1973876953125, 0.114501953125...

embed

73096861_c0

73096861

prolog

0

Title: Why does Prolog duplicate all the answers when the number of print directives is more than one? Problem title: Why does Prolog duplicate all the answers when the number of print directives is more than one? Tags: duplicates, non-interactive, prolog, swi-prolog Problem: Why does Prolog duplicate all the answers w...

Why does Prolog duplicate all the answers when the number of print directives is more than one? Why does Prolog duplicate all the answers when the number of print directives is more than one? duplicates non-interactive prolog swi-prolog Why Prolog exercise-family-tree.pl Why does Prolog duplicate all the answers when t...

[ 0.01446533203125, 0.0186767578125, 0.0023651123046875, 0.01348876953125, -0.0245361328125, 0.0244140625, -0.004058837890625, -0.0027008056640625, -0.003875732421875, -0.05712890625, -0.0191650390625, -0.01324462890625, 0.0103759765625, 0.0174560546875, 0.0029144287109375, 0.01495361328...

[ 44084, 1250, 4867, 171763, 67, 756, 35166, 14012, 28412, 8951, 60877, 1286, 3501, 1632, 351, 71232, 502, 2452, 3454, 81979, 212122, 62600, 2424, 5201, 1660, 71924, 864, 177, 693, 52721, 50339, 41, 6626, 20028, 12921, 77336, 10750, 3674, 181...

[ 0.08251953125, 0.162841796875, 0.2376708984375, 0.2327880859375, 0.085693359375, 0.05767822265625, 0.15771484375, 0.06884765625, 0.1712646484375, 0.12939453125, 0.114990234375, 0.109130859375, 0.0809326171875, 0.088134765625, 0.004547119140625, 0.04510498046875, 0.09405517578125, 0...

embed

48756649_c0

48756649

prolog

0

Title: PROLOG Finite automata compile error Problem title: PROLOG Finite automata compile error Tags: finite-automata, state-machine, prolog Problem: PROLOG Finite automata compile error I need help with my Prolog homework. So I have to represent a finite automata with 4 states. It is a simple laughing automata. But i ...

PROLOG Finite automata compile error PROLOG Finite automata compile error finite-automata state-machine prolog PROLOG Finite Warning p1_ex2.pl:20 Singleton Current p1_ex2.pl:32 ListNodes ERROR Rest Node NextNode Node-1 Facts PROLOG Finite automata compile error I need help with my Prolog homework. So I have to represen...

[ 0.007232666015625, -0.006256103515625, 0.00008249282836914062, 0.046630859375, -0.0172119140625, 0.0147705078125, -0.0120849609375, 0.01483154296875, 0.00390625, -0.031494140625, -0.00830078125, -0.0189208984375, -0.005096435546875, 0.01025390625, 0.007568359375, -0.01025390625, 0.02...

[ 10514, 47510, 13316, 1486, 11408, 11, 9969, 1340, 18499, 94418, 13, 52344, 11341, 103149, 502, 4867, 5550, 915, 3355, 5442, 2424, 16619, 43609, 1507, 114063, 29902, 32036, 5021, 988, 151206, 49756, 438, 112, 4997, 5759, 132640, 3871, 4358, ...

[ 0.1827392578125, 0.2376708984375, 0.170166015625, 0.1634521484375, 0.236572265625, 0.132568359375, 0.1873779296875, 0.1573486328125, 0.1951904296875, 0.1927490234375, 0.080322265625, 0.2032470703125, 0.1146240234375, 0.10357666015625, 0.1475830078125, 0.221923828125, 0.134033203125, ...

embed

9064492_c0

9064492

prolog

0

Title: Limits to expressibility in Cyc, or similar knowledge-base projects? Problem title: Limits to expressibility in Cyc, or similar knowledge-base projects? Tags: artificial-intelligence, knowledge-management, prolog, wordnet Problem: Limits to expressibility in Cyc, or similar knowledge-base projects? What are the ...

Limits to expressibility in Cyc, or similar knowledge-base projects? Limits to expressibility in Cyc, or similar knowledge-base projects? artificial-intelligence knowledge-management prolog wordnet Limits Cyc CAT DomesticCat Meat Limits to expressibility in Cyc, or similar knowledge-base projects? What are the limits t...

[ 0.0322265625, -0.000865936279296875, 0.0115966796875, 0.019775390625, 0.00946044921875, -0.00469970703125, 0.0145263671875, -0.01104736328125, 0.00933837890625, -0.0185546875, 0.0087890625, 0.0019683837890625, -0.021728515625, -0.00653076171875, 0.00146484375, 0.0203857421875, -0.006...

[ 125177, 7, 47, 36510, 14, 83259, 23, 27939, 238, 21373, 51359, 37382, 77635, 66733, 130687, 87140, 502, 4867, 2565, 1179, 100632, 96270, 28692, 76775, 1215, 257, 17475, 23755, 831, 18, 186, 13452, 86531, 27781, 5351, 26950, 85727, 7515, 621...

[ 0.2205810546875, 0.0985107421875, 0.05859375, 0.2264404296875, 0.113525390625, 0.1566162109375, 0.054901123046875, 0.1778564453125, 0.149658203125, 0.02252197265625, 0.1796875, 0.1494140625, 0.145263671875, 0.070068359375, 0.0933837890625, 0.08837890625, 0.07330322265625, 0.1616210...

embed

10328040_c0

10328040

prolog

0

Title: How to go about a type checker in prolog? Problem title: How to go about a type checker in prolog? Tags: typechecking, prolog Problem: How to go about a type checker in prolog? So I am new to prolog and I am suppose to implement a type checker. How exactly should I go about it? This would be an example: String s...

How to go about a type checker in prolog? How to go about a type checker in prolog? typechecking prolog How s.length How to go about a type checker in prolog? So I am new to prolog and I am suppose to implement a type checker. How exactly should I go about it? This would be an example: When I asked the professor how th...

[ 0.0159912109375, 0.02734375, 0.005157470703125, 0.0224609375, -0.01544189453125, -0.017822265625, -0.004791259765625, 0.00909423828125, 0.0007781982421875, -0.05224609375, -0.003936767578125, -0.022705078125, 0.00433349609375, -0.023681640625, 0.005706787109375, -0.01202392578125, 0....

[ 11249, 47, 738, 1672, 10644, 12765, 56, 23, 502, 4867, 78292, 214, 23986, 10, 3525, 139124, 29479, 66161, 5608, 442, 27781, 37170, 16030, 3642, 8966, 1221, 107730, 6713, 1884, 903, 9925, 6782, 51, 41274, 17, 72856, 20903, 41, 1294, 5154, ...

[ 0.093505859375, 0.0111083984375, 0.05853271484375, 0.1439208984375, 0.265625, 0.23095703125, 0.20361328125, 0.076904296875, 0.17236328125, 0.2490234375, 0.235107421875, 0.035980224609375, 0.022247314453125, 0.008697509765625, 0.03985595703125, 0.035003662109375, 0.09814453125, 0.00...

embed

75853298_c0

75853298

prolog

0

Title: Avoiding duplicate results in prolog Problem title: Avoiding duplicate results in prolog Tags: prolog Problem: Avoiding duplicate results in prolog I have the following code: male(prince_charles). male(prince_andrew). male(prince_edward). female(princess_ann). female(queen_elizabeth). child_of(prince_charles, qu...

Avoiding duplicate results in prolog Avoiding duplicate results in prolog prolog Avoiding prince_charles prince_andrew prince_edward princess_ann queen_elizabeth child_of List Avoiding duplicate results in prolog I have the following code: Running findall(X,successor(X), List). gets me this result : List = [prince_char...

[ 0.00469970703125, 0.015869140625, 0.021728515625, 0.00628662109375, 0.01513671875, -0.004486083984375, -0.00872802734375, 0.00390625, 0.00909423828125, -0.05224609375, -0.007080078125, 0.005462646484375, -0.004638671875, -0.006317138671875, 0.00775146484375, 0.033935546875, 0.0093383...

[ 84361, 86675, 171763, 67, 50339, 502, 4867, 54631, 9254, 1577, 129083, 434, 297, 19364, 2448, 26531, 6763, 41, 39998, 86077, 29041, 4390, 32036, 25632, 18151, 28398, 7413, 5584, 1542, 226534, 4970, 62163, 16750, 2203, 5293, 3956, 4, 41206, ...

[ 0.1771240234375, 0.07672119140625, 0.1973876953125, 0.111328125, 0.155029296875, 0.181640625, 0.21533203125, 0.164306640625, 0.1156005859375, 0.1607666015625, 0.0577392578125, 0.0987548828125, 0.0814208984375, 0.2412109375, 0.052947998046875, 0.05047607421875, 0.1370849609375, 0.00...

embed

8684206_c0

8684206

prolog

0

Title: SWI-Prolog How Prolog handles logical comparisons Problem title: SWI-Prolog How Prolog handles logical comparisons Tags: prolog, logical-operators, comparison Problem: SWI-Prolog How Prolog handles logical comparisons I have written the following code in SWI-Prolog: :- dynamic state_a/1 . :- dynamic state_b/1 . ...

SWI-Prolog How Prolog handles logical comparisons SWI-Prolog How Prolog handles logical comparisons prolog logical-operators comparison SWI-Prolog How Prolog state_a state_b state_c LIST HEAD TAIL move_ab Wrong Move.Choose Another SWI-Prolog How Prolog handles logical comparisons I have written the following code in SW...

[ 0.0166015625, 0.00482177734375, 0.006072998046875, 0.0277099609375, -0.0218505859375, 0.01611328125, -0.01483154296875, 0.018798828125, 0.0047607421875, 0.0062255859375, 0.01324462890625, 0.0225830078125, -0.0107421875, -0.0086669921875, 0.0201416015625, -0.01611328125, 0.03002929687...

[ 159, 38969, 10752, 4867, 11249, 1250, 34831, 7, 62775, 289, 225490, 502, 206469, 11341, 11, 275, 238, 195977, 188328, 12998, 16444, 25813, 2055, 35133, 135828, 107522, 8364, 116267, 59121, 18151, 9, 116, 33172, 132, 74, 26458, 454, 23, 5117...

[ 0.03875732421875, 0.2052001953125, 0.1573486328125, 0.262939453125, 0.0233917236328125, 0.180419921875, 0.1239013671875, 0.002655029296875, 0.1722412109375, 0.1243896484375, 0.2479248046875, 0.08740234375, 0.1513671875, 0.090576171875, 0.0293121337890625, 0.042572021484375, 0.0307617...

embed

26289772_c0

26289772

prolog

0

Title: Why must facts be grouped together in Prolog? Problem title: Why must facts be grouped together in Prolog? Tags: iso-prolog, prolog Problem: Why must facts be grouped together in Prolog? Say I am listing facts: letter(a). letter(b). letter(c). ... letter(z). vowel(a). consonant(b). consonant(c). consonant(d). vo...

Why must facts be grouped together in Prolog? Why must facts be grouped together in Prolog? iso-prolog prolog Why Prolog Warning Users prolog-example.pl:31 Clauses prolog-example.pl:32 prolog-example.pl:35 prolog-example.pl:36 prolog-example.pl:51 Why must facts be grouped together in Prolog? Say I am listing facts: If...

[ 0.050537109375, -0.0089111328125, -0.007080078125, 0.0186767578125, -0.01104736328125, 0.01080322265625, -0.00015544891357421875, -0.010986328125, 0.01708984375, 0.004425048828125, -0.01507568359375, 0.0157470703125, -0.0089111328125, -0.011474609375, -0.00150299072265625, -0.006103515...

[ 44084, 8110, 15824, 7, 37769, 71, 25842, 23, 1250, 4867, 13882, 3454, 502, 5550, 592, 53400, 27321, 100700, 29902, 32944, 37374, 5303, 214, 159978, 91736, 229231, 12989, 25632, 1631, 6977, 130250, 2174, 13319, 18499 ]

[ 0.1148681640625, 0.1162109375, 0.1787109375, 0.0947265625, 0.2171630859375, 0.0887451171875, 0.1602783203125, 0.047027587890625, 0.161376953125, 0.245361328125, 0.090576171875, 0.1043701171875, 0.08685302734375, 0.1392822265625, 0.0789794921875, 0.115966796875, 0.048583984375, 0.05...

embed

64420394_c1

64420394

prolog

1

_move(Pos), Val > Alpha, !. % Mazximizer increased lower bound newbounds(Alpha, Beta, Pos, Val, Alpha, Val):- max_to_move(Pos), Val < Beta, !. % Minimizer decreased upper bound newbounds( Alpha, Beta, _,_,Alpha, Beta). % otherwise bounds unchanged. betterof(Pos, Val, Pos1, Val1, Pos, Val) :- % Pos better than Pos1 min_...

[ -0.0159912109375, 0.004730224609375, 0.0390625, 0.01116943359375, 0.0147705078125, 0.0274658203125, 0.0120849609375, -0.010986328125, 0.0262451171875, 0.029296875, -0.003936767578125, 0.0126953125, 0.01263427734375, -0.00592041015625, 0.0147705078125, -0.017578125, -0.011474609375, ...

[ 101, 432, 272, 7192, 7, 4769, 977, 76569, 711, 1745, 29678, 53950, 52825, 124735, 92319, 99091, 3525, 6210, 14612, 48941, 13498, 18389, 188, 4211, 8559, 56, 227204, 1407, 120262, 152028, 11522, 4390, 418, 881, 42272, 106, 2646, 81887, 2811,...

[ 0.0360107421875, 0.1190185546875, 0.1348876953125, 0.146728515625, 0.0989990234375, 0.18603515625, 0.030853271484375, 0.216552734375, 0.0484619140625, 0.039520263671875, 0.1627197265625, 0.1845703125, 0.2218017578125, 0.1533203125, 0.1412353515625, 0.19189453125, 0.05029296875, 0.0...

embed

70462570_c0

70462570

prolog

0

Title: I ran the program as instructed in the book but it didn't work, error : unknown procedure Problem title: I ran the program as instructed in the book but it didn't work, error : unknown procedure Tags: prolog Problem: I ran the program as instructed in the book but it didn't work, error : unknown proced...

I ran the program as instructed in the book but it didn't work, error : unknown procedure I ran the program as instructed in the book but it didn't work, error : unknown procedure prolog Start Goal Path Solution write_path Visited Next I ran the program as instructed in the book but it didn't work, error : un...

[ -0.00008058547973632812, 0.0177001953125, -0.0079345703125, 0.02392578125, -0.02978515625, 0.0303955078125, -0.015625, -0.0242919921875, 0.00127410888671875, -0.041259765625, 0.0028839111328125, 0.01300048828125, -0.0245361328125, 0.00032806396484375, 0.000942230224609375, -0.009765625...

[ 87, 13028, 1528, 237, 20819, 89829, 23, 12877, 1284, 442, 15935, 3768, 18, 4488, 18499, 51, 69723, 19, 50491, 502, 4867, 13794, 2016, 289, 108421, 187895, 33022, 128405, 98684, 4997, 717, 11675, 3871, 116, 75101, 683, 10519, 136, 4034, 41...

[ 0.0179901123046875, 0.1383056640625, 0.20947265625, 0.1138916015625, 0.1156005859375, 0.09954833984375, 0.01824951171875, 0.141845703125, 0.0396728515625, 0.036895751953125, 0.07391357421875, 0.0760498046875, 0.1187744140625, 0.1513671875, 0.18359375, 0.08782958984375, 0.211669921875...

embed

66146716_c1

66146716

prolog

1

toolshed('a jar of mandragore'). toolshed('a fresh toadstool'). helper.pl :- module(helper, [ helper/2 ]). helper(friar_tuck,help) :- format("I will help you rout the Sheriff of Nottingham's men!~n"), setof(X,toolshed(X),Tools), format("I found these tools: ~q~n",[Tools]), format("Have at them!~n"). helper(merlin,help...

[ 0.01416015625, 0.017822265625, -0.0062255859375, 0.02001953125, -0.0191650390625, 0.0157470703125, 0.00799560546875, 0.0091552734375, -0.000640869140625, -0.04736328125, -0.01190185546875, 0.0230712890625, -0.005828857421875, 0.004638671875, 0.029296875, -0.0047607421875, 0.013732910...

[ 72977, 5252, 11, 35125, 111, 158924, 519, 107, 63335, 47, 712, 7, 89110, 4358, 56, 2424, 88996, 73866, 12477, 7151, 147, 458, 2594, 9384, 1221, 22629, 18, 53257, 32920, 438, 19514, 3915, 453, 5423, 4390, 1542, 67175, 186490, 568, 14037, ...

[ 0.30126953125, 0.296142578125, 0.03643798828125, 0.1893310546875, 0.1239013671875, 0.1422119140625, 0.143798828125, 0.1483154296875, 0.152099609375, 0.10198974609375, 0.10235595703125, 0.0126953125, 0.2333984375, 0.2171630859375, 0.170654296875, 0.1746826171875, 0.2037353515625, 0....

embed

26260407_c1

26260407

prolog

1

(_,_,_,B),B). % keelte faktid (andmebaas) possible_language(vene). possible_language(inglise). possible_language(hispaania). possible_language(prantsuse). possible_language(saksa). % tabeli täitmine solve(S):- structure(S), fill_structure(S), fact1(S), fact2(S), fact3(S), fact4(S), fact5(S), fact6(S), fact7(S), fact8(S...

[ -0.003570556640625, 0.00775146484375, 0.0167236328125, 0.0250244140625, -0.0093994140625, 0.0107421875, -0.0296630859375, -0.0025482177734375, 0.003021240234375, -0.00494384765625, -0.0024261474609375, 0.007476806640625, -0.002838134765625, 0.003021240234375, -0.0164794921875, 0.009399...

[ 454, 571, 1745, 153200, 13, 6802, 532, 2940, 282, 402, 162, 7722, 196651, 39118, 214, 12811, 979, 19341, 7925, 15212, 76167, 110008, 53659, 14, 68680, 2962, 86869, 294, 45646, 26292, 137656, 15824, 418, 304, 363, 617, 758, 910, 966, 1019,...

[ 0.0149993896484375, 0.0712890625, 0.1148681640625, 0.279541015625, 0.12060546875, 0.2003173828125, 0.0712890625, 0.105224609375, 0.1573486328125, 0.157470703125, 0.07598876953125, 0.1817626953125, 0.26611328125, 0.2283935546875, 0.0849609375, 0.1214599609375, 0.012115478515625, 0.1...

embed

48227836_c0

48227836

prolog

0

Title: How to output all solutions for Goal from non-interactive script Problem title: How to output all solutions for Goal from non-interactive script Tags: swi-prolog, prolog Problem: How to output all solutions for Goal from non-interactive script I have a Node.JS application that I want to do the following with: 1....

How to output all solutions for Goal from non-interactive script How to output all solutions for Goal from non-interactive script swi-prolog prolog non-interactive How Goal data.pro triangular.pro How to output all solutions for Goal from non-interactive script I have a Node.JS application that I want to do the followi...

[ 0.0091552734375, 0.0277099609375, 0.00335693359375, -0.0014190673828125, -0.029296875, 0.00537109375, 0.011474609375, -0.0220947265625, -0.000713348388671875, -0.025146484375, 0.00872802734375, 0.006744384765625, -0.00982666015625, -0.00433349609375, 0.0028839111328125, 0.0245361328125...

[ 11249, 140992, 756, 51347, 100, 2016, 289, 1295, 351, 10433, 71232, 26499, 2452, 3454, 4867, 502, 2053, 1927, 1463, 35975, 438, 112, 64977, 38415, 5813, 61687, 12301, 70731, 33022, 11435, 28398, 91, 2424, 75101, 16750, 2392, 71924, 21771, 1...

[ 0.07958984375, 0.2181396484375, 0.1519775390625, 0.2376708984375, 0.040496826171875, 0.1981201171875, 0.19482421875, 0.1031494140625, 0.1341552734375, 0.0869140625, 0.1455078125, 0.201171875, 0.1964111328125, 0.1544189453125, 0.205078125, 0.10174560546875, 0.085205078125, 0.0440979...

embed

70378645_c0

70378645

prolog

0

Title: Prolog: recursion is not working properly Problem title: Prolog: recursion is not working properly Tags: recursion, prolog Problem: Prolog: recursion is not working properly I want to write change_state(+L1, +L2, -L3). L1 contains states e.g: [milled, burned] L2 contains predicates e.g: [del(milled), add(shifted...

Prolog: recursion is not working properly Prolog: recursion is not working properly recursion prolog Prolog change_state State NewState remove_from_list add_to_list Prolog: recursion is not working properly I want to write change_state(+L1, +L2, -L3). L1 contains states e.g: [milled, burned] L2 contains predicates e.g:...

[ -0.02001953125, -0.0019073486328125, -0.000392913818359375, 0.009765625, -0.004058837890625, 0.022705078125, -0.0284423828125, -0.000743865966796875, -0.00494384765625, -0.01214599609375, 0.0177001953125, 0.021728515625, -0.00738525390625, 0.0169677734375, 0.01080322265625, -0.01293945...

[ 1250, 4867, 195625, 1830, 83, 959, 20697, 155965, 502, 15549, 61340, 22836, 2356, 135206, 87388, 161063, 6562, 15190, 188, 3444, 33022, 1328, 866, 418, 997, 304, 21320, 339, 70541, 117249, 74877, 96865, 1653, 2063, 1743, 3767, 363, 30646, 5...

[ 0.168701171875, 0.2415771484375, 0.259765625, 0.175048828125, 0.0287017822265625, 0.08294677734375, 0.146240234375, 0.1617431640625, 0.1298828125, 0.191162109375, 0.171142578125, 0.134033203125, 0.06158447265625, 0.1226806640625, 0.126708984375, 0.07025146484375, 0.12548828125, 0.1...

embed

38265695_c0

38265695

prolog

0

Title: Foreach not working in Prolog Problem title: Foreach not working in Prolog Tags: swi-prolog, prolog Problem: Foreach not working in Prolog I am trying following code, where foreach and string_codes are working separately: 7 ?- string_codes("acid", D). D = [97, 99, 105, 100]. 8 ?- string_codes(S, [116, 101, 115, ...

Foreach not working in Prolog Foreach not working in Prolog swi-prolog prolog Foreach Prolog string_codes ERROR Type Outl character_code Foreach not working in Prolog I am trying following code, where foreach and string_codes are working separately: But not together: Only first letter is printed with this code: Where i...

[ 0.0078125, -0.01019287109375, 0.01336669921875, 0.0125732421875, -0.00946044921875, 0.00494384765625, 0.0157470703125, 0.01129150390625, 0.00058746337890625, -0.0228271484375, 0.028076171875, 0.0186767578125, -0.00104522705078125, 0.00823974609375, 0.01519775390625, -0.0181884765625, ...

[ 52445, 934, 959, 20697, 23, 1250, 4867, 2452, 3454, 502, 79315, 40899, 151206, 60457, 13538, 141, 62816, 31577, 25632, 18151, 100, 41581, 84797, 25842, 87293, 5117, 31330, 28412, 678, 903, 2967, 86869, 22288, 6562, 43240, 1632, 3917, 192728, ...

[ 0.2265625, 0.271240234375, 0.0906982421875, 0.1431884765625, 0.04473876953125, 0.169189453125, 0.2320556640625, 0.1107177734375, 0.1129150390625, 0.111328125, 0.1475830078125, 0.177001953125, 0.0626220703125, 0.08935546875, 0.1064453125, 0.0389404296875, 0.0885009765625, 0.04815673...

embed

74428074_c0

74428074

prolog

0

Title: Create Basic Catalog System with Prolog Problem title: Create Basic Catalog System with Prolog Tags: prolog Problem: Create Basic Catalog System with Prolog So we have an assignment to create a catalog system wherein we are supposed to add, edit, delete records of books in a system we created and compute for the...

Create Basic Catalog System with Prolog Create Basic Catalog System with Prolog prolog the Create Basic Catalog System Prolog Online Add Records Edit Delete Display Calculate Exit Choose Choice Input Book Title Author Create Basic Catalog System with Prolog So we have an assignment to create a catalog system wherein we...

[ 0.006072998046875, 0.0185546875, 0.00396728515625, 0.01007080078125, -0.0169677734375, -0.004852294921875, -0.0245361328125, 0.004180908203125, 0.0027008056640625, -0.0400390625, 0.01019287109375, -0.025146484375, -0.019775390625, -0.00738525390625, 0.020263671875, -0.00018119812011718...

[ 151313, 91692, 150917, 12353, 678, 1250, 4867, 502, 2823, 29117, 89916, 42079, 262, 46485, 90045, 212467, 5443, 211525, 181948, 360, 27432, 48962, 61804, 95486, 28282, 71426, 5426, 134598, 15190, 27211, 154109, 115923, 42840, 75935, 9969, 3622, ...

[ 0.175048828125, 0.2220458984375, 0.27001953125, 0.216064453125, 0.1103515625, 0.1737060546875, 0.24609375, 0.1409912109375, 0.1142578125, 0.0916748046875, 0.171142578125, 0.09423828125, 0.09600830078125, 0.1192626953125, 0.1278076171875, 0.151123046875, 0.109130859375, 0.0684814453...

embed

75132866_c0

75132866

prolog

0

Title: How can I solve the Syntax error in Prolog SWI? Problem title: How can I solve the Syntax error in Prolog SWI? Tags: prolog Problem: How can I solve the Syntax error in Prolog SWI? I'm getting 'Syntax error: Operator expected' and also the Warnings: 'Singleton variables: ... ". Here's my code: schwester_von(A,B)...

How can I solve the Syntax error in Prolog SWI? How can I solve the Syntax error in Prolog SWI? prolog How Syntax Prolog SWI schwester_von mutter_von grossvater_von vorfahr_von vater_von bruder_von Stefan Barbara Anna-Lena Marianne Timo Christopher Ursula Thomas Christian Uta Ralf Sven Sabrina How can I solve the Synta...

[ -0.00628662109375, 0.016845703125, -0.01055908203125, 0.021484375, -0.01153564453125, 0.0019073486328125, -0.021728515625, -0.005126953125, 0.00148773193359375, -0.039794921875, 0.00128936767578125, -0.026611328125, -0.013671875, -0.0198974609375, 0.0164794921875, -0.00732421875, 0.0...

[ 831, 86869, 19010, 86531, 18499, 1250, 4867, 159, 38969, 502, 11249, 45786, 43855, 8540, 187352, 55215, 2107, 56, 1248, 33688, 307, 720, 89827, 36947, 73149, 7714, 5267, 133733, 51189, 114411, 60243, 14978, 14949, 102, 17463, 78133, 171102, 7...

[ 0.05078125, 0.1627197265625, 0.1590576171875, 0.254150390625, 0.2061767578125, 0.16259765625, 0.2069091796875, 0.0928955078125, 0.25390625, 0.0859375, 0.001190185546875, 0.010101318359375, 0.1282958984375, 0.1219482421875, 0.1141357421875, 0.0258941650390625, 0.1053466796875, 0.039...

embed

10544452_c0

10544452

prolog

0

Title: Flowpattern doesn't exist Problem title: Flowpattern doesn't exist Tags: prolog Problem: Flowpattern doesn't exist I have been working on a code in prolog for a while now and it is near compiling worthy and all my ideas seem to be solid so it should work when it compiles. It is a program that consults ...

Flowpattern doesn't exist Flowpattern doesn't exist prolog Flowpattern STR LIST LISroT1 LIST1 LIST2 QUERY TOK SYMB STR1 upper_lower Flowpattern doesn't exist I have been working on a code in prolog for a while now and it is near compiling worthy and all my ideas seem to be solid so it should work when it comp...

[ 0.0322265625, 0.0223388671875, -0.006866455078125, 0.0205078125, -0.02001953125, 0.01031494140625, 0.000274658203125, 0.00787353515625, 0.00144195556640625, -0.049072265625, 0.01513671875, 0.004638671875, 0.002227783203125, -0.007537841796875, 0.015625, -0.00439453125, 0.004730224609...

[ 563, 17336, 4453, 22766, 22027, 3768, 18, 32316, 502, 4867, 46549, 195977, 67616, 516, 618, 304, 21389, 72071, 55858, 12689, 418, 1407, 56, 20697, 18151, 43573, 9969, 41965, 25647, 18652, 4488, 1340, 1528, 75463, 63399, 11435, 5303, 70731, ...

[ 0.1041259765625, 0.2315673828125, 0.260498046875, 0.2027587890625, 0.1046142578125, 0.1002197265625, 0.0888671875, 0.22265625, 0.1712646484375, 0.2120361328125, 0.1683349609375, 0.1890869140625, 0.03466796875, 0.0552978515625, 0.0653076171875, 0.002410888671875, 0.0670166015625, 0....

embed

49830667_c0

49830667

prolog

0

Title: PROLOG store nth element of list if string is found in list Problem title: PROLOG store nth element of list if string is found in list Tags: prolog Problem: PROLOG store nth element of list if string is found in list What im trying to do is: fromHistory/2 fromHistory(HL,FL) FL is the 3rd element of the list if t...

PROLOG store nth element of list if string is found in list PROLOG store nth element of list if string is found in list prolog PROLOG Tail HL1 FL1 FL2 PROLOG store nth element of list if string is found in list What im trying to do is: fromHistory/2 fromHistory(HL,FL) FL is the 3rd element of the list if the list conta...

[ -0.000728607177734375, 0.0037841796875, 0.000720977783203125, 0.003936767578125, 0.01318359375, 0.01470947265625, 0.017578125, 0.0036468505859375, 0.01507568359375, -0.015869140625, 0.01336669921875, -0.0230712890625, -0.003936767578125, -0.00885009765625, -0.0079345703125, -0.00222778...

[ 10514, 47510, 4343, 653, 927, 12830, 5303, 2174, 79315, 14037, 23, 111, 502, 4867, 1218, 379, 48599, 418, 63674, 304, 31577, 1295, 20861, 86385, 12477, 69466, 83, 138, 4216, 70541, 2565, 2182, 201, 756, 34153, 53927, 4398, 68991, 1653, 20...

[ 0.185302734375, 0.26220703125, 0.1937255859375, 0.17919921875, 0.169189453125, 0.1990966796875, 0.1990966796875, 0.094970703125, 0.2015380859375, 0.136962890625, 0.0667724609375, 0.042449951171875, 0.1558837890625, 0.2271728515625, 0.122314453125, 0.08203125, 0.1676025390625, 0.033...

embed

78136605_c0

78136605

prolog

0

Title: Constraints in Prolog Problem title: Constraints in Prolog Tags: prolog, constraints Problem: Constraints in Prolog I am trying to generate 6 vectors of 0 and 1 of size 2N checking constraints written with the XOR operation, the lexicographic order and the symplectic product (close to the scalar product) defined...

Constraints in Prolog Constraints in Prolog prolog constraints Constraints Prolog Appel CLP use_module U2N v2N Res Res2 Moitie1 Moitie2 NewO2 Constraints in Prolog I am trying to generate 6 vectors of 0 and 1 of size 2N checking constraints written with the XOR operation, the lexicographic order and the symplectic prod...

[ 0.0059814453125, 0.00885009765625, -0.00909423828125, -0.0157470703125, 0.00104522705078125, -0.00152587890625, 0.010498046875, 0.00799560546875, 0.00555419921875, -0.033447265625, -0.0177001953125, 0.0031890869140625, 0.002593994140625, 0.003448486328125, 0.01416015625, 0.002716064453...

[ 1657, 2816, 4288, 23, 1250, 4867, 502, 158, 36737, 37352, 4527, 83279, 345, 304, 839, 81, 9624, 32129, 2061, 2356, 670, 31577, 139392, 305, 22834, 22230, 757, 136, 13267, 116, 175199, 59121, 1193, 24638, 41018, 95, 73140, 48461, 12989, 33...

[ 0.13427734375, 0.2479248046875, 0.19482421875, 0.0216827392578125, 0.1878662109375, 0.281494140625, 0.14599609375, 0.1363525390625, 0.1578369140625, 0.1495361328125, 0.045562744140625, 0.1195068359375, 0.032257080078125, 0.136962890625, 0.1258544921875, 0.1590576171875, 0.06958007812...

embed

8280172_c0

8280172

prolog

0

Title: Recursion Problems in Prolog Problem title: Recursion Problems in Prolog Tags: backtracking, prolog, recursion Problem: Recursion Problems in Prolog I'm having some difficulties in prolog, I'm trying to write a predicate that will return all paths between two cities, although at the moment it returns the first p...

Recursion Problems in Prolog Recursion Problems in Prolog backtracking prolog recursion Recursion Problems Prolog Ci_Vi PaO Cities_Visited Distance Start Destination Output_Path Output_Distance not_member New_Distance List Recursion Problems in Prolog I'm having some difficulties in prolog, I'm trying to write a predic...

[ 0.007232666015625, 0.01092529296875, 0.0028839111328125, 0.0125732421875, -0.008056640625, -0.004119873046875, -0.005401611328125, -0.008056640625, 0.00982666015625, -0.044677734375, 0.01806640625, 0.00041961669921875, -0.017333984375, 0.0107421875, 0.01239013671875, 0.0022125244140625...

[ 165428, 42, 6889, 15649, 23, 1250, 4867, 4420, 125728, 502, 195625, 2079, 6609, 1342, 670, 44156, 65331, 154349, 13794, 145778, 13538, 7077, 10519, 14055, 116071, 27417, 32036, 19441, 34844, 3387, 31577, 33022, 1653, 2063, 67, 30646, 756, 608...

[ 0.190185546875, 0.190185546875, 0.123779296875, 0.2034912109375, 0.01348876953125, 0.1748046875, 0.2578125, 0.1051025390625, 0.204833984375, 0.150146484375, 0.23779296875, 0.04400634765625, 0.16796875, 0.058441162109375, 0.0997314453125, 0.0765380859375, 0.0611572265625, 0.13623046...

embed

44147207_c1

44147207

prolog

1

uninstall previous audio drivers <<'), nl, question_1('is the audio driver working now?'). diagnosis(['incompatable audio driver']) :- problem('Audio Driver Warning'), nl, write('>> install the appropriate audio driver for your computer <<'), nl, question_2('is your computer still showing driver Warning?'). %%%%%%%%%%...

[ -0.0079345703125, 0.0137939453125, -0.0003643035888671875, 0.032470703125, -0.00946044921875, 0.020263671875, -0.0194091796875, 0.00787353515625, 0.011962890625, -0.01165771484375, 0.0179443359375, 0.0054931640625, 0.007598876953125, -0.01129150390625, 0.0145263671875, 0.00038337707519...

[ 51, 80383, 96362, 18215, 27941, 7, 56473, 13169, 9655, 115187, 164, 70, 20697, 5036, 194, 47099, 73, 277, 4453, 2886, 15772, 2967, 119516, 31, 131470, 5550, 592, 33022, 20600, 95307, 13909, 304, 7464, 141377, 1745, 240085, 53, 42413, 165992...

[ 0.10711669921875, 0.199462890625, 0.165283203125, 0.2403564453125, 0.2310791015625, 0.044921875, 0.002044677734375, 0.08526611328125, 0.108642578125, 0.04742431640625, 0.07427978515625, 0.007415771484375, 0.1563720703125, 0.1343994140625, 0.0264129638671875, 0.15625, 0.04898071289062...

embed

36822397_c0

36822397

prolog

0

Title: Make prolog ignore alternatives, but still backtrack Problem title: Make prolog ignore alternatives, but still backtrack Tags: prolog Problem: Make prolog ignore alternatives, but still backtrack So I have a recursive predicate that looks like this: top_predicate(A, B, C):- finish(A, B, C). top_predicate(A, B, C...

Make prolog ignore alternatives, but still backtrack Make prolog ignore alternatives, but still backtrack prolog Make top_predicate sub_predicate_1 Make prolog ignore alternatives, but still backtrack So I have a recursive predicate that looks like this: sub_predicate_1 has a lot of alternatives. I would like Prolog to...

[ 0.0274658203125, 0.017822265625, 0.01708984375, 0.0003108978271484375, -0.010498046875, -0.00384521484375, 0.005889892578125, 0.0087890625, 0.0030364990234375, -0.0299072265625, -0.018798828125, 0.021484375, -0.0123291015625, 0.0186767578125, 0.0162353515625, 0.00012493133544921875, ...

[ 26176, 502, 4867, 124962, 30700, 1284, 7464, 4420, 125728, 2663, 19714, 2063, 1614, 67, 115187, 195625, 5844, 1653, 33342, 5915, 1884, 1250, 4734, 16916, 5117, 35166, 62163, 1295, 19048, 28560, 50155, 40715, 209, 756, 2965, 11343, 154107, 592...

[ 0.0802001953125, 0.158447265625, 0.2393798828125, 0.1715087890625, 0.168701171875, 0.00762939453125, 0.108642578125, 0.103271484375, 0.2227783203125, 0.1298828125, 0.1400146484375, 0.1578369140625, 0.208984375, 0.037994384765625, 0.1221923828125, 0.14501953125, 0.0665283203125, 0.1...

embed

69832395_c0

69832395

prolog

0

Title: Prolog chess pieces movements Problem title: Prolog chess pieces movements Tags: prolog, chess Problem: Prolog chess pieces movements I am making an ai chess game while using prolog. I've got this board: Board = [piece(white, rook, 1, 1), piece(white, knight, 2, 1), piece(white, bishop, 3, 1), piece(white, queen...

Prolog chess pieces movements Prolog chess pieces movements prolog chess Prolog Board in_boundaries Col Row create_board Piece Pawn NewRow Check Row-1 NewCol Col-1 Prolog chess pieces movements I am making an ai chess game while using prolog. I've got this board: As you can see, the board represented by a list. I am tr...

[ 0.004180908203125, -0.000766754150390625, 0.0218505859375, 0.010986328125, -0.0147705078125, 0.01190185546875, -0.0086669921875, 0.017333984375, -0.0033721923828125, -0.041015625, -0.027587890625, 0.0291748046875, 0.0037384033203125, -0.00982666015625, -0.009521484375, -0.0012283325195...

[ 1250, 4867, 290, 7, 126371, 112664, 502, 62554, 23, 99091, 11, 11554, 96190, 28282, 24351, 10374, 138413, 19, 2356, 12724, 38679, 5759, 78457, 20662, 1300, 6712, 17368, 45443, 33636, 5303, 31577, 1653, 2063, 30646, 7722, 25813, 34475, 63847, ...

[ 0.174072265625, 0.254150390625, 0.1708984375, 0.07562255859375, 0.176513671875, 0.1973876953125, 0.1265869140625, 0.14501953125, 0.03509521484375, 0.126220703125, 0.0484619140625, 0.108154296875, 0.164306640625, 0.08428955078125, 0.15576171875, 0.0810546875, 0.138916015625, 0.04116...

embed

71341011_c0

71341011

prolog

0

Title: Why does SWI-Prolog fail when mentioning a predicate without any facts in a rule? Problem title: Why does SWI-Prolog fail when mentioning a predicate without any facts in a rule? Tags: prolog Problem: Why does SWI-Prolog fail when mentioning a predicate without any facts in a rule? Here is my Prolog program: :- ...

Why does SWI-Prolog fail when mentioning a predicate without any facts in a rule? Why does SWI-Prolog fail when mentioning a predicate without any facts in a rule? prolog Why SWI-Prolog set_prolog_flag use_module links.pl Initialization ERROR Undefined amd64 Why does SWI-Prolog fail when mentioning a predicate without ...

[ 0.01434326171875, 0.0078125, 0.0037841796875, 0.03369140625, -0.0240478515625, 0.009521484375, 0.0341796875, 0.0003108978271484375, -0.00023555755615234375, -0.035400390625, 0.0030059814453125, 0.002410888671875, -0.0206298828125, 0.01458740234375, 0.0186767578125, -0.00102996826171875...

[ 44084, 159, 38969, 10752, 4867, 35782, 41392, 1653, 2063, 67, 15490, 2499, 15824, 79986, 502, 9, 5423, 3454, 190872, 4527, 83279, 22317, 2424, 360, 1890, 289, 151206, 24638, 79912, 5983, 444, 71, 13307, 14602, 3229, 23, 1250, 1528, 28398, ...

[ 0.055755615234375, 0.06561279296875, 0.196533203125, 0.1488037109375, 0.2064208984375, 0.1766357421875, 0.130859375, 0.1290283203125, 0.1749267578125, 0.0718994140625, 0.1292724609375, 0.0782470703125, 0.161865234375, 0.1568603515625, 0.0841064453125, 0.02850341796875, 0.108154296875...

embed

38482311_c0

38482311

prolog

0

Title: Flattening a list Problem title: Flattening a list Tags: prolog, list Problem: Flattening a list Trying to solve exercise 07 from http://www.ic.unicamp.br/~meidanis/courses/mc336/2009s2/prolog/problemas/ I've started with a single iteration which looks like following my_flatten1([], []). my_flatten1([[A|T]|U], [...

Flattening a list Flattening a list prolog list Flattening my_flatten1 is_list is_flat my_flatten Flattening a list Trying to solve exercise 07 from http://www.ic.unicamp.br/~meidanis/courses/mc336/2009s2/prolog/problemas/ I've started with a single iteration which looks like following it seems to work just fine for th...

[ -0.00830078125, 0.0201416015625, 0.0213623046875, -0.0031890869140625, -0.004150390625, -0.0035247802734375, 0.0016632080078125, -0.0045166015625, 0.01806640625, -0.01165771484375, 0.015625, -0.00022125244140625, -0.0068359375, 0.0128173828125, 0.005401611328125, -0.005767822265625, ...

[ 106516, 67, 592, 5303, 502, 4867, 759, 150632, 510, 418, 83, 6562, 86869, 81979, 4719, 27034, 164, 8659, 40148, 3454, 38953, 11001, 720, 33342, 25632, 4488, 5885, 41, 10484, 18, 65771, 45367, 35509, 11343, 35782, 3564, 9393, 40956, 27489, ...

[ 0.215087890625, 0.182861328125, 0.0156097412109375, 0.22119140625, 0.11474609375, 0.1826171875, 0.15576171875, 0.264404296875, 0.2369384765625, 0.1124267578125, 0.1068115234375, 0.2364501953125, 0.053955078125, 0.125732421875, 0.117919921875, 0.1180419921875, 0.030548095703125, 0.0...

embed

32586326_c1

32586326

prolog

1

2,[i21,i22,i23]). Diagram: https://docs.google.com/drawings/d/10wBpmFxxbDqrlpPVqpkVo_r8I-qcalWAz7Lro9myjMs/edit?usp=sharing Inputs into a device are also like an AND gate but they are always the 'top' level of the circuit tree. I want to implement a predicate that would result in something like: ?- device_structure(D,O...

[ 0.00799560546875, -0.00127410888671875, -0.01190185546875, 0.013671875, 0.01251220703125, 0.02392578125, 0.01507568359375, -0.0181884765625, 0.01177978515625, -0.047607421875, 0.0030670166015625, -0.003143310546875, -0.007049560546875, -0.0074462890625, 0.0028228759765625, 0.0035705566...

[ 116, 14, 3117, 4015, 3742, 4512, 25561, 29713, 59875, 86905, 5180, 45082, 2420, 360, 7077, 3934, 75186, 621, 2843, 1884, 48762, 70836, 1284, 11343, 13784, 17366, 61404, 53201, 3444, 29479, 1653, 2063, 67, 16750, 705, 137656, 397, 20320, 125...

[ 0.1448974609375, 0.042327880859375, 0.1146240234375, 0.10491943359375, 0.1319580078125, 0.10406494140625, 0.1527099609375, 0.017486572265625, 0.01373291015625, 0.09771728515625, 0.007293701171875, 0.00091552734375, 0.024505615234375, 0.14990234375, 0.2403564453125, 0.1778564453125, 0...

embed

16526720_c1

16526720

prolog

1

the head of the first path is not a goal node) remove the first path from the candidates set and generate the set of all possible one-step extensions of this paths, add this set of extension at the end of the candidate set, and execute breath-first search on this updated set */ breadthfirst([Path|Paths], Solution) :- ...

[ 0.036865234375, 0.018310546875, 0.026123046875, 0.038330078125, -0.0205078125, -0.00665283203125, -0.0262451171875, -0.01470947265625, -0.000675201416015625, -0.042724609375, 0.01483154296875, 0.00136566162109375, -0.00799560546875, 0.00433349609375, -0.0146484375, -0.0137939453125, ...

[ 10336, 111, 5117, 60875, 83, 959, 10, 69236, 110, 112, 87388, 25469, 90, 5423, 139392, 7722, 1632, 95528, 111938, 15190, 3564, 71924, 71191, 13448, 33938, 150011, 179967, 927, 271, 10519, 187895, 15772, 181139, 108421, 7, 5303, 65042, 48281, ...

[ 0.1986083984375, 0.03759765625, 0.136474609375, 0.251220703125, 0.0828857421875, 0.134765625, 0.04803466796875, 0.2413330078125, 0.150146484375, 0.1795654296875, 0.14306640625, 0.201416015625, 0.0732421875, 0.1336669921875, 0.1280517578125, 0.12158203125, 0.056915283203125, 0.16381...

embed

43978568_c0

43978568

prolog

0

Title: Prolog: How to get a path from a start node to a Goal Node Problem title: Prolog: How to get a path from a start node to a Goal Node Tags: predicate, nodes, prolog, artificial-intelligence, search Problem: Prolog: How to get a path from a start node to a Goal Node I'm trying to write a prolog program that will r...

Prolog: How to get a path from a start node to a Goal Node Prolog: How to get a path from a start node to a Goal Node predicate nodes prolog artificial-intelligence search a Prolog How Goal Node get_path StartNode Path Prolog: How to get a path from a start node to a Goal Node I'm trying to write a prolog program that ...

[ 0.021728515625, 0.004669189453125, -0.01068115234375, 0.0096435546875, -0.00323486328125, 0.0123291015625, -0.0021209716796875, -0.0277099609375, 0.00927734375, -0.05322265625, 0.0177001953125, -0.0111083984375, -0.0390625, -0.005157470703125, 0.006195068359375, -0.0093994140625, -0....

[ 1250, 4867, 11249, 2046, 60875, 1295, 4034, 110, 112, 47, 2016, 289, 438, 1653, 2063, 988, 502, 66733, 130687, 33938, 128405, 13794, 5021, 108421, 31577, 33022, 1528, 33636, 69236, 527, 30646, 5303, 126597, 5423, 764, 474, 34292, 39457, 42,...

[ 0.173828125, 0.2276611328125, 0.047576904296875, 0.1021728515625, 0.2320556640625, 0.09918212890625, 0.1802978515625, 0.1666259765625, 0.1217041015625, 0.08734130859375, 0.1531982421875, 0.1390380859375, 0.18408203125, 0.13330078125, 0.1558837890625, 0.125244140625, 0.13330078125, ...

embed

52464619_c1

52464619

prolog

1

I-Prolog being relocatable (and thus having path relative to the executable). The output of otool -L of the libjpl.dylib give me this output: /Applications/SWI-Prolog.app/Contents/swipl/lib/x86_64-darwin15.6.0/libjpl.dylib: @rpath/libjsig.dylib (compatibility version 1.0.0, current version 1.0.0) @rpath/libjvm.dylib (c...

[ -0.0157470703125, 0.0133056640625, -0.0029144287109375, 0.00775146484375, -0.01434326171875, -0.01287841796875, -0.006561279296875, 0.007232666015625, -0.0120849609375, -0.03662109375, -0.00119781494140625, -0.007049560546875, -0.00311279296875, -0.0010528564453125, 0.0133056640625, 0....

[ 87, 9, 10752, 4867, 8035, 456, 116292, 2886, 19441, 60875, 35845, 71924, 140992, 36, 89110, 20, 866, 25474, 170, 2424, 1459, 5612, 163, 47677, 182867, 294, 38969, 9007, 25352, 2452, 15276, 13307, 1506, 9494, 1837, 43652, 2389, 128405, 20561...

[ 0.1533203125, 0.0426025390625, 0.1953125, 0.282470703125, 0.072509765625, 0.091064453125, 0.2298583984375, 0.18701171875, 0.06658935546875, 0.2047119140625, 0.09375, 0.1492919921875, 0.1304931640625, 0.059356689453125, 0.29296875, 0.024749755859375, 0.1358642578125, 0.107666015625,...

embed

28024224_c0

28024224

prolog

0

Title: Coroutining in Prolog: when argument is a list (it has fixed length) Problem title: Coroutining in Prolog: when argument is a list (it has fixed length) Tags: prolog-coroutining, prolog, logical-purity Problem: Coroutining in Prolog: when argument is a list (it has fixed length) Question Is it possible to schedu...

Coroutining in Prolog: when argument is a list (it has fixed length) Coroutining in Prolog: when argument is a list (it has fixed length) prolog-coroutining prolog logical-purity Coroutining Prolog fixed_length Coroutining in Prolog: when argument is a list (it has fixed length) Question Is it possible to schedule a go...

[ 0.0123291015625, 0.0081787109375, 0.0019073486328125, 0.003265380859375, 0.002471923828125, -0.0002269744873046875, 0.0030364990234375, 0.015625, 0.017822265625, -0.0302734375, 0.001251220703125, -0.0234375, -0.004364013671875, 0.0162353515625, 0.0172119140625, -0.00823974609375, 0.0...

[ 5631, 6056, 14653, 1250, 4867, 3229, 10750, 83, 5303, 1556, 188347, 140909, 10, 502, 10517, 62775, 289, 4717, 2481, 23986, 7722, 80889, 69236, 47, 71924, 33662, 237, 51529, 8710, 34475, 24209, 36290, 14847, 126940, 831, 64549, 17368, 705, 1...

[ 0.076416015625, 0.1578369140625, 0.182373046875, 0.1326904296875, 0.2265625, 0.092529296875, 0.289794921875, 0.041900634765625, 0.2381591796875, 0.0391845703125, 0.271484375, 0.173583984375, 0.0150909423828125, 0.0814208984375, 0.0107421875, 0.165771484375, 0.07220458984375, 0.1789...

embed

36222035_c0

36222035

prolog

0

Title: Node has no descendant Problem title: Node has no descendant Tags: prolog Problem: Node has no descendant I have a rule % X is descendant of Y descendant(X,Y) :- I am trying to write a rule that will find out which node has no descendant. How do I tell prolog that I want to find every X that fails descendant(X,_...

Node has no descendant Node has no descendant prolog Node child2 jr_child cyborg_descendant is_human_or_cyborg has_no_cyborg_descendants Node has no descendant I have a rule I am trying to write a rule that will find out which node has no descendant. How do I tell prolog that I want to find every X that fails descendan...

[ 0.0230712890625, 0.0135498046875, 0.01007080078125, 0.02001953125, -0.00653076171875, 0.026611328125, 0.01123046875, -0.004119873046875, -0.0068359375, -0.0181884765625, -0.01287841796875, -0.0294189453125, -0.025146484375, 0.0096435546875, 0.00457763671875, 0.00384521484375, 0.01623...

[ 438, 112, 1556, 110, 60887, 1236, 502, 4867, 29041, 304, 1647, 42, 206, 38472, 19932, 10164, 31146, 58349, 69790, 748, 2408, 157, 79986, 31577, 33022, 7413, 1810, 3129, 14192, 3444, 11907, 1193, 450, 35782, 1542, 81113, 91736, 11675, 756, ...

[ 0.18798828125, 0.189208984375, 0.1253662109375, 0.1644287109375, 0.2088623046875, 0.1217041015625, 0.137939453125, 0.1407470703125, 0.1302490234375, 0.146484375, 0.021575927734375, 0.0244293212890625, 0.019134521484375, 0.08056640625, 0.055694580078125, 0.2001953125, 0.1651611328125,...

embed

75038367_c0

75038367

prolog

0

Title: Why does this prolog rule using include/3 evaluate to false, but not when exploding it into individual comparisons? Problem title: Why does this prolog rule using include/3 evaluate to false, but not when exploding it into individual comparisons? Tags: clpfd, prolog Problem: Why does this prolog rule using inclu...

Why does this prolog rule using include/3 evaluate to false, but not when exploding it into individual comparisons? Why does this prolog rule using include/3 evaluate to false, but not when exploding it into individual comparisons? clpfd prolog include/3 X Why position_that_is_equals_to_two AllElementsWhichHaveAValueOf...

[ -0.0004024505615234375, 0.0084228515625, 0.0091552734375, 0.041748046875, -0.0057373046875, 0.0142822265625, 0.0025482177734375, 0.00018405914306640625, 0.007293701171875, -0.022705078125, 0.041259765625, 0.0179443359375, 0.0034942626953125, 0.019775390625, 0.005950927734375, 0.0007972...

[ 44084, 502, 4867, 79986, 26698, 18113, 151575, 98320, 24649, 11651, 225490, 47, 959, 3934, 33139, 39557, 71, 1193, 19069, 86673, 164, 71723, 188, 55547, 3164, 647, 19929, 6495, 272, 50770, 132887, 3613, 927, 2389, 903, 17368, 5423, 14012, 1...

[ 0.08251953125, 0.1212158203125, 0.194091796875, 0.1512451171875, 0.1943359375, 0.2318115234375, 0.1402587890625, 0.2099609375, 0.1405029296875, 0.0958251953125, 0.1964111328125, 0.027618408203125, 0.0240478515625, 0.0135498046875, 0.00518798828125, 0.042694091796875, 0.0946044921875,...

embed

70711630_c1

70711630

prolog

1

), Reply='y'. symptom(Patient,sore_throat) :- write_list(['Does ',Patient,' have a sore_throat (y/n) ?']), response(Reply), Reply='y'. symptom(Patient,sneezing) :- write_list(['Does ',Patient,' have a sneezing (y/n) ?']), response(Reply), Reply='y'. symptom(Patient,swollen_glands) :- write_list(['Does ',Patient,' have ...

[ 0.0023040771484375, 0.0002651214599609375, 0.0181884765625, 0.0162353515625, -0.0130615234375, 0.0152587890625, -0.01434326171875, -0.005157470703125, -0.0146484375, -0.030517578125, 0.002166748046875, 0.00830078125, -0.0133056640625, 0.0019989013671875, -0.001708984375, 0.006011962890...

[ 247, 122813, 128668, 8335, 118, 2517, 46797, 42294, 257, 15772, 33022, 6562, 8331, 90, 765, 10, 127124, 53, 64, 57553, 62479, 86, 1255, 214, 34614, 3613, 177, 15534, 112141, 8405, 170933, 6023, 282, 162, 1577, 2242, 814, 72089, 17043, 446...

[ 0.0152587890625, 0.1988525390625, 0.24755859375, 0.052947998046875, 0.1114501953125, 0.0872802734375, 0.176025390625, 0.2041015625, 0.1094970703125, 0.0552978515625, 0.158935546875, 0.2044677734375, 0.053924560546875, 0.06158447265625, 0.082275390625, 0.04852294921875, 0.158935546875...

embed

41211454_c0

41211454

prolog

0

Title: Prolog doesn't pass variables Problem title: Prolog doesn't pass variables Tags: prolog Problem: Prolog doesn't pass variables In a Prolog rule, I tried to pass variable from case to another but it doesn't work plane(c130,propeller,high,conventional,conventional,under-wing). plane(c141,jet,high,sweptba...

Prolog doesn't pass variables Prolog doesn't pass variables prolog Prolog c130 c141 c5a b747 Name Eng Wing Shape Tail Bulges Plane Not Found Please Retry _L155_L156c130 Prolog doesn't pass variables In a Prolog rule, I tried to pass variable from case to another but it doesn't work and here is the output in a...

[ 0.02001953125, 0.0034942626953125, -0.0223388671875, 0.006683349609375, -0.0021209716796875, 0.0012054443359375, -0.0162353515625, -0.00311279296875, 0.00384521484375, -0.0020904541015625, 0.009033203125, 0.00604248046875, -0.0211181640625, -0.00933837890625, 0.0106201171875, 0.0114746...

[ 1250, 4867, 22027, 3768, 18, 27875, 77336, 502, 43955, 146893, 758, 139091, 15757, 25024, 601, 214, 7224, 1218, 379, 166599, 90, 5586, 11205, 215624, 15123, 119477, 155740, 79986, 37842, 1295, 7225, 47, 15700, 4488, 3688, 140992, 66044, 44691...

[ 0.1837158203125, 0.27490234375, 0.05023193359375, 0.048614501953125, 0.0899658203125, 0.174560546875, 0.27197265625, 0.1365966796875, 0.1964111328125, 0.1451416015625, 0.022003173828125, 0.178466796875, 0.016326904296875, 0.0372314453125, 0.04827880859375, 0.00665283203125, 0.0771484...

embed

70221446_c0

70221446

prolog

0

Title: Graph representations in Prolog Problem title: Graph representations in Prolog Tags: list, prolog, adjacency-list, graph-theory, swi-prolog Problem: Graph representations in Prolog Consider the following graph and that it is described by the below Prolog term : graph([connected(a,[b,c]), connected(b,[a,c]), conn...

Graph representations in Prolog Graph representations in Prolog list prolog adjacency-list graph-theory swi-prolog Graph Prolog map2ne Pair map3n Map Pairs PairX Graph representations in Prolog Consider the following graph and that it is described by the below Prolog term : graph([connected(a,[b,c]), connected(b,[a,c])...

[ -0.019287109375, 0.0184326171875, 0.005462646484375, -0.002197265625, -0.021728515625, 0.0135498046875, -0.03515625, 0.00848388671875, 0.01043701171875, -0.041259765625, -0.004119873046875, -0.015625, -0.0216064453125, -0.005615234375, -0.003875732421875, 0.01904296875, 0.01574707031...

[ 6524, 11727, 18811, 1250, 4867, 5303, 502, 123594, 329, 6562, 41382, 2452, 3454, 22288, 86, 1342, 42719, 37897, 481, 1542, 25632, 151552, 35064, 13579, 135457, 238, 162711, 275, 71, 1884, 61924, 1653, 2063, 67, 27198, 36917, 94878, 3934, 42...

[ 0.1898193359375, 0.1544189453125, 0.239501953125, 0.171875, 0.2484130859375, 0.18115234375, 0.1087646484375, 0.027191162109375, 0.0272369384765625, 0.130126953125, 0.244140625, 0.09429931640625, 0.071044921875, 0.132568359375, 0.03717041015625, 0.1038818359375, 0.1265869140625, 0.1...

embed

20256667_c0

20256667

prolog

0

Title: Prolog: Removing Duplicates Problem title: Prolog: Removing Duplicates Tags: prolog Problem: Prolog: Removing Duplicates I am trying to remove duplicate entries from a list in prolog. So a list [a,b,a,c,b,a] would return [a,b,c]. I can not use any built in functions. I searched here and found this code. member(X...

Prolog: Removing Duplicates Prolog: Removing Duplicates prolog Prolog Removing Duplicates Out x::xs x::remv x::remvdub Ans Ans1 Prolog: Removing Duplicates I am trying to remove duplicate entries from a list in prolog. So a list [a,b,a,c,b,a] would return [a,b,c]. I can not use any built in functions. I searched here a...

[ 0.0045166015625, 0.0198974609375, 0.020263671875, 0.0020599365234375, -0.0189208984375, 0.0022735595703125, -0.0113525390625, 0.0179443359375, 0.0096435546875, -0.023193359375, -0.01318359375, -0.00135040283203125, 0.01953125, 0.006103515625, -0.0023193359375, 0.00689697265625, 0.024...

[ 1250, 4867, 853, 432, 6496, 786, 52721, 1636, 502, 13538, 1022, 7328, 334, 42629, 893, 31577, 87388, 171763, 67, 112820, 1295, 5303, 275, 238, 30646, 831, 959, 4527, 88303, 23, 32354, 33938, 18151, 5646, 12830, 136, 74918, 184750, 49504, ...

[ 0.1624755859375, 0.22119140625, 0.03485107421875, 0.132568359375, 0.082275390625, 0.174560546875, 0.252685546875, 0.08447265625, 0.15283203125, 0.108154296875, 0.005401611328125, 0.0836181640625, 0.140869140625, 0.1405029296875, 0.0189208984375, 0.06658935546875, 0.1678466796875, 0...

embed

8434772_c0

8434772

prolog

0

Title: Extensional DCG Test Cases Problem title: Extensional DCG Test Cases Tags: unit-testing, prolog, grammar, dcg Problem: Extensional DCG Test Cases I am looking for extensional DCG test cases. Means test cases that check the right functioning of a DCG processor in terms of the behaviour of the resulting converted ...

Extensional DCG Test Cases Extensional DCG Test Cases unit-testing prolog grammar dcg Extensional DCG Test Cases _608 _609 _619 _617 Extensional DCG Test Cases I am looking for extensional DCG test cases. Means test cases that check the right functioning of a DCG processor in terms of the behaviour of the resulting con...

[ 0.0255126953125, 0.004669189453125, 0.005096435546875, 0.0224609375, 0.0027618408203125, -0.00135040283203125, 0.00144195556640625, -0.002471923828125, 0.006805419921875, -0.0009613037109375, -0.00025177001953125, 0.01141357421875, -0.027099609375, 0.00726318359375, 0.0159912109375, 0....

[ 224545, 289, 391, 56367, 8647, 43731, 25072, 6954, 502, 4867, 122092, 147, 104, 238, 177, 170285, 186198, 910, 2947, 2489, 16487, 100, 111938, 3034, 50218, 12765, 7108, 32354, 14543, 224833, 16750, 117176, 91736, 959, 224, 16565, 2852, 3540, ...

[ 0.2161865234375, 0.1436767578125, 0.1021728515625, 0.225341796875, 0.19482421875, 0.2086181640625, 0.1209716796875, 0.1644287109375, 0.10791015625, 0.202880859375, 0.100341796875, 0.023284912109375, 0.012603759765625, 0.0291595458984375, 0.07354736328125, 0.1414794921875, 0.136108398...

embed

60904783_c1

60904783

prolog

1

site: <html> <head> <meta charset="utf-8"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <title>Playground</title> </head> <body> <script type="text/javascript" src="tau-prolog.js"></script> <h1>Playground4</h1> <script> function queryRG() { var session = pl.create(1000) var code_pl = ` robot(...

[ 0.010986328125, 0.021240234375, 0.00191497802734375, 0.0101318359375, 0.0015411376953125, -0.00555419921875, -0.002471923828125, -0.003814697265625, 0.0162353515625, -0.07177734375, 0.0037841796875, -0.0030975341796875, -0.0302734375, -0.0230712890625, 0.0028533935546875, 0.01611328125...

[ 1764, 12, 4426, 7693, 31251, 35273, 21441, 1003, 420, 17376, 9351, 22751, 6982, 10941, 146984, 1369, 112, 20375, 61475, 57965, 102107, 5440, 97054, 64330, 37873, 32032, 10644, 22829, 24071, 19437, 50104, 9, 3454, 4867, 28175, 127, 418, 617, ...

[ 0.2181396484375, 0.0853271484375, 0.003570556640625, 0.2086181640625, 0.135986328125, 0.18603515625, 0.1160888671875, 0.0859375, 0.08013916015625, 0.1407470703125, 0.03515625, 0.1314697265625, 0.152587890625, 0.1048583984375, 0.132080078125, 0.004913330078125, 0.00384521484375, 0.1...

embed

50075064_c0

50075064

prolog

0

Title: Grammar in prolog Problem title: Grammar in prolog Tags: prolog, grammar Problem: Grammar in prolog I want to be able to translate arrays like [int(2), sep(<), int(1), sep(-), id(N)] into conditions (in this example [int(2) < int(1)-id(N)] ) using grammar. I have the grammar below: cond(_, A > B) --> expr(_,A), ...

Grammar in prolog Grammar in prolog prolog grammar Grammar Call _G2290032 Fail _G2313 _G2314 _G2336 _L254 _G2482 _L235 Exit _G2488 Redo _L279 _G2485 _L260 _G2491 _L304 _L285 _G2494 _L329 _L310 _G2497 _L354 _L335 _G2500 Grammar in prolog I want to be able to translate arrays like [int(2), sep(<), int(1), sep(-), id(N)] ...

[ 0.01312255859375, 0.00194549560546875, -0.00592041015625, 0.006744384765625, 0.0016632080078125, 0.00138092041015625, -0.006744384765625, 0.0038299560546875, 0.0023956298828125, -0.015869140625, 0.01043701171875, 0.021484375, -0.00335693359375, -0.0233154296875, 0.0264892578125, 0.0000...

[ 48078, 1727, 23, 502, 4867, 122092, 147, 26265, 724, 20543, 6460, 190355, 3742, 2681, 2592, 8659, 2588, 617, 12012, 149265, 5443, 12772, 31, 116518, 12951, 167555, 101800, 14889, 4235, 119527, 14773, 5843, 143589, 3444, 3900, 19309, 10298, 47...

[ 0.19140625, 0.117919921875, 0.0792236328125, 0.1746826171875, 0.239501953125, 0.1793212890625, 0.1397705078125, 0.1729736328125, 0.001129150390625, 0.0706787109375, 0.0894775390625, 0.14599609375, 0.03271484375, 0.06292724609375, 0.059295654296875, 0.05560302734375, 0.06512451171875,...

embed

50939220_c1

50939220

prolog

1

No permission to load source `'/home/vimos/git/SP/mooney/chill/orig-db.i'' (Non-module file already loaded into module test; trying to load into thetheory) ERROR: In: ERROR: [36] throw(error(permission_error(load,source,'/home/vimos/git/SP/mooney/chill/orig-db.i'),context(...,'Non-module file already loaded into modul...

>:compile(Filename) clause, which I suspect could be a reason for the error. There are two dynamic compiled modules test and thetheory . They are both compiled from the same file orig-db.i . If I force one of them to read from a different file like orig-db.ii , the error will be different. I tried the same code with ya...

[ -0.004547119140625, 0.00946044921875, 0.01348876953125, 0.0233154296875, -0.0031280517578125, 0.01336669921875, -0.00396728515625, -0.0011749267578125, -0.006744384765625, -0.06787109375, 0.005828857421875, -0.0078125, -0.0189208984375, -0.03173828125, 0.009521484375, 0.012451171875, ...

[ 977, 12, 58875, 1340, 132, 174350, 11627, 70731, 13, 92610, 5809, 31635, 18499, 6626, 84079, 375, 5974, 297, 88996, 3034, 136, 70, 2347, 30675, 5701, 11435, 36, 10384, 48073, 14, 37772, 12301, 12921, 1573, 18151, 15850, 853, 133266, 63284, ...

[ 0.099365234375, 0.0232696533203125, 0.176513671875, 0.2000732421875, 0.02008056640625, 0.1844482421875, 0.2276611328125, 0.1524658203125, 0.037933349609375, 0.08331298828125, 0.035858154296875, 0.037017822265625, 0.1812744140625, 0.035736083984375, 0.18115234375, 0.0799560546875, 0.2...

embed

11713849_c0

11713849

prolog

0

Title: Package Searching in Prolog Problem title: Package Searching in Prolog Tags: package, prolog, search, list, comparison Problem: Package Searching in Prolog I have the following packages: package('python', '2.6.5'). package('python', '2.5.4'). package('python', '1.5.2'). package('python', '3.1.0'). And I wrote so...

Package Searching in Prolog Package Searching in Prolog package prolog search list comparison Package Searching Prolog Integer-like-atom atom_integer Atom atom_chars number_chars Split split2 split3 gollem.swi.psy.uva.nl SWI-Prolog BAC ABAC NewABAC NewR split_version Ver VParts integer_list Lst1 RLst1 Lst2 RLst2 cmp_li...

[ 0.01275634765625, -0.004241943359375, 0.0247802734375, 0.009521484375, -0.01556396484375, 0.005218505859375, 0.010498046875, -0.0096435546875, 0.01165771484375, 0.01373291015625, 0.010009765625, 0.014404296875, 0.0016326904296875, -0.019287109375, 0.006988525390625, -0.003814697265625,...

[ 56607, 4588, 33086, 214, 23, 1250, 4867, 98169, 502, 33938, 5303, 225490, 44401, 5062, 5928, 34627, 6191, 69728, 9254, 14012, 46474, 65450, 304, 363, 6153, 2452, 51775, 26247, 38969, 10752, 8678, 441, 11321, 15012, 49068, 2356, 1052, 46354, ...

[ 0.180908203125, 0.045013427734375, 0.187255859375, 0.11279296875, 0.068603515625, 0.1763916015625, 0.259033203125, 0.189208984375, 0.1337890625, 0.173828125, 0.092041015625, 0.140380859375, 0.1219482421875, 0.15673828125, 0.1241455078125, 0.1568603515625, 0.107177734375, 0.15173339...

embed

17175790_c0

17175790

prolog

0

Title: How to create rule that returns each value as unique Problem title: How to create rule that returns each value as unique Tags: prolog-dif, prolog, crossword Problem: How to create rule that returns each value as unique I'm following along with Learn Prolog Now! and was looking at Exercise 2.4 . A solution I foun...

How to create rule that returns each value as unique How to create rule that returns each value as unique prolog-dif prolog crossword How V1H1 V1H2 V1H3 V2H1 V2H2 V2H3 V3H1 V3H2 V3H3 How to create rule that returns each value as unique I'm following along with Learn Prolog Now! and was looking at Exercise 2.4 . A solut...

[ 0.00482177734375, -0.0159912109375, 0.0022735595703125, -0.0011138916015625, -0.00811767578125, -0.00189971923828125, -0.01507568359375, 0.0111083984375, 0.0208740234375, -0.0169677734375, -0.006805419921875, 0.00168609619140625, 0.0400390625, 0.00396728515625, 0.002471923828125, 0.024...

[ 11249, 28282, 79986, 450, 30646, 12638, 34292, 237, 36998, 47, 7, 502, 4867, 428, 420, 41421, 47416, 310, 418, 841, 304, 363, 25632, 134031, 1250, 14240, 155534, 66207, 29806, 37202, 86869, 27489, 50339, 4734, 116, 138155, 138, 51347, 70541...

[ 0.040191650390625, 0.195556640625, 0.2430419921875, 0.0699462890625, 0.2315673828125, 0.1475830078125, 0.206298828125, 0.116943359375, 0.291259765625, 0.012908935546875, 0.0369873046875, 0.12451171875, 0.1820068359375, 0.0350341796875, 0.08245849609375, 0.1019287109375, 0.18371582031...

embed

52742937_c0

52742937

prolog

0

Title: How to calculate flight time and path length in Prolog Problem title: How to calculate flight time and path length in Prolog Tags: prolog, shortest-path Problem: How to calculate flight time and path length in Prolog I have this database in prolog and i would like to calculate: 1) flightTime(Start, Destination, ...

How to calculate flight time and path length in Prolog How to calculate flight time and path length in Prolog prolog shortest-path How Prolog How to calculate flight time and path length in Prolog I have this database in prolog and i would like to calculate: 1) flightTime(Start, Destination, Time, Path) to compute the ...

[ 0.01806640625, 0.0201416015625, 0.006439208984375, 0.01019287109375, -0.004608154296875, -0.01239013671875, -0.01300048828125, -0.02197265625, -0.00090789794921875, -0.048583984375, 0.001251220703125, -0.01129150390625, -0.02099609375, 0.0029296875, 0.004913330078125, -0.017578125, 0...

[ 11249, 74481, 67, 113014, 1733, 136, 60875, 140909, 23, 1250, 4867, 502, 16610, 525, 128405, 63399, 1884, 70059, 126597, 145778, 19055, 108421, 9969, 6743, 7722, 449, 10519, 5303, 683, 28412, 17721, 6626, 146619, 145755, 2046, 8951, 116361, 1...

[ 0.05169677734375, 0.17431640625, 0.0631103515625, 0.1968994140625, 0.182373046875, 0.0869140625, 0.198974609375, 0.170166015625, 0.011505126953125, 0.1580810546875, 0.219482421875, 0.11328125, 0.1463623046875, 0.0784912109375, 0.16552734375, 0.1102294921875, 0.005828857421875, 0.17...

embed

26648556_c0

26648556

prolog

0

Title: understand the running trace of quicksort in prolog Problem title: understand the running trace of quicksort in prolog Tags: prolog, sorting, trace, quicksort Problem: understand the running trace of quicksort in prolog I have the following prolog code for quicksort: gt(X,Y):- X @> Y. conc([], List, List). conc(...

understand the running trace of quicksort in prolog understand the running trace of quicksort in prolog prolog sorting trace quicksort List Head Tail List1 List2 Sorted Small Big SortedSmall SortedBig Redo _G3785 _G3782 Call _G3788 Exit understand the running trace of quicksort in prolog I have the following prolog cod...

[ 0.00958251953125, 0.00927734375, 0.020263671875, -0.01519775390625, -0.016845703125, 0.0108642578125, -0.011474609375, -0.0028076171875, 0.0120849609375, 0.0162353515625, -0.00106048583984375, 0.011962890625, -0.0201416015625, -0.0281982421875, 0.01806640625, 0.0007781982421875, 0.01...

[ 28219, 70, 51042, 144851, 111, 63773, 62351, 23, 502, 4867, 12096, 32036, 44816, 1218, 379, 53666, 69070, 297, 6096, 31, 164814, 134808, 26265, 146406, 5443, 217, 18151, 10298, 53, 27781, 83, 617, 57626, 363, 1528, 39555, 6275, 2831, 44084,...

[ 0.1629638671875, 0.0291900634765625, 0.177978515625, 0.251708984375, 0.0465087890625, 0.202880859375, 0.290771484375, 0.039642333984375, 0.1475830078125, 0.21484375, 0.1895751953125, 0.1204833984375, 0.1214599609375, 0.0809326171875, 0.07305908203125, 0.1834716796875, 0.015869140625,...

embed

50320905_c0

50320905

prolog

0

Title: Use dynamic/1 and var/1 Create Prolog clauses that allow the following Problem title: Use dynamic/1 and var/1 Create Prolog clauses that allow the following Tags: prolog-directive-dynamic, prolog Problem: Use dynamic/1 and var/1 Create Prolog clauses that allow the following ?- say([the, capital, of, switzerland...

Use dynamic/1 and var/1 Create Prolog clauses that allow the following Use dynamic/1 and var/1 Create Prolog clauses that allow the following prolog-directive-dynamic prolog Use Create Prolog Thank What Bern Use dynamic/1 and var/1 Create Prolog clauses that allow the following The last two is easy, I use say([the, cap...

[ 0.004974365234375, 0.01422119140625, 0.000835418701171875, 0.01019287109375, 0.006622314453125, 0.0272216796875, 0.014892578125, 0.0255126953125, 0.0030975341796875, -0.0301513671875, -0.01416015625, -0.0098876953125, -0.024658203125, 0.000051021575927734375, 0.02001953125, 0.015991210...

[ 36836, 84079, 11583, 136, 285, 151313, 1250, 4867, 70731, 90, 63769, 25632, 502, 936, 100034, 242554, 25689, 4865, 71342, 4568, 23468, 4527, 5154, 2347, 10323, 111, 91, 147595, 53303, 83, 770, 19, 3642, 3249, 140992, 398, 64457, 29568, 3789...

[ 0.06207275390625, 0.2066650390625, 0.1593017578125, 0.026580810546875, 0.164306640625, 0.1746826171875, 0.177001953125, 0.23876953125, 0.18408203125, 0.048919677734375, 0.14208984375, 0.103515625, 0.16259765625, 0.0865478515625, 0.08544921875, 0.1917724609375, 0.1787109375, 0.10290...

embed

28662785_c0

28662785

prolog

0

Title: PROLOG: addOne predicate, what happens when temp. variable hits the base clause, how does Prolog call values? Problem title: PROLOG: addOne predicate, what happens when temp. variable hits the base clause, how does Prolog call values? Tags: prolog Problem: PROLOG: addOne predicate, what happens when temp. variab...

PROLOG: addOne predicate, what happens when temp. variable hits the base clause, how does Prolog call values? PROLOG: addOne predicate, what happens when temp. variable hits the base clause, how does Prolog call values? prolog PROLOG Call _G1196 _G1273 Exit _G1274 _G1279 _G1280 _G1285 _G1286 PROLOG: addOne predicate, w...

[ 0.033935546875, 0.0111083984375, 0.0013427734375, 0.0036468505859375, 0.0003757476806640625, 0.01531982421875, -0.007537841796875, -0.0115966796875, 0.02197265625, -0.011962890625, 0.0185546875, -0.007232666015625, -0.0146484375, 0.0242919921875, 0.0181884765625, -0.0169677734375, 0....

[ 10514, 47510, 15190, 62068, 1653, 2063, 67, 2367, 96276, 3229, 20805, 77336, 5962, 7, 3647, 70731, 13, 3642, 1250, 4867, 11782, 142424, 5, 502, 26265, 11648, 1530, 13574, 5443, 217, 16360, 22377, 4836, 12951, 15276, 100094, 31344, 18151, 51...

[ 0.154541015625, 0.224853515625, 0.1695556640625, 0.2230224609375, 0.1478271484375, 0.159423828125, 0.07373046875, 0.018280029296875, 0.115234375, 0.043792724609375, 0.1861572265625, 0.232421875, 0.146484375, 0.037200927734375, 0.190673828125, 0.1796875, 0.0736083984375, 0.069763183...

embed

42343042_c0

42343042

prolog

0

Title: Clausify Prolog Error Problem title: Clausify Prolog Error Tags: prolog Problem: Clausify Prolog Error I have a project in PROLOG to convert an FBF function to a CNF function, where fbf2cnf is the predicate to change the function. When I run this instruction: fbf2cnf(every(X, exist(Y, foo(Y, X))), F). ... it thr...

Clausify Prolog Error Clausify Prolog Error prolog Clausify Prolog Error fbf2cnf Type skf1 _G1758 Exception _G1558 _G1557 _G1567 FBF skolem_function exist_private Final NL2 CNFFBF valid_fbf fbf2cnf_private NFBF FBF2 CNF CNF1 CNF2 flatten_and Temp flatten_or not_counter Clausify Prolog Error I have a project in PROLOG t...

[ 0.0260009765625, 0.01287841796875, 0.0062255859375, 0.016845703125, -0.0140380859375, 0.005889892578125, -0.0019989013671875, 0.0014495849609375, 0.01513671875, -0.04248046875, 0.01318359375, -0.0103759765625, 0.00244140625, -0.0264892578125, 0.01806640625, -0.03271484375, -0.0092773...

[ 100700, 40383, 1250, 4867, 212059, 502, 108642, 420, 304, 27765, 60457, 11380, 418, 2489, 10057, 5443, 63928, 1837, 12243, 18197, 36718, 919, 18700, 39, 137175, 32316, 158559, 27188, 39102, 61658, 30110, 82350, 35604, 150598, 73493, 49878, 510,...

[ 0.2066650390625, 0.287109375, 0.177001953125, 0.239501953125, 0.1807861328125, 0.1199951171875, 0.0760498046875, 0.138427734375, 0.080322265625, 0.04986572265625, 0.09619140625, 0.050750732421875, 0.029876708984375, 0.04736328125, 0.166259765625, 0.01312255859375, 0.1583251953125, ...

embed

50254680_c0

50254680

prolog

0

Title: Prolog scheduling without pressing ';' every time Problem title: Prolog scheduling without pressing ';' every time Tags: prolog, prolog-setof Problem: Prolog scheduling without pressing ';' every time I have the following file with the predicate attends which symbolizes that every student att...

Prolog scheduling without pressing ';' every time Prolog scheduling without pressing ';' every time prolog prolog-setof Prolog c216 Week-1 List Number Prolog scheduling without pressing ';' every time I have the following file with the predicate attends which symbolizes that every student attends a ...

[ 0.0128173828125, -0.0201416015625, 0.0017547607421875, 0.017578125, -0.033935546875, 0.00872802734375, -0.0201416015625, -0.0162353515625, 0.0164794921875, -0.049560546875, -0.0072021484375, 0.009033203125, 0.01116943359375, -0.007598876953125, 0.0147705078125, 0.0020294189453125, -0...

[ 1250, 4867, 5094, 15246, 15490, 24234, 214, 11907, 1733, 502, 3509, 304, 2485, 58417, 5759, 32036, 103332, 2069, 74, 25632, 11435, 1653, 2063, 67, 29966, 128201, 9836, 15411, 10750, 26696, 7146, 154162, 3444, 28282, 137175, 601, 418, 12137, ...

[ 0.1669921875, 0.2374267578125, 0.11328125, 0.1474609375, 0.08148193359375, 0.175048828125, 0.001007080078125, 0.0723876953125, 0.12890625, 0.1207275390625, 0.00457763671875, 0.0626220703125, 0.1531982421875, 0.1319580078125, 0.090087890625, 0.1175537109375, 0.0994873046875, 0.01974...

embed

34730012_c0

34730012

prolog

0

Title: Counting within a list. Help me understand this code Problem title: Counting within a list. Help me understand this code Tags: prolog-dif, prolog Problem: Counting within a list. Help me understand this code I found a 3 year old question that helps me count the number of occurrences of variables within a list . ...

Counting within a list. Help me understand this code Counting within a list. Help me understand this code prolog-dif prolog Counting Help use_module List List1 Counting within a list. Help me understand this code I found a 3 year old question that helps me count the number of occurrences of variables within a list . Th...

[ 0.0247802734375, -0.00084686279296875, 0.005828857421875, 0.00311279296875, 0.00921630859375, 0.002166748046875, -0.00872802734375, -0.005218505859375, 0.02294921875, -0.0263671875, -0.01220703125, -0.032958984375, 0.014892578125, 0.0196533203125, 0.00616455078125, -0.007720947265625, ...

[ 1311, 128396, 28032, 5303, 39527, 28219, 18151, 502, 4867, 428, 420, 4527, 83279, 32036, 418, 10, 14037, 138, 6602, 9655, 112397, 54529, 14012, 74918, 42, 69098, 77336, 35166, 35064, 43240, 10422, 32562, 81732, 16188, 20537, 17932, 10750, 119...

[ 0.1475830078125, 0.2159423828125, 0.1983642578125, 0.2113037109375, 0.05975341796875, 0.111083984375, 0.13818359375, 0.1005859375, 0.179443359375, 0.05413818359375, 0.09503173828125, 0.07061767578125, 0.08843994140625, 0.1591796875, 0.0269927978515625, 0.004791259765625, 0.0421752929...

embed

32565418_c0

32565418

prolog

0

Title: Can you use clpfd to implement a coverage algorithm? Problem title: Can you use clpfd to implement a coverage algorithm? Tags: prolog, prolog-findall, clpfd, swi-prolog Problem: Can you use clpfd to implement a coverage algorithm? Positives =[ExampleA,ExampleB,ExampleC], Negatives = [ExampleD,ExampleE,ExampleQ],...

Can you use clpfd to implement a coverage algorithm? Can you use clpfd to implement a coverage algorithm? prolog prolog-findall clpfd swi-prolog Can c_s_mining Features Value ExampleA ExampleB ExampleC ExampleD ExampleE ExampleQ Positives Negatives inf..sup TP-FP Examples Number_covered Covers _G1 _G2 _G3 Can you use c...

[ -0.00518798828125, 0.00885009765625, 0.0140380859375, 0.016845703125, -0.0064697265625, -0.000469207763671875, 0.025390625, 0.00157928466796875, 0.0125732421875, -0.0174560546875, -0.023681640625, 0.00125885009765625, -0.00518798828125, 0.0179443359375, 0.02197265625, 0.01904296875, ...

[ 4171, 4527, 33139, 39557, 71, 29479, 154271, 234873, 502, 4867, 111607, 5584, 2452, 3454, 501, 454, 7, 266, 592, 106594, 190060, 89536, 571, 2737, 156060, 221717, 34128, 2037, 18303, 51006, 103332, 63127, 76417, 418, 304, 363, 3444, 7413, 5...

[ 0.0836181640625, 0.0992431640625, 0.1236572265625, 0.1619873046875, 0.2115478515625, 0.1202392578125, 0.2685546875, 0.23046875, 0.14453125, 0.2091064453125, 0.030364990234375, 0.09429931640625, 0.121826171875, 0.07623291015625, 0.045013427734375, 0.021942138671875, 0.059814453125, ...

embed

26827514_c0

26827514

prolog

0

Title: Prolog infinite loop issue Problem title: Prolog infinite loop issue Tags: failure-slice, prolog Problem: Prolog infinite loop issue I have the below functions. When I call it with final_filter([(2, 2)], R) , it prints a lot of "2 2" pairs. When I comment get_all_sums(S, _) it works fine, however if I test separ...

Prolog infinite loop issue Prolog infinite loop issue failure-slice prolog Prolog final_filter get_all_sums get_all_sums_R NR-IT NEXT_IT R_NEXT get_all_divisors TMP_RES get_all_products_R NEXT_R get_all_products R_LEFT single_element PRODUCTS Prolog infinite loop issue I have the below functions. When I call it with fi...

[ -0.01123046875, 0.002166748046875, 0.006561279296875, -0.005615234375, -0.015380859375, -0.01263427734375, -0.01287841796875, -0.00604248046875, 0.01025390625, -0.0242919921875, 0.040283203125, 0.0238037109375, 0.00335693359375, -0.01190185546875, 0.0184326171875, 0.015869140625, 0.0...

[ 1250, 4867, 54241, 13, 40956, 31089, 137578, 13348, 502, 2704, 120337, 2046, 5584, 7, 10321, 71641, 6371, 51858, 9088, 34465, 57877, 1052, 627, 25217, 62766, 183575, 35064, 32354, 11782, 54753, 4958, 28412, 5915, 304, 116, 80836, 6868, 294, ...

[ 0.160400390625, 0.2255859375, 0.1429443359375, 0.08837890625, 0.2091064453125, 0.13525390625, 0.134765625, 0.09136962890625, 0.081298828125, 0.13427734375, 0.189208984375, 0.06317138671875, 0.130615234375, 0.07958984375, 0.171142578125, 0.037689208984375, 0.05340576171875, 0.108642...

embed

15325878_c0

15325878

prolog

0

Title: Remove of the occurences of an element in a list containing lists in prolog Problem title: Remove of the occurences of an element in a list containing lists in prolog Tags: prolog Problem: Remove of the occurences of an element in a list containing lists in prolog I've been working with this for a while. I came ...

Remove of the occurences of an element in a list containing lists in prolog Remove of the occurences of an element in a list containing lists in prolog prolog Remove Lres is_list Call Fail _G1276 Exit Remove of the occurences of an element in a list containing lists in prolog I've been working with this for a while. I ...

[ 0.0033416748046875, 0.0211181640625, -0.0028076171875, 0.00299072265625, -0.0036773681640625, -0.000705718994140625, -0.0001888275146484375, -0.0002269744873046875, 0.01324462890625, -0.02978515625, 0.01513671875, 0.0238037109375, -0.0159912109375, -0.00860595703125, 0.01190185546875, ...

[ 181139, 111, 74918, 69098, 12830, 5303, 70541, 502, 4867, 23, 214, 339, 2109, 83, 6562, 26265, 190355, 11835, 5443, 20697, 29806, 222201, 125415, 87388, 756, 120155, 3956, 2856, 2174, 46132, 35412, 11782, 35782, 903, 3917, 15549, 34292, 77336...

[ 0.20458984375, 0.04534912109375, 0.195556640625, 0.1422119140625, 0.1845703125, 0.1966552734375, 0.1180419921875, 0.157470703125, 0.21240234375, 0.04278564453125, 0.027313232421875, 0.09649658203125, 0.22314453125, 0.090576171875, 0.20849609375, 0.117919921875, 0.1357421875, 0.1042...

embed

26790014_c0

26790014

prolog

0

Title: Family database prolog query Problem title: Family database prolog query Tags: logic, prolog Problem: Family database prolog query I am using the below family database to practice prolog. I want to... 'Find the first name and surname of mothers whose children’s combined incomes are greater than £140,000, where a...

Family database prolog query Family database prolog query logic prolog Family Fname Sname Income Children Person List Sum Rest pat_jr world_of_food bean_counters sell_cell ted_jr boat_house green_machine sparrow_hotel Family database prolog query I am using the below family database to practice prolog. I want to... 'Fi...

[ 0.025390625, -0.00159454345703125, -0.006011962890625, 0.006591796875, -0.0279541015625, 0.00006151199340820312, -0.010986328125, 0.00122833251953125, 0.00634765625, -0.0225830078125, 0.006103515625, 0.0034027099609375, -0.0281982421875, -0.01043701171875, 0.01385498046875, 0.001922607...

[ 59745, 63399, 502, 4867, 41, 1294, 62775, 563, 11627, 360, 45738, 91345, 15270, 32036, 36335, 49756, 2340, 8999, 4390, 49558, 186, 66, 71013, 74703, 34680, 3674, 42, 139098, 23923, 50997, 103149, 15555, 19815, 17368, 35064, 14449, 41361, 3444...

[ 0.166259765625, 0.215576171875, 0.1673583984375, 0.22119140625, 0.12353515625, 0.07861328125, 0.1546630859375, 0.000274658203125, 0.1591796875, 0.013763427734375, 0.1290283203125, 0.09942626953125, 0.044647216796875, 0.1075439453125, 0.1024169921875, 0.1011962890625, 0.04852294921875...

embed

64824792_c0

64824792

prolog

0

Title: finding a cycle path in prolog Problem title: finding a cycle path in prolog Tags: prolog, path-finding Problem: finding a cycle path in prolog atom_elements(h1,hydrogen,[c1]). atom_elements(n1,nitrogen,[o1, o2, c2]). atom_elements(o1,oxygen,[n1]). atom_elements(o2,oxygen,[n1]). atom_elements(n2,nitrogen,[o3, o4...

finding a cycle path in prolog finding a cycle path in prolog prolog path-finding atom_elements Out Start Output List Find Privious Visited finding a cycle path in prolog Example query on the 2,4,6-Trinitrotoluene: My first step is to find a cycle path and show as a List. But the result is shown as fault . It cannot sa...

[ 0.020263671875, 0.00159454345703125, -0.000148773193359375, 0.0299072265625, 0.0030517578125, -0.0032958984375, -0.01416015625, 0.001129150390625, 0.004425048828125, -0.042724609375, -0.0078125, 0.01324462890625, -0.010986328125, 0.014404296875, 0.024658203125, 0.03369140625, -0.0131...

[ 90791, 105823, 60875, 23, 502, 4867, 10, 111607, 34627, 62766, 13538, 13794, 7077, 32036, 26040, 2319, 10023, 98684, 89536, 41, 1294, 128191, 74257, 6773, 16210, 21201, 1151, 5117, 29954, 7413, 7639, 237, 16750, 127887, 193857, 53418, 30098, ...

[ 0.099365234375, 0.2169189453125, 0.2548828125, 0.035858154296875, 0.1395263671875, 0.2308349609375, 0.03619384765625, 0.0828857421875, 0.1668701171875, 0.1614990234375, 0.05535888671875, 0.06976318359375, 0.019744873046875, 0.12255859375, 0.055572509765625, 0.005889892578125, 0.07525...

embed

26119110_c1

26119110

prolog

1

,[],['200']), element(unit,[],[ml]),]), element(item,[],['pea']) ]) ] )] )] ), element('recipe',[],... )] )]). What I want to do is to look easily for recipes based on user input. The user might give an ingredient or part of the recipe name as input. Actually I ran throught the elements by ask_element(Name, Child, Pare...

[ -0.0081787109375, 0.0125732421875, 0.00946044921875, -0.00750732421875, 0.00946044921875, 0.0306396484375, -0.0157470703125, 0.003173828125, 0.0081787109375, -0.03857421875, 0.01806640625, 0.004669189453125, -0.0220947265625, 0.01397705078125, 0.01171875, -0.00799560546875, 0.0153198...

[ 5955, 12830, 309, 217, 7237, 195, 29518, 107, 115052, 3444, 6713, 72546, 100, 48564, 7, 35509, 38937, 107730, 13648, 8337, 186227, 2831, 9351, 237, 8305, 80854, 26458, 62766, 163612, 123829, 170918, 32786, 102656, 28636, 2517, 2356, 4163, 756...

[ 0.208984375, 0.1981201171875, 0.114501953125, 0.119384765625, 0.1439208984375, 0.072509765625, 0.219482421875, 0.00958251953125, 0.1944580078125, 0.0771484375, 0.163818359375, 0.15576171875, 0.1007080078125, 0.248291015625, 0.080322265625, 0.1290283203125, 0.1851806640625, 0.245483...

embed

66747101_c0

66747101

prolog

0

Title: Problem in generating verses of a poem in prolog Problem title: Problem in generating verses of a poem in prolog Tags: prolog Problem: Problem in generating verses of a poem in prolog Given a problem in Prolog, In a lost-world language, a poem can have any number of verses, each of which takes the following form...

Problem in generating verses of a poem in prolog Problem in generating verses of a poem in prolog prolog Problem Kura Y-1 Problem in generating verses of a poem in prolog Given a problem in Prolog, In a lost-world language, a poem can have any number of verses, each of which takes the following form: A B B C D E E C F ...

[ 0.017578125, 0.01318359375, -0.0194091796875, 0.00531005859375, -0.0113525390625, 0.0108642578125, -0.0166015625, -0.0020599365234375, 0.01031494140625, -0.0166015625, 0.01708984375, -0.01165771484375, 0.021728515625, -0.0031890869140625, 0.00738525390625, 0.0036163330078125, 0.01623...

[ 15649, 12663, 1916, 51389, 7, 111, 85745, 502, 4867, 23, 88810, 990, 5759, 2967, 1250, 72856, 32554, 46876, 10, 831, 765, 2499, 14012, 12638, 3173, 62, 335, 313, 5701, 31330, 33636, 119556, 34153, 142, 309, 11908, 56992, 166, 51, 1162, ...

[ 0.1544189453125, 0.192626953125, 0.0770263671875, 0.2396240234375, 0.0914306640625, 0.054046630859375, 0.221923828125, 0.159423828125, 0.2379150390625, 0.0687255859375, 0.203125, 0.1351318359375, 0.1378173828125, 0.138671875, 0.1488037109375, 0.1265869140625, 0.08953857421875, 0.13...

embed

9803795_c0

9803795

prolog

0

Title: Why does this prolog function in my belief base fail to execute in 2apl? Problem title: Why does this prolog function in my belief base fail to execute in 2apl? Tags: prolog, multi-agent Problem: Why does this prolog function in my belief base fail to execute in 2apl? I am writing a multi-agent system in 2APL. I...

Why does this prolog function in my belief base fail to execute in 2apl? Why does this prolog function in my belief base fail to execute in 2apl? prolog multi-agent Why Location Destination Amount PriceCorrection PrevOrders Price Afz Best Aant Bod Max Best-Afz Aantal Afzender Bestemming Prijs OudeMaat Bestemming-Afzend...

[ 0.0263671875, -0.001556396484375, 0.01025390625, 0.0206298828125, -0.0034942626953125, 0.021484375, -0.01239013671875, -0.0142822265625, 0.0181884765625, -0.0181884765625, 0.01556396484375, 0.026611328125, -0.004058837890625, -0.01361083984375, 0.02001953125, -0.00457763671875, 0.005...

[ 44084, 14602, 903, 502, 4867, 32354, 23, 759, 144239, 3647, 35782, 47, 71924, 116, 2424, 11, 6024, 83963, 90788, 145778, 121147, 48025, 50886, 107, 74717, 143045, 6121, 169, 11345, 1236, 80609, 9920, 69909, 1803, 3121, 147006, 2319, 164804, ...

[ 0.0938720703125, 0.025970458984375, 0.06805419921875, 0.1722412109375, 0.2464599609375, 0.1575927734375, 0.026153564453125, 0.0182952880859375, 0.1829833984375, 0.149658203125, 0.2279052734375, 0.039215087890625, 0.1646728515625, 0.140380859375, 0.16015625, 0.00225830078125, 0.111938...

embed

30676903_c0

30676903

prolog

0

Title: Wait the end of a predicate Prolog Problem title: Wait the end of a predicate Prolog Tags: predicate, wait, prolog Problem: Wait the end of a predicate Prolog I have a predicate list_moves(Move) , that gives all the possible moves for a game. Then I have the following predicates : find_best_move:- nb_setval(best...

Wait the end of a predicate Prolog Wait the end of a predicate Prolog predicate wait prolog Wait Prolog list_moves Move find_best_move nb_setval NewMove nb_getval OldMove get_best_move Wait the end of a predicate Prolog I have a predicate list_moves(Move) , that gives all the possible moves for a game. Then I have the ...

[ 0.0081787109375, 0.0096435546875, 0.011962890625, 0.005645751953125, -0.017333984375, 0.019287109375, 0.01397705078125, 0.002349853515625, 0.01409912109375, -0.05712890625, 0.0098876953125, 0.0299072265625, 0.00048828125, -0.00982666015625, 0.00872802734375, -0.0031890869140625, 0.00...

[ 175254, 3564, 111, 10, 1653, 2063, 1250, 4867, 40485, 502, 5303, 432, 135828, 7413, 32168, 275, 3509, 1405, 9083, 3794, 25074, 272, 2046, 3132, 76199, 7722, 25813, 6712, 3444, 4734, 1632, 11782, 2965, 2967, 71358, 3789, 12989, 167785, 34292...

[ 0.2371826171875, 0.1685791015625, 0.01898193359375, 0.001373291015625, 0.1468505859375, 0.19775390625, 0.1229248046875, 0.1888427734375, 0.2357177734375, 0.0882568359375, 0.1414794921875, 0.1318359375, 0.181640625, 0.0855712890625, 0.1544189453125, 0.0240478515625, 0.05633544921875, ...

embed

74130089_c0

74130089

prolog

0

Title: Why do I get multiple true and false and I don't get the Result of how many occurence in the list? Problem title: Why do I get multiple true and false and I don't get the Result of how many occurence in the list? Tags: prolog Problem: Why do I get multiple true and false and I don't get the Result of h...

Why do I get multiple true and false and I don't get the Result of how many occurence in the list? Why do I get multiple true and false and I don't get the Result of how many occurence in the list? prolog Why Result count_element Element List Counter Head Rest NewCounter Why do I get multiple true and false a...

[ 0.004119873046875, 0.005615234375, -0.005615234375, 0.0218505859375, 0.00347900390625, 0.005615234375, 0.00189971923828125, 0.0003185272216796875, 0.0252685546875, -0.0194091796875, -0.01470947265625, -0.0281982421875, 0.007171630859375, 0.0289306640625, 0.004241943359375, -0.006744384...

[ 44084, 2046, 48716, 29568, 136, 98320, 3768, 18, 126684, 3642, 5941, 74918, 6620, 5303, 54, 2301, 111, 502, 4867, 54529, 62766, 48325, 32036, 197956, 44816, 49756, 2356, 108210, 56, 87, 1284, 110, 69098, 49041, 50339 ]

[ 0.111572265625, 0.0853271484375, 0.227294921875, 0.2091064453125, 0.1148681640625, 0.232421875, 0.030548095703125, 0.1136474609375, 0.198974609375, 0.0391845703125, 0.0938720703125, 0.1488037109375, 0.0728759765625, 0.171630859375, 0.03765869140625, 0.07794189453125, 0.02642822265625...

embed

28482631_c0

28482631

prolog

0

Title: How to use SPARQL Filter query function in prolog query Problem title: How to use SPARQL Filter query function in prolog query Tags: sparql, allegrograph, prolog, rdf Problem: How to use SPARQL Filter query function in prolog query I want to query those persons from RDF graphdatabse who are traveled at the same ...

How to use SPARQL Filter query function in prolog query How to use SPARQL Filter query function in prolog query sparql allegrograph prolog rdf How SPARQL Filter SELECT DISTINCT fd1 td1 fd2 td2 WHERE ns:hasTravelledAt ns:hasLocation ns:fromDate ns:toDate How to use SPARQL Filter query function in prolog query I want to ...

[ 0.0091552734375, 0.009521484375, -0.0103759765625, 0.00469970703125, 0.0029449462890625, -0.0167236328125, -0.0093994140625, 0.00567626953125, 0.00927734375, -0.041748046875, -0.005096435546875, 0.02490234375, -0.005035400390625, -0.02587890625, 0.0057373046875, 0.006591796875, 0.009...

[ 11249, 4527, 159, 60436, 2737, 866, 128896, 41, 1294, 32354, 23, 502, 4867, 27148, 99247, 747, 8407, 41382, 4216, 420, 6755, 144832, 54390, 1238, 71, 418, 304, 1779, 10557, 201142, 6259, 28848, 15363, 161063, 86291, 188, 3444, 8382, 3445, ...

[ 0.056854248046875, 0.1309814453125, 0.036224365234375, 0.1663818359375, 0.182861328125, 0.158935546875, 0.288818359375, 0.1395263671875, 0.1201171875, 0.1607666015625, 0.0225982666015625, 0.1474609375, 0.20703125, 0.1434326171875, 0.2425537109375, 0.07464599609375, 0.1143798828125, ...

embed

61101139_c0

61101139

prolog

0

Title: Recursion problem in Prolog - getting False instead of True when going out of recursion Problem title: Recursion problem in Prolog - getting False instead of True when going out of recursion Tags: prolog, recursion Problem: Recursion problem in Prolog - getting False instead of True when going out of recursion I...

Recursion problem in Prolog - getting False instead of True when going out of recursion Recursion problem in Prolog - getting False instead of True when going out of recursion prolog recursion Recursion Prolog Finally List Recursion problem in Prolog - getting False instead of True when going out of recursion I am tryi...

[ -0.0086669921875, -0.0113525390625, 0.025634765625, 0.015380859375, -0.018798828125, 0.0091552734375, -0.002655029296875, 0.00872802734375, 0.0004482269287109375, -0.006561279296875, 0.032470703125, 0.0233154296875, -0.021728515625, -0.01422119140625, 0.0228271484375, 0.002273559570312...

[ 165428, 42, 6889, 2967, 1250, 4867, 20949, 22225, 184, 64457, 87599, 3229, 7730, 1810, 111, 195625, 1830, 502, 32036, 23, 8781, 1528, 28288, 2174, 1653, 2063, 67, 707, 86869, 107730, 959, 4488, 6528, 66211, 27781, 26785, 149842, 647, 1636, ...

[ 0.1717529296875, 0.1767578125, 0.12841796875, 0.1826171875, 0.1636962890625, 0.23095703125, 0.0714111328125, 0.200439453125, 0.165771484375, 0.1427001953125, 0.2274169921875, 0.04034423828125, 0.1004638671875, 0.1748046875, 0.0780029296875, 0.2191162109375, 0.10394287109375, 0.0915...

embed

31040079_c0

31040079

prolog

0

Title: One recursive algorithm better than the other, why? Problem title: One recursive algorithm better than the other, why? Tags: prolog, optimization, recursion Problem: One recursive algorithm better than the other, why? Here are two similar algorithms for last/2 . Why does last_element0/2 perform better than last_...

One recursive algorithm better than the other, why? One recursive algorithm better than the other, why? prolog optimization recursion One last_element0 last_element1 Last CPU Lips One recursive algorithm better than the other, why? Here are two similar algorithms for last/2 . Why does last_element0/2 perform better tha...

[ 0.00421142578125, 0.0205078125, 0.007598876953125, 0.007080078125, 0.004791259765625, -0.00799560546875, -0.0284423828125, -0.008056640625, 0.0079345703125, -0.007171630859375, 0.01495361328125, -0.0062255859375, -0.0003757476806640625, 0.005279541015625, 0.0286865234375, -0.0151367187...

[ 6561, 195625, 5844, 234873, 11522, 3501, 3789, 15400, 502, 4867, 87235, 4568, 62766, 2389, 418, 21672, 86039, 156903, 11853, 6626, 21373, 7, 12477, 44084, 14602, 51339, 118551, 4173, 18151, 39555, 5299, 1284, 959, 237, 27650, 104250, 10, 1772...

[ 0.1180419921875, 0.2249755859375, 0.143798828125, 0.265869140625, 0.19970703125, 0.04833984375, 0.06414794921875, 0.1201171875, 0.1103515625, 0.1776123046875, 0.1473388671875, 0.2137451171875, 0.2066650390625, 0.1075439453125, 0.000701904296875, 0.157470703125, 0.1822509765625, 0.1...

embed

67854824_c0

67854824

prolog

0

Title: Why is exporting fixity declarations a "bad idea"? Problem title: Why is exporting fixity declarations a "bad idea"? Tags: sml, prolog, haskell, infix-notation Problem: Why is exporting fixity declarations a "bad idea"? According to David MacQueen in his Reflections on Standard ML report 1 , ...

Why is exporting fixity declarations a "bad idea"? Why is exporting fixity declarations a "bad idea"? sml prolog haskell infix-notation Why Why is exporting fixity declarations a "bad idea"? According to David MacQueen in his Reflections on Standard ML report 1 , Now I do agree with him on the claim...

[ 0.029541015625, 0.0013275146484375, 0.0089111328125, 0.006805419921875, 0.0072021484375, 0.006256103515625, 0.006195068359375, -0.00640869140625, 0.0035400390625, 0.0247802734375, 0.0169677734375, -0.010498046875, -0.00099945068359375, 0.02294921875, 0.0191650390625, 0.010986328125, ...

[ 44084, 31255, 214, 30022, 2481, 21635, 5256, 12283, 6528, 7237, 502, 4867, 1556, 142508, 23, 55923, 157, 6765, 4727, 41732, 33, 53295, 8996, 20744, 39456, 13416, 53520, 63043, 14375, 191, 44679, 42, 6494, 89159, 76242, 38937, 5983, 39933, 4...

[ 0.09381103515625, 0.269287109375, 0.09716796875, 0.2392578125, 0.1380615234375, 0.2078857421875, 0.1009521484375, 0.1513671875, 0.1439208984375, 0.100830078125, 0.08056640625, 0.1827392578125, 0.0833740234375, 0.212158203125, 0.118408203125, 0.205810546875, 0.1361083984375, 0.09625...

embed

56061112_c0

56061112

prolog

0

Title: Modules exporting identical predicates in Prolog Problem title: Modules exporting identical predicates in Prolog Tags: prolog, swi-prolog Problem: Modules exporting identical predicates in Prolog I have a (large) number of Prolog files each of which contains a uniquely named module. All modules export the same s...

Modules exporting identical predicates in Prolog Modules exporting identical predicates in Prolog prolog swi-prolog Modules Prolog N-1 use_module Modules exporting identical predicates in Prolog I have a (large) number of Prolog files each of which contains a uniquely named module. All modules export the same set of pr...

[ 0.0101318359375, -0.0007476806640625, 0.01129150390625, 0.0101318359375, -0.009765625, -0.0002689361572265625, 0.019287109375, 0.002960205078125, 0.006927490234375, -0.034423828125, 0.0068359375, 0.01019287109375, -0.0001544952392578125, -0.0028076171875, 0.00762939453125, 0.0090332031...

[ 63014, 31255, 31943, 6827, 1653, 2063, 1636, 1250, 4867, 23, 502, 2452, 3454, 541, 5759, 4527, 83279, 14012, 102158, 36998, 88996, 5701, 5423, 1884, 1614, 3509, 5201, 159, 38969, 10752, 20187, 27781, 69307, 876, 149766, 61924, 1238, 12477, ...

[ 0.2152099609375, 0.231201171875, 0.1763916015625, 0.107177734375, 0.183349609375, 0.2047119140625, 0.0755615234375, 0.1685791015625, 0.2322998046875, 0.0170440673828125, 0.1090087890625, 0.1396484375, 0.06695556640625, 0.0232086181640625, 0.0870361328125, 0.1051025390625, 0.095581054...

embed

51218876_c0

51218876

prolog

0

Title: How can I avoid nontermination with an integer base case? Problem title: How can I avoid nontermination with an integer base case? Tags: prolog, failure-slice Problem: How can I avoid nontermination with an integer base case? I want to write a predicate that recurses until 0, but it consistently fails to termina...

How can I avoid nontermination with an integer base case? How can I avoid nontermination with an integer base case? prolog failure-slice How test.pl NewY use_module int_int_prod Num1 Num2 Result NewNum2 NewResult How can I avoid nontermination with an integer base case? I want to write a predicate that recurses until 0...

[ -0.004638671875, 0.01220703125, 0.01104736328125, 0.00012063980102539062, -0.0220947265625, 0.000553131103515625, 0.00927734375, -0.00555419921875, 0.0203857421875, -0.004058837890625, 0.01239013671875, 0.005279541015625, -0.0162353515625, 0.00897216796875, 0.023681640625, 0.0009994506...

[ 11249, 831, 71864, 351, 720, 91407, 678, 892, 1505, 3647, 7225, 502, 4867, 137578, 13348, 3034, 2424, 2356, 1723, 4527, 83279, 23, 18, 4288, 112348, 52782, 418, 304, 126684, 316, 7, 7136, 3444, 33022, 1653, 2063, 195625, 24189, 757, 74729...

[ 0.041656494140625, 0.06170654296875, 0.25732421875, 0.1663818359375, 0.2108154296875, 0.1802978515625, 0.098388671875, 0.1229248046875, 0.09075927734375, 0.2127685546875, 0.198486328125, 0.08795166015625, 0.1365966796875, 0.179931640625, 0.1226806640625, 0.1983642578125, 0.1369628906...

embed

20033623_c0

20033623

prolog

0

Title: Fluents of more than one goal in prolog Problem title: Fluents of more than one goal in prolog Tags: infinite-loop, prolog Problem: Fluents of more than one goal in prolog This is a block world problem which is going to move the blocks where we want them to be. The predicate located_on tells us the locations of ...

Fluents of more than one goal in prolog Fluents of more than one goal in prolog infinite-loop prolog Fluents located_on goal_state Successor Goal area2 _G4037 _G4036 _G4040 _G4039 _G4043 _G4042 _G4046 _G4045 _G4049 _G344 _G343 _G347 _G346 _G350 _G349 _G353 _G352 _G356 _G355 _G359 Initial initial_state area1 Poss area3 ...

[ -0.0059814453125, 0.004638671875, -0.00836181640625, 0.0159912109375, -0.005462646484375, -0.0224609375, -0.002197265625, -0.0026702880859375, 0.0031280517578125, -0.034912109375, 0.00164794921875, 0.01458740234375, 0.000701904296875, -0.01214599609375, 0.0074462890625, 0.0027770996093...

[ 36157, 35066, 1286, 3501, 1632, 69236, 502, 4867, 54241, 13, 28354, 105866, 191, 61340, 144053, 748, 2016, 289, 16128, 304, 2839, 10945, 8659, 9323, 11548, 9271, 4633, 12977, 132993, 10289, 125450, 45160, 117760, 127875, 5843, 129971, 104043, ...

[ 0.24072265625, 0.1929931640625, 0.146240234375, 0.1160888671875, 0.12109375, 0.250244140625, 0.182861328125, 0.219970703125, 0.1534423828125, 0.050201416015625, 0.191162109375, 0.2327880859375, 0.23681640625, 0.1500244140625, 0.17236328125, 0.0828857421875, 0.1339111328125, 0.03881...

embed

64718517_c0

64718517

prolog

0

Title: Concatenate two lists with determined values in prolog Problem title: Concatenate two lists with determined values in prolog Tags: prolog Problem: Concatenate two lists with determined values in prolog So I just tried Prolog and here, I wanted to try making my own concatenate function, that combines two lists (F...

Concatenate two lists with determined values in prolog Concatenate two lists with determined values in prolog prolog Concatenate These Element Result Queue Head Tail Tail2 FList SList Y-1 X-1 Query Concatenate two lists with determined values in prolog So I just tried Prolog and here, I wanted to try making my own conc...

[ 0.0299072265625, 0.00677490234375, -0.004180908203125, 0.01470947265625, -0.01055908203125, 0.0205078125, -0.0034942626953125, 0.0145263671875, 0.0087890625, -0.0203857421875, 0.01129150390625, -0.01287841796875, -0.02685546875, -0.0096435546875, 0.01251220703125, -0.0137939453125, 0...

[ 1657, 33478, 76, 67, 6626, 5303, 7, 678, 83324, 71, 142424, 502, 4867, 32255, 48325, 126684, 5813, 44816, 1218, 304, 63674, 1419, 154663, 990, 5759, 1193, 58836, 37842, 1250, 9790, 20662, 10002, 158, 32354, 70163, 207263, 32036, 5117, 80854...

[ 0.115966796875, 0.2076416015625, 0.1585693359375, 0.1224365234375, 0.15771484375, 0.22998046875, 0.00732421875, 0.07305908203125, 0.177001953125, 0.088134765625, 0.14697265625, 0.15185546875, 0.226806640625, 0.05145263671875, 0.1580810546875, 0.10723876953125, 0.064453125, 0.060913...

embed

3800105_c0

3800105

prolog

0

Title: Prolog: Doubling the value of each element in a list of lists and returning a single list Problem title: Prolog: Doubling the value of each element in a list of lists and returning a single list Tags: prolog Problem: Prolog: Doubling the value of each element in a list of lists and returning a single list I need...

Prolog: Doubling the value of each element in a list of lists and returning a single list Prolog: Doubling the value of each element in a list of lists and returning a single list prolog Prolog Doubling Yes mega_append List m_a Prolog: Doubling the value of each element in a list of lists and returning a single list I ...

[ 0.005157470703125, 0.023681640625, 0.0140380859375, 0.003814697265625, 0.00994873046875, 0.03515625, -0.0140380859375, -0.00738525390625, 0.041259765625, -0.0037841796875, 0.01275634765625, -0.00799560546875, -0.00421142578125, -0.01019287109375, 0.0079345703125, -0.0025482177734375, ...

[ 1250, 4867, 40641, 79298, 34292, 12638, 12830, 5303, 30646, 11001, 502, 32635, 31534, 9007, 3611, 32036, 347, 454, 11, 23, 3871, 33022, 5423, 70731, 90, 5646, 892, 1505, 678, 756, 80854, 41929, 71, 1295, 42658, 39, 16610, 73342, 3642, 175...

[ 0.1810302734375, 0.2386474609375, 0.181640625, 0.1734619140625, 0.1976318359375, 0.08544921875, 0.183837890625, 0.2039794921875, 0.1666259765625, 0.1907958984375, 0.1337890625, 0.1451416015625, 0.1627197265625, 0.152099609375, 0.201171875, 0.2022705078125, 0.050567626953125, 0.0892...

embed

47621388_c0

47621388

prolog

0

Title: Prolog: Checking if the first and last character of a string are left and right squiggly brackets('{' & '}') Problem title: Prolog: Checking if the first and last character of a string are left and right squiggly brackets('{' & '}') Tags: string, prolog, equality P...

Prolog: Checking if the first and last character of a string are left and right squiggly brackets('{' & '}') Prolog: Checking if the first and last character of a string are left and right squiggly brackets('{' & '}') string prolog equality Prolog Checking start_left_squi...

[ -0.0084228515625, 0.0037841796875, -0.00653076171875, 0.007415771484375, -0.0166015625, 0.01806640625, -0.00653076171875, 0.00262451171875, 0.01318359375, 0.0120849609375, 0.017822265625, 0.01055908203125, -0.01177978515625, -0.00994873046875, 0.01312255859375, 0.001434326171875, -0....

[ 1250, 4867, 38679, 214, 2174, 5117, 136, 4568, 62816, 79315, 621, 25737, 7108, 91, 3181, 9815, 538, 1620, 27853, 7, 3768, 502, 161789, 4034, 133, 2480, 129384, 105451, 9254, 3564, 54969, 13485, 71, 21672, 619, 3525, 3714, 2452, 2424, 3896...

[ 0.142822265625, 0.1981201171875, 0.1793212890625, 0.0196533203125, 0.06597900390625, 0.1077880859375, 0.10308837890625, 0.1805419921875, 0.1796875, 0.235595703125, 0.0150604248046875, 0.173095703125, 0.1329345703125, 0.032989501953125, 0.1573486328125, 0.1593017578125, 0.12890625, ...

embed

60809926_c1

60809926

prolog

1

) % Function that tests if A is to the right of B (will be used in the final question) right(A, B, List) :- nextto(B, A, List). % The Brit lives in the red house hint1([(brit, red, _, _, _)|_]) . hint1([_|T]) :- hint1(T) . % The Swede keeps dogs as pets hint2([(swede, _, _, _, dog)|_]) . hint2([_|T]) :- hint2(T) . % Th...

[ -0.0084228515625, -0.01300048828125, 0.03662109375, 0.032470703125, 0.01019287109375, 0.00262451171875, -0.0262451171875, 0.0208740234375, 0.0038604736328125, -0.016845703125, -0.005889892578125, 0.005706787109375, -0.00408935546875, 0.01116943359375, -0.00640869140625, 0.016357421875,...

[ 1388, 1745, 28670, 10763, 450, 109921, 2174, 62, 83, 47, 70, 7108, 111, 335, 110641, 11814, 23, 2704, 9655, 16, 284, 32036, 15772, 11737, 188, 571, 194, 581, 21689, 60742, 4842, 18276, 5122, 18, 418, 80971, 618, 74412, 112, 13695, 7, ...

[ 0.05889892578125, 0.1668701171875, 0.2138671875, 0.1846923828125, 0.086181640625, 0.26220703125, 0.142333984375, 0.08599853515625, 0.1148681640625, 0.195068359375, 0.100830078125, 0.218505859375, 0.197998046875, 0.134521484375, 0.03173828125, 0.140625, 0.1070556640625, 0.1778564453...

embed

61210286_c0

61210286

prolog

0

Title: How to formulate an exception for findall/3 correctly? Problem title: How to formulate an exception for findall/3 correctly? Tags: prolog-findall, prolog Problem: How to formulate an exception for findall/3 correctly? I have startet to learn Prolog and I want to get a list of opponents of players with findall/3....

How to formulate an exception for findall/3 correctly? How to formulate an exception for findall/3 correctly? prolog-findall prolog the How Only OpponentList How to formulate an exception for findall/3 correctly? I have startet to learn Prolog and I want to get a list of opponents of players with findall/3. In the Gene...

[ 0.0047607421875, 0.007110595703125, 0.011474609375, -0.00286865234375, 0.0225830078125, 0.0027313232421875, 0.0020904541015625, 0.01611328125, 0.006072998046875, -0.00164031982421875, -0.0019683837890625, -0.0159912109375, -0.00142669677734375, 0.00830078125, 0.002197265625, -0.0011291...

[ 11249, 26168, 67, 142, 131527, 100, 7413, 5584, 18113, 26785, 502, 4867, 111607, 87293, 2331, 54137, 154663, 1250, 5303, 233, 92865, 9082, 47691, 15190, 4734, 20653, 40494, 58585, 68034, 108, 125682, 137578, 23755, 84751, 158839, 132283 ]

[ 0.045379638671875, 0.18896484375, 0.060272216796875, 0.0305633544921875, 0.2481689453125, 0.0240936279296875, 0.1474609375, 0.1756591796875, 0.19677734375, 0.0938720703125, 0.057037353515625, 0.134521484375, 0.0947265625, 0.1431884765625, 0.1319580078125, 0.2078857421875, 0.119262695...

embed

16970790_c1

16970790

prolog

1

XX) , insert_at(L,XX,K,L1) , my_flatten(L1,R). get_num_spaces(L,N,X):-sum(L,S), X is N-S. generate_spaces(N,L,X):- insert_at_mul(L,'',1,X,N). vecLine2BitLineAux([],[],_,_,_). vecLine2BitLineAux([X|Tail1],[Y|Tail2],N,L,Lnew):- insert_at_mul(L,'*',Y,Lnew,X) ,vecLine2BitLineAux(Tail1,Tail2,N,Lnew,R). // problem here!!! ve...

[ -0.023681640625, 0.007080078125, -0.01544189453125, 0.010498046875, 0.00543212890625, 0.02734375, -0.02001953125, -0.0235595703125, 0.007110595703125, -0.0181884765625, -0.006683349609375, 0.007568359375, -0.00008249282836914062, -0.024169921875, -0.00994873046875, 0.00921630859375, ...

[ 14214, 183540, 257, 866, 42918, 605, 17727, 759, 150632, 510, 418, 1052, 2046, 2606, 65421, 839, 1542, 11832, 294, 1193, 541, 9, 139392, 15458, 22834, 93232, 304, 571, 217, 6077, 9874, 1723, 54936, 35259, 379, 2967, 1564, 1511, 76362, 323...

[ 0.1375732421875, 0.23876953125, 0.135498046875, 0.07977294921875, 0.111572265625, 0.0623779296875, 0.048828125, 0.098388671875, 0.09063720703125, 0.145263671875, 0.04736328125, 0.04400634765625, 0.031097412109375, 0.1217041015625, 0.2242431640625, 0.06298828125, 0.09326171875, 0.15...

embed

47767711_c0

47767711

prolog

0

Title: Prolog predicate that will check if a list A is a list of the prefix sums of a list D Problem title: Prolog predicate that will check if a list A is a list of the prefix sums of a list D Tags: clpfd, list, prolog Problem: Prolog predicate that will check if a list A is a list of the prefix sums of a list D So I'...

Prolog predicate that will check if a list A is a list of the prefix sums of a list D Prolog predicate that will check if a list A is a list of the prefix sums of a list D clpfd list prolog Prolog TOTAL Prolog predicate that will check if a list A is a list of the prefix sums of a list D So I'm very new to prolog and h...

[ 0.0072021484375, 0.0078125, 0.00860595703125, 0.009765625, -0.0240478515625, 0.0023193359375, -0.015625, -0.0023345947265625, 0.01068115234375, -0.0064697265625, 0.00848388671875, -0.00110626220703125, 0.002349853515625, -0.00469970703125, 0.015869140625, 0.01324462890625, 0.00531005...

[ 1250, 4867, 1653, 2063, 67, 12765, 2174, 5303, 62, 83, 183114, 10554, 391, 39557, 71, 502, 9926, 30487, 33022, 40407, 2886, 892, 59121, 645, 3121, 12921, 48322, 25820, 82424, 208806, 43240, 5117, 142424, 12638, 105950, 17932, 12830, 26785, ...

[ 0.1708984375, 0.228271484375, 0.1527099609375, 0.1746826171875, 0.05609130859375, 0.19384765625, 0.085693359375, 0.1962890625, 0.112060546875, 0.051422119140625, 0.2264404296875, 0.1583251953125, 0.156982421875, 0.040924072265625, 0.060211181640625, 0.1173095703125, 0.07275390625, ...

embed

68618525_c0

68618525

prolog

0

Title: How to selectively run a goal in a clause Problem title: How to selectively run a goal in a clause Tags: nested-lists, prolog, list Problem: How to selectively run a goal in a clause I'm trying to generate some latex code with prolog. I'm generating nodes connected by edges with the world they belong to. My code...

How to selectively run a goal in a clause How to selectively run a goal in a clause nested-lists prolog list How print_valutations Stream Number_of_nodes Head Tail Number_of_nodes1 single_valutation Number_of_nodes-1 Node display_val FileName How to selectively run a goal in a clause I'm trying to generate some latex c...

[ -0.0042724609375, 0.01544189453125, 0.009521484375, 0.01251220703125, -0.025634765625, 0.01080322265625, -0.006500244140625, -0.0281982421875, 0.001617431640625, 0.000579833984375, -0.00408935546875, -0.017578125, -0.0084228515625, -0.017333984375, 0.00084686279296875, -0.0103759765625...

[ 11249, 47, 36849, 5844, 538, 11675, 69236, 23, 70731, 13, 10, 8512, 71, 6562, 502, 4867, 5303, 28412, 27494, 22062, 115061, 103332, 4390, 157, 44816, 1218, 988, 11001, 5759, 438, 112, 44116, 1405, 42724, 163612, 31577, 139392, 21, 24371, ...

[ 0.06231689453125, 0.0292510986328125, 0.191650390625, 0.167236328125, 0.0228271484375, 0.1883544921875, 0.273193359375, 0.1070556640625, 0.2186279296875, 0.118408203125, 0.0631103515625, 0.135498046875, 0.025665283203125, 0.1114501953125, 0.1080322265625, 0.1685791015625, 0.075500488...

embed

61644753_c0

61644753

prolog

0

Title: Printing a binary tree in Prolog based on a matrix Problem title: Printing a binary tree in Prolog based on a matrix Tags: binary-tree, prolog, matrix Problem: Printing a binary tree in Prolog based on a matrix I wanted to print a binary tree by making a matrix based on coordinates which will corresponding nodes...

Printing a binary tree in Prolog based on a matrix Printing a binary tree in Prolog based on a matrix binary-tree prolog matrix Printing Prolog Printing a binary tree in Prolog based on a matrix I wanted to print a binary tree by making a matrix based on coordinates which will corresponding nodes have in the tree. The ...

[ 0.029052734375, 0.016357421875, -0.00035858154296875, -0.01556396484375, 0.00543212890625, 0.01239013671875, -0.01312255859375, 0.0032196044921875, -0.01422119140625, -0.01031494140625, -0.0130615234375, -0.053466796875, -0.0103759765625, -0.0155029296875, 0.000576019287109375, 0.01171...

[ 39754, 2394, 6635, 53201, 1250, 4867, 35509, 50944, 425, 23, 62600, 502, 36663, 28412, 176866, 110, 40197, 25737, 40715, 7108, 117396, 33636, 45646, 91, 339, 157, 32845, 541, 391, 3564, 67229, 17324, 8781, 138, 54092, 27781, 112, 361, 10461...

[ 0.206787109375, 0.1851806640625, 0.1324462890625, 0.25048828125, 0.1439208984375, 0.2159423828125, 0.08441162109375, 0.1650390625, 0.0579833984375, 0.0216217041015625, 0.185791015625, 0.1129150390625, 0.041412353515625, 0.1890869140625, 0.144287109375, 0.06976318359375, 0.17199707031...

embed

77129393_c0

77129393

prolog

0

Title: Prolog: How do I make repeating print/input statements? Problem title: Prolog: How do I make repeating print/input statements? Tags: recursion, io, prolog Problem: Prolog: How do I make repeating print/input statements? I'm using SWISH Prolog to create a 'chatbot' that stops when the user writes "quit." So far t...

Prolog: How do I make repeating print/input statements? Prolog: How do I make repeating print/input statements? recursion io prolog Prolog How Goodbye Newx Prolog: How do I make repeating print/input statements? I'm using SWISH Prolog to create a 'chatbot' that stops when the user writes "quit." So far this is my code:...

[ -0.01324462890625, 0.00860595703125, -0.00933837890625, 0.0145263671875, -0.005523681640625, 0.0208740234375, 0.017333984375, -0.0157470703125, 0.0137939453125, -0.00970458984375, 0.0091552734375, -0.00921630859375, -0.021240234375, 0.0048828125, 0.023681640625, 0.016845703125, 0.024...

[ 1250, 4867, 11249, 3249, 119140, 214, 28412, 64, 73, 7077, 63805, 7, 87, 195625, 1830, 22995, 502, 18621, 1272, 2356, 425, 54, 17368, 61595, 79909, 28282, 21393, 9190, 7279, 3229, 38937, 33022, 3181, 18, 2060, 18151, 14847, 127877, 41206, ...

[ 0.1851806640625, 0.2431640625, 0.0982666015625, 0.1197509765625, 0.28857421875, 0.1693115234375, 0.225830078125, 0.09222412109375, 0.1171875, 0.1724853515625, 0.26123046875, 0.02276611328125, 0.045501708984375, 0.223876953125, 0.080322265625, 0.151611328125, 0.133056640625, 0.04394...

embed

54690229_c0

54690229

prolog

0

Title: How to backtrack over a NxN board in Prolog? Problem title: How to backtrack over a NxN board in Prolog? Tags: prolog Problem: How to backtrack over a NxN board in Prolog? I currently have to make some sort of Wumpus World implementation in SWI Prolog and give all possible paths over a board of size NxN , I have...

How to backtrack over a NxN board in Prolog? How to backtrack over a NxN board in Prolog? prolog How NxN Prolog Found GOLD How to backtrack over a NxN board in Prolog? I currently have to make some sort of Wumpus World implementation in SWI Prolog and give all possible paths over a board of size NxN , I have done sever...

[ 0.02099609375, 0.01708984375, 0.009521484375, 0.01153564453125, -0.0052490234375, 0.00634765625, 0.01324462890625, 0.00994873046875, 0.002349853515625, -0.0537109375, -0.002410888671875, 0.0137939453125, -0.012451171875, -0.008056640625, 0.0009307861328125, 0.0008697509765625, 0.0058...

[ 11249, 47, 4420, 125728, 645, 541, 425, 839, 45443, 23, 1250, 4867, 502, 215624, 213865, 601, 316, 7332, 6661, 208124, 159, 38969, 8337, 756, 7722, 60875, 13267, 57143, 26366, 86869, 66211, 2046, 23882, 70, 86761, 1556, 4034, 1295, 61475, ...

[ 0.1080322265625, 0.08660888671875, 0.1719970703125, 0.27001953125, 0.1805419921875, 0.0797119140625, 0.151611328125, 0.21923828125, 0.228515625, 0.0654296875, 0.1463623046875, 0.2271728515625, 0.07171630859375, 0.137451171875, 0.1966552734375, 0.011138916015625, 0.052093505859375, ...

embed

73871212_c0

73871212

prolog

0

Title: How to implement SKI combinators in Prolog? Problem title: How to implement SKI combinators in Prolog? Tags: prolog, lambda-calculus, combinators Problem: How to implement SKI combinators in Prolog? I want to implement SKI combinators in Prolog. There are just 3 simple rules: (I x) = x ((K x) y) = x (S x y z) = ...

How to implement SKI combinators in Prolog? How to implement SKI combinators in Prolog? prolog lambda-calculus combinators How SKI Prolog How to implement SKI combinators in Prolog? I want to implement SKI combinators in Prolog. There are just 3 simple rules: (I x) = x ((K x) y) = x (S x y z) = (x z (y z)) I came up wi...

[ 0.004547119140625, 0.029052734375, 0.01177978515625, -0.005645751953125, -0.0016326904296875, 0.009521484375, -0.00634765625, 0.0101318359375, 0.0034027099609375, -0.03076171875, 0.0223388671875, 0.00677490234375, -0.0224609375, 0.005126953125, 0.00653076171875, 0.00885009765625, 0.0...

[ 11249, 47, 29479, 39963, 22321, 22230, 23, 1250, 4867, 502, 6492, 85, 6827, 94739, 3444, 138, 8781, 91736, 568, 1022, 605, 113, 97, 1257, 18151, 25277, 43240, 116, 37348, 51776, 5792, 5045, 1733, 71924, 41, 4382, 7709, 51, 41274, 144570, ...

[ 0.09661865234375, 0.0281829833984375, 0.22802734375, 0.2978515625, 0.250244140625, 0.170166015625, 0.06097412109375, 0.172119140625, 0.259765625, 0.111328125, 0.116943359375, 0.08740234375, 0.1051025390625, 0.154052734375, 0.0322265625, 0.0947265625, 0.07196044921875, 0.162109375, ...

embed

67629429_c0

67629429

prolog

0

Title: Prolog comparing and returning true or false conditionally Problem title: Prolog comparing and returning true or false conditionally Tags: prolog Problem: Prolog comparing and returning true or false conditionally I am new to the prolog and trying to solve some problems. I have two lists for example List1 and Li...

Prolog comparing and returning true or false conditionally Prolog comparing and returning true or false conditionally prolog Prolog List1 List2 Factor1 B-L Factor2 R-B comp_lims Left Right Prolog comparing and returning true or false conditionally I am new to the prolog and trying to solve some problems. I have two lis...

[ -0.013671875, -0.00689697265625, 0.00396728515625, 0.0031280517578125, 0.0072021484375, 0.0322265625, 0.0096435546875, 0.00885009765625, 0.011962890625, 0.0213623046875, 0.0211181640625, 0.02685546875, 0.0205078125, 0.0003986358642578125, 0.00592041015625, -0.0030517578125, 0.0170898...

[ 1250, 4867, 37397, 30646, 29568, 707, 98320, 35431, 502, 32036, 304, 117969, 866, 571, 9969, 3141, 2480, 90911, 25958, 86869, 44402, 6626, 5303, 418, 12765, 2174, 653, 927, 12830, 17721, 37457, 19, 14012, 80836, 21748, 40407, 5701, 959, 387...

[ 0.1644287109375, 0.235107421875, 0.23681640625, 0.1771240234375, 0.2032470703125, 0.065185546875, 0.23193359375, 0.173095703125, 0.127197265625, 0.1309814453125, 0.1175537109375, 0.126708984375, 0.0263671875, 0.029815673828125, 0.134033203125, 0.1878662109375, 0.0299072265625, 0.08...

embed

37156243_c0

37156243

prolog

0

Title: Sorting a list of key-value-pairs according to preference facts? Problem title: Sorting a list of key-value-pairs according to preference facts? Tags: swi-prolog, sorting, prolog, predicate Problem: Sorting a list of key-value-pairs according to preference facts? I have this list (read from a file): [a-3,a-2,a-1...

Sorting a list of key-value-pairs according to preference facts? Sorting a list of key-value-pairs according to preference facts? swi-prolog sorting prolog predicate Sorting end_of_file c-3 a-3 b-3 b-2 a-2 X-I X-J Out b-1 _E1 _E2 Sorted a-1 c-2 c-1 Sorting a list of key-value-pairs according to preference facts? I have...

[ 0.012939453125, 0.003662109375, 0.00152587890625, -0.015625, -0.0194091796875, -0.01806640625, -0.0026092529296875, 0.000743865966796875, -0.000667572021484375, 0.0103759765625, 0.00970458984375, 0.04638671875, 0.006561279296875, -0.011962890625, -0.0003261566162109375, -0.008544921875...

[ 53666, 214, 5303, 22799, 27494, 109637, 59499, 47, 205537, 15824, 7, 91, 2452, 3454, 4867, 12096, 502, 1653, 2063, 3564, 4390, 29822, 501, 8316, 10, 876, 5428, 1193, 1375, 13538, 5759, 304, 39116, 11435, 275, 3611, 67, 30648, 4153, 4527, ...

[ 0.2340087890625, 0.0292205810546875, 0.1656494140625, 0.16552734375, 0.1693115234375, 0.209716796875, 0.1219482421875, 0.046173095703125, 0.283203125, 0.1920166015625, 0.054779052734375, 0.0369873046875, 0.1904296875, 0.1485595703125, 0.2001953125, 0.2025146484375, 0.169189453125, ...

embed

36119519_c0

36119519

prolog

0

Title: Prolog: remove integers from list Problem title: Prolog: remove integers from list Tags: recursion, prolog Problem: Prolog: remove integers from list I am trying to remove the integers from a list using recursion. I made this remove_integers predicate and can't figure out why it does not work. Obviously I am mis...

Prolog: remove integers from list Prolog: remove integers from list recursion prolog list Prolog remove_integers Call _G8188 Fail Redo Exit Prolog: remove integers from list I am trying to remove the integers from a list using recursion. I made this remove_integers predicate and can't figure out why it does not work. O...

[ -0.01116943359375, 0.0162353515625, -0.0037384033203125, 0.01434326171875, -0.01202392578125, 0.0186767578125, -0.005340576171875, 0.0087890625, -0.0157470703125, -0.0177001953125, 0.021240234375, -0.01019287109375, -0.0185546875, -0.0045166015625, 0.0208740234375, -0.0010986328125, ...

[ 1250, 4867, 87388, 892, 26255, 1295, 5303, 195625, 1830, 502, 6191, 26265, 1019, 112511, 190355, 6096, 31, 5443, 217, 31577, 1653, 2063, 26366, 15400, 14602, 959, 4488, 132283, 85590, 144851, 81814, 6635, 33342, 179459, 3584, 1299, 28219, 403...

[ 0.1796875, 0.24072265625, 0.1920166015625, 0.17236328125, 0.1588134765625, 0.12841796875, 0.193115234375, 0.201904296875, 0.09588623046875, 0.1134033203125, 0.187255859375, 0.0849609375, 0.016387939453125, 0.16162109375, 0.1689453125, 0.1192626953125, 0.1343994140625, 0.10827636718...

embed

24012317_c0

24012317

prolog

0

Title: Solving Einstein Riddle with SWI Prolog Problem title: Solving Einstein Riddle with SWI Prolog Tags: zebra-puzzle, prolog Problem: Solving Einstein Riddle with SWI Prolog So I tried solving another Einstein Puzzle by using tutorial that I learned myself from this site. But, I dont seem to get the answer. When I ...

Solving Einstein Riddle with SWI Prolog Solving Einstein Riddle with SWI Prolog zebra-puzzle prolog Solving Einstein Riddle SWI Prolog LikeViolet Couples _H1 _W1 _S1 _E1 _C1 _CL1 _B1 _BR1 _H2 _W2 _S2 _E2 _C2 _CL2 _B2 _BR2 _H3 _W3 _S3 _E3 _C3 _CL3 _B3 _BR3 _H4 _W4 _S4 _E4 _C4 _CL4 _B4 _BR4 _H5 _W5 _S5 _E5 _C5 _CL5 _B5 _...

[ 0.0157470703125, 0.0024566650390625, 0.0032501220703125, 0.022216796875, -0.01287841796875, 0.00653076171875, -0.03564453125, 0.01123046875, 0.013427734375, -0.038330078125, 0.00494384765625, 0.0001468658447265625, 0.000324249267578125, 0.01214599609375, 0.016357421875, 0.0184326171875...

[ 6678, 6496, 119225, 41231, 19298, 678, 159, 38969, 1250, 4867, 116232, 1766, 13894, 502, 18852, 6609, 31, 1974, 1311, 34, 99726, 841, 418, 101, 1456, 294, 647, 37486, 38101, 304, 441, 571, 363, 617, 758, 910, 966, 1019, 37842, 3115, 157...

[ 0.1358642578125, 0.08184814453125, 0.25439453125, 0.1507568359375, 0.1531982421875, 0.0819091796875, 0.09661865234375, 0.240234375, 0.1466064453125, 0.22314453125, 0.2081298828125, 0.0643310546875, 0.105712890625, 0.1259765625, 0.1986083984375, 0.19482421875, 0.157470703125, 0.2056...

embed

33386303_c0

33386303

prolog

0

Title: Issue with output in Prolog Problem title: Issue with output in Prolog Tags: prolog Problem: Issue with output in Prolog I recently wanted to experiment with Prolog to understand how the process of unification works so I wrote the following code to return the nth element from a list. getfromarray([X|_],1,X). get...

Issue with output in Prolog Issue with output in Prolog prolog Issue Prolog N-1 _G5129 _G5132 _G5136 Issue with output in Prolog I recently wanted to experiment with Prolog to understand how the process of unification works so I wrote the following code to return the nth element from a list. However, upon entering the ...

[ 0.0164794921875, 0.003143310546875, 0.013916015625, -0.007568359375, -0.01129150390625, -0.007598876953125, 0.0006256103515625, 0.0027313232421875, 0.00142669677734375, -0.0150146484375, 0.020263671875, -0.00811767578125, -0.00081634521484375, -0.02490234375, -0.002410888671875, -0.013...

[ 223317, 678, 140992, 1250, 4867, 502, 5759, 11703, 4235, 6460, 131281, 28007, 51, 41274, 54397, 18151, 30646, 653, 927, 12830, 5303, 22, 33558, 107730, 1528, 237, 2046, 161063, 19305, 284, 363, 647, 28219, 79986, 62, 1723, 47314, 40407, 272...

[ 0.1380615234375, 0.0948486328125, 0.254638671875, 0.1551513671875, 0.2489013671875, 0.09490966796875, 0.058319091796875, 0.0282440185546875, 0.1131591796875, 0.051849365234375, 0.030303955078125, 0.06817626953125, 0.1402587890625, 0.1318359375, 0.0963134765625, 0.09521484375, 0.17907...

embed

33636078_c0

33636078

prolog

0

Title: How can I prevent this Prolog code to give multiple duplicate answer? Problem title: How can I prevent this Prolog code to give multiple duplicate answer? Tags: clpfd, cryptarithmetic-puzzle, prolog Problem: How can I prevent this Prolog code to give multiple duplicate answer? I am learning Prolog. I am working ...

How can I prevent this Prolog code to give multiple duplicate answer? How can I prevent this Prolog code to give multiple duplicate answer? clpfd cryptarithmetic-puzzle prolog How Prolog Every Digit Leading Write i.e jobs1 solution1 puzzle1 Erg How can I prevent this Prolog code to give multiple duplicate answer? I am ...

[ -0.0157470703125, 0.01043701171875, 0.004852294921875, -0.00007963180541992188, -0.0177001953125, -0.00982666015625, -0.024658203125, 0.00482177734375, -0.0010833740234375, -0.04541015625, -0.025146484375, 0.01239013671875, 0.0189208984375, 0.031005859375, 0.007080078125, 0.01794433593...

[ 11249, 831, 56282, 903, 1250, 4867, 18151, 47, 8337, 48716, 171763, 67, 35166, 39557, 71, 136791, 8962, 1766, 13894, 133, 502, 87769, 51174, 18, 165507, 214, 18781, 74464, 418, 29806, 104192, 1004, 177, 52080, 20697, 95486, 21771, 181653, 2...

[ 0.058929443359375, 0.045806884765625, 0.2191162109375, 0.059783935546875, 0.1844482421875, 0.2235107421875, 0.17822265625, 0.0206146240234375, 0.060638427734375, 0.2059326171875, 0.2274169921875, 0.121826171875, 0.1846923828125, 0.047637939453125, 0.0750732421875, 0.0908203125, 0.040...

embed

79404579_c1

79404579

prolog

1

1], % Assign to slot 1. % Slot 2 select_two_students(S2_1, S2_2, _Remaining2), Slot2 = [S2_1-S2_2, S2_2-S2_1], % Assign to slot 2. % Slot 3 select_two_students(S3_1, S3_2, _Remaining3), Slot3 = [S3_1-S3_2, S3_2-S3_1], % Assign to slot 3. all_different([S1_1, S1_2, S2_1, S2_2, S3_1, S3_2]), % All students must be differ...

[ -0.01141357421875, 0.0162353515625, 0.00982666015625, 0.0203857421875, -0.0146484375, -0.00958251953125, -0.0244140625, -0.0230712890625, 0.0107421875, -0.00634765625, -0.00958251953125, 0.0206298828125, 0.0191650390625, 0.010009765625, -0.0089111328125, -0.0018310546875, 0.004821777...

[ 106, 1745, 1301, 31304, 47, 24897, 615, 69623, 116, 36849, 55547, 96610, 7, 294, 304, 115187, 159, 4332, 192, 14653, 10461, 18504, 787, 138, 363, 21320, 1031, 756, 238778, 418, 3164, 25921, 8110, 12921, 158, 2816, 4288, 12631, 617, 109339...

[ 0.081298828125, 0.1168212890625, 0.064697265625, 0.2183837890625, 0.053131103515625, 0.271484375, 0.048675537109375, 0.259765625, 0.1434326171875, 0.155029296875, 0.1392822265625, 0.2242431640625, 0.0731201171875, 0.0546875, 0.120361328125, 0.07781982421875, 0.0701904296875, 0.0073...

embed

65815657_c0

65815657

prolog

0

Title: I wrote a prolog code for my family tree. What's the problem with this code? Problem title: I wrote a prolog code for my family tree. What's the problem with this code? Tags: prolog Problem: I wrote a prolog code for my family tree. What's the problem with this code? /*facts*/ female(Sufia). female(Bil...

I wrote a prolog code for my family tree. What's the problem with this code? I wrote a prolog code for my family tree. What's the problem with this code? prolog What Sufia Bilkis Nasima Rabeya NWife Eva Rekha Shammi Shanta TWife NSWife Jui SHWife TSWife Anowar Shahidul Khazal Shafik Nahid Jahorul Naim Tanim R...

[ 0.033447265625, 0.000560760498046875, 0.000240325927734375, 0.00616455078125, -0.01153564453125, 0.01007080078125, -0.01495361328125, 0.005584716796875, -0.0164794921875, -0.03466796875, -0.00640869140625, -0.031982421875, -0.004669189453125, 0.0166015625, 0.0206298828125, 0.0053405761...

[ 87, 54397, 10, 502, 4867, 18151, 100, 759, 14449, 53201, 4865, 3768, 2967, 678, 903, 7, 70, 142830, 399, 10746, 9637, 84067, 192, 62171, 21082, 186620, 33632, 28120, 853, 11395, 68346, 266, 41115, 102, 541, 89023, 3314, 14, 1456, 11576, ...

[ 0.048309326171875, 0.165283203125, 0.0689697265625, 0.20361328125, 0.272705078125, 0.25537109375, 0.07586669921875, 0.06915283203125, 0.1064453125, 0.2491455078125, 0.0941162109375, 0.10687255859375, 0.2156982421875, 0.0975341796875, 0.0980224609375, 0.0059814453125, 0.01217651367187...

embed

47587290_c0

47587290

prolog

0

Title: How do I prevent this prolog code, that replaces elements in a list, from giving an additional output? Problem title: How do I prevent this prolog code, that replaces elements in a list, from giving an additional output? Tags: prolog, loops Problem: How do I prevent this prolog code, that replaces elements in a ...

How do I prevent this prolog code, that replaces elements in a list, from giving an additional output? How do I prevent this prolog code, that replaces elements in a list, from giving an additional output? prolog loops giving How I-1 Line Index NumElm Elm NLine BLine Index1 NumElm1 NumElm-1 How do I prevent this prolog...

[ -0.00970458984375, 0.00823974609375, 0.0074462890625, -0.00897216796875, -0.002105712890625, 0.00830078125, 0.000820159912109375, -0.0022125244140625, 0.0230712890625, 0.030029296875, 0.012451171875, 0.00201416015625, 0.005126953125, -0.026123046875, 0.010498046875, 0.018798828125, 0...

[ 11249, 54, 87, 56282, 903, 502, 4867, 18151, 91995, 7, 80854, 5303, 1295, 68772, 78301, 140992, 40956, 5759, 16777, 31471, 52782, 7623, 39, 540, 541, 93232, 418, 31089, 360, 7077, 60075, 13, 13538, 5120, 5868, 3293, 51776, 142424, 4331, 3...

[ 0.0791015625, 0.0125732421875, 0.06591796875, 0.2095947265625, 0.088134765625, 0.176025390625, 0.244140625, 0.1973876953125, 0.2220458984375, 0.020904541015625, 0.181884765625, 0.20361328125, 0.0673828125, 0.106201171875, 0.1229248046875, 0.1796875, 0.1865234375, 0.123291015625, ...

embed

54893794_c1

54893794

prolog

1

be the logic itself, but I think that I am having trouble grasping how arithmetic is used in prolog. Is there anything with the logic or the arithmetic that I am obviously not grasping? Edit: This is the code relevant to the issue. I had renamed the variables above for clarity and their original names were part of the...

[ -0.010009765625, -0.0004825592041015625, -0.0008544921875, 0.00494384765625, -0.014404296875, 0.0045166015625, -0.028564453125, 0.003173828125, 0.004730224609375, -0.00138092041015625, -0.006683349609375, 0.0079345703125, 0.00897216796875, -0.0087890625, 0.00080108642578125, 0.00610351...

[ 186, 62775, 68034, 5351, 19441, 63134, 27689, 10366, 3642, 187, 8962, 282, 9523, 83, 11814, 23, 502, 4867, 678, 171259, 959, 18151, 29191, 31089, 120514, 4806, 77336, 7, 36917, 17306, 7311, 123055, 29806, 1542, 1745, 97868, 5303, 79843, 129...

[ 0.132080078125, 0.22705078125, 0.1324462890625, 0.059356689453125, 0.0217742919921875, 0.116455078125, 0.1307373046875, 0.135986328125, 0.05938720703125, 0.0823974609375, 0.1842041015625, 0.1705322265625, 0.1611328125, 0.04962158203125, 0.170166015625, 0.05816650390625, 0.20349121093...

embed

10758749_c1

10758749

prolog

1

display the appropriate message as listed above. Am i gonna do it by writting one more predicate processGuess ? % This top-level predicate runs the game. It prints a % welcome message, picks a phrase, and calls getGuess. % Ans = Answer % AnsList = AnswerList hangman(CountFailed):- getPhrase(Ans), !, write('Welcome to ...

[ 0.0087890625, -0.004241943359375, 0.00616455078125, -0.0054931640625, 0.01513671875, 0.0113525390625, 0.01953125, -0.00836181640625, -0.00185394287109375, -0.0037689208984375, -0.0086669921875, -0.00909423828125, 0.0035858154296875, 0.0081787109375, -0.0003147125244140625, 0.03125, 0...

[ 44116, 95307, 26008, 145870, 36917, 132294, 54, 148, 2783, 1286, 1653, 2063, 67, 9433, 22769, 90, 7, 1745, 2663, 67919, 127877, 70, 6712, 28412, 81907, 39580, 113860, 11782, 2046, 893, 130373, 154663, 10756, 669, 108210, 17647, 14, 6259, 45...

[ 0.2362060546875, 0.2083740234375, 0.21484375, 0.0278472900390625, 0.034637451171875, 0.032135009765625, 0.0162506103515625, 0.013824462890625, 0.092529296875, 0.04437255859375, 0.1552734375, 0.2113037109375, 0.0966796875, 0.18310546875, 0.2237548828125, 0.2177734375, 0.17919921875, ...

embed

37083598_c1

37083598

prolog

1

_ = console::readChar(), console::clearOutput, console::close. do_animal():- find_animal, have_found(X),!,console::nl, console::write(" Your animal may be a(n) ",X,"."), console::nl, _ = console::readChar(), clear_facts. do_animal() :- console::nl,console::write(" Sorry , unable to determine the animal."), console::nl...

[ -0.00151824951171875, 0.019287109375, 0.00982666015625, 0.022216796875, -0.00046539306640625, 0.0098876953125, 0.019775390625, 0.01055908203125, 0.004791259765625, -0.01806640625, 0.0010833740234375, 0.005859375, -0.005157470703125, -0.0064697265625, 0.0269775390625, 0.002899169921875,...

[ 101, 2203, 130250, 12, 39116, 84068, 119488, 79858, 7077, 155648, 54, 161834, 7413, 765, 151645, 1542, 38, 40777, 13169, 434, 18781, 14804, 26249, 1543, 186, 10, 19, 34735, 114700, 90502, 51, 2886, 47, 83324, 70, 3249, 56851, 1723, 40041, ...

[ 0.1448974609375, 0.08721923828125, 0.2493896484375, 0.0277252197265625, 0.18212890625, 0.197998046875, 0.1722412109375, 0.087646484375, 0.059814453125, 0.1201171875, 0.103515625, 0.281005859375, 0.1771240234375, 0.1790771484375, 0.1708984375, 0.109130859375, 0.02288818359375, 0.147...

embed

64889439_c0

64889439

prolog

0

Title: Decoding raw bytes received by udp_receive with as( codes ) Problem title: Decoding raw bytes received by udp_receive with as( codes ) Tags: udp, prolog, ieee-754 Problem: Decoding raw bytes received by udp_receive with as( codes ) I'm trying to decode myself a list of raw bytes received by udp_received . Two qu...

Decoding raw bytes received by udp_receive with as( codes ) Decoding raw bytes received by udp_receive with as( codes ) udp prolog ieee-754 Decoding udp_receive udp_received Remaining Long Double Sign Fraction Exponent ExponentBias Exponent-ExponentBias IEEE RawBytes Remaining0 Remaining1 ieee-754 Decoding raw bytes re...

[ 0.01068115234375, 0.004913330078125, 0.00897216796875, 0.004608154296875, 0.00616455078125, 0.009033203125, -0.02734375, 0.005645751953125, 0.023193359375, 0.04296875, -0.00104522705078125, -0.03466796875, -0.0006866455078125, -0.0042724609375, 0.004547119140625, -0.00074005126953125, ...

[ 262, 587, 6238, 49649, 390, 1636, 75204, 1872, 254, 74105, 5844, 678, 237, 18151, 502, 4867, 7039, 188609, 192, 14407, 107172, 48838, 7868, 54137, 16882, 129969, 109997, 75358, 14653, 2389, 31577, 8, 40899, 35978, 5303, 4126, 32964, 17582, ...

[ 0.1473388671875, 0.17724609375, 0.0294342041015625, 0.186767578125, 0.1129150390625, 0.0838623046875, 0.129638671875, 0.1392822265625, 0.145751953125, 0.146728515625, 0.1495361328125, 0.05010986328125, 0.12451171875, 0.192626953125, 0.0777587890625, 0.149658203125, 0.08038330078125, ...

embed

27682160_c0

27682160

prolog

0

Title: Test that term is a list of distinct variables Problem title: Test that term is a list of distinct variables Tags: iso-prolog, prolog Problem: Test that term is a list of distinct variables What is the most compact and canonical way in ISO Prolog to test for a list of distinct variables? Let's call this meta-log...

Test that term is a list of distinct variables Test that term is a list of distinct variables iso-prolog prolog Test is_varset Test that term is a list of distinct variables What is the most compact and canonical way in ISO Prolog to test for a list of distinct variables? Let's call this meta-logical predicate is_varse...

[ 0.0224609375, -0.01611328125, -0.002960205078125, -0.015625, -0.0106201171875, -0.016845703125, -0.011962890625, 0.00872802734375, 0.01031494140625, -0.000732421875, 0.0172119140625, 0.0126953125, 0.0089111328125, 0.01043701171875, -0.01263427734375, 0.037109375, 0.017822265625, 0....

[ 8647, 450, 13579, 83, 5303, 111, 117781, 77336, 13882, 3454, 4867, 502, 1961, 3509, 10, 2684, 94928, 136, 74413, 3917, 17408, 1250, 47, 3034, 100, 11782, 23550, 137043, 1653, 2063, 67, 11583, 5608, 214493, 2174, 10750, 756, 12921, 11343, ...

[ 0.2352294921875, 0.143798828125, 0.23486328125, 0.1474609375, 0.203125, 0.026031494140625, 0.2049560546875, 0.255126953125, 0.1097412109375, 0.1002197265625, 0.2030029296875, 0.1065673828125, 0.188232421875, 0.2337646484375, 0.058074951171875, 0.0826416015625, 0.192626953125, 0.007...

embed