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
29010695_c0	29010695	prolog	0	Title: Understanding Recursive Rule and Unification in Prolog Problem title: Understanding Recursive Rule and Unification in Prolog Tags: successor-arithmetics, recursion, prolog, unification Problem: Understanding Recursive Rule and Unification in Prolog I'm a beginning Prolog student following the "LearnPrologNow!" s...	Understanding Recursive Rule and Unification in Prolog Understanding Recursive Rule and Unification in Prolog successor-arithmetics recursion prolog unification Understanding Recursive Rule Unification Prolog Understanding Recursive Rule and Unification in Prolog I'm a beginning Prolog student following the "LearnProlo...	[ 0.0203857421875, 0.0242919921875, 0.0010833740234375, 0.0302734375, 0.0142822265625, 0.02001953125, -0.01043701171875, -0.0067138671875, -0.005035400390625, -0.010009765625, -0.00750732421875, -0.0296630859375, -0.006378173828125, 0.0027008056640625, 0.0238037109375, -0.00823974609375,...	[ 9626, 144057, 853, 48650, 5844, 139118, 136, 992, 41274, 1250, 4867, 39457, 42, 8962, 195625, 502, 51, 86595, 9836, 147, 10752, 137594, 3890, 57143, 2965, 40158, 23755, 190219, 28219, 26818, 138, 155455, 2967, 41, 1294, 14240, 6528, 1528, 1...	[ 0.07696533203125, 0.06634521484375, 0.08282470703125, 0.22412109375, 0.1668701171875, 0.2264404296875, 0.0576171875, 0.173583984375, 0.2021484375, 0.179931640625, 0.28125, 0.158935546875, 0.02227783203125, 0.071044921875, 0.1927490234375, 0.116455078125, 0.2054443359375, 0.01513671...	embed
59773257_c0	59773257	prolog	0	Title: Prolog problem modeling: objects with different colors Problem title: Prolog problem modeling: objects with different colors Tags: prolog Problem: Prolog problem modeling: objects with different colors I'm new to writing Prolog and would like to know how to state the following properties in a way that's useful f...	Prolog problem modeling: objects with different colors Prolog problem modeling: objects with different colors prolog Prolog obj_1 obj_2 color_value Obj Val different_color Prolog problem modeling: objects with different colors I'm new to writing Prolog and would like to know how to state the following properties in a w...	[ -0.003936767578125, -0.0157470703125, -0.004913330078125, 0.01336669921875, 0.0019378662109375, 0.00008392333984375, -0.0419921875, 0.01116943359375, 0.0037078857421875, 0, 0.0012664794921875, 0.0015869140625, 0.00482177734375, 0.0006103515625, 0, 0.0028533935546875, -0.020263671875,...	[ 1250, 4867, 2967, 3299, 214, 36746, 7, 678, 12921, 104988, 502, 995, 170, 115187, 304, 10576, 27494, 3545, 4769, 46133, 3525, 32562, 1884, 3714, 3642, 11341, 25632, 183871, 80234, 31635, 541, 87769, 1556, 10, 17262, 7722, 4842, 50997, 57571...	[ 0.1766357421875, 0.253173828125, 0.14208984375, 0.175048828125, 0.041595458984375, 0.2105712890625, 0.0076904296875, 0.105224609375, 0.1805419921875, 0.24072265625, 0.11279296875, 0.126220703125, 0.1395263671875, 0.07470703125, 0.1192626953125, 0.1982421875, 0.151611328125, 0.14379...	embed
4552600_c0	4552600	prolog	0	Title: Outputting final list from recursive predicate in Prolog Problem title: Outputting final list from recursive predicate in Prolog Tags: prolog, list Problem: Outputting final list from recursive predicate in Prolog I wrote a program, that finds the longest coprime subsequence in a Prolog list (it is not yet perfe...	Outputting final list from recursive predicate in Prolog Outputting final list from recursive predicate in Prolog prolog list recursive Outputting Prolog longest_lcs Tail Outputting final list from recursive predicate in Prolog I wrote a program, that finds the longest coprime subsequence in a Prolog list (it is not ye...	[ -0.002044677734375, 0.0272216796875, -0.0068359375, -0.0030975341796875, -0.00750732421875, 0.0172119140625, 0.006744384765625, 0.0235595703125, -0.01068115234375, -0.0172119140625, 0.01129150390625, -0.0111083984375, 0.003997802734375, 0.00592041015625, 0.01080322265625, 0.00854492187...	[ 13538, 7077, 2704, 5303, 1295, 195625, 5844, 1653, 2063, 67, 1250, 4867, 502, 4989, 525, 32838, 1218, 379, 54397, 1528, 7413, 552, 114654, 1614, 184, 944, 15787, 140992, 33022, 3871, 11675, 25632, 3917, 129344, 43240 ]	[ 0.093994140625, 0.111083984375, 0.1630859375, 0.1622314453125, 0.04193115234375, 0.1658935546875, 0.0826416015625, 0.147705078125, 0.189453125, 0.0188446044921875, 0.118896484375, 0.206787109375, 0.0775146484375, 0.1043701171875, 0.0860595703125, 0.030303955078125, 0.1103515625, 0....	embed
42556771_c0	42556771	prolog	0	Title: Separating a list into a list of fixed length sublists Problem title: Separating a list into a list of fixed length sublists Tags: prolog Problem: Separating a list into a list of fixed length sublists Given a list L , for instance, [1,2,3,4,5,6,7] and a number N , for instance 3 , I would like to make a predica...	Separating a list into a list of fixed length sublists Separating a list into a list of fixed length sublists prolog Separating List N-1 Given Res Separating a list into a list of fixed length sublists Given a list L , for instance, [1,2,3,4,5,6,7] and a number N , for instance 3 , I would like to make a predicate that...	[ -0.0045166015625, 0.01153564453125, 0.01385498046875, -0.0093994140625, -0.0101318359375, 0.015625, 0.0040283203125, 0.0004253387451171875, 0.01397705078125, -0.017822265625, 0.0113525390625, -0.003326416015625, 0.00150299072265625, -0.01239013671875, -0.01141357421875, 0.0230712890625...	[ 503, 6276, 1916, 5303, 3934, 188347, 140909, 1614, 6562, 502, 4867, 32036, 541, 5759, 77878, 9624, 339, 110527, 155761, 80389, 136555, 14012, 138, 1884, 3249, 1653, 2063, 67, 84797, 80854, 13267, 16750, 186, 133063, 96386, 617, 104629, 117221...	[ 0.0806884765625, 0.2113037109375, 0.034820556640625, 0.23486328125, 0.191650390625, 0.2099609375, 0.1353759765625, 0.2076416015625, 0.262939453125, 0.0933837890625, 0.150634765625, 0.2181396484375, 0.148193359375, 0.1312255859375, 0.04949951171875, 0.096435546875, 0.1114501953125, ...	embed
34279723_c1	34279723	prolog	1	iecesIndex), Each VXY is one face of the piece and it can have 0,1,2 dots as you can see in the code below. The Help I need is: - Make sure that all pieces are different - Make sure F and G are equal - Make sure I dont use repeated pieces. Can anyone help me! I've been here whole night trying to figure this out and I'm...	iecesIndex), Each VXY is one face of the piece and it can have 0,1,2 dots as you can see in the code below. The Help I need is: - Make sure that all pieces are different - Make sure F and G are equal - Make sure I dont use repeated pieces. Can anyone help me! I've been here whole night trying to figure this out and I'm...	[ -0.00445556640625, -0.019287109375, 0.0020294189453125, 0.0036163330078125, -0.020751953125, -0.0047607421875, -0.0130615234375, 0.00323486328125, 0.0123291015625, -0.0194091796875, 0.01220703125, 0.0125732421875, 0.0238037109375, 0.000766754150390625, 0.00634765625, 0.0029144287109375...	[ 17, 13, 5170, 4153, 39659, 247, 98423, 310, 143907, 83, 1632, 2577, 111, 63847, 442, 831, 765, 72966, 304, 54, 933, 1957, 18151, 35064, 5, 39527, 87, 3871, 26176, 9077, 450, 756, 126371, 621, 12921, 563, 136, 527, 105950, 13319, 4527, ...	[ 0.112548828125, 0.1060791015625, 0.258544921875, 0.1580810546875, 0.281494140625, 0.0360107421875, 0.1435546875, 0.1678466796875, 0.2890625, 0.09747314453125, 0.1260986328125, 0.2030029296875, 0.014312744140625, 0.1834716796875, 0.0164794921875, 0.1083984375, 0.0675048828125, 0.168...	embed
20113946_c0	20113946	prolog	0	Title: Prolog: Removing the duplicates of the merged list Problem title: Prolog: Removing the duplicates of the merged list Tags: prolog Problem: Prolog: Removing the duplicates of the merged list I am doing a homework need to implement a relation list_merge (X,Y,Z) where X and Y are integer lists, Z contains all eleme...	Prolog: Removing the duplicates of the merged list Prolog: Removing the duplicates of the merged list prolog Prolog Removing append2 list_merge Prolog: Removing the duplicates of the merged list I am doing a homework need to implement a relation list_merge (X,Y,Z) where X and Y are integer lists, Z contains all element...	[ -0.0191650390625, 0.032958984375, 0.0272216796875, -0.006561279296875, -0.0004711151123046875, 0.01312255859375, -0.000698089599609375, 0.0174560546875, 0.0322265625, -0.004547119140625, -0.00714111328125, 0.0135498046875, 0.01202392578125, 0.00543212890625, 0.00579833984375, 0.0117187...	[ 1250, 4867, 853, 432, 6496, 171763, 1636, 42564, 71, 5303, 502, 114689, 304, 1991, 429, 5368, 18244, 3871, 29479, 41911, 1542, 1723, 1511, 1193, 136, 990, 892, 567, 70541, 756, 80854, 15044, 110, 67, 3714, 3642, 32354, 87388, 70163, 6626,...	[ 0.1143798828125, 0.18603515625, 0.04833984375, 0.1339111328125, 0.0653076171875, 0.2587890625, 0.1534423828125, 0.2117919921875, 0.0943603515625, 0.20166015625, 0.06793212890625, 0.159423828125, 0.139892578125, 0.1614990234375, 0.110107421875, 0.0198516845703125, 0.0445556640625, 0...	embed
20568194_c0	20568194	prolog	0	Title: Prolog domain restriction Problem title: Prolog domain restriction Tags: clpfd, prolog, sudoku Problem: Prolog domain restriction How can one tell Prolog/CLPFD to only use certain number of domain only as last resource? E.g. : domain from 0...8. I want Prolog to use 0 only if there's no other option. I used the ...	Prolog domain restriction Prolog domain restriction clpfd prolog sudoku Prolog BoardSize all_distinct IndexI IndexJ IndexJ2 Columns Prolog domain restriction How can one tell Prolog/CLPFD to only use certain number of domain only as last resource? E.g. : domain from 0...8. I want Prolog to use 0 only if there's no othe...	[ -0.005767822265625, -0.007232666015625, 0.019775390625, -0.01806640625, -0.01214599609375, -0.015869140625, -0.0031890869140625, 0.021240234375, 0.0108642578125, -0.04638671875, -0.007415771484375, -0.0255126953125, 0.0040283203125, -0.005340576171875, -0.0081787109375, -0.021240234375...	[ 1250, 4867, 77758, 185190, 39557, 71, 502, 8932, 38067, 62554, 127167, 756, 38893, 31471, 1375, 304, 233987, 831, 14192, 37486, 41265, 397, 47, 4734, 4527, 24233, 14012, 237, 4568, 177953, 1295, 757, 1019, 3444, 35829, 34695, 67967, 214, 57...	[ 0.1763916015625, 0.283203125, 0.2420654296875, 0.252685546875, 0.05426025390625, 0.053985595703125, 0.08941650390625, 0.0997314453125, 0.187255859375, 0.130126953125, 0.0709228515625, 0.067626953125, 0.044281005859375, 0.1185302734375, 0.083984375, 0.056976318359375, 0.1771240234375,...	embed
61768707_c1	61768707	prolog	1	i #\= Jozsef, Fenyvesi #\= Vince, Jozsef #\= Gallyas, Jozsef #\= Biologia, Jozsef #= Budapest, Vadkerti #= Gabriella, Vadkerti #\= Kemia, Vadkerti #\= Szeged, Gabriella #\= Kemia, Gabriella #\= Szeged, Kemia #= Szeged, Jeney #= Pecs, Jeney #\= Vince, Frida #= Magyar, Edina #= Egressy #\ Edina #= Miskolc, Informatika #\...	i #\= Jozsef, Fenyvesi #\= Vince, Jozsef #\= Gallyas, Jozsef #\= Biologia, Jozsef #= Budapest, Vadkerti #= Gabriella, Vadkerti #\= Kemia, Vadkerti #\= Szeged, Gabriella #\= Kemia, Gabriella #\= Szeged, Kemia #= Szeged, Jeney #= Pecs, Jeney #\= Vince, Frida #= Magyar, Edina #= Egressy #\ Edina #= Miskolc, Informatika #\...	[ -0.00921630859375, -0.00335693359375, 0.01312255859375, 0.021240234375, 0.00067138671875, -0.01953125, -0.0240478515625, 0.01275634765625, 0.018310546875, -0.008056640625, 0.009521484375, -0.0189208984375, 0.01422119140625, 0.0164794921875, -0.00555419921875, 0.0023193359375, 0.01989...	[ 17, 468, 41872, 2177, 169, 7, 4240, 4221, 299, 67334, 1369, 582, 3956, 21713, 395, 100429, 11, 15828, 10414, 1728, 118, 25203, 143, 99157, 96345, 845, 10186, 1460, 4439, 4, 9173, 85, 20480, 17156, 76, 241, 19623, 53, 158462, 43681, 161,...	[ 0.079833984375, 0.0209197998046875, 0.017578125, 0.06463623046875, 0.058624267578125, 0.07196044921875, 0.1807861328125, 0.05059814453125, 0.08660888671875, 0.252685546875, 0.00885009765625, 0.1591796875, 0.1943359375, 0.093994140625, 0.19189453125, 0.15771484375, 0.1358642578125, ...	embed
43742909_c0	43742909	prolog	0	Title: prolog: leave only the elements that are not repeated in a given list such that (a b a a a c c) and get (a b) Problem title: prolog: leave only the elements that are not repeated in a given list such that (a b a a a c c) and get (a b) Tags: prolog Problem: prolog: leave only the elements that are not repeated in...	prolog: leave only the elements that are not repeated in a given list such that (a b a a a c c) and get (a b) prolog: leave only the elements that are not repeated in a given list such that (a b a a a c c) and get (a b) prolog adj_dups prolog: leave only the elements that are not repeated in a given list such that (a b...	[ -0.0098876953125, 0.017578125, 0.0103759765625, 0.005523681640625, -0.01275634765625, 0.033203125, 0.00099945068359375, 0.01165771484375, 0.0174560546875, -0.016845703125, -0.02294921875, 0.004180908203125, -0.002685546875, 0.022216796875, 0.00421142578125, 0.0224609375, 0.0162353515...	[ 502, 4867, 12, 31358, 4734, 80854, 959, 119140, 297, 34475, 5303, 6044, 876, 501, 2046, 11, 606, 170, 454, 693, 6423, 23, 3917, 5608, 4488, 83, 2174, 7413, 10, 441, 4, 6863, 171763, 67, 136, 184750, 64557, 87388, 16792, 28282, 69101, ...	[ 0.202392578125, 0.265625, 0.004241943359375, 0.1806640625, 0.1085205078125, 0.15869140625, 0.1192626953125, 0.1998291015625, 0.0633544921875, 0.04351806640625, 0.143310546875, 0.039215087890625, 0.09765625, 0.0584716796875, 0.08563232421875, 0.057861328125, 0.1256103515625, 0.18811...	embed
6970408_c0	6970408	prolog	0	Title: Predicate cache Problem title: Predicate cache Tags: prolog, prolog-directive-dynamic Problem: Predicate cache Is there a Prolog implementation or library that caches predicates? Or would you implement a, say, FIFO cache using assertz/1 and retract/1, like this: :- dynamic cache/1. ccall(G) :- cache(G). ccall(G)...	Predicate cache Predicate cache prolog prolog-directive-dynamic Predicate cache_size Predicate cache Is there a Prolog implementation or library that caches predicates? Or would you implement a, say, FIFO cache using assertz/1 and retract/1, like this: In ECLiPSe-CLP, one could at least replace the findall/3 line using...	[ 0.0172119140625, -0.0054931640625, 0.01556396484375, 0.01483154296875, -0.0068359375, 0.00982666015625, -0.00421142578125, 0.01287841796875, 0.006256103515625, -0.052001953125, 0.000896453857421875, 0.0162353515625, -0.010986328125, -0.01165771484375, 0.0311279296875, 0.01190185546875,...	[ 7145, 2063, 67, 82365, 502, 4867, 936, 100034, 242554, 62539, 2685, 10, 1250, 208124, 35773, 1294, 450, 7, 1653, 1636, 29479, 32983, 51980, 17368, 237, 33657, 169, 11583, 136, 41499, 15390, 59947, 9506, 9059, 13, 37352, 19713, 91995, 7413, ...	[ 0.211181640625, 0.260986328125, 0.126220703125, 0.26904296875, 0.1566162109375, 0.25341796875, 0.06365966796875, 0.085205078125, 0.1470947265625, 0.113037109375, 0.0440673828125, 0.0145111083984375, 0.1829833984375, 0.179443359375, 0.18408203125, 0.095947265625, 0.022308349609375, ...	embed
32621071_c0	32621071	prolog	0	Title: How do I get a list from an association list in Prolog, and then either append to it or create it if it doesn't exist? Problem title: How do I get a list from an association list in Prolog, and then either append to it or create it if it doesn't exist? Tags: logic-programming, prolog, swi-prolog Proble...	How do I get a list from an association list in Prolog, and then either append to it or create it if it doesn't exist? How do I get a list from an association list in Prolog, and then either append to it or create it if it doesn't exist? logic-programming prolog swi-prolog an How Prolog get_assoc How do I get...	[ 0.01092529296875, 0.006866455078125, 0.0086669921875, -0.005645751953125, 0.0030059814453125, -0.0021820068359375, 0.0208740234375, 0.018798828125, 0.025390625, -0.028564453125, 0.0322265625, 0.0137939453125, -0.01202392578125, -0.00555419921875, 0.0115966796875, -0.0000095367431640625...	[ 11249, 2046, 5303, 1295, 125413, 1250, 4867, 114689, 71, 28282, 2174, 22027, 32316, 47, 62775, 28966, 502, 2452, 3454, 73395, 238, 18, 1556, 127, 23180, 107035, 147306, 22799, 42518, 31089, 3444, 1653, 2063, 35735, 75935, 14373, 27494, 80836,...	[ 0.0287933349609375, 0.119140625, 0.200927734375, 0.06982421875, 0.21240234375, 0.13525390625, 0.212646484375, 0.1156005859375, 0.07196044921875, 0.115478515625, 0.08892822265625, 0.009033203125, 0.16650390625, 0.00604248046875, 0.045257568359375, 0.031219482421875, 0.0543212890625, ...	embed
13899103_c0	13899103	prolog	0	Title: translate prolog to formal english Problem title: translate prolog to formal english Tags: dcg, prolog Problem: translate prolog to formal english i'm trying to write a program that translate a prolog sentence to a formal english sentence. here is my code : sentence --> [if],[the], first_phrase, second_phrase. f...	translate prolog to formal english translate prolog to formal english dcg prolog first_phrase second_phrase translate prolog to formal english i'm trying to write a program that translate a prolog sentence to a formal english sentence. here is my code : the output of this code is like the following : X = [if, the, feet...	[ 0.024169921875, -0.00140380859375, -0.0220947265625, 0.00836181640625, 0.01104736328125, 0.024658203125, -0.00732421875, 0.0157470703125, 0.00016498565673828125, -0.0216064453125, -0.00019168853759765625, -0.0019073486328125, -0.0269775390625, -0.00225830078125, 0.017822265625, 0.02709...	[ 3900, 19309, 502, 4867, 47, 23113, 175457, 177, 179665, 17932, 33022, 1528, 149357, 18151, 140992, 1884, 1193, 2203, 3190, 70, 74261, 621, 49878, 136, 132283, 34153, 44116, 4263, 65660, 54727, 12989, 83, 7401, 3584, 27751, 15190, 30022, 16750...	[ 0.1083984375, 0.141357421875, 0.13818359375, 0.223876953125, 0.11865234375, 0.21826171875, 0.1292724609375, 0.051666259765625, 0.1015625, 0.01507568359375, 0.0200042724609375, 0.102294921875, 0.0836181640625, 0.116943359375, 0.1158447265625, 0.01025390625, 0.0987548828125, 0.008209...	embed
70868219_c0	70868219	prolog	0	Title: Convert FOPL expression to prolog Problem title: Convert FOPL expression to prolog Tags: discrete-mathematics, logic, prolog Problem: Convert FOPL expression to prolog Given premises and corresponding FOPL. Goal: Prove that Marcus hated Caesar. Marcus was a Pompeian pompeian(Marcus) All Pompeians were Romans. Vx...	Convert FOPL expression to prolog Convert FOPL expression to prolog discrete-mathematics logic prolog Convert FOPL Marcus Caesar not_loyal How Everyone Convert FOPL expression to prolog Given premises and corresponding FOPL. Goal: Prove that Marcus hated Caesar. Marcus was a Pompeian pompeian(Marcus) All Pompeians were...	[ 0.013671875, -0.015625, 0.00616455078125, 0.021728515625, -0.00238037109375, 0.010986328125, -0.0034942626953125, -0.00244140625, 0.00994873046875, -0.0111083984375, -0.021728515625, -0.0189208984375, -0.0162353515625, 0.00921630859375, 0.014404296875, -0.006622314453125, 0.004882812...	[ 1657, 11549, 44944, 21130, 125195, 47, 502, 4867, 81604, 13, 140363, 62775, 102834, 64914, 959, 365, 16300, 11249, 191096, 64881, 2016, 289, 1250, 1256, 297, 509, 10, 189462, 66, 46878, 3378, 154598, 3164, 10133, 12610, 310, 425, 6315, 4010...	[ 0.04925537109375, 0.1611328125, 0.1619873046875, 0.275146484375, 0.201171875, 0.072509765625, 0.1729736328125, 0.24462890625, 0.14208984375, 0.03558349609375, 0.0914306640625, 0.1297607421875, 0.181640625, 0.2529296875, 0.1256103515625, 0.1527099609375, 0.186767578125, 0.0048828125...	embed
74578487_c0	74578487	prolog	0	Title: How to check if the elements of a range exist in a list? Problem title: How to check if the elements of a range exist in a list? Tags: prolog Problem: How to check if the elements of a range exist in a list? It is the first time that he has programmed with the Prolog language, and he wanted to know how I can sta...	How to check if the elements of a range exist in a list? How to check if the elements of a range exist in a list? prolog How Min Max existerango2 How to check if the elements of a range exist in a list? It is the first time that he has programmed with the Prolog language, and he wanted to know how I can start from a li...	[ 0.000507354736328125, -0.0101318359375, 0.0086669921875, 0.0179443359375, -0.004180908203125, 0.0277099609375, 0.00146484375, 0.001312255859375, 0.030029296875, 0.0103759765625, 0.01483154296875, 0.01611328125, 0.01092529296875, -0.02197265625, 0.0302734375, -0.01397705078125, 0.0087...	[ 11249, 47, 12765, 2174, 70, 80854, 111, 37457, 32316, 23, 5303, 502, 4867, 4211, 9920, 13835, 5445, 31, 304, 10, 26693, 678, 1250, 46876, 3714, 4034, 1295, 6626, 101935, 136, 1957, 17721, 133063, 82449, 104629, 136005, 166213, 30646, 29568,...	[ 0.09149169921875, 0.07916259765625, 0.24951171875, 0.1619873046875, 0.041046142578125, 0.25244140625, 0.06024169921875, 0.29150390625, 0.263671875, 0.1142578125, 0.24365234375, 0.1077880859375, 0.23095703125, 0.2435302734375, 0.19921875, 0.1937255859375, 0.1912841796875, 0.22766113...	embed
46131444_c0	46131444	prolog	0	Title: Find repetitions in a list Problem title: Find repetitions in a list Tags: prolog, list Problem: Find repetitions in a list How would I go about finding consecutive repetition of a string in a list in prolog. What I'm exactly trying to find, for example, is this: input => output AAAAAA => 6(A) ABABAB => 3(AB) ...	Find repetitions in a list Find repetitions in a list prolog list Find AAAAAA ABABAB ABCABCABC ABC is_alnum nbr_to_char str_to_list Find repetitions in a list How would I go about finding consecutive repetition of a string in a list in prolog. What I'm exactly trying to find, for example, is this: I wrote a DCG grammar...	[ 0.012451171875, 0.00010156631469726562, 0.0059814453125, 0.033447265625, -0.01324462890625, 0.022705078125, 0.01104736328125, 0.01397705078125, 0.01318359375, -0.030029296875, -0.01123046875, 0.0087890625, -0.006988525390625, 0.00885009765625, -0.005889892578125, 0.033447265625, 0.01...	[ 26040, 57346, 5256, 23, 5303, 502, 4867, 155616, 284, 15467, 11321, 49068, 571, 47457, 186944, 83, 289, 2606, 3267, 188, 9254, 7704, 6562, 1672, 90791, 148390, 1363, 79315, 66161, 31577, 7413, 27781, 56367, 122092, 147, 903, 4358 ]	[ 0.1165771484375, 0.322509765625, 0.17138671875, 0.05645751953125, 0.205078125, 0.1461181640625, 0.210693359375, 0.13427734375, 0.00396728515625, 0.1365966796875, 0.0170745849609375, 0.043304443359375, 0.09820556640625, 0.11181640625, 0.09002685546875, 0.048004150390625, 0.03625488281...	embed
58662586_c0	58662586	prolog	0	Title: How can I dynamically assert rules with conditions conjoined in the body in Prolog? Problem title: How can I dynamically assert rules with conditions conjoined in the body in Prolog? Tags: prolog Problem: How can I dynamically assert rules with conditions conjoined in the body in Prolog? My code: run_insert_form...	How can I dynamically assert rules with conditions conjoined in the body in Prolog? How can I dynamically assert rules with conditions conjoined in the body in Prolog? prolog How Prolog run_insert_format run_query odbc_query List Animal Characteristic color_rojizo Reglas How can I dynamically assert rules with conditio...	[ 0.016357421875, 0.00070953369140625, 0.0211181640625, 0.041015625, -0.0087890625, 0.003997802734375, -0.0240478515625, 0.0263671875, 0.015625, -0.0238037109375, 0.0181884765625, -0.01953125, -0.00616455078125, -0.026123046875, 0.019775390625, 0.0157470703125, 0.029296875, 0.0189208...	[ 11249, 831, 84079, 25958, 237, 33657, 91736, 678, 27289, 158, 513, 297, 14361, 1250, 4867, 73, 502, 11675, 51727, 944, 229, 65037, 32036, 82821, 21656, 2263, 720, 10576, 16920, 33602, 853, 21462, 23, 18151, 77336, 68772, 206, 913, 66419, ...	[ 0.0408935546875, 0.044525146484375, 0.1898193359375, 0.1029052734375, 0.1011962890625, 0.22314453125, 0.2034912109375, 0.08837890625, 0.2109375, 0.09075927734375, 0.1439208984375, 0.025360107421875, 0.168701171875, 0.153076171875, 0.24072265625, 0.0726318359375, 0.0516357421875, 0....	embed
10047502_c0	10047502	prolog	0	Title: Use Prolog to get data model paths from language rules? Problem title: Use Prolog to get data model paths from language rules? Tags: artificial-intelligence, dcg, prolog Problem: Use Prolog to get data model paths from language rules? I want to build a semi-natural language interface for a data warehouse. A simp...	Use Prolog to get data model paths from language rules? Use Prolog to get data model paths from language rules? artificial-intelligence dcg prolog language Use Prolog Company Departments Department Employees Employee ACME Bugs Bunny departments.employees departments.type Use Prolog to get data model paths from language...	[ 0.0185546875, 0.007781982421875, -0.01153564453125, 0.03271484375, -0.0084228515625, 0.0267333984375, 0.004974365234375, 0.0050048828125, 0.0038299560546875, -0.08740234375, -0.000293731689453125, -0.0103759765625, -0.023193359375, 0.000812530517578125, 0.0152587890625, 0.0054016113281...	[ 36836, 1250, 4867, 2046, 2053, 3299, 60875, 7, 1295, 46876, 91736, 66733, 130687, 177, 502, 33734, 63557, 365, 1033, 12944, 10611, 57279, 44666, 299, 130625, 109308, 50986, 3444, 45367, 36137, 84832, 101758, 105816, 23923, 8781, 33342, 1884, ...	[ 0.0799560546875, 0.1932373046875, 0.273681640625, 0.0814208984375, 0.1380615234375, 0.235595703125, 0.23095703125, 0.11376953125, 0.10382080078125, 0.202880859375, 0.183349609375, 0.0809326171875, 0.07879638671875, 0.0875244140625, 0.1424560546875, 0.09912109375, 0.13037109375, 0.0...	embed
50079900_c0	50079900	prolog	0	Title: List of lists into modified single list Problem title: List of lists into modified single list Tags: prolog Problem: List of lists into modified single list These are predicates which reads from input file read_line(L,C) :- get_char(C), (isEOFEOL(C), L = [], !; read_line(LL,_),% atom_codes(C,[Cd]), [C\|LL] = L). ...	List of lists into modified single list List of lists into modified single list prolog List read_line get_char atom_codes Tests EOF end_of_file char_code read_lines LLs A-B C-D E-F G-H Syntax Unexpected List of lists into modified single list These are predicates which reads from input file Input file: read_lines(L) re...	[ -0.01239013671875, 0.00848388671875, 0.0115966796875, 0.009033203125, -0.004730224609375, 0.003204345703125, -0.005950927734375, -0.00927734375, -0.0098876953125, -0.000568389892578125, 0.003814697265625, 0.0016021728515625, -0.01239013671875, -0.0167236328125, -0.0027618408203125, 0.0...	[ 32036, 111, 5303, 7, 3934, 73197, 297, 11001, 502, 4867, 12301, 2256, 2046, 9254, 34627, 40899, 8647, 82341, 3564, 4390, 29822, 21441, 59801, 99954, 919, 841, 19010, 86531, 992, 83613, 13, 1653, 2063, 1295, 107730, 11435, 7077, 866, 30646, ...	[ 0.1492919921875, 0.1182861328125, 0.2252197265625, 0.04779052734375, 0.1365966796875, 0.1810302734375, 0.0728759765625, 0.1561279296875, 0.11376953125, 0.2010498046875, 0.1968994140625, 0.1868896484375, 0.011016845703125, 0.06195068359375, 0.13134765625, 0.1085205078125, 0.0759887695...	embed
7400904_c0	7400904	prolog	0	Title: Discontiguous predicate warning from GNU Prolog Problem title: Discontiguous predicate warning from GNU Prolog Tags: prolog Problem: Discontiguous predicate warning from GNU Prolog For a lark I have started learning Prolog via http://www.learnprolognow.org/ . My excuse is that I have only just started. I am unsu...	Discontiguous predicate warning from GNU Prolog Discontiguous predicate warning from GNU Prolog prolog GNU Discontiguous Prolog wiz.pl wiz.pl:5 Discontiguous predicate warning from GNU Prolog For a lark I have started learning Prolog via http://www.learnprolognow.org/ . My excuse is that I have only just started. I am ...	[ 0.0115966796875, -0.00823974609375, -0.015625, 0.00994873046875, -0.0272216796875, 0.01446533203125, 0.0026702880859375, 0.0004558563232421875, 0.00439453125, -0.0294189453125, -0.0027618408203125, 0.0184326171875, -0.0172119140625, -0.0057373046875, 0, 0.01220703125, 0.0111694335937...	[ 53092, 7934, 12282, 10821, 1653, 2063, 67, 1631, 592, 1295, 165132, 1250, 4867, 502, 44239, 2424, 758, 7190, 52080, 147, 14071, 35613, 1478, 133207, 26859, 25632, 191560, 81979, 59121, 4488, 84751, 87046, 15246, 7570, 3454, 7693, 2681, 39797,...	[ 0.1044921875, 0.09039306640625, 0.188720703125, 0.0382080078125, 0.1722412109375, 0.205322265625, 0.08203125, 0.1640625, 0.0618896484375, 0.024566650390625, 0.1964111328125, 0.1763916015625, 0.2374267578125, 0.110595703125, 0.141845703125, 0.063720703125, 0.1021728515625, 0.0423278...	embed
35395548_c0	35395548	prolog	0	Title: Prolog: redundant program points in failure-slice? Problem title: Prolog: redundant program points in failure-slice? Tags: non-termination, logical-purity, failure-slice, prolog Problem: Prolog: redundant program points in failure-slice? We are implementing diagnostic tools for explaining unexpected universal no...	Prolog: redundant program points in failure-slice? Prolog: redundant program points in failure-slice? non-termination logical-purity failure-slice prolog Prolog Prolog: redundant program points in failure-slice? We are implementing diagnostic tools for explaining unexpected universal non-termination in pure, monotonic ...	[ 0.00701904296875, 0.0289306640625, -0.007415771484375, 0.003143310546875, -0.031982421875, -0.00058746337890625, -0.004791259765625, -0.00035858154296875, 0.00848388671875, -0.004486083984375, 0.00152587890625, -0.025146484375, -0.01953125, -0.01373291015625, 0.00531005859375, 0.009094...	[ 1250, 4867, 12, 4842, 35405, 1528, 26847, 137578, 7, 13348, 18, 23, 351, 720, 91407, 62775, 4717, 502, 29479, 52070, 72977, 73342, 241957, 32813, 34166, 182902, 103391, 77007, 23755, 9, 24172, 89397, 30524, 28756, 5170, 109458, 98320, 107838,...	[ 0.1591796875, 0.2451171875, 0.011871337890625, 0.097412109375, 0.21728515625, 0.1827392578125, 0.1719970703125, 0.218017578125, 0.05426025390625, 0.204833984375, 0.06317138671875, 0.0640869140625, 0.140869140625, 0.1573486328125, 0.1116943359375, 0.157470703125, 0.090087890625, 0.0...	embed
64861868_c0	64861868	prolog	0	Title: How to correct this 'Greater Than' Arithmetic Prolog code? Problem title: How to correct this 'Greater Than' Arithmetic Prolog code? Tags: prolog Problem: How to correct this 'Greater Than' Arithmetic Prolog code? I am trying to write a simple prolog program where a number is compared with th...	How to correct this 'Greater Than' Arithmetic Prolog code? How to correct this 'Greater Than' Arithmetic Prolog code? prolog How Greater Than Arithmetic Prolog Num How to correct this 'Greater Than' Arithmetic Prolog code? I am trying to write a simple prolog program where a number is compared with ...	[ 0.0091552734375, 0.007476806640625, 0.0230712890625, -0.0257568359375, 0.0081787109375, 0.0023651123046875, 0.017578125, 0.01300048828125, 0.00074005126953125, -0.003387451171875, -0.0064697265625, 0.004547119140625, -0.01434326171875, -0.01092529296875, 0.0242919921875, 0.0068359375, ...	[ 11249, 47, 26785, 903, 3768, 91127, 46429, 72820, 1172, 8962, 282, 9523, 1250, 4867, 18151, 502, 32774, 56, 52782, 31577, 33022, 8781, 1528, 14012, 154186, 80854, 5303, 12765, 450, 117396, 3501, 3129, 30646, 40715, 5386, 134186, 2947, 128191,...	[ 0.0687255859375, 0.0259857177734375, 0.200439453125, 0.088623046875, 0.1285400390625, 0.157958984375, 0.1724853515625, 0.27294921875, 0.0772705078125, 0.1683349609375, 0.09576416015625, 0.04119873046875, 0.2174072265625, 0.256591796875, 0.19921875, 0.1475830078125, 0.1785888671875, ...	embed
27505960_c1	27505960	prolog	1	:- write("Does ",Patient," have a cough (y/n) ?"), response(Reply), Reply='y'. symptom(Patient,body_ache) :- write("Does ",Patient," have a body_ache (y/n) ?"), response(Reply), Reply='y'. symptom(Patient,chills) :- write("Does ",Patient," have a chills (y/n) ?"), response(Reply), Reply='y'. symptom(Patient,sore_throa...	:- write("Does ",Patient," have a cough (y/n) ?"), response(Reply), Reply='y'. symptom(Patient,body_ache) :- write("Does ",Patient," have a body_ache (y/n) ?"), response(Reply), Reply='y'. symptom(Patient,chills) :- write("Does ",Patient," have a chills (y/n) ?"), response(Reply), Reply='y'. symptom(Patient,sore_throa...	[ 0.004730224609375, 0.00186920166015625, 0.015869140625, 0.01153564453125, -0.009033203125, 0.0206298828125, -0.0133056640625, 0.00482177734375, -0.0086669921875, -0.0302734375, -0.00592041015625, 0.004058837890625, -0.007049560546875, 0.00677490234375, 0.00823974609375, 0.0056457519531...	[ 15772, 33022, 132, 8331, 90, 8335, 118, 2517, 765, 10, 552, 58968, 53, 64, 19, 705, 74054, 57553, 62479, 122813, 5, 128668, 37873, 46994, 14361, 1861, 42458, 149031, 46797, 42294, 257, 127124, 86, 1255, 34614, 214, 3613, 15534, 112141, 84...	[ 0.140380859375, 0.1724853515625, 0.0106201171875, 0.1092529296875, 0.1085205078125, 0.0802001953125, 0.145263671875, 0.1239013671875, 0.129638671875, 0.08697509765625, 0.12109375, 0.26953125, 0.098388671875, 0.1259765625, 0.0750732421875, 0.00921630859375, 0.032135009765625, 0.1738...	embed
47329006_c0	47329006	prolog	0	Title: SWI Prolog backtracking behavior after `read/1` call Problem title: SWI Prolog backtracking behavior after `read/1` call Tags: prolog Problem: SWI Prolog backtracking behavior after `read/1` call I was looking at another Prolog question on StackOverflow and encountered this situation. Suppose I have the followin...	SWI Prolog backtracking behavior after `read/1` call SWI Prolog backtracking behavior after `read/1` call prolog SWI Prolog Enter Backtracks Does SWI Prolog backtracking behavior after `read/1` call I was looking at another Prolog question on StackOverflow and encountered this situation. Suppose I have the following fa...	[ 0.017578125, 0.0181884765625, 0.01220703125, 0.00341796875, -0.01220703125, -0.00933837890625, 0.023193359375, 0.01202392578125, 0.0035858154296875, -0.0211181640625, 0.017333984375, 0.00811767578125, -0.035400390625, -0.010009765625, 0.0308837890625, -0.01611328125, 0.00711059570312...	[ 159, 38969, 1250, 4867, 4420, 125728, 214, 123166, 7103, 39116, 11583, 11782, 502, 60816, 26828, 101790, 156673, 118664, 15824, 46354, 2861, 117904, 105876, 81979, 87344, 1632, 29806, 110, 51347, 32316, 959, 165132, 615, 180874, 1286, 41206, 26...	[ 0.097900390625, 0.243896484375, 0.1688232421875, 0.2156982421875, 0.1820068359375, 0.260986328125, 0.0670166015625, 0.164306640625, 0.127685546875, 0.232666015625, 0.1640625, 0.1796875, 0.0804443359375, 0.06561279296875, 0.1529541015625, 0.038482666015625, 0.0231170654296875, 0.032...	embed
25634970_c0	25634970	prolog	0	Title: Simple Prolog program - Unsure about results Problem title: Simple Prolog program - Unsure about results Tags: prolog Problem: Simple Prolog program - Unsure about results Completely new to Prolog (SWI-Prolog in this case) so apologies for this very basic question. I have a simple program below. loves(vincent,mi...	Simple Prolog program - Unsure about results Simple Prolog program - Unsure about results prolog Simple Prolog Unsure honey_bunny Simple Prolog program - Unsure about results Completely new to Prolog (SWI-Prolog in this case) so apologies for this very basic question. I have a simple program below. I'm a little confuse...	[ 0.00909423828125, 0.0030975341796875, 0.004547119140625, 0.01214599609375, 0.004150390625, 0.0103759765625, -0.018798828125, 0.004425048828125, -0.0013275146484375, -0.0296630859375, 0.004974365234375, 0.0026702880859375, -0.0079345703125, 0.0107421875, 0.00946044921875, 0.008117675781...	[ 60552, 1250, 4867, 1528, 992, 56851, 1672, 50339, 502, 80493, 17643, 299, 38969, 10752, 18709, 62822, 8781, 35064, 10176, 55681, 25632, 41, 1294, 181799, 61689, 2785, 51, 41274, 9433, 35166, 10283, 152161, 44084, 3862, 16797, 99201, 35604, 16...	[ 0.1829833984375, 0.1434326171875, 0.226318359375, 0.1884765625, 0.08831787109375, 0.2132568359375, 0.08392333984375, 0.2137451171875, 0.09332275390625, 0.1778564453125, 0.082275390625, 0.1197509765625, 0.117431640625, 0.09478759765625, 0.034912109375, 0.034759521484375, 0.11474609375...	embed
36327609_c1	36327609	prolog	1	,plt,wbc,folic_acid,b12,rtc]). Now i want to take the first list and see which of those items are in kb, return a list on each kb and then compare the length of those lists and find the percentage value. Example if (Length_list==5 and Length_kb_iron==3) then k=3/5*100. and do this on all kb and the result i want to be ...	,plt,wbc,folic_acid,b12,rtc]). Now i want to take the first list and see which of those items are in kb, return a list on each kb and then compare the length of those lists and find the percentage value. Example if (Length_list==5 and Length_kb_iron==3) then k=3/5*100. and do this on all kb and the result i want to be ...	[ 0.00186920166015625, -0.017822265625, 0.003326416015625, 0.0157470703125, -0.00994873046875, 0.0026702880859375, 0.000621795654296875, 0.00836181640625, 0.009765625, -0.0128173828125, 0.021728515625, 0.0166015625, 0.01513671875, 0.00173187255859375, -0.00106048583984375, -0.00708007812...	[ 2424, 18, 75396, 238, 3584, 9120, 55964, 1530, 3444, 5646, 5117, 5303, 1957, 55769, 621, 23, 51882, 30646, 12638, 69101, 140909, 7413, 169209, 34292, 89536, 449, 6562, 758, 77554, 92, 275, 14, 1900, 69112, 21320, 472, 76067, 12147, 1639, ...	[ 0.011260986328125, 0.0261383056640625, 0.003204345703125, 0.011199951171875, 0.019866943359375, 0.0528564453125, 0.0533447265625, 0.1119384765625, 0.0767822265625, 0.04541015625, 0.06365966796875, 0.2047119140625, 0.08154296875, 0.1839599609375, 0.043060302734375, 0.128173828125, 0.2...	embed
55593598_c1	55593598	prolog	1	- each worker can serve only one service/day global_cardinality() to count number of occurrences for each number 1..19 for list with short services and long services - this defines variables LSUM_X and SSUM_X - number of occurrences of worker X in L ong or S hort services SUM_X #= 12LSUM_X + 8SSUM_X for each worker ...	- each worker can serve only one service/day global_cardinality() to count number of occurrences for each number 1..19 for list with short services and long services - this defines variables LSUM_X and SSUM_X - number of occurrences of worker X in L ong or S hort services SUM_X #= 12LSUM_X + 8SSUM_X for each worker ...	[ -0.001617431640625, 0.000354766845703125, 0.0023040771484375, -0.0050048828125, -0.02490234375, -0.0201416015625, -0.01361083984375, 0.015380859375, 0.014404296875, -0.037353515625, -0.0140380859375, 0.00738525390625, 0.007232666015625, 0.01275634765625, 0.00372314453125, 0.01940917968...	[ 12638, 4488, 56, 831, 21265, 4734, 1632, 4516, 64, 5636, 7964, 38931, 73, 134393, 132, 54529, 14012, 74918, 42, 69098, 2947, 5303, 16610, 11374, 136, 4989, 61924, 77336, 339, 127944, 454, 1542, 159, 114817, 3328, 18, 427, 382, 100, 425, ...	[ 0.1243896484375, 0.1395263671875, 0.1229248046875, 0.063232421875, 0.203857421875, 0.1044921875, 0.1416015625, 0.2181396484375, 0.0616455078125, 0.134521484375, 0.1519775390625, 0.12841796875, 0.1378173828125, 0.146728515625, 0.0079345703125, 0.1513671875, 0.090576171875, 0.1252441...	embed
74566722_c0	74566722	prolog	0	Title: Prolog Predicate that returns Sum of weights of items in a list Problem title: Prolog Predicate that returns Sum of weights of items in a list Tags: sum, prolog, list Problem: Prolog Predicate that returns Sum of weights of items in a list I want to write a prolog predicate that takes in a list of items, searche...	Prolog Predicate that returns Sum of weights of items in a list Prolog Predicate that returns Sum of weights of items in a list sum prolog list Prolog Predicate Sum list_sum Head Tail TotalSum Sum1 total_weight H_entity T_entity H_weight T_weight Prolog Predicate that returns Sum of weights of items in a list I want to...	[ 0.007080078125, 0.0103759765625, 0.00482177734375, 0.00171661376953125, -0.021728515625, 0.0194091796875, -0.0208740234375, 0.0242919921875, 0.01019287109375, -0.037109375, 0.0125732421875, -0.0064697265625, 0.005126953125, -0.00038909912109375, 0.0146484375, 0.01806640625, 0.0207519...	[ 1250, 4867, 7145, 2063, 67, 30646, 36335, 111, 57888, 7, 55769, 5303, 23, 10554, 502, 11832, 44816, 1218, 379, 33867, 316, 418, 3622, 165598, 572, 2517, 384, 450, 3444, 33022, 1653, 51776, 33938, 42518, 3714, 2046, 20697, 13452, 52080 ]	[ 0.1375732421875, 0.2132568359375, 0.139404296875, 0.1812744140625, 0.07012939453125, 0.158935546875, 0.1973876953125, 0.0091552734375, 0.211669921875, 0.023101806640625, 0.1671142578125, 0.1925048828125, 0.039520263671875, 0.2117919921875, 0.122314453125, 0.1685791015625, 0.104736328...	embed
53794232_c1	53794232	prolog	1	StartNode), Sol = [StartNode]. traverse(StartNode,Sol,Visit) :- changeState(StartNode, NextNode), not(member(NextNode, Visit)), traverse(NextNode, PartialSol, [NextNode\|Visit]), Sol = [StartNode \| PartialSol]. When I execute this code, I get these errors: ERROR: Arguments are not sufficiently instantiated ERROR: In: ER...	StartNode), Sol = [StartNode]. traverse(StartNode,Sol,Visit) :- changeState(StartNode, NextNode), not(member(NextNode, Visit)), traverse(NextNode, PartialSol, [NextNode\|Visit]), Sol = [StartNode \| PartialSol]. When I execute this code, I get these errors: ERROR: Arguments are not sufficiently instantiated ERROR: In: ER...	[ -0.021240234375, 0.01141357421875, 0.0245361328125, 0.011474609375, -0.0023040771484375, 0.02197265625, -0.0303955078125, -0.02197265625, 0.00518798828125, -0.00482177734375, 0.013427734375, 0.0238037109375, 0.00396728515625, 0.01953125, 0.00714111328125, -0.00445556640625, 0.0005836...	[ 13794, 5021, 112, 6678, 2203, 126597, 37317, 13, 102588, 65331, 217, 15549, 135206, 4997, 959, 27417, 81280, 98684, 9148, 289, 71924, 903, 18151, 18499, 151206, 24638, 112140, 129980, 34648, 27686, 360, 85090, 88438, 4046, 157979, 35604, 63652,...	[ 0.1754150390625, 0.1904296875, 0.0975341796875, 0.1964111328125, 0.0135498046875, 0.1700439453125, 0.1895751953125, 0.09002685546875, 0.1943359375, 0.1494140625, 0.100341796875, 0.226318359375, 0.19873046875, 0.150390625, 0.1173095703125, 0.139404296875, 0.11279296875, 0.1859130859...	embed
43314658_c0	43314658	prolog	0	Title: What are the requirements a computer function must meet to be considered "monotonic"? Problem title: What are the requirements a computer function must meet to be considered "monotonic"? Tags: prolog, logical-purity, logic Problem: What are the requirements a computer function must meet to be...	What are the requirements a computer function must meet to be considered "monotonic"? What are the requirements a computer function must meet to be considered "monotonic"? prolog logical-purity logic What What are the requirements a computer function must meet to be considered "monotonic"? What are ...	[ 0.00714111328125, -0.00335693359375, 0.0142822265625, 0.02490234375, 0.01397705078125, 0.006591796875, 0.0035247802734375, -0.0167236328125, -0.00274658203125, -0.005859375, -0.00372314453125, 0.0213623046875, -0.038330078125, -0.00384521484375, 0.0036773681640625, 0.01806640625, 0.0...	[ 96679, 13909, 32354, 8110, 23356, 90698, 64176, 188, 6402, 502, 4867, 62775, 289, 4717, 2481, 621, 70, 232578, 19714, 2063, 16916, 163136, 8162, 182902, 1771, 60892, 138155, 55738, 11, 59911, 147118, 75412, 56037, 6305, 41361, 28960, 105233, ...	[ 0.2244873046875, 0.2188720703125, 0.26806640625, 0.0855712890625, 0.1478271484375, 0.128173828125, 0.21240234375, 0.230712890625, 0.2193603515625, 0.0865478515625, 0.132568359375, 0.13037109375, 0.0067138671875, 0.104736328125, 0.0158538818359375, 0.00701904296875, 0.0158233642578125...	embed
29263638_c0	29263638	prolog	0	Title: Prolog - Updating Dynamic Lists Problem title: Prolog - Updating Dynamic Lists Tags: search, prolog, list, dynamic Problem: Prolog - Updating Dynamic Lists I want to update two dynamic lists for a breadth search. Although they do update in the background, their value that got instantiate in the initiate predicat...	Prolog - Updating Dynamic Lists Prolog - Updating Dynamic Lists search prolog list dynamic Prolog Updating Dynamic Lists Start OPEN CLOSE Result Prolog - Updating Dynamic Lists I want to update two dynamic lists for a breadth search. Although they do update in the background, their value that got instantiate in the ini...	[ 0.025146484375, 0.00982666015625, 0.01904296875, 0.015625, -0.006683349609375, 0.0118408203125, 0.00147247314453125, 0.021728515625, 0.0111083984375, -0.021484375, 0.01220703125, 0.00168609619140625, -0.00015354156494140625, -0.000911712646484375, 0.0257568359375, -0.01031494140625, ...	[ 1250, 4867, 10091, 56464, 73327, 21068, 32036, 33938, 502, 5303, 84079, 13794, 180, 65441, 92933, 126684, 3444, 28350, 6626, 179967, 927, 76615, 34292, 34648, 173969, 1653, 2063, 23742, 18, 9803, 136, 155738, 98, 126597, 8560, 1284, 647, 1114...	[ 0.168701171875, 0.21435546875, 0.1019287109375, 0.10986328125, 0.1265869140625, 0.0811767578125, 0.1976318359375, 0.1754150390625, 0.115478515625, 0.2037353515625, 0.201171875, 0.10333251953125, 0.07391357421875, 0.156494140625, 0.143798828125, 0.1131591796875, 0.0606689453125, 0.1...	embed
47707005_c0	47707005	prolog	0	Title: Automated query testing against a knowledge base in Prolog Problem title: Automated query testing against a knowledge base in Prolog Tags: prolog, swi-prolog Problem: Automated query testing against a knowledge base in Prolog I have a db with some facts and a file with some predicates that I defined. /* facts.pl...	Automated query testing against a knowledge base in Prolog Automated query testing against a knowledge base in Prolog prolog swi-prolog Automated Prolog facts.pl dog_person predicates.pl has_dog something_else Query Out queries.pl Done Automated query testing against a knowledge base in Prolog I have a db with some fac...	[ 0.032470703125, 0.017822265625, 0.017578125, 0.01153564453125, -0.0036468505859375, 0.004852294921875, 0.005706787109375, 0.0027618408203125, -0.0028533935546875, -0.0537109375, 0.01318359375, 0.0203857421875, -0.0255126953125, 0.0038299560546875, -0.00775146484375, 0.0172119140625, ...	[ 51719, 297, 41, 1294, 134234, 26548, 51359, 3647, 1250, 4867, 502, 2452, 3454, 15824, 2424, 10269, 30816, 1653, 2063, 1636, 1556, 38507, 9844, 5557, 58836, 13538, 10484, 40041, 11435, 61924, 3034, 3871, 11675, 5303, 149016, 3917, 107730, 1263...	[ 0.2291259765625, 0.012847900390625, 0.17578125, 0.1280517578125, 0.22216796875, 0.1929931640625, 0.1529541015625, 0.182861328125, 0.1612548828125, 0.25634765625, 0.088134765625, 0.1112060546875, 0.11083984375, 0.125, 0.0579833984375, 0.128662109375, 0.0693359375, 0.1744384765625, ...	embed
16636100_c1	16636100	prolog	1	to evaluate and say if it belong to my language or not. A sentence have to be formed in the following way: sentence2(VP) --> noun_phrase2(Actor), verb_phrase2(Actor, VP). (by something that is noun phrase followed by something that is a verb phrase . A noun phrase is composed in this way: noun_phrase2(Name) --> proper...	to evaluate and say if it belong to my language or not. A sentence have to be formed in the following way: sentence2(VP) --> noun_phrase2(Actor), verb_phrase2(Actor, VP). (by something that is noun phrase followed by something that is a verb phrase . A noun phrase is composed in this way: noun_phrase2(Name) --> proper...	[ -0.003936767578125, -0.00099945068359375, 0.000823974609375, 0.034912109375, 0.0162353515625, 0.0294189453125, 0.003173828125, 0.0198974609375, 0.016357421875, -0.029052734375, 0.0242919921875, 0.0027618408203125, 0.01226806640625, -0.0087890625, -0.0021820068359375, 0.0169677734375, ...	[ 47, 151575, 13, 136, 5154, 2174, 442, 10617, 759, 46876, 707, 959, 62, 149357, 100, 4806, 3917, 304, 41195, 110, 309, 179665, 184, 284, 18770, 42792, 113860, 150350, 163612, 27798, 10, 83, 9351, 91084, 111, 8781, 390, 13315, 66159, 19, ...	[ 0.1474609375, 0.1748046875, 0.0594482421875, 0.03778076171875, 0.1005859375, 0.0712890625, 0.0286865234375, 0.1990966796875, 0.0740966796875, 0.1920166015625, 0.0305938720703125, 0.0570068359375, 0.012359619140625, 0.20068359375, 0.07891845703125, 0.08050537109375, 0.043975830078125,...	embed
20501277_c0	20501277	prolog	0	Title: How to modify sentence parsing rules in Prolog? Problem title: How to modify sentence parsing rules in Prolog? Tags: prolog Problem: How to modify sentence parsing rules in Prolog? While parsing list of strings the current rules allow comma to be at the end of the sentence and not allow comma to be between words...	How to modify sentence parsing rules in Prolog? How to modify sentence parsing rules in Prolog? prolog How Prolog TEST How to modify sentence parsing rules in Prolog? While parsing list of strings the current rules allow comma to be at the end of the sentence and not allow comma to be between words, which is obviously ...	[ 0.010009765625, 0.0234375, 0.0069580078125, 0.032470703125, -0.00274658203125, 0.01025390625, -0.0023193359375, 0.0213623046875, 0.01202392578125, -0.003753662109375, 0.01177978515625, -0.016357421875, -0.0000762939453125, -0.01043701171875, 0.01806640625, 0.0247802734375, 0.01409912...	[ 11249, 2811, 40383, 149357, 366, 6953, 91736, 1250, 4867, 23, 502, 384, 21828, 47, 5303, 79315, 43581, 63769, 96117, 186, 3564, 17721, 34153, 171259, 959, 26785, 86869, 43240 ]	[ 0.06829833984375, 0.1512451171875, 0.1551513671875, 0.1824951171875, 0.1689453125, 0.09796142578125, 0.1739501953125, 0.16455078125, 0.256103515625, 0.03546142578125, 0.0927734375, 0.04656982421875, 0.0950927734375, 0.005828857421875, 0.096923828125, 0.137451171875, 0.10595703125, ...	embed
78311486_c0	78311486	prolog	0	Title: ECLiPSe create 2D matrix with C++ interfacing Problem title: ECLiPSe create 2D matrix with C++ interfacing Tags: prolog, c%2B%2B, eclipse-clp Problem: ECLiPSe create 2D matrix with C++ interfacing I have a predicate that I use to initialise a 2D matrix in eclipse: problem(1, []( [](1,2,3,4), [](1,2,4,3), [](1,3,...	ECLiPSe create 2D matrix with C++ interfacing ECLiPSe create 2D matrix with C++ interfacing prolog c%2B%2B eclipse-clp ECLiPSe EC_functor matrix4 EC_word matrix3 ecl_refs_create ECLiPSe create 2D matrix with C++ interfacing I have a predicate that I use to initialise a 2D matrix in eclipse: I'd like to use a C++ progra...	[ 0.036865234375, 0.00225830078125, -0.009033203125, 0.01318359375, 0.00335693359375, 0.01416015625, -0.0062255859375, 0.017578125, -0.00070953369140625, -0.0289306640625, 0.0118408203125, 0.00189208984375, -0.008056640625, -0.005096435546875, -0.007232666015625, 0.0208740234375, 0.009...	[ 59947, 9506, 9059, 13, 28282, 116, 397, 50944, 425, 678, 313, 37223, 1940, 91468, 502, 4867, 501, 28, 106371, 184, 26775, 16498, 18770, 617, 47416, 363, 34937, 29087, 7612, 1653, 2063, 4527, 61475, 3075, 23, 1884, 1528, 101758, 3917, 1295...	[ 0.115966796875, 0.1502685546875, 0.1201171875, 0.110595703125, 0.1373291015625, 0.15380859375, 0.156494140625, 0.2164306640625, 0.1268310546875, 0.052276611328125, 0.0640869140625, 0.2607421875, 0.0906982421875, 0.1473388671875, 0.0897216796875, 0.1396484375, 0.004119873046875, 0.0...	embed
66725859_c0	66725859	prolog	0	Title: Prolog - Comparison between 1 and 0.5 fails Problem title: Prolog - Comparison between 1 and 0.5 fails Tags: prolog Problem: Prolog - Comparison between 1 and 0.5 fails I have a very basic function which basically does comparison of the input numbers with some constants. Here is the code - check(FEATURE_0, FEATU...	Prolog - Comparison between 1 and 0.5 fails Prolog - Comparison between 1 and 0.5 fails prolog Prolog Comparison FEATURE_0 FEATURE_1 FEATURE_2 FEATURE_3 FEATURE_4 FEATURE_5 Fails Fail Prolog - Comparison between 1 and 0.5 fails I have a very basic function which basically does comparison of the input numbers with some ...	[ -0.000885009765625, -0.005828857421875, 0.01019287109375, -0.0220947265625, 0.01397705078125, -0.0037994384765625, -0.00933837890625, -0.004608154296875, 0.00634765625, 0.032958984375, 0.00836181640625, -0.002288818359375, 0.0025177001953125, -0.012939453125, 0.00970458984375, 0.004669...	[ 1250, 4867, 113307, 40514, 17721, 106, 81730, 35782, 136, 502, 24040, 165471, 2389, 115187, 363, 617, 758, 190355, 62822, 32354, 225490, 107730, 101935, 678, 53697, 18151, 78293, 563, 11907, 3789, 34292, 11343, 757, 13315, 138, 13254, 977, 12...	[ 0.1676025390625, 0.2352294921875, 0.1966552734375, 0.1561279296875, 0.10015869140625, 0.09735107421875, 0.26806640625, 0.201171875, 0.055206298828125, 0.1334228515625, 0.072998046875, 0.10150146484375, 0.0748291015625, 0.0196533203125, 0.0206298828125, 0.03375244140625, 0.07232666015...	embed
46793293_c0	46793293	prolog	0	Title: Get elements which are not in second list Problem title: Get elements which are not in second list Tags: prolog, member, list Problem: Get elements which are not in second list What I'm trying to accomplish is to get what 'Components' are not being used. So I created a list with all the 'Components' and 'In Use ...	Get elements which are not in second list Get elements which are not in second list prolog member list Get comp_list Comp inuse_list List Elements Get elements which are not in second list What I'm trying to accomplish is to get what 'Components' are not being used. So I created a list with all the 'Components' and 'In...	[ -0.0203857421875, -0.0025787353515625, 0.0279541015625, 0.018310546875, -0.0242919921875, 0.0238037109375, -0.0013275146484375, 0.0076904296875, 0.0189208984375, -0.017822265625, -0.017822265625, 0.006683349609375, 0.0086669921875, 0.0213623046875, -0.00121307373046875, -0.005218505859...	[ 20779, 80854, 3129, 621, 959, 23, 17932, 5303, 502, 4867, 32786, 9969, 6562, 15612, 4032, 32036, 48325, 31577, 163846, 2046, 10770, 54137, 8035, 11814, 75935, 4153, 36836, 6528, 69101, 28282, 15935, 18, 14858, 3714, 54, 11627, 91995, 678, 1...	[ 0.1202392578125, 0.1839599609375, 0.0207672119140625, 0.051361083984375, 0.13427734375, 0.095947265625, 0.133544921875, 0.1571044921875, 0.1204833984375, 0.1766357421875, 0.192626953125, 0.1932373046875, 0.13671875, 0.1334228515625, 0.1005859375, 0.1229248046875, 0.159912109375, 0....	embed
33204261_c0	33204261	prolog	0	Title: Display elements of requested fact Problem title: Display elements of requested fact Tags: prolog Problem: Display elements of requested fact I am very new to Prolog and I'm struggling to understand what I have done wrong. I'm trying to get user input in the form of one keyword and then display the full details ...	Display elements of requested fact Display elements of requested fact prolog Display acc10707 b228 mng10247 com00207 b727 Please Name Day Time Prof Room Display elements of requested fact I am very new to Prolog and I'm struggling to understand what I have done wrong. I'm trying to get user input in the form of one key...	[ 0.041259765625, 0.00933837890625, 0.007354736328125, 0.0208740234375, -0.00494384765625, 0.0177001953125, -0.0019683837890625, 0.002227783203125, -0.00775146484375, -0.0167236328125, -0.007476806640625, -0.024658203125, -0.0380859375, 0.0107421875, -0.01239013671875, 0.00811767578125, ...	[ 90045, 80854, 111, 50336, 297, 15824, 502, 4867, 50015, 963, 158367, 134712, 449, 142430, 375, 97259, 3768, 30607, 15757, 10013, 19055, 11739, 38484, 3525, 1250, 237875, 28219, 16940, 44691, 31577, 38937, 107730, 3173, 1632, 166117, 44116, 4393...	[ 0.22607421875, 0.1907958984375, 0.088623046875, 0.193359375, 0.09326171875, 0.2138671875, 0.125244140625, 0.251708984375, 0.0226898193359375, 0.0207061767578125, 0.1058349609375, 0.1280517578125, 0.036895751953125, 0.0780029296875, 0.0166778564453125, 0.0217132568359375, 0.0559692382...	embed
14547932_c0	14547932	prolog	0	Title: Prolog infinite loop Problem title: Prolog infinite loop Tags: xsb, b-prolog, failure-slice, swi-prolog, prolog Problem: Prolog infinite loop This is a program that should find out who is compatible with john. I am new to Prolog. In order to let Prolog know eg. met(X,Y) = met (Y,X) lots of code has been written....	Prolog infinite loop Prolog infinite loop xsb b-prolog failure-slice swi-prolog prolog Prolog Temp Prolog infinite loop This is a program that should find out who is compatible with john. I am new to Prolog. In order to let Prolog know eg. met(X,Y) = met (Y,X) lots of code has been written. Now when I start the query i...	[ 0.0152587890625, -0.007293701171875, 0.0159912109375, 0.0247802734375, 0.011474609375, -0.0030975341796875, 0.00469970703125, 0.02001953125, 0.0093994140625, -0.06201171875, 0.01300048828125, 0.00543212890625, -0.006439208984375, -0.00604248046875, 0.025634765625, 0.03076171875, 0.01...	[ 1250, 4867, 54241, 13, 40956, 1022, 275, 876, 3454, 137578, 13348, 2452, 502, 37446, 1528, 5608, 7413, 1810, 2750, 83, 146731, 678, 35254, 19, 3525, 3714, 30046, 435, 1542, 1723, 2203, 71358, 18151, 59121, 3229, 4034, 41, 1294, 60899, 393...	[ 0.195068359375, 0.2685546875, 0.1771240234375, 0.130615234375, 0.23388671875, 0.0200958251953125, 0.11767578125, 0.0662841796875, 0.14599609375, 0.1929931640625, 0.1121826171875, 0.118896484375, 0.111328125, 0.1669921875, 0.1451416015625, 0.00323486328125, 0.055145263671875, 0.0496...	embed
27160156_c0	27160156	prolog	0	Title: Prolog Infinite loop (cyclic graph) Problem title: Prolog Infinite loop (cyclic graph) Tags: prolog, graph-theory, infinite-loop, transitive-closure Problem: Prolog Infinite loop (cyclic graph) this might be a simple problem but I need to do it differently. The problem is that I have to find in prolog the possib...	Prolog Infinite loop (cyclic graph) Prolog Infinite loop (cyclic graph) prolog graph-theory infinite-loop transitive-closure Prolog Infinite from_to Prolog Infinite loop (cyclic graph) this might be a simple problem but I need to do it differently. The problem is that I have to find in prolog the possible routes of air...	[ 0.0186767578125, -0.003814697265625, 0.011962890625, 0.033203125, -0.0135498046875, -0.0081787109375, 0.0029296875, 0.01409912109375, 0.007232666015625, -0.0673828125, 0.00408935546875, 0.0005645751953125, -0.0167236328125, 0.01397705078125, 0.0172119140625, 0.018310546875, 0.0137329...	[ 1250, 4867, 134322, 13, 40956, 187830, 41382, 502, 2347, 54241, 28354, 62621, 5844, 170224, 1295, 188, 8781, 2967, 12921, 7413, 7722, 36439, 111, 1831, 420, 20016, 51359, 3647, 3249, 1653, 2063, 1542, 1723, 12765, 2174, 831, 738, 1193, 47, ...	[ 0.1539306640625, 0.2479248046875, 0.1680908203125, 0.0726318359375, 0.189208984375, 0.1705322265625, 0.2000732421875, 0.1602783203125, 0.01336669921875, 0.1290283203125, 0.1636962890625, 0.085205078125, 0.00665283203125, 0.149658203125, 0.116455078125, 0.07952880859375, 0.01602172851...	embed
49991063_c0	49991063	prolog	0	Title: Age word prob\|em in prolog Problem title: Age word prob\|em in prolog Tags: prolog Problem: Age word prob\|em in prolog I know that: Nick = 2 * Kate (Kate + Lea) = 2 * Nick (Chris + Nick) = 2 * (Kate + Lea) Ashley = 24 Ashley + Kate + Lea = 2 * (Chris + Nick) After some cancellation I found out that: Ashley = 12 *...	Age word prob\|em in prolog Age word prob\|em in prolog prolog Age use_module Ashley Lea Nick Chris Kate Age word prob\|em in prolog I know that: Nick = 2 * Kate (Kate + Lea) = 2 * Nick (Chris + Nick) = 2 * (Kate + Lea) Ashley = 24 Ashley + Kate + Lea = 2 * (Chris + Nick) After some cancellation I found out that: Ashley =...	[ -0.00811767578125, -0.006591796875, 0.006683349609375, 0.0045166015625, -0.000415802001953125, 0.0167236328125, -0.006072998046875, 0.0218505859375, 0.0009002685546875, -0.042724609375, 0.0035400390625, -0.0155029296875, 0.01153564453125, 0.0179443359375, 0.0185546875, 0.0181884765625,...	[ 72944, 2565, 43011, 58745, 195, 23, 502, 4867, 4527, 83279, 180205, 54642, 47801, 31745, 37958, 3714, 2203, 116, 661, 8139, 67, 997, 3679, 744, 126136, 427, 138, 305, 201, 13538, 187895, 79786, 5885, 117914, 831, 1363, 10176, 55681, 15490, ...	[ 0.2371826171875, 0.166748046875, 0.1922607421875, 0.013580322265625, 0.17919921875, 0.0601806640625, 0.1934814453125, 0.21923828125, 0.109619140625, 0.1683349609375, 0.242431640625, 0.176513671875, 0.17822265625, 0.1767578125, 0.2276611328125, 0.0615234375, 0.016021728515625, 0.099...	embed
64845832_c0	64845832	prolog	0	Title: to find a list of ten even integer reading an integer (N) from the keyboard,first element is the first even number after N Problem title: to find a list of ten even integer reading an integer (N) from the keyboard,first element is the first even number after N Tags: prolog Problem: to find a list of ten even int...	to find a list of ten even integer reading an integer (N) from the keyboard,first element is the first even number after N to find a list of ten even integer reading an integer (N) from the keyboard,first element is the first even number after N prolog the FirstNumber nth1 to find a list of ten even integer reading an ...	[ -0.008056640625, -0.005828857421875, 0.0019989013671875, 0.00433349609375, 0.00145721435546875, 0.023681640625, -0.0021820068359375, 0.012451171875, 0.0048828125, -0.026611328125, 0.0113525390625, -0.03369140625, -0.0294189453125, -0.002410888671875, 0.01708984375, 0.0018157958984375, ...	[ 47, 7413, 5303, 111, 1492, 3853, 892, 1505, 16454, 839, 1295, 149186, 13448, 271, 12830, 83, 5117, 14012, 7103, 541, 502, 4867, 23972, 18444, 26278, 653, 927, 418, 89536, 12301, 17480, 70541, 2592, 2485, 1819, 1549, 2357, 4046, 3882, 1197...	[ 0.042205810546875, 0.1468505859375, 0.18359375, 0.0269775390625, 0.22509765625, 0.22119140625, 0.1580810546875, 0.1400146484375, 0.2000732421875, 0.165771484375, 0.13232421875, 0.260498046875, 0.0975341796875, 0.0643310546875, 0.1781005859375, 0.00506591796875, 0.1025390625, 0.1612...	embed
42370513_c1	42370513	prolog	1	thousands of predicates with possible typing or copy/paste mistakes and you can see the need. Other considerations I have also considered having a master copy of the term in the predicate and then using that to make the three copies. The problem with that is one of the copies is used in selecting the predicate, so bef...	thousands of predicates with possible typing or copy/paste mistakes and you can see the need. Other considerations I have also considered having a master copy of the term in the predicate and then using that to make the three copies. The problem with that is one of the copies is used in selecting the predicate, so bef...	[ 0.0013427734375, 0.025634765625, -0.0057373046875, 0.01092529296875, -0.01519775390625, 0.01239013671875, 0.0072021484375, 0.0038604736328125, 0.004241943359375, -0.0240478515625, 0.01544189453125, -0.0022125244140625, 0.000331878662109375, 0.004974365234375, 0.0062255859375, 0.0253906...	[ 137107, 111, 1653, 2063, 1636, 7722, 11417, 43658, 64, 134665, 121742, 831, 1957, 70, 3871, 177229, 90698, 19441, 31347, 13579, 67, 17368, 3249, 17262, 71200, 2967, 1632, 11814, 36849, 8108, 133291, 2806, 765, 3687, 959, 219836, 1556, 23, 5...	[ 0.1322021484375, 0.02142333984375, 0.1903076171875, 0.2200927734375, 0.1259765625, 0.106201171875, 0.1121826171875, 0.197021484375, 0.016510009765625, 0.1138916015625, 0.139404296875, 0.0252838134765625, 0.0689697265625, 0.002197265625, 0.1571044921875, 0.05511474609375, 0.0874023437...	embed
34033215_c0	34033215	prolog	0	Title: Check if the position if less then or greater then another position prolog Problem title: Check if the position if less then or greater then another position prolog Tags: shortest-path, prolog Problem: Check if the position if less then or greater then another position prolog I have revised this question to be m...	Check if the position if less then or greater then another position prolog Check if the position if less then or greater then another position prolog shortest-path prolog Check Row What Rows TempR Tail Where TWhere Check if the position if less then or greater then another position prolog I have revised this question t...	[ 0.00909423828125, 0.01177978515625, 0.006866455078125, 0.0021820068359375, 0.0087890625, -0.004669189453125, 0.020263671875, 0.00335693359375, 0.01904296875, -0.00408935546875, 0.029052734375, 0.01129150390625, 0.00194549560546875, -0.011474609375, 0.00836181640625, 0.0029449462890625,...	[ 38679, 2174, 19069, 40715, 7068, 707, 117396, 15700, 502, 4867, 16610, 525, 128405, 96190, 37446, 1052, 1218, 379, 35593, 70, 29458, 16487, 100, 31577, 7413, 2858, 4, 10461, 83, 3501, 17727, 25632, 18151, 12830, 8035, 2367, 30646, 3444, 106...	[ 0.197998046875, 0.1116943359375, 0.2379150390625, 0.234130859375, 0.158935546875, 0.0732421875, 0.2064208984375, 0.0838623046875, 0.140869140625, 0.2012939453125, 0.1287841796875, 0.0594482421875, 0.1376953125, 0.1527099609375, 0.123779296875, 0.04083251953125, 0.047515869140625, 0...	embed
71967110_c0	71967110	prolog	0	Title: Remove invariants from some prolog list? Problem title: Remove invariants from some prolog list? Tags: invariants, reduce, prolog Problem: Remove invariants from some prolog list? I am searching some predicate: reduce_2n_invariant(+I, +F, -O) based on: some input list I some input operator F of form fx , which g...	Remove invariants from some prolog list? Remove invariants from some prolog list? invariants reduce prolog some Remove reduce_2n_invariant invariant_2 LIn LOut test.pl:2:5 Syntax Operator test.pl:4:5 Remove invariants from some prolog list? I am searching some predicate: based on: some input list I some input operator ...	[ -0.007110595703125, -0.0194091796875, 0.001312255859375, 0.00830078125, -0.01318359375, -0.0107421875, -0.01220703125, 0.0107421875, 0.007659912109375, -0.009765625, 0.02734375, 0.0162353515625, 0.007415771484375, 0.000457763671875, 0.005615234375, 0.0111083984375, 0.003387451171875,...	[ 181139, 23, 162591, 7, 1295, 502, 4867, 5303, 3060, 34390, 304, 19, 73, 1003, 3034, 2424, 758, 150922, 157318, 2063, 35509, 107730, 87, 39933, 563, 3173, 102317, 139392, 140992, 180, 40407, 4537, 35431, 190659, 116, 20028, 653, 47, 113, 2...	[ 0.1678466796875, 0.1536865234375, 0.2841796875, 0.092529296875, 0.07781982421875, 0.176513671875, 0.2227783203125, 0.1708984375, 0.04913330078125, 0.1871337890625, 0.06964111328125, 0.0195770263671875, 0.0865478515625, 0.034210205078125, 0.09832763671875, 0.022613525390625, 0.0496215...	embed
72706505_c0	72706505	prolog	0	Title: How to negate in prolog? Problem title: How to negate in prolog? Tags: prolog, negation Problem: How to negate in prolog? I can't understand how the negation works in Prolog. I followed some questions on the same topic but I still can't figure it out, so, sorry if this is repetitive Say I have this rules: female...	How to negate in prolog? How to negate in prolog? prolog negation How not_parent father_of mother_of How to negate in prolog? I can't understand how the negation works in Prolog. I followed some questions on the same topic but I still can't figure it out, so, sorry if this is repetitive Say I have this rules: What I'm ...	[ -0.00421142578125, 0.01202392578125, 0.01043701171875, 0.00555419921875, -0.025146484375, 0.00714111328125, 0.00665283203125, -0.006927490234375, -0.004852294921875, -0.006103515625, -0.01092529296875, -0.01165771484375, 0.007598876953125, 0.005126953125, 0.000652313232421875, 0.008300...	[ 11249, 47, 90584, 13, 23, 502, 4867, 108, 125682, 959, 99547, 67373, 4390, 42732, 43240, 1250, 91736, 31577, 69307, 20949, 162515, 756, 351, 76755, 37842, 837, 275, 14801, 126, 1542, 990, 45831, 98320, 27781, 4488, 123055, 100, 1193, 179140...	[ 0.0748291015625, 0.04766845703125, 0.2265625, 0.1845703125, 0.06787109375, 0.1673583984375, 0.204833984375, 0.1724853515625, 0.1995849609375, 0.150634765625, 0.1842041015625, 0.1561279296875, 0.0841064453125, 0.12158203125, 0.06732177734375, 0.1417236328125, 0.05615234375, 0.010955...	embed
24048395_c0	24048395	prolog	0	Title: Prolog iterating over list Problem title: Prolog iterating over list Tags: prolog Problem: Prolog iterating over list I am working with Prolog sample list programs and triying to do some operations on them. However, I am stuck at a point and couldn't find any solution or sample. I want to write a function which ...	Prolog iterating over list Prolog iterating over list prolog Prolog Result Prolog iterating over list I am working with Prolog sample list programs and triying to do some operations on them. However, I am stuck at a point and couldn't find any solution or sample. I want to write a function which takes two lists of inte...	[ 0.00457763671875, -0.00665283203125, -0.01025390625, 0.0013885498046875, 0.00177764892578125, 0.002655029296875, -0.000713348388671875, -0.005157470703125, 0.006866455078125, -0.00860595703125, 0.015625, 0.002685546875, -0.0098876953125, -0.020751953125, 0.002410888671875, -0.016723632...	[ 1250, 4867, 17, 67, 98767, 645, 5303, 502, 126684, 20697, 121413, 103391, 41018, 179933, 6275, 29806, 3444, 33022, 32354, 51776, 6626, 892, 26255, 30646, 21917, 257, 34292, 13267, 105950, 16750, 225490, 101637, 69101, 11907, 111410, 5117, 17932...	[ 0.1683349609375, 0.24560546875, 0.068359375, 0.20263671875, 0.1356201171875, 0.1737060546875, 0.199462890625, 0.11669921875, 0.199951171875, 0.034454345703125, 0.125, 0.07373046875, 0.1180419921875, 0.03900146484375, 0.004364013671875, 0.0780029296875, 0.05584716796875, 0.087524414...	embed
19876127_c0	19876127	prolog	0	Title: Process a list of lists in Prolog (Go game) Problem title: Process a list of lists in Prolog (Go game) Tags: artificial-intelligence, prolog Problem: Process a list of lists in Prolog (Go game) I am suffering from this Prolog predicate: board(Before,_,After) . Where Before is a list of lists of character, either...	Process a list of lists in Prolog (Go game) Process a list of lists in Prolog (Go game) artificial-intelligence prolog Process Prolog Before After Process a list of lists in Prolog (Go game) I am suffering from this Prolog predicate: board(Before,_,After) . Where Before is a list of lists of character, either ‘a’, ‘b’,...	[ 0.0036773681640625, 0.006561279296875, 0.0087890625, 0.02880859375, -0.013916015625, 0.005401611328125, 0.0081787109375, 0.00604248046875, 0.0029754638671875, 0.0108642578125, 0.0030517578125, -0.0034332275390625, 0.00750732421875, 0.00128173828125, -0.000911712646484375, 0.00213623046...	[ 123996, 5303, 111, 7, 1250, 4867, 17903, 6712, 23, 66733, 130687, 502, 117371, 24372, 178707, 1653, 2063, 67, 45443, 6766, 89700, 454, 4, 46327, 78662, 62816, 11, 275, 238, 140909, 46132, 5701, 113054, 5117, 33636, 35064, 192728, 11341, 201...	[ 0.200439453125, 0.244873046875, 0.0484619140625, 0.1138916015625, 0.1915283203125, 0.250732421875, 0.1636962890625, 0.099853515625, 0.0260772705078125, 0.09716796875, 0.102783203125, 0.1190185546875, 0.2119140625, 0.2344970703125, 0.102294921875, 0.1217041015625, 0.1781005859375, 0...	embed
16698523_c0	16698523	prolog	0	Title: Problems with DCG (Prolog) Problem title: Problems with DCG (Prolog) Tags: prolog, dcg Problem: Problems with DCG (Prolog) I am trying to work out this simple DCG assignment (Prolog) for my course. The prblem is about creating a DCG. I have already defined a Universe of Discourse in my code. But this question is...	Problems with DCG (Prolog) Problems with DCG (Prolog) prolog dcg Problems DCG Prolog Cnt Problems with DCG (Prolog) I am trying to work out this simple DCG assignment (Prolog) for my course. The prblem is about creating a DCG. I have already defined a Universe of Discourse in my code. But this question is a bit mislead...	[ 0.015869140625, 0.007171630859375, -0.006072998046875, 0.022216796875, 0.005279541015625, 0.002166748046875, 0.0059814453125, -0.0225830078125, 0.0211181640625, -0.044921875, -0.016357421875, -0.01043701171875, -0.006683349609375, 0.00994873046875, 0.0179443359375, 0.00994873046875, ...	[ 15649, 7, 678, 391, 56367, 10752, 4867, 502, 104, 238, 177, 1250, 660, 31577, 4488, 8781, 95486, 674, 100, 759, 15411, 2661, 105233, 21771, 61924, 153543, 111, 6206, 100599, 18151, 9655, 4785, 1239, 14507, 6238, 12301, 10002, 73048, 134031,...	[ 0.1951904296875, 0.0236358642578125, 0.14697265625, 0.146728515625, 0.24609375, 0.1409912109375, 0.2220458984375, 0.1336669921875, 0.082275390625, 0.05609130859375, 0.1187744140625, 0.1236572265625, 0.0604248046875, 0.04791259765625, 0.044036865234375, 0.089111328125, 0.124755859375,...	embed
20337029_c1	20337029	prolog	1	, since it holds no info about them. The drawing of this board would be basicly turning the 0's into spaces, and the board would be drawn like this: 3 6 6 3 1 2 1 1 3 2 3 4 1 which is a decent representation of a real hashi board. The point now is to be able to draw the same thing, but also draw bridges if there's any....	, since it holds no info about them. The drawing of this board would be basicly turning the 0's into spaces, and the board would be drawn like this: 3 6 6 3 1 2 1 1 3 2 3 4 1 which is a decent representation of a real hashi board. The point now is to be able to draw the same thing, but also draw bridges if there's any....	[ -0.0257568359375, -0.002716064453125, 0.002838134765625, 0.0216064453125, -0.0196533203125, 0.0223388671875, 0.004302978515625, -0.014892578125, 0.00897216796875, -0.004119873046875, -0.010498046875, -0.0284423828125, -0.0017242431640625, 0.016357421875, -0.034912109375, -0.01818847656...	[ 16792, 442, 16401, 110, 3004, 1672, 2856, 188304, 111, 903, 45443, 2806, 186, 62822, 174548, 757, 25, 3934, 32628, 79442, 19, 1884, 138, 305, 116, 201, 106, 8, 16797, 18811, 1363, 2773, 256, 3767, 6275, 5036, 19048, 5701, 13580, 2843, 8...	[ 0.048309326171875, 0.01934814453125, 0.08648681640625, 0.1273193359375, 0.14404296875, 0.0684814453125, 0.057098388671875, 0.18994140625, 0.03900146484375, 0.111083984375, 0.2296142578125, 0.05523681640625, 0.004547119140625, 0.066650390625, 0.07763671875, 0.1654052734375, 0.01521301...	embed
59523526_c0	59523526	prolog	0	Title: predicate solve/2 its first argument is non-empty list ,second argument is list consisting of zero or more appended copies of the first argument Problem title: predicate solve/2 its first argument is non-empty list ,second argument is list consisting of zero or more appended copies of the first argument Tags: pr...	predicate solve/2 its first argument is non-empty list ,second argument is list consisting of zero or more appended copies of the first argument predicate solve/2 its first argument is non-empty list ,second argument is list consisting of zero or more appended copies of the first argument prolog predicate solve/2 its f...	[ 0.004791259765625, 0.0172119140625, -0.0103759765625, 0.0211181640625, -0.02587890625, 0.0220947265625, -0.0181884765625, 0.0135498046875, 0.0242919921875, -0.0169677734375, 0.0255126953125, 0.002410888671875, 0.00689697265625, 0.016845703125, 0.005828857421875, 0.010498046875, 0.018...	[ 1653, 2063, 67, 86869, 12477, 5117, 10750, 351, 33548, 5303, 191633, 58055, 45234, 1286, 114689, 48141, 71200, 83, 502, 4867, 939, 84751, 142424, 60899, 98, 570, 54241, 53, 8561, 140992, 9077, 15400, 123087, 566, 959, 19048, 2046, 6024, 624...	[ 0.1751708984375, 0.215087890625, 0.1229248046875, 0.2354736328125, 0.248779296875, 0.1092529296875, 0.2474365234375, 0.047332763671875, 0.04974365234375, 0.1400146484375, 0.126953125, 0.02166748046875, 0.1240234375, 0.09185791015625, 0.0926513671875, 0.06085205078125, 0.1214599609375...	embed
6310330_c0	6310330	prolog	0	Title: Is Prolog an untyped language? What's the difference between Prolog and dynamically typed languages? Problem title: Is Prolog an untyped language? What's the difference between Prolog and dynamically typed languages? Tags: types, programming-languages, lisp, prolog, dynamic-typing Problem: Is Prolog an...	Is Prolog an untyped language? What's the difference between Prolog and dynamically typed languages? Is Prolog an untyped language? What's the difference between Prolog and dynamically typed languages? types programming-languages lisp prolog dynamic-typing Prolog What Is Prolog an untyped language? What's the...	[ 0.02783203125, 0.01007080078125, 0.03466796875, 0.01348876953125, -0.011962890625, -0.000946044921875, -0.004638671875, -0.00848388671875, -0.0126953125, -0.0186767578125, -0.01190185546875, -0.0194091796875, -0.019775390625, -0.01104736328125, 0.00634765625, 0.0177001953125, 0.00750...	[ 2071, 1250, 4867, 142, 51, 50986, 71, 46876, 60212, 17721, 84079, 10644, 52895, 56037, 196651, 400, 7008, 502, 46280, 34735, 149067, 79315, 101935, 34627, 5303, 217773, 45646, 35839, 129927, 1261, 80934, 242554, 79612, 309, 149201, 201939, 3751...	[ 0.01324462890625, 0.18896484375, 0.265625, 0.0294036865234375, 0.112060546875, 0.2215576171875, 0.04876708984375, 0.1885986328125, 0.14306640625, 0.0400390625, 0.2030029296875, 0.2169189453125, 0.158447265625, 0.088134765625, 0.1424560546875, 0.04498291015625, 0.14111328125, 0.0964...	embed
64403797_c1	64403797	prolog	1	(Q)). P Q R and(_26,_27) _26 my_not(_27) Check true true true true true false invalid true true false true true false invalid true false true false true true okay true false false false true true okay false true true false false false okay false true false false false false okay false false true false false true okay f...	(Q)). P Q R and(_26,_27) _26 my_not(_27) Check true true true true true false invalid true true false true true false invalid true false true false true true okay true false false false true true okay false true true false false false okay false true false false false false okay false false true false false true okay f...	[ 0.0034027099609375, 0.00341796875, -0.00433349609375, 0.0211181640625, -0.022705078125, 0.0189208984375, 0.0146484375, -0.017333984375, 0.0216064453125, 0.0125732421875, -0.0023651123046875, 0.0162353515625, 0.00689697265625, -0.004974365234375, 0.0002880096435546875, 0.01007080078125,...	[ 2737, 436, 2396, 627, 136, 4046, 4, 80847, 759, 10869, 38679, 29568, 98320, 56649, 68403, 110, 3444, 15549, 28282, 3525, 70731, 13, 831, 5646, 6626, 5303, 1653, 2063, 64881, 82424, 33342, 1884, 221, 23180, 122880, 29673, 21068, 19273, 18601...	[ 0.10589599609375, 0.0809326171875, 0.1160888671875, 0.10400390625, 0.0894775390625, 0.214111328125, 0.0037841796875, 0.216552734375, 0.12353515625, 0.21240234375, 0.2235107421875, 0.1982421875, 0.1884765625, 0.25537109375, 0.1756591796875, 0.05816650390625, 0.05438232421875, 0.2126...	embed
61018717_c0	61018717	prolog	0	Title: How to create condition for functor's argument in a rule - PROLOG Problem title: How to create condition for functor's argument in a rule - PROLOG Tags: prolog Problem: How to create condition for functor's argument in a rule - PROLOG I'm currently learning Prolog and I want to create a specific rule w...	How to create condition for functor's argument in a rule - PROLOG How to create condition for functor's argument in a rule - PROLOG prolog How PROLOG John Kate Carl Shining Horror Little Agents Family Frozen Animation can_borrow Age1 Age2 ERROR Arguments How to create condition for functor's argument in a rul...	[ 0.0194091796875, 0.0242919921875, -0.007720947265625, 0.03271484375, -0.0135498046875, 0.0147705078125, -0.0029296875, 0.013427734375, 0.006500244140625, -0.01385498046875, 0.01214599609375, -0.043212890625, 0.008056640625, -0.0028533935546875, 0.00299072265625, -0.0159912109375, 0.0...	[ 11249, 28282, 35431, 100, 7477, 18770, 3768, 10750, 23, 79986, 10514, 47510, 10, 502, 4867, 4939, 37958, 25075, 8294, 592, 189808, 59784, 54603, 59745, 70463, 187852, 831, 3422, 15555, 72944, 418, 304, 151206, 24638, 112140, 47, 25, 1250, 2...	[ 0.06146240234375, 0.19677734375, 0.271728515625, 0.07196044921875, 0.174560546875, 0.206298828125, 0.0677490234375, 0.27587890625, 0.072265625, 0.2130126953125, 0.09820556640625, 0.1729736328125, 0.015472412109375, 0.0047607421875, 0.1666259765625, 0.07720947265625, 0.114013671875, ...	embed
55093415_c0	55093415	prolog	0	Title: swi prolog 8.0.2 : gziped http Problem title: swi prolog 8.0.2 : gziped http Tags: logtalk, swi-prolog, gzip, http, prolog Problem: swi prolog 8.0.2 : gziped http I tried to make work a piece of code that opens an http connection. Nevertheless, web page may transfered as plain text or gziped. As a result, the co...	swi prolog 8.0.2 : gziped http swi prolog 8.0.2 : gziped http logtalk swi-prolog gzip http prolog user::catch user::http_open URL DataStream user::load_html Terms user::close user::open_any GZipDataStream CloseIt user::http:encoding_filter user::close_any swi prolog 8.0.2 : gziped http I tried to make work a piece of c...	[ -0.0033416748046875, 0.01806640625, 0.00665283203125, 0.00007772445678710938, 0.01226806640625, -0.004302978515625, -0.01324462890625, 0.015869140625, 0.0029754638671875, -0.05419921875, 0.01904296875, 0.01300048828125, -0.0291748046875, 0.0020904541015625, 0.0225830078125, 0.000026941...	[ 91, 2452, 502, 4867, 3217, 133684, 706, 708, 20051, 1621, 12684, 139109, 3454, 50836, 38937, 4460, 5475, 59636, 31862, 11809, 115061, 63033, 7693, 165504, 155648, 4848, 1511, 3442, 153335, 23389, 66332, 120337, 37842, 4488, 63847, 18151, 9803, ...	[ 0.04876708984375, 0.214111328125, 0.1380615234375, 0.2171630859375, 0.110595703125, 0.1878662109375, 0.06512451171875, 0.1976318359375, 0.1558837890625, 0.1861572265625, 0.07110595703125, 0.2066650390625, 0.1407470703125, 0.22509765625, 0.099365234375, 0.1041259765625, 0.108520507812...	embed
15997196_c1	15997196	prolog	1	is the arguments list of the main functor. I would the nth argument so I would the nth element in the ArgsList and to obtain it I define the element_n relation that take: ArgIndex, ArgsList, ValueArg. If I would the first element in the list the ArgIndex value is 1 and the base case it is matched: element_n(1,[ValueAr...	is the arguments list of the main functor. I would the nth argument so I would the nth element in the ArgsList and to obtain it I define the element_n relation that take: ArgIndex, ArgsList, ValueArg. If I would the first element in the list the ArgIndex value is 1 and the base case it is matched: element_n(1,[ValueAr...	[ 0.01544189453125, 0.0037994384765625, -0.0103759765625, -0.00830078125, -0.005279541015625, 0.014404296875, 0.0177001953125, 0.00897216796875, 0.0125732421875, -0.0262451171875, 0.021728515625, -0.0294189453125, -0.019287109375, 0.0076904296875, 0.00531005859375, -0.0205078125, 0.042...	[ 83, 70, 10750, 7, 5303, 111, 5201, 7477, 18770, 2806, 653, 927, 12830, 1172, 9405, 154663, 113054, 61924, 19, 41911, 5646, 177, 4153, 39659, 190060, 7614, 5117, 34292, 106, 3647, 7225, 14858, 41600, 856, 50770, 23, 10336, 51, 40383, 11782...	[ 0.087646484375, 0.020538330078125, 0.28076171875, 0.101806640625, 0.18017578125, 0.027191162109375, 0.1192626953125, 0.138427734375, 0.1883544921875, 0.169677734375, 0.1676025390625, 0.1517333984375, 0.1739501953125, 0.18310546875, 0.1619873046875, 0.2147216796875, 0.10614013671875, ...	embed
19276187_c0	19276187	prolog	0	Title: Finding algorithm to seek argument to satisfy given function's return Problem title: Finding algorithm to seek argument to satisfy given function's return Tags: algorithm, unification, functional-programming, f%23, prolog Problem: Finding algorithm to seek argument to satisfy given function's return I ...	Finding algorithm to seek argument to satisfy given function's return Finding algorithm to seek argument to satisfy given function's return algorithm unification functional-programming f%23 prolog Finding Given Finding algorithm to seek argument to satisfy given function's return I have this particular proble...	[ 0.00970458984375, 0.01556396484375, 0.006134033203125, 0.008056640625, -0.01318359375, 0.0003337860107421875, -0.0140380859375, -0.01007080078125, -0.0013427734375, -0.007568359375, 0.0004119873046875, -0.004730224609375, -0.0067138671875, 0.033447265625, 0.01043701171875, -0.013977050...	[ 26040, 214, 234873, 47, 40, 343, 10750, 40407, 53, 34475, 32354, 3768, 30646, 51, 41274, 123309, 28966, 1238, 3742, 502, 4867, 77878, 17311, 2967, 765, 29806, 14373, 4358, 3714, 32316, 62548, 16487, 100, 1632, 112397, 7413, 3387, 69236, 176...	[ 0.184814453125, 0.067626953125, 0.278076171875, 0.067138671875, 0.145751953125, 0.11962890625, 0.2998046875, 0.2027587890625, 0.08770751953125, 0.1553955078125, 0.1773681640625, 0.0816650390625, 0.2454833984375, 0.119873046875, 0.127685546875, 0.1116943359375, 0.1044921875, 0.02824...	embed
59451939_c0	59451939	prolog	0	Title: Cloning,Copying prolog list Problem title: Cloning,Copying prolog list Tags: clone, copy, prolog Problem: Cloning,Copying prolog list I found this piece of code everywhere for copying a list or cloning a list. Code found everywhere: clone([],[]). clone([H\|T],[H\|Z]):- clone(T,Z). ?-clone([1,2,3],Z). Z=[1,2,3] ?-c...	Cloning,Copying prolog list Cloning,Copying prolog list clone copy prolog Cloning Copying clone1 Cloning,Copying prolog list I found this piece of code everywhere for copying a list or cloning a list. Code found everywhere: This doesn't copy anything other than lists .The time complexity of the above code is O(n) . But...	[ -0.0147705078125, 0.018310546875, 0.001678466796875, 0.0115966796875, -0.0115966796875, -0.0142822265625, -0.00799560546875, -0.000339508056640625, 0.0106201171875, -0.02880859375, 0.015625, -0.013916015625, 0.01385498046875, -0.01611328125, 0.0177001953125, 0.0023040771484375, 0.015...	[ 51053, 592, 10625, 6493, 502, 4867, 5303, 20450, 86, 43658, 146930, 418, 14037, 63847, 18151, 219743, 28864, 3293, 22027, 18, 23937, 1733, 27140, 2481, 36917, 180, 19, 1250, 1927, 51, 40383, 7108, 60520, 5609, 59121, 5045, 8781, 1511, 12319...	[ 0.1632080078125, 0.08013916015625, 0.0645751953125, 0.119384765625, 0.14990234375, 0.2239990234375, 0.1534423828125, 0.1678466796875, 0.0965576171875, 0.1654052734375, 0.136962890625, 0.1016845703125, 0.030914306640625, 0.0164947509765625, 0.137939453125, 0.07073974609375, 0.13623046...	embed
23556166_c1	23556166	prolog	1	is X1,(Y2 is Y1 -1;Y2 is Y1+1; Y2 is Y1). neib(X1,Y1,X2,Y2) :- X2 is X1-1,(Y2 is Y1 -1;Y2 is Y1+1; Y2 is Y1). neib(X1,Y1,X2,Y2) :- X2 is X1+1,(Y2 is Y1 -1;Y2 is Y1+1; Y2 is Y1). notdiag(X1,Y1,X2,Y2) :- not(neib(X1,Y1,X2,Y2)). notdiag(X1,Y1,X2,Y2) :- neib(X1,Y1,X2,Y2),((X1 == X2,t(Y1,Y2));(Y1 == Y2,t(X1,X2))). notdiagl...	is X1,(Y2 is Y1 -1;Y2 is Y1+1; Y2 is Y1). neib(X1,Y1,X2,Y2) :- X2 is X1-1,(Y2 is Y1 -1;Y2 is Y1+1; Y2 is Y1). neib(X1,Y1,X2,Y2) :- X2 is X1+1,(Y2 is Y1 -1;Y2 is Y1+1; Y2 is Y1). notdiag(X1,Y1,X2,Y2) :- not(neib(X1,Y1,X2,Y2)). notdiag(X1,Y1,X2,Y2) :- neib(X1,Y1,X2,Y2),((X1 == X2,t(Y1,Y2));(Y1 == Y2,t(X1,X2))). notdiagl...	[ 0.00677490234375, 0.00372314453125, 0.0196533203125, 0.0037994384765625, -0.01031494140625, -0.01104736328125, -0.0147705078125, 0.0087890625, 0.010986328125, 0.006500244140625, 0.00634765625, 0.033447265625, 0.018798828125, 0.004852294921875, -0.00738525390625, 0.01556396484375, 0.0...	[ 83, 1193, 418, 1723, 304, 990, 68940, 74, 21748, 17727, 5, 108, 2566, 1542, 10461, 15772, 115727, 959, 3390, 177, 86, 69112, 18, 6562, 9874, 379, 10869, 808, 43719, 20268, 80836, 1511, 109637, 87, 33636, 11341, 5303, 108210, 12724, 78457,...	[ 0.1214599609375, 0.1434326171875, 0.1263427734375, 0.15185546875, 0.197021484375, 0.1417236328125, 0.1171875, 0.024627685546875, 0.1495361328125, 0.1160888671875, 0.00238037109375, 0.1007080078125, 0.2041015625, 0.122314453125, 0.1627197265625, 0.053009033203125, 0.1424560546875, 0...	embed
50026553_c0	50026553	prolog	0	Title: Get all Prefixes of a List, including [] in Prolog Problem title: Get all Prefixes of a List, including [] in Prolog Tags: prolog Problem: Get all Prefixes of a List, including [] in Prolog I am new to Prolog and wanted to start learning the functionality of [H\|T] by trying to write the prefix function on my own...	Get all Prefixes of a List, including [] in Prolog Get all Prefixes of a List, including [] in Prolog prolog Get Prefixes List Prolog Get all Prefixes of a List, including [] in Prolog I am new to Prolog and wanted to start learning the functionality of [H\|T] by trying to write the prefix function on my own. The prefix...	[ 0.00098419189453125, -0.0035400390625, 0.0242919921875, -0.000782012939453125, -0.004974365234375, -0.011962890625, -0.00238037109375, -0.011962890625, 0.00408935546875, -0.0260009765625, 0.020751953125, -0.01416015625, -0.00494384765625, 0.0184326171875, -0.004150390625, 0.01196289062...	[ 20779, 756, 1914, 55923, 90, 111, 32036, 26719, 378, 23, 1250, 4867, 502, 3525, 52080, 123309, 841, 58745, 618, 33022, 183114, 32354, 10002, 30646, 7722, 5303, 339, 2203, 2806, 238, 55681, 5941, 12921, 51347, 65450, 10336, 46741, 1747, 1763...	[ 0.109130859375, 0.1812744140625, 0.15771484375, 0.272216796875, 0.1329345703125, 0.1326904296875, 0.2120361328125, 0.053924560546875, 0.088623046875, 0.033203125, 0.1597900390625, 0.209716796875, 0.1231689453125, 0.000244140625, 0.03607177734375, 0.1234130859375, 0.077392578125, 0....	embed
43091565_c0	43091565	prolog	0	Title: How to get a rule to check all the conditions before exiting? Problem title: How to get a rule to check all the conditions before exiting? Tags: prolog Problem: How to get a rule to check all the conditions before exiting? I'm trying to write a predicate weird_sum(List, Result) which takes a List of numbers, and...	How to get a rule to check all the conditions before exiting? How to get a rule to check all the conditions before exiting? prolog How weird_sum List Result Head Tail How to get a rule to check all the conditions before exiting? I'm trying to write a predicate weird_sum(List, Result) which takes a List of numbers, and ...	[ -0.00084686279296875, 0.01080322265625, 0.000263214111328125, 0.01611328125, 0.006927490234375, 0.038330078125, -0.01165771484375, 0.0234375, 0.0242919921875, -0.00714111328125, 0.02294921875, 0.0004711151123046875, 0.007293701171875, 0.007232666015625, 0.011962890625, -0.001953125, ...	[ 11249, 2046, 10, 79986, 47, 12765, 756, 27289, 8108, 82230, 214, 502, 4867, 179459, 454, 11832, 32036, 126684, 44816, 1218, 379, 70, 31577, 33022, 1653, 2063, 67, 154663, 101935, 7077, 10554, 108047, 5303, 117396, 105950, 190, 26948, 89931, ...	[ 0.0628662109375, 0.1021728515625, 0.0745849609375, 0.2132568359375, 0.056732177734375, 0.2308349609375, 0.098388671875, 0.251953125, 0.1307373046875, 0.1917724609375, 0.10552978515625, 0.09783935546875, 0.1202392578125, 0.185302734375, 0.0234527587890625, 0.2294921875, 0.16455078125,...	embed
38543599_c1	38543599	prolog	1	,7,3] D = [3, 6, 7, 8, 2, 4, 5, 6, 9\|...], Bs = [bump([9], [9]), bump([2, 3, 4], [6, 7, 8])] ; [3,6,7,8,2,4,5,6,9,4,7,3] D = [3, 6, 7, 8, 2, 4, 5, 6, 9\|...], Bs = [bump([11], [7]), bump([2, 3, 4], [6, 7, 8])] ; [3,6,7,8,2,4,5,6,9,4,7,3] D = [3, 6, 7, 8, 2, 4, 5, 6, 9\|...], Bs = [bump([2, 3, 4], [6, 7, 8])] ; etc The id...	,7,3] D = [3, 6, 7, 8, 2, 4, 5, 6, 9\|...], Bs = [bump([9], [9]), bump([2, 3, 4], [6, 7, 8])] ; [3,6,7,8,2,4,5,6,9,4,7,3] D = [3, 6, 7, 8, 2, 4, 5, 6, 9\|...], Bs = [bump([11], [7]), bump([2, 3, 4], [6, 7, 8])] ; [3,6,7,8,2,4,5,6,9,4,7,3] D = [3, 6, 7, 8, 2, 4, 5, 6, 9\|...], Bs = [bump([2, 3, 4], [6, 7, 8])] ; etc The id...	[ 0.00640869140625, 0.01397705078125, -0.006195068359375, 0.0211181640625, 0.008056640625, 0.04248046875, -0.00433349609375, -0.00174713134765625, 0.0238037109375, -0.0208740234375, 0.0003490447998046875, -0.00154876708984375, 0.01104736328125, 0.0050048828125, 0.0035400390625, 0.0178222...	[ 4, 966, 96386, 391, 2203, 122101, 305, 361, 382, 116, 201, 190, 483, 75606, 335, 7, 978, 2676, 132, 55737, 6, 247, 373, 304, 138, 268, 910, 16, 136005, 80389, 171379, 108368, 73068, 117221, 1065, 2819, 378, 3021, 6528, 83, 442, 1221, ...	[ 0.05328369140625, 0.1339111328125, 0.2548828125, 0.226806640625, 0.1270751953125, 0.0987548828125, 0.177978515625, 0.154052734375, 0.2081298828125, 0.08380126953125, 0.207275390625, 0.168701171875, 0.181640625, 0.042449951171875, 0.102783203125, 0.0985107421875, 0.1444091796875, 0....	embed
16287495_c0	16287495	prolog	0	Title: Searching a node of a binary tree in Prolog Problem title: Searching a node of a binary tree in Prolog Tags: prolog Problem: Searching a node of a binary tree in Prolog A beginner in Prolog,working with binary trees for some hours.But as a newcomer in Prolog world,a little bit confused about it's working procedu...	Searching a node of a binary tree in Prolog Searching a node of a binary tree in Prolog prolog Searching Prolog count_nodes Searching a node of a binary tree in Prolog A beginner in Prolog,working with binary trees for some hours.But as a newcomer in Prolog world,a little bit confused about it's working procedure. I do...	[ 0.027587890625, -0.01446533203125, 0.006011962890625, 0.014404296875, 0.01397705078125, 0.0108642578125, -0.0150146484375, -0.01373291015625, 0.007049560546875, -0.0615234375, 0.000431060791015625, -0.050537109375, 0.00506591796875, 0.0137939453125, 0.031982421875, -0.01348876953125, ...	[ 33086, 110, 112, 2394, 6635, 53201, 1250, 4867, 502, 54529, 157, 988, 1679, 174796, 1360, 21974, 277, 8999, 55681, 20697, 50491, 18151, 3173, 3034, 1528, 140992, 1884, 237, 384, 42518, 541, 33636, 14012, 29479, 157318, 53088, 391, 36381, 74...	[ 0.177978515625, 0.1622314453125, 0.13720703125, 0.149658203125, 0.0966796875, 0.203369140625, 0.153564453125, 0.222412109375, 0.085205078125, 0.140869140625, 0.14794921875, 0.139404296875, 0.0274200439453125, 0.0215606689453125, 0.1102294921875, 0.032379150390625, 0.0268402099609375,...	embed
53477195_c0	53477195	prolog	0	Title: Prolog: Order of clauses for finding path in graph Problem title: Prolog: Order of clauses for finding path in graph Tags: prolog Problem: Prolog: Order of clauses for finding path in graph I have a cyclic graph with entry and exit nodes for which I want to find out all paths leading from any entry to any exit n...	Prolog: Order of clauses for finding path in graph Prolog: Order of clauses for finding path in graph prolog Prolog Order Cycle path2 Prolog: Order of clauses for finding path in graph I have a cyclic graph with entry and exit nodes for which I want to find out all paths leading from any entry to any exit node. My path...	[ 0.02783203125, 0.0084228515625, 0.01031494140625, 0.02392578125, -0.005401611328125, 0.027587890625, -0.0038604736328125, -0.016845703125, 0.0137939453125, -0.029296875, 0.000392913818359375, 0.005828857421875, -0.0228271484375, 0.002197265625, 0.0230712890625, 0.017333984375, -0.014...	[ 1250, 4867, 81206, 111, 70731, 90, 90791, 60875, 41382, 23, 502, 151612, 304, 187830, 42805, 82230, 110, 988, 3444, 7413, 1810, 756, 105207, 1653, 2063, 67, 43240, 6782, 65042, 238, 12765, 2174, 3525, 7722, 112, 21771, 5303, 36997, 15190, ...	[ 0.1405029296875, 0.2254638671875, 0.1619873046875, 0.0767822265625, 0.162109375, 0.0723876953125, 0.115478515625, 0.2291259765625, 0.183349609375, 0.043792724609375, 0.0701904296875, 0.114013671875, 0.1224365234375, 0.1136474609375, 0.1221923828125, 0.12060546875, 0.11279296875, 0....	embed
32352501_c0	32352501	prolog	0	Title: Extracting the 'speso(A, Y, Z)' line from database for further processing Problem title: Extracting the 'speso(A, Y, Z)' line from database for further processing Tags: list, prolog Problem: Extracting the 'speso(A, Y, Z)' line from database for further processing I have this database: g([dat...	Extracting the 'speso(A, Y, Z)' line from database for further processing Extracting the 'speso(A, Y, Z)' line from database for further processing list prolog database Extracting pzzaDelGesu47 Date Month ListOfSpese Tail Acc Res Amount What WhichCar Extracting the 'speso(A, Y, Z)' line from databas...	[ -0.0026092529296875, -0.0025787353515625, -0.00823974609375, 0.01043701171875, -0.01336669921875, 0.004364013671875, -0.01043701171875, 0.00799560546875, 0.01251220703125, -0.028564453125, 0.01220703125, -0.011962890625, -0.0164794921875, -0.0177001953125, -0.0006256103515625, 0.029907...	[ 31501, 238, 1916, 3768, 9217, 991, 284, 990, 567, 13315, 1295, 63399, 53333, 9433, 5303, 502, 4867, 7070, 58598, 10429, 1159, 13330, 25512, 12982, 32036, 132887, 31923, 7717, 1218, 379, 29899, 9624, 121147, 130078, 21851, 4, 903, 3444, 1256...	[ 0.16650390625, 0.0797119140625, 0.0175933837890625, 0.0855712890625, 0.171875, 0.1884765625, 0.115478515625, 0.1541748046875, 0.1793212890625, 0.1585693359375, 0.0743408203125, 0.170654296875, 0.07354736328125, 0.0887451171875, 0.09539794921875, 0.0999755859375, 0.1571044921875, 0....	embed
33322185_c0	33322185	prolog	0	Title: How to get a list with all the possible combinations of the elements inside another list? Problem title: How to get a list with all the possible combinations of the elements inside another list? Tags: list, prolog Problem: How to get a list with all the possible combinations of the elements inside another list? ...	How to get a list with all the possible combinations of the elements inside another list? How to get a list with all the possible combinations of the elements inside another list? list prolog How How to get a list with all the possible combinations of the elements inside another list? I have a list that has as elements...	[ -0.0050048828125, 0.02978515625, 0.00469970703125, 0.0242919921875, -0.01043701171875, 0.00811767578125, -0.0155029296875, 0.0157470703125, -0.00408935546875, -0.03564453125, 0.00335693359375, 0.01434326171875, 0.0162353515625, 0.0205078125, -0.011962890625, 0.0224609375, 0.014953613...	[ 11249, 47, 2046, 10, 5303, 678, 756, 70, 7722, 162515, 7, 80854, 46132, 15700, 502, 4867, 111, 237, 34627, 3789, 26458, 3444, 19759, 7639, 11907, 43581, 29806, 17106, 5875, 12765, 2174, 1193, 83, 959, 64457, 20949, 425, 304, 2203, 1022, ...	[ 0.1011962890625, 0.0653076171875, 0.1513671875, 0.06854248046875, 0.2366943359375, 0.136474609375, 0.1270751953125, 0.06451416015625, 0.20654296875, 0.2103271484375, 0.070068359375, 0.1898193359375, 0.134765625, 0.13330078125, 0.059906005859375, 0.1339111328125, 0.027191162109375, ...	embed
21864920_c0	21864920	prolog	0	Title: Iterating through a list of lists (without flattening) Problem title: Iterating through a list of lists (without flattening) Tags: iteration, list, prolog Problem: Iterating through a list of lists (without flattening) I have the following list of lists: listObj = [ [ obj1(_) , obj2(_) , obj1(_) , obj2(_) , obj1...	Iterating through a list of lists (without flattening) Iterating through a list of lists (without flattening) iteration list prolog Iterating obj1 obj2 obj3 Iterating through a list of lists (without flattening) I have the following list of lists: This list will always be a 6x6 matrix, and I need to iterate through thi...	[ 0.0189208984375, -0.0020751953125, -0.0012664794921875, 0.01116943359375, 0.007049560546875, -0.00159454345703125, -0.00927734375, 0.0167236328125, 0.00732421875, -0.0146484375, -0.01123046875, -0.0233154296875, 0.01123046875, -0.0223388671875, -0.00665283203125, 0.007171630859375, -...	[ 87, 67, 98767, 8305, 5303, 7, 6056, 49878, 17, 720, 2320, 502, 4867, 995, 170, 363, 25632, 11343, 305, 910, 50944, 425, 3871, 8560, 112033, 15555, 136, 316, 14012, 12638, 12830, 27875, 4527, 70731, 159029, 40956, 100094, 510, 12477, 4358,...	[ 0.05224609375, 0.1810302734375, 0.1416015625, 0.162109375, 0.2301025390625, 0.025787353515625, 0.07257080078125, 0.189453125, 0.0596923828125, 0.2171630859375, 0.00872802734375, 0.10205078125, 0.15869140625, 0.06756591796875, 0.05877685546875, 0.050201416015625, 0.0052490234375, 0....	embed
13977220_c1	13977220	prolog	1	is different. So that the head of the rule is verified, all the predicates in it's body have to be true... I think that my idea is good until reaching the base case, in fact doing: L1 = [_\|T], /* It is always true / concatena(T,L2,L3) / Call recursively on a subproblem of the original problem, this problem have one ...	is different. So that the head of the rule is verified, all the predicates in it's body have to be true... I think that my idea is good until reaching the base case, in fact doing: L1 = [_\|T], /* It is always true / concatena(T,L2,L3) / Call recursively on a subproblem of the original problem, this problem have one ...	[ 0.007232666015625, -0.00141143798828125, 0.01361083984375, 0.0250244140625, -0.0004787445068359375, -0.006011962890625, -0.0184326171875, 0.01287841796875, 0.028076171875, -0.037841796875, 0.015625, 0.00860595703125, -0.000629425048828125, 0.00830078125, 0.005615234375, 0.0065002441406...	[ 83, 12921, 1061, 450, 10336, 111, 79986, 493, 47314, 756, 1653, 2063, 1636, 14361, 765, 47, 186, 29568, 5351, 759, 6528, 4127, 24189, 58359, 3647, 7225, 15824, 20594, 339, 418, 2203, 58745, 618, 1650, 11343, 158, 33478, 76, 866, 304, 21...	[ 0.0836181640625, 0.2369384765625, 0.0207366943359375, 0.0146484375, 0.1630859375, 0.0180206298828125, 0.2138671875, 0.1619873046875, 0.1871337890625, 0.0640869140625, 0.148681640625, 0.1878662109375, 0.068603515625, 0.1387939453125, 0.0367431640625, 0.03582763671875, 0.0709228515625,...	embed
60387784_c1	60387784	prolog	1	1], [day2, fruit2, nut2], [day3, fruit3, nut3], [day4, fruit4, nut4], [day5, fruit5, nut5]], Days = [monday, tuesday, wednesday, thursday, friday], Days = [day1, day2, day3, day4, day5], Fruits = [apple,banana,pear,mango,apricot], permutation(Fruits, [fruit1, fruit2, fruit3, fruit4, fruit5]), Nuts = [almonds,pecans,cas...	1], [day2, fruit2, nut2], [day3, fruit3, nut3], [day4, fruit4, nut4], [day5, fruit5, nut5]], Days = [monday, tuesday, wednesday, thursday, friday], Days = [day1, day2, day3, day4, day5], Fruits = [apple,banana,pear,mango,apricot], permutation(Fruits, [fruit1, fruit2, fruit3, fruit4, fruit5]), Nuts = [almonds,pecans,cas...	[ 0.01312255859375, 0.0206298828125, 0.00958251953125, 0.032958984375, -0.022216796875, 0.01055908203125, -0.0267333984375, 0.00885009765625, 0.00640869140625, -0.002685546875, -0.00970458984375, 0.02685546875, -0.00811767578125, 0.01361083984375, -0.0106201171875, 0.0076904296875, -0....	[ 106, 268, 4, 5636, 304, 41896, 54806, 90173, 363, 96386, 617, 758, 86245, 97292, 2203, 119720, 53, 370, 90, 642, 10952, 4911, 4295, 5129, 418, 5155, 151958, 9007, 133, 105281, 11, 1081, 147, 669, 519, 2631, 35297, 117, 561, 22062, 919, ...	[ 0.104248046875, 0.0394287109375, 0.07244873046875, 0.158203125, 0.13330078125, 0.2186279296875, 0.18798828125, 0.0806884765625, 0.102294921875, 0.0633544921875, 0.103759765625, 0.1729736328125, 0.0645751953125, 0.23388671875, 0.1224365234375, 0.14892578125, 0.1676025390625, 0.07177...	embed
23080905_c0	23080905	prolog	0	Title: Prolog traverse list for adjacent positions Problem title: Prolog traverse list for adjacent positions Tags: prolog, list, conditional-statements Problem: Prolog traverse list for adjacent positions I'm programming a pacman AI (yes it's homework), however I'm fairly new and I want to find all the adjacent positi...	Prolog traverse list for adjacent positions Prolog traverse list for adjacent positions prolog list conditional-statements Prolog X-1 Y-1 find_adjacent add_to_new_list Prolog traverse list for adjacent positions I'm programming a pacman AI (yes it's homework), however I'm fairly new and I want to find all the adjacent ...	[ -0.0184326171875, 0.00994873046875, 0.0166015625, 0.013427734375, -0.0155029296875, 0.01904296875, -0.0087890625, 0.04345703125, 0.004974365234375, -0.031494140625, 0.0096435546875, 0.0223388671875, 0.00078582763671875, 0.01171875, -0.00958251953125, 0.005859375, 0.003265380859375, ...	[ 1250, 4867, 37317, 13, 5303, 123594, 16797, 19069, 502, 35431, 289, 61340, 1193, 5759, 990, 7413, 712, 145, 15190, 188, 54936, 6562, 56037, 38595, 669, 38730, 5368, 18244, 3525, 3444, 756, 7565, 25737, 7108, 43581, 4092, 17366, 47, 87388, ...	[ 0.1617431640625, 0.2435302734375, 0.1697998046875, 0.09222412109375, 0.1761474609375, 0.2064208984375, 0.2381591796875, 0.200927734375, 0.1090087890625, 0.1195068359375, 0.02044677734375, 0.103515625, 0.05596923828125, 0.0863037109375, 0.0814208984375, 0.103271484375, 0.0553588867187...	embed
53695198_c0	53695198	prolog	0	Title: Problem with recursive predicate on Prolog Problem title: Problem with recursive predicate on Prolog Tags: prolog Problem: Problem with recursive predicate on Prolog Goal a(3, X) should return 6 . Based on this code. I have converted it to Prolog code but with a problem in a recursive predicate. First two lines ...	Problem with recursive predicate on Prolog Problem with recursive predicate on Prolog prolog Problem Prolog c-1 Call _1238 Fail Redo Exit _1474 _1480 _1486 _1492 SHOULD STOP HERE Problem with recursive predicate on Prolog Goal a(3, X) should return 6 . Based on this code. I have converted it to Prolog code but with a p...	[ -0.007080078125, 0.005645751953125, 0.00848388671875, 0.0045166015625, 0.004669189453125, -0.000858306884765625, 0.0185546875, 0.015869140625, 0.0025482177734375, -0.01904296875, 0.00811767578125, 0.002166748046875, -0.0302734375, -0.004241943359375, 0.017578125, -0.00689697265625, 0...	[ 15649, 195625, 5844, 1653, 2063, 67, 98, 1250, 4867, 678, 502, 501, 5759, 26265, 1530, 10991, 190355, 6096, 31, 5443, 217, 2592, 16360, 4836, 15276, 12231, 159, 70675, 65791, 2016, 289, 10, 86827, 4, 1193, 5608, 30646, 305, 18151, 117176,...	[ 0.168701171875, 0.260009765625, 0.1744384765625, 0.2108154296875, 0.2294921875, 0.1038818359375, 0.06756591796875, 0.1741943359375, 0.2646484375, 0.032501220703125, 0.1126708984375, 0.005584716796875, 0.0821533203125, 0.1451416015625, 0.035614013671875, 0.155029296875, 0.180908203125...	embed
41203940_c1	41203940	prolog	1	X1, X2 ), down1( Y1, Y2 ). up1( U, V ) :- successor( U, V ). up2( U, W ) :- successor( U, V ), successor( V, W ). down1( U, V ) :- up1( V, U ). down2( U, V ) :- up2( V, U ). successor( 1, 2 ). successor( 2, 3 ). successor( 3, 4 ). successor( 4, 5 ). edge((X1,Y1) , (X2,Y2)) :- move1( (X1,Y1), (X2,Y2) ). path((X1,Y1), (...	X1, X2 ), down1( Y1, Y2 ). up1( U, V ) :- successor( U, V ). up2( U, W ) :- successor( U, V ), successor( V, W ). down1( U, V ) :- up1( V, U ). down2( U, V ) :- up2( V, U ). successor( 1, 2 ). successor( 2, 3 ). successor( 3, 4 ). successor( 4, 5 ). edge((X1,Y1) , (X2,Y2)) :- move1( (X1,Y1), (X2,Y2) ). path((X1,Y1), (...	[ 0.0113525390625, 0.01251220703125, 0.016845703125, 0.01202392578125, -0.001800537109375, 0.012939453125, -0.008056640625, 0.000759124755859375, 0.01312255859375, -0.03759765625, 0.0086669921875, -0.0086669921875, -0.0093994140625, -0.00604248046875, 0.004302978515625, 0.0103759765625, ...	[ 1193, 418, 4, 304, 247, 7565, 990, 194, 1257, 345, 310, 15772, 39457, 42, 601, 106, 116, 138, 201, 190, 121303, 1542, 1723, 17727, 10461, 25813, 60875, 839, 541, 977, 757, 363, 21320, 76172, 5759, 351, 39, 27417, 16610, 525, 683, 2357...	[ 0.14306640625, 0.1258544921875, 0.036956787109375, 0.1888427734375, 0.060333251953125, 0.1893310546875, 0.130859375, 0.05078125, 0.1590576171875, 0.1456298828125, 0.1995849609375, 0.1087646484375, 0.2296142578125, 0.1407470703125, 0.1031494140625, 0.01995849609375, 0.0064697265625, ...	embed
23189952_c1	23189952	prolog	1	1 is a permutation of List2 if each element occurs in both lists % the same number of times permutationQ(List, [Head\|Tail]) :- selectE(Head, List, Rest), permutationQ(Rest, Tail). % % There are 5 colors - 2 blues, 2 greens, 1 yellow % sit1 :- permutationQ([green,green,blue,blue,yellow],[A,B,C,D,E]), \+ A=B, \+ B=C, \+ ...	1 is a permutation of List2 if each element occurs in both lists % the same number of times permutationQ(List, [Head\|Tail]) :- selectE(Head, List, Rest), permutationQ(Rest, Tail). % % There are 5 colors - 2 blues, 2 greens, 1 yellow % sit1 :- permutationQ([green,green,blue,blue,yellow],[A,B,C,D,E]), \+ A=B, \+ B=C, \+ ...	[ -0.007415771484375, 0.00653076171875, 0.0106201171875, -0.01031494140625, -0.00811767578125, -0.005706787109375, -0.045166015625, -0.000396728515625, 0.02587890625, 0.019775390625, 0.004486083984375, 0.0159912109375, 0.028564453125, -0.0023345947265625, -0.02197265625, 0.00418090820312...	[ 106, 83, 10, 117, 561, 22062, 111, 32036, 304, 2174, 12638, 12830, 74918, 7, 23, 15044, 5303, 1745, 70, 5701, 14012, 20028, 2737, 154663, 13025, 712, 58745, 9874, 379, 268, 16, 15772, 36849, 647, 49756, 1052, 525, 1218, 8622, 621, 190, ...	[ 0.1422119140625, 0.078125, 0.04296875, 0.1435546875, 0.2298583984375, 0.1424560546875, 0.0802001953125, 0.2105712890625, 0.1561279296875, 0.047027587890625, 0.08343505859375, 0.179931640625, 0.1668701171875, 0.0101318359375, 0.055908203125, 0.1141357421875, 0.2276611328125, 0.06359...	embed
13913898_c0	13913898	prolog	0	Title: Prolog programs - how to make it work? Problem title: Prolog programs - how to make it work? Tags: prolog Problem: Prolog programs - how to make it work? I have these two programs and they're not working as they should. The first without_doubles_2(Xs, Ys)is supposed to show that it is true if Ys is the list of t...	Prolog programs - how to make it work? Prolog programs - how to make it work? prolog Prolog without_doubles_2 without_doubles_21 Prolog programs - how to make it work? I have these two programs and they're not working as they should. The first without_doubles_2(Xs, Ys)is supposed to show that it is true if Ys is the li...	[ 0.0003604888916015625, 0.0262451171875, 0.01519775390625, 0.0174560546875, -0.022705078125, 0.03173828125, -0.00122833251953125, 0.00164031982421875, 0.01104736328125, -0.00604248046875, 0.01953125, 0.004547119140625, 0.00909423828125, -0.01708984375, 0.00341796875, 0.0167236328125, ...	[ 1250, 4867, 103391, 3642, 3249, 442, 4488, 47, 502, 15490, 21555, 13566, 304, 3117, 6097, 6626, 959, 20697, 237, 5608, 5117, 1542, 4, 990, 7, 134598, 7639, 29568, 2174, 5303, 80854, 108975, 1193, 115, 182867, 39531, 12989, 171763, 142424, ...	[ 0.169677734375, 0.2447509765625, 0.214111328125, 0.08367919921875, 0.09375, 0.06512451171875, 0.139404296875, 0.029876708984375, 0.1170654296875, 0.173828125, 0.1165771484375, 0.1806640625, 0.1448974609375, 0.150634765625, 0.023834228515625, 0.1146240234375, 0.0682373046875, 0.1134...	embed
33692335_c0	33692335	prolog	0	Title: Prolog, permutation code understanding Problem title: Prolog, permutation code understanding Tags: prolog, list Problem: Prolog, permutation code understanding I'm trying to understand how this program works. Code from Daniel Lyons' solution(from the link above) takeout(X,[X\|R],R). takeout(X,[F \|R],[F\|S]) :- tak...	Prolog, permutation code understanding Prolog, permutation code understanding prolog list Prolog Prolog, permutation code understanding I'm trying to understand how this program works. Code from Daniel Lyons' solution(from the link above) I'm trying ti understand how it works with this list [1,2,3] So, I have perm([1,2...	[ 0.01904296875, 0.016357421875, 0.02392578125, 0.01519775390625, -0.00107574462890625, 0.019287109375, -0.038330078125, 0.0004367828369140625, 0.00994873046875, -0.004974365234375, -0.001861572265625, -0.0113525390625, 0.007476806640625, 0.01190185546875, -0.013671875, 0.007568359375, ...	[ 1250, 4867, 117, 561, 22062, 18151, 100094, 4, 502, 5303, 31577, 28219, 3642, 903, 1528, 43240, 28864, 11555, 99839, 29806, 1053, 678, 155761, 765, 39, 133063, 96386, 1542, 23468, 5117, 990, 50740, 35839, 76199, 1821, 601, 2203, 5646, 6056,...	[ 0.2081298828125, 0.26171875, 0.185791015625, 0.1861572265625, 0.057159423828125, 0.182373046875, 0.1376953125, 0.00360107421875, 0.1639404296875, 0.1634521484375, 0.02801513671875, 0.13916015625, 0.0257568359375, 0.0186920166015625, 0.16064453125, 0.136474609375, 0.1231689453125, 0...	embed
34011930_c0	34011930	prolog	0	Title: prolog - not a function warning Problem title: prolog - not a function warning Tags: prolog Problem: prolog - not a function warning I have this Prolog program where I want to match players with players with the same level (newbie, intermediate, or expert) and server: player(player29, 408, 183, europe). player(p...	prolog - not a function warning prolog - not a function warning prolog player29 player30 player31 player32 player33 player34 player35 player36 player37 player38 player39 player40 player41 player42 player43 player44 player45 player46 player47 player48 player49 player50 prolog - not a function warning I have this Prolog ...	[ 0.0034637451171875, -0.0167236328125, 0.0206298828125, -0.004486083984375, -0.00762939453125, 0.0107421875, -0.037109375, -0.00872802734375, 0.001739501953125, -0.000797271728515625, 0.017578125, 0.0140380859375, 0.00848388671875, -0.011474609375, 0.0186767578125, -0.007171630859375, ...	[ 502, 4867, 959, 10, 32354, 1631, 592, 58585, 4235, 1197, 5016, 9185, 10289, 5843, 10945, 12465, 4633, 9271, 13330, 9285, 12977, 2525, 1250, 1528, 3444, 14858, 92865, 678, 5701, 17366, 54936, 9014, 81814, 26808, 10723, 7614, 8962, 282, 9523,...	[ 0.17041015625, 0.255615234375, 0.18798828125, 0.08685302734375, 0.190673828125, 0.11474609375, 0.056976318359375, 0.1107177734375, 0.1710205078125, 0.0380859375, 0.004302978515625, 0.0146484375, 0.0240631103515625, 0.012603759765625, 0.007537841796875, 0.034210205078125, 0.0169677734...	embed
9650435_c0	9650435	prolog	0	Title: Variable Summation Problem title: Variable Summation Tags: constraint-programming, prolog Problem: Variable Summation How do you do a variable summation in the constraint programming language ECLiPSe ( http://www.eclipseclp.org/examples/ )? I'm attempting to get this functionality: :- lib(ic). % include the stan...	Variable Summation Variable Summation constraint-programming prolog the Variable Summation branch_and_bound ic_edge_finder sum1 _1187 Variable Summation How do you do a variable summation in the constraint programming language ECLiPSe ( http://www.eclipseclp.org/examples/ )? I'm attempting to get this functionality: An...	[ 0.00274658203125, -0.0123291015625, 0.01312255859375, 0.0172119140625, -0.008056640625, 0.004547119140625, -0.0128173828125, 0.01251220703125, 0.00185394287109375, -0.03564453125, -0.003936767578125, -0.005615234375, 0.00927734375, -0.00482177734375, 0.00872802734375, 0.004180908203125...	[ 84572, 2886, 131150, 1363, 158, 2816, 4288, 28966, 502, 4867, 32845, 206, 2940, 99091, 1771, 297, 429, 168719, 10554, 418, 19308, 11249, 54, 10, 77336, 29334, 23, 56037, 46876, 59947, 9506, 9059, 13, 106371, 39797, 26775, 3355, 302, 99726, ...	[ 0.189697265625, 0.14453125, 0.275146484375, 0.1700439453125, 0.085205078125, 0.214599609375, 0.1416015625, 0.1029052734375, 0.107666015625, 0.1632080078125, 0.07049560546875, 0.02545166015625, 0.04095458984375, 0.14208984375, 0.029083251953125, 0.07183837890625, 0.07086181640625, 0...	embed
53936340_c0	53936340	prolog	0	Title: Asserted data is different Problem title: Asserted data is different Tags: swi-prolog, prolog Problem: Asserted data is different I'm learning Prolog on my own. I have a text file which looks like this: table("0","Nicosia 2013 VulkÃ Bianco (Etna)","Italy","White Blend","14","Kerin Oâ€™Keefe","87"). table("1","Qu...	Asserted data is different Asserted data is different swi-prolog prolog Asserted Nicosia Bianco Etna Italy White Blend Kerin Keefe Quinta Avidagos Red Douro Portugal Portuguese Roger Voss Rainstorm Pinot Gris Willamette Valley Paul Gregutt Julian Reserve Late Harvest Riesling Lake Michigan Shore Alexander Peartree load...	[ 0.02783203125, -0.01318359375, -0.0054931640625, 0.0185546875, -0.006988525390625, 0.00823974609375, 0.004180908203125, 0.027099609375, -0.00311279296875, 0.002471923828125, -0.000614166259765625, 0.019775390625, -0.0255126953125, -0.005706787109375, 0.0230712890625, 0.0198974609375, ...	[ 62, 16865, 3674, 2053, 83, 12921, 91, 2452, 3454, 4867, 502, 86653, 3478, 241461, 1775, 76, 98848, 22392, 193924, 7354, 73, 1345, 13, 2242, 72742, 11, 28462, 8797, 6096, 984, 11951, 15604, 82528, 21325, 48861, 72476, 7, 82507, 129857, 148...	[ 0.1026611328125, 0.286865234375, 0.1778564453125, 0.2421875, 0.1416015625, 0.29296875, 0.051910400390625, 0.225830078125, 0.170166015625, 0.264892578125, 0.18603515625, 0.174072265625, 0.189453125, 0.2010498046875, 0.1475830078125, 0.127197265625, 0.1536865234375, 0.1220703125, 0...	embed
25687294_c0	25687294	prolog	0	Title: Compiled program cannot find a library Problem title: Compiled program cannot find a library Tags: linux, prolog, swi-prolog Problem: Compiled program cannot find a library First of all: I'm a total newbie. I have a compiled program that raises this error: ERROR: pl2xpce: cannot open shared object file: No such ...	Compiled program cannot find a library Compiled program cannot find a library linux prolog swi-prolog this Compiled ERROR pl2xpce Failed XPCE X11 See www.swi-prolog.org xpce.html Sorry Process amd64 pl2xpce.so Compiled program cannot find a library First of all: I'm a total newbie. I have a compiled program that raises...	[ 0.01165771484375, 0.0115966796875, -0.01177978515625, 0.01177978515625, -0.015869140625, 0.01708984375, 0.0028533935546875, 0.002197265625, -0.01239013671875, -0.04736328125, 0.007476806640625, -0.010498046875, -0.0159912109375, 0.0084228515625, -0.0028076171875, -0.0096435546875, 0....	[ 15612, 14, 6259, 1528, 53418, 7413, 10, 35773, 1294, 11508, 6077, 502, 4867, 91, 2452, 3454, 903, 151206, 24638, 6456, 304, 425, 254, 329, 190355, 45005, 10854, 1193, 1662, 1022, 123996, 444, 13307, 991, 3622, 9014, 375, 5974, 138804, 184...	[ 0.1220703125, 0.12255859375, 0.0709228515625, 0.1649169921875, 0.1588134765625, 0.1839599609375, 0.043731689453125, 0.2227783203125, 0.1422119140625, 0.056365966796875, 0.05157470703125, 0.09222412109375, 0.1728515625, 0.027496337890625, 0.217529296875, 0.1365966796875, 0.03897094726...	embed
31171610_c0	31171610	prolog	0	Title: definite clause grammar (dcg) Prolog (homework) Problem title: definite clause grammar (dcg) Prolog (homework) Tags: dcg, prolog Problem: definite clause grammar (dcg) Prolog (homework) i tried to write a predicate and N={Expression,Number,Digit,Operator,Variable} T={1,2,3,+,-,*,(,),X,Y,Z} and S is expression an...	definite clause grammar (dcg) Prolog (homework) definite clause grammar (dcg) Prolog (homework) dcg prolog Prolog Expression Number Digit Operator Variable definite clause grammar (dcg) Prolog (homework) i tried to write a predicate and N={Expression,Number,Digit,Operator,Variable} T={1,2,3,+,-,*,(,),X,Y,Z} and S is ex...	[ 0.0028228759765625, 0.005340576171875, 0.007232666015625, 0.0301513671875, 0.00823974609375, 0.0233154296875, -0.00494384765625, 0.0032501220703125, 0.00787353515625, -0.005615234375, -0.0052490234375, -0.030517578125, -0.025634765625, -0.01708984375, 0.0048828125, 0.0186767578125, 0...	[ 71496, 13, 70731, 122092, 147, 238, 177, 1250, 4867, 29552, 18244, 104, 502, 25129, 103332, 51174, 150922, 84572, 2886, 37842, 33022, 1653, 2063, 541, 178752, 18444, 26278, 14055, 15769, 156823, 81827, 384, 363, 1328, 9, 1639, 1542, 1723, 1...	[ 0.2000732421875, 0.1094970703125, 0.204833984375, 0.1566162109375, 0.078369140625, 0.017425537109375, 0.1273193359375, 0.1524658203125, 0.2037353515625, 0.05218505859375, 0.124755859375, 0.0159149169921875, 0.1190185546875, 0.112548828125, 0.1519775390625, 0.127685546875, 0.205078125...	embed
64941499_c0	64941499	prolog	0	Title: How to insert member list with menu driven prolog program? Problem title: How to insert member list with menu driven prolog program? Tags: prolog, list, membership, member Problem: How to insert member list with menu driven prolog program? The Question is- Write a menu driven PROLOG program to implement various ...	How to insert member list with menu driven prolog program? How to insert member list with menu driven prolog program? prolog list membership member How Enter Run Exit Choice run_opt Goodbye Invalid TAIL How to insert member list with menu driven prolog program? The Question is- Write a menu driven PROLOG program to imp...	[ 0.01068115234375, -0.0019989013671875, 0.0224609375, 0.01068115234375, -0.037109375, 0.01007080078125, -0.0205078125, -0.0037841796875, 0.001556396484375, -0.033447265625, 0.0230712890625, -0.01458740234375, 0.01611328125, -0.00927734375, 0.005950927734375, 0.000591278076171875, 0.01...	[ 11249, 183540, 32786, 5303, 678, 8026, 22648, 502, 4867, 1528, 209274, 60816, 28398, 5443, 217, 181948, 11675, 2146, 18621, 1272, 7013, 12998, 16444, 18781, 10514, 47510, 29479, 41018, 32036, 7210, 2967, 831, 241860, 35064, 105237, 26785, 71924...	[ 0.07586669921875, 0.246826171875, 0.253173828125, 0.2039794921875, 0.09808349609375, 0.200439453125, 0.1171875, 0.1409912109375, 0.20703125, 0.1368408203125, 0.207763671875, 0.117431640625, 0.1015625, 0.08831787109375, 0.03289794921875, 0.1312255859375, 0.0618896484375, 0.073181152...	embed
40702617_c0	40702617	prolog	0	Title: Prolog routes in directed graph Problem title: Prolog routes in directed graph Tags: prolog Problem: Prolog routes in directed graph I am quite new to Prolog and want to create a program, where I can ask for a route with the predicate " route(Startpoint,Endpoint,Route) ". My code so far is: % facts connection(s1...	Prolog routes in directed graph Prolog routes in directed graph prolog Prolog Startpoint Endpoint Route route1 route2 Prolog routes in directed graph I am quite new to Prolog and want to create a program, where I can ask for a route with the predicate " route(Startpoint,Endpoint,Route) ". My code so far is: My code wor...	[ 0.0091552734375, 0.0037384033203125, 0.01458740234375, 0.020263671875, -0.00836181640625, -0.005401611328125, -0.01251220703125, -0.0011138916015625, 0.005706787109375, -0.0673828125, -0.0014190673828125, -0.0028076171875, -0.026611328125, 0.0103759765625, 0.007415771484375, 0.01525878...	[ 1250, 4867, 36439, 23, 8951, 297, 41382, 7, 502, 13794, 38496, 18878, 106015, 418, 304, 32233, 3525, 3444, 28282, 1528, 831, 26458, 1653, 2063, 126597, 152378, 12724, 6743, 18151, 2060, 43240, 105823, 15824, 11249, 56282, 29398, 62163, 36997,...	[ 0.19482421875, 0.26806640625, 0.24365234375, 0.05584716796875, 0.1697998046875, 0.080078125, 0.2254638671875, 0.02032470703125, 0.1273193359375, 0.1240234375, 0.1575927734375, 0.107177734375, 0.1595458984375, 0.0379638671875, 0.051422119140625, 0.0081787109375, 0.048828125, 0.04507...	embed
7739481_c0	7739481	prolog	0	Title: A prolog assignment which uses lists Problem title: A prolog assignment which uses lists Tags: prolog Problem: A prolog assignment which uses lists I have an assignment that's driving me crazy.... Here's the assignment: The following contacts for people in a company are kept as facts as the followings: phones(jo...	A prolog assignment which uses lists A prolog assignment which uses lists prolog mobile91 mobile93 all_contacts ListOfContacts ListOfContactss all_contactos LIST LIST_CONTACTS movel91 A prolog assignment which uses lists I have an assignment that's driving me crazy.... Here's the assignment: The following contacts for ...	[ 0.01287841796875, 0.02197265625, -0.00958251953125, 0.028564453125, -0.0186767578125, -0.005950927734375, -0.032958984375, 0.0301513671875, 0.004608154296875, -0.044677734375, -0.01513671875, 0.0005950927734375, -0.000316619873046875, 0.001129150390625, -0.00439453125, 0.01116943359375...	[ 62, 502, 4867, 95486, 674, 3129, 4527, 5303, 7, 14288, 12183, 11591, 756, 163891, 32036, 132887, 233695, 232, 195977, 108369, 84161, 931, 2601, 765, 132442, 163, 116666, 25632, 5470, 100, 3395, 23, 14380, 93544, 237, 15824, 262, 64552, 1653...	[ 0.0241546630859375, 0.1522216796875, 0.2430419921875, 0.1978759765625, 0.1097412109375, 0.01690673828125, 0.1199951171875, 0.26220703125, 0.06439208984375, 0.1312255859375, 0.195068359375, 0.1519775390625, 0.07086181640625, 0.207275390625, 0.1175537109375, 0.15966796875, 0.2048339843...	embed
3948076_c0	3948076	prolog	0	Title: Prolog - formulas in propositional logic Problem title: Prolog - formulas in propositional logic Tags: dcg, prolog, prolog-defaulty Problem: Prolog - formulas in propositional logic I am trying to make a predicate in order to validate if a given input represents a formula. I am allowed to use only to proposition...	Prolog - formulas in propositional logic Prolog - formulas in propositional logic dcg prolog prolog-defaulty Prolog logical_atom atom_codes Prolog - formulas in propositional logic I am trying to make a predicate in order to validate if a given input represents a formula. I am allowed to use only to propositional atoms...	[ 0.006744384765625, 0.01080322265625, -0.00299072265625, 0.0157470703125, -0.016845703125, 0.004119873046875, 0.005462646484375, -0.01202392578125, -0.00390625, -0.0264892578125, -0.0048828125, -0.006256103515625, -0.006195068359375, 0.005706787109375, -0.01190185546875, 0.0132446289062...	[ 1250, 4867, 26168, 89261, 289, 62775, 23, 177, 502, 214810, 53, 5928, 34627, 40899, 31577, 3249, 1653, 2063, 67, 44622, 2174, 34475, 107730, 33636, 107003, 4527, 4734, 47, 915, 8096, 1690, 91, 808, 765, 3034, 25632, 7228, 148, 4902, 30646...	[ 0.1494140625, 0.228271484375, 0.241943359375, 0.18701171875, 0.06640625, 0.142333984375, 0.0161895751953125, 0.11865234375, 0.123046875, 0.1651611328125, 0.029815673828125, 0.1201171875, 0.1885986328125, 0.158447265625, 0.07073974609375, 0.0265655517578125, 0.1651611328125, 0.18603...	embed
8748867_c1	8748867	prolog	1	is D2-n, C is D1+n. pour(state(D1,D2,D3,n,r),move(D,C,l),state(D1,D,c,n,l)) :- D is D2-n, C is D3. pour(state(D1,D2,D3,n,l),move(D,C,r),state(C,D2,D,n,r)) :- D is D3-n, C is D1. pour(state(D1,D2,D3,n,r),move(D,C,l),state(D1,C,D,n,l)) :- D is D3-n, C is D2+n. pour(state(D1,D2,D3,n,r),move(D,C,l),state(C,D2,D,n,l)) :- D...	is D2-n, C is D1+n. pour(state(D1,D2,D3,n,r),move(D,C,l),state(D1,D,c,n,l)) :- D is D2-n, C is D3. pour(state(D1,D2,D3,n,l),move(D,C,r),state(C,D2,D,n,r)) :- D is D3-n, C is D1. pour(state(D1,D2,D3,n,r),move(D,C,l),state(D1,C,D,n,l)) :- D is D3-n, C is D2+n. pour(state(D1,D2,D3,n,r),move(D,C,l),state(C,D2,D,n,l)) :- D...	[ -0.006500244140625, 0.004547119140625, -0.000598907470703125, 0.033935546875, -0.0035400390625, 0.00787353515625, -0.0238037109375, 0.0157470703125, 0.004791259765625, -0.01416015625, -0.000713348388671875, 0.004791259765625, 0.00555419921875, 0.017578125, -0.0145263671875, -0.01916503...	[ 83, 391, 18504, 19, 4, 313, 418, 1328, 5, 578, 132, 61340, 397, 304, 363, 42, 432, 272, 141, 238, 15772, 27495, 85358, 966, 77495, 128188, 194, 90980, 21320, 8437, 1542, 1723, 963, 1511, 157979, 16093, 475, 991, 1140, 454, 9, 9709, ...	[ 0.148193359375, 0.189208984375, 0.231689453125, 0.1572265625, 0.007415771484375, 0.189453125, 0.103515625, 0.201904296875, 0.07415771484375, 0.222412109375, 0.00927734375, 0.196044921875, 0.1241455078125, 0.106689453125, 0.2047119140625, 0.09686279296875, 0.1519775390625, 0.1124267...	embed
70173499_c1	70173499	prolog	1	),MetHistory,InfectionPath) :- (met(StartPerson,MetTime,MidPerson);met(MidPerson,MetTime,StartPerson)), StartTime >= MetTime, StartTime - MetTime < 7, \+ (mymember(met(StartPerson,MetTime,MidPerson),MetHistory);mymember(met(MidPerson,MetTime,StartPerson),MetHistory)), contact4(infect(MidPerson,MetTime),infect(GoalPerso...	),MetHistory,InfectionPath) :- (met(StartPerson,MetTime,MidPerson);met(MidPerson,MetTime,StartPerson)), StartTime >= MetTime, StartTime - MetTime < 7, \+ (mymember(met(StartPerson,MetTime,MidPerson),MetHistory);mymember(met(MidPerson,MetTime,StartPerson),MetHistory)), contact4(infect(MidPerson,MetTime),infect(GoalPerso...	[ 0.0036468505859375, 0.019287109375, 0.0113525390625, 0.0191650390625, -0.006591796875, -0.02734375, -0.0230712890625, 0.01806640625, 0.007049560546875, -0.06396484375, 0.01214599609375, 0.0198974609375, -0.016357421875, 0.006591796875, 0.031982421875, 0.0205078125, 0.0064697265625, ...	[ 247, 78572, 20861, 86385, 4153, 420, 58994, 683, 10519, 15772, 1928, 126597, 160054, 70059, 594, 532, 16, 13794, 977, 4146, 4426, 361, 4, 6, 1328, 15, 1176, 39, 27417, 132, 3142, 5470, 617, 204228, 17903, 289, 6032, 268, 18151, 36917, 2...	[ 0.06707763671875, 0.21875, 0.1724853515625, 0.1947021484375, 0.08734130859375, 0.1832275390625, 0.1326904296875, 0.10546875, 0.19580078125, 0.039154052734375, 0.20849609375, 0.1787109375, 0.2061767578125, 0.2418212890625, 0.038482666015625, 0.1265869140625, 0.0182037353515625, 0.19...	embed
67984845_c1	67984845	prolog	1	), TargetMinimax is Sum//N, once( ( between(TargetMinimax, Sum , NMinimax), Minimax is 0+NMinimax, distribute_minimax(Elements, [], n, Minimax, N, 0, [], LDistributionOnce) )), LDistribution=LDistributionOnce. This means the search for a minimal maximum value will begin with approximately the sum divided by the amount ...	), TargetMinimax is Sum//N, once( ( between(TargetMinimax, Sum , NMinimax), Minimax is 0+NMinimax, distribute_minimax(Elements, [], n, Minimax, N, 0, [], LDistributionOnce) )), LDistribution=LDistributionOnce. This means the search for a minimal maximum value will begin with approximately the sum divided by the amount ...	[ -0.01446533203125, 0.000568389892578125, 0.0301513671875, 0.005615234375, -0.0179443359375, 0.00811767578125, 0.0118408203125, -0.002197265625, 0.0076904296875, -0.015625, 0.0240478515625, 0.00384521484375, -0.01953125, -0.004058837890625, 0.010498046875, 0.000141143798828125, 0.0260...	[ 247, 160017, 114986, 24084, 83, 36335, 20767, 839, 24145, 17721, 63031, 3794, 541, 13468, 757, 1328, 943, 15917, 67, 9222, 647, 19929, 653, 339, 44456, 179236, 670, 3956, 30693, 164, 33938, 100, 20187, 38132, 34292, 1221, 9842, 189275, 1055...	[ 0.032318115234375, 0.251708984375, 0.209228515625, 0.2283935546875, 0.042938232421875, 0.169189453125, 0.08856201171875, 0.0958251953125, 0.1278076171875, 0.109375, 0.1490478515625, 0.1571044921875, 0.076171875, 0.180419921875, 0.08758544921875, 0.07061767578125, 0.09173583984375, ...	embed
29291195_c0	29291195	prolog	0	Title: Prolog - Find the first solution and stop searching Problem title: Prolog - Find the first solution and stop searching Tags: prolog Problem: Prolog - Find the first solution and stop searching I am learning programming in Prolog and have a problem with a rule, it must search for the solution and once it is found...	Prolog - Find the first solution and stop searching Prolog - Find the first solution and stop searching prolog Prolog Find do_something do_whatever Prolog - Find the first solution and stop searching I am learning programming in Prolog and have a problem with a rule, it must search for the solution and once it is found...	[ -0.001800537109375, 0.01019287109375, 0.0140380859375, 0.00750732421875, -0.017578125, 0.0177001953125, -0.004180908203125, 0.00738525390625, 0.007049560546875, -0.056396484375, -0.0106201171875, -0.005340576171875, -0.024658203125, -0.0034332275390625, 0.0294189453125, 0.0281982421875...	[ 1250, 4867, 20, 26040, 5117, 29806, 136, 7279, 157318, 502, 54, 43452, 64113, 124409, 30441, 70, 52080, 56037, 2967, 79986, 8110, 33938, 100, 24145, 14037, 157, 165523, 1286, 3501, 1632, 37842, 4263, 959, 35782, 4420, 125728, 214, 9790, 179...	[ 0.1834716796875, 0.252197265625, 0.0142364501953125, 0.1719970703125, 0.1612548828125, 0.218994140625, 0.010650634765625, 0.163330078125, 0.23046875, 0.125732421875, 0.1500244140625, 0.04278564453125, 0.1661376953125, 0.114990234375, 0.1458740234375, 0.0069580078125, 0.04733276367187...	embed
33173787_c0	33173787	prolog	0	Title: Prolog: Can you make a predicate behave differently depending on whether a value is ground or not? Problem title: Prolog: Can you make a predicate behave differently depending on whether a value is ground or not? Tags: logical-purity, prolog Problem: Prolog: Can you make a predicate behave differently depending ...	Prolog: Can you make a predicate behave differently depending on whether a value is ground or not? Prolog: Can you make a predicate behave differently depending on whether a value is ground or not? logical-purity prolog Prolog Can Prolog: Can you make a predicate behave differently depending on whether a value is groun...	[ -0.00860595703125, 0.01153564453125, -0.00095367431640625, 0.000762939453125, -0.0252685546875, 0.005828857421875, 0.00341796875, 0.0032501220703125, -0.00494384765625, -0.005401611328125, -0.000469207763671875, 0.00543212890625, -0.031494140625, -0.00885009765625, 0.016845703125, 0.01...	[ 1250, 4867, 4171, 3249, 1653, 2063, 67, 186, 68991, 12921, 96819, 36766, 34292, 83, 61585, 959, 62775, 289, 4717, 2481, 502, 707, 208806, 27140, 22759, 10750, 3871, 4488, 3229, 5117, 4568, 10869, 64330, 17932, 50960, 621, 284, 571, 441, 3...	[ 0.138916015625, 0.2056884765625, 0.06256103515625, 0.04779052734375, 0.189208984375, 0.2257080078125, 0.143798828125, 0.06201171875, 0.1573486328125, 0.1923828125, 0.1077880859375, 0.0141754150390625, 0.2083740234375, 0.054229736328125, 0.2490234375, 0.11328125, 0.08819580078125, 0...	embed
29069649_c0	29069649	prolog	0	Title: Generating a Mandarin numbering system Problem title: Generating a Mandarin numbering system Tags: prolog Problem: Generating a Mandarin numbering system I'm constructing a Prolog program that counts from 0 to 10,000. I have it working for 0 to 99. I need help with 100 to 1,000. The numbering system can be found...	Generating a Mandarin numbering system Generating a Mandarin numbering system prolog Generating Mandarin Generating a Mandarin numbering system I'm constructing a Prolog program that counts from 0 to 10,000. I have it working for 0 to 99. I need help with 100 to 1,000. The numbering system can be found at http://mandar...	[ 0.01031494140625, -0.01141357421875, -0.016845703125, 0.004119873046875, 0.000530242919921875, 0.0220947265625, -0.005706787109375, 0.003448486328125, 0.0035552978515625, -0.01953125, 0.0166015625, -0.02685546875, 0.004486083984375, -0.00592041015625, 0.01171875, -0.0247802734375, 0....	[ 155370, 1916, 86099, 2677, 14012, 214, 5426, 10, 502, 4867, 64549, 1250, 1528, 54529, 1295, 757, 47, 84428, 20697, 100, 10078, 3871, 4358, 805, 75534, 14037, 31468, 115095, 2199, 965, 408, 32262, 11, 2606, 1297, 32354, 35064, 65771, 140992,...	[ 0.185791015625, 0.05767822265625, 0.229248046875, 0.229248046875, 0.228759765625, 0.07208251953125, 0.157470703125, 0.01617431640625, 0.139404296875, 0.18798828125, 0.0849609375, 0.145263671875, 0.145751953125, 0.163818359375, 0.06201171875, 0.1483154296875, 0.09814453125, 0.189453...	embed
16272255_c1	16272255	prolog	1	G1,G2). /if X is full and Y is not, then empty X/ /* if X+Y is greater than or equal to 4 then fill Y from X/ bucket(X,Y,T,G1,G2) :- (X+Y) >= 4, X>0, Z is (Y-(4-X)),not(memPairs(4,Z,T)),bucket(4,Z,[4,Z\|T],G1,G2). /if X+Y is greater than or equal to 3, then fill X from Y*/ bucket(X,Y,T,G1,G2) :- (X+Y) >=3, Z is (X-(...	G1,G2). /if X is full and Y is not, then empty X/ /* if X+Y is greater than or equal to 4 then fill Y from X/ bucket(X,Y,T,G1,G2) :- (X+Y) >= 4, X>0, Z is (Y-(4-X)),not(memPairs(4,Z,T)),bucket(4,Z,[4,Z\|T],G1,G2). /if X+Y is greater than or equal to 3, then fill X from Y*/ bucket(X,Y,T,G1,G2) :- (X+Y) >=3, Z is (X-(...	[ -0.015625, 0.01312255859375, -0.0028839111328125, 0.00640869140625, -0.0013427734375, 0.01611328125, -0.0179443359375, -0.01220703125, 0.008544921875, 0.035400390625, 0.017333984375, -0.0159912109375, -0.01031494140625, -0.0152587890625, 0.00445556640625, -0.0024871826171875, -0.0017...	[ 527, 418, 4, 724, 10461, 5, 248, 1639, 3190, 1193, 83, 4393, 136, 990, 959, 7068, 201505, 64, 2174, 1328, 1723, 117396, 3501, 707, 105950, 201, 26292, 1295, 373, 27853, 1542, 618, 15772, 977, 1369, 2389, 567, 105801, 9, 10869, 37138, ...	[ 0.1859130859375, 0.120849609375, 0.070556640625, 0.154052734375, 0.2303466796875, 0.03662109375, 0.0211029052734375, 0.04510498046875, 0.102783203125, 0.1798095703125, 0.07183837890625, 0.2008056640625, 0.06280517578125, 0.174560546875, 0.167236328125, 0.02996826171875, 0.23400878906...	embed
58603006_c0	58603006	prolog	0	Title: Equivalent of "assert" in JPL7 Problem title: Equivalent of "assert" in JPL7 Tags: swi-prolog, java, jpl, prolog Problem: Equivalent of "assert" in JPL7 I am currently creating a Java Swing GUI where the user can select what type of fruits they like. Depending on their choice, only certain fr...	Equivalent of "assert" in JPL7 Equivalent of "assert" in JPL7 swi-prolog java jpl prolog Equivalent JPL7 selected_fruit Query System.out.println q2.hasSolution Term Atom Equivalent of "assert" in JPL7 I am currently creating a Java Swing GUI where the user can select what type of fruits they like. D...	[ 0.007537841796875, 0.02587890625, -0.003936767578125, 0.0341796875, -0.0294189453125, 0.009033203125, -0.006317138671875, -0.0025177001953125, -0.0089111328125, 0.0057373046875, 0.01177978515625, 0.01007080078125, -0.0211181640625, -0.00140380859375, 0.01336669921875, 0.021728515625, ...	[ 145666, 85540, 111, 162, 33657, 23, 821, 21130, 966, 41502, 91, 2452, 3454, 4867, 79, 330, 1647, 2424, 502, 133291, 23129, 217, 58836, 12353, 6056, 35662, 8096, 5442, 10557, 102588, 34, 2994, 69728, 105233, 41925, 14775, 195490, 38937, 3684...	[ 0.114990234375, 0.1455078125, 0.04925537109375, 0.147216796875, 0.308837890625, 0.031402587890625, 0.126953125, 0.2340087890625, 0.2005615234375, 0.0054931640625, 0.00457763671875, 0.2001953125, 0.125244140625, 0.22509765625, 0.04925537109375, 0.099609375, 0.056304931640625, 0.1588...	embed
74540192_c0	74540192	prolog	0	Title: A Prolog program for permutation parity Problem title: A Prolog program for permutation parity Tags: prolog, parity, permutation Problem: A Prolog program for permutation parity I wrote this small program in Prolog. odd_even_flip(odd, even). odd_even_flip(even, odd). permutation_parity([X\|L], [X\|P], R) :- permut...	A Prolog program for permutation parity A Prolog program for permutation parity prolog parity permutation Prolog odd_even_flip flip_one permutation_parity Res A Prolog program for permutation parity I wrote this small program in Prolog. I expect it to find the parity of a permutation P of list L. The few queries that a...	[ 0.011962890625, 0.038818359375, 0.018798828125, -0.0118408203125, -0.0086669921875, 0.024169921875, -0.01019287109375, -0.0069580078125, 0.004913330078125, -0.013671875, 0.00390625, 0.00921630859375, 0.01544189453125, 0.01092529296875, -0.0015869140625, -0.00482177734375, 0.002548217...	[ 1250, 4867, 1528, 100, 117, 561, 22062, 366, 2481, 62, 502, 70270, 26301, 21392, 147505, 3630, 2500, 9624, 54397, 19336, 41206, 7413, 436, 111, 5303, 339, 10846, 41, 34475, 160463, 3853, 707, 79786, 5885, 16981, 876, 501, 1193, 990, 7639,...	[ 0.172119140625, 0.218017578125, 0.1761474609375, 0.0372314453125, 0.140625, 0.1737060546875, 0.053466796875, 0.18994140625, 0.1119384765625, 0.0165252685546875, 0.10540771484375, 0.1846923828125, 0.1082763671875, 0.1083984375, 0.1241455078125, 0.1064453125, 0.1978759765625, 0.06579...	embed
27761514_c0	27761514	prolog	0	Title: Intersection of two lists of variables Problem title: Intersection of two lists of variables Tags: iso-prolog, prolog Problem: Intersection of two lists of variables How to define in ISO Prolog a (meta-logical) predicate for the intersection of two lists of variables that runs in linear time? The variables may a...	Intersection of two lists of variables Intersection of two lists of variables iso-prolog prolog Intersection varset_intersection As_cap_Bs Inter Intersection of two lists of variables How to define in ISO Prolog a (meta-logical) predicate for the intersection of two lists of variables that runs in linear time? The vari...	[ 0.009765625, -0.00007295608520507812, 0.00390625, 0.00445556640625, 0.00970458984375, 0.01165771484375, -0.009765625, -0.0048828125, 0.013916015625, -0.01116943359375, 0.0020294189453125, 0.025146484375, -0.00469970703125, 0.004119873046875, 0.013916015625, 0.002960205078125, 0.00817...	[ 5337, 7, 58994, 6626, 5303, 77336, 111, 13882, 3454, 4867, 502, 285, 3509, 10433, 1301, 15644, 571, 11249, 61924, 17408, 1250, 10, 35273, 137043, 1653, 2063, 100, 1940, 127877, 192617, 1733, 108975, 2499, 83324, 12989, 208124, 108750, 57266, ...	[ 0.2132568359375, 0.20751953125, 0.1876220703125, 0.155517578125, 0.20166015625, 0.244140625, 0.000823974609375, 0.0992431640625, 0.1231689453125, 0.218017578125, 0.1239013671875, 0.1466064453125, 0.17333984375, 0.176025390625, 0.09130859375, 0.124267578125, 0.0469970703125, 0.01095...	embed
16373739_c0	16373739	prolog	0	Title: Prolog avoid generating same lists twice Problem title: Prolog avoid generating same lists twice Tags: prolog, list Problem: Prolog avoid generating same lists twice I have following code: internal_generator(List):- select(foo, List, MList), select(bar, MList, M2List), select(baz, M2List, _). internal_generator2...	Prolog avoid generating same lists twice Prolog avoid generating same lists twice prolog list Prolog internal_generator List MList M2List internal_generator2 sth1 sth2 sth3 external_generator List1 List2 Prolog avoid generating same lists twice I have following code: Prolog, after generating some List1 by internal_gene...	[ 0.01129150390625, 0.00927734375, 0.011962890625, -0.010009765625, -0.02001953125, 0.00421142578125, -0.01397705078125, -0.0086669921875, 0.00933837890625, -0.033447265625, 0.0032958984375, 0.0281982421875, 0.006134033203125, 0.0230712890625, 0.013916015625, 0.004669189453125, 0.00099...	[ 1250, 4867, 71864, 12663, 5701, 5303, 186351, 1916, 502, 70796, 48281, 1290, 32036, 154663, 304, 927, 173591, 18151, 139392, 44116, 50339, 104250, 756, 4420, 16750, 5775, 31, 1299, 40300, 7722, 142424, 13438, 456, 144810, 4343, 7413, 5584, 86...	[ 0.1785888671875, 0.2498779296875, 0.1888427734375, 0.162109375, 0.1429443359375, 0.1868896484375, 0.195556640625, 0.009063720703125, 0.1361083984375, 0.143798828125, 0.16650390625, 0.078125, 0.1258544921875, 0.1488037109375, 0.10272216796875, 0.000457763671875, 0.09326171875, 0.119...	embed
58367026_c0	58367026	prolog	0	Title: Prolog: Define propositional logic statement operators and add arguments to list Problem title: Prolog: Define propositional logic statement operators and add arguments to list Tags: list, prolog, operators Problem: Prolog: Define propositional logic statement operators and add arguments to list I'm trying to de...	Prolog: Define propositional logic statement operators and add arguments to list Prolog: Define propositional logic statement operators and add arguments to list list prolog operators Prolog Define Prolog: Define propositional logic statement operators and add arguments to list I'm trying to define some operators that ...	[ 0.0250244140625, 0.00026702880859375, 0.00167083740234375, -0.003326416015625, -0.023193359375, 0.0027618408203125, 0.0101318359375, 0.00811767578125, 0.0025177001953125, -0.01953125, -0.00653076171875, -0.0150146484375, -0.013427734375, 0.00836181640625, -0.002288818359375, 0.02172851...	[ 1250, 4867, 262, 64552, 89261, 289, 62775, 63805, 39933, 7, 15190, 10750, 47, 5303, 502, 31577, 61924, 678, 136, 459, 6626, 4527, 33172, 9960, 724, 84780, 3714, 40140, 61972, 765, 11737, 105233, 24233, 69941, 111, 756, 188336, 23009, 1884, ...	[ 0.179443359375, 0.24951171875, 0.0623779296875, 0.1390380859375, 0.2130126953125, 0.1014404296875, 0.169921875, 0.177978515625, 0.254150390625, 0.05126953125, 0.14306640625, 0.2237548828125, 0.053955078125, 0.18701171875, 0.1219482421875, 0.03717041015625, 0.1434326171875, 0.047698...	embed
67129062_c0	67129062	prolog	0	Title: Prolog connection between 2 in a family tree Problem title: Prolog connection between 2 in a family tree Tags: prolog Problem: Prolog connection between 2 in a family tree I am new to prolog. I don't know how to get connection between two and get list of people in between. This is the prolog code for the family ...	Prolog connection between 2 in a family tree Prolog connection between 2 in a family tree prolog Prolog Facts Rules Prolog connection between 2 in a family tree I am new to prolog. I don't know how to get connection between two and get list of people in between. This is the prolog code for the family tree Elizabeth fam...	[ 0.01177978515625, 0.0106201171875, -0.00014209747314453125, 0.0130615234375, -0.01092529296875, 0.0281982421875, -0.03466796875, -0.0021514892578125, 0.0034637451171875, -0.0576171875, 0.0089111328125, -0.038818359375, -0.020751953125, -0.002410888671875, 0.002838134765625, 0.005584716...	[ 1250, 4867, 94878, 17721, 116, 23, 14449, 53201, 10, 502, 132640, 139118, 3525, 3714, 3642, 2046, 6626, 5303, 3395, 3293, 83, 70, 18151, 100, 72542 ]	[ 0.1763916015625, 0.287841796875, 0.180419921875, 0.2086181640625, 0.14013671875, 0.08587646484375, 0.10791015625, 0.263671875, 0.0234222412109375, 0.164794921875, 0.1463623046875, 0.1441650390625, 0.03936767578125, 0.019866943359375, 0.0033359527587890625, 0.061065673828125, 0.121032...	embed
47109776_c0	47109776	prolog	0	Title: Controlling 'cut' in recursive function to remove an element from a list in Prolog Problem title: Controlling 'cut' in recursive function to remove an element from a list in Prolog Tags: prolog Problem: Controlling 'cut' in recursive function to remove an element from a list in Prolog I'm try...	Controlling 'cut' in recursive function to remove an element from a list in Prolog Controlling 'cut' in recursive function to remove an element from a list in Prolog prolog a Controlling Prolog Result Controlling 'cut' in recursive function to remove an element from a list in Prolog I'm trying to cr...	[ 0.001983642578125, 0.022216796875, 0.0057373046875, 0.0135498046875, -0.01287841796875, 0.00147247314453125, -0.004608154296875, -0.0108642578125, 0.017578125, -0.0263671875, 0.0030975341796875, -0.00811767578125, -0.006744384765625, 0.00092315673828125, 0.0164794921875, -0.01147460937...	[ 27131, 2069, 3768, 19774, 195625, 5844, 32354, 87388, 12830, 1295, 5303, 1250, 4867, 502, 126684, 31577, 28282, 756, 70, 74918, 42, 3173, 51347, 12921, 51515, 43658, 80854, 3525, 2174, 959, 105950, 3444, 154109, 16750, 41206, 13695, 97370, 44...	[ 0.1834716796875, 0.0794677734375, 0.07061767578125, 0.2315673828125, 0.1878662109375, 0.1285400390625, 0.1561279296875, 0.1702880859375, 0.1466064453125, 0.09442138671875, 0.1690673828125, 0.1483154296875, 0.22265625, 0.1083984375, 0.154052734375, 0.0250701904296875, 0.03863525390625...	embed
8318293_c0	8318293	prolog	0	Title: Simplified Travelling Salesman in Prolog Problem title: Simplified Travelling Salesman in Prolog Tags: prolog, prolog-dif, traveling-salesman, backtracking Problem: Simplified Travelling Salesman in Prolog I've looked through the similar questions but can't find anything that's relevant to my problem. I'm strugg...	Simplified Travelling Salesman in Prolog Simplified Travelling Salesman in Prolog prolog prolog-dif traveling-salesman backtracking Simplified Travelling Salesman Prolog CityA CityB City1 City2 Distance all_possible_paths loop_process Simplified Travelling Salesman in Prolog I've looked through the similar questions bu...	[ 0.04345703125, 0.0078125, 0.0062255859375, 0.0277099609375, -0.0111083984375, 0.01043701171875, -0.025146484375, 0.0035858154296875, 0.02197265625, -0.046630859375, -0.000051021575927734375, 0.01080322265625, -0.015869140625, 0.0257568359375, 0.01153564453125, 0.011474609375, -0.0005...	[ 55331, 141, 47314, 30720, 2069, 88583, 669, 1250, 4867, 502, 428, 420, 26983, 214, 7, 21183, 4420, 125728, 6406, 284, 571, 418, 304, 154349, 756, 7522, 55356, 128405, 40956, 63923, 29191, 2967, 237875, 7413, 234873, 5423, 28354, 10, 60875, ...	[ 0.06689453125, 0.082275390625, 0.09613037109375, 0.166259765625, 0.077880859375, 0.1435546875, 0.1439208984375, 0.1427001953125, 0.2216796875, 0.1060791015625, 0.026458740234375, 0.0753173828125, 0.1466064453125, 0.051361083984375, 0.008056640625, 0.1058349609375, 0.151123046875, 0...	embed
72280864_c0	72280864	prolog	0	Title: If I ask for X, it generates duplicates, but it fails on duplicates if I ask explicitly Problem title: If I ask for X, it generates duplicates, but it fails on duplicates if I ask explicitly Tags: prolog Problem: If I ask for X, it generates duplicates, but it fails on duplicates if I ask explicitly I am trying ...	If I ask for X, it generates duplicates, but it fails on duplicates if I ask explicitly If I ask for X, it generates duplicates, but it fails on duplicates if I ask explicitly prolog X-Y pos_ piese_pos _-_-Y is_set a-1 a-2 When But stackoverflow.com Lst Set If I ask for X, it generates duplicates, but it fails on dupli...	[ -0.0137939453125, -0.0028076171875, 0.0098876953125, -0.019775390625, -0.0263671875, 0.0098876953125, 0.01165771484375, 0.003204345703125, -0.0001659393310546875, -0.037841796875, -0.029296875, 0.048095703125, 0.0130615234375, 0.00185394287109375, -0.0096435546875, 0.0205078125, 0.00...	[ 4263, 26458, 100, 1193, 139392, 7, 171763, 1636, 1284, 35782, 98, 143726, 502, 4867, 1723, 3864, 113681, 7522, 3509, 10, 5759, 5428, 177261, 5465, 118664, 277, 271, 19943, 442, 31577, 126371, 45443, 29458, 19069, 64209, 6626, 831, 143414, 5...	[ 0.00469970703125, 0.2064208984375, 0.100830078125, 0.08648681640625, 0.19384765625, 0.0228118896484375, 0.26171875, 0.1588134765625, 0.0279693603515625, 0.1788330078125, 0.06597900390625, 0.1658935546875, 0.113037109375, 0.16015625, 0.08160400390625, 0.113037109375, 0.09716796875, ...	embed
50450585_c0	50450585	prolog	0	Title: Prolog , return permutations with a max value Problem title: Prolog , return permutations with a max value Tags: max, return, permutation, prolog Problem: Prolog , return permutations with a max value i have made predicate schedule(A,B,C) that returns possible permutations at lists A,B,C with backtracking \| ?- s...	Prolog , return permutations with a max value Prolog , return permutations with a max value max return permutation prolog Prolog im204 im212 im217 im209 im214 im218 im210 im216 score_schedule all_schedule_scores Prolog , return permutations with a max value i have made predicate schedule(A,B,C) that returns possible pe...	[ 0.0126953125, 0.019775390625, 0.01177978515625, 0.01397705078125, -0.031005859375, 0.01312255859375, -0.01300048828125, 0.004364013671875, -0.001739501953125, -0.0281982421875, 0.004302978515625, 0.0076904296875, 0.005615234375, -0.0098876953125, 0.018798828125, -0.004791259765625, -...	[ 1250, 4867, 30646, 117, 14311, 21094, 678, 18389, 34292, 561, 502, 566, 147758, 304, 1530, 2489, 1549, 1126, 2592, 1819, 88142, 2485, 47763, 7560, 693, 756, 133, 12064, 7228, 1653, 2063, 80889, 284, 571, 441, 7722, 5303, 62, 4420, 125728,...	[ 0.1695556640625, 0.2279052734375, 0.20654296875, 0.137939453125, 0.223388671875, 0.07989501953125, 0.08819580078125, 0.1947021484375, 0.1561279296875, 0.1826171875, 0.1417236328125, 0.08746337890625, 0.1612548828125, 0.01177978515625, 0.01043701171875, 0.0501708984375, 0.005828857421...	embed

29010695_c0

29010695

prolog

0

Title: Understanding Recursive Rule and Unification in Prolog Problem title: Understanding Recursive Rule and Unification in Prolog Tags: successor-arithmetics, recursion, prolog, unification Problem: Understanding Recursive Rule and Unification in Prolog I'm a beginning Prolog student following the "LearnPrologNow!" s...

Understanding Recursive Rule and Unification in Prolog Understanding Recursive Rule and Unification in Prolog successor-arithmetics recursion prolog unification Understanding Recursive Rule Unification Prolog Understanding Recursive Rule and Unification in Prolog I'm a beginning Prolog student following the "LearnProlo...

[ 0.0203857421875, 0.0242919921875, 0.0010833740234375, 0.0302734375, 0.0142822265625, 0.02001953125, -0.01043701171875, -0.0067138671875, -0.005035400390625, -0.010009765625, -0.00750732421875, -0.0296630859375, -0.006378173828125, 0.0027008056640625, 0.0238037109375, -0.00823974609375,...

[ 9626, 144057, 853, 48650, 5844, 139118, 136, 992, 41274, 1250, 4867, 39457, 42, 8962, 195625, 502, 51, 86595, 9836, 147, 10752, 137594, 3890, 57143, 2965, 40158, 23755, 190219, 28219, 26818, 138, 155455, 2967, 41, 1294, 14240, 6528, 1528, 1...

[ 0.07696533203125, 0.06634521484375, 0.08282470703125, 0.22412109375, 0.1668701171875, 0.2264404296875, 0.0576171875, 0.173583984375, 0.2021484375, 0.179931640625, 0.28125, 0.158935546875, 0.02227783203125, 0.071044921875, 0.1927490234375, 0.116455078125, 0.2054443359375, 0.01513671...

embed

59773257_c0

59773257

prolog

0

Title: Prolog problem modeling: objects with different colors Problem title: Prolog problem modeling: objects with different colors Tags: prolog Problem: Prolog problem modeling: objects with different colors I'm new to writing Prolog and would like to know how to state the following properties in a way that's useful f...

Prolog problem modeling: objects with different colors Prolog problem modeling: objects with different colors prolog Prolog obj_1 obj_2 color_value Obj Val different_color Prolog problem modeling: objects with different colors I'm new to writing Prolog and would like to know how to state the following properties in a w...

[ -0.003936767578125, -0.0157470703125, -0.004913330078125, 0.01336669921875, 0.0019378662109375, 0.00008392333984375, -0.0419921875, 0.01116943359375, 0.0037078857421875, 0, 0.0012664794921875, 0.0015869140625, 0.00482177734375, 0.0006103515625, 0, 0.0028533935546875, -0.020263671875,...

[ 1250, 4867, 2967, 3299, 214, 36746, 7, 678, 12921, 104988, 502, 995, 170, 115187, 304, 10576, 27494, 3545, 4769, 46133, 3525, 32562, 1884, 3714, 3642, 11341, 25632, 183871, 80234, 31635, 541, 87769, 1556, 10, 17262, 7722, 4842, 50997, 57571...

[ 0.1766357421875, 0.253173828125, 0.14208984375, 0.175048828125, 0.041595458984375, 0.2105712890625, 0.0076904296875, 0.105224609375, 0.1805419921875, 0.24072265625, 0.11279296875, 0.126220703125, 0.1395263671875, 0.07470703125, 0.1192626953125, 0.1982421875, 0.151611328125, 0.14379...

embed

4552600_c0

4552600

prolog

0

Title: Outputting final list from recursive predicate in Prolog Problem title: Outputting final list from recursive predicate in Prolog Tags: prolog, list Problem: Outputting final list from recursive predicate in Prolog I wrote a program, that finds the longest coprime subsequence in a Prolog list (it is not yet perfe...

Outputting final list from recursive predicate in Prolog Outputting final list from recursive predicate in Prolog prolog list recursive Outputting Prolog longest_lcs Tail Outputting final list from recursive predicate in Prolog I wrote a program, that finds the longest coprime subsequence in a Prolog list (it is not ye...

[ -0.002044677734375, 0.0272216796875, -0.0068359375, -0.0030975341796875, -0.00750732421875, 0.0172119140625, 0.006744384765625, 0.0235595703125, -0.01068115234375, -0.0172119140625, 0.01129150390625, -0.0111083984375, 0.003997802734375, 0.00592041015625, 0.01080322265625, 0.00854492187...

[ 13538, 7077, 2704, 5303, 1295, 195625, 5844, 1653, 2063, 67, 1250, 4867, 502, 4989, 525, 32838, 1218, 379, 54397, 1528, 7413, 552, 114654, 1614, 184, 944, 15787, 140992, 33022, 3871, 11675, 25632, 3917, 129344, 43240 ]

[ 0.093994140625, 0.111083984375, 0.1630859375, 0.1622314453125, 0.04193115234375, 0.1658935546875, 0.0826416015625, 0.147705078125, 0.189453125, 0.0188446044921875, 0.118896484375, 0.206787109375, 0.0775146484375, 0.1043701171875, 0.0860595703125, 0.030303955078125, 0.1103515625, 0....

embed

42556771_c0

42556771

prolog

0

Title: Separating a list into a list of fixed length sublists Problem title: Separating a list into a list of fixed length sublists Tags: prolog Problem: Separating a list into a list of fixed length sublists Given a list L , for instance, [1,2,3,4,5,6,7] and a number N , for instance 3 , I would like to make a predica...

Separating a list into a list of fixed length sublists Separating a list into a list of fixed length sublists prolog Separating List N-1 Given Res Separating a list into a list of fixed length sublists Given a list L , for instance, [1,2,3,4,5,6,7] and a number N , for instance 3 , I would like to make a predicate that...

[ -0.0045166015625, 0.01153564453125, 0.01385498046875, -0.0093994140625, -0.0101318359375, 0.015625, 0.0040283203125, 0.0004253387451171875, 0.01397705078125, -0.017822265625, 0.0113525390625, -0.003326416015625, 0.00150299072265625, -0.01239013671875, -0.01141357421875, 0.0230712890625...

[ 503, 6276, 1916, 5303, 3934, 188347, 140909, 1614, 6562, 502, 4867, 32036, 541, 5759, 77878, 9624, 339, 110527, 155761, 80389, 136555, 14012, 138, 1884, 3249, 1653, 2063, 67, 84797, 80854, 13267, 16750, 186, 133063, 96386, 617, 104629, 117221...

[ 0.0806884765625, 0.2113037109375, 0.034820556640625, 0.23486328125, 0.191650390625, 0.2099609375, 0.1353759765625, 0.2076416015625, 0.262939453125, 0.0933837890625, 0.150634765625, 0.2181396484375, 0.148193359375, 0.1312255859375, 0.04949951171875, 0.096435546875, 0.1114501953125, ...

embed

34279723_c1

34279723

prolog

1

iecesIndex), Each VXY is one face of the piece and it can have 0,1,2 dots as you can see in the code below. The Help I need is: - Make sure that all pieces are different - Make sure F and G are equal - Make sure I dont use repeated pieces. Can anyone help me! I've been here whole night trying to figure this out and I'm...

[ -0.00445556640625, -0.019287109375, 0.0020294189453125, 0.0036163330078125, -0.020751953125, -0.0047607421875, -0.0130615234375, 0.00323486328125, 0.0123291015625, -0.0194091796875, 0.01220703125, 0.0125732421875, 0.0238037109375, 0.000766754150390625, 0.00634765625, 0.0029144287109375...

[ 17, 13, 5170, 4153, 39659, 247, 98423, 310, 143907, 83, 1632, 2577, 111, 63847, 442, 831, 765, 72966, 304, 54, 933, 1957, 18151, 35064, 5, 39527, 87, 3871, 26176, 9077, 450, 756, 126371, 621, 12921, 563, 136, 527, 105950, 13319, 4527, ...

[ 0.112548828125, 0.1060791015625, 0.258544921875, 0.1580810546875, 0.281494140625, 0.0360107421875, 0.1435546875, 0.1678466796875, 0.2890625, 0.09747314453125, 0.1260986328125, 0.2030029296875, 0.014312744140625, 0.1834716796875, 0.0164794921875, 0.1083984375, 0.0675048828125, 0.168...

embed

20113946_c0

20113946

prolog

0

Title: Prolog: Removing the duplicates of the merged list Problem title: Prolog: Removing the duplicates of the merged list Tags: prolog Problem: Prolog: Removing the duplicates of the merged list I am doing a homework need to implement a relation list_merge (X,Y,Z) where X and Y are integer lists, Z contains all eleme...

Prolog: Removing the duplicates of the merged list Prolog: Removing the duplicates of the merged list prolog Prolog Removing append2 list_merge Prolog: Removing the duplicates of the merged list I am doing a homework need to implement a relation list_merge (X,Y,Z) where X and Y are integer lists, Z contains all element...

[ -0.0191650390625, 0.032958984375, 0.0272216796875, -0.006561279296875, -0.0004711151123046875, 0.01312255859375, -0.000698089599609375, 0.0174560546875, 0.0322265625, -0.004547119140625, -0.00714111328125, 0.0135498046875, 0.01202392578125, 0.00543212890625, 0.00579833984375, 0.0117187...

[ 1250, 4867, 853, 432, 6496, 171763, 1636, 42564, 71, 5303, 502, 114689, 304, 1991, 429, 5368, 18244, 3871, 29479, 41911, 1542, 1723, 1511, 1193, 136, 990, 892, 567, 70541, 756, 80854, 15044, 110, 67, 3714, 3642, 32354, 87388, 70163, 6626,...

[ 0.1143798828125, 0.18603515625, 0.04833984375, 0.1339111328125, 0.0653076171875, 0.2587890625, 0.1534423828125, 0.2117919921875, 0.0943603515625, 0.20166015625, 0.06793212890625, 0.159423828125, 0.139892578125, 0.1614990234375, 0.110107421875, 0.0198516845703125, 0.0445556640625, 0...

embed

20568194_c0

20568194

prolog

0

Title: Prolog domain restriction Problem title: Prolog domain restriction Tags: clpfd, prolog, sudoku Problem: Prolog domain restriction How can one tell Prolog/CLPFD to only use certain number of domain only as last resource? E.g. : domain from 0...8. I want Prolog to use 0 only if there's no other option. I used the ...

Prolog domain restriction Prolog domain restriction clpfd prolog sudoku Prolog BoardSize all_distinct IndexI IndexJ IndexJ2 Columns Prolog domain restriction How can one tell Prolog/CLPFD to only use certain number of domain only as last resource? E.g. : domain from 0...8. I want Prolog to use 0 only if there's no othe...

[ -0.005767822265625, -0.007232666015625, 0.019775390625, -0.01806640625, -0.01214599609375, -0.015869140625, -0.0031890869140625, 0.021240234375, 0.0108642578125, -0.04638671875, -0.007415771484375, -0.0255126953125, 0.0040283203125, -0.005340576171875, -0.0081787109375, -0.021240234375...

[ 1250, 4867, 77758, 185190, 39557, 71, 502, 8932, 38067, 62554, 127167, 756, 38893, 31471, 1375, 304, 233987, 831, 14192, 37486, 41265, 397, 47, 4734, 4527, 24233, 14012, 237, 4568, 177953, 1295, 757, 1019, 3444, 35829, 34695, 67967, 214, 57...

[ 0.1763916015625, 0.283203125, 0.2420654296875, 0.252685546875, 0.05426025390625, 0.053985595703125, 0.08941650390625, 0.0997314453125, 0.187255859375, 0.130126953125, 0.0709228515625, 0.067626953125, 0.044281005859375, 0.1185302734375, 0.083984375, 0.056976318359375, 0.1771240234375,...

embed

61768707_c1

61768707

prolog

1

i #\= Jozsef, Fenyvesi #\= Vince, Jozsef #\= Gallyas, Jozsef #\= Biologia, Jozsef #= Budapest, Vadkerti #= Gabriella, Vadkerti #\= Kemia, Vadkerti #\= Szeged, Gabriella #\= Kemia, Gabriella #\= Szeged, Kemia #= Szeged, Jeney #= Pecs, Jeney #\= Vince, Frida #= Magyar, Edina #= Egressy #\ Edina #= Miskolc, Informatika #\...

[ -0.00921630859375, -0.00335693359375, 0.01312255859375, 0.021240234375, 0.00067138671875, -0.01953125, -0.0240478515625, 0.01275634765625, 0.018310546875, -0.008056640625, 0.009521484375, -0.0189208984375, 0.01422119140625, 0.0164794921875, -0.00555419921875, 0.0023193359375, 0.01989...

[ 17, 468, 41872, 2177, 169, 7, 4240, 4221, 299, 67334, 1369, 582, 3956, 21713, 395, 100429, 11, 15828, 10414, 1728, 118, 25203, 143, 99157, 96345, 845, 10186, 1460, 4439, 4, 9173, 85, 20480, 17156, 76, 241, 19623, 53, 158462, 43681, 161,...

[ 0.079833984375, 0.0209197998046875, 0.017578125, 0.06463623046875, 0.058624267578125, 0.07196044921875, 0.1807861328125, 0.05059814453125, 0.08660888671875, 0.252685546875, 0.00885009765625, 0.1591796875, 0.1943359375, 0.093994140625, 0.19189453125, 0.15771484375, 0.1358642578125, ...

embed

43742909_c0

43742909

prolog

0

Title: prolog: leave only the elements that are not repeated in a given list such that (a b a a a c c) and get (a b) Problem title: prolog: leave only the elements that are not repeated in a given list such that (a b a a a c c) and get (a b) Tags: prolog Problem: prolog: leave only the elements that are not repeated in...

prolog: leave only the elements that are not repeated in a given list such that (a b a a a c c) and get (a b) prolog: leave only the elements that are not repeated in a given list such that (a b a a a c c) and get (a b) prolog adj_dups prolog: leave only the elements that are not repeated in a given list such that (a b...

[ -0.0098876953125, 0.017578125, 0.0103759765625, 0.005523681640625, -0.01275634765625, 0.033203125, 0.00099945068359375, 0.01165771484375, 0.0174560546875, -0.016845703125, -0.02294921875, 0.004180908203125, -0.002685546875, 0.022216796875, 0.00421142578125, 0.0224609375, 0.0162353515...

[ 502, 4867, 12, 31358, 4734, 80854, 959, 119140, 297, 34475, 5303, 6044, 876, 501, 2046, 11, 606, 170, 454, 693, 6423, 23, 3917, 5608, 4488, 83, 2174, 7413, 10, 441, 4, 6863, 171763, 67, 136, 184750, 64557, 87388, 16792, 28282, 69101, ...

[ 0.202392578125, 0.265625, 0.004241943359375, 0.1806640625, 0.1085205078125, 0.15869140625, 0.1192626953125, 0.1998291015625, 0.0633544921875, 0.04351806640625, 0.143310546875, 0.039215087890625, 0.09765625, 0.0584716796875, 0.08563232421875, 0.057861328125, 0.1256103515625, 0.18811...

embed

6970408_c0

6970408

prolog

0

Title: Predicate cache Problem title: Predicate cache Tags: prolog, prolog-directive-dynamic Problem: Predicate cache Is there a Prolog implementation or library that caches predicates? Or would you implement a, say, FIFO cache using assertz/1 and retract/1, like this: :- dynamic cache/1. ccall(G) :- cache(G). ccall(G)...

Predicate cache Predicate cache prolog prolog-directive-dynamic Predicate cache_size Predicate cache Is there a Prolog implementation or library that caches predicates? Or would you implement a, say, FIFO cache using assertz/1 and retract/1, like this: In ECLiPSe-CLP, one could at least replace the findall/3 line using...

[ 0.0172119140625, -0.0054931640625, 0.01556396484375, 0.01483154296875, -0.0068359375, 0.00982666015625, -0.00421142578125, 0.01287841796875, 0.006256103515625, -0.052001953125, 0.000896453857421875, 0.0162353515625, -0.010986328125, -0.01165771484375, 0.0311279296875, 0.01190185546875,...

[ 7145, 2063, 67, 82365, 502, 4867, 936, 100034, 242554, 62539, 2685, 10, 1250, 208124, 35773, 1294, 450, 7, 1653, 1636, 29479, 32983, 51980, 17368, 237, 33657, 169, 11583, 136, 41499, 15390, 59947, 9506, 9059, 13, 37352, 19713, 91995, 7413, ...

[ 0.211181640625, 0.260986328125, 0.126220703125, 0.26904296875, 0.1566162109375, 0.25341796875, 0.06365966796875, 0.085205078125, 0.1470947265625, 0.113037109375, 0.0440673828125, 0.0145111083984375, 0.1829833984375, 0.179443359375, 0.18408203125, 0.095947265625, 0.022308349609375, ...

embed

32621071_c0

32621071

prolog

0

Title: How do I get a list from an association list in Prolog, and then either append to it or create it if it doesn't exist? Problem title: How do I get a list from an association list in Prolog, and then either append to it or create it if it doesn't exist? Tags: logic-programming, prolog, swi-prolog Proble...

How do I get a list from an association list in Prolog, and then either append to it or create it if it doesn't exist? How do I get a list from an association list in Prolog, and then either append to it or create it if it doesn't exist? logic-programming prolog swi-prolog an How Prolog get_assoc How do I get...

[ 0.01092529296875, 0.006866455078125, 0.0086669921875, -0.005645751953125, 0.0030059814453125, -0.0021820068359375, 0.0208740234375, 0.018798828125, 0.025390625, -0.028564453125, 0.0322265625, 0.0137939453125, -0.01202392578125, -0.00555419921875, 0.0115966796875, -0.0000095367431640625...

[ 11249, 2046, 5303, 1295, 125413, 1250, 4867, 114689, 71, 28282, 2174, 22027, 32316, 47, 62775, 28966, 502, 2452, 3454, 73395, 238, 18, 1556, 127, 23180, 107035, 147306, 22799, 42518, 31089, 3444, 1653, 2063, 35735, 75935, 14373, 27494, 80836,...

[ 0.0287933349609375, 0.119140625, 0.200927734375, 0.06982421875, 0.21240234375, 0.13525390625, 0.212646484375, 0.1156005859375, 0.07196044921875, 0.115478515625, 0.08892822265625, 0.009033203125, 0.16650390625, 0.00604248046875, 0.045257568359375, 0.031219482421875, 0.0543212890625, ...

embed

13899103_c0

13899103

prolog

0

Title: translate prolog to formal english Problem title: translate prolog to formal english Tags: dcg, prolog Problem: translate prolog to formal english i'm trying to write a program that translate a prolog sentence to a formal english sentence. here is my code : sentence --> [if],[the], first_phrase, second_phrase. f...

translate prolog to formal english translate prolog to formal english dcg prolog first_phrase second_phrase translate prolog to formal english i'm trying to write a program that translate a prolog sentence to a formal english sentence. here is my code : the output of this code is like the following : X = [if, the, feet...

[ 0.024169921875, -0.00140380859375, -0.0220947265625, 0.00836181640625, 0.01104736328125, 0.024658203125, -0.00732421875, 0.0157470703125, 0.00016498565673828125, -0.0216064453125, -0.00019168853759765625, -0.0019073486328125, -0.0269775390625, -0.00225830078125, 0.017822265625, 0.02709...

[ 3900, 19309, 502, 4867, 47, 23113, 175457, 177, 179665, 17932, 33022, 1528, 149357, 18151, 140992, 1884, 1193, 2203, 3190, 70, 74261, 621, 49878, 136, 132283, 34153, 44116, 4263, 65660, 54727, 12989, 83, 7401, 3584, 27751, 15190, 30022, 16750...

[ 0.1083984375, 0.141357421875, 0.13818359375, 0.223876953125, 0.11865234375, 0.21826171875, 0.1292724609375, 0.051666259765625, 0.1015625, 0.01507568359375, 0.0200042724609375, 0.102294921875, 0.0836181640625, 0.116943359375, 0.1158447265625, 0.01025390625, 0.0987548828125, 0.008209...

embed

70868219_c0

70868219

prolog

0

Title: Convert FOPL expression to prolog Problem title: Convert FOPL expression to prolog Tags: discrete-mathematics, logic, prolog Problem: Convert FOPL expression to prolog Given premises and corresponding FOPL. Goal: Prove that Marcus hated Caesar. Marcus was a Pompeian pompeian(Marcus) All Pompeians were Romans. Vx...

Convert FOPL expression to prolog Convert FOPL expression to prolog discrete-mathematics logic prolog Convert FOPL Marcus Caesar not_loyal How Everyone Convert FOPL expression to prolog Given premises and corresponding FOPL. Goal: Prove that Marcus hated Caesar. Marcus was a Pompeian pompeian(Marcus) All Pompeians were...

[ 0.013671875, -0.015625, 0.00616455078125, 0.021728515625, -0.00238037109375, 0.010986328125, -0.0034942626953125, -0.00244140625, 0.00994873046875, -0.0111083984375, -0.021728515625, -0.0189208984375, -0.0162353515625, 0.00921630859375, 0.014404296875, -0.006622314453125, 0.004882812...

[ 1657, 11549, 44944, 21130, 125195, 47, 502, 4867, 81604, 13, 140363, 62775, 102834, 64914, 959, 365, 16300, 11249, 191096, 64881, 2016, 289, 1250, 1256, 297, 509, 10, 189462, 66, 46878, 3378, 154598, 3164, 10133, 12610, 310, 425, 6315, 4010...

[ 0.04925537109375, 0.1611328125, 0.1619873046875, 0.275146484375, 0.201171875, 0.072509765625, 0.1729736328125, 0.24462890625, 0.14208984375, 0.03558349609375, 0.0914306640625, 0.1297607421875, 0.181640625, 0.2529296875, 0.1256103515625, 0.1527099609375, 0.186767578125, 0.0048828125...

embed

74578487_c0

74578487

prolog

0

Title: How to check if the elements of a range exist in a list? Problem title: How to check if the elements of a range exist in a list? Tags: prolog Problem: How to check if the elements of a range exist in a list? It is the first time that he has programmed with the Prolog language, and he wanted to know how I can sta...

How to check if the elements of a range exist in a list? How to check if the elements of a range exist in a list? prolog How Min Max existerango2 How to check if the elements of a range exist in a list? It is the first time that he has programmed with the Prolog language, and he wanted to know how I can start from a li...

[ 0.000507354736328125, -0.0101318359375, 0.0086669921875, 0.0179443359375, -0.004180908203125, 0.0277099609375, 0.00146484375, 0.001312255859375, 0.030029296875, 0.0103759765625, 0.01483154296875, 0.01611328125, 0.01092529296875, -0.02197265625, 0.0302734375, -0.01397705078125, 0.0087...

[ 11249, 47, 12765, 2174, 70, 80854, 111, 37457, 32316, 23, 5303, 502, 4867, 4211, 9920, 13835, 5445, 31, 304, 10, 26693, 678, 1250, 46876, 3714, 4034, 1295, 6626, 101935, 136, 1957, 17721, 133063, 82449, 104629, 136005, 166213, 30646, 29568,...

[ 0.09149169921875, 0.07916259765625, 0.24951171875, 0.1619873046875, 0.041046142578125, 0.25244140625, 0.06024169921875, 0.29150390625, 0.263671875, 0.1142578125, 0.24365234375, 0.1077880859375, 0.23095703125, 0.2435302734375, 0.19921875, 0.1937255859375, 0.1912841796875, 0.22766113...

embed

46131444_c0

46131444

prolog

0

Title: Find repetitions in a list Problem title: Find repetitions in a list Tags: prolog, list Problem: Find repetitions in a list How would I go about finding consecutive repetition of a string in a list in prolog. What I'm exactly trying to find, for example, is this: input => output AAAAAA => 6*(A) ABABAB => 3*(AB) ...

Find repetitions in a list Find repetitions in a list prolog list Find AAAAAA ABABAB ABCABCABC ABC is_alnum nbr_to_char str_to_list Find repetitions in a list How would I go about finding consecutive repetition of a string in a list in prolog. What I'm exactly trying to find, for example, is this: I wrote a DCG grammar...

[ 0.012451171875, 0.00010156631469726562, 0.0059814453125, 0.033447265625, -0.01324462890625, 0.022705078125, 0.01104736328125, 0.01397705078125, 0.01318359375, -0.030029296875, -0.01123046875, 0.0087890625, -0.006988525390625, 0.00885009765625, -0.005889892578125, 0.033447265625, 0.01...

[ 26040, 57346, 5256, 23, 5303, 502, 4867, 155616, 284, 15467, 11321, 49068, 571, 47457, 186944, 83, 289, 2606, 3267, 188, 9254, 7704, 6562, 1672, 90791, 148390, 1363, 79315, 66161, 31577, 7413, 27781, 56367, 122092, 147, 903, 4358 ]

[ 0.1165771484375, 0.322509765625, 0.17138671875, 0.05645751953125, 0.205078125, 0.1461181640625, 0.210693359375, 0.13427734375, 0.00396728515625, 0.1365966796875, 0.0170745849609375, 0.043304443359375, 0.09820556640625, 0.11181640625, 0.09002685546875, 0.048004150390625, 0.03625488281...

embed

58662586_c0

58662586

prolog

0

Title: How can I dynamically assert rules with conditions conjoined in the body in Prolog? Problem title: How can I dynamically assert rules with conditions conjoined in the body in Prolog? Tags: prolog Problem: How can I dynamically assert rules with conditions conjoined in the body in Prolog? My code: run_insert_form...

How can I dynamically assert rules with conditions conjoined in the body in Prolog? How can I dynamically assert rules with conditions conjoined in the body in Prolog? prolog How Prolog run_insert_format run_query odbc_query List Animal Characteristic color_rojizo Reglas How can I dynamically assert rules with conditio...

[ 0.016357421875, 0.00070953369140625, 0.0211181640625, 0.041015625, -0.0087890625, 0.003997802734375, -0.0240478515625, 0.0263671875, 0.015625, -0.0238037109375, 0.0181884765625, -0.01953125, -0.00616455078125, -0.026123046875, 0.019775390625, 0.0157470703125, 0.029296875, 0.0189208...

[ 11249, 831, 84079, 25958, 237, 33657, 91736, 678, 27289, 158, 513, 297, 14361, 1250, 4867, 73, 502, 11675, 51727, 944, 229, 65037, 32036, 82821, 21656, 2263, 720, 10576, 16920, 33602, 853, 21462, 23, 18151, 77336, 68772, 206, 913, 66419, ...

[ 0.0408935546875, 0.044525146484375, 0.1898193359375, 0.1029052734375, 0.1011962890625, 0.22314453125, 0.2034912109375, 0.08837890625, 0.2109375, 0.09075927734375, 0.1439208984375, 0.025360107421875, 0.168701171875, 0.153076171875, 0.24072265625, 0.0726318359375, 0.0516357421875, 0....

embed

10047502_c0

10047502

prolog

0

Title: Use Prolog to get data model paths from language rules? Problem title: Use Prolog to get data model paths from language rules? Tags: artificial-intelligence, dcg, prolog Problem: Use Prolog to get data model paths from language rules? I want to build a semi-natural language interface for a data warehouse. A simp...

Use Prolog to get data model paths from language rules? Use Prolog to get data model paths from language rules? artificial-intelligence dcg prolog language Use Prolog Company Departments Department Employees Employee ACME Bugs Bunny departments.employees departments.type Use Prolog to get data model paths from language...

[ 0.0185546875, 0.007781982421875, -0.01153564453125, 0.03271484375, -0.0084228515625, 0.0267333984375, 0.004974365234375, 0.0050048828125, 0.0038299560546875, -0.08740234375, -0.000293731689453125, -0.0103759765625, -0.023193359375, 0.000812530517578125, 0.0152587890625, 0.0054016113281...

[ 36836, 1250, 4867, 2046, 2053, 3299, 60875, 7, 1295, 46876, 91736, 66733, 130687, 177, 502, 33734, 63557, 365, 1033, 12944, 10611, 57279, 44666, 299, 130625, 109308, 50986, 3444, 45367, 36137, 84832, 101758, 105816, 23923, 8781, 33342, 1884, ...

[ 0.0799560546875, 0.1932373046875, 0.273681640625, 0.0814208984375, 0.1380615234375, 0.235595703125, 0.23095703125, 0.11376953125, 0.10382080078125, 0.202880859375, 0.183349609375, 0.0809326171875, 0.07879638671875, 0.0875244140625, 0.1424560546875, 0.09912109375, 0.13037109375, 0.0...

embed

50079900_c0

50079900

prolog

0

Title: List of lists into modified single list Problem title: List of lists into modified single list Tags: prolog Problem: List of lists into modified single list These are predicates which reads from input file read_line(L,C) :- get_char(C), (isEOFEOL(C), L = [], !; read_line(LL,_),% atom_codes(C,[Cd]), [C|LL] = L). ...

List of lists into modified single list List of lists into modified single list prolog List read_line get_char atom_codes Tests EOF end_of_file char_code read_lines LLs A-B C-D E-F G-H Syntax Unexpected List of lists into modified single list These are predicates which reads from input file Input file: read_lines(L) re...

[ -0.01239013671875, 0.00848388671875, 0.0115966796875, 0.009033203125, -0.004730224609375, 0.003204345703125, -0.005950927734375, -0.00927734375, -0.0098876953125, -0.000568389892578125, 0.003814697265625, 0.0016021728515625, -0.01239013671875, -0.0167236328125, -0.0027618408203125, 0.0...

[ 32036, 111, 5303, 7, 3934, 73197, 297, 11001, 502, 4867, 12301, 2256, 2046, 9254, 34627, 40899, 8647, 82341, 3564, 4390, 29822, 21441, 59801, 99954, 919, 841, 19010, 86531, 992, 83613, 13, 1653, 2063, 1295, 107730, 11435, 7077, 866, 30646, ...

[ 0.1492919921875, 0.1182861328125, 0.2252197265625, 0.04779052734375, 0.1365966796875, 0.1810302734375, 0.0728759765625, 0.1561279296875, 0.11376953125, 0.2010498046875, 0.1968994140625, 0.1868896484375, 0.011016845703125, 0.06195068359375, 0.13134765625, 0.1085205078125, 0.0759887695...

embed

7400904_c0

7400904

prolog

0

Title: Discontiguous predicate warning from GNU Prolog Problem title: Discontiguous predicate warning from GNU Prolog Tags: prolog Problem: Discontiguous predicate warning from GNU Prolog For a lark I have started learning Prolog via http://www.learnprolognow.org/ . My excuse is that I have only just started. I am unsu...

Discontiguous predicate warning from GNU Prolog Discontiguous predicate warning from GNU Prolog prolog GNU Discontiguous Prolog wiz.pl wiz.pl:5 Discontiguous predicate warning from GNU Prolog For a lark I have started learning Prolog via http://www.learnprolognow.org/ . My excuse is that I have only just started. I am ...

[ 0.0115966796875, -0.00823974609375, -0.015625, 0.00994873046875, -0.0272216796875, 0.01446533203125, 0.0026702880859375, 0.0004558563232421875, 0.00439453125, -0.0294189453125, -0.0027618408203125, 0.0184326171875, -0.0172119140625, -0.0057373046875, 0, 0.01220703125, 0.0111694335937...

[ 53092, 7934, 12282, 10821, 1653, 2063, 67, 1631, 592, 1295, 165132, 1250, 4867, 502, 44239, 2424, 758, 7190, 52080, 147, 14071, 35613, 1478, 133207, 26859, 25632, 191560, 81979, 59121, 4488, 84751, 87046, 15246, 7570, 3454, 7693, 2681, 39797,...

[ 0.1044921875, 0.09039306640625, 0.188720703125, 0.0382080078125, 0.1722412109375, 0.205322265625, 0.08203125, 0.1640625, 0.0618896484375, 0.024566650390625, 0.1964111328125, 0.1763916015625, 0.2374267578125, 0.110595703125, 0.141845703125, 0.063720703125, 0.1021728515625, 0.0423278...

embed

35395548_c0

35395548

prolog

0

Title: Prolog: redundant program points in failure-slice? Problem title: Prolog: redundant program points in failure-slice? Tags: non-termination, logical-purity, failure-slice, prolog Problem: Prolog: redundant program points in failure-slice? We are implementing diagnostic tools for explaining unexpected universal no...

Prolog: redundant program points in failure-slice? Prolog: redundant program points in failure-slice? non-termination logical-purity failure-slice prolog Prolog Prolog: redundant program points in failure-slice? We are implementing diagnostic tools for explaining unexpected universal non-termination in pure, monotonic ...

[ 0.00701904296875, 0.0289306640625, -0.007415771484375, 0.003143310546875, -0.031982421875, -0.00058746337890625, -0.004791259765625, -0.00035858154296875, 0.00848388671875, -0.004486083984375, 0.00152587890625, -0.025146484375, -0.01953125, -0.01373291015625, 0.00531005859375, 0.009094...

[ 1250, 4867, 12, 4842, 35405, 1528, 26847, 137578, 7, 13348, 18, 23, 351, 720, 91407, 62775, 4717, 502, 29479, 52070, 72977, 73342, 241957, 32813, 34166, 182902, 103391, 77007, 23755, 9, 24172, 89397, 30524, 28756, 5170, 109458, 98320, 107838,...

[ 0.1591796875, 0.2451171875, 0.011871337890625, 0.097412109375, 0.21728515625, 0.1827392578125, 0.1719970703125, 0.218017578125, 0.05426025390625, 0.204833984375, 0.06317138671875, 0.0640869140625, 0.140869140625, 0.1573486328125, 0.1116943359375, 0.157470703125, 0.090087890625, 0.0...

embed

64861868_c0

64861868

prolog

0

Title: How to correct this 'Greater Than' Arithmetic Prolog code? Problem title: How to correct this 'Greater Than' Arithmetic Prolog code? Tags: prolog Problem: How to correct this 'Greater Than' Arithmetic Prolog code? I am trying to write a simple prolog program where a number is compared with th...

How to correct this 'Greater Than' Arithmetic Prolog code? How to correct this 'Greater Than' Arithmetic Prolog code? prolog How Greater Than Arithmetic Prolog Num How to correct this 'Greater Than' Arithmetic Prolog code? I am trying to write a simple prolog program where a number is compared with ...

[ 0.0091552734375, 0.007476806640625, 0.0230712890625, -0.0257568359375, 0.0081787109375, 0.0023651123046875, 0.017578125, 0.01300048828125, 0.00074005126953125, -0.003387451171875, -0.0064697265625, 0.004547119140625, -0.01434326171875, -0.01092529296875, 0.0242919921875, 0.0068359375, ...

[ 11249, 47, 26785, 903, 3768, 91127, 46429, 72820, 1172, 8962, 282, 9523, 1250, 4867, 18151, 502, 32774, 56, 52782, 31577, 33022, 8781, 1528, 14012, 154186, 80854, 5303, 12765, 450, 117396, 3501, 3129, 30646, 40715, 5386, 134186, 2947, 128191,...

[ 0.0687255859375, 0.0259857177734375, 0.200439453125, 0.088623046875, 0.1285400390625, 0.157958984375, 0.1724853515625, 0.27294921875, 0.0772705078125, 0.1683349609375, 0.09576416015625, 0.04119873046875, 0.2174072265625, 0.256591796875, 0.19921875, 0.1475830078125, 0.1785888671875, ...

embed

27505960_c1

27505960

prolog

1

:- write("Does ",Patient," have a cough (y/n) ?"), response(Reply), Reply='y'. symptom(Patient,body_ache) :- write("Does ",Patient," have a body_ache (y/n) ?"), response(Reply), Reply='y'. symptom(Patient,chills) :- write("Does ",Patient," have a chills (y/n) ?"), response(Reply), Reply='y'. symptom(Patient,sore_throa...

[ 0.004730224609375, 0.00186920166015625, 0.015869140625, 0.01153564453125, -0.009033203125, 0.0206298828125, -0.0133056640625, 0.00482177734375, -0.0086669921875, -0.0302734375, -0.00592041015625, 0.004058837890625, -0.007049560546875, 0.00677490234375, 0.00823974609375, 0.0056457519531...

[ 15772, 33022, 132, 8331, 90, 8335, 118, 2517, 765, 10, 552, 58968, 53, 64, 19, 705, 74054, 57553, 62479, 122813, 5, 128668, 37873, 46994, 14361, 1861, 42458, 149031, 46797, 42294, 257, 127124, 86, 1255, 34614, 214, 3613, 15534, 112141, 84...

[ 0.140380859375, 0.1724853515625, 0.0106201171875, 0.1092529296875, 0.1085205078125, 0.0802001953125, 0.145263671875, 0.1239013671875, 0.129638671875, 0.08697509765625, 0.12109375, 0.26953125, 0.098388671875, 0.1259765625, 0.0750732421875, 0.00921630859375, 0.032135009765625, 0.1738...

embed

47329006_c0

47329006

prolog

0

Title: SWI Prolog backtracking behavior after `read/1` call Problem title: SWI Prolog backtracking behavior after `read/1` call Tags: prolog Problem: SWI Prolog backtracking behavior after `read/1` call I was looking at another Prolog question on StackOverflow and encountered this situation. Suppose I have the followin...

SWI Prolog backtracking behavior after `read/1` call SWI Prolog backtracking behavior after `read/1` call prolog SWI Prolog Enter Backtracks Does SWI Prolog backtracking behavior after `read/1` call I was looking at another Prolog question on StackOverflow and encountered this situation. Suppose I have the following fa...

[ 0.017578125, 0.0181884765625, 0.01220703125, 0.00341796875, -0.01220703125, -0.00933837890625, 0.023193359375, 0.01202392578125, 0.0035858154296875, -0.0211181640625, 0.017333984375, 0.00811767578125, -0.035400390625, -0.010009765625, 0.0308837890625, -0.01611328125, 0.00711059570312...

[ 159, 38969, 1250, 4867, 4420, 125728, 214, 123166, 7103, 39116, 11583, 11782, 502, 60816, 26828, 101790, 156673, 118664, 15824, 46354, 2861, 117904, 105876, 81979, 87344, 1632, 29806, 110, 51347, 32316, 959, 165132, 615, 180874, 1286, 41206, 26...

[ 0.097900390625, 0.243896484375, 0.1688232421875, 0.2156982421875, 0.1820068359375, 0.260986328125, 0.0670166015625, 0.164306640625, 0.127685546875, 0.232666015625, 0.1640625, 0.1796875, 0.0804443359375, 0.06561279296875, 0.1529541015625, 0.038482666015625, 0.0231170654296875, 0.032...

embed

25634970_c0

25634970

prolog

0

Title: Simple Prolog program - Unsure about results Problem title: Simple Prolog program - Unsure about results Tags: prolog Problem: Simple Prolog program - Unsure about results Completely new to Prolog (SWI-Prolog in this case) so apologies for this very basic question. I have a simple program below. loves(vincent,mi...

Simple Prolog program - Unsure about results Simple Prolog program - Unsure about results prolog Simple Prolog Unsure honey_bunny Simple Prolog program - Unsure about results Completely new to Prolog (SWI-Prolog in this case) so apologies for this very basic question. I have a simple program below. I'm a little confuse...

[ 0.00909423828125, 0.0030975341796875, 0.004547119140625, 0.01214599609375, 0.004150390625, 0.0103759765625, -0.018798828125, 0.004425048828125, -0.0013275146484375, -0.0296630859375, 0.004974365234375, 0.0026702880859375, -0.0079345703125, 0.0107421875, 0.00946044921875, 0.008117675781...

[ 60552, 1250, 4867, 1528, 992, 56851, 1672, 50339, 502, 80493, 17643, 299, 38969, 10752, 18709, 62822, 8781, 35064, 10176, 55681, 25632, 41, 1294, 181799, 61689, 2785, 51, 41274, 9433, 35166, 10283, 152161, 44084, 3862, 16797, 99201, 35604, 16...

[ 0.1829833984375, 0.1434326171875, 0.226318359375, 0.1884765625, 0.08831787109375, 0.2132568359375, 0.08392333984375, 0.2137451171875, 0.09332275390625, 0.1778564453125, 0.082275390625, 0.1197509765625, 0.117431640625, 0.09478759765625, 0.034912109375, 0.034759521484375, 0.11474609375...

embed

36327609_c1

36327609

prolog

1

,plt,wbc,folic_acid,b12,rtc]). Now i want to take the first list and see which of those items are in kb, return a list on each kb and then compare the length of those lists and find the percentage value. Example if (Length_list==5 and Length_kb_iron==3) then k=3/5*100. and do this on all kb and the result i want to be ...

[ 0.00186920166015625, -0.017822265625, 0.003326416015625, 0.0157470703125, -0.00994873046875, 0.0026702880859375, 0.000621795654296875, 0.00836181640625, 0.009765625, -0.0128173828125, 0.021728515625, 0.0166015625, 0.01513671875, 0.00173187255859375, -0.00106048583984375, -0.00708007812...

[ 2424, 18, 75396, 238, 3584, 9120, 55964, 1530, 3444, 5646, 5117, 5303, 1957, 55769, 621, 23, 51882, 30646, 12638, 69101, 140909, 7413, 169209, 34292, 89536, 449, 6562, 758, 77554, 92, 275, 14, 1900, 69112, 21320, 472, 76067, 12147, 1639, ...

[ 0.011260986328125, 0.0261383056640625, 0.003204345703125, 0.011199951171875, 0.019866943359375, 0.0528564453125, 0.0533447265625, 0.1119384765625, 0.0767822265625, 0.04541015625, 0.06365966796875, 0.2047119140625, 0.08154296875, 0.1839599609375, 0.043060302734375, 0.128173828125, 0.2...

embed

55593598_c1

55593598

prolog

1

- each worker can serve only one service/day global_cardinality() to count number of occurrences for each number 1..19 for list with short services and long services - this defines variables LSUM_X and SSUM_X - number of occurrences of worker X in L ong or S hort services SUM_X #= 12*LSUM_X + 8*SSUM_X for each worker ...

[ -0.001617431640625, 0.000354766845703125, 0.0023040771484375, -0.0050048828125, -0.02490234375, -0.0201416015625, -0.01361083984375, 0.015380859375, 0.014404296875, -0.037353515625, -0.0140380859375, 0.00738525390625, 0.007232666015625, 0.01275634765625, 0.00372314453125, 0.01940917968...

[ 12638, 4488, 56, 831, 21265, 4734, 1632, 4516, 64, 5636, 7964, 38931, 73, 134393, 132, 54529, 14012, 74918, 42, 69098, 2947, 5303, 16610, 11374, 136, 4989, 61924, 77336, 339, 127944, 454, 1542, 159, 114817, 3328, 18, 427, 382, 100, 425, ...

[ 0.1243896484375, 0.1395263671875, 0.1229248046875, 0.063232421875, 0.203857421875, 0.1044921875, 0.1416015625, 0.2181396484375, 0.0616455078125, 0.134521484375, 0.1519775390625, 0.12841796875, 0.1378173828125, 0.146728515625, 0.0079345703125, 0.1513671875, 0.090576171875, 0.1252441...

embed

74566722_c0

74566722

prolog

0

Title: Prolog Predicate that returns Sum of weights of items in a list Problem title: Prolog Predicate that returns Sum of weights of items in a list Tags: sum, prolog, list Problem: Prolog Predicate that returns Sum of weights of items in a list I want to write a prolog predicate that takes in a list of items, searche...

Prolog Predicate that returns Sum of weights of items in a list Prolog Predicate that returns Sum of weights of items in a list sum prolog list Prolog Predicate Sum list_sum Head Tail TotalSum Sum1 total_weight H_entity T_entity H_weight T_weight Prolog Predicate that returns Sum of weights of items in a list I want to...

[ 0.007080078125, 0.0103759765625, 0.00482177734375, 0.00171661376953125, -0.021728515625, 0.0194091796875, -0.0208740234375, 0.0242919921875, 0.01019287109375, -0.037109375, 0.0125732421875, -0.0064697265625, 0.005126953125, -0.00038909912109375, 0.0146484375, 0.01806640625, 0.0207519...

[ 1250, 4867, 7145, 2063, 67, 30646, 36335, 111, 57888, 7, 55769, 5303, 23, 10554, 502, 11832, 44816, 1218, 379, 33867, 316, 418, 3622, 165598, 572, 2517, 384, 450, 3444, 33022, 1653, 51776, 33938, 42518, 3714, 2046, 20697, 13452, 52080 ]

[ 0.1375732421875, 0.2132568359375, 0.139404296875, 0.1812744140625, 0.07012939453125, 0.158935546875, 0.1973876953125, 0.0091552734375, 0.211669921875, 0.023101806640625, 0.1671142578125, 0.1925048828125, 0.039520263671875, 0.2117919921875, 0.122314453125, 0.1685791015625, 0.104736328...

embed

53794232_c1

53794232

prolog

1

StartNode), Sol = [StartNode]. traverse(StartNode,Sol,Visit) :- changeState(StartNode, NextNode), not(member(NextNode, Visit)), traverse(NextNode, PartialSol, [NextNode|Visit]), Sol = [StartNode | PartialSol]. When I execute this code, I get these errors: ERROR: Arguments are not sufficiently instantiated ERROR: In: ER...

[ -0.021240234375, 0.01141357421875, 0.0245361328125, 0.011474609375, -0.0023040771484375, 0.02197265625, -0.0303955078125, -0.02197265625, 0.00518798828125, -0.00482177734375, 0.013427734375, 0.0238037109375, 0.00396728515625, 0.01953125, 0.00714111328125, -0.00445556640625, 0.0005836...

[ 13794, 5021, 112, 6678, 2203, 126597, 37317, 13, 102588, 65331, 217, 15549, 135206, 4997, 959, 27417, 81280, 98684, 9148, 289, 71924, 903, 18151, 18499, 151206, 24638, 112140, 129980, 34648, 27686, 360, 85090, 88438, 4046, 157979, 35604, 63652,...

[ 0.1754150390625, 0.1904296875, 0.0975341796875, 0.1964111328125, 0.0135498046875, 0.1700439453125, 0.1895751953125, 0.09002685546875, 0.1943359375, 0.1494140625, 0.100341796875, 0.226318359375, 0.19873046875, 0.150390625, 0.1173095703125, 0.139404296875, 0.11279296875, 0.1859130859...

embed

43314658_c0

43314658

prolog

0

Title: What are the requirements a computer function must meet to be considered "monotonic"? Problem title: What are the requirements a computer function must meet to be considered "monotonic"? Tags: prolog, logical-purity, logic Problem: What are the requirements a computer function must meet to be...

What are the requirements a computer function must meet to be considered "monotonic"? What are the requirements a computer function must meet to be considered "monotonic"? prolog logical-purity logic What What are the requirements a computer function must meet to be considered "monotonic"? What are ...

[ 0.00714111328125, -0.00335693359375, 0.0142822265625, 0.02490234375, 0.01397705078125, 0.006591796875, 0.0035247802734375, -0.0167236328125, -0.00274658203125, -0.005859375, -0.00372314453125, 0.0213623046875, -0.038330078125, -0.00384521484375, 0.0036773681640625, 0.01806640625, 0.0...

[ 96679, 13909, 32354, 8110, 23356, 90698, 64176, 188, 6402, 502, 4867, 62775, 289, 4717, 2481, 621, 70, 232578, 19714, 2063, 16916, 163136, 8162, 182902, 1771, 60892, 138155, 55738, 11, 59911, 147118, 75412, 56037, 6305, 41361, 28960, 105233, ...

[ 0.2244873046875, 0.2188720703125, 0.26806640625, 0.0855712890625, 0.1478271484375, 0.128173828125, 0.21240234375, 0.230712890625, 0.2193603515625, 0.0865478515625, 0.132568359375, 0.13037109375, 0.0067138671875, 0.104736328125, 0.0158538818359375, 0.00701904296875, 0.0158233642578125...

embed

29263638_c0

29263638

prolog

0

Title: Prolog - Updating Dynamic Lists Problem title: Prolog - Updating Dynamic Lists Tags: search, prolog, list, dynamic Problem: Prolog - Updating Dynamic Lists I want to update two dynamic lists for a breadth search. Although they do update in the background, their value that got instantiate in the initiate predicat...

Prolog - Updating Dynamic Lists Prolog - Updating Dynamic Lists search prolog list dynamic Prolog Updating Dynamic Lists Start OPEN CLOSE Result Prolog - Updating Dynamic Lists I want to update two dynamic lists for a breadth search. Although they do update in the background, their value that got instantiate in the ini...

[ 0.025146484375, 0.00982666015625, 0.01904296875, 0.015625, -0.006683349609375, 0.0118408203125, 0.00147247314453125, 0.021728515625, 0.0111083984375, -0.021484375, 0.01220703125, 0.00168609619140625, -0.00015354156494140625, -0.000911712646484375, 0.0257568359375, -0.01031494140625, ...

[ 1250, 4867, 10091, 56464, 73327, 21068, 32036, 33938, 502, 5303, 84079, 13794, 180, 65441, 92933, 126684, 3444, 28350, 6626, 179967, 927, 76615, 34292, 34648, 173969, 1653, 2063, 23742, 18, 9803, 136, 155738, 98, 126597, 8560, 1284, 647, 1114...

[ 0.168701171875, 0.21435546875, 0.1019287109375, 0.10986328125, 0.1265869140625, 0.0811767578125, 0.1976318359375, 0.1754150390625, 0.115478515625, 0.2037353515625, 0.201171875, 0.10333251953125, 0.07391357421875, 0.156494140625, 0.143798828125, 0.1131591796875, 0.0606689453125, 0.1...

embed

47707005_c0

47707005

prolog

0

Title: Automated query testing against a knowledge base in Prolog Problem title: Automated query testing against a knowledge base in Prolog Tags: prolog, swi-prolog Problem: Automated query testing against a knowledge base in Prolog I have a db with some facts and a file with some predicates that I defined. /* facts.pl...

Automated query testing against a knowledge base in Prolog Automated query testing against a knowledge base in Prolog prolog swi-prolog Automated Prolog facts.pl dog_person predicates.pl has_dog something_else Query Out queries.pl Done Automated query testing against a knowledge base in Prolog I have a db with some fac...

[ 0.032470703125, 0.017822265625, 0.017578125, 0.01153564453125, -0.0036468505859375, 0.004852294921875, 0.005706787109375, 0.0027618408203125, -0.0028533935546875, -0.0537109375, 0.01318359375, 0.0203857421875, -0.0255126953125, 0.0038299560546875, -0.00775146484375, 0.0172119140625, ...

[ 51719, 297, 41, 1294, 134234, 26548, 51359, 3647, 1250, 4867, 502, 2452, 3454, 15824, 2424, 10269, 30816, 1653, 2063, 1636, 1556, 38507, 9844, 5557, 58836, 13538, 10484, 40041, 11435, 61924, 3034, 3871, 11675, 5303, 149016, 3917, 107730, 1263...

[ 0.2291259765625, 0.012847900390625, 0.17578125, 0.1280517578125, 0.22216796875, 0.1929931640625, 0.1529541015625, 0.182861328125, 0.1612548828125, 0.25634765625, 0.088134765625, 0.1112060546875, 0.11083984375, 0.125, 0.0579833984375, 0.128662109375, 0.0693359375, 0.1744384765625, ...

embed

16636100_c1

16636100

prolog

1

to evaluate and say if it belong to my language or not. A sentence have to be formed in the following way: sentence2(VP) --> noun_phrase2(Actor), verb_phrase2(Actor, VP). (by something that is noun phrase followed by something that is a verb phrase . A noun phrase is composed in this way: noun_phrase2(Name) --> proper...

[ -0.003936767578125, -0.00099945068359375, 0.000823974609375, 0.034912109375, 0.0162353515625, 0.0294189453125, 0.003173828125, 0.0198974609375, 0.016357421875, -0.029052734375, 0.0242919921875, 0.0027618408203125, 0.01226806640625, -0.0087890625, -0.0021820068359375, 0.0169677734375, ...

[ 47, 151575, 13, 136, 5154, 2174, 442, 10617, 759, 46876, 707, 959, 62, 149357, 100, 4806, 3917, 304, 41195, 110, 309, 179665, 184, 284, 18770, 42792, 113860, 150350, 163612, 27798, 10, 83, 9351, 91084, 111, 8781, 390, 13315, 66159, 19, ...

[ 0.1474609375, 0.1748046875, 0.0594482421875, 0.03778076171875, 0.1005859375, 0.0712890625, 0.0286865234375, 0.1990966796875, 0.0740966796875, 0.1920166015625, 0.0305938720703125, 0.0570068359375, 0.012359619140625, 0.20068359375, 0.07891845703125, 0.08050537109375, 0.043975830078125,...

embed

20501277_c0

20501277

prolog

0

Title: How to modify sentence parsing rules in Prolog? Problem title: How to modify sentence parsing rules in Prolog? Tags: prolog Problem: How to modify sentence parsing rules in Prolog? While parsing list of strings the current rules allow comma to be at the end of the sentence and not allow comma to be between words...

How to modify sentence parsing rules in Prolog? How to modify sentence parsing rules in Prolog? prolog How Prolog TEST How to modify sentence parsing rules in Prolog? While parsing list of strings the current rules allow comma to be at the end of the sentence and not allow comma to be between words, which is obviously ...

[ 0.010009765625, 0.0234375, 0.0069580078125, 0.032470703125, -0.00274658203125, 0.01025390625, -0.0023193359375, 0.0213623046875, 0.01202392578125, -0.003753662109375, 0.01177978515625, -0.016357421875, -0.0000762939453125, -0.01043701171875, 0.01806640625, 0.0247802734375, 0.01409912...

[ 11249, 2811, 40383, 149357, 366, 6953, 91736, 1250, 4867, 23, 502, 384, 21828, 47, 5303, 79315, 43581, 63769, 96117, 186, 3564, 17721, 34153, 171259, 959, 26785, 86869, 43240 ]

[ 0.06829833984375, 0.1512451171875, 0.1551513671875, 0.1824951171875, 0.1689453125, 0.09796142578125, 0.1739501953125, 0.16455078125, 0.256103515625, 0.03546142578125, 0.0927734375, 0.04656982421875, 0.0950927734375, 0.005828857421875, 0.096923828125, 0.137451171875, 0.10595703125, ...

embed

78311486_c0

78311486

prolog

0

Title: ECLiPSe create 2D matrix with C++ interfacing Problem title: ECLiPSe create 2D matrix with C++ interfacing Tags: prolog, c%2B%2B, eclipse-clp Problem: ECLiPSe create 2D matrix with C++ interfacing I have a predicate that I use to initialise a 2D matrix in eclipse: problem(1, []( [](1,2,3,4), [](1,2,4,3), [](1,3,...

ECLiPSe create 2D matrix with C++ interfacing ECLiPSe create 2D matrix with C++ interfacing prolog c%2B%2B eclipse-clp ECLiPSe EC_functor matrix4 EC_word matrix3 ecl_refs_create ECLiPSe create 2D matrix with C++ interfacing I have a predicate that I use to initialise a 2D matrix in eclipse: I'd like to use a C++ progra...

[ 0.036865234375, 0.00225830078125, -0.009033203125, 0.01318359375, 0.00335693359375, 0.01416015625, -0.0062255859375, 0.017578125, -0.00070953369140625, -0.0289306640625, 0.0118408203125, 0.00189208984375, -0.008056640625, -0.005096435546875, -0.007232666015625, 0.0208740234375, 0.009...

[ 59947, 9506, 9059, 13, 28282, 116, 397, 50944, 425, 678, 313, 37223, 1940, 91468, 502, 4867, 501, 28, 106371, 184, 26775, 16498, 18770, 617, 47416, 363, 34937, 29087, 7612, 1653, 2063, 4527, 61475, 3075, 23, 1884, 1528, 101758, 3917, 1295...

[ 0.115966796875, 0.1502685546875, 0.1201171875, 0.110595703125, 0.1373291015625, 0.15380859375, 0.156494140625, 0.2164306640625, 0.1268310546875, 0.052276611328125, 0.0640869140625, 0.2607421875, 0.0906982421875, 0.1473388671875, 0.0897216796875, 0.1396484375, 0.004119873046875, 0.0...

embed

66725859_c0

66725859

prolog

0

Title: Prolog - Comparison between 1 and 0.5 fails Problem title: Prolog - Comparison between 1 and 0.5 fails Tags: prolog Problem: Prolog - Comparison between 1 and 0.5 fails I have a very basic function which basically does comparison of the input numbers with some constants. Here is the code - check(FEATURE_0, FEATU...

Prolog - Comparison between 1 and 0.5 fails Prolog - Comparison between 1 and 0.5 fails prolog Prolog Comparison FEATURE_0 FEATURE_1 FEATURE_2 FEATURE_3 FEATURE_4 FEATURE_5 Fails Fail Prolog - Comparison between 1 and 0.5 fails I have a very basic function which basically does comparison of the input numbers with some ...

[ -0.000885009765625, -0.005828857421875, 0.01019287109375, -0.0220947265625, 0.01397705078125, -0.0037994384765625, -0.00933837890625, -0.004608154296875, 0.00634765625, 0.032958984375, 0.00836181640625, -0.002288818359375, 0.0025177001953125, -0.012939453125, 0.00970458984375, 0.004669...

[ 1250, 4867, 113307, 40514, 17721, 106, 81730, 35782, 136, 502, 24040, 165471, 2389, 115187, 363, 617, 758, 190355, 62822, 32354, 225490, 107730, 101935, 678, 53697, 18151, 78293, 563, 11907, 3789, 34292, 11343, 757, 13315, 138, 13254, 977, 12...

[ 0.1676025390625, 0.2352294921875, 0.1966552734375, 0.1561279296875, 0.10015869140625, 0.09735107421875, 0.26806640625, 0.201171875, 0.055206298828125, 0.1334228515625, 0.072998046875, 0.10150146484375, 0.0748291015625, 0.0196533203125, 0.0206298828125, 0.03375244140625, 0.07232666015...

embed

46793293_c0

46793293

prolog

0

Title: Get elements which are not in second list Problem title: Get elements which are not in second list Tags: prolog, member, list Problem: Get elements which are not in second list What I'm trying to accomplish is to get what 'Components' are not being used. So I created a list with all the 'Components' and 'In Use ...

Get elements which are not in second list Get elements which are not in second list prolog member list Get comp_list Comp inuse_list List Elements Get elements which are not in second list What I'm trying to accomplish is to get what 'Components' are not being used. So I created a list with all the 'Components' and 'In...

[ -0.0203857421875, -0.0025787353515625, 0.0279541015625, 0.018310546875, -0.0242919921875, 0.0238037109375, -0.0013275146484375, 0.0076904296875, 0.0189208984375, -0.017822265625, -0.017822265625, 0.006683349609375, 0.0086669921875, 0.0213623046875, -0.00121307373046875, -0.005218505859...

[ 20779, 80854, 3129, 621, 959, 23, 17932, 5303, 502, 4867, 32786, 9969, 6562, 15612, 4032, 32036, 48325, 31577, 163846, 2046, 10770, 54137, 8035, 11814, 75935, 4153, 36836, 6528, 69101, 28282, 15935, 18, 14858, 3714, 54, 11627, 91995, 678, 1...

[ 0.1202392578125, 0.1839599609375, 0.0207672119140625, 0.051361083984375, 0.13427734375, 0.095947265625, 0.133544921875, 0.1571044921875, 0.1204833984375, 0.1766357421875, 0.192626953125, 0.1932373046875, 0.13671875, 0.1334228515625, 0.1005859375, 0.1229248046875, 0.159912109375, 0....

embed

33204261_c0

33204261

prolog

0

Title: Display elements of requested fact Problem title: Display elements of requested fact Tags: prolog Problem: Display elements of requested fact I am very new to Prolog and I'm struggling to understand what I have done wrong. I'm trying to get user input in the form of one keyword and then display the full details ...

Display elements of requested fact Display elements of requested fact prolog Display acc10707 b228 mng10247 com00207 b727 Please Name Day Time Prof Room Display elements of requested fact I am very new to Prolog and I'm struggling to understand what I have done wrong. I'm trying to get user input in the form of one key...

[ 0.041259765625, 0.00933837890625, 0.007354736328125, 0.0208740234375, -0.00494384765625, 0.0177001953125, -0.0019683837890625, 0.002227783203125, -0.00775146484375, -0.0167236328125, -0.007476806640625, -0.024658203125, -0.0380859375, 0.0107421875, -0.01239013671875, 0.00811767578125, ...

[ 90045, 80854, 111, 50336, 297, 15824, 502, 4867, 50015, 963, 158367, 134712, 449, 142430, 375, 97259, 3768, 30607, 15757, 10013, 19055, 11739, 38484, 3525, 1250, 237875, 28219, 16940, 44691, 31577, 38937, 107730, 3173, 1632, 166117, 44116, 4393...

[ 0.22607421875, 0.1907958984375, 0.088623046875, 0.193359375, 0.09326171875, 0.2138671875, 0.125244140625, 0.251708984375, 0.0226898193359375, 0.0207061767578125, 0.1058349609375, 0.1280517578125, 0.036895751953125, 0.0780029296875, 0.0166778564453125, 0.0217132568359375, 0.0559692382...

embed

14547932_c0

14547932

prolog

0

Title: Prolog infinite loop Problem title: Prolog infinite loop Tags: xsb, b-prolog, failure-slice, swi-prolog, prolog Problem: Prolog infinite loop This is a program that should find out who is compatible with john. I am new to Prolog. In order to let Prolog know eg. met(X,Y) = met (Y,X) lots of code has been written....

Prolog infinite loop Prolog infinite loop xsb b-prolog failure-slice swi-prolog prolog Prolog Temp Prolog infinite loop This is a program that should find out who is compatible with john. I am new to Prolog. In order to let Prolog know eg. met(X,Y) = met (Y,X) lots of code has been written. Now when I start the query i...

[ 0.0152587890625, -0.007293701171875, 0.0159912109375, 0.0247802734375, 0.011474609375, -0.0030975341796875, 0.00469970703125, 0.02001953125, 0.0093994140625, -0.06201171875, 0.01300048828125, 0.00543212890625, -0.006439208984375, -0.00604248046875, 0.025634765625, 0.03076171875, 0.01...

[ 1250, 4867, 54241, 13, 40956, 1022, 275, 876, 3454, 137578, 13348, 2452, 502, 37446, 1528, 5608, 7413, 1810, 2750, 83, 146731, 678, 35254, 19, 3525, 3714, 30046, 435, 1542, 1723, 2203, 71358, 18151, 59121, 3229, 4034, 41, 1294, 60899, 393...

[ 0.195068359375, 0.2685546875, 0.1771240234375, 0.130615234375, 0.23388671875, 0.0200958251953125, 0.11767578125, 0.0662841796875, 0.14599609375, 0.1929931640625, 0.1121826171875, 0.118896484375, 0.111328125, 0.1669921875, 0.1451416015625, 0.00323486328125, 0.055145263671875, 0.0496...

embed

27160156_c0

27160156

prolog

0

Title: Prolog Infinite loop (cyclic graph) Problem title: Prolog Infinite loop (cyclic graph) Tags: prolog, graph-theory, infinite-loop, transitive-closure Problem: Prolog Infinite loop (cyclic graph) this might be a simple problem but I need to do it differently. The problem is that I have to find in prolog the possib...

Prolog Infinite loop (cyclic graph) Prolog Infinite loop (cyclic graph) prolog graph-theory infinite-loop transitive-closure Prolog Infinite from_to Prolog Infinite loop (cyclic graph) this might be a simple problem but I need to do it differently. The problem is that I have to find in prolog the possible routes of air...

[ 0.0186767578125, -0.003814697265625, 0.011962890625, 0.033203125, -0.0135498046875, -0.0081787109375, 0.0029296875, 0.01409912109375, 0.007232666015625, -0.0673828125, 0.00408935546875, 0.0005645751953125, -0.0167236328125, 0.01397705078125, 0.0172119140625, 0.018310546875, 0.0137329...

[ 1250, 4867, 134322, 13, 40956, 187830, 41382, 502, 2347, 54241, 28354, 62621, 5844, 170224, 1295, 188, 8781, 2967, 12921, 7413, 7722, 36439, 111, 1831, 420, 20016, 51359, 3647, 3249, 1653, 2063, 1542, 1723, 12765, 2174, 831, 738, 1193, 47, ...

[ 0.1539306640625, 0.2479248046875, 0.1680908203125, 0.0726318359375, 0.189208984375, 0.1705322265625, 0.2000732421875, 0.1602783203125, 0.01336669921875, 0.1290283203125, 0.1636962890625, 0.085205078125, 0.00665283203125, 0.149658203125, 0.116455078125, 0.07952880859375, 0.01602172851...

embed

49991063_c0

49991063

prolog

0

Title: Age word prob|em in prolog Problem title: Age word prob|em in prolog Tags: prolog Problem: Age word prob|em in prolog I know that: Nick = 2 * Kate (Kate + Lea) = 2 * Nick (Chris + Nick) = 2 * (Kate + Lea) Ashley = 24 Ashley + Kate + Lea = 2 * (Chris + Nick) After some cancellation I found out that: Ashley = 12 *...

Age word prob|em in prolog Age word prob|em in prolog prolog Age use_module Ashley Lea Nick Chris Kate Age word prob|em in prolog I know that: Nick = 2 * Kate (Kate + Lea) = 2 * Nick (Chris + Nick) = 2 * (Kate + Lea) Ashley = 24 Ashley + Kate + Lea = 2 * (Chris + Nick) After some cancellation I found out that: Ashley =...

[ -0.00811767578125, -0.006591796875, 0.006683349609375, 0.0045166015625, -0.000415802001953125, 0.0167236328125, -0.006072998046875, 0.0218505859375, 0.0009002685546875, -0.042724609375, 0.0035400390625, -0.0155029296875, 0.01153564453125, 0.0179443359375, 0.0185546875, 0.0181884765625,...

[ 72944, 2565, 43011, 58745, 195, 23, 502, 4867, 4527, 83279, 180205, 54642, 47801, 31745, 37958, 3714, 2203, 116, 661, 8139, 67, 997, 3679, 744, 126136, 427, 138, 305, 201, 13538, 187895, 79786, 5885, 117914, 831, 1363, 10176, 55681, 15490, ...

[ 0.2371826171875, 0.166748046875, 0.1922607421875, 0.013580322265625, 0.17919921875, 0.0601806640625, 0.1934814453125, 0.21923828125, 0.109619140625, 0.1683349609375, 0.242431640625, 0.176513671875, 0.17822265625, 0.1767578125, 0.2276611328125, 0.0615234375, 0.016021728515625, 0.099...

embed

64845832_c0

64845832

prolog

0

Title: to find a list of ten even integer reading an integer (N) from the keyboard,first element is the first even number after N Problem title: to find a list of ten even integer reading an integer (N) from the keyboard,first element is the first even number after N Tags: prolog Problem: to find a list of ten even int...

to find a list of ten even integer reading an integer (N) from the keyboard,first element is the first even number after N to find a list of ten even integer reading an integer (N) from the keyboard,first element is the first even number after N prolog the FirstNumber nth1 to find a list of ten even integer reading an ...

[ -0.008056640625, -0.005828857421875, 0.0019989013671875, 0.00433349609375, 0.00145721435546875, 0.023681640625, -0.0021820068359375, 0.012451171875, 0.0048828125, -0.026611328125, 0.0113525390625, -0.03369140625, -0.0294189453125, -0.002410888671875, 0.01708984375, 0.0018157958984375, ...

[ 47, 7413, 5303, 111, 1492, 3853, 892, 1505, 16454, 839, 1295, 149186, 13448, 271, 12830, 83, 5117, 14012, 7103, 541, 502, 4867, 23972, 18444, 26278, 653, 927, 418, 89536, 12301, 17480, 70541, 2592, 2485, 1819, 1549, 2357, 4046, 3882, 1197...

[ 0.042205810546875, 0.1468505859375, 0.18359375, 0.0269775390625, 0.22509765625, 0.22119140625, 0.1580810546875, 0.1400146484375, 0.2000732421875, 0.165771484375, 0.13232421875, 0.260498046875, 0.0975341796875, 0.0643310546875, 0.1781005859375, 0.00506591796875, 0.1025390625, 0.1612...

embed

42370513_c1

42370513

prolog

1

thousands of predicates with possible typing or copy/paste mistakes and you can see the need. Other considerations I have also considered having a master copy of the term in the predicate and then using that to make the three copies. The problem with that is one of the copies is used in selecting the predicate, so bef...

[ 0.0013427734375, 0.025634765625, -0.0057373046875, 0.01092529296875, -0.01519775390625, 0.01239013671875, 0.0072021484375, 0.0038604736328125, 0.004241943359375, -0.0240478515625, 0.01544189453125, -0.0022125244140625, 0.000331878662109375, 0.004974365234375, 0.0062255859375, 0.0253906...

[ 137107, 111, 1653, 2063, 1636, 7722, 11417, 43658, 64, 134665, 121742, 831, 1957, 70, 3871, 177229, 90698, 19441, 31347, 13579, 67, 17368, 3249, 17262, 71200, 2967, 1632, 11814, 36849, 8108, 133291, 2806, 765, 3687, 959, 219836, 1556, 23, 5...

[ 0.1322021484375, 0.02142333984375, 0.1903076171875, 0.2200927734375, 0.1259765625, 0.106201171875, 0.1121826171875, 0.197021484375, 0.016510009765625, 0.1138916015625, 0.139404296875, 0.0252838134765625, 0.0689697265625, 0.002197265625, 0.1571044921875, 0.05511474609375, 0.0874023437...

embed

34033215_c0

34033215

prolog

0

Title: Check if the position if less then or greater then another position prolog Problem title: Check if the position if less then or greater then another position prolog Tags: shortest-path, prolog Problem: Check if the position if less then or greater then another position prolog I have revised this question to be m...

Check if the position if less then or greater then another position prolog Check if the position if less then or greater then another position prolog shortest-path prolog Check Row What Rows TempR Tail Where TWhere Check if the position if less then or greater then another position prolog I have revised this question t...

[ 0.00909423828125, 0.01177978515625, 0.006866455078125, 0.0021820068359375, 0.0087890625, -0.004669189453125, 0.020263671875, 0.00335693359375, 0.01904296875, -0.00408935546875, 0.029052734375, 0.01129150390625, 0.00194549560546875, -0.011474609375, 0.00836181640625, 0.0029449462890625,...

[ 38679, 2174, 19069, 40715, 7068, 707, 117396, 15700, 502, 4867, 16610, 525, 128405, 96190, 37446, 1052, 1218, 379, 35593, 70, 29458, 16487, 100, 31577, 7413, 2858, 4, 10461, 83, 3501, 17727, 25632, 18151, 12830, 8035, 2367, 30646, 3444, 106...

[ 0.197998046875, 0.1116943359375, 0.2379150390625, 0.234130859375, 0.158935546875, 0.0732421875, 0.2064208984375, 0.0838623046875, 0.140869140625, 0.2012939453125, 0.1287841796875, 0.0594482421875, 0.1376953125, 0.1527099609375, 0.123779296875, 0.04083251953125, 0.047515869140625, 0...

embed

71967110_c0

71967110

prolog

0

Title: Remove invariants from some prolog list? Problem title: Remove invariants from some prolog list? Tags: invariants, reduce, prolog Problem: Remove invariants from some prolog list? I am searching some predicate: reduce_2n_invariant(+I, +F, -O) based on: some input list I some input operator F of form fx , which g...

Remove invariants from some prolog list? Remove invariants from some prolog list? invariants reduce prolog some Remove reduce_2n_invariant invariant_2 LIn LOut test.pl:2:5 Syntax Operator test.pl:4:5 Remove invariants from some prolog list? I am searching some predicate: based on: some input list I some input operator ...

[ -0.007110595703125, -0.0194091796875, 0.001312255859375, 0.00830078125, -0.01318359375, -0.0107421875, -0.01220703125, 0.0107421875, 0.007659912109375, -0.009765625, 0.02734375, 0.0162353515625, 0.007415771484375, 0.000457763671875, 0.005615234375, 0.0111083984375, 0.003387451171875,...

[ 181139, 23, 162591, 7, 1295, 502, 4867, 5303, 3060, 34390, 304, 19, 73, 1003, 3034, 2424, 758, 150922, 157318, 2063, 35509, 107730, 87, 39933, 563, 3173, 102317, 139392, 140992, 180, 40407, 4537, 35431, 190659, 116, 20028, 653, 47, 113, 2...

[ 0.1678466796875, 0.1536865234375, 0.2841796875, 0.092529296875, 0.07781982421875, 0.176513671875, 0.2227783203125, 0.1708984375, 0.04913330078125, 0.1871337890625, 0.06964111328125, 0.0195770263671875, 0.0865478515625, 0.034210205078125, 0.09832763671875, 0.022613525390625, 0.0496215...

embed

72706505_c0

72706505

prolog

0

Title: How to negate in prolog? Problem title: How to negate in prolog? Tags: prolog, negation Problem: How to negate in prolog? I can't understand how the negation works in Prolog. I followed some questions on the same topic but I still can't figure it out, so, sorry if this is repetitive Say I have this rules: female...

How to negate in prolog? How to negate in prolog? prolog negation How not_parent father_of mother_of How to negate in prolog? I can't understand how the negation works in Prolog. I followed some questions on the same topic but I still can't figure it out, so, sorry if this is repetitive Say I have this rules: What I'm ...

[ -0.00421142578125, 0.01202392578125, 0.01043701171875, 0.00555419921875, -0.025146484375, 0.00714111328125, 0.00665283203125, -0.006927490234375, -0.004852294921875, -0.006103515625, -0.01092529296875, -0.01165771484375, 0.007598876953125, 0.005126953125, 0.000652313232421875, 0.008300...

[ 11249, 47, 90584, 13, 23, 502, 4867, 108, 125682, 959, 99547, 67373, 4390, 42732, 43240, 1250, 91736, 31577, 69307, 20949, 162515, 756, 351, 76755, 37842, 837, 275, 14801, 126, 1542, 990, 45831, 98320, 27781, 4488, 123055, 100, 1193, 179140...

[ 0.0748291015625, 0.04766845703125, 0.2265625, 0.1845703125, 0.06787109375, 0.1673583984375, 0.204833984375, 0.1724853515625, 0.1995849609375, 0.150634765625, 0.1842041015625, 0.1561279296875, 0.0841064453125, 0.12158203125, 0.06732177734375, 0.1417236328125, 0.05615234375, 0.010955...

embed

24048395_c0

24048395

prolog

0

Title: Prolog iterating over list Problem title: Prolog iterating over list Tags: prolog Problem: Prolog iterating over list I am working with Prolog sample list programs and triying to do some operations on them. However, I am stuck at a point and couldn't find any solution or sample. I want to write a function which ...

Prolog iterating over list Prolog iterating over list prolog Prolog Result Prolog iterating over list I am working with Prolog sample list programs and triying to do some operations on them. However, I am stuck at a point and couldn't find any solution or sample. I want to write a function which takes two lists of inte...

[ 0.00457763671875, -0.00665283203125, -0.01025390625, 0.0013885498046875, 0.00177764892578125, 0.002655029296875, -0.000713348388671875, -0.005157470703125, 0.006866455078125, -0.00860595703125, 0.015625, 0.002685546875, -0.0098876953125, -0.020751953125, 0.002410888671875, -0.016723632...

[ 1250, 4867, 17, 67, 98767, 645, 5303, 502, 126684, 20697, 121413, 103391, 41018, 179933, 6275, 29806, 3444, 33022, 32354, 51776, 6626, 892, 26255, 30646, 21917, 257, 34292, 13267, 105950, 16750, 225490, 101637, 69101, 11907, 111410, 5117, 17932...

[ 0.1683349609375, 0.24560546875, 0.068359375, 0.20263671875, 0.1356201171875, 0.1737060546875, 0.199462890625, 0.11669921875, 0.199951171875, 0.034454345703125, 0.125, 0.07373046875, 0.1180419921875, 0.03900146484375, 0.004364013671875, 0.0780029296875, 0.05584716796875, 0.087524414...

embed

19876127_c0

19876127

prolog

0

Title: Process a list of lists in Prolog (Go game) Problem title: Process a list of lists in Prolog (Go game) Tags: artificial-intelligence, prolog Problem: Process a list of lists in Prolog (Go game) I am suffering from this Prolog predicate: board(Before,_,After) . Where Before is a list of lists of character, either...

Process a list of lists in Prolog (Go game) Process a list of lists in Prolog (Go game) artificial-intelligence prolog Process Prolog Before After Process a list of lists in Prolog (Go game) I am suffering from this Prolog predicate: board(Before,_,After) . Where Before is a list of lists of character, either ‘a’, ‘b’,...

[ 0.0036773681640625, 0.006561279296875, 0.0087890625, 0.02880859375, -0.013916015625, 0.005401611328125, 0.0081787109375, 0.00604248046875, 0.0029754638671875, 0.0108642578125, 0.0030517578125, -0.0034332275390625, 0.00750732421875, 0.00128173828125, -0.000911712646484375, 0.00213623046...

[ 123996, 5303, 111, 7, 1250, 4867, 17903, 6712, 23, 66733, 130687, 502, 117371, 24372, 178707, 1653, 2063, 67, 45443, 6766, 89700, 454, 4, 46327, 78662, 62816, 11, 275, 238, 140909, 46132, 5701, 113054, 5117, 33636, 35064, 192728, 11341, 201...

[ 0.200439453125, 0.244873046875, 0.0484619140625, 0.1138916015625, 0.1915283203125, 0.250732421875, 0.1636962890625, 0.099853515625, 0.0260772705078125, 0.09716796875, 0.102783203125, 0.1190185546875, 0.2119140625, 0.2344970703125, 0.102294921875, 0.1217041015625, 0.1781005859375, 0...

embed

16698523_c0

16698523

prolog

0

Title: Problems with DCG (Prolog) Problem title: Problems with DCG (Prolog) Tags: prolog, dcg Problem: Problems with DCG (Prolog) I am trying to work out this simple DCG assignment (Prolog) for my course. The prblem is about creating a DCG. I have already defined a Universe of Discourse in my code. But this question is...

Problems with DCG (Prolog) Problems with DCG (Prolog) prolog dcg Problems DCG Prolog Cnt Problems with DCG (Prolog) I am trying to work out this simple DCG assignment (Prolog) for my course. The prblem is about creating a DCG. I have already defined a Universe of Discourse in my code. But this question is a bit mislead...

[ 0.015869140625, 0.007171630859375, -0.006072998046875, 0.022216796875, 0.005279541015625, 0.002166748046875, 0.0059814453125, -0.0225830078125, 0.0211181640625, -0.044921875, -0.016357421875, -0.01043701171875, -0.006683349609375, 0.00994873046875, 0.0179443359375, 0.00994873046875, ...

[ 15649, 7, 678, 391, 56367, 10752, 4867, 502, 104, 238, 177, 1250, 660, 31577, 4488, 8781, 95486, 674, 100, 759, 15411, 2661, 105233, 21771, 61924, 153543, 111, 6206, 100599, 18151, 9655, 4785, 1239, 14507, 6238, 12301, 10002, 73048, 134031,...

[ 0.1951904296875, 0.0236358642578125, 0.14697265625, 0.146728515625, 0.24609375, 0.1409912109375, 0.2220458984375, 0.1336669921875, 0.082275390625, 0.05609130859375, 0.1187744140625, 0.1236572265625, 0.0604248046875, 0.04791259765625, 0.044036865234375, 0.089111328125, 0.124755859375,...

embed

20337029_c1

20337029

prolog

1

, since it holds no info about them. The drawing of this board would be basicly turning the 0's into spaces, and the board would be drawn like this: 3 6 6 3 1 2 1 1 3 2 3 4 1 which is a decent representation of a real hashi board. The point now is to be able to draw the same thing, but also draw bridges if there's any....

[ -0.0257568359375, -0.002716064453125, 0.002838134765625, 0.0216064453125, -0.0196533203125, 0.0223388671875, 0.004302978515625, -0.014892578125, 0.00897216796875, -0.004119873046875, -0.010498046875, -0.0284423828125, -0.0017242431640625, 0.016357421875, -0.034912109375, -0.01818847656...

[ 16792, 442, 16401, 110, 3004, 1672, 2856, 188304, 111, 903, 45443, 2806, 186, 62822, 174548, 757, 25, 3934, 32628, 79442, 19, 1884, 138, 305, 116, 201, 106, 8, 16797, 18811, 1363, 2773, 256, 3767, 6275, 5036, 19048, 5701, 13580, 2843, 8...

[ 0.048309326171875, 0.01934814453125, 0.08648681640625, 0.1273193359375, 0.14404296875, 0.0684814453125, 0.057098388671875, 0.18994140625, 0.03900146484375, 0.111083984375, 0.2296142578125, 0.05523681640625, 0.004547119140625, 0.066650390625, 0.07763671875, 0.1654052734375, 0.01521301...

embed

59523526_c0

59523526

prolog

0

Title: predicate solve/2 its first argument is non-empty list ,second argument is list consisting of zero or more appended copies of the first argument Problem title: predicate solve/2 its first argument is non-empty list ,second argument is list consisting of zero or more appended copies of the first argument Tags: pr...

predicate solve/2 its first argument is non-empty list ,second argument is list consisting of zero or more appended copies of the first argument predicate solve/2 its first argument is non-empty list ,second argument is list consisting of zero or more appended copies of the first argument prolog predicate solve/2 its f...

[ 0.004791259765625, 0.0172119140625, -0.0103759765625, 0.0211181640625, -0.02587890625, 0.0220947265625, -0.0181884765625, 0.0135498046875, 0.0242919921875, -0.0169677734375, 0.0255126953125, 0.002410888671875, 0.00689697265625, 0.016845703125, 0.005828857421875, 0.010498046875, 0.018...

[ 1653, 2063, 67, 86869, 12477, 5117, 10750, 351, 33548, 5303, 191633, 58055, 45234, 1286, 114689, 48141, 71200, 83, 502, 4867, 939, 84751, 142424, 60899, 98, 570, 54241, 53, 8561, 140992, 9077, 15400, 123087, 566, 959, 19048, 2046, 6024, 624...

[ 0.1751708984375, 0.215087890625, 0.1229248046875, 0.2354736328125, 0.248779296875, 0.1092529296875, 0.2474365234375, 0.047332763671875, 0.04974365234375, 0.1400146484375, 0.126953125, 0.02166748046875, 0.1240234375, 0.09185791015625, 0.0926513671875, 0.06085205078125, 0.1214599609375...

embed

6310330_c0

6310330

prolog

0

Title: Is Prolog an untyped language? What's the difference between Prolog and dynamically typed languages? Problem title: Is Prolog an untyped language? What's the difference between Prolog and dynamically typed languages? Tags: types, programming-languages, lisp, prolog, dynamic-typing Problem: Is Prolog an...

Is Prolog an untyped language? What's the difference between Prolog and dynamically typed languages? Is Prolog an untyped language? What's the difference between Prolog and dynamically typed languages? types programming-languages lisp prolog dynamic-typing Prolog What Is Prolog an untyped language? What's the...

[ 0.02783203125, 0.01007080078125, 0.03466796875, 0.01348876953125, -0.011962890625, -0.000946044921875, -0.004638671875, -0.00848388671875, -0.0126953125, -0.0186767578125, -0.01190185546875, -0.0194091796875, -0.019775390625, -0.01104736328125, 0.00634765625, 0.0177001953125, 0.00750...

[ 2071, 1250, 4867, 142, 51, 50986, 71, 46876, 60212, 17721, 84079, 10644, 52895, 56037, 196651, 400, 7008, 502, 46280, 34735, 149067, 79315, 101935, 34627, 5303, 217773, 45646, 35839, 129927, 1261, 80934, 242554, 79612, 309, 149201, 201939, 3751...

[ 0.01324462890625, 0.18896484375, 0.265625, 0.0294036865234375, 0.112060546875, 0.2215576171875, 0.04876708984375, 0.1885986328125, 0.14306640625, 0.0400390625, 0.2030029296875, 0.2169189453125, 0.158447265625, 0.088134765625, 0.1424560546875, 0.04498291015625, 0.14111328125, 0.0964...

embed

64403797_c1

64403797

prolog

1

(Q)). P Q R and(_26,_27) _26 my_not(_27) Check true true true true true false invalid true true false true true false invalid true false true false true true okay true false false false true true okay false true true false false false okay false true false false false false okay false false true false false true okay f...

[ 0.0034027099609375, 0.00341796875, -0.00433349609375, 0.0211181640625, -0.022705078125, 0.0189208984375, 0.0146484375, -0.017333984375, 0.0216064453125, 0.0125732421875, -0.0023651123046875, 0.0162353515625, 0.00689697265625, -0.004974365234375, 0.0002880096435546875, 0.01007080078125,...

[ 2737, 436, 2396, 627, 136, 4046, 4, 80847, 759, 10869, 38679, 29568, 98320, 56649, 68403, 110, 3444, 15549, 28282, 3525, 70731, 13, 831, 5646, 6626, 5303, 1653, 2063, 64881, 82424, 33342, 1884, 221, 23180, 122880, 29673, 21068, 19273, 18601...

[ 0.10589599609375, 0.0809326171875, 0.1160888671875, 0.10400390625, 0.0894775390625, 0.214111328125, 0.0037841796875, 0.216552734375, 0.12353515625, 0.21240234375, 0.2235107421875, 0.1982421875, 0.1884765625, 0.25537109375, 0.1756591796875, 0.05816650390625, 0.05438232421875, 0.2126...

embed

61018717_c0

61018717

prolog

0

Title: How to create condition for functor's argument in a rule - PROLOG Problem title: How to create condition for functor's argument in a rule - PROLOG Tags: prolog Problem: How to create condition for functor's argument in a rule - PROLOG I'm currently learning Prolog and I want to create a specific rule w...

How to create condition for functor's argument in a rule - PROLOG How to create condition for functor's argument in a rule - PROLOG prolog How PROLOG John Kate Carl Shining Horror Little Agents Family Frozen Animation can_borrow Age1 Age2 ERROR Arguments How to create condition for functor's argument in a rul...

[ 0.0194091796875, 0.0242919921875, -0.007720947265625, 0.03271484375, -0.0135498046875, 0.0147705078125, -0.0029296875, 0.013427734375, 0.006500244140625, -0.01385498046875, 0.01214599609375, -0.043212890625, 0.008056640625, -0.0028533935546875, 0.00299072265625, -0.0159912109375, 0.0...

[ 11249, 28282, 35431, 100, 7477, 18770, 3768, 10750, 23, 79986, 10514, 47510, 10, 502, 4867, 4939, 37958, 25075, 8294, 592, 189808, 59784, 54603, 59745, 70463, 187852, 831, 3422, 15555, 72944, 418, 304, 151206, 24638, 112140, 47, 25, 1250, 2...

[ 0.06146240234375, 0.19677734375, 0.271728515625, 0.07196044921875, 0.174560546875, 0.206298828125, 0.0677490234375, 0.27587890625, 0.072265625, 0.2130126953125, 0.09820556640625, 0.1729736328125, 0.015472412109375, 0.0047607421875, 0.1666259765625, 0.07720947265625, 0.114013671875, ...

embed

55093415_c0

55093415

prolog

0

Title: swi prolog 8.0.2 : gziped http Problem title: swi prolog 8.0.2 : gziped http Tags: logtalk, swi-prolog, gzip, http, prolog Problem: swi prolog 8.0.2 : gziped http I tried to make work a piece of code that opens an http connection. Nevertheless, web page may transfered as plain text or gziped. As a result, the co...

swi prolog 8.0.2 : gziped http swi prolog 8.0.2 : gziped http logtalk swi-prolog gzip http prolog user::catch user::http_open URL DataStream user::load_html Terms user::close user::open_any GZipDataStream CloseIt user::http:encoding_filter user::close_any swi prolog 8.0.2 : gziped http I tried to make work a piece of c...

[ -0.0033416748046875, 0.01806640625, 0.00665283203125, 0.00007772445678710938, 0.01226806640625, -0.004302978515625, -0.01324462890625, 0.015869140625, 0.0029754638671875, -0.05419921875, 0.01904296875, 0.01300048828125, -0.0291748046875, 0.0020904541015625, 0.0225830078125, 0.000026941...

[ 91, 2452, 502, 4867, 3217, 133684, 706, 708, 20051, 1621, 12684, 139109, 3454, 50836, 38937, 4460, 5475, 59636, 31862, 11809, 115061, 63033, 7693, 165504, 155648, 4848, 1511, 3442, 153335, 23389, 66332, 120337, 37842, 4488, 63847, 18151, 9803, ...

[ 0.04876708984375, 0.214111328125, 0.1380615234375, 0.2171630859375, 0.110595703125, 0.1878662109375, 0.06512451171875, 0.1976318359375, 0.1558837890625, 0.1861572265625, 0.07110595703125, 0.2066650390625, 0.1407470703125, 0.22509765625, 0.099365234375, 0.1041259765625, 0.108520507812...

embed

15997196_c1

15997196

prolog

1

is the arguments list of the main functor. I would the nth argument so I would the nth element in the ArgsList and to obtain it I define the element_n relation that take: ArgIndex, ArgsList, ValueArg. If I would the first element in the list the ArgIndex value is 1 and the base case it is matched: element_n(1,[ValueAr...

[ 0.01544189453125, 0.0037994384765625, -0.0103759765625, -0.00830078125, -0.005279541015625, 0.014404296875, 0.0177001953125, 0.00897216796875, 0.0125732421875, -0.0262451171875, 0.021728515625, -0.0294189453125, -0.019287109375, 0.0076904296875, 0.00531005859375, -0.0205078125, 0.042...

[ 83, 70, 10750, 7, 5303, 111, 5201, 7477, 18770, 2806, 653, 927, 12830, 1172, 9405, 154663, 113054, 61924, 19, 41911, 5646, 177, 4153, 39659, 190060, 7614, 5117, 34292, 106, 3647, 7225, 14858, 41600, 856, 50770, 23, 10336, 51, 40383, 11782...

[ 0.087646484375, 0.020538330078125, 0.28076171875, 0.101806640625, 0.18017578125, 0.027191162109375, 0.1192626953125, 0.138427734375, 0.1883544921875, 0.169677734375, 0.1676025390625, 0.1517333984375, 0.1739501953125, 0.18310546875, 0.1619873046875, 0.2147216796875, 0.10614013671875, ...

embed

19276187_c0

19276187

prolog

0

Title: Finding algorithm to seek argument to satisfy given function's return Problem title: Finding algorithm to seek argument to satisfy given function's return Tags: algorithm, unification, functional-programming, f%23, prolog Problem: Finding algorithm to seek argument to satisfy given function's return I ...

Finding algorithm to seek argument to satisfy given function's return Finding algorithm to seek argument to satisfy given function's return algorithm unification functional-programming f%23 prolog Finding Given Finding algorithm to seek argument to satisfy given function's return I have this particular proble...

[ 0.00970458984375, 0.01556396484375, 0.006134033203125, 0.008056640625, -0.01318359375, 0.0003337860107421875, -0.0140380859375, -0.01007080078125, -0.0013427734375, -0.007568359375, 0.0004119873046875, -0.004730224609375, -0.0067138671875, 0.033447265625, 0.01043701171875, -0.013977050...

[ 26040, 214, 234873, 47, 40, 343, 10750, 40407, 53, 34475, 32354, 3768, 30646, 51, 41274, 123309, 28966, 1238, 3742, 502, 4867, 77878, 17311, 2967, 765, 29806, 14373, 4358, 3714, 32316, 62548, 16487, 100, 1632, 112397, 7413, 3387, 69236, 176...

[ 0.184814453125, 0.067626953125, 0.278076171875, 0.067138671875, 0.145751953125, 0.11962890625, 0.2998046875, 0.2027587890625, 0.08770751953125, 0.1553955078125, 0.1773681640625, 0.0816650390625, 0.2454833984375, 0.119873046875, 0.127685546875, 0.1116943359375, 0.1044921875, 0.02824...

embed

59451939_c0

59451939

prolog

0

Title: Cloning,Copying prolog list Problem title: Cloning,Copying prolog list Tags: clone, copy, prolog Problem: Cloning,Copying prolog list I found this piece of code everywhere for copying a list or cloning a list. Code found everywhere: clone([],[]). clone([H|T],[H|Z]):- clone(T,Z). ?-clone([1,2,3],Z). Z=[1,2,3] ?-c...

Cloning,Copying prolog list Cloning,Copying prolog list clone copy prolog Cloning Copying clone1 Cloning,Copying prolog list I found this piece of code everywhere for copying a list or cloning a list. Code found everywhere: This doesn't copy anything other than lists .The time complexity of the above code is O(n) . But...

[ -0.0147705078125, 0.018310546875, 0.001678466796875, 0.0115966796875, -0.0115966796875, -0.0142822265625, -0.00799560546875, -0.000339508056640625, 0.0106201171875, -0.02880859375, 0.015625, -0.013916015625, 0.01385498046875, -0.01611328125, 0.0177001953125, 0.0023040771484375, 0.015...

[ 51053, 592, 10625, 6493, 502, 4867, 5303, 20450, 86, 43658, 146930, 418, 14037, 63847, 18151, 219743, 28864, 3293, 22027, 18, 23937, 1733, 27140, 2481, 36917, 180, 19, 1250, 1927, 51, 40383, 7108, 60520, 5609, 59121, 5045, 8781, 1511, 12319...

[ 0.1632080078125, 0.08013916015625, 0.0645751953125, 0.119384765625, 0.14990234375, 0.2239990234375, 0.1534423828125, 0.1678466796875, 0.0965576171875, 0.1654052734375, 0.136962890625, 0.1016845703125, 0.030914306640625, 0.0164947509765625, 0.137939453125, 0.07073974609375, 0.13623046...

embed

23556166_c1

23556166

prolog

1

is X1,(Y2 is Y1 -1;Y2 is Y1+1; Y2 is Y1). neib(X1,Y1,X2,Y2) :- X2 is X1-1,(Y2 is Y1 -1;Y2 is Y1+1; Y2 is Y1). neib(X1,Y1,X2,Y2) :- X2 is X1+1,(Y2 is Y1 -1;Y2 is Y1+1; Y2 is Y1). notdiag(X1,Y1,X2,Y2) :- not(neib(X1,Y1,X2,Y2)). notdiag(X1,Y1,X2,Y2) :- neib(X1,Y1,X2,Y2),((X1 == X2,t(Y1,Y2));(Y1 == Y2,t(X1,X2))). notdiagl...

[ 0.00677490234375, 0.00372314453125, 0.0196533203125, 0.0037994384765625, -0.01031494140625, -0.01104736328125, -0.0147705078125, 0.0087890625, 0.010986328125, 0.006500244140625, 0.00634765625, 0.033447265625, 0.018798828125, 0.004852294921875, -0.00738525390625, 0.01556396484375, 0.0...

[ 83, 1193, 418, 1723, 304, 990, 68940, 74, 21748, 17727, 5, 108, 2566, 1542, 10461, 15772, 115727, 959, 3390, 177, 86, 69112, 18, 6562, 9874, 379, 10869, 808, 43719, 20268, 80836, 1511, 109637, 87, 33636, 11341, 5303, 108210, 12724, 78457,...

[ 0.1214599609375, 0.1434326171875, 0.1263427734375, 0.15185546875, 0.197021484375, 0.1417236328125, 0.1171875, 0.024627685546875, 0.1495361328125, 0.1160888671875, 0.00238037109375, 0.1007080078125, 0.2041015625, 0.122314453125, 0.1627197265625, 0.053009033203125, 0.1424560546875, 0...

embed

50026553_c0

50026553

prolog

0

Title: Get all Prefixes of a List, including [] in Prolog Problem title: Get all Prefixes of a List, including [] in Prolog Tags: prolog Problem: Get all Prefixes of a List, including [] in Prolog I am new to Prolog and wanted to start learning the functionality of [H|T] by trying to write the prefix function on my own...

Get all Prefixes of a List, including [] in Prolog Get all Prefixes of a List, including [] in Prolog prolog Get Prefixes List Prolog Get all Prefixes of a List, including [] in Prolog I am new to Prolog and wanted to start learning the functionality of [H|T] by trying to write the prefix function on my own. The prefix...

[ 0.00098419189453125, -0.0035400390625, 0.0242919921875, -0.000782012939453125, -0.004974365234375, -0.011962890625, -0.00238037109375, -0.011962890625, 0.00408935546875, -0.0260009765625, 0.020751953125, -0.01416015625, -0.00494384765625, 0.0184326171875, -0.004150390625, 0.01196289062...

[ 20779, 756, 1914, 55923, 90, 111, 32036, 26719, 378, 23, 1250, 4867, 502, 3525, 52080, 123309, 841, 58745, 618, 33022, 183114, 32354, 10002, 30646, 7722, 5303, 339, 2203, 2806, 238, 55681, 5941, 12921, 51347, 65450, 10336, 46741, 1747, 1763...

[ 0.109130859375, 0.1812744140625, 0.15771484375, 0.272216796875, 0.1329345703125, 0.1326904296875, 0.2120361328125, 0.053924560546875, 0.088623046875, 0.033203125, 0.1597900390625, 0.209716796875, 0.1231689453125, 0.000244140625, 0.03607177734375, 0.1234130859375, 0.077392578125, 0....

embed

43091565_c0

43091565

prolog

0

Title: How to get a rule to check all the conditions before exiting? Problem title: How to get a rule to check all the conditions before exiting? Tags: prolog Problem: How to get a rule to check all the conditions before exiting? I'm trying to write a predicate weird_sum(List, Result) which takes a List of numbers, and...

How to get a rule to check all the conditions before exiting? How to get a rule to check all the conditions before exiting? prolog How weird_sum List Result Head Tail How to get a rule to check all the conditions before exiting? I'm trying to write a predicate weird_sum(List, Result) which takes a List of numbers, and ...

[ -0.00084686279296875, 0.01080322265625, 0.000263214111328125, 0.01611328125, 0.006927490234375, 0.038330078125, -0.01165771484375, 0.0234375, 0.0242919921875, -0.00714111328125, 0.02294921875, 0.0004711151123046875, 0.007293701171875, 0.007232666015625, 0.011962890625, -0.001953125, ...

[ 11249, 2046, 10, 79986, 47, 12765, 756, 27289, 8108, 82230, 214, 502, 4867, 179459, 454, 11832, 32036, 126684, 44816, 1218, 379, 70, 31577, 33022, 1653, 2063, 67, 154663, 101935, 7077, 10554, 108047, 5303, 117396, 105950, 190, 26948, 89931, ...

[ 0.0628662109375, 0.1021728515625, 0.0745849609375, 0.2132568359375, 0.056732177734375, 0.2308349609375, 0.098388671875, 0.251953125, 0.1307373046875, 0.1917724609375, 0.10552978515625, 0.09783935546875, 0.1202392578125, 0.185302734375, 0.0234527587890625, 0.2294921875, 0.16455078125,...

embed

38543599_c1

38543599

prolog

1

,7,3] D = [3, 6, 7, 8, 2, 4, 5, 6, 9|...], Bs = [bump([9], [9]), bump([2, 3, 4], [6, 7, 8])] ; [3,6,7,8,2,4,5,6,9,4,7,3] D = [3, 6, 7, 8, 2, 4, 5, 6, 9|...], Bs = [bump([11], [7]), bump([2, 3, 4], [6, 7, 8])] ; [3,6,7,8,2,4,5,6,9,4,7,3] D = [3, 6, 7, 8, 2, 4, 5, 6, 9|...], Bs = [bump([2, 3, 4], [6, 7, 8])] ; etc The id...

[ 0.00640869140625, 0.01397705078125, -0.006195068359375, 0.0211181640625, 0.008056640625, 0.04248046875, -0.00433349609375, -0.00174713134765625, 0.0238037109375, -0.0208740234375, 0.0003490447998046875, -0.00154876708984375, 0.01104736328125, 0.0050048828125, 0.0035400390625, 0.0178222...

[ 4, 966, 96386, 391, 2203, 122101, 305, 361, 382, 116, 201, 190, 483, 75606, 335, 7, 978, 2676, 132, 55737, 6, 247, 373, 304, 138, 268, 910, 16, 136005, 80389, 171379, 108368, 73068, 117221, 1065, 2819, 378, 3021, 6528, 83, 442, 1221, ...

[ 0.05328369140625, 0.1339111328125, 0.2548828125, 0.226806640625, 0.1270751953125, 0.0987548828125, 0.177978515625, 0.154052734375, 0.2081298828125, 0.08380126953125, 0.207275390625, 0.168701171875, 0.181640625, 0.042449951171875, 0.102783203125, 0.0985107421875, 0.1444091796875, 0....

embed

16287495_c0

16287495

prolog

0

Title: Searching a node of a binary tree in Prolog Problem title: Searching a node of a binary tree in Prolog Tags: prolog Problem: Searching a node of a binary tree in Prolog A beginner in Prolog,working with binary trees for some hours.But as a newcomer in Prolog world,a little bit confused about it's working procedu...

Searching a node of a binary tree in Prolog Searching a node of a binary tree in Prolog prolog Searching Prolog count_nodes Searching a node of a binary tree in Prolog A beginner in Prolog,working with binary trees for some hours.But as a newcomer in Prolog world,a little bit confused about it's working procedure. I do...

[ 0.027587890625, -0.01446533203125, 0.006011962890625, 0.014404296875, 0.01397705078125, 0.0108642578125, -0.0150146484375, -0.01373291015625, 0.007049560546875, -0.0615234375, 0.000431060791015625, -0.050537109375, 0.00506591796875, 0.0137939453125, 0.031982421875, -0.01348876953125, ...

[ 33086, 110, 112, 2394, 6635, 53201, 1250, 4867, 502, 54529, 157, 988, 1679, 174796, 1360, 21974, 277, 8999, 55681, 20697, 50491, 18151, 3173, 3034, 1528, 140992, 1884, 237, 384, 42518, 541, 33636, 14012, 29479, 157318, 53088, 391, 36381, 74...

[ 0.177978515625, 0.1622314453125, 0.13720703125, 0.149658203125, 0.0966796875, 0.203369140625, 0.153564453125, 0.222412109375, 0.085205078125, 0.140869140625, 0.14794921875, 0.139404296875, 0.0274200439453125, 0.0215606689453125, 0.1102294921875, 0.032379150390625, 0.0268402099609375,...

embed

53477195_c0

53477195

prolog

0

Title: Prolog: Order of clauses for finding path in graph Problem title: Prolog: Order of clauses for finding path in graph Tags: prolog Problem: Prolog: Order of clauses for finding path in graph I have a cyclic graph with entry and exit nodes for which I want to find out all paths leading from any entry to any exit n...

Prolog: Order of clauses for finding path in graph Prolog: Order of clauses for finding path in graph prolog Prolog Order Cycle path2 Prolog: Order of clauses for finding path in graph I have a cyclic graph with entry and exit nodes for which I want to find out all paths leading from any entry to any exit node. My path...

[ 0.02783203125, 0.0084228515625, 0.01031494140625, 0.02392578125, -0.005401611328125, 0.027587890625, -0.0038604736328125, -0.016845703125, 0.0137939453125, -0.029296875, 0.000392913818359375, 0.005828857421875, -0.0228271484375, 0.002197265625, 0.0230712890625, 0.017333984375, -0.014...

[ 1250, 4867, 81206, 111, 70731, 90, 90791, 60875, 41382, 23, 502, 151612, 304, 187830, 42805, 82230, 110, 988, 3444, 7413, 1810, 756, 105207, 1653, 2063, 67, 43240, 6782, 65042, 238, 12765, 2174, 3525, 7722, 112, 21771, 5303, 36997, 15190, ...

[ 0.1405029296875, 0.2254638671875, 0.1619873046875, 0.0767822265625, 0.162109375, 0.0723876953125, 0.115478515625, 0.2291259765625, 0.183349609375, 0.043792724609375, 0.0701904296875, 0.114013671875, 0.1224365234375, 0.1136474609375, 0.1221923828125, 0.12060546875, 0.11279296875, 0....

embed

32352501_c0

32352501

prolog

0

Title: Extracting the 'speso(A, Y, Z)' line from database for further processing Problem title: Extracting the 'speso(A, Y, Z)' line from database for further processing Tags: list, prolog Problem: Extracting the 'speso(A, Y, Z)' line from database for further processing I have this database: g([dat...

Extracting the 'speso(A, Y, Z)' line from database for further processing Extracting the 'speso(A, Y, Z)' line from database for further processing list prolog database Extracting pzzaDelGesu47 Date Month ListOfSpese Tail Acc Res Amount What WhichCar Extracting the 'speso(A, Y, Z)' line from databas...

[ -0.0026092529296875, -0.0025787353515625, -0.00823974609375, 0.01043701171875, -0.01336669921875, 0.004364013671875, -0.01043701171875, 0.00799560546875, 0.01251220703125, -0.028564453125, 0.01220703125, -0.011962890625, -0.0164794921875, -0.0177001953125, -0.0006256103515625, 0.029907...

[ 31501, 238, 1916, 3768, 9217, 991, 284, 990, 567, 13315, 1295, 63399, 53333, 9433, 5303, 502, 4867, 7070, 58598, 10429, 1159, 13330, 25512, 12982, 32036, 132887, 31923, 7717, 1218, 379, 29899, 9624, 121147, 130078, 21851, 4, 903, 3444, 1256...

[ 0.16650390625, 0.0797119140625, 0.0175933837890625, 0.0855712890625, 0.171875, 0.1884765625, 0.115478515625, 0.1541748046875, 0.1793212890625, 0.1585693359375, 0.0743408203125, 0.170654296875, 0.07354736328125, 0.0887451171875, 0.09539794921875, 0.0999755859375, 0.1571044921875, 0....

embed

33322185_c0

33322185

prolog

0

Title: How to get a list with all the possible combinations of the elements inside another list? Problem title: How to get a list with all the possible combinations of the elements inside another list? Tags: list, prolog Problem: How to get a list with all the possible combinations of the elements inside another list? ...

How to get a list with all the possible combinations of the elements inside another list? How to get a list with all the possible combinations of the elements inside another list? list prolog How How to get a list with all the possible combinations of the elements inside another list? I have a list that has as elements...

[ -0.0050048828125, 0.02978515625, 0.00469970703125, 0.0242919921875, -0.01043701171875, 0.00811767578125, -0.0155029296875, 0.0157470703125, -0.00408935546875, -0.03564453125, 0.00335693359375, 0.01434326171875, 0.0162353515625, 0.0205078125, -0.011962890625, 0.0224609375, 0.014953613...

[ 11249, 47, 2046, 10, 5303, 678, 756, 70, 7722, 162515, 7, 80854, 46132, 15700, 502, 4867, 111, 237, 34627, 3789, 26458, 3444, 19759, 7639, 11907, 43581, 29806, 17106, 5875, 12765, 2174, 1193, 83, 959, 64457, 20949, 425, 304, 2203, 1022, ...

[ 0.1011962890625, 0.0653076171875, 0.1513671875, 0.06854248046875, 0.2366943359375, 0.136474609375, 0.1270751953125, 0.06451416015625, 0.20654296875, 0.2103271484375, 0.070068359375, 0.1898193359375, 0.134765625, 0.13330078125, 0.059906005859375, 0.1339111328125, 0.027191162109375, ...

embed

21864920_c0

21864920

prolog

0

Title: Iterating through a list of lists (without flattening) Problem title: Iterating through a list of lists (without flattening) Tags: iteration, list, prolog Problem: Iterating through a list of lists (without flattening) I have the following list of lists: listObj = [ [ obj1(_) , obj2(_) , obj1(_) , obj2(_) , obj1...

Iterating through a list of lists (without flattening) Iterating through a list of lists (without flattening) iteration list prolog Iterating obj1 obj2 obj3 Iterating through a list of lists (without flattening) I have the following list of lists: This list will always be a 6x6 matrix, and I need to iterate through thi...

[ 0.0189208984375, -0.0020751953125, -0.0012664794921875, 0.01116943359375, 0.007049560546875, -0.00159454345703125, -0.00927734375, 0.0167236328125, 0.00732421875, -0.0146484375, -0.01123046875, -0.0233154296875, 0.01123046875, -0.0223388671875, -0.00665283203125, 0.007171630859375, -...

[ 87, 67, 98767, 8305, 5303, 7, 6056, 49878, 17, 720, 2320, 502, 4867, 995, 170, 363, 25632, 11343, 305, 910, 50944, 425, 3871, 8560, 112033, 15555, 136, 316, 14012, 12638, 12830, 27875, 4527, 70731, 159029, 40956, 100094, 510, 12477, 4358,...

[ 0.05224609375, 0.1810302734375, 0.1416015625, 0.162109375, 0.2301025390625, 0.025787353515625, 0.07257080078125, 0.189453125, 0.0596923828125, 0.2171630859375, 0.00872802734375, 0.10205078125, 0.15869140625, 0.06756591796875, 0.05877685546875, 0.050201416015625, 0.0052490234375, 0....

embed

13977220_c1

13977220

prolog

1

is different. So that the head of the rule is verified, all the predicates in it's body have to be true... I think that my idea is good until reaching the base case, in fact doing: L1 = [_|T], /* It is always true */ concatena(T,L2,L3) /* Call recursively on a subproblem of the original problem, this problem have one ...

[ 0.007232666015625, -0.00141143798828125, 0.01361083984375, 0.0250244140625, -0.0004787445068359375, -0.006011962890625, -0.0184326171875, 0.01287841796875, 0.028076171875, -0.037841796875, 0.015625, 0.00860595703125, -0.000629425048828125, 0.00830078125, 0.005615234375, 0.0065002441406...

[ 83, 12921, 1061, 450, 10336, 111, 79986, 493, 47314, 756, 1653, 2063, 1636, 14361, 765, 47, 186, 29568, 5351, 759, 6528, 4127, 24189, 58359, 3647, 7225, 15824, 20594, 339, 418, 2203, 58745, 618, 1650, 11343, 158, 33478, 76, 866, 304, 21...

[ 0.0836181640625, 0.2369384765625, 0.0207366943359375, 0.0146484375, 0.1630859375, 0.0180206298828125, 0.2138671875, 0.1619873046875, 0.1871337890625, 0.0640869140625, 0.148681640625, 0.1878662109375, 0.068603515625, 0.1387939453125, 0.0367431640625, 0.03582763671875, 0.0709228515625,...

embed

60387784_c1

60387784

prolog

1

1], [day2, fruit2, nut2], [day3, fruit3, nut3], [day4, fruit4, nut4], [day5, fruit5, nut5]], Days = [monday, tuesday, wednesday, thursday, friday], Days = [day1, day2, day3, day4, day5], Fruits = [apple,banana,pear,mango,apricot], permutation(Fruits, [fruit1, fruit2, fruit3, fruit4, fruit5]), Nuts = [almonds,pecans,cas...

[ 0.01312255859375, 0.0206298828125, 0.00958251953125, 0.032958984375, -0.022216796875, 0.01055908203125, -0.0267333984375, 0.00885009765625, 0.00640869140625, -0.002685546875, -0.00970458984375, 0.02685546875, -0.00811767578125, 0.01361083984375, -0.0106201171875, 0.0076904296875, -0....

[ 106, 268, 4, 5636, 304, 41896, 54806, 90173, 363, 96386, 617, 758, 86245, 97292, 2203, 119720, 53, 370, 90, 642, 10952, 4911, 4295, 5129, 418, 5155, 151958, 9007, 133, 105281, 11, 1081, 147, 669, 519, 2631, 35297, 117, 561, 22062, 919, ...

[ 0.104248046875, 0.0394287109375, 0.07244873046875, 0.158203125, 0.13330078125, 0.2186279296875, 0.18798828125, 0.0806884765625, 0.102294921875, 0.0633544921875, 0.103759765625, 0.1729736328125, 0.0645751953125, 0.23388671875, 0.1224365234375, 0.14892578125, 0.1676025390625, 0.07177...

embed

23080905_c0

23080905

prolog

0

Title: Prolog traverse list for adjacent positions Problem title: Prolog traverse list for adjacent positions Tags: prolog, list, conditional-statements Problem: Prolog traverse list for adjacent positions I'm programming a pacman AI (yes it's homework), however I'm fairly new and I want to find all the adjacent positi...

Prolog traverse list for adjacent positions Prolog traverse list for adjacent positions prolog list conditional-statements Prolog X-1 Y-1 find_adjacent add_to_new_list Prolog traverse list for adjacent positions I'm programming a pacman AI (yes it's homework), however I'm fairly new and I want to find all the adjacent ...

[ -0.0184326171875, 0.00994873046875, 0.0166015625, 0.013427734375, -0.0155029296875, 0.01904296875, -0.0087890625, 0.04345703125, 0.004974365234375, -0.031494140625, 0.0096435546875, 0.0223388671875, 0.00078582763671875, 0.01171875, -0.00958251953125, 0.005859375, 0.003265380859375, ...

[ 1250, 4867, 37317, 13, 5303, 123594, 16797, 19069, 502, 35431, 289, 61340, 1193, 5759, 990, 7413, 712, 145, 15190, 188, 54936, 6562, 56037, 38595, 669, 38730, 5368, 18244, 3525, 3444, 756, 7565, 25737, 7108, 43581, 4092, 17366, 47, 87388, ...

[ 0.1617431640625, 0.2435302734375, 0.1697998046875, 0.09222412109375, 0.1761474609375, 0.2064208984375, 0.2381591796875, 0.200927734375, 0.1090087890625, 0.1195068359375, 0.02044677734375, 0.103515625, 0.05596923828125, 0.0863037109375, 0.0814208984375, 0.103271484375, 0.0553588867187...

embed

53695198_c0

53695198

prolog

0

Title: Problem with recursive predicate on Prolog Problem title: Problem with recursive predicate on Prolog Tags: prolog Problem: Problem with recursive predicate on Prolog Goal a(3, X) should return 6 . Based on this code. I have converted it to Prolog code but with a problem in a recursive predicate. First two lines ...

Problem with recursive predicate on Prolog Problem with recursive predicate on Prolog prolog Problem Prolog c-1 Call _1238 Fail Redo Exit _1474 _1480 _1486 _1492 SHOULD STOP HERE Problem with recursive predicate on Prolog Goal a(3, X) should return 6 . Based on this code. I have converted it to Prolog code but with a p...

[ -0.007080078125, 0.005645751953125, 0.00848388671875, 0.0045166015625, 0.004669189453125, -0.000858306884765625, 0.0185546875, 0.015869140625, 0.0025482177734375, -0.01904296875, 0.00811767578125, 0.002166748046875, -0.0302734375, -0.004241943359375, 0.017578125, -0.00689697265625, 0...

[ 15649, 195625, 5844, 1653, 2063, 67, 98, 1250, 4867, 678, 502, 501, 5759, 26265, 1530, 10991, 190355, 6096, 31, 5443, 217, 2592, 16360, 4836, 15276, 12231, 159, 70675, 65791, 2016, 289, 10, 86827, 4, 1193, 5608, 30646, 305, 18151, 117176,...

[ 0.168701171875, 0.260009765625, 0.1744384765625, 0.2108154296875, 0.2294921875, 0.1038818359375, 0.06756591796875, 0.1741943359375, 0.2646484375, 0.032501220703125, 0.1126708984375, 0.005584716796875, 0.0821533203125, 0.1451416015625, 0.035614013671875, 0.155029296875, 0.180908203125...

embed

41203940_c1

41203940

prolog

1

X1, X2 ), down1( Y1, Y2 ). up1( U, V ) :- successor( U, V ). up2( U, W ) :- successor( U, V ), successor( V, W ). down1( U, V ) :- up1( V, U ). down2( U, V ) :- up2( V, U ). successor( 1, 2 ). successor( 2, 3 ). successor( 3, 4 ). successor( 4, 5 ). edge((X1,Y1) , (X2,Y2)) :- move1( (X1,Y1), (X2,Y2) ). path((X1,Y1), (...

[ 0.0113525390625, 0.01251220703125, 0.016845703125, 0.01202392578125, -0.001800537109375, 0.012939453125, -0.008056640625, 0.000759124755859375, 0.01312255859375, -0.03759765625, 0.0086669921875, -0.0086669921875, -0.0093994140625, -0.00604248046875, 0.004302978515625, 0.0103759765625, ...

[ 1193, 418, 4, 304, 247, 7565, 990, 194, 1257, 345, 310, 15772, 39457, 42, 601, 106, 116, 138, 201, 190, 121303, 1542, 1723, 17727, 10461, 25813, 60875, 839, 541, 977, 757, 363, 21320, 76172, 5759, 351, 39, 27417, 16610, 525, 683, 2357...

[ 0.14306640625, 0.1258544921875, 0.036956787109375, 0.1888427734375, 0.060333251953125, 0.1893310546875, 0.130859375, 0.05078125, 0.1590576171875, 0.1456298828125, 0.1995849609375, 0.1087646484375, 0.2296142578125, 0.1407470703125, 0.1031494140625, 0.01995849609375, 0.0064697265625, ...

embed

23189952_c1

23189952

prolog

1

1 is a permutation of List2 if each element occurs in both lists % the same number of times permutationQ(List, [Head|Tail]) :- selectE(Head, List, Rest), permutationQ(Rest, Tail). % % There are 5 colors - 2 blues, 2 greens, 1 yellow % sit1 :- permutationQ([green,green,blue,blue,yellow],[A,B,C,D,E]), \+ A=B, \+ B=C, \+ ...

[ -0.007415771484375, 0.00653076171875, 0.0106201171875, -0.01031494140625, -0.00811767578125, -0.005706787109375, -0.045166015625, -0.000396728515625, 0.02587890625, 0.019775390625, 0.004486083984375, 0.0159912109375, 0.028564453125, -0.0023345947265625, -0.02197265625, 0.00418090820312...

[ 106, 83, 10, 117, 561, 22062, 111, 32036, 304, 2174, 12638, 12830, 74918, 7, 23, 15044, 5303, 1745, 70, 5701, 14012, 20028, 2737, 154663, 13025, 712, 58745, 9874, 379, 268, 16, 15772, 36849, 647, 49756, 1052, 525, 1218, 8622, 621, 190, ...

[ 0.1422119140625, 0.078125, 0.04296875, 0.1435546875, 0.2298583984375, 0.1424560546875, 0.0802001953125, 0.2105712890625, 0.1561279296875, 0.047027587890625, 0.08343505859375, 0.179931640625, 0.1668701171875, 0.0101318359375, 0.055908203125, 0.1141357421875, 0.2276611328125, 0.06359...

embed

13913898_c0

13913898

prolog

0

Title: Prolog programs - how to make it work? Problem title: Prolog programs - how to make it work? Tags: prolog Problem: Prolog programs - how to make it work? I have these two programs and they're not working as they should. The first without_doubles_2(Xs, Ys)is supposed to show that it is true if Ys is the list of t...

Prolog programs - how to make it work? Prolog programs - how to make it work? prolog Prolog without_doubles_2 without_doubles_21 Prolog programs - how to make it work? I have these two programs and they're not working as they should. The first without_doubles_2(Xs, Ys)is supposed to show that it is true if Ys is the li...

[ 0.0003604888916015625, 0.0262451171875, 0.01519775390625, 0.0174560546875, -0.022705078125, 0.03173828125, -0.00122833251953125, 0.00164031982421875, 0.01104736328125, -0.00604248046875, 0.01953125, 0.004547119140625, 0.00909423828125, -0.01708984375, 0.00341796875, 0.0167236328125, ...

[ 1250, 4867, 103391, 3642, 3249, 442, 4488, 47, 502, 15490, 21555, 13566, 304, 3117, 6097, 6626, 959, 20697, 237, 5608, 5117, 1542, 4, 990, 7, 134598, 7639, 29568, 2174, 5303, 80854, 108975, 1193, 115, 182867, 39531, 12989, 171763, 142424, ...

[ 0.169677734375, 0.2447509765625, 0.214111328125, 0.08367919921875, 0.09375, 0.06512451171875, 0.139404296875, 0.029876708984375, 0.1170654296875, 0.173828125, 0.1165771484375, 0.1806640625, 0.1448974609375, 0.150634765625, 0.023834228515625, 0.1146240234375, 0.0682373046875, 0.1134...

embed

33692335_c0

33692335

prolog

0

Title: Prolog, permutation code understanding Problem title: Prolog, permutation code understanding Tags: prolog, list Problem: Prolog, permutation code understanding I'm trying to understand how this program works. Code from Daniel Lyons' solution(from the link above) takeout(X,[X|R],R). takeout(X,[F |R],[F|S]) :- tak...

Prolog, permutation code understanding Prolog, permutation code understanding prolog list Prolog Prolog, permutation code understanding I'm trying to understand how this program works. Code from Daniel Lyons' solution(from the link above) I'm trying ti understand how it works with this list [1,2,3] So, I have perm([1,2...

[ 0.01904296875, 0.016357421875, 0.02392578125, 0.01519775390625, -0.00107574462890625, 0.019287109375, -0.038330078125, 0.0004367828369140625, 0.00994873046875, -0.004974365234375, -0.001861572265625, -0.0113525390625, 0.007476806640625, 0.01190185546875, -0.013671875, 0.007568359375, ...

[ 1250, 4867, 117, 561, 22062, 18151, 100094, 4, 502, 5303, 31577, 28219, 3642, 903, 1528, 43240, 28864, 11555, 99839, 29806, 1053, 678, 155761, 765, 39, 133063, 96386, 1542, 23468, 5117, 990, 50740, 35839, 76199, 1821, 601, 2203, 5646, 6056,...

[ 0.2081298828125, 0.26171875, 0.185791015625, 0.1861572265625, 0.057159423828125, 0.182373046875, 0.1376953125, 0.00360107421875, 0.1639404296875, 0.1634521484375, 0.02801513671875, 0.13916015625, 0.0257568359375, 0.0186920166015625, 0.16064453125, 0.136474609375, 0.1231689453125, 0...

embed

34011930_c0

34011930

prolog

0

Title: prolog - not a function warning Problem title: prolog - not a function warning Tags: prolog Problem: prolog - not a function warning I have this Prolog program where I want to match players with players with the same level (newbie, intermediate, or expert) and server: player(player29, 408, 183, europe). player(p...

prolog - not a function warning prolog - not a function warning prolog player29 player30 player31 player32 player33 player34 player35 player36 player37 player38 player39 player40 player41 player42 player43 player44 player45 player46 player47 player48 player49 player50 prolog - not a function warning I have this Prolog ...

[ 0.0034637451171875, -0.0167236328125, 0.0206298828125, -0.004486083984375, -0.00762939453125, 0.0107421875, -0.037109375, -0.00872802734375, 0.001739501953125, -0.000797271728515625, 0.017578125, 0.0140380859375, 0.00848388671875, -0.011474609375, 0.0186767578125, -0.007171630859375, ...

[ 502, 4867, 959, 10, 32354, 1631, 592, 58585, 4235, 1197, 5016, 9185, 10289, 5843, 10945, 12465, 4633, 9271, 13330, 9285, 12977, 2525, 1250, 1528, 3444, 14858, 92865, 678, 5701, 17366, 54936, 9014, 81814, 26808, 10723, 7614, 8962, 282, 9523,...

[ 0.17041015625, 0.255615234375, 0.18798828125, 0.08685302734375, 0.190673828125, 0.11474609375, 0.056976318359375, 0.1107177734375, 0.1710205078125, 0.0380859375, 0.004302978515625, 0.0146484375, 0.0240631103515625, 0.012603759765625, 0.007537841796875, 0.034210205078125, 0.0169677734...

embed

9650435_c0

9650435

prolog

0

Title: Variable Summation Problem title: Variable Summation Tags: constraint-programming, prolog Problem: Variable Summation How do you do a variable summation in the constraint programming language ECLiPSe ( http://www.eclipseclp.org/examples/ )? I'm attempting to get this functionality: :- lib(ic). % include the stan...

Variable Summation Variable Summation constraint-programming prolog the Variable Summation branch_and_bound ic_edge_finder sum1 _1187 Variable Summation How do you do a variable summation in the constraint programming language ECLiPSe ( http://www.eclipseclp.org/examples/ )? I'm attempting to get this functionality: An...

[ 0.00274658203125, -0.0123291015625, 0.01312255859375, 0.0172119140625, -0.008056640625, 0.004547119140625, -0.0128173828125, 0.01251220703125, 0.00185394287109375, -0.03564453125, -0.003936767578125, -0.005615234375, 0.00927734375, -0.00482177734375, 0.00872802734375, 0.004180908203125...

[ 84572, 2886, 131150, 1363, 158, 2816, 4288, 28966, 502, 4867, 32845, 206, 2940, 99091, 1771, 297, 429, 168719, 10554, 418, 19308, 11249, 54, 10, 77336, 29334, 23, 56037, 46876, 59947, 9506, 9059, 13, 106371, 39797, 26775, 3355, 302, 99726, ...

[ 0.189697265625, 0.14453125, 0.275146484375, 0.1700439453125, 0.085205078125, 0.214599609375, 0.1416015625, 0.1029052734375, 0.107666015625, 0.1632080078125, 0.07049560546875, 0.02545166015625, 0.04095458984375, 0.14208984375, 0.029083251953125, 0.07183837890625, 0.07086181640625, 0...

embed

53936340_c0

53936340

prolog

0

Title: Asserted data is different Problem title: Asserted data is different Tags: swi-prolog, prolog Problem: Asserted data is different I'm learning Prolog on my own. I have a text file which looks like this: table("0","Nicosia 2013 VulkÃ Bianco (Etna)","Italy","White Blend","14","Kerin Oâ€™Keefe","87"). table("1","Qu...

Asserted data is different Asserted data is different swi-prolog prolog Asserted Nicosia Bianco Etna Italy White Blend Kerin Keefe Quinta Avidagos Red Douro Portugal Portuguese Roger Voss Rainstorm Pinot Gris Willamette Valley Paul Gregutt Julian Reserve Late Harvest Riesling Lake Michigan Shore Alexander Peartree load...

[ 0.02783203125, -0.01318359375, -0.0054931640625, 0.0185546875, -0.006988525390625, 0.00823974609375, 0.004180908203125, 0.027099609375, -0.00311279296875, 0.002471923828125, -0.000614166259765625, 0.019775390625, -0.0255126953125, -0.005706787109375, 0.0230712890625, 0.0198974609375, ...

[ 62, 16865, 3674, 2053, 83, 12921, 91, 2452, 3454, 4867, 502, 86653, 3478, 241461, 1775, 76, 98848, 22392, 193924, 7354, 73, 1345, 13, 2242, 72742, 11, 28462, 8797, 6096, 984, 11951, 15604, 82528, 21325, 48861, 72476, 7, 82507, 129857, 148...

[ 0.1026611328125, 0.286865234375, 0.1778564453125, 0.2421875, 0.1416015625, 0.29296875, 0.051910400390625, 0.225830078125, 0.170166015625, 0.264892578125, 0.18603515625, 0.174072265625, 0.189453125, 0.2010498046875, 0.1475830078125, 0.127197265625, 0.1536865234375, 0.1220703125, 0...

embed

25687294_c0

25687294

prolog

0

Title: Compiled program cannot find a library Problem title: Compiled program cannot find a library Tags: linux, prolog, swi-prolog Problem: Compiled program cannot find a library First of all: I'm a total newbie. I have a compiled program that raises this error: ERROR: pl2xpce: cannot open shared object file: No such ...

Compiled program cannot find a library Compiled program cannot find a library linux prolog swi-prolog this Compiled ERROR pl2xpce Failed XPCE X11 See www.swi-prolog.org xpce.html Sorry Process amd64 pl2xpce.so Compiled program cannot find a library First of all: I'm a total newbie. I have a compiled program that raises...

[ 0.01165771484375, 0.0115966796875, -0.01177978515625, 0.01177978515625, -0.015869140625, 0.01708984375, 0.0028533935546875, 0.002197265625, -0.01239013671875, -0.04736328125, 0.007476806640625, -0.010498046875, -0.0159912109375, 0.0084228515625, -0.0028076171875, -0.0096435546875, 0....

[ 15612, 14, 6259, 1528, 53418, 7413, 10, 35773, 1294, 11508, 6077, 502, 4867, 91, 2452, 3454, 903, 151206, 24638, 6456, 304, 425, 254, 329, 190355, 45005, 10854, 1193, 1662, 1022, 123996, 444, 13307, 991, 3622, 9014, 375, 5974, 138804, 184...

[ 0.1220703125, 0.12255859375, 0.0709228515625, 0.1649169921875, 0.1588134765625, 0.1839599609375, 0.043731689453125, 0.2227783203125, 0.1422119140625, 0.056365966796875, 0.05157470703125, 0.09222412109375, 0.1728515625, 0.027496337890625, 0.217529296875, 0.1365966796875, 0.03897094726...

embed

31171610_c0

31171610

prolog

0

Title: definite clause grammar (dcg) Prolog (homework) Problem title: definite clause grammar (dcg) Prolog (homework) Tags: dcg, prolog Problem: definite clause grammar (dcg) Prolog (homework) i tried to write a predicate and N={Expression,Number,Digit,Operator,Variable} T={1,2,3,+,-,*,(,),X,Y,Z} and S is expression an...

definite clause grammar (dcg) Prolog (homework) definite clause grammar (dcg) Prolog (homework) dcg prolog Prolog Expression Number Digit Operator Variable definite clause grammar (dcg) Prolog (homework) i tried to write a predicate and N={Expression,Number,Digit,Operator,Variable} T={1,2,3,+,-,*,(,),X,Y,Z} and S is ex...

[ 0.0028228759765625, 0.005340576171875, 0.007232666015625, 0.0301513671875, 0.00823974609375, 0.0233154296875, -0.00494384765625, 0.0032501220703125, 0.00787353515625, -0.005615234375, -0.0052490234375, -0.030517578125, -0.025634765625, -0.01708984375, 0.0048828125, 0.0186767578125, 0...

[ 71496, 13, 70731, 122092, 147, 238, 177, 1250, 4867, 29552, 18244, 104, 502, 25129, 103332, 51174, 150922, 84572, 2886, 37842, 33022, 1653, 2063, 541, 178752, 18444, 26278, 14055, 15769, 156823, 81827, 384, 363, 1328, 9, 1639, 1542, 1723, 1...

[ 0.2000732421875, 0.1094970703125, 0.204833984375, 0.1566162109375, 0.078369140625, 0.017425537109375, 0.1273193359375, 0.1524658203125, 0.2037353515625, 0.05218505859375, 0.124755859375, 0.0159149169921875, 0.1190185546875, 0.112548828125, 0.1519775390625, 0.127685546875, 0.205078125...

embed

64941499_c0

64941499

prolog

0

Title: How to insert member list with menu driven prolog program? Problem title: How to insert member list with menu driven prolog program? Tags: prolog, list, membership, member Problem: How to insert member list with menu driven prolog program? The Question is- Write a menu driven PROLOG program to implement various ...

How to insert member list with menu driven prolog program? How to insert member list with menu driven prolog program? prolog list membership member How Enter Run Exit Choice run_opt Goodbye Invalid TAIL How to insert member list with menu driven prolog program? The Question is- Write a menu driven PROLOG program to imp...

[ 0.01068115234375, -0.0019989013671875, 0.0224609375, 0.01068115234375, -0.037109375, 0.01007080078125, -0.0205078125, -0.0037841796875, 0.001556396484375, -0.033447265625, 0.0230712890625, -0.01458740234375, 0.01611328125, -0.00927734375, 0.005950927734375, 0.000591278076171875, 0.01...

[ 11249, 183540, 32786, 5303, 678, 8026, 22648, 502, 4867, 1528, 209274, 60816, 28398, 5443, 217, 181948, 11675, 2146, 18621, 1272, 7013, 12998, 16444, 18781, 10514, 47510, 29479, 41018, 32036, 7210, 2967, 831, 241860, 35064, 105237, 26785, 71924...

[ 0.07586669921875, 0.246826171875, 0.253173828125, 0.2039794921875, 0.09808349609375, 0.200439453125, 0.1171875, 0.1409912109375, 0.20703125, 0.1368408203125, 0.207763671875, 0.117431640625, 0.1015625, 0.08831787109375, 0.03289794921875, 0.1312255859375, 0.0618896484375, 0.073181152...

embed

40702617_c0

40702617

prolog

0

Title: Prolog routes in directed graph Problem title: Prolog routes in directed graph Tags: prolog Problem: Prolog routes in directed graph I am quite new to Prolog and want to create a program, where I can ask for a route with the predicate " route(Startpoint,Endpoint,Route) ". My code so far is: % facts connection(s1...

Prolog routes in directed graph Prolog routes in directed graph prolog Prolog Startpoint Endpoint Route route1 route2 Prolog routes in directed graph I am quite new to Prolog and want to create a program, where I can ask for a route with the predicate " route(Startpoint,Endpoint,Route) ". My code so far is: My code wor...

[ 0.0091552734375, 0.0037384033203125, 0.01458740234375, 0.020263671875, -0.00836181640625, -0.005401611328125, -0.01251220703125, -0.0011138916015625, 0.005706787109375, -0.0673828125, -0.0014190673828125, -0.0028076171875, -0.026611328125, 0.0103759765625, 0.007415771484375, 0.01525878...

[ 1250, 4867, 36439, 23, 8951, 297, 41382, 7, 502, 13794, 38496, 18878, 106015, 418, 304, 32233, 3525, 3444, 28282, 1528, 831, 26458, 1653, 2063, 126597, 152378, 12724, 6743, 18151, 2060, 43240, 105823, 15824, 11249, 56282, 29398, 62163, 36997,...

[ 0.19482421875, 0.26806640625, 0.24365234375, 0.05584716796875, 0.1697998046875, 0.080078125, 0.2254638671875, 0.02032470703125, 0.1273193359375, 0.1240234375, 0.1575927734375, 0.107177734375, 0.1595458984375, 0.0379638671875, 0.051422119140625, 0.0081787109375, 0.048828125, 0.04507...

embed

7739481_c0

7739481

prolog

0

Title: A prolog assignment which uses lists Problem title: A prolog assignment which uses lists Tags: prolog Problem: A prolog assignment which uses lists I have an assignment that's driving me crazy.... Here's the assignment: The following contacts for people in a company are kept as facts as the followings: phones(jo...

A prolog assignment which uses lists A prolog assignment which uses lists prolog mobile91 mobile93 all_contacts ListOfContacts ListOfContactss all_contactos LIST LIST_CONTACTS movel91 A prolog assignment which uses lists I have an assignment that's driving me crazy.... Here's the assignment: The following contacts for ...

[ 0.01287841796875, 0.02197265625, -0.00958251953125, 0.028564453125, -0.0186767578125, -0.005950927734375, -0.032958984375, 0.0301513671875, 0.004608154296875, -0.044677734375, -0.01513671875, 0.0005950927734375, -0.000316619873046875, 0.001129150390625, -0.00439453125, 0.01116943359375...

[ 62, 502, 4867, 95486, 674, 3129, 4527, 5303, 7, 14288, 12183, 11591, 756, 163891, 32036, 132887, 233695, 232, 195977, 108369, 84161, 931, 2601, 765, 132442, 163, 116666, 25632, 5470, 100, 3395, 23, 14380, 93544, 237, 15824, 262, 64552, 1653...

[ 0.0241546630859375, 0.1522216796875, 0.2430419921875, 0.1978759765625, 0.1097412109375, 0.01690673828125, 0.1199951171875, 0.26220703125, 0.06439208984375, 0.1312255859375, 0.195068359375, 0.1519775390625, 0.07086181640625, 0.207275390625, 0.1175537109375, 0.15966796875, 0.2048339843...

embed

3948076_c0

3948076

prolog

0

Title: Prolog - formulas in propositional logic Problem title: Prolog - formulas in propositional logic Tags: dcg, prolog, prolog-defaulty Problem: Prolog - formulas in propositional logic I am trying to make a predicate in order to validate if a given input represents a formula. I am allowed to use only to proposition...

Prolog - formulas in propositional logic Prolog - formulas in propositional logic dcg prolog prolog-defaulty Prolog logical_atom atom_codes Prolog - formulas in propositional logic I am trying to make a predicate in order to validate if a given input represents a formula. I am allowed to use only to propositional atoms...

[ 0.006744384765625, 0.01080322265625, -0.00299072265625, 0.0157470703125, -0.016845703125, 0.004119873046875, 0.005462646484375, -0.01202392578125, -0.00390625, -0.0264892578125, -0.0048828125, -0.006256103515625, -0.006195068359375, 0.005706787109375, -0.01190185546875, 0.0132446289062...

[ 1250, 4867, 26168, 89261, 289, 62775, 23, 177, 502, 214810, 53, 5928, 34627, 40899, 31577, 3249, 1653, 2063, 67, 44622, 2174, 34475, 107730, 33636, 107003, 4527, 4734, 47, 915, 8096, 1690, 91, 808, 765, 3034, 25632, 7228, 148, 4902, 30646...

[ 0.1494140625, 0.228271484375, 0.241943359375, 0.18701171875, 0.06640625, 0.142333984375, 0.0161895751953125, 0.11865234375, 0.123046875, 0.1651611328125, 0.029815673828125, 0.1201171875, 0.1885986328125, 0.158447265625, 0.07073974609375, 0.0265655517578125, 0.1651611328125, 0.18603...

embed

8748867_c1

8748867

prolog

1

is D2-n, C is D1+n. pour(state(D1,D2,D3,n,r),move(D,C,l),state(D1,D,c,n,l)) :- D is D2-n, C is D3. pour(state(D1,D2,D3,n,l),move(D,C,r),state(C,D2,D,n,r)) :- D is D3-n, C is D1. pour(state(D1,D2,D3,n,r),move(D,C,l),state(D1,C,D,n,l)) :- D is D3-n, C is D2+n. pour(state(D1,D2,D3,n,r),move(D,C,l),state(C,D2,D,n,l)) :- D...

[ -0.006500244140625, 0.004547119140625, -0.000598907470703125, 0.033935546875, -0.0035400390625, 0.00787353515625, -0.0238037109375, 0.0157470703125, 0.004791259765625, -0.01416015625, -0.000713348388671875, 0.004791259765625, 0.00555419921875, 0.017578125, -0.0145263671875, -0.01916503...

[ 83, 391, 18504, 19, 4, 313, 418, 1328, 5, 578, 132, 61340, 397, 304, 363, 42, 432, 272, 141, 238, 15772, 27495, 85358, 966, 77495, 128188, 194, 90980, 21320, 8437, 1542, 1723, 963, 1511, 157979, 16093, 475, 991, 1140, 454, 9, 9709, ...

[ 0.148193359375, 0.189208984375, 0.231689453125, 0.1572265625, 0.007415771484375, 0.189453125, 0.103515625, 0.201904296875, 0.07415771484375, 0.222412109375, 0.00927734375, 0.196044921875, 0.1241455078125, 0.106689453125, 0.2047119140625, 0.09686279296875, 0.1519775390625, 0.1124267...

embed

70173499_c1

70173499

prolog

1

),MetHistory,InfectionPath) :- (met(StartPerson,MetTime,MidPerson);met(MidPerson,MetTime,StartPerson)), StartTime >= MetTime, StartTime - MetTime < 7, \+ (mymember(met(StartPerson,MetTime,MidPerson),MetHistory);mymember(met(MidPerson,MetTime,StartPerson),MetHistory)), contact4(infect(MidPerson,MetTime),infect(GoalPerso...

[ 0.0036468505859375, 0.019287109375, 0.0113525390625, 0.0191650390625, -0.006591796875, -0.02734375, -0.0230712890625, 0.01806640625, 0.007049560546875, -0.06396484375, 0.01214599609375, 0.0198974609375, -0.016357421875, 0.006591796875, 0.031982421875, 0.0205078125, 0.0064697265625, ...

[ 247, 78572, 20861, 86385, 4153, 420, 58994, 683, 10519, 15772, 1928, 126597, 160054, 70059, 594, 532, 16, 13794, 977, 4146, 4426, 361, 4, 6, 1328, 15, 1176, 39, 27417, 132, 3142, 5470, 617, 204228, 17903, 289, 6032, 268, 18151, 36917, 2...

[ 0.06707763671875, 0.21875, 0.1724853515625, 0.1947021484375, 0.08734130859375, 0.1832275390625, 0.1326904296875, 0.10546875, 0.19580078125, 0.039154052734375, 0.20849609375, 0.1787109375, 0.2061767578125, 0.2418212890625, 0.038482666015625, 0.1265869140625, 0.0182037353515625, 0.19...

embed

67984845_c1

67984845

prolog

1

), TargetMinimax is Sum//N, once( ( between(TargetMinimax, Sum , NMinimax), Minimax is 0+NMinimax, distribute_minimax(Elements, [], n, Minimax, N, 0, [], LDistributionOnce) )), LDistribution=LDistributionOnce. This means the search for a minimal maximum value will begin with approximately the sum divided by the amount ...

[ -0.01446533203125, 0.000568389892578125, 0.0301513671875, 0.005615234375, -0.0179443359375, 0.00811767578125, 0.0118408203125, -0.002197265625, 0.0076904296875, -0.015625, 0.0240478515625, 0.00384521484375, -0.01953125, -0.004058837890625, 0.010498046875, 0.000141143798828125, 0.0260...

[ 247, 160017, 114986, 24084, 83, 36335, 20767, 839, 24145, 17721, 63031, 3794, 541, 13468, 757, 1328, 943, 15917, 67, 9222, 647, 19929, 653, 339, 44456, 179236, 670, 3956, 30693, 164, 33938, 100, 20187, 38132, 34292, 1221, 9842, 189275, 1055...

[ 0.032318115234375, 0.251708984375, 0.209228515625, 0.2283935546875, 0.042938232421875, 0.169189453125, 0.08856201171875, 0.0958251953125, 0.1278076171875, 0.109375, 0.1490478515625, 0.1571044921875, 0.076171875, 0.180419921875, 0.08758544921875, 0.07061767578125, 0.09173583984375, ...

embed

29291195_c0

29291195

prolog

0

Title: Prolog - Find the first solution and stop searching Problem title: Prolog - Find the first solution and stop searching Tags: prolog Problem: Prolog - Find the first solution and stop searching I am learning programming in Prolog and have a problem with a rule, it must search for the solution and once it is found...

Prolog - Find the first solution and stop searching Prolog - Find the first solution and stop searching prolog Prolog Find do_something do_whatever Prolog - Find the first solution and stop searching I am learning programming in Prolog and have a problem with a rule, it must search for the solution and once it is found...

[ -0.001800537109375, 0.01019287109375, 0.0140380859375, 0.00750732421875, -0.017578125, 0.0177001953125, -0.004180908203125, 0.00738525390625, 0.007049560546875, -0.056396484375, -0.0106201171875, -0.005340576171875, -0.024658203125, -0.0034332275390625, 0.0294189453125, 0.0281982421875...

[ 1250, 4867, 20, 26040, 5117, 29806, 136, 7279, 157318, 502, 54, 43452, 64113, 124409, 30441, 70, 52080, 56037, 2967, 79986, 8110, 33938, 100, 24145, 14037, 157, 165523, 1286, 3501, 1632, 37842, 4263, 959, 35782, 4420, 125728, 214, 9790, 179...

[ 0.1834716796875, 0.252197265625, 0.0142364501953125, 0.1719970703125, 0.1612548828125, 0.218994140625, 0.010650634765625, 0.163330078125, 0.23046875, 0.125732421875, 0.1500244140625, 0.04278564453125, 0.1661376953125, 0.114990234375, 0.1458740234375, 0.0069580078125, 0.04733276367187...

embed

33173787_c0

33173787

prolog

0

Title: Prolog: Can you make a predicate behave differently depending on whether a value is ground or not? Problem title: Prolog: Can you make a predicate behave differently depending on whether a value is ground or not? Tags: logical-purity, prolog Problem: Prolog: Can you make a predicate behave differently depending ...

Prolog: Can you make a predicate behave differently depending on whether a value is ground or not? Prolog: Can you make a predicate behave differently depending on whether a value is ground or not? logical-purity prolog Prolog Can Prolog: Can you make a predicate behave differently depending on whether a value is groun...

[ -0.00860595703125, 0.01153564453125, -0.00095367431640625, 0.000762939453125, -0.0252685546875, 0.005828857421875, 0.00341796875, 0.0032501220703125, -0.00494384765625, -0.005401611328125, -0.000469207763671875, 0.00543212890625, -0.031494140625, -0.00885009765625, 0.016845703125, 0.01...

[ 1250, 4867, 4171, 3249, 1653, 2063, 67, 186, 68991, 12921, 96819, 36766, 34292, 83, 61585, 959, 62775, 289, 4717, 2481, 502, 707, 208806, 27140, 22759, 10750, 3871, 4488, 3229, 5117, 4568, 10869, 64330, 17932, 50960, 621, 284, 571, 441, 3...

[ 0.138916015625, 0.2056884765625, 0.06256103515625, 0.04779052734375, 0.189208984375, 0.2257080078125, 0.143798828125, 0.06201171875, 0.1573486328125, 0.1923828125, 0.1077880859375, 0.0141754150390625, 0.2083740234375, 0.054229736328125, 0.2490234375, 0.11328125, 0.08819580078125, 0...

embed

29069649_c0

29069649

prolog

0

Title: Generating a Mandarin numbering system Problem title: Generating a Mandarin numbering system Tags: prolog Problem: Generating a Mandarin numbering system I'm constructing a Prolog program that counts from 0 to 10,000. I have it working for 0 to 99. I need help with 100 to 1,000. The numbering system can be found...

Generating a Mandarin numbering system Generating a Mandarin numbering system prolog Generating Mandarin Generating a Mandarin numbering system I'm constructing a Prolog program that counts from 0 to 10,000. I have it working for 0 to 99. I need help with 100 to 1,000. The numbering system can be found at http://mandar...

[ 0.01031494140625, -0.01141357421875, -0.016845703125, 0.004119873046875, 0.000530242919921875, 0.0220947265625, -0.005706787109375, 0.003448486328125, 0.0035552978515625, -0.01953125, 0.0166015625, -0.02685546875, 0.004486083984375, -0.00592041015625, 0.01171875, -0.0247802734375, 0....

[ 155370, 1916, 86099, 2677, 14012, 214, 5426, 10, 502, 4867, 64549, 1250, 1528, 54529, 1295, 757, 47, 84428, 20697, 100, 10078, 3871, 4358, 805, 75534, 14037, 31468, 115095, 2199, 965, 408, 32262, 11, 2606, 1297, 32354, 35064, 65771, 140992,...

[ 0.185791015625, 0.05767822265625, 0.229248046875, 0.229248046875, 0.228759765625, 0.07208251953125, 0.157470703125, 0.01617431640625, 0.139404296875, 0.18798828125, 0.0849609375, 0.145263671875, 0.145751953125, 0.163818359375, 0.06201171875, 0.1483154296875, 0.09814453125, 0.189453...

embed

16272255_c1

16272255

prolog

1

G1,G2). /*if X is full and Y is not, then empty X*/ /* if X+Y is greater than or equal to 4 then fill Y from X*/ bucket(X,Y,T,G1,G2) :- (X+Y) >= 4, X>0, Z is (Y-(4-X)),not(memPairs(4,Z,T)),bucket(4,Z,[4,Z|T],G1,G2). /*if X+Y is greater than or equal to 3, then fill X from Y*/ bucket(X,Y,T,G1,G2) :- (X+Y) >=3, Z is (X-(...

[ -0.015625, 0.01312255859375, -0.0028839111328125, 0.00640869140625, -0.0013427734375, 0.01611328125, -0.0179443359375, -0.01220703125, 0.008544921875, 0.035400390625, 0.017333984375, -0.0159912109375, -0.01031494140625, -0.0152587890625, 0.00445556640625, -0.0024871826171875, -0.0017...

[ 527, 418, 4, 724, 10461, 5, 248, 1639, 3190, 1193, 83, 4393, 136, 990, 959, 7068, 201505, 64, 2174, 1328, 1723, 117396, 3501, 707, 105950, 201, 26292, 1295, 373, 27853, 1542, 618, 15772, 977, 1369, 2389, 567, 105801, 9, 10869, 37138, ...

[ 0.1859130859375, 0.120849609375, 0.070556640625, 0.154052734375, 0.2303466796875, 0.03662109375, 0.0211029052734375, 0.04510498046875, 0.102783203125, 0.1798095703125, 0.07183837890625, 0.2008056640625, 0.06280517578125, 0.174560546875, 0.167236328125, 0.02996826171875, 0.23400878906...

embed

58603006_c0

58603006

prolog

0

Title: Equivalent of "assert" in JPL7 Problem title: Equivalent of "assert" in JPL7 Tags: swi-prolog, java, jpl, prolog Problem: Equivalent of "assert" in JPL7 I am currently creating a Java Swing GUI where the user can select what type of fruits they like. Depending on their choice, only certain fr...

Equivalent of "assert" in JPL7 Equivalent of "assert" in JPL7 swi-prolog java jpl prolog Equivalent JPL7 selected_fruit Query System.out.println q2.hasSolution Term Atom Equivalent of "assert" in JPL7 I am currently creating a Java Swing GUI where the user can select what type of fruits they like. D...

[ 0.007537841796875, 0.02587890625, -0.003936767578125, 0.0341796875, -0.0294189453125, 0.009033203125, -0.006317138671875, -0.0025177001953125, -0.0089111328125, 0.0057373046875, 0.01177978515625, 0.01007080078125, -0.0211181640625, -0.00140380859375, 0.01336669921875, 0.021728515625, ...

[ 145666, 85540, 111, 162, 33657, 23, 821, 21130, 966, 41502, 91, 2452, 3454, 4867, 79, 330, 1647, 2424, 502, 133291, 23129, 217, 58836, 12353, 6056, 35662, 8096, 5442, 10557, 102588, 34, 2994, 69728, 105233, 41925, 14775, 195490, 38937, 3684...

[ 0.114990234375, 0.1455078125, 0.04925537109375, 0.147216796875, 0.308837890625, 0.031402587890625, 0.126953125, 0.2340087890625, 0.2005615234375, 0.0054931640625, 0.00457763671875, 0.2001953125, 0.125244140625, 0.22509765625, 0.04925537109375, 0.099609375, 0.056304931640625, 0.1588...

embed

74540192_c0

74540192

prolog

0

Title: A Prolog program for permutation parity Problem title: A Prolog program for permutation parity Tags: prolog, parity, permutation Problem: A Prolog program for permutation parity I wrote this small program in Prolog. odd_even_flip(odd, even). odd_even_flip(even, odd). permutation_parity([X|L], [X|P], R) :- permut...

A Prolog program for permutation parity A Prolog program for permutation parity prolog parity permutation Prolog odd_even_flip flip_one permutation_parity Res A Prolog program for permutation parity I wrote this small program in Prolog. I expect it to find the parity of a permutation P of list L. The few queries that a...

[ 0.011962890625, 0.038818359375, 0.018798828125, -0.0118408203125, -0.0086669921875, 0.024169921875, -0.01019287109375, -0.0069580078125, 0.004913330078125, -0.013671875, 0.00390625, 0.00921630859375, 0.01544189453125, 0.01092529296875, -0.0015869140625, -0.00482177734375, 0.002548217...

[ 1250, 4867, 1528, 100, 117, 561, 22062, 366, 2481, 62, 502, 70270, 26301, 21392, 147505, 3630, 2500, 9624, 54397, 19336, 41206, 7413, 436, 111, 5303, 339, 10846, 41, 34475, 160463, 3853, 707, 79786, 5885, 16981, 876, 501, 1193, 990, 7639,...

[ 0.172119140625, 0.218017578125, 0.1761474609375, 0.0372314453125, 0.140625, 0.1737060546875, 0.053466796875, 0.18994140625, 0.1119384765625, 0.0165252685546875, 0.10540771484375, 0.1846923828125, 0.1082763671875, 0.1083984375, 0.1241455078125, 0.1064453125, 0.1978759765625, 0.06579...

embed

27761514_c0

27761514

prolog

0

Title: Intersection of two lists of variables Problem title: Intersection of two lists of variables Tags: iso-prolog, prolog Problem: Intersection of two lists of variables How to define in ISO Prolog a (meta-logical) predicate for the intersection of two lists of variables that runs in linear time? The variables may a...

Intersection of two lists of variables Intersection of two lists of variables iso-prolog prolog Intersection varset_intersection As_cap_Bs Inter Intersection of two lists of variables How to define in ISO Prolog a (meta-logical) predicate for the intersection of two lists of variables that runs in linear time? The vari...

[ 0.009765625, -0.00007295608520507812, 0.00390625, 0.00445556640625, 0.00970458984375, 0.01165771484375, -0.009765625, -0.0048828125, 0.013916015625, -0.01116943359375, 0.0020294189453125, 0.025146484375, -0.00469970703125, 0.004119873046875, 0.013916015625, 0.002960205078125, 0.00817...

[ 5337, 7, 58994, 6626, 5303, 77336, 111, 13882, 3454, 4867, 502, 285, 3509, 10433, 1301, 15644, 571, 11249, 61924, 17408, 1250, 10, 35273, 137043, 1653, 2063, 100, 1940, 127877, 192617, 1733, 108975, 2499, 83324, 12989, 208124, 108750, 57266, ...

[ 0.2132568359375, 0.20751953125, 0.1876220703125, 0.155517578125, 0.20166015625, 0.244140625, 0.000823974609375, 0.0992431640625, 0.1231689453125, 0.218017578125, 0.1239013671875, 0.1466064453125, 0.17333984375, 0.176025390625, 0.09130859375, 0.124267578125, 0.0469970703125, 0.01095...

embed

16373739_c0

16373739

prolog

0

Title: Prolog avoid generating same lists twice Problem title: Prolog avoid generating same lists twice Tags: prolog, list Problem: Prolog avoid generating same lists twice I have following code: internal_generator(List):- select(foo, List, MList), select(bar, MList, M2List), select(baz, M2List, _). internal_generator2...

Prolog avoid generating same lists twice Prolog avoid generating same lists twice prolog list Prolog internal_generator List MList M2List internal_generator2 sth1 sth2 sth3 external_generator List1 List2 Prolog avoid generating same lists twice I have following code: Prolog, after generating some List1 by internal_gene...

[ 0.01129150390625, 0.00927734375, 0.011962890625, -0.010009765625, -0.02001953125, 0.00421142578125, -0.01397705078125, -0.0086669921875, 0.00933837890625, -0.033447265625, 0.0032958984375, 0.0281982421875, 0.006134033203125, 0.0230712890625, 0.013916015625, 0.004669189453125, 0.00099...

[ 1250, 4867, 71864, 12663, 5701, 5303, 186351, 1916, 502, 70796, 48281, 1290, 32036, 154663, 304, 927, 173591, 18151, 139392, 44116, 50339, 104250, 756, 4420, 16750, 5775, 31, 1299, 40300, 7722, 142424, 13438, 456, 144810, 4343, 7413, 5584, 86...

[ 0.1785888671875, 0.2498779296875, 0.1888427734375, 0.162109375, 0.1429443359375, 0.1868896484375, 0.195556640625, 0.009063720703125, 0.1361083984375, 0.143798828125, 0.16650390625, 0.078125, 0.1258544921875, 0.1488037109375, 0.10272216796875, 0.000457763671875, 0.09326171875, 0.119...

embed

58367026_c0

58367026

prolog

0

Title: Prolog: Define propositional logic statement operators and add arguments to list Problem title: Prolog: Define propositional logic statement operators and add arguments to list Tags: list, prolog, operators Problem: Prolog: Define propositional logic statement operators and add arguments to list I'm trying to de...

Prolog: Define propositional logic statement operators and add arguments to list Prolog: Define propositional logic statement operators and add arguments to list list prolog operators Prolog Define Prolog: Define propositional logic statement operators and add arguments to list I'm trying to define some operators that ...

[ 0.0250244140625, 0.00026702880859375, 0.00167083740234375, -0.003326416015625, -0.023193359375, 0.0027618408203125, 0.0101318359375, 0.00811767578125, 0.0025177001953125, -0.01953125, -0.00653076171875, -0.0150146484375, -0.013427734375, 0.00836181640625, -0.002288818359375, 0.02172851...

[ 1250, 4867, 262, 64552, 89261, 289, 62775, 63805, 39933, 7, 15190, 10750, 47, 5303, 502, 31577, 61924, 678, 136, 459, 6626, 4527, 33172, 9960, 724, 84780, 3714, 40140, 61972, 765, 11737, 105233, 24233, 69941, 111, 756, 188336, 23009, 1884, ...

[ 0.179443359375, 0.24951171875, 0.0623779296875, 0.1390380859375, 0.2130126953125, 0.1014404296875, 0.169921875, 0.177978515625, 0.254150390625, 0.05126953125, 0.14306640625, 0.2237548828125, 0.053955078125, 0.18701171875, 0.1219482421875, 0.03717041015625, 0.1434326171875, 0.047698...

embed

67129062_c0

67129062

prolog

0

Title: Prolog connection between 2 in a family tree Problem title: Prolog connection between 2 in a family tree Tags: prolog Problem: Prolog connection between 2 in a family tree I am new to prolog. I don't know how to get connection between two and get list of people in between. This is the prolog code for the family ...

Prolog connection between 2 in a family tree Prolog connection between 2 in a family tree prolog Prolog Facts Rules Prolog connection between 2 in a family tree I am new to prolog. I don't know how to get connection between two and get list of people in between. This is the prolog code for the family tree Elizabeth fam...

[ 0.01177978515625, 0.0106201171875, -0.00014209747314453125, 0.0130615234375, -0.01092529296875, 0.0281982421875, -0.03466796875, -0.0021514892578125, 0.0034637451171875, -0.0576171875, 0.0089111328125, -0.038818359375, -0.020751953125, -0.002410888671875, 0.002838134765625, 0.005584716...

[ 1250, 4867, 94878, 17721, 116, 23, 14449, 53201, 10, 502, 132640, 139118, 3525, 3714, 3642, 2046, 6626, 5303, 3395, 3293, 83, 70, 18151, 100, 72542 ]

[ 0.1763916015625, 0.287841796875, 0.180419921875, 0.2086181640625, 0.14013671875, 0.08587646484375, 0.10791015625, 0.263671875, 0.0234222412109375, 0.164794921875, 0.1463623046875, 0.1441650390625, 0.03936767578125, 0.019866943359375, 0.0033359527587890625, 0.061065673828125, 0.121032...

embed

47109776_c0

47109776

prolog

0

Title: Controlling 'cut' in recursive function to remove an element from a list in Prolog Problem title: Controlling 'cut' in recursive function to remove an element from a list in Prolog Tags: prolog Problem: Controlling 'cut' in recursive function to remove an element from a list in Prolog I'm try...

Controlling 'cut' in recursive function to remove an element from a list in Prolog Controlling 'cut' in recursive function to remove an element from a list in Prolog prolog a Controlling Prolog Result Controlling 'cut' in recursive function to remove an element from a list in Prolog I'm trying to cr...

[ 0.001983642578125, 0.022216796875, 0.0057373046875, 0.0135498046875, -0.01287841796875, 0.00147247314453125, -0.004608154296875, -0.0108642578125, 0.017578125, -0.0263671875, 0.0030975341796875, -0.00811767578125, -0.006744384765625, 0.00092315673828125, 0.0164794921875, -0.01147460937...

[ 27131, 2069, 3768, 19774, 195625, 5844, 32354, 87388, 12830, 1295, 5303, 1250, 4867, 502, 126684, 31577, 28282, 756, 70, 74918, 42, 3173, 51347, 12921, 51515, 43658, 80854, 3525, 2174, 959, 105950, 3444, 154109, 16750, 41206, 13695, 97370, 44...

[ 0.1834716796875, 0.0794677734375, 0.07061767578125, 0.2315673828125, 0.1878662109375, 0.1285400390625, 0.1561279296875, 0.1702880859375, 0.1466064453125, 0.09442138671875, 0.1690673828125, 0.1483154296875, 0.22265625, 0.1083984375, 0.154052734375, 0.0250701904296875, 0.03863525390625...

embed

8318293_c0

8318293

prolog

0

Title: Simplified Travelling Salesman in Prolog Problem title: Simplified Travelling Salesman in Prolog Tags: prolog, prolog-dif, traveling-salesman, backtracking Problem: Simplified Travelling Salesman in Prolog I've looked through the similar questions but can't find anything that's relevant to my problem. I'm strugg...

Simplified Travelling Salesman in Prolog Simplified Travelling Salesman in Prolog prolog prolog-dif traveling-salesman backtracking Simplified Travelling Salesman Prolog CityA CityB City1 City2 Distance all_possible_paths loop_process Simplified Travelling Salesman in Prolog I've looked through the similar questions bu...

[ 0.04345703125, 0.0078125, 0.0062255859375, 0.0277099609375, -0.0111083984375, 0.01043701171875, -0.025146484375, 0.0035858154296875, 0.02197265625, -0.046630859375, -0.000051021575927734375, 0.01080322265625, -0.015869140625, 0.0257568359375, 0.01153564453125, 0.011474609375, -0.0005...

[ 55331, 141, 47314, 30720, 2069, 88583, 669, 1250, 4867, 502, 428, 420, 26983, 214, 7, 21183, 4420, 125728, 6406, 284, 571, 418, 304, 154349, 756, 7522, 55356, 128405, 40956, 63923, 29191, 2967, 237875, 7413, 234873, 5423, 28354, 10, 60875, ...

[ 0.06689453125, 0.082275390625, 0.09613037109375, 0.166259765625, 0.077880859375, 0.1435546875, 0.1439208984375, 0.1427001953125, 0.2216796875, 0.1060791015625, 0.026458740234375, 0.0753173828125, 0.1466064453125, 0.051361083984375, 0.008056640625, 0.1058349609375, 0.151123046875, 0...

embed

72280864_c0

72280864

prolog

0

Title: If I ask for X, it generates duplicates, but it fails on duplicates if I ask explicitly Problem title: If I ask for X, it generates duplicates, but it fails on duplicates if I ask explicitly Tags: prolog Problem: If I ask for X, it generates duplicates, but it fails on duplicates if I ask explicitly I am trying ...

If I ask for X, it generates duplicates, but it fails on duplicates if I ask explicitly If I ask for X, it generates duplicates, but it fails on duplicates if I ask explicitly prolog X-Y pos_ piese_pos _-_-Y is_set a-1 a-2 When But stackoverflow.com Lst Set If I ask for X, it generates duplicates, but it fails on dupli...

[ -0.0137939453125, -0.0028076171875, 0.0098876953125, -0.019775390625, -0.0263671875, 0.0098876953125, 0.01165771484375, 0.003204345703125, -0.0001659393310546875, -0.037841796875, -0.029296875, 0.048095703125, 0.0130615234375, 0.00185394287109375, -0.0096435546875, 0.0205078125, 0.00...

[ 4263, 26458, 100, 1193, 139392, 7, 171763, 1636, 1284, 35782, 98, 143726, 502, 4867, 1723, 3864, 113681, 7522, 3509, 10, 5759, 5428, 177261, 5465, 118664, 277, 271, 19943, 442, 31577, 126371, 45443, 29458, 19069, 64209, 6626, 831, 143414, 5...

[ 0.00469970703125, 0.2064208984375, 0.100830078125, 0.08648681640625, 0.19384765625, 0.0228118896484375, 0.26171875, 0.1588134765625, 0.0279693603515625, 0.1788330078125, 0.06597900390625, 0.1658935546875, 0.113037109375, 0.16015625, 0.08160400390625, 0.113037109375, 0.09716796875, ...

embed

50450585_c0

50450585

prolog

0

Title: Prolog , return permutations with a max value Problem title: Prolog , return permutations with a max value Tags: max, return, permutation, prolog Problem: Prolog , return permutations with a max value i have made predicate schedule(A,B,C) that returns possible permutations at lists A,B,C with backtracking | ?- s...

Prolog , return permutations with a max value Prolog , return permutations with a max value max return permutation prolog Prolog im204 im212 im217 im209 im214 im218 im210 im216 score_schedule all_schedule_scores Prolog , return permutations with a max value i have made predicate schedule(A,B,C) that returns possible pe...

[ 0.0126953125, 0.019775390625, 0.01177978515625, 0.01397705078125, -0.031005859375, 0.01312255859375, -0.01300048828125, 0.004364013671875, -0.001739501953125, -0.0281982421875, 0.004302978515625, 0.0076904296875, 0.005615234375, -0.0098876953125, 0.018798828125, -0.004791259765625, -...

[ 1250, 4867, 30646, 117, 14311, 21094, 678, 18389, 34292, 561, 502, 566, 147758, 304, 1530, 2489, 1549, 1126, 2592, 1819, 88142, 2485, 47763, 7560, 693, 756, 133, 12064, 7228, 1653, 2063, 80889, 284, 571, 441, 7722, 5303, 62, 4420, 125728,...

[ 0.1695556640625, 0.2279052734375, 0.20654296875, 0.137939453125, 0.223388671875, 0.07989501953125, 0.08819580078125, 0.1947021484375, 0.1561279296875, 0.1826171875, 0.1417236328125, 0.08746337890625, 0.1612548828125, 0.01177978515625, 0.01043701171875, 0.0501708984375, 0.005828857421...

embed