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
19875352_c0	19875352	prolog	0	Title: Calling a procedure during assert in Prolog Problem title: Calling a procedure during assert in Prolog Tags: prolog, prolog-assert Problem: Calling a procedure during assert in Prolog I have an assert query that is something like: :- dynamic a/1,b/1. dump:- listing(a),listing(b). main:-retractall(a(X)),assert(a(...	Calling a procedure during assert in Prolog Calling a procedure during assert in Prolog prolog prolog-assert Calling Prolog main:-retractall pro_a pro_b aa1 bb1 Calling a procedure during assert in Prolog I have an assert query that is something like: I want the user to type a(1) or b(1) , the program to display aa or ...	[ 0.009765625, 0.006744384765625, 0.0091552734375, 0.02490234375, -0.017578125, 0.00885009765625, -0.01531982421875, 0.00836181640625, 0.0017852783203125, -0.011474609375, 0.003265380859375, 0.035888671875, -0.031494140625, -0.0029754638671875, 0.046630859375, -0.0162353515625, 0.03833...	[ 26265, 50491, 20271, 237, 33657, 1250, 4867, 23, 502, 162, 5201, 107, 39989, 91569, 11, 275, 10, 418, 5125, 41, 1294, 3444, 38937, 10644, 27750, 707, 876, 1528, 44116, 107013, 2060, 4127, 11782, 15700, 96819, 454, 11675, 764, 52895, 37842...	[ 0.183349609375, 0.22802734375, 0.134521484375, 0.125, 0.276123046875, 0.166259765625, 0.2322998046875, 0.021759033203125, 0.1751708984375, 0.128173828125, 0.037445068359375, 0.04412841796875, 0.1021728515625, 0.1510009765625, 0.08941650390625, 0.1082763671875, 0.06170654296875, 0.0...	embed
30959342_c0	30959342	prolog	0	Title: SQL simulator on Prolog Problem title: SQL simulator on Prolog Tags: sql, prolog, simulator Problem: SQL simulator on Prolog i need to do a SQL simulator on Prolog. i need to simulate some functions like create_table, insert, delete, update_table, select_table, drop_table, show_table, etc. I am learning how to d...	SQL simulator on Prolog SQL simulator on Prolog sql prolog simulator SQL Prolog create_table Atributos SQL simulator on Prolog i need to do a SQL simulator on Prolog. i need to simulate some functions like create_table, insert, delete, update_table, select_table, drop_table, show_table, etc. I am learning how to do ass...	[ 0.027099609375, 0.00445556640625, 0.01007080078125, 0.040771484375, -0.01806640625, -0.008056640625, -0.007476806640625, 0.0115966796875, 0.00168609619140625, -0.0301513671875, 0.01123046875, -0.002349853515625, -0.017333984375, -0.0169677734375, 0.017333984375, 0.0189208984375, 0.02...	[ 80866, 40226, 1290, 98, 1250, 4867, 99247, 502, 28282, 22819, 1913, 28177, 1952, 3871, 32354, 183540, 154109, 28350, 36849, 36069, 7639, 52080, 237, 33657, 41499, 18499, 5117, 839, 284, 541, 9351, 23180, 62, 5303, 146256, 1636, 27781, 96610, ...	[ 0.219970703125, 0.251953125, 0.1396484375, 0.06842041015625, 0.14501953125, 0.22900390625, 0.146240234375, 0.0888671875, 0.122314453125, 0.2078857421875, 0.0296630859375, 0.15234375, 0.0762939453125, 0.0416259765625, 0.1353759765625, 0.06805419921875, 0.0634765625, 0.0621337890625,...	embed
75498411_c0	75498411	prolog	0	Title: Logic programming with multiple fact databases Problem title: Logic programming with multiple fact databases Tags: prolog, minikanren, logic-programming, datalog Problem: Logic programming with multiple fact databases I have to find a logically consistent subset of multiple fact sets (databases). Is there a logi...	Logic programming with multiple fact databases Logic programming with multiple fact databases prolog minikanren logic-programming datalog Logic Logic programming with multiple fact databases I have to find a logically consistent subset of multiple fact sets (databases). Is there a logic programming language with built-...	[ 0.027587890625, 0.015380859375, 0.00860595703125, 0.01025390625, -0.01470947265625, 0.019287109375, 0.003173828125, -0.01007080078125, 0.01318359375, -0.0291748046875, -0.0106201171875, 0.00360107421875, 0.003631591796875, -0.01220703125, -0.0020751953125, -0.0052490234375, 0.0098266...	[ 50592, 238, 56037, 678, 48716, 15824, 63399, 449, 502, 4867, 7665, 331, 982, 62775, 28966, 2053, 7413, 12684, 74729, 1614, 3509, 5423, 10135, 37382, 46876, 88303, 73, 135094, 54, 190358, 160404, 98, 5701, 4173, 10750, 12638, 8, 48345, 10617...	[ 0.182861328125, 0.000885009765625, 0.184814453125, 0.059722900390625, 0.2191162109375, 0.2144775390625, 0.2340087890625, 0.0406494140625, 0.07000732421875, 0.1513671875, 0.058013916015625, 0.04638671875, 0.12451171875, 0.2388916015625, 0.1263427734375, 0.02862548828125, 0.10552978515...	embed
40047040_c0	40047040	prolog	0	Title: Prolog: Assigning Priority to Atoms Problem title: Prolog: Assigning Priority to Atoms Tags: prolog Problem: Prolog: Assigning Priority to Atoms I am completely new to swi-prolog but am learning as I go and I am trying to create a program that will choose the optimal option in a certain scenario. I am wondering ...	Prolog: Assigning Priority to Atoms Prolog: Assigning Priority to Atoms prolog Prolog Assigning Priority Atoms Prolog: Assigning Priority to Atoms I am completely new to swi-prolog but am learning as I go and I am trying to create a program that will choose the optimal option in a certain scenario. I am wondering if th...	[ 0.017822265625, 0.01068115234375, 0.0177001953125, 0.03173828125, -0.0059814453125, 0.00592041015625, 0.010009765625, 0.00946044921875, -0.0260009765625, -0.007354736328125, 0.0101318359375, 0.0166015625, 0.004119873046875, -0.032958984375, 0.00469970703125, 0.003387451171875, 0.0077...	[ 1250, 4867, 12, 1301, 31304, 168857, 53, 47, 69728, 7, 502, 64557, 3525, 91, 2452, 3454, 52080, 31577, 28282, 1528, 55076, 24087, 35829, 24233, 106117, 149016, 3917, 23, 95486, 107671, 6620, 34627, 1884, 831, 678, 39933, 17368, 7413, 107730...	[ 0.188720703125, 0.26953125, 0.002716064453125, 0.05194091796875, 0.177490234375, 0.2158203125, 0.12841796875, 0.0821533203125, 0.219482421875, 0.07952880859375, 0.1182861328125, 0.0291595458984375, 0.0765380859375, 0.047454833984375, 0.1676025390625, 0.134765625, 0.081298828125, 0....	embed
56208716_c0	56208716	prolog	0	Title: Prolog - distance from two point Problem title: Prolog - distance from two point Tags: distance, position, prolog Problem: Prolog - distance from two point i want calculate distance from two cites, i have cityState, list of lists of [NameCity,[X,Y],Neighbours],[],..] I'm trying to write a code in Prolog to calcu...	Prolog - distance from two point Prolog - distance from two point distance position prolog two Prolog NameCity Neighbours ERROR Syntax Operator Distance Name Position Neighbors _Neighbors City1 City2 X_Dist X1-X2 Y_Dist Y1-Y2 Prolog - distance from two point i want calculate distance from two cites, i have cityState, l...	[ 0.0042724609375, -0.0074462890625, 0.00360107421875, 0.0152587890625, 0.00390625, 0.00159454345703125, -0.0062255859375, 0.017578125, 0.00174713134765625, -0.03515625, 0.0145263671875, 0.003997802734375, -0.01336669921875, -0.023681640625, -0.0174560546875, -0.00958251953125, 0.02038...	[ 1250, 4867, 62488, 1295, 6626, 6275, 19069, 502, 15757, 115411, 799, 6958, 38648, 151206, 24638, 19010, 86531, 150922, 154349, 99428, 3422, 6433, 6406, 418, 304, 1193, 397, 1419, 20268, 990, 1723, 3444, 74481, 67, 113721, 765, 26349, 135206, ...	[ 0.1839599609375, 0.239990234375, 0.221435546875, 0.1417236328125, 0.1890869140625, 0.144287109375, 0.143798828125, 0.1422119140625, 0.071533203125, 0.0970458984375, 0.007293701171875, 0.10369873046875, 0.1304931640625, 0.1129150390625, 0.059814453125, 0.05694580078125, 0.084838867187...	embed
41450479_c0	41450479	prolog	0	Title: Learn Prolog Now - issues with backtracking in exercise on recursion Problem title: Learn Prolog Now - issues with backtracking in exercise on recursion Tags: prolog, successor-arithmetics Problem: Learn Prolog Now - issues with backtracking in exercise on recursion I am having troubles understanding what is hap...	Learn Prolog Now - issues with backtracking in exercise on recursion Learn Prolog Now - issues with backtracking in exercise on recursion prolog successor-arithmetics Learn Prolog Now Learn Prolog Now - issues with backtracking in exercise on recursion I am having troubles understanding what is happening in this exampl...	[ 0.0042724609375, 0.0181884765625, 0.00885009765625, 0.01055908203125, 0.0026397705078125, 0.0152587890625, 0.00494384765625, -0.002044677734375, -0.00274658203125, -0.010498046875, 0.0001049041748046875, -0.00958251953125, -0.01904296875, 0.004180908203125, 0.0272216796875, -0.00476074...	[ 134031, 1250, 4867, 14240, 37348, 678, 4420, 125728, 214, 81979, 195625, 1830, 502, 39457, 42, 8962, 63134, 7, 100094, 83, 123087, 27781, 117615, 138, 89536, 22408, 144053, 748, 9655, 297, 22542, 289, 1542, 247, 1221, 5117, 538, 8337, 757, ...	[ 0.162353515625, 0.1585693359375, 0.252197265625, 0.18994140625, 0.12744140625, 0.0240325927734375, 0.154296875, 0.264892578125, 0.058837890625, 0.1580810546875, 0.19091796875, 0.0682373046875, 0.15625, 0.19775390625, 0.09283447265625, 0.09442138671875, 0.049774169921875, 0.00289916...	embed
27907608_c0	27907608	prolog	0	Title: Prolog with inequalities Problem title: Prolog with inequalities Tags: prolog, clpq, inequalities Problem: Prolog with inequalities I found this inequality solving program from some Internet source.It works well.This is the program. :-use_module(library(clpq)). dec_inc(Left,Right):- copy_term(Left-Right,CopyLeft...	Prolog with inequalities Prolog with inequalities prolog clpq inequalities Prolog use_module dec_inc Left Right copy_term Left-Right CopyLeft-CopyRight tell_cs CopyLeft CopyRight Leq P1s ERROR Unhandled _G3082 Prolog with inequalities I found this inequality solving program from some Internet source.It works well.This ...	[ 0.000774383544921875, -0.003570556640625, 0.00982666015625, 0.0185546875, 0.002960205078125, 0.0184326171875, 0.0079345703125, -0.00531005859375, 0.004119873046875, -0.0247802734375, -0.0032806396484375, -0.00022029876708984375, 0.009765625, 0.0027313232421875, 0.0155029296875, 0.00384...	[ 1250, 4867, 678, 23, 13, 71723, 31075, 502, 254, 864, 4527, 83279, 57865, 38893, 2480, 90911, 43658, 32166, 22553, 146930, 6493, 14192, 4439, 636, 436, 418, 151206, 24638, 992, 79628, 724, 1197, 12012, 14037, 161789, 3115, 6496, 1528, 31344...	[ 0.194091796875, 0.2802734375, 0.102783203125, 0.1146240234375, 0.119384765625, 0.19580078125, 0.109619140625, 0.11767578125, 0.004608154296875, 0.1195068359375, 0.055816650390625, 0.1107177734375, 0.1728515625, 0.1092529296875, 0.0614013671875, 0.07562255859375, 0.101806640625, 0.1...	embed
19675977_c0	19675977	prolog	0	Title: Prolog, check if term is power of 2 Problem title: Prolog, check if term is power of 2 Tags: successor-arithmetics, prolog Problem: Prolog, check if term is power of 2 i have written following code, which should work with my logic, but it does not. I should check if given term is power of two. For example s(s(s(...	Prolog, check if term is power of 2 Prolog, check if term is power of 2 successor-arithmetics prolog Prolog First Prolog, check if term is power of 2 i have written following code, which should work with my logic, but it does not. I should check if given term is power of two. For example s(s(s(nul))) should return fals...	[ 0.0162353515625, -0.005340576171875, 0.0115966796875, 0.013916015625, 0.0145263671875, -0.002471923828125, -0.0174560546875, 0.0186767578125, -0.01300048828125, -0.0240478515625, 0.010009765625, 0.0205078125, -0.03125, 0.00726318359375, 0.007476806640625, 0.0118408203125, 0.038574218...	[ 1250, 4867, 12765, 2174, 13579, 83, 14537, 111, 116, 39457, 42, 8962, 502, 23972, 25632, 18151, 4488, 62775, 34475, 6626, 91, 16524, 30646, 98320, 29568, 6528, 70, 39, 79385, 959, 101935, 8337, 14012, 3217, 382, 3447, 29806, 11522, 4358 ]	[ 0.14404296875, 0.2349853515625, 0.1793212890625, 0.0970458984375, 0.261962890625, 0.110107421875, 0.2152099609375, 0.168701171875, 0.23046875, 0.171142578125, 0.1019287109375, 0.046722412109375, 0.0928955078125, 0.068115234375, 0.040771484375, 0.08038330078125, 0.030853271484375, 0...	embed
72588896_c0	72588896	prolog	0	Title: Prolog: Find all equilateral triangles which are built from DB points Problem title: Prolog: Find all equilateral triangles which are built from DB points Tags: list, prolog Problem: Prolog: Find all equilateral triangles which are built from DB points I'm new to Prolog and my task requires finding all equilater...	Prolog: Find all equilateral triangles which are built from DB points Prolog: Find all equilateral triangles which are built from DB points list prolog DB Prolog Find Point_Sign Abscissa Ordinate db_filling List points_main Xs1 equilateral_triangles Points Res Prolog: Find all equilateral triangles which are built from...	[ 0.01202392578125, -0.0031280517578125, 0.00616455078125, 0.00921630859375, -0.006378173828125, 0.0086669921875, -0.0081787109375, 0.01214599609375, 0.0164794921875, -0.0137939453125, -0.0025634765625, -0.02783203125, 0.01397705078125, -0.021484375, -0.01519775390625, 0.0172119140625, ...	[ 1250, 4867, 12, 26040, 756, 60715, 141636, 1927, 109217, 7, 88303, 1295, 57976, 26847, 5303, 502, 41097, 218723, 27174, 318, 1192, 68149, 40041, 116115, 32036, 24931, 1193, 418, 3996, 9624, 3525, 66211, 144570, 90791, 16750, 20949, 31943, 682...	[ 0.14501953125, 0.2344970703125, 0.0323486328125, 0.1268310546875, 0.1026611328125, 0.1282958984375, 0.207763671875, 0.18701171875, 0.22119140625, 0.035614013671875, 0.105712890625, 0.0941162109375, 0.1802978515625, 0.177001953125, 0.12255859375, 0.09039306640625, 0.159912109375, 0....	embed
37649069_c0	37649069	prolog	0	Title: How to get the value of many elements of a matrix (list of lists) Problem title: How to get the value of many elements of a matrix (list of lists) Tags: prolog, matrix Problem: How to get the value of many elements of a matrix (list of lists) I have problems because I want to get the values of many grids of a ma...	How to get the value of many elements of a matrix (list of lists) How to get the value of many elements of a matrix (list of lists) prolog matrix How Len Matrix Row How to get the value of many elements of a matrix (list of lists) I have problems because I want to get the values of many grids of a matrix Example: I hav...	[ -0.007049560546875, 0.0087890625, 0.000667572021484375, 0.0067138671875, -0.011962890625, -0.006103515625, 0.00555419921875, 0.02099609375, 0.01153564453125, -0.0123291015625, 0.020263671875, 0.004669189453125, -0.0208740234375, -0.01031494140625, -0.01361083984375, 0.007171630859375, ...	[ 11249, 47, 2046, 70, 34292, 111, 5941, 80854, 50944, 425, 6562, 5303, 7, 502, 4867, 18226, 194234, 96190, 44402, 3444, 142424, 10314, 6468, 903, 2565, 38507, 1295, 176866, 22085, 8439, 13956, 21162, 2967, 54, 18151, 1653, 2063, 1632, 89536 ...	[ 0.0635986328125, 0.053466796875, 0.1510009765625, 0.09344482421875, 0.2342529296875, 0.07177734375, 0.204833984375, 0.221923828125, 0.1976318359375, 0.1396484375, 0.142822265625, 0.168212890625, 0.00579833984375, 0.14599609375, 0.197509765625, 0.1864013671875, 0.2105712890625, 0.21...	embed
55633243_c0	55633243	prolog	0	Title: How to inline a goal with findall/3, (use just one predicate)? Problem title: How to inline a goal with findall/3, (use just one predicate)? Tags: tuples, list, prolog-findall, prolog Problem: How to inline a goal with findall/3, (use just one predicate)? I have a knowledgebase that looks something like this fac...	How to inline a goal with findall/3, (use just one predicate)? How to inline a goal with findall/3, (use just one predicate)? tuples list prolog-findall prolog How fact1 fact2 find_item Val1 Val2 Items Item How to inline a goal with findall/3, (use just one predicate)? I have a knowledgebase that looks something like t...	[ 0.004425048828125, -0.0034332275390625, -0.000850677490234375, 0.011962890625, 0.00439453125, 0.00909423828125, -0.01055908203125, -0.00020694732666015625, 0.0098876953125, -0.032958984375, 0.01953125, 0.00830078125, 0.002532958984375, 0.005889892578125, -0.006988525390625, 0.005493164...	[ 11249, 23, 2256, 69236, 678, 7413, 5584, 18113, 4032, 1660, 1632, 1653, 2063, 67, 370, 99726, 5303, 502, 4867, 111607, 15824, 304, 217, 195, 4769, 78426, 10, 51359, 37382, 33342, 11907, 619, 27781, 101935, 14858, 42518, 120820, 1884, 4527, ...	[ 0.035003662109375, 0.1241455078125, 0.2447509765625, 0.2200927734375, 0.031341552734375, 0.1640625, 0.19140625, 0.2861328125, 0.057769775390625, 0.07666015625, 0.1077880859375, 0.1505126953125, 0.1561279296875, 0.058685302734375, 0.06719970703125, 0.1563720703125, 0.098388671875, 0...	embed
37380645_c1	37380645	prolog	1	//1 in the dcg/basics library? The error message says "character", but I can't find any useful reference as to what exactly this means and how to provide it with "proper" input. How do I pass a list of strings (tokens) to phrase/2 such that I can use integer//1 to parse a token as an integer? If there's no way to use t...	//1 in the dcg/basics library? The error message says "character", but I can't find any useful reference as to what exactly this means and how to provide it with "proper" input. How do I pass a list of strings (tokens) to phrase/2 such that I can use integer//1 to parse a token as an integer? If there's no way to use t...	[ 0.015869140625, -0.0030670166015625, 0.000690460205078125, 0.03076171875, 0.0020294189453125, 0.02197265625, 0.0032958984375, -0.0303955078125, 0.00433349609375, -0.0264892578125, -0.01214599609375, -0.006927490234375, -0.0205078125, 0.00482177734375, -0.006591796875, 0.01007080078125,...	[ 4666, 418, 23, 104, 238, 177, 5918, 28021, 35773, 1294, 18499, 26008, 17378, 9254, 2263, 720, 80234, 91067, 26950, 22691, 442, 36290, 56, 107730, 11249, 27875, 5303, 79315, 6448, 1755, 47, 113860, 12477, 4527, 892, 1505, 64, 11583, 366, 1...	[ 0.1007080078125, 0.1639404296875, 0.039459228515625, 0.06500244140625, 0.0537109375, 0.1461181640625, 0.1414794921875, 0.1273193359375, 0.1396484375, 0.0504150390625, 0.179443359375, 0.100830078125, 0.003814697265625, 0.1383056640625, 0.1580810546875, 0.171875, 0.023712158203125, 0...	embed
10123201_c0	10123201	prolog	0	Title: Prolog List storage Problem title: Prolog List storage Tags: prolog Problem: Prolog List storage I have a program which generates a list, and at different stages removes certain elements from it. There are 4 removal stages, and calling the 4th will first call 1,2,3 then 4. the predicate is called s4(Q, 100) and ...	Prolog List storage Prolog List storage prolog Prolog List Further Prolog List storage I have a program which generates a list, and at different stages removes certain elements from it. There are 4 removal stages, and calling the 4th will first call 1,2,3 then 4. the predicate is called s4(Q, 100) and there are also s1...	[ 0.020751953125, 0.037109375, 0.002655029296875, -0.00274658203125, -0.0152587890625, 0.00006246566772460938, -0.0167236328125, 0.00738525390625, 0.0130615234375, -0.00799560546875, 0.00970458984375, 0.02294921875, -0.0167236328125, -0.00775146484375, -0.0068359375, 0.016357421875, 0....	[ 1250, 4867, 32036, 132096, 502, 1528, 139392, 5303, 12921, 36541, 87388, 80854, 1295, 201, 49146, 1405, 159029, 927, 5117, 11782, 25568, 363, 1398, 1653, 2063, 67, 35839, 91, 617, 2737, 805, 418, 304, 7, 5701, 479, 20623, 3559, 96819, 594...	[ 0.1297607421875, 0.2266845703125, 0.2020263671875, 0.1903076171875, 0.100341796875, 0.1473388671875, 0.1124267578125, 0.2161865234375, 0.0279693603515625, 0.1875, 0.1834716796875, 0.1566162109375, 0.05316162109375, 0.1236572265625, 0.1231689453125, 0.0938720703125, 0.1058349609375, ...	embed
70845148_c0	70845148	prolog	0	Title: How to determine if two propositional formulas are equivalent in Prolog? Problem title: How to determine if two propositional formulas are equivalent in Prolog? Tags: propositional-calculus, prolog, logic, boolean-logic Problem: How to determine if two propositional formulas are equivalent in Prolog? I'm new to ...	How to determine if two propositional formulas are equivalent in Prolog? How to determine if two propositional formulas are equivalent in Prolog? propositional-calculus prolog logic boolean-logic How Prolog How to determine if two propositional formulas are equivalent in Prolog? I'm new to Prolog and have some doubts. ...	[ 0.022216796875, 0.017333984375, 0.00823974609375, 0.0228271484375, -0.01129150390625, -0.01239013671875, 0.0042724609375, -0.0054931640625, -0.005889892578125, -0.00170135498046875, 0.00775146484375, 0.0162353515625, -0.0001430511474609375, 0.00714111328125, 0.0172119140625, 0.00315856...	[ 11249, 47, 83324, 2174, 6626, 89261, 289, 26168, 7, 621, 183234, 23, 1250, 4867, 6827, 94739, 502, 62775, 34677, 137043, 3525, 92814, 33022, 32354, 3173, 3181, 4, 571, 14192, 335, 62, 136, 134598, 5705, 18, 25443, 284, 32920, 149842, 1276...	[ 0.055419921875, 0.0787353515625, 0.170166015625, 0.106689453125, 0.1766357421875, 0.2451171875, 0.1549072265625, 0.2626953125, 0.07861328125, 0.1019287109375, 0.239990234375, 0.0889892578125, 0.176513671875, 0.254638671875, 0.0848388671875, 0.1092529296875, 0.10675048828125, 0.0812...	embed
73531158_c0	73531158	prolog	0	Title: Peeking past end-of-file with SICStus Prolog Problem title: Peeking past end-of-file with SICStus Prolog Tags: sicstus-prolog, prolog, iso-prolog Problem: Peeking past end-of-file with SICStus Prolog Suppose I have an empty file (imaginatively called empty ) in the current directory and run the following query. ...	Peeking past end-of-file with SICStus Prolog Peeking past end-of-file with SICStus Prolog sicstus-prolog prolog iso-prolog Peeking SICStus Prolog eof_action eof_code stream_property end_of_stream EOS0 peek_char EOS1 get_char EOS2 EOS3 EOS4 Peeking past end-of-file with SICStus Prolog Suppose I have an empty file (imagi...	[ 0.0029449462890625, 0.0072021484375, 0.01904296875, 0.00653076171875, -0.013427734375, -0.00628662109375, 0.00494384765625, 0.010498046875, 0.00482177734375, 0.01202392578125, 0.009033203125, 0.0240478515625, -0.0302734375, -0.0008544921875, 0.0005950927734375, -0.01251220703125, 0.0...	[ 1460, 343, 214, 11015, 3564, 4390, 29822, 678, 159, 102198, 2143, 1250, 4867, 26536, 18253, 3454, 502, 13882, 28, 44713, 40899, 75973, 36290, 56, 86429, 163795, 2389, 280, 9254, 418, 2046, 617, 201505, 11435, 172008, 43581, 14364, 11675, 25...	[ 0.182373046875, 0.2034912109375, 0.007476806640625, 0.1708984375, 0.1685791015625, 0.199462890625, 0.1419677734375, 0.0330810546875, 0.1058349609375, 0.07861328125, 0.2230224609375, 0.12451171875, 0.227294921875, 0.09466552734375, 0.1781005859375, 0.06787109375, 0.0679931640625, 0....	embed
30605398_c1	30605398	prolog	1	, User, [ GroupHead \| UpdatedGroups ] ) :- updateGroupStrict(GroupsRest,UserGroups,User,UpdatedGroups). % Reduce strict helper, try next usergroup updateGroupStrict(Groups,[ _ \| UserGroupTail ],User,UpdatedGroups) :- updateGroupStrict(Groups,UserGroupTail,User,UpdatedGroups). handle(Groups, _, userrequest( _, [ request...	, User, [ GroupHead \| UpdatedGroups ] ) :- updateGroupStrict(GroupsRest,UserGroups,User,UpdatedGroups). % Reduce strict helper, try next usergroup updateGroupStrict(Groups,[ _ \| UserGroupTail ],User,UpdatedGroups) :- updateGroupStrict(Groups,UserGroupTail,User,UpdatedGroups). handle(Groups, _, userrequest( _, [ request...	[ -0.00927734375, 0.0235595703125, 0.01287841796875, 0.0224609375, -0.00921630859375, 0.03515625, -0.0223388671875, -0.01007080078125, 0.0267333984375, 0.0291748046875, 0.0108642578125, 0.015625, -0.01361083984375, 0.0023956298828125, -0.005859375, 0.017578125, 0.004791259765625, 0.0...	[ 53400, 10760, 13025, 712, 28641, 71, 205072, 7, 15772, 28350, 62233, 18, 1052, 525, 2189, 1062, 152872, 1745, 853, 106357, 81113, 4358, 56, 9790, 11737, 38937, 51588, 9874, 379, 34831, 50336, 26946, 47, 456, 75161, 94407, 5608, 150011, 4734...	[ 0.189453125, 0.2005615234375, 0.1673583984375, 0.130859375, 0.1759033203125, 0.062042236328125, 0.2113037109375, 0.02911376953125, 0.06671142578125, 0.21044921875, 0.181396484375, 0.0909423828125, 0.0643310546875, 0.1278076171875, 0.1063232421875, 0.029876708984375, 0.1351318359375, ...	embed
75844612_c0	75844612	prolog	0	Title: "Syntax error: Operator expected" with CLPFD Prolog Problem title: "Syntax error: Operator expected" with CLPFD Prolog Tags: clpfd, collatz, prolog Problem: "Syntax error: Operator expected" with CLPFD Prolog I'm reading The Power Of Prolog, and have got as far as the section on the Collatz s...	"Syntax error: Operator expected" with CLPFD Prolog "Syntax error: Operator expected" with CLPFD Prolog clpfd collatz prolog Syntax Operator CLPFD Prolog use_module Error "Syntax error: Operator expected" with CLPFD Prolog I'm reading The Power Of Prolog, and have got as far as the section on the Co...	[ 0.003448486328125, 0.000530242919921875, -0.0086669921875, 0.013427734375, 0.0224609375, 0.00384521484375, 0.01031494140625, 0.00016307830810546875, -0.01434326171875, -0.056884765625, 0.0023040771484375, -0.03515625, 0.00726318359375, -0.01092529296875, 0.021240234375, 0.0062866210937...	[ 3371, 86531, 18499, 150922, 84751, 678, 46323, 41265, 397, 1250, 4867, 33139, 39557, 71, 65780, 9136, 502, 19010, 4527, 83279, 212059, 16454, 17170, 6619, 88842, 257, 169, 944, 71200, 18151, 154107, 9790, 9969, 1340, 256, 379, 34165, 2424, ...	[ 0.1131591796875, 0.1881103515625, 0.1917724609375, 0.27734375, 0.22119140625, 0.0721435546875, 0.1199951171875, 0.1370849609375, 0.1591796875, 0.1295166015625, 0.190673828125, 0.012481689453125, 0.0848388671875, 0.10791015625, 0.038543701171875, 0.099853515625, 0.062255859375, 0.11...	embed
40987361_c1	40987361	prolog	1	[]), IP), treeP(IP). ip(SSem) --> np(NPSem), ibar(IbarSem), {var_replace(NPSem,NPSem1), beta(NPSem1@IbarSem,SSem)}. ibar(VPSem) --> i(MvdVbL),vp(VPSem,MvdVbL). i([]) --> []. i([]) --> [Aux],{isAux(Aux)}. i([Verb]) --> [InflVerb],{pastInfl(Verb,InflVerb),isVerb(Verb)}. pastInfl(see,saw). pastInfl(love,loved). vp(VbarSem...	[]), IP), treeP(IP). ip(SSem) --> np(NPSem), ibar(IbarSem), {var_replace(NPSem,NPSem1), beta(NPSem1@IbarSem,SSem)}. ibar(VPSem) --> i(MvdVbL),vp(VPSem,MvdVbL). i([]) --> []. i([]) --> [Aux],{isAux(Aux)}. i([Verb]) --> [InflVerb],{pastInfl(Verb,InflVerb),isVerb(Verb)}. pastInfl(see,saw). pastInfl(love,loved). vp(VbarSem...	[ -0.006134033203125, 0.0225830078125, -0.0013427734375, 0.0169677734375, 0.0091552734375, 0.0181884765625, -0.007354736328125, 0.00946044921875, 0.020263671875, -0.047119140625, 0.020263671875, 0.01129150390625, -0.00592041015625, 0.006866455078125, -0.00555419921875, 0.0010910034179687...	[ 378, 268, 247, 8021, 53201, 683, 132, 10931, 194, 17, 254, 15268, 195, 129908, 25037, 28814, 294, 1299, 568, 1961, 107, 23935, 17727, 51703, 418, 981, 8152, 5, 856, 9059, 594, 59805, 275, 866, 334, 1065, 6077, 164, 15896, 4153, 15991, ...	[ 0.11767578125, 0.112060546875, 0.1417236328125, 0.252197265625, 0.251953125, 0.2159423828125, 0.0282135009765625, 0.2213134765625, 0.0665283203125, 0.2132568359375, 0.200439453125, 0.127685546875, 0.2425537109375, 0.1146240234375, 0.2159423828125, 0.1566162109375, 0.10699462890625, ...	embed
16738388_c0	16738388	prolog	0	Title: How to use variables in Prolog query shell? Problem title: How to use variables in Prolog query shell? Tags: prolog-toplevel, declarative, prolog, swi-prolog Problem: How to use variables in Prolog query shell? I know that I can use variables in Prolog shell (something like using '$' character, I think...but I d...	How to use variables in Prolog query shell? How to use variables in Prolog query shell? prolog-toplevel declarative prolog swi-prolog How Prolog dataggare.txt ListaTesto TokenizedList ERROR How to use variables in Prolog query shell? I know that I can use variables in Prolog shell (something like using '$' character, I...	[ 0.02392578125, 0.01422119140625, -0.01153564453125, 0.033935546875, 0.00115966796875, -0.006195068359375, -0.01092529296875, 0.01507568359375, -0.009765625, -0.050048828125, 0.00811767578125, 0.01373291015625, -0.01068115234375, 0.001922607421875, 0.01495361328125, 0.00836181640625, ...	[ 11249, 4527, 77336, 7, 23, 1250, 4867, 41, 1294, 128019, 502, 13784, 67919, 21635, 2452, 3454, 2053, 31199, 107, 124326, 50085, 111337, 31, 717, 1098, 29367, 154663, 151206, 831, 17368, 4369, 62816, 71924, 4488, 6626, 111210, 174350, 12477, ...	[ 0.0472412109375, 0.155517578125, 0.294677734375, 0.137939453125, 0.04595947265625, 0.1680908203125, 0.2376708984375, 0.0875244140625, 0.08251953125, 0.2191162109375, 0.0814208984375, 0.036407470703125, 0.092041015625, 0.0784912109375, 0.06597900390625, 0.06939697265625, 0.04296875, ...	embed
70531545_c0	70531545	prolog	0	Title: SWI Prolog: avoiding name clashes between builtin predicates and dynamic predicates Problem title: SWI Prolog: avoiding name clashes between builtin predicates and dynamic predicates Tags: swi-prolog, prolog, module Problem: SWI Prolog: avoiding name clashes between builtin predicates and dynamic predicates I'm ...	SWI Prolog: avoiding name clashes between builtin predicates and dynamic predicates SWI Prolog: avoiding name clashes between builtin predicates and dynamic predicates swi-prolog prolog module SWI Prolog delete_import_module foo:halt ERROR toplevel_call user:user lib64 swipl-8.4.1 toplevel.pl:1117 system:halt SWI Prolo...	[ -0.0020599365234375, 0.004150390625, 0.0185546875, -0.0008087158203125, -0.029296875, 0.004180908203125, 0.00830078125, 0.00341796875, 0.00130462646484375, -0.0284423828125, -0.0001430511474609375, 0.0135498046875, -0.01446533203125, -0.0223388671875, 0.02734375, -0.00885009765625, 0...	[ 159, 38969, 1250, 4867, 71864, 9351, 26580, 114942, 17721, 88303, 73, 1653, 2063, 84079, 2452, 3454, 502, 88996, 154109, 60270, 83279, 5775, 31, 23766, 151206, 24638, 2663, 67919, 85763, 65918, 25474, 13307, 2424, 17376, 120518, 2489, 5426, 7...	[ 0.03466796875, 0.1998291015625, 0.1435546875, 0.1864013671875, 0.115234375, 0.1156005859375, 0.1514892578125, 0.07232666015625, 0.044647216796875, 0.153564453125, 0.1474609375, 0.1949462890625, 0.2139892578125, 0.225830078125, 0.1715087890625, 0.0755615234375, 0.08740234375, 0.2133...	embed
73323531_c0	73323531	prolog	0	Title: verify the occurence of an element a set of times between every pair of digits that add up to 10 Prolog Problem title: verify the occurence of an element a set of times between every pair of digits that add up to 10 Prolog Tags: prolog Problem: verify the occurence of an element a set of times between every pair...	verify the occurence of an element a set of times between every pair of digits that add up to 10 Prolog verify the occurence of an element a set of times between every pair of digits that add up to 10 Prolog prolog Prolog Elt Occ Help verify the occurence of an element a set of times between every pair of digits that a...	[ 0.025634765625, -0.002838134765625, -0.00634765625, 0.016845703125, -0.00177001953125, 0.003936767578125, -0.022216796875, -0.0023651123046875, 0.005950927734375, -0.018310546875, 0.01202392578125, -0.0125732421875, 0.00823974609375, -0.006927490234375, -0.01446533203125, -0.0201416015...	[ 493, 40383, 74918, 6620, 12830, 5423, 20028, 17721, 11907, 80836, 153939, 7, 15190, 1257, 209, 1250, 4867, 502, 540, 18, 180, 10060, 39527, 3871, 33022, 1653, 2063, 67, 154663, 7623, 670, 214493, 2174, 66161, 4068, 42, 275, 910, 617, 5762...	[ 0.202392578125, 0.2391357421875, 0.219970703125, 0.1400146484375, 0.23095703125, 0.1217041015625, 0.1954345703125, 0.1834716796875, 0.11328125, 0.195068359375, 0.2298583984375, 0.0173492431640625, 0.138916015625, 0.05804443359375, 0.189453125, 0.156982421875, 0.2305908203125, 0.103...	embed
26561848_c1	26561848	prolog	1	each result to find_palindrome , but I thought I might be able to do everything via backtracking. find_loop(Word, Loop) :- zip(Word, 0, WZ), length(Word, WL), Word_length is WL - 1, [X\|_] = WZ, find_another(X, Word_length, WZ, [X], Loop). /* Get a element with same letter if not in history, explore further via its pal...	each result to find_palindrome , but I thought I might be able to do everything via backtracking. find_loop(Word, Loop) :- zip(Word, 0, WZ), length(Word, WL), Word_length is WL - 1, [X\|_] = WZ, find_another(X, Word_length, WZ, [X], Loop). /* Get a element with same letter if not in history, explore further via its pal...	[ 0.00653076171875, -0.00970458984375, -0.00384521484375, 0.01611328125, 0.00037384033203125, 0.00872802734375, 0.01611328125, 0.0045166015625, 0.0263671875, -0.052001953125, 0.0213623046875, 0.01214599609375, 0.004730224609375, 0.0130615234375, 0.00579833984375, -0.0089111328125, -0.0...	[ 12638, 16750, 7413, 5007, 73, 102851, 1284, 17569, 13648, 19048, 54, 26818, 1829, 4420, 125728, 214, 28354, 164805, 4, 199694, 15772, 68330, 757, 1511, 140909, 181280, 22543, 23986, 927, 83, 106, 1542, 66, 126340, 20779, 12830, 678, 5701, 3...	[ 0.0963134765625, 0.163818359375, 0.184814453125, 0.1602783203125, 0.1153564453125, 0.2288818359375, 0.002838134765625, 0.06744384765625, 0.050689697265625, 0.050201416015625, 0.053558349609375, 0.0968017578125, 0.043243408203125, 0.14453125, 0.2474365234375, 0.1116943359375, 0.248046...	embed
15834386_c1	15834386	prolog	1	), fail ) ; true ), arg(1, S, Rev), reverse(Rev, Path_to_goal). I tried to use JPL from SWI Prolog but I wasn't able to run it because of severel exceptions pointing out, that Eclipse wasn't able to find the library correctly. I always get one of the following Exceptions: Exception in thread "main" java.lang.Unsatisfie...	), fail ) ; true ), arg(1, S, Rev), reverse(Rev, Path_to_goal). I tried to use JPL from SWI Prolog but I wasn't able to run it because of severel exceptions pointing out, that Eclipse wasn't able to find the library correctly. I always get one of the following Exceptions: Exception in thread "main" java.lang.Unsatisfie...	[ -0.0021209716796875, 0.031494140625, 0.0196533203125, -0.0023193359375, -0.0272216796875, -0.00421142578125, 0.007293701171875, 0.002532958984375, 0.0030364990234375, -0.042236328125, 0.00482177734375, 0.0269775390625, -0.0238037109375, -0.00567626953125, -0.000335693359375, 0.00256347...	[ 35782, 29568, 79459, 159, 80893, 39531, 184, 4332, 334, 108421, 188, 519, 289, 37842, 4527, 821, 21130, 38969, 1250, 4867, 18, 19048, 11675, 27708, 583, 131527, 234962, 7413, 35773, 1294, 26785, 11343, 218288, 17514, 5443, 63928, 86997, 24931...	[ 0.17626953125, 0.06134033203125, 0.13232421875, 0.0614013671875, 0.134521484375, 0.0777587890625, 0.0219879150390625, 0.03668212890625, 0.0899658203125, 0.1351318359375, 0.1195068359375, 0.0919189453125, 0.08856201171875, 0.0030517578125, 0.0802001953125, 0.1435546875, 0.268798828125...	embed
33009427_c0	33009427	prolog	0	Title: test if the term N is a number or an atom an compute if it number in prolog Problem title: test if the term N is a number or an atom an compute if it number in prolog Tags: prolog, expression Problem: test if the term N is a number or an atom an compute if it number in prolog I am doing an arithmetic expression ...	test if the term N is a number or an atom an compute if it number in prolog test if the term N is a number or an atom an compute if it number in prolog prolog expression Val _Var _Val test if the term N is a number or an atom an compute if it number in prolog I am doing an arithmetic expression in prolog. the predicate...	[ -0.00994873046875, -0.00860595703125, 0.03125, 0.034912109375, 0.0196533203125, 0.02001953125, 0.0198974609375, 0.027587890625, -0.0159912109375, -0.00982666015625, 0.002349853515625, 0.00579833984375, -0.01129150390625, -0.0033721923828125, 0.01123046875, 0.003814697265625, 0.011718...	[ 3034, 2174, 13579, 541, 83, 14012, 707, 34627, 9969, 6743, 442, 23, 502, 4867, 142, 125195, 4769, 101, 81827, 42272, 8962, 1653, 2063, 1884, 83613, 42, 194, 16750, 1650, 4488, 7413, 3444, 959, 5, 765, 36766, 120262, 7225, 25737, 140992, ...	[ 0.18359375, 0.089111328125, 0.2171630859375, 0.217041015625, 0.1148681640625, 0.2357177734375, 0.11328125, 0.264892578125, 0.1141357421875, 0.130126953125, 0.0535888671875, 0.04937744140625, 0.1768798828125, 0.233642578125, 0.03814697265625, 0.1793212890625, 0.2010498046875, 0.0011...	embed
76805793_c1	76805793	prolog	1	and values: % find all properties and values for one object findEveryPropertyWithValue(Object, Properties) :- % get one object ... instanceOf(Object, physicalObject), % find every property of every object findall((Property, Value), (propertyOf(Property, Object), hasValue(Property, Value)), Properties). % find all obje...	and values: % find all properties and values for one object findEveryPropertyWithValue(Object, Properties) :- % get one object ... instanceOf(Object, physicalObject), % find every property of every object findall((Property, Value), (propertyOf(Property, Object), hasValue(Property, Value)), Properties). % find all obje...	[ 0.0091552734375, -0.0191650390625, 0.00457763671875, -0.003387451171875, -0.00604248046875, 0.0118408203125, -0.01043701171875, -0.0172119140625, 0.027587890625, -0.01287841796875, 0.0027008056640625, 0.006622314453125, 0.0079345703125, -0.0380859375, -0.006011962890625, 0.022827148437...	[ 136, 142424, 1745, 7413, 756, 183871, 100, 1632, 36746, 200647, 10752, 1264, 939, 194583, 856, 50770, 46471, 75161, 234994, 15772, 2046, 110527, 132887, 72761, 11907, 57266, 5584, 190060, 36290, 56, 134549, 1556, 678, 43512, 132, 2940, 6863, ...	[ 0.1456298828125, 0.249267578125, 0.13427734375, 0.19970703125, 0.184814453125, 0.26611328125, 0.0276336669921875, 0.0833740234375, 0.195556640625, 0.183837890625, 0.07574462890625, 0.1339111328125, 0.1265869140625, 0.1715087890625, 0.1522216796875, 0.2186279296875, 0.104248046875, ...	embed
69424576_c0	69424576	prolog	0	Title: How to compile a prolog question correctly? Problem title: How to compile a prolog question correctly? Tags: prolog Problem: How to compile a prolog question correctly? I am working on a prolog problem and need some help here. /Write a predicate listtran(L,E) which translates a list of Latin number words to t...	How to compile a prolog question correctly? How to compile a prolog question correctly? prolog recursion How Write Latin English Clauses How to compile a prolog question correctly? I am working on a prolog problem and need some help here. What is needed to be written in predicates and query to test: and Also, what can ...	[ 0.00421142578125, 0.004608154296875, 0.019287109375, 0.00201416015625, 0.0031280517578125, 0.01458740234375, -0.016845703125, -0.0021820068359375, 0.015869140625, -0.03125, -0.00384521484375, -0.003875732421875, -0.000675201416015625, -0.007171630859375, 0.0026702880859375, 0.020385742...	[ 11249, 47, 9969, 1340, 502, 4867, 9655, 26785, 538, 10, 195625, 1830, 601, 18781, 42845, 14941, 100700, 90, 20697, 2967, 4358, 44841, 59121, 23, 1653, 2063, 136, 41, 1294, 3034, 71864, 18499, 26008 ]	[ 0.0755615234375, 0.034637451171875, 0.1622314453125, 0.1739501953125, 0.1702880859375, 0.2423095703125, 0.1949462890625, 0.1153564453125, 0.0723876953125, 0.046173095703125, 0.1484375, 0.0160980224609375, 0.0321044921875, 0.079833984375, 0.1593017578125, 0.1361083984375, 0.1381835937...	embed
64251931_c1	64251931	prolog	1	berdeen',united_kingdom,'Grampian',219100). city('Aberystwyth',united_kingdom,'Ceredigion',null). city('Abha',saudi_arabia,'Aseer',null). city('Abidjan',cote_divoire,'Lagunes',null). city('Abilene',united_states,'Texas',106707). city('Aboisso',cote_divoire,'Sud-Comoe',null). city('Abu Dhabi',united_arab_emirates,'Abu D...	berdeen',united_kingdom,'Grampian',219100). city('Aberystwyth',united_kingdom,'Ceredigion',null). city('Abha',saudi_arabia,'Aseer',null). city('Abidjan',cote_divoire,'Lagunes',null). city('Abilene',united_states,'Texas',106707). city('Aboisso',cote_divoire,'Sud-Comoe',null). city('Abu Dhabi',united_arab_emirates,'Abu D...	[ 0.006134033203125, 0.00830078125, -0.005859375, 0.017578125, -0.0157470703125, 0.01611328125, 0.0152587890625, -0.01397705078125, 0.0157470703125, -0.01422119140625, 0.01806640625, -0.01556396484375, -0.023193359375, -0.039794921875, -0.00799560546875, -0.019287109375, -0.00842285156...	[ 112845, 33, 25, 4, 5980, 3674, 454, 6048, 3815, 37878, 36181, 19, 304, 2947, 3559, 194, 26349, 132, 284, 1297, 54726, 120426, 56, 29251, 1830, 139550, 14832, 7, 41004, 11, 74883, 184, 34833, 2864, 587, 67, 30618, 50724, 2729, 6967, 5462...	[ 0.272216796875, 0.23876953125, 0.0767822265625, 0.0748291015625, 0.129150390625, 0.125244140625, 0.002593994140625, 0.1385498046875, 0.1634521484375, 0.082763671875, 0.19921875, 0.1475830078125, 0.050506591796875, 0.1640625, 0.2435302734375, 0.08953857421875, 0.2373046875, 0.044647...	embed
29404380_c0	29404380	prolog	0	Title: Unable to make facts dynamic in SWI-Prolog Problem title: Unable to make facts dynamic in SWI-Prolog Tags: prolog, prolog-directive-dynamic Problem: Unable to make facts dynamic in SWI-Prolog I would like to be able to retract and assert facts dynamically for the procedure location : location(egg, duck_pen). Bas...	Unable to make facts dynamic in SWI-Prolog Unable to make facts dynamic in SWI-Prolog prolog prolog-directive-dynamic Unable SWI-Prolog duck_pen Use redefine_system_predicate Head ERROR Unable to make facts dynamic in SWI-Prolog I would like to be able to retract and assert facts dynamically for the procedure location ...	[ 0.025390625, 0.0142822265625, 0.0263671875, 0.007415771484375, -0.010986328125, 0.0028533935546875, 0.00130462646484375, 0.018310546875, -0.01458740234375, -0.02880859375, -0.002105712890625, 0.0062255859375, -0.036865234375, -0.02880859375, 0.027587890625, -0.001190185546875, 0.0178...	[ 992, 2886, 3249, 15824, 7, 84079, 159, 38969, 9, 10752, 4867, 23, 502, 936, 100034, 242554, 115, 2594, 2278, 36836, 15265, 64552, 16751, 19714, 2063, 44816, 151206, 1884, 19048, 41499, 15390, 237, 33657, 50491, 31913, 67660, 1118, 168081, 2...	[ 0.09332275390625, 0.17236328125, 0.1220703125, 0.2191162109375, 0.1234130859375, 0.266357421875, 0.083740234375, 0.2362060546875, 0.0074462890625, 0.176513671875, 0.2113037109375, 0.0146484375, 0.14697265625, 0.1094970703125, 0.134033203125, 0.246826171875, 0.1087646484375, 0.09326...	embed
33786779_c0	33786779	prolog	0	Title: Prolog: removing all consecutive integer sublists Problem title: Prolog: removing all consecutive integer sublists Tags: prolog, list, sublist Problem: Prolog: removing all consecutive integer sublists So I ran into this Prolog problem: Given a linear numerical list remove all sequences of consecutive values. E....	Prolog: removing all consecutive integer sublists Prolog: removing all consecutive integer sublists prolog list sublist Prolog P-1 Here Prolog: removing all consecutive integer sublists So I ran into this Prolog problem: I managed to write this code: It almost works on some cases like: It's that it takes the last numbe...	[ -0.00396728515625, 0.020263671875, 0.0015411376953125, 0.00360107421875, -0.0220947265625, 0.00311279296875, -0.01190185546875, 0.0185546875, -0.003082275390625, -0.010009765625, 0.00262451171875, 0.03125, -0.007232666015625, 0.0012054443359375, 0.0081787109375, 0.01177978515625, 0.0...	[ 1250, 4867, 49146, 6496, 756, 148390, 892, 1505, 1614, 6562, 502, 5303, 436, 5759, 2967, 145755, 33022, 903, 18151, 39555, 43240, 51776, 4568, 14012, 118055, 40, 944, 177229, 7077, 11737, 29954, 444, 20594, 44691 ]	[ 0.1552734375, 0.2200927734375, 0.114501953125, 0.0579833984375, 0.1318359375, 0.1727294921875, 0.0869140625, 0.0557861328125, 0.1903076171875, 0.20556640625, 0.0965576171875, 0.08709716796875, 0.010406494140625, 0.042236328125, 0.053314208984375, 0.03948974609375, 0.019622802734375, ...	embed
30556410_c0	30556410	prolog	0	Title: Prolog: append is failing inside loop Problem title: Prolog: append is failing inside loop Tags: prolog Problem: Prolog: append is failing inside loop I have the following Prolog code: my_function(A):- my_function(A,[],1). my_function(A,List,Num):- Num_new is Num+1, generateL(O,S,L), write(L),nl, %append(L,List,...	Prolog: append is failing inside loop Prolog: append is failing inside loop prolog Prolog my_function List Num Num_new List_New Prolog: append is failing inside loop I have the following Prolog code: Which is working. It loops through 19 times, calls generateL which generates a new term L which I print to the screen. I...	[ 0.001739501953125, -0.0027313232421875, 0.00970458984375, -0.00579833984375, 0.00384521484375, 0.006988525390625, 0.0003147125244140625, 0.01019287109375, 0.0247802734375, -0.0279541015625, 0.0235595703125, -0.01165771484375, -0.00830078125, 0.00347900390625, 0.031005859375, -0.0007095...	[ 1250, 4867, 114689, 71, 83, 35782, 214, 46132, 40956, 502, 759, 137175, 32036, 52782, 54936, 46568, 25632, 18151, 130078, 20697, 8305, 953, 20028, 11782, 139392, 866, 3525, 13579, 339, 28412, 49119, 3444, 12638, 720, 47, 5303, 28282, 115081, ...	[ 0.15966796875, 0.208251953125, 0.2327880859375, 0.206298828125, 0.02581787109375, 0.1824951171875, 0.1026611328125, 0.178955078125, 0.190185546875, 0.12548828125, 0.0528564453125, 0.12451171875, 0.15380859375, 0.127685546875, 0.1351318359375, 0.16259765625, 0.0305938720703125, 0.09...	embed
47349145_c0	47349145	prolog	0	Title: prolog successor state axiom ERROR: Out of local stack Problem title: prolog successor state axiom ERROR: Out of local stack Tags: wumpus-world, prolog Problem: prolog successor state axiom ERROR: Out of local stack I am trying to formulate a successor state axiom for an agent that moves (north,south,west,east) ...	prolog successor state axiom ERROR: Out of local stack prolog successor state axiom ERROR: Out of local stack wumpus-world prolog ERROR Out X-1 Y-1 prolog successor state axiom ERROR: Out of local stack I am trying to formulate a successor state axiom for an agent that moves (north,south,west,east) in a 4x4 grid. The g...	[ 0.0225830078125, 0.03564453125, -0.0128173828125, 0.0196533203125, -0.01416015625, -0.0028228759765625, -0.0238037109375, 0.024169921875, -0.01220703125, -0.005096435546875, 0.01080322265625, 0.031494140625, 0.00131988525390625, -0.01300048828125, 0.0255126953125, 0.006683349609375, ...	[ 502, 4867, 39457, 42, 11341, 5134, 306, 151206, 24638, 13538, 111, 4000, 177261, 148, 316, 7332, 32554, 1193, 5759, 990, 31577, 26168, 10, 23882, 25813, 25617, 201, 425, 617, 120067, 6626, 174408, 69276, 90105, 61475, 19069, 138, 363, 5608,...	[ 0.149658203125, 0.2205810546875, 0.2069091796875, 0.09454345703125, 0.1298828125, 0.1285400390625, 0.1719970703125, 0.1441650390625, 0.095458984375, 0.2139892578125, 0.2098388671875, 0.190185546875, 0.240966796875, 0.023162841796875, 0.07830810546875, 0.21484375, 0.1270751953125, 0...	embed
55044140_c1	55044140	prolog	1	:1], <compound json/1>, <compound suspension/9>) ERROR: [20,760,488] xsd2json:json___3__0('C:\proj_xsd\ref\p1_v1.xsd', '<garbage_collected>', '<garbage _collected>', '<garbage_collected>') ERROR: [20,760,486] xsd2json:node___6__41__1__75('<garbage_collected>', <compound ns/2>, [length:2], <compound suspension/12>, [len...	:1], <compound json/1>, <compound suspension/9>) ERROR: [20,760,488] xsd2json:json___3__0('C:\proj_xsd\ref\p1_v1.xsd', '<garbage_collected>', '<garbage _collected>', '<garbage_collected>') ERROR: [20,760,486] xsd2json:node___6__41__1__75('<garbage_collected>', <compound ns/2>, [length:2], <compound suspension/12>, [len...	[ -0.0022430419921875, 0.0301513671875, -0.0019378662109375, 0.0089111328125, -0.006256103515625, 0.0093994140625, -0.0206298828125, -0.01092529296875, 0.0038909912109375, -0.005401611328125, 0.020751953125, 0.0023956298828125, -0.001007080078125, -0.007080078125, 0.032958984375, -0.0029...	[ 152, 76172, 771, 7030, 1647, 1681, 11583, 277, 72179, 1830, 22364, 151206, 24638, 1549, 4, 110216, 161414, 1022, 7, 71, 304, 170, 363, 2389, 3454, 425, 29087, 418, 334, 1970, 402, 196352, 159645, 157, 8894, 6873, 1779, 12477, 23986, 22875...	[ 0.0219268798828125, 0.0897216796875, 0.153076171875, 0.1463623046875, 0.1328125, 0.2237548828125, 0.0699462890625, 0.0230255126953125, 0.2335205078125, 0.138916015625, 0.1510009765625, 0.20849609375, 0.1693115234375, 0.1119384765625, 0.014434814453125, 0.207275390625, 0.22900390625, ...	embed
47624626_c1	47624626	prolog	1	ith,alan). parent(charles,marc). parent(charles,kim). parent(charles,missy). parent(charles,eric). parent(eleanor,marc). parent(eleanor,kim). parent(eleanor,missy). parent(eleanor,eric). parent(eric,matty). parent(eric,tyler). parent(eric,kaydi). parent(amy,matty). parent(amy,tyler). parent(amy,kaydi). parent(missy,jor...	ith,alan). parent(charles,marc). parent(charles,kim). parent(charles,missy). parent(charles,eric). parent(eleanor,marc). parent(eleanor,kim). parent(eleanor,missy). parent(eleanor,eric). parent(eric,matty). parent(eric,tyler). parent(eric,kaydi). parent(amy,matty). parent(amy,tyler). parent(amy,kaydi). parent(missy,jor...	[ -0.0021209716796875, 0.009765625, 0.00823974609375, 0.0185546875, -0.0206298828125, 0.00054931640625, -0.0113525390625, 0.00982666015625, -0.006103515625, -0.06494140625, -0.0021514892578125, -0.0277099609375, 0.0033416748046875, 0.0274658203125, -0.00390625, -0.01318359375, 0.003311...	[ 6, 8962, 4, 9091, 194, 49129, 132, 9254, 1577, 1727, 238, 8103, 45188, 53, 1771, 1018, 66, 748, 2227, 939, 603, 16715, 35624, 105379, 145, 425, 1681, 1098, 5556, 5861, 30854, 65844, 1390, 195, 2397, 12862, 4293, 5636, 76, 516, 1760, 1...	[ 0.0614013671875, 0.26904296875, 0.09033203125, 0.2315673828125, 0.1280517578125, 0.250732421875, 0.0634765625, 0.110595703125, 0.141357421875, 0.138671875, 0.1202392578125, 0.2001953125, 0.1177978515625, 0.15478515625, 0.126708984375, 0.008819580078125, 0.10455322265625, 0.16552734...	embed
36414282_c0	36414282	prolog	0	Title: Propositional Logic Subformula in Prolog Problem title: Propositional Logic Subformula in Prolog Tags: prolog Problem: Propositional Logic Subformula in Prolog This is a prolog program which defines the syntax of propositional logic So I'm stuck trying to find where X is a sub formula of Y. I have made the follo...	Propositional Logic Subformula in Prolog Propositional Logic Subformula in Prolog prolog Propositional Logic Subformula Prolog Our Double Propositional Logic Subformula in Prolog This is a prolog program which defines the syntax of propositional logic So I'm stuck trying to find where X is a sub formula of Y. I have ma...	[ 0.0103759765625, -0.0028076171875, 0.018798828125, 0.0162353515625, -0.0162353515625, 0.004669189453125, 0.008544921875, 0.007537841796875, 0.007080078125, 0.000469207763671875, -0.0126953125, 0.002044677734375, -0.01123046875, -0.01251220703125, 0.00213623046875, 0.005035400390625, ...	[ 1250, 40322, 289, 50592, 8273, 2472, 19908, 23, 4867, 238, 502, 22929, 107172, 1528, 61924, 6002, 86531, 89261, 62775, 179933, 31577, 47, 7413, 7440, 1193, 83, 10, 1614, 26168, 111, 990, 7228, 25632, 1653, 2063, 19441, 44402, 9077, 7103, ...	[ 0.190673828125, 0.183349609375, 0.08880615234375, 0.1881103515625, 0.2032470703125, 0.1866455078125, 0.181884765625, 0.06719970703125, 0.252685546875, 0.010009765625, 0.135009765625, 0.05499267578125, 0.178466796875, 0.1279296875, 0.07159423828125, 0.04864501953125, 0.14453125, 0.1...	embed
61481504_c0	61481504	prolog	0	Title: Variables appearing in the wrong order Problem title: Variables appearing in the wrong order Tags: prolog Problem: Variables appearing in the wrong order So, I am doing a Prolog question and am having issues with how it runs. the question asks for me to "Write a predicate myencode/2 that takes the uncompressed l...	Variables appearing in the wrong order Variables appearing in the wrong order prolog Variables myencode_modified Variables appearing in the wrong order So, I am doing a Prolog question and am having issues with how it runs. the question asks for me to "Write a predicate myencode/2 that takes the uncompressed list as a ...	[ 0.03173828125, -0.0072021484375, -0.0079345703125, 0.00518798828125, -0.01177978515625, 0.0142822265625, -0.0159912109375, 0.003997802734375, 0.005279541015625, 0.00836181640625, 0.021240234375, 0.01019287109375, -0.00022029876708984375, 0.0128173828125, -0.005645751953125, 0.013488769...	[ 111477, 13566, 108975, 214, 23, 44691, 12989, 502, 4867, 759, 33, 40899, 13415, 47314, 20594, 1250, 9655, 19441, 37348, 3642, 127877, 18781, 1653, 2063, 67, 12477, 51776, 51, 277, 11856, 5303, 237, 5117, 171859, 30646, 375, 127887, 17932, 4...	[ 0.215087890625, 0.15625, 0.1446533203125, 0.03729248046875, 0.06500244140625, 0.1640625, 0.2069091796875, 0.1480712890625, 0.2342529296875, 0.1268310546875, 0.1422119140625, 0.279541015625, 0.0889892578125, 0.0443115234375, 0.019622802734375, 0.1656494140625, 0.083984375, 0.0070495...	embed
47425949_c0	47425949	prolog	0	Title: Prolog: calculate index for a list of list Problem title: Prolog: calculate index for a list of list Tags: prolog Problem: Prolog: calculate index for a list of list I'm new to prolog. I want to implement a predict called high/3. This predict supports two scenarios: One is to return the index of one character in...	Prolog: calculate index for a list of list Prolog: calculate index for a list of list prolog Prolog Head Tail Prolog: calculate index for a list of list I'm new to prolog. I want to implement a predict called high/3. This predict supports two scenarios: One is to return the index of one character in a list of list, for...	[ 0.0078125, 0.00982666015625, 0.005828857421875, -0.00994873046875, -0.009033203125, -0.005096435546875, 0.004486083984375, 0.0002880096435546875, 0.020263671875, -0.01708984375, 0.0208740234375, -0.0242919921875, -0.006317138671875, 0.01385498046875, 0, -0.0068359375, 0.0419921875, ...	[ 1250, 4867, 74481, 67, 63262, 100, 5303, 111, 502, 44816, 1218, 379, 3525, 3444, 29479, 92054, 35839, 11192, 18113, 8060, 6626, 106117, 30646, 1632, 62816, 17932, 22691, 5608, 756, 124850, 19069, 80581, 3293, 4734, 43240, 5117, 4488, 155965, ...	[ 0.168701171875, 0.2220458984375, 0.2171630859375, 0.072509765625, 0.280517578125, 0.1142578125, 0.199462890625, 0.055145263671875, 0.130126953125, 0.06207275390625, 0.08203125, 0.0762939453125, 0.039947509765625, 0.0265655517578125, 0.11767578125, 0.235107421875, 0.01092529296875, ...	embed
23015420_c0	23015420	prolog	0	Title: Is there any tool that can automatically generate Prolog callable interface from C functions? Problem title: Is there any tool that can automatically generate Prolog callable interface from C functions? Tags: gnu-prolog, prolog Problem: Is there any tool that can automatically generate Prolog callable interface ...	Is there any tool that can automatically generate Prolog callable interface from C functions? Is there any tool that can automatically generate Prolog callable interface from C functions? gnu-prolog prolog C Prolog gprolog.h PlBool add_interface Is there any tool that can automatically generate Prolog callable interfac...	[ 0.0294189453125, 0.0213623046875, -0.0019989013671875, 0.0002956390380859375, -0.01214599609375, 0.01202392578125, -0.0025177001953125, -0.01171875, 0.0086669921875, -0.07275390625, -0.00811767578125, 0.005584716796875, -0.038330078125, -0.0036163330078125, 0.022705078125, -0.025268554...	[ 2499, 55516, 450, 831, 191082, 139392, 1250, 4867, 11782, 2886, 101758, 1295, 313, 32354, 104155, 3454, 502, 127, 29016, 12647, 929, 15190, 10433, 40404, 2685, 198343, 17368, 21334, 14012, 165132, 10752, 27781, 3444, 18151, 3871, 28282, 184017,...	[ 0.0701904296875, 0.258056640625, 0.0240478515625, 0.076416015625, 0.2313232421875, 0.2119140625, 0.192626953125, 0.265625, 0.1778564453125, 0.149658203125, 0.250732421875, 0.1097412109375, 0.169921875, 0.2076416015625, 0.1304931640625, 0.1419677734375, 0.121826171875, 0.08154296875...	embed
47983744_c0	47983744	prolog	0	Title: Show only differences in statements Problem title: Show only differences in statements Tags: prolog Problem: Show only differences in statements reservation("8V32EU", "John", "Doe", "27B", "YYZ", "CPH", "SAS"). reservation("8V32EU2", "Jane", "Doe", "27B", "YYZ", "CPH", "SAS"). reservation("94ISCU", "John", "Doe"...	Show only differences in statements Show only differences in statements prolog Show John Doe YYZ CPH SAS Jane FDSDD3 ROU double_reservations BookingCode SeatNo Fname Lname Show only differences in statements Say I have these statements. There was a glitch and John and Jane booked the same seat on the same flight. (firs...	[ 0.0172119140625, -0.0015106201171875, 0.0079345703125, -0.01092529296875, 0.03271484375, 0.0027923583984375, -0.01263427734375, 0.006988525390625, 0.0167236328125, -0.01483154296875, -0.013671875, 0.0034637451171875, 0.002166748046875, 0.00433349609375, 0.00274658203125, 0.014709472656...	[ 17367, 4734, 60212, 7, 23, 63805, 502, 4867, 4939, 984, 13, 108354, 1511, 54259, 105082, 48511, 24057, 363, 627, 32616, 41929, 107, 65756, 52722, 114211, 503, 257, 5021, 11627, 339, 87, 765, 6097, 1978, 18, 206, 136, 12877, 5701, 40, 11...	[ 0.1590576171875, 0.1622314453125, 0.2200927734375, 0.108154296875, 0.119384765625, 0.236572265625, 0.121826171875, 0.1639404296875, 0.1898193359375, 0.1309814453125, 0.117431640625, 0.06939697265625, 0.066162109375, 0.1085205078125, 0.1436767578125, 0.2158203125, 0.042938232421875, ...	embed
60591072_c1	60591072	prolog	1	seems to make us write: setof(Ax, (..., subset(MovAx, MovIn)) , ActOut). Develop the ... ... setof(Ax, ( setof(Mx,starsin(Mx,Ax),MovAx) , subset(MovIn, MovAx) ) , ActOut). This seems to be it already! The feel when there are λ Expressions but there is no λ on the keyboard or in the syntax. Done! Wrap up into predicate...	seems to make us write: setof(Ax, (..., subset(MovAx, MovIn)) , ActOut). Develop the ... ... setof(Ax, ( setof(Mx,starsin(Mx,Ax),MovAx) , subset(MovIn, MovAx) ) , ActOut). This seems to be it already! The feel when there are λ Expressions but there is no λ on the keyboard or in the syntax. Done! Wrap up into predicate...	[ -0.008056640625, -0.01171875, 0.042236328125, 0.00628662109375, -0.0093994140625, 0.018310546875, -0.00518798828125, 0.0263671875, 0.01409912109375, -0.01171875, 0.0162353515625, 0.01470947265625, 0.021728515625, 0.0166015625, 0, 0.0166015625, 0.00142669677734375, -0.01116943359375...	[ 37202, 3249, 1821, 33022, 5423, 4390, 132, 284, 425, 1614, 3509, 594, 515, 276, 4153, 25515, 79858, 219065, 5613, 1596, 21771, 12319, 3229, 2685, 111147, 25129, 17514, 1284, 110, 149186, 6002, 86531, 13631, 2063, 39329, 7, 11, 7340, 101098,...	[ 0.0657958984375, 0.030364990234375, 0.025482177734375, 0.130859375, 0.164794921875, 0.2607421875, 0.00225830078125, 0.0677490234375, 0.1429443359375, 0.1461181640625, 0.1627197265625, 0.0159454345703125, 0.1485595703125, 0.007049560546875, 0.1654052734375, 0.14111328125, 0.2359619140...	embed
60700448_c0	60700448	prolog	0	Title: Prolog, given N and find all numbers not divisible by 3 and 5 and these numbers must be smaller than N Problem title: Prolog, given N and find all numbers not divisible by 3 and 5 and these numbers must be smaller than N Tags: division, prolog Problem: Prolog, given N and find all numbers not divisible by 3 and ...	Prolog, given N and find all numbers not divisible by 3 and 5 and these numbers must be smaller than N Prolog, given N and find all numbers not divisible by 3 and 5 and these numbers must be smaller than N division prolog Prolog Num Here Rank Num1 Prolog, given N and find all numbers not divisible by 3 and 5 and these ...	[ -0.025390625, -0.0011749267578125, 0.020263671875, -0.0115966796875, -0.01263427734375, 0.015869140625, -0.007293701171875, 0.0152587890625, 0.01300048828125, -0.0225830078125, -0.003662109375, -0.00897216796875, 0.0184326171875, -0.006927490234375, 0.006805419921875, 0.000307083129882...	[ 1250, 4867, 34475, 541, 7413, 756, 101935, 959, 45, 99017, 390, 138, 136, 190, 8110, 186, 164917, 3501, 91853, 502, 52782, 11853, 134405, 418, 2967, 29806, 47, 803, 12477, 1653, 2063, 67, 160477, 14012, 83, 5303, 45367, 103332, 4426, 621,...	[ 0.1844482421875, 0.2296142578125, 0.061279296875, 0.1461181640625, 0.144775390625, 0.03399658203125, 0.1495361328125, 0.1192626953125, 0.09747314453125, 0.2392578125, 0.052642822265625, 0.1328125, 0.10223388671875, 0.123291015625, 0.01812744140625, 0.003021240234375, 0.144287109375, ...	embed
26466829_c0	26466829	prolog	0	Title: Prolog - List elements in a list of lists Problem title: Prolog - List elements in a list of lists Tags: prolog Problem: Prolog - List elements in a list of lists I have a list and a list of lists: A = [1,2,4,5] L = [[1,2,5],[3,4,5]] If A contains the same elements as one of the lists, I want it to return true. ...	Prolog - List elements in a list of lists Prolog - List elements in a list of lists prolog Prolog List have_common_element Prolog - List elements in a list of lists I have a list and a list of lists: If A contains the same elements as one of the lists, I want it to return true. As A contains the same elements (1,2,5) a...	[ -0.0137939453125, 0.0084228515625, 0.00994873046875, 0.0174560546875, -0.0211181640625, 0.01275634765625, 0.00106048583984375, -0.01019287109375, 0.001800537109375, -0.032470703125, 0.0272216796875, 0.03125, 0.021728515625, 0.0091552734375, -0.01123046875, 0.0002613067626953125, 0.02...	[ 1250, 4867, 32036, 80854, 23, 5303, 111, 502, 765, 277, 3796, 62766, 4263, 62, 70541, 5701, 237, 1632, 3444, 47, 30646, 29568, 71928, 5117, 339, 12830, 18, 24941, 1653, 2063, 1636, 86869, 25632, 41, 1294, 98320, 28219, 3971, 34844, 65042,...	[ 0.1773681640625, 0.24609375, 0.182861328125, 0.2088623046875, 0.05950927734375, 0.2076416015625, 0.0633544921875, 0.1451416015625, 0.119140625, 0.11279296875, 0.1796875, 0.209228515625, 0.037445068359375, 0.0947265625, 0.13525390625, 0.1591796875, 0.0572509765625, 0.024444580078125...	embed
52420184_c0	52420184	prolog	0	Title: Prolog exercise with factorisation Problem title: Prolog exercise with factorisation Tags: prime-factoring, prolog Problem: Prolog exercise with factorisation I am currently studying Artificial Intelligence in the Netherlands. We've had some introductions about Prolog which were very simple and understandable, b...	Prolog exercise with factorisation Prolog exercise with factorisation prime-factoring prolog Prolog Yes Result Prolog exercise with factorisation I am currently studying Artificial Intelligence in the Netherlands. We've had some introductions about Prolog which were very simple and understandable, but the exercises we ...	[ 0.005126953125, 0.00433349609375, 0.00982666015625, 0.01611328125, -0.0001316070556640625, 0.0159912109375, -0.004547119140625, -0.000247955322265625, 0.0062255859375, -0.0281982421875, 0.0076904296875, -0.0081787109375, -0.0189208984375, 0.00653076171875, -0.01129150390625, -0.0032653...	[ 1250, 4867, 81979, 678, 31461, 15032, 20809, 144810, 502, 32635, 126684, 82424, 35187, 214, 231996, 157075, 23, 231118, 39864, 3542, 4552, 8781, 28219, 54, 10176, 1286, 34844, 2301, 18, 89554, 190, 43652, 176256, 5122, 5868, 3642, 86869, 903,...	[ 0.1849365234375, 0.272705078125, 0.218017578125, 0.093505859375, 0.21240234375, 0.1429443359375, 0.133056640625, 0.19287109375, 0.1455078125, 0.1624755859375, 0.18603515625, 0.024261474609375, 0.053619384765625, 0.0235595703125, 0.1356201171875, 0.13623046875, 0.01031494140625, 0.1...	embed
61028457_c1	61028457	prolog	1	Back],L). :-end_tests(split_list). We run the above: ?- run_tests(split_list). % PL-Unit: split_list ....... [a,b,c,d,e,f,g,h,i,j,k,l] ==> [] a [b,c,d,e,f,g,h,i,j,k,l] [a,b,c,d,e,f,g,h,i,j,k,l] ==> [a] b [c,d,e,f,g,h,i,j,k,l] [a,b,c,d,e,f,g,h,i,j,k,l] ==> [a,b] c [d,e,f,g,h,i,j,k,l] [a,b,c,d,e,f,g,h,i,j,k,l] ==> [a,b,c...	Back],L). :-end_tests(split_list). We run the above: ?- run_tests(split_list). % PL-Unit: split_list ....... [a,b,c,d,e,f,g,h,i,j,k,l] ==> [] a [b,c,d,e,f,g,h,i,j,k,l] [a,b,c,d,e,f,g,h,i,j,k,l] ==> [a] b [c,d,e,f,g,h,i,j,k,l] [a,b,c,d,e,f,g,h,i,j,k,l] ==> [a,b] c [d,e,f,g,h,i,j,k,l] [a,b,c,d,e,f,g,h,i,j,k,l] ==> [a,b,c...	[ -0.0030059814453125, 0.021240234375, 0.00017452239990234375, -0.00002086162567138672, -0.0283203125, -0.005615234375, 0.0108642578125, 0.0054931640625, 0.0299072265625, 0.006683349609375, 0.005340576171875, 0.032470703125, 0.00106048583984375, 0.017822265625, 0.01953125, 0.004150390625...	[ 26828, 268, 866, 194, 15772, 3611, 6954, 7, 7008, 4353, 6562, 1401, 11675, 36917, 705, 9, 1745, 33106, 85600, 18, 65450, 454, 68024, 11, 4, 275, 238, 71, 13, 420, 177, 127, 14, 170, 92, 141, 6, 10, 2740, 876, 501, 104, 378, 69112,...	[ 0.2423095703125, 0.0230255126953125, 0.125, 0.033966064453125, 0.05950927734375, 0.1932373046875, 0.267578125, 0.10302734375, 0.1005859375, 0.24169921875, 0.254638671875, 0.0767822265625, 0.18994140625, 0.1632080078125, 0.0526123046875, 0.031951904296875, 0.13232421875, 0.207641601...	embed
14509723_c0	14509723	prolog	0	Title: Family relations prolog - distance Problem title: Family relations prolog - distance Tags: graph-theory, prolog, shortest-path Problem: Family relations prolog - distance Lets say I've got the following predicates: father(aaron, chloe). father(aaron, dan). father(aaron, emily). father(frank, george). mother(beth...	Family relations prolog - distance Family relations prolog - distance graph-theory prolog shortest-path Family not_in_list list_length travel_graph Path Next Family relations prolog - distance Lets say I've got the following predicates: I want to find the shortest route (distance) between two members of the family tree...	[ 0.025390625, 0.0152587890625, 0.00183868408203125, -0.00003933906555175781, -0.004547119140625, -0.01025390625, -0.013671875, -0.00537109375, -0.00144195556640625, -0.052978515625, -0.00201416015625, -0.0169677734375, -0.015625, 0.0224609375, 0.01409912109375, 0.003997802734375, 0.01...	[ 59745, 91582, 502, 4867, 62488, 41382, 2347, 30675, 16610, 525, 128405, 959, 73, 6562, 5303, 23986, 26983, 108421, 4997, 5154, 4163, 25632, 1653, 2063, 87, 3444, 47, 7413, 70, 36439, 56883, 329, 17721, 6626, 43032, 14449, 53201, 27863, 1105...	[ 0.179931640625, 0.1802978515625, 0.08734130859375, 0.1610107421875, 0.239990234375, 0.18896484375, 0.06427001953125, 0.05194091796875, 0.2095947265625, 0.1572265625, 0.16845703125, 0.0882568359375, 0.035614013671875, 0.1160888671875, 0.0943603515625, 0.0521240234375, 0.1561279296875,...	embed
22290028_c0	22290028	prolog	0	Title: Prolog recursivly build list based on dot product Problem title: Prolog recursivly build list based on dot product Tags: prolog Problem: Prolog recursivly build list based on dot product Hi I have a prolog function/predicate? that takes the dot product of two list. and would like to use it to write a function th...	Prolog recursivly build list based on dot product Prolog recursivly build list based on dot product prolog Prolog Head Tail Head2 Tail2 Result Prod Remaining What Prolog recursivly build list based on dot product Hi I have a prolog function/predicate? that takes the dot product of two list. and would like to use it to ...	[ 0.0093994140625, 0.0255126953125, -0.00311279296875, -0.00970458984375, -0.01953125, 0.01336669921875, -0.018310546875, 0.00836181640625, 0.00604248046875, -0.0196533203125, 0.00457763671875, -0.01116943359375, -0.0162353515625, -0.00041961669921875, -0.00689697265625, -0.01611328125, ...	[ 1250, 4867, 195625, 4371, 538, 45367, 5303, 35509, 98, 20633, 12996, 502, 44816, 1218, 379, 304, 126684, 71, 192, 32354, 19714, 2063, 51776, 6626, 1884, 4527, 33022, 38742, 1295, 35839, 12638, 35064, 43240, 81887, 35782, 11907, 6032, 9790, ...	[ 0.1796875, 0.259033203125, 0.23095703125, 0.146484375, 0.0164794921875, 0.203369140625, 0.2041015625, 0.120849609375, 0.0072021484375, 0.232177734375, 0.230712890625, 0.1439208984375, 0.109619140625, 0.06732177734375, 0.0501708984375, 0.073486328125, 0.1405029296875, 0.014389038085...	embed
58296162_c1	58296162	prolog	1	A,Ns],G), member(D,Ns). % doesnt_depend_on shows that node D doesnt have paths leading to it doesnt_depend_on(G, D) :- \+ depends_on(G, _, D). % removes node from a graph with the given value remove_graph_node([ [D,_] \| T], D, T). % base case -- FOUND IT return the tail only since we already popped it remove_graph_node...	A,Ns],G), member(D,Ns). % doesnt_depend_on shows that node D doesnt have paths leading to it doesnt_depend_on(G, D) :- \+ depends_on(G, _, D). % removes node from a graph with the given value remove_graph_node([ [D,_] \| T], D, T). % base case -- FOUND IT return the tail only since we already popped it remove_graph_node...	[ -0.01226806640625, 0.03369140625, 0.01300048828125, 0.01544189453125, -0.016357421875, 0.00946044921875, -0.031494140625, -0.01171875, 0.0020599365234375, -0.02197265625, 0.00946044921875, -0.0322265625, -0.01373291015625, 0.00897216796875, 0.003936767578125, -0.01007080078125, -0.00...	[ 62, 839, 724, 32786, 397, 1745, 22027, 18, 105254, 191, 45831, 110, 112, 391, 765, 60875, 105207, 1328, 56566, 7, 87388, 1295, 41382, 34292, 157, 384, 3647, 7225, 44944, 34384, 5959, 30646, 46741, 4734, 21771, 160, 572, 26973, 1218, 379, ...	[ 0.04345703125, 0.030670166015625, 0.08624267578125, 0.1749267578125, 0.050018310546875, 0.10186767578125, 0.08349609375, 0.0882568359375, 0.2108154296875, 0.152587890625, 0.0333251953125, 0.1585693359375, 0.07861328125, 0.1197509765625, 0.045501708984375, 0.1710205078125, 0.052337646...	embed
28424732_c0	28424732	prolog	0	Title: Prolog : Enumerate All Elements of Countably Infinite Results Problem title: Prolog : Enumerate All Elements of Countably Infinite Results Tags: prolog, logic-programming Problem: Prolog : Enumerate All Elements of Countably Infinite Results Are there any prolog implementations that are able to enumerate all ele...	Prolog : Enumerate All Elements of Countably Infinite Results Prolog : Enumerate All Elements of Countably Infinite Results prolog logic-programming Prolog Enumerate All Elements Countably Infinite Results nats.pl pair_of_nats GNU Daniel Diaz Copyright Prolog : Enumerate All Elements of Countably Infinite Results Are t...	[ 0.0208740234375, 0.002899169921875, 0.000934600830078125, 0.0155029296875, 0.0045166015625, 0.005462646484375, -0.0036773681640625, -0.010498046875, 0.001922607421875, -0.04736328125, 0.0196533203125, -0.0042724609375, -0.0166015625, -0.00054931640625, 0.0023956298828125, 0.00460815429...	[ 1250, 4867, 357, 15537, 17957, 3164, 48325, 108210, 78458, 134322, 13, 146104, 502, 62775, 28966, 24, 933, 2424, 80836, 4390, 7695, 165132, 11555, 4512, 169, 4189, 2499, 208124, 19048, 47, 189085, 756, 80854, 54529, 54241, 50339, 16916, 67, ...	[ 0.1844482421875, 0.2529296875, 0.02496337890625, 0.17333984375, 0.0966796875, 0.1390380859375, 0.1715087890625, 0.114501953125, 0.1602783203125, 0.13427734375, 0.035888671875, 0.17724609375, 0.20458984375, 0.0943603515625, 0.05908203125, 0.04730224609375, 0.048065185546875, 0.02600...	embed
50890491_c0	50890491	prolog	0	Title: what's the semantics of Prolog's implementation of negation with non-ground literals Problem title: what's the semantics of Prolog's implementation of negation with non-ground literals Tags: first-order-logic, negation, prolog Problem: what's the semantics of Prolog's implementation of negati...	what's the semantics of Prolog's implementation of negation with non-ground literals what's the semantics of Prolog's implementation of negation with non-ground literals first-order-logic negation prolog Prolog what's the semantics of Prolog's implementation of negation with non-ground literals I am...	[ 0.00653076171875, 0.01300048828125, -0.00384521484375, 0.01080322265625, -0.03076171875, 0.015380859375, 0.0120849609375, -0.00506591796875, -0.00090789794921875, -0.00116729736328125, 0.00445556640625, 0.0106201171875, -0.01324462890625, -0.0225830078125, 0.020263671875, 0.01495361328...	[ 3768, 484, 109109, 7, 1250, 4867, 208124, 108, 125682, 678, 351, 64330, 15659, 16765, 5117, 80596, 137043, 502, 2367, 111, 16031, 237, 353, 919, 82940, 46485, 21917, 24658, 61585, 90584, 121691, 70731, 13, 915, 132, 1542, 15772, 8096, 1723,...	[ 0.07147216796875, 0.1917724609375, 0.2095947265625, 0.048736572265625, 0.1943359375, 0.2353515625, 0.1768798828125, 0.1917724609375, 0.1832275390625, 0.12939453125, 0.1458740234375, 0.17431640625, 0.1522216796875, 0.0960693359375, 0.019927978515625, 0.114013671875, 0.09228515625, 0...	embed
36049910_c0	36049910	prolog	0	Title: Proper way to Declare and Search List in Prolog? Problem title: Proper way to Declare and Search List in Prolog? Tags: prolog Problem: Proper way to Declare and Search List in Prolog? I'm new to Prolog. Is it possible to "declare" a list as a fact in Prolog, and then access it easily? I'm working on a family-tre...	Proper way to Declare and Search List in Prolog? Proper way to Declare and Search List in Prolog? prolog Proper Declare Search List Prolog Facts Rules Member Proper way to Declare and Search List in Prolog? I'm new to Prolog. Is it possible to "declare" a list as a fact in Prolog, and then access it easily? I'm working...	[ 0.01953125, 0.01220703125, 0.018798828125, 0.01373291015625, -0.0234375, 0.00116729736328125, 0.0059814453125, -0.0034027099609375, 0.006866455078125, -0.026123046875, 0.01239013671875, -0.0198974609375, -0.00091552734375, 0.007080078125, 0.012939453125, 0.004547119140625, 0.02734375...	[ 1250, 1264, 3917, 25755, 38103, 136, 33086, 32036, 23, 4867, 47, 502, 132640, 139118, 74057, 3525, 7722, 50718, 5303, 237, 15824, 17203, 72546, 20697, 14449, 62600, 10644, 2967, 1884, 159978, 147306, 11280, 66165, 81551, 2806, 19048, 41, 1294...	[ 0.173828125, 0.1058349609375, 0.09429931640625, 0.169921875, 0.2064208984375, 0.1285400390625, 0.251708984375, 0.251708984375, 0.03546142578125, 0.261474609375, 0.0284881591796875, 0.09588623046875, 0.1417236328125, 0.1026611328125, 0.1705322265625, 0.032806396484375, 0.08349609375, ...	embed
64474263_c0	64474263	prolog	0	Title: how to randomly shuffle a list using Prolog? Problem title: how to randomly shuffle a list using Prolog? Tags: prolog Problem: how to randomly shuffle a list using Prolog? I have an predicate that produces a 52 length list of cards : ?- cards(CARDs) . CARDs = [2♣,2♦,2♠,2♥,3♣,3♦,3♠,3♥,4♣,4♦,4♠,4♥,5♣,5♦,5♠,5♥,6♣,6...	how to randomly shuffle a list using Prolog? how to randomly shuffle a list using Prolog? prolog Prolog CARDs NAME RANK SUIT prolog:atom_concat CARD prolog:bagof how to randomly shuffle a list using Prolog? I have an predicate that produces a 52 length list of cards : ... and now I want to randomly shuffle them . How c...	[ 0.00457763671875, 0.00994873046875, 0.0194091796875, -0.0157470703125, -0.005462646484375, -0.000255584716796875, -0.021484375, 0.006744384765625, 0.0019989013671875, -0.0267333984375, 0.0167236328125, 0.047119140625, -0.0169677734375, 0.0012664794921875, 0.0140380859375, -0.0015182495...	[ 3642, 47, 96759, 538, 170052, 5303, 17368, 1250, 4867, 32, 502, 313, 49444, 19400, 16817, 5928, 2271, 4460, 120968, 420, 10, 1653, 2063, 27489, 7221, 140909, 126381, 3444, 2856, 11249, 831, 142, 23, 11814, 222530, 202317, 10941, 98323, 3727...	[ 0.06500244140625, 0.0318603515625, 0.1983642578125, 0.051177978515625, 0.25537109375, 0.2265625, 0.09246826171875, 0.1754150390625, 0.2578125, 0.006317138671875, 0.08441162109375, 0.03076171875, 0.121826171875, 0.0396728515625, 0.0711669921875, 0.1168212890625, 0.01910400390625, 0....	embed
32478193_c0	32478193	prolog	0	Title: Using a constrained variable with `length/2` Problem title: Using a constrained variable with `length/2` Tags: clpfd, prolog Problem: Using a constrained variable with `length/2` Here is the problem: $ swipl Welcome to SWI-Prolog (Multi-threaded, 64 bits, Version 7.3.6-5-g5aeabd5) Copyright (c) 1990-2015 Univers...	Using a constrained variable with `length/2` Using a constrained variable with `length/2` clpfd prolog Using Welcome SWI-Prolog Multi-threaded Version g5aeabd5 Copyright University Amsterdam ABSOLUTELY WARRANTY Please www.swi-prolog.org Topic Word use_module _G1580 _G1583 _G1586 ERROR Out Using a constrained variable w...	[ -0.0059814453125, -0.0020599365234375, 0.002685546875, 0.001495361328125, 0.01416015625, 0.006591796875, -0.004730224609375, 0.01214599609375, 0.0069580078125, -0.06298828125, 0.0018768310546875, -0.017333984375, 0.00194549560546875, 0.008544921875, 0.023681640625, -0.0009918212890625,...	[ 345, 6953, 158, 9297, 122009, 77336, 678, 23986, 927, 12477, 33139, 39557, 71, 502, 4867, 91334, 159, 38969, 10752, 19335, 39116, 40647, 4189, 12535, 21391, 2452, 3454, 134912, 22543, 4527, 83279, 1837, 4836, 17168, 15276, 151206, 13538, 2967...	[ 0.10430908203125, 0.0279998779296875, 0.095703125, 0.1966552734375, 0.130615234375, 0.263671875, 0.065673828125, 0.1396484375, 0.1121826171875, 0.28564453125, 0.00994873046875, 0.048248291015625, 0.08099365234375, 0.09600830078125, 0.20703125, 0.1278076171875, 0.00421142578125, 0.1...	embed
57341339_c1	57341339	prolog	1	of data sets, and multiple alternative implementations of the graph and path modules (with the same interface, i.e., exported predicates). For the sake of the (small) example, let us assume we files data files data1.pl , data2.pl , helper predicate modules path1.pl , path2.pl , and algorithm modules graph1 , graph2.pl...	of data sets, and multiple alternative implementations of the graph and path modules (with the same interface, i.e., exported predicates). For the sake of the (small) example, let us assume we files data files data1.pl , data2.pl , helper predicate modules path1.pl , path2.pl , and algorithm modules graph1 , graph2.pl...	[ 0.01214599609375, 0.00872802734375, -0.000370025634765625, 0.013671875, -0.01202392578125, 0.0032196044921875, 0.0147705078125, -0.01214599609375, 0.0142822265625, -0.01806640625, -0.0162353515625, 0.019287109375, -0.01202392578125, 0.003509521484375, 0.004425048828125, -0.002716064453...	[ 111, 2053, 5423, 7, 48716, 30700, 208124, 6, 41382, 136, 60875, 88996, 70, 5701, 101758, 4, 5, 13, 31255, 297, 1653, 2063, 69070, 16, 27781, 102158, 2424, 5442, 4358, 56, 234873, 418, 3444, 11408, 134234, 6097, 159, 38969, 10752, 4867, ...	[ 0.046234130859375, 0.10302734375, 0.13330078125, 0.00750732421875, 0.0928955078125, 0.1451416015625, 0.1363525390625, 0.007415771484375, 0.1859130859375, 0.048828125, 0.1727294921875, 0.1995849609375, 0.00732421875, 0.0548095703125, 0.126220703125, 0.007354736328125, 0.00747680664062...	embed
8241182_c0	8241182	prolog	0	Title: Strange behaviour of unification pattern matching Problem title: Strange behaviour of unification pattern matching Tags: pattern-matching, unification, prolog Problem: Strange behaviour of unification pattern matching So here it is, for my sudoku project I have a list, such as : L = [_G1-0:0:0,_G19-0:6:2,_G22-0:...	Strange behaviour of unification pattern matching Strange behaviour of unification pattern matching pattern-matching unification prolog Strange _G1-0:0:0 _G19-0:6:2 _G22-0:7:2 _G25-0:8:2 _G1 _G19 _G22 _G25 remove_position X-_ Result X-_:_:_ Strange behaviour of unification pattern matching So here it is, for my sudoku ...	[ -0.0016021728515625, 0.02392578125, 0.012451171875, -0.0213623046875, -0.025390625, -0.027099609375, -0.01177978515625, 0.0211181640625, 0.0128173828125, 0.00811767578125, 0.0245361328125, 0.01287841796875, 0.01483154296875, -0.00872802734375, -0.012939453125, 0.008056640625, 0.01928...	[ 187791, 224833, 51, 41274, 103510, 14858, 98753, 502, 4867, 724, 180033, 53861, 2947, 23320, 910, 304, 203808, 2588, 1019, 418, 4015, 87388, 40322, 1193, 126684, 8932, 38067, 13452, 5303, 46312, 2046, 4092, 77336, 54397, 1653, 2063, 67, 15902...	[ 0.1956787109375, 0.146240234375, 0.147705078125, 0.1085205078125, 0.1986083984375, 0.185546875, 0.1575927734375, 0.1336669921875, 0.193359375, 0.049407958984375, 0.116455078125, 0.181640625, 0.153564453125, 0.090576171875, 0.067626953125, 0.05523681640625, 0.0787353515625, 0.161743...	embed
64951976_c0	64951976	prolog	0	Title: Retrieve elements from facts in Prolog Problem title: Retrieve elements from facts in Prolog Tags: prolog Problem: Retrieve elements from facts in Prolog I am currently learning Prolog for a class right now. I am using GNU Prolog to define a rule for example class_info(X,Y) and a similar rule, where X is the nam...	Retrieve elements from facts in Prolog Retrieve elements from facts in Prolog prolog facts Retrieve Prolog class_info exact_class Retrieve elements from facts in Prolog I am currently learning Prolog for a class right now. I am using GNU Prolog to define a rule for example class_info(X,Y) and a similar rule, where X is...	[ 0.01708984375, 0.002349853515625, -0.00012302398681640625, 0.0157470703125, -0.0137939453125, 0.031982421875, 0.000263214111328125, 0.0013580322265625, 0.0174560546875, -0.03369140625, -0.006378173828125, -0.01361083984375, -0.01287841796875, -0.01300048828125, -0.010009765625, 0.01477...	[ 200451, 80854, 1295, 15824, 7, 1250, 4867, 502, 18507, 7319, 24763, 67413, 82424, 52080, 100, 165132, 61924, 79986, 1723, 21373, 1193, 9351, 16030, 990, 140992, 3004, 4734, 3714, 3642, 30646, 144, 429, 2844, 125195, 23, 91736, 959, 1632, 36...	[ 0.20068359375, 0.18603515625, 0.1165771484375, 0.1932373046875, 0.07159423828125, 0.1746826171875, 0.2398681640625, 0.130615234375, 0.1724853515625, 0.1953125, 0.153564453125, 0.1729736328125, 0.001678466796875, 0.051116943359375, 0.017578125, 0.1239013671875, 0.08721923828125, 0.1...	embed
42455589_c0	42455589	prolog	0	Title: How to get all consecutive sublists/subsets in Prolog? Problem title: How to get all consecutive sublists/subsets in Prolog? Tags: prolog, sublist, substring, list Problem: How to get all consecutive sublists/subsets in Prolog? I would like to solve a simple problem, but even through I tried many different appro...	How to get all consecutive sublists/subsets in Prolog? How to get all consecutive sublists/subsets in Prolog? prolog sublist substring list How Prolog How to get all consecutive sublists/subsets in Prolog? I would like to solve a simple problem, but even through I tried many different approaches, I couldn't find a solu...	[ 0.003082275390625, -0.0074462890625, 0.00921630859375, 0.007293701171875, -0.0234375, 0.00628662109375, 0.008056640625, -0.0015411376953125, 0.01080322265625, -0.016357421875, 0.011474609375, 0.021240234375, -0.01129150390625, -0.00171661376953125, 0.000286102294921875, 0.0108032226562...	[ 11249, 2046, 756, 148390, 13, 1614, 6562, 22144, 3509, 23, 1250, 4867, 502, 91693, 5303, 47, 64, 86869, 2967, 29806, 159, 2143, 3444, 70541, 80854, 206846, 138, 201, 159029, 20505, 12477, 1653, 2063, 67, 627, 84751, 16750, 3206 ]	[ 0.03326416015625, 0.0965576171875, 0.131591796875, 0.21923828125, 0.0860595703125, 0.220947265625, 0.2391357421875, 0.1917724609375, 0.2203369140625, 0.050445556640625, 0.152587890625, 0.236083984375, 0.09228515625, 0.1177978515625, 0.13623046875, 0.0210723876953125, 0.006591796875, ...	embed
46512332_c0	46512332	prolog	0	Title: How to make a random list of a specific length without duplicates in prolog? Problem title: How to make a random list of a specific length without duplicates in prolog? Tags: prolog Problem: How to make a random list of a specific length without duplicates in prolog? I'm trying to write a predicate randomnames/1...	How to make a random list of a specific length without duplicates in prolog? How to make a random list of a specific length without duplicates in prolog? prolog How Mary Pat James Bob Susan random_name Name random_names How to make a random list of a specific length without duplicates in prolog? I'm trying to write a p...	[ 0.01904296875, 0.00714111328125, 0.0206298828125, -0.0027923583984375, -0.00958251953125, 0.01953125, -0.005950927734375, 0.000751495361328125, 0.00799560546875, -0.049560546875, -0.0098876953125, -0.0012664794921875, 0.005615234375, 0.0152587890625, 0.01336669921875, 0.01324462890625,...	[ 11249, 47, 3249, 96759, 5303, 29458, 140909, 15490, 171763, 1636, 23, 502, 4867, 23213, 9876, 14631, 25027, 67243, 11627, 15757, 10, 31577, 33022, 1653, 2063, 67, 11583, 139392, 17262, 12921, 123055, 63399, 21771, 1632, 9351, 2046, 42459, 296...	[ 0.062255859375, 0.0037841796875, 0.1087646484375, 0.2139892578125, 0.22802734375, 0.1983642578125, 0.1710205078125, 0.1351318359375, 0.21630859375, 0.09521484375, 0.035400390625, 0.16357421875, 0.214111328125, 0.0733642578125, 0.068603515625, 0.08770751953125, 0.068359375, 0.118652...	embed
65103935_c1	65103935	prolog	1	' or 'right' like ['up', 'up', 'right', 'right']) that should be taken to reach the end point location of the 10X10 grid [10, 10]. Below is an example Query of how this path predicate would give proper output bindings for list of steps. path([4,4],X). This example query above should return all the possible bindings of ...	' or 'right' like ['up', 'up', 'right', 'right']) that should be taken to reach the end point location of the 10X10 grid [10, 10]. Below is an example Query of how this path predicate would give proper output bindings for list of steps. path([4,4],X). This example query above should return all the possible bindings of ...	[ 0.0079345703125, 0.034912109375, 0.002655029296875, -0.002166748046875, -0.002227783203125, 0.0303955078125, 0.0059814453125, -0.007568359375, 0.0081787109375, -0.02734375, 0.0023193359375, 0.02392578125, -0.012939453125, 0.005401611328125, -0.00579833984375, 0.0235595703125, 0.00665...	[ 242, 707, 54969, 1884, 2037, 25, 268, 5608, 39958, 47, 58359, 3564, 6275, 31913, 209, 1542, 963, 120067, 17336, 27781, 58836, 903, 60875, 1653, 2063, 67, 27798, 140992, 128239, 5303, 98441, 132, 124093, 41, 1294, 36917, 30646, 756, 7722, ...	[ 0.011474609375, 0.063232421875, 0.1900634765625, 0.07916259765625, 0.191650390625, 0.00048828125, 0.000457763671875, 0.09759521484375, 0.1142578125, 0.0204010009765625, 0.1688232421875, 0.1502685546875, 0.1571044921875, 0.1317138671875, 0.1402587890625, 0.1624755859375, 0.16650390625...	embed
23510109_c0	23510109	prolog	0	Title: When I add two number its giving me Sum is _G4080-_G4081 in Prolog Problem title: When I add two number its giving me Sum is _G4080-_G4081 in Prolog Tags: prolog Problem: When I add two number its giving me Sum is _G4080-_G4081 in Prolog I am summing two numbers in the code below, but the result is not what I ex...	When I add two number its giving me Sum is _G4080-_G4081 in Prolog When I add two number its giving me Sum is _G4080-_G4081 in Prolog prolog When Sum _G4080-_G4081 Prolog Enter Number What na.Add b.Subtract c.Multiply d.Divided e.Exit Answer Name a.Add _G5053 _G5054 When I add two number its giving me Sum is _G4080-_G4...	[ -0.00118255615234375, 0.005218505859375, 0.0126953125, 0.0281982421875, -0.018798828125, 0.021484375, -0.01104736328125, 0.01043701171875, 0.019775390625, -0.0164794921875, 0.01019287109375, 0.00122833251953125, -0.02197265625, 0.01220703125, 0.01507568359375, 0.00921630859375, 0.020...	[ 15190, 6626, 14012, 6863, 68772, 163, 36335, 724, 2839, 4836, 13556, 1250, 4867, 83, 502, 60816, 103332, 24, 4028, 39989, 118, 14055, 5518, 19279, 130373, 2525, 14226, 12338, 166, 58838, 101935, 18151, 16750, 959, 84751, 6183, 44691, 126684, ...	[ 0.1871337890625, 0.1856689453125, 0.189697265625, 0.07781982421875, 0.08251953125, 0.037567138671875, 0.25439453125, 0.05279541015625, 0.1422119140625, 0.2279052734375, 0.2254638671875, 0.1409912109375, 0.2178955078125, 0.04180908203125, 0.113037109375, 0.1190185546875, 0.119140625, ...	embed
52122727_c0	52122727	prolog	0	Title: Solve dynamic programming in Prolog via corecursion Problem title: Solve dynamic programming in Prolog via corecursion Tags: prolog, dynamic-programming, corecursion Problem: Solve dynamic programming in Prolog via corecursion I would like to solve the following dynamic programming problem via corecursion in Pro...	Solve dynamic programming in Prolog via corecursion Solve dynamic programming in Prolog via corecursion prolog dynamic-programming corecursion Solve Prolog N-1 Solve dynamic programming in Prolog via corecursion I would like to solve the following dynamic programming problem via corecursion in Prolog. But I am stuck in...	[ 0.004364013671875, 0.007110595703125, 0.00848388671875, 0.018798828125, 0.00171661376953125, 0.007568359375, 0.00165557861328125, 0.02783203125, 0.0069580078125, -0.052001953125, -0.000621795654296875, -0.0189208984375, -0.0189208984375, 0.02490234375, 0.020751953125, -0.0152587890625,...	[ 6678, 84079, 56037, 449, 1250, 4867, 1829, 56458, 48650, 1830, 502, 28966, 5759, 1884, 86869, 25632, 2967, 179933, 179967, 927, 5117, 33938, 29479, 16106, 54543, 21771, 68872, 21, 3285, 5303, 18811, 42856, 170224, 313, 831, 35839, 11180, 1938...	[ 0.10986328125, 0.22900390625, 0.1583251953125, 0.0249481201171875, 0.150146484375, 0.2467041015625, 0.09039306640625, 0.131103515625, 0.2152099609375, 0.08563232421875, 0.126953125, 0.1273193359375, 0.052764892578125, 0.016754150390625, 0.1285400390625, 0.008026123046875, 0.134765625...	embed
17300046_c0	17300046	prolog	0	Title: Automatic theorem proving Problem title: Automatic theorem proving Tags: theorem-proving, prolog Problem: Automatic theorem proving I'm looking for an automatic theorem proving system, which can prove this: Crocodile took mans child. Man asked crocodile not to eat his child. But Crocodile said: I'll return your ...	Automatic theorem proving Automatic theorem proving theorem-proving prolog Automatic XOR Automatic theorem proving I'm looking for an automatic theorem proving system, which can prove this: Crocodile took mans child. Man asked crocodile not to eat his child. But Crocodile said: I'll return your child to you, if you wil...	[ 0.033935546875, 0.02978515625, -0.0040283203125, 0.014404296875, -0.018798828125, 0.0084228515625, -0.005157470703125, 0.0174560546875, -0.0120849609375, -0.022216796875, 0.006378173828125, 0.02734375, -0.01806640625, 0.01470947265625, 0.00946044921875, 0.00421142578125, 0.0016174316...	[ 51719, 1771, 70, 58391, 502, 6496, 70628, 4867, 1193, 24638, 16487, 100, 142, 101038, 5426, 23534, 903, 164098, 15663, 133, 34739, 36679, 29041, 1572, 37170, 99546, 959, 73203, 1919, 2804, 87, 1181, 30646, 935, 398, 2174, 163, 2367, 444, ...	[ 0.218505859375, 0.0684814453125, 0.07427978515625, 0.201904296875, 0.15380859375, 0.07061767578125, 0.159423828125, 0.135498046875, 0.056182861328125, 0.2109375, 0.0621337890625, 0.023406982421875, 0.0177154541015625, 0.256103515625, 0.1519775390625, 0.1717529296875, 0.02694702148437...	embed
40706855_c0	40706855	prolog	0	Title: Prolog '==' operator is not working? Problem title: Prolog '==' operator is not working? Tags: prolog Problem: Prolog '==' operator is not working? I made a function which calculates vector length and 2D array size. Below is the function. I am using swi-prolog : foo(LIST) :- listLength(LIST, ...	Prolog '==' operator is not working? Prolog '==' operator is not working? prolog Prolog LIST COUNT1 COUNT2 Prolog '==' operator is not working? I made a function which calculates vector length and 2D array size. Below is the function. I am using swi-prolog : Yes, I deliberately exclude detailed list...	[ 0.0113525390625, 0.005615234375, -0.012939453125, 0.021728515625, -0.006927490234375, -0.013427734375, -0.015380859375, 0.0196533203125, 0.014404296875, -0.007049560546875, 0.0252685546875, 0.00141143798828125, 0.0036773681640625, 0.0078125, -0.00946044921875, -0.0228271484375, 0.000...	[ 1250, 4867, 3768, 74, 69112, 39933, 959, 20697, 502, 195977, 8244, 64163, 418, 304, 83, 32354, 74481, 173, 18770, 140909, 116, 397, 10298, 53, 13267, 873, 17336, 17368, 91, 2452, 3454, 91755, 39041, 185688, 5303, 449, 6626, 62051, 7092, 2...	[ 0.176513671875, 0.267822265625, 0.0968017578125, 0.023040771484375, 0.267333984375, 0.24169921875, 0.095703125, 0.1573486328125, 0.1324462890625, 0.171875, 0.06158447265625, 0.15771484375, 0.083251953125, 0.174072265625, 0.006683349609375, 0.1693115234375, 0.1436767578125, 0.127075...	embed
26029464_c0	26029464	prolog	0	Title: How to represent uniqueness? Problem title: How to represent uniqueness? Tags: prolog Problem: How to represent uniqueness? I am trying to write an agent for determining what card a player has, and I am struggling to represent that each card can only have been dealt to a single player. So have I have something^ ...	How to represent uniqueness? How to represent uniqueness? prolog How has_card ERROR Arithmetic player1 How to represent uniqueness? I am trying to write an agent for determining what card a player has, and I am struggling to represent that each card can only have been dealt to a single player. So have I have something^...	[ 0.0020904541015625, 0.0205078125, 0.0274658203125, 0.004974365234375, 0.01220703125, -0.009765625, -0.01318359375, -0.0130615234375, 0.002899169921875, -0.042724609375, -0.0196533203125, 0.02197265625, 0.01470947265625, 0.006317138671875, -0.00982666015625, -0.00103759765625, -0.0054...	[ 11249, 47, 33636, 36998, 7432, 502, 4867, 1556, 38931, 151206, 24638, 8962, 282, 9523, 58585, 418, 31577, 33022, 23882, 72694, 214, 20596, 237875, 12638, 831, 4734, 765, 8, 7010, 11001, 32562, 79986, 100, 15555, 62775, 18507, 21208, 13204, ...	[ 0.1239013671875, 0.06573486328125, 0.29931640625, 0.26904296875, 0.204345703125, 0.09844970703125, 0.1319580078125, 0.162841796875, 0.2236328125, 0.1455078125, 0.09619140625, 0.1256103515625, 0.040313720703125, 0.01190185546875, 0.147705078125, 0.0106201171875, 0.0223388671875, 0.0...	embed
33834168_c0	33834168	prolog	0	Title: prolog intersection find a common list of four friend and restaurant menu list Problem title: prolog intersection find a common list of four friend and restaurant menu list Tags: prolog Problem: prolog intersection find a common list of four friend and restaurant menu list Hi I want to make a pro-log program. th...	prolog intersection find a common list of four friend and restaurant menu list prolog intersection find a common list of four friend and restaurant menu list prolog chop_suey prolog intersection find a common list of four friend and restaurant menu list Hi I want to make a pro-log program. there is four friend they hav...	[ -0.00075531005859375, -0.00677490234375, 0.0037689208984375, 0.031982421875, 0.00017833709716796875, 0.0001277923583984375, -0.0194091796875, -0.0025482177734375, -0.005889892578125, -0.033203125, -0.00396728515625, 0.0057373046875, 0.0019683837890625, -0.01031494140625, 0.0218505859375,...	[ 502, 4867, 1940, 7, 58994, 7413, 39210, 5303, 111, 22759, 34391, 136, 17666, 8026, 82335, 1159, 7460, 3444, 3249, 1528, 10002, 15381, 1884, 738, 73, 7639, 9790, 5895, 110, 29806 ]	[ 0.161376953125, 0.1988525390625, 0.1363525390625, 0.146484375, 0.09075927734375, 0.1207275390625, 0.189453125, 0.188720703125, 0.0228271484375, 0.209716796875, 0.17822265625, 0.0968017578125, 0.16259765625, 0.2008056640625, 0.1304931640625, 0.06982421875, 0.1107177734375, 0.0042114...	embed
6214266_c0	6214266	prolog	0	Title: Ordering lists with constraint logic programming Problem title: Ordering lists with constraint logic programming Tags: prolog, list, constraint-programming Problem: Ordering lists with constraint logic programming I was wondering if anyone could help me with this problem: I have to order a list using Prolog with...	Ordering lists with constraint logic programming Ordering lists with constraint logic programming prolog list constraint-programming Ordering same_length Permutation Ordering lists with constraint logic programming I was wondering if anyone could help me with this problem: I have to order a list using Prolog with Const...	[ 0.01470947265625, 0.006439208984375, 0.016845703125, 0.0014495849609375, 0.01055908203125, 0.0003833770751953125, -0.0164794921875, -0.01171875, 0.02099609375, -0.047607421875, 0.006072998046875, 0.0086669921875, 0.0032196044921875, -0.0130615234375, -0.01214599609375, 0.00909423828125...	[ 81206, 214, 5303, 678, 158, 2816, 4288, 62775, 56037, 502, 4867, 28966, 5701, 23986, 561, 149016, 35672, 5809, 4358, 2967, 765, 12989, 10, 17368, 1250, 1657, 50592, 238, 27958, 8110, 54, 1286, 93766, 3917, 831, 5201, 1653, 2063, 67, 61924...	[ 0.226806640625, 0.106689453125, 0.198974609375, 0.10064697265625, 0.081787109375, 0.2210693359375, 0.1044921875, 0.1455078125, 0.1212158203125, 0.1295166015625, 0.255126953125, 0.1253662109375, 0.070068359375, 0.0653076171875, 0.10272216796875, 0.0552978515625, 0.016143798828125, 0...	embed
64938512_c0	64938512	prolog	0	Title: Prolog finding max of list with two values Problem title: Prolog finding max of list with two values Tags: prolog Problem: Prolog finding max of list with two values So I am using prolog and i Have a funcntion like this: ratingList(X):-goalKeeperRating(X,A),centreForwardRating(X,B),secondStrikerRating(X,C),centr...	Prolog finding max of list with two values Prolog finding max of list with two values prolog Prolog Best Position Prolog finding max of list with two values So I am using prolog and i Have a funcntion like this: Basically the first line finds numbers and put it in the second element, then we put numbers in a list (Y). ...	[ 0.03125, -0.0152587890625, 0.01019287109375, 0.0147705078125, -0.0081787109375, 0.026123046875, -0.0002727508544921875, 0.0096435546875, 0.0016632080078125, -0.01409912109375, 0.0169677734375, 0.00921630859375, -0.0050048828125, -0.030517578125, 0.02197265625, 0.003692626953125, -0.0...	[ 1250, 4867, 90791, 18389, 111, 5303, 678, 6626, 142424, 502, 11345, 99428, 17368, 7477, 5117, 13315, 7413, 101935, 3884, 17932, 12830, 1723, 171581, 990, 140909, 116, 38887, 3443, 19069, 9351, 1001, 14012, 9920, 154663, 70, 142555, 2606, 3334...	[ 0.14892578125, 0.215087890625, 0.0753173828125, 0.213623046875, 0.0775146484375, 0.178955078125, 0.030975341796875, 0.139404296875, 0.1534423828125, 0.1038818359375, 0.0845947265625, 0.1751708984375, 0.043365478515625, 0.03521728515625, 0.02911376953125, 0.09716796875, 0.101684570312...	embed
13612591_c0	13612591	prolog	0	Title: PROLOG- occurrences of subsequence into a number Problem title: PROLOG- occurrences of subsequence into a number Tags: prolog Problem: PROLOG- occurrences of subsequence into a number Using Prolog language, I need to find out the number of occurrences of a sub-sequence in a number. I tried to count occurrences o...	PROLOG- occurrences of subsequence into a number PROLOG- occurrences of subsequence into a number prolog PROLOG word_freq Freq word_count Total Match TotSoFar Tot MatchSoFar read_word SoFar end_of_file get_code code_type PROLOG- occurrences of subsequence into a number I tried to count occurrences of a word in a big te...	[ 0.01953125, -0.0012359619140625, -0.00006151199340820312, 0.00433349609375, -0.006378173828125, -0.01397705078125, -0.00408935546875, -0.006134033203125, 0.00555419921875, -0.0296630859375, -0.0030059814453125, -0.00182342529296875, 0.00103759765625, 0.01312255859375, 0.01953125, -0.01...	[ 10514, 47510, 74918, 42, 69098, 111, 1614, 184, 944, 3956, 3934, 14012, 502, 4867, 2565, 12176, 864, 21612, 71013, 33867, 67407, 13715, 8912, 80908, 12301, 47416, 1061, 3564, 4390, 29822, 2046, 40899, 18151, 50986, 37842, 54529, 6957, 7986, ...	[ 0.18115234375, 0.234375, 0.1822509765625, 0.1337890625, 0.09033203125, 0.040283203125, 0.134765625, 0.1326904296875, 0.1590576171875, 0.0192718505859375, 0.1146240234375, 0.155517578125, 0.156982421875, 0.205810546875, 0.1927490234375, 0.16357421875, 0.0148162841796875, 0.163452148...	embed
8712804_c1	8712804	prolog	1	I want, but I get it two times and there are some other things attached. When dividing into 3 parts things get worse: ?- partition(3, [1,2,3,4], List). List = [[1], [2, 3, 4], [2], [3, 4], 2] ; List = [[1], [2, 3, 4], [2], [3, 4], 3, 4] ; List = [[1], [2, 3, 4], [2, 3], [4], 2, 3] ; List = [[1], [2, 3, 4], [2, 3], [4]...	I want, but I get it two times and there are some other things attached. When dividing into 3 parts things get worse: ?- partition(3, [1,2,3,4], List). List = [[1], [2, 3, 4], [2], [3, 4], 2] ; List = [[1], [2, 3, 4], [2], [3, 4], 3, 4] ; List = [[1], [2, 3, 4], [2, 3], [4], 2, 3] ; List = [[1], [2, 3, 4], [2, 3], [4]...	[ -0.031982421875, 0.00958251953125, 0.0174560546875, -0.0025634765625, -0.0164794921875, 0.0125732421875, -0.01123046875, -0.01483154296875, 0.01165771484375, 0.01141357421875, -0.006317138671875, 0.007232666015625, 0.005035400390625, 0.0025634765625, 0.006744384765625, -0.0073547363281...	[ 3444, 1284, 2046, 442, 6626, 20028, 3789, 8966, 220642, 14847, 61998, 449, 3934, 138, 63920, 124632, 705, 9, 2878, 1363, 86827, 133063, 82449, 268, 32036, 2203, 25256, 4, 304, 201, 33579, 122101, 116, 2819, 378, 59535, 17550, 106, 110558, ...	[ 0.19482421875, 0.0740966796875, 0.087158203125, 0.0703125, 0.1231689453125, 0.1749267578125, 0.0182342529296875, 0.062408447265625, 0.13916015625, 0.02923583984375, 0.2064208984375, 0.07733154296875, 0.12158203125, 0.16943359375, 0.211181640625, 0.2159423828125, 0.04620361328125, 0...	embed
64516819_c0	64516819	prolog	0	Title: Prolog: find a path from root tree node to a specified node Problem title: Prolog: find a path from root tree node to a specified node Tags: tree, prolog Problem: Prolog: find a path from root tree node to a specified node I have a tree for example like this: root(atom). node(atom, [cactus, butter]). node(butter...	Prolog: find a path from root tree node to a specified node Prolog: find a path from root tree node to a specified node tree prolog root Prolog Start Destination Visited Nodes Node Path Prolog: find a path from root tree node to a specified node I have a tree for example like this: I would like to find a path for a spe...	[ 0.02587890625, 0.0234375, 0.0045166015625, 0.00113677978515625, 0.00958251953125, 0.02880859375, -0.01611328125, -0.01092529296875, -0.0093994140625, -0.0712890625, 0.01141357421875, -0.000021338462829589844, -0.0179443359375, 0.01220703125, 0.0159912109375, -0.0162353515625, 0.00668...	[ 1250, 4867, 7413, 60875, 1295, 74855, 53201, 110, 112, 47, 58735, 12, 502, 13794, 145778, 98684, 297, 438, 988, 108421, 10, 765, 27781, 903, 2806, 1884, 100, 29458, 831, 69307, 18151, 43240, 4734, 50336, 17368, 5117, 29041, 2046, 115839, ...	[ 0.17431640625, 0.2391357421875, 0.1588134765625, 0.2435302734375, 0.1112060546875, 0.184814453125, 0.202880859375, 0.17138671875, 0.15185546875, 0.1180419921875, 0.16064453125, 0.02105712890625, 0.123779296875, 0.110107421875, 0.15087890625, 0.1480712890625, 0.00531005859375, 0.135...	embed
47367008_c0	47367008	prolog	0	Title: Print minimize steps prolog Problem title: Print minimize steps prolog Tags: clpfd, eclipse-clp, prolog Problem: Print minimize steps prolog I'm working on a prolog program (CLPFD) with ECLiPSe 6.1. The program has a lot of variables and i want to minimize a certain value but (obviously) the minimization steps t...	Print minimize steps prolog Print minimize steps prolog clpfd eclipse-clp prolog Print Found Goal TimeLimit TimeOutGoal AllNodesList Result Print minimize steps prolog I'm working on a prolog program (CLPFD) with ECLiPSe 6.1. The program has a lot of variables and i want to minimize a certain value but (obviously) the ...	[ 0.00787353515625, -0.01129150390625, 0.01611328125, 0.000507354736328125, -0.007232666015625, 0.00628662109375, -0.00396728515625, -0.01904296875, 0.0047607421875, -0.0361328125, 0.00640869140625, -0.023681640625, -0.0186767578125, -0.0086669921875, 0.0140380859375, -0.0038909912109375...	[ 39754, 881, 77651, 98441, 502, 4867, 33139, 39557, 71, 106371, 184, 26775, 215624, 2016, 289, 19055, 866, 6836, 79858, 17903, 3164, 5021, 988, 154663, 126684, 20697, 1528, 37486, 41265, 397, 678, 59947, 9506, 9059, 13, 91532, 5915, 77336, 3...	[ 0.23193359375, 0.193359375, 0.21923828125, 0.257080078125, 0.1571044921875, 0.2281494140625, 0.026611328125, 0.064208984375, 0.0858154296875, 0.190673828125, 0.1153564453125, 0.11376953125, 0.1595458984375, 0.1533203125, 0.1072998046875, 0.115478515625, 0.10986328125, 0.14379882812...	embed
29834823_c1	29834823	prolog	1	_check_filtered(+LHS, +Idx, +IdxL, +RHS_L) try_check_filtered(_LHS, _Idx, [], _RHS_L) :- !. % Stop when index list is empty try_check_filtered(LHS, Idx, [Idx\|Ti], [H\|T]) :- !, % If at next index -> check try_check(LHS, H), Inext is Idx+1, try_check_filtered(LHS, Inext, Ti, T). try_check_filtered(LHS, Idx, IdxL, [_H\|T])...	_check_filtered(+LHS, +Idx, +IdxL, +RHS_L) try_check_filtered(_LHS, _Idx, [], _RHS_L) :- !. % Stop when index list is empty try_check_filtered(LHS, Idx, [Idx\|Ti], [H\|T]) :- !, % If at next index -> check try_check(LHS, H), Inext is Idx+1, try_check_filtered(LHS, Inext, Ti, T). try_check_filtered(LHS, Idx, IdxL, [_H\|T])...	[ 0.00360107421875, 0.00012493133544921875, 0.01214599609375, -0.003265380859375, -0.004608154296875, 0.00457763671875, -0.006072998046875, -0.01318359375, 0.023193359375, -0.0172119140625, 0.0140380859375, 0.0155029296875, -0.0128173828125, 0.0113525390625, -0.00167083740234375, 0.00375...	[ 78292, 120337, 297, 1328, 866, 38131, 997, 568, 71, 425, 1052, 9790, 711, 1745, 42284, 3229, 63262, 5303, 83, 201505, 24799, 16734, 841, 618, 11737, 12765, 572, 360, 3355, 18, 21748, 2371, 384, 21658, 3564, 68416, 294, 454, 6626, 17582, ...	[ 0.2401123046875, 0.2442626953125, 0.117431640625, 0.048370361328125, 0.123779296875, 0.1990966796875, 0.07958984375, 0.01629638671875, 0.05572509765625, 0.150390625, 0.047637939453125, 0.194580078125, 0.0245361328125, 0.039337158203125, 0.199951171875, 0.05877685546875, 0.16735839843...	embed
4187632_c0	4187632	prolog	0	Title: Fast reverse sort in (SWI) Prolog Problem title: Fast reverse sort in (SWI) Prolog Tags: prolog, sorting Problem: Fast reverse sort in (SWI) Prolog I'm looking for a fast way to sort a list in reverse order in Prolog. Algorithmically it should perform as quickly as standard sort, but the options that I've come u...	Fast reverse sort in (SWI) Prolog Fast reverse sort in (SWI) Prolog prolog sorting Fast SWI Prolog rsort1 Tmp rsort2 reverse_compare Delta Size test_list NsS CPU Lips Fast reverse sort in (SWI) Prolog I'm looking for a fast way to sort a list in reverse order in Prolog. Algorithmically it should perform as quickly as s...	[ -0.005645751953125, 0.01116943359375, 0.0111083984375, -0.0283203125, -0.01318359375, -0.01025390625, 0.006744384765625, 0.0023193359375, 0.00445556640625, -0.031005859375, 0.023193359375, 0.0546875, -0.01055908203125, -0.0059814453125, 0.02734375, -0.013427734375, -0.002822875976562...	[ 25290, 39531, 184, 12096, 23, 294, 38969, 1250, 4867, 502, 159, 1690, 62351, 418, 2676, 304, 277, 16082, 56588, 80378, 3034, 6562, 86039, 156903, 16487, 4271, 3917, 5303, 12989, 109847, 51339, 69405, 5570, 50717, 5045, 72803, 56, 7145, 2063...	[ 0.1510009765625, 0.243896484375, 0.199951171875, 0.219970703125, 0.0421142578125, 0.008880615234375, 0.1837158203125, 0.1422119140625, 0.213134765625, 0.090576171875, 0.0118408203125, 0.07049560546875, 0.244140625, 0.05279541015625, 0.1326904296875, 0.1422119140625, 0.02288818359375,...	embed
34440737_c0	34440737	prolog	0	Title: Time complexity of Prolog better than naive brute force? Problem title: Time complexity of Prolog better than naive brute force? Tags: prolog, c, scheme Problem: Time complexity of Prolog better than naive brute force? Is the time complexity of solving anything in (the best) Prolog better than a naive brute forc...	Time complexity of Prolog better than naive brute force? Time complexity of Prolog better than naive brute force? prolog c scheme Time Prolog Time complexity of Prolog better than naive brute force? Is the time complexity of solving anything in (the best) Prolog better than a naive brute force backtracking implementati...	[ 0.0106201171875, 0.0185546875, 0.01361083984375, -0.0031280517578125, -0.004180908203125, -0.00811767578125, 0.00726318359375, -0.017578125, 0.00157928466796875, -0.054931640625, 0.0028839111328125, 0.00689697265625, -0.00634765625, 0.01263427734375, 0.004852294921875, 0.00283813476562...	[ 19055, 27140, 2481, 111, 1250, 4867, 11522, 3501, 24, 5844, 55042, 13, 37772, 502, 501, 150370, 2071, 1733, 3115, 6496, 23937, 23, 2965, 4420, 125728, 214, 208124, 5154, 46876, 137567, 149016, 51529, 234873, 246, 17368, 11782, 10060, 34702, ...	[ 0.1572265625, 0.220458984375, 0.0975341796875, 0.004974365234375, 0.2032470703125, 0.28271484375, 0.18115234375, 0.0537109375, 0.1119384765625, 0.1300048828125, 0.1536865234375, 0.010345458984375, 0.1673583984375, 0.1468505859375, 0.0897216796875, 0.1551513671875, 0.0190277099609375,...	embed
67096594_c0	67096594	prolog	0	Title: How can I compare items in a Prolog database? Problem title: How can I compare items in a Prolog database? Tags: prolog Problem: How can I compare items in a Prolog database? I have a Prolog database that is dateopened(asda,date(1985,12,5)). dateopened(tesco,date(1979,12,17)). dateopened(morrisons,date(1999,12,2...	How can I compare items in a Prolog database? How can I compare items in a Prolog database? prolog How Prolog Supermarket Year How can I compare items in a Prolog database? I have a Prolog database that is I want to find out how to ask the following questions (Prolog queries) to answer the following: Are there any two ...	[ -0.00445556640625, -0.00726318359375, 0.00579833984375, 0.0211181640625, 0.006744384765625, 0.004974365234375, -0.00148773193359375, 0.0216064453125, 0.0012664794921875, 0.00421142578125, -0.0019989013671875, 0.01416015625, 0.0274658203125, 0.0011138916015625, -0.00775146484375, -0.022...	[ 11249, 831, 69101, 55769, 23, 1250, 4867, 63399, 502, 4265, 55637, 42552, 87, 3642, 26458, 17582, 10752, 41, 10484, 35166, 6626, 117781, 128584, 142096, 5701, 5155, 123055, 6528, 6602, 11704, 110, 37842, 7, 9571, 10586, 5351, 56065, 29786, ...	[ 0.0682373046875, 0.06439208984375, 0.2298583984375, 0.18896484375, 0.047088623046875, 0.17431640625, 0.257080078125, 0.2266845703125, 0.0965576171875, 0.1337890625, 0.1671142578125, 0.1583251953125, 0.037994384765625, 0.008636474609375, 0.099853515625, 0.0833740234375, 0.115356445312...	embed
62312941_c0	62312941	prolog	0	Title: How to iterate through the predicates in Prolog Problem title: How to iterate through the predicates in Prolog Tags: prolog Problem: How to iterate through the predicates in Prolog I'm new to prolog, but basically, I want a program to iterate through the predicates(not sure if I'm using that term correctly) and ...	How to iterate through the predicates in Prolog How to iterate through the predicates in Prolog prolog How Prolog social_life How to iterate through the predicates in Prolog I'm new to prolog, but basically, I want a program to iterate through the predicates(not sure if I'm using that term correctly) and then come to a...	[ -0.00634765625, -0.0216064453125, -0.0025787353515625, 0.0069580078125, -0.00762939453125, 0.0380859375, 0.035400390625, -0.004852294921875, 0.000637054443359375, -0.048828125, 0.0030670166015625, 0.00970458984375, -0.032470703125, 0.00518798828125, 0.01123046875, 0.01458740234375, 0...	[ 11249, 47, 17, 8560, 67, 8305, 1653, 2063, 1636, 23, 1250, 4867, 502, 2265, 24804, 3525, 3444, 1528, 1380, 2704, 9433, 107730, 22691, 111, 6626, 35166, 26458, 136, 22288, 6562, 1927, 98767, 41925, 22904, 3917, 38937, 32635, 438, 64457, 29...	[ 0.076904296875, 0.002655029296875, 0.07574462890625, 0.25146484375, 0.16943359375, 0.1763916015625, 0.201416015625, 0.2236328125, 0.157470703125, 0.03753662109375, 0.1900634765625, 0.24072265625, 0.142822265625, 0.1361083984375, 0.1619873046875, 0.0155029296875, 0.04241943359375, 0...	embed
21216105_c0	21216105	prolog	0	Title: Prevent backtracking after first solution to Fibonacci pair Problem title: Prevent backtracking after first solution to Fibonacci pair Tags: backtracking, fibonacci, clpfd, prolog, failure-slice Problem: Prevent backtracking after first solution to Fibonacci pair The term fib(N,F) is true when F is the N th Fibo...	Prevent backtracking after first solution to Fibonacci pair Prevent backtracking after first solution to Fibonacci pair backtracking fibonacci clpfd prolog failure-slice Prevent Fibonacci use_module Prevent backtracking after first solution to Fibonacci pair The term fib(N,F) is true when F is the N th Fibonacci number...	[ 0.01397705078125, 0.01092529296875, 0.01556396484375, 0.002960205078125, -0.0166015625, -0.003753662109375, 0.01177978515625, -0.00140380859375, 0.02099609375, -0.0673828125, 0.01324462890625, -0.0111083984375, -0.000164031982421875, 0.01611328125, 0.01495361328125, 0.0133056640625, ...	[ 1914, 16274, 4420, 125728, 214, 7103, 5117, 29806, 3698, 20990, 52544, 80836, 809, 39557, 71, 502, 4867, 137578, 13348, 4527, 83279, 13579, 275, 839, 4, 919, 29568, 3229, 563, 83, 541, 5675, 14012, 25632, 1250, 18151, 137567, 20697, 163, ...	[ 0.1334228515625, 0.1591796875, 0.1326904296875, 0.2333984375, 0.0516357421875, 0.1455078125, 0.165283203125, 0.172607421875, 0.13818359375, 0.1654052734375, 0.1689453125, 0.1573486328125, 0.183837890625, 0.001434326171875, 0.006439208984375, 0.087890625, 0.2130126953125, 0.12426757...	embed
53948483_c1	53948483	prolog	1	, which is the status of the system and it is the input for most of the functions. Then I tried to implement the function that defines where the agent is at a certain status of the system . This is my last (buggy) version of my at function: at(1, 1, S) :- S =:= 0, !. at(X, Y, S) :- writef('Am I at %w, %w at status %w?\...	, which is the status of the system and it is the input for most of the functions. Then I tried to implement the function that defines where the agent is at a certain status of the system . This is my last (buggy) version of my at function: at(1, 1, S) :- S =:= 0, !. at(X, Y, S) :- writef('Am I at %w, %w at status %w?\...	[ 0.0010833740234375, 0.03515625, -0.00408935546875, 0.00439453125, -0.0135498046875, 0.0159912109375, 0.0196533203125, -0.0023040771484375, -0.00323486328125, -0.032470703125, 0.00830078125, 0.050537109375, -0.0208740234375, -0.00701904296875, 0.01129150390625, 0.0216064453125, -0.004...	[ 3129, 83, 70, 10778, 111, 5426, 442, 107730, 2684, 32354, 87, 37842, 29479, 61924, 7, 7440, 23882, 99, 24233, 4568, 978, 67192, 11389, 759, 41600, 106, 159, 15772, 1369, 757, 711, 1542, 990, 33022, 420, 23135, 1745, 434, 4, 160634, 1204...	[ 0.00323486328125, 0.1328125, 0.036651611328125, 0.243896484375, 0.03753662109375, 0.1849365234375, 0.026397705078125, 0.2220458984375, 0.14892578125, 0.2437744140625, 0.11767578125, 0.111572265625, 0.192626953125, 0.2296142578125, 0.03173828125, 0.1922607421875, 0.27978515625, 0.24...	embed
78025800_c0	78025800	prolog	0	Title: Infinite loop for user-defined list_length Problem title: Infinite loop for user-defined list_length Tags: prolog, logic, programming-languages Problem: Infinite loop for user-defined list_length Here is a list length method: list_length([], 0). list_length([_\|T], N) :- list_length(T, TN), N is TN + 1. If I quer...	Infinite loop for user-defined list_length Infinite loop for user-defined list_length prolog logic programming-languages Infinite list_length Call _26 _58 _97 Exit _57 Redo _84 _123 _151 _83 Fail _110 _149 _177 _109 _206 Infinite loop for user-defined list_length Here is a list length method: If I query list_length(X, ...	[ -0.00970458984375, 0.01300048828125, 0.004852294921875, 0.00970458984375, -0.000263214111328125, -0.007232666015625, 0.0064697265625, 0.00732421875, 0.00830078125, -0.03271484375, 0.0118408203125, -0.010986328125, 0.00022220611572265625, 0.00811767578125, 0.0301513671875, 0.01434326171...	[ 134322, 13, 40956, 100, 38937, 112, 5983, 5303, 23986, 502, 4867, 62775, 56037, 196651, 26265, 4046, 10057, 101, 14773, 5443, 12243, 6096, 31, 13903, 48636, 135224, 17168, 190355, 36053, 141605, 144283, 106000, 139652, 927, 140909, 55300, 4263,...	[ 0.1903076171875, 0.1036376953125, 0.250732421875, 0.041107177734375, 0.1865234375, 0.07366943359375, 0.1824951171875, 0.2034912109375, 0.140869140625, 0.0799560546875, 0.1829833984375, 0.0892333984375, 0.066162109375, 0.05316162109375, 0.1588134765625, 0.17822265625, 0.1590576171875,...	embed
284826_c0	284826	prolog	0	Title: Trailing variable in a prolog list Problem title: Trailing variable in a prolog list Tags: prolog Problem: Trailing variable in a prolog list I'm on a beginner level course in prolog, doing a map colouring problem. Here's my code. col(Colors,Map,Coloring) :- checkMap(Colors,Map,Coloring). checkMap(Colors,[Countr...	Trailing variable in a prolog list Trailing variable in a prolog list prolog Trailing Colors Map Coloring Country1:Country2 Rest Country1:Color1 Country2:Color2 Color1 Color2 _G332 Trailing variable in a prolog list I'm on a beginner level course in prolog, doing a map colouring problem. Here's my code. My output looks...	[ 0.01446533203125, -0.001953125, -0.01385498046875, 0.00958251953125, -0.006866455078125, 0.004791259765625, -0.011474609375, 0.0069580078125, 0.0181884765625, -0.0128173828125, 0.00628662109375, -0.004058837890625, 0.0036773681640625, 0.0018310546875, -0.003021240234375, 0.014709472656...	[ 130431, 214, 77336, 23, 502, 4867, 5303, 51193, 42719, 74831, 82825, 108210, 304, 49756, 10625, 1484, 418, 724, 123128, 1679, 17366, 15411, 22288, 134855, 2967, 18151, 140992, 33342, 1884, 903, 3714, 3642, 831, 2046, 31351, 111, 70, 141037, ...	[ 0.260498046875, 0.218994140625, 0.31787109375, 0.0406494140625, 0.170654296875, 0.24072265625, 0.21142578125, 0.2181396484375, 0.15185546875, 0.1302490234375, 0.047027587890625, 0.064697265625, 0.09228515625, 0.1556396484375, 0.062744140625, 0.140869140625, 0.0394287109375, 0.01567...	embed
34032577_c0	34032577	prolog	0	Title: Behavior of `foldl1/3` and `foldr1/3` meta-predicates on empty lists Problem title: Behavior of `foldl1/3` and `foldr1/3` meta-predicates on empty lists Tags: prolog, meta-predicate, logtalk Problem: Behavior of `foldl1/3` and `foldr1/3` meta-predicates on empty lists Looking for advice. I'm adding foldl1/3 and ...	Behavior of `foldl1/3` and `foldr1/3` meta-predicates on empty lists Behavior of `foldl1/3` and `foldr1/3` meta-predicates on empty lists prolog meta-predicate logtalk Behavior foldl1 foldr1 Closure Head Tail Result foldr1_ Arg2 Args Arg1 Acc Acc2 Behavior of `foldl1/3` and `foldr1/3` meta-predicates on empty lists Loo...	[ -0.0030364990234375, 0.002349853515625, 0.00136566162109375, -0.004608154296875, -0.0186767578125, 0.0093994140625, 0.01043701171875, -0.00970458984375, -0.002685546875, -0.018798828125, 0.0186767578125, -0.000621795654296875, -0.02978515625, 0.00787353515625, 0.025634765625, -0.007324...	[ 98409, 42822, 141, 131530, 42, 23550, 19714, 2063, 201505, 5303, 502, 4867, 12684, 139109, 18344, 20469, 7569, 51053, 44816, 1218, 126684, 1172, 67660, 154107, 13146, 35773, 72546, 61924, 80934, 159029, 678, 42856, 35782, 157167, 11782, 165164, ...	[ 0.097412109375, 0.1611328125, 0.0250396728515625, 0.22705078125, 0.014434814453125, 0.2000732421875, 0.15234375, 0.1427001953125, 0.200927734375, 0.18994140625, 0.032073974609375, 0.1163330078125, 0.02410888671875, 0.1920166015625, 0.125732421875, 0.12744140625, 0.1064453125, 0.060...	embed
20501165_c1	20501165	prolog	1	is a wrong way to do it, I figured I'd try it in an iterative way. This is what I have so far: totalWeightOfSet([],0). totalWeightOfSet([Head\|RestOfSet],Weight) :- objectWeight(Head,HeadWeight), totalWeightOfSet(RestOfSet, RestWeight), Weight is HeadWeight + RestWeight. findBestBalancedSet(ListOfObjects,Sets) :- gener...	is a wrong way to do it, I figured I'd try it in an iterative way. This is what I have so far: totalWeightOfSet([],0). totalWeightOfSet([Head\|RestOfSet],Weight) :- objectWeight(Head,HeadWeight), totalWeightOfSet(RestOfSet, RestWeight), Weight is HeadWeight + RestWeight. findBestBalancedSet(ListOfObjects,Sets) :- gener...	[ 0.0228271484375, 0.00933837890625, 0.01416015625, 0.0107421875, -0.01190185546875, 0.027587890625, -0.026611328125, -0.003997802734375, 0.0164794921875, -0.005584716796875, 0.01025390625, 0.01214599609375, 0.0203857421875, -0.00421142578125, 0.017578125, -0.00078582763671875, 0.00891...	[ 83, 44691, 3917, 54, 442, 26366, 9790, 720, 45023, 3293, 765, 2060, 3622, 12137, 22553, 132887, 294, 126, 77495, 13025, 712, 1052, 525, 15772, 36746, 49756, 150533, 44816, 997, 7413, 110601, 63641, 7154, 154663, 75161, 139392, 43512, 7192, ...	[ 0.0484619140625, 0.1534423828125, 0.0982666015625, 0.0692138671875, 0.082763671875, 0.047149658203125, 0.1265869140625, 0.1217041015625, 0.0775146484375, 0.023834228515625, 0.0635986328125, 0.0872802734375, 0.166259765625, 0.1956787109375, 0.2056884765625, 0.189208984375, 0.190551757...	embed
13440927_c0	13440927	prolog	0	Title: How to get both drive predicates working in prolog? Problem title: How to get both drive predicates working in prolog? Tags: prolog, win-prolog Problem: How to get both drive predicates working in prolog? begin:- go, initialise. % drive predicate begin:- write('Sorry cannot help'),nl,nl. go:- write('Below is the...	How to get both drive predicates working in prolog? How to get both drive predicates working in prolog? prolog win-prolog How Sorry Below loop_through_list action_men train_tracks control_car drees_up doll_house Head Tail TOY GENERATING SYSTEM Please How to get both drive predicates working in prolog? The problem here ...	[ 0.03173828125, -0.000045299530029296875, -0.005279541015625, 0.01153564453125, -0.00543212890625, 0.022216796875, 0.0162353515625, -0.0115966796875, 0.0050048828125, -0.0230712890625, 0.0225830078125, 0.019775390625, -0.0172119140625, 0.00079345703125, 0.003204345703125, 0.008483886718...	[ 11249, 47, 2046, 15044, 22648, 1653, 2063, 1636, 20697, 23, 502, 4867, 19916, 3454, 90502, 17336, 40956, 222521, 6562, 22631, 1055, 25550, 125728, 6226, 3284, 17745, 2037, 54, 1181, 23923, 44816, 1218, 379, 51222, 109141, 24947, 55858, 90420,...	[ 0.0838623046875, 0.013427734375, 0.095703125, 0.2110595703125, 0.214111328125, 0.220458984375, 0.233154296875, 0.123779296875, 0.167236328125, 0.06011962890625, 0.1732177734375, 0.243408203125, 0.1240234375, 0.1373291015625, 0.1552734375, 0.1661376953125, 0.09912109375, 0.067993164...	embed
68496547_c0	68496547	prolog	0	Title: Prolog ask a question and resolve by dependency comprehension question Problem title: Prolog ask a question and resolve by dependency comprehension question Tags: prolog Problem: Prolog ask a question and resolve by dependency comprehension question i am new in Prolog and fighting me through examples. Now I woul...	Prolog ask a question and resolve by dependency comprehension question Prolog ask a question and resolve by dependency comprehension question prolog Prolog Prolog ask a question and resolve by dependency comprehension question i am new in Prolog and fighting me through examples. Now I would write a simple program by ha...	[ 0.0098876953125, 0.005706787109375, -0.005126953125, 0.0177001953125, -0.0003681182861328125, 0.0067138671875, 0.0054931640625, 0.0030364990234375, -0.01416015625, -0.0240478515625, -0.01708984375, -0.017578125, -0.01153564453125, 0.00958251953125, 0.018310546875, 0.022216796875, -0....	[ 1250, 4867, 26458, 9655, 136, 103608, 390, 42548, 27771, 46683, 3220, 502, 3525, 181952, 27781, 2806, 33022, 8781, 1528, 19441, 12921, 149357, 54, 12097, 83, 10, 2412, 4517, 959, 53408, 11907, 26249, 40617, 738, 257, 63805, 28864, 83425, 14...	[ 0.166259765625, 0.24560546875, 0.099365234375, 0.1578369140625, 0.056640625, 0.1717529296875, 0.06866455078125, 0.19189453125, 0.066650390625, 0.129150390625, 0.1300048828125, 0.1351318359375, 0.06671142578125, 0.1087646484375, 0.0941162109375, 0.008209228515625, 0.08160400390625, ...	embed
16164869_c0	16164869	prolog	0	Title: "Squares" Logic Riddle Solution in Prolog Problem title: "Squares" Logic Riddle Solution in Prolog Tags: logic, prolog, puzzle Problem: "Squares" Logic Riddle Solution in Prolog "Squares" Input : Board size m × n (m, n ∈ {1,...,32}), list of triples (i, j, k) , where i ∈ {1,...,m}, j ∈ {1,......	"Squares" Logic Riddle Solution in Prolog "Squares" Logic Riddle Solution in Prolog logic prolog puzzle Squares Logic Riddle Solution Prolog "Squares" Logic Riddle Solution in Prolog "Squares" Input : Board size m × n (m, n ∈ {1,...,32}), list of triples (i, j, k) , where i ∈ {1,...,m}, j ∈ {1,...,n...	[ 0.00274658203125, 0.0206298828125, 0.0023193359375, -0.005828857421875, -0.0181884765625, -0.005828857421875, -0.00762939453125, 0.01336669921875, 0.0023193359375, -0.004974365234375, 0.008544921875, 0.000881195068359375, 0.00131988525390625, -0.017333984375, 0.0036773681640625, 0.0153...	[ 41502, 294, 94727, 90, 1230, 50592, 41231, 19298, 187895, 23, 1250, 4867, 238, 62775, 502, 104192, 68305, 360, 7077, 62554, 13267, 347, 34070, 653, 39, 245918, 418, 27, 6460, 5303, 162738, 14, 1647, 472, 17, 19, 2389, 9, 10461, 1280, 28...	[ 0.039886474609375, 0.051971435546875, 0.25634765625, 0.19384765625, 0.037841796875, 0.1636962890625, 0.1444091796875, 0.1348876953125, 0.1441650390625, 0.02490234375, 0.1810302734375, 0.2154541015625, 0.006195068359375, 0.115478515625, 0.10113525390625, 0.09979248046875, 0.2653808593...	embed
31434659_c1	31434659	prolog	1	: (7) intepretation("", "abc", _G1441) ? creep Redo: (7) string_concat(_G1513, _G1514, abc) ? creep Exit: (7) string_concat("a", "bc", abc) ? creep Call: (7) intepretation("a", "bc", _G1441) ? creep Call: (8) lexicon("a", _G1520) ? creep Fail: (8) lexicon("a", _G1520) ? creep % What's happening on this line? Fail: (7) ...	: (7) intepretation("", "abc", _G1441) ? creep Redo: (7) string_concat(_G1513, _G1514, abc) ? creep Exit: (7) string_concat("a", "bc", abc) ? creep Call: (7) intepretation("a", "bc", _G1441) ? creep Call: (8) lexicon("a", _G1520) ? creep Fail: (8) lexicon("a", _G1520) ? creep % What's happening on this line? Fail: (7) ...	[ -0.0034942626953125, -0.018798828125, -0.01495361328125, 0.0478515625, 0.00020885467529296875, 0.031494140625, 0.021484375, 0.005279541015625, 0.016845703125, 0.006683349609375, 0.00860595703125, -0.005584716796875, -0.04833984375, -0.00579833984375, 0.023681640625, -0.014892578125, ...	[ 152, 8696, 892, 4692, 22062, 2055, 238, 724, 2592, 123001, 49512, 254, 6096, 31, 79315, 2271, 4460, 1837, 2681, 1563, 5443, 217, 11, 65037, 26265, 10021, 95, 73140, 73419, 190355, 1745, 123087, 98, 903, 13315, 178851, 9077, 16750, 163, 12...	[ 0.055389404296875, 0.16455078125, 0.1180419921875, 0.2197265625, 0.112548828125, 0.07354736328125, 0.08935546875, 0.05682373046875, 0.145751953125, 0.2060546875, 0.1697998046875, 0.1492919921875, 0.1036376953125, 0.1707763671875, 0.1961669921875, 0.071533203125, 0.198486328125, 0.0...	embed
47500158_c0	47500158	prolog	0	Title: Prolog - Recursion exiting giving the wrong value Problem title: Prolog - Recursion exiting giving the wrong value Tags: recursion, prolog Problem: Prolog - Recursion exiting giving the wrong value So I made this code to find the intersection between two lists. intersect([], _, C). intersect([A1\|AS], B, C) :- me...	Prolog - Recursion exiting giving the wrong value Prolog - Recursion exiting giving the wrong value recursion prolog Prolog Recursion Call Exit Prolog - Recursion exiting giving the wrong value So I made this code to find the intersection between two lists. And it indeed finds the intersections when the list A is empty...	[ 0.0107421875, -0.008056640625, 0.039794921875, -0.003997802734375, -0.0021514892578125, 0.0164794921875, -0.022216796875, -0.00445556640625, 0.01043701171875, -0.0037841796875, 0.0145263671875, 0.0184326171875, -0.01446533203125, 0.00909423828125, 0.03076171875, -0.000888824462890625, ...	[ 1250, 4867, 165428, 42, 6889, 82230, 214, 68772, 44691, 34292, 195625, 502, 26265, 5443, 217, 18151, 7413, 1940, 7, 58994, 17721, 6626, 5303, 160463, 3229, 62, 201505, 49903, 313, 144851, 903, 75101, 10433, 24762, 133063, 82449, 104629, 13600...	[ 0.157958984375, 0.23046875, 0.19482421875, 0.1925048828125, 0.1416015625, 0.2059326171875, 0.0579833984375, 0.09130859375, 0.1929931640625, 0.1756591796875, 0.21142578125, 0.1131591796875, 0.1695556640625, 0.15869140625, 0.059051513671875, 0.1007080078125, 0.1480712890625, 0.170166...	embed
26542713_c0	26542713	prolog	0	Title: Traverse Context Free Grammar Problem title: Traverse Context Free Grammar Tags: dcg, postfix-notation, prolog Problem: Traverse Context Free Grammar I am facing a problem of traversing a CFG used in prolog environment , to make it traverse in a postorder way. Following is the grammar used - list_ast(Ls, AST) :-...	Traverse Context Free Grammar Traverse Context Free Grammar dcg postfix-notation prolog Traverse Context Free Grammar list_ast AST expression_r E0-T term_r power_r Traverse Context Free Grammar I am facing a problem of traversing a CFG used in prolog environment , to make it traverse in a postorder way. Following is th...	[ 0.0306396484375, 0.0032958984375, 0.00081634521484375, 0.01416015625, 0.008544921875, -0.008056640625, -0.0150146484375, 0.0032501220703125, -0.002105712890625, -0.038330078125, 0.0020599365234375, 0.0164794921875, -0.025146484375, 0.000736236572265625, -0.00408935546875, 0.01867675781...	[ 4937, 37676, 1657, 22829, 5153, 48078, 1727, 238, 177, 1305, 55923, 157, 22062, 502, 4867, 5303, 4438, 48963, 125195, 241, 2389, 618, 13579, 42, 14537, 2967, 37317, 123254, 11814, 65998, 13, 80596, 122092, 147, 14847, 71924, 25632, 140992, ...	[ 0.1077880859375, 0.2044677734375, 0.0836181640625, 0.151123046875, 0.1409912109375, 0.1466064453125, 0.0672607421875, 0.00054931640625, 0.1162109375, 0.090087890625, 0.1759033203125, 0.105712890625, 0.0244140625, 0.146728515625, 0.233642578125, 0.1490478515625, 0.138916015625, 0.11...	embed
7282829_c0	7282829	prolog	0	Title: SWI Prolog , how to assert data to txt file Problem title: SWI Prolog , how to assert data to txt file Tags: prolog Problem: SWI Prolog , how to assert data to txt file This is my sample source code , I am using SWI Prolog , can someone tell me how to assert data that user key in to txt.file. I want save the dat...	SWI Prolog , how to assert data to txt file SWI Prolog , how to assert data to txt file prolog SWI Prolog display_menu Matching Partner System n1.Enter n0.exits Choice get_userinfo get_userinfo:-write Enter User Information Name Gender Age get_attribute Attr Height SWI Prolog , how to assert data to txt file This is my...	[ 0.0213623046875, 0.0123291015625, 0.018798828125, 0.0184326171875, -0.0137939453125, 0.004302978515625, -0.0035247802734375, 0.0157470703125, -0.004852294921875, -0.00019931793212890625, 0.0015411376953125, -0.0068359375, -0.01214599609375, -0.01446533203125, 0.035888671875, 0.01422119...	[ 159, 38969, 1250, 4867, 3642, 47, 237, 33657, 2053, 124326, 11435, 502, 44116, 30144, 67407, 16424, 12353, 155581, 2389, 3355, 181948, 2046, 65918, 7319, 434, 18781, 60816, 53400, 32007, 15757, 527, 23894, 72944, 191145, 9208, 42, 1529, 22553...	[ 0.086181640625, 0.2393798828125, 0.170654296875, 0.218017578125, 0.058074951171875, 0.1285400390625, 0.1171875, 0.2308349609375, 0.17333984375, 0.2425537109375, 0.14892578125, 0.1365966796875, 0.0572509765625, 0.1180419921875, 0.1280517578125, 0.148193359375, 0.0712890625, 0.065551...	embed
32413364_c0	32413364	prolog	0	Title: how to find a route to travel between two cities, using an accumulator in Prolog Problem title: how to find a route to travel between two cities, using an accumulator in Prolog Tags: prolog Problem: how to find a route to travel between two cities, using an accumulator in Prolog I have a predicate directTrain/2 ...	how to find a route to travel between two cities, using an accumulator in Prolog how to find a route to travel between two cities, using an accumulator in Prolog prolog an Prolog Route how to find a route to travel between two cities, using an accumulator in Prolog I have a predicate directTrain/2 which defines a direc...	[ 0.021484375, 0.006683349609375, 0.00823974609375, 0.0257568359375, 0.006256103515625, 0.007415771484375, -0.0157470703125, 0.0174560546875, 0.0150146484375, -0.0712890625, 0.032958984375, 0.000598907470703125, -0.01043701171875, 0.0101318359375, 0.01318359375, -0.00634765625, -0.0023...	[ 3642, 7413, 36439, 47, 26983, 17721, 6626, 162708, 17368, 183278, 1290, 1250, 4867, 10, 502, 142, 106015, 1653, 2063, 8951, 28542, 73, 12477, 61924, 60875, 1295, 3687, 62, 335, 51359, 3647, 67, 284, 571, 12724, 6743, 8337, 184345, 3173, 5...	[ 0.07183837890625, 0.1463623046875, 0.262451171875, 0.10498046875, 0.200439453125, 0.169189453125, 0.1417236328125, 0.1689453125, 0.051025390625, 0.207275390625, 0.1488037109375, 0.171142578125, 0.2283935546875, 0.03314208984375, 0.10369873046875, 0.033782958984375, 0.2288818359375, ...	embed
48222230_c0	48222230	prolog	0	Title: Finding a person with no siblings in prolog Problem title: Finding a person with no siblings in prolog Tags: prolog Problem: Finding a person with no siblings in prolog I'm trying to write Prolog code that calculates how the fortune of man divided between his family members based on Islamic inheritance rules. On...	Finding a person with no siblings in prolog Finding a person with no siblings in prolog prolog Finding What Finding a person with no siblings in prolog I'm trying to write Prolog code that calculates how the fortune of man divided between his family members based on Islamic inheritance rules. One of the cases is that, ...	[ 0.00007581710815429688, 0.019287109375, -0.00000959634780883789, -0.006561279296875, -0.021728515625, 0.00665283203125, 0.0164794921875, 0.0067138671875, 0.004302978515625, -0.023193359375, 0.00274658203125, -0.03369140625, -0.0186767578125, -0.0002231597900390625, 0.0159912109375, -0....	[ 26040, 214, 10, 3445, 678, 110, 78, 79298, 7, 23, 502, 4867, 4865, 33022, 1250, 18151, 74481, 100, 45091, 332, 101637, 71, 17721, 14449, 43032, 35509, 116625, 3334, 217, 91736, 76849, 1295, 67373, 1556, 7108, 23552, 1919, 5423, 79986, 109...	[ 0.149169921875, 0.0139923095703125, 0.0159149169921875, 0.1546630859375, 0.081298828125, 0.16162109375, 0.138427734375, 0.1925048828125, 0.027801513671875, 0.0452880859375, 0.147216796875, 0.201416015625, 0.012725830078125, 0.0182952880859375, 0.097412109375, 0.0908203125, 0.09558105...	embed
20981144_c0	20981144	prolog	0	Title: Dynamic database - including and excluding files Problem title: Dynamic database - including and excluding files Tags: database, dynamic, prolog, include Problem: Dynamic database - including and excluding files Does prolog have built-in predicates, which can import and export complete files during runtime? I ne...	Dynamic database - including and excluding files Dynamic database - including and excluding files database dynamic prolog include Dynamic file.pl Dynamic database - including and excluding files Does prolog have built-in predicates, which can import and export complete files during runtime? I need predicates like "asse...	[ 0.028076171875, 0.000514984130859375, 0.003021240234375, 0.0216064453125, -0.0322265625, -0.000659942626953125, -0.005126953125, 0.0126953125, 0.012939453125, -0.0478515625, 0.006622314453125, 0.023681640625, -0.02099609375, 0.00494384765625, 0.033935546875, 0.0038604736328125, 0.016...	[ 73327, 21068, 63399, 26719, 136, 39041, 6238, 102158, 84079, 502, 4867, 26698, 11435, 2424, 765, 88303, 73, 1653, 2063, 1636, 831, 24927, 31255, 28484, 20271, 11675, 6032, 3871, 162, 33657, 107, 39989, 2967, 45258, 5303, 6626, 48322, 3642, ...	[ 0.1748046875, 0.1253662109375, 0.22412109375, 0.1444091796875, 0.057769775390625, 0.1824951171875, 0.0419921875, 0.1898193359375, 0.21728515625, 0.1788330078125, 0.242919921875, 0.176025390625, 0.201416015625, 0.1163330078125, 0.050323486328125, 0.12744140625, 0.1151123046875, 0.15...	embed
46946974_c0	46946974	prolog	0	Title: How to assign variables in a recursion? Problem title: How to assign variables in a recursion? Tags: prolog Problem: How to assign variables in a recursion? Suppose you have a bunch of boxes inside other boxes, i.e. inBox(a,b). inBox(b,c). inBox(c,d). inBox(x,y) meansbox x is in box y. Now I want to write a meth...	How to assign variables in a recursion? How to assign variables in a recursion? prolog How Call Fail How to assign variables in a recursion? Suppose you have a bunch of boxes inside other boxes, i.e. inBox(x,y) meansbox x is in box y. Now I want to write a method to determine if one box is inside of another box, e.g. i...	[ 0.00167083740234375, 0.022216796875, -0.0029144287109375, 0.025146484375, 0.00457763671875, 0.01116943359375, -0.015380859375, 0.010498046875, 0.003997802734375, 0.012451171875, 0.016845703125, 0.004425048828125, -0.0068359375, -0.0145263671875, 0.03271484375, 0.01055908203125, 0.008...	[ 11249, 95486, 77336, 7, 23, 195625, 1830, 10, 502, 4867, 26265, 190355, 147306, 16530, 46132, 3789, 72295, 53, 11728, 1022, 113, 33022, 55300, 83324, 2174, 111, 15700, 71, 29568, 104, 6083, 5844, 2967, 3115, 35782, 61475, 432, 1632, 1257, ...	[ 0.06494140625, 0.2496337890625, 0.283203125, 0.0670166015625, 0.1429443359375, 0.2314453125, 0.1536865234375, 0.03167724609375, 0.046905517578125, 0.0843505859375, 0.119873046875, 0.176025390625, 0.039276123046875, 0.1551513671875, 0.17138671875, 0.056793212890625, 0.1923828125, 0....	embed
30283221_c0	30283221	prolog	0	Title: prolog recursive searching with contraints Problem title: prolog recursive searching with contraints Tags: prolog, search, transitive-closure Problem: prolog recursive searching with contraints I have a house with rooms that are defined with connections for when you can go from one room to another eg. connection...	prolog recursive searching with contraints prolog recursive searching with contraints prolog search transitive-closure Item Somewhere prolog recursive searching with contraints I have a house with rooms that are defined with connections for when you can go from one room to another eg. Im trying to figure out how make i...	[ 0.000751495361328125, 0.021240234375, 0.00921630859375, 0.00439453125, 0.007171630859375, 0.01092529296875, -0.0198974609375, -0.00101470947265625, 0.0125732421875, -0.047119140625, 0.01202392578125, -0.016357421875, -0.01123046875, 0.005035400390625, -0.004730224609375, -0.00457763671...	[ 502, 4867, 195625, 5844, 157318, 678, 2304, 4288, 33938, 62621, 170224, 78426, 136913, 765, 18276, 112875, 61924, 94878, 831, 738, 1295, 17155, 47, 15700, 31577, 26366, 3249, 58585, 4734, 2046, 1632, 29458, 35735, 23, 98483, 55769, 16712, 313...	[ 0.1688232421875, 0.2283935546875, 0.204345703125, 0.1043701171875, 0.2137451171875, 0.0819091796875, 0.195556640625, 0.1829833984375, 0.198486328125, 0.1534423828125, 0.215576171875, 0.17529296875, 0.012939453125, 0.016387939453125, 0.108642578125, 0.167724609375, 0.1339111328125, ...	embed
72351295_c0	72351295	prolog	0	Title: Tail-recursive list of divisors of an integer in prolog Problem title: Tail-recursive list of divisors of an integer in prolog Tags: prolog, tail-recursion Problem: Tail-recursive list of divisors of an integer in prolog I am trying to make a simple tail-recursive loop to collect the divisors of an integer, divi...	Tail-recursive list of divisors of an integer in prolog Tail-recursive list of divisors of an integer in prolog prolog tail-recursion Tail-recursive What divisors_aux List Aux D-1 N-1 Tail-recursive list of divisors of an integer in prolog I am trying to make a simple tail-recursive loop to collect the divisors of an i...	[ 0.006072998046875, 0.00020503997802734375, 0.02392578125, -0.003509521484375, -0.0068359375, 0.01348876953125, -0.016357421875, -0.0103759765625, 0.00457763671875, -0.0296630859375, 0.0191650390625, -0.00457763671875, -0.002166748046875, 0.02197265625, 0.016845703125, 0.003250122070312...	[ 1218, 379, 107, 48650, 5844, 5303, 45, 51858, 7, 892, 1505, 502, 4867, 46741, 4865, 10442, 32036, 6077, 391, 5759, 541, 31577, 8781, 40956, 43799, 839, 154663, 20697, 959, 34648, 493, 44691, 104272, 214493, 8, 978, 21407, 15400, 70426, 30...	[ 0.181640625, 0.1461181640625, 0.06634521484375, 0.189697265625, 0.092041015625, 0.1802978515625, 0.1494140625, 0.259033203125, 0.08868408203125, 0.1226806640625, 0.0965576171875, 0.154296875, 0.204345703125, 0.265869140625, 0.010955810546875, 0.1802978515625, 0.16552734375, 0.14172...	embed
18559053_c0	18559053	prolog	0	Title: Prolog: how to combine 2 predicate become 1 list only Problem title: Prolog: how to combine 2 predicate become 1 list only Tags: prolog, list Problem: Prolog: how to combine 2 predicate become 1 list only Question 1 How do I combine weatherInfo(X,Y) with airDensity(X,Y) to make it into 1 list. I want it to be so...	Prolog: how to combine 2 predicate become 1 list only Prolog: how to combine 2 predicate become 1 list only prolog list Prolog Sunny Overcast Rain Hot Mild Cool Normal High Result NewT NewL Prolog: how to combine 2 predicate become 1 list only Question 1 How do I combine weatherInfo(X,Y) with airDensity(X,Y) to make it...	[ 0.0034637451171875, 0.00238037109375, -0.00506591796875, 0.0284423828125, -0.0034637451171875, 0.0203857421875, 0.000762939453125, 0.003173828125, 0.01239013671875, -0.0303955078125, 0.019775390625, 0.01275634765625, -0.0103759765625, -0.01416015625, 0.0052490234375, 0.00933837890625, ...	[ 1250, 4867, 3642, 70163, 116, 1653, 2063, 67, 24209, 106, 5303, 4734, 502, 151197, 9578, 55741, 82507, 9903, 10663, 63550, 28723, 19694, 126684, 2356, 618, 866, 47, 68185, 11249, 92949, 93147, 1542, 1723, 678, 1831, 54494, 2481, 3934, 7722,...	[ 0.1322021484375, 0.218017578125, 0.061370849609375, 0.22265625, 0.1593017578125, 0.1673583984375, 0.18701171875, 0.094970703125, 0.07904052734375, 0.10003662109375, 0.193603515625, 0.09320068359375, 0.1103515625, 0.1083984375, 0.03863525390625, 0.0985107421875, 0.092041015625, 0.02...	embed
52563407_c0	52563407	prolog	0	Title: Prolog: Difference between overriding predicate and using it Problem title: Prolog: Difference between overriding predicate and using it Tags: prolog, object, module Problem: Prolog: Difference between overriding predicate and using it I feel really stupid, and feel like I'm missing something. I've basically got...	Prolog: Difference between overriding predicate and using it Prolog: Difference between overriding predicate and using it prolog object module it Prolog Difference module.pl state.pl Food Eater InjEvent _Time _Event _ActorOfEvent Prolog: Difference between overriding predicate and using it I feel really stupid, and fee...	[ 0.0164794921875, -0.005126953125, -0.00183868408203125, 0.0103759765625, 0.00640869140625, 0.004150390625, 0.0208740234375, -0.007171630859375, 0.0126953125, -0.057861328125, 0.01043701171875, 0.00958251953125, -0.0034942626953125, -0.01373291015625, 0.01904296875, 0.010498046875, -0...	[ 1250, 4867, 803, 18234, 6620, 17721, 645, 416, 6238, 1653, 2063, 67, 17368, 442, 502, 36746, 88996, 2424, 11341, 34562, 241, 46429, 360, 170, 192134, 70059, 18770, 132887, 12319, 6183, 110833, 1884, 132283, 9844, 6626, 102158, 32813, 62775, ...	[ 0.15185546875, 0.2265625, 0.0614013671875, 0.17578125, 0.071533203125, 0.06005859375, 0.146240234375, 0.21923828125, 0.1229248046875, 0.1920166015625, 0.2393798828125, 0.138916015625, 0.2242431640625, 0.1563720703125, 0.1505126953125, 0.17822265625, 0.1767578125, 0.1590576171875, ...	embed
22735396_c1	22735396	prolog	1	rique, javier). parent_of(angeles, javier). parent_of(cristina, miguelin). parent_of(otilia, cristina). parent_of(eloina, esmeralda). % Rules ancestor(X, Y) :- parent_of(X, Y); parent_of(X, Z), ancestor(Z, Y). descendant(X, Y) :- ancestor(Y, X). father(X, Y) :- parent_of(X, Y), male(X). mother(X, Y) :- parent_of(X, Y),...	rique, javier). parent_of(angeles, javier). parent_of(cristina, miguelin). parent_of(otilia, cristina). parent_of(eloina, esmeralda). % Rules ancestor(X, Y) :- parent_of(X, Y); parent_of(X, Z), ancestor(Z, Y). descendant(X, Y) :- ancestor(Y, X). father(X, Y) :- parent_of(X, Y), male(X). mother(X, Y) :- parent_of(X, Y),...	[ 0.0245361328125, 0.006744384765625, 0.007415771484375, 0.0233154296875, -0.0062255859375, 0.0023345947265625, -0.006866455078125, 0.0101318359375, -0.007171630859375, -0.0390625, 0.006622314453125, -0.027099609375, 0.00141143798828125, 0.01080322265625, 0.020263671875, -0.0026702880859...	[ 75087, 4, 79, 22023, 194, 49129, 454, 4390, 64859, 90, 58532, 5516, 1693, 37755, 818, 33396, 13625, 52763, 8242, 885, 198, 1991, 48641, 1745, 139118, 7, 60502, 1290, 132, 1542, 990, 15772, 3142, 567, 6, 1511, 60887, 1236, 1193, 67373, 1...	[ 0.2266845703125, 0.0628662109375, 0.12548828125, 0.24609375, 0.046875, 0.2471923828125, 0.000396728515625, 0.101806640625, 0.1444091796875, 0.0948486328125, 0.0321044921875, 0.1591796875, 0.059814453125, 0.1600341796875, 0.06201171875, 0.1776123046875, 0.0272216796875, 0.1524658203...	embed
24630245_c1	24630245	prolog	1	\|R],ListaAbiertos1,ListaAbiertos2) :- insertarUno(F,ListaAbiertos1,ListaAbiertos3), insertarTodos(R,ListaAbiertos3,ListaAbiertos2). insertarTodos([],ListaAbiertos,ListaAbiertos). nodoRepetido(Estado@_@_@_, [Estado@_@_@_\|_]). costeMenor( _@_@F1@_ , _@_@F2@_ ) :- F1 < F2. expandir(Estado@Profundidad@_@S,Sucesores) :- fin...	\|R],ListaAbiertos1,ListaAbiertos2) :- insertarUno(F,ListaAbiertos1,ListaAbiertos3), insertarTodos(R,ListaAbiertos3,ListaAbiertos2). insertarTodos([],ListaAbiertos,ListaAbiertos). nodoRepetido(Estado@_@_@_, [Estado@_@_@_\|_]). costeMenor( _@_@F1@_ , _@_@F2@_ ) :- F1 < F2. expandir(Estado@Profundidad@_@S,Sucesores) :- fin...	[ -0.01031494140625, -0.005584716796875, 0.003173828125, 0.00927734375, 0.004058837890625, 0.00982666015625, -0.0205078125, 0.0027008056640625, 0.00153350830078125, -0.00762939453125, 0.0247802734375, 0.0135498046875, -0.001373291015625, -0.0079345703125, 0.0076904296875, -0.0078125, 0...	[ 6, 58745, 1052, 268, 4, 866, 1035, 284, 49843, 1952, 418, 10461, 15772, 28046, 867, 1062, 157, 919, 21320, 7763, 1140, 5, 132, 194, 110, 246, 4332, 63065, 74328, 95363, 29638, 748, 304, 563, 5442, 71062, 481, 981, 25018, 14168, 5170, ...	[ 0.04644775390625, 0.08544921875, 0.14306640625, 0.07391357421875, 0.020843505859375, 0.1788330078125, 0.1748046875, 0.0799560546875, 0.2275390625, 0.1927490234375, 0.06884765625, 0.1287841796875, 0.161376953125, 0.208984375, 0.1767578125, 0.0164031982421875, 0.081298828125, 0.11389...	embed
29663905_c0	29663905	prolog	0	Title: Prolog simple function to remove duplicates from list Problem title: Prolog simple function to remove duplicates from list Tags: prolog Problem: Prolog simple function to remove duplicates from list I'm a student learning prolog. I've written a function to remove duplicate elements from a list in two ways. One t...	Prolog simple function to remove duplicates from list Prolog simple function to remove duplicates from list prolog list Prolog Prolog simple function to remove duplicates from list I'm a student learning prolog. I've written a function to remove duplicate elements from a list in two ways. One that retains the order of ...	[ -0.002227783203125, 0.040771484375, 0.0181884765625, -0.01104736328125, -0.0147705078125, 0.006744384765625, 0.00396728515625, -0.006591796875, 0.0027313232421875, -0.01361083984375, 0.006195068359375, 0.0084228515625, 0.01129150390625, 0.004974365234375, 0.000598907470703125, 0.014099...	[ 1250, 4867, 8781, 32354, 87388, 171763, 1636, 1295, 5303, 502, 9836, 52080, 59121, 67, 80854, 6626, 48322, 112033, 5425, 12989, 959, 2967, 140992, 70541, 91067, 51, 99091, 77336, 73, 88551, 60212, 1957, 171859, 32786, 627, 201505, 44402, 3302...	[ 0.1361083984375, 0.1923828125, 0.1427001953125, 0.168212890625, 0.16796875, 0.27294921875, 0.156005859375, 0.0894775390625, 0.193359375, 0.1240234375, 0.0528564453125, 0.022125244140625, 0.04510498046875, 0.1197509765625, 0.12890625, 0.0511474609375, 0.0745849609375, 0.124145507812...	embed
49416911_c0	49416911	prolog	0	Title: Nested Prolog queries (anding between different conditions) Problem title: Nested Prolog queries (anding between different conditions) Tags: prolog Problem: Nested Prolog queries (anding between different conditions) I'm working on some queries about this code in Prolog: student(ali). student(sami). student(rami...	Nested Prolog queries (anding between different conditions) Nested Prolog queries (anding between different conditions) prolog Nested Prolog calculus2 calculus1 teacher_of Nested Prolog queries (anding between different conditions) I'm working on some queries about this code in Prolog: Now, I want to find all teachers ...	[ 0.01611328125, 0.0252685546875, -0.01043701171875, 0.02392578125, -0.003662109375, 0.01239013671875, -0.0272216796875, -0.01153564453125, 0.000652313232421875, -0.052734375, 0.01397705078125, -0.00408935546875, 0.01043701171875, 0.03857421875, 0.0023651123046875, 0.003631591796875, 0...	[ 28701, 71, 1250, 4867, 41, 10484, 11, 33770, 17721, 12921, 27289, 502, 44805, 223, 304, 418, 117914, 4390, 20697, 18151, 3444, 47, 7413, 756, 148729, 111, 9836, 55725, 37842, 18499, 98320, 2565, 162, 35166, 3564, 26008, 1118, 30391, 3688, ...	[ 0.2205810546875, 0.1304931640625, 0.130615234375, 0.2298583984375, 0.1312255859375, 0.1220703125, 0.0156707763671875, 0.0989990234375, 0.10540771484375, 0.080322265625, 0.1500244140625, 0.0970458984375, 0.1229248046875, 0.09637451171875, 0.078125, 0.0251007080078125, 0.226318359375, ...	embed
68873854_c0	68873854	prolog	0	Title: How to implement the Fibonacci sequence in successor arithmetics for all argument modes? Problem title: How to implement the Fibonacci sequence in successor arithmetics for all argument modes? Tags: termination, successor-arithmetics, prolog, fibonacci, failure-slice Problem: How to implement the Fibonacci seque...	How to implement the Fibonacci sequence in successor arithmetics for all argument modes? How to implement the Fibonacci sequence in successor arithmetics for all argument modes? termination successor-arithmetics prolog fibonacci failure-slice How Fibonacci Time How to implement the Fibonacci sequence in successor arith...	[ 0.0185546875, 0.0027923583984375, -0.00408935546875, 0.00616455078125, -0.0135498046875, -0.006378173828125, 0.0028533935546875, 0.015625, 0.01470947265625, -0.0157470703125, 0.0289306640625, -0.01239013671875, -0.0289306640625, 0.00408935546875, 0.0263671875, 0.0029296875, 0.0291748...	[ 11249, 47, 29479, 3698, 20990, 52544, 40, 944, 3956, 39457, 42, 8962, 282, 41637, 100, 756, 10750, 13736, 23, 29527, 502, 4867, 809, 137578, 13348, 19055, 25632, 1250, 1528, 61924, 1653, 2063, 275, 12477, 242122, 14012, 892, 1505, 43240, ...	[ 0.1009521484375, 0.047119140625, 0.2161865234375, 0.163330078125, 0.1917724609375, 0.2349853515625, 0.07269287109375, 0.1524658203125, 0.0853271484375, 0.22412109375, 0.1610107421875, 0.134521484375, 0.057830810546875, 0.013671875, 0.03607177734375, 0.07098388671875, 0.2196044921875,...	embed

19875352_c0

19875352

prolog

0

Title: Calling a procedure during assert in Prolog Problem title: Calling a procedure during assert in Prolog Tags: prolog, prolog-assert Problem: Calling a procedure during assert in Prolog I have an assert query that is something like: :- dynamic a/1,b/1. dump:- listing(a),listing(b). main:-retractall(a(X)),assert(a(...

Calling a procedure during assert in Prolog Calling a procedure during assert in Prolog prolog prolog-assert Calling Prolog main:-retractall pro_a pro_b aa1 bb1 Calling a procedure during assert in Prolog I have an assert query that is something like: I want the user to type a(1) or b(1) , the program to display aa or ...

[ 0.009765625, 0.006744384765625, 0.0091552734375, 0.02490234375, -0.017578125, 0.00885009765625, -0.01531982421875, 0.00836181640625, 0.0017852783203125, -0.011474609375, 0.003265380859375, 0.035888671875, -0.031494140625, -0.0029754638671875, 0.046630859375, -0.0162353515625, 0.03833...

[ 26265, 50491, 20271, 237, 33657, 1250, 4867, 23, 502, 162, 5201, 107, 39989, 91569, 11, 275, 10, 418, 5125, 41, 1294, 3444, 38937, 10644, 27750, 707, 876, 1528, 44116, 107013, 2060, 4127, 11782, 15700, 96819, 454, 11675, 764, 52895, 37842...

[ 0.183349609375, 0.22802734375, 0.134521484375, 0.125, 0.276123046875, 0.166259765625, 0.2322998046875, 0.021759033203125, 0.1751708984375, 0.128173828125, 0.037445068359375, 0.04412841796875, 0.1021728515625, 0.1510009765625, 0.08941650390625, 0.1082763671875, 0.06170654296875, 0.0...

embed

30959342_c0

30959342

prolog

0

Title: SQL simulator on Prolog Problem title: SQL simulator on Prolog Tags: sql, prolog, simulator Problem: SQL simulator on Prolog i need to do a SQL simulator on Prolog. i need to simulate some functions like create_table, insert, delete, update_table, select_table, drop_table, show_table, etc. I am learning how to d...

SQL simulator on Prolog SQL simulator on Prolog sql prolog simulator SQL Prolog create_table Atributos SQL simulator on Prolog i need to do a SQL simulator on Prolog. i need to simulate some functions like create_table, insert, delete, update_table, select_table, drop_table, show_table, etc. I am learning how to do ass...

[ 0.027099609375, 0.00445556640625, 0.01007080078125, 0.040771484375, -0.01806640625, -0.008056640625, -0.007476806640625, 0.0115966796875, 0.00168609619140625, -0.0301513671875, 0.01123046875, -0.002349853515625, -0.017333984375, -0.0169677734375, 0.017333984375, 0.0189208984375, 0.02...

[ 80866, 40226, 1290, 98, 1250, 4867, 99247, 502, 28282, 22819, 1913, 28177, 1952, 3871, 32354, 183540, 154109, 28350, 36849, 36069, 7639, 52080, 237, 33657, 41499, 18499, 5117, 839, 284, 541, 9351, 23180, 62, 5303, 146256, 1636, 27781, 96610, ...

[ 0.219970703125, 0.251953125, 0.1396484375, 0.06842041015625, 0.14501953125, 0.22900390625, 0.146240234375, 0.0888671875, 0.122314453125, 0.2078857421875, 0.0296630859375, 0.15234375, 0.0762939453125, 0.0416259765625, 0.1353759765625, 0.06805419921875, 0.0634765625, 0.0621337890625,...

embed

75498411_c0

75498411

prolog

0

Title: Logic programming with multiple fact databases Problem title: Logic programming with multiple fact databases Tags: prolog, minikanren, logic-programming, datalog Problem: Logic programming with multiple fact databases I have to find a logically consistent subset of multiple fact sets (databases). Is there a logi...

Logic programming with multiple fact databases Logic programming with multiple fact databases prolog minikanren logic-programming datalog Logic Logic programming with multiple fact databases I have to find a logically consistent subset of multiple fact sets (databases). Is there a logic programming language with built-...

[ 0.027587890625, 0.015380859375, 0.00860595703125, 0.01025390625, -0.01470947265625, 0.019287109375, 0.003173828125, -0.01007080078125, 0.01318359375, -0.0291748046875, -0.0106201171875, 0.00360107421875, 0.003631591796875, -0.01220703125, -0.0020751953125, -0.0052490234375, 0.0098266...

[ 50592, 238, 56037, 678, 48716, 15824, 63399, 449, 502, 4867, 7665, 331, 982, 62775, 28966, 2053, 7413, 12684, 74729, 1614, 3509, 5423, 10135, 37382, 46876, 88303, 73, 135094, 54, 190358, 160404, 98, 5701, 4173, 10750, 12638, 8, 48345, 10617...

[ 0.182861328125, 0.000885009765625, 0.184814453125, 0.059722900390625, 0.2191162109375, 0.2144775390625, 0.2340087890625, 0.0406494140625, 0.07000732421875, 0.1513671875, 0.058013916015625, 0.04638671875, 0.12451171875, 0.2388916015625, 0.1263427734375, 0.02862548828125, 0.10552978515...

embed

40047040_c0

40047040

prolog

0

Title: Prolog: Assigning Priority to Atoms Problem title: Prolog: Assigning Priority to Atoms Tags: prolog Problem: Prolog: Assigning Priority to Atoms I am completely new to swi-prolog but am learning as I go and I am trying to create a program that will choose the optimal option in a certain scenario. I am wondering ...

Prolog: Assigning Priority to Atoms Prolog: Assigning Priority to Atoms prolog Prolog Assigning Priority Atoms Prolog: Assigning Priority to Atoms I am completely new to swi-prolog but am learning as I go and I am trying to create a program that will choose the optimal option in a certain scenario. I am wondering if th...

[ 0.017822265625, 0.01068115234375, 0.0177001953125, 0.03173828125, -0.0059814453125, 0.00592041015625, 0.010009765625, 0.00946044921875, -0.0260009765625, -0.007354736328125, 0.0101318359375, 0.0166015625, 0.004119873046875, -0.032958984375, 0.00469970703125, 0.003387451171875, 0.0077...

[ 1250, 4867, 12, 1301, 31304, 168857, 53, 47, 69728, 7, 502, 64557, 3525, 91, 2452, 3454, 52080, 31577, 28282, 1528, 55076, 24087, 35829, 24233, 106117, 149016, 3917, 23, 95486, 107671, 6620, 34627, 1884, 831, 678, 39933, 17368, 7413, 107730...

[ 0.188720703125, 0.26953125, 0.002716064453125, 0.05194091796875, 0.177490234375, 0.2158203125, 0.12841796875, 0.0821533203125, 0.219482421875, 0.07952880859375, 0.1182861328125, 0.0291595458984375, 0.0765380859375, 0.047454833984375, 0.1676025390625, 0.134765625, 0.081298828125, 0....

embed

56208716_c0

56208716

prolog

0

Title: Prolog - distance from two point Problem title: Prolog - distance from two point Tags: distance, position, prolog Problem: Prolog - distance from two point i want calculate distance from two cites, i have cityState, list of lists of [NameCity,[X,Y],Neighbours],[],..] I'm trying to write a code in Prolog to calcu...

Prolog - distance from two point Prolog - distance from two point distance position prolog two Prolog NameCity Neighbours ERROR Syntax Operator Distance Name Position Neighbors _Neighbors City1 City2 X_Dist X1-X2 Y_Dist Y1-Y2 Prolog - distance from two point i want calculate distance from two cites, i have cityState, l...

[ 0.0042724609375, -0.0074462890625, 0.00360107421875, 0.0152587890625, 0.00390625, 0.00159454345703125, -0.0062255859375, 0.017578125, 0.00174713134765625, -0.03515625, 0.0145263671875, 0.003997802734375, -0.01336669921875, -0.023681640625, -0.0174560546875, -0.00958251953125, 0.02038...

[ 1250, 4867, 62488, 1295, 6626, 6275, 19069, 502, 15757, 115411, 799, 6958, 38648, 151206, 24638, 19010, 86531, 150922, 154349, 99428, 3422, 6433, 6406, 418, 304, 1193, 397, 1419, 20268, 990, 1723, 3444, 74481, 67, 113721, 765, 26349, 135206, ...

[ 0.1839599609375, 0.239990234375, 0.221435546875, 0.1417236328125, 0.1890869140625, 0.144287109375, 0.143798828125, 0.1422119140625, 0.071533203125, 0.0970458984375, 0.007293701171875, 0.10369873046875, 0.1304931640625, 0.1129150390625, 0.059814453125, 0.05694580078125, 0.084838867187...

embed

41450479_c0

41450479

prolog

0

Title: Learn Prolog Now - issues with backtracking in exercise on recursion Problem title: Learn Prolog Now - issues with backtracking in exercise on recursion Tags: prolog, successor-arithmetics Problem: Learn Prolog Now - issues with backtracking in exercise on recursion I am having troubles understanding what is hap...

Learn Prolog Now - issues with backtracking in exercise on recursion Learn Prolog Now - issues with backtracking in exercise on recursion prolog successor-arithmetics Learn Prolog Now Learn Prolog Now - issues with backtracking in exercise on recursion I am having troubles understanding what is happening in this exampl...

[ 0.0042724609375, 0.0181884765625, 0.00885009765625, 0.01055908203125, 0.0026397705078125, 0.0152587890625, 0.00494384765625, -0.002044677734375, -0.00274658203125, -0.010498046875, 0.0001049041748046875, -0.00958251953125, -0.01904296875, 0.004180908203125, 0.0272216796875, -0.00476074...

[ 134031, 1250, 4867, 14240, 37348, 678, 4420, 125728, 214, 81979, 195625, 1830, 502, 39457, 42, 8962, 63134, 7, 100094, 83, 123087, 27781, 117615, 138, 89536, 22408, 144053, 748, 9655, 297, 22542, 289, 1542, 247, 1221, 5117, 538, 8337, 757, ...

[ 0.162353515625, 0.1585693359375, 0.252197265625, 0.18994140625, 0.12744140625, 0.0240325927734375, 0.154296875, 0.264892578125, 0.058837890625, 0.1580810546875, 0.19091796875, 0.0682373046875, 0.15625, 0.19775390625, 0.09283447265625, 0.09442138671875, 0.049774169921875, 0.00289916...

embed

27907608_c0

27907608

prolog

0

Title: Prolog with inequalities Problem title: Prolog with inequalities Tags: prolog, clpq, inequalities Problem: Prolog with inequalities I found this inequality solving program from some Internet source.It works well.This is the program. :-use_module(library(clpq)). dec_inc(Left,Right):- copy_term(Left-Right,CopyLeft...

Prolog with inequalities Prolog with inequalities prolog clpq inequalities Prolog use_module dec_inc Left Right copy_term Left-Right CopyLeft-CopyRight tell_cs CopyLeft CopyRight Leq P1s ERROR Unhandled _G3082 Prolog with inequalities I found this inequality solving program from some Internet source.It works well.This ...

[ 0.000774383544921875, -0.003570556640625, 0.00982666015625, 0.0185546875, 0.002960205078125, 0.0184326171875, 0.0079345703125, -0.00531005859375, 0.004119873046875, -0.0247802734375, -0.0032806396484375, -0.00022029876708984375, 0.009765625, 0.0027313232421875, 0.0155029296875, 0.00384...

[ 1250, 4867, 678, 23, 13, 71723, 31075, 502, 254, 864, 4527, 83279, 57865, 38893, 2480, 90911, 43658, 32166, 22553, 146930, 6493, 14192, 4439, 636, 436, 418, 151206, 24638, 992, 79628, 724, 1197, 12012, 14037, 161789, 3115, 6496, 1528, 31344...

[ 0.194091796875, 0.2802734375, 0.102783203125, 0.1146240234375, 0.119384765625, 0.19580078125, 0.109619140625, 0.11767578125, 0.004608154296875, 0.1195068359375, 0.055816650390625, 0.1107177734375, 0.1728515625, 0.1092529296875, 0.0614013671875, 0.07562255859375, 0.101806640625, 0.1...

embed

19675977_c0

19675977

prolog

0

Title: Prolog, check if term is power of 2 Problem title: Prolog, check if term is power of 2 Tags: successor-arithmetics, prolog Problem: Prolog, check if term is power of 2 i have written following code, which should work with my logic, but it does not. I should check if given term is power of two. For example s(s(s(...

Prolog, check if term is power of 2 Prolog, check if term is power of 2 successor-arithmetics prolog Prolog First Prolog, check if term is power of 2 i have written following code, which should work with my logic, but it does not. I should check if given term is power of two. For example s(s(s(nul))) should return fals...

[ 0.0162353515625, -0.005340576171875, 0.0115966796875, 0.013916015625, 0.0145263671875, -0.002471923828125, -0.0174560546875, 0.0186767578125, -0.01300048828125, -0.0240478515625, 0.010009765625, 0.0205078125, -0.03125, 0.00726318359375, 0.007476806640625, 0.0118408203125, 0.038574218...

[ 1250, 4867, 12765, 2174, 13579, 83, 14537, 111, 116, 39457, 42, 8962, 502, 23972, 25632, 18151, 4488, 62775, 34475, 6626, 91, 16524, 30646, 98320, 29568, 6528, 70, 39, 79385, 959, 101935, 8337, 14012, 3217, 382, 3447, 29806, 11522, 4358 ]

[ 0.14404296875, 0.2349853515625, 0.1793212890625, 0.0970458984375, 0.261962890625, 0.110107421875, 0.2152099609375, 0.168701171875, 0.23046875, 0.171142578125, 0.1019287109375, 0.046722412109375, 0.0928955078125, 0.068115234375, 0.040771484375, 0.08038330078125, 0.030853271484375, 0...

embed

72588896_c0

72588896

prolog

0

Title: Prolog: Find all equilateral triangles which are built from DB points Problem title: Prolog: Find all equilateral triangles which are built from DB points Tags: list, prolog Problem: Prolog: Find all equilateral triangles which are built from DB points I'm new to Prolog and my task requires finding all equilater...

Prolog: Find all equilateral triangles which are built from DB points Prolog: Find all equilateral triangles which are built from DB points list prolog DB Prolog Find Point_Sign Abscissa Ordinate db_filling List points_main Xs1 equilateral_triangles Points Res Prolog: Find all equilateral triangles which are built from...

[ 0.01202392578125, -0.0031280517578125, 0.00616455078125, 0.00921630859375, -0.006378173828125, 0.0086669921875, -0.0081787109375, 0.01214599609375, 0.0164794921875, -0.0137939453125, -0.0025634765625, -0.02783203125, 0.01397705078125, -0.021484375, -0.01519775390625, 0.0172119140625, ...

[ 1250, 4867, 12, 26040, 756, 60715, 141636, 1927, 109217, 7, 88303, 1295, 57976, 26847, 5303, 502, 41097, 218723, 27174, 318, 1192, 68149, 40041, 116115, 32036, 24931, 1193, 418, 3996, 9624, 3525, 66211, 144570, 90791, 16750, 20949, 31943, 682...

[ 0.14501953125, 0.2344970703125, 0.0323486328125, 0.1268310546875, 0.1026611328125, 0.1282958984375, 0.207763671875, 0.18701171875, 0.22119140625, 0.035614013671875, 0.105712890625, 0.0941162109375, 0.1802978515625, 0.177001953125, 0.12255859375, 0.09039306640625, 0.159912109375, 0....

embed

37649069_c0

37649069

prolog

0

Title: How to get the value of many elements of a matrix (list of lists) Problem title: How to get the value of many elements of a matrix (list of lists) Tags: prolog, matrix Problem: How to get the value of many elements of a matrix (list of lists) I have problems because I want to get the values of many grids of a ma...

How to get the value of many elements of a matrix (list of lists) How to get the value of many elements of a matrix (list of lists) prolog matrix How Len Matrix Row How to get the value of many elements of a matrix (list of lists) I have problems because I want to get the values of many grids of a matrix Example: I hav...

[ -0.007049560546875, 0.0087890625, 0.000667572021484375, 0.0067138671875, -0.011962890625, -0.006103515625, 0.00555419921875, 0.02099609375, 0.01153564453125, -0.0123291015625, 0.020263671875, 0.004669189453125, -0.0208740234375, -0.01031494140625, -0.01361083984375, 0.007171630859375, ...

[ 11249, 47, 2046, 70, 34292, 111, 5941, 80854, 50944, 425, 6562, 5303, 7, 502, 4867, 18226, 194234, 96190, 44402, 3444, 142424, 10314, 6468, 903, 2565, 38507, 1295, 176866, 22085, 8439, 13956, 21162, 2967, 54, 18151, 1653, 2063, 1632, 89536 ...

[ 0.0635986328125, 0.053466796875, 0.1510009765625, 0.09344482421875, 0.2342529296875, 0.07177734375, 0.204833984375, 0.221923828125, 0.1976318359375, 0.1396484375, 0.142822265625, 0.168212890625, 0.00579833984375, 0.14599609375, 0.197509765625, 0.1864013671875, 0.2105712890625, 0.21...

embed

55633243_c0

55633243

prolog

0

Title: How to inline a goal with findall/3, (use just one predicate)? Problem title: How to inline a goal with findall/3, (use just one predicate)? Tags: tuples, list, prolog-findall, prolog Problem: How to inline a goal with findall/3, (use just one predicate)? I have a knowledgebase that looks something like this fac...

How to inline a goal with findall/3, (use just one predicate)? How to inline a goal with findall/3, (use just one predicate)? tuples list prolog-findall prolog How fact1 fact2 find_item Val1 Val2 Items Item How to inline a goal with findall/3, (use just one predicate)? I have a knowledgebase that looks something like t...

[ 0.004425048828125, -0.0034332275390625, -0.000850677490234375, 0.011962890625, 0.00439453125, 0.00909423828125, -0.01055908203125, -0.00020694732666015625, 0.0098876953125, -0.032958984375, 0.01953125, 0.00830078125, 0.002532958984375, 0.005889892578125, -0.006988525390625, 0.005493164...

[ 11249, 23, 2256, 69236, 678, 7413, 5584, 18113, 4032, 1660, 1632, 1653, 2063, 67, 370, 99726, 5303, 502, 4867, 111607, 15824, 304, 217, 195, 4769, 78426, 10, 51359, 37382, 33342, 11907, 619, 27781, 101935, 14858, 42518, 120820, 1884, 4527, ...

[ 0.035003662109375, 0.1241455078125, 0.2447509765625, 0.2200927734375, 0.031341552734375, 0.1640625, 0.19140625, 0.2861328125, 0.057769775390625, 0.07666015625, 0.1077880859375, 0.1505126953125, 0.1561279296875, 0.058685302734375, 0.06719970703125, 0.1563720703125, 0.098388671875, 0...

embed

37380645_c1

37380645

prolog

1

//1 in the dcg/basics library? The error message says "character", but I can't find any useful reference as to what exactly this means and how to provide it with "proper" input. How do I pass a list of strings (tokens) to phrase/2 such that I can use integer//1 to parse a token as an integer? If there's no way to use t...

[ 0.015869140625, -0.0030670166015625, 0.000690460205078125, 0.03076171875, 0.0020294189453125, 0.02197265625, 0.0032958984375, -0.0303955078125, 0.00433349609375, -0.0264892578125, -0.01214599609375, -0.006927490234375, -0.0205078125, 0.00482177734375, -0.006591796875, 0.01007080078125,...

[ 4666, 418, 23, 104, 238, 177, 5918, 28021, 35773, 1294, 18499, 26008, 17378, 9254, 2263, 720, 80234, 91067, 26950, 22691, 442, 36290, 56, 107730, 11249, 27875, 5303, 79315, 6448, 1755, 47, 113860, 12477, 4527, 892, 1505, 64, 11583, 366, 1...

[ 0.1007080078125, 0.1639404296875, 0.039459228515625, 0.06500244140625, 0.0537109375, 0.1461181640625, 0.1414794921875, 0.1273193359375, 0.1396484375, 0.0504150390625, 0.179443359375, 0.100830078125, 0.003814697265625, 0.1383056640625, 0.1580810546875, 0.171875, 0.023712158203125, 0...

embed

10123201_c0

10123201

prolog

0

Title: Prolog List storage Problem title: Prolog List storage Tags: prolog Problem: Prolog List storage I have a program which generates a list, and at different stages removes certain elements from it. There are 4 removal stages, and calling the 4th will first call 1,2,3 then 4. the predicate is called s4(Q, 100) and ...

Prolog List storage Prolog List storage prolog Prolog List Further Prolog List storage I have a program which generates a list, and at different stages removes certain elements from it. There are 4 removal stages, and calling the 4th will first call 1,2,3 then 4. the predicate is called s4(Q, 100) and there are also s1...

[ 0.020751953125, 0.037109375, 0.002655029296875, -0.00274658203125, -0.0152587890625, 0.00006246566772460938, -0.0167236328125, 0.00738525390625, 0.0130615234375, -0.00799560546875, 0.00970458984375, 0.02294921875, -0.0167236328125, -0.00775146484375, -0.0068359375, 0.016357421875, 0....

[ 1250, 4867, 32036, 132096, 502, 1528, 139392, 5303, 12921, 36541, 87388, 80854, 1295, 201, 49146, 1405, 159029, 927, 5117, 11782, 25568, 363, 1398, 1653, 2063, 67, 35839, 91, 617, 2737, 805, 418, 304, 7, 5701, 479, 20623, 3559, 96819, 594...

[ 0.1297607421875, 0.2266845703125, 0.2020263671875, 0.1903076171875, 0.100341796875, 0.1473388671875, 0.1124267578125, 0.2161865234375, 0.0279693603515625, 0.1875, 0.1834716796875, 0.1566162109375, 0.05316162109375, 0.1236572265625, 0.1231689453125, 0.0938720703125, 0.1058349609375, ...

embed

70845148_c0

70845148

prolog

0

Title: How to determine if two propositional formulas are equivalent in Prolog? Problem title: How to determine if two propositional formulas are equivalent in Prolog? Tags: propositional-calculus, prolog, logic, boolean-logic Problem: How to determine if two propositional formulas are equivalent in Prolog? I'm new to ...

How to determine if two propositional formulas are equivalent in Prolog? How to determine if two propositional formulas are equivalent in Prolog? propositional-calculus prolog logic boolean-logic How Prolog How to determine if two propositional formulas are equivalent in Prolog? I'm new to Prolog and have some doubts. ...

[ 0.022216796875, 0.017333984375, 0.00823974609375, 0.0228271484375, -0.01129150390625, -0.01239013671875, 0.0042724609375, -0.0054931640625, -0.005889892578125, -0.00170135498046875, 0.00775146484375, 0.0162353515625, -0.0001430511474609375, 0.00714111328125, 0.0172119140625, 0.00315856...

[ 11249, 47, 83324, 2174, 6626, 89261, 289, 26168, 7, 621, 183234, 23, 1250, 4867, 6827, 94739, 502, 62775, 34677, 137043, 3525, 92814, 33022, 32354, 3173, 3181, 4, 571, 14192, 335, 62, 136, 134598, 5705, 18, 25443, 284, 32920, 149842, 1276...

[ 0.055419921875, 0.0787353515625, 0.170166015625, 0.106689453125, 0.1766357421875, 0.2451171875, 0.1549072265625, 0.2626953125, 0.07861328125, 0.1019287109375, 0.239990234375, 0.0889892578125, 0.176513671875, 0.254638671875, 0.0848388671875, 0.1092529296875, 0.10675048828125, 0.0812...

embed

73531158_c0

73531158

prolog

0

Title: Peeking past end-of-file with SICStus Prolog Problem title: Peeking past end-of-file with SICStus Prolog Tags: sicstus-prolog, prolog, iso-prolog Problem: Peeking past end-of-file with SICStus Prolog Suppose I have an empty file (imaginatively called empty ) in the current directory and run the following query. ...

Peeking past end-of-file with SICStus Prolog Peeking past end-of-file with SICStus Prolog sicstus-prolog prolog iso-prolog Peeking SICStus Prolog eof_action eof_code stream_property end_of_stream EOS0 peek_char EOS1 get_char EOS2 EOS3 EOS4 Peeking past end-of-file with SICStus Prolog Suppose I have an empty file (imagi...

[ 0.0029449462890625, 0.0072021484375, 0.01904296875, 0.00653076171875, -0.013427734375, -0.00628662109375, 0.00494384765625, 0.010498046875, 0.00482177734375, 0.01202392578125, 0.009033203125, 0.0240478515625, -0.0302734375, -0.0008544921875, 0.0005950927734375, -0.01251220703125, 0.0...

[ 1460, 343, 214, 11015, 3564, 4390, 29822, 678, 159, 102198, 2143, 1250, 4867, 26536, 18253, 3454, 502, 13882, 28, 44713, 40899, 75973, 36290, 56, 86429, 163795, 2389, 280, 9254, 418, 2046, 617, 201505, 11435, 172008, 43581, 14364, 11675, 25...

[ 0.182373046875, 0.2034912109375, 0.007476806640625, 0.1708984375, 0.1685791015625, 0.199462890625, 0.1419677734375, 0.0330810546875, 0.1058349609375, 0.07861328125, 0.2230224609375, 0.12451171875, 0.227294921875, 0.09466552734375, 0.1781005859375, 0.06787109375, 0.0679931640625, 0....

embed

30605398_c1

30605398

prolog

1

, User, [ GroupHead | UpdatedGroups ] ) :- updateGroupStrict(GroupsRest,UserGroups,User,UpdatedGroups). % Reduce strict helper, try next usergroup updateGroupStrict(Groups,[ _ | UserGroupTail ],User,UpdatedGroups) :- updateGroupStrict(Groups,UserGroupTail,User,UpdatedGroups). handle(Groups, _, userrequest( _, [ request...

[ -0.00927734375, 0.0235595703125, 0.01287841796875, 0.0224609375, -0.00921630859375, 0.03515625, -0.0223388671875, -0.01007080078125, 0.0267333984375, 0.0291748046875, 0.0108642578125, 0.015625, -0.01361083984375, 0.0023956298828125, -0.005859375, 0.017578125, 0.004791259765625, 0.0...

[ 53400, 10760, 13025, 712, 28641, 71, 205072, 7, 15772, 28350, 62233, 18, 1052, 525, 2189, 1062, 152872, 1745, 853, 106357, 81113, 4358, 56, 9790, 11737, 38937, 51588, 9874, 379, 34831, 50336, 26946, 47, 456, 75161, 94407, 5608, 150011, 4734...

[ 0.189453125, 0.2005615234375, 0.1673583984375, 0.130859375, 0.1759033203125, 0.062042236328125, 0.2113037109375, 0.02911376953125, 0.06671142578125, 0.21044921875, 0.181396484375, 0.0909423828125, 0.0643310546875, 0.1278076171875, 0.1063232421875, 0.029876708984375, 0.1351318359375, ...

embed

75844612_c0

75844612

prolog

0

Title: "Syntax error: Operator expected" with CLPFD Prolog Problem title: "Syntax error: Operator expected" with CLPFD Prolog Tags: clpfd, collatz, prolog Problem: "Syntax error: Operator expected" with CLPFD Prolog I'm reading The Power Of Prolog, and have got as far as the section on the Collatz s...

"Syntax error: Operator expected" with CLPFD Prolog "Syntax error: Operator expected" with CLPFD Prolog clpfd collatz prolog Syntax Operator CLPFD Prolog use_module Error "Syntax error: Operator expected" with CLPFD Prolog I'm reading The Power Of Prolog, and have got as far as the section on the Co...

[ 0.003448486328125, 0.000530242919921875, -0.0086669921875, 0.013427734375, 0.0224609375, 0.00384521484375, 0.01031494140625, 0.00016307830810546875, -0.01434326171875, -0.056884765625, 0.0023040771484375, -0.03515625, 0.00726318359375, -0.01092529296875, 0.021240234375, 0.0062866210937...

[ 3371, 86531, 18499, 150922, 84751, 678, 46323, 41265, 397, 1250, 4867, 33139, 39557, 71, 65780, 9136, 502, 19010, 4527, 83279, 212059, 16454, 17170, 6619, 88842, 257, 169, 944, 71200, 18151, 154107, 9790, 9969, 1340, 256, 379, 34165, 2424, ...

[ 0.1131591796875, 0.1881103515625, 0.1917724609375, 0.27734375, 0.22119140625, 0.0721435546875, 0.1199951171875, 0.1370849609375, 0.1591796875, 0.1295166015625, 0.190673828125, 0.012481689453125, 0.0848388671875, 0.10791015625, 0.038543701171875, 0.099853515625, 0.062255859375, 0.11...

embed

40987361_c1

40987361

prolog

1

[]), IP), treeP(IP). ip(SSem) --> np(NPSem), ibar(IbarSem), {var_replace(NPSem,NPSem1), beta(NPSem1@IbarSem,SSem)}. ibar(VPSem) --> i(MvdVbL),vp(VPSem,MvdVbL). i([]) --> []. i([]) --> [Aux],{isAux(Aux)}. i([Verb]) --> [InflVerb],{pastInfl(Verb,InflVerb),isVerb(Verb)}. pastInfl(see,saw). pastInfl(love,loved). vp(VbarSem...

[ -0.006134033203125, 0.0225830078125, -0.0013427734375, 0.0169677734375, 0.0091552734375, 0.0181884765625, -0.007354736328125, 0.00946044921875, 0.020263671875, -0.047119140625, 0.020263671875, 0.01129150390625, -0.00592041015625, 0.006866455078125, -0.00555419921875, 0.0010910034179687...

[ 378, 268, 247, 8021, 53201, 683, 132, 10931, 194, 17, 254, 15268, 195, 129908, 25037, 28814, 294, 1299, 568, 1961, 107, 23935, 17727, 51703, 418, 981, 8152, 5, 856, 9059, 594, 59805, 275, 866, 334, 1065, 6077, 164, 15896, 4153, 15991, ...

[ 0.11767578125, 0.112060546875, 0.1417236328125, 0.252197265625, 0.251953125, 0.2159423828125, 0.0282135009765625, 0.2213134765625, 0.0665283203125, 0.2132568359375, 0.200439453125, 0.127685546875, 0.2425537109375, 0.1146240234375, 0.2159423828125, 0.1566162109375, 0.10699462890625, ...

embed

16738388_c0

16738388

prolog

0

Title: How to use variables in Prolog query shell? Problem title: How to use variables in Prolog query shell? Tags: prolog-toplevel, declarative, prolog, swi-prolog Problem: How to use variables in Prolog query shell? I know that I can use variables in Prolog shell (something like using '$' character, I think...but I d...

How to use variables in Prolog query shell? How to use variables in Prolog query shell? prolog-toplevel declarative prolog swi-prolog How Prolog dataggare.txt ListaTesto TokenizedList ERROR How to use variables in Prolog query shell? I know that I can use variables in Prolog shell (something like using '$' character, I...

[ 0.02392578125, 0.01422119140625, -0.01153564453125, 0.033935546875, 0.00115966796875, -0.006195068359375, -0.01092529296875, 0.01507568359375, -0.009765625, -0.050048828125, 0.00811767578125, 0.01373291015625, -0.01068115234375, 0.001922607421875, 0.01495361328125, 0.00836181640625, ...

[ 11249, 4527, 77336, 7, 23, 1250, 4867, 41, 1294, 128019, 502, 13784, 67919, 21635, 2452, 3454, 2053, 31199, 107, 124326, 50085, 111337, 31, 717, 1098, 29367, 154663, 151206, 831, 17368, 4369, 62816, 71924, 4488, 6626, 111210, 174350, 12477, ...

[ 0.0472412109375, 0.155517578125, 0.294677734375, 0.137939453125, 0.04595947265625, 0.1680908203125, 0.2376708984375, 0.0875244140625, 0.08251953125, 0.2191162109375, 0.0814208984375, 0.036407470703125, 0.092041015625, 0.0784912109375, 0.06597900390625, 0.06939697265625, 0.04296875, ...

embed

70531545_c0

70531545

prolog

0

Title: SWI Prolog: avoiding name clashes between builtin predicates and dynamic predicates Problem title: SWI Prolog: avoiding name clashes between builtin predicates and dynamic predicates Tags: swi-prolog, prolog, module Problem: SWI Prolog: avoiding name clashes between builtin predicates and dynamic predicates I'm ...

SWI Prolog: avoiding name clashes between builtin predicates and dynamic predicates SWI Prolog: avoiding name clashes between builtin predicates and dynamic predicates swi-prolog prolog module SWI Prolog delete_import_module foo:halt ERROR toplevel_call user:user lib64 swipl-8.4.1 toplevel.pl:1117 system:halt SWI Prolo...

[ -0.0020599365234375, 0.004150390625, 0.0185546875, -0.0008087158203125, -0.029296875, 0.004180908203125, 0.00830078125, 0.00341796875, 0.00130462646484375, -0.0284423828125, -0.0001430511474609375, 0.0135498046875, -0.01446533203125, -0.0223388671875, 0.02734375, -0.00885009765625, 0...

[ 159, 38969, 1250, 4867, 71864, 9351, 26580, 114942, 17721, 88303, 73, 1653, 2063, 84079, 2452, 3454, 502, 88996, 154109, 60270, 83279, 5775, 31, 23766, 151206, 24638, 2663, 67919, 85763, 65918, 25474, 13307, 2424, 17376, 120518, 2489, 5426, 7...

[ 0.03466796875, 0.1998291015625, 0.1435546875, 0.1864013671875, 0.115234375, 0.1156005859375, 0.1514892578125, 0.07232666015625, 0.044647216796875, 0.153564453125, 0.1474609375, 0.1949462890625, 0.2139892578125, 0.225830078125, 0.1715087890625, 0.0755615234375, 0.08740234375, 0.2133...

embed

73323531_c0

73323531

prolog

0

Title: verify the occurence of an element a set of times between every pair of digits that add up to 10 Prolog Problem title: verify the occurence of an element a set of times between every pair of digits that add up to 10 Prolog Tags: prolog Problem: verify the occurence of an element a set of times between every pair...

verify the occurence of an element a set of times between every pair of digits that add up to 10 Prolog verify the occurence of an element a set of times between every pair of digits that add up to 10 Prolog prolog Prolog Elt Occ Help verify the occurence of an element a set of times between every pair of digits that a...

[ 0.025634765625, -0.002838134765625, -0.00634765625, 0.016845703125, -0.00177001953125, 0.003936767578125, -0.022216796875, -0.0023651123046875, 0.005950927734375, -0.018310546875, 0.01202392578125, -0.0125732421875, 0.00823974609375, -0.006927490234375, -0.01446533203125, -0.0201416015...

[ 493, 40383, 74918, 6620, 12830, 5423, 20028, 17721, 11907, 80836, 153939, 7, 15190, 1257, 209, 1250, 4867, 502, 540, 18, 180, 10060, 39527, 3871, 33022, 1653, 2063, 67, 154663, 7623, 670, 214493, 2174, 66161, 4068, 42, 275, 910, 617, 5762...

[ 0.202392578125, 0.2391357421875, 0.219970703125, 0.1400146484375, 0.23095703125, 0.1217041015625, 0.1954345703125, 0.1834716796875, 0.11328125, 0.195068359375, 0.2298583984375, 0.0173492431640625, 0.138916015625, 0.05804443359375, 0.189453125, 0.156982421875, 0.2305908203125, 0.103...

embed

26561848_c1

26561848

prolog

1

each result to find_palindrome , but I thought I might be able to do everything via backtracking. find_loop(Word, Loop) :- zip(Word, 0, WZ), length(Word, WL), Word_length is WL - 1, [X|_] = WZ, find_another(X, Word_length, WZ, [X], Loop). /* Get a element with same letter if not in history, explore further via its pal...

[ 0.00653076171875, -0.00970458984375, -0.00384521484375, 0.01611328125, 0.00037384033203125, 0.00872802734375, 0.01611328125, 0.0045166015625, 0.0263671875, -0.052001953125, 0.0213623046875, 0.01214599609375, 0.004730224609375, 0.0130615234375, 0.00579833984375, -0.0089111328125, -0.0...

[ 12638, 16750, 7413, 5007, 73, 102851, 1284, 17569, 13648, 19048, 54, 26818, 1829, 4420, 125728, 214, 28354, 164805, 4, 199694, 15772, 68330, 757, 1511, 140909, 181280, 22543, 23986, 927, 83, 106, 1542, 66, 126340, 20779, 12830, 678, 5701, 3...

[ 0.0963134765625, 0.163818359375, 0.184814453125, 0.1602783203125, 0.1153564453125, 0.2288818359375, 0.002838134765625, 0.06744384765625, 0.050689697265625, 0.050201416015625, 0.053558349609375, 0.0968017578125, 0.043243408203125, 0.14453125, 0.2474365234375, 0.1116943359375, 0.248046...

embed

15834386_c1

15834386

prolog

1

), fail ) ; true ), arg(1, S, Rev), reverse(Rev, Path_to_goal). I tried to use JPL from SWI Prolog but I wasn't able to run it because of severel exceptions pointing out, that Eclipse wasn't able to find the library correctly. I always get one of the following Exceptions: Exception in thread "main" java.lang.Unsatisfie...

[ -0.0021209716796875, 0.031494140625, 0.0196533203125, -0.0023193359375, -0.0272216796875, -0.00421142578125, 0.007293701171875, 0.002532958984375, 0.0030364990234375, -0.042236328125, 0.00482177734375, 0.0269775390625, -0.0238037109375, -0.00567626953125, -0.000335693359375, 0.00256347...

[ 35782, 29568, 79459, 159, 80893, 39531, 184, 4332, 334, 108421, 188, 519, 289, 37842, 4527, 821, 21130, 38969, 1250, 4867, 18, 19048, 11675, 27708, 583, 131527, 234962, 7413, 35773, 1294, 26785, 11343, 218288, 17514, 5443, 63928, 86997, 24931...

[ 0.17626953125, 0.06134033203125, 0.13232421875, 0.0614013671875, 0.134521484375, 0.0777587890625, 0.0219879150390625, 0.03668212890625, 0.0899658203125, 0.1351318359375, 0.1195068359375, 0.0919189453125, 0.08856201171875, 0.0030517578125, 0.0802001953125, 0.1435546875, 0.268798828125...

embed

33009427_c0

33009427

prolog

0

Title: test if the term N is a number or an atom an compute if it number in prolog Problem title: test if the term N is a number or an atom an compute if it number in prolog Tags: prolog, expression Problem: test if the term N is a number or an atom an compute if it number in prolog I am doing an arithmetic expression ...

test if the term N is a number or an atom an compute if it number in prolog test if the term N is a number or an atom an compute if it number in prolog prolog expression Val _Var _Val test if the term N is a number or an atom an compute if it number in prolog I am doing an arithmetic expression in prolog. the predicate...

[ -0.00994873046875, -0.00860595703125, 0.03125, 0.034912109375, 0.0196533203125, 0.02001953125, 0.0198974609375, 0.027587890625, -0.0159912109375, -0.00982666015625, 0.002349853515625, 0.00579833984375, -0.01129150390625, -0.0033721923828125, 0.01123046875, 0.003814697265625, 0.011718...

[ 3034, 2174, 13579, 541, 83, 14012, 707, 34627, 9969, 6743, 442, 23, 502, 4867, 142, 125195, 4769, 101, 81827, 42272, 8962, 1653, 2063, 1884, 83613, 42, 194, 16750, 1650, 4488, 7413, 3444, 959, 5, 765, 36766, 120262, 7225, 25737, 140992, ...

[ 0.18359375, 0.089111328125, 0.2171630859375, 0.217041015625, 0.1148681640625, 0.2357177734375, 0.11328125, 0.264892578125, 0.1141357421875, 0.130126953125, 0.0535888671875, 0.04937744140625, 0.1768798828125, 0.233642578125, 0.03814697265625, 0.1793212890625, 0.2010498046875, 0.0011...

embed

76805793_c1

76805793

prolog

1

and values: % find all properties and values for one object findEveryPropertyWithValue(Object, Properties) :- % get one object ... instanceOf(Object, physicalObject), % find every property of every object findall((Property, Value), (propertyOf(Property, Object), hasValue(Property, Value)), Properties). % find all obje...

[ 0.0091552734375, -0.0191650390625, 0.00457763671875, -0.003387451171875, -0.00604248046875, 0.0118408203125, -0.01043701171875, -0.0172119140625, 0.027587890625, -0.01287841796875, 0.0027008056640625, 0.006622314453125, 0.0079345703125, -0.0380859375, -0.006011962890625, 0.022827148437...

[ 136, 142424, 1745, 7413, 756, 183871, 100, 1632, 36746, 200647, 10752, 1264, 939, 194583, 856, 50770, 46471, 75161, 234994, 15772, 2046, 110527, 132887, 72761, 11907, 57266, 5584, 190060, 36290, 56, 134549, 1556, 678, 43512, 132, 2940, 6863, ...

[ 0.1456298828125, 0.249267578125, 0.13427734375, 0.19970703125, 0.184814453125, 0.26611328125, 0.0276336669921875, 0.0833740234375, 0.195556640625, 0.183837890625, 0.07574462890625, 0.1339111328125, 0.1265869140625, 0.1715087890625, 0.1522216796875, 0.2186279296875, 0.104248046875, ...

embed

69424576_c0

69424576

prolog

0

Title: How to compile a prolog question correctly? Problem title: How to compile a prolog question correctly? Tags: prolog Problem: How to compile a prolog question correctly? I am working on a prolog problem and need some help here. /*Write a predicate listtran(L,E) which translates a list of Latin number words * to t...

How to compile a prolog question correctly? How to compile a prolog question correctly? prolog recursion How Write Latin English Clauses How to compile a prolog question correctly? I am working on a prolog problem and need some help here. What is needed to be written in predicates and query to test: and Also, what can ...

[ 0.00421142578125, 0.004608154296875, 0.019287109375, 0.00201416015625, 0.0031280517578125, 0.01458740234375, -0.016845703125, -0.0021820068359375, 0.015869140625, -0.03125, -0.00384521484375, -0.003875732421875, -0.000675201416015625, -0.007171630859375, 0.0026702880859375, 0.020385742...

[ 11249, 47, 9969, 1340, 502, 4867, 9655, 26785, 538, 10, 195625, 1830, 601, 18781, 42845, 14941, 100700, 90, 20697, 2967, 4358, 44841, 59121, 23, 1653, 2063, 136, 41, 1294, 3034, 71864, 18499, 26008 ]

[ 0.0755615234375, 0.034637451171875, 0.1622314453125, 0.1739501953125, 0.1702880859375, 0.2423095703125, 0.1949462890625, 0.1153564453125, 0.0723876953125, 0.046173095703125, 0.1484375, 0.0160980224609375, 0.0321044921875, 0.079833984375, 0.1593017578125, 0.1361083984375, 0.1381835937...

embed

64251931_c1

64251931

prolog

1

berdeen',united_kingdom,'Grampian',219100). city('Aberystwyth',united_kingdom,'Ceredigion',null). city('Abha',saudi_arabia,'Aseer',null). city('Abidjan',cote_divoire,'Lagunes',null). city('Abilene',united_states,'Texas',106707). city('Aboisso',cote_divoire,'Sud-Comoe',null). city('Abu Dhabi',united_arab_emirates,'Abu D...

[ 0.006134033203125, 0.00830078125, -0.005859375, 0.017578125, -0.0157470703125, 0.01611328125, 0.0152587890625, -0.01397705078125, 0.0157470703125, -0.01422119140625, 0.01806640625, -0.01556396484375, -0.023193359375, -0.039794921875, -0.00799560546875, -0.019287109375, -0.00842285156...

[ 112845, 33, 25, 4, 5980, 3674, 454, 6048, 3815, 37878, 36181, 19, 304, 2947, 3559, 194, 26349, 132, 284, 1297, 54726, 120426, 56, 29251, 1830, 139550, 14832, 7, 41004, 11, 74883, 184, 34833, 2864, 587, 67, 30618, 50724, 2729, 6967, 5462...

[ 0.272216796875, 0.23876953125, 0.0767822265625, 0.0748291015625, 0.129150390625, 0.125244140625, 0.002593994140625, 0.1385498046875, 0.1634521484375, 0.082763671875, 0.19921875, 0.1475830078125, 0.050506591796875, 0.1640625, 0.2435302734375, 0.08953857421875, 0.2373046875, 0.044647...

embed

29404380_c0

29404380

prolog

0

Title: Unable to make facts dynamic in SWI-Prolog Problem title: Unable to make facts dynamic in SWI-Prolog Tags: prolog, prolog-directive-dynamic Problem: Unable to make facts dynamic in SWI-Prolog I would like to be able to retract and assert facts dynamically for the procedure location : location(egg, duck_pen). Bas...

Unable to make facts dynamic in SWI-Prolog Unable to make facts dynamic in SWI-Prolog prolog prolog-directive-dynamic Unable SWI-Prolog duck_pen Use redefine_system_predicate Head ERROR Unable to make facts dynamic in SWI-Prolog I would like to be able to retract and assert facts dynamically for the procedure location ...

[ 0.025390625, 0.0142822265625, 0.0263671875, 0.007415771484375, -0.010986328125, 0.0028533935546875, 0.00130462646484375, 0.018310546875, -0.01458740234375, -0.02880859375, -0.002105712890625, 0.0062255859375, -0.036865234375, -0.02880859375, 0.027587890625, -0.001190185546875, 0.0178...

[ 992, 2886, 3249, 15824, 7, 84079, 159, 38969, 9, 10752, 4867, 23, 502, 936, 100034, 242554, 115, 2594, 2278, 36836, 15265, 64552, 16751, 19714, 2063, 44816, 151206, 1884, 19048, 41499, 15390, 237, 33657, 50491, 31913, 67660, 1118, 168081, 2...

[ 0.09332275390625, 0.17236328125, 0.1220703125, 0.2191162109375, 0.1234130859375, 0.266357421875, 0.083740234375, 0.2362060546875, 0.0074462890625, 0.176513671875, 0.2113037109375, 0.0146484375, 0.14697265625, 0.1094970703125, 0.134033203125, 0.246826171875, 0.1087646484375, 0.09326...

embed

33786779_c0

33786779

prolog

0

Title: Prolog: removing all consecutive integer sublists Problem title: Prolog: removing all consecutive integer sublists Tags: prolog, list, sublist Problem: Prolog: removing all consecutive integer sublists So I ran into this Prolog problem: Given a linear numerical list remove all sequences of consecutive values. E....

Prolog: removing all consecutive integer sublists Prolog: removing all consecutive integer sublists prolog list sublist Prolog P-1 Here Prolog: removing all consecutive integer sublists So I ran into this Prolog problem: I managed to write this code: It almost works on some cases like: It's that it takes the last numbe...

[ -0.00396728515625, 0.020263671875, 0.0015411376953125, 0.00360107421875, -0.0220947265625, 0.00311279296875, -0.01190185546875, 0.0185546875, -0.003082275390625, -0.010009765625, 0.00262451171875, 0.03125, -0.007232666015625, 0.0012054443359375, 0.0081787109375, 0.01177978515625, 0.0...

[ 1250, 4867, 49146, 6496, 756, 148390, 892, 1505, 1614, 6562, 502, 5303, 436, 5759, 2967, 145755, 33022, 903, 18151, 39555, 43240, 51776, 4568, 14012, 118055, 40, 944, 177229, 7077, 11737, 29954, 444, 20594, 44691 ]

[ 0.1552734375, 0.2200927734375, 0.114501953125, 0.0579833984375, 0.1318359375, 0.1727294921875, 0.0869140625, 0.0557861328125, 0.1903076171875, 0.20556640625, 0.0965576171875, 0.08709716796875, 0.010406494140625, 0.042236328125, 0.053314208984375, 0.03948974609375, 0.019622802734375, ...

embed

30556410_c0

30556410

prolog

0

Title: Prolog: append is failing inside loop Problem title: Prolog: append is failing inside loop Tags: prolog Problem: Prolog: append is failing inside loop I have the following Prolog code: my_function(A):- my_function(A,[],1). my_function(A,List,Num):- Num_new is Num+1, generateL(O,S,L), write(L),nl, %append(L,List,...

Prolog: append is failing inside loop Prolog: append is failing inside loop prolog Prolog my_function List Num Num_new List_New Prolog: append is failing inside loop I have the following Prolog code: Which is working. It loops through 19 times, calls generateL which generates a new term L which I print to the screen. I...

[ 0.001739501953125, -0.0027313232421875, 0.00970458984375, -0.00579833984375, 0.00384521484375, 0.006988525390625, 0.0003147125244140625, 0.01019287109375, 0.0247802734375, -0.0279541015625, 0.0235595703125, -0.01165771484375, -0.00830078125, 0.00347900390625, 0.031005859375, -0.0007095...

[ 1250, 4867, 114689, 71, 83, 35782, 214, 46132, 40956, 502, 759, 137175, 32036, 52782, 54936, 46568, 25632, 18151, 130078, 20697, 8305, 953, 20028, 11782, 139392, 866, 3525, 13579, 339, 28412, 49119, 3444, 12638, 720, 47, 5303, 28282, 115081, ...

[ 0.15966796875, 0.208251953125, 0.2327880859375, 0.206298828125, 0.02581787109375, 0.1824951171875, 0.1026611328125, 0.178955078125, 0.190185546875, 0.12548828125, 0.0528564453125, 0.12451171875, 0.15380859375, 0.127685546875, 0.1351318359375, 0.16259765625, 0.0305938720703125, 0.09...

embed

47349145_c0

47349145

prolog

0

Title: prolog successor state axiom ERROR: Out of local stack Problem title: prolog successor state axiom ERROR: Out of local stack Tags: wumpus-world, prolog Problem: prolog successor state axiom ERROR: Out of local stack I am trying to formulate a successor state axiom for an agent that moves (north,south,west,east) ...

prolog successor state axiom ERROR: Out of local stack prolog successor state axiom ERROR: Out of local stack wumpus-world prolog ERROR Out X-1 Y-1 prolog successor state axiom ERROR: Out of local stack I am trying to formulate a successor state axiom for an agent that moves (north,south,west,east) in a 4x4 grid. The g...

[ 0.0225830078125, 0.03564453125, -0.0128173828125, 0.0196533203125, -0.01416015625, -0.0028228759765625, -0.0238037109375, 0.024169921875, -0.01220703125, -0.005096435546875, 0.01080322265625, 0.031494140625, 0.00131988525390625, -0.01300048828125, 0.0255126953125, 0.006683349609375, ...

[ 502, 4867, 39457, 42, 11341, 5134, 306, 151206, 24638, 13538, 111, 4000, 177261, 148, 316, 7332, 32554, 1193, 5759, 990, 31577, 26168, 10, 23882, 25813, 25617, 201, 425, 617, 120067, 6626, 174408, 69276, 90105, 61475, 19069, 138, 363, 5608,...

[ 0.149658203125, 0.2205810546875, 0.2069091796875, 0.09454345703125, 0.1298828125, 0.1285400390625, 0.1719970703125, 0.1441650390625, 0.095458984375, 0.2139892578125, 0.2098388671875, 0.190185546875, 0.240966796875, 0.023162841796875, 0.07830810546875, 0.21484375, 0.1270751953125, 0...

embed

55044140_c1

55044140

prolog

1

:1], <compound json/1>, <compound suspension/9>) ERROR: [20,760,488] xsd2json:json___3__0('C:\proj_xsd\ref\p1_v1.xsd', '<garbage_collected>', '<garbage _collected>', '<garbage_collected>') ERROR: [20,760,486] xsd2json:node___6__41__1__75('<garbage_collected>', <compound ns/2>, [length:2], <compound suspension/12>, [len...

[ -0.0022430419921875, 0.0301513671875, -0.0019378662109375, 0.0089111328125, -0.006256103515625, 0.0093994140625, -0.0206298828125, -0.01092529296875, 0.0038909912109375, -0.005401611328125, 0.020751953125, 0.0023956298828125, -0.001007080078125, -0.007080078125, 0.032958984375, -0.0029...

[ 152, 76172, 771, 7030, 1647, 1681, 11583, 277, 72179, 1830, 22364, 151206, 24638, 1549, 4, 110216, 161414, 1022, 7, 71, 304, 170, 363, 2389, 3454, 425, 29087, 418, 334, 1970, 402, 196352, 159645, 157, 8894, 6873, 1779, 12477, 23986, 22875...

[ 0.0219268798828125, 0.0897216796875, 0.153076171875, 0.1463623046875, 0.1328125, 0.2237548828125, 0.0699462890625, 0.0230255126953125, 0.2335205078125, 0.138916015625, 0.1510009765625, 0.20849609375, 0.1693115234375, 0.1119384765625, 0.014434814453125, 0.207275390625, 0.22900390625, ...

embed

47624626_c1

47624626

prolog

1

ith,alan). parent(charles,marc). parent(charles,kim). parent(charles,missy). parent(charles,eric). parent(eleanor,marc). parent(eleanor,kim). parent(eleanor,missy). parent(eleanor,eric). parent(eric,matty). parent(eric,tyler). parent(eric,kaydi). parent(amy,matty). parent(amy,tyler). parent(amy,kaydi). parent(missy,jor...

[ -0.0021209716796875, 0.009765625, 0.00823974609375, 0.0185546875, -0.0206298828125, 0.00054931640625, -0.0113525390625, 0.00982666015625, -0.006103515625, -0.06494140625, -0.0021514892578125, -0.0277099609375, 0.0033416748046875, 0.0274658203125, -0.00390625, -0.01318359375, 0.003311...

[ 6, 8962, 4, 9091, 194, 49129, 132, 9254, 1577, 1727, 238, 8103, 45188, 53, 1771, 1018, 66, 748, 2227, 939, 603, 16715, 35624, 105379, 145, 425, 1681, 1098, 5556, 5861, 30854, 65844, 1390, 195, 2397, 12862, 4293, 5636, 76, 516, 1760, 1...

[ 0.0614013671875, 0.26904296875, 0.09033203125, 0.2315673828125, 0.1280517578125, 0.250732421875, 0.0634765625, 0.110595703125, 0.141357421875, 0.138671875, 0.1202392578125, 0.2001953125, 0.1177978515625, 0.15478515625, 0.126708984375, 0.008819580078125, 0.10455322265625, 0.16552734...

embed

36414282_c0

36414282

prolog

0

Title: Propositional Logic Subformula in Prolog Problem title: Propositional Logic Subformula in Prolog Tags: prolog Problem: Propositional Logic Subformula in Prolog This is a prolog program which defines the syntax of propositional logic So I'm stuck trying to find where X is a sub formula of Y. I have made the follo...

Propositional Logic Subformula in Prolog Propositional Logic Subformula in Prolog prolog Propositional Logic Subformula Prolog Our Double Propositional Logic Subformula in Prolog This is a prolog program which defines the syntax of propositional logic So I'm stuck trying to find where X is a sub formula of Y. I have ma...

[ 0.0103759765625, -0.0028076171875, 0.018798828125, 0.0162353515625, -0.0162353515625, 0.004669189453125, 0.008544921875, 0.007537841796875, 0.007080078125, 0.000469207763671875, -0.0126953125, 0.002044677734375, -0.01123046875, -0.01251220703125, 0.00213623046875, 0.005035400390625, ...

[ 1250, 40322, 289, 50592, 8273, 2472, 19908, 23, 4867, 238, 502, 22929, 107172, 1528, 61924, 6002, 86531, 89261, 62775, 179933, 31577, 47, 7413, 7440, 1193, 83, 10, 1614, 26168, 111, 990, 7228, 25632, 1653, 2063, 19441, 44402, 9077, 7103, ...

[ 0.190673828125, 0.183349609375, 0.08880615234375, 0.1881103515625, 0.2032470703125, 0.1866455078125, 0.181884765625, 0.06719970703125, 0.252685546875, 0.010009765625, 0.135009765625, 0.05499267578125, 0.178466796875, 0.1279296875, 0.07159423828125, 0.04864501953125, 0.14453125, 0.1...

embed

61481504_c0

61481504

prolog

0

Title: Variables appearing in the wrong order Problem title: Variables appearing in the wrong order Tags: prolog Problem: Variables appearing in the wrong order So, I am doing a Prolog question and am having issues with how it runs. the question asks for me to "Write a predicate myencode/2 that takes the uncompressed l...

Variables appearing in the wrong order Variables appearing in the wrong order prolog Variables myencode_modified Variables appearing in the wrong order So, I am doing a Prolog question and am having issues with how it runs. the question asks for me to "Write a predicate myencode/2 that takes the uncompressed list as a ...

[ 0.03173828125, -0.0072021484375, -0.0079345703125, 0.00518798828125, -0.01177978515625, 0.0142822265625, -0.0159912109375, 0.003997802734375, 0.005279541015625, 0.00836181640625, 0.021240234375, 0.01019287109375, -0.00022029876708984375, 0.0128173828125, -0.005645751953125, 0.013488769...

[ 111477, 13566, 108975, 214, 23, 44691, 12989, 502, 4867, 759, 33, 40899, 13415, 47314, 20594, 1250, 9655, 19441, 37348, 3642, 127877, 18781, 1653, 2063, 67, 12477, 51776, 51, 277, 11856, 5303, 237, 5117, 171859, 30646, 375, 127887, 17932, 4...

[ 0.215087890625, 0.15625, 0.1446533203125, 0.03729248046875, 0.06500244140625, 0.1640625, 0.2069091796875, 0.1480712890625, 0.2342529296875, 0.1268310546875, 0.1422119140625, 0.279541015625, 0.0889892578125, 0.0443115234375, 0.019622802734375, 0.1656494140625, 0.083984375, 0.0070495...

embed

47425949_c0

47425949

prolog

0

Title: Prolog: calculate index for a list of list Problem title: Prolog: calculate index for a list of list Tags: prolog Problem: Prolog: calculate index for a list of list I'm new to prolog. I want to implement a predict called high/3. This predict supports two scenarios: One is to return the index of one character in...

Prolog: calculate index for a list of list Prolog: calculate index for a list of list prolog Prolog Head Tail Prolog: calculate index for a list of list I'm new to prolog. I want to implement a predict called high/3. This predict supports two scenarios: One is to return the index of one character in a list of list, for...

[ 0.0078125, 0.00982666015625, 0.005828857421875, -0.00994873046875, -0.009033203125, -0.005096435546875, 0.004486083984375, 0.0002880096435546875, 0.020263671875, -0.01708984375, 0.0208740234375, -0.0242919921875, -0.006317138671875, 0.01385498046875, 0, -0.0068359375, 0.0419921875, ...

[ 1250, 4867, 74481, 67, 63262, 100, 5303, 111, 502, 44816, 1218, 379, 3525, 3444, 29479, 92054, 35839, 11192, 18113, 8060, 6626, 106117, 30646, 1632, 62816, 17932, 22691, 5608, 756, 124850, 19069, 80581, 3293, 4734, 43240, 5117, 4488, 155965, ...

[ 0.168701171875, 0.2220458984375, 0.2171630859375, 0.072509765625, 0.280517578125, 0.1142578125, 0.199462890625, 0.055145263671875, 0.130126953125, 0.06207275390625, 0.08203125, 0.0762939453125, 0.039947509765625, 0.0265655517578125, 0.11767578125, 0.235107421875, 0.01092529296875, ...

embed

23015420_c0

23015420

prolog

0

Title: Is there any tool that can automatically generate Prolog callable interface from C functions? Problem title: Is there any tool that can automatically generate Prolog callable interface from C functions? Tags: gnu-prolog, prolog Problem: Is there any tool that can automatically generate Prolog callable interface ...

Is there any tool that can automatically generate Prolog callable interface from C functions? Is there any tool that can automatically generate Prolog callable interface from C functions? gnu-prolog prolog C Prolog gprolog.h PlBool add_interface Is there any tool that can automatically generate Prolog callable interfac...

[ 0.0294189453125, 0.0213623046875, -0.0019989013671875, 0.0002956390380859375, -0.01214599609375, 0.01202392578125, -0.0025177001953125, -0.01171875, 0.0086669921875, -0.07275390625, -0.00811767578125, 0.005584716796875, -0.038330078125, -0.0036163330078125, 0.022705078125, -0.025268554...

[ 2499, 55516, 450, 831, 191082, 139392, 1250, 4867, 11782, 2886, 101758, 1295, 313, 32354, 104155, 3454, 502, 127, 29016, 12647, 929, 15190, 10433, 40404, 2685, 198343, 17368, 21334, 14012, 165132, 10752, 27781, 3444, 18151, 3871, 28282, 184017,...

[ 0.0701904296875, 0.258056640625, 0.0240478515625, 0.076416015625, 0.2313232421875, 0.2119140625, 0.192626953125, 0.265625, 0.1778564453125, 0.149658203125, 0.250732421875, 0.1097412109375, 0.169921875, 0.2076416015625, 0.1304931640625, 0.1419677734375, 0.121826171875, 0.08154296875...

embed

47983744_c0

47983744

prolog

0

Title: Show only differences in statements Problem title: Show only differences in statements Tags: prolog Problem: Show only differences in statements reservation("8V32EU", "John", "Doe", "27B", "YYZ", "CPH", "SAS"). reservation("8V32EU2", "Jane", "Doe", "27B", "YYZ", "CPH", "SAS"). reservation("94ISCU", "John", "Doe"...

Show only differences in statements Show only differences in statements prolog Show John Doe YYZ CPH SAS Jane FDSDD3 ROU double_reservations BookingCode SeatNo Fname Lname Show only differences in statements Say I have these statements. There was a glitch and John and Jane booked the same seat on the same flight. (firs...

[ 0.0172119140625, -0.0015106201171875, 0.0079345703125, -0.01092529296875, 0.03271484375, 0.0027923583984375, -0.01263427734375, 0.006988525390625, 0.0167236328125, -0.01483154296875, -0.013671875, 0.0034637451171875, 0.002166748046875, 0.00433349609375, 0.00274658203125, 0.014709472656...

[ 17367, 4734, 60212, 7, 23, 63805, 502, 4867, 4939, 984, 13, 108354, 1511, 54259, 105082, 48511, 24057, 363, 627, 32616, 41929, 107, 65756, 52722, 114211, 503, 257, 5021, 11627, 339, 87, 765, 6097, 1978, 18, 206, 136, 12877, 5701, 40, 11...

[ 0.1590576171875, 0.1622314453125, 0.2200927734375, 0.108154296875, 0.119384765625, 0.236572265625, 0.121826171875, 0.1639404296875, 0.1898193359375, 0.1309814453125, 0.117431640625, 0.06939697265625, 0.066162109375, 0.1085205078125, 0.1436767578125, 0.2158203125, 0.042938232421875, ...

embed

60591072_c1

60591072

prolog

1

seems to make us write: setof(Ax, (..., subset(MovAx, MovIn)) , ActOut). Develop the ... ... setof(Ax, ( setof(Mx,starsin(Mx,Ax),MovAx) , subset(MovIn, MovAx) ) , ActOut). This seems to be it already! The feel when there are λ Expressions but there is no λ on the keyboard or in the syntax. Done! Wrap up into predicate...

[ -0.008056640625, -0.01171875, 0.042236328125, 0.00628662109375, -0.0093994140625, 0.018310546875, -0.00518798828125, 0.0263671875, 0.01409912109375, -0.01171875, 0.0162353515625, 0.01470947265625, 0.021728515625, 0.0166015625, 0, 0.0166015625, 0.00142669677734375, -0.01116943359375...

[ 37202, 3249, 1821, 33022, 5423, 4390, 132, 284, 425, 1614, 3509, 594, 515, 276, 4153, 25515, 79858, 219065, 5613, 1596, 21771, 12319, 3229, 2685, 111147, 25129, 17514, 1284, 110, 149186, 6002, 86531, 13631, 2063, 39329, 7, 11, 7340, 101098,...

[ 0.0657958984375, 0.030364990234375, 0.025482177734375, 0.130859375, 0.164794921875, 0.2607421875, 0.00225830078125, 0.0677490234375, 0.1429443359375, 0.1461181640625, 0.1627197265625, 0.0159454345703125, 0.1485595703125, 0.007049560546875, 0.1654052734375, 0.14111328125, 0.2359619140...

embed

60700448_c0

60700448

prolog

0

Title: Prolog, given N and find all numbers not divisible by 3 and 5 and these numbers must be smaller than N Problem title: Prolog, given N and find all numbers not divisible by 3 and 5 and these numbers must be smaller than N Tags: division, prolog Problem: Prolog, given N and find all numbers not divisible by 3 and ...

Prolog, given N and find all numbers not divisible by 3 and 5 and these numbers must be smaller than N Prolog, given N and find all numbers not divisible by 3 and 5 and these numbers must be smaller than N division prolog Prolog Num Here Rank Num1 Prolog, given N and find all numbers not divisible by 3 and 5 and these ...

[ -0.025390625, -0.0011749267578125, 0.020263671875, -0.0115966796875, -0.01263427734375, 0.015869140625, -0.007293701171875, 0.0152587890625, 0.01300048828125, -0.0225830078125, -0.003662109375, -0.00897216796875, 0.0184326171875, -0.006927490234375, 0.006805419921875, 0.000307083129882...

[ 1250, 4867, 34475, 541, 7413, 756, 101935, 959, 45, 99017, 390, 138, 136, 190, 8110, 186, 164917, 3501, 91853, 502, 52782, 11853, 134405, 418, 2967, 29806, 47, 803, 12477, 1653, 2063, 67, 160477, 14012, 83, 5303, 45367, 103332, 4426, 621,...

[ 0.1844482421875, 0.2296142578125, 0.061279296875, 0.1461181640625, 0.144775390625, 0.03399658203125, 0.1495361328125, 0.1192626953125, 0.09747314453125, 0.2392578125, 0.052642822265625, 0.1328125, 0.10223388671875, 0.123291015625, 0.01812744140625, 0.003021240234375, 0.144287109375, ...

embed

26466829_c0

26466829

prolog

0

Title: Prolog - List elements in a list of lists Problem title: Prolog - List elements in a list of lists Tags: prolog Problem: Prolog - List elements in a list of lists I have a list and a list of lists: A = [1,2,4,5] L = [[1,2,5],[3,4,5]] If A contains the same elements as one of the lists, I want it to return true. ...

Prolog - List elements in a list of lists Prolog - List elements in a list of lists prolog Prolog List have_common_element Prolog - List elements in a list of lists I have a list and a list of lists: If A contains the same elements as one of the lists, I want it to return true. As A contains the same elements (1,2,5) a...

[ -0.0137939453125, 0.0084228515625, 0.00994873046875, 0.0174560546875, -0.0211181640625, 0.01275634765625, 0.00106048583984375, -0.01019287109375, 0.001800537109375, -0.032470703125, 0.0272216796875, 0.03125, 0.021728515625, 0.0091552734375, -0.01123046875, 0.0002613067626953125, 0.02...

[ 1250, 4867, 32036, 80854, 23, 5303, 111, 502, 765, 277, 3796, 62766, 4263, 62, 70541, 5701, 237, 1632, 3444, 47, 30646, 29568, 71928, 5117, 339, 12830, 18, 24941, 1653, 2063, 1636, 86869, 25632, 41, 1294, 98320, 28219, 3971, 34844, 65042,...

[ 0.1773681640625, 0.24609375, 0.182861328125, 0.2088623046875, 0.05950927734375, 0.2076416015625, 0.0633544921875, 0.1451416015625, 0.119140625, 0.11279296875, 0.1796875, 0.209228515625, 0.037445068359375, 0.0947265625, 0.13525390625, 0.1591796875, 0.0572509765625, 0.024444580078125...

embed

52420184_c0

52420184

prolog

0

Title: Prolog exercise with factorisation Problem title: Prolog exercise with factorisation Tags: prime-factoring, prolog Problem: Prolog exercise with factorisation I am currently studying Artificial Intelligence in the Netherlands. We've had some introductions about Prolog which were very simple and understandable, b...

Prolog exercise with factorisation Prolog exercise with factorisation prime-factoring prolog Prolog Yes Result Prolog exercise with factorisation I am currently studying Artificial Intelligence in the Netherlands. We've had some introductions about Prolog which were very simple and understandable, but the exercises we ...

[ 0.005126953125, 0.00433349609375, 0.00982666015625, 0.01611328125, -0.0001316070556640625, 0.0159912109375, -0.004547119140625, -0.000247955322265625, 0.0062255859375, -0.0281982421875, 0.0076904296875, -0.0081787109375, -0.0189208984375, 0.00653076171875, -0.01129150390625, -0.0032653...

[ 1250, 4867, 81979, 678, 31461, 15032, 20809, 144810, 502, 32635, 126684, 82424, 35187, 214, 231996, 157075, 23, 231118, 39864, 3542, 4552, 8781, 28219, 54, 10176, 1286, 34844, 2301, 18, 89554, 190, 43652, 176256, 5122, 5868, 3642, 86869, 903,...

[ 0.1849365234375, 0.272705078125, 0.218017578125, 0.093505859375, 0.21240234375, 0.1429443359375, 0.133056640625, 0.19287109375, 0.1455078125, 0.1624755859375, 0.18603515625, 0.024261474609375, 0.053619384765625, 0.0235595703125, 0.1356201171875, 0.13623046875, 0.01031494140625, 0.1...

embed

61028457_c1

61028457

prolog

1

Back],L). :-end_tests(split_list). We run the above: ?- run_tests(split_list). % PL-Unit: split_list ....... [a,b,c,d,e,f,g,h,i,j,k,l] ==> [] a [b,c,d,e,f,g,h,i,j,k,l] [a,b,c,d,e,f,g,h,i,j,k,l] ==> [a] b [c,d,e,f,g,h,i,j,k,l] [a,b,c,d,e,f,g,h,i,j,k,l] ==> [a,b] c [d,e,f,g,h,i,j,k,l] [a,b,c,d,e,f,g,h,i,j,k,l] ==> [a,b,c...

[ -0.0030059814453125, 0.021240234375, 0.00017452239990234375, -0.00002086162567138672, -0.0283203125, -0.005615234375, 0.0108642578125, 0.0054931640625, 0.0299072265625, 0.006683349609375, 0.005340576171875, 0.032470703125, 0.00106048583984375, 0.017822265625, 0.01953125, 0.004150390625...

[ 26828, 268, 866, 194, 15772, 3611, 6954, 7, 7008, 4353, 6562, 1401, 11675, 36917, 705, 9, 1745, 33106, 85600, 18, 65450, 454, 68024, 11, 4, 275, 238, 71, 13, 420, 177, 127, 14, 170, 92, 141, 6, 10, 2740, 876, 501, 104, 378, 69112,...

[ 0.2423095703125, 0.0230255126953125, 0.125, 0.033966064453125, 0.05950927734375, 0.1932373046875, 0.267578125, 0.10302734375, 0.1005859375, 0.24169921875, 0.254638671875, 0.0767822265625, 0.18994140625, 0.1632080078125, 0.0526123046875, 0.031951904296875, 0.13232421875, 0.207641601...

embed

14509723_c0

14509723

prolog

0

Title: Family relations prolog - distance Problem title: Family relations prolog - distance Tags: graph-theory, prolog, shortest-path Problem: Family relations prolog - distance Lets say I've got the following predicates: father(aaron, chloe). father(aaron, dan). father(aaron, emily). father(frank, george). mother(beth...

Family relations prolog - distance Family relations prolog - distance graph-theory prolog shortest-path Family not_in_list list_length travel_graph Path Next Family relations prolog - distance Lets say I've got the following predicates: I want to find the shortest route (distance) between two members of the family tree...

[ 0.025390625, 0.0152587890625, 0.00183868408203125, -0.00003933906555175781, -0.004547119140625, -0.01025390625, -0.013671875, -0.00537109375, -0.00144195556640625, -0.052978515625, -0.00201416015625, -0.0169677734375, -0.015625, 0.0224609375, 0.01409912109375, 0.003997802734375, 0.01...

[ 59745, 91582, 502, 4867, 62488, 41382, 2347, 30675, 16610, 525, 128405, 959, 73, 6562, 5303, 23986, 26983, 108421, 4997, 5154, 4163, 25632, 1653, 2063, 87, 3444, 47, 7413, 70, 36439, 56883, 329, 17721, 6626, 43032, 14449, 53201, 27863, 1105...

[ 0.179931640625, 0.1802978515625, 0.08734130859375, 0.1610107421875, 0.239990234375, 0.18896484375, 0.06427001953125, 0.05194091796875, 0.2095947265625, 0.1572265625, 0.16845703125, 0.0882568359375, 0.035614013671875, 0.1160888671875, 0.0943603515625, 0.0521240234375, 0.1561279296875,...

embed

22290028_c0

22290028

prolog

0

Title: Prolog recursivly build list based on dot product Problem title: Prolog recursivly build list based on dot product Tags: prolog Problem: Prolog recursivly build list based on dot product Hi I have a prolog function/predicate? that takes the dot product of two list. and would like to use it to write a function th...

Prolog recursivly build list based on dot product Prolog recursivly build list based on dot product prolog Prolog Head Tail Head2 Tail2 Result Prod Remaining What Prolog recursivly build list based on dot product Hi I have a prolog function/predicate? that takes the dot product of two list. and would like to use it to ...

[ 0.0093994140625, 0.0255126953125, -0.00311279296875, -0.00970458984375, -0.01953125, 0.01336669921875, -0.018310546875, 0.00836181640625, 0.00604248046875, -0.0196533203125, 0.00457763671875, -0.01116943359375, -0.0162353515625, -0.00041961669921875, -0.00689697265625, -0.01611328125, ...

[ 1250, 4867, 195625, 4371, 538, 45367, 5303, 35509, 98, 20633, 12996, 502, 44816, 1218, 379, 304, 126684, 71, 192, 32354, 19714, 2063, 51776, 6626, 1884, 4527, 33022, 38742, 1295, 35839, 12638, 35064, 43240, 81887, 35782, 11907, 6032, 9790, ...

[ 0.1796875, 0.259033203125, 0.23095703125, 0.146484375, 0.0164794921875, 0.203369140625, 0.2041015625, 0.120849609375, 0.0072021484375, 0.232177734375, 0.230712890625, 0.1439208984375, 0.109619140625, 0.06732177734375, 0.0501708984375, 0.073486328125, 0.1405029296875, 0.014389038085...

embed

58296162_c1

58296162

prolog

1

A,Ns],G), member(D,Ns). % doesnt_depend_on shows that node D doesnt have paths leading to it doesnt_depend_on(G, D) :- \+ depends_on(G, _, D). % removes node from a graph with the given value remove_graph_node([ [D,_] | T], D, T). % base case -- FOUND IT return the tail only since we already popped it remove_graph_node...

[ -0.01226806640625, 0.03369140625, 0.01300048828125, 0.01544189453125, -0.016357421875, 0.00946044921875, -0.031494140625, -0.01171875, 0.0020599365234375, -0.02197265625, 0.00946044921875, -0.0322265625, -0.01373291015625, 0.00897216796875, 0.003936767578125, -0.01007080078125, -0.00...

[ 62, 839, 724, 32786, 397, 1745, 22027, 18, 105254, 191, 45831, 110, 112, 391, 765, 60875, 105207, 1328, 56566, 7, 87388, 1295, 41382, 34292, 157, 384, 3647, 7225, 44944, 34384, 5959, 30646, 46741, 4734, 21771, 160, 572, 26973, 1218, 379, ...

[ 0.04345703125, 0.030670166015625, 0.08624267578125, 0.1749267578125, 0.050018310546875, 0.10186767578125, 0.08349609375, 0.0882568359375, 0.2108154296875, 0.152587890625, 0.0333251953125, 0.1585693359375, 0.07861328125, 0.1197509765625, 0.045501708984375, 0.1710205078125, 0.052337646...

embed

28424732_c0

28424732

prolog

0

Title: Prolog : Enumerate All Elements of Countably Infinite Results Problem title: Prolog : Enumerate All Elements of Countably Infinite Results Tags: prolog, logic-programming Problem: Prolog : Enumerate All Elements of Countably Infinite Results Are there any prolog implementations that are able to enumerate all ele...

Prolog : Enumerate All Elements of Countably Infinite Results Prolog : Enumerate All Elements of Countably Infinite Results prolog logic-programming Prolog Enumerate All Elements Countably Infinite Results nats.pl pair_of_nats GNU Daniel Diaz Copyright Prolog : Enumerate All Elements of Countably Infinite Results Are t...

[ 0.0208740234375, 0.002899169921875, 0.000934600830078125, 0.0155029296875, 0.0045166015625, 0.005462646484375, -0.0036773681640625, -0.010498046875, 0.001922607421875, -0.04736328125, 0.0196533203125, -0.0042724609375, -0.0166015625, -0.00054931640625, 0.0023956298828125, 0.00460815429...

[ 1250, 4867, 357, 15537, 17957, 3164, 48325, 108210, 78458, 134322, 13, 146104, 502, 62775, 28966, 24, 933, 2424, 80836, 4390, 7695, 165132, 11555, 4512, 169, 4189, 2499, 208124, 19048, 47, 189085, 756, 80854, 54529, 54241, 50339, 16916, 67, ...

[ 0.1844482421875, 0.2529296875, 0.02496337890625, 0.17333984375, 0.0966796875, 0.1390380859375, 0.1715087890625, 0.114501953125, 0.1602783203125, 0.13427734375, 0.035888671875, 0.17724609375, 0.20458984375, 0.0943603515625, 0.05908203125, 0.04730224609375, 0.048065185546875, 0.02600...

embed

50890491_c0

50890491

prolog

0

Title: what's the semantics of Prolog's implementation of negation with non-ground literals Problem title: what's the semantics of Prolog's implementation of negation with non-ground literals Tags: first-order-logic, negation, prolog Problem: what's the semantics of Prolog's implementation of negati...

what's the semantics of Prolog's implementation of negation with non-ground literals what's the semantics of Prolog's implementation of negation with non-ground literals first-order-logic negation prolog Prolog what's the semantics of Prolog's implementation of negation with non-ground literals I am...

[ 0.00653076171875, 0.01300048828125, -0.00384521484375, 0.01080322265625, -0.03076171875, 0.015380859375, 0.0120849609375, -0.00506591796875, -0.00090789794921875, -0.00116729736328125, 0.00445556640625, 0.0106201171875, -0.01324462890625, -0.0225830078125, 0.020263671875, 0.01495361328...

[ 3768, 484, 109109, 7, 1250, 4867, 208124, 108, 125682, 678, 351, 64330, 15659, 16765, 5117, 80596, 137043, 502, 2367, 111, 16031, 237, 353, 919, 82940, 46485, 21917, 24658, 61585, 90584, 121691, 70731, 13, 915, 132, 1542, 15772, 8096, 1723,...

[ 0.07147216796875, 0.1917724609375, 0.2095947265625, 0.048736572265625, 0.1943359375, 0.2353515625, 0.1768798828125, 0.1917724609375, 0.1832275390625, 0.12939453125, 0.1458740234375, 0.17431640625, 0.1522216796875, 0.0960693359375, 0.019927978515625, 0.114013671875, 0.09228515625, 0...

embed

36049910_c0

36049910

prolog

0

Title: Proper way to Declare and Search List in Prolog? Problem title: Proper way to Declare and Search List in Prolog? Tags: prolog Problem: Proper way to Declare and Search List in Prolog? I'm new to Prolog. Is it possible to "declare" a list as a fact in Prolog, and then access it easily? I'm working on a family-tre...

Proper way to Declare and Search List in Prolog? Proper way to Declare and Search List in Prolog? prolog Proper Declare Search List Prolog Facts Rules Member Proper way to Declare and Search List in Prolog? I'm new to Prolog. Is it possible to "declare" a list as a fact in Prolog, and then access it easily? I'm working...

[ 0.01953125, 0.01220703125, 0.018798828125, 0.01373291015625, -0.0234375, 0.00116729736328125, 0.0059814453125, -0.0034027099609375, 0.006866455078125, -0.026123046875, 0.01239013671875, -0.0198974609375, -0.00091552734375, 0.007080078125, 0.012939453125, 0.004547119140625, 0.02734375...

[ 1250, 1264, 3917, 25755, 38103, 136, 33086, 32036, 23, 4867, 47, 502, 132640, 139118, 74057, 3525, 7722, 50718, 5303, 237, 15824, 17203, 72546, 20697, 14449, 62600, 10644, 2967, 1884, 159978, 147306, 11280, 66165, 81551, 2806, 19048, 41, 1294...

[ 0.173828125, 0.1058349609375, 0.09429931640625, 0.169921875, 0.2064208984375, 0.1285400390625, 0.251708984375, 0.251708984375, 0.03546142578125, 0.261474609375, 0.0284881591796875, 0.09588623046875, 0.1417236328125, 0.1026611328125, 0.1705322265625, 0.032806396484375, 0.08349609375, ...

embed

64474263_c0

64474263

prolog

0

Title: how to randomly shuffle a list using Prolog? Problem title: how to randomly shuffle a list using Prolog? Tags: prolog Problem: how to randomly shuffle a list using Prolog? I have an predicate that produces a 52 length list of cards : ?- cards(CARDs) . CARDs = [2♣,2♦,2♠,2♥,3♣,3♦,3♠,3♥,4♣,4♦,4♠,4♥,5♣,5♦,5♠,5♥,6♣,6...

how to randomly shuffle a list using Prolog? how to randomly shuffle a list using Prolog? prolog Prolog CARDs NAME RANK SUIT prolog:atom_concat CARD prolog:bagof how to randomly shuffle a list using Prolog? I have an predicate that produces a 52 length list of cards : ... and now I want to randomly shuffle them . How c...

[ 0.00457763671875, 0.00994873046875, 0.0194091796875, -0.0157470703125, -0.005462646484375, -0.000255584716796875, -0.021484375, 0.006744384765625, 0.0019989013671875, -0.0267333984375, 0.0167236328125, 0.047119140625, -0.0169677734375, 0.0012664794921875, 0.0140380859375, -0.0015182495...

[ 3642, 47, 96759, 538, 170052, 5303, 17368, 1250, 4867, 32, 502, 313, 49444, 19400, 16817, 5928, 2271, 4460, 120968, 420, 10, 1653, 2063, 27489, 7221, 140909, 126381, 3444, 2856, 11249, 831, 142, 23, 11814, 222530, 202317, 10941, 98323, 3727...

[ 0.06500244140625, 0.0318603515625, 0.1983642578125, 0.051177978515625, 0.25537109375, 0.2265625, 0.09246826171875, 0.1754150390625, 0.2578125, 0.006317138671875, 0.08441162109375, 0.03076171875, 0.121826171875, 0.0396728515625, 0.0711669921875, 0.1168212890625, 0.01910400390625, 0....

embed

32478193_c0

32478193

prolog

0

Title: Using a constrained variable with `length/2` Problem title: Using a constrained variable with `length/2` Tags: clpfd, prolog Problem: Using a constrained variable with `length/2` Here is the problem: $ swipl Welcome to SWI-Prolog (Multi-threaded, 64 bits, Version 7.3.6-5-g5aeabd5) Copyright (c) 1990-2015 Univers...

Using a constrained variable with `length/2` Using a constrained variable with `length/2` clpfd prolog Using Welcome SWI-Prolog Multi-threaded Version g5aeabd5 Copyright University Amsterdam ABSOLUTELY WARRANTY Please www.swi-prolog.org Topic Word use_module _G1580 _G1583 _G1586 ERROR Out Using a constrained variable w...

[ -0.0059814453125, -0.0020599365234375, 0.002685546875, 0.001495361328125, 0.01416015625, 0.006591796875, -0.004730224609375, 0.01214599609375, 0.0069580078125, -0.06298828125, 0.0018768310546875, -0.017333984375, 0.00194549560546875, 0.008544921875, 0.023681640625, -0.0009918212890625,...

[ 345, 6953, 158, 9297, 122009, 77336, 678, 23986, 927, 12477, 33139, 39557, 71, 502, 4867, 91334, 159, 38969, 10752, 19335, 39116, 40647, 4189, 12535, 21391, 2452, 3454, 134912, 22543, 4527, 83279, 1837, 4836, 17168, 15276, 151206, 13538, 2967...

[ 0.10430908203125, 0.0279998779296875, 0.095703125, 0.1966552734375, 0.130615234375, 0.263671875, 0.065673828125, 0.1396484375, 0.1121826171875, 0.28564453125, 0.00994873046875, 0.048248291015625, 0.08099365234375, 0.09600830078125, 0.20703125, 0.1278076171875, 0.00421142578125, 0.1...

embed

57341339_c1

57341339

prolog

1

of data sets, and multiple alternative implementations of the graph and path modules (with the same interface, i.e., exported predicates). For the sake of the (small) example, let us assume we files data files data1.pl , data2.pl , helper predicate modules path1.pl , path2.pl , and algorithm modules graph1 , graph2.pl...

[ 0.01214599609375, 0.00872802734375, -0.000370025634765625, 0.013671875, -0.01202392578125, 0.0032196044921875, 0.0147705078125, -0.01214599609375, 0.0142822265625, -0.01806640625, -0.0162353515625, 0.019287109375, -0.01202392578125, 0.003509521484375, 0.004425048828125, -0.002716064453...

[ 111, 2053, 5423, 7, 48716, 30700, 208124, 6, 41382, 136, 60875, 88996, 70, 5701, 101758, 4, 5, 13, 31255, 297, 1653, 2063, 69070, 16, 27781, 102158, 2424, 5442, 4358, 56, 234873, 418, 3444, 11408, 134234, 6097, 159, 38969, 10752, 4867, ...

[ 0.046234130859375, 0.10302734375, 0.13330078125, 0.00750732421875, 0.0928955078125, 0.1451416015625, 0.1363525390625, 0.007415771484375, 0.1859130859375, 0.048828125, 0.1727294921875, 0.1995849609375, 0.00732421875, 0.0548095703125, 0.126220703125, 0.007354736328125, 0.00747680664062...

embed

8241182_c0

8241182

prolog

0

Title: Strange behaviour of unification pattern matching Problem title: Strange behaviour of unification pattern matching Tags: pattern-matching, unification, prolog Problem: Strange behaviour of unification pattern matching So here it is, for my sudoku project I have a list, such as : L = [_G1-0:0:0,_G19-0:6:2,_G22-0:...

Strange behaviour of unification pattern matching Strange behaviour of unification pattern matching pattern-matching unification prolog Strange _G1-0:0:0 _G19-0:6:2 _G22-0:7:2 _G25-0:8:2 _G1 _G19 _G22 _G25 remove_position X-_ Result X-_:_:_ Strange behaviour of unification pattern matching So here it is, for my sudoku ...

[ -0.0016021728515625, 0.02392578125, 0.012451171875, -0.0213623046875, -0.025390625, -0.027099609375, -0.01177978515625, 0.0211181640625, 0.0128173828125, 0.00811767578125, 0.0245361328125, 0.01287841796875, 0.01483154296875, -0.00872802734375, -0.012939453125, 0.008056640625, 0.01928...

[ 187791, 224833, 51, 41274, 103510, 14858, 98753, 502, 4867, 724, 180033, 53861, 2947, 23320, 910, 304, 203808, 2588, 1019, 418, 4015, 87388, 40322, 1193, 126684, 8932, 38067, 13452, 5303, 46312, 2046, 4092, 77336, 54397, 1653, 2063, 67, 15902...

[ 0.1956787109375, 0.146240234375, 0.147705078125, 0.1085205078125, 0.1986083984375, 0.185546875, 0.1575927734375, 0.1336669921875, 0.193359375, 0.049407958984375, 0.116455078125, 0.181640625, 0.153564453125, 0.090576171875, 0.067626953125, 0.05523681640625, 0.0787353515625, 0.161743...

embed

64951976_c0

64951976

prolog

0

Title: Retrieve elements from facts in Prolog Problem title: Retrieve elements from facts in Prolog Tags: prolog Problem: Retrieve elements from facts in Prolog I am currently learning Prolog for a class right now. I am using GNU Prolog to define a rule for example class_info(X,Y) and a similar rule, where X is the nam...

Retrieve elements from facts in Prolog Retrieve elements from facts in Prolog prolog facts Retrieve Prolog class_info exact_class Retrieve elements from facts in Prolog I am currently learning Prolog for a class right now. I am using GNU Prolog to define a rule for example class_info(X,Y) and a similar rule, where X is...

[ 0.01708984375, 0.002349853515625, -0.00012302398681640625, 0.0157470703125, -0.0137939453125, 0.031982421875, 0.000263214111328125, 0.0013580322265625, 0.0174560546875, -0.03369140625, -0.006378173828125, -0.01361083984375, -0.01287841796875, -0.01300048828125, -0.010009765625, 0.01477...

[ 200451, 80854, 1295, 15824, 7, 1250, 4867, 502, 18507, 7319, 24763, 67413, 82424, 52080, 100, 165132, 61924, 79986, 1723, 21373, 1193, 9351, 16030, 990, 140992, 3004, 4734, 3714, 3642, 30646, 144, 429, 2844, 125195, 23, 91736, 959, 1632, 36...

[ 0.20068359375, 0.18603515625, 0.1165771484375, 0.1932373046875, 0.07159423828125, 0.1746826171875, 0.2398681640625, 0.130615234375, 0.1724853515625, 0.1953125, 0.153564453125, 0.1729736328125, 0.001678466796875, 0.051116943359375, 0.017578125, 0.1239013671875, 0.08721923828125, 0.1...

embed

42455589_c0

42455589

prolog

0

Title: How to get all consecutive sublists/subsets in Prolog? Problem title: How to get all consecutive sublists/subsets in Prolog? Tags: prolog, sublist, substring, list Problem: How to get all consecutive sublists/subsets in Prolog? I would like to solve a simple problem, but even through I tried many different appro...

How to get all consecutive sublists/subsets in Prolog? How to get all consecutive sublists/subsets in Prolog? prolog sublist substring list How Prolog How to get all consecutive sublists/subsets in Prolog? I would like to solve a simple problem, but even through I tried many different approaches, I couldn't find a solu...

[ 0.003082275390625, -0.0074462890625, 0.00921630859375, 0.007293701171875, -0.0234375, 0.00628662109375, 0.008056640625, -0.0015411376953125, 0.01080322265625, -0.016357421875, 0.011474609375, 0.021240234375, -0.01129150390625, -0.00171661376953125, 0.000286102294921875, 0.0108032226562...

[ 11249, 2046, 756, 148390, 13, 1614, 6562, 22144, 3509, 23, 1250, 4867, 502, 91693, 5303, 47, 64, 86869, 2967, 29806, 159, 2143, 3444, 70541, 80854, 206846, 138, 201, 159029, 20505, 12477, 1653, 2063, 67, 627, 84751, 16750, 3206 ]

[ 0.03326416015625, 0.0965576171875, 0.131591796875, 0.21923828125, 0.0860595703125, 0.220947265625, 0.2391357421875, 0.1917724609375, 0.2203369140625, 0.050445556640625, 0.152587890625, 0.236083984375, 0.09228515625, 0.1177978515625, 0.13623046875, 0.0210723876953125, 0.006591796875, ...

embed

46512332_c0

46512332

prolog

0

Title: How to make a random list of a specific length without duplicates in prolog? Problem title: How to make a random list of a specific length without duplicates in prolog? Tags: prolog Problem: How to make a random list of a specific length without duplicates in prolog? I'm trying to write a predicate randomnames/1...

How to make a random list of a specific length without duplicates in prolog? How to make a random list of a specific length without duplicates in prolog? prolog How Mary Pat James Bob Susan random_name Name random_names How to make a random list of a specific length without duplicates in prolog? I'm trying to write a p...

[ 0.01904296875, 0.00714111328125, 0.0206298828125, -0.0027923583984375, -0.00958251953125, 0.01953125, -0.005950927734375, 0.000751495361328125, 0.00799560546875, -0.049560546875, -0.0098876953125, -0.0012664794921875, 0.005615234375, 0.0152587890625, 0.01336669921875, 0.01324462890625,...

[ 11249, 47, 3249, 96759, 5303, 29458, 140909, 15490, 171763, 1636, 23, 502, 4867, 23213, 9876, 14631, 25027, 67243, 11627, 15757, 10, 31577, 33022, 1653, 2063, 67, 11583, 139392, 17262, 12921, 123055, 63399, 21771, 1632, 9351, 2046, 42459, 296...

[ 0.062255859375, 0.0037841796875, 0.1087646484375, 0.2139892578125, 0.22802734375, 0.1983642578125, 0.1710205078125, 0.1351318359375, 0.21630859375, 0.09521484375, 0.035400390625, 0.16357421875, 0.214111328125, 0.0733642578125, 0.068603515625, 0.08770751953125, 0.068359375, 0.118652...

embed

65103935_c1

65103935

prolog

1

' or 'right' like ['up', 'up', 'right', 'right']) that should be taken to reach the end point location of the 10X10 grid [10, 10]. Below is an example Query of how this path predicate would give proper output bindings for list of steps. path([4,4],X). This example query above should return all the possible bindings of ...

[ 0.0079345703125, 0.034912109375, 0.002655029296875, -0.002166748046875, -0.002227783203125, 0.0303955078125, 0.0059814453125, -0.007568359375, 0.0081787109375, -0.02734375, 0.0023193359375, 0.02392578125, -0.012939453125, 0.005401611328125, -0.00579833984375, 0.0235595703125, 0.00665...

[ 242, 707, 54969, 1884, 2037, 25, 268, 5608, 39958, 47, 58359, 3564, 6275, 31913, 209, 1542, 963, 120067, 17336, 27781, 58836, 903, 60875, 1653, 2063, 67, 27798, 140992, 128239, 5303, 98441, 132, 124093, 41, 1294, 36917, 30646, 756, 7722, ...

[ 0.011474609375, 0.063232421875, 0.1900634765625, 0.07916259765625, 0.191650390625, 0.00048828125, 0.000457763671875, 0.09759521484375, 0.1142578125, 0.0204010009765625, 0.1688232421875, 0.1502685546875, 0.1571044921875, 0.1317138671875, 0.1402587890625, 0.1624755859375, 0.16650390625...

embed

23510109_c0

23510109

prolog

0

Title: When I add two number its giving me Sum is _G4080-_G4081 in Prolog Problem title: When I add two number its giving me Sum is _G4080-_G4081 in Prolog Tags: prolog Problem: When I add two number its giving me Sum is _G4080-_G4081 in Prolog I am summing two numbers in the code below, but the result is not what I ex...

When I add two number its giving me Sum is _G4080-_G4081 in Prolog When I add two number its giving me Sum is _G4080-_G4081 in Prolog prolog When Sum _G4080-_G4081 Prolog Enter Number What na.Add b.Subtract c.Multiply d.Divided e.Exit Answer Name a.Add _G5053 _G5054 When I add two number its giving me Sum is _G4080-_G4...

[ -0.00118255615234375, 0.005218505859375, 0.0126953125, 0.0281982421875, -0.018798828125, 0.021484375, -0.01104736328125, 0.01043701171875, 0.019775390625, -0.0164794921875, 0.01019287109375, 0.00122833251953125, -0.02197265625, 0.01220703125, 0.01507568359375, 0.00921630859375, 0.020...

[ 15190, 6626, 14012, 6863, 68772, 163, 36335, 724, 2839, 4836, 13556, 1250, 4867, 83, 502, 60816, 103332, 24, 4028, 39989, 118, 14055, 5518, 19279, 130373, 2525, 14226, 12338, 166, 58838, 101935, 18151, 16750, 959, 84751, 6183, 44691, 126684, ...

[ 0.1871337890625, 0.1856689453125, 0.189697265625, 0.07781982421875, 0.08251953125, 0.037567138671875, 0.25439453125, 0.05279541015625, 0.1422119140625, 0.2279052734375, 0.2254638671875, 0.1409912109375, 0.2178955078125, 0.04180908203125, 0.113037109375, 0.1190185546875, 0.119140625, ...

embed

52122727_c0

52122727

prolog

0

Title: Solve dynamic programming in Prolog via corecursion Problem title: Solve dynamic programming in Prolog via corecursion Tags: prolog, dynamic-programming, corecursion Problem: Solve dynamic programming in Prolog via corecursion I would like to solve the following dynamic programming problem via corecursion in Pro...

Solve dynamic programming in Prolog via corecursion Solve dynamic programming in Prolog via corecursion prolog dynamic-programming corecursion Solve Prolog N-1 Solve dynamic programming in Prolog via corecursion I would like to solve the following dynamic programming problem via corecursion in Prolog. But I am stuck in...

[ 0.004364013671875, 0.007110595703125, 0.00848388671875, 0.018798828125, 0.00171661376953125, 0.007568359375, 0.00165557861328125, 0.02783203125, 0.0069580078125, -0.052001953125, -0.000621795654296875, -0.0189208984375, -0.0189208984375, 0.02490234375, 0.020751953125, -0.0152587890625,...

[ 6678, 84079, 56037, 449, 1250, 4867, 1829, 56458, 48650, 1830, 502, 28966, 5759, 1884, 86869, 25632, 2967, 179933, 179967, 927, 5117, 33938, 29479, 16106, 54543, 21771, 68872, 21, 3285, 5303, 18811, 42856, 170224, 313, 831, 35839, 11180, 1938...

[ 0.10986328125, 0.22900390625, 0.1583251953125, 0.0249481201171875, 0.150146484375, 0.2467041015625, 0.09039306640625, 0.131103515625, 0.2152099609375, 0.08563232421875, 0.126953125, 0.1273193359375, 0.052764892578125, 0.016754150390625, 0.1285400390625, 0.008026123046875, 0.134765625...

embed

17300046_c0

17300046

prolog

0

Title: Automatic theorem proving Problem title: Automatic theorem proving Tags: theorem-proving, prolog Problem: Automatic theorem proving I'm looking for an automatic theorem proving system, which can prove this: Crocodile took mans child. Man asked crocodile not to eat his child. But Crocodile said: I'll return your ...

Automatic theorem proving Automatic theorem proving theorem-proving prolog Automatic XOR Automatic theorem proving I'm looking for an automatic theorem proving system, which can prove this: Crocodile took mans child. Man asked crocodile not to eat his child. But Crocodile said: I'll return your child to you, if you wil...

[ 0.033935546875, 0.02978515625, -0.0040283203125, 0.014404296875, -0.018798828125, 0.0084228515625, -0.005157470703125, 0.0174560546875, -0.0120849609375, -0.022216796875, 0.006378173828125, 0.02734375, -0.01806640625, 0.01470947265625, 0.00946044921875, 0.00421142578125, 0.0016174316...

[ 51719, 1771, 70, 58391, 502, 6496, 70628, 4867, 1193, 24638, 16487, 100, 142, 101038, 5426, 23534, 903, 164098, 15663, 133, 34739, 36679, 29041, 1572, 37170, 99546, 959, 73203, 1919, 2804, 87, 1181, 30646, 935, 398, 2174, 163, 2367, 444, ...

[ 0.218505859375, 0.0684814453125, 0.07427978515625, 0.201904296875, 0.15380859375, 0.07061767578125, 0.159423828125, 0.135498046875, 0.056182861328125, 0.2109375, 0.0621337890625, 0.023406982421875, 0.0177154541015625, 0.256103515625, 0.1519775390625, 0.1717529296875, 0.02694702148437...

embed

40706855_c0

40706855

prolog

0

Title: Prolog '==' operator is not working? Problem title: Prolog '==' operator is not working? Tags: prolog Problem: Prolog '==' operator is not working? I made a function which calculates vector length and 2D array size. Below is the function. I am using swi-prolog : foo(LIST) :- listLength(LIST, ...

Prolog '==' operator is not working? Prolog '==' operator is not working? prolog Prolog LIST COUNT1 COUNT2 Prolog '==' operator is not working? I made a function which calculates vector length and 2D array size. Below is the function. I am using swi-prolog : Yes, I deliberately exclude detailed list...

[ 0.0113525390625, 0.005615234375, -0.012939453125, 0.021728515625, -0.006927490234375, -0.013427734375, -0.015380859375, 0.0196533203125, 0.014404296875, -0.007049560546875, 0.0252685546875, 0.00141143798828125, 0.0036773681640625, 0.0078125, -0.00946044921875, -0.0228271484375, 0.000...

[ 1250, 4867, 3768, 74, 69112, 39933, 959, 20697, 502, 195977, 8244, 64163, 418, 304, 83, 32354, 74481, 173, 18770, 140909, 116, 397, 10298, 53, 13267, 873, 17336, 17368, 91, 2452, 3454, 91755, 39041, 185688, 5303, 449, 6626, 62051, 7092, 2...

[ 0.176513671875, 0.267822265625, 0.0968017578125, 0.023040771484375, 0.267333984375, 0.24169921875, 0.095703125, 0.1573486328125, 0.1324462890625, 0.171875, 0.06158447265625, 0.15771484375, 0.083251953125, 0.174072265625, 0.006683349609375, 0.1693115234375, 0.1436767578125, 0.127075...

embed

26029464_c0

26029464

prolog

0

Title: How to represent uniqueness? Problem title: How to represent uniqueness? Tags: prolog Problem: How to represent uniqueness? I am trying to write an agent for determining what card a player has, and I am struggling to represent that each card can only have been dealt to a single player. So have I have something^ ...

How to represent uniqueness? How to represent uniqueness? prolog How has_card ERROR Arithmetic player1 How to represent uniqueness? I am trying to write an agent for determining what card a player has, and I am struggling to represent that each card can only have been dealt to a single player. So have I have something^...

[ 0.0020904541015625, 0.0205078125, 0.0274658203125, 0.004974365234375, 0.01220703125, -0.009765625, -0.01318359375, -0.0130615234375, 0.002899169921875, -0.042724609375, -0.0196533203125, 0.02197265625, 0.01470947265625, 0.006317138671875, -0.00982666015625, -0.00103759765625, -0.0054...

[ 11249, 47, 33636, 36998, 7432, 502, 4867, 1556, 38931, 151206, 24638, 8962, 282, 9523, 58585, 418, 31577, 33022, 23882, 72694, 214, 20596, 237875, 12638, 831, 4734, 765, 8, 7010, 11001, 32562, 79986, 100, 15555, 62775, 18507, 21208, 13204, ...

[ 0.1239013671875, 0.06573486328125, 0.29931640625, 0.26904296875, 0.204345703125, 0.09844970703125, 0.1319580078125, 0.162841796875, 0.2236328125, 0.1455078125, 0.09619140625, 0.1256103515625, 0.040313720703125, 0.01190185546875, 0.147705078125, 0.0106201171875, 0.0223388671875, 0.0...

embed

33834168_c0

33834168

prolog

0

Title: prolog intersection find a common list of four friend and restaurant menu list Problem title: prolog intersection find a common list of four friend and restaurant menu list Tags: prolog Problem: prolog intersection find a common list of four friend and restaurant menu list Hi I want to make a pro-log program. th...

prolog intersection find a common list of four friend and restaurant menu list prolog intersection find a common list of four friend and restaurant menu list prolog chop_suey prolog intersection find a common list of four friend and restaurant menu list Hi I want to make a pro-log program. there is four friend they hav...

[ -0.00075531005859375, -0.00677490234375, 0.0037689208984375, 0.031982421875, 0.00017833709716796875, 0.0001277923583984375, -0.0194091796875, -0.0025482177734375, -0.005889892578125, -0.033203125, -0.00396728515625, 0.0057373046875, 0.0019683837890625, -0.01031494140625, 0.0218505859375,...

[ 502, 4867, 1940, 7, 58994, 7413, 39210, 5303, 111, 22759, 34391, 136, 17666, 8026, 82335, 1159, 7460, 3444, 3249, 1528, 10002, 15381, 1884, 738, 73, 7639, 9790, 5895, 110, 29806 ]

[ 0.161376953125, 0.1988525390625, 0.1363525390625, 0.146484375, 0.09075927734375, 0.1207275390625, 0.189453125, 0.188720703125, 0.0228271484375, 0.209716796875, 0.17822265625, 0.0968017578125, 0.16259765625, 0.2008056640625, 0.1304931640625, 0.06982421875, 0.1107177734375, 0.0042114...

embed

6214266_c0

6214266

prolog

0

Title: Ordering lists with constraint logic programming Problem title: Ordering lists with constraint logic programming Tags: prolog, list, constraint-programming Problem: Ordering lists with constraint logic programming I was wondering if anyone could help me with this problem: I have to order a list using Prolog with...

Ordering lists with constraint logic programming Ordering lists with constraint logic programming prolog list constraint-programming Ordering same_length Permutation Ordering lists with constraint logic programming I was wondering if anyone could help me with this problem: I have to order a list using Prolog with Const...

[ 0.01470947265625, 0.006439208984375, 0.016845703125, 0.0014495849609375, 0.01055908203125, 0.0003833770751953125, -0.0164794921875, -0.01171875, 0.02099609375, -0.047607421875, 0.006072998046875, 0.0086669921875, 0.0032196044921875, -0.0130615234375, -0.01214599609375, 0.00909423828125...

[ 81206, 214, 5303, 678, 158, 2816, 4288, 62775, 56037, 502, 4867, 28966, 5701, 23986, 561, 149016, 35672, 5809, 4358, 2967, 765, 12989, 10, 17368, 1250, 1657, 50592, 238, 27958, 8110, 54, 1286, 93766, 3917, 831, 5201, 1653, 2063, 67, 61924...

[ 0.226806640625, 0.106689453125, 0.198974609375, 0.10064697265625, 0.081787109375, 0.2210693359375, 0.1044921875, 0.1455078125, 0.1212158203125, 0.1295166015625, 0.255126953125, 0.1253662109375, 0.070068359375, 0.0653076171875, 0.10272216796875, 0.0552978515625, 0.016143798828125, 0...

embed

64938512_c0

64938512

prolog

0

Title: Prolog finding max of list with two values Problem title: Prolog finding max of list with two values Tags: prolog Problem: Prolog finding max of list with two values So I am using prolog and i Have a funcntion like this: ratingList(X):-goalKeeperRating(X,A),centreForwardRating(X,B),secondStrikerRating(X,C),centr...

Prolog finding max of list with two values Prolog finding max of list with two values prolog Prolog Best Position Prolog finding max of list with two values So I am using prolog and i Have a funcntion like this: Basically the first line finds numbers and put it in the second element, then we put numbers in a list (Y). ...

[ 0.03125, -0.0152587890625, 0.01019287109375, 0.0147705078125, -0.0081787109375, 0.026123046875, -0.0002727508544921875, 0.0096435546875, 0.0016632080078125, -0.01409912109375, 0.0169677734375, 0.00921630859375, -0.0050048828125, -0.030517578125, 0.02197265625, 0.003692626953125, -0.0...

[ 1250, 4867, 90791, 18389, 111, 5303, 678, 6626, 142424, 502, 11345, 99428, 17368, 7477, 5117, 13315, 7413, 101935, 3884, 17932, 12830, 1723, 171581, 990, 140909, 116, 38887, 3443, 19069, 9351, 1001, 14012, 9920, 154663, 70, 142555, 2606, 3334...

[ 0.14892578125, 0.215087890625, 0.0753173828125, 0.213623046875, 0.0775146484375, 0.178955078125, 0.030975341796875, 0.139404296875, 0.1534423828125, 0.1038818359375, 0.0845947265625, 0.1751708984375, 0.043365478515625, 0.03521728515625, 0.02911376953125, 0.09716796875, 0.101684570312...

embed

13612591_c0

13612591

prolog

0

Title: PROLOG- occurrences of subsequence into a number Problem title: PROLOG- occurrences of subsequence into a number Tags: prolog Problem: PROLOG- occurrences of subsequence into a number Using Prolog language, I need to find out the number of occurrences of a sub-sequence in a number. I tried to count occurrences o...

PROLOG- occurrences of subsequence into a number PROLOG- occurrences of subsequence into a number prolog PROLOG word_freq Freq word_count Total Match TotSoFar Tot MatchSoFar read_word SoFar end_of_file get_code code_type PROLOG- occurrences of subsequence into a number I tried to count occurrences of a word in a big te...

[ 0.01953125, -0.0012359619140625, -0.00006151199340820312, 0.00433349609375, -0.006378173828125, -0.01397705078125, -0.00408935546875, -0.006134033203125, 0.00555419921875, -0.0296630859375, -0.0030059814453125, -0.00182342529296875, 0.00103759765625, 0.01312255859375, 0.01953125, -0.01...

[ 10514, 47510, 74918, 42, 69098, 111, 1614, 184, 944, 3956, 3934, 14012, 502, 4867, 2565, 12176, 864, 21612, 71013, 33867, 67407, 13715, 8912, 80908, 12301, 47416, 1061, 3564, 4390, 29822, 2046, 40899, 18151, 50986, 37842, 54529, 6957, 7986, ...

[ 0.18115234375, 0.234375, 0.1822509765625, 0.1337890625, 0.09033203125, 0.040283203125, 0.134765625, 0.1326904296875, 0.1590576171875, 0.0192718505859375, 0.1146240234375, 0.155517578125, 0.156982421875, 0.205810546875, 0.1927490234375, 0.16357421875, 0.0148162841796875, 0.163452148...

embed

8712804_c1

8712804

prolog

1

I want, but I get it two times and there are some other things attached. When dividing into 3 parts things get worse: ?- partition(3, [1,2,3,4], List). List = [[1], [2, 3, 4], [2], [3, 4], 2] ; List = [[1], [2, 3, 4], [2], [3, 4], 3, 4] ; List = [[1], [2, 3, 4], [2, 3], [4], 2, 3] ; List = [[1], [2, 3, 4], [2, 3], [4]...

[ -0.031982421875, 0.00958251953125, 0.0174560546875, -0.0025634765625, -0.0164794921875, 0.0125732421875, -0.01123046875, -0.01483154296875, 0.01165771484375, 0.01141357421875, -0.006317138671875, 0.007232666015625, 0.005035400390625, 0.0025634765625, 0.006744384765625, -0.0073547363281...

[ 3444, 1284, 2046, 442, 6626, 20028, 3789, 8966, 220642, 14847, 61998, 449, 3934, 138, 63920, 124632, 705, 9, 2878, 1363, 86827, 133063, 82449, 268, 32036, 2203, 25256, 4, 304, 201, 33579, 122101, 116, 2819, 378, 59535, 17550, 106, 110558, ...

[ 0.19482421875, 0.0740966796875, 0.087158203125, 0.0703125, 0.1231689453125, 0.1749267578125, 0.0182342529296875, 0.062408447265625, 0.13916015625, 0.02923583984375, 0.2064208984375, 0.07733154296875, 0.12158203125, 0.16943359375, 0.211181640625, 0.2159423828125, 0.04620361328125, 0...

embed

64516819_c0

64516819

prolog

0

Title: Prolog: find a path from root tree node to a specified node Problem title: Prolog: find a path from root tree node to a specified node Tags: tree, prolog Problem: Prolog: find a path from root tree node to a specified node I have a tree for example like this: root(atom). node(atom, [cactus, butter]). node(butter...

Prolog: find a path from root tree node to a specified node Prolog: find a path from root tree node to a specified node tree prolog root Prolog Start Destination Visited Nodes Node Path Prolog: find a path from root tree node to a specified node I have a tree for example like this: I would like to find a path for a spe...

[ 0.02587890625, 0.0234375, 0.0045166015625, 0.00113677978515625, 0.00958251953125, 0.02880859375, -0.01611328125, -0.01092529296875, -0.0093994140625, -0.0712890625, 0.01141357421875, -0.000021338462829589844, -0.0179443359375, 0.01220703125, 0.0159912109375, -0.0162353515625, 0.00668...

[ 1250, 4867, 7413, 60875, 1295, 74855, 53201, 110, 112, 47, 58735, 12, 502, 13794, 145778, 98684, 297, 438, 988, 108421, 10, 765, 27781, 903, 2806, 1884, 100, 29458, 831, 69307, 18151, 43240, 4734, 50336, 17368, 5117, 29041, 2046, 115839, ...

[ 0.17431640625, 0.2391357421875, 0.1588134765625, 0.2435302734375, 0.1112060546875, 0.184814453125, 0.202880859375, 0.17138671875, 0.15185546875, 0.1180419921875, 0.16064453125, 0.02105712890625, 0.123779296875, 0.110107421875, 0.15087890625, 0.1480712890625, 0.00531005859375, 0.135...

embed

47367008_c0

47367008

prolog

0

Title: Print minimize steps prolog Problem title: Print minimize steps prolog Tags: clpfd, eclipse-clp, prolog Problem: Print minimize steps prolog I'm working on a prolog program (CLPFD) with ECLiPSe 6.1. The program has a lot of variables and i want to minimize a certain value but (obviously) the minimization steps t...

Print minimize steps prolog Print minimize steps prolog clpfd eclipse-clp prolog Print Found Goal TimeLimit TimeOutGoal AllNodesList Result Print minimize steps prolog I'm working on a prolog program (CLPFD) with ECLiPSe 6.1. The program has a lot of variables and i want to minimize a certain value but (obviously) the ...

[ 0.00787353515625, -0.01129150390625, 0.01611328125, 0.000507354736328125, -0.007232666015625, 0.00628662109375, -0.00396728515625, -0.01904296875, 0.0047607421875, -0.0361328125, 0.00640869140625, -0.023681640625, -0.0186767578125, -0.0086669921875, 0.0140380859375, -0.0038909912109375...

[ 39754, 881, 77651, 98441, 502, 4867, 33139, 39557, 71, 106371, 184, 26775, 215624, 2016, 289, 19055, 866, 6836, 79858, 17903, 3164, 5021, 988, 154663, 126684, 20697, 1528, 37486, 41265, 397, 678, 59947, 9506, 9059, 13, 91532, 5915, 77336, 3...

[ 0.23193359375, 0.193359375, 0.21923828125, 0.257080078125, 0.1571044921875, 0.2281494140625, 0.026611328125, 0.064208984375, 0.0858154296875, 0.190673828125, 0.1153564453125, 0.11376953125, 0.1595458984375, 0.1533203125, 0.1072998046875, 0.115478515625, 0.10986328125, 0.14379882812...

embed

29834823_c1

29834823

prolog

1

_check_filtered(+LHS, +Idx, +IdxL, +RHS_L) try_check_filtered(_LHS, _Idx, [], _RHS_L) :- !. % Stop when index list is empty try_check_filtered(LHS, Idx, [Idx|Ti], [H|T]) :- !, % If at next index -> check try_check(LHS, H), Inext is Idx+1, try_check_filtered(LHS, Inext, Ti, T). try_check_filtered(LHS, Idx, IdxL, [_H|T])...

[ 0.00360107421875, 0.00012493133544921875, 0.01214599609375, -0.003265380859375, -0.004608154296875, 0.00457763671875, -0.006072998046875, -0.01318359375, 0.023193359375, -0.0172119140625, 0.0140380859375, 0.0155029296875, -0.0128173828125, 0.0113525390625, -0.00167083740234375, 0.00375...

[ 78292, 120337, 297, 1328, 866, 38131, 997, 568, 71, 425, 1052, 9790, 711, 1745, 42284, 3229, 63262, 5303, 83, 201505, 24799, 16734, 841, 618, 11737, 12765, 572, 360, 3355, 18, 21748, 2371, 384, 21658, 3564, 68416, 294, 454, 6626, 17582, ...

[ 0.2401123046875, 0.2442626953125, 0.117431640625, 0.048370361328125, 0.123779296875, 0.1990966796875, 0.07958984375, 0.01629638671875, 0.05572509765625, 0.150390625, 0.047637939453125, 0.194580078125, 0.0245361328125, 0.039337158203125, 0.199951171875, 0.05877685546875, 0.16735839843...

embed

4187632_c0

4187632

prolog

0

Title: Fast reverse sort in (SWI) Prolog Problem title: Fast reverse sort in (SWI) Prolog Tags: prolog, sorting Problem: Fast reverse sort in (SWI) Prolog I'm looking for a fast way to sort a list in reverse order in Prolog. Algorithmically it should perform as quickly as standard sort, but the options that I've come u...

Fast reverse sort in (SWI) Prolog Fast reverse sort in (SWI) Prolog prolog sorting Fast SWI Prolog rsort1 Tmp rsort2 reverse_compare Delta Size test_list NsS CPU Lips Fast reverse sort in (SWI) Prolog I'm looking for a fast way to sort a list in reverse order in Prolog. Algorithmically it should perform as quickly as s...

[ -0.005645751953125, 0.01116943359375, 0.0111083984375, -0.0283203125, -0.01318359375, -0.01025390625, 0.006744384765625, 0.0023193359375, 0.00445556640625, -0.031005859375, 0.023193359375, 0.0546875, -0.01055908203125, -0.0059814453125, 0.02734375, -0.013427734375, -0.002822875976562...

[ 25290, 39531, 184, 12096, 23, 294, 38969, 1250, 4867, 502, 159, 1690, 62351, 418, 2676, 304, 277, 16082, 56588, 80378, 3034, 6562, 86039, 156903, 16487, 4271, 3917, 5303, 12989, 109847, 51339, 69405, 5570, 50717, 5045, 72803, 56, 7145, 2063...

[ 0.1510009765625, 0.243896484375, 0.199951171875, 0.219970703125, 0.0421142578125, 0.008880615234375, 0.1837158203125, 0.1422119140625, 0.213134765625, 0.090576171875, 0.0118408203125, 0.07049560546875, 0.244140625, 0.05279541015625, 0.1326904296875, 0.1422119140625, 0.02288818359375,...

embed

34440737_c0

34440737

prolog

0

Title: Time complexity of Prolog better than naive brute force? Problem title: Time complexity of Prolog better than naive brute force? Tags: prolog, c, scheme Problem: Time complexity of Prolog better than naive brute force? Is the time complexity of solving anything in (the best) Prolog better than a naive brute forc...

Time complexity of Prolog better than naive brute force? Time complexity of Prolog better than naive brute force? prolog c scheme Time Prolog Time complexity of Prolog better than naive brute force? Is the time complexity of solving anything in (the best) Prolog better than a naive brute force backtracking implementati...

[ 0.0106201171875, 0.0185546875, 0.01361083984375, -0.0031280517578125, -0.004180908203125, -0.00811767578125, 0.00726318359375, -0.017578125, 0.00157928466796875, -0.054931640625, 0.0028839111328125, 0.00689697265625, -0.00634765625, 0.01263427734375, 0.004852294921875, 0.00283813476562...

[ 19055, 27140, 2481, 111, 1250, 4867, 11522, 3501, 24, 5844, 55042, 13, 37772, 502, 501, 150370, 2071, 1733, 3115, 6496, 23937, 23, 2965, 4420, 125728, 214, 208124, 5154, 46876, 137567, 149016, 51529, 234873, 246, 17368, 11782, 10060, 34702, ...

[ 0.1572265625, 0.220458984375, 0.0975341796875, 0.004974365234375, 0.2032470703125, 0.28271484375, 0.18115234375, 0.0537109375, 0.1119384765625, 0.1300048828125, 0.1536865234375, 0.010345458984375, 0.1673583984375, 0.1468505859375, 0.0897216796875, 0.1551513671875, 0.0190277099609375,...

embed

67096594_c0

67096594

prolog

0

Title: How can I compare items in a Prolog database? Problem title: How can I compare items in a Prolog database? Tags: prolog Problem: How can I compare items in a Prolog database? I have a Prolog database that is dateopened(asda,date(1985,12,5)). dateopened(tesco,date(1979,12,17)). dateopened(morrisons,date(1999,12,2...

How can I compare items in a Prolog database? How can I compare items in a Prolog database? prolog How Prolog Supermarket Year How can I compare items in a Prolog database? I have a Prolog database that is I want to find out how to ask the following questions (Prolog queries) to answer the following: Are there any two ...

[ -0.00445556640625, -0.00726318359375, 0.00579833984375, 0.0211181640625, 0.006744384765625, 0.004974365234375, -0.00148773193359375, 0.0216064453125, 0.0012664794921875, 0.00421142578125, -0.0019989013671875, 0.01416015625, 0.0274658203125, 0.0011138916015625, -0.00775146484375, -0.022...

[ 11249, 831, 69101, 55769, 23, 1250, 4867, 63399, 502, 4265, 55637, 42552, 87, 3642, 26458, 17582, 10752, 41, 10484, 35166, 6626, 117781, 128584, 142096, 5701, 5155, 123055, 6528, 6602, 11704, 110, 37842, 7, 9571, 10586, 5351, 56065, 29786, ...

[ 0.0682373046875, 0.06439208984375, 0.2298583984375, 0.18896484375, 0.047088623046875, 0.17431640625, 0.257080078125, 0.2266845703125, 0.0965576171875, 0.1337890625, 0.1671142578125, 0.1583251953125, 0.037994384765625, 0.008636474609375, 0.099853515625, 0.0833740234375, 0.115356445312...

embed

62312941_c0

62312941

prolog

0

Title: How to iterate through the predicates in Prolog Problem title: How to iterate through the predicates in Prolog Tags: prolog Problem: How to iterate through the predicates in Prolog I'm new to prolog, but basically, I want a program to iterate through the predicates(not sure if I'm using that term correctly) and ...

How to iterate through the predicates in Prolog How to iterate through the predicates in Prolog prolog How Prolog social_life How to iterate through the predicates in Prolog I'm new to prolog, but basically, I want a program to iterate through the predicates(not sure if I'm using that term correctly) and then come to a...

[ -0.00634765625, -0.0216064453125, -0.0025787353515625, 0.0069580078125, -0.00762939453125, 0.0380859375, 0.035400390625, -0.004852294921875, 0.000637054443359375, -0.048828125, 0.0030670166015625, 0.00970458984375, -0.032470703125, 0.00518798828125, 0.01123046875, 0.01458740234375, 0...

[ 11249, 47, 17, 8560, 67, 8305, 1653, 2063, 1636, 23, 1250, 4867, 502, 2265, 24804, 3525, 3444, 1528, 1380, 2704, 9433, 107730, 22691, 111, 6626, 35166, 26458, 136, 22288, 6562, 1927, 98767, 41925, 22904, 3917, 38937, 32635, 438, 64457, 29...

[ 0.076904296875, 0.002655029296875, 0.07574462890625, 0.25146484375, 0.16943359375, 0.1763916015625, 0.201416015625, 0.2236328125, 0.157470703125, 0.03753662109375, 0.1900634765625, 0.24072265625, 0.142822265625, 0.1361083984375, 0.1619873046875, 0.0155029296875, 0.04241943359375, 0...

embed

21216105_c0

21216105

prolog

0

Title: Prevent backtracking after first solution to Fibonacci pair Problem title: Prevent backtracking after first solution to Fibonacci pair Tags: backtracking, fibonacci, clpfd, prolog, failure-slice Problem: Prevent backtracking after first solution to Fibonacci pair The term fib(N,F) is true when F is the N th Fibo...

Prevent backtracking after first solution to Fibonacci pair Prevent backtracking after first solution to Fibonacci pair backtracking fibonacci clpfd prolog failure-slice Prevent Fibonacci use_module Prevent backtracking after first solution to Fibonacci pair The term fib(N,F) is true when F is the N th Fibonacci number...

[ 0.01397705078125, 0.01092529296875, 0.01556396484375, 0.002960205078125, -0.0166015625, -0.003753662109375, 0.01177978515625, -0.00140380859375, 0.02099609375, -0.0673828125, 0.01324462890625, -0.0111083984375, -0.000164031982421875, 0.01611328125, 0.01495361328125, 0.0133056640625, ...

[ 1914, 16274, 4420, 125728, 214, 7103, 5117, 29806, 3698, 20990, 52544, 80836, 809, 39557, 71, 502, 4867, 137578, 13348, 4527, 83279, 13579, 275, 839, 4, 919, 29568, 3229, 563, 83, 541, 5675, 14012, 25632, 1250, 18151, 137567, 20697, 163, ...

[ 0.1334228515625, 0.1591796875, 0.1326904296875, 0.2333984375, 0.0516357421875, 0.1455078125, 0.165283203125, 0.172607421875, 0.13818359375, 0.1654052734375, 0.1689453125, 0.1573486328125, 0.183837890625, 0.001434326171875, 0.006439208984375, 0.087890625, 0.2130126953125, 0.12426757...

embed

53948483_c1

53948483

prolog

1

, which is the status of the system and it is the input for most of the functions. Then I tried to implement the function that defines where the agent is at a certain status of the system . This is my last (buggy) version of my at function: at(1, 1, S) :- S =:= 0, !. at(X, Y, S) :- writef('Am I at %w, %w at status %w?\...

[ 0.0010833740234375, 0.03515625, -0.00408935546875, 0.00439453125, -0.0135498046875, 0.0159912109375, 0.0196533203125, -0.0023040771484375, -0.00323486328125, -0.032470703125, 0.00830078125, 0.050537109375, -0.0208740234375, -0.00701904296875, 0.01129150390625, 0.0216064453125, -0.004...

[ 3129, 83, 70, 10778, 111, 5426, 442, 107730, 2684, 32354, 87, 37842, 29479, 61924, 7, 7440, 23882, 99, 24233, 4568, 978, 67192, 11389, 759, 41600, 106, 159, 15772, 1369, 757, 711, 1542, 990, 33022, 420, 23135, 1745, 434, 4, 160634, 1204...

[ 0.00323486328125, 0.1328125, 0.036651611328125, 0.243896484375, 0.03753662109375, 0.1849365234375, 0.026397705078125, 0.2220458984375, 0.14892578125, 0.2437744140625, 0.11767578125, 0.111572265625, 0.192626953125, 0.2296142578125, 0.03173828125, 0.1922607421875, 0.27978515625, 0.24...

embed

78025800_c0

78025800

prolog

0

Title: Infinite loop for user-defined list_length Problem title: Infinite loop for user-defined list_length Tags: prolog, logic, programming-languages Problem: Infinite loop for user-defined list_length Here is a list length method: list_length([], 0). list_length([_|T], N) :- list_length(T, TN), N is TN + 1. If I quer...

Infinite loop for user-defined list_length Infinite loop for user-defined list_length prolog logic programming-languages Infinite list_length Call _26 _58 _97 Exit _57 Redo _84 _123 _151 _83 Fail _110 _149 _177 _109 _206 Infinite loop for user-defined list_length Here is a list length method: If I query list_length(X, ...

[ -0.00970458984375, 0.01300048828125, 0.004852294921875, 0.00970458984375, -0.000263214111328125, -0.007232666015625, 0.0064697265625, 0.00732421875, 0.00830078125, -0.03271484375, 0.0118408203125, -0.010986328125, 0.00022220611572265625, 0.00811767578125, 0.0301513671875, 0.01434326171...

[ 134322, 13, 40956, 100, 38937, 112, 5983, 5303, 23986, 502, 4867, 62775, 56037, 196651, 26265, 4046, 10057, 101, 14773, 5443, 12243, 6096, 31, 13903, 48636, 135224, 17168, 190355, 36053, 141605, 144283, 106000, 139652, 927, 140909, 55300, 4263,...

[ 0.1903076171875, 0.1036376953125, 0.250732421875, 0.041107177734375, 0.1865234375, 0.07366943359375, 0.1824951171875, 0.2034912109375, 0.140869140625, 0.0799560546875, 0.1829833984375, 0.0892333984375, 0.066162109375, 0.05316162109375, 0.1588134765625, 0.17822265625, 0.1590576171875,...

embed

284826_c0

284826

prolog

0

Title: Trailing variable in a prolog list Problem title: Trailing variable in a prolog list Tags: prolog Problem: Trailing variable in a prolog list I'm on a beginner level course in prolog, doing a map colouring problem. Here's my code. col(Colors,Map,Coloring) :- checkMap(Colors,Map,Coloring). checkMap(Colors,[Countr...

Trailing variable in a prolog list Trailing variable in a prolog list prolog Trailing Colors Map Coloring Country1:Country2 Rest Country1:Color1 Country2:Color2 Color1 Color2 _G332 Trailing variable in a prolog list I'm on a beginner level course in prolog, doing a map colouring problem. Here's my code. My output looks...

[ 0.01446533203125, -0.001953125, -0.01385498046875, 0.00958251953125, -0.006866455078125, 0.004791259765625, -0.011474609375, 0.0069580078125, 0.0181884765625, -0.0128173828125, 0.00628662109375, -0.004058837890625, 0.0036773681640625, 0.0018310546875, -0.003021240234375, 0.014709472656...

[ 130431, 214, 77336, 23, 502, 4867, 5303, 51193, 42719, 74831, 82825, 108210, 304, 49756, 10625, 1484, 418, 724, 123128, 1679, 17366, 15411, 22288, 134855, 2967, 18151, 140992, 33342, 1884, 903, 3714, 3642, 831, 2046, 31351, 111, 70, 141037, ...

[ 0.260498046875, 0.218994140625, 0.31787109375, 0.0406494140625, 0.170654296875, 0.24072265625, 0.21142578125, 0.2181396484375, 0.15185546875, 0.1302490234375, 0.047027587890625, 0.064697265625, 0.09228515625, 0.1556396484375, 0.062744140625, 0.140869140625, 0.0394287109375, 0.01567...

embed

34032577_c0

34032577

prolog

0

Title: Behavior of `foldl1/3` and `foldr1/3` meta-predicates on empty lists Problem title: Behavior of `foldl1/3` and `foldr1/3` meta-predicates on empty lists Tags: prolog, meta-predicate, logtalk Problem: Behavior of `foldl1/3` and `foldr1/3` meta-predicates on empty lists Looking for advice. I'm adding foldl1/3 and ...

Behavior of `foldl1/3` and `foldr1/3` meta-predicates on empty lists Behavior of `foldl1/3` and `foldr1/3` meta-predicates on empty lists prolog meta-predicate logtalk Behavior foldl1 foldr1 Closure Head Tail Result foldr1_ Arg2 Args Arg1 Acc Acc2 Behavior of `foldl1/3` and `foldr1/3` meta-predicates on empty lists Loo...

[ -0.0030364990234375, 0.002349853515625, 0.00136566162109375, -0.004608154296875, -0.0186767578125, 0.0093994140625, 0.01043701171875, -0.00970458984375, -0.002685546875, -0.018798828125, 0.0186767578125, -0.000621795654296875, -0.02978515625, 0.00787353515625, 0.025634765625, -0.007324...

[ 98409, 42822, 141, 131530, 42, 23550, 19714, 2063, 201505, 5303, 502, 4867, 12684, 139109, 18344, 20469, 7569, 51053, 44816, 1218, 126684, 1172, 67660, 154107, 13146, 35773, 72546, 61924, 80934, 159029, 678, 42856, 35782, 157167, 11782, 165164, ...

[ 0.097412109375, 0.1611328125, 0.0250396728515625, 0.22705078125, 0.014434814453125, 0.2000732421875, 0.15234375, 0.1427001953125, 0.200927734375, 0.18994140625, 0.032073974609375, 0.1163330078125, 0.02410888671875, 0.1920166015625, 0.125732421875, 0.12744140625, 0.1064453125, 0.060...

embed

20501165_c1

20501165

prolog

1

is a wrong way to do it, I figured I'd try it in an iterative way. This is what I have so far: totalWeightOfSet([],0). totalWeightOfSet([Head|RestOfSet],Weight) :- objectWeight(Head,HeadWeight), totalWeightOfSet(RestOfSet, RestWeight), Weight is HeadWeight + RestWeight. findBestBalancedSet(ListOfObjects,Sets) :- gener...

[ 0.0228271484375, 0.00933837890625, 0.01416015625, 0.0107421875, -0.01190185546875, 0.027587890625, -0.026611328125, -0.003997802734375, 0.0164794921875, -0.005584716796875, 0.01025390625, 0.01214599609375, 0.0203857421875, -0.00421142578125, 0.017578125, -0.00078582763671875, 0.00891...

[ 83, 44691, 3917, 54, 442, 26366, 9790, 720, 45023, 3293, 765, 2060, 3622, 12137, 22553, 132887, 294, 126, 77495, 13025, 712, 1052, 525, 15772, 36746, 49756, 150533, 44816, 997, 7413, 110601, 63641, 7154, 154663, 75161, 139392, 43512, 7192, ...

[ 0.0484619140625, 0.1534423828125, 0.0982666015625, 0.0692138671875, 0.082763671875, 0.047149658203125, 0.1265869140625, 0.1217041015625, 0.0775146484375, 0.023834228515625, 0.0635986328125, 0.0872802734375, 0.166259765625, 0.1956787109375, 0.2056884765625, 0.189208984375, 0.190551757...

embed

13440927_c0

13440927

prolog

0

Title: How to get both drive predicates working in prolog? Problem title: How to get both drive predicates working in prolog? Tags: prolog, win-prolog Problem: How to get both drive predicates working in prolog? begin:- go, initialise. % drive predicate begin:- write('Sorry cannot help'),nl,nl. go:- write('Below is the...

How to get both drive predicates working in prolog? How to get both drive predicates working in prolog? prolog win-prolog How Sorry Below loop_through_list action_men train_tracks control_car drees_up doll_house Head Tail TOY GENERATING SYSTEM Please How to get both drive predicates working in prolog? The problem here ...

[ 0.03173828125, -0.000045299530029296875, -0.005279541015625, 0.01153564453125, -0.00543212890625, 0.022216796875, 0.0162353515625, -0.0115966796875, 0.0050048828125, -0.0230712890625, 0.0225830078125, 0.019775390625, -0.0172119140625, 0.00079345703125, 0.003204345703125, 0.008483886718...

[ 11249, 47, 2046, 15044, 22648, 1653, 2063, 1636, 20697, 23, 502, 4867, 19916, 3454, 90502, 17336, 40956, 222521, 6562, 22631, 1055, 25550, 125728, 6226, 3284, 17745, 2037, 54, 1181, 23923, 44816, 1218, 379, 51222, 109141, 24947, 55858, 90420,...

[ 0.0838623046875, 0.013427734375, 0.095703125, 0.2110595703125, 0.214111328125, 0.220458984375, 0.233154296875, 0.123779296875, 0.167236328125, 0.06011962890625, 0.1732177734375, 0.243408203125, 0.1240234375, 0.1373291015625, 0.1552734375, 0.1661376953125, 0.09912109375, 0.067993164...

embed

68496547_c0

68496547

prolog

0

Title: Prolog ask a question and resolve by dependency comprehension question Problem title: Prolog ask a question and resolve by dependency comprehension question Tags: prolog Problem: Prolog ask a question and resolve by dependency comprehension question i am new in Prolog and fighting me through examples. Now I woul...

Prolog ask a question and resolve by dependency comprehension question Prolog ask a question and resolve by dependency comprehension question prolog Prolog Prolog ask a question and resolve by dependency comprehension question i am new in Prolog and fighting me through examples. Now I would write a simple program by ha...

[ 0.0098876953125, 0.005706787109375, -0.005126953125, 0.0177001953125, -0.0003681182861328125, 0.0067138671875, 0.0054931640625, 0.0030364990234375, -0.01416015625, -0.0240478515625, -0.01708984375, -0.017578125, -0.01153564453125, 0.00958251953125, 0.018310546875, 0.022216796875, -0....

[ 1250, 4867, 26458, 9655, 136, 103608, 390, 42548, 27771, 46683, 3220, 502, 3525, 181952, 27781, 2806, 33022, 8781, 1528, 19441, 12921, 149357, 54, 12097, 83, 10, 2412, 4517, 959, 53408, 11907, 26249, 40617, 738, 257, 63805, 28864, 83425, 14...

[ 0.166259765625, 0.24560546875, 0.099365234375, 0.1578369140625, 0.056640625, 0.1717529296875, 0.06866455078125, 0.19189453125, 0.066650390625, 0.129150390625, 0.1300048828125, 0.1351318359375, 0.06671142578125, 0.1087646484375, 0.0941162109375, 0.008209228515625, 0.08160400390625, ...

embed

16164869_c0

16164869

prolog

0

Title: "Squares" Logic Riddle Solution in Prolog Problem title: "Squares" Logic Riddle Solution in Prolog Tags: logic, prolog, puzzle Problem: "Squares" Logic Riddle Solution in Prolog "Squares" Input : Board size m × n (m, n ∈ {1,...,32}), list of triples (i, j, k) , where i ∈ {1,...,m}, j ∈ {1,......

"Squares" Logic Riddle Solution in Prolog "Squares" Logic Riddle Solution in Prolog logic prolog puzzle Squares Logic Riddle Solution Prolog "Squares" Logic Riddle Solution in Prolog "Squares" Input : Board size m × n (m, n ∈ {1,...,32}), list of triples (i, j, k) , where i ∈ {1,...,m}, j ∈ {1,...,n...

[ 0.00274658203125, 0.0206298828125, 0.0023193359375, -0.005828857421875, -0.0181884765625, -0.005828857421875, -0.00762939453125, 0.01336669921875, 0.0023193359375, -0.004974365234375, 0.008544921875, 0.000881195068359375, 0.00131988525390625, -0.017333984375, 0.0036773681640625, 0.0153...

[ 41502, 294, 94727, 90, 1230, 50592, 41231, 19298, 187895, 23, 1250, 4867, 238, 62775, 502, 104192, 68305, 360, 7077, 62554, 13267, 347, 34070, 653, 39, 245918, 418, 27, 6460, 5303, 162738, 14, 1647, 472, 17, 19, 2389, 9, 10461, 1280, 28...

[ 0.039886474609375, 0.051971435546875, 0.25634765625, 0.19384765625, 0.037841796875, 0.1636962890625, 0.1444091796875, 0.1348876953125, 0.1441650390625, 0.02490234375, 0.1810302734375, 0.2154541015625, 0.006195068359375, 0.115478515625, 0.10113525390625, 0.09979248046875, 0.2653808593...

embed

31434659_c1

31434659

prolog

1

: (7) intepretation("", "abc", _G1441) ? creep Redo: (7) string_concat(_G1513, _G1514, abc) ? creep Exit: (7) string_concat("a", "bc", abc) ? creep Call: (7) intepretation("a", "bc", _G1441) ? creep Call: (8) lexicon("a", _G1520) ? creep Fail: (8) lexicon("a", _G1520) ? creep % What's happening on this line? Fail: (7) ...

[ -0.0034942626953125, -0.018798828125, -0.01495361328125, 0.0478515625, 0.00020885467529296875, 0.031494140625, 0.021484375, 0.005279541015625, 0.016845703125, 0.006683349609375, 0.00860595703125, -0.005584716796875, -0.04833984375, -0.00579833984375, 0.023681640625, -0.014892578125, ...

[ 152, 8696, 892, 4692, 22062, 2055, 238, 724, 2592, 123001, 49512, 254, 6096, 31, 79315, 2271, 4460, 1837, 2681, 1563, 5443, 217, 11, 65037, 26265, 10021, 95, 73140, 73419, 190355, 1745, 123087, 98, 903, 13315, 178851, 9077, 16750, 163, 12...

[ 0.055389404296875, 0.16455078125, 0.1180419921875, 0.2197265625, 0.112548828125, 0.07354736328125, 0.08935546875, 0.05682373046875, 0.145751953125, 0.2060546875, 0.1697998046875, 0.1492919921875, 0.1036376953125, 0.1707763671875, 0.1961669921875, 0.071533203125, 0.198486328125, 0.0...

embed

47500158_c0

47500158

prolog

0

Title: Prolog - Recursion exiting giving the wrong value Problem title: Prolog - Recursion exiting giving the wrong value Tags: recursion, prolog Problem: Prolog - Recursion exiting giving the wrong value So I made this code to find the intersection between two lists. intersect([], _, C). intersect([A1|AS], B, C) :- me...

Prolog - Recursion exiting giving the wrong value Prolog - Recursion exiting giving the wrong value recursion prolog Prolog Recursion Call Exit Prolog - Recursion exiting giving the wrong value So I made this code to find the intersection between two lists. And it indeed finds the intersections when the list A is empty...

[ 0.0107421875, -0.008056640625, 0.039794921875, -0.003997802734375, -0.0021514892578125, 0.0164794921875, -0.022216796875, -0.00445556640625, 0.01043701171875, -0.0037841796875, 0.0145263671875, 0.0184326171875, -0.01446533203125, 0.00909423828125, 0.03076171875, -0.000888824462890625, ...

[ 1250, 4867, 165428, 42, 6889, 82230, 214, 68772, 44691, 34292, 195625, 502, 26265, 5443, 217, 18151, 7413, 1940, 7, 58994, 17721, 6626, 5303, 160463, 3229, 62, 201505, 49903, 313, 144851, 903, 75101, 10433, 24762, 133063, 82449, 104629, 13600...

[ 0.157958984375, 0.23046875, 0.19482421875, 0.1925048828125, 0.1416015625, 0.2059326171875, 0.0579833984375, 0.09130859375, 0.1929931640625, 0.1756591796875, 0.21142578125, 0.1131591796875, 0.1695556640625, 0.15869140625, 0.059051513671875, 0.1007080078125, 0.1480712890625, 0.170166...

embed

26542713_c0

26542713

prolog

0

Title: Traverse Context Free Grammar Problem title: Traverse Context Free Grammar Tags: dcg, postfix-notation, prolog Problem: Traverse Context Free Grammar I am facing a problem of traversing a CFG used in prolog environment , to make it traverse in a postorder way. Following is the grammar used - list_ast(Ls, AST) :-...

Traverse Context Free Grammar Traverse Context Free Grammar dcg postfix-notation prolog Traverse Context Free Grammar list_ast AST expression_r E0-T term_r power_r Traverse Context Free Grammar I am facing a problem of traversing a CFG used in prolog environment , to make it traverse in a postorder way. Following is th...

[ 0.0306396484375, 0.0032958984375, 0.00081634521484375, 0.01416015625, 0.008544921875, -0.008056640625, -0.0150146484375, 0.0032501220703125, -0.002105712890625, -0.038330078125, 0.0020599365234375, 0.0164794921875, -0.025146484375, 0.000736236572265625, -0.00408935546875, 0.01867675781...

[ 4937, 37676, 1657, 22829, 5153, 48078, 1727, 238, 177, 1305, 55923, 157, 22062, 502, 4867, 5303, 4438, 48963, 125195, 241, 2389, 618, 13579, 42, 14537, 2967, 37317, 123254, 11814, 65998, 13, 80596, 122092, 147, 14847, 71924, 25632, 140992, ...

[ 0.1077880859375, 0.2044677734375, 0.0836181640625, 0.151123046875, 0.1409912109375, 0.1466064453125, 0.0672607421875, 0.00054931640625, 0.1162109375, 0.090087890625, 0.1759033203125, 0.105712890625, 0.0244140625, 0.146728515625, 0.233642578125, 0.1490478515625, 0.138916015625, 0.11...

embed

7282829_c0

7282829

prolog

0

Title: SWI Prolog , how to assert data to txt file Problem title: SWI Prolog , how to assert data to txt file Tags: prolog Problem: SWI Prolog , how to assert data to txt file This is my sample source code , I am using SWI Prolog , can someone tell me how to assert data that user key in to txt.file. I want save the dat...

SWI Prolog , how to assert data to txt file SWI Prolog , how to assert data to txt file prolog SWI Prolog display_menu Matching Partner System n1.Enter n0.exits Choice get_userinfo get_userinfo:-write Enter User Information Name Gender Age get_attribute Attr Height SWI Prolog , how to assert data to txt file This is my...

[ 0.0213623046875, 0.0123291015625, 0.018798828125, 0.0184326171875, -0.0137939453125, 0.004302978515625, -0.0035247802734375, 0.0157470703125, -0.004852294921875, -0.00019931793212890625, 0.0015411376953125, -0.0068359375, -0.01214599609375, -0.01446533203125, 0.035888671875, 0.01422119...

[ 159, 38969, 1250, 4867, 3642, 47, 237, 33657, 2053, 124326, 11435, 502, 44116, 30144, 67407, 16424, 12353, 155581, 2389, 3355, 181948, 2046, 65918, 7319, 434, 18781, 60816, 53400, 32007, 15757, 527, 23894, 72944, 191145, 9208, 42, 1529, 22553...

[ 0.086181640625, 0.2393798828125, 0.170654296875, 0.218017578125, 0.058074951171875, 0.1285400390625, 0.1171875, 0.2308349609375, 0.17333984375, 0.2425537109375, 0.14892578125, 0.1365966796875, 0.0572509765625, 0.1180419921875, 0.1280517578125, 0.148193359375, 0.0712890625, 0.065551...

embed

32413364_c0

32413364

prolog

0

Title: how to find a route to travel between two cities, using an accumulator in Prolog Problem title: how to find a route to travel between two cities, using an accumulator in Prolog Tags: prolog Problem: how to find a route to travel between two cities, using an accumulator in Prolog I have a predicate directTrain/2 ...

how to find a route to travel between two cities, using an accumulator in Prolog how to find a route to travel between two cities, using an accumulator in Prolog prolog an Prolog Route how to find a route to travel between two cities, using an accumulator in Prolog I have a predicate directTrain/2 which defines a direc...

[ 0.021484375, 0.006683349609375, 0.00823974609375, 0.0257568359375, 0.006256103515625, 0.007415771484375, -0.0157470703125, 0.0174560546875, 0.0150146484375, -0.0712890625, 0.032958984375, 0.000598907470703125, -0.01043701171875, 0.0101318359375, 0.01318359375, -0.00634765625, -0.0023...

[ 3642, 7413, 36439, 47, 26983, 17721, 6626, 162708, 17368, 183278, 1290, 1250, 4867, 10, 502, 142, 106015, 1653, 2063, 8951, 28542, 73, 12477, 61924, 60875, 1295, 3687, 62, 335, 51359, 3647, 67, 284, 571, 12724, 6743, 8337, 184345, 3173, 5...

[ 0.07183837890625, 0.1463623046875, 0.262451171875, 0.10498046875, 0.200439453125, 0.169189453125, 0.1417236328125, 0.1689453125, 0.051025390625, 0.207275390625, 0.1488037109375, 0.171142578125, 0.2283935546875, 0.03314208984375, 0.10369873046875, 0.033782958984375, 0.2288818359375, ...

embed

48222230_c0

48222230

prolog

0

Title: Finding a person with no siblings in prolog Problem title: Finding a person with no siblings in prolog Tags: prolog Problem: Finding a person with no siblings in prolog I'm trying to write Prolog code that calculates how the fortune of man divided between his family members based on Islamic inheritance rules. On...

Finding a person with no siblings in prolog Finding a person with no siblings in prolog prolog Finding What Finding a person with no siblings in prolog I'm trying to write Prolog code that calculates how the fortune of man divided between his family members based on Islamic inheritance rules. One of the cases is that, ...

[ 0.00007581710815429688, 0.019287109375, -0.00000959634780883789, -0.006561279296875, -0.021728515625, 0.00665283203125, 0.0164794921875, 0.0067138671875, 0.004302978515625, -0.023193359375, 0.00274658203125, -0.03369140625, -0.0186767578125, -0.0002231597900390625, 0.0159912109375, -0....

[ 26040, 214, 10, 3445, 678, 110, 78, 79298, 7, 23, 502, 4867, 4865, 33022, 1250, 18151, 74481, 100, 45091, 332, 101637, 71, 17721, 14449, 43032, 35509, 116625, 3334, 217, 91736, 76849, 1295, 67373, 1556, 7108, 23552, 1919, 5423, 79986, 109...

[ 0.149169921875, 0.0139923095703125, 0.0159149169921875, 0.1546630859375, 0.081298828125, 0.16162109375, 0.138427734375, 0.1925048828125, 0.027801513671875, 0.0452880859375, 0.147216796875, 0.201416015625, 0.012725830078125, 0.0182952880859375, 0.097412109375, 0.0908203125, 0.09558105...

embed

20981144_c0

20981144

prolog

0

Title: Dynamic database - including and excluding files Problem title: Dynamic database - including and excluding files Tags: database, dynamic, prolog, include Problem: Dynamic database - including and excluding files Does prolog have built-in predicates, which can import and export complete files during runtime? I ne...

Dynamic database - including and excluding files Dynamic database - including and excluding files database dynamic prolog include Dynamic file.pl Dynamic database - including and excluding files Does prolog have built-in predicates, which can import and export complete files during runtime? I need predicates like "asse...

[ 0.028076171875, 0.000514984130859375, 0.003021240234375, 0.0216064453125, -0.0322265625, -0.000659942626953125, -0.005126953125, 0.0126953125, 0.012939453125, -0.0478515625, 0.006622314453125, 0.023681640625, -0.02099609375, 0.00494384765625, 0.033935546875, 0.0038604736328125, 0.016...

[ 73327, 21068, 63399, 26719, 136, 39041, 6238, 102158, 84079, 502, 4867, 26698, 11435, 2424, 765, 88303, 73, 1653, 2063, 1636, 831, 24927, 31255, 28484, 20271, 11675, 6032, 3871, 162, 33657, 107, 39989, 2967, 45258, 5303, 6626, 48322, 3642, ...

[ 0.1748046875, 0.1253662109375, 0.22412109375, 0.1444091796875, 0.057769775390625, 0.1824951171875, 0.0419921875, 0.1898193359375, 0.21728515625, 0.1788330078125, 0.242919921875, 0.176025390625, 0.201416015625, 0.1163330078125, 0.050323486328125, 0.12744140625, 0.1151123046875, 0.15...

embed

46946974_c0

46946974

prolog

0

Title: How to assign variables in a recursion? Problem title: How to assign variables in a recursion? Tags: prolog Problem: How to assign variables in a recursion? Suppose you have a bunch of boxes inside other boxes, i.e. inBox(a,b). inBox(b,c). inBox(c,d). inBox(x,y) meansbox x is in box y. Now I want to write a meth...

How to assign variables in a recursion? How to assign variables in a recursion? prolog How Call Fail How to assign variables in a recursion? Suppose you have a bunch of boxes inside other boxes, i.e. inBox(x,y) meansbox x is in box y. Now I want to write a method to determine if one box is inside of another box, e.g. i...

[ 0.00167083740234375, 0.022216796875, -0.0029144287109375, 0.025146484375, 0.00457763671875, 0.01116943359375, -0.015380859375, 0.010498046875, 0.003997802734375, 0.012451171875, 0.016845703125, 0.004425048828125, -0.0068359375, -0.0145263671875, 0.03271484375, 0.01055908203125, 0.008...

[ 11249, 95486, 77336, 7, 23, 195625, 1830, 10, 502, 4867, 26265, 190355, 147306, 16530, 46132, 3789, 72295, 53, 11728, 1022, 113, 33022, 55300, 83324, 2174, 111, 15700, 71, 29568, 104, 6083, 5844, 2967, 3115, 35782, 61475, 432, 1632, 1257, ...

[ 0.06494140625, 0.2496337890625, 0.283203125, 0.0670166015625, 0.1429443359375, 0.2314453125, 0.1536865234375, 0.03167724609375, 0.046905517578125, 0.0843505859375, 0.119873046875, 0.176025390625, 0.039276123046875, 0.1551513671875, 0.17138671875, 0.056793212890625, 0.1923828125, 0....

embed

30283221_c0

30283221

prolog

0

Title: prolog recursive searching with contraints Problem title: prolog recursive searching with contraints Tags: prolog, search, transitive-closure Problem: prolog recursive searching with contraints I have a house with rooms that are defined with connections for when you can go from one room to another eg. connection...

prolog recursive searching with contraints prolog recursive searching with contraints prolog search transitive-closure Item Somewhere prolog recursive searching with contraints I have a house with rooms that are defined with connections for when you can go from one room to another eg. Im trying to figure out how make i...

[ 0.000751495361328125, 0.021240234375, 0.00921630859375, 0.00439453125, 0.007171630859375, 0.01092529296875, -0.0198974609375, -0.00101470947265625, 0.0125732421875, -0.047119140625, 0.01202392578125, -0.016357421875, -0.01123046875, 0.005035400390625, -0.004730224609375, -0.00457763671...

[ 502, 4867, 195625, 5844, 157318, 678, 2304, 4288, 33938, 62621, 170224, 78426, 136913, 765, 18276, 112875, 61924, 94878, 831, 738, 1295, 17155, 47, 15700, 31577, 26366, 3249, 58585, 4734, 2046, 1632, 29458, 35735, 23, 98483, 55769, 16712, 313...

[ 0.1688232421875, 0.2283935546875, 0.204345703125, 0.1043701171875, 0.2137451171875, 0.0819091796875, 0.195556640625, 0.1829833984375, 0.198486328125, 0.1534423828125, 0.215576171875, 0.17529296875, 0.012939453125, 0.016387939453125, 0.108642578125, 0.167724609375, 0.1339111328125, ...

embed

72351295_c0

72351295

prolog

0

Title: Tail-recursive list of divisors of an integer in prolog Problem title: Tail-recursive list of divisors of an integer in prolog Tags: prolog, tail-recursion Problem: Tail-recursive list of divisors of an integer in prolog I am trying to make a simple tail-recursive loop to collect the divisors of an integer, divi...

Tail-recursive list of divisors of an integer in prolog Tail-recursive list of divisors of an integer in prolog prolog tail-recursion Tail-recursive What divisors_aux List Aux D-1 N-1 Tail-recursive list of divisors of an integer in prolog I am trying to make a simple tail-recursive loop to collect the divisors of an i...

[ 0.006072998046875, 0.00020503997802734375, 0.02392578125, -0.003509521484375, -0.0068359375, 0.01348876953125, -0.016357421875, -0.0103759765625, 0.00457763671875, -0.0296630859375, 0.0191650390625, -0.00457763671875, -0.002166748046875, 0.02197265625, 0.016845703125, 0.003250122070312...

[ 1218, 379, 107, 48650, 5844, 5303, 45, 51858, 7, 892, 1505, 502, 4867, 46741, 4865, 10442, 32036, 6077, 391, 5759, 541, 31577, 8781, 40956, 43799, 839, 154663, 20697, 959, 34648, 493, 44691, 104272, 214493, 8, 978, 21407, 15400, 70426, 30...

[ 0.181640625, 0.1461181640625, 0.06634521484375, 0.189697265625, 0.092041015625, 0.1802978515625, 0.1494140625, 0.259033203125, 0.08868408203125, 0.1226806640625, 0.0965576171875, 0.154296875, 0.204345703125, 0.265869140625, 0.010955810546875, 0.1802978515625, 0.16552734375, 0.14172...

embed

18559053_c0

18559053

prolog

0

Title: Prolog: how to combine 2 predicate become 1 list only Problem title: Prolog: how to combine 2 predicate become 1 list only Tags: prolog, list Problem: Prolog: how to combine 2 predicate become 1 list only Question 1 How do I combine weatherInfo(X,Y) with airDensity(X,Y) to make it into 1 list. I want it to be so...

Prolog: how to combine 2 predicate become 1 list only Prolog: how to combine 2 predicate become 1 list only prolog list Prolog Sunny Overcast Rain Hot Mild Cool Normal High Result NewT NewL Prolog: how to combine 2 predicate become 1 list only Question 1 How do I combine weatherInfo(X,Y) with airDensity(X,Y) to make it...

[ 0.0034637451171875, 0.00238037109375, -0.00506591796875, 0.0284423828125, -0.0034637451171875, 0.0203857421875, 0.000762939453125, 0.003173828125, 0.01239013671875, -0.0303955078125, 0.019775390625, 0.01275634765625, -0.0103759765625, -0.01416015625, 0.0052490234375, 0.00933837890625, ...

[ 1250, 4867, 3642, 70163, 116, 1653, 2063, 67, 24209, 106, 5303, 4734, 502, 151197, 9578, 55741, 82507, 9903, 10663, 63550, 28723, 19694, 126684, 2356, 618, 866, 47, 68185, 11249, 92949, 93147, 1542, 1723, 678, 1831, 54494, 2481, 3934, 7722,...

[ 0.1322021484375, 0.218017578125, 0.061370849609375, 0.22265625, 0.1593017578125, 0.1673583984375, 0.18701171875, 0.094970703125, 0.07904052734375, 0.10003662109375, 0.193603515625, 0.09320068359375, 0.1103515625, 0.1083984375, 0.03863525390625, 0.0985107421875, 0.092041015625, 0.02...

embed

52563407_c0

52563407

prolog

0

Title: Prolog: Difference between overriding predicate and using it Problem title: Prolog: Difference between overriding predicate and using it Tags: prolog, object, module Problem: Prolog: Difference between overriding predicate and using it I feel really stupid, and feel like I'm missing something. I've basically got...

Prolog: Difference between overriding predicate and using it Prolog: Difference between overriding predicate and using it prolog object module it Prolog Difference module.pl state.pl Food Eater InjEvent _Time _Event _ActorOfEvent Prolog: Difference between overriding predicate and using it I feel really stupid, and fee...

[ 0.0164794921875, -0.005126953125, -0.00183868408203125, 0.0103759765625, 0.00640869140625, 0.004150390625, 0.0208740234375, -0.007171630859375, 0.0126953125, -0.057861328125, 0.01043701171875, 0.00958251953125, -0.0034942626953125, -0.01373291015625, 0.01904296875, 0.010498046875, -0...

[ 1250, 4867, 803, 18234, 6620, 17721, 645, 416, 6238, 1653, 2063, 67, 17368, 442, 502, 36746, 88996, 2424, 11341, 34562, 241, 46429, 360, 170, 192134, 70059, 18770, 132887, 12319, 6183, 110833, 1884, 132283, 9844, 6626, 102158, 32813, 62775, ...

[ 0.15185546875, 0.2265625, 0.0614013671875, 0.17578125, 0.071533203125, 0.06005859375, 0.146240234375, 0.21923828125, 0.1229248046875, 0.1920166015625, 0.2393798828125, 0.138916015625, 0.2242431640625, 0.1563720703125, 0.1505126953125, 0.17822265625, 0.1767578125, 0.1590576171875, ...

embed

22735396_c1

22735396

prolog

1

rique, javier). parent_of(angeles, javier). parent_of(cristina, miguelin). parent_of(otilia, cristina). parent_of(eloina, esmeralda). % Rules ancestor(X, Y) :- parent_of(X, Y); parent_of(X, Z), ancestor(Z, Y). descendant(X, Y) :- ancestor(Y, X). father(X, Y) :- parent_of(X, Y), male(X). mother(X, Y) :- parent_of(X, Y),...

[ 0.0245361328125, 0.006744384765625, 0.007415771484375, 0.0233154296875, -0.0062255859375, 0.0023345947265625, -0.006866455078125, 0.0101318359375, -0.007171630859375, -0.0390625, 0.006622314453125, -0.027099609375, 0.00141143798828125, 0.01080322265625, 0.020263671875, -0.0026702880859...

[ 75087, 4, 79, 22023, 194, 49129, 454, 4390, 64859, 90, 58532, 5516, 1693, 37755, 818, 33396, 13625, 52763, 8242, 885, 198, 1991, 48641, 1745, 139118, 7, 60502, 1290, 132, 1542, 990, 15772, 3142, 567, 6, 1511, 60887, 1236, 1193, 67373, 1...

[ 0.2266845703125, 0.0628662109375, 0.12548828125, 0.24609375, 0.046875, 0.2471923828125, 0.000396728515625, 0.101806640625, 0.1444091796875, 0.0948486328125, 0.0321044921875, 0.1591796875, 0.059814453125, 0.1600341796875, 0.06201171875, 0.1776123046875, 0.0272216796875, 0.1524658203...

embed

24630245_c1

24630245

prolog

1

|R],ListaAbiertos1,ListaAbiertos2) :- insertarUno(F,ListaAbiertos1,ListaAbiertos3), insertarTodos(R,ListaAbiertos3,ListaAbiertos2). insertarTodos([],ListaAbiertos,ListaAbiertos). nodoRepetido(Estado@_@_@_, [Estado@_@_@_|_]). costeMenor( _@_@F1@_ , _@_@F2@_ ) :- F1 < F2. expandir(Estado@Profundidad@_@S,Sucesores) :- fin...

[ -0.01031494140625, -0.005584716796875, 0.003173828125, 0.00927734375, 0.004058837890625, 0.00982666015625, -0.0205078125, 0.0027008056640625, 0.00153350830078125, -0.00762939453125, 0.0247802734375, 0.0135498046875, -0.001373291015625, -0.0079345703125, 0.0076904296875, -0.0078125, 0...

[ 6, 58745, 1052, 268, 4, 866, 1035, 284, 49843, 1952, 418, 10461, 15772, 28046, 867, 1062, 157, 919, 21320, 7763, 1140, 5, 132, 194, 110, 246, 4332, 63065, 74328, 95363, 29638, 748, 304, 563, 5442, 71062, 481, 981, 25018, 14168, 5170, ...

[ 0.04644775390625, 0.08544921875, 0.14306640625, 0.07391357421875, 0.020843505859375, 0.1788330078125, 0.1748046875, 0.0799560546875, 0.2275390625, 0.1927490234375, 0.06884765625, 0.1287841796875, 0.161376953125, 0.208984375, 0.1767578125, 0.0164031982421875, 0.081298828125, 0.11389...

embed

29663905_c0

29663905

prolog

0

Title: Prolog simple function to remove duplicates from list Problem title: Prolog simple function to remove duplicates from list Tags: prolog Problem: Prolog simple function to remove duplicates from list I'm a student learning prolog. I've written a function to remove duplicate elements from a list in two ways. One t...

Prolog simple function to remove duplicates from list Prolog simple function to remove duplicates from list prolog list Prolog Prolog simple function to remove duplicates from list I'm a student learning prolog. I've written a function to remove duplicate elements from a list in two ways. One that retains the order of ...

[ -0.002227783203125, 0.040771484375, 0.0181884765625, -0.01104736328125, -0.0147705078125, 0.006744384765625, 0.00396728515625, -0.006591796875, 0.0027313232421875, -0.01361083984375, 0.006195068359375, 0.0084228515625, 0.01129150390625, 0.004974365234375, 0.000598907470703125, 0.014099...

[ 1250, 4867, 8781, 32354, 87388, 171763, 1636, 1295, 5303, 502, 9836, 52080, 59121, 67, 80854, 6626, 48322, 112033, 5425, 12989, 959, 2967, 140992, 70541, 91067, 51, 99091, 77336, 73, 88551, 60212, 1957, 171859, 32786, 627, 201505, 44402, 3302...

[ 0.1361083984375, 0.1923828125, 0.1427001953125, 0.168212890625, 0.16796875, 0.27294921875, 0.156005859375, 0.0894775390625, 0.193359375, 0.1240234375, 0.0528564453125, 0.022125244140625, 0.04510498046875, 0.1197509765625, 0.12890625, 0.0511474609375, 0.0745849609375, 0.124145507812...

embed

49416911_c0

49416911

prolog

0

Title: Nested Prolog queries (anding between different conditions) Problem title: Nested Prolog queries (anding between different conditions) Tags: prolog Problem: Nested Prolog queries (anding between different conditions) I'm working on some queries about this code in Prolog: student(ali). student(sami). student(rami...

Nested Prolog queries (anding between different conditions) Nested Prolog queries (anding between different conditions) prolog Nested Prolog calculus2 calculus1 teacher_of Nested Prolog queries (anding between different conditions) I'm working on some queries about this code in Prolog: Now, I want to find all teachers ...

[ 0.01611328125, 0.0252685546875, -0.01043701171875, 0.02392578125, -0.003662109375, 0.01239013671875, -0.0272216796875, -0.01153564453125, 0.000652313232421875, -0.052734375, 0.01397705078125, -0.00408935546875, 0.01043701171875, 0.03857421875, 0.0023651123046875, 0.003631591796875, 0...

[ 28701, 71, 1250, 4867, 41, 10484, 11, 33770, 17721, 12921, 27289, 502, 44805, 223, 304, 418, 117914, 4390, 20697, 18151, 3444, 47, 7413, 756, 148729, 111, 9836, 55725, 37842, 18499, 98320, 2565, 162, 35166, 3564, 26008, 1118, 30391, 3688, ...

[ 0.2205810546875, 0.1304931640625, 0.130615234375, 0.2298583984375, 0.1312255859375, 0.1220703125, 0.0156707763671875, 0.0989990234375, 0.10540771484375, 0.080322265625, 0.1500244140625, 0.0970458984375, 0.1229248046875, 0.09637451171875, 0.078125, 0.0251007080078125, 0.226318359375, ...

embed

68873854_c0

68873854

prolog

0

Title: How to implement the Fibonacci sequence in successor arithmetics for all argument modes? Problem title: How to implement the Fibonacci sequence in successor arithmetics for all argument modes? Tags: termination, successor-arithmetics, prolog, fibonacci, failure-slice Problem: How to implement the Fibonacci seque...

How to implement the Fibonacci sequence in successor arithmetics for all argument modes? How to implement the Fibonacci sequence in successor arithmetics for all argument modes? termination successor-arithmetics prolog fibonacci failure-slice How Fibonacci Time How to implement the Fibonacci sequence in successor arith...

[ 0.0185546875, 0.0027923583984375, -0.00408935546875, 0.00616455078125, -0.0135498046875, -0.006378173828125, 0.0028533935546875, 0.015625, 0.01470947265625, -0.0157470703125, 0.0289306640625, -0.01239013671875, -0.0289306640625, 0.00408935546875, 0.0263671875, 0.0029296875, 0.0291748...

[ 11249, 47, 29479, 3698, 20990, 52544, 40, 944, 3956, 39457, 42, 8962, 282, 41637, 100, 756, 10750, 13736, 23, 29527, 502, 4867, 809, 137578, 13348, 19055, 25632, 1250, 1528, 61924, 1653, 2063, 275, 12477, 242122, 14012, 892, 1505, 43240, ...

[ 0.1009521484375, 0.047119140625, 0.2161865234375, 0.163330078125, 0.1917724609375, 0.2349853515625, 0.07269287109375, 0.1524658203125, 0.0853271484375, 0.22412109375, 0.1610107421875, 0.134521484375, 0.057830810546875, 0.013671875, 0.03607177734375, 0.07098388671875, 0.2196044921875,...

embed