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
21507372_c0	21507372	prolog	0	Title: swi-prolog find all paths in grid Problem title: swi-prolog find all paths in grid Tags: list, prolog, grid Problem: swi-prolog find all paths in grid I need to build all possible paths between two given points in a grid like this [1,1][2,1][3,1][4,1][5,1] [1,2][2,2][3,2][4,2][5,2] [1,3][2,3][3,3][4,3][5,3] [1,4...	swi-prolog find all paths in grid swi-prolog find all paths in grid list prolog grid doesnt_contain build_paths Limit swi-prolog find all paths in grid I need to build all possible paths between two given points in a grid like this I have a utility thing (whatever that is) called doesnt_contain which checks if the elem...	[ 0.0017242431640625, 0.01904296875, -0.005340576171875, -0.015869140625, -0.005096435546875, 0.00482177734375, -0.0164794921875, 0.001800537109375, 0.01361083984375, -0.032958984375, 0.0302734375, 0.00811767578125, -0.00506591796875, 0.020263671875, 0.0162353515625, 0.01361083984375, ...	[ 91, 2452, 3454, 4867, 7413, 756, 60875, 7, 23, 120067, 5303, 502, 22027, 18, 98102, 73, 45367, 128405, 125177, 3871, 7722, 17721, 6626, 34475, 26847, 19537, 939, 13580, 12765, 12830, 21771, 71864, 40956, 4034, 6275, 11907, 29954, 3444, 738,...	[ 0.006866455078125, 0.1754150390625, 0.125244140625, 0.18017578125, 0.090576171875, 0.142822265625, 0.2264404296875, 0.0802001953125, 0.049957275390625, 0.225341796875, 0.130859375, 0.1058349609375, 0.10186767578125, 0.08154296875, 0.180419921875, 0.1129150390625, 0.11083984375, 0.1...	embed
64805348_c1	64805348	prolog	1	ative requirements in Prolog to measure the distance between a formal, declarative, executable specification and the Prolog code. My question The whole problem require a lot of clauses, I try to solve one by one. First, I need the predicate: "is the cabin has to stop at location #N?" I write the clause stopIsRequired w...	ative requirements in Prolog to measure the distance between a formal, declarative, executable specification and the Prolog code. My question The whole problem require a lot of clauses, I try to solve one by one. First, I need the predicate: "is the cabin has to stop at location #N?" I write the clause stopIsRequired w...	[ -0.005096435546875, 0.0026092529296875, 0.0201416015625, -0.00579833984375, 0.001617431640625, 0.0081787109375, -0.002197265625, -0.01226806640625, 0.01416015625, -0.0019989013671875, -0.000507354736328125, 0.02001953125, -0.0150146484375, -0.0262451171875, 0.02587890625, -0.0135498046...	[ 10, 4935, 96679, 23, 1250, 4867, 72350, 70, 62488, 17721, 23113, 21635, 71924, 2886, 29458, 2320, 136, 18151, 28271, 2967, 64209, 5915, 70731, 90, 9790, 86869, 3871, 1653, 2063, 164, 377, 7568, 1556, 47, 7279, 99, 31913, 839, 33022, 13, ...	[ 0.059356689453125, 0.2149658203125, 0.257080078125, 0.011932373046875, 0.1871337890625, 0.25390625, 0.200927734375, 0.049591064453125, 0.2413330078125, 0.1142578125, 0.18017578125, 0.1845703125, 0.162109375, 0.1407470703125, 0.203125, 0.0731201171875, 0.034515380859375, 0.188598632...	embed
76657855_c0	76657855	prolog	0	Title: Understanding the use of decrementation in Prolog predicate instead of incrementation? Problem title: Understanding the use of decrementation in Prolog predicate instead of incrementation? Tags: increment, list, logic, predicate, prolog Problem: Understanding the use of decrementation in Prolog predicate instead...	Understanding the use of decrementation in Prolog predicate instead of incrementation? Understanding the use of decrementation in Prolog predicate instead of incrementation? increment list logic predicate prolog Understanding Prolog sup_k Understanding the use of decrementation in Prolog predicate instead of incrementa...	[ 0.016357421875, 0.015380859375, 0.004730224609375, 0.00183868408203125, 0.006256103515625, 0.0027618408203125, 0.0113525390625, -0.006500244140625, 0.012939453125, -0.024658203125, 0.01324462890625, -0.01324462890625, -0.0086669921875, -0.0062255859375, 0.0033416748046875, 0.0013732910...	[ 9626, 144057, 4527, 8, 7612, 674, 2320, 1250, 4867, 1653, 2063, 67, 64457, 145322, 1363, 158661, 5303, 62775, 502, 15811, 454, 92, 56037, 28219, 77336, 50155, 17368, 63134, 27689, 23755, 179140, 87388, 472, 927, 12830, 1295, 18151, 18, 1540...	[ 0.0946044921875, 0.05126953125, 0.1077880859375, 0.186279296875, 0.22021484375, 0.1737060546875, 0.0736083984375, 0.1650390625, 0.2420654296875, 0.1636962890625, 0.19677734375, 0.065185546875, 0.1204833984375, 0.1954345703125, 0.05938720703125, 0.21435546875, 0.14892578125, 0.14147...	embed
70106530_c0	70106530	prolog	0	Title: Is there always an accumulator to replace append/3? [SOLVED] Problem title: Is there always an accumulator to replace append/3? [SOLVED] Tags: prolog Problem: Is there always an accumulator to replace append/3? [SOLVED] Can append/3 at the end of this code provable(F, P) :- prove([] > [F], P). % axiom prove(G > ...	Is there always an accumulator to replace append/3? [SOLVED] Is there always an accumulator to replace append/3? [SOLVED] prolog SOLVED select1 Is there always an accumulator to replace append/3? [SOLVED] Can append/3 at the end of this code be replaced by an accumulator? (This code is a part of leanseq.pl a A sequent ...	[ 0.005767822265625, 0.0201416015625, 0.004608154296875, 0.01092529296875, -0.0166015625, -0.0118408203125, -0.0191650390625, 0.0211181640625, 0.0211181640625, -0.04345703125, 0.03759765625, 0.01531982421875, -0.019775390625, 0.0025177001953125, 0.02734375, 0.0021820068359375, 0.015869...	[ 11343, 183278, 1290, 91995, 114689, 71, 18113, 156046, 131040, 2685, 142, 502, 4867, 78837, 36849, 4171, 3564, 18151, 95, 864, 2424, 26513, 44805, 814, 29479, 1250, 70504, 45152, 33, 144285, 44126, 64457, 219017, 165523 ]	[ 0.119384765625, 0.2403564453125, 0.212646484375, 0.150634765625, 0.1871337890625, 0.150390625, 0.23828125, 0.0528564453125, 0.026763916015625, 0.03363037109375, 0.0133056640625, 0.0784912109375, 0.179443359375, 0.06231689453125, 0.0938720703125, 0.056549072265625, 0.098388671875, 0...	embed
41203940_c0	41203940	prolog	0	Title: Prolog: Shortest Path for Knight Problem title: Prolog: Shortest Path for Knight Tags: combinatorics, shortest-path, prolog Problem: Prolog: Shortest Path for Knight Hi so before I get told that this question has been asked many times, I have looked through a bunch of questions but none of them relate to Prolog....	Prolog: Shortest Path for Knight Prolog: Shortest Path for Knight combinatorics shortest-path prolog Prolog Shortest Path Knight move1 up1 up2 down2 down1 N-1 Prolog: Shortest Path for Knight Hi so before I get told that this question has been asked many times, I have looked through a bunch of questions but none of the...	[ 0.00069427490234375, 0.006317138671875, 0.00921630859375, -0.0081787109375, 0.01348876953125, 0.015625, -0.0228271484375, 0.0050048828125, 0.0062255859375, -0.04541015625, -0.0086669921875, 0.001617431640625, -0.0079345703125, -0.0029296875, -0.003021240234375, -0.0084228515625, 0.00...	[ 1250, 4867, 12, 82990, 525, 108421, 100, 114996, 22321, 3826, 16610, 128405, 502, 25813, 1257, 304, 7565, 541, 5759, 19441, 34844, 31577, 7413, 60875, 17721, 6626, 26847, 290, 7, 45443, 18151, 183037, 10, 472, 54350, 2060, 4734, 5117, 9077,...	[ 0.14404296875, 0.246337890625, 0.00732421875, 0.1968994140625, 0.184814453125, 0.22705078125, 0.073974609375, 0.195556640625, 0.118408203125, 0.0789794921875, 0.2283935546875, 0.208984375, 0.1307373046875, 0.137451171875, 0.09478759765625, 0.006317138671875, 0.1092529296875, 0.0118...	embed
44680367_c0	44680367	prolog	0	Title: Prolog - an Aux predicate in a main predicate Problem title: Prolog - an Aux predicate in a main predicate Tags: predicate, prolog Problem: Prolog - an Aux predicate in a main predicate vecLine2BitLineAux([C \| Cs],[P \| Ps], N, LastP, LastC, BitLine) :- /* print(P), print(' '), print(C), print(' '), print(N), pri...	Prolog - an Aux predicate in a main predicate Prolog - an Aux predicate in a main predicate predicate prolog Prolog Aux vecLine2BitLineAux LastP LastC BitLine Res SpCnt fill_char Spaces Stars Tmp vecLine2BitLine CList P-1 Exception _L191 _G559 Prolog - an Aux predicate in a main predicate The main predicate should call...	[ -0.00677490234375, -0.0026702880859375, -0.0135498046875, 0.006683349609375, -0.01434326171875, 0.033203125, -0.003082275390625, 0.001495361328125, 0.01141357421875, -0.0133056640625, -0.005126953125, -0.0079345703125, 0.007659912109375, 0.00677490234375, 0.00750732421875, 0.0093383789...	[ 1250, 4867, 62, 6077, 1653, 2063, 67, 23, 5201, 502, 22834, 93232, 304, 21672, 683, 27774, 660, 26292, 9254, 43045, 96814, 2676, 154663, 436, 5759, 63928, 866, 2947, 418, 724, 160443, 5608, 11782, 678, 116, 78301, 171859, 110218, 136, 757...	[ 0.2000732421875, 0.29248046875, 0.10107421875, 0.2548828125, 0.174560546875, 0.2135009765625, 0.07623291015625, 0.0259246826171875, 0.1226806640625, 0.108154296875, 0.0889892578125, 0.141845703125, 0.038787841796875, 0.0745849609375, 0.079833984375, 0.0313720703125, 0.004302978515625...	embed
40453040_c0	40453040	prolog	0	Title: Prolog - Returning a List from a Recursive Predicate Problem title: Prolog - Returning a List from a Recursive Predicate Tags: list, prolog Problem: Prolog - Returning a List from a Recursive Predicate I am using GNU-Prolog, and I have the following code that finds the numbers less than X which are divisible by ...	Prolog - Returning a List from a Recursive Predicate Prolog - Returning a List from a Recursive Predicate list prolog a Prolog Returning List Recursive Predicate find_num check_list Head Tail determine_item List2 Prolog - Returning a List from a Recursive Predicate I am using GNU-Prolog, and I have the following code t...	[ -0.00848388671875, -0.006683349609375, 0.006439208984375, 0.0036468505859375, -0.0059814453125, 0.033447265625, -0.00860595703125, -0.00421142578125, 0.014892578125, -0.0234375, 0.01904296875, -0.0189208984375, -0.01422119140625, -0.0169677734375, 0.006805419921875, 0.023681640625, 0...	[ 1250, 4867, 173340, 32036, 1295, 853, 48650, 5844, 7145, 2063, 214, 5303, 502, 10, 7413, 2606, 12765, 6562, 44816, 1218, 379, 83324, 217, 195, 304, 17368, 165132, 10752, 25632, 18151, 101935, 40715, 3501, 1193, 3129, 99017, 390, 990, 66596,...	[ 0.187255859375, 0.25244140625, 0.2191162109375, 0.2303466796875, 0.1353759765625, 0.0977783203125, 0.204833984375, 0.1468505859375, 0.17578125, 0.1954345703125, 0.0543212890625, 0.196044921875, 0.13720703125, 0.028472900390625, 0.1407470703125, 0.157958984375, 0.13427734375, 0.1583...	embed
28610729_c0	28610729	prolog	0	Title: Prolog. How to output solution like Yes or No Problem title: Prolog. How to output solution like Yes or No Tags: visual-prolog, prolog Problem: Prolog. How to output solution like Yes or No I tried to solve the problem of a point belongs to the area. As a result, I need to get an answer: if a point belongs to th...	Prolog. How to output solution like Yes or No Prolog. How to output solution like Yes or No visual-prolog prolog Prolog How Yes Input PREDICATES CLAUSES GOAL Prolog. How to output solution like Yes or No I tried to solve the problem of a point belongs to the area. As a result, I need to get an answer: if a point belong...	[ -0.000946044921875, 0.02880859375, 0.00933837890625, 0.0106201171875, -0.029296875, 0.035888671875, -0.00144195556640625, -0.00135040283203125, -0.00811767578125, 0.0152587890625, 0.0084228515625, 0.00665283203125, -0.0225830078125, -0.0189208984375, 0.00860595703125, -0.00994873046875...	[ 1250, 4867, 11249, 47, 140992, 29806, 1884, 32635, 707, 438, 21176, 3454, 502, 360, 7077, 134366, 30941, 31273, 129636, 78441, 25052, 7842, 37842, 86869, 2967, 6275, 186, 10617, 7, 16128, 3871, 2046, 35166, 2174, 959, 1311, 43297, 30957, 38...	[ 0.173828125, 0.2396240234375, 0.06085205078125, 0.07855224609375, 0.218994140625, 0.2431640625, 0.1302490234375, 0.185546875, 0.1690673828125, 0.2080078125, 0.20068359375, 0.12158203125, 0.1265869140625, 0.0535888671875, 0.1026611328125, 0.170654296875, 0.1341552734375, 0.035217285...	embed
53623286_c0	53623286	prolog	0	Title: Generator is not working in prolog DCG. How do we change arguments in prolog function so that it starts working as a generator Problem title: Generator is not working in prolog DCG. How do we change arguments in prolog function so that it starts working as a generator Tags: arguments, dcg, parsing, prolog Proble...	Generator is not working in prolog DCG. How do we change arguments in prolog function so that it starts working as a generator Generator is not working in prolog DCG. How do we change arguments in prolog function so that it starts working as a generator arguments dcg parsing prolog Generator DCG How LAA Generator is no...	[ 0.004638671875, 0.006744384765625, -0.002410888671875, -0.00421142578125, 0.021728515625, 0.013427734375, -0.021728515625, -0.01953125, 0.0069580078125, -0.035888671875, -0.02099609375, 0.00909423828125, -0.0220947265625, -0.00567626953125, 0.0272216796875, -0.006439208984375, -0.004...	[ 222518, 959, 20697, 23, 502, 4867, 391, 56367, 11249, 15549, 10750, 32354, 4034, 237, 145823, 83, 104, 238, 177, 366, 3358, 284, 54, 642, 18151, 43240, 125296, 42, 4488, 2189, 17997 ]	[ 0.290771484375, 0.08685302734375, 0.146240234375, 0.0633544921875, 0.1185302734375, 0.2115478515625, 0.0838623046875, 0.166748046875, 0.02520751953125, 0.1773681640625, 0.22314453125, 0.1087646484375, 0.039093017578125, 0.06829833984375, 0.270263671875, 0.0189208984375, 0.01428222656...	embed
41006774_c0	41006774	prolog	0	Title: List indexes on a recursive program? Problem title: List indexes on a recursive program? Tags: prolog Problem: List indexes on a recursive program? I've been searching for something that might help me with my problem all over the internet but I haven't been able to make any progress. I'm new to logic programming...	List indexes on a recursive program? List indexes on a recursive program? prolog List List indexes on a recursive program? I've been searching for something that might help me with my problem all over the internet but I haven't been able to make any progress. I'm new to logic programming and English is not my first lan...	[ -0.002227783203125, 0.004119873046875, 0.00469970703125, 0.0037689208984375, -0.02197265625, 0.0159912109375, -0.01513671875, 0.0128173828125, 0.01226806640625, -0.02978515625, 0.01068115234375, -0.03857421875, -0.019775390625, 0.015380859375, 0.022705078125, -0.00116729736328125, 0....	[ 32036, 63262, 90, 98, 195625, 5844, 1528, 32, 502, 4867, 157318, 4358, 2967, 42658, 3525, 62775, 56037, 14941, 5117, 46876, 12524, 3444, 29479, 219428, 18113, 10750, 339, 418, 304, 5303, 436, 683, 711, 41925, 7225, 12921, 140909, 959, 80836...	[ 0.2318115234375, 0.23974609375, 0.1307373046875, 0.0799560546875, 0.2374267578125, 0.16796875, 0.1827392578125, 0.02447509765625, 0.1746826171875, 0.2261962890625, 0.0042724609375, 0.057891845703125, 0.068359375, 0.033721923828125, 0.022918701171875, 0.140380859375, 0.07861328125, ...	embed
14353053_c0	14353053	prolog	0	Title: How to process a POST request in SWI-Prolog? Problem title: How to process a POST request in SWI-Prolog? Tags: post, prolog, html, forms, swi-prolog Problem: How to process a POST request in SWI-Prolog? I have an HTML form like this one: <form action="test" method="post"> <input name="first_name" type="text"/> <...	How to process a POST request in SWI-Prolog? How to process a POST request in SWI-Prolog? post prolog html forms swi-prolog How POST SWI-Prolog first_name last_name Send use_module thread_httpd http_dispatch http_handler Port http_server Request http_read_data Data How to process a POST request in SWI-Prolog? I have an...	[ 0.00933837890625, 0.006683349609375, 0.00311279296875, 0.0034637451171875, -0.0107421875, 0.0108642578125, 0.0126953125, 0.01312255859375, -0.01483154296875, -0.05224609375, 0.0277099609375, 0.0027923583984375, -0.023193359375, 0.0019989013671875, 0.00732421875, 0.016845703125, 0.012...	[ 11249, 47, 9433, 10, 81903, 50336, 23, 159, 38969, 9, 10752, 4867, 1305, 502, 7693, 3173, 91, 2452, 3454, 5117, 11627, 4568, 24044, 4527, 83279, 86997, 5475, 1621, 74258, 13791, 39642, 75616, 39116, 10135, 11809, 19097, 1884, 2046, 142424, ...	[ 0.07342529296875, 0.031951904296875, 0.1763916015625, 0.0233306884765625, 0.2216796875, 0.230224609375, 0.037353515625, 0.08837890625, 0.25, 0.019805908203125, 0.155517578125, 0.2315673828125, 0.107666015625, 0.11962890625, 0.1097412109375, 0.17236328125, 0.03326416015625, 0.198486...	embed
62384379_c1	62384379	prolog	1	member(H, A), get_init_schedule_(Schedule). get_schedule(Schedule) :- init_schedule(Schedule), one_employee_per_shift(Schedule), no_consecutive_shifts(Schedule), no_shift_on_personal_holiday(Schedule). dif_assignment(assign(employee(_), shift(D, N)), assign(employee(_), shift(D2, N2))) :- D \== D2, N \== N2. alldiff([...	member(H, A), get_init_schedule_(Schedule). get_schedule(Schedule) :- init_schedule(Schedule), one_employee_per_shift(Schedule), no_consecutive_shifts(Schedule), no_shift_on_personal_holiday(Schedule). dif_assignment(assign(employee(_), shift(D, N)), assign(employee(_), shift(D2, N2))) :- D \== D2, N \== N2. alldiff([...	[ 0.0034027099609375, 0.008544921875, 0.007354736328125, 0.035888671875, -0.035888671875, -0.01239013671875, -0.0120849609375, -0.008056640625, 0.0037078857421875, -0.0096435546875, 0.0031890869140625, 0.007537841796875, 0.0009918212890625, 0.01251220703125, -0.00408935546875, 0.01129150...	[ 32786, 841, 62, 2046, 73, 217, 7560, 693, 133, 25452, 15246, 194, 15772, 23, 1632, 109308, 1033, 13, 1264, 3767, 2480, 110, 166643, 191, 52368, 69810, 5636, 45755, 162, 31304, 122925, 397, 541, 95486, 304, 391, 5442, 756, 152462, 16474, ...	[ 0.2159423828125, 0.0833740234375, 0.087646484375, 0.143798828125, 0.043975830078125, 0.1170654296875, 0.1832275390625, 0.1973876953125, 0.1600341796875, 0.1279296875, 0.2032470703125, 0.0165863037109375, 0.052001953125, 0.03961181640625, 0.110107421875, 0.1728515625, 0.10595703125, ...	embed
46999918_c0	46999918	prolog	0	Title: Twins in family database Problem title: Twins in family database Tags: prolog Problem: Twins in family database Here is my family database. But I am unable to find out twin babies from this database. I am given this question: Define the relation twins(Child1, Child2) to find twins in the family database. family(...	Twins in family database Twins in family database prolog Twins Twins in family database Here is my family database. But I am unable to find out twin babies from this database. I am given this question: Define the relation twins(Child1, Child2) to find twins in the family database. Any help will be appreciated.	[ 0.032958984375, -0.003082275390625, 0.031005859375, 0.009033203125, -0.00457763671875, 0.0169677734375, -0.00897216796875, 0.0108642578125, 0.01251220703125, -0.05029296875, -0.0089111328125, -0.0001983642578125, -0.023193359375, 0.006195068359375, -0.0098876953125, 0.006011962890625, ...	[ 92016, 7, 23, 14449, 63399, 502, 4867, 11853, 759, 51, 2886, 47, 7413, 1810, 138241, 61798, 90, 1295, 903, 34475, 9655, 262, 64552, 41911, 102656, 418, 4, 123829, 10461, 4358, 77947 ]	[ 0.283203125, 0.146728515625, 0.08636474609375, 0.125732421875, 0.2257080078125, 0.11376953125, 0.1591796875, 0.012939453125, 0.00860595703125, 0.0292510986328125, 0.090087890625, 0.025848388671875, 0.1392822265625, 0.0885009765625, 0.302978515625, 0.158203125, 0.08953857421875, 0.0...	embed
38136789_c1	38136789	prolog	1	open_output(X), % PROCEDURE FOR FILE EXCEPTION HANDLING statistics(cputime,Value). open_output(X) :- catch((open('C:\\myfolder\\outputfile.txt', read, Mf), read_file(Mf,X), close(Mf)), error(Err,Context), open_output_aux(Err,X)). % AUX PROCEDURE TO RECOVER % Write some code here % open_output_aux code matches the erro...	open_output(X), % PROCEDURE FOR FILE EXCEPTION HANDLING statistics(cputime,Value). open_output(X) :- catch((open('C:\\myfolder\\outputfile.txt', read, Mf), read_file(Mf,X), close(Mf)), error(Err,Context), open_output_aux(Err,X)). % AUX PROCEDURE TO RECOVER % Write some code here % open_output_aux code matches the erro...	[ 0.004852294921875, 0.00921630859375, 0.0032806396484375, -0.02685546875, -0.00164031982421875, -0.01483154296875, 0.021240234375, -0.0189208984375, -0.0084228515625, -0.005126953125, 0.0152587890625, 0.006927490234375, 0.00787353515625, -0.0281982421875, 0.037353515625, -0.006011962890...	[ 9803, 6056, 7077, 1542, 1745, 10514, 10854, 563, 52099, 29426, 136566, 116199, 45134, 80835, 1766, 6032, 856, 50770, 105556, 59636, 1176, 42822, 29822, 124326, 12301, 420, 20903, 18499, 18468, 22829, 10442, 62, 71609, 98166, 106105, 601, 18151,...	[ 0.1988525390625, 0.1981201171875, 0.17529296875, 0.1759033203125, 0.06829833984375, 0.04107666015625, 0.076904296875, 0.070068359375, 0.133056640625, 0.1246337890625, 0.1923828125, 0.1015625, 0.04498291015625, 0.145263671875, 0.0914306640625, 0.089599609375, 0.0281219482421875, 0.0...	embed
14095774_c0	14095774	prolog	0	Title: Reversible tree length relation Problem title: Reversible tree length relation Tags: successor-arithmetics, prolog, failure-slice, clpfd Problem: Reversible tree length relation I'm trying to write reversible relations in "pure" Prolog (no is , cut, or similar stuff. Yes it's homework), and I must admit I don't ...	Reversible tree length relation Reversible tree length relation successor-arithmetics prolog failure-slice clpfd Reversible List Tree tree_size tree_len Reversible tree length relation I'm trying to write reversible relations in "pure" Prolog (no is , cut, or similar stuff. Yes it's homework), and I must admit I don't ...	[ 0.01068115234375, 0.03515625, -0.004241943359375, 0.0203857421875, 0.007080078125, -0.0128173828125, -0.0179443359375, 0.0115966796875, 0.015380859375, -0.061279296875, -0.00775146484375, -0.0033111572265625, -0.0115966796875, 0.0174560546875, 0.03564453125, 0.002960205078125, 0.0183...	[ 853, 814, 55356, 53201, 140909, 41911, 39457, 42, 8962, 282, 502, 4867, 137578, 13348, 71, 32036, 101344, 62539, 1977, 31577, 33022, 39531, 91582, 4717, 1250, 157, 59226, 5368, 18244, 29786, 3642, 9433, 28282, 13580, 4028, 81944, 71723, 9393,...	[ 0.08380126953125, 0.1961669921875, 0.216796875, 0.209228515625, 0.175048828125, 0.2059326171875, 0.155029296875, 0.01129150390625, 0.0894775390625, 0.009796142578125, 0.0865478515625, 0.1998291015625, 0.18115234375, 0.09381103515625, 0.01007080078125, 0.1585693359375, 0.2158203125, ...	embed
47260334_c0	47260334	prolog	0	Title: Prolog facts of lists and a recursion predicate to accept permutations of lists Problem title: Prolog facts of lists and a recursion predicate to accept permutations of lists Tags: prolog, permutation, list Problem: Prolog facts of lists and a recursion predicate to accept permutations of lists I have facts that...	Prolog facts of lists and a recursion predicate to accept permutations of lists Prolog facts of lists and a recursion predicate to accept permutations of lists prolog permutation list Prolog List SortedList Sort Match Prolog facts of lists and a recursion predicate to accept permutations of lists I have facts that acce...	[ 0.01422119140625, 0.0147705078125, 0.0087890625, 0.01214599609375, -0.0152587890625, 0.0034637451171875, -0.0096435546875, 0.00689697265625, 0.00677490234375, -0.007568359375, 0.0162353515625, 0.0126953125, -0.0079345703125, 0.006072998046875, 0.005523681640625, 0.0087890625, 0.02209...	[ 1250, 4867, 15824, 111, 5303, 195625, 1830, 1653, 2063, 67, 26946, 117, 14311, 21094, 502, 561, 32036, 53666, 297, 154663, 67407, 17497, 1884, 2499, 22062, 68186, 12096, 107730, 14858, 26548, 86869, 2967, 9351, 959, 71, 5809, 5844, 17569, 6...	[ 0.171630859375, 0.2176513671875, 0.16748046875, 0.012176513671875, 0.1861572265625, 0.211669921875, 0.037841796875, 0.169189453125, 0.190185546875, 0.045196533203125, 0.1737060546875, 0.0828857421875, 0.1805419921875, 0.008270263671875, 0.1385498046875, 0.15869140625, 0.1375732421875...	embed
67606422_c0	67606422	prolog	0	Title: How do I use rule in another rule in prolog Problem title: How do I use rule in another rule in prolog Tags: prolog Problem: How do I use rule in another rule in prolog Here are my facts: object('Human'). object('Machine'). object('Robot'). object('Hunter'). object('WallE'). action('Kill'). action('Run'). rel1('...	How do I use rule in another rule in prolog How do I use rule in another rule in prolog prolog How Human Machine Robot Hunter WallE Kill Run rel1 rel2 provides_action provides_action2 provides_action3 How do I use rule in another rule in prolog Here are my facts: I'm trying to find the list of all object that implement...	[ -0.001800537109375, -0.0021514892578125, -0.00131988525390625, 0.0225830078125, -0.004150390625, 0.005157470703125, -0.03466796875, 0.01080322265625, 0.01348876953125, -0.059326171875, 0.00921630859375, -0.0167236328125, -0.0047607421875, -0.004180908203125, 0.0031890869140625, 0.00358...	[ 11249, 4527, 79986, 23, 15700, 502, 4867, 28076, 68311, 66349, 134327, 23706, 647, 104431, 28398, 7962, 87344, 44713, 363, 7413, 5303, 756, 36746, 29479, 22631, 11675, 903, 16750, 1193, 2203, 194659, 99326, 841, 29321, 12724, 9190, 198076, 33...	[ 0.07269287109375, 0.179931640625, 0.270751953125, 0.102783203125, 0.157470703125, 0.17138671875, 0.225830078125, 0.0445556640625, 0.04736328125, 0.14208984375, 0.1876220703125, 0.094482421875, 0.119873046875, 0.12841796875, 0.141845703125, 0.05035400390625, 0.119384765625, 0.084228...	embed
8330508_c0	8330508	prolog	0	Title: Result in an argument isn't correct Problem title: Result in an argument isn't correct Tags: prolog, recursion Problem: Result in an argument isn't correct So I have this piece of prolog code: my_avalia(A, R) :- A == "Koza" -> koza(R, 0, 0, e, 89). koza(R, _, _, _, 87) :- !, write(R). koza(R, X, Y, V, ...	Result in an argument isn't correct Result in an argument isn't correct prolog recursion Result my_avalia Koza Y-1 Result in an argument isn't correct So I have this piece of prolog code: The matter is that when I write the "R" at koza(), it has the correct values, however it ends up with a empty list in my_a...	[ -0.00634765625, -0.005767822265625, 0.005767822265625, 0.0296630859375, 0.00421142578125, 0.0093994140625, -0.0022125244140625, 0.0152587890625, 0.0216064453125, -0.005645751953125, 0.0279541015625, 0.005279541015625, -0.0020751953125, 0.02099609375, 0.0145263671875, -0.01544189453125,...	[ 126684, 23, 10750, 56112, 3768, 18, 26785, 142, 502, 4867, 195625, 1830, 759, 5528, 7884, 1204, 596, 990, 5759, 18151, 26866, 33022, 1052, 99, 298, 132, 1556, 142424, 3564, 201505, 5303, 11782, 1884, 12110, 13648, 214552, 44691, 32354, 1209...	[ 0.216796875, 0.0989990234375, 0.2491455078125, 0.0894775390625, 0.0672607421875, 0.10406494140625, 0.203125, 0.0246734619140625, 0.1322021484375, 0.1888427734375, 0.1934814453125, 0.09405517578125, 0.1341552734375, 0.159912109375, 0.1982421875, 0.099609375, 0.1953125, 0.07019042968...	embed
4119023_c0	4119023	prolog	0	Title: Non-trivial Prolog find and replace Problem title: Non-trivial Prolog find and replace Tags: prolog Problem: Non-trivial Prolog find and replace So we can easily find and replace an atom with another atom in Prolog by doing something like: replace([],A,B,[]). replace([H\|T],A,B,[B\|Result]) :- H=A, replace(T,A,B,R...	Non-trivial Prolog find and replace Non-trivial Prolog find and replace prolog Non-trivial Prolog Result Non-trivial Prolog find and replace So we can easily find and replace an atom with another atom in Prolog by doing something like: I'm sure there are other ways to do this too. However, I want to do something more c...	[ 0.0001659393310546875, 0.0181884765625, -0.00121307373046875, 0.0250244140625, -0.01263427734375, 0.0162353515625, -0.0155029296875, 0.004486083984375, 0.0133056640625, -0.0220947265625, 0.011474609375, 0.0048828125, -0.0072021484375, -0.02099609375, 0.02490234375, 0.0113525390625, 0...	[ 3775, 3996, 686, 1250, 4867, 7413, 136, 91995, 289, 502, 126684, 831, 72546, 34627, 678, 15700, 23, 1884, 48322, 54, 3444, 1286, 96704, 62775, 242122, 11249, 2806, 456, 133266, 158, 17043, 170, 425, 4, 53, 63805, 1660, 2704, 1284, 959, ...	[ 0.1163330078125, 0.05364990234375, 0.08837890625, 0.1597900390625, 0.2193603515625, 0.1644287109375, 0.1263427734375, 0.2030029296875, 0.03802490234375, 0.127197265625, 0.1270751953125, 0.03021240234375, 0.12841796875, 0.205810546875, 0.131591796875, 0.097412109375, 0.022018432617187...	embed
28751608_c0	28751608	prolog	0	Title: Is there an opposite of the "wildcard" operator to specifically not find specified items in Prolog? Problem title: Is there an opposite of the "wildcard" operator to specifically not find specified items in Prolog? Tags: prolog-dif, prolog Problem: Is there an opposite of the "wildcard" opera...	Is there an opposite of the "wildcard" operator to specifically not find specified items in Prolog? Is there an opposite of the "wildcard" operator to specifically not find specified items in Prolog? prolog-dif prolog Prolog goals_scored Is there an opposite of the "wildcard" operator to specificall...	[ 0.00194549560546875, -0.0084228515625, 0.0111083984375, 0.006622314453125, -0.0186767578125, 0.00946044921875, 0.010498046875, 0.014404296875, -0.00836181640625, -0.0027923583984375, 0.00933837890625, -0.01043701171875, 0.00872802734375, 0.0010223388671875, -0.0003032684326171875, 0.01...	[ 198274, 41123, 71, 38931, 39933, 183037, 959, 7413, 58735, 55769, 1250, 4867, 502, 428, 420, 109458, 12064, 2822, 23, 2967, 360, 831, 4527, 101, 1653, 2063, 113054, 80934, 32316, 27781, 36663, 756, 92865, 11301, 100, 142741, 30646, 33946, 4...	[ 0.1787109375, 0.1192626953125, 0.058746337890625, 0.2587890625, 0.2415771484375, 0.07275390625, 0.1270751953125, 0.156982421875, 0.1937255859375, 0.1553955078125, 0.1439208984375, 0.244873046875, 0.0738525390625, 0.015869140625, 0.0855712890625, 0.172607421875, 0.07891845703125, 0....	embed
20317450_c0	20317450	prolog	0	Title: Simple prolog program returns false too early Problem title: Simple prolog program returns false too early Tags: prolog Problem: Simple prolog program returns false too early It's been a while since I've programmed in Prolog. Today, I tried to make a simple program. It lists some facts of who belongs to the same...	Simple prolog program returns false too early Simple prolog program returns false too early prolog Simple Simple prolog program returns false too early It's been a while since I've programmed in Prolog. Today, I tried to make a simple program. It lists some facts of who belongs to the same family. If two people belong ...	[ 0.0169677734375, 0.003265380859375, 0.0059814453125, 0.002593994140625, -0.0211181640625, -0.0152587890625, -0.006591796875, 0.0057373046875, 0.0223388671875, -0.01202392578125, 0.0169677734375, 0.013916015625, -0.0172119140625, 0.01116943359375, 0.002288818359375, 0.006378173828125, ...	[ 60552, 502, 4867, 1528, 30646, 98320, 5792, 39395, 12960, 16792, 26693, 1250, 37842, 3249, 8781, 5303, 15824, 2750, 10617, 5701, 14449, 6626, 3395, 53418, 8337, 12638, 126340, 18466, 3444, 2046, 756, 19713, 3445, 136565, 22008, 107003, 41, 91...	[ 0.18701171875, 0.1419677734375, 0.2183837890625, 0.183349609375, 0.1795654296875, 0.2056884765625, 0.1102294921875, 0.1724853515625, 0.00872802734375, 0.00958251953125, 0.128173828125, 0.10986328125, 0.013214111328125, 0.012420654296875, 0.1162109375, 0.13525390625, 0.09466552734375,...	embed
43776669_c0	43776669	prolog	0	Title: Improving list generation over a range in Prolog Problem title: Improving list generation over a range in Prolog Tags: list, range, prolog, generator Problem: Improving list generation over a range in Prolog I'm fairly new to Prolog, and falling in love with it more and more. I'm wondering if this implementation...	Improving list generation over a range in Prolog Improving list generation over a range in Prolog list range prolog generator Improving Prolog End List range_ascend range_descend Start Step Rest Next Improving list generation over a range in Prolog I'm fairly new to Prolog, and falling in love with it more and more. I'...	[ -0.0130615234375, 0.0140380859375, 0.005401611328125, -0.01025390625, -0.00543212890625, 0.0059814453125, -0.010498046875, -0.002349853515625, 0.000888824462890625, 0.0018310546875, 0.0123291015625, 0.0152587890625, -0.0103759765625, -0.0034332275390625, 0.0216064453125, 0.002609252929...	[ 3370, 70628, 5303, 58093, 645, 37457, 1250, 4867, 502, 145823, 18878, 32036, 31146, 112, 13794, 50478, 49756, 4997, 23, 180663, 3525, 6817, 5161, 1286, 149016, 208124, 831, 53333, 4537, 52295, 54799, 49666, 9523, 18151 ]	[ 0.036895751953125, 0.1507568359375, 0.2174072265625, 0.198974609375, 0.11474609375, 0.1998291015625, 0.1541748046875, 0.2421875, 0.10003662109375, 0.209228515625, 0.07769775390625, 0.1490478515625, 0.10162353515625, 0.053863525390625, 0.07183837890625, 0.1300048828125, 0.132690429687...	embed
74561764_c1	74561764	prolog	1	element of the other sub-lists from the "appetizer" list. Fill the second sub-list with the second element of the first sub-list of "appetizer", then the third element of the next sub-lists in "appetizer", and so on and so forth. If the number doesn't match (eg. list length 10 but group size 3), I will simply have one...	element of the other sub-lists from the "appetizer" list. Fill the second sub-list with the second element of the first sub-list of "appetizer", then the third element of the next sub-lists in "appetizer", and so on and so forth. If the number doesn't match (eg. list length 10 but group size 3), I will simply have one...	[ 0.007354736328125, 0.0174560546875, 0.00188446044921875, 0.0125732421875, -0.01806640625, 0.0235595703125, -0.00396728515625, -0.0076904296875, 0.052734375, -0.0196533203125, -0.007049560546875, -0.00145721435546875, -0.0042724609375, 0.0301513671875, 0.00830078125, -0.006805419921875,...	[ 12830, 3789, 1614, 6562, 11, 58134, 52825, 5303, 140423, 17932, 50960, 4263, 14012, 18, 14858, 140909, 209, 21115, 13267, 8439, 42856, 1632, 164917, 438, 3445, 28, 9821, 186351, 678, 5701, 101790, 759, 6528, 4488, 23, 1250, 4867, 4171, 2947...	[ 0.145263671875, 0.05474853515625, 0.156982421875, 0.2041015625, 0.03826904296875, 0.174072265625, 0.207763671875, 0.22509765625, 0.125244140625, 0.083740234375, 0.1187744140625, 0.001190185546875, 0.1361083984375, 0.07244873046875, 0.176025390625, 0.083740234375, 0.0872802734375, 0...	embed
70555588_c0	70555588	prolog	0	Title: Prolog: Check if list of tuples is a function Problem title: Prolog: Check if list of tuples is a function Tags: prolog, function, forall Problem: Prolog: Check if list of tuples is a function I want to check, if a list L of tuples (x1,y1) has the function property: ∀(x1,y1),(x2,y2) ∈ L (x1=x2 y1 = y2) I tried t...	Prolog: Check if list of tuples is a function Prolog: Check if list of tuples is a function prolog function forall Prolog Check m_Function Call lists:member _5074 Exit _5060 _5062 _5066 _5068 Prolog: Check if list of tuples is a function I want to check, if a list L of tuples (x1,y1) has the function property: I tried ...	[ -0.00823974609375, -0.005767822265625, 0.0145263671875, -0.01123046875, -0.0001544952392578125, -0.0196533203125, 0.015869140625, -0.0107421875, 0.01287841796875, -0.0174560546875, 0.034423828125, 0.031982421875, -0.000453948974609375, -0.0048828125, 0.0086669921875, 0.02685546875, 0...	[ 1250, 4867, 38679, 2174, 5303, 370, 99726, 83, 32354, 111, 10, 502, 100, 5584, 347, 97249, 26265, 27417, 2525, 16360, 5443, 217, 4598, 10837, 14604, 16028, 3444, 12765, 339, 425, 418, 53, 17727, 1556, 57266, 37842, 86869, 2063, 2967, 450,...	[ 0.1507568359375, 0.2119140625, 0.205078125, 0.096923828125, 0.1864013671875, 0.16552734375, 0.26123046875, 0.0943603515625, 0.222412109375, 0.070556640625, 0.03662109375, 0.1229248046875, 0.0762939453125, 0.1578369140625, 0.09075927734375, 0.152587890625, 0.1094970703125, 0.1314697...	embed
69328940_c1	69328940	prolog	1	YS, TEST) :- count(CANDYS, TEST, NB), is_positive(NB). count([], _, 0). count([X\|TAIL], F, RES) :- call(F,X) -> count(TAIL, F, ACC), RES is ACC+1; count(TAIL, F, RES). contains_at_least_one_list(_, []) :- true. contains_at_least_one_list(CANDYS, [TEST\|TEST_TAIL]) :- contains_at_least_one(CANDYS, TEST), contains_at_leas...	YS, TEST) :- count(CANDYS, TEST, NB), is_positive(NB). count([], _, 0). count([X\|TAIL], F, RES) :- call(F,X) -> count(TAIL, F, ACC), RES is ACC+1; count(TAIL, F, RES). contains_at_least_one_list(_, []) :- true. contains_at_least_one_list(CANDYS, [TEST\|TEST_TAIL]) :- contains_at_least_one(CANDYS, TEST), contains_at_leas...	[ 0.0142822265625, -0.001983642578125, -0.01141357421875, 0.0034942626953125, -0.0098876953125, 0.00054168701171875, 0.00390625, 0.0089111328125, 0.007476806640625, -0.016357421875, -0.00064849853515625, -0.01153564453125, -0.007720947265625, 0.00848388671875, 0.0191650390625, 0.00421142...	[ 26947, 4, 384, 21828, 16, 15772, 54529, 441, 45029, 63813, 83, 67890, 4935, 49321, 757, 1542, 58745, 90259, 866, 563, 61661, 11782, 919, 13709, 21748, 70541, 4438, 3630, 6562, 29568, 618, 133, 5351, 9844, 67155, 53, 1653, 2063, 67, 7, 2...	[ 0.256103515625, 0.1197509765625, 0.2496337890625, 0.284912109375, 0.043426513671875, 0.1063232421875, 0.19189453125, 0.01837158203125, 0.0989990234375, 0.1968994140625, 0.152587890625, 0.155517578125, 0.1448974609375, 0.1375732421875, 0.10400390625, 0.057403564453125, 0.0762939453125...	embed
73181630_c0	73181630	prolog	0	Title: SWI-Prolog: Generalize a predicate to calcluate the power of some function Problem title: SWI-Prolog: Generalize a predicate to calcluate the power of some function Tags: prolog, function Problem: SWI-Prolog: Generalize a predicate to calcluate the power of some function I want to generalize some predicate writt...	SWI-Prolog: Generalize a predicate to calcluate the power of some function SWI-Prolog: Generalize a predicate to calcluate the power of some function prolog function SWI-Prolog Generalize Power Argument Value calc_power Power_m1 Buffer POW ERROR Arguments SWI-Prolog: Generalize a predicate to calcluate the power of som...	[ 0.01214599609375, 0.00116729736328125, 0.01055908203125, -0.00823974609375, -0.000885009765625, -0.003997802734375, -0.0003681182861328125, -0.006866455078125, 0.01312255859375, -0.0264892578125, 0.005645751953125, -0.004150390625, -0.024169921875, -0.001953125, 0.0179443359375, 0.0087...	[ 159, 38969, 10752, 4867, 9082, 20650, 1653, 2063, 67, 6510, 29786, 14537, 32354, 502, 17170, 112140, 190060, 238, 62783, 39, 418, 667, 18234, 8574, 1456, 151206, 47, 3444, 4537, 59121, 91, 2452, 9, 3454, 74481, 2060, 11782, 177, 11, 284, ...	[ 0.02587890625, 0.18994140625, 0.1181640625, 0.1783447265625, 0.14599609375, 0.1282958984375, 0.148193359375, 0.1846923828125, 0.072021484375, 0.116943359375, 0.0650634765625, 0.197021484375, 0.1474609375, 0.126220703125, 0.1748046875, 0.1962890625, 0.0916748046875, 0.09625244140625...	embed
73999802_c0	73999802	prolog	0	Title: What should I use for representing sets in Prolog? Problem title: What should I use for representing sets in Prolog? Tags: prolog, set Problem: What should I use for representing sets in Prolog? I want to do some work with sets in Prolog. I found that there's a library in SWI called ordsets which seems to be wha...	What should I use for representing sets in Prolog? What should I use for representing sets in Prolog? prolog set What Prolog is_ordset ord_union Set What should I use for representing sets in Prolog? I want to do some work with sets in Prolog. I found that there's a library in SWI called ordsets which seems to be what ...	[ 0.009765625, 0.0022430419921875, 0.020751953125, 0.00170135498046875, -0.009521484375, 0.00555419921875, -0.012451171875, -0.0274658203125, 0.002166748046875, -0.0247802734375, 0.007537841796875, 0.0106201171875, -0.0007171630859375, -0.021728515625, -0.008056640625, 0.0069580078125, ...	[ 4865, 5608, 4527, 33636, 214, 5423, 7, 23, 1250, 4867, 100, 502, 6651, 3509, 8597, 87046, 19943, 4488, 35773, 38969, 1542, 136, 17550, 90698, 12989, 4127, 69941, 6626, 297, 1723, 106, 68403, 6713, 7108, 959, 1294, 12684, 17368, 5426, 18, ...	[ 0.039703369140625, 0.055084228515625, 0.09771728515625, 0.2314453125, 0.075927734375, 0.24560546875, 0.07763671875, 0.028411865234375, 0.157958984375, 0.2215576171875, 0.004974365234375, 0.11669921875, 0.1510009765625, 0.2232666015625, 0.1583251953125, 0.1466064453125, 0.163330078125...	embed
56394137_c0	56394137	prolog	0	Title: How to determine if a child is a single child in a PROLOG family tree? Problem title: How to determine if a child is a single child in a PROLOG family tree? Tags: prolog Problem: How to determine if a child is a single child in a PROLOG family tree? I am currently writing a PROLOG program that represents Family ...	How to determine if a child is a single child in a PROLOG family tree? How to determine if a child is a single child in a PROLOG family tree? prolog How PROLOG Returns mother_of father_of sister_of brother_of single_child How to determine if a child is a single child in a PROLOG family tree? I am currently writing a PR...	[ 0.01953125, 0.003936767578125, 0.002838134765625, -0.0024261474609375, -0.0296630859375, 0.00823974609375, -0.006011962890625, -0.0086669921875, 0.0172119140625, -0.025634765625, -0.01055908203125, -0.031494140625, -0.0174560546875, -0.00122833251953125, 0.013671875, 0.01312255859375, ...	[ 11249, 47, 83324, 2174, 29041, 83, 10, 11001, 23, 10514, 47510, 14449, 53201, 502, 4867, 173340, 42732, 4390, 67373, 114015, 82953, 206, 38472, 32562, 1528, 33636, 59745, 116822, 29479, 32354, 4488, 12765, 22008, 10557, 110, 6369, 9319, 37842...	[ 0.058380126953125, 0.05560302734375, 0.1707763671875, 0.0777587890625, 0.225341796875, 0.052490234375, 0.03564453125, 0.222900390625, 0.07080078125, 0.1634521484375, 0.271240234375, 0.1136474609375, 0.2054443359375, 0.10302734375, 0.193603515625, 0.143798828125, 0.0885009765625, 0....	embed
67780028_c0	67780028	prolog	0	Title: What is a Deductive Database? Problem title: What is a Deductive Database? Tags: database, prolog, datalog Problem: What is a Deductive Database? I am reading some papers on databases and stumbled upon deductive databases. It seems that information on them is somewhat limited. The Wikipedia article states A dedu...	What is a Deductive Database? What is a Deductive Database? database prolog datalog What Deductive Database i.e What is a Deductive Database? I am reading some papers on databases and stumbled upon deductive databases. It seems that information on them is somewhat limited. The Wikipedia article states A deductive datab...	[ 0.041015625, 0.01397705078125, 0.007415771484375, 0.01397705078125, -0.00421142578125, 0.033203125, -0.0133056640625, -0.002655029296875, -0.003021240234375, -0.02099609375, -0.0126953125, -0.01092529296875, -0.018310546875, 0.00872802734375, -0.0162353515625, 0.00439453125, 0.024536...	[ 4865, 83, 10, 262, 39367, 4935, 187781, 32, 63399, 502, 4867, 2053, 13, 16454, 15122, 18784, 8, 4677, 84046, 8162, 5582, 117249, 62, 5426, 831, 3249, 77391, 103876, 78301, 15824, 35509, 91736, 4343, 112, 307, 187136, 11249, 621, 71, 23, ...	[ 0.10003662109375, 0.0960693359375, 0.098388671875, 0.2034912109375, 0.25244140625, 0.2071533203125, 0.275146484375, 0.013824462890625, 0.270263671875, 0.14599609375, 0.232666015625, 0.0723876953125, 0.0204315185546875, 0.05865478515625, 0.053619384765625, 0.005706787109375, 0.1990966...	embed
33223289_c0	33223289	prolog	0	Title: Collatz predicate in Prolog Problem title: Collatz predicate in Prolog Tags: prolog, collatz, predicate Problem: Collatz predicate in Prolog I'm stuck with some Prolog exercise. I am to write a predicate collatz2(X,N) which, assuming we know what X is, returns N that is the index (starting from 1) for the result...	Collatz predicate in Prolog Collatz predicate in Prolog prolog collatz predicate Collatz Prolog collatz2 collatz1 Collatz predicate in Prolog I'm stuck with some Prolog exercise. I am to write a predicate collatz2(X,N) which, assuming we know what X is, returns N that is the index (starting from 1) for the result of 1....	[ 0.0031890869140625, -0.01239013671875, -0.006256103515625, 0.00445556640625, 0.01171875, 0.03955078125, -0.00106048583984375, 0.004364013671875, 0.01251220703125, -0.04541015625, 0.023193359375, -0.0076904296875, -0.000484466552734375, 0.00628662109375, 0.0194091796875, 0.0072021484375...	[ 88842, 257, 169, 1653, 2063, 67, 23, 1250, 4867, 502, 65780, 9136, 304, 418, 179933, 81979, 33022, 1542, 839, 66596, 3714, 1193, 30646, 541, 63262, 17137, 1295, 4879, 16750, 615, 181989, 32354, 104116, 910, 187136, 50339, 59121, 68772, 1483...	[ 0.1539306640625, 0.1165771484375, 0.1690673828125, 0.1590576171875, 0.19580078125, 0.0765380859375, 0.009521484375, 0.1407470703125, 0.2178955078125, 0.0810546875, 0.1505126953125, 0.1776123046875, 0.1575927734375, 0.056854248046875, 0.0478515625, 0.0794677734375, 0.08935546875, 0....	embed
27366470_c0	27366470	prolog	0	Title: Shifting both directions elements of a list, and GCD of them. Prolog Problem title: Shifting both directions elements of a list, and GCD of them. Prolog Tags: prolog, list, rotation, greatest-common-divisor, element Problem: Shifting both directions elements of a list, and GCD of them. Prolog i got trouble when ...	Shifting both directions elements of a list, and GCD of them. Prolog Shifting both directions elements of a list, and GCD of them. Prolog prolog list rotation greatest-common-divisor element Shifting GCD Prolog Dir Res List Shifting both directions elements of a list, and GCD of them. Prolog i got trouble when trying t...	[ -0.025146484375, 0.0120849609375, 0.011962890625, -0.01312255859375, -0.0020294189453125, 0.00177764892578125, -0.023193359375, -0.0081787109375, 0.001129150390625, -0.0146484375, -0.00052642822265625, 0.00035858154296875, -0.00836181640625, 0.01904296875, 0.0030517578125, 0.0220947265...	[ 8294, 2480, 214, 15044, 48225, 80854, 5303, 136, 527, 16069, 111, 2856, 1250, 4867, 502, 2062, 22062, 158036, 277, 3796, 428, 51858, 12830, 19946, 9624, 32036, 4163, 63134, 31577, 86869, 116, 44402, 3871, 74481, 8, 22109, 71, 60075, 53875, ...	[ 0.1614990234375, 0.1822509765625, 0.049835205078125, 0.1708984375, 0.2413330078125, 0.18310546875, 0.226318359375, 0.0305328369140625, 0.1024169921875, 0.2308349609375, 0.0936279296875, 0.03753662109375, 0.1787109375, 0.263427734375, 0.1138916015625, 0.1104736328125, 0.10321044921875...	embed
28148184_c0	28148184	prolog	0	Title: Efficient Union Find with Existential Quantifier? Problem title: Efficient Union Find with Existential Quantifier? Tags: algorithm, union-find, prolog Problem: Efficient Union Find with Existential Quantifier? Is there a classical algorithm to solve the following problem. Assume the union find algorithm without ...	Efficient Union Find with Existential Quantifier? Efficient Union Find with Existential Quantifier? algorithm union-find prolog Efficient Union Find Existential Quantifier Input Efficient Union Find with Existential Quantifier? Is there a classical algorithm to solve the following problem. Assume the union find algorit...	[ 0.0050048828125, 0.04296875, 0.0032806396484375, 0.00125885009765625, -0.0150146484375, 0.005401611328125, -0.002288818359375, 0.01220703125, -0.01165771484375, -0.0274658203125, 0.01953125, -0.0059814453125, 0.00897216796875, -0.01513671875, -0.00494384765625, -0.0023193359375, 0.00...	[ 241, 24500, 45964, 32528, 26040, 678, 122688, 118, 289, 75344, 85789, 32, 234873, 69941, 111607, 502, 4867, 360, 7077, 2071, 2685, 54704, 86869, 70, 25632, 2967, 62, 66596, 7413, 15490, 99707, 15403, 55230, 1556, 107730, 1221, 45367, 3060, ...	[ 0.0423583984375, 0.162353515625, 0.1319580078125, 0.2666015625, 0.232421875, 0.137939453125, 0.1844482421875, 0.122314453125, 0.096923828125, 0.1748046875, 0.1978759765625, 0.0142669677734375, 0.25244140625, 0.25341796875, 0.2174072265625, 0.125, 0.165771484375, 0.09405517578125, ...	embed
41107698_c0	41107698	prolog	0	Title: How can I find all the connected cities on graph with Prolog? Problem title: How can I find all the connected cities on graph with Prolog? Tags: prolog Problem: How can I find all the connected cities on graph with Prolog? Program should check if there is a direct route between two given cities. Alternatively, i...	How can I find all the connected cities on graph with Prolog? How can I find all the connected cities on graph with Prolog? prolog How Prolog How can I find all the connected cities on graph with Prolog? Program should check if there is a direct route between two given cities. Alternatively, it can list all the connect...	[ -0.002960205078125, 0.00007390975952148438, 0.0157470703125, 0.031982421875, -0.0036468505859375, 0.001861572265625, -0.0208740234375, 0.005157470703125, 0.00885009765625, -0.04150390625, 0.00994873046875, -0.01123046875, -0.0230712890625, 0.0072021484375, -0.0032958984375, 0.016601562...	[ 11249, 831, 7413, 756, 70, 162711, 162708, 41382, 678, 1250, 4867, 87, 98, 502, 7663, 12765, 8951, 36439, 17721, 6626, 34475, 5303, 26349, 187895, 13695, 19922, 11737, 959, 21449, 1295, 24234, 49119, 18151, 13538, 7077, 60075, 100, 20662, 1...	[ 0.044158935546875, 0.04388427734375, 0.1632080078125, 0.1658935546875, 0.06280517578125, 0.1966552734375, 0.20751953125, 0.2113037109375, 0.066162109375, 0.1639404296875, 0.242431640625, 0.0235595703125, 0.0625, 0.10308837890625, 0.0965576171875, 0.1390380859375, 0.122802734375, 0....	embed
14389764_c0	14389764	prolog	0	Title: Prolog - extract numbers from nested list Problem title: Prolog - extract numbers from nested list Tags: prolog Problem: Prolog - extract numbers from nested list I trying to write a function getNumbers(List,Result) such that List is a list which his elements can be integer or list of lists , for example - List ...	Prolog - extract numbers from nested list Prolog - extract numbers from nested list prolog nested Prolog List Result Rest NewResultRest NewResultHead Prolog - extract numbers from nested list I trying to write a function getNumbers(List,Result) such that List is a list which his elements can be integer or list of lists...	[ -0.006439208984375, -0.00018310546875, 0.01220703125, 0.003570556640625, 0.00634765625, 0.025390625, -0.00823974609375, -0.00439453125, 0.017822265625, -0.033447265625, 0.00970458984375, -0.02685546875, -0.0281982421875, 0.0047607421875, 0.010986328125, 0.00106048583984375, 0.0114135...	[ 1250, 4867, 125663, 101935, 1295, 8512, 71, 5303, 502, 32036, 126684, 49756, 2356, 7, 7136, 525, 13025, 712, 31577, 33022, 32354, 2046, 18444, 26278, 154663, 4332, 1919, 80854, 831, 892, 1505, 140992, 5608, 756, 4343, 23, 37842, 28960, 1815...	[ 0.1702880859375, 0.2314453125, 0.2073974609375, 0.196044921875, 0.1295166015625, 0.24951171875, 0.1337890625, 0.1806640625, 0.1331787109375, 0.117431640625, 0.1763916015625, 0.140625, 0.038055419921875, 0.10089111328125, 0.1661376953125, 0.07305908203125, 0.054962158203125, 0.05728...	embed
36162785_c0	36162785	prolog	0	Title: prolog infinite loop unknown Problem title: prolog infinite loop unknown Tags: prolog, infinite-loop Problem: prolog infinite loop unknown This is a program that receives a list of coordinates ex:[e(1,2,3),e(4,5,6)]. Making the dynamics, divide and conquer, separates the list in half and half recursively, when y...	prolog infinite loop unknown prolog infinite loop unknown prolog infinite-loop append_ LastElements Tail prolog infinite loop unknown This is a program that receives a list of coordinates ex:[e(1,2,3),e(4,5,6)]. Making the dynamics, divide and conquer, separates the list in half and half recursively, when you have one ...	[ 0.017333984375, 0.01904296875, 0.0093994140625, -0.006866455078125, -0.0028533935546875, -0.00750732421875, -0.00138092041015625, 0.006072998046875, 0.02197265625, -0.032470703125, 0.00933837890625, -0.00213623046875, -0.00177001953125, 0.00909423828125, 0.010986328125, 0.0189208984375...	[ 502, 4867, 54241, 13, 40956, 51, 69723, 19, 28354, 114689, 71, 21672, 647, 19929, 7, 1218, 379, 3293, 83, 10, 1528, 53299, 5303, 176866, 90, 1119, 155761, 105801, 104629, 13676, 214, 84079, 101637, 136, 158, 27227, 84797, 23552, 195625, 1...	[ 0.2147216796875, 0.269287109375, 0.192626953125, 0.1138916015625, 0.30029296875, 0.104248046875, 0.2264404296875, 0.06463623046875, 0.2364501953125, 0.1407470703125, 0.048797607421875, 0.177001953125, 0.0282745361328125, 0.2059326171875, 0.006103515625, 0.134033203125, 0.164184570312...	embed
39303687_c0	39303687	prolog	0	Title: Maze Solver DFS Algorithm Problem title: Maze Solver DFS Algorithm Tags: maze, graph-algorithm, prolog Problem: Maze Solver DFS Algorithm I'm studying prolog in a course. I have an exercise where I need to read a file, generate a maze from it, get a path from the source to destination and write it to a file. I r...	Maze Solver DFS Algorithm Maze Solver DFS Algorithm maze graph-algorithm prolog Maze Solver DFS Algorithm CoordX CoordY TargetX TargetY SourceX SourceY NewSquare Tail HeadOfTail Maze Solver DFS Algorithm I'm studying prolog in a course. I have an exercise where I need to read a file, generate a maze from it, get a path...	[ 0.0306396484375, 0.00970458984375, -0.00173187255859375, 0.0201416015625, 0.002532958984375, 0.00136566162109375, -0.0272216796875, 0.0025177001953125, -0.005645751953125, -0.045166015625, 0.017333984375, 0.00775146484375, -0.004241943359375, -0.0101318359375, 0.02880859375, 0.01635742...	[ 29678, 13, 6678, 814, 391, 36381, 109847, 2783, 291, 731, 41382, 100628, 502, 4867, 1311, 6651, 1542, 1723, 160017, 77641, 2356, 94727, 1218, 379, 44816, 132887, 9874, 15411, 81979, 12301, 11435, 139392, 60875, 31344, 78869, 33657, 108047, 10...	[ 0.1505126953125, 0.1298828125, 0.181884765625, 0.1766357421875, 0.07501220703125, 0.2197265625, 0.1263427734375, 0.11865234375, 0.1241455078125, 0.1683349609375, 0.165283203125, 0.0810546875, 0.1588134765625, 0.2120361328125, 0.0328369140625, 0.1539306640625, 0.1375732421875, 0.120...	embed
40411184_c0	40411184	prolog	0	Title: some issue in my prolog code Problem title: some issue in my prolog code Tags: logic, prolog, swi-prolog Problem: some issue in my prolog code i am new to prolog and have written some code in prolog simply to show some message but when i run it produce some error that : 1) Syntax error: Unexpected end of clause ...	some issue in my prolog code some issue in my prolog code logic prolog swi-prolog course_crh Please Enter Max Less some issue in my prolog code i am new to prolog and have written some code in prolog simply to show some message but when i run it produce some error that : 1) Syntax error: Unexpected end of clause 2)ERRO...	[ 0.00396728515625, 0.00885009765625, -0.004608154296875, 0.01153564453125, -0.001617431640625, 0.00262451171875, -0.01068115234375, 0.015625, -0.00075531005859375, -0.0081787109375, 0.0159912109375, -0.0201416015625, -0.0137939453125, -0.018310546875, 0.017578125, 0.00506591796875, 0....	[ 3060, 31089, 23, 759, 502, 4867, 18151, 62775, 2452, 3454, 15411, 23150, 127, 30607, 60816, 9920, 1734, 3525, 59121, 7639, 26008, 11675, 27489, 18499, 19010, 86531, 992, 83613, 3564, 70731, 13, 4958, 12501, 14255, 150922, 84751, 151206, 24638...	[ 0.03851318359375, 0.1346435546875, 0.0239715576171875, 0.0523681640625, 0.164794921875, 0.23681640625, 0.2076416015625, 0.1182861328125, 0.1431884765625, 0.138671875, 0.14599609375, 0.0787353515625, 0.1539306640625, 0.06781005859375, 0.179443359375, 0.18701171875, 0.0802001953125, ...	embed
40722655_c0	40722655	prolog	0	Title: Cycle in directed graph in prolog Problem title: Cycle in directed graph in prolog Tags: prolog Problem: Cycle in directed graph in prolog I created a program in prolog, which should give me the routes between two stations in a cycle. When I for example ask for the route between s3 and s4, it gives me the two co...	Cycle in directed graph in prolog Cycle in directed graph in prolog prolog Cycle direction1 direction2 route1 route2 Cycle in directed graph in prolog I created a program in prolog, which should give me the routes between two stations in a cycle. When I for example ask for the route between s3 and s4, it gives me the t...	[ 0.0087890625, -0.0014190673828125, 0.013427734375, 0.0264892578125, -0.0025482177734375, -0.016357421875, -0.019287109375, -0.0003337860107421875, 0.006500244140625, -0.054443359375, -0.00531005859375, 0.0172119140625, -0.0262451171875, 0.018798828125, 0.0242919921875, 0.0240478515625,...	[ 151612, 13, 23, 8951, 297, 41382, 502, 4867, 48225, 304, 36439, 418, 75935, 1528, 8337, 17721, 6626, 29398, 105823, 26458, 91, 363, 617, 76199, 26785, 7, 910, 758, 1632, 29806, 2301, 18, 3444, 7722, 19922, 40368, 20028, 56282, 32786, 7510...	[ 0.2176513671875, 0.0770263671875, 0.051849365234375, 0.170654296875, 0.065185546875, 0.2030029296875, 0.1258544921875, 0.22216796875, 0.1859130859375, 0.0650634765625, 0.2109375, 0.0111083984375, 0.0291748046875, 0.125244140625, 0.0270843505859375, 0.0633544921875, 0.0572509765625, ...	embed
51070634_c0	51070634	prolog	0	Title: Getting all facts that are known to prolog (with special format) Problem title: Getting all facts that are known to prolog (with special format) Tags: prolog Problem: Getting all facts that are known to prolog (with special format) Prolog question: Consider the following format: carsCompany(Tel_Number, Manager, ...	Getting all facts that are known to prolog (with special format) Getting all facts that are known to prolog (with special format) prolog Getting Tel_Number Manager Company_Name new_cars Car_Name Color Creator Date_Creation old_cars Jujiro Matsuda Mazda mazda_3 Grey Person1 Cosmo Black Person2 RX-7 Old Getting all facts...	[ 0.021240234375, -0.0263671875, -0.000263214111328125, 0.00579833984375, -0.00653076171875, 0.0194091796875, 0.01422119140625, 0.0125732421875, 0.007598876953125, -0.03076171875, 0.00732421875, -0.0036163330078125, -0.031494140625, -0.0096435546875, -0.003997802734375, -0.00698852539062...	[ 210732, 756, 15824, 7, 450, 621, 51529, 47, 502, 4867, 76228, 5361, 9384, 9344, 18444, 26278, 30195, 33734, 163612, 3525, 3284, 3980, 51193, 192008, 25512, 63784, 10332, 3314, 658, 516, 114685, 6874, 125691, 17022, 85, 363, 95996, 15270, 17...	[ 0.1627197265625, 0.1834716796875, 0.202392578125, 0.1217041015625, 0.06634521484375, 0.1134033203125, 0.244384765625, 0.108154296875, 0.1708984375, 0.26953125, 0.050140380859375, 0.1263427734375, 0.191162109375, 0.13525390625, 0.0693359375, 0.0948486328125, 0.2186279296875, 0.09375...	embed
51010374_c0	51010374	prolog	0	Title: How to run a PROLOG script file in BATCH mode? (in Linux Terminal) Problem title: How to run a PROLOG script file in BATCH mode? (in Linux Terminal) Tags: swi-prolog, batch-processing, ubuntu, linux, prolog Problem: How to run a PROLOG script file in BATCH mode? (in Linux Terminal) I'm trying to use a PROLOG scr...	How to run a PROLOG script file in BATCH mode? (in Linux Terminal) How to run a PROLOG script file in BATCH mode? (in Linux Terminal) swi-prolog batch-processing ubuntu linux prolog How PROLOG BATCH Linux Terminal Rule db.pl Rule01 How to run a PROLOG script file in BATCH mode? (in Linux Terminal) I'm trying to use a P...	[ 0.023681640625, 0.031982421875, 0.00125885009765625, 0.0283203125, -0.0205078125, -0.00811767578125, 0.007415771484375, -0.0106201171875, 0.0093994140625, -0.0179443359375, 0.00164031982421875, -0.004180908203125, -0.02587890625, -0.00421142578125, 0.005340576171875, -0.001205444335937...	[ 11249, 11675, 10514, 47510, 26499, 11435, 23, 8678, 142481, 13736, 73, 29908, 124090, 91, 2452, 3454, 4867, 1777, 206, 63923, 198996, 11508, 6077, 502, 139118, 40041, 2424, 6746, 47, 10, 21947, 212398, 116890, 43240, 1250, 3642, 10869, 151814...	[ 0.0638427734375, 0.1690673828125, 0.2186279296875, 0.25146484375, 0.224853515625, 0.1697998046875, 0.03997802734375, 0.145751953125, 0.2158203125, 0.1417236328125, 0.05126953125, 0.159423828125, 0.262939453125, 0.03350830078125, 0.193115234375, 0.17236328125, 0.236328125, 0.1304931...	embed
23683289_c0	23683289	prolog	0	Title: Making Database for wordNet in SICStus Problem title: Making Database for wordNet in SICStus Tags: nlp, prolog Problem: Making Database for wordNet in SICStus I would like to make a prolog database that holds every synsets in wordNet which are about 117.000 synsets. As wordNet actually is kind of multi trees; so...	Making Database for wordNet in SICStus Making Database for wordNet in SICStus nlp prolog Making Database SICStus Making Database for wordNet in SICStus I would like to make a prolog database that holds every synsets in wordNet which are about 117.000 synsets. As wordNet actually is kind of multi trees; some daughters h...	[ 0.007537841796875, 0.0220947265625, -0.0147705078125, -0.005279541015625, -0.0128173828125, 0.0208740234375, -0.00836181640625, -0.011962890625, 0.00038909912109375, -0.06884765625, 0.01287841796875, -0.0108642578125, -0.00836181640625, -0.00138092041015625, -0.00677490234375, -0.00579...	[ 13676, 214, 187781, 2565, 24447, 159, 102198, 2143, 23, 26775, 502, 4867, 1884, 3249, 63399, 16401, 11907, 71695, 7831, 534, 112599, 6024, 1360, 76849, 5941, 27863, 3714, 167375, 17366, 17164, 12912, 27781, 4865, 14602, 6097, 101935, 29459, 5...	[ 0.0989990234375, 0.000579833984375, 0.23388671875, 0.1766357421875, 0.265380859375, 0.1123046875, 0.066162109375, 0.1932373046875, 0.00115966796875, 0.129150390625, 0.131591796875, 0.190673828125, 0.03057861328125, 0.072265625, 0.21923828125, 0.1099853515625, 0.0814208984375, 0.145...	embed
64664349_c0	64664349	prolog	0	Title: Output of a function as the input argument of another function in Prolog Problem title: Output of a function as the input argument of another function in Prolog Tags: prolog Problem: Output of a function as the input argument of another function in Prolog Let's say I have some predicates and a function like this...	Output of a function as the input argument of another function in Prolog Output of a function as the input argument of another function in Prolog prolog Output Prolog ListOfFacts Afact Call _8878 _8884 Fail Output of a function as the input argument of another function in Prolog Let's say I have some predicates and a f...	[ 0.0191650390625, 0.015380859375, 0.01434326171875, -0.004119873046875, -0.0198974609375, 0.017578125, 0.00135040283203125, -0.00323486328125, -0.0057373046875, -0.0380859375, -0.005157470703125, 0.0213623046875, -0.006591796875, -0.00836181640625, 0.0164794921875, -0.01025390625, -0....	[ 13538, 7077, 111, 32354, 237, 107730, 10750, 15700, 1250, 4867, 23, 502, 32036, 132887, 135518, 62, 114700, 26265, 138392, 1019, 49543, 617, 190355, 1653, 2063, 2806, 1884, 5201, 1052, 76228, 627, 238, 115081, 47, 69101, 12989, 37842, 41206, ...	[ 0.1895751953125, 0.123291015625, 0.0833740234375, 0.22509765625, 0.1240234375, 0.228271484375, 0.260009765625, 0.1014404296875, 0.156494140625, 0.2333984375, 0.0029296875, 0.121337890625, 0.062744140625, 0.136474609375, 0.115478515625, 0.02099609375, 0.20556640625, 0.06658935546875...	embed
40979912_c0	40979912	prolog	0	Title: How can I return a list of edges in a graph from one node to another? Problem title: How can I return a list of edges in a graph from one node to another? Tags: prolog, graph-theory, algorithm Problem: How can I return a list of edges in a graph from one node to another? Here's the question I'm trying to solve: ...	How can I return a list of edges in a graph from one node to another? How can I return a list of edges in a graph from one node to another? prolog graph-theory algorithm one How How can I return a list of edges in a graph from one node to another? Here's the question I'm trying to solve: Here are the graphs we're worki...	[ 0.02001953125, 0.0255126953125, -0.005767822265625, 0.00927734375, 0.007415771484375, 0.01068115234375, -0.03369140625, -0.0025787353515625, 0.00982666015625, -0.022705078125, 0.0198974609375, -0.006744384765625, -0.006256103515625, 0.004150390625, 0.0201416015625, 0.0201416015625, 0...	[ 11249, 831, 30646, 5303, 111, 121303, 7, 41382, 1295, 1632, 110, 112, 47, 15700, 23, 502, 4867, 234873, 87, 86869, 20697, 84751, 140992, 75169, 5351, 20903, 195, 104851, 135179, 237, 21208, 20949, 179933, 40956, 18, 2046, 1810, 4358 ]	[ 0.09283447265625, 0.08660888671875, 0.24169921875, 0.1942138671875, 0.07470703125, 0.257080078125, 0.0997314453125, 0.2044677734375, 0.096435546875, 0.0501708984375, 0.1461181640625, 0.103515625, 0.11328125, 0.0953369140625, 0.03009033203125, 0.03851318359375, 0.1226806640625, 0.08...	embed
22421426_c0	22421426	prolog	0	Title: Get simple Prolog example to work Problem title: Get simple Prolog example to work Tags: prolog Problem: Get simple Prolog example to work I am trying to run a simple gprolog to run on my Linux machine, GNU Prolog was installed from the Ubuntu Software Center. From the GNU Prolog Intro I got the following exampl...	Get simple Prolog example to work Get simple Prolog example to work prolog Get Prolog HelloWorld.pl HelloProlog instantiation_error z11 GNU Daniel Diaz Copyright Luke Anakin existence_error top_level Get simple Prolog example to work I am trying to run a simple gprolog to run on my Linux machine, GNU Prolog was install...	[ 0.02392578125, 0.00469970703125, 0.01397705078125, 0.019287109375, -0.0208740234375, 0.01416015625, 0.0076904296875, -0.00506591796875, -0.00133514404296875, -0.05859375, 0.017333984375, -0.0115966796875, -0.017333984375, 0.01123046875, 0.00787353515625, -0.01171875, 0.00308227539062...	[ 20779, 8781, 1250, 4867, 27781, 47, 4488, 502, 35378, 70646, 2424, 10752, 34648, 14, 188800, 97, 1662, 165132, 11555, 4512, 169, 4189, 97702, 20405, 73, 116311, 2663, 67919, 31577, 11675, 706, 3454, 29908, 36279, 20600, 1295, 116890, 23752, ...	[ 0.078857421875, 0.2098388671875, 0.209716796875, 0.2734375, 0.277587890625, 0.06964111328125, 0.15380859375, 0.1605224609375, 0.158935546875, 0.1197509765625, 0.1148681640625, 0.2039794921875, 0.11279296875, 0.09564208984375, 0.159912109375, 0.06884765625, 0.1199951171875, 0.173217...	embed
42994731_c0	42994731	prolog	0	Title: Prolog conditional statements Problem title: Prolog conditional statements Tags: prolog Problem: Prolog conditional statements Suppose we are given certain facts and we were supposed to write a certain rule that explores a given condition in those facts, for example, if we are given certain climates and their ch...	Prolog conditional statements Prolog conditional statements prolog Prolog Month Prolog conditional statements Suppose we are given certain facts and we were supposed to write a certain rule that explores a given condition in those facts, for example, if we are given certain climates and their characteristics: If we wan...	[ -0.00872802734375, -0.003173828125, -0.00005650520324707031, 0.0224609375, -0.01007080078125, -0.00116729736328125, -0.00054168701171875, 0.0018310546875, -0.00106048583984375, 0.031982421875, -0.000732421875, 0.00494384765625, 0.00946044921875, -0.008544921875, 0.00201416015625, 0.014...	[ 1250, 4867, 35431, 289, 63805, 502, 12982, 127, 121691, 34475, 24233, 15824, 134598, 33022, 79986, 88898, 153552, 62816, 48242, 36663, 7413, 1810, 8010, 136, 36898, 37842, 55300, 36917, 22027, 18, 48903, 4488, 175399, 68772, 76199, 163, 756, ...	[ 0.1800537109375, 0.256591796875, 0.2374267578125, 0.1405029296875, 0.1922607421875, 0.12939453125, 0.159423828125, 0.09149169921875, 0.0057373046875, 0.05889892578125, 0.0185546875, 0.09027099609375, 0.09130859375, 0.115234375, 0.1331787109375, 0.0814208984375, 0.1810302734375, 0.1...	embed
43552212_c0	43552212	prolog	0	Title: Prolog -- Arguments are not sufficiently instantiated Problem title: Prolog -- Arguments are not sufficiently instantiated Tags: prolog, instantiation-error Problem: Prolog -- Arguments are not sufficiently instantiated I am trying to check for even/odd players and even/odd columns in a game by counting the play...	Prolog -- Arguments are not sufficiently instantiated Prolog -- Arguments are not sufficiently instantiated prolog instantiation-error Prolog Arguments Game TotalPlayers TotalCols ERROR _34862 _34894 _34896 Prolog -- Arguments are not sufficiently instantiated I am trying to check for even/odd players and even/odd colu...	[ 0.01123046875, 0.005615234375, 0.00689697265625, 0.005340576171875, 0.004302978515625, 0.00341796875, -0.008056640625, -0.029296875, 0.017578125, 0.00421142578125, 0.0113525390625, -0.0040283203125, 0.00335693359375, 0.003173828125, 0, -0.00384521484375, 0.00726318359375, -0.018676...	[ 1250, 4867, 112140, 7, 621, 959, 129980, 538, 34648, 14, 27686, 4210, 502, 188800, 13547, 33867, 142581, 78457, 151206, 24638, 135407, 10837, 14889, 11648, 31577, 12765, 3853, 64, 13606, 92865, 3365, 316, 6712, 54529, 26518, 759, 77336, 26785...	[ 0.2025146484375, 0.247802734375, 0.29248046875, 0.113525390625, 0.02923583984375, 0.1346435546875, 0.19091796875, 0.060455322265625, 0.1585693359375, 0.1351318359375, 0.0948486328125, 0.008544921875, 0.1566162109375, 0.1524658203125, 0.088623046875, 0.1444091796875, 0.2122802734375, ...	embed
28367307_c1	28367307	prolog	1	cityj, 50). path(cityh, cityj, 90). path(cityi, cityh, 70). path(citya,cityc,120). path(citya,cityb,60). % chopper attributes chopper_islanded(true). chopper_islanded(false). chopper_at(X):- chopper_islanded(true); chopper_islanded(false), place(X), is_chopper(chopper1). % place states, G=on ground, A= in air, v[list ...	cityj, 50). path(cityh, cityj, 90). path(cityi, cityh, 70). path(citya,cityc,120). path(citya,cityb,60). % chopper attributes chopper_islanded(true). chopper_islanded(false). chopper_at(X):- chopper_islanded(true); chopper_islanded(false), place(X), is_chopper(chopper1). % place states, G=on ground, A= in air, v[list ...	[ -0.01068115234375, -0.01458740234375, 0.005279541015625, 0.01068115234375, -0.01251220703125, -0.0089111328125, -0.0003662109375, -0.0184326171875, 0.007293701171875, -0.04443359375, -0.002105712890625, 0.01104736328125, -0.02490234375, -0.003875732421875, -0.0166015625, -0.00738525390...	[ 26349, 170, 836, 60875, 60089, 127, 2510, 14, 2358, 11, 238, 20840, 275, 88586, 1745, 681, 8079, 150380, 90, 164, 1760, 9774, 8710, 257, 1542, 3687, 83, 3089, 117249, 527, 61585, 62, 1831, 81, 6562, 27289, 15982, 11341, 334, 724, 683, ...	[ 0.0885009765625, 0.1361083984375, 0.1533203125, 0.172607421875, 0.0511474609375, 0.11181640625, 0.146240234375, 0.042388916015625, 0.0975341796875, 0.0933837890625, 0.0120849609375, 0.141357421875, 0.0174560546875, 0.1199951171875, 0.0491943359375, 0.1856689453125, 0.1949462890625, ...	embed
10625331_c1	10625331	prolog	1	_piece(X, [_,_,_,X,_,_,_,_,_]) :- line_of(place(_,center,_,_), center), column_of(place(_,_,left,_), left), !. put_piece(X, [_,_,_,_,X,_,_,_,_]) :- line_of(place(_,center,_,_), center), column_of(place(_,_,middle,_), middle), !. put_piece(X, [_,_,_,_,_,X,_,_,_]) :- line_of(place(_,center,_,_), center), column_of(place(...	_piece(X, [_,_,_,X,_,_,_,_,_]) :- line_of(place(_,center,_,_), center), column_of(place(_,_,left,_), left), !. put_piece(X, [_,_,_,_,X,_,_,_,_]) :- line_of(place(_,center,_,_), center), column_of(place(_,_,middle,_), middle), !. put_piece(X, [_,_,_,_,_,X,_,_,_]) :- line_of(place(_,center,_,_), center), column_of(place(...	[ 0.00341796875, -0.00787353515625, -0.00150299072265625, -0.0015411376953125, -0.01092529296875, 0.01025390625, -0.004364013671875, -0.0172119140625, 0.01708984375, -0.038818359375, -0.01275634765625, 0.017333984375, 0.0191650390625, -0.01104736328125, -0.031982421875, -0.01287841796875...	[ 101, 152667, 132, 1542, 4, 378, 454, 268, 16, 15772, 13315, 4390, 23935, 30090, 247, 27585, 3365, 316, 19, 133, 2480, 25737, 711, 5, 3884, 22000, 19298, 86991, 7108, 9190, 5928, 103136, 54969, 93232, 16777, 194, 233987, 8231, 112, 420, ...	[ 0.1746826171875, 0.322265625, 0.074462890625, 0.2103271484375, 0.0823974609375, 0.066162109375, 0.1329345703125, 0.032012939453125, 0.031768798828125, 0.1773681640625, 0.231689453125, 0.256103515625, 0.202392578125, 0.18798828125, 0.03173828125, 0.1793212890625, 0.1646728515625, 0....	embed
33685538_c0	33685538	prolog	0	Title: How do I tell if an atom contains a sub atom in Prolog Problem title: How do I tell if an atom contains a sub atom in Prolog Tags: split, prolog, contains Problem: How do I tell if an atom contains a sub atom in Prolog I am deigning a program which takes in an argument (an atom). Then splits it up into its parts...	How do I tell if an atom contains a sub atom in Prolog How do I tell if an atom contains a sub atom in Prolog split prolog contains How Prolog atom_split Commands if:a How do I tell if an atom contains a sub atom in Prolog I am deigning a program which takes in an argument (an atom). Then splits it up into its parts as...	[ -0.00714111328125, 0.00860595703125, -0.00185394287109375, 0.0203857421875, -0.0208740234375, 0.0179443359375, 0.0189208984375, -0.0128173828125, -0.0172119140625, -0.017578125, 0.00872802734375, 0.0198974609375, -0.015869140625, -0.0034942626953125, 0.0191650390625, -0.006683349609375...	[ 11249, 14192, 2174, 34627, 70541, 1614, 23, 1250, 4867, 7, 65450, 502, 7008, 4353, 123573, 11, 10, 872, 1528, 51776, 10750, 1257, 3934, 63920, 61924, 62822, 12989, 366, 107730, 27140, 41143, 3564, 177261, 75101, 9844, 11177, 122092, 147 ]	[ 0.003875732421875, 0.1580810546875, 0.0894775390625, 0.2178955078125, 0.157470703125, 0.21826171875, 0.043670654296875, 0.1397705078125, 0.2086181640625, 0.039093017578125, 0.1708984375, 0.13525390625, 0.046722412109375, 0.1422119140625, 0.16943359375, 0.007904052734375, 0.0062561035...	embed
8124070_c0	8124070	prolog	0	Title: Prolog Database Query Problem title: Prolog Database Query Tags: prolog, database, comparison Problem: Prolog Database Query To make a dating database with facts in the form of: person(name, age, sex, height, weight, education, salary) Given the input of: datable(alex, X). datable_weight_limit(alex, 170, X). Whe...	Prolog Database Query Prolog Database Query prolog database comparison Prolog Database Query datable_weight_limit edu_less edu_lesser Agel Sexl Heightl Weightl Educationl Salaryl Namem Agem Sexm Heightm Weightm Educationm Salarym Prolog Database Query To make a dating database with facts in the form of: person(name, ag...	[ 0.018798828125, 0.013916015625, 0.00775146484375, 0.0074462890625, -0.022705078125, 0.01226806640625, -0.03515625, 0.0101318359375, 0.0179443359375, -0.03955078125, -0.0031280517578125, -0.00958251953125, -0.01263427734375, -0.0018157958984375, -0.00128936767578125, 0.005767822265625, ...	[ 1250, 4867, 187781, 58836, 53, 502, 63399, 225490, 48, 22819, 165598, 93343, 71201, 9393, 56, 62, 2679, 3621, 141, 1529, 22553, 150533, 43154, 13294, 2096, 195, 14716, 39, 1294, 3249, 1740, 678, 15824, 3173, 3445, 11627, 32070, 1100, 155955...	[ 0.130126953125, 0.23486328125, 0.207763671875, 0.152587890625, 0.0057373046875, 0.0889892578125, 0.253662109375, 0.1015625, 0.09979248046875, 0.2327880859375, 0.2423095703125, 0.2254638671875, 0.1177978515625, 0.16455078125, 0.007354736328125, 0.017730712890625, 0.16064453125, 0.10...	embed
4635401_c0	4635401	prolog	0	Title: Implementing a model written in a Predicate Calculus into ProLog, how do I start? Problem title: Implementing a model written in a Predicate Calculus into ProLog, how do I start? Tags: artificial-intelligence, prolog Problem: Implementing a model written in a Predicate Calculus into ProLog, how do I start? I hav...	Implementing a model written in a Predicate Calculus into ProLog, how do I start? Implementing a model written in a Predicate Calculus into ProLog, how do I start? artificial-intelligence prolog Implementing Predicate Calculus ProLog Implementing a model written in a Predicate Calculus into ProLog, how do I start? I ha...	[ 0.0201416015625, 0.00872802734375, -0.0162353515625, 0.0255126953125, 0.00003600120544433594, 0.0458984375, 0.02294921875, -0.01300048828125, 0, -0.064453125, 0.0167236328125, -0.00201416015625, -0.0089111328125, -0.0181884765625, 0.0145263671875, -0.004791259765625, -0.0247802734375...	[ 153941, 214, 3299, 59121, 7145, 2063, 67, 212467, 223, 3934, 1250, 113972, 3642, 54, 87, 4034, 23, 66733, 130687, 502, 4867, 765, 22759, 5423, 234873, 3444, 237, 88996, 3871, 756, 71924, 5701, 28032, 12638, 28484, 3522, 110, 56037, 16981, ...	[ 0.233154296875, 0.0189208984375, 0.27001953125, 0.14990234375, 0.189697265625, 0.21923828125, 0.08428955078125, 0.2161865234375, 0.1348876953125, 0.1279296875, 0.1993408203125, 0.271484375, 0.03765869140625, 0.0115966796875, 0.004364013671875, 0.14794921875, 0.0009765625, 0.1229248...	embed
27844039_c0	27844039	prolog	0	Title: Summing an already outputted list Problem title: Summing an already outputted list Tags: prolog, logic Problem: Summing an already outputted list This is the knowledge base I am working with: localLib('AHorowitz','Stormbreaker',2). localLib('AHorowitz','Scorpia',4). localLib('AHorowitz','Ark Angel',6). The key f...	Summing an already outputted list Summing an already outputted list prolog logic the Summing AHorowitz Stormbreaker Scorpia Ark Angel Writer Book Acknowledgements sum_list Summing an already outputted list This is the knowledge base I am working with: The key for the knowledge base is as follows: I would like to write ...	[ 0.00982666015625, 0.01202392578125, 0.003692626953125, 0.0185546875, -0.0189208984375, 0.00897216796875, -0.0108642578125, 0.038818359375, 0.0184326171875, -0.0281982421875, 0.0263671875, -0.0115966796875, 0.01025390625, -0.0037384033203125, 0.02392578125, -0.00653076171875, 0.016967...	[ 1832, 58838, 21771, 140992, 3674, 5303, 142, 502, 4867, 62775, 12393, 147595, 115885, 70751, 56, 86590, 399, 63248, 26902, 2783, 27432, 69723, 181606, 10554, 6562, 51359, 3647, 20697, 22799, 1884, 33022, 79986, 15190, 756, 224344, 111, 70035, ...	[ 0.2174072265625, 0.21923828125, 0.2037353515625, 0.20068359375, 0.1322021484375, 0.2445068359375, 0.036407470703125, 0.1207275390625, 0.16845703125, 0.167236328125, 0.03485107421875, 0.161376953125, 0.05426025390625, 0.158203125, 0.0118408203125, 0.1002197265625, 0.0712890625, 0.10...	embed
56467776_c1	56467776	prolog	1	valid way to go about solving this problem. :-lib(ic). getNth(0, [ H \| T], H, T). getNth(Count, [ _ \| T], Target, Others):- NewCount is Count - 1, getNth(NewCount, T, Target, Others). assigned(_, [], TruthVal, TruthVal). assigned(Var, [Val \| OtherVals], CurTruthVal, TruthVal):- UpdatedTruthVal #= (CurTruthVal and (Var...	valid way to go about solving this problem. :-lib(ic). getNth(0, [ H \| T], H, T). getNth(Count, [ _ \| T], Target, Others):- NewCount is Count - 1, getNth(NewCount, T, Target, Others). assigned(_, [], TruthVal, TruthVal). assigned(Var, [Val \| OtherVals], CurTruthVal, TruthVal):- UpdatedTruthVal #= (CurTruthVal and (Var...	[ -0.0038299560546875, 0.00506591796875, 0.01220703125, 0.0220947265625, -0.00567626953125, 0.003875732421875, -0.0152587890625, 0.006683349609375, 0.00439453125, -0.04931640625, 0.012939453125, 0.0019989013671875, 0.004150390625, 0.00799560546875, -0.01458740234375, 0.000118255615234375...	[ 35604, 3917, 47, 738, 1672, 3115, 6496, 903, 2967, 5, 15772, 5612, 132, 1771, 194, 2046, 839, 927, 2389, 4, 572, 58745, 384, 268, 108210, 378, 101, 6, 160017, 64511, 7, 2077, 9, 2356, 83, 20, 106, 46568, 95486, 297, 184431, 42272, 8...	[ 0.21044921875, 0.1051025390625, 0.074462890625, 0.059417724609375, 0.150146484375, 0.2091064453125, 0.1639404296875, 0.1536865234375, 0.256103515625, 0.0751953125, 0.13232421875, 0.2496337890625, 0.0660400390625, 0.2225341796875, 0.034423828125, 0.15576171875, 0.10205078125, 0.2302...	embed
41025065_c1	41025065	prolog	1	Goals, Goal) :- % Select Goal from Goals member( Goal, Goals). % A simple selection principle achieves( Action, Goal) :- adds( Action, Goals), member( Goal, Goals). preserves( Action, Goals) :- % Action does not destroy Goals deletes( Action, Relations), not((member( Goal, Relations), member( Goal, Goals))). regress( ...	Goals, Goal) :- % Select Goal from Goals member( Goal, Goals). % A simple selection principle achieves( Action, Goal) :- adds( Action, Goals), member( Goal, Goals). preserves( Action, Goals) :- % Action does not destroy Goals deletes( Action, Relations), not((member( Goal, Relations), member( Goal, Goals))). regress( ...	[ -0.01708984375, 0.03466796875, 0.00994873046875, 0.01318359375, -0.0174560546875, -0.015869140625, -0.01348876953125, -0.01312255859375, 0.0196533203125, 0.007598876953125, 0.01080322265625, 0.026123046875, -0.0289306640625, -0.005157470703125, -0.00933837890625, 0.01025390625, -0.00...	[ 2016, 16765, 4, 289, 16, 15772, 1745, 51620, 1295, 32786, 132, 194, 8781, 132216, 24702, 133, 69307, 57945, 15190, 479, 86687, 959, 163684, 8, 74635, 116822, 27417, 45167, 7, 19623, 17903, 853, 8305, 2356, 4332, 57860, 154109, 5584, 49756, ...	[ 0.2783203125, 0.252197265625, 0.11181640625, 0.2303466796875, 0.007537841796875, 0.096435546875, 0.1312255859375, 0.2001953125, 0.07958984375, 0.1978759765625, 0.0266876220703125, 0.029571533203125, 0.161376953125, 0.2352294921875, 0.1962890625, 0.1131591796875, 0.1876220703125, 0....	embed
49842319_c0	49842319	prolog	0	Title: Logic gate AND in swi-prolog Problem title: Logic gate AND in swi-prolog Tags: prolog, boolean-logic Problem: Logic gate AND in swi-prolog How do I get for the following Prolog program and(1,1,1). and(1,0,0). and(0,1,0). and(0,0,0). respective the following answer ?- and(A,B,C). A=1, B=1, C=1; A=1, B=0, C=0; A=0...	Logic gate AND in swi-prolog Logic gate AND in swi-prolog prolog boolean-logic Logic GNU Prolog Compiled Feb Daniel Diaz Copyright Logic gate AND in swi-prolog How do I get for the following Prolog program respective the following answer When I try to run the program above I get the following result It seems to be corr...	[ 0.0157470703125, 0.022216796875, 0.00927734375, 0.0068359375, -0.01116943359375, 0.00860595703125, -0.01470947265625, 0.0120849609375, -0.01153564453125, -0.0028228759765625, -0.0011444091796875, -0.016845703125, -0.03271484375, 0.012939453125, 0.0250244140625, 0.010009765625, 0.0216...	[ 50592, 238, 70836, 48762, 91, 2452, 3454, 4867, 23, 502, 31, 34677, 137043, 165132, 1250, 4512, 4189, 2046, 100, 25632, 1528, 107013, 35166, 9790, 11675, 36917, 16750, 37202, 26785, 3444, 765, 77336, 84751, 27781, 4734, 34627, 3309, 237, 84...	[ 0.189208984375, 0.0577392578125, 0.177978515625, 0.253662109375, 0.023345947265625, 0.2025146484375, 0.1417236328125, 0.2213134765625, 0.002655029296875, 0.1175537109375, 0.045074462890625, 0.1220703125, 0.155517578125, 0.130859375, 0.15234375, 0.00103759765625, 0.0704345703125, 0....	embed
64449596_c0	64449596	prolog	0	Title: Prolog, display list result, after algorithm Problem title: Prolog, display list result, after algorithm Tags: recursion, prolog Problem: Prolog, display list result, after algorithm I got a list of names, and according to whom owns what, I want to split it in 2 different list. I debugged my code and it seems to...	Prolog, display list result, after algorithm Prolog, display list result, after algorithm recursion prolog Prolog What Prolog, display list result, after algorithm I got a list of names, and according to whom owns what, I want to split it in 2 different list. I debugged my code and it seems to work, but the console is ...	[ 0.024658203125, -0.00074005126953125, 0.037353515625, 0.007598876953125, 0.0010833740234375, 0.00494384765625, 0.00372314453125, 0.0169677734375, 0.0037078857421875, 0.0027313232421875, 0.0128173828125, 0.01446533203125, -0.0084228515625, 0.01397705078125, 0.0033721923828125, 0.0159912...	[ 1250, 4867, 44116, 5303, 16750, 7103, 234873, 195625, 1830, 502, 4865, 4163, 123055, 59499, 136565, 10002, 2367, 3444, 65450, 23, 116, 12921, 8, 978, 18151, 37202, 4488, 1284, 130250, 11343, 30646, 29568, 60075, 13, 3358, 2203, 236, 66, 148...	[ 0.206787109375, 0.2880859375, 0.2037353515625, 0.225341796875, 0.2059326171875, 0.158203125, 0.259765625, 0.2049560546875, 0.067626953125, 0.1558837890625, 0.0355224609375, 0.005828857421875, 0.15283203125, 0.0178375244140625, 0.086181640625, 0.1441650390625, 0.07769775390625, 0.07...	embed
6283849_c0	6283849	prolog	0	Title: Prolog out of global stack Problem title: Prolog out of global stack Tags: list, stack, prolog, overflow Problem: Prolog out of global stack Hi guys i'm new on Prolog. I'm trying to combine 1000 elements in class 3 without repetition. I have done the code, but i have out of stack problem. member(T, [T\|R], R) :- ...	Prolog out of global stack Prolog out of global stack list stack prolog overflow Prolog last_element percentuale_macronutrienti Alimento NRAlimenti RIS PMR RParz Index Index1 RIS1 OldR Risultato TOldR LastElement Alimento1 OldM TOldM NewM Prolog out of global stack Hi guys i'm new on Prolog. I'm trying to combine 1000 ...	[ -0.00341796875, 0.0157470703125, -0.0145263671875, 0.005645751953125, -0.00543212890625, 0.00421142578125, -0.02099609375, 0.011474609375, 0.0126953125, -0.0322265625, 0.018798828125, -0.001983642578125, 0.0264892578125, -0.0201416015625, 0.015625, -0.0048828125, 0.0045166015625, -...	[ 1250, 4867, 1810, 111, 7964, 177261, 5303, 502, 645, 118664, 4568, 62766, 172345, 143674, 21616, 2132, 2611, 6210, 60330, 45956, 1052, 169, 31471, 75876, 21672, 19929, 25074, 594, 2356, 51484, 3525, 98, 31577, 70163, 4382, 80854, 18507, 138, ...	[ 0.187255859375, 0.297607421875, 0.1885986328125, 0.21826171875, 0.236083984375, 0.285888671875, 0.152587890625, 0.124755859375, 0.08416748046875, 0.191162109375, 0.1162109375, 0.161376953125, 0.1395263671875, 0.112548828125, 0.036376953125, 0.07708740234375, 0.1417236328125, 0.0763...	embed
21841631_c0	21841631	prolog	0	Title: swi Prolog - Error arguments not sufficiently Instantiated Problem title: swi Prolog - Error arguments not sufficiently Instantiated Tags: instantiation-error, prolog Problem: swi Prolog - Error arguments not sufficiently Instantiated I am new to Prolog and when I query sortedUnion([1,1,1,2,3,4,4,5], [0,1,3,3,6,...	swi Prolog - Error arguments not sufficiently Instantiated swi Prolog - Error arguments not sufficiently Instantiated instantiation-error prolog L Prolog Error Instantiated Exception _G114 _G162 _G201 _G231 _G243 _G249 _G297 _G336 _G357 _G369 swi Prolog - Error arguments not sufficiently Instantiated I am new to Prolog...	[ 0.004791259765625, 0.03271484375, 0.0198974609375, -0.03466796875, -0.0118408203125, -0.00167083740234375, -0.00970458984375, -0.02294921875, 0.006988525390625, -0.013427734375, 0.007415771484375, 0.007568359375, 0.004119873046875, 0.00144195556640625, -0.0034637451171875, 0.0033416748...	[ 91, 2452, 1250, 4867, 212059, 10750, 7, 959, 129980, 538, 166945, 14, 27686, 34648, 188800, 502, 339, 5443, 63928, 129150, 2485, 304, 123885, 5016, 2357, 363, 1126, 142173, 8659, 115021, 125832, 3525, 41, 1294, 17497, 71, 147547, 132, 1065,...	[ 0.042022705078125, 0.2239990234375, 0.1915283203125, 0.2239990234375, 0.194580078125, 0.238525390625, 0.033935546875, 0.133056640625, 0.19287109375, 0.051788330078125, 0.136962890625, 0.1171875, 0.0765380859375, 0.08966064453125, 0.1666259765625, 0.1385498046875, 0.108154296875, 0....	embed
44609416_c0	44609416	prolog	0	Title: Prolog integer comparison fails with error_type error Problem title: Prolog integer comparison fails with error_type error Tags: prolog Problem: Prolog integer comparison fails with error_type error I am trying to resolve exercise 2 of lists construction section of this page : Write a program to delete all refer...	Prolog integer comparison fails with error_type error Prolog integer comparison fails with error_type error prolog Prolog error_type delete_all Result ThrowAway Tail type_error Prolog integer comparison fails with error_type error I am trying to resolve exercise 2 of lists construction section of this page : Here is th...	[ -0.00872802734375, 0.0027618408203125, 0.00860595703125, 0.01025390625, 0.00159454345703125, 0.007232666015625, -0.00872802734375, -0.0152587890625, -0.00177001953125, 0.00408935546875, 0.02685546875, -0.0128173828125, 0.0128173828125, 0.01495361328125, 0.0230712890625, -0.0146484375, ...	[ 1250, 4867, 892, 1505, 225490, 35782, 678, 18499, 50986, 502, 154109, 5584, 126684, 15555, 7514, 1218, 379, 10644, 188800, 103608, 81979, 5303, 50961, 26499, 26785, 50339, 275, 71, 7, 7136, 175399, 903, 17368, 706, 3454, 1379, 198996, 6849, ...	[ 0.174072265625, 0.2210693359375, 0.10791015625, 0.035675048828125, 0.2008056640625, 0.1458740234375, 0.05181884765625, 0.15380859375, 0.189208984375, 0.1297607421875, 0.1959228515625, 0.1419677734375, 0.203857421875, 0.0963134765625, 0.154296875, 0.1234130859375, 0.09722900390625, ...	embed
14044146_c1	14044146	prolog	1	tuesday, 2, cse115, monday, 1, cse116, monday, 2, cse117, tuesday, 1, cse118, tuesday, 2] I wrote a code that has no constraints: course(cse111,1). course(cse112,1). course(cse113,1). course(cse114,1). course(cse115,2). course(cse116,2). course(cse117,2). course(cse118,2). slot(monday,1). slot(monday,2). slot(tuesday,...	tuesday, 2, cse115, monday, 1, cse116, monday, 2, cse117, tuesday, 1, cse118, tuesday, 2] I wrote a code that has no constraints: course(cse111,1). course(cse112,1). course(cse113,1). course(cse114,1). course(cse115,2). course(cse116,2). course(cse117,2). course(cse118,2). slot(monday,1). slot(monday,2). slot(tuesday,...	[ 0.0067138671875, 0.0185546875, 0.0146484375, 0.0272216796875, -0.034423828125, -0.00994873046875, -0.01806640625, -0.00506591796875, 0.0037078857421875, -0.0194091796875, -0.01226806640625, -0.015380859375, -0.00799560546875, -0.0012359619140625, -0.01092529296875, 0.0164794921875, 0...	[ 370, 90, 5636, 4, 116, 501, 184, 103928, 149550, 53, 106, 120620, 115250, 116329, 268, 87, 54397, 18151, 1556, 110, 158, 2816, 4288, 15411, 67130, 97024, 17727, 88438, 116597, 129150, 10461, 24897, 119720, 458, 94957, 56, 331, 1991, 80889, ...	[ 0.16259765625, 0.138916015625, 0.1492919921875, 0.0361328125, 0.168212890625, 0.054412841796875, 0.123291015625, 0.25341796875, 0.1546630859375, 0.1341552734375, 0.1138916015625, 0.2095947265625, 0.214599609375, 0.2015380859375, 0.03497314453125, 0.061737060546875, 0.1082763671875, ...	embed
15858067_c0	15858067	prolog	0	Title: Inserting X in its correct position in a sorted list while reading Problem title: Inserting X in its correct position in a sorted list while reading Tags: prolog, insertion-sort Problem: Inserting X in its correct position in a sorted list while reading I tried a lot to think how I can add a value in a sorted li...	Inserting X in its correct position in a sorted list while reading Inserting X in its correct position in a sorted list while reading prolog insertion-sort Inserting input.txt Str read_file Lines Stream at_end_of_stream Sorted Sorted1 Inserting X in its correct position in a sorted list while reading I tried a lot to t...	[ -0.00909423828125, -0.01446533203125, 0.018798828125, -0.0147705078125, -0.00872802734375, 0.0142822265625, -0.004608154296875, -0.0244140625, -0.0002899169921875, -0.01434326171875, 0.01708984375, -0.0076904296875, -0.0296630859375, -0.020263671875, 0.0169677734375, 0.005218505859375,...	[ 360, 2189, 1916, 1193, 23, 6863, 26785, 19069, 17497, 71, 5303, 12960, 16454, 502, 4867, 241860, 62351, 107730, 124326, 23351, 12301, 29822, 16777, 115061, 3611, 86429, 53666, 297, 10, 37842, 5915, 3642, 831, 15190, 34292, 26366, 8110, 1295, ...	[ 0.09442138671875, 0.1943359375, 0.06488037109375, 0.210205078125, 0.07080078125, 0.0701904296875, 0.1572265625, 0.168212890625, 0.2108154296875, 0.106689453125, 0.2069091796875, 0.12939453125, 0.224365234375, 0.136474609375, 0.1990966796875, 0.1749267578125, 0.195068359375, 0.16491...	embed
38649534_c0	38649534	prolog	0	Title: Using list instead of multiple clauses to enumerate data Problem title: Using list instead of multiple clauses to enumerate data Tags: prolog Problem: Using list instead of multiple clauses to enumerate data I want to make a Prolog program where I have a "Person" that "Watched" "Movies". And I want to write it l...	Using list instead of multiple clauses to enumerate data Using list instead of multiple clauses to enumerate data prolog Using Thor Captain America Using list instead of multiple clauses to enumerate data I want to make a Prolog program where I have a "Person" that "Watched" "Movies". And I want to write it like watche...	[ -0.0017547607421875, 0.0263671875, 0.0174560546875, 0.02392578125, -0.0026702880859375, 0.013427734375, -0.015869140625, 0.02197265625, 0.006317138671875, -0.03564453125, -0.0169677734375, -0.0067138671875, 0.00714111328125, -0.006591796875, -0.0167236328125, -0.009521484375, 0.03417...	[ 345, 6953, 5303, 64457, 48716, 70731, 90, 189085, 67, 2053, 502, 4867, 38692, 154564, 21629, 3444, 3249, 1250, 1528, 160054, 156378, 187430, 33022, 1884, 192509, 30816, 18151, 136036, 106, 14277, 116, 11001, 72304, 117, 3445, 32562, 71358, 12...	[ 0.10498046875, 0.037017822265625, 0.258056640625, 0.132080078125, 0.16796875, 0.213134765625, 0.09759521484375, 0.236083984375, 0.1339111328125, 0.1881103515625, 0.175537109375, 0.215087890625, 0.19287109375, 0.1815185546875, 0.177978515625, 0.043914794921875, 0.0153045654296875, 0...	embed
32844538_c0	32844538	prolog	0	Title: Prolog why is there a redo here? Problem title: Prolog why is there a redo here? Tags: prolog, recursion Problem: Prolog why is there a redo here? So, I have this code: shuffle([],[],[]). shuffle([], Shuffled, Rest):- listReverse(Rest, RestRes), shuffle(RestRes, Shuffled, []). shuffle([A\|[]], [A\|Shuffled], Rest)...	Prolog why is there a redo here? Prolog why is there a redo here? prolog recursion Prolog Shuffled Rest RestRes List Redo Call _2668 _2693 Exit _2604 Prolog why is there a redo here? So, I have this code: And helper: It works fine, when I call: I get: X = [1,3,2] but then there is a questionmark "?", and if I press ";"...	[ 0.00024318695068359375, 0.01336669921875, 0.0213623046875, -0.0030517578125, -0.021728515625, -0.00020694732666015625, -0.02001953125, 0.0069580078125, 0.007537841796875, 0.0130615234375, 0.020263671875, 0.013671875, 0.007568359375, 0.0125732421875, 0.0208740234375, 0.0115966796875, ...	[ 1250, 4867, 15400, 83, 2685, 10, 41313, 3688, 502, 195625, 1830, 13684, 4902, 6259, 49756, 4332, 7, 32036, 6096, 31, 26265, 180695, 4046, 11591, 5443, 217, 7709, 18151, 4358, 56, 43240, 5885, 11782, 1193, 2203, 363, 90173, 9655, 10015, 29...	[ 0.1815185546875, 0.2646484375, 0.154541015625, 0.079833984375, 0.1171875, 0.1151123046875, 0.314697265625, 0.166015625, 0.1466064453125, 0.1788330078125, 0.00970458984375, 0.039886474609375, 0.142333984375, 0.093505859375, 0.1689453125, 0.1396484375, 0.0198822021484375, 0.158203125...	embed
52802222_c0	52802222	prolog	0	Title: Create a list by selecting 1 element from each list (prolog) Problem title: Create a list by selecting 1 element from each list (prolog) Tags: prolog Problem: Create a list by selecting 1 element from each list (prolog) I have a list that contains lists. I want to create a list of permutation. Example: generate_...	Create a list by selecting 1 element from each list (prolog) Create a list by selecting 1 element from each list (prolog) prolog each Create generate_perm Perm Perm2 Call _4961 Exit _56173 _138349 Create a list by selecting 1 element from each list (prolog) I have a list that contains lists. I want to create a list of ...	[ -0.00982666015625, 0.0233154296875, 0.0115966796875, -0.00677490234375, -0.01495361328125, -0.005615234375, -0.031494140625, 0, 0.01519775390625, -0.0225830078125, 0.007659912109375, 0.0115966796875, 0.0157470703125, 0.02880859375, -0.0201416015625, -0.0146484375, 0.015625, 0.00711...	[ 151313, 5303, 36849, 106, 12830, 1295, 12638, 3454, 4867, 502, 139392, 1264, 39, 908, 304, 26265, 186410, 418, 5443, 217, 155128, 13574, 117760, 390, 214, 70541, 3444, 28282, 117, 561, 22062, 140992, 653, 927, 83, 107730, 37842, 32786, 7413...	[ 0.1243896484375, 0.2227783203125, 0.1280517578125, 0.116943359375, 0.180419921875, 0.06842041015625, 0.1026611328125, 0.125, 0.1798095703125, 0.130859375, 0.1961669921875, 0.1883544921875, 0.15478515625, 0.16064453125, 0.076904296875, 0.09405517578125, 0.0977783203125, 0.0151519775...	embed
54369699_c1	54369699	prolog	1	mul_op, term(Term). term(term(Factor, div_op, Term)) --> factor(Factor), div_op, term(Term). term(term(Factor)) --> factor(Factor). factor(factor('(', Expr, ')')) --> '(', expr(Expr), ')'. factor(factor(Digit)) --> digit_code(Digit). add_op --> ['+']. sub_op --> ['-']. mul_op --> ['*']. div_op --> ['/']. letter_code a...	mul_op, term(Term). term(term(Factor, div_op, Term)) --> factor(Factor), div_op, term(Term). term(term(Factor)) --> factor(Factor). factor(factor('(', Expr, ')')) --> '(', expr(Expr), ')'. factor(factor(Digit)) --> digit_code(Digit). add_op --> ['+']. sub_op --> ['-']. mul_op --> ['*']. div_op --> ['/']. letter_code a...	[ 0.0267333984375, 0.013671875, -0.006378173828125, 0.0072021484375, 0.0013275146484375, 0.0123291015625, -0.00130462646484375, 0.013916015625, 0.00604248046875, -0.018310546875, 0.005889892578125, 0.00372314453125, 0.000949859619140625, -0.014892578125, 0.00093841552734375, 0.0034332275...	[ 16690, 454, 2146, 13579, 35484, 39, 32166, 135518, 1290, 18221, 2994, 16, 129908, 31461, 247, 4, 194, 144810, 132, 25, 60075, 42, 242, 14700, 19279, 10287, 5, 14055, 15769, 153939, 40899, 15190, 378, 1328, 268, 1614, 9, 1639, 64, 31330, ...	[ 0.223388671875, 0.08984375, 0.2445068359375, 0.175048828125, 0.1141357421875, 0.06829833984375, 0.112060546875, 0.1068115234375, 0.09228515625, 0.1888427734375, 0.06689453125, 0.011077880859375, 0.011505126953125, 0.204833984375, 0.01116943359375, 0.011077880859375, 0.01092529296875,...	embed
38065630_c0	38065630	prolog	0	Title: How to call a method from Prolog file in PHP Problem title: How to call a method from Prolog file in PHP Tags: php, swi-prolog, prolog, bash Problem: How to call a method from Prolog file in PHP I'm trying to incorporate ProLog to a PHP project that I have to do for a class in the university. The thing is that I...	How to call a method from Prolog file in PHP How to call a method from Prolog file in PHP php swi-prolog prolog bash Prolog How PHP testing.pl test1:-write Hello World How to call a method from Prolog file in PHP I'm trying to incorporate ProLog to a PHP project that I have to do for a class in the university. The thin...	[ 0.01226806640625, 0.0181884765625, 0.00341796875, 0.0198974609375, 0.005340576171875, 0.01251220703125, 0.005828857421875, -0.0081787109375, -0.002197265625, -0.058837890625, 0.01177978515625, 0.01904296875, -0.0225830078125, -0.0027313232421875, -0.00128173828125, -0.0196533203125, ...	[ 11249, 11782, 55300, 1295, 1250, 4867, 11435, 23, 47302, 47, 10, 3958, 91, 2452, 3454, 502, 87109, 134234, 2424, 3034, 82825, 434, 18781, 35378, 6661, 49504, 113972, 13452, 18507, 152363, 157318, 2665, 35773, 75101, 71924, 678, 46480, 238, ...	[ 0.0833740234375, 0.221923828125, 0.261962890625, 0.1435546875, 0.20849609375, 0.273681640625, 0.19775390625, 0.047332763671875, 0.2724609375, 0.0792236328125, 0.0207672119140625, 0.1773681640625, 0.0144500732421875, 0.1400146484375, 0.1500244140625, 0.165283203125, 0.1480712890625, ...	embed
50913440_c0	50913440	prolog	0	Title: When I use the installer in swi-prolog to install the aleph, I got the ERROR: source_sink `path(git)' does not exist Problem title: When I use the installer in swi-prolog to install the aleph, I got the ERROR: source_sink `path(git)' does not exist Tags: prolog, aleph-ilp Problem: When I use the instal...	When I use the installer in swi-prolog to install the aleph, I got the ERROR: source_sink `path(git)' does not exist When I use the installer in swi-prolog to install the aleph, I got the ERROR: source_sink `path(git)' does not exist prolog aleph-ilp GIT When ERROR source_sink pack_install Contacting www.swi-...	[ 0.0159912109375, 0.0203857421875, -0.00092315673828125, 0.01470947265625, -0.0185546875, 0.008056640625, 0.01312255859375, 0.0020599365234375, -0.01611328125, -0.0228271484375, 0.024658203125, -0.0177001953125, -0.004180908203125, -0.00360107421875, 0.01556396484375, -0.000207901000976...	[ 4527, 74022, 91, 2452, 3454, 4867, 20600, 662, 11727, 151206, 24638, 31344, 7, 14068, 128405, 15769, 3768, 14602, 959, 32316, 70, 502, 379, 254, 527, 6371, 43824, 80383, 107951, 62270, 32102, 116311, 188800, 84453, 9433, 63923, 7612, 304, 1...	[ 0.009674072265625, 0.1900634765625, 0.0228424072265625, 0.195068359375, 0.143310546875, 0.2158203125, 0.1759033203125, 0.132080078125, 0.2244873046875, 0.155517578125, 0.14111328125, 0.2398681640625, 0.107421875, 0.2188720703125, 0.2149658203125, 0.2484130859375, 0.1685791015625, 0...	embed
13100364_c0	13100364	prolog	0	Title: DCG Expansion: Is Steadfastness ignored? Problem title: DCG Expansion: Is Steadfastness ignored? Tags: dcg, prolog, iso-prolog Problem: DCG Expansion: Is Steadfastness ignored? Assume I have the following DCG rule: factor(X) --> "(", expr(X), ")". Normally this would be translated to: factor(X, A, B) :- [40\|C] =...	DCG Expansion: Is Steadfastness ignored? DCG Expansion: Is Steadfastness ignored? dcg prolog iso-prolog DCG Expansion Steadfastness DCG Expansion: Is Steadfastness ignored? Assume I have the following DCG rule: Normally this would be translated to: Would a Prolog system be allowed to translate it as follows, i.e. to me...	[ 0.04296875, 0.005401611328125, -0.00787353515625, 0.0240478515625, 0.01458740234375, 0.001983642578125, -0.00537109375, 0.007354736328125, -0.0025482177734375, -0.007354736328125, 0.00142669677734375, 0.006866455078125, -0.0113525390625, 0.0030059814453125, 0, 0.01519775390625, -0.00...	[ 391, 56367, 60075, 66, 8694, 712, 39473, 7432, 124962, 71, 6889, 177, 502, 4867, 13882, 3454, 66596, 79986, 3900, 143, 1250, 5426, 107003, 19309, 28960, 42564, 51, 41274, 10336, 136, 69236, 14700, 959, 2288, 3884, 8894, 58745, 571, 50960, ...	[ 0.0877685546875, 0.1884765625, 0.0670166015625, 0.13623046875, 0.1688232421875, 0.177001953125, 0.239013671875, 0.1060791015625, 0.13134765625, 0.03857421875, 0.01849365234375, 0.0838623046875, 0.086181640625, 0.2022705078125, 0.0285797119140625, 0.06707763671875, 0.00244140625, 0....	embed
2978167_c0	2978167	prolog	0	Title: Prolog lists and parameters and return values Problem title: Prolog lists and parameters and return values Tags: prolog, list, parameters Problem: Prolog lists and parameters and return values I'm new to prolog and I just can't figure this out. I'm trying to build a simple program that receives a list of predica...	Prolog lists and parameters and return values Prolog lists and parameters and return values prolog list parameters search Prolog pred1 pred2 list1 Out Prolog lists and parameters and return values I'm new to prolog and I just can't figure this out. I'm trying to build a simple program that receives a list of predicates...	[ 0.007080078125, -0.0023956298828125, -0.00201416015625, 0.0052490234375, -0.0198974609375, 0.0303955078125, 0.0096435546875, 0.01495361328125, 0.01123046875, -0.050048828125, 0.0159912109375, -0.016845703125, -0.025390625, -0.013427734375, 0.0169677734375, -0.007080078125, 0.01519775...	[ 1250, 4867, 5303, 136, 171859, 30646, 142424, 502, 33938, 1653, 418, 304, 13538, 3525, 26366, 31577, 45367, 8781, 1528, 53299, 2063, 29458, 4027, 32354, 3444, 4527, 756, 2806, 1295, 151814, 19714, 1723, 254, 6562, 37842, 76199, 29568, 116, ...	[ 0.2047119140625, 0.277587890625, 0.2421875, 0.034515380859375, 0.2406005859375, 0.242919921875, 0.220703125, 0.174560546875, 0.171142578125, 0.168701171875, 0.013946533203125, 0.0986328125, 0.2291259765625, 0.0263671875, 0.042816162109375, 0.029876708984375, 0.07525634765625, 0.061...	embed
69989726_c0	69989726	prolog	0	Title: Slicing the list in prolog between two indexes Problem title: Slicing the list in prolog between two indexes Tags: list, slice, prolog Problem: Slicing the list in prolog between two indexes I'm trying to slice a list, and create a result list that contains elements that fall between two indices, exclusive. inde...	Slicing the list in prolog between two indexes Slicing the list in prolog between two indexes list slice prolog Slicing Element Tail Index Index1 Check less_than greater_than Ind Slicing the list in prolog between two indexes I'm trying to slice a list, and create a result list that contains elements that fall between ...	[ -0.0174560546875, 0.02099609375, 0.0130615234375, 0.013916015625, -0.0242919921875, 0.01019287109375, -0.010009765625, 0.0140380859375, 0.01507568359375, -0.007080078125, 0.0069580078125, 0.003631591796875, -0.038330078125, -0.0030670166015625, 0.00921630859375, -0.01104736328125, 0....	[ 103216, 21896, 5303, 502, 4867, 17721, 6626, 63262, 23, 13348, 48325, 1218, 379, 31471, 418, 38679, 40715, 21732, 117396, 14489, 31577, 91, 28282, 16750, 80854, 6817, 136044, 97629, 11, 71, 757, 4, 201, 627, 5608, 275, 238, 11343, 35782, ...	[ 0.178955078125, 0.082275390625, 0.1884765625, 0.142578125, 0.218994140625, 0.15087890625, 0.130126953125, 0.2027587890625, 0.011444091796875, 0.207763671875, 0.1212158203125, 0.1142578125, 0.103759765625, 0.1898193359375, 0.0301513671875, 0.1219482421875, 0.1513671875, 0.0985107421...	embed
40088552_c1	40088552	prolog	1	/2 behaves as once/1 with respect to the guarded goal. This means that our predicate address/2 is no longer a nice logical non-deterministic relation. Having to give up "nice logical non-deterministic relations" in order to preserve validity seems like a bad bargain, since nice logical non-deterministic relations are t...	/2 behaves as once/1 with respect to the guarded goal. This means that our predicate address/2 is no longer a nice logical non-deterministic relation. Having to give up "nice logical non-deterministic relations" in order to preserve validity seems like a bad bargain, since nice logical non-deterministic relations are t...	[ 0.01422119140625, 0.00836181640625, 0.006500244140625, 0.00323486328125, -0.0057373046875, 0.0225830078125, 0.00001537799835205078, -0.01116943359375, 0.01177978515625, -0.06396484375, 0.01507568359375, 0.02880859375, -0.01495361328125, 0.0059814453125, 0.0103759765625, 0.0172119140625...	[ 12477, 186, 68991, 7, 237, 24145, 11583, 678, 15072, 47, 56050, 297, 69236, 26950, 1653, 2063, 67, 29823, 110, 51713, 26267, 62775, 289, 351, 112, 30524, 48242, 41911, 3466, 91582, 479, 86687, 35604, 2481, 37202, 6494, 208, 24702, 92940, ...	[ 0.2626953125, 0.092041015625, 0.2012939453125, 0.0491943359375, 0.17529296875, 0.2225341796875, 0.160888671875, 0.013641357421875, 0.0885009765625, 0.002838134765625, 0.1505126953125, 0.061279296875, 0.2071533203125, 0.02484130859375, 0.133544921875, 0.16015625, 0.1334228515625, 0....	embed
13679215_c0	13679215	prolog	0	Title: Prolog -how to implement a nested function in prolog? Problem title: Prolog -how to implement a nested function in prolog? Tags: prolog Problem: Prolog -how to implement a nested function in prolog? I need to write rules below: Write the rules for a predicate take(L,N,L1), which succeeds if list L1 contains the ...	Prolog -how to implement a nested function in prolog? Prolog -how to implement a nested function in prolog? prolog Prolog X-1 Prolog -how to implement a nested function in prolog? I need to write rules below: Write the rules for a predicate take(L,N,L1), which succeeds if list L1 contains the first N elements of list L...	[ 0.002166748046875, 0.0185546875, 0.005615234375, 0.00933837890625, -0.00168609619140625, 0.01373291015625, 0.00238037109375, 0.01513671875, 0.0194091796875, -0.031982421875, 0.0203857421875, -0.014892578125, -0.0201416015625, 0.00958251953125, 0.02783203125, -0.00151824951171875, 0.0...	[ 1250, 4867, 47251, 29479, 8512, 71, 32354, 23, 502, 1193, 5759, 33022, 91736, 35064, 601, 18781, 1653, 2063, 67, 5646, 866, 839, 17727, 214493, 5303, 339, 418, 70541, 5117, 541, 80854, 5701, 12989, 41, 27781, 17368, 6528, 154109, 14012, 6...	[ 0.158203125, 0.245361328125, 0.055938720703125, 0.19921875, 0.287841796875, 0.1693115234375, 0.210693359375, 0.07940673828125, 0.172119140625, 0.062286376953125, 0.1033935546875, 0.0692138671875, 0.1595458984375, 0.03076171875, 0.004180908203125, 0.0281524658203125, 0.1258544921875, ...	embed
41210049_c1	41210049	prolog	1	to be consecutive, but i dont know how to do it. This code is what we have but it's not working: conseqNumber(_, _, 0, _, _). conseqNumber(Programation, SlotIndex, SlotsNumber, Size, SerieId):- SlotIndex #=< Size, element(SlotIndex, Programation, SerieId2), SerieId2 #= SerieId, SlotIndexAux #= SlotIndex +1, SlotsNumbe...	to be consecutive, but i dont know how to do it. This code is what we have but it's not working: conseqNumber(_, _, 0, _, _). conseqNumber(Programation, SlotIndex, SlotsNumber, Size, SerieId):- SlotIndex #=< Size, element(SlotIndex, Programation, SerieId2), SerieId2 #= SerieId, SlotIndexAux #= SlotIndex +1, SlotsNumbe...	[ -0.01251220703125, -0.01416015625, 0.0035858154296875, 0.0245361328125, -0.0101318359375, 0.005035400390625, -0.00933837890625, 0.028076171875, 0.031494140625, -0.03515625, -0.0245361328125, 0.00970458984375, -0.01251220703125, 0.005218505859375, 0.0035858154296875, 0.00408935546875, ...	[ 47, 186, 148390, 13, 1284, 17, 13319, 3714, 3642, 54, 442, 3293, 18151, 2367, 642, 765, 959, 20697, 158, 184, 864, 18444, 26278, 454, 101, 757, 148968, 69623, 4153, 39659, 143745, 80378, 45378, 568, 71, 16093, 12830, 12631, 7663, 10461, ...	[ 0.1014404296875, 0.1156005859375, 0.29833984375, 0.1566162109375, 0.013397216796875, 0.005462646484375, 0.0633544921875, 0.0791015625, 0.07257080078125, 0.0736083984375, 0.054046630859375, 0.0560302734375, 0.2037353515625, 0.0215911865234375, 0.00885009765625, 0.059478759765625, 0.07...	embed
4416830_c0	4416830	prolog	0	Title: Prolog, optimize generation Problem title: Prolog, optimize generation Tags: prolog, optimization Problem: Prolog, optimize generation I wrote a prolog program which generates all possible positions of elements in a two-dimensional table. The number of elements and the table size are given. My code: geni(Min, Mi...	Prolog, optimize generation Prolog, optimize generation prolog optimization Prolog Min Max MinInc TSize Tail NDec N-1 Prolog, optimize generation I wrote a prolog program which generates all possible positions of elements in a two-dimensional table. The number of elements and the table size are given. My code: (where T...	[ -0.0013275146484375, 0.00180816650390625, 0.008544921875, -0.01513671875, -0.0172119140625, -0.00823974609375, 0.0021514892578125, -0.00537109375, -0.002685546875, -0.0242919921875, 0.01416015625, 0.0220947265625, -0.0172119140625, -0.01513671875, 0, -0.000766754150390625, 0.01867675...	[ 1250, 4867, 4, 15572, 20650, 58093, 502, 87235, 4211, 9920, 4153, 53800, 1218, 379, 541, 120152, 5759, 54397, 1528, 139392, 756, 7722, 19069, 80854, 6626, 157955, 23180, 14012, 13267, 34475, 18151, 83, 4568, 16750, 7145, 2063, 67, 33781, 11...	[ 0.185791015625, 0.248779296875, 0.0006103515625, 0.1630859375, 0.19287109375, 0.212890625, 0.1380615234375, 0.1810302734375, 0.1336669921875, 0.106689453125, 0.0406494140625, 0.0304107666015625, 0.07049560546875, 0.0947265625, 0.055419921875, 0.1844482421875, 0.1043701171875, 0.087...	embed
69655489_c0	69655489	prolog	0	Title: Predicate order change causes infinite loop Problem title: Predicate order change causes infinite loop Tags: prolog, failure-slice Problem: Predicate order change causes infinite loop So I've got a predicate that works for uninstantiated variables nat_cset(N,Cs) that relates a natural number with the counting se...	Predicate order change causes infinite loop Predicate order change causes infinite loop prolog failure-slice Predicate nat_cset nat_cset_ Acc N_1 Predicate order change causes infinite loop So I've got a predicate that works for uninstantiated variables nat_cset(N,Cs) that relates a natural number with the counting set...	[ 0.021728515625, -0.005767822265625, 0.0201416015625, 0.0185546875, 0.0252685546875, -0.002960205078125, 0.0225830078125, -0.0026397705078125, 0.023681640625, -0.033935546875, 0.0250244140625, 0.0208740234375, -0.0140380859375, -0.00016689300537109375, 0.0235595703125, 0.0245361328125, ...	[ 7145, 2063, 67, 12989, 15549, 113660, 54241, 13, 40956, 502, 4867, 137578, 13348, 24, 18, 4439, 126, 29899, 541, 115187, 1653, 43240, 143034, 77336, 839, 33444, 6083, 14012, 54529, 5423, 19, 133063, 156672, 41, 1294, 2203, 2289, 30957, 1296...	[ 0.1541748046875, 0.1949462890625, 0.0748291015625, 0.1878662109375, 0.16943359375, 0.1361083984375, 0.137451171875, 0.03570556640625, 0.2034912109375, 0.132080078125, 0.1854248046875, 0.1778564453125, 0.09539794921875, 0.1077880859375, 0.1011962890625, 0.06494140625, 0.1224365234375,...	embed
36951657_c0	36951657	prolog	0	Title: Greater than operator in prolog Problem title: Greater than operator in prolog Tags: operators, prolog, swi-prolog Problem: Greater than operator in prolog I am working on SWI Prolog. I have some facts in my database. I am unable to figure out how to use 'greater than' operator(>) when constructing a new rule. I...	Greater than operator in prolog Greater than operator in prolog operators prolog swi-prolog Greater Greater than operator in prolog I am working on SWI Prolog. I have some facts in my database. I am unable to figure out how to use 'greater than' operator(>) when constructing a new rule. I have some facts of the form sh...	[ 0.024169921875, 0.00439453125, 0.0233154296875, -0.004364013671875, -0.01104736328125, -0.009521484375, 0.01263427734375, 0.01953125, 0.00616455078125, -0.028076171875, 0.00127410888671875, 0.010009765625, -0.019287109375, -0.0247802734375, -0.0032958984375, 0.006072998046875, -0.009...	[ 32774, 56, 3501, 39933, 23, 502, 4867, 2452, 3454, 20697, 159, 38969, 1250, 15824, 759, 63399, 2886, 26366, 3642, 4527, 7134, 46429, 2740, 3229, 64549, 3525, 79986, 3173, 35254, 19, 83, 9836, 1556, 55054, 177, 763, 10617, 25841, 130625, 2...	[ 0.18359375, 0.1502685546875, 0.2734375, 0.33154296875, 0.043121337890625, 0.148681640625, 0.238525390625, 0.13818359375, 0.0999755859375, 0.0970458984375, 0.03741455078125, 0.1744384765625, 0.1192626953125, 0.1298828125, 0.00732421875, 0.1673583984375, 0.027801513671875, 0.04031372...	embed
67488026_c0	67488026	prolog	0	Title: Graph Coloring with CLP(FD) Problem title: Graph Coloring with CLP(FD) Tags: clpfd, clp, prolog, swi-prolog Problem: Graph Coloring with CLP(FD) I am trying to solve the map/graph coloring problem using CLP(FD) in Prolog. I took the predicates from the paper "A comparison of CLP(FD) and ASP solutions to NP-compl...	Graph Coloring with CLP(FD) Graph Coloring with CLP(FD) clpfd clp prolog swi-prolog Graph Coloring CLP Output Nodes Edges create_output Colors N-C A-CA B-CB Graph Coloring with CLP(FD) I am trying to solve the map/graph coloring problem using CLP(FD) in Prolog. I took the predicates from the paper "A comparison of CLP(...	[ -0.00811767578125, 0.0086669921875, -0.006622314453125, -0.005340576171875, -0.00982666015625, -0.00750732421875, -0.0096435546875, -0.00408935546875, -0.006378173828125, -0.006927490234375, -0.005615234375, -0.0135498046875, 0.005615234375, 0.0233154296875, 0.009033203125, 0.01171875,...	[ 6524, 11727, 51193, 214, 678, 313, 37352, 98553, 132, 33139, 39557, 71, 254, 502, 4867, 2452, 3454, 13538, 438, 988, 69030, 28282, 6056, 62, 9, 13133, 335, 47307, 31577, 86869, 22288, 41382, 10576, 2967, 17368, 1250, 1653, 2063, 225490, 1...	[ 0.1766357421875, 0.1522216796875, 0.19677734375, 0.098388671875, 0.08203125, 0.06121826171875, 0.249267578125, 0.2122802734375, 0.022552490234375, 0.034149169921875, 0.052459716796875, 0.06890869140625, 0.0955810546875, 0.06903076171875, 0.2320556640625, 0.101806640625, 0.078125, 0...	embed
24714526_c0	24714526	prolog	0	Title: Finding up to N unique solutions of a goal in Prolog Problem title: Finding up to N unique solutions of a goal in Prolog Tags: prolog Problem: Finding up to N unique solutions of a goal in Prolog Could you tell me how to find up to N unique solutions of a goal in Prolog? I know using findall/3 all the solutions ...	Finding up to N unique solutions of a goal in Prolog Finding up to N unique solutions of a goal in Prolog prolog Finding Prolog find_unique_n any_goal sample_goal Finding up to N unique solutions of a goal in Prolog Could you tell me how to find up to N unique solutions of a goal in Prolog? I know using findall/3 all t...	[ -0.0081787109375, 0.01483154296875, 0.027587890625, -0.02001953125, -0.009765625, 0.00341796875, -0.009521484375, -0.0113525390625, 0.020751953125, -0.03466796875, -0.01031494140625, -0.01385498046875, 0.0196533203125, -0.0027618408203125, 0.0128173828125, 0.017578125, -0.00476074218...	[ 26040, 214, 1257, 47, 541, 36998, 51347, 69236, 23, 1250, 4867, 502, 7413, 34, 45602, 19, 2499, 519, 289, 121413, 14192, 3642, 111, 5584, 18113, 756, 831, 14037, 5792, 5941, 54241, 3444, 4734, 20174, 1884, 3622, 14012, 100, 35064, 2856, ...	[ 0.10791015625, 0.02349853515625, 0.10345458984375, 0.0850830078125, 0.197509765625, 0.28271484375, 0.260498046875, 0.2259521484375, 0.0819091796875, 0.1712646484375, 0.255615234375, 0.1021728515625, 0.151611328125, 0.130126953125, 0.2359619140625, 0.08367919921875, 0.096923828125, ...	embed
33881497_c0	33881497	prolog	0	Title: Writing a Prolog format predicate Problem title: Writing a Prolog format predicate Tags: prolog Problem: Writing a Prolog format predicate I have the database of rules and facts and I want to create the predicate show(N) witch shows the rule number N , with format/2 predicate. Thank you. % La base de connaissanc...	Writing a Prolog format predicate Writing a Prolog format predicate prolog Writing Prolog cirres_ventraux deux_antennes pas_de_paragnathes cirres_lateraux trois_antennes pieds_birames segment_bucal_apode pas_de_machoire segment_bucal_avec_pieds cirres_tentaculaires branchies_spiralees proboscis_complexe parapodes_poste...	[ -0.017333984375, -0.00144195556640625, 0.005035400390625, 0.02197265625, 0.000789642333984375, 0.0091552734375, -0.000377655029296875, 0.0091552734375, 0.01055908203125, 0.005218505859375, -0.005615234375, -0.0203857421875, -0.038818359375, -0.01123046875, 0.01806640625, -0.00053405761...	[ 213185, 10, 1250, 4867, 9384, 1653, 2063, 67, 502, 76542, 2109, 16274, 42, 10442, 7821, 65646, 1444, 452, 112, 6276, 7456, 2347, 94068, 29866, 139546, 114024, 3716, 33180, 978, 6827, 25395, 50724, 88149, 138518, 111152, 8972, 32845, 54547, ...	[ 0.1915283203125, 0.060272216796875, 0.1898193359375, 0.266845703125, 0.23291015625, 0.1688232421875, 0.2489013671875, 0.0867919921875, 0.168212890625, 0.08868408203125, 0.1541748046875, 0.053802490234375, 0.0513916015625, 0.045257568359375, 0.091064453125, 0.138671875, 0.052307128906...	embed
49555002_c0	49555002	prolog	0	Title: Decompose list into lists of successive subsequences Problem title: Decompose list into lists of successive subsequences Tags: prolog, list Problem: Decompose list into lists of successive subsequences I am really sorry for previous question, it's my first time post question on this website and I really didn't k...	Decompose list into lists of successive subsequences Decompose list into lists of successive subsequences prolog list Decompose List chop_up NewList First Tail Second NewList2 Tail2 Decompose list into lists of successive subsequences I am really sorry for previous question, it's my first time post question on this web...	[ -0.0022125244140625, 0.015625, 0.000476837158203125, 0.0230712890625, -0.01080322265625, 0.026611328125, -0.025390625, 0.00518798828125, 0.01904296875, 0.00750732421875, -0.01348876953125, 0.019287109375, 0.004974365234375, 0.0228271484375, 0.01470947265625, 0.0101318359375, 0.025512...	[ 262, 277, 78381, 5303, 3934, 7, 111, 208479, 1614, 184, 26513, 502, 4867, 32036, 82335, 2037, 2356, 154663, 23972, 1218, 379, 77648, 304, 59090, 1733, 1305, 9655, 41, 6889, 17368, 66933, 190, 21974, 53418, 89554, 86869, 47143, 11249, 47, ...	[ 0.1817626953125, 0.1834716796875, 0.1817626953125, 0.212158203125, 0.1627197265625, 0.045135498046875, 0.03729248046875, 0.2401123046875, 0.2310791015625, 0.1385498046875, 0.1744384765625, 0.1348876953125, 0.18994140625, 0.1722412109375, 0.1429443359375, 0.09320068359375, 0.087280273...	embed
53974437_c0	53974437	prolog	0	Title: Prolog Backtracking findall for two variables Problem title: Prolog Backtracking findall for two variables Tags: prolog Problem: Prolog Backtracking findall for two variables I want to write a function residents(Housenumber,N) which (1) gives me the amount of residents per house given the housenumber AND (2) whe...	Prolog Backtracking findall for two variables Prolog Backtracking findall for two variables prolog Prolog Backtracking Tim Cook Elisabeth Thomas George Steve Jobs Lisa Karen Mark Zuckerberg Priscilla Prolog Backtracking findall for two variables I want to write a function residents(Housenumber,N) which (1) gives me the...	[ 0.0133056640625, 0.0084228515625, 0.00482177734375, 0.01031494140625, 0.009765625, 0.018310546875, 0.007659912109375, 0.000701904296875, 0.0247802734375, -0.0654296875, 0.0032806396484375, -0.007171630859375, 0.009765625, -0.006744384765625, 0.002532958984375, 0.007110595703125, -0.0...	[ 1250, 4867, 26828, 125728, 214, 7413, 5584, 100, 6626, 77336, 502, 13320, 79479, 110115, 14978, 14787, 41550, 73401, 32768, 86040, 7880, 168596, 20204, 121226, 3444, 33022, 32354, 160641, 184964, 2606, 1297, 839, 76199, 163, 41170, 18276, 48762...	[ 0.148193359375, 0.2359619140625, 0.19189453125, 0.260498046875, 0.05255126953125, 0.1505126953125, 0.21484375, 0.048095703125, 0.1541748046875, 0.2186279296875, 0.1148681640625, 0.130615234375, 0.211181640625, 0.155517578125, 0.1300048828125, 0.088623046875, 0.09765625, 0.174194335...	embed
26733040_c0	26733040	prolog	0	Title: Implement counter prolog Problem title: Implement counter prolog Tags: prolog Problem: Implement counter prolog I'm developing a board game in PROLOG and in order to make the interface more enjoyable for the user, I decided to add a grid with the coordinates (0->4) as shown below: 0 1 2 3 4 --------- 0 \| x x x x...	Implement counter prolog Implement counter prolog prolog Implement Index Only Head Tail STOPS HERE Implement counter prolog I'm developing a board game in PROLOG and in order to make the interface more enjoyable for the user, I decided to add a grid with the coordinates (0->4) as shown below: After developing some code...	[ -0.004791259765625, 0.0008697509765625, 0.00970458984375, 0.002960205078125, -0.0146484375, -0.00176239013671875, -0.0006256103515625, 0.0107421875, 0.01068115234375, -0.0269775390625, -0.004058837890625, -0.016357421875, 0.005157470703125, 0.01904296875, 0.01239013671875, 0.0015792846...	[ 153941, 105416, 502, 4867, 31471, 87293, 44816, 1218, 379, 16992, 188165, 65791, 168698, 45443, 6712, 23, 10514, 47510, 101758, 25225, 38937, 15190, 120067, 176866, 90, 22085, 103607, 29557, 18151, 36880, 31089, 79259, 1653, 2063, 67, 7279, 7, ...	[ 0.282958984375, 0.265625, 0.1552734375, 0.232666015625, 0.265380859375, 0.110107421875, 0.1787109375, 0.1387939453125, 0.1138916015625, 0.158935546875, 0.074462890625, 0.125732421875, 0.0987548828125, 0.1513671875, 0.10723876953125, 0.0123291015625, 0.158447265625, 0.2366943359375,...	embed
21894832_c0	21894832	prolog	0	Title: Prolog oldest Successor Problem title: Prolog oldest Successor Tags: prolog Problem: Prolog oldest Successor I'm working on a simple program that has a database of people. When given a year it should state the "King" of that year, where the king is the eldest living man. For simplicity, all people in the databas...	Prolog oldest Successor Prolog oldest Successor prolog Prolog Successor Year Prolog oldest Successor I'm working on a simple program that has a database of people. When given a year it should state the "King" of that year, where the king is the eldest living man. For simplicity, all people in the database are eligible ...	[ 0.0091552734375, 0.0235595703125, 0.014892578125, 0.021484375, -0.020263671875, 0.0198974609375, -0.019775390625, 0.006561279296875, -0.0024566650390625, -0.029296875, -0.009765625, 0.00970458984375, -0.0213623046875, -0.021240234375, 0.0185546875, -0.02001953125, -0.003082275390625,...	[ 1250, 4867, 10332, 525, 144053, 748, 502, 42552, 20697, 98, 8781, 1528, 63399, 3395, 34475, 6602, 5608, 11341, 605, 214, 60097, 83, 70, 88, 18557, 38043, 332, 134381, 756, 224943, 4989, 923, 138241, 2967, 39580, 18345, 3445, 20271, 26366, ...	[ 0.184814453125, 0.25634765625, 0.2098388671875, 0.199462890625, 0.2261962890625, 0.1407470703125, 0.1190185546875, 0.156982421875, 0.0753173828125, 0.00860595703125, 0.060302734375, 0.1265869140625, 0.1558837890625, 0.076171875, 0.03314208984375, 0.1494140625, 0.0243072509765625, 0...	embed
23985966_c0	23985966	prolog	0	Title: Problems with SWI PROLOG for C# Problem title: Problems with SWI PROLOG for C# Tags: c%23, prolog, swi-prolog Problem: Problems with SWI PROLOG for C# I want to use SWI PROLOG wrapper for C#. My friend created some code in prolog on normal SWI PROLOG. I want to execute this in c# using SwiPLCs.dll. I want to mak...	Problems with SWI PROLOG for C# Problems with SWI PROLOG for C# c%23 prolog swi-prolog Problems SWI PROLOG PlQuery.PlCall Uninstantiated Syntax Operator Problems with SWI PROLOG for C# I want to use SWI PROLOG wrapper for C#. My friend created some code in prolog on normal SWI PROLOG. I want to execute this in c# using...	[ 0.0081787109375, 0.0279541015625, -0.00286865234375, 0.019287109375, -0.0224609375, -0.01336669921875, 0.0091552734375, 0.003936767578125, -0.005767822265625, -0.046630859375, -0.01361083984375, 0.010986328125, -0.01373291015625, 0.0050048828125, 0.02197265625, 0.0087890625, 0.015014...	[ 15649, 678, 159, 38969, 10514, 47510, 100, 313, 4904, 3742, 502, 4867, 91, 2452, 3454, 29016, 41732, 1294, 141, 441, 5584, 143034, 14, 19010, 86531, 150922, 3444, 4527, 137565, 1264, 34391, 75935, 18151, 3638, 71924, 23, 501, 17368, 105432,...	[ 0.1678466796875, 0.052032470703125, 0.0994873046875, 0.26904296875, 0.1844482421875, 0.2371826171875, 0.0701904296875, 0.04193115234375, 0.193603515625, 0.1136474609375, 0.1517333984375, 0.197265625, 0.03363037109375, 0.23974609375, 0.1243896484375, 0.1324462890625, 0.1490478515625, ...	embed
32556017_c0	32556017	prolog	0	Title: Prolog example with rules and query Problem title: Prolog example with rules and query Tags: prolog Problem: Prolog example with rules and query I'm a beginner in Prolog and really need to solve this problem in Prolog's simplest syntax possible. I have similar to 2 tables with different product information in Pr...	Prolog example with rules and query Prolog example with rules and query prolog Prolog aa11zx bb22yz cc11zx dd22kx aa22vx aa11 aa22 dd22 bb22 cc11 product2 Prolog example with rules and query I'm a beginner in Prolog and really need to solve this problem in Prolog's simplest syntax possible. I have similar to 2 tables w...	[ 0.01300048828125, 0.00799560546875, -0.00909423828125, 0.0230712890625, -0.000885009765625, 0.01019287109375, -0.0289306640625, 0.0068359375, 0.005645751953125, -0.029052734375, -0.00099945068359375, 0.0198974609375, -0.0181884765625, -0.020263671875, -0.002197265625, 0.000282287597656...	[ 1250, 4867, 27781, 678, 91736, 136, 41, 1294, 502, 32189, 1662, 12996, 304, 9842, 1679, 86869, 2967, 30362, 6002, 86531, 21373, 116, 23180, 12921, 4677, 1884, 51359, 63399, 384, 183057, 15573, 271, 10750, 39210, 44402, 3871, 79986, 28219, 2...	[ 0.1854248046875, 0.274169921875, 0.211669921875, 0.0909423828125, 0.1925048828125, 0.0892333984375, 0.12255859375, 0.08575439453125, 0.0931396484375, 0.008880615234375, 0.040924072265625, 0.18701171875, 0.1644287109375, 0.004608154296875, 0.02154541015625, 0.0804443359375, 0.06427001...	embed
53134770_c0	53134770	prolog	0	Title: Prolog text game printing descriptions duplicate output Problem title: Prolog text game printing descriptions duplicate output Tags: prolog Problem: Prolog text game printing descriptions duplicate output I'm working on a text based adventure game in prolog. I'm trying to define something that prints out all the...	Prolog text game printing descriptions duplicate output Prolog text game printing descriptions duplicate output prolog Prolog adjacent_rooms Location is_connected AdjacentLocation AdjacentName short_desc AdjacentDescription Your Bedroom Closet Hallway Long Prolog text game printing descriptions duplicate output I'm wor...	[ -0.013671875, 0.008544921875, 0.004119873046875, -0.01611328125, 0.00360107421875, 0.023681640625, -0.0081787109375, 0.005889892578125, -0.00933837890625, -0.026123046875, -0.01251220703125, -0.01171875, 0.00714111328125, -0.01055908203125, 0.0191650390625, 0.00823974609375, 0.010986...	[ 1250, 4867, 7986, 6712, 2448, 76811, 171763, 67, 140992, 1916, 502, 123594, 16797, 28905, 90788, 83, 135457, 145, 15363, 3145, 163612, 16610, 988, 4657, 59478, 14804, 873, 75846, 153335, 18, 19449, 7514, 14407, 20697, 35509, 156578, 61924, 28...	[ 0.147705078125, 0.2275390625, 0.1298828125, 0.1102294921875, 0.1326904296875, 0.221435546875, 0.216552734375, 0.132568359375, 0.191650390625, 0.03521728515625, 0.1070556640625, 0.169921875, 0.1947021484375, 0.20703125, 0.1728515625, 0.0170135498046875, 0.1380615234375, 0.1154785156...	embed
3530180_c0	3530180	prolog	0	Title: Prolog findall existential quantifier Problem title: Prolog findall existential quantifier Tags: prolog, prolog-findall Problem: Prolog findall existential quantifier I have a problem with a problem in Prolog. Here's some of the code I use. has_same_elements([X\|_],Y) :- permutation(X,Xnew), member(Xnew,Y), !. ha...	Prolog findall existential quantifier Prolog findall existential quantifier prolog prolog-findall Prolog has_same_elements Xnew Tail verdeling2 Perm Verd Prolog findall existential quantifier I have a problem with a problem in Prolog. Here's some of the code I use. This gets two lists of lists as input, and decides whe...	[ -0.002593994140625, 0.0016632080078125, 0.0098876953125, -0.00799560546875, -0.0177001953125, -0.002777099609375, -0.00640869140625, 0.00958251953125, 0.02001953125, -0.03564453125, 0.0283203125, 0.0289306640625, 0.0283203125, -0.03173828125, -0.0235595703125, 0.01300048828125, -0.00...	[ 1250, 4867, 7413, 5584, 99707, 15403, 55230, 85789, 502, 111607, 1556, 40175, 62766, 1193, 54936, 1218, 379, 493, 45530, 304, 908, 39, 1446, 71, 765, 2967, 18151, 4527, 6626, 5303, 107730, 28288, 36766, 70541, 678, 5701, 80854, 133063, 8244...	[ 0.1602783203125, 0.2471923828125, 0.1513671875, 0.2230224609375, 0.1287841796875, 0.04522705078125, 0.1119384765625, 0.152099609375, 0.090087890625, 0.1153564453125, 0.0574951171875, 0.1422119140625, 0.1636962890625, 0.0321044921875, 0.1571044921875, 0.0755615234375, 0.0860595703125,...	embed
61399897_c0	61399897	prolog	0	Title: Display results in Prolog Problem title: Display results in Prolog Tags: prolog, forward Problem: Display results in Prolog if twol then twolegs. if twoh then twohands if tenf then tenfingers. if twof then twofeets. if smallh then smallhair. if fourlegs and nohands and nofingers and fourfeets and doghair then do...	Display results in Prolog Display results in Prolog prolog forward Display Prolog new_derived_fact derived_fact Cond Display results in Prolog I have this code in prolog using forward chaining. How to display the result "person" like "address, id, house" from datababase?? I have this code in prolog using forward chaini...	[ 0.04638671875, 0.017822265625, -0.0062255859375, 0.033935546875, 0.006378173828125, 0.006622314453125, 0.0162353515625, 0.004241943359375, -0.00872802734375, -0.0235595703125, -0.003814697265625, -0.0029754638671875, -0.0240478515625, -0.00011014938354492188, -0.006744384765625, -0.009...	[ 90045, 50339, 23, 1250, 4867, 502, 40225, 3525, 820, 14, 4126, 114700, 16406, 1657, 71, 18151, 17368, 1608, 14653, 11249, 44116, 16750, 30816, 712, 107421, 3447, 18276, 1295, 2053, 21369, 184, 1884 ]	[ 0.1798095703125, 0.2216796875, 0.056365966796875, 0.17626953125, 0.251220703125, 0.131591796875, 0.19287109375, 0.095947265625, 0.11083984375, 0.032989501953125, 0.0301971435546875, 0.1859130859375, 0.107421875, 0.1121826171875, 0.0653076171875, 0.136474609375, 0.001068115234375, 0...	embed
23767189_c0	23767189	prolog	0	Title: PROLOG Comparing 2 lists Problem title: PROLOG Comparing 2 lists Tags: prolog Problem: PROLOG Comparing 2 lists I've been trying for a long time and searched a lot (...) but nothing. What I want is to create a function that will compare elements of one list to the elements of other list. The things is I have abs...	PROLOG Comparing 2 lists PROLOG Comparing 2 lists prolog PROLOG Comparing PROLOG Comparing 2 lists I've been trying for a long time and searched a lot (...) but nothing. What I want is to create a function that will compare elements of one list to the elements of other list. The things is I have absolutely no idea how ...	[ 0.003265380859375, -0.004364013671875, -0.00494384765625, 0.006439208984375, -0.01373291015625, 0.01507568359375, 0.00494384765625, -0.005279541015625, 0.019287109375, -0.015869140625, 0.024658203125, 0.020263671875, 0.005126953125, 0.002899169921875, -0.007598876953125, 0.001251220703...	[ 10514, 47510, 113307, 214, 116, 5303, 502, 4867, 7, 31577, 4989, 5915, 3444, 28282, 32354, 1221, 69101, 80854, 1632, 3789, 110, 6528, 8560, 8305, 43032, 15044, 37397, 5117, 32786, 339, 418, 5442, 23356, 35431, 285, 17357, 39580, 17932, 756,...	[ 0.1861572265625, 0.2138671875, 0.2059326171875, 0.001068115234375, 0.1727294921875, 0.215576171875, 0.14697265625, 0.20703125, 0.009735107421875, 0.02471923828125, 0.021087646484375, 0.006134033203125, 0.044158935546875, 0.058807373046875, 0.13330078125, 0.0173187255859375, 0.2152099...	embed
29620463_c0	29620463	prolog	0	Title: prolog zodiac sign program error Problem title: prolog zodiac sign program error Tags: prolog Problem: prolog zodiac sign program error hi i have the following code in prolog and getting the error. domains date = d(day,mon,year) dm = da(day,mon) day , mon ,year = integer sign = symbol predicates zodiac_month(sig...	prolog zodiac sign program error prolog zodiac sign program error prolog zodiac_month find_sign Date Day Mon Year Sign Day2 Mon2 Zodiac Day1 Mon1 Incorrect ERROR zodiac.pl:2:3 Syntax Operator zodiac.pl:28:11 Warning zodiac.pl:31 Singleton zodiac.pl:37 prolog zodiac sign program error hi i have the following code in pro...	[ -0.01019287109375, -0.005828857421875, -0.00921630859375, 0.015625, -0.01190185546875, 0.00836181640625, -0.01446533203125, 0.027099609375, -0.0130615234375, -0.0032806396484375, 0.00080108642578125, -0.0146484375, 0.0177001953125, -0.0133056640625, 0.0130615234375, 0.0201416015625, ...	[ 502, 4867, 1602, 3390, 238, 24092, 1528, 18499, 15477, 7413, 31304, 25512, 10013, 7465, 42552, 48838, 304, 5880, 418, 32399, 151206, 2424, 363, 19010, 86531, 150922, 5550, 27321, 43609, 1507, 30225, 25632, 18151, 77758, 5622, 104, 5636, 3796,...	[ 0.1741943359375, 0.2161865234375, 0.1068115234375, 0.1455078125, 0.05035400390625, 0.20068359375, 0.2091064453125, 0.1839599609375, 0.0921630859375, 0.09503173828125, 0.180908203125, 0.1129150390625, 0.115966796875, 0.1370849609375, 0.1624755859375, 0.174072265625, 0.05517578125, 0...	embed
65676576_c0	65676576	prolog	0	Title: My Prolog program makes a list, but I can't figure out how to make it stop after 2 entries Problem title: My Prolog program makes a list, but I can't figure out how to make it stop after 2 entries Tags: prolog Problem: My Prolog program makes a list, but I can't figure out how to make it stop after 2 e...	My Prolog program makes a list, but I can't figure out how to make it stop after 2 entries My Prolog program makes a list, but I can't figure out how to make it stop after 2 entries prolog Prolog Facts Searches My Prolog program makes a list, but I can't figure out how to make it stop after 2 entries For some...	[ 0.0228271484375, 0.01123046875, 0.0194091796875, 0.031982421875, 0.008056640625, 0.0220947265625, -0.00823974609375, 0.0079345703125, 0.0205078125, -0.06298828125, -0.0023956298828125, -0.0216064453125, -0.021728515625, 0.0118408203125, 0.0135498046875, 0.0108642578125, 0.02355957031...	[ 2646, 1250, 4867, 1528, 30482, 10, 5303, 1284, 831, 3768, 18, 26366, 1810, 3642, 3249, 442, 7279, 7103, 116, 112820, 502, 132640, 33086, 31577, 28282, 40226, 291, 731, 45831, 11907, 7722, 36439, 17721, 42805, 136, 82230, 18151, 1632, 49903,...	[ 0.046173095703125, 0.1763916015625, 0.2467041015625, 0.1859130859375, 0.06854248046875, 0.0858154296875, 0.2288818359375, 0.031982421875, 0.046844482421875, 0.0310516357421875, 0.07464599609375, 0.1214599609375, 0.05615234375, 0.059967041015625, 0.088134765625, 0.102294921875, 0.2434...	embed
29066251_c0	29066251	prolog	0	Title: How to gather into rules Problem title: How to gather into rules Tags: prolog, rule Problem: How to gather into rules What I would like to do is to return all the variables that I could obtain for an app. An app has extendable variables, I can extend them with some other variables, and non extendable variables. ...	How to gather into rules How to gather into rules prolog rule How getvariables_for_app web1 Not Extendable postal_code Extensions Variables How to gather into rules What I would like to do is to return all the variables that I could obtain for an app. An app has extendable variables, I can extend them with some other v...	[ 0.01611328125, 0.0185546875, 0.01324462890625, 0.016845703125, 0.00567626953125, 0.00543212890625, -0.0186767578125, -0.003143310546875, 0.0146484375, -0.03564453125, 0.01361083984375, -0.0091552734375, 0.0030975341796875, 0.0035247802734375, -0.0034027099609375, 0.005828857421875, 0...	[ 11249, 47, 914, 9319, 3934, 91736, 502, 4867, 79986, 2046, 21690, 19736, 2472, 9007, 1467, 418, 11205, 5443, 510, 71, 2886, 67808, 40899, 224545, 111477, 13566, 1884, 30646, 756, 70, 77336, 7, 450, 5809, 113054, 100, 4027, 65042, 351, 692...	[ 0.0765380859375, 0.009429931640625, 0.1502685546875, 0.2457275390625, 0.2218017578125, 0.2296142578125, 0.1136474609375, 0.19580078125, 0.17529296875, 0.10162353515625, 0.1812744140625, 0.1778564453125, 0.06170654296875, 0.1483154296875, 0.07611083984375, 0.0282440185546875, 0.058044...	embed
21051367_c0	21051367	prolog	0	Title: How do I delete all but duplicates from a list in prolog Problem title: How do I delete all but duplicates from a list in prolog Tags: duplicates, list, prolog Problem: How do I delete all but duplicates from a list in prolog I have a list, let's say X=[a,b,c,d,c,e,d] , how can I delete one of each character so ...	How do I delete all but duplicates from a list in prolog How do I delete all but duplicates from a list in prolog duplicates list prolog a How How do I delete all but duplicates from a list in prolog I have a list, let's say X=[a,b,c,d,c,e,d] , how can I delete one of each character so the only answer remains X1=[c,d] ...	[ -0.00897216796875, 0.0186767578125, 0.021484375, -0.00136566162109375, -0.01007080078125, 0.0027618408203125, 0.012451171875, 0.008056640625, 0.005340576171875, -0.006256103515625, -0.006072998046875, 0.0067138671875, -0.00408935546875, 0.005279541015625, -0.01165771484375, 0.022216796...	[ 11249, 154109, 756, 1284, 171763, 1636, 1295, 5303, 502, 4867, 23, 765, 1193, 11, 71, 3642, 831, 1632, 111, 12638, 62816, 4734, 35166, 47143, 418, 147306, 229231, 120820, 75101, 11907, 11001, 31330, 24145, 2174, 70541, 6044, 33720, 351, 368...	[ 0.043182373046875, 0.2269287109375, 0.10089111328125, 0.162109375, 0.25244140625, 0.129638671875, 0.10406494140625, 0.197265625, 0.172607421875, 0.2169189453125, 0.04498291015625, 0.011810302734375, 0.1082763671875, 0.0252838134765625, 0.075927734375, 0.00067138671875, 0.006744384765...	embed
49710365_c0	49710365	prolog	0	Title: How to print maze in prolog Problem title: How to print maze in prolog Tags: prolog Problem: How to print maze in prolog I'm writing a program in prolog that can solve mazes, I need a function that prints out the resulting maze with the solution path. A printed maze would look something like below where 'X' is a...	How to print maze in prolog How to print maze in prolog prolog How Maze Row Column How to print maze in prolog I'm writing a program in prolog that can solve mazes, I need a function that prints out the resulting maze with the solution path. A printed maze would look something like below where 'X' is a barrier and '*' ...	[ 0.006805419921875, -0.0019683837890625, 0.0031890869140625, -0.00182342529296875, 0.00567626953125, 0.0086669921875, -0.01397705078125, -0.0014190673828125, 0.01055908203125, -0.0089111328125, 0.0191650390625, -0.002197265625, -0.0162353515625, -0.01513671875, 0.01446533203125, 0.00442...	[ 11249, 47, 28412, 291, 731, 23, 502, 4867, 29678, 13, 96190, 233987, 32562, 1528, 86869, 17022, 90, 32354, 1810, 678, 29806, 60875, 297, 6713, 1884, 35064, 1542, 125861, 1639, 33636, 91582, 98423, 41911, 36917, 45831, 13267, 176866, 6275, 5...	[ 0.08349609375, 0.02398681640625, 0.2451171875, 0.17724609375, 0.255615234375, 0.06427001953125, 0.1668701171875, 0.224609375, 0.19970703125, 0.1846923828125, 0.2279052734375, 0.1983642578125, 0.0164337158203125, 0.051544189453125, 0.0853271484375, 0.1605224609375, 0.0992431640625, ...	embed
58693870_c0	58693870	prolog	0	Title: Finding the weighted sum of a tree Problem title: Finding the weighted sum of a tree Tags: prolog Problem: Finding the weighted sum of a tree I'm working on a small prolog program to work a bit with binary trees and am trying to find the weighted sum of the tree. Each of the nodes has a value and this is then to...	Finding the weighted sum of a tree Finding the weighted sum of a tree prolog Finding tree_wsum Tree Sum Depth Root Left Right Finding the weighted sum of a tree I'm working on a small prolog program to work a bit with binary trees and am trying to find the weighted sum of the tree. Each of the nodes has a value and thi...	[ 0.01373291015625, 0.0322265625, -0.014404296875, -0.00518798828125, -0.00927734375, 0.005523681640625, -0.031005859375, -0.00225830078125, -0.00141143798828125, -0.03955078125, 0.0179443359375, 0.000244140625, -0.0026397705078125, 0.0125732421875, 0.02783203125, 0.01080322265625, 0.0...	[ 26040, 57888, 297, 10554, 53201, 502, 4867, 434, 11832, 101344, 36335, 262, 254, 150948, 636, 2480, 90911, 20697, 1528, 2394, 1360, 7413, 98423, 110, 988, 34292, 118126, 168867, 112, 4527, 183278, 1290, 18499, 10750, 959, 129980, 34648, 20812...	[ 0.11376953125, 0.249267578125, 0.143310546875, 0.236083984375, 0.2308349609375, 0.1243896484375, 0.159423828125, 0.125244140625, 0.246337890625, 0.2030029296875, 0.208251953125, 0.1004638671875, 0.1661376953125, 0.191162109375, 0.00848388671875, 0.0672607421875, 0.1094970703125, 0....	embed
41359840_c0	41359840	prolog	0	Title: Getting members from a list in PROLOG Problem title: Getting members from a list in PROLOG Tags: prolog, list Problem: Getting members from a list in PROLOG I have to make a rule to return the line's for the station entered But in order to get all of the line's, I'd have to make a rule like: line(Line,ListofStat...	Getting members from a list in PROLOG Getting members from a list in PROLOG prolog list a Getting PROLOG Line ListofStations oxford_circus nottingHill_gate lancaster_gate tottenham_court_road chancery_lane liverpool_street bethnal_green Getting members from a list in PROLOG I have to make a rule to return the line's fo...	[ -0.0038299560546875, -0.0240478515625, 0.026611328125, 0.01092529296875, -0.01495361328125, -0.007110595703125, 0.022705078125, 0.01611328125, 0.0107421875, -0.040771484375, -0.005950927734375, 0.020751953125, -0.0086669921875, -0.002960205078125, -0.00555419921875, 0.01300048828125, ...	[ 210732, 43032, 1295, 5303, 10514, 47510, 23, 502, 4867, 16777, 1261, 36834, 42378, 5256, 36, 425, 13534, 82063, 223, 959, 1916, 841, 5713, 42118, 16336, 1515, 510, 3915, 118383, 52562, 18227, 1294, 32417, 134148, 20740, 5967, 56520, 6236, 9...	[ 0.0926513671875, 0.245361328125, 0.103515625, 0.1910400390625, 0.148193359375, 0.2373046875, 0.006103515625, 0.1044921875, 0.201171875, 0.1597900390625, 0.094970703125, 0.07763671875, 0.1282958984375, 0.0242462158203125, 0.037261962890625, 0.0653076171875, 0.1446533203125, 0.110595...	embed
16046192_c0	16046192	prolog	0	Title: Prolog find minimum in list error Problem title: Prolog find minimum in list error Tags: shortest-path, prolog, gnu-prolog Problem: Prolog find minimum in list error Im trying to make my code work, but somehow I got stuck on a problem, Im very newbie to prolog. This is my code. dist(valmiera, riga, 107). %dist(r...	Prolog find minimum in list error Prolog find minimum in list error shortest-path prolog gnu-prolog Prolog YList Prolog find minimum in list error Im trying to make my code work, but somehow I got stuck on a problem, Im very newbie to prolog. This is my code. but when I call findMin() I get this error uncaught exceptio...	[ 0.01214599609375, -0.007049560546875, 0.02783203125, 0.00689697265625, -0.00146484375, -0.006072998046875, -0.005828857421875, -0.0103759765625, 0.0128173828125, -0.037841796875, 0.00982666015625, -0.0159912109375, -0.0076904296875, -0.0283203125, 0.00927734375, 0.01239013671875, 0.0...	[ 1250, 4867, 7413, 15440, 23, 5303, 18499, 16610, 525, 128405, 502, 104155, 3454, 990, 154663, 3370, 31577, 18151, 4488, 179933, 2967, 4552, 9014, 11782, 59076, 132, 51, 408, 46526, 131527, 50986, 188800, 159258, 2661, 25, 12477, 16093, 2773, ...	[ 0.159423828125, 0.2210693359375, 0.170654296875, 0.29150390625, 0.089599609375, 0.164306640625, 0.2020263671875, 0.1959228515625, 0.1593017578125, 0.1708984375, 0.1358642578125, 0.13232421875, 0.11962890625, 0.083251953125, 0.1614990234375, 0.044891357421875, 0.023468017578125, 0.0...	embed
43874644_c0	43874644	prolog	0	Title: Prolog delete an element into a given list Problem title: Prolog delete an element into a given list Tags: prolog Problem: Prolog delete an element into a given list Hello I wish some advice or words about this task: Define a statement with three parameters where the first one is a list, the second one is an ele...	Prolog delete an element into a given list Prolog delete an element into a given list prolog Prolog Examples Result Prolog delete an element into a given list Hello I wish some advice or words about this task: Define a statement with three parameters where the first one is a list, the second one is an element (atom or ...	[ -0.0030364990234375, 0.01171875, 0.004791259765625, 0.0201416015625, -0.0135498046875, -0.00445556640625, -0.006622314453125, 0.00592041015625, 0.0234375, -0.0213623046875, 0.0086669921875, -0.0054931640625, -0.0267333984375, 0.0078125, 0.004547119140625, 0.0162353515625, 0.031005859...	[ 1250, 4867, 154109, 12830, 3934, 34475, 5303, 502, 89536, 126684, 35378, 32599, 67660, 34153, 66211, 262, 64552, 63805, 678, 17262, 171859, 5117, 17932, 5928, 4568, 8110, 163846, 105950, 1284, 80854, 14858, 1046, 74955, 37842, 92814, 2367, 3302...	[ 0.1607666015625, 0.2108154296875, 0.24462890625, 0.1702880859375, 0.0872802734375, 0.063720703125, 0.1888427734375, 0.1221923828125, 0.081298828125, 0.0789794921875, 0.027587890625, 0.09033203125, 0.1339111328125, 0.021514892578125, 0.14306640625, 0.001800537109375, 0.1448974609375, ...	embed
10248451_c0	10248451	prolog	0	Title: minimax for tic-tac-toe Problem title: minimax for tic-tac-toe Tags: prolog, algorithm Problem: minimax for tic-tac-toe I'm trying to solve tic-tac-toe with a simple minimax algorithm. Simple, but should cover a lot of the language. What I have so far: The board is represented as an array of 9 (unbound) variable...	minimax for tic-tac-toe minimax for tic-tac-toe prolog algorithm Player Board minimax for tic-tac-toe I'm trying to solve tic-tac-toe with a simple minimax algorithm. Simple, but should cover a lot of the language. What I have so far: The board is represented as an array of 9 (unbound) variables, that are either set to...	[ 0.0220947265625, 0.000331878662109375, 0.0264892578125, 0.01611328125, -0.0012359619140625, 0.0096435546875, 0.0035858154296875, 0.00958251953125, 0.0025177001953125, -0.00799560546875, -0.0162353515625, -0.00063323974609375, 0.017822265625, -0.0018768310546875, -0.0126953125, -0.02343...	[ 83818, 425, 96212, 102, 238, 51890, 502, 4867, 234873, 60560, 62554, 31577, 86869, 8781, 60552, 29256, 46876, 2060, 45443, 33636, 10298, 483, 309, 99091, 77336, 5423, 47, 1022, 707, 36, 19916, 35431, 198343, 142581, 304, 363, 136659, 20117, ...	[ 0.2371826171875, 0.19970703125, 0.1920166015625, 0.1500244140625, 0.1331787109375, 0.2178955078125, 0.138427734375, 0.1749267578125, 0.1949462890625, 0.1953125, 0.201416015625, 0.037017822265625, 0.09588623046875, 0.1165771484375, 0.07318115234375, 0.040283203125, 0.0848388671875, ...	embed
33260885_c1	33260885	prolog	1	4, 55)), X = plus(55, plus(4, 2)), X = plus(55, plus(4, 55)). I think. So I want all expressions that obtain the result by substitution. If you try the code, you get instantiation error for list when decomposing with =.. built in predicate. EDIT: So, I was thinking about checking if Term is ground variable, to avoid in...	4, 55)), X = plus(55, plus(4, 2)), X = plus(55, plus(4, 55)). I think. So I want all expressions that obtain the result by substitution. If you try the code, you get instantiation error for list when decomposing with =.. built in predicate. EDIT: So, I was thinking about checking if Term is ground variable, to avoid in...	[ -0.01123046875, 0.015625, 0.0174560546875, 0.00799560546875, -0.002197265625, 0.003448486328125, 0.00138092041015625, -0.00677490234375, 0.023193359375, -0.0177001953125, 0.0003204345703125, 0.02685546875, -0.008056640625, 0.00634765625, 0.0078125, -0.0029296875, 0.04150390625, 0.0...	[ 201, 4, 4859, 247, 1193, 2203, 1001, 11663, 105801, 4958, 5351, 3444, 756, 125195, 7, 113054, 16750, 390, 161740, 1830, 9790, 18151, 34648, 14, 2320, 18499, 5303, 8, 277, 7522, 678, 88303, 23, 1653, 2063, 67, 47644, 175199, 2174, 2994, ...	[ 0.1590576171875, 0.017547607421875, 0.265625, 0.000152587890625, 0.151611328125, 0.1346435546875, 0.1654052734375, 0.27392578125, 0.1773681640625, 0.07086181640625, 0.0806884765625, 0.1107177734375, 0.09716796875, 0.2396240234375, 0.025726318359375, 0.1031494140625, 0.149169921875, ...	embed

21507372_c0

21507372

prolog

0

Title: swi-prolog find all paths in grid Problem title: swi-prolog find all paths in grid Tags: list, prolog, grid Problem: swi-prolog find all paths in grid I need to build all possible paths between two given points in a grid like this [1,1][2,1][3,1][4,1][5,1] [1,2][2,2][3,2][4,2][5,2] [1,3][2,3][3,3][4,3][5,3] [1,4...

swi-prolog find all paths in grid swi-prolog find all paths in grid list prolog grid doesnt_contain build_paths Limit swi-prolog find all paths in grid I need to build all possible paths between two given points in a grid like this I have a utility thing (whatever that is) called doesnt_contain which checks if the elem...

[ 0.0017242431640625, 0.01904296875, -0.005340576171875, -0.015869140625, -0.005096435546875, 0.00482177734375, -0.0164794921875, 0.001800537109375, 0.01361083984375, -0.032958984375, 0.0302734375, 0.00811767578125, -0.00506591796875, 0.020263671875, 0.0162353515625, 0.01361083984375, ...

[ 91, 2452, 3454, 4867, 7413, 756, 60875, 7, 23, 120067, 5303, 502, 22027, 18, 98102, 73, 45367, 128405, 125177, 3871, 7722, 17721, 6626, 34475, 26847, 19537, 939, 13580, 12765, 12830, 21771, 71864, 40956, 4034, 6275, 11907, 29954, 3444, 738,...

[ 0.006866455078125, 0.1754150390625, 0.125244140625, 0.18017578125, 0.090576171875, 0.142822265625, 0.2264404296875, 0.0802001953125, 0.049957275390625, 0.225341796875, 0.130859375, 0.1058349609375, 0.10186767578125, 0.08154296875, 0.180419921875, 0.1129150390625, 0.11083984375, 0.1...

embed

64805348_c1

64805348

prolog

1

ative requirements in Prolog to measure the distance between a formal, declarative, executable specification and the Prolog code. My question The whole problem require a lot of clauses, I try to solve one by one. First, I need the predicate: "is the cabin has to stop at location #N?" I write the clause stopIsRequired w...

[ -0.005096435546875, 0.0026092529296875, 0.0201416015625, -0.00579833984375, 0.001617431640625, 0.0081787109375, -0.002197265625, -0.01226806640625, 0.01416015625, -0.0019989013671875, -0.000507354736328125, 0.02001953125, -0.0150146484375, -0.0262451171875, 0.02587890625, -0.0135498046...

[ 10, 4935, 96679, 23, 1250, 4867, 72350, 70, 62488, 17721, 23113, 21635, 71924, 2886, 29458, 2320, 136, 18151, 28271, 2967, 64209, 5915, 70731, 90, 9790, 86869, 3871, 1653, 2063, 164, 377, 7568, 1556, 47, 7279, 99, 31913, 839, 33022, 13, ...

[ 0.059356689453125, 0.2149658203125, 0.257080078125, 0.011932373046875, 0.1871337890625, 0.25390625, 0.200927734375, 0.049591064453125, 0.2413330078125, 0.1142578125, 0.18017578125, 0.1845703125, 0.162109375, 0.1407470703125, 0.203125, 0.0731201171875, 0.034515380859375, 0.188598632...

embed

76657855_c0

76657855

prolog

0

Title: Understanding the use of decrementation in Prolog predicate instead of incrementation? Problem title: Understanding the use of decrementation in Prolog predicate instead of incrementation? Tags: increment, list, logic, predicate, prolog Problem: Understanding the use of decrementation in Prolog predicate instead...

Understanding the use of decrementation in Prolog predicate instead of incrementation? Understanding the use of decrementation in Prolog predicate instead of incrementation? increment list logic predicate prolog Understanding Prolog sup_k Understanding the use of decrementation in Prolog predicate instead of incrementa...

[ 0.016357421875, 0.015380859375, 0.004730224609375, 0.00183868408203125, 0.006256103515625, 0.0027618408203125, 0.0113525390625, -0.006500244140625, 0.012939453125, -0.024658203125, 0.01324462890625, -0.01324462890625, -0.0086669921875, -0.0062255859375, 0.0033416748046875, 0.0013732910...

[ 9626, 144057, 4527, 8, 7612, 674, 2320, 1250, 4867, 1653, 2063, 67, 64457, 145322, 1363, 158661, 5303, 62775, 502, 15811, 454, 92, 56037, 28219, 77336, 50155, 17368, 63134, 27689, 23755, 179140, 87388, 472, 927, 12830, 1295, 18151, 18, 1540...

[ 0.0946044921875, 0.05126953125, 0.1077880859375, 0.186279296875, 0.22021484375, 0.1737060546875, 0.0736083984375, 0.1650390625, 0.2420654296875, 0.1636962890625, 0.19677734375, 0.065185546875, 0.1204833984375, 0.1954345703125, 0.05938720703125, 0.21435546875, 0.14892578125, 0.14147...

embed

70106530_c0

70106530

prolog

0

Title: Is there always an accumulator to replace append/3? [SOLVED] Problem title: Is there always an accumulator to replace append/3? [SOLVED] Tags: prolog Problem: Is there always an accumulator to replace append/3? [SOLVED] Can append/3 at the end of this code provable(F, P) :- prove([] > [F], P). % axiom prove(G > ...

Is there always an accumulator to replace append/3? [SOLVED] Is there always an accumulator to replace append/3? [SOLVED] prolog SOLVED select1 Is there always an accumulator to replace append/3? [SOLVED] Can append/3 at the end of this code be replaced by an accumulator? (This code is a part of leanseq.pl a A sequent ...

[ 0.005767822265625, 0.0201416015625, 0.004608154296875, 0.01092529296875, -0.0166015625, -0.0118408203125, -0.0191650390625, 0.0211181640625, 0.0211181640625, -0.04345703125, 0.03759765625, 0.01531982421875, -0.019775390625, 0.0025177001953125, 0.02734375, 0.0021820068359375, 0.015869...

[ 11343, 183278, 1290, 91995, 114689, 71, 18113, 156046, 131040, 2685, 142, 502, 4867, 78837, 36849, 4171, 3564, 18151, 95, 864, 2424, 26513, 44805, 814, 29479, 1250, 70504, 45152, 33, 144285, 44126, 64457, 219017, 165523 ]

[ 0.119384765625, 0.2403564453125, 0.212646484375, 0.150634765625, 0.1871337890625, 0.150390625, 0.23828125, 0.0528564453125, 0.026763916015625, 0.03363037109375, 0.0133056640625, 0.0784912109375, 0.179443359375, 0.06231689453125, 0.0938720703125, 0.056549072265625, 0.098388671875, 0...

embed

41203940_c0

41203940

prolog

0

Title: Prolog: Shortest Path for Knight Problem title: Prolog: Shortest Path for Knight Tags: combinatorics, shortest-path, prolog Problem: Prolog: Shortest Path for Knight Hi so before I get told that this question has been asked many times, I have looked through a bunch of questions but none of them relate to Prolog....

Prolog: Shortest Path for Knight Prolog: Shortest Path for Knight combinatorics shortest-path prolog Prolog Shortest Path Knight move1 up1 up2 down2 down1 N-1 Prolog: Shortest Path for Knight Hi so before I get told that this question has been asked many times, I have looked through a bunch of questions but none of the...

[ 0.00069427490234375, 0.006317138671875, 0.00921630859375, -0.0081787109375, 0.01348876953125, 0.015625, -0.0228271484375, 0.0050048828125, 0.0062255859375, -0.04541015625, -0.0086669921875, 0.001617431640625, -0.0079345703125, -0.0029296875, -0.003021240234375, -0.0084228515625, 0.00...

[ 1250, 4867, 12, 82990, 525, 108421, 100, 114996, 22321, 3826, 16610, 128405, 502, 25813, 1257, 304, 7565, 541, 5759, 19441, 34844, 31577, 7413, 60875, 17721, 6626, 26847, 290, 7, 45443, 18151, 183037, 10, 472, 54350, 2060, 4734, 5117, 9077,...

[ 0.14404296875, 0.246337890625, 0.00732421875, 0.1968994140625, 0.184814453125, 0.22705078125, 0.073974609375, 0.195556640625, 0.118408203125, 0.0789794921875, 0.2283935546875, 0.208984375, 0.1307373046875, 0.137451171875, 0.09478759765625, 0.006317138671875, 0.1092529296875, 0.0118...

embed

44680367_c0

44680367

prolog

0

Title: Prolog - an Aux predicate in a main predicate Problem title: Prolog - an Aux predicate in a main predicate Tags: predicate, prolog Problem: Prolog - an Aux predicate in a main predicate vecLine2BitLineAux([C | Cs],[P | Ps], N, LastP, LastC, BitLine) :- /* print(P), print(' '), print(C), print(' '), print(N), pri...

Prolog - an Aux predicate in a main predicate Prolog - an Aux predicate in a main predicate predicate prolog Prolog Aux vecLine2BitLineAux LastP LastC BitLine Res SpCnt fill_char Spaces Stars Tmp vecLine2BitLine CList P-1 Exception _L191 _G559 Prolog - an Aux predicate in a main predicate The main predicate should call...

[ -0.00677490234375, -0.0026702880859375, -0.0135498046875, 0.006683349609375, -0.01434326171875, 0.033203125, -0.003082275390625, 0.001495361328125, 0.01141357421875, -0.0133056640625, -0.005126953125, -0.0079345703125, 0.007659912109375, 0.00677490234375, 0.00750732421875, 0.0093383789...

[ 1250, 4867, 62, 6077, 1653, 2063, 67, 23, 5201, 502, 22834, 93232, 304, 21672, 683, 27774, 660, 26292, 9254, 43045, 96814, 2676, 154663, 436, 5759, 63928, 866, 2947, 418, 724, 160443, 5608, 11782, 678, 116, 78301, 171859, 110218, 136, 757...

[ 0.2000732421875, 0.29248046875, 0.10107421875, 0.2548828125, 0.174560546875, 0.2135009765625, 0.07623291015625, 0.0259246826171875, 0.1226806640625, 0.108154296875, 0.0889892578125, 0.141845703125, 0.038787841796875, 0.0745849609375, 0.079833984375, 0.0313720703125, 0.004302978515625...

embed

40453040_c0

40453040

prolog

0

Title: Prolog - Returning a List from a Recursive Predicate Problem title: Prolog - Returning a List from a Recursive Predicate Tags: list, prolog Problem: Prolog - Returning a List from a Recursive Predicate I am using GNU-Prolog, and I have the following code that finds the numbers less than X which are divisible by ...

Prolog - Returning a List from a Recursive Predicate Prolog - Returning a List from a Recursive Predicate list prolog a Prolog Returning List Recursive Predicate find_num check_list Head Tail determine_item List2 Prolog - Returning a List from a Recursive Predicate I am using GNU-Prolog, and I have the following code t...

[ -0.00848388671875, -0.006683349609375, 0.006439208984375, 0.0036468505859375, -0.0059814453125, 0.033447265625, -0.00860595703125, -0.00421142578125, 0.014892578125, -0.0234375, 0.01904296875, -0.0189208984375, -0.01422119140625, -0.0169677734375, 0.006805419921875, 0.023681640625, 0...

[ 1250, 4867, 173340, 32036, 1295, 853, 48650, 5844, 7145, 2063, 214, 5303, 502, 10, 7413, 2606, 12765, 6562, 44816, 1218, 379, 83324, 217, 195, 304, 17368, 165132, 10752, 25632, 18151, 101935, 40715, 3501, 1193, 3129, 99017, 390, 990, 66596,...

[ 0.187255859375, 0.25244140625, 0.2191162109375, 0.2303466796875, 0.1353759765625, 0.0977783203125, 0.204833984375, 0.1468505859375, 0.17578125, 0.1954345703125, 0.0543212890625, 0.196044921875, 0.13720703125, 0.028472900390625, 0.1407470703125, 0.157958984375, 0.13427734375, 0.1583...

embed

28610729_c0

28610729

prolog

0

Title: Prolog. How to output solution like Yes or No Problem title: Prolog. How to output solution like Yes or No Tags: visual-prolog, prolog Problem: Prolog. How to output solution like Yes or No I tried to solve the problem of a point belongs to the area. As a result, I need to get an answer: if a point belongs to th...

Prolog. How to output solution like Yes or No Prolog. How to output solution like Yes or No visual-prolog prolog Prolog How Yes Input PREDICATES CLAUSES GOAL Prolog. How to output solution like Yes or No I tried to solve the problem of a point belongs to the area. As a result, I need to get an answer: if a point belong...

[ -0.000946044921875, 0.02880859375, 0.00933837890625, 0.0106201171875, -0.029296875, 0.035888671875, -0.00144195556640625, -0.00135040283203125, -0.00811767578125, 0.0152587890625, 0.0084228515625, 0.00665283203125, -0.0225830078125, -0.0189208984375, 0.00860595703125, -0.00994873046875...

[ 1250, 4867, 11249, 47, 140992, 29806, 1884, 32635, 707, 438, 21176, 3454, 502, 360, 7077, 134366, 30941, 31273, 129636, 78441, 25052, 7842, 37842, 86869, 2967, 6275, 186, 10617, 7, 16128, 3871, 2046, 35166, 2174, 959, 1311, 43297, 30957, 38...

[ 0.173828125, 0.2396240234375, 0.06085205078125, 0.07855224609375, 0.218994140625, 0.2431640625, 0.1302490234375, 0.185546875, 0.1690673828125, 0.2080078125, 0.20068359375, 0.12158203125, 0.1265869140625, 0.0535888671875, 0.1026611328125, 0.170654296875, 0.1341552734375, 0.035217285...

embed

53623286_c0

53623286

prolog

0

Title: Generator is not working in prolog DCG. How do we change arguments in prolog function so that it starts working as a generator Problem title: Generator is not working in prolog DCG. How do we change arguments in prolog function so that it starts working as a generator Tags: arguments, dcg, parsing, prolog Proble...

Generator is not working in prolog DCG. How do we change arguments in prolog function so that it starts working as a generator Generator is not working in prolog DCG. How do we change arguments in prolog function so that it starts working as a generator arguments dcg parsing prolog Generator DCG How LAA Generator is no...

[ 0.004638671875, 0.006744384765625, -0.002410888671875, -0.00421142578125, 0.021728515625, 0.013427734375, -0.021728515625, -0.01953125, 0.0069580078125, -0.035888671875, -0.02099609375, 0.00909423828125, -0.0220947265625, -0.00567626953125, 0.0272216796875, -0.006439208984375, -0.004...

[ 222518, 959, 20697, 23, 502, 4867, 391, 56367, 11249, 15549, 10750, 32354, 4034, 237, 145823, 83, 104, 238, 177, 366, 3358, 284, 54, 642, 18151, 43240, 125296, 42, 4488, 2189, 17997 ]

[ 0.290771484375, 0.08685302734375, 0.146240234375, 0.0633544921875, 0.1185302734375, 0.2115478515625, 0.0838623046875, 0.166748046875, 0.02520751953125, 0.1773681640625, 0.22314453125, 0.1087646484375, 0.039093017578125, 0.06829833984375, 0.270263671875, 0.0189208984375, 0.01428222656...

embed

41006774_c0

41006774

prolog

0

Title: List indexes on a recursive program? Problem title: List indexes on a recursive program? Tags: prolog Problem: List indexes on a recursive program? I've been searching for something that might help me with my problem all over the internet but I haven't been able to make any progress. I'm new to logic programming...

List indexes on a recursive program? List indexes on a recursive program? prolog List List indexes on a recursive program? I've been searching for something that might help me with my problem all over the internet but I haven't been able to make any progress. I'm new to logic programming and English is not my first lan...

[ -0.002227783203125, 0.004119873046875, 0.00469970703125, 0.0037689208984375, -0.02197265625, 0.0159912109375, -0.01513671875, 0.0128173828125, 0.01226806640625, -0.02978515625, 0.01068115234375, -0.03857421875, -0.019775390625, 0.015380859375, 0.022705078125, -0.00116729736328125, 0....

[ 32036, 63262, 90, 98, 195625, 5844, 1528, 32, 502, 4867, 157318, 4358, 2967, 42658, 3525, 62775, 56037, 14941, 5117, 46876, 12524, 3444, 29479, 219428, 18113, 10750, 339, 418, 304, 5303, 436, 683, 711, 41925, 7225, 12921, 140909, 959, 80836...

[ 0.2318115234375, 0.23974609375, 0.1307373046875, 0.0799560546875, 0.2374267578125, 0.16796875, 0.1827392578125, 0.02447509765625, 0.1746826171875, 0.2261962890625, 0.0042724609375, 0.057891845703125, 0.068359375, 0.033721923828125, 0.022918701171875, 0.140380859375, 0.07861328125, ...

embed

14353053_c0

14353053

prolog

0

Title: How to process a POST request in SWI-Prolog? Problem title: How to process a POST request in SWI-Prolog? Tags: post, prolog, html, forms, swi-prolog Problem: How to process a POST request in SWI-Prolog? I have an HTML form like this one: <form action="test" method="post"> <input name="first_name" type="text"/> <...

How to process a POST request in SWI-Prolog? How to process a POST request in SWI-Prolog? post prolog html forms swi-prolog How POST SWI-Prolog first_name last_name Send use_module thread_httpd http_dispatch http_handler Port http_server Request http_read_data Data How to process a POST request in SWI-Prolog? I have an...

[ 0.00933837890625, 0.006683349609375, 0.00311279296875, 0.0034637451171875, -0.0107421875, 0.0108642578125, 0.0126953125, 0.01312255859375, -0.01483154296875, -0.05224609375, 0.0277099609375, 0.0027923583984375, -0.023193359375, 0.0019989013671875, 0.00732421875, 0.016845703125, 0.012...

[ 11249, 47, 9433, 10, 81903, 50336, 23, 159, 38969, 9, 10752, 4867, 1305, 502, 7693, 3173, 91, 2452, 3454, 5117, 11627, 4568, 24044, 4527, 83279, 86997, 5475, 1621, 74258, 13791, 39642, 75616, 39116, 10135, 11809, 19097, 1884, 2046, 142424, ...

[ 0.07342529296875, 0.031951904296875, 0.1763916015625, 0.0233306884765625, 0.2216796875, 0.230224609375, 0.037353515625, 0.08837890625, 0.25, 0.019805908203125, 0.155517578125, 0.2315673828125, 0.107666015625, 0.11962890625, 0.1097412109375, 0.17236328125, 0.03326416015625, 0.198486...

embed

62384379_c1

62384379

prolog

1

member(H, A), get_init_schedule_(Schedule). get_schedule(Schedule) :- init_schedule(Schedule), one_employee_per_shift(Schedule), no_consecutive_shifts(Schedule), no_shift_on_personal_holiday(Schedule). dif_assignment(assign(employee(_), shift(D, N)), assign(employee(_), shift(D2, N2))) :- D \== D2, N \== N2. alldiff([...

[ 0.0034027099609375, 0.008544921875, 0.007354736328125, 0.035888671875, -0.035888671875, -0.01239013671875, -0.0120849609375, -0.008056640625, 0.0037078857421875, -0.0096435546875, 0.0031890869140625, 0.007537841796875, 0.0009918212890625, 0.01251220703125, -0.00408935546875, 0.01129150...

[ 32786, 841, 62, 2046, 73, 217, 7560, 693, 133, 25452, 15246, 194, 15772, 23, 1632, 109308, 1033, 13, 1264, 3767, 2480, 110, 166643, 191, 52368, 69810, 5636, 45755, 162, 31304, 122925, 397, 541, 95486, 304, 391, 5442, 756, 152462, 16474, ...

[ 0.2159423828125, 0.0833740234375, 0.087646484375, 0.143798828125, 0.043975830078125, 0.1170654296875, 0.1832275390625, 0.1973876953125, 0.1600341796875, 0.1279296875, 0.2032470703125, 0.0165863037109375, 0.052001953125, 0.03961181640625, 0.110107421875, 0.1728515625, 0.10595703125, ...

embed

46999918_c0

46999918

prolog

0

Title: Twins in family database Problem title: Twins in family database Tags: prolog Problem: Twins in family database Here is my family database. But I am unable to find out twin babies from this database. I am given this question: Define the relation twins(Child1, Child2) to find twins in the family database. family(...

Twins in family database Twins in family database prolog Twins Twins in family database Here is my family database. But I am unable to find out twin babies from this database. I am given this question: Define the relation twins(Child1, Child2) to find twins in the family database. Any help will be appreciated.

[ 0.032958984375, -0.003082275390625, 0.031005859375, 0.009033203125, -0.00457763671875, 0.0169677734375, -0.00897216796875, 0.0108642578125, 0.01251220703125, -0.05029296875, -0.0089111328125, -0.0001983642578125, -0.023193359375, 0.006195068359375, -0.0098876953125, 0.006011962890625, ...

[ 92016, 7, 23, 14449, 63399, 502, 4867, 11853, 759, 51, 2886, 47, 7413, 1810, 138241, 61798, 90, 1295, 903, 34475, 9655, 262, 64552, 41911, 102656, 418, 4, 123829, 10461, 4358, 77947 ]

[ 0.283203125, 0.146728515625, 0.08636474609375, 0.125732421875, 0.2257080078125, 0.11376953125, 0.1591796875, 0.012939453125, 0.00860595703125, 0.0292510986328125, 0.090087890625, 0.025848388671875, 0.1392822265625, 0.0885009765625, 0.302978515625, 0.158203125, 0.08953857421875, 0.0...

embed

38136789_c1

38136789

prolog

1

open_output(X), % PROCEDURE FOR FILE EXCEPTION HANDLING statistics(cputime,Value). open_output(X) :- catch((open('C:\\myfolder\\outputfile.txt', read, Mf), read_file(Mf,X), close(Mf)), error(Err,Context), open_output_aux(Err,X)). % AUX PROCEDURE TO RECOVER % Write some code here % open_output_aux code matches the erro...

[ 0.004852294921875, 0.00921630859375, 0.0032806396484375, -0.02685546875, -0.00164031982421875, -0.01483154296875, 0.021240234375, -0.0189208984375, -0.0084228515625, -0.005126953125, 0.0152587890625, 0.006927490234375, 0.00787353515625, -0.0281982421875, 0.037353515625, -0.006011962890...

[ 9803, 6056, 7077, 1542, 1745, 10514, 10854, 563, 52099, 29426, 136566, 116199, 45134, 80835, 1766, 6032, 856, 50770, 105556, 59636, 1176, 42822, 29822, 124326, 12301, 420, 20903, 18499, 18468, 22829, 10442, 62, 71609, 98166, 106105, 601, 18151,...

[ 0.1988525390625, 0.1981201171875, 0.17529296875, 0.1759033203125, 0.06829833984375, 0.04107666015625, 0.076904296875, 0.070068359375, 0.133056640625, 0.1246337890625, 0.1923828125, 0.1015625, 0.04498291015625, 0.145263671875, 0.0914306640625, 0.089599609375, 0.0281219482421875, 0.0...

embed

14095774_c0

14095774

prolog

0

Title: Reversible tree length relation Problem title: Reversible tree length relation Tags: successor-arithmetics, prolog, failure-slice, clpfd Problem: Reversible tree length relation I'm trying to write reversible relations in "pure" Prolog (no is , cut, or similar stuff. Yes it's homework), and I must admit I don't ...

Reversible tree length relation Reversible tree length relation successor-arithmetics prolog failure-slice clpfd Reversible List Tree tree_size tree_len Reversible tree length relation I'm trying to write reversible relations in "pure" Prolog (no is , cut, or similar stuff. Yes it's homework), and I must admit I don't ...

[ 0.01068115234375, 0.03515625, -0.004241943359375, 0.0203857421875, 0.007080078125, -0.0128173828125, -0.0179443359375, 0.0115966796875, 0.015380859375, -0.061279296875, -0.00775146484375, -0.0033111572265625, -0.0115966796875, 0.0174560546875, 0.03564453125, 0.002960205078125, 0.0183...

[ 853, 814, 55356, 53201, 140909, 41911, 39457, 42, 8962, 282, 502, 4867, 137578, 13348, 71, 32036, 101344, 62539, 1977, 31577, 33022, 39531, 91582, 4717, 1250, 157, 59226, 5368, 18244, 29786, 3642, 9433, 28282, 13580, 4028, 81944, 71723, 9393,...

[ 0.08380126953125, 0.1961669921875, 0.216796875, 0.209228515625, 0.175048828125, 0.2059326171875, 0.155029296875, 0.01129150390625, 0.0894775390625, 0.009796142578125, 0.0865478515625, 0.1998291015625, 0.18115234375, 0.09381103515625, 0.01007080078125, 0.1585693359375, 0.2158203125, ...

embed

47260334_c0

47260334

prolog

0

Title: Prolog facts of lists and a recursion predicate to accept permutations of lists Problem title: Prolog facts of lists and a recursion predicate to accept permutations of lists Tags: prolog, permutation, list Problem: Prolog facts of lists and a recursion predicate to accept permutations of lists I have facts that...

Prolog facts of lists and a recursion predicate to accept permutations of lists Prolog facts of lists and a recursion predicate to accept permutations of lists prolog permutation list Prolog List SortedList Sort Match Prolog facts of lists and a recursion predicate to accept permutations of lists I have facts that acce...

[ 0.01422119140625, 0.0147705078125, 0.0087890625, 0.01214599609375, -0.0152587890625, 0.0034637451171875, -0.0096435546875, 0.00689697265625, 0.00677490234375, -0.007568359375, 0.0162353515625, 0.0126953125, -0.0079345703125, 0.006072998046875, 0.005523681640625, 0.0087890625, 0.02209...

[ 1250, 4867, 15824, 111, 5303, 195625, 1830, 1653, 2063, 67, 26946, 117, 14311, 21094, 502, 561, 32036, 53666, 297, 154663, 67407, 17497, 1884, 2499, 22062, 68186, 12096, 107730, 14858, 26548, 86869, 2967, 9351, 959, 71, 5809, 5844, 17569, 6...

[ 0.171630859375, 0.2176513671875, 0.16748046875, 0.012176513671875, 0.1861572265625, 0.211669921875, 0.037841796875, 0.169189453125, 0.190185546875, 0.045196533203125, 0.1737060546875, 0.0828857421875, 0.1805419921875, 0.008270263671875, 0.1385498046875, 0.15869140625, 0.1375732421875...

embed

67606422_c0

67606422

prolog

0

Title: How do I use rule in another rule in prolog Problem title: How do I use rule in another rule in prolog Tags: prolog Problem: How do I use rule in another rule in prolog Here are my facts: object('Human'). object('Machine'). object('Robot'). object('Hunter'). object('WallE'). action('Kill'). action('Run'). rel1('...

How do I use rule in another rule in prolog How do I use rule in another rule in prolog prolog How Human Machine Robot Hunter WallE Kill Run rel1 rel2 provides_action provides_action2 provides_action3 How do I use rule in another rule in prolog Here are my facts: I'm trying to find the list of all object that implement...

[ -0.001800537109375, -0.0021514892578125, -0.00131988525390625, 0.0225830078125, -0.004150390625, 0.005157470703125, -0.03466796875, 0.01080322265625, 0.01348876953125, -0.059326171875, 0.00921630859375, -0.0167236328125, -0.0047607421875, -0.004180908203125, 0.0031890869140625, 0.00358...

[ 11249, 4527, 79986, 23, 15700, 502, 4867, 28076, 68311, 66349, 134327, 23706, 647, 104431, 28398, 7962, 87344, 44713, 363, 7413, 5303, 756, 36746, 29479, 22631, 11675, 903, 16750, 1193, 2203, 194659, 99326, 841, 29321, 12724, 9190, 198076, 33...

[ 0.07269287109375, 0.179931640625, 0.270751953125, 0.102783203125, 0.157470703125, 0.17138671875, 0.225830078125, 0.0445556640625, 0.04736328125, 0.14208984375, 0.1876220703125, 0.094482421875, 0.119873046875, 0.12841796875, 0.141845703125, 0.05035400390625, 0.119384765625, 0.084228...

embed

8330508_c0

8330508

prolog

0

Title: Result in an argument isn't correct Problem title: Result in an argument isn't correct Tags: prolog, recursion Problem: Result in an argument isn't correct So I have this piece of prolog code: my_avalia(A, R) :- A == "Koza" -> koza(R, 0, 0, e, 89). koza(R, _, _, _, 87) :- !, write(R). koza(R, X, Y, V, ...

Result in an argument isn't correct Result in an argument isn't correct prolog recursion Result my_avalia Koza Y-1 Result in an argument isn't correct So I have this piece of prolog code: The matter is that when I write the "R" at koza(), it has the correct values, however it ends up with a empty list in my_a...

[ -0.00634765625, -0.005767822265625, 0.005767822265625, 0.0296630859375, 0.00421142578125, 0.0093994140625, -0.0022125244140625, 0.0152587890625, 0.0216064453125, -0.005645751953125, 0.0279541015625, 0.005279541015625, -0.0020751953125, 0.02099609375, 0.0145263671875, -0.01544189453125,...

[ 126684, 23, 10750, 56112, 3768, 18, 26785, 142, 502, 4867, 195625, 1830, 759, 5528, 7884, 1204, 596, 990, 5759, 18151, 26866, 33022, 1052, 99, 298, 132, 1556, 142424, 3564, 201505, 5303, 11782, 1884, 12110, 13648, 214552, 44691, 32354, 1209...

[ 0.216796875, 0.0989990234375, 0.2491455078125, 0.0894775390625, 0.0672607421875, 0.10406494140625, 0.203125, 0.0246734619140625, 0.1322021484375, 0.1888427734375, 0.1934814453125, 0.09405517578125, 0.1341552734375, 0.159912109375, 0.1982421875, 0.099609375, 0.1953125, 0.07019042968...

embed

4119023_c0

4119023

prolog

0

Title: Non-trivial Prolog find and replace Problem title: Non-trivial Prolog find and replace Tags: prolog Problem: Non-trivial Prolog find and replace So we can easily find and replace an atom with another atom in Prolog by doing something like: replace([],A,B,[]). replace([H|T],A,B,[B|Result]) :- H=A, replace(T,A,B,R...

Non-trivial Prolog find and replace Non-trivial Prolog find and replace prolog Non-trivial Prolog Result Non-trivial Prolog find and replace So we can easily find and replace an atom with another atom in Prolog by doing something like: I'm sure there are other ways to do this too. However, I want to do something more c...

[ 0.0001659393310546875, 0.0181884765625, -0.00121307373046875, 0.0250244140625, -0.01263427734375, 0.0162353515625, -0.0155029296875, 0.004486083984375, 0.0133056640625, -0.0220947265625, 0.011474609375, 0.0048828125, -0.0072021484375, -0.02099609375, 0.02490234375, 0.0113525390625, 0...

[ 3775, 3996, 686, 1250, 4867, 7413, 136, 91995, 289, 502, 126684, 831, 72546, 34627, 678, 15700, 23, 1884, 48322, 54, 3444, 1286, 96704, 62775, 242122, 11249, 2806, 456, 133266, 158, 17043, 170, 425, 4, 53, 63805, 1660, 2704, 1284, 959, ...

[ 0.1163330078125, 0.05364990234375, 0.08837890625, 0.1597900390625, 0.2193603515625, 0.1644287109375, 0.1263427734375, 0.2030029296875, 0.03802490234375, 0.127197265625, 0.1270751953125, 0.03021240234375, 0.12841796875, 0.205810546875, 0.131591796875, 0.097412109375, 0.022018432617187...

embed

28751608_c0

28751608

prolog

0

Title: Is there an opposite of the "wildcard" operator to specifically not find specified items in Prolog? Problem title: Is there an opposite of the "wildcard" operator to specifically not find specified items in Prolog? Tags: prolog-dif, prolog Problem: Is there an opposite of the "wildcard" opera...

Is there an opposite of the "wildcard" operator to specifically not find specified items in Prolog? Is there an opposite of the "wildcard" operator to specifically not find specified items in Prolog? prolog-dif prolog Prolog goals_scored Is there an opposite of the "wildcard" operator to specificall...

[ 0.00194549560546875, -0.0084228515625, 0.0111083984375, 0.006622314453125, -0.0186767578125, 0.00946044921875, 0.010498046875, 0.014404296875, -0.00836181640625, -0.0027923583984375, 0.00933837890625, -0.01043701171875, 0.00872802734375, 0.0010223388671875, -0.0003032684326171875, 0.01...

[ 198274, 41123, 71, 38931, 39933, 183037, 959, 7413, 58735, 55769, 1250, 4867, 502, 428, 420, 109458, 12064, 2822, 23, 2967, 360, 831, 4527, 101, 1653, 2063, 113054, 80934, 32316, 27781, 36663, 756, 92865, 11301, 100, 142741, 30646, 33946, 4...

[ 0.1787109375, 0.1192626953125, 0.058746337890625, 0.2587890625, 0.2415771484375, 0.07275390625, 0.1270751953125, 0.156982421875, 0.1937255859375, 0.1553955078125, 0.1439208984375, 0.244873046875, 0.0738525390625, 0.015869140625, 0.0855712890625, 0.172607421875, 0.07891845703125, 0....

embed

20317450_c0

20317450

prolog

0

Title: Simple prolog program returns false too early Problem title: Simple prolog program returns false too early Tags: prolog Problem: Simple prolog program returns false too early It's been a while since I've programmed in Prolog. Today, I tried to make a simple program. It lists some facts of who belongs to the same...

Simple prolog program returns false too early Simple prolog program returns false too early prolog Simple Simple prolog program returns false too early It's been a while since I've programmed in Prolog. Today, I tried to make a simple program. It lists some facts of who belongs to the same family. If two people belong ...

[ 0.0169677734375, 0.003265380859375, 0.0059814453125, 0.002593994140625, -0.0211181640625, -0.0152587890625, -0.006591796875, 0.0057373046875, 0.0223388671875, -0.01202392578125, 0.0169677734375, 0.013916015625, -0.0172119140625, 0.01116943359375, 0.002288818359375, 0.006378173828125, ...

[ 60552, 502, 4867, 1528, 30646, 98320, 5792, 39395, 12960, 16792, 26693, 1250, 37842, 3249, 8781, 5303, 15824, 2750, 10617, 5701, 14449, 6626, 3395, 53418, 8337, 12638, 126340, 18466, 3444, 2046, 756, 19713, 3445, 136565, 22008, 107003, 41, 91...

[ 0.18701171875, 0.1419677734375, 0.2183837890625, 0.183349609375, 0.1795654296875, 0.2056884765625, 0.1102294921875, 0.1724853515625, 0.00872802734375, 0.00958251953125, 0.128173828125, 0.10986328125, 0.013214111328125, 0.012420654296875, 0.1162109375, 0.13525390625, 0.09466552734375,...

embed

43776669_c0

43776669

prolog

0

Title: Improving list generation over a range in Prolog Problem title: Improving list generation over a range in Prolog Tags: list, range, prolog, generator Problem: Improving list generation over a range in Prolog I'm fairly new to Prolog, and falling in love with it more and more. I'm wondering if this implementation...

Improving list generation over a range in Prolog Improving list generation over a range in Prolog list range prolog generator Improving Prolog End List range_ascend range_descend Start Step Rest Next Improving list generation over a range in Prolog I'm fairly new to Prolog, and falling in love with it more and more. I'...

[ -0.0130615234375, 0.0140380859375, 0.005401611328125, -0.01025390625, -0.00543212890625, 0.0059814453125, -0.010498046875, -0.002349853515625, 0.000888824462890625, 0.0018310546875, 0.0123291015625, 0.0152587890625, -0.0103759765625, -0.0034332275390625, 0.0216064453125, 0.002609252929...

[ 3370, 70628, 5303, 58093, 645, 37457, 1250, 4867, 502, 145823, 18878, 32036, 31146, 112, 13794, 50478, 49756, 4997, 23, 180663, 3525, 6817, 5161, 1286, 149016, 208124, 831, 53333, 4537, 52295, 54799, 49666, 9523, 18151 ]

[ 0.036895751953125, 0.1507568359375, 0.2174072265625, 0.198974609375, 0.11474609375, 0.1998291015625, 0.1541748046875, 0.2421875, 0.10003662109375, 0.209228515625, 0.07769775390625, 0.1490478515625, 0.10162353515625, 0.053863525390625, 0.07183837890625, 0.1300048828125, 0.132690429687...

embed

74561764_c1

74561764

prolog

1

element of the other sub-lists from the "appetizer" list. Fill the second sub-list with the second element of the first sub-list of "appetizer", then the third element of the next sub-lists in "appetizer", and so on and so forth. If the number doesn't match (eg. list length 10 but group size 3), I will simply have one...

[ 0.007354736328125, 0.0174560546875, 0.00188446044921875, 0.0125732421875, -0.01806640625, 0.0235595703125, -0.00396728515625, -0.0076904296875, 0.052734375, -0.0196533203125, -0.007049560546875, -0.00145721435546875, -0.0042724609375, 0.0301513671875, 0.00830078125, -0.006805419921875,...

[ 12830, 3789, 1614, 6562, 11, 58134, 52825, 5303, 140423, 17932, 50960, 4263, 14012, 18, 14858, 140909, 209, 21115, 13267, 8439, 42856, 1632, 164917, 438, 3445, 28, 9821, 186351, 678, 5701, 101790, 759, 6528, 4488, 23, 1250, 4867, 4171, 2947...

[ 0.145263671875, 0.05474853515625, 0.156982421875, 0.2041015625, 0.03826904296875, 0.174072265625, 0.207763671875, 0.22509765625, 0.125244140625, 0.083740234375, 0.1187744140625, 0.001190185546875, 0.1361083984375, 0.07244873046875, 0.176025390625, 0.083740234375, 0.0872802734375, 0...

embed

70555588_c0

70555588

prolog

0

Title: Prolog: Check if list of tuples is a function Problem title: Prolog: Check if list of tuples is a function Tags: prolog, function, forall Problem: Prolog: Check if list of tuples is a function I want to check, if a list L of tuples (x1,y1) has the function property: ∀(x1,y1),(x2,y2) ∈ L (x1=x2 y1 = y2) I tried t...

Prolog: Check if list of tuples is a function Prolog: Check if list of tuples is a function prolog function forall Prolog Check m_Function Call lists:member _5074 Exit _5060 _5062 _5066 _5068 Prolog: Check if list of tuples is a function I want to check, if a list L of tuples (x1,y1) has the function property: I tried ...

[ -0.00823974609375, -0.005767822265625, 0.0145263671875, -0.01123046875, -0.0001544952392578125, -0.0196533203125, 0.015869140625, -0.0107421875, 0.01287841796875, -0.0174560546875, 0.034423828125, 0.031982421875, -0.000453948974609375, -0.0048828125, 0.0086669921875, 0.02685546875, 0...

[ 1250, 4867, 38679, 2174, 5303, 370, 99726, 83, 32354, 111, 10, 502, 100, 5584, 347, 97249, 26265, 27417, 2525, 16360, 5443, 217, 4598, 10837, 14604, 16028, 3444, 12765, 339, 425, 418, 53, 17727, 1556, 57266, 37842, 86869, 2063, 2967, 450,...

[ 0.1507568359375, 0.2119140625, 0.205078125, 0.096923828125, 0.1864013671875, 0.16552734375, 0.26123046875, 0.0943603515625, 0.222412109375, 0.070556640625, 0.03662109375, 0.1229248046875, 0.0762939453125, 0.1578369140625, 0.09075927734375, 0.152587890625, 0.1094970703125, 0.1314697...

embed

69328940_c1

69328940

prolog

1

YS, TEST) :- count(CANDYS, TEST, NB), is_positive(NB). count([], _, 0). count([X|TAIL], F, RES) :- call(F,X) -> count(TAIL, F, ACC), RES is ACC+1; count(TAIL, F, RES). contains_at_least_one_list(_, []) :- true. contains_at_least_one_list(CANDYS, [TEST|TEST_TAIL]) :- contains_at_least_one(CANDYS, TEST), contains_at_leas...

[ 0.0142822265625, -0.001983642578125, -0.01141357421875, 0.0034942626953125, -0.0098876953125, 0.00054168701171875, 0.00390625, 0.0089111328125, 0.007476806640625, -0.016357421875, -0.00064849853515625, -0.01153564453125, -0.007720947265625, 0.00848388671875, 0.0191650390625, 0.00421142...

[ 26947, 4, 384, 21828, 16, 15772, 54529, 441, 45029, 63813, 83, 67890, 4935, 49321, 757, 1542, 58745, 90259, 866, 563, 61661, 11782, 919, 13709, 21748, 70541, 4438, 3630, 6562, 29568, 618, 133, 5351, 9844, 67155, 53, 1653, 2063, 67, 7, 2...

[ 0.256103515625, 0.1197509765625, 0.2496337890625, 0.284912109375, 0.043426513671875, 0.1063232421875, 0.19189453125, 0.01837158203125, 0.0989990234375, 0.1968994140625, 0.152587890625, 0.155517578125, 0.1448974609375, 0.1375732421875, 0.10400390625, 0.057403564453125, 0.0762939453125...

embed

73181630_c0

73181630

prolog

0

Title: SWI-Prolog: Generalize a predicate to calcluate the power of some function Problem title: SWI-Prolog: Generalize a predicate to calcluate the power of some function Tags: prolog, function Problem: SWI-Prolog: Generalize a predicate to calcluate the power of some function I want to generalize some predicate writt...

SWI-Prolog: Generalize a predicate to calcluate the power of some function SWI-Prolog: Generalize a predicate to calcluate the power of some function prolog function SWI-Prolog Generalize Power Argument Value calc_power Power_m1 Buffer POW ERROR Arguments SWI-Prolog: Generalize a predicate to calcluate the power of som...

[ 0.01214599609375, 0.00116729736328125, 0.01055908203125, -0.00823974609375, -0.000885009765625, -0.003997802734375, -0.0003681182861328125, -0.006866455078125, 0.01312255859375, -0.0264892578125, 0.005645751953125, -0.004150390625, -0.024169921875, -0.001953125, 0.0179443359375, 0.0087...

[ 159, 38969, 10752, 4867, 9082, 20650, 1653, 2063, 67, 6510, 29786, 14537, 32354, 502, 17170, 112140, 190060, 238, 62783, 39, 418, 667, 18234, 8574, 1456, 151206, 47, 3444, 4537, 59121, 91, 2452, 9, 3454, 74481, 2060, 11782, 177, 11, 284, ...

[ 0.02587890625, 0.18994140625, 0.1181640625, 0.1783447265625, 0.14599609375, 0.1282958984375, 0.148193359375, 0.1846923828125, 0.072021484375, 0.116943359375, 0.0650634765625, 0.197021484375, 0.1474609375, 0.126220703125, 0.1748046875, 0.1962890625, 0.0916748046875, 0.09625244140625...

embed

73999802_c0

73999802

prolog

0

Title: What should I use for representing sets in Prolog? Problem title: What should I use for representing sets in Prolog? Tags: prolog, set Problem: What should I use for representing sets in Prolog? I want to do some work with sets in Prolog. I found that there's a library in SWI called ordsets which seems to be wha...

What should I use for representing sets in Prolog? What should I use for representing sets in Prolog? prolog set What Prolog is_ordset ord_union Set What should I use for representing sets in Prolog? I want to do some work with sets in Prolog. I found that there's a library in SWI called ordsets which seems to be what ...

[ 0.009765625, 0.0022430419921875, 0.020751953125, 0.00170135498046875, -0.009521484375, 0.00555419921875, -0.012451171875, -0.0274658203125, 0.002166748046875, -0.0247802734375, 0.007537841796875, 0.0106201171875, -0.0007171630859375, -0.021728515625, -0.008056640625, 0.0069580078125, ...

[ 4865, 5608, 4527, 33636, 214, 5423, 7, 23, 1250, 4867, 100, 502, 6651, 3509, 8597, 87046, 19943, 4488, 35773, 38969, 1542, 136, 17550, 90698, 12989, 4127, 69941, 6626, 297, 1723, 106, 68403, 6713, 7108, 959, 1294, 12684, 17368, 5426, 18, ...

[ 0.039703369140625, 0.055084228515625, 0.09771728515625, 0.2314453125, 0.075927734375, 0.24560546875, 0.07763671875, 0.028411865234375, 0.157958984375, 0.2215576171875, 0.004974365234375, 0.11669921875, 0.1510009765625, 0.2232666015625, 0.1583251953125, 0.1466064453125, 0.163330078125...

embed

56394137_c0

56394137

prolog

0

Title: How to determine if a child is a single child in a PROLOG family tree? Problem title: How to determine if a child is a single child in a PROLOG family tree? Tags: prolog Problem: How to determine if a child is a single child in a PROLOG family tree? I am currently writing a PROLOG program that represents Family ...

How to determine if a child is a single child in a PROLOG family tree? How to determine if a child is a single child in a PROLOG family tree? prolog How PROLOG Returns mother_of father_of sister_of brother_of single_child How to determine if a child is a single child in a PROLOG family tree? I am currently writing a PR...

[ 0.01953125, 0.003936767578125, 0.002838134765625, -0.0024261474609375, -0.0296630859375, 0.00823974609375, -0.006011962890625, -0.0086669921875, 0.0172119140625, -0.025634765625, -0.01055908203125, -0.031494140625, -0.0174560546875, -0.00122833251953125, 0.013671875, 0.01312255859375, ...

[ 11249, 47, 83324, 2174, 29041, 83, 10, 11001, 23, 10514, 47510, 14449, 53201, 502, 4867, 173340, 42732, 4390, 67373, 114015, 82953, 206, 38472, 32562, 1528, 33636, 59745, 116822, 29479, 32354, 4488, 12765, 22008, 10557, 110, 6369, 9319, 37842...

[ 0.058380126953125, 0.05560302734375, 0.1707763671875, 0.0777587890625, 0.225341796875, 0.052490234375, 0.03564453125, 0.222900390625, 0.07080078125, 0.1634521484375, 0.271240234375, 0.1136474609375, 0.2054443359375, 0.10302734375, 0.193603515625, 0.143798828125, 0.0885009765625, 0....

embed

67780028_c0

67780028

prolog

0

Title: What is a Deductive Database? Problem title: What is a Deductive Database? Tags: database, prolog, datalog Problem: What is a Deductive Database? I am reading some papers on databases and stumbled upon deductive databases. It seems that information on them is somewhat limited. The Wikipedia article states A dedu...

What is a Deductive Database? What is a Deductive Database? database prolog datalog What Deductive Database i.e What is a Deductive Database? I am reading some papers on databases and stumbled upon deductive databases. It seems that information on them is somewhat limited. The Wikipedia article states A deductive datab...

[ 0.041015625, 0.01397705078125, 0.007415771484375, 0.01397705078125, -0.00421142578125, 0.033203125, -0.0133056640625, -0.002655029296875, -0.003021240234375, -0.02099609375, -0.0126953125, -0.01092529296875, -0.018310546875, 0.00872802734375, -0.0162353515625, 0.00439453125, 0.024536...

[ 4865, 83, 10, 262, 39367, 4935, 187781, 32, 63399, 502, 4867, 2053, 13, 16454, 15122, 18784, 8, 4677, 84046, 8162, 5582, 117249, 62, 5426, 831, 3249, 77391, 103876, 78301, 15824, 35509, 91736, 4343, 112, 307, 187136, 11249, 621, 71, 23, ...

[ 0.10003662109375, 0.0960693359375, 0.098388671875, 0.2034912109375, 0.25244140625, 0.2071533203125, 0.275146484375, 0.013824462890625, 0.270263671875, 0.14599609375, 0.232666015625, 0.0723876953125, 0.0204315185546875, 0.05865478515625, 0.053619384765625, 0.005706787109375, 0.1990966...

embed

33223289_c0

33223289

prolog

0

Title: Collatz predicate in Prolog Problem title: Collatz predicate in Prolog Tags: prolog, collatz, predicate Problem: Collatz predicate in Prolog I'm stuck with some Prolog exercise. I am to write a predicate collatz2(X,N) which, assuming we know what X is, returns N that is the index (starting from 1) for the result...

Collatz predicate in Prolog Collatz predicate in Prolog prolog collatz predicate Collatz Prolog collatz2 collatz1 Collatz predicate in Prolog I'm stuck with some Prolog exercise. I am to write a predicate collatz2(X,N) which, assuming we know what X is, returns N that is the index (starting from 1) for the result of 1....

[ 0.0031890869140625, -0.01239013671875, -0.006256103515625, 0.00445556640625, 0.01171875, 0.03955078125, -0.00106048583984375, 0.004364013671875, 0.01251220703125, -0.04541015625, 0.023193359375, -0.0076904296875, -0.000484466552734375, 0.00628662109375, 0.0194091796875, 0.0072021484375...

[ 88842, 257, 169, 1653, 2063, 67, 23, 1250, 4867, 502, 65780, 9136, 304, 418, 179933, 81979, 33022, 1542, 839, 66596, 3714, 1193, 30646, 541, 63262, 17137, 1295, 4879, 16750, 615, 181989, 32354, 104116, 910, 187136, 50339, 59121, 68772, 1483...

[ 0.1539306640625, 0.1165771484375, 0.1690673828125, 0.1590576171875, 0.19580078125, 0.0765380859375, 0.009521484375, 0.1407470703125, 0.2178955078125, 0.0810546875, 0.1505126953125, 0.1776123046875, 0.1575927734375, 0.056854248046875, 0.0478515625, 0.0794677734375, 0.08935546875, 0....

embed

27366470_c0

27366470

prolog

0

Title: Shifting both directions elements of a list, and GCD of them. Prolog Problem title: Shifting both directions elements of a list, and GCD of them. Prolog Tags: prolog, list, rotation, greatest-common-divisor, element Problem: Shifting both directions elements of a list, and GCD of them. Prolog i got trouble when ...

Shifting both directions elements of a list, and GCD of them. Prolog Shifting both directions elements of a list, and GCD of them. Prolog prolog list rotation greatest-common-divisor element Shifting GCD Prolog Dir Res List Shifting both directions elements of a list, and GCD of them. Prolog i got trouble when trying t...

[ -0.025146484375, 0.0120849609375, 0.011962890625, -0.01312255859375, -0.0020294189453125, 0.00177764892578125, -0.023193359375, -0.0081787109375, 0.001129150390625, -0.0146484375, -0.00052642822265625, 0.00035858154296875, -0.00836181640625, 0.01904296875, 0.0030517578125, 0.0220947265...

[ 8294, 2480, 214, 15044, 48225, 80854, 5303, 136, 527, 16069, 111, 2856, 1250, 4867, 502, 2062, 22062, 158036, 277, 3796, 428, 51858, 12830, 19946, 9624, 32036, 4163, 63134, 31577, 86869, 116, 44402, 3871, 74481, 8, 22109, 71, 60075, 53875, ...

[ 0.1614990234375, 0.1822509765625, 0.049835205078125, 0.1708984375, 0.2413330078125, 0.18310546875, 0.226318359375, 0.0305328369140625, 0.1024169921875, 0.2308349609375, 0.0936279296875, 0.03753662109375, 0.1787109375, 0.263427734375, 0.1138916015625, 0.1104736328125, 0.10321044921875...

embed

28148184_c0

28148184

prolog

0

Title: Efficient Union Find with Existential Quantifier? Problem title: Efficient Union Find with Existential Quantifier? Tags: algorithm, union-find, prolog Problem: Efficient Union Find with Existential Quantifier? Is there a classical algorithm to solve the following problem. Assume the union find algorithm without ...

Efficient Union Find with Existential Quantifier? Efficient Union Find with Existential Quantifier? algorithm union-find prolog Efficient Union Find Existential Quantifier Input Efficient Union Find with Existential Quantifier? Is there a classical algorithm to solve the following problem. Assume the union find algorit...

[ 0.0050048828125, 0.04296875, 0.0032806396484375, 0.00125885009765625, -0.0150146484375, 0.005401611328125, -0.002288818359375, 0.01220703125, -0.01165771484375, -0.0274658203125, 0.01953125, -0.0059814453125, 0.00897216796875, -0.01513671875, -0.00494384765625, -0.0023193359375, 0.00...

[ 241, 24500, 45964, 32528, 26040, 678, 122688, 118, 289, 75344, 85789, 32, 234873, 69941, 111607, 502, 4867, 360, 7077, 2071, 2685, 54704, 86869, 70, 25632, 2967, 62, 66596, 7413, 15490, 99707, 15403, 55230, 1556, 107730, 1221, 45367, 3060, ...

[ 0.0423583984375, 0.162353515625, 0.1319580078125, 0.2666015625, 0.232421875, 0.137939453125, 0.1844482421875, 0.122314453125, 0.096923828125, 0.1748046875, 0.1978759765625, 0.0142669677734375, 0.25244140625, 0.25341796875, 0.2174072265625, 0.125, 0.165771484375, 0.09405517578125, ...

embed

41107698_c0

41107698

prolog

0

Title: How can I find all the connected cities on graph with Prolog? Problem title: How can I find all the connected cities on graph with Prolog? Tags: prolog Problem: How can I find all the connected cities on graph with Prolog? Program should check if there is a direct route between two given cities. Alternatively, i...

How can I find all the connected cities on graph with Prolog? How can I find all the connected cities on graph with Prolog? prolog How Prolog How can I find all the connected cities on graph with Prolog? Program should check if there is a direct route between two given cities. Alternatively, it can list all the connect...

[ -0.002960205078125, 0.00007390975952148438, 0.0157470703125, 0.031982421875, -0.0036468505859375, 0.001861572265625, -0.0208740234375, 0.005157470703125, 0.00885009765625, -0.04150390625, 0.00994873046875, -0.01123046875, -0.0230712890625, 0.0072021484375, -0.0032958984375, 0.016601562...

[ 11249, 831, 7413, 756, 70, 162711, 162708, 41382, 678, 1250, 4867, 87, 98, 502, 7663, 12765, 8951, 36439, 17721, 6626, 34475, 5303, 26349, 187895, 13695, 19922, 11737, 959, 21449, 1295, 24234, 49119, 18151, 13538, 7077, 60075, 100, 20662, 1...

[ 0.044158935546875, 0.04388427734375, 0.1632080078125, 0.1658935546875, 0.06280517578125, 0.1966552734375, 0.20751953125, 0.2113037109375, 0.066162109375, 0.1639404296875, 0.242431640625, 0.0235595703125, 0.0625, 0.10308837890625, 0.0965576171875, 0.1390380859375, 0.122802734375, 0....

embed

14389764_c0

14389764

prolog

0

Title: Prolog - extract numbers from nested list Problem title: Prolog - extract numbers from nested list Tags: prolog Problem: Prolog - extract numbers from nested list I trying to write a function getNumbers(List,Result) such that List is a list which his elements can be integer or list of lists , for example - List ...

Prolog - extract numbers from nested list Prolog - extract numbers from nested list prolog nested Prolog List Result Rest NewResultRest NewResultHead Prolog - extract numbers from nested list I trying to write a function getNumbers(List,Result) such that List is a list which his elements can be integer or list of lists...

[ -0.006439208984375, -0.00018310546875, 0.01220703125, 0.003570556640625, 0.00634765625, 0.025390625, -0.00823974609375, -0.00439453125, 0.017822265625, -0.033447265625, 0.00970458984375, -0.02685546875, -0.0281982421875, 0.0047607421875, 0.010986328125, 0.00106048583984375, 0.0114135...

[ 1250, 4867, 125663, 101935, 1295, 8512, 71, 5303, 502, 32036, 126684, 49756, 2356, 7, 7136, 525, 13025, 712, 31577, 33022, 32354, 2046, 18444, 26278, 154663, 4332, 1919, 80854, 831, 892, 1505, 140992, 5608, 756, 4343, 23, 37842, 28960, 1815...

[ 0.1702880859375, 0.2314453125, 0.2073974609375, 0.196044921875, 0.1295166015625, 0.24951171875, 0.1337890625, 0.1806640625, 0.1331787109375, 0.117431640625, 0.1763916015625, 0.140625, 0.038055419921875, 0.10089111328125, 0.1661376953125, 0.07305908203125, 0.054962158203125, 0.05728...

embed

36162785_c0

36162785

prolog

0

Title: prolog infinite loop unknown Problem title: prolog infinite loop unknown Tags: prolog, infinite-loop Problem: prolog infinite loop unknown This is a program that receives a list of coordinates ex:[e(1,2,3),e(4,5,6)]. Making the dynamics, divide and conquer, separates the list in half and half recursively, when y...

prolog infinite loop unknown prolog infinite loop unknown prolog infinite-loop append_ LastElements Tail prolog infinite loop unknown This is a program that receives a list of coordinates ex:[e(1,2,3),e(4,5,6)]. Making the dynamics, divide and conquer, separates the list in half and half recursively, when you have one ...

[ 0.017333984375, 0.01904296875, 0.0093994140625, -0.006866455078125, -0.0028533935546875, -0.00750732421875, -0.00138092041015625, 0.006072998046875, 0.02197265625, -0.032470703125, 0.00933837890625, -0.00213623046875, -0.00177001953125, 0.00909423828125, 0.010986328125, 0.0189208984375...

[ 502, 4867, 54241, 13, 40956, 51, 69723, 19, 28354, 114689, 71, 21672, 647, 19929, 7, 1218, 379, 3293, 83, 10, 1528, 53299, 5303, 176866, 90, 1119, 155761, 105801, 104629, 13676, 214, 84079, 101637, 136, 158, 27227, 84797, 23552, 195625, 1...

[ 0.2147216796875, 0.269287109375, 0.192626953125, 0.1138916015625, 0.30029296875, 0.104248046875, 0.2264404296875, 0.06463623046875, 0.2364501953125, 0.1407470703125, 0.048797607421875, 0.177001953125, 0.0282745361328125, 0.2059326171875, 0.006103515625, 0.134033203125, 0.164184570312...

embed

39303687_c0

39303687

prolog

0

Title: Maze Solver DFS Algorithm Problem title: Maze Solver DFS Algorithm Tags: maze, graph-algorithm, prolog Problem: Maze Solver DFS Algorithm I'm studying prolog in a course. I have an exercise where I need to read a file, generate a maze from it, get a path from the source to destination and write it to a file. I r...

Maze Solver DFS Algorithm Maze Solver DFS Algorithm maze graph-algorithm prolog Maze Solver DFS Algorithm CoordX CoordY TargetX TargetY SourceX SourceY NewSquare Tail HeadOfTail Maze Solver DFS Algorithm I'm studying prolog in a course. I have an exercise where I need to read a file, generate a maze from it, get a path...

[ 0.0306396484375, 0.00970458984375, -0.00173187255859375, 0.0201416015625, 0.002532958984375, 0.00136566162109375, -0.0272216796875, 0.0025177001953125, -0.005645751953125, -0.045166015625, 0.017333984375, 0.00775146484375, -0.004241943359375, -0.0101318359375, 0.02880859375, 0.01635742...

[ 29678, 13, 6678, 814, 391, 36381, 109847, 2783, 291, 731, 41382, 100628, 502, 4867, 1311, 6651, 1542, 1723, 160017, 77641, 2356, 94727, 1218, 379, 44816, 132887, 9874, 15411, 81979, 12301, 11435, 139392, 60875, 31344, 78869, 33657, 108047, 10...

[ 0.1505126953125, 0.1298828125, 0.181884765625, 0.1766357421875, 0.07501220703125, 0.2197265625, 0.1263427734375, 0.11865234375, 0.1241455078125, 0.1683349609375, 0.165283203125, 0.0810546875, 0.1588134765625, 0.2120361328125, 0.0328369140625, 0.1539306640625, 0.1375732421875, 0.120...

embed

40411184_c0

40411184

prolog

0

Title: some issue in my prolog code Problem title: some issue in my prolog code Tags: logic, prolog, swi-prolog Problem: some issue in my prolog code i am new to prolog and have written some code in prolog simply to show some message but when i run it produce some error that : 1) Syntax error: Unexpected end of clause ...

some issue in my prolog code some issue in my prolog code logic prolog swi-prolog course_crh Please Enter Max Less some issue in my prolog code i am new to prolog and have written some code in prolog simply to show some message but when i run it produce some error that : 1) Syntax error: Unexpected end of clause 2)ERRO...

[ 0.00396728515625, 0.00885009765625, -0.004608154296875, 0.01153564453125, -0.001617431640625, 0.00262451171875, -0.01068115234375, 0.015625, -0.00075531005859375, -0.0081787109375, 0.0159912109375, -0.0201416015625, -0.0137939453125, -0.018310546875, 0.017578125, 0.00506591796875, 0....

[ 3060, 31089, 23, 759, 502, 4867, 18151, 62775, 2452, 3454, 15411, 23150, 127, 30607, 60816, 9920, 1734, 3525, 59121, 7639, 26008, 11675, 27489, 18499, 19010, 86531, 992, 83613, 3564, 70731, 13, 4958, 12501, 14255, 150922, 84751, 151206, 24638...

[ 0.03851318359375, 0.1346435546875, 0.0239715576171875, 0.0523681640625, 0.164794921875, 0.23681640625, 0.2076416015625, 0.1182861328125, 0.1431884765625, 0.138671875, 0.14599609375, 0.0787353515625, 0.1539306640625, 0.06781005859375, 0.179443359375, 0.18701171875, 0.0802001953125, ...

embed

40722655_c0

40722655

prolog

0

Title: Cycle in directed graph in prolog Problem title: Cycle in directed graph in prolog Tags: prolog Problem: Cycle in directed graph in prolog I created a program in prolog, which should give me the routes between two stations in a cycle. When I for example ask for the route between s3 and s4, it gives me the two co...

Cycle in directed graph in prolog Cycle in directed graph in prolog prolog Cycle direction1 direction2 route1 route2 Cycle in directed graph in prolog I created a program in prolog, which should give me the routes between two stations in a cycle. When I for example ask for the route between s3 and s4, it gives me the t...

[ 0.0087890625, -0.0014190673828125, 0.013427734375, 0.0264892578125, -0.0025482177734375, -0.016357421875, -0.019287109375, -0.0003337860107421875, 0.006500244140625, -0.054443359375, -0.00531005859375, 0.0172119140625, -0.0262451171875, 0.018798828125, 0.0242919921875, 0.0240478515625,...

[ 151612, 13, 23, 8951, 297, 41382, 502, 4867, 48225, 304, 36439, 418, 75935, 1528, 8337, 17721, 6626, 29398, 105823, 26458, 91, 363, 617, 76199, 26785, 7, 910, 758, 1632, 29806, 2301, 18, 3444, 7722, 19922, 40368, 20028, 56282, 32786, 7510...

[ 0.2176513671875, 0.0770263671875, 0.051849365234375, 0.170654296875, 0.065185546875, 0.2030029296875, 0.1258544921875, 0.22216796875, 0.1859130859375, 0.0650634765625, 0.2109375, 0.0111083984375, 0.0291748046875, 0.125244140625, 0.0270843505859375, 0.0633544921875, 0.0572509765625, ...

embed

51070634_c0

51070634

prolog

0

Title: Getting all facts that are known to prolog (with special format) Problem title: Getting all facts that are known to prolog (with special format) Tags: prolog Problem: Getting all facts that are known to prolog (with special format) Prolog question: Consider the following format: carsCompany(Tel_Number, Manager, ...

Getting all facts that are known to prolog (with special format) Getting all facts that are known to prolog (with special format) prolog Getting Tel_Number Manager Company_Name new_cars Car_Name Color Creator Date_Creation old_cars Jujiro Matsuda Mazda mazda_3 Grey Person1 Cosmo Black Person2 RX-7 Old Getting all facts...

[ 0.021240234375, -0.0263671875, -0.000263214111328125, 0.00579833984375, -0.00653076171875, 0.0194091796875, 0.01422119140625, 0.0125732421875, 0.007598876953125, -0.03076171875, 0.00732421875, -0.0036163330078125, -0.031494140625, -0.0096435546875, -0.003997802734375, -0.00698852539062...

[ 210732, 756, 15824, 7, 450, 621, 51529, 47, 502, 4867, 76228, 5361, 9384, 9344, 18444, 26278, 30195, 33734, 163612, 3525, 3284, 3980, 51193, 192008, 25512, 63784, 10332, 3314, 658, 516, 114685, 6874, 125691, 17022, 85, 363, 95996, 15270, 17...

[ 0.1627197265625, 0.1834716796875, 0.202392578125, 0.1217041015625, 0.06634521484375, 0.1134033203125, 0.244384765625, 0.108154296875, 0.1708984375, 0.26953125, 0.050140380859375, 0.1263427734375, 0.191162109375, 0.13525390625, 0.0693359375, 0.0948486328125, 0.2186279296875, 0.09375...

embed

51010374_c0

51010374

prolog

0

Title: How to run a PROLOG script file in BATCH mode? (in Linux Terminal) Problem title: How to run a PROLOG script file in BATCH mode? (in Linux Terminal) Tags: swi-prolog, batch-processing, ubuntu, linux, prolog Problem: How to run a PROLOG script file in BATCH mode? (in Linux Terminal) I'm trying to use a PROLOG scr...

How to run a PROLOG script file in BATCH mode? (in Linux Terminal) How to run a PROLOG script file in BATCH mode? (in Linux Terminal) swi-prolog batch-processing ubuntu linux prolog How PROLOG BATCH Linux Terminal Rule db.pl Rule01 How to run a PROLOG script file in BATCH mode? (in Linux Terminal) I'm trying to use a P...

[ 0.023681640625, 0.031982421875, 0.00125885009765625, 0.0283203125, -0.0205078125, -0.00811767578125, 0.007415771484375, -0.0106201171875, 0.0093994140625, -0.0179443359375, 0.00164031982421875, -0.004180908203125, -0.02587890625, -0.00421142578125, 0.005340576171875, -0.001205444335937...

[ 11249, 11675, 10514, 47510, 26499, 11435, 23, 8678, 142481, 13736, 73, 29908, 124090, 91, 2452, 3454, 4867, 1777, 206, 63923, 198996, 11508, 6077, 502, 139118, 40041, 2424, 6746, 47, 10, 21947, 212398, 116890, 43240, 1250, 3642, 10869, 151814...

[ 0.0638427734375, 0.1690673828125, 0.2186279296875, 0.25146484375, 0.224853515625, 0.1697998046875, 0.03997802734375, 0.145751953125, 0.2158203125, 0.1417236328125, 0.05126953125, 0.159423828125, 0.262939453125, 0.03350830078125, 0.193115234375, 0.17236328125, 0.236328125, 0.1304931...

embed

23683289_c0

23683289

prolog

0

Title: Making Database for wordNet in SICStus Problem title: Making Database for wordNet in SICStus Tags: nlp, prolog Problem: Making Database for wordNet in SICStus I would like to make a prolog database that holds every synsets in wordNet which are about 117.000 synsets. As wordNet actually is kind of multi trees; so...

Making Database for wordNet in SICStus Making Database for wordNet in SICStus nlp prolog Making Database SICStus Making Database for wordNet in SICStus I would like to make a prolog database that holds every synsets in wordNet which are about 117.000 synsets. As wordNet actually is kind of multi trees; some daughters h...

[ 0.007537841796875, 0.0220947265625, -0.0147705078125, -0.005279541015625, -0.0128173828125, 0.0208740234375, -0.00836181640625, -0.011962890625, 0.00038909912109375, -0.06884765625, 0.01287841796875, -0.0108642578125, -0.00836181640625, -0.00138092041015625, -0.00677490234375, -0.00579...

[ 13676, 214, 187781, 2565, 24447, 159, 102198, 2143, 23, 26775, 502, 4867, 1884, 3249, 63399, 16401, 11907, 71695, 7831, 534, 112599, 6024, 1360, 76849, 5941, 27863, 3714, 167375, 17366, 17164, 12912, 27781, 4865, 14602, 6097, 101935, 29459, 5...

[ 0.0989990234375, 0.000579833984375, 0.23388671875, 0.1766357421875, 0.265380859375, 0.1123046875, 0.066162109375, 0.1932373046875, 0.00115966796875, 0.129150390625, 0.131591796875, 0.190673828125, 0.03057861328125, 0.072265625, 0.21923828125, 0.1099853515625, 0.0814208984375, 0.145...

embed

64664349_c0

64664349

prolog

0

Title: Output of a function as the input argument of another function in Prolog Problem title: Output of a function as the input argument of another function in Prolog Tags: prolog Problem: Output of a function as the input argument of another function in Prolog Let's say I have some predicates and a function like this...

Output of a function as the input argument of another function in Prolog Output of a function as the input argument of another function in Prolog prolog Output Prolog ListOfFacts Afact Call _8878 _8884 Fail Output of a function as the input argument of another function in Prolog Let's say I have some predicates and a f...

[ 0.0191650390625, 0.015380859375, 0.01434326171875, -0.004119873046875, -0.0198974609375, 0.017578125, 0.00135040283203125, -0.00323486328125, -0.0057373046875, -0.0380859375, -0.005157470703125, 0.0213623046875, -0.006591796875, -0.00836181640625, 0.0164794921875, -0.01025390625, -0....

[ 13538, 7077, 111, 32354, 237, 107730, 10750, 15700, 1250, 4867, 23, 502, 32036, 132887, 135518, 62, 114700, 26265, 138392, 1019, 49543, 617, 190355, 1653, 2063, 2806, 1884, 5201, 1052, 76228, 627, 238, 115081, 47, 69101, 12989, 37842, 41206, ...

[ 0.1895751953125, 0.123291015625, 0.0833740234375, 0.22509765625, 0.1240234375, 0.228271484375, 0.260009765625, 0.1014404296875, 0.156494140625, 0.2333984375, 0.0029296875, 0.121337890625, 0.062744140625, 0.136474609375, 0.115478515625, 0.02099609375, 0.20556640625, 0.06658935546875...

embed

40979912_c0

40979912

prolog

0

Title: How can I return a list of edges in a graph from one node to another? Problem title: How can I return a list of edges in a graph from one node to another? Tags: prolog, graph-theory, algorithm Problem: How can I return a list of edges in a graph from one node to another? Here's the question I'm trying to solve: ...

How can I return a list of edges in a graph from one node to another? How can I return a list of edges in a graph from one node to another? prolog graph-theory algorithm one How How can I return a list of edges in a graph from one node to another? Here's the question I'm trying to solve: Here are the graphs we're worki...

[ 0.02001953125, 0.0255126953125, -0.005767822265625, 0.00927734375, 0.007415771484375, 0.01068115234375, -0.03369140625, -0.0025787353515625, 0.00982666015625, -0.022705078125, 0.0198974609375, -0.006744384765625, -0.006256103515625, 0.004150390625, 0.0201416015625, 0.0201416015625, 0...

[ 11249, 831, 30646, 5303, 111, 121303, 7, 41382, 1295, 1632, 110, 112, 47, 15700, 23, 502, 4867, 234873, 87, 86869, 20697, 84751, 140992, 75169, 5351, 20903, 195, 104851, 135179, 237, 21208, 20949, 179933, 40956, 18, 2046, 1810, 4358 ]

[ 0.09283447265625, 0.08660888671875, 0.24169921875, 0.1942138671875, 0.07470703125, 0.257080078125, 0.0997314453125, 0.2044677734375, 0.096435546875, 0.0501708984375, 0.1461181640625, 0.103515625, 0.11328125, 0.0953369140625, 0.03009033203125, 0.03851318359375, 0.1226806640625, 0.08...

embed

22421426_c0

22421426

prolog

0

Title: Get simple Prolog example to work Problem title: Get simple Prolog example to work Tags: prolog Problem: Get simple Prolog example to work I am trying to run a simple gprolog to run on my Linux machine, GNU Prolog was installed from the Ubuntu Software Center. From the GNU Prolog Intro I got the following exampl...

Get simple Prolog example to work Get simple Prolog example to work prolog Get Prolog HelloWorld.pl HelloProlog instantiation_error z11 GNU Daniel Diaz Copyright Luke Anakin existence_error top_level Get simple Prolog example to work I am trying to run a simple gprolog to run on my Linux machine, GNU Prolog was install...

[ 0.02392578125, 0.00469970703125, 0.01397705078125, 0.019287109375, -0.0208740234375, 0.01416015625, 0.0076904296875, -0.00506591796875, -0.00133514404296875, -0.05859375, 0.017333984375, -0.0115966796875, -0.017333984375, 0.01123046875, 0.00787353515625, -0.01171875, 0.00308227539062...

[ 20779, 8781, 1250, 4867, 27781, 47, 4488, 502, 35378, 70646, 2424, 10752, 34648, 14, 188800, 97, 1662, 165132, 11555, 4512, 169, 4189, 97702, 20405, 73, 116311, 2663, 67919, 31577, 11675, 706, 3454, 29908, 36279, 20600, 1295, 116890, 23752, ...

[ 0.078857421875, 0.2098388671875, 0.209716796875, 0.2734375, 0.277587890625, 0.06964111328125, 0.15380859375, 0.1605224609375, 0.158935546875, 0.1197509765625, 0.1148681640625, 0.2039794921875, 0.11279296875, 0.09564208984375, 0.159912109375, 0.06884765625, 0.1199951171875, 0.173217...

embed

42994731_c0

42994731

prolog

0

Title: Prolog conditional statements Problem title: Prolog conditional statements Tags: prolog Problem: Prolog conditional statements Suppose we are given certain facts and we were supposed to write a certain rule that explores a given condition in those facts, for example, if we are given certain climates and their ch...

Prolog conditional statements Prolog conditional statements prolog Prolog Month Prolog conditional statements Suppose we are given certain facts and we were supposed to write a certain rule that explores a given condition in those facts, for example, if we are given certain climates and their characteristics: If we wan...

[ -0.00872802734375, -0.003173828125, -0.00005650520324707031, 0.0224609375, -0.01007080078125, -0.00116729736328125, -0.00054168701171875, 0.0018310546875, -0.00106048583984375, 0.031982421875, -0.000732421875, 0.00494384765625, 0.00946044921875, -0.008544921875, 0.00201416015625, 0.014...

[ 1250, 4867, 35431, 289, 63805, 502, 12982, 127, 121691, 34475, 24233, 15824, 134598, 33022, 79986, 88898, 153552, 62816, 48242, 36663, 7413, 1810, 8010, 136, 36898, 37842, 55300, 36917, 22027, 18, 48903, 4488, 175399, 68772, 76199, 163, 756, ...

[ 0.1800537109375, 0.256591796875, 0.2374267578125, 0.1405029296875, 0.1922607421875, 0.12939453125, 0.159423828125, 0.09149169921875, 0.0057373046875, 0.05889892578125, 0.0185546875, 0.09027099609375, 0.09130859375, 0.115234375, 0.1331787109375, 0.0814208984375, 0.1810302734375, 0.1...

embed

43552212_c0

43552212

prolog

0

Title: Prolog -- Arguments are not sufficiently instantiated Problem title: Prolog -- Arguments are not sufficiently instantiated Tags: prolog, instantiation-error Problem: Prolog -- Arguments are not sufficiently instantiated I am trying to check for even/odd players and even/odd columns in a game by counting the play...

Prolog -- Arguments are not sufficiently instantiated Prolog -- Arguments are not sufficiently instantiated prolog instantiation-error Prolog Arguments Game TotalPlayers TotalCols ERROR _34862 _34894 _34896 Prolog -- Arguments are not sufficiently instantiated I am trying to check for even/odd players and even/odd colu...

[ 0.01123046875, 0.005615234375, 0.00689697265625, 0.005340576171875, 0.004302978515625, 0.00341796875, -0.008056640625, -0.029296875, 0.017578125, 0.00421142578125, 0.0113525390625, -0.0040283203125, 0.00335693359375, 0.003173828125, 0, -0.00384521484375, 0.00726318359375, -0.018676...

[ 1250, 4867, 112140, 7, 621, 959, 129980, 538, 34648, 14, 27686, 4210, 502, 188800, 13547, 33867, 142581, 78457, 151206, 24638, 135407, 10837, 14889, 11648, 31577, 12765, 3853, 64, 13606, 92865, 3365, 316, 6712, 54529, 26518, 759, 77336, 26785...

[ 0.2025146484375, 0.247802734375, 0.29248046875, 0.113525390625, 0.02923583984375, 0.1346435546875, 0.19091796875, 0.060455322265625, 0.1585693359375, 0.1351318359375, 0.0948486328125, 0.008544921875, 0.1566162109375, 0.1524658203125, 0.088623046875, 0.1444091796875, 0.2122802734375, ...

embed

28367307_c1

28367307

prolog

1

cityj, 50). path(cityh, cityj, 90). path(cityi, cityh, 70). path(citya,cityc,120). path(citya,cityb,60). % chopper attributes chopper_islanded(true). chopper_islanded(false). chopper_at(X):- chopper_islanded(true); chopper_islanded(false), place(X), is_chopper(chopper1). % place states, G=on ground, A= in air, v[list ...

[ -0.01068115234375, -0.01458740234375, 0.005279541015625, 0.01068115234375, -0.01251220703125, -0.0089111328125, -0.0003662109375, -0.0184326171875, 0.007293701171875, -0.04443359375, -0.002105712890625, 0.01104736328125, -0.02490234375, -0.003875732421875, -0.0166015625, -0.00738525390...

[ 26349, 170, 836, 60875, 60089, 127, 2510, 14, 2358, 11, 238, 20840, 275, 88586, 1745, 681, 8079, 150380, 90, 164, 1760, 9774, 8710, 257, 1542, 3687, 83, 3089, 117249, 527, 61585, 62, 1831, 81, 6562, 27289, 15982, 11341, 334, 724, 683, ...

[ 0.0885009765625, 0.1361083984375, 0.1533203125, 0.172607421875, 0.0511474609375, 0.11181640625, 0.146240234375, 0.042388916015625, 0.0975341796875, 0.0933837890625, 0.0120849609375, 0.141357421875, 0.0174560546875, 0.1199951171875, 0.0491943359375, 0.1856689453125, 0.1949462890625, ...

embed

10625331_c1

10625331

prolog

1

_piece(X, [_,_,_,X,_,_,_,_,_]) :- line_of(place(_,center,_,_), center), column_of(place(_,_,left,_), left), !. put_piece(X, [_,_,_,_,X,_,_,_,_]) :- line_of(place(_,center,_,_), center), column_of(place(_,_,middle,_), middle), !. put_piece(X, [_,_,_,_,_,X,_,_,_]) :- line_of(place(_,center,_,_), center), column_of(place(...

[ 0.00341796875, -0.00787353515625, -0.00150299072265625, -0.0015411376953125, -0.01092529296875, 0.01025390625, -0.004364013671875, -0.0172119140625, 0.01708984375, -0.038818359375, -0.01275634765625, 0.017333984375, 0.0191650390625, -0.01104736328125, -0.031982421875, -0.01287841796875...

[ 101, 152667, 132, 1542, 4, 378, 454, 268, 16, 15772, 13315, 4390, 23935, 30090, 247, 27585, 3365, 316, 19, 133, 2480, 25737, 711, 5, 3884, 22000, 19298, 86991, 7108, 9190, 5928, 103136, 54969, 93232, 16777, 194, 233987, 8231, 112, 420, ...

[ 0.1746826171875, 0.322265625, 0.074462890625, 0.2103271484375, 0.0823974609375, 0.066162109375, 0.1329345703125, 0.032012939453125, 0.031768798828125, 0.1773681640625, 0.231689453125, 0.256103515625, 0.202392578125, 0.18798828125, 0.03173828125, 0.1793212890625, 0.1646728515625, 0....

embed

33685538_c0

33685538

prolog

0

Title: How do I tell if an atom contains a sub atom in Prolog Problem title: How do I tell if an atom contains a sub atom in Prolog Tags: split, prolog, contains Problem: How do I tell if an atom contains a sub atom in Prolog I am deigning a program which takes in an argument (an atom). Then splits it up into its parts...

How do I tell if an atom contains a sub atom in Prolog How do I tell if an atom contains a sub atom in Prolog split prolog contains How Prolog atom_split Commands if:a How do I tell if an atom contains a sub atom in Prolog I am deigning a program which takes in an argument (an atom). Then splits it up into its parts as...

[ -0.00714111328125, 0.00860595703125, -0.00185394287109375, 0.0203857421875, -0.0208740234375, 0.0179443359375, 0.0189208984375, -0.0128173828125, -0.0172119140625, -0.017578125, 0.00872802734375, 0.0198974609375, -0.015869140625, -0.0034942626953125, 0.0191650390625, -0.006683349609375...

[ 11249, 14192, 2174, 34627, 70541, 1614, 23, 1250, 4867, 7, 65450, 502, 7008, 4353, 123573, 11, 10, 872, 1528, 51776, 10750, 1257, 3934, 63920, 61924, 62822, 12989, 366, 107730, 27140, 41143, 3564, 177261, 75101, 9844, 11177, 122092, 147 ]

[ 0.003875732421875, 0.1580810546875, 0.0894775390625, 0.2178955078125, 0.157470703125, 0.21826171875, 0.043670654296875, 0.1397705078125, 0.2086181640625, 0.039093017578125, 0.1708984375, 0.13525390625, 0.046722412109375, 0.1422119140625, 0.16943359375, 0.007904052734375, 0.0062561035...

embed

8124070_c0

8124070

prolog

0

Title: Prolog Database Query Problem title: Prolog Database Query Tags: prolog, database, comparison Problem: Prolog Database Query To make a dating database with facts in the form of: person(name, age, sex, height, weight, education, salary) Given the input of: datable(alex, X). datable_weight_limit(alex, 170, X). Whe...

Prolog Database Query Prolog Database Query prolog database comparison Prolog Database Query datable_weight_limit edu_less edu_lesser Agel Sexl Heightl Weightl Educationl Salaryl Namem Agem Sexm Heightm Weightm Educationm Salarym Prolog Database Query To make a dating database with facts in the form of: person(name, ag...

[ 0.018798828125, 0.013916015625, 0.00775146484375, 0.0074462890625, -0.022705078125, 0.01226806640625, -0.03515625, 0.0101318359375, 0.0179443359375, -0.03955078125, -0.0031280517578125, -0.00958251953125, -0.01263427734375, -0.0018157958984375, -0.00128936767578125, 0.005767822265625, ...

[ 1250, 4867, 187781, 58836, 53, 502, 63399, 225490, 48, 22819, 165598, 93343, 71201, 9393, 56, 62, 2679, 3621, 141, 1529, 22553, 150533, 43154, 13294, 2096, 195, 14716, 39, 1294, 3249, 1740, 678, 15824, 3173, 3445, 11627, 32070, 1100, 155955...

[ 0.130126953125, 0.23486328125, 0.207763671875, 0.152587890625, 0.0057373046875, 0.0889892578125, 0.253662109375, 0.1015625, 0.09979248046875, 0.2327880859375, 0.2423095703125, 0.2254638671875, 0.1177978515625, 0.16455078125, 0.007354736328125, 0.017730712890625, 0.16064453125, 0.10...

embed

4635401_c0

4635401

prolog

0

Title: Implementing a model written in a Predicate Calculus into ProLog, how do I start? Problem title: Implementing a model written in a Predicate Calculus into ProLog, how do I start? Tags: artificial-intelligence, prolog Problem: Implementing a model written in a Predicate Calculus into ProLog, how do I start? I hav...

Implementing a model written in a Predicate Calculus into ProLog, how do I start? Implementing a model written in a Predicate Calculus into ProLog, how do I start? artificial-intelligence prolog Implementing Predicate Calculus ProLog Implementing a model written in a Predicate Calculus into ProLog, how do I start? I ha...

[ 0.0201416015625, 0.00872802734375, -0.0162353515625, 0.0255126953125, 0.00003600120544433594, 0.0458984375, 0.02294921875, -0.01300048828125, 0, -0.064453125, 0.0167236328125, -0.00201416015625, -0.0089111328125, -0.0181884765625, 0.0145263671875, -0.004791259765625, -0.0247802734375...

[ 153941, 214, 3299, 59121, 7145, 2063, 67, 212467, 223, 3934, 1250, 113972, 3642, 54, 87, 4034, 23, 66733, 130687, 502, 4867, 765, 22759, 5423, 234873, 3444, 237, 88996, 3871, 756, 71924, 5701, 28032, 12638, 28484, 3522, 110, 56037, 16981, ...

[ 0.233154296875, 0.0189208984375, 0.27001953125, 0.14990234375, 0.189697265625, 0.21923828125, 0.08428955078125, 0.2161865234375, 0.1348876953125, 0.1279296875, 0.1993408203125, 0.271484375, 0.03765869140625, 0.0115966796875, 0.004364013671875, 0.14794921875, 0.0009765625, 0.1229248...

embed

27844039_c0

27844039

prolog

0

Title: Summing an already outputted list Problem title: Summing an already outputted list Tags: prolog, logic Problem: Summing an already outputted list This is the knowledge base I am working with: localLib('AHorowitz','Stormbreaker',2). localLib('AHorowitz','Scorpia',4). localLib('AHorowitz','Ark Angel',6). The key f...

Summing an already outputted list Summing an already outputted list prolog logic the Summing AHorowitz Stormbreaker Scorpia Ark Angel Writer Book Acknowledgements sum_list Summing an already outputted list This is the knowledge base I am working with: The key for the knowledge base is as follows: I would like to write ...

[ 0.00982666015625, 0.01202392578125, 0.003692626953125, 0.0185546875, -0.0189208984375, 0.00897216796875, -0.0108642578125, 0.038818359375, 0.0184326171875, -0.0281982421875, 0.0263671875, -0.0115966796875, 0.01025390625, -0.0037384033203125, 0.02392578125, -0.00653076171875, 0.016967...

[ 1832, 58838, 21771, 140992, 3674, 5303, 142, 502, 4867, 62775, 12393, 147595, 115885, 70751, 56, 86590, 399, 63248, 26902, 2783, 27432, 69723, 181606, 10554, 6562, 51359, 3647, 20697, 22799, 1884, 33022, 79986, 15190, 756, 224344, 111, 70035, ...

[ 0.2174072265625, 0.21923828125, 0.2037353515625, 0.20068359375, 0.1322021484375, 0.2445068359375, 0.036407470703125, 0.1207275390625, 0.16845703125, 0.167236328125, 0.03485107421875, 0.161376953125, 0.05426025390625, 0.158203125, 0.0118408203125, 0.1002197265625, 0.0712890625, 0.10...

embed

56467776_c1

56467776

prolog

1

valid way to go about solving this problem. :-lib(ic). getNth(0, [ H | T], H, T). getNth(Count, [ _ | T], Target, Others):- NewCount is Count - 1, getNth(NewCount, T, Target, Others). assigned(_, [], TruthVal, TruthVal). assigned(Var, [Val | OtherVals], CurTruthVal, TruthVal):- UpdatedTruthVal #= (CurTruthVal and (Var...

[ -0.0038299560546875, 0.00506591796875, 0.01220703125, 0.0220947265625, -0.00567626953125, 0.003875732421875, -0.0152587890625, 0.006683349609375, 0.00439453125, -0.04931640625, 0.012939453125, 0.0019989013671875, 0.004150390625, 0.00799560546875, -0.01458740234375, 0.000118255615234375...

[ 35604, 3917, 47, 738, 1672, 3115, 6496, 903, 2967, 5, 15772, 5612, 132, 1771, 194, 2046, 839, 927, 2389, 4, 572, 58745, 384, 268, 108210, 378, 101, 6, 160017, 64511, 7, 2077, 9, 2356, 83, 20, 106, 46568, 95486, 297, 184431, 42272, 8...

[ 0.21044921875, 0.1051025390625, 0.074462890625, 0.059417724609375, 0.150146484375, 0.2091064453125, 0.1639404296875, 0.1536865234375, 0.256103515625, 0.0751953125, 0.13232421875, 0.2496337890625, 0.0660400390625, 0.2225341796875, 0.034423828125, 0.15576171875, 0.10205078125, 0.2302...

embed

41025065_c1

41025065

prolog

1

Goals, Goal) :- % Select Goal from Goals member( Goal, Goals). % A simple selection principle achieves( Action, Goal) :- adds( Action, Goals), member( Goal, Goals). preserves( Action, Goals) :- % Action does not destroy Goals deletes( Action, Relations), not((member( Goal, Relations), member( Goal, Goals))). regress( ...

[ -0.01708984375, 0.03466796875, 0.00994873046875, 0.01318359375, -0.0174560546875, -0.015869140625, -0.01348876953125, -0.01312255859375, 0.0196533203125, 0.007598876953125, 0.01080322265625, 0.026123046875, -0.0289306640625, -0.005157470703125, -0.00933837890625, 0.01025390625, -0.00...

[ 2016, 16765, 4, 289, 16, 15772, 1745, 51620, 1295, 32786, 132, 194, 8781, 132216, 24702, 133, 69307, 57945, 15190, 479, 86687, 959, 163684, 8, 74635, 116822, 27417, 45167, 7, 19623, 17903, 853, 8305, 2356, 4332, 57860, 154109, 5584, 49756, ...

[ 0.2783203125, 0.252197265625, 0.11181640625, 0.2303466796875, 0.007537841796875, 0.096435546875, 0.1312255859375, 0.2001953125, 0.07958984375, 0.1978759765625, 0.0266876220703125, 0.029571533203125, 0.161376953125, 0.2352294921875, 0.1962890625, 0.1131591796875, 0.1876220703125, 0....

embed

49842319_c0

49842319

prolog

0

Title: Logic gate AND in swi-prolog Problem title: Logic gate AND in swi-prolog Tags: prolog, boolean-logic Problem: Logic gate AND in swi-prolog How do I get for the following Prolog program and(1,1,1). and(1,0,0). and(0,1,0). and(0,0,0). respective the following answer ?- and(A,B,C). A=1, B=1, C=1; A=1, B=0, C=0; A=0...

Logic gate AND in swi-prolog Logic gate AND in swi-prolog prolog boolean-logic Logic GNU Prolog Compiled Feb Daniel Diaz Copyright Logic gate AND in swi-prolog How do I get for the following Prolog program respective the following answer When I try to run the program above I get the following result It seems to be corr...

[ 0.0157470703125, 0.022216796875, 0.00927734375, 0.0068359375, -0.01116943359375, 0.00860595703125, -0.01470947265625, 0.0120849609375, -0.01153564453125, -0.0028228759765625, -0.0011444091796875, -0.016845703125, -0.03271484375, 0.012939453125, 0.0250244140625, 0.010009765625, 0.0216...

[ 50592, 238, 70836, 48762, 91, 2452, 3454, 4867, 23, 502, 31, 34677, 137043, 165132, 1250, 4512, 4189, 2046, 100, 25632, 1528, 107013, 35166, 9790, 11675, 36917, 16750, 37202, 26785, 3444, 765, 77336, 84751, 27781, 4734, 34627, 3309, 237, 84...

[ 0.189208984375, 0.0577392578125, 0.177978515625, 0.253662109375, 0.023345947265625, 0.2025146484375, 0.1417236328125, 0.2213134765625, 0.002655029296875, 0.1175537109375, 0.045074462890625, 0.1220703125, 0.155517578125, 0.130859375, 0.15234375, 0.00103759765625, 0.0704345703125, 0....

embed

64449596_c0

64449596

prolog

0

Title: Prolog, display list result, after algorithm Problem title: Prolog, display list result, after algorithm Tags: recursion, prolog Problem: Prolog, display list result, after algorithm I got a list of names, and according to whom owns what, I want to split it in 2 different list. I debugged my code and it seems to...

Prolog, display list result, after algorithm Prolog, display list result, after algorithm recursion prolog Prolog What Prolog, display list result, after algorithm I got a list of names, and according to whom owns what, I want to split it in 2 different list. I debugged my code and it seems to work, but the console is ...

[ 0.024658203125, -0.00074005126953125, 0.037353515625, 0.007598876953125, 0.0010833740234375, 0.00494384765625, 0.00372314453125, 0.0169677734375, 0.0037078857421875, 0.0027313232421875, 0.0128173828125, 0.01446533203125, -0.0084228515625, 0.01397705078125, 0.0033721923828125, 0.0159912...

[ 1250, 4867, 44116, 5303, 16750, 7103, 234873, 195625, 1830, 502, 4865, 4163, 123055, 59499, 136565, 10002, 2367, 3444, 65450, 23, 116, 12921, 8, 978, 18151, 37202, 4488, 1284, 130250, 11343, 30646, 29568, 60075, 13, 3358, 2203, 236, 66, 148...

[ 0.206787109375, 0.2880859375, 0.2037353515625, 0.225341796875, 0.2059326171875, 0.158203125, 0.259765625, 0.2049560546875, 0.067626953125, 0.1558837890625, 0.0355224609375, 0.005828857421875, 0.15283203125, 0.0178375244140625, 0.086181640625, 0.1441650390625, 0.07769775390625, 0.07...

embed

6283849_c0

6283849

prolog

0

Title: Prolog out of global stack Problem title: Prolog out of global stack Tags: list, stack, prolog, overflow Problem: Prolog out of global stack Hi guys i'm new on Prolog. I'm trying to combine 1000 elements in class 3 without repetition. I have done the code, but i have out of stack problem. member(T, [T|R], R) :- ...

Prolog out of global stack Prolog out of global stack list stack prolog overflow Prolog last_element percentuale_macronutrienti Alimento NRAlimenti RIS PMR RParz Index Index1 RIS1 OldR Risultato TOldR LastElement Alimento1 OldM TOldM NewM Prolog out of global stack Hi guys i'm new on Prolog. I'm trying to combine 1000 ...

[ -0.00341796875, 0.0157470703125, -0.0145263671875, 0.005645751953125, -0.00543212890625, 0.00421142578125, -0.02099609375, 0.011474609375, 0.0126953125, -0.0322265625, 0.018798828125, -0.001983642578125, 0.0264892578125, -0.0201416015625, 0.015625, -0.0048828125, 0.0045166015625, -...

[ 1250, 4867, 1810, 111, 7964, 177261, 5303, 502, 645, 118664, 4568, 62766, 172345, 143674, 21616, 2132, 2611, 6210, 60330, 45956, 1052, 169, 31471, 75876, 21672, 19929, 25074, 594, 2356, 51484, 3525, 98, 31577, 70163, 4382, 80854, 18507, 138, ...

[ 0.187255859375, 0.297607421875, 0.1885986328125, 0.21826171875, 0.236083984375, 0.285888671875, 0.152587890625, 0.124755859375, 0.08416748046875, 0.191162109375, 0.1162109375, 0.161376953125, 0.1395263671875, 0.112548828125, 0.036376953125, 0.07708740234375, 0.1417236328125, 0.0763...

embed

21841631_c0

21841631

prolog

0

Title: swi Prolog - Error arguments not sufficiently Instantiated Problem title: swi Prolog - Error arguments not sufficiently Instantiated Tags: instantiation-error, prolog Problem: swi Prolog - Error arguments not sufficiently Instantiated I am new to Prolog and when I query sortedUnion([1,1,1,2,3,4,4,5], [0,1,3,3,6,...

swi Prolog - Error arguments not sufficiently Instantiated swi Prolog - Error arguments not sufficiently Instantiated instantiation-error prolog L Prolog Error Instantiated Exception _G114 _G162 _G201 _G231 _G243 _G249 _G297 _G336 _G357 _G369 swi Prolog - Error arguments not sufficiently Instantiated I am new to Prolog...

[ 0.004791259765625, 0.03271484375, 0.0198974609375, -0.03466796875, -0.0118408203125, -0.00167083740234375, -0.00970458984375, -0.02294921875, 0.006988525390625, -0.013427734375, 0.007415771484375, 0.007568359375, 0.004119873046875, 0.00144195556640625, -0.0034637451171875, 0.0033416748...

[ 91, 2452, 1250, 4867, 212059, 10750, 7, 959, 129980, 538, 166945, 14, 27686, 34648, 188800, 502, 339, 5443, 63928, 129150, 2485, 304, 123885, 5016, 2357, 363, 1126, 142173, 8659, 115021, 125832, 3525, 41, 1294, 17497, 71, 147547, 132, 1065,...

[ 0.042022705078125, 0.2239990234375, 0.1915283203125, 0.2239990234375, 0.194580078125, 0.238525390625, 0.033935546875, 0.133056640625, 0.19287109375, 0.051788330078125, 0.136962890625, 0.1171875, 0.0765380859375, 0.08966064453125, 0.1666259765625, 0.1385498046875, 0.108154296875, 0....

embed

44609416_c0

44609416

prolog

0

Title: Prolog integer comparison fails with error_type error Problem title: Prolog integer comparison fails with error_type error Tags: prolog Problem: Prolog integer comparison fails with error_type error I am trying to resolve exercise 2 of lists construction section of this page : Write a program to delete all refer...

Prolog integer comparison fails with error_type error Prolog integer comparison fails with error_type error prolog Prolog error_type delete_all Result ThrowAway Tail type_error Prolog integer comparison fails with error_type error I am trying to resolve exercise 2 of lists construction section of this page : Here is th...

[ -0.00872802734375, 0.0027618408203125, 0.00860595703125, 0.01025390625, 0.00159454345703125, 0.007232666015625, -0.00872802734375, -0.0152587890625, -0.00177001953125, 0.00408935546875, 0.02685546875, -0.0128173828125, 0.0128173828125, 0.01495361328125, 0.0230712890625, -0.0146484375, ...

[ 1250, 4867, 892, 1505, 225490, 35782, 678, 18499, 50986, 502, 154109, 5584, 126684, 15555, 7514, 1218, 379, 10644, 188800, 103608, 81979, 5303, 50961, 26499, 26785, 50339, 275, 71, 7, 7136, 175399, 903, 17368, 706, 3454, 1379, 198996, 6849, ...

[ 0.174072265625, 0.2210693359375, 0.10791015625, 0.035675048828125, 0.2008056640625, 0.1458740234375, 0.05181884765625, 0.15380859375, 0.189208984375, 0.1297607421875, 0.1959228515625, 0.1419677734375, 0.203857421875, 0.0963134765625, 0.154296875, 0.1234130859375, 0.09722900390625, ...

embed

14044146_c1

14044146

prolog

1

tuesday, 2, cse115, monday, 1, cse116, monday, 2, cse117, tuesday, 1, cse118, tuesday, 2] I wrote a code that has no constraints: course(cse111,1). course(cse112,1). course(cse113,1). course(cse114,1). course(cse115,2). course(cse116,2). course(cse117,2). course(cse118,2). slot(monday,1). slot(monday,2). slot(tuesday,...

[ 0.0067138671875, 0.0185546875, 0.0146484375, 0.0272216796875, -0.034423828125, -0.00994873046875, -0.01806640625, -0.00506591796875, 0.0037078857421875, -0.0194091796875, -0.01226806640625, -0.015380859375, -0.00799560546875, -0.0012359619140625, -0.01092529296875, 0.0164794921875, 0...

[ 370, 90, 5636, 4, 116, 501, 184, 103928, 149550, 53, 106, 120620, 115250, 116329, 268, 87, 54397, 18151, 1556, 110, 158, 2816, 4288, 15411, 67130, 97024, 17727, 88438, 116597, 129150, 10461, 24897, 119720, 458, 94957, 56, 331, 1991, 80889, ...

[ 0.16259765625, 0.138916015625, 0.1492919921875, 0.0361328125, 0.168212890625, 0.054412841796875, 0.123291015625, 0.25341796875, 0.1546630859375, 0.1341552734375, 0.1138916015625, 0.2095947265625, 0.214599609375, 0.2015380859375, 0.03497314453125, 0.061737060546875, 0.1082763671875, ...

embed

15858067_c0

15858067

prolog

0

Title: Inserting X in its correct position in a sorted list while reading Problem title: Inserting X in its correct position in a sorted list while reading Tags: prolog, insertion-sort Problem: Inserting X in its correct position in a sorted list while reading I tried a lot to think how I can add a value in a sorted li...

Inserting X in its correct position in a sorted list while reading Inserting X in its correct position in a sorted list while reading prolog insertion-sort Inserting input.txt Str read_file Lines Stream at_end_of_stream Sorted Sorted1 Inserting X in its correct position in a sorted list while reading I tried a lot to t...

[ -0.00909423828125, -0.01446533203125, 0.018798828125, -0.0147705078125, -0.00872802734375, 0.0142822265625, -0.004608154296875, -0.0244140625, -0.0002899169921875, -0.01434326171875, 0.01708984375, -0.0076904296875, -0.0296630859375, -0.020263671875, 0.0169677734375, 0.005218505859375,...

[ 360, 2189, 1916, 1193, 23, 6863, 26785, 19069, 17497, 71, 5303, 12960, 16454, 502, 4867, 241860, 62351, 107730, 124326, 23351, 12301, 29822, 16777, 115061, 3611, 86429, 53666, 297, 10, 37842, 5915, 3642, 831, 15190, 34292, 26366, 8110, 1295, ...

[ 0.09442138671875, 0.1943359375, 0.06488037109375, 0.210205078125, 0.07080078125, 0.0701904296875, 0.1572265625, 0.168212890625, 0.2108154296875, 0.106689453125, 0.2069091796875, 0.12939453125, 0.224365234375, 0.136474609375, 0.1990966796875, 0.1749267578125, 0.195068359375, 0.16491...

embed

38649534_c0

38649534

prolog

0

Title: Using list instead of multiple clauses to enumerate data Problem title: Using list instead of multiple clauses to enumerate data Tags: prolog Problem: Using list instead of multiple clauses to enumerate data I want to make a Prolog program where I have a "Person" that "Watched" "Movies". And I want to write it l...

Using list instead of multiple clauses to enumerate data Using list instead of multiple clauses to enumerate data prolog Using Thor Captain America Using list instead of multiple clauses to enumerate data I want to make a Prolog program where I have a "Person" that "Watched" "Movies". And I want to write it like watche...

[ -0.0017547607421875, 0.0263671875, 0.0174560546875, 0.02392578125, -0.0026702880859375, 0.013427734375, -0.015869140625, 0.02197265625, 0.006317138671875, -0.03564453125, -0.0169677734375, -0.0067138671875, 0.00714111328125, -0.006591796875, -0.0167236328125, -0.009521484375, 0.03417...

[ 345, 6953, 5303, 64457, 48716, 70731, 90, 189085, 67, 2053, 502, 4867, 38692, 154564, 21629, 3444, 3249, 1250, 1528, 160054, 156378, 187430, 33022, 1884, 192509, 30816, 18151, 136036, 106, 14277, 116, 11001, 72304, 117, 3445, 32562, 71358, 12...

[ 0.10498046875, 0.037017822265625, 0.258056640625, 0.132080078125, 0.16796875, 0.213134765625, 0.09759521484375, 0.236083984375, 0.1339111328125, 0.1881103515625, 0.175537109375, 0.215087890625, 0.19287109375, 0.1815185546875, 0.177978515625, 0.043914794921875, 0.0153045654296875, 0...

embed

32844538_c0

32844538

prolog

0

Title: Prolog why is there a redo here? Problem title: Prolog why is there a redo here? Tags: prolog, recursion Problem: Prolog why is there a redo here? So, I have this code: shuffle([],[],[]). shuffle([], Shuffled, Rest):- listReverse(Rest, RestRes), shuffle(RestRes, Shuffled, []). shuffle([A|[]], [A|Shuffled], Rest)...

Prolog why is there a redo here? Prolog why is there a redo here? prolog recursion Prolog Shuffled Rest RestRes List Redo Call _2668 _2693 Exit _2604 Prolog why is there a redo here? So, I have this code: And helper: It works fine, when I call: I get: X = [1,3,2] but then there is a questionmark "?", and if I press ";"...

[ 0.00024318695068359375, 0.01336669921875, 0.0213623046875, -0.0030517578125, -0.021728515625, -0.00020694732666015625, -0.02001953125, 0.0069580078125, 0.007537841796875, 0.0130615234375, 0.020263671875, 0.013671875, 0.007568359375, 0.0125732421875, 0.0208740234375, 0.0115966796875, ...

[ 1250, 4867, 15400, 83, 2685, 10, 41313, 3688, 502, 195625, 1830, 13684, 4902, 6259, 49756, 4332, 7, 32036, 6096, 31, 26265, 180695, 4046, 11591, 5443, 217, 7709, 18151, 4358, 56, 43240, 5885, 11782, 1193, 2203, 363, 90173, 9655, 10015, 29...

[ 0.1815185546875, 0.2646484375, 0.154541015625, 0.079833984375, 0.1171875, 0.1151123046875, 0.314697265625, 0.166015625, 0.1466064453125, 0.1788330078125, 0.00970458984375, 0.039886474609375, 0.142333984375, 0.093505859375, 0.1689453125, 0.1396484375, 0.0198822021484375, 0.158203125...

embed

52802222_c0

52802222

prolog

0

Title: Create a list by selecting 1 element from each list (prolog) Problem title: Create a list by selecting 1 element from each list (prolog) Tags: prolog Problem: Create a list by selecting 1 element from each list (prolog) I have a list that contains lists. I want to create a list of permutation. Example: generate_...

Create a list by selecting 1 element from each list (prolog) Create a list by selecting 1 element from each list (prolog) prolog each Create generate_perm Perm Perm2 Call _4961 Exit _56173 _138349 Create a list by selecting 1 element from each list (prolog) I have a list that contains lists. I want to create a list of ...

[ -0.00982666015625, 0.0233154296875, 0.0115966796875, -0.00677490234375, -0.01495361328125, -0.005615234375, -0.031494140625, 0, 0.01519775390625, -0.0225830078125, 0.007659912109375, 0.0115966796875, 0.0157470703125, 0.02880859375, -0.0201416015625, -0.0146484375, 0.015625, 0.00711...

[ 151313, 5303, 36849, 106, 12830, 1295, 12638, 3454, 4867, 502, 139392, 1264, 39, 908, 304, 26265, 186410, 418, 5443, 217, 155128, 13574, 117760, 390, 214, 70541, 3444, 28282, 117, 561, 22062, 140992, 653, 927, 83, 107730, 37842, 32786, 7413...

[ 0.1243896484375, 0.2227783203125, 0.1280517578125, 0.116943359375, 0.180419921875, 0.06842041015625, 0.1026611328125, 0.125, 0.1798095703125, 0.130859375, 0.1961669921875, 0.1883544921875, 0.15478515625, 0.16064453125, 0.076904296875, 0.09405517578125, 0.0977783203125, 0.0151519775...

embed

54369699_c1

54369699

prolog

1

mul_op, term(Term). term(term(Factor, div_op, Term)) --> factor(Factor), div_op, term(Term). term(term(Factor)) --> factor(Factor). factor(factor('(', Expr, ')')) --> '(', expr(Expr), ')'. factor(factor(Digit)) --> digit_code(Digit). add_op --> ['+']. sub_op --> ['-']. mul_op --> ['*']. div_op --> ['/']. letter_code a...

[ 0.0267333984375, 0.013671875, -0.006378173828125, 0.0072021484375, 0.0013275146484375, 0.0123291015625, -0.00130462646484375, 0.013916015625, 0.00604248046875, -0.018310546875, 0.005889892578125, 0.00372314453125, 0.000949859619140625, -0.014892578125, 0.00093841552734375, 0.0034332275...

[ 16690, 454, 2146, 13579, 35484, 39, 32166, 135518, 1290, 18221, 2994, 16, 129908, 31461, 247, 4, 194, 144810, 132, 25, 60075, 42, 242, 14700, 19279, 10287, 5, 14055, 15769, 153939, 40899, 15190, 378, 1328, 268, 1614, 9, 1639, 64, 31330, ...

[ 0.223388671875, 0.08984375, 0.2445068359375, 0.175048828125, 0.1141357421875, 0.06829833984375, 0.112060546875, 0.1068115234375, 0.09228515625, 0.1888427734375, 0.06689453125, 0.011077880859375, 0.011505126953125, 0.204833984375, 0.01116943359375, 0.011077880859375, 0.01092529296875,...

embed

38065630_c0

38065630

prolog

0

Title: How to call a method from Prolog file in PHP Problem title: How to call a method from Prolog file in PHP Tags: php, swi-prolog, prolog, bash Problem: How to call a method from Prolog file in PHP I'm trying to incorporate ProLog to a PHP project that I have to do for a class in the university. The thing is that I...

How to call a method from Prolog file in PHP How to call a method from Prolog file in PHP php swi-prolog prolog bash Prolog How PHP testing.pl test1:-write Hello World How to call a method from Prolog file in PHP I'm trying to incorporate ProLog to a PHP project that I have to do for a class in the university. The thin...

[ 0.01226806640625, 0.0181884765625, 0.00341796875, 0.0198974609375, 0.005340576171875, 0.01251220703125, 0.005828857421875, -0.0081787109375, -0.002197265625, -0.058837890625, 0.01177978515625, 0.01904296875, -0.0225830078125, -0.0027313232421875, -0.00128173828125, -0.0196533203125, ...

[ 11249, 11782, 55300, 1295, 1250, 4867, 11435, 23, 47302, 47, 10, 3958, 91, 2452, 3454, 502, 87109, 134234, 2424, 3034, 82825, 434, 18781, 35378, 6661, 49504, 113972, 13452, 18507, 152363, 157318, 2665, 35773, 75101, 71924, 678, 46480, 238, ...

[ 0.0833740234375, 0.221923828125, 0.261962890625, 0.1435546875, 0.20849609375, 0.273681640625, 0.19775390625, 0.047332763671875, 0.2724609375, 0.0792236328125, 0.0207672119140625, 0.1773681640625, 0.0144500732421875, 0.1400146484375, 0.1500244140625, 0.165283203125, 0.1480712890625, ...

embed

50913440_c0

50913440

prolog

0

Title: When I use the installer in swi-prolog to install the aleph, I got the ERROR: source_sink `path(git)' does not exist Problem title: When I use the installer in swi-prolog to install the aleph, I got the ERROR: source_sink `path(git)' does not exist Tags: prolog, aleph-ilp Problem: When I use the instal...

When I use the installer in swi-prolog to install the aleph, I got the ERROR: source_sink `path(git)' does not exist When I use the installer in swi-prolog to install the aleph, I got the ERROR: source_sink `path(git)' does not exist prolog aleph-ilp GIT When ERROR source_sink pack_install Contacting www.swi-...

[ 0.0159912109375, 0.0203857421875, -0.00092315673828125, 0.01470947265625, -0.0185546875, 0.008056640625, 0.01312255859375, 0.0020599365234375, -0.01611328125, -0.0228271484375, 0.024658203125, -0.0177001953125, -0.004180908203125, -0.00360107421875, 0.01556396484375, -0.000207901000976...

[ 4527, 74022, 91, 2452, 3454, 4867, 20600, 662, 11727, 151206, 24638, 31344, 7, 14068, 128405, 15769, 3768, 14602, 959, 32316, 70, 502, 379, 254, 527, 6371, 43824, 80383, 107951, 62270, 32102, 116311, 188800, 84453, 9433, 63923, 7612, 304, 1...

[ 0.009674072265625, 0.1900634765625, 0.0228424072265625, 0.195068359375, 0.143310546875, 0.2158203125, 0.1759033203125, 0.132080078125, 0.2244873046875, 0.155517578125, 0.14111328125, 0.2398681640625, 0.107421875, 0.2188720703125, 0.2149658203125, 0.2484130859375, 0.1685791015625, 0...

embed

13100364_c0

13100364

prolog

0

Title: DCG Expansion: Is Steadfastness ignored? Problem title: DCG Expansion: Is Steadfastness ignored? Tags: dcg, prolog, iso-prolog Problem: DCG Expansion: Is Steadfastness ignored? Assume I have the following DCG rule: factor(X) --> "(", expr(X), ")". Normally this would be translated to: factor(X, A, B) :- [40|C] =...

DCG Expansion: Is Steadfastness ignored? DCG Expansion: Is Steadfastness ignored? dcg prolog iso-prolog DCG Expansion Steadfastness DCG Expansion: Is Steadfastness ignored? Assume I have the following DCG rule: Normally this would be translated to: Would a Prolog system be allowed to translate it as follows, i.e. to me...

[ 0.04296875, 0.005401611328125, -0.00787353515625, 0.0240478515625, 0.01458740234375, 0.001983642578125, -0.00537109375, 0.007354736328125, -0.0025482177734375, -0.007354736328125, 0.00142669677734375, 0.006866455078125, -0.0113525390625, 0.0030059814453125, 0, 0.01519775390625, -0.00...

[ 391, 56367, 60075, 66, 8694, 712, 39473, 7432, 124962, 71, 6889, 177, 502, 4867, 13882, 3454, 66596, 79986, 3900, 143, 1250, 5426, 107003, 19309, 28960, 42564, 51, 41274, 10336, 136, 69236, 14700, 959, 2288, 3884, 8894, 58745, 571, 50960, ...

[ 0.0877685546875, 0.1884765625, 0.0670166015625, 0.13623046875, 0.1688232421875, 0.177001953125, 0.239013671875, 0.1060791015625, 0.13134765625, 0.03857421875, 0.01849365234375, 0.0838623046875, 0.086181640625, 0.2022705078125, 0.0285797119140625, 0.06707763671875, 0.00244140625, 0....

embed

2978167_c0

2978167

prolog

0

Title: Prolog lists and parameters and return values Problem title: Prolog lists and parameters and return values Tags: prolog, list, parameters Problem: Prolog lists and parameters and return values I'm new to prolog and I just can't figure this out. I'm trying to build a simple program that receives a list of predica...

Prolog lists and parameters and return values Prolog lists and parameters and return values prolog list parameters search Prolog pred1 pred2 list1 Out Prolog lists and parameters and return values I'm new to prolog and I just can't figure this out. I'm trying to build a simple program that receives a list of predicates...

[ 0.007080078125, -0.0023956298828125, -0.00201416015625, 0.0052490234375, -0.0198974609375, 0.0303955078125, 0.0096435546875, 0.01495361328125, 0.01123046875, -0.050048828125, 0.0159912109375, -0.016845703125, -0.025390625, -0.013427734375, 0.0169677734375, -0.007080078125, 0.01519775...

[ 1250, 4867, 5303, 136, 171859, 30646, 142424, 502, 33938, 1653, 418, 304, 13538, 3525, 26366, 31577, 45367, 8781, 1528, 53299, 2063, 29458, 4027, 32354, 3444, 4527, 756, 2806, 1295, 151814, 19714, 1723, 254, 6562, 37842, 76199, 29568, 116, ...

[ 0.2047119140625, 0.277587890625, 0.2421875, 0.034515380859375, 0.2406005859375, 0.242919921875, 0.220703125, 0.174560546875, 0.171142578125, 0.168701171875, 0.013946533203125, 0.0986328125, 0.2291259765625, 0.0263671875, 0.042816162109375, 0.029876708984375, 0.07525634765625, 0.061...

embed

69989726_c0

69989726

prolog

0

Title: Slicing the list in prolog between two indexes Problem title: Slicing the list in prolog between two indexes Tags: list, slice, prolog Problem: Slicing the list in prolog between two indexes I'm trying to slice a list, and create a result list that contains elements that fall between two indices, exclusive. inde...

Slicing the list in prolog between two indexes Slicing the list in prolog between two indexes list slice prolog Slicing Element Tail Index Index1 Check less_than greater_than Ind Slicing the list in prolog between two indexes I'm trying to slice a list, and create a result list that contains elements that fall between ...

[ -0.0174560546875, 0.02099609375, 0.0130615234375, 0.013916015625, -0.0242919921875, 0.01019287109375, -0.010009765625, 0.0140380859375, 0.01507568359375, -0.007080078125, 0.0069580078125, 0.003631591796875, -0.038330078125, -0.0030670166015625, 0.00921630859375, -0.01104736328125, 0....

[ 103216, 21896, 5303, 502, 4867, 17721, 6626, 63262, 23, 13348, 48325, 1218, 379, 31471, 418, 38679, 40715, 21732, 117396, 14489, 31577, 91, 28282, 16750, 80854, 6817, 136044, 97629, 11, 71, 757, 4, 201, 627, 5608, 275, 238, 11343, 35782, ...

[ 0.178955078125, 0.082275390625, 0.1884765625, 0.142578125, 0.218994140625, 0.15087890625, 0.130126953125, 0.2027587890625, 0.011444091796875, 0.207763671875, 0.1212158203125, 0.1142578125, 0.103759765625, 0.1898193359375, 0.0301513671875, 0.1219482421875, 0.1513671875, 0.0985107421...

embed

40088552_c1

40088552

prolog

1

/2 behaves as once/1 with respect to the guarded goal. This means that our predicate address/2 is no longer a nice logical non-deterministic relation. Having to give up "nice logical non-deterministic relations" in order to preserve validity seems like a bad bargain, since nice logical non-deterministic relations are t...

[ 0.01422119140625, 0.00836181640625, 0.006500244140625, 0.00323486328125, -0.0057373046875, 0.0225830078125, 0.00001537799835205078, -0.01116943359375, 0.01177978515625, -0.06396484375, 0.01507568359375, 0.02880859375, -0.01495361328125, 0.0059814453125, 0.0103759765625, 0.0172119140625...

[ 12477, 186, 68991, 7, 237, 24145, 11583, 678, 15072, 47, 56050, 297, 69236, 26950, 1653, 2063, 67, 29823, 110, 51713, 26267, 62775, 289, 351, 112, 30524, 48242, 41911, 3466, 91582, 479, 86687, 35604, 2481, 37202, 6494, 208, 24702, 92940, ...

[ 0.2626953125, 0.092041015625, 0.2012939453125, 0.0491943359375, 0.17529296875, 0.2225341796875, 0.160888671875, 0.013641357421875, 0.0885009765625, 0.002838134765625, 0.1505126953125, 0.061279296875, 0.2071533203125, 0.02484130859375, 0.133544921875, 0.16015625, 0.1334228515625, 0....

embed

13679215_c0

13679215

prolog

0

Title: Prolog -how to implement a nested function in prolog? Problem title: Prolog -how to implement a nested function in prolog? Tags: prolog Problem: Prolog -how to implement a nested function in prolog? I need to write rules below: Write the rules for a predicate take(L,N,L1), which succeeds if list L1 contains the ...

Prolog -how to implement a nested function in prolog? Prolog -how to implement a nested function in prolog? prolog Prolog X-1 Prolog -how to implement a nested function in prolog? I need to write rules below: Write the rules for a predicate take(L,N,L1), which succeeds if list L1 contains the first N elements of list L...

[ 0.002166748046875, 0.0185546875, 0.005615234375, 0.00933837890625, -0.00168609619140625, 0.01373291015625, 0.00238037109375, 0.01513671875, 0.0194091796875, -0.031982421875, 0.0203857421875, -0.014892578125, -0.0201416015625, 0.00958251953125, 0.02783203125, -0.00151824951171875, 0.0...

[ 1250, 4867, 47251, 29479, 8512, 71, 32354, 23, 502, 1193, 5759, 33022, 91736, 35064, 601, 18781, 1653, 2063, 67, 5646, 866, 839, 17727, 214493, 5303, 339, 418, 70541, 5117, 541, 80854, 5701, 12989, 41, 27781, 17368, 6528, 154109, 14012, 6...

[ 0.158203125, 0.245361328125, 0.055938720703125, 0.19921875, 0.287841796875, 0.1693115234375, 0.210693359375, 0.07940673828125, 0.172119140625, 0.062286376953125, 0.1033935546875, 0.0692138671875, 0.1595458984375, 0.03076171875, 0.004180908203125, 0.0281524658203125, 0.1258544921875, ...

embed

41210049_c1

41210049

prolog

1

to be consecutive, but i dont know how to do it. This code is what we have but it's not working: conseqNumber(_, _, 0, _, _). conseqNumber(Programation, SlotIndex, SlotsNumber, Size, SerieId):- SlotIndex #=< Size, element(SlotIndex, Programation, SerieId2), SerieId2 #= SerieId, SlotIndexAux #= SlotIndex +1, SlotsNumbe...

[ -0.01251220703125, -0.01416015625, 0.0035858154296875, 0.0245361328125, -0.0101318359375, 0.005035400390625, -0.00933837890625, 0.028076171875, 0.031494140625, -0.03515625, -0.0245361328125, 0.00970458984375, -0.01251220703125, 0.005218505859375, 0.0035858154296875, 0.00408935546875, ...

[ 47, 186, 148390, 13, 1284, 17, 13319, 3714, 3642, 54, 442, 3293, 18151, 2367, 642, 765, 959, 20697, 158, 184, 864, 18444, 26278, 454, 101, 757, 148968, 69623, 4153, 39659, 143745, 80378, 45378, 568, 71, 16093, 12830, 12631, 7663, 10461, ...

[ 0.1014404296875, 0.1156005859375, 0.29833984375, 0.1566162109375, 0.013397216796875, 0.005462646484375, 0.0633544921875, 0.0791015625, 0.07257080078125, 0.0736083984375, 0.054046630859375, 0.0560302734375, 0.2037353515625, 0.0215911865234375, 0.00885009765625, 0.059478759765625, 0.07...

embed

4416830_c0

4416830

prolog

0

Title: Prolog, optimize generation Problem title: Prolog, optimize generation Tags: prolog, optimization Problem: Prolog, optimize generation I wrote a prolog program which generates all possible positions of elements in a two-dimensional table. The number of elements and the table size are given. My code: geni(Min, Mi...

Prolog, optimize generation Prolog, optimize generation prolog optimization Prolog Min Max MinInc TSize Tail NDec N-1 Prolog, optimize generation I wrote a prolog program which generates all possible positions of elements in a two-dimensional table. The number of elements and the table size are given. My code: (where T...

[ -0.0013275146484375, 0.00180816650390625, 0.008544921875, -0.01513671875, -0.0172119140625, -0.00823974609375, 0.0021514892578125, -0.00537109375, -0.002685546875, -0.0242919921875, 0.01416015625, 0.0220947265625, -0.0172119140625, -0.01513671875, 0, -0.000766754150390625, 0.01867675...

[ 1250, 4867, 4, 15572, 20650, 58093, 502, 87235, 4211, 9920, 4153, 53800, 1218, 379, 541, 120152, 5759, 54397, 1528, 139392, 756, 7722, 19069, 80854, 6626, 157955, 23180, 14012, 13267, 34475, 18151, 83, 4568, 16750, 7145, 2063, 67, 33781, 11...

[ 0.185791015625, 0.248779296875, 0.0006103515625, 0.1630859375, 0.19287109375, 0.212890625, 0.1380615234375, 0.1810302734375, 0.1336669921875, 0.106689453125, 0.0406494140625, 0.0304107666015625, 0.07049560546875, 0.0947265625, 0.055419921875, 0.1844482421875, 0.1043701171875, 0.087...

embed

69655489_c0

69655489

prolog

0

Title: Predicate order change causes infinite loop Problem title: Predicate order change causes infinite loop Tags: prolog, failure-slice Problem: Predicate order change causes infinite loop So I've got a predicate that works for uninstantiated variables nat_cset(N,Cs) that relates a natural number with the counting se...

Predicate order change causes infinite loop Predicate order change causes infinite loop prolog failure-slice Predicate nat_cset nat_cset_ Acc N_1 Predicate order change causes infinite loop So I've got a predicate that works for uninstantiated variables nat_cset(N,Cs) that relates a natural number with the counting set...

[ 0.021728515625, -0.005767822265625, 0.0201416015625, 0.0185546875, 0.0252685546875, -0.002960205078125, 0.0225830078125, -0.0026397705078125, 0.023681640625, -0.033935546875, 0.0250244140625, 0.0208740234375, -0.0140380859375, -0.00016689300537109375, 0.0235595703125, 0.0245361328125, ...

[ 7145, 2063, 67, 12989, 15549, 113660, 54241, 13, 40956, 502, 4867, 137578, 13348, 24, 18, 4439, 126, 29899, 541, 115187, 1653, 43240, 143034, 77336, 839, 33444, 6083, 14012, 54529, 5423, 19, 133063, 156672, 41, 1294, 2203, 2289, 30957, 1296...

[ 0.1541748046875, 0.1949462890625, 0.0748291015625, 0.1878662109375, 0.16943359375, 0.1361083984375, 0.137451171875, 0.03570556640625, 0.2034912109375, 0.132080078125, 0.1854248046875, 0.1778564453125, 0.09539794921875, 0.1077880859375, 0.1011962890625, 0.06494140625, 0.1224365234375,...

embed

36951657_c0

36951657

prolog

0

Title: Greater than operator in prolog Problem title: Greater than operator in prolog Tags: operators, prolog, swi-prolog Problem: Greater than operator in prolog I am working on SWI Prolog. I have some facts in my database. I am unable to figure out how to use 'greater than' operator(>) when constructing a new rule. I...

Greater than operator in prolog Greater than operator in prolog operators prolog swi-prolog Greater Greater than operator in prolog I am working on SWI Prolog. I have some facts in my database. I am unable to figure out how to use 'greater than' operator(>) when constructing a new rule. I have some facts of the form sh...

[ 0.024169921875, 0.00439453125, 0.0233154296875, -0.004364013671875, -0.01104736328125, -0.009521484375, 0.01263427734375, 0.01953125, 0.00616455078125, -0.028076171875, 0.00127410888671875, 0.010009765625, -0.019287109375, -0.0247802734375, -0.0032958984375, 0.006072998046875, -0.009...

[ 32774, 56, 3501, 39933, 23, 502, 4867, 2452, 3454, 20697, 159, 38969, 1250, 15824, 759, 63399, 2886, 26366, 3642, 4527, 7134, 46429, 2740, 3229, 64549, 3525, 79986, 3173, 35254, 19, 83, 9836, 1556, 55054, 177, 763, 10617, 25841, 130625, 2...

[ 0.18359375, 0.1502685546875, 0.2734375, 0.33154296875, 0.043121337890625, 0.148681640625, 0.238525390625, 0.13818359375, 0.0999755859375, 0.0970458984375, 0.03741455078125, 0.1744384765625, 0.1192626953125, 0.1298828125, 0.00732421875, 0.1673583984375, 0.027801513671875, 0.04031372...

embed

67488026_c0

67488026

prolog

0

Title: Graph Coloring with CLP(FD) Problem title: Graph Coloring with CLP(FD) Tags: clpfd, clp, prolog, swi-prolog Problem: Graph Coloring with CLP(FD) I am trying to solve the map/graph coloring problem using CLP(FD) in Prolog. I took the predicates from the paper "A comparison of CLP(FD) and ASP solutions to NP-compl...

Graph Coloring with CLP(FD) Graph Coloring with CLP(FD) clpfd clp prolog swi-prolog Graph Coloring CLP Output Nodes Edges create_output Colors N-C A-CA B-CB Graph Coloring with CLP(FD) I am trying to solve the map/graph coloring problem using CLP(FD) in Prolog. I took the predicates from the paper "A comparison of CLP(...

[ -0.00811767578125, 0.0086669921875, -0.006622314453125, -0.005340576171875, -0.00982666015625, -0.00750732421875, -0.0096435546875, -0.00408935546875, -0.006378173828125, -0.006927490234375, -0.005615234375, -0.0135498046875, 0.005615234375, 0.0233154296875, 0.009033203125, 0.01171875,...

[ 6524, 11727, 51193, 214, 678, 313, 37352, 98553, 132, 33139, 39557, 71, 254, 502, 4867, 2452, 3454, 13538, 438, 988, 69030, 28282, 6056, 62, 9, 13133, 335, 47307, 31577, 86869, 22288, 41382, 10576, 2967, 17368, 1250, 1653, 2063, 225490, 1...

[ 0.1766357421875, 0.1522216796875, 0.19677734375, 0.098388671875, 0.08203125, 0.06121826171875, 0.249267578125, 0.2122802734375, 0.022552490234375, 0.034149169921875, 0.052459716796875, 0.06890869140625, 0.0955810546875, 0.06903076171875, 0.2320556640625, 0.101806640625, 0.078125, 0...

embed

24714526_c0

24714526

prolog

0

Title: Finding up to N unique solutions of a goal in Prolog Problem title: Finding up to N unique solutions of a goal in Prolog Tags: prolog Problem: Finding up to N unique solutions of a goal in Prolog Could you tell me how to find up to N unique solutions of a goal in Prolog? I know using findall/3 all the solutions ...

Finding up to N unique solutions of a goal in Prolog Finding up to N unique solutions of a goal in Prolog prolog Finding Prolog find_unique_n any_goal sample_goal Finding up to N unique solutions of a goal in Prolog Could you tell me how to find up to N unique solutions of a goal in Prolog? I know using findall/3 all t...

[ -0.0081787109375, 0.01483154296875, 0.027587890625, -0.02001953125, -0.009765625, 0.00341796875, -0.009521484375, -0.0113525390625, 0.020751953125, -0.03466796875, -0.01031494140625, -0.01385498046875, 0.0196533203125, -0.0027618408203125, 0.0128173828125, 0.017578125, -0.00476074218...

[ 26040, 214, 1257, 47, 541, 36998, 51347, 69236, 23, 1250, 4867, 502, 7413, 34, 45602, 19, 2499, 519, 289, 121413, 14192, 3642, 111, 5584, 18113, 756, 831, 14037, 5792, 5941, 54241, 3444, 4734, 20174, 1884, 3622, 14012, 100, 35064, 2856, ...

[ 0.10791015625, 0.02349853515625, 0.10345458984375, 0.0850830078125, 0.197509765625, 0.28271484375, 0.260498046875, 0.2259521484375, 0.0819091796875, 0.1712646484375, 0.255615234375, 0.1021728515625, 0.151611328125, 0.130126953125, 0.2359619140625, 0.08367919921875, 0.096923828125, ...

embed

33881497_c0

33881497

prolog

0

Title: Writing a Prolog format predicate Problem title: Writing a Prolog format predicate Tags: prolog Problem: Writing a Prolog format predicate I have the database of rules and facts and I want to create the predicate show(N) witch shows the rule number N , with format/2 predicate. Thank you. % La base de connaissanc...

Writing a Prolog format predicate Writing a Prolog format predicate prolog Writing Prolog cirres_ventraux deux_antennes pas_de_paragnathes cirres_lateraux trois_antennes pieds_birames segment_bucal_apode pas_de_machoire segment_bucal_avec_pieds cirres_tentaculaires branchies_spiralees proboscis_complexe parapodes_poste...

[ -0.017333984375, -0.00144195556640625, 0.005035400390625, 0.02197265625, 0.000789642333984375, 0.0091552734375, -0.000377655029296875, 0.0091552734375, 0.01055908203125, 0.005218505859375, -0.005615234375, -0.0203857421875, -0.038818359375, -0.01123046875, 0.01806640625, -0.00053405761...

[ 213185, 10, 1250, 4867, 9384, 1653, 2063, 67, 502, 76542, 2109, 16274, 42, 10442, 7821, 65646, 1444, 452, 112, 6276, 7456, 2347, 94068, 29866, 139546, 114024, 3716, 33180, 978, 6827, 25395, 50724, 88149, 138518, 111152, 8972, 32845, 54547, ...

[ 0.1915283203125, 0.060272216796875, 0.1898193359375, 0.266845703125, 0.23291015625, 0.1688232421875, 0.2489013671875, 0.0867919921875, 0.168212890625, 0.08868408203125, 0.1541748046875, 0.053802490234375, 0.0513916015625, 0.045257568359375, 0.091064453125, 0.138671875, 0.052307128906...

embed

49555002_c0

49555002

prolog

0

Title: Decompose list into lists of successive subsequences Problem title: Decompose list into lists of successive subsequences Tags: prolog, list Problem: Decompose list into lists of successive subsequences I am really sorry for previous question, it's my first time post question on this website and I really didn't k...

Decompose list into lists of successive subsequences Decompose list into lists of successive subsequences prolog list Decompose List chop_up NewList First Tail Second NewList2 Tail2 Decompose list into lists of successive subsequences I am really sorry for previous question, it's my first time post question on this web...

[ -0.0022125244140625, 0.015625, 0.000476837158203125, 0.0230712890625, -0.01080322265625, 0.026611328125, -0.025390625, 0.00518798828125, 0.01904296875, 0.00750732421875, -0.01348876953125, 0.019287109375, 0.004974365234375, 0.0228271484375, 0.01470947265625, 0.0101318359375, 0.025512...

[ 262, 277, 78381, 5303, 3934, 7, 111, 208479, 1614, 184, 26513, 502, 4867, 32036, 82335, 2037, 2356, 154663, 23972, 1218, 379, 77648, 304, 59090, 1733, 1305, 9655, 41, 6889, 17368, 66933, 190, 21974, 53418, 89554, 86869, 47143, 11249, 47, ...

[ 0.1817626953125, 0.1834716796875, 0.1817626953125, 0.212158203125, 0.1627197265625, 0.045135498046875, 0.03729248046875, 0.2401123046875, 0.2310791015625, 0.1385498046875, 0.1744384765625, 0.1348876953125, 0.18994140625, 0.1722412109375, 0.1429443359375, 0.09320068359375, 0.087280273...

embed

53974437_c0

53974437

prolog

0

Title: Prolog Backtracking findall for two variables Problem title: Prolog Backtracking findall for two variables Tags: prolog Problem: Prolog Backtracking findall for two variables I want to write a function residents(Housenumber,N) which (1) gives me the amount of residents per house given the housenumber AND (2) whe...

Prolog Backtracking findall for two variables Prolog Backtracking findall for two variables prolog Prolog Backtracking Tim Cook Elisabeth Thomas George Steve Jobs Lisa Karen Mark Zuckerberg Priscilla Prolog Backtracking findall for two variables I want to write a function residents(Housenumber,N) which (1) gives me the...

[ 0.0133056640625, 0.0084228515625, 0.00482177734375, 0.01031494140625, 0.009765625, 0.018310546875, 0.007659912109375, 0.000701904296875, 0.0247802734375, -0.0654296875, 0.0032806396484375, -0.007171630859375, 0.009765625, -0.006744384765625, 0.002532958984375, 0.007110595703125, -0.0...

[ 1250, 4867, 26828, 125728, 214, 7413, 5584, 100, 6626, 77336, 502, 13320, 79479, 110115, 14978, 14787, 41550, 73401, 32768, 86040, 7880, 168596, 20204, 121226, 3444, 33022, 32354, 160641, 184964, 2606, 1297, 839, 76199, 163, 41170, 18276, 48762...

[ 0.148193359375, 0.2359619140625, 0.19189453125, 0.260498046875, 0.05255126953125, 0.1505126953125, 0.21484375, 0.048095703125, 0.1541748046875, 0.2186279296875, 0.1148681640625, 0.130615234375, 0.211181640625, 0.155517578125, 0.1300048828125, 0.088623046875, 0.09765625, 0.174194335...

embed

26733040_c0

26733040

prolog

0

Title: Implement counter prolog Problem title: Implement counter prolog Tags: prolog Problem: Implement counter prolog I'm developing a board game in PROLOG and in order to make the interface more enjoyable for the user, I decided to add a grid with the coordinates (0->4) as shown below: 0 1 2 3 4 --------- 0 | x x x x...

Implement counter prolog Implement counter prolog prolog Implement Index Only Head Tail STOPS HERE Implement counter prolog I'm developing a board game in PROLOG and in order to make the interface more enjoyable for the user, I decided to add a grid with the coordinates (0->4) as shown below: After developing some code...

[ -0.004791259765625, 0.0008697509765625, 0.00970458984375, 0.002960205078125, -0.0146484375, -0.00176239013671875, -0.0006256103515625, 0.0107421875, 0.01068115234375, -0.0269775390625, -0.004058837890625, -0.016357421875, 0.005157470703125, 0.01904296875, 0.01239013671875, 0.0015792846...

[ 153941, 105416, 502, 4867, 31471, 87293, 44816, 1218, 379, 16992, 188165, 65791, 168698, 45443, 6712, 23, 10514, 47510, 101758, 25225, 38937, 15190, 120067, 176866, 90, 22085, 103607, 29557, 18151, 36880, 31089, 79259, 1653, 2063, 67, 7279, 7, ...

[ 0.282958984375, 0.265625, 0.1552734375, 0.232666015625, 0.265380859375, 0.110107421875, 0.1787109375, 0.1387939453125, 0.1138916015625, 0.158935546875, 0.074462890625, 0.125732421875, 0.0987548828125, 0.1513671875, 0.10723876953125, 0.0123291015625, 0.158447265625, 0.2366943359375,...

embed

21894832_c0

21894832

prolog

0

Title: Prolog oldest Successor Problem title: Prolog oldest Successor Tags: prolog Problem: Prolog oldest Successor I'm working on a simple program that has a database of people. When given a year it should state the "King" of that year, where the king is the eldest living man. For simplicity, all people in the databas...

Prolog oldest Successor Prolog oldest Successor prolog Prolog Successor Year Prolog oldest Successor I'm working on a simple program that has a database of people. When given a year it should state the "King" of that year, where the king is the eldest living man. For simplicity, all people in the database are eligible ...

[ 0.0091552734375, 0.0235595703125, 0.014892578125, 0.021484375, -0.020263671875, 0.0198974609375, -0.019775390625, 0.006561279296875, -0.0024566650390625, -0.029296875, -0.009765625, 0.00970458984375, -0.0213623046875, -0.021240234375, 0.0185546875, -0.02001953125, -0.003082275390625,...

[ 1250, 4867, 10332, 525, 144053, 748, 502, 42552, 20697, 98, 8781, 1528, 63399, 3395, 34475, 6602, 5608, 11341, 605, 214, 60097, 83, 70, 88, 18557, 38043, 332, 134381, 756, 224943, 4989, 923, 138241, 2967, 39580, 18345, 3445, 20271, 26366, ...

[ 0.184814453125, 0.25634765625, 0.2098388671875, 0.199462890625, 0.2261962890625, 0.1407470703125, 0.1190185546875, 0.156982421875, 0.0753173828125, 0.00860595703125, 0.060302734375, 0.1265869140625, 0.1558837890625, 0.076171875, 0.03314208984375, 0.1494140625, 0.0243072509765625, 0...

embed

23985966_c0

23985966

prolog

0

Title: Problems with SWI PROLOG for C# Problem title: Problems with SWI PROLOG for C# Tags: c%23, prolog, swi-prolog Problem: Problems with SWI PROLOG for C# I want to use SWI PROLOG wrapper for C#. My friend created some code in prolog on normal SWI PROLOG. I want to execute this in c# using SwiPLCs.dll. I want to mak...

Problems with SWI PROLOG for C# Problems with SWI PROLOG for C# c%23 prolog swi-prolog Problems SWI PROLOG PlQuery.PlCall Uninstantiated Syntax Operator Problems with SWI PROLOG for C# I want to use SWI PROLOG wrapper for C#. My friend created some code in prolog on normal SWI PROLOG. I want to execute this in c# using...

[ 0.0081787109375, 0.0279541015625, -0.00286865234375, 0.019287109375, -0.0224609375, -0.01336669921875, 0.0091552734375, 0.003936767578125, -0.005767822265625, -0.046630859375, -0.01361083984375, 0.010986328125, -0.01373291015625, 0.0050048828125, 0.02197265625, 0.0087890625, 0.015014...

[ 15649, 678, 159, 38969, 10514, 47510, 100, 313, 4904, 3742, 502, 4867, 91, 2452, 3454, 29016, 41732, 1294, 141, 441, 5584, 143034, 14, 19010, 86531, 150922, 3444, 4527, 137565, 1264, 34391, 75935, 18151, 3638, 71924, 23, 501, 17368, 105432,...

[ 0.1678466796875, 0.052032470703125, 0.0994873046875, 0.26904296875, 0.1844482421875, 0.2371826171875, 0.0701904296875, 0.04193115234375, 0.193603515625, 0.1136474609375, 0.1517333984375, 0.197265625, 0.03363037109375, 0.23974609375, 0.1243896484375, 0.1324462890625, 0.1490478515625, ...

embed

32556017_c0

32556017

prolog

0

Title: Prolog example with rules and query Problem title: Prolog example with rules and query Tags: prolog Problem: Prolog example with rules and query I'm a beginner in Prolog and really need to solve this problem in Prolog's simplest syntax possible. I have similar to 2 tables with different product information in Pr...

Prolog example with rules and query Prolog example with rules and query prolog Prolog aa11zx bb22yz cc11zx dd22kx aa22vx aa11 aa22 dd22 bb22 cc11 product2 Prolog example with rules and query I'm a beginner in Prolog and really need to solve this problem in Prolog's simplest syntax possible. I have similar to 2 tables w...

[ 0.01300048828125, 0.00799560546875, -0.00909423828125, 0.0230712890625, -0.000885009765625, 0.01019287109375, -0.0289306640625, 0.0068359375, 0.005645751953125, -0.029052734375, -0.00099945068359375, 0.0198974609375, -0.0181884765625, -0.020263671875, -0.002197265625, 0.000282287597656...

[ 1250, 4867, 27781, 678, 91736, 136, 41, 1294, 502, 32189, 1662, 12996, 304, 9842, 1679, 86869, 2967, 30362, 6002, 86531, 21373, 116, 23180, 12921, 4677, 1884, 51359, 63399, 384, 183057, 15573, 271, 10750, 39210, 44402, 3871, 79986, 28219, 2...

[ 0.1854248046875, 0.274169921875, 0.211669921875, 0.0909423828125, 0.1925048828125, 0.0892333984375, 0.12255859375, 0.08575439453125, 0.0931396484375, 0.008880615234375, 0.040924072265625, 0.18701171875, 0.1644287109375, 0.004608154296875, 0.02154541015625, 0.0804443359375, 0.06427001...

embed

53134770_c0

53134770

prolog

0

Title: Prolog text game printing descriptions duplicate output Problem title: Prolog text game printing descriptions duplicate output Tags: prolog Problem: Prolog text game printing descriptions duplicate output I'm working on a text based adventure game in prolog. I'm trying to define something that prints out all the...

Prolog text game printing descriptions duplicate output Prolog text game printing descriptions duplicate output prolog Prolog adjacent_rooms Location is_connected AdjacentLocation AdjacentName short_desc AdjacentDescription Your Bedroom Closet Hallway Long Prolog text game printing descriptions duplicate output I'm wor...

[ -0.013671875, 0.008544921875, 0.004119873046875, -0.01611328125, 0.00360107421875, 0.023681640625, -0.0081787109375, 0.005889892578125, -0.00933837890625, -0.026123046875, -0.01251220703125, -0.01171875, 0.00714111328125, -0.01055908203125, 0.0191650390625, 0.00823974609375, 0.010986...

[ 1250, 4867, 7986, 6712, 2448, 76811, 171763, 67, 140992, 1916, 502, 123594, 16797, 28905, 90788, 83, 135457, 145, 15363, 3145, 163612, 16610, 988, 4657, 59478, 14804, 873, 75846, 153335, 18, 19449, 7514, 14407, 20697, 35509, 156578, 61924, 28...

[ 0.147705078125, 0.2275390625, 0.1298828125, 0.1102294921875, 0.1326904296875, 0.221435546875, 0.216552734375, 0.132568359375, 0.191650390625, 0.03521728515625, 0.1070556640625, 0.169921875, 0.1947021484375, 0.20703125, 0.1728515625, 0.0170135498046875, 0.1380615234375, 0.1154785156...

embed

3530180_c0

3530180

prolog

0

Title: Prolog findall existential quantifier Problem title: Prolog findall existential quantifier Tags: prolog, prolog-findall Problem: Prolog findall existential quantifier I have a problem with a problem in Prolog. Here's some of the code I use. has_same_elements([X|_],Y) :- permutation(X,Xnew), member(Xnew,Y), !. ha...

Prolog findall existential quantifier Prolog findall existential quantifier prolog prolog-findall Prolog has_same_elements Xnew Tail verdeling2 Perm Verd Prolog findall existential quantifier I have a problem with a problem in Prolog. Here's some of the code I use. This gets two lists of lists as input, and decides whe...

[ -0.002593994140625, 0.0016632080078125, 0.0098876953125, -0.00799560546875, -0.0177001953125, -0.002777099609375, -0.00640869140625, 0.00958251953125, 0.02001953125, -0.03564453125, 0.0283203125, 0.0289306640625, 0.0283203125, -0.03173828125, -0.0235595703125, 0.01300048828125, -0.00...

[ 1250, 4867, 7413, 5584, 99707, 15403, 55230, 85789, 502, 111607, 1556, 40175, 62766, 1193, 54936, 1218, 379, 493, 45530, 304, 908, 39, 1446, 71, 765, 2967, 18151, 4527, 6626, 5303, 107730, 28288, 36766, 70541, 678, 5701, 80854, 133063, 8244...

[ 0.1602783203125, 0.2471923828125, 0.1513671875, 0.2230224609375, 0.1287841796875, 0.04522705078125, 0.1119384765625, 0.152099609375, 0.090087890625, 0.1153564453125, 0.0574951171875, 0.1422119140625, 0.1636962890625, 0.0321044921875, 0.1571044921875, 0.0755615234375, 0.0860595703125,...

embed

61399897_c0

61399897

prolog

0

Title: Display results in Prolog Problem title: Display results in Prolog Tags: prolog, forward Problem: Display results in Prolog if twol then twolegs. if twoh then twohands if tenf then tenfingers. if twof then twofeets. if smallh then smallhair. if fourlegs and nohands and nofingers and fourfeets and doghair then do...

Display results in Prolog Display results in Prolog prolog forward Display Prolog new_derived_fact derived_fact Cond Display results in Prolog I have this code in prolog using forward chaining. How to display the result "person" like "address, id, house" from datababase?? I have this code in prolog using forward chaini...

[ 0.04638671875, 0.017822265625, -0.0062255859375, 0.033935546875, 0.006378173828125, 0.006622314453125, 0.0162353515625, 0.004241943359375, -0.00872802734375, -0.0235595703125, -0.003814697265625, -0.0029754638671875, -0.0240478515625, -0.00011014938354492188, -0.006744384765625, -0.009...

[ 90045, 50339, 23, 1250, 4867, 502, 40225, 3525, 820, 14, 4126, 114700, 16406, 1657, 71, 18151, 17368, 1608, 14653, 11249, 44116, 16750, 30816, 712, 107421, 3447, 18276, 1295, 2053, 21369, 184, 1884 ]

[ 0.1798095703125, 0.2216796875, 0.056365966796875, 0.17626953125, 0.251220703125, 0.131591796875, 0.19287109375, 0.095947265625, 0.11083984375, 0.032989501953125, 0.0301971435546875, 0.1859130859375, 0.107421875, 0.1121826171875, 0.0653076171875, 0.136474609375, 0.001068115234375, 0...

embed

23767189_c0

23767189

prolog

0

Title: PROLOG Comparing 2 lists Problem title: PROLOG Comparing 2 lists Tags: prolog Problem: PROLOG Comparing 2 lists I've been trying for a long time and searched a lot (...) but nothing. What I want is to create a function that will compare elements of one list to the elements of other list. The things is I have abs...

PROLOG Comparing 2 lists PROLOG Comparing 2 lists prolog PROLOG Comparing PROLOG Comparing 2 lists I've been trying for a long time and searched a lot (...) but nothing. What I want is to create a function that will compare elements of one list to the elements of other list. The things is I have absolutely no idea how ...

[ 0.003265380859375, -0.004364013671875, -0.00494384765625, 0.006439208984375, -0.01373291015625, 0.01507568359375, 0.00494384765625, -0.005279541015625, 0.019287109375, -0.015869140625, 0.024658203125, 0.020263671875, 0.005126953125, 0.002899169921875, -0.007598876953125, 0.001251220703...

[ 10514, 47510, 113307, 214, 116, 5303, 502, 4867, 7, 31577, 4989, 5915, 3444, 28282, 32354, 1221, 69101, 80854, 1632, 3789, 110, 6528, 8560, 8305, 43032, 15044, 37397, 5117, 32786, 339, 418, 5442, 23356, 35431, 285, 17357, 39580, 17932, 756,...

[ 0.1861572265625, 0.2138671875, 0.2059326171875, 0.001068115234375, 0.1727294921875, 0.215576171875, 0.14697265625, 0.20703125, 0.009735107421875, 0.02471923828125, 0.021087646484375, 0.006134033203125, 0.044158935546875, 0.058807373046875, 0.13330078125, 0.0173187255859375, 0.2152099...

embed

29620463_c0

29620463

prolog

0

Title: prolog zodiac sign program error Problem title: prolog zodiac sign program error Tags: prolog Problem: prolog zodiac sign program error hi i have the following code in prolog and getting the error. domains date = d(day,mon,year) dm = da(day,mon) day , mon ,year = integer sign = symbol predicates zodiac_month(sig...

prolog zodiac sign program error prolog zodiac sign program error prolog zodiac_month find_sign Date Day Mon Year Sign Day2 Mon2 Zodiac Day1 Mon1 Incorrect ERROR zodiac.pl:2:3 Syntax Operator zodiac.pl:28:11 Warning zodiac.pl:31 Singleton zodiac.pl:37 prolog zodiac sign program error hi i have the following code in pro...

[ -0.01019287109375, -0.005828857421875, -0.00921630859375, 0.015625, -0.01190185546875, 0.00836181640625, -0.01446533203125, 0.027099609375, -0.0130615234375, -0.0032806396484375, 0.00080108642578125, -0.0146484375, 0.0177001953125, -0.0133056640625, 0.0130615234375, 0.0201416015625, ...

[ 502, 4867, 1602, 3390, 238, 24092, 1528, 18499, 15477, 7413, 31304, 25512, 10013, 7465, 42552, 48838, 304, 5880, 418, 32399, 151206, 2424, 363, 19010, 86531, 150922, 5550, 27321, 43609, 1507, 30225, 25632, 18151, 77758, 5622, 104, 5636, 3796,...

[ 0.1741943359375, 0.2161865234375, 0.1068115234375, 0.1455078125, 0.05035400390625, 0.20068359375, 0.2091064453125, 0.1839599609375, 0.0921630859375, 0.09503173828125, 0.180908203125, 0.1129150390625, 0.115966796875, 0.1370849609375, 0.1624755859375, 0.174072265625, 0.05517578125, 0...

embed

65676576_c0

65676576

prolog

0

Title: My Prolog program makes a list, but I can't figure out how to make it stop after 2 entries Problem title: My Prolog program makes a list, but I can't figure out how to make it stop after 2 entries Tags: prolog Problem: My Prolog program makes a list, but I can't figure out how to make it stop after 2 e...

My Prolog program makes a list, but I can't figure out how to make it stop after 2 entries My Prolog program makes a list, but I can't figure out how to make it stop after 2 entries prolog Prolog Facts Searches My Prolog program makes a list, but I can't figure out how to make it stop after 2 entries For some...

[ 0.0228271484375, 0.01123046875, 0.0194091796875, 0.031982421875, 0.008056640625, 0.0220947265625, -0.00823974609375, 0.0079345703125, 0.0205078125, -0.06298828125, -0.0023956298828125, -0.0216064453125, -0.021728515625, 0.0118408203125, 0.0135498046875, 0.0108642578125, 0.02355957031...

[ 2646, 1250, 4867, 1528, 30482, 10, 5303, 1284, 831, 3768, 18, 26366, 1810, 3642, 3249, 442, 7279, 7103, 116, 112820, 502, 132640, 33086, 31577, 28282, 40226, 291, 731, 45831, 11907, 7722, 36439, 17721, 42805, 136, 82230, 18151, 1632, 49903,...

[ 0.046173095703125, 0.1763916015625, 0.2467041015625, 0.1859130859375, 0.06854248046875, 0.0858154296875, 0.2288818359375, 0.031982421875, 0.046844482421875, 0.0310516357421875, 0.07464599609375, 0.1214599609375, 0.05615234375, 0.059967041015625, 0.088134765625, 0.102294921875, 0.2434...

embed

29066251_c0

29066251

prolog

0

Title: How to gather into rules Problem title: How to gather into rules Tags: prolog, rule Problem: How to gather into rules What I would like to do is to return all the variables that I could obtain for an app. An app has extendable variables, I can extend them with some other variables, and non extendable variables. ...

How to gather into rules How to gather into rules prolog rule How getvariables_for_app web1 Not Extendable postal_code Extensions Variables How to gather into rules What I would like to do is to return all the variables that I could obtain for an app. An app has extendable variables, I can extend them with some other v...

[ 0.01611328125, 0.0185546875, 0.01324462890625, 0.016845703125, 0.00567626953125, 0.00543212890625, -0.0186767578125, -0.003143310546875, 0.0146484375, -0.03564453125, 0.01361083984375, -0.0091552734375, 0.0030975341796875, 0.0035247802734375, -0.0034027099609375, 0.005828857421875, 0...

[ 11249, 47, 914, 9319, 3934, 91736, 502, 4867, 79986, 2046, 21690, 19736, 2472, 9007, 1467, 418, 11205, 5443, 510, 71, 2886, 67808, 40899, 224545, 111477, 13566, 1884, 30646, 756, 70, 77336, 7, 450, 5809, 113054, 100, 4027, 65042, 351, 692...

[ 0.0765380859375, 0.009429931640625, 0.1502685546875, 0.2457275390625, 0.2218017578125, 0.2296142578125, 0.1136474609375, 0.19580078125, 0.17529296875, 0.10162353515625, 0.1812744140625, 0.1778564453125, 0.06170654296875, 0.1483154296875, 0.07611083984375, 0.0282440185546875, 0.058044...

embed

21051367_c0

21051367

prolog

0

Title: How do I delete all but duplicates from a list in prolog Problem title: How do I delete all but duplicates from a list in prolog Tags: duplicates, list, prolog Problem: How do I delete all but duplicates from a list in prolog I have a list, let's say X=[a,b,c,d,c,e,d] , how can I delete one of each character so ...

How do I delete all but duplicates from a list in prolog How do I delete all but duplicates from a list in prolog duplicates list prolog a How How do I delete all but duplicates from a list in prolog I have a list, let's say X=[a,b,c,d,c,e,d] , how can I delete one of each character so the only answer remains X1=[c,d] ...

[ -0.00897216796875, 0.0186767578125, 0.021484375, -0.00136566162109375, -0.01007080078125, 0.0027618408203125, 0.012451171875, 0.008056640625, 0.005340576171875, -0.006256103515625, -0.006072998046875, 0.0067138671875, -0.00408935546875, 0.005279541015625, -0.01165771484375, 0.022216796...

[ 11249, 154109, 756, 1284, 171763, 1636, 1295, 5303, 502, 4867, 23, 765, 1193, 11, 71, 3642, 831, 1632, 111, 12638, 62816, 4734, 35166, 47143, 418, 147306, 229231, 120820, 75101, 11907, 11001, 31330, 24145, 2174, 70541, 6044, 33720, 351, 368...

[ 0.043182373046875, 0.2269287109375, 0.10089111328125, 0.162109375, 0.25244140625, 0.129638671875, 0.10406494140625, 0.197265625, 0.172607421875, 0.2169189453125, 0.04498291015625, 0.011810302734375, 0.1082763671875, 0.0252838134765625, 0.075927734375, 0.00067138671875, 0.006744384765...

embed

49710365_c0

49710365

prolog

0

Title: How to print maze in prolog Problem title: How to print maze in prolog Tags: prolog Problem: How to print maze in prolog I'm writing a program in prolog that can solve mazes, I need a function that prints out the resulting maze with the solution path. A printed maze would look something like below where 'X' is a...

How to print maze in prolog How to print maze in prolog prolog How Maze Row Column How to print maze in prolog I'm writing a program in prolog that can solve mazes, I need a function that prints out the resulting maze with the solution path. A printed maze would look something like below where 'X' is a barrier and '*' ...

[ 0.006805419921875, -0.0019683837890625, 0.0031890869140625, -0.00182342529296875, 0.00567626953125, 0.0086669921875, -0.01397705078125, -0.0014190673828125, 0.01055908203125, -0.0089111328125, 0.0191650390625, -0.002197265625, -0.0162353515625, -0.01513671875, 0.01446533203125, 0.00442...

[ 11249, 47, 28412, 291, 731, 23, 502, 4867, 29678, 13, 96190, 233987, 32562, 1528, 86869, 17022, 90, 32354, 1810, 678, 29806, 60875, 297, 6713, 1884, 35064, 1542, 125861, 1639, 33636, 91582, 98423, 41911, 36917, 45831, 13267, 176866, 6275, 5...

[ 0.08349609375, 0.02398681640625, 0.2451171875, 0.17724609375, 0.255615234375, 0.06427001953125, 0.1668701171875, 0.224609375, 0.19970703125, 0.1846923828125, 0.2279052734375, 0.1983642578125, 0.0164337158203125, 0.051544189453125, 0.0853271484375, 0.1605224609375, 0.0992431640625, ...

embed

58693870_c0

58693870

prolog

0

Title: Finding the weighted sum of a tree Problem title: Finding the weighted sum of a tree Tags: prolog Problem: Finding the weighted sum of a tree I'm working on a small prolog program to work a bit with binary trees and am trying to find the weighted sum of the tree. Each of the nodes has a value and this is then to...

Finding the weighted sum of a tree Finding the weighted sum of a tree prolog Finding tree_wsum Tree Sum Depth Root Left Right Finding the weighted sum of a tree I'm working on a small prolog program to work a bit with binary trees and am trying to find the weighted sum of the tree. Each of the nodes has a value and thi...

[ 0.01373291015625, 0.0322265625, -0.014404296875, -0.00518798828125, -0.00927734375, 0.005523681640625, -0.031005859375, -0.00225830078125, -0.00141143798828125, -0.03955078125, 0.0179443359375, 0.000244140625, -0.0026397705078125, 0.0125732421875, 0.02783203125, 0.01080322265625, 0.0...

[ 26040, 57888, 297, 10554, 53201, 502, 4867, 434, 11832, 101344, 36335, 262, 254, 150948, 636, 2480, 90911, 20697, 1528, 2394, 1360, 7413, 98423, 110, 988, 34292, 118126, 168867, 112, 4527, 183278, 1290, 18499, 10750, 959, 129980, 34648, 20812...

[ 0.11376953125, 0.249267578125, 0.143310546875, 0.236083984375, 0.2308349609375, 0.1243896484375, 0.159423828125, 0.125244140625, 0.246337890625, 0.2030029296875, 0.208251953125, 0.1004638671875, 0.1661376953125, 0.191162109375, 0.00848388671875, 0.0672607421875, 0.1094970703125, 0....

embed

41359840_c0

41359840

prolog

0

Title: Getting members from a list in PROLOG Problem title: Getting members from a list in PROLOG Tags: prolog, list Problem: Getting members from a list in PROLOG I have to make a rule to return the line's for the station entered But in order to get all of the line's, I'd have to make a rule like: line(Line,ListofStat...

Getting members from a list in PROLOG Getting members from a list in PROLOG prolog list a Getting PROLOG Line ListofStations oxford_circus nottingHill_gate lancaster_gate tottenham_court_road chancery_lane liverpool_street bethnal_green Getting members from a list in PROLOG I have to make a rule to return the line's fo...

[ -0.0038299560546875, -0.0240478515625, 0.026611328125, 0.01092529296875, -0.01495361328125, -0.007110595703125, 0.022705078125, 0.01611328125, 0.0107421875, -0.040771484375, -0.005950927734375, 0.020751953125, -0.0086669921875, -0.002960205078125, -0.00555419921875, 0.01300048828125, ...

[ 210732, 43032, 1295, 5303, 10514, 47510, 23, 502, 4867, 16777, 1261, 36834, 42378, 5256, 36, 425, 13534, 82063, 223, 959, 1916, 841, 5713, 42118, 16336, 1515, 510, 3915, 118383, 52562, 18227, 1294, 32417, 134148, 20740, 5967, 56520, 6236, 9...

[ 0.0926513671875, 0.245361328125, 0.103515625, 0.1910400390625, 0.148193359375, 0.2373046875, 0.006103515625, 0.1044921875, 0.201171875, 0.1597900390625, 0.094970703125, 0.07763671875, 0.1282958984375, 0.0242462158203125, 0.037261962890625, 0.0653076171875, 0.1446533203125, 0.110595...

embed

16046192_c0

16046192

prolog

0

Title: Prolog find minimum in list error Problem title: Prolog find minimum in list error Tags: shortest-path, prolog, gnu-prolog Problem: Prolog find minimum in list error Im trying to make my code work, but somehow I got stuck on a problem, Im very newbie to prolog. This is my code. dist(valmiera, riga, 107). %dist(r...

Prolog find minimum in list error Prolog find minimum in list error shortest-path prolog gnu-prolog Prolog YList Prolog find minimum in list error Im trying to make my code work, but somehow I got stuck on a problem, Im very newbie to prolog. This is my code. but when I call findMin() I get this error uncaught exceptio...

[ 0.01214599609375, -0.007049560546875, 0.02783203125, 0.00689697265625, -0.00146484375, -0.006072998046875, -0.005828857421875, -0.0103759765625, 0.0128173828125, -0.037841796875, 0.00982666015625, -0.0159912109375, -0.0076904296875, -0.0283203125, 0.00927734375, 0.01239013671875, 0.0...

[ 1250, 4867, 7413, 15440, 23, 5303, 18499, 16610, 525, 128405, 502, 104155, 3454, 990, 154663, 3370, 31577, 18151, 4488, 179933, 2967, 4552, 9014, 11782, 59076, 132, 51, 408, 46526, 131527, 50986, 188800, 159258, 2661, 25, 12477, 16093, 2773, ...

[ 0.159423828125, 0.2210693359375, 0.170654296875, 0.29150390625, 0.089599609375, 0.164306640625, 0.2020263671875, 0.1959228515625, 0.1593017578125, 0.1708984375, 0.1358642578125, 0.13232421875, 0.11962890625, 0.083251953125, 0.1614990234375, 0.044891357421875, 0.023468017578125, 0.0...

embed

43874644_c0

43874644

prolog

0

Title: Prolog delete an element into a given list Problem title: Prolog delete an element into a given list Tags: prolog Problem: Prolog delete an element into a given list Hello I wish some advice or words about this task: Define a statement with three parameters where the first one is a list, the second one is an ele...

Prolog delete an element into a given list Prolog delete an element into a given list prolog Prolog Examples Result Prolog delete an element into a given list Hello I wish some advice or words about this task: Define a statement with three parameters where the first one is a list, the second one is an element (atom or ...

[ -0.0030364990234375, 0.01171875, 0.004791259765625, 0.0201416015625, -0.0135498046875, -0.00445556640625, -0.006622314453125, 0.00592041015625, 0.0234375, -0.0213623046875, 0.0086669921875, -0.0054931640625, -0.0267333984375, 0.0078125, 0.004547119140625, 0.0162353515625, 0.031005859...

[ 1250, 4867, 154109, 12830, 3934, 34475, 5303, 502, 89536, 126684, 35378, 32599, 67660, 34153, 66211, 262, 64552, 63805, 678, 17262, 171859, 5117, 17932, 5928, 4568, 8110, 163846, 105950, 1284, 80854, 14858, 1046, 74955, 37842, 92814, 2367, 3302...

[ 0.1607666015625, 0.2108154296875, 0.24462890625, 0.1702880859375, 0.0872802734375, 0.063720703125, 0.1888427734375, 0.1221923828125, 0.081298828125, 0.0789794921875, 0.027587890625, 0.09033203125, 0.1339111328125, 0.021514892578125, 0.14306640625, 0.001800537109375, 0.1448974609375, ...

embed

10248451_c0

10248451

prolog

0

Title: minimax for tic-tac-toe Problem title: minimax for tic-tac-toe Tags: prolog, algorithm Problem: minimax for tic-tac-toe I'm trying to solve tic-tac-toe with a simple minimax algorithm. Simple, but should cover a lot of the language. What I have so far: The board is represented as an array of 9 (unbound) variable...

minimax for tic-tac-toe minimax for tic-tac-toe prolog algorithm Player Board minimax for tic-tac-toe I'm trying to solve tic-tac-toe with a simple minimax algorithm. Simple, but should cover a lot of the language. What I have so far: The board is represented as an array of 9 (unbound) variables, that are either set to...

[ 0.0220947265625, 0.000331878662109375, 0.0264892578125, 0.01611328125, -0.0012359619140625, 0.0096435546875, 0.0035858154296875, 0.00958251953125, 0.0025177001953125, -0.00799560546875, -0.0162353515625, -0.00063323974609375, 0.017822265625, -0.0018768310546875, -0.0126953125, -0.02343...

[ 83818, 425, 96212, 102, 238, 51890, 502, 4867, 234873, 60560, 62554, 31577, 86869, 8781, 60552, 29256, 46876, 2060, 45443, 33636, 10298, 483, 309, 99091, 77336, 5423, 47, 1022, 707, 36, 19916, 35431, 198343, 142581, 304, 363, 136659, 20117, ...

[ 0.2371826171875, 0.19970703125, 0.1920166015625, 0.1500244140625, 0.1331787109375, 0.2178955078125, 0.138427734375, 0.1749267578125, 0.1949462890625, 0.1953125, 0.201416015625, 0.037017822265625, 0.09588623046875, 0.1165771484375, 0.07318115234375, 0.040283203125, 0.0848388671875, ...

embed

33260885_c1

33260885

prolog

1

4, 55)), X = plus(55, plus(4, 2)), X = plus(55, plus(4, 55)). I think. So I want all expressions that obtain the result by substitution. If you try the code, you get instantiation error for list when decomposing with =.. built in predicate. EDIT: So, I was thinking about checking if Term is ground variable, to avoid in...

[ -0.01123046875, 0.015625, 0.0174560546875, 0.00799560546875, -0.002197265625, 0.003448486328125, 0.00138092041015625, -0.00677490234375, 0.023193359375, -0.0177001953125, 0.0003204345703125, 0.02685546875, -0.008056640625, 0.00634765625, 0.0078125, -0.0029296875, 0.04150390625, 0.0...

[ 201, 4, 4859, 247, 1193, 2203, 1001, 11663, 105801, 4958, 5351, 3444, 756, 125195, 7, 113054, 16750, 390, 161740, 1830, 9790, 18151, 34648, 14, 2320, 18499, 5303, 8, 277, 7522, 678, 88303, 23, 1653, 2063, 67, 47644, 175199, 2174, 2994, ...

[ 0.1590576171875, 0.017547607421875, 0.265625, 0.000152587890625, 0.151611328125, 0.1346435546875, 0.1654052734375, 0.27392578125, 0.1773681640625, 0.07086181640625, 0.0806884765625, 0.1107177734375, 0.09716796875, 0.2396240234375, 0.025726318359375, 0.1031494140625, 0.149169921875, ...

embed