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
4008801_c0
4008801
prolog
0
Title: Prolog GNU - Having a difficult time with this, lists and recursion Problem title: Prolog GNU - Having a difficult time with this, lists and recursion Tags: prolog, recursion, list Problem: Prolog GNU - Having a difficult time with this, lists and recursion So , i still don't completely understand how lists and ...
Prolog GNU - Having a difficult time with this, lists and recursion Prolog GNU - Having a difficult time with this, lists and recursion prolog recursion list Prolog GNU Having List Prolog GNU - Having a difficult time with this, lists and recursion So , i still don't completely understand how lists and recursion work i...
[ 0.0225830078125, -0.00067901611328125, 0.00848388671875, 0.0228271484375, -0.004486083984375, 0.01202392578125, -0.0126953125, 0.01104736328125, 0.021484375, -0.01275634765625, 0.001678466796875, -0.0341796875, -0.01190185546875, 0.0169677734375, 0.0111083984375, -0.005889892578125, ...
[ 1250, 4867, 165132, 171855, 10, 34844, 1733, 678, 903, 5303, 7, 136, 195625, 1830, 502, 32036, 28219, 4488, 23, 63134, 9842, 2967, 23902, 7413, 2174, 22008, 83, 34391, 8305, 37076, 1257, 6626, 27781, 2046, 12765, 31949, 1957, 3445, 304, 1...
[ 0.1517333984375, 0.242431640625, 0.1773681640625, 0.07525634765625, 0.00238037109375, 0.10076904296875, 0.0989990234375, 0.054962158203125, 0.05914306640625, 0.2259521484375, 0.004852294921875, 0.08740234375, 0.239501953125, 0.166015625, 0.1529541015625, 0.2081298828125, 0.0537109375...
embed
20164305_c0
20164305
prolog
0
Title: Return Value Function - Prolog Problem title: Return Value Function - Prolog Tags: prolog Problem: Return Value Function - Prolog I have made this two prolog functions: move-pacman([[Xpacman,Ypacman]],[[Xghost,Yghost]|_], Listpellets, Movepacman):- Xpacman+1=:=Xghost, Ypacman=Yghost, haspellet(Listpellets, Xpacm...
Return Value Function - Prolog Return Value Function - Prolog prolog Value Prolog Xpacman Ypacman Xghost Yghost Listpellets Movepacman Xpacman-1 Ypacman-1 Restghosts Xpellet Ypellet Restpellets Return Value Function - Prolog I have made this two prolog functions: My question is why when I run my programm with this: The...
[ 0.0024871826171875, -0.00299072265625, -0.00555419921875, 0.0247802734375, 0.0169677734375, 0.0218505859375, -0.00156402587890625, 0.0242919921875, 0.002960205078125, 0.01904296875, 0.004058837890625, 0.0299072265625, -0.018310546875, -0.01177978515625, 0.004241943359375, 0.00044822692...
[ 173340, 190060, 28670, 10763, 1250, 4867, 502, 62268, 669, 990, 1193, 40294, 32036, 117515, 7831, 135828, 5759, 49756, 5310, 1974, 7228, 6626, 32354, 9655, 15400, 3229, 11675, 28966, 678, 903, 30646, 34292, 83, 10, 337, 31, 34677, 64457, 23...
[ 0.2491455078125, 0.27734375, 0.15087890625, 0.0333251953125, 0.1361083984375, 0.236328125, 0.1370849609375, 0.1171875, 0.1358642578125, 0.017730712890625, 0.0214080810546875, 0.1492919921875, 0.067626953125, 0.1422119140625, 0.10595703125, 0.0487060546875, 0.0236663818359375, 0.078...
embed
49953525_c0
49953525
prolog
0
Title: Propositional logic in prolog almost works, trouble with xor Problem title: Propositional logic in prolog almost works, trouble with xor Tags: prolog Problem: Propositional logic in prolog almost works, trouble with xor I'm very new on prolog, so I'm trying to make a propositional logic solver, something who sol...
Propositional logic in prolog almost works, trouble with xor Propositional logic in prolog almost works, trouble with xor prolog Propositional implies1 implies2 implies3 Propositional logic in prolog almost works, trouble with xor I'm very new on prolog, so I'm trying to make a propositional logic solver, something who...
[ 0.01123046875, 0.0169677734375, 0.006866455078125, -0.01324462890625, -0.029296875, 0.0201416015625, -0.005035400390625, 0.006805419921875, -0.0096435546875, -0.0198974609375, 0.0020599365234375, 0.0137939453125, 0.004730224609375, -0.000637054443359375, 0.003814697265625, 0.0035095214...
[ 1250, 40322, 289, 62775, 502, 4867, 39555, 43240, 63134, 74706, 35388, 90, 418, 304, 363, 3525, 31577, 89261, 3115, 814, 86869, 6528, 27875, 915, 864, 42, 31, 34677, 171859, 75463, 27781, 51359, 3647, 3034, 18151, 214, 3664, 9790, 2704, 2...
[ 0.1265869140625, 0.1934814453125, 0.1009521484375, 0.19189453125, 0.1678466796875, 0.2181396484375, 0.17529296875, 0.10595703125, 0.1234130859375, 0.1947021484375, 0.190185546875, 0.0259857177734375, 0.023529052734375, 0.0762939453125, 0.15087890625, 0.01043701171875, 0.0111389160156...
embed
5589008_c1
5589008
prolog
1
_lancaster,execution, took_place, '16_march_1322']). history('battle_of_Towton',[edwardIV,defeated,henryVI,palm_Sunday]). history('battle_of_Wakefield',[richard_of_york, took_place, '30_December_1490',was,slain,war_of_the_roses]). history('battle_of_Adwalton_Moor',[earl_of_newcastle,defeats,fairfax, took_place, '30_Jun...
_lancaster,execution, took_place, '16_march_1322']). history('battle_of_Towton',[edwardIV,defeated,henryVI,palm_Sunday]). history('battle_of_Wakefield',[richard_of_york, took_place, '30_December_1490',was,slain,war_of_the_roses]). history('battle_of_Adwalton_Moor',[earl_of_newcastle,defeats,fairfax, took_place, '30_Jun...
[ -0.00921630859375, 0.0032958984375, 0.0022430419921875, 0.0294189453125, 0.0279541015625, -0.019775390625, -0.0059814453125, 0.005859375, -0.007476806640625, -0.04736328125, -0.00174713134765625, -0.00168609619140625, -0.0234375, -0.00653076171875, 0.005523681640625, -0.009521484375, ...
[ 101, 1414, 408, 1515, 46480, 1010, 1363, 34739, 23935, 2485, 1727, 2681, 4015, 268, 194, 32692, 132, 402, 46401, 4390, 7763, 434, 1507, 297, 19364, 15583, 112, 88981, 1294, 11839, 5007, 39, 66279, 5636, 22489, 350, 28394, 26932, 5861, 134...
[ 0.086669921875, 0.10284423828125, 0.194091796875, 0.2213134765625, 0.133544921875, 0.1937255859375, 0.053009033203125, 0.0711669921875, 0.15869140625, 0.1678466796875, 0.1168212890625, 0.1224365234375, 0.1881103515625, 0.0164642333984375, 0.06640625, 0.1937255859375, 0.0250244140625,...
embed
41233926_c0
41233926
prolog
0
Title: Understanding Prolog "append" recursive definition Problem title: Understanding Prolog "append" recursive definition Tags: prolog, recursion Problem: Understanding Prolog "append" recursive definition I'm reading Programming in Prolog: Using the ISO Standard , but I'm having problems understa...
Understanding Prolog "append" recursive definition Understanding Prolog "append" recursive definition prolog recursion Understanding Prolog List List1 List2 Result Understanding Prolog "append" recursive definition I'm reading Programming in Prolog: Using the ISO Standard , but I'm having problems u...
[ 0.010498046875, 0.0206298828125, 0.01068115234375, 0.017333984375, 0.0157470703125, 0.020263671875, -0.01434326171875, 0.0101318359375, 0.0234375, 0.001708984375, 0.01422119140625, -0.0361328125, -0.0311279296875, 0.01123046875, 0.0213623046875, 0.003265380859375, 0.0284423828125, ...
[ 9626, 144057, 1250, 4867, 9007, 3611, 195625, 5844, 80934, 502, 32036, 304, 126684, 16454, 27958, 17408, 20744, 44402, 100094, 114689, 71, 65508, 12877, 28219, 16750, 5303, 5608, 70541, 10336, 5117, 237, 6863, 61475, 83, 11675, 132, 46741, 50...
[ 0.05841064453125, 0.079345703125, 0.15185546875, 0.2235107421875, 0.14990234375, 0.2315673828125, 0.237548828125, 0.1639404296875, 0.156494140625, 0.1214599609375, 0.12353515625, 0.05206298828125, 0.170654296875, 0.014312744140625, 0.0833740234375, 0.0919189453125, 0.1243896484375, ...
embed
64716427_c0
64716427
prolog
0
Title: prolog - ERROR: Arguments are not sufficiently instantiated Problem title: prolog - ERROR: Arguments are not sufficiently instantiated Tags: prolog Problem: prolog - ERROR: Arguments are not sufficiently instantiated I'm fairly new to prolog and need to check if the points makes a triangle isosceles but i got th...
prolog - ERROR: Arguments are not sufficiently instantiated prolog - ERROR: Arguments are not sufficiently instantiated prolog ERROR Arguments point2d _10064 _10084 checkman123 threepoints.pl:25 prolog - ERROR: Arguments are not sufficiently instantiated I'm fairly new to prolog and need to check if the points makes a ...
[ 0.0174560546875, -0.017578125, 0.0086669921875, 0.004913330078125, -0.003265380859375, 0.008544921875, -0.01483154296875, 0.007110595703125, -0.005615234375, -0.01165771484375, 0.006561279296875, -0.01611328125, 0.0096435546875, -0.01470947265625, -0.004852294921875, 0.003997802734375,...
[ 502, 4867, 151206, 24638, 112140, 7, 621, 959, 129980, 538, 34648, 14, 27686, 6275, 304, 71, 3559, 13307, 13903, 12765, 669, 48636, 17262, 38496, 2424, 21224, 180663, 3525, 2174, 26847, 30482, 1927, 109217, 83, 232, 46873, 903, 18499, 44691...
[ 0.1812744140625, 0.2379150390625, 0.1409912109375, 0.1236572265625, 0.266357421875, 0.1121826171875, 0.07049560546875, 0.15234375, 0.2186279296875, 0.100830078125, 0.1707763671875, 0.1683349609375, 0.1004638671875, 0.154052734375, 0.1488037109375, 0.1104736328125, 0.059844970703125, ...
embed
38688356_c0
38688356
prolog
0
Title: Writing a list based on another list on Prolog Problem title: Writing a list based on another list on Prolog Tags: prolog Problem: Writing a list based on another list on Prolog So, in this prolog program i have this "fruit database", this "person database" and a "ate database"... %fruit(FId, Name, Type, Price)....
Writing a list based on another list on Prolog Writing a list based on another list on Prolog prolog Writing Prolog FId Name Type Price PId person_ate FruitIds person_ate_fruits person_ate_types person_ate_prices cheap_fruit expensive_fruit middleprice_fruit TcounterBitter Counter Bitter TcounterSweet TcounterCitric re...
[ 0.024169921875, 0.00408935546875, -0.01446533203125, 0.0031890869140625, -0.01318359375, 0.0098876953125, -0.028076171875, 0.0262451171875, 0.01409912109375, -0.01495361328125, -0.006866455078125, 0.000522613525390625, -0.0007476806640625, 0.006011962890625, 0.01214599609375, -0.011779...
[ 213185, 5303, 35509, 98, 15700, 1250, 4867, 502, 32983, 15757, 60457, 48025, 3445, 2182, 151958, 23129, 50986, 5293, 64720, 135587, 86991, 71013, 16882, 3055, 197956, 40787, 1177, 62233, 33844, 25965, 1528, 217, 63399, 30816, 79986, 41, 93151, ...
[ 0.145263671875, 0.2022705078125, 0.1427001953125, 0.024810791015625, 0.095947265625, 0.1517333984375, 0.2222900390625, 0.122802734375, 0.00225830078125, 0.05523681640625, 0.1407470703125, 0.1212158203125, 0.08514404296875, 0.148193359375, 0.2122802734375, 0.1436767578125, 0.134521484...
embed
36038458_c0
36038458
prolog
0
Title: Prolog: simple lexer/2 Problem title: Prolog: simple lexer/2 Tags: dcg, prolog Problem: Prolog: simple lexer/2 I need a small lexer/2 in prolog, currently I have tokens(Z) --> "while", tokens(Y), {Z = [ttwhile | Y]}. tokens(Z) --> "do", tokens(Y), {Z = [ttdo | Y]}. tokens(Z) --> "endwhile", tokens(Y), {Z = [tten...
Prolog: simple lexer/2 Prolog: simple lexer/2 dcg prolog Prolog Comparison Assignment Boolean Prolog: simple lexer/2 I need a small lexer/2 in prolog, currently I have Can anyone help me with the next step for lexer/2 so that when I call lexer([while,a,==,b,do,abc,endwhile], R) , I could get R = [ttwhile, a, equal, b, ...
[ 0.0235595703125, -0.030029296875, 0.0030517578125, 0.00811767578125, -0.009765625, 0.003448486328125, 0, -0.0005340576171875, 0.029052734375, -0.0267333984375, 0.00732421875, 0.0179443359375, -0.02978515625, -0.006256103515625, 0.032470703125, 0.0048828125, 0.0096435546875, 0.02709...
[ 1250, 4867, 8781, 95, 34058, 12477, 12, 177, 502, 113307, 40514, 1301, 31304, 73783, 34677, 3871, 19336, 23, 82424, 35672, 4358, 11737, 29954, 3229, 11782, 204610, 11, 69112, 275, 246, 2055, 3611, 627, 5809, 2046, 2203, 3062, 105950, 876, ...
[ 0.153076171875, 0.23046875, 0.153564453125, 0.1416015625, 0.2939453125, 0.234130859375, 0.003631591796875, 0.064208984375, 0.15185546875, 0.1553955078125, 0.0760498046875, 0.030517578125, 0.1763916015625, 0.09014892578125, 0.1773681640625, 0.10791015625, 0.131591796875, 0.017288208...
embed
33894950_c0
33894950
prolog
0
Title: Prolog Beginner: Reverse List only once Problem title: Prolog Beginner: Reverse List only once Tags: list, reverse, prolog Problem: Prolog Beginner: Reverse List only once Assume I have two arbitrary lists that represent the first two items of a 3-place predicate: [anna,berta,charlotte],[charles,bob,andy] I want...
Prolog Beginner: Reverse List only once Prolog Beginner: Reverse List only once list reverse prolog Prolog Beginner Reverse List Prolog Beginner: Reverse List only once Assume I have two arbitrary lists that represent the first two items of a 3-place predicate: I want to match every item in a third list (the third item...
[ 0.0054931640625, 0.034912109375, 0.00897216796875, 0.00982666015625, -0.0057373046875, 0.0069580078125, -0.002655029296875, 0.031982421875, 0.021484375, -0.021484375, 0.0024566650390625, 0.01263427734375, -0.006591796875, 0.006011962890625, 0.0198974609375, 0.01226806640625, 0.015869...
[ 1250, 4867, 67053, 56, 853, 37676, 32036, 4734, 24145, 5303, 39531, 184, 502, 6626, 61799, 33636, 5117, 55769, 5691, 23935, 1653, 2063, 3444, 14858, 11907, 35735, 50960, 243228, 54543, 97025, 18151, 3871, 17932, 209303, 37264, 9454, 678, 1263...
[ 0.1561279296875, 0.217041015625, 0.0965576171875, 0.04595947265625, 0.088134765625, 0.283447265625, 0.2626953125, 0.0977783203125, 0.1990966796875, 0.24658203125, 0.25439453125, 0.1929931640625, 0.120849609375, 0.0709228515625, 0.0462646484375, 0.12548828125, 0.0196685791015625, 0....
embed
40360930_c0
40360930
prolog
0
Title: Custom subset not backtracking Problem title: Custom subset not backtracking Tags: subset, prolog Problem: Custom subset not backtracking I'm new to prolog and I've been having trouble with some homework. On some part of my code I have to generate subsets of a given set on backtracking . Meaning, the code should...
Custom subset not backtracking Custom subset not backtracking subset prolog Custom subset2 Custom subset not backtracking I'm new to prolog and I've been having trouble with some homework. On some part of my code I have to generate subsets of a given set on backtracking . Meaning, the code should try for a subset, and ...
[ 0.01171875, 0.0126953125, 0.019287109375, 0.0047607421875, -0.006378173828125, 0.0128173828125, -0.0120849609375, 0.0020751953125, 0.01531982421875, 0.004638671875, 0.00128173828125, 0.0235595703125, 0.004119873046875, -0.01458740234375, 0.004302978515625, 0.00164794921875, 0.0185546...
[ 130664, 1614, 3509, 959, 4420, 125728, 214, 502, 4867, 304, 63134, 18244, 18151, 139392, 5423, 9790, 35782, 35431, 114977, 32354, 23742, 18, 15044, 10750, 107730, 88303, 114122, 7464, 5122, 2967, 1653, 2063, 67, 33652, 605, 866, 76199, 28271,...
[ 0.2056884765625, 0.2220458984375, 0.209228515625, 0.080810546875, 0.14892578125, 0.2418212890625, 0.060211181640625, 0.11572265625, 0.1588134765625, 0.1556396484375, 0.03228759765625, 0.030609130859375, 0.1002197265625, 0.033599853515625, 0.16455078125, 0.04876708984375, 0.1611328125...
embed
65865561_c0
65865561
prolog
0
Title: Why does this give a NonGroundProbabilisticClause error, but not the deterministic counterpart? Problem title: Why does this give a NonGroundProbabilisticClause error, but not the deterministic counterpart? Tags: problog, prolog Problem: Why does this give a NonGroundProbabilisticClause error, but not the determ...
Why does this give a NonGroundProbabilisticClause error, but not the deterministic counterpart? Why does this give a NonGroundProbabilisticClause error, but not the deterministic counterpart? problog prolog Why NonGroundProbabilisticClause P::property Why does this give a NonGroundProbabilisticClause error, but not the...
[ -0.003875732421875, 0.012451171875, 0.05224609375, -0.0023956298828125, -0.0111083984375, 0.016845703125, 0.00933837890625, -0.01055908203125, 0.022216796875, -0.046630859375, 0.01019287109375, 0.0189208984375, -0.01141357421875, -0.0079345703125, 0.00830078125, 0.01165771484375, 0.0...
[ 44084, 903, 8337, 3775, 67688, 10752, 402, 2721, 48242, 26253, 13, 18499, 959, 72694, 105416, 17365, 1284, 502, 9883, 4867, 724, 441, 436, 12, 36290, 56, 1528, 33636, 3445, 4527, 5303, 161451, 20668, 18227, 12150, 10325, 27781, 61924, 11583...
[ 0.0845947265625, 0.05694580078125, 0.07672119140625, 0.157958984375, 0.1796875, 0.13330078125, 0.1802978515625, 0.169189453125, 0.16259765625, 0.1627197265625, 0.044708251953125, 0.191162109375, 0.1221923828125, 0.175537109375, 0.124267578125, 0.1292724609375, 0.019775390625, 0.076...
embed
28605913_c1
28605913
prolog
1
7,IB37],[C8,IB38],[C9,IB39], [D1,IB41],[D2,IB42],[D3,IB43], [D4,IB44],[D5,IB45],[D6,IB46],[D7,IB47],[D8,IB48],[D9,IB49], [E1,IB51],[E2,IB52],[E3,IB53], [E4,IB54],[E5,IB55],[E6,IB56],[E7,IB57],[E8,IB58],[E9,IB59], [F1,IB61],[F2,IB62],[F3,IB63], [F4,IB64],[F5,IB65],[F6,IB66],[F7,IB67],[F8,IB68],[F9,IB69], %for a list wit...
, i want to set the 3 constraints for each row and column of the list, so i call "pruefen" for all rows and column: SO, I call pruefen for the lists. First I exclude all field which are black and undefined, because I dont need/want set constraint for them: the predicate for exclude: isBlackAndEmpty([Variable|IsBlack]):...
[ 0.01300048828125, -0.018310546875, -0.00176239013671875, 0.022705078125, 0.003509521484375, 0.001495361328125, -0.010009765625, 0.025390625, 0.0189208984375, 0.0269775390625, -0.0224609375, 0.0174560546875, 0.0027313232421875, 0.006256103515625, -0.0218505859375, 0.0137939453125, 0.0...
[ 17, 3444, 5423, 138, 158, 2816, 4288, 7, 12638, 15555, 136, 3365, 316, 5303, 11782, 26992, 13, 6211, 100, 756, 25230, 39041, 112, 44457, 22556, 5983, 13319, 3206, 1653, 2063, 67, 83, 97732, 37839, 134332, 939, 81827, 14, 2886, 29598, 20...
[ 0.01947021484375, 0.042022705078125, 0.1458740234375, 0.155517578125, 0.093017578125, 0.1982421875, 0.151123046875, 0.05645751953125, 0.0239410400390625, 0.1531982421875, 0.0172576904296875, 0.049163818359375, 0.07427978515625, 0.1798095703125, 0.109619140625, 0.15087890625, 0.158203...
embed
23554562_c0
23554562
prolog
0
Title: Why there is infinite loop while using maplist with lambda and tilde term? Problem title: Why there is infinite loop while using maplist with lambda and tilde term? Tags: prolog, lambda Problem: Why there is infinite loop while using maplist with lambda and tilde term? I have a couple of predicates doing the sam...
Why there is infinite loop while using maplist with lambda and tilde term? Why there is infinite loop while using maplist with lambda and tilde term? prolog lambda maplist Why use_module both_lambda_and_func lambda_only Len func_only func_only_helper normal_prolog normal_prolog_helper Why there is infinite loop while u...
[ 0.013671875, 0.006072998046875, 0.005615234375, -0.00323486328125, -0.0247802734375, 0.01055908203125, 0.031005859375, 0.034912109375, 0.0108642578125, -0.03955078125, 0.01068115234375, -0.0169677734375, -0.0020751953125, 0.014404296875, 0.021728515625, 0.0035552978515625, 0.01385498...
[ 44084, 2685, 83, 54241, 13, 40956, 12960, 17368, 22288, 6562, 678, 21, 6492, 85, 136, 139, 112, 13579, 502, 4867, 4527, 83279, 15044, 143, 16498, 191, 18226, 7477, 238, 73866, 56, 3638, 3454, 1653, 2063, 1250, 1636, 28412, 138, 5843, 23...
[ 0.0933837890625, 0.051605224609375, 0.0217132568359375, 0.17333984375, 0.107421875, 0.2210693359375, 0.007965087890625, 0.063720703125, 0.148193359375, 0.2225341796875, 0.031097412109375, 0.0173797607421875, 0.162109375, 0.1290283203125, 0.035430908203125, 0.17626953125, 0.18359375, ...
embed
50230829_c0
50230829
prolog
0
Title: Getting the list of ASCII values from term in Prolog Problem title: Getting the list of ASCII values from term in Prolog Tags: prolog, ascii Problem: Getting the list of ASCII values from term in Prolog I am using SWI-Prolog version 7.6.3 and I recently encounter a problem for converting a term that combines num...
Getting the list of ASCII values from term in Prolog Getting the list of ASCII values from term in Prolog prolog ascii term Getting ASCII Prolog Getting the list of ASCII values from term in Prolog I am using SWI-Prolog version 7.6.3 and I recently encounter a problem for converting a term that combines number and alph...
[ 0.01397705078125, -0.0072021484375, 0.0130615234375, 0.021728515625, -0.01177978515625, 0.0038299560546875, -0.005340576171875, 0.02783203125, -0.0107421875, 0.002166748046875, 0.03857421875, 0.00323486328125, 0.00421142578125, 0.019287109375, -0.0255126953125, 0.000949859619140625, ...
[ 210732, 5303, 125429, 10001, 142424, 1295, 13579, 1250, 4867, 502, 237, 26506, 23, 159, 38969, 10752, 200768, 190647, 2967, 96760, 70163, 14012, 229231, 113054, 9351, 12477, 1653, 2063, 2046, 34292, 1563, 707, 2055, 831, 4527, 1542, 140992, 1...
[ 0.07464599609375, 0.166015625, 0.1561279296875, 0.23779296875, 0.186279296875, 0.0885009765625, 0.2298583984375, 0.16650390625, 0.2435302734375, 0.1282958984375, 0.0205841064453125, 0.1900634765625, 0.010284423828125, 0.0301513671875, 0.1773681640625, 0.1273193359375, 0.088623046875,...
embed
78844947_c0
78844947
prolog
0
Title: How to create a list dynamically in Prolog? Problem title: How to create a list dynamically in Prolog? Tags: list, swi-prolog, return-value, recursion, prolog Problem: How to create a list dynamically in Prolog? I have looked at the gazillions of other similar questions, but I haven't found a working solution, s...
How to create a list dynamically in Prolog? How to create a list dynamically in Prolog? list swi-prolog return-value recursion prolog How Prolog check_prime _31415926 How to create a list dynamically in Prolog? I have looked at the gazillions of other similar questions, but I haven't found a working solution, so I am a...
[ 0.00811767578125, 0.0213623046875, 0.0186767578125, 0.0098876953125, 0.0184326171875, 0.010986328125, -0.0186767578125, -0.011474609375, 0.00830078125, -0.0264892578125, 0.020263671875, -0.00579833984375, 0.0001621246337890625, -0.029296875, 0.0177001953125, 0.016845703125, 0.0175781...
[ 11249, 28282, 5303, 84079, 25958, 23, 1250, 4867, 2452, 3454, 30646, 27494, 195625, 502, 12765, 114654, 363, 2592, 146086, 4046, 20697, 29806, 79986, 3444, 11675, 65771, 33022, 80836, 2389, 20809, 18444, 26278, 47, 130250, 30700, 28412, 26818, ...
[ 0.038330078125, 0.164306640625, 0.2412109375, 0.1982421875, 0.11328125, 0.030181884765625, 0.15234375, 0.247314453125, 0.1083984375, 0.111083984375, 0.09686279296875, 0.0865478515625, 0.1270751953125, 0.0897216796875, 0.1522216796875, 0.1646728515625, 0.0062255859375, 0.06536865234...
embed
36187107_c1
36187107
prolog
1
path(1,3, Path, Length). Path = [e(1, 3)], Length = 1 ; Path = [e(1, 2), e(2, 3)], Length = 2 ; And then the Swi-Prolog IDE freezes. What should I define as the base case ? Why is the second implementation looping, if it's the case, even if I used the visited node list and the dif() to be sure to avoid unification go ...
path(1,3, Path, Length). Path = [e(1, 3)], Length = 1 ; Path = [e(1, 2), e(2, 3)], Length = 2 ; And then the Swi-Prolog IDE freezes. What should I define as the base case ? Why is the second implementation looping, if it's the case, even if I used the visited node list and the dif() to be sure to avoid unification go ...
[ 0.00799560546875, 0.023681640625, 0.023681640625, 0.006866455078125, -0.004913330078125, 0.01043701171875, -0.0225830078125, -0.004913330078125, 0.0269775390625, -0.055908203125, -0.00396728515625, 0.0026702880859375, -0.01446533203125, 0.0123291015625, 0.017578125, 0.00994873046875, ...
[ 60875, 41600, 363, 108421, 77554, 927, 2203, 13, 8439, 106, 4958, 28, 116, 105432, 9, 10752, 4867, 36497, 4092, 13105, 5608, 61924, 3647, 7225, 44084, 17932, 208124, 40956, 214, 11814, 36997, 110, 112, 5303, 45755, 132, 71864, 51, 41274, ...
[ 0.2568359375, 0.038787841796875, 0.1337890625, 0.253173828125, 0.1436767578125, 0.1226806640625, 0.0648193359375, 0.0811767578125, 0.0994873046875, 0.05902099609375, 0.008331298828125, 0.0926513671875, 0.0701904296875, 0.198974609375, 0.030120849609375, 0.1478271484375, 0.23596191406...
embed
20548853_c0
20548853
prolog
0
Title: recursively unfold function with univ predicate Problem title: recursively unfold function with univ predicate Tags: recursion, substitution, prolog Problem: recursively unfold function with univ predicate I want to replace for example a with 2 in this term f(a,b,g(a,h(a))) . For this I first wanna unfold this t...
recursively unfold function with univ predicate recursively unfold function with univ predicate recursion substitution prolog T1list is_list L1unfold L2sub T1Expanded recursively unfold function with univ predicate I want to replace for example a with 2 in this term f(a,b,g(a,h(a))) . For this I first wanna unfold this...
[ -0.00677490234375, 0.006683349609375, 0.024658203125, 0.002532958984375, -0.006988525390625, -0.006561279296875, -0.01239013671875, 0.000766754150390625, 0.003570556640625, -0.011474609375, 0.0146484375, 0.00689697265625, -0.00531005859375, 0.00213623046875, 0.00885009765625, 0.0012969...
[ 195625, 5844, 538, 51, 42822, 32354, 678, 4371, 1653, 2063, 1830, 161740, 502, 4867, 384, 418, 6562, 83, 339, 309, 304, 22144, 113305, 67, 3444, 47, 91995, 27781, 10, 116, 13579, 1238, 275, 177, 127, 132, 11, 6165, 2203, 29568, 5303, ...
[ 0.22412109375, 0.12060546875, 0.0660400390625, 0.11328125, 0.24658203125, 0.178955078125, 0.113037109375, 0.16796875, 0.1468505859375, 0.170654296875, 0.0782470703125, 0.1771240234375, 0.100830078125, 0.1474609375, 0.07440185546875, 0.0384521484375, 0.1552734375, 0.0728759765625, ...
embed
76139099_c0
76139099
prolog
0
Title: Prolog rule keeps returning false Problem title: Prolog rule keeps returning false Tags: prolog Problem: Prolog rule keeps returning false I am really new to Prolog and I am working on this project. I have data on the british monarchy and I am working on a "heir" rule that finds the heir to the throne or tells m...
Prolog rule keeps returning false Prolog rule keeps returning false prolog female Prolog ernest_augustus george1 albert_victor george2 charlotte1 mary_adelaide mary1 victora1 louise_victoria mary2 victoria1 strict_agnatic strict_enatic agnatic_cognatic enatic_cognatic NAME Y-X child_of is_older AG0 is_younger elder_chi...
[ 0.0157470703125, 0.004669189453125, -0.00433349609375, 0.0125732421875, 0.002593994140625, 0.0208740234375, -0.01214599609375, -0.005462646484375, -0.02197265625, -0.031005859375, 0.0223388671875, -0.00872802734375, -0.0031890869140625, 0.005218505859375, 0.01361083984375, -0.003692626...
[ 1250, 4867, 79986, 13695, 30646, 98320, 214, 502, 117776, 19, 525, 19670, 36132, 20787, 27616, 418, 16466, 686, 18770, 304, 21441, 89576, 1108, 53, 26561, 2506, 91375, 11, 34, 3075, 21605, 13333, 88927, 81113, 7456, 4342, 22, 182512, 990, ...
[ 0.16455078125, 0.260986328125, 0.1995849609375, 0.148193359375, 0.2080078125, 0.270263671875, 0.016021728515625, 0.1353759765625, 0.2213134765625, 0.01416015625, 0.09796142578125, 0.037109375, 0.103515625, 0.03662109375, 0.134765625, 0.02655029296875, 0.104736328125, 0.024688720703...
embed
25828549_c0
25828549
prolog
0
Title: Algorithm to detect and remove least number of inconsistent facts (probably in PROLOG)? Problem title: Algorithm to detect and remove least number of inconsistent facts (probably in PROLOG)? Tags: symbolic-computation, prolog, logic, algorithm, algebraic-data-types Problem: Algorithm to detect and remove least n...
Algorithm to detect and remove least number of inconsistent facts (probably in PROLOG)? Algorithm to detect and remove least number of inconsistent facts (probably in PROLOG)? symbolic-computation prolog logic algorithm algebraic-data-types Algorithm PROLOG Algorithm to detect and remove least number of inconsistent fa...
[ 0.031494140625, 0.01361083984375, 0.013916015625, 0.026123046875, -0.004302978515625, 0.01483154296875, -0.00933837890625, -0.01507568359375, 0.000152587890625, 0.004852294921875, 0.0026092529296875, 0.00848388671875, -0.00811767578125, 0.000926971435546875, 0.0245361328125, 0.01226806...
[ 109847, 2783, 18337, 47, 96391, 87388, 19713, 14012, 23, 25553, 6892, 18, 15824, 7, 90837, 10514, 47510, 136, 128201, 7077, 502, 4867, 62775, 234873, 429, 10135, 50986, 11249, 1528, 25632, 133196, 5303, 114700, 1884, 120820, 33636, 77336, 990...
[ 0.1282958984375, 0.131103515625, 0.06536865234375, 0.01220703125, 0.20947265625, 0.17578125, 0.18408203125, 0.1083984375, 0.1358642578125, 0.1988525390625, 0.2454833984375, 0.08782958984375, 0.20263671875, 0.062255859375, 0.035888671875, 0.19384765625, 0.25390625, 0.05596923828125,...
embed
10342224_c0
10342224
prolog
0
Title: Make a prolog BST from a list and return it in the parameter Problem title: Make a prolog BST from a list and return it in the parameter Tags: tree, prolog Problem: Make a prolog BST from a list and return it in the parameter I need to make a prolog predicate from_list/2 so that if i call from_list([], T) I will...
Make a prolog BST from a list and return it in the parameter Make a prolog BST from a list and return it in the parameter tree prolog a Make BST from_list is_search LEFT RIGHT Make a prolog BST from a list and return it in the parameter I need to make a prolog predicate from_list/2 so that if i call from_list([], T) I ...
[ 0.007049560546875, 0.01129150390625, 0.006591796875, -0.0152587890625, -0.004425048828125, 0.022216796875, -0.0203857421875, -0.033447265625, -0.007476806640625, -0.041259765625, 0.0030364990234375, -0.023681640625, 0.00439453125, 0.00537109375, -0.004058837890625, 0.006195068359375, ...
[ 26176, 502, 4867, 335, 8545, 1295, 5303, 30646, 442, 23, 171859, 53201, 6562, 83, 86250, 17428, 25217, 167177, 10, 3871, 3249, 1653, 2063, 67, 12477, 11782, 384, 2046, 4420, 6615, 55769, 4288, 2060, 26366, 154107, 39531, 12989, 4358, 183540...
[ 0.0836181640625, 0.2030029296875, 0.26318359375, 0.06427001953125, 0.203125, 0.18408203125, 0.203125, 0.18212890625, 0.0258941650390625, 0.023406982421875, 0.214111328125, 0.18310546875, 0.1884765625, 0.055145263671875, 0.18896484375, 0.015533447265625, 0.0765380859375, 0.078857421...
embed
29255467_c1
29255467
prolog
1
Additionally, I am also not sure how to define the constraints for a variable length of Ps like the 3 scenario case where T2 #> T1 and T3 #> T4. The pattern that I am seeing is the last element of the next list should be greater than the third element of the list before it but I am stuck on the syntax to represent thi...
Additionally, I am also not sure how to define the constraints for a variable length of Ps like the 3 scenario case where T2 #> T1 and T3 #> T4. The pattern that I am seeing is the last element of the next list should be greater than the third element of the list before it but I am stuck on the syntax to represent thi...
[ -0.007568359375, 0.0211181640625, -0.01043701171875, 0.006134033203125, -0.01531982421875, -0.0002193450927734375, 0.006927490234375, -0.00469970703125, 0.0150146484375, -0.046875, -0.007293701171875, -0.00787353515625, 0.0027313232421875, 0.031494140625, -0.003509521484375, -0.0056152...
[ 959, 9077, 61924, 158, 2816, 4288, 77336, 140909, 436, 7, 138, 106117, 7225, 384, 304, 363, 617, 103510, 86681, 4568, 12830, 11737, 5303, 5608, 117396, 3501, 50960, 8108, 179933, 6002, 86531, 33636, 31577, 4527, 195625, 1830, 5423, 44816, 1...
[ 0.004730224609375, 0.053619384765625, 0.1170654296875, 0.08154296875, 0.1900634765625, 0.1385498046875, 0.2139892578125, 0.17626953125, 0.11328125, 0.125, 0.06292724609375, 0.1861572265625, 0.057861328125, 0.04302978515625, 0.06463623046875, 0.06597900390625, 0.135986328125, 0.1469...
embed
29574571_c0
29574571
prolog
0
Title: Recursive list building in prolog Problem title: Recursive list building in prolog Tags: list, prolog, rule, recursive-datastructures Problem: Recursive list building in prolog I'm trying to write a rule in prolog that requires me to build a list recursively. I'm being able to build that list but the issue is th...
Recursive list building in prolog Recursive list building in prolog list prolog rule recursive-datastructures Recursive ________________________________________________________ N-1 Recursive list building in prolog I'm trying to write a rule in prolog that requires me to build a list recursively. I'm being able to buil...
[ 0.00061798095703125, 0.01348876953125, 0.0113525390625, 0.0128173828125, 0.00054168701171875, 0.020751953125, -0.00921630859375, 0.022216796875, 0.00885009765625, -0.00775146484375, 0.00494384765625, -0.040283203125, 0.00144195556640625, 0.005340576171875, 0.038330078125, -0.0005645751...
[ 853, 48650, 5844, 5303, 33976, 502, 4867, 23, 79986, 195625, 10135, 137656, 541, 5759, 31577, 33022, 144570, 45367, 19048, 31089, 13319, 3714, 7279, 9433, 3871, 2806, 53333, 33342, 1884, 100, 5700, 59121, 21771, 4527, 3249, 6562, 2878, 82940,...
[ 0.08209228515625, 0.2135009765625, 0.1566162109375, 0.2236328125, 0.17822265625, 0.138427734375, 0.2301025390625, 0.03125, 0.17041015625, 0.2071533203125, 0.03326416015625, 0.1402587890625, 0.03204345703125, 0.07330322265625, 0.0181732177734375, 0.08441162109375, 0.045867919921875, ...
embed
34226588_c1
34226588
prolog
1
), maplist(remove_row,RowLengths,RowBlacks), maplist(remove_col,ColLengths,ColBlacks), maplist(row,Puzzle,RowBlacks), transpose(Puzzle,PuzzleT), maplist(row,PuzzleT,ColBlacks). %%%%%%%%%%%%%%%helpers my_nth1(List,Index,El):- nth1(Index,List,El). my_length(Len,List):- length(List,Len). generate_matrix(Cols, Rows, Matrix...
), maplist(remove_row,RowLengths,RowBlacks), maplist(remove_col,ColLengths,ColBlacks), maplist(row,Puzzle,RowBlacks), transpose(Puzzle,PuzzleT), maplist(row,PuzzleT,ColBlacks). %%%%%%%%%%%%%%%helpers my_nth1(List,Index,El):- nth1(Index,List,El). my_length(Len,List):- length(List,Len). generate_matrix(Cols, Rows, Matrix...
[ -0.00445556640625, 0.01513671875, 0.02783203125, 0.023193359375, -0.00064849853515625, 0.002593994140625, 0.0001392364501953125, 0.0069580078125, 0.01361083984375, -0.01177978515625, 0.0020294189453125, 0.0218505859375, 0.0032958984375, 0.0150146484375, -0.020751953125, 0.0064392089843...
[ 6, 247, 22288, 6562, 132, 26973, 272, 15555, 12724, 434, 5267, 449, 927, 97732, 7, 8447, 78457, 27559, 13894, 133, 3900, 78381, 618, 73866, 1314, 759, 418, 154663, 39659, 7623, 653, 23986, 33, 140909, 866, 194, 139392, 192, 87427, 96190, ...
[ 0.0098876953125, 0.13232421875, 0.1707763671875, 0.22607421875, 0.029449462890625, 0.132080078125, 0.1002197265625, 0.1868896484375, 0.07049560546875, 0.056884765625, 0.007659912109375, 0.0777587890625, 0.147705078125, 0.1590576171875, 0.0294342041015625, 0.0906982421875, 0.180175781...
embed
55002786_c0
55002786
prolog
0
Title: Wrong number of arguments in flow pattern Problem title: Wrong number of arguments in flow pattern Tags: visual-prolog, prolog Problem: Wrong number of arguments in flow pattern so i created this simple AI code and i want to add a simple multiply math to my code so its done like this domains bonus = integer pred...
Wrong number of arguments in flow pattern Wrong number of arguments in flow pattern visual-prolog prolog Wrong crew_db absensi_crew posisi_terdaftar terima_gaji tambah_bonus Muhammad Bantaeng November Irvan Jaya TesBebasTernyata Bonus Crew_Yang_Di_Gaji_Bulan_Ini Wrong number of arguments in flow pattern so i created th...
[ -0.016357421875, 0.026123046875, -0.004974365234375, 0.006195068359375, -0.0196533203125, 0.017333984375, -0.0186767578125, 0.01300048828125, 0.00921630859375, 0.00726318359375, 0.0036773681640625, -0.02587890625, 0.01220703125, 0.004425048828125, 0.0286865234375, -0.01531982421875, ...
[ 35133, 14012, 10750, 7, 23, 86608, 103510, 21176, 3454, 4867, 502, 172040, 48073, 162678, 172, 7612, 434, 36673, 86542, 38119, 208, 658, 62087, 84686, 10571, 5458, 102, 13305, 7582, 2187, 49934, 50307, 6766, 5918, 273, 38663, 180282, 163877, ...
[ 0.1806640625, 0.155517578125, 0.28076171875, 0.1190185546875, 0.0789794921875, 0.253173828125, 0.2568359375, 0.1923828125, 0.1072998046875, 0.203369140625, 0.117431640625, 0.2149658203125, 0.127197265625, 0.1328125, 0.051910400390625, 0.1026611328125, 0.035491943359375, 0.143066406...
embed
65129805_c0
65129805
prolog
0
Title: How to find max element in nested list in Prolog? Problem title: How to find max element in nested list in Prolog? Tags: list, flatten, nested-lists, swi-prolog, prolog Problem: How to find max element in nested list in Prolog? I am trying to find the maximum element in multilayered list (meaning list in list in...
How to find max element in nested list in Prolog? How to find max element in nested list in Prolog? list flatten nested-lists swi-prolog prolog How Prolog is_list LL1 maximum_in_multilayered_list ERROR Type _7284 ace_m bp.pl:47 _7328 bp.pl:46 _7366 bp.pl:75 Exception _7596 How to find max element in nested list in Prol...
[ -0.0150146484375, 0.020263671875, 0.0245361328125, 0.004730224609375, 0.005401611328125, 0.040283203125, 0.005126953125, 0.0023651123046875, 0.000835418701171875, -0.02685546875, 0.00830078125, -0.0012664794921875, 0.001953125, -0.01953125, 0.0220947265625, -0.000946044921875, 0.0162...
[ 11249, 7413, 18389, 12830, 23, 8512, 71, 5303, 1250, 4867, 49878, 510, 6562, 2452, 3454, 502, 99954, 418, 38132, 73, 144227, 5259, 151206, 60457, 12825, 13903, 329, 39, 111467, 2424, 33573, 13574, 3882, 32909, 110144, 6873, 63928, 11648, 60...
[ 0.021942138671875, 0.124755859375, 0.2247314453125, 0.2110595703125, 0.041656494140625, 0.2252197265625, 0.11328125, 0.1773681640625, 0.1630859375, 0.227783203125, 0.1480712890625, 0.1112060546875, 0.1409912109375, 0.115478515625, 0.0828857421875, 0.08154296875, 0.0477294921875, 0....
embed
42463113_c0
42463113
prolog
0
Title: Understanding a Prolog list structure of form: [(...), (...), ...] Problem title: Understanding a Prolog list structure of form: [(...), (...), ...] Tags: prolog Problem: Understanding a Prolog list structure of form: [(...), (...), ...] I'm doing homework for Prolog, and I have to design a program that creates ...
Understanding a Prolog list structure of form: [(...), (...), ...] Understanding a Prolog list structure of form: [(...), (...), ...] prolog Understanding Prolog CCL LCL ColorList ColorCheckList Call _G7733 Exit Fail Redo Fails Understanding a Prolog list structure of form: [(...), (...), ...] I'm doing homework for Pr...
[ 0.005615234375, -0.007080078125, -0.0032501220703125, 0.022216796875, -0.00360107421875, -0.0013275146484375, -0.003936767578125, -0.020263671875, 0.013916015625, 0.0019378662109375, 0.00799560546875, -0.010009765625, -0.000606536865234375, 0.0111083984375, -0.01226806640625, -0.002471...
[ 9626, 144057, 1250, 4867, 5303, 45646, 111, 3173, 139666, 15434, 502, 37486, 339, 51193, 154663, 202567, 26265, 14546, 9185, 5443, 217, 190355, 6096, 31, 10, 5368, 18244, 4331, 1528, 28282, 120067, 148, 14821, 1256, 201, 12921, 134855, 143802...
[ 0.11767578125, 0.078857421875, 0.1915283203125, 0.248779296875, 0.232666015625, 0.2467041015625, 0.05462646484375, 0.2008056640625, 0.125732421875, 0.1036376953125, 0.119873046875, 0.1212158203125, 0.013580322265625, 0.1026611328125, 0.130859375, 0.118896484375, 0.1165771484375, 0....
embed
24446350_c0
24446350
prolog
0
Title: Initial guess in labeling Problem title: Initial guess in labeling Tags: clpfd, sicstus-prolog, prolog Problem: Initial guess in labeling Given this small example: go:- length( X, 200 ), domain( X, 1, 25), postConstraints( X, Y ), labeling( [minimize(Y), X ). If we assume that postConstraints set up some complex...
Initial guess in labeling Initial guess in labeling clpfd sicstus-prolog prolog Initial Enum Initial guess in labeling Given this small example: If we assume that postConstraints set up some complex constraints. Y is returned from postConstraints and used as cost-function during labeling. We assume that we have no (or ...
[ 0.0208740234375, -0.007171630859375, 0.0245361328125, 0.005645751953125, -0.001953125, -0.00445556640625, 0.00714111328125, -0.01708984375, 0.0091552734375, -0.032470703125, 0.01263427734375, 0.00909423828125, 0.00007534027099609375, -0.0135498046875, 0.017578125, -0.0035552978515625, ...
[ 360, 1890, 289, 57767, 23, 67967, 214, 39557, 71, 26536, 18253, 3454, 4867, 502, 357, 316, 19336, 27781, 41591, 1305, 11935, 2816, 4288, 5423, 27140, 158, 990, 176377, 11814, 11034, 137175, 110, 20187, 51359, 3714, 24087, 29806, 4127, 1193,...
[ 0.0750732421875, 0.1807861328125, 0.054779052734375, 0.2978515625, 0.02679443359375, 0.2462158203125, 0.1055908203125, 0.0399169921875, 0.006317138671875, 0.0833740234375, 0.2763671875, 0.062255859375, 0.1256103515625, 0.05914306640625, 0.058837890625, 0.147216796875, 0.0390319824218...
embed
57434929_c1
57434929
prolog
1
write('1: Computer Science'), nl, write('2: Information Systems'), nl, write('3: Security Technology'), nl, write('These are the available courses.'), nl. medicine :- verify(science), verify(health), verify(research), verify(helping_people), write('Courses to choose from:'), nl, write('1: Nursing'), nl, write('2: Medi...
write('1: Computer Science'), nl, write('2: Information Systems'), nl, write('3: Security Technology'), nl, write('These are the available courses.'), nl. medicine :- verify(science), verify(health), verify(research), verify(helping_people), write('Courses to choose from:'), nl, write('1: Nursing'), nl, write('2: Medi...
[ 0.00921630859375, 0.0128173828125, 0.00390625, 0.032958984375, -0.00787353515625, 0.004241943359375, -0.0228271484375, 0.00103759765625, 0.00433349609375, -0.0166015625, -0.0059814453125, -0.0079345703125, 0.0123291015625, 0.0185546875, -0.00186920166015625, -0.0067138671875, 0.02709...
[ 33022, 132, 25, 82825, 40139, 28745, 247, 6, 13169, 4, 304, 12, 32007, 84837, 363, 48748, 46473, 3957, 184, 621, 19882, 132073, 5, 54411, 15772, 493, 40383, 175201, 94005, 107, 86250, 73866, 214, 223354, 10625, 12824, 90, 47, 55076, 1295,...
[ 0.2239990234375, 0.051849365234375, 0.06207275390625, 0.1285400390625, 0.169677734375, 0.2152099609375, 0.103515625, 0.0865478515625, 0.19921875, 0.044219970703125, 0.06414794921875, 0.090087890625, 0.1282958984375, 0.1697998046875, 0.135009765625, 0.1363525390625, 0.183837890625, ...
embed
2896701_c0
2896701
prolog
0
Title: Reversible numerical calculations in Prolog Problem title: Reversible numerical calculations in Prolog Tags: factorial, clpfd, prolog Problem: Reversible numerical calculations in Prolog While reading SICP I came across logic programming chapter 4.4. Then I started looking into the Prolog programming language an...
Reversible numerical calculations in Prolog Reversible numerical calculations in Prolog factorial clpfd prolog Reversible Prolog A-1 Reversible numerical calculations in Prolog While reading SICP I came across logic programming chapter 4.4. Then I started looking into the Prolog programming language and tried to unders...
[ -0.004364013671875, 0.00823974609375, 0.0034027099609375, 0.0189208984375, 0.001312255859375, -0.01214599609375, 0.00482177734375, 0.003265380859375, 0.0029449462890625, -0.0302734375, -0.00189208984375, 0.000606536865234375, -0.031982421875, -0.00054168701171875, 0.0264892578125, -0.0...
[ 853, 814, 55356, 54744, 74481, 5256, 1250, 4867, 6827, 31461, 15403, 39557, 71, 502, 62, 5759, 23, 16454, 198993, 36880, 62775, 56037, 102692, 46876, 28219, 8781, 95486, 37202, 63134, 181135, 5570, 37348, 7413, 3871, 65508, 6626, 119591, 7733...
[ 0.10418701171875, 0.2357177734375, 0.191162109375, 0.1961669921875, 0.2171630859375, 0.0421142578125, 0.1766357421875, 0.2481689453125, 0.0831298828125, 0.1839599609375, 0.190185546875, 0.017486572265625, 0.0457763671875, 0.09130859375, 0.1153564453125, 0.1544189453125, 0.02156066894...
embed
51047005_c0
51047005
prolog
0
Title: Iteration over relations using a database Problem title: Iteration over relations using a database Tags: prolog Problem: Iteration over relations using a database I'm new to prolog. Consider the following format: carsCompany(Tel_Number, Manager, Company_Name, [new_cars(Car_Name,info(Color,Creator),Date_Creation)...
Iteration over relations using a database Iteration over relations using a database prolog a Iteration Tel_Number Manager Company_Name new_cars Car_Name Color Creator Date_Creation old_cars update_company Mazda Company Jujiro Matsuda mazda_3 Grey Person1 Cosmo Black Person2 RX-7 get_all Old Lecture _G750 Tutorial _G753...
[ -0.00555419921875, -0.004486083984375, 0.0135498046875, 0.0048828125, -0.0028533935546875, 0.00933837890625, -0.010498046875, 0.01043701171875, 0.022216796875, -0.044921875, 0.00084686279296875, 0.01025390625, -0.023193359375, -0.01202392578125, 0.005584716796875, -0.027587890625, -0...
[ 87, 720, 2320, 645, 91582, 17368, 63399, 502, 4867, 9344, 18444, 26278, 30195, 33734, 163612, 3525, 3284, 3980, 51193, 192008, 25512, 63784, 10332, 28350, 146365, 125691, 3314, 658, 516, 114685, 6874, 17022, 85, 363, 95996, 15270, 170637, 100...
[ 0.08184814453125, 0.253173828125, 0.0928955078125, 0.1875, 0.264892578125, 0.0865478515625, 0.2364501953125, 0.16796875, 0.2347412109375, 0.09881591796875, 0.0482177734375, 0.048828125, 0.1484375, 0.1324462890625, 0.112060546875, 0.03948974609375, 0.141845703125, 0.104736328125, ...
embed
61765571_c0
61765571
prolog
0
Title: Fixed-point functions in prolog? Problem title: Fixed-point functions in prolog? Tags: prolog Problem: Fixed-point functions in prolog? Suppose we have a function y=f(x) , we can represent it is a relation f(X,Y) . For example, we can represent the function, f(x):x/2`, as relation in Prolog: f(X, Y):- Y is div(X...
Fixed-point functions in prolog? Fixed-point functions in prolog? prolog Fixed-point Apply N-1 Equivalent fixed_point2 f:x Fixed-point functions in prolog? Suppose we have a function y=f(x) , we can represent it is a relation f(X,Y) . For example, we can represent the function, f(x):x/2`, as relation in Prolog: We migh...
[ 0.0201416015625, -0.00115203857421875, 0.0146484375, 0.0078125, 0.002899169921875, -0.0020904541015625, 0.0093994140625, 0.00075531005859375, 0.0184326171875, -0.03125, 0.0133056640625, 0.000850677490234375, -0.036376953125, 0.007415771484375, 0.0303955078125, -0.000698089599609375, ...
[ 96746, 297, 9, 38496, 32354, 7, 23, 502, 4867, 5659, 538, 541, 5759, 145666, 85540, 188347, 304, 1238, 12, 425, 121691, 765, 113, 1369, 420, 132, 831, 33636, 41911, 1542, 4, 1723, 12477, 1135, 237, 1250, 26458, 363, 140992, 190659, 47, ...
[ 0.27392578125, 0.1287841796875, 0.003082275390625, 0.222900390625, 0.2269287109375, 0.048187255859375, 0.0860595703125, 0.16064453125, 0.252685546875, 0.1319580078125, 0.0245819091796875, 0.049102783203125, 0.1080322265625, 0.0567626953125, 0.106689453125, 0.247314453125, 0.078186035...
embed
29152309_c0
29152309
prolog
0
Title: Dimensions of micro-benchmarking in Prolog Problem title: Dimensions of micro-benchmarking in Prolog Tags: sicstus-prolog, benchmarking, prolog, microbenchmark Problem: Dimensions of micro-benchmarking in Prolog I want to micro-benchmark predicate int_cntA/2 ... int_cntA(I,W) :- I >= 0, int_cntA0_cntA(I,0,W). in...
Dimensions of micro-benchmarking in Prolog Dimensions of micro-benchmarking in Prolog sicstus-prolog benchmarking prolog microbenchmark Dimensions Prolog int_cntA int_cntA0_cntA I-1 int_cntB int_cntB0_cntB use_module rep_10 rep_100M benchA_1 benchA_2 benchA_3 benchB_1 benchB_2 benchB_3 Dimensions of micro-benchmarking ...
[ 0.005889892578125, -0.031494140625, 0.0036773681640625, 0.033203125, -0.01336669921875, 0.002197265625, 0.0103759765625, -0.01275634765625, -0.000606536865234375, -0.0103759765625, 0.00860595703125, 0.02294921875, -0.01007080078125, 0.007537841796875, 0.0026092529296875, -0.01770019531...
[ 161202, 11948, 776, 206, 10015, 214, 1250, 4867, 26536, 18253, 3454, 240057, 502, 23, 18, 660, 284, 2389, 87, 5759, 571, 4527, 83279, 10958, 963, 3559, 594, 1585, 363, 3444, 1653, 2063, 12477, 26548, 3555, 9077, 3871, 16916, 50339, 49041,...
[ 0.2119140625, 0.1986083984375, 0.1561279296875, 0.152099609375, 0.1788330078125, 0.054107666015625, 0.1455078125, 0.24462890625, 0.05352783203125, 0.1776123046875, 0.07110595703125, 0.2222900390625, 0.11279296875, 0.06207275390625, 0.0677490234375, 0.0931396484375, 0.1363525390625, ...
embed
59201025_c0
59201025
prolog
0
Title: Dealing with uninstantiated values in Prolog Problem title: Dealing with uninstantiated values in Prolog Tags: prolog Problem: Dealing with uninstantiated values in Prolog Hello I'm very very very new to Prolog, I have a predicate here that is taking uninstantiated values of Line and Column. Call: (20) project: ...
Dealing with uninstantiated values in Prolog Dealing with uninstantiated values in Prolog prolog Dealing Prolog Call inside_square _8924 _8926 Dimension List Range Column Line Dealing with uninstantiated values in Prolog Hello I'm very very very new to Prolog, I have a predicate here that is taking uninstantiated value...
[ 0.004058837890625, -0.001983642578125, -0.00004124641418457031, 0.00531005859375, -0.0155029296875, -0.013916015625, 0.015625, 0.004058837890625, -0.006072998046875, -0.016845703125, 0.00433349609375, 0.02392578125, 0.0020751953125, 0.003173828125, 0.000316619873046875, 0.0001430511474...
[ 90943, 678, 51, 143034, 14, 27686, 142424, 1250, 4867, 502, 26265, 46132, 108047, 18949, 2357, 4046, 161202, 32036, 142462, 233987, 16777, 3525, 1653, 2063, 35971, 136, 3714, 37629, 12638, 37457, 111, 12620, 125728, 4527, 86869, 2967, 17368, ...
[ 0.150634765625, 0.126220703125, 0.0941162109375, 0.135498046875, 0.12451171875, 0.0994873046875, 0.1903076171875, 0.1666259765625, 0.246337890625, 0.1016845703125, 0.133544921875, 0.151611328125, 0.2017822265625, 0.119873046875, 0.115966796875, 0.1278076171875, 0.1578369140625, 0.0...
embed
60019047_c0
60019047
prolog
0
Title: Best way to get "confirm this action"-like functionality in prolog? Problem title: Best way to get "confirm this action"-like functionality in prolog? Tags: prolog Problem: Best way to get "confirm this action"-like functionality in prolog? Good evening, I'm currently trying to battle my way ...
Best way to get "confirm this action"-like functionality in prolog? Best way to get "confirm this action"-like functionality in prolog? prolog Best get_user_input Best way to get "confirm this action"-like functionality in prolog? Good evening, I'm currently trying to battle my way through learning ...
[ -0.0120849609375, -0.00139617919921875, 0.0169677734375, -0.00885009765625, -0.004669189453125, 0.0172119140625, 0.0098876953125, -0.005615234375, 0.0164794921875, -0.05859375, 0.0216064453125, 0.00897216796875, -0.052978515625, -0.0108642578125, 0.0206298828125, 0.0146484375, 0.0104...
[ 11345, 3917, 2046, 2271, 38949, 903, 22631, 5062, 123309, 2481, 502, 4867, 23, 65918, 73, 7077, 105216, 133868, 52080, 1250, 4358, 31089, 3871, 116563, 47, 21342, 39563, 100761, 53, 64, 19, 165523, 7413, 12301, 88303, 11583, 1653, 2063, 277...
[ 0.1363525390625, 0.042205810546875, 0.1285400390625, 0.1317138671875, 0.251953125, 0.16552734375, 0.2169189453125, 0.1246337890625, 0.188720703125, 0.052215576171875, 0.1727294921875, 0.231201171875, 0.053466796875, 0.2015380859375, 0.14599609375, 0.0821533203125, 0.00250244140625, ...
embed
36410605_c0
36410605
prolog
0
Title: Using induction to tell if the given symbols make a valid formula in prolog Problem title: Using induction to tell if the given symbols make a valid formula in prolog Tags: induction, prolog Problem: Using induction to tell if the given symbols make a valid formula in prolog We have just started to learn prolog ...
Using induction to tell if the given symbols make a valid formula in prolog Using induction to tell if the given symbols make a valid formula in prolog induction prolog Using Our Using induction to tell if the given symbols make a valid formula in prolog We have just started to learn prolog in my classroom and our firs...
[ 0.01068115234375, -0.005767822265625, 0.000591278076171875, 0.00164031982421875, 0.000293731689453125, -0.00531005859375, -0.01513671875, 0.006988525390625, -0.005645751953125, -0.038818359375, 0.002960205078125, -0.00836181640625, -0.0130615234375, 0.007415771484375, 0.00142669677734375...
[ 345, 23, 77391, 14192, 2174, 34475, 26582, 7, 3249, 35604, 26168, 502, 4867, 10, 22929, 30698, 217212, 5117, 81979, 15649, 41591, 4734, 6626, 34627, 136, 876, 64457, 54241, 5941, 1528, 3900, 19309, 135989, 4935, 80934, 1250, 40322, 289, 505...
[ 0.0450439453125, 0.144775390625, 0.2391357421875, 0.1490478515625, 0.1103515625, 0.0882568359375, 0.2186279296875, 0.051025390625, 0.0970458984375, 0.1829833984375, 0.22119140625, 0.1610107421875, 0.2205810546875, 0.0246429443359375, 0.014678955078125, 0.022216796875, 0.1021728515625...
embed
22961682_c0
22961682
prolog
0
Title: find maximum occurrence in list and find pair in list Problem title: find maximum occurrence in list and find pair in list Tags: prolog, list Problem: find maximum occurrence in list and find pair in list I'm a new in Haskell, but I wrote this solution in Prolog. First one: I have to create function or a few fun...
find maximum occurrence in list and find pair in list find maximum occurrence in list and find pair in list prolog list Seen MMax Max add_if_count_is_one num_pairs find maximum occurrence in list and find pair in list I'm a new in Haskell, but I wrote this solution in Prolog. First one: I have to create function or a f...
[ 0.00897216796875, -0.0037078857421875, 0.00579833984375, 0.00075531005859375, 0.000522613525390625, 0.016357421875, -0.01361083984375, -0.010009765625, 0.010009765625, -0.0257568359375, 0.0028228759765625, 0.00135040283203125, 0.0029296875, -0.0159912109375, 0.0185546875, -0.0137329101...
[ 7413, 38132, 74918, 42, 6620, 23, 5303, 136, 80836, 502, 4867, 503, 33, 276, 71346, 9920, 15190, 3190, 71013, 164, 3630, 13269, 109637, 3525, 20625, 142508, 29806, 1250, 765, 28282, 32354, 10846, 456, 434, 18781, 99156, 66211, 35064, 360, ...
[ 0.1494140625, 0.2685546875, 0.2181396484375, 0.169677734375, 0.102294921875, 0.122314453125, 0.2081298828125, 0.0418701171875, 0.269287109375, 0.1376953125, 0.2017822265625, 0.1715087890625, 0.146728515625, 0.1072998046875, 0.2452392578125, 0.2354736328125, 0.127685546875, 0.093261...
embed
10712367_c0
10712367
prolog
0
Title: error:singleton variable[x] in pro-log.how to solve it? Problem title: error:singleton variable[x] in pro-log.how to solve it? Tags: river-crossing-puzzle, prolog Problem: error:singleton variable[x] in pro-log.how to solve it? it is missionary -cannibal program and found error at line legal(3,x).legal(0,x). % :...
error:singleton variable[x] in pro-log.how to solve it? error:singleton variable[x] in pro-log.how to solve it? river-crossing-puzzle prolog State1 error:singleton pro-log.how Path CurrentState Visited Move RestOfMoves NextState make_move State2 error:singleton variable[x] in pro-log.how to solve it? it is missionary -...
[ 0.006866455078125, 0.001007080078125, 0.0018463134765625, 0.0303955078125, 0.001983642578125, 0.02783203125, -0.0230712890625, -0.00946044921875, 0.0166015625, -0.038330078125, -0.00113677978515625, -0.0213623046875, 0.0118408203125, 0.001220703125, 0.00653076171875, -0.011474609375, ...
[ 18499, 6953, 133, 1507, 77336, 425, 502, 4867, 47251, 86869, 23, 442, 96113, 95665, 214, 1766, 13894, 22836, 418, 108421, 114063, 135206, 98684, 135828, 49756, 132887, 9083, 3132, 4997, 3249, 432, 272, 304, 83, 29752, 6635, 4398, 93, 3571, ...
[ 0.212646484375, 0.13916015625, 0.09765625, 0.2274169921875, 0.246826171875, 0.124755859375, 0.19384765625, 0.197265625, 0.0244140625, 0.1318359375, 0.001007080078125, 0.0274658203125, 0.1478271484375, 0.1500244140625, 0.039276123046875, 0.09307861328125, 0.124755859375, 0.098327636...
embed
64130270_c1
64130270
prolog
1
check(Q, conjunctivitis), check(Q, blotchy_rash_more_than_three_days). influenza :- Q = 'Does the patient have the following symptomp: ', check(Q, fever), check(Q, headache), ( check(Q, coughing); check(Q, runny_nose); check(Q, sore_throat); check(Q, muscle_pain) ). check(_, Symptomp) :- present(Symptomp). check(_, Sy...
check(Q, conjunctivitis), check(Q, blotchy_rash_more_than_three_days). influenza :- Q = 'Does the patient have the following symptomp: ', check(Q, fever), check(Q, headache), ( check(Q, coughing); check(Q, runny_nose); check(Q, sore_throat); check(Q, muscle_pain) ). check(_, Symptomp) :- present(Symptomp). check(_, Sy...
[ 0.015380859375, -0.003387451171875, 0.01251220703125, 0.0286865234375, -0.019287109375, 0.0216064453125, -0.0027618408203125, 0.027099609375, 0.0218505859375, -0.036376953125, 0.0130615234375, 0.02099609375, -0.005096435546875, -0.01116943359375, -0.00799560546875, -0.003631591796875, ...
[ 12765, 2737, 158, 17043, 23835, 44651, 7, 45299, 7668, 41535, 17678, 21732, 107, 5636, 194, 132445, 15772, 2396, 2203, 37896, 765, 25632, 128668, 254, 3820, 814, 10336, 46994, 58968, 11675, 299, 157, 127124, 42294, 123635, 74908, 149450, 1337...
[ 0.291748046875, 0.169921875, 0.02044677734375, 0.0875244140625, 0.0179595947265625, 0.1529541015625, 0.02978515625, 0.125, 0.15576171875, 0.1416015625, 0.0141754150390625, 0.003692626953125, 0.032470703125, 0.0791015625, 0.0231170654296875, 0.287353515625, 0.0501708984375, 0.217041...
embed
4356109_c0
4356109
prolog
0
Title: prolog, knight attack Problem title: prolog, knight attack Tags: combinatorics, arrays, prolog Problem: prolog, knight attack I have one-dimensional array which means chess table. I would like to find all positions which knight could attack. For example, have 3x3 chess table (K is Knight, X is attack position): ...
prolog, knight attack prolog, knight attack combinatorics arrays prolog Table Pos NewTable TempTable1 Pos-N TempTable2 TempTable3 TempTable4 TempTable5 TempTable6 TempTable7 TempTable8 prolog, knight attack I have one-dimensional array which means chess table. I would like to find all positions which knight could attac...
[ -0.00897216796875, -0.0087890625, 0.01458740234375, 0.003204345703125, 0.00634765625, 0.00628662109375, -0.00153350830078125, -0.000701904296875, -0.000274658203125, -0.0032196044921875, 0.00665283203125, 0.00823974609375, -0.01495361328125, -0.008544921875, -0.00811767578125, 0.007263...
[ 502, 4867, 472, 54350, 52875, 22321, 3826, 10298, 4778, 112997, 13498, 2356, 618, 2886, 37446, 839, 617, 1019, 1632, 157955, 53, 26950, 290, 7, 23180, 1884, 7413, 756, 19069, 5809, 138, 425, 363, 605, 83, 114996, 1193, 1528, 765, 3444, ...
[ 0.1591796875, 0.2147216796875, 0.0684814453125, 0.220947265625, 0.2186279296875, 0.095947265625, 0.05340576171875, 0.1458740234375, 0.0171356201171875, 0.185791015625, 0.1580810546875, 0.0200653076171875, 0.08453369140625, 0.1436767578125, 0.0936279296875, 0.000335693359375, 0.072814...
embed
34044737_c0
34044737
prolog
0
Title: Determine if nodes are connected in matrix in Prolog Problem title: Determine if nodes are connected in matrix in Prolog Tags: prolog, transitive-closure Problem: Determine if nodes are connected in matrix in Prolog So what I get is a list that contains coordinates in a matrix. For example: List 1: [[1, 1], [2, ...
Determine if nodes are connected in matrix in Prolog Determine if nodes are connected in matrix in Prolog prolog transitive-closure Determine Prolog List Cell Head Tail Temp Neighbours Merged Determine if nodes are connected in matrix in Prolog So what I get is a list that contains coordinates in a matrix. For example:...
[ -0.00762939453125, 0.0167236328125, 0.022705078125, 0.01068115234375, -0.004791259765625, -0.0157470703125, -0.01055908203125, 0.00396728515625, 0.019287109375, -0.01275634765625, -0.005645751953125, 0.004608154296875, -0.00958251953125, -0.0023040771484375, 0.0006103515625, -0.0085449...
[ 262, 30524, 2174, 110, 988, 162711, 50944, 425, 1250, 4867, 502, 62621, 5844, 170224, 32036, 80743, 44816, 1218, 37446, 6958, 38648, 6035, 23, 2046, 5303, 70541, 176866, 90, 26366, 756, 6097, 47, 12638, 3789, 55076, 61799, 831, 58359, 2499,...
[ 0.046783447265625, 0.1463623046875, 0.080810546875, 0.169189453125, 0.16015625, 0.2139892578125, 0.205322265625, 0.099853515625, 0.15234375, 0.2568359375, 0.10711669921875, 0.06732177734375, 0.002288818359375, 0.124755859375, 0.1575927734375, 0.0888671875, 0.03997802734375, 0.01445...
embed
67244532_c0
67244532
prolog
0
Title: How to limit depths structures in prolog Problem title: How to limit depths structures in prolog Tags: prolog Problem: How to limit depths structures in prolog I trying to write a grammar that generates expresions. If I do not set a depth limit the recursion goes throw the last variable and be infinity. I do not...
How to limit depths structures in prolog How to limit depths structures in prolog prolog How N_1 N-1 Expresion Stack Choice Possible _1404 How to limit depths structures in prolog I trying to write a grammar that generates expresions. If I do not set a depth limit the recursion goes throw the last variable and be infin...
[ 0.01373291015625, 0.0211181640625, -0.001007080078125, 0.00262451171875, 0.0302734375, -0.0089111328125, -0.007354736328125, 0.01141357421875, 0.011474609375, -0.034912109375, 0.015869140625, -0.00860595703125, 0.004150390625, 0.0018463134765625, 0.047607421875, 0.0162353515625, 0.01...
[ 11249, 17475, 168867, 7, 45646, 502, 4867, 23, 115187, 541, 5759, 60075, 107, 6512, 2594, 181948, 115861, 7709, 31577, 33022, 122092, 147, 139392, 48668, 17514, 5423, 195625, 1830, 104250, 4568, 77336, 186, 54241, 3714, 3642, 32845, 59207, 53...
[ 0.02880859375, 0.268798828125, 0.262451171875, 0.0858154296875, 0.21826171875, 0.1534423828125, 0.2239990234375, 0.0306396484375, 0.06365966796875, 0.09368896484375, 0.08349609375, 0.041839599609375, 0.1119384765625, 0.045867919921875, 0.00787353515625, 0.1099853515625, 0.00198364257...
embed
24040898_c0
24040898
prolog
0
Title: How to keep the first result of a function from Prolog? Problem title: How to keep the first result of a function from Prolog? Tags: logic, caching, memoization, prolog Problem: How to keep the first result of a function from Prolog? I need to write a customized function that will be called many times by other f...
How to keep the first result of a function from Prolog? How to keep the first result of a function from Prolog? logic caching memoization prolog Prolog How Input MyResult FirstResult Result cached_all How to keep the first result of a function from Prolog? I need to write a customized function that will be called many ...
[ 0.0220947265625, -0.0016632080078125, 0.0123291015625, -0.005035400390625, -0.01397705078125, -0.01055908203125, 0.02685546875, -0.009521484375, 0.03173828125, -0.06005859375, -0.00787353515625, 0.01904296875, -0.0257568359375, 0.00830078125, 0.03271484375, 0.01165771484375, -0.00015...
[ 11249, 47, 13695, 70, 5117, 16750, 32354, 1295, 1250, 4867, 62775, 377, 59207, 163, 432, 47691, 502, 7077, 2646, 4332, 7, 7136, 23972, 126684, 82365, 71, 5584, 33022, 178036, 35839, 5941, 20028, 188347, 1733, 30646, 3622, 14012, 124519, 114...
[ 0.084228515625, 0.0217437744140625, 0.2333984375, 0.039276123046875, 0.235107421875, 0.270263671875, 0.2109375, 0.1497802734375, 0.181396484375, 0.24755859375, 0.1168212890625, 0.1123046875, 0.1029052734375, 0.0645751953125, 0.1151123046875, 0.069091796875, 0.119873046875, 0.074218...
embed
70631143_c0
70631143
prolog
0
Title: Python: pyswip output returns Atom and Functor Problem title: Python: pyswip output returns Atom and Functor Tags: logic, intersection, prolog, python Problem: Python: pyswip output returns Atom and Functor Based on some older post , I have some prolog program, which specifies propositions. Let's call it "logic....
Python: pyswip output returns Atom and Functor Python: pyswip output returns Atom and Functor logic intersection prolog python pyswip Prolog Python Atom Functor m_Proposition_Binary_x_y m_Proposition m_Proposition_Atom Binary Aim prolog.consult logic.pl prolog.query Python: pyswip output returns Atom and Functor Based ...
[ 0.0322265625, 0.01434326171875, 0.017822265625, 0.01385498046875, -0.019775390625, 0.0023040771484375, 0.004730224609375, -0.0225830078125, -0.0137939453125, -0.002532958984375, 0.00738525390625, 0.01336669921875, -0.0111083984375, -0.0159912109375, 0.00823974609375, -0.00445556640625,...
[ 145581, 57756, 2452, 254, 140992, 30646, 69728, 136, 28670, 18770, 62775, 1940, 7, 58994, 502, 4867, 17198, 50828, 1250, 347, 10752, 40322, 571, 73, 6635, 53, 12078, 54092, 464, 147834, 2424, 1528, 58735, 89261, 137043, 9433, 32354, 35509, ...
[ 0.255615234375, 0.1806640625, 0.24951171875, 0.185791015625, 0.2294921875, 0.19775390625, 0.213134765625, 0.083251953125, 0.1490478515625, 0.1258544921875, 0.119873046875, 0.143798828125, 0.145263671875, 0.1455078125, 0.1243896484375, 0.1788330078125, 0.087890625, 0.1212158203125, ...
embed
3032580_c0
3032580
prolog
0
Title: Four-color theorem in Prolog (using a dynamic predicate) Problem title: Four-color theorem in Prolog (using a dynamic predicate) Tags: prolog, dynamic, dictionary, colors Problem: Four-color theorem in Prolog (using a dynamic predicate) I'm working on coloring a map according to the four-color theorem ( http://e...
Four-color theorem in Prolog (using a dynamic predicate) Four-color theorem in Prolog (using a dynamic predicate) prolog dynamic dictionary colors a Four-color Prolog map_color Four-color theorem in Prolog (using a dynamic predicate) I'm working on coloring a map according to the four-color theorem ( http://en.wikipedi...
[ -0.0030059814453125, -0.004364013671875, 0.007354736328125, 0.01129150390625, -0.021240234375, -0.01708984375, -0.0106201171875, 0.033447265625, 0.005523681640625, -0.023681640625, -0.0184326171875, 0.0201416015625, -0.0098876953125, -0.00180816650390625, 0.024658203125, 0.024169921875...
[ 65056, 46133, 70, 58391, 23, 1250, 4867, 223, 84079, 1653, 2063, 67, 502, 45, 10763, 6635, 104988, 22288, 20697, 10576, 214, 59499, 22759, 27591, 474, 2347, 159, 38969, 10752, 2060, 1528, 33342, 8561, 17705, 27140, 201, 1286, 44457, 7225, ...
[ 0.24462890625, 0.2103271484375, 0.0682373046875, 0.1826171875, 0.0158538818359375, 0.1510009765625, 0.225341796875, 0.02960205078125, 0.2012939453125, 0.13818359375, 0.166015625, 0.03265380859375, 0.1195068359375, 0.03887939453125, 0.0985107421875, 0.0030517578125, 0.1990966796875, ...
embed
60134098_c0
60134098
prolog
0
Title: Prolog predicate where two items are associated but not equivalent Problem title: Prolog predicate where two items are associated but not equivalent Tags: prolog Problem: Prolog predicate where two items are associated but not equivalent I haven't programmed in Prolog for years and am struggling with a simple bl...
Prolog predicate where two items are associated but not equivalent Prolog predicate where two items are associated but not equivalent prolog Prolog north_star shipmates1 Prolog predicate where two items are associated but not equivalent I haven't programmed in Prolog for years and am struggling with a simple block of t...
[ 0.0167236328125, 0.0032958984375, -0.0029296875, 0.01519775390625, -0.03125, 0.00799560546875, -0.008544921875, -0.003082275390625, 0.0201416015625, 0.00066375732421875, 0.014404296875, 0.0167236328125, 0.000621795654296875, -0.0125732421875, -0.000614166259765625, 0.01129150390625, ...
[ 1250, 4867, 1653, 2063, 67, 7440, 6626, 55769, 137272, 1284, 959, 183234, 502, 144477, 5613, 109923, 120126, 418, 38246, 26693, 5369, 237875, 8781, 46389, 3034, 18151, 86869, 62775, 104192, 7477, 136, 91736, 12921, 81887, 163846, 3444, 80836, ...
[ 0.1451416015625, 0.22412109375, 0.1591796875, 0.2120361328125, 0.0113525390625, 0.0228729248046875, 0.159423828125, 0.19873046875, 0.2149658203125, 0.085205078125, 0.153076171875, 0.2149658203125, 0.09661865234375, 0.125, 0.1409912109375, 0.2039794921875, 0.25732421875, 0.081298828...
embed
3299445_c0
3299445
prolog
0
Title: SWI-Prolog: ERROR: is/2: Arguments are not sufficiently instantiated Problem title: SWI-Prolog: ERROR: is/2: Arguments are not sufficiently instantiated Tags: instantiation-error, prolog Problem: SWI-Prolog: ERROR: is/2: Arguments are not sufficiently instantiated I'm trying to create a program that prints how m...
SWI-Prolog: ERROR: is/2: Arguments are not sufficiently instantiated SWI-Prolog: ERROR: is/2: Arguments are not sufficiently instantiated instantiation-error prolog SWI-Prolog ERROR Arguments Count Min Max NewX NCount1 NCount2 Smooths FilPrimes SWI-Prolog: ERROR: is/2: Arguments are not sufficiently instantiated I'm tr...
[ 0.0029296875, 0.00592041015625, 0.023681640625, 0.004486083984375, 0.00799560546875, 0.00836181640625, 0.000762939453125, -0.00933837890625, 0.0341796875, -0.0050048828125, 0.013916015625, -0.0228271484375, 0.0101318359375, 0.01287841796875, 0.025634765625, 0.0020904541015625, 0.0214...
[ 159, 38969, 10752, 4867, 151206, 24638, 83, 12477, 12, 112140, 7, 621, 959, 129980, 538, 34648, 14, 27686, 9, 188800, 502, 108210, 4211, 9920, 2356, 1542, 541, 418, 304, 57549, 29827, 24158, 145111, 31577, 28282, 1528, 28412, 3642, 5941, ...
[ 0.0638427734375, 0.2259521484375, 0.1590576171875, 0.1876220703125, 0.1661376953125, 0.079833984375, 0.189208984375, 0.2900390625, 0.010498046875, 0.28515625, 0.088134765625, 0.07379150390625, 0.1546630859375, 0.2313232421875, 0.078369140625, 0.176513671875, 0.1575927734375, 0.0910...
embed
63871745_c1
63871745
prolog
1
0). :-end_in_neg. :-aleph_read_all. What I want is: publication_nbpages(P,N) :- book2publication(B,P), book_chapters_nbPages(B,N). However, the result I got is: [Rule 1] [Pos cover = 1 Neg cover = 0] book2publication(book0,publication0). [Rule 2] [Pos cover = 1 Neg cover = 0] book(book0). [Rule 3] [Pos cover = 1 Neg co...
0). :-end_in_neg. :-aleph_read_all. What I want is: publication_nbpages(P,N) :- book2publication(B,P), book_chapters_nbPages(B,N). However, the result I got is: [Rule 1] [Pos cover = 1 Neg cover = 0] book2publication(book0,publication0). [Rule 2] [Pos cover = 1 Neg cover = 0] book(book0). [Rule 3] [Pos cover = 1 Neg co...
[ 0.00335693359375, 0.00005221366882324219, 0.01495361328125, 0.031494140625, 0.006072998046875, 0.016845703125, 0.01263427734375, -0.0096435546875, 0.0034027099609375, -0.04248046875, 0.0045166015625, -0.019775390625, -0.002655029296875, -0.006927490234375, 0.0279541015625, 0.0004386901...
[ 757, 15772, 3611, 73, 86, 177, 1935, 11727, 39116, 5584, 3444, 104345, 19, 275, 22469, 7, 683, 839, 12877, 304, 57964, 2320, 571, 124453, 23962, 147101, 33306, 16750, 4163, 26951, 106, 7192, 29256, 799, 14137, 2389, 77495, 116, 138, 5440,...
[ 0.1361083984375, 0.055755615234375, 0.1260986328125, 0.059814453125, 0.11767578125, 0.12890625, 0.0943603515625, 0.2113037109375, 0.1328125, 0.1195068359375, 0.131591796875, 0.2266845703125, 0.0316162109375, 0.0885009765625, 0.214111328125, 0.09552001953125, 0.032501220703125, 0.06...
embed
9336371_c1
9336371
prolog
1
-I/usr/include/freetype2 -fPIC -DHAVE_CONFIG_H x11/xcommon.c -o x11/xcommon.o In file included from /usr/include/X11/extensions/render.h:29:0, from /usr/include/X11/extensions/Xrender.h:33, from /usr/include/X11/Xft/Xft.h:42, from x11/include.h:78, from x11/xcommon.c:28: /usr/include/X11/Xdefs.h:47:13: error: conflict...
-I/usr/include/freetype2 -fPIC -DHAVE_CONFIG_H x11/xcommon.c -o x11/xcommon.o In file included from /usr/include/X11/extensions/render.h:29:0, from /usr/include/X11/extensions/Xrender.h:33, from /usr/include/X11/Xft/Xft.h:42, from x11/include.h:78, from x11/xcommon.c:28: /usr/include/X11/Xdefs.h:47:13: error: conflict...
[ -0.01806640625, -0.00604248046875, -0.0036773681640625, -0.009033203125, 0.01708984375, -0.01806640625, 0.0079345703125, -0.0150146484375, -0.00144195556640625, 0.012451171875, 0.007568359375, 0.01348876953125, 0.019775390625, -0.01031494140625, -0.0250244140625, 0.00384521484375, -0...
[ 568, 223, 42, 217028, 32087, 50986, 304, 126091, 134389, 24878, 77980, 22724, 724, 841, 1022, 1662, 425, 277, 3796, 238, 31, 360, 11435, 99201, 1542, 3355, 128872, 18280, 29223, 53861, 31191, 2480, 33529, 19051, 112, 17447, 22618, 18499, 79...
[ 0.03173828125, 0.0268707275390625, 0.0266265869140625, 0.20849609375, 0.1236572265625, 0.2315673828125, 0.1087646484375, 0.1483154296875, 0.04693603515625, 0.1639404296875, 0.0253753662109375, 0.14404296875, 0.0166015625, 0.0791015625, 0.0380859375, 0.2032470703125, 0.064208984375, ...
embed
40664439_c0
40664439
prolog
0
Title: Error[XSB/Runtime/P]: [Type (library(http / thread_httpd) in place of atom)] Problem title: Error[XSB/Runtime/P]: [Type (library(http / thread_httpd) in place of atom)] Tags: prolog, server, swi-prolog, xsb Problem: Error[XSB/Runtime/P]: [Type (library(http / thread_httpd) in place of atom)] I am trying to host ...
Error[XSB/Runtime/P]: [Type (library(http / thread_httpd) in place of atom)] Error[XSB/Runtime/P]: [Type (library(http / thread_httpd) in place of atom)] prolog server swi-prolog xsb http_server/2 library http_dispatch/1 Error XSB Runtime Type thread_httpd http_server http_dispatch use_module localhost:3050 Port xsb_co...
[ 0.00787353515625, 0.0045166015625, -0.00531005859375, 0.01708984375, -0.0107421875, 0.01806640625, -0.007598876953125, 0.00188446044921875, -0.004913330078125, -0.0615234375, 0.0130615234375, -0.00640869140625, 0.008544921875, -0.0093994140625, 0.017578125, 0.005828857421875, 0.02062...
[ 212059, 1542, 36474, 163321, 6032, 683, 196707, 150, 2844, 5475, 86997, 71, 3687, 34627, 1294, 502, 4867, 10723, 2452, 3454, 1022, 7, 275, 1621, 39642, 12477, 35773, 4453, 11583, 1193, 28398, 60457, 83279, 4000, 40294, 1197, 2525, 13791, 15...
[ 0.178466796875, 0.1220703125, 0.24609375, 0.10302734375, 0.169189453125, 0.09600830078125, 0.1854248046875, 0.056060791015625, 0.123779296875, 0.1700439453125, 0.1563720703125, 0.1219482421875, 0.1165771484375, 0.216552734375, 0.0126953125, 0.0845947265625, 0.1632080078125, 0.14636...
embed
38176822_c0
38176822
prolog
0
Title: Input list not obtained in Prolog Problem title: Input list not obtained in Prolog Tags: prolog Problem: Input list not obtained in Prolog I am using following code: item(a, b, c). item(a, a, c). item(a, d, c). item(a, c, b). getItems([Item|List]):- writeln('Enter:'), read(Item), dif(Item,stop), getItems(InputLi...
Input list not obtained in Prolog Input list not obtained in Prolog prolog Input Prolog Item List Enter InputList Out _G1003 Input list not obtained in Prolog I am using following code: It gives following output: The input method has been taken from: Creating a list from user input with swi-prolog I get following when ...
[ -0.01019287109375, 0.00110626220703125, 0.0126953125, -0.0079345703125, -0.0218505859375, 0.0179443359375, -0.00347900390625, -0.00238037109375, 0.00035858154296875, -0.0262451171875, 0.0234375, 0.03125, 0.0011444091796875, -0.00160980224609375, 0.0179443359375, 0.003936767578125, 0....
[ 360, 7077, 5303, 959, 113054, 297, 1250, 4867, 23, 502, 78426, 32036, 60816, 154663, 13538, 3559, 363, 17368, 25632, 18151, 140992, 107730, 55300, 39958, 1295, 56781, 38937, 2452, 3454, 75101, 11675, 84797, 33306, 276, 84751, 275, 44237, 3444...
[ 0.10888671875, 0.170166015625, 0.2186279296875, 0.11376953125, 0.1722412109375, 0.0556640625, 0.1585693359375, 0.2227783203125, 0.03076171875, 0.1282958984375, 0.1312255859375, 0.1416015625, 0.1065673828125, 0.1329345703125, 0.0946044921875, 0.044097900390625, 0.07342529296875, 0.0...
embed
15481234_c0
15481234
prolog
0
Title: Declarative interpretation of this program that says if an element belongs to a list Problem title: Declarative interpretation of this program that says if an element belongs to a list Tags: declarative, list, prolog Problem: Declarative interpretation of this program that says if an element belongs to a list Fr...
Declarative interpretation of this program that says if an element belongs to a list Declarative interpretation of this program that says if an element belongs to a list declarative list prolog Declarative Declarative interpretation of this program that says if an element belongs to a list From what I have understood t...
[ 0.0018768310546875, 0.00848388671875, 0.006500244140625, 0.011962890625, -0.00836181640625, 0.029296875, 0.01348876953125, 0.0189208984375, -0.00124359130859375, -0.03857421875, 0.02783203125, -0.00055694580078125, -0.00958251953125, 0.0035247802734375, 0.0029144287109375, 0.0045471191...
[ 98501, 4935, 206019, 903, 1528, 17378, 2174, 12830, 186, 10617, 7, 47, 5303, 10, 21635, 502, 4867, 217064, 214709, 117414, 5526, 58359, 29806, 5351, 59158, 27983, 169463, 8781, 1193, 149842, 83, 44816, 111, 10336, 51, 27430, 678, 3714, 4263...
[ 0.22998046875, 0.1741943359375, 0.240966796875, 0.05859375, 0.1864013671875, 0.06085205078125, 0.1173095703125, 0.20654296875, 0.00830078125, 0.2230224609375, 0.000152587890625, 0.1207275390625, 0.2392578125, 0.011199951171875, 0.2403564453125, 0.1533203125, 0.1910400390625, 0.0114...
embed
47585033_c0
47585033
prolog
0
Title: Prolog - Merging 2 lists gives me a list of lists instead of a single list Problem title: Prolog - Merging 2 lists gives me a list of lists instead of a single list Tags: prolog, list, append Problem: Prolog - Merging 2 lists gives me a list of lists instead of a single list I have tried many solutions and this ...
Prolog - Merging 2 lists gives me a list of lists instead of a single list Prolog - Merging 2 lists gives me a list of lists instead of a single list prolog list append Prolog Merging res1 Title Genre res2 Author Editor List Element List1 List2 List3 Prolog - Merging 2 lists gives me a list of lists instead of a single...
[ 0.001708984375, 0.0174560546875, 0.00970458984375, -0.01385498046875, -0.00494384765625, 0.0042724609375, -0.0179443359375, 0.0020904541015625, 0.01806640625, -0.0216064453125, 0.0169677734375, 0.0023345947265625, -0.0042724609375, 0.00433349609375, 0.0079345703125, -0.0019989013671875...
[ 1250, 4867, 6035, 9966, 116, 5303, 76199, 163, 64457, 11001, 502, 114689, 3332, 48962, 15937, 304, 61804, 69340, 32036, 48325, 363, 51347, 20903, 16750, 41206, 3444, 70163, 20949, 43257, 1632, 42564, 71, 18151, 106935, 32964, 81887, 32562, 66...
[ 0.1568603515625, 0.2093505859375, 0.169189453125, 0.10986328125, 0.1890869140625, 0.23046875, 0.0712890625, 0.041229248046875, 0.12353515625, 0.0635986328125, 0.091552734375, 0.1270751953125, 0.0740966796875, 0.040435791015625, 0.0516357421875, 0.08209228515625, 0.0283203125, 0.077...
embed
37690897_c0
37690897
prolog
0
Title: Sort lists from shortest to longest Problem title: Sort lists from shortest to longest Tags: knights-tour, prolog-findall, combinatorics, prolog Problem: Sort lists from shortest to longest I've recently picked up prolog and am trying to make a program to find a solution for the famous puzzle Knight's Tour [foun...
Sort lists from shortest to longest Sort lists from shortest to longest knights-tour prolog-findall combinatorics prolog shortest Sort J-1 J-2 I-1 I-2 possible_knight_moves Rows Columns Visited NewX NewY possible_moves_count Count _NewX _NewY Moves Score Sort lists from shortest to longest I've recently picked up prolo...
[ -0.00299072265625, 0.01544189453125, 0.005126953125, 0.0032958984375, -0.00982666015625, 0.004241943359375, -0.01275634765625, -0.00860595703125, 0.01025390625, -0.0322265625, -0.00958251953125, 0.0086669921875, -0.0186767578125, 0.01263427734375, -0.00518798828125, -0.005950927734375,...
[ 53666, 5303, 1295, 16610, 525, 47, 4989, 472, 54350, 7, 28889, 502, 4867, 111607, 5584, 22321, 3826, 821, 5759, 5428, 7722, 92, 432, 3132, 96190, 233987, 98684, 2356, 1542, 1723, 71013, 108210, 46568, 135828, 168071, 1528, 7413, 29806, 1702...
[ 0.213134765625, 0.216796875, 0.052001953125, 0.1982421875, 0.12548828125, 0.1097412109375, 0.111572265625, 0.0390625, 0.1822509765625, 0.069580078125, 0.2242431640625, 0.12890625, 0.18505859375, 0.04595947265625, 0.0816650390625, 0.09228515625, 0.0482177734375, 0.087890625, 0.081...
embed
61091211_c1
61091211
prolog
1
disj(Len)) :- nonvar(X),is_disjunction(X,Len). typeof((_A->_B) , impl). typeof(:-_A , directive). typeof(_H:-_B , clause). is_conjunction((_,B),Len) :- is_conjunction(B,Lb),!,Len is Lb+1. is_conjunction((_,_),1). is_disjunction((_;B),Len) :- is_disjunction(B,Lb),!,Len is Lb+1. is_disjunction((_;_),1). % % TEST CODE % ...
disj(Len)) :- nonvar(X),is_disjunction(X,Len). typeof((_A->_B) , impl). typeof(:-_A , directive). typeof(_H:-_B , clause). is_conjunction((_,B),Len) :- is_conjunction(B,Lb),!,Len is Lb+1. is_conjunction((_,_),1). is_disjunction((_;B),Len) :- is_disjunction(B,Lb),!,Len is Lb+1. is_disjunction((_;_),1). % % TEST CODE % ...
[ 0.0106201171875, 0.00323486328125, 0.0140380859375, 0.03271484375, -0.00994873046875, 0.0172119140625, -0.0262451171875, 0.0068359375, 0.0250244140625, 0.004913330078125, 0.0078125, 0.000614166259765625, 0.008056640625, -0.0250244140625, 0.00518798828125, 0.024169921875, 0.0106201171...
[ 2837, 170, 132, 866, 33, 16, 15772, 351, 1961, 1542, 247, 164, 3827, 17043, 10763, 10644, 4390, 284, 103607, 571, 116120, 8951, 5844, 841, 70731, 194, 83, 2271, 275, 38, 339, 21748, 17727, 5, 384, 21828, 8244, 1745, 9842, 6954, 50986, ...
[ 0.2076416015625, 0.319091796875, 0.017578125, 0.15771484375, 0.236083984375, 0.03582763671875, 0.140869140625, 0.1278076171875, 0.2198486328125, 0.09869384765625, 0.0200653076171875, 0.1290283203125, 0.1202392578125, 0.215576171875, 0.0931396484375, 0.1807861328125, 0.2186279296875, ...
embed
60535733_c1
60535733
prolog
1
't seem to do it. The code is below. marital_status(joe,married). income(joe,60000). mortgage(joe,20000). age(joe,45). main(X,Z):-var(X), write('what is your name?'),read(X), invest(X,Z),!. main(X,Z):-invest(X,Z),!. ask_marital_status(X,Y):-marital_status(X,Y). ask_marital_status(X,Y):-not(marital_status(X,Y)), write('...
't seem to do it. The code is below. marital_status(joe,married). income(joe,60000). mortgage(joe,20000). age(joe,45). main(X,Z):-var(X), write('what is your name?'),read(X), invest(X,Z),!. main(X,Z):-invest(X,Z),!. ask_marital_status(X,Y):-marital_status(X,Y). ask_marital_status(X,Y):-not(marital_status(X,Y)), write('...
[ 0.0181884765625, 0.00335693359375, 0.01190185546875, 0.0208740234375, -0.0115966796875, 0.034423828125, -0.0201416015625, -0.000934600830078125, 0.0032501220703125, -0.006591796875, 0.0098876953125, -0.009765625, 0.002685546875, 0.004241943359375, 0.022705078125, 0.0179443359375, 0.0...
[ 242, 18, 48903, 47, 54, 442, 5, 581, 18151, 83, 35064, 5786, 1803, 45215, 513, 13, 1727, 46572, 194, 91763, 910, 28568, 238336, 13821, 77495, 32070, 129507, 5201, 1542, 1511, 1961, 33022, 132, 25, 124409, 935, 9351, 39116, 14145, 38, 42...
[ 0.07159423828125, 0.1866455078125, 0.197265625, 0.1396484375, 0.2122802734375, 0.21923828125, 0.0853271484375, 0.0789794921875, 0.265869140625, 0.1346435546875, 0.130126953125, 0.205810546875, 0.2291259765625, 0.2291259765625, 0.174560546875, 0.1251220703125, 0.13916015625, 0.20141...
embed
43836735_c0
43836735
prolog
0
Title: Getting hold of a variable in complex compound term in Prolog Problem title: Getting hold of a variable in complex compound term in Prolog Tags: prolog Problem: Getting hold of a variable in complex compound term in Prolog I have a Prolog sentence parser that returns a sentence (passed into it as a list) split i...
Getting hold of a variable in complex compound term in Prolog Getting hold of a variable in complex compound term in Prolog prolog Getting Prolog Noun_Phrase Verb_Phrase Sentence Remainder Head Tail next_predicate np2 Getting hold of a variable in complex compound term in Prolog I have a Prolog sentence parser that ret...
[ 0.01904296875, 0.0167236328125, 0.001495361328125, 0.0224609375, 0.01031494140625, 0.0142822265625, 0.00165557861328125, 0.00946044921875, 0.0169677734375, -0.04052734375, 0.03173828125, 0.0120849609375, -0.01275634765625, 0.0068359375, -0.0076904296875, 0.010986328125, -0.0179443359...
[ 210732, 16401, 111, 77336, 27140, 217773, 13579, 1250, 4867, 502, 309, 45689, 78728, 1446, 275, 63999, 853, 24931, 820, 44816, 1218, 379, 11737, 19714, 2063, 25037, 304, 149357, 366, 2189, 30646, 5303, 65450, 3934, 6626, 63920, 438, 27781, ...
[ 0.0675048828125, 0.21923828125, 0.12548828125, 0.263427734375, 0.2012939453125, 0.204345703125, 0.1566162109375, 0.1524658203125, 0.2315673828125, 0.0972900390625, 0.0703125, 0.0762939453125, 0.124267578125, 0.164794921875, 0.1134033203125, 0.05780029296875, 0.019012451171875, 0.12...
embed
64909390_c1
64909390
prolog
1
enter 0 for the grade"),nl,nl. interest_instructions:- nl, write("Great, now you will answer a few more questions concerning yourself."),nl, write("Kindly respond with numbers from 0 to 4:"),nl,nl, write("0 - None"),nl, write("1 - Low"),nl, write("2 - Medium"),nl, write("3 - High"),nl, write("4 - Very high"),nl,nl. %D...
enter 0 for the grade"),nl,nl. interest_instructions:- nl, write("Great, now you will answer a few more questions concerning yourself."),nl, write("Kindly respond with numbers from 0 to 4:"),nl,nl, write("0 - None"),nl, write("1 - Low"),nl, write("2 - Medium"),nl, write("3 - High"),nl, write("4 - Very high"),nl,nl. %D...
[ -0.00372314453125, -0.0007476806640625, -0.0032806396484375, 0.016845703125, -0.0028533935546875, 0.00323486328125, -0.015380859375, -0.01446533203125, -0.004150390625, -0.00811767578125, 0.001312255859375, -0.00390625, -0.00958251953125, 0.0030364990234375, 0.0035400390625, 0.00221252...
[ 30957, 757, 100, 70, 44000, 74054, 13169, 5, 33946, 454, 188336, 7, 12, 33022, 91127, 257, 5036, 1221, 35166, 10846, 1286, 17582, 50509, 31949, 7250, 35644, 678, 101935, 1295, 47, 27959, 2389, 438, 86, 418, 61187, 174413, 363, 20, 19694, ...
[ 0.2083740234375, 0.21044921875, 0.1163330078125, 0.05401611328125, 0.255615234375, 0.04925537109375, 0.114501953125, 0.010955810546875, 0.254638671875, 0.0347900390625, 0.26708984375, 0.0972900390625, 0.04766845703125, 0.1781005859375, 0.041229248046875, 0.1025390625, 0.0675048828125...
embed
73529322_c0
73529322
prolog
0
Title: Prolog Maze Pathfinding Problem title: Prolog Maze Pathfinding Tags: maze, path-finding, prolog Problem: Prolog Maze Pathfinding Hey guys so I'm having a bit of an issue with writing a pathfinding functor to go from one square to the other. I can't figure out how to tell if a square has a neighbouring square. Th...
Prolog Maze Pathfinding Prolog Maze Pathfinding maze path-finding prolog Prolog Maze Pathfinding Route Prolog Maze Pathfinding Hey guys so I'm having a bit of an issue with writing a pathfinding functor to go from one square to the other. I can't figure out how to tell if a square has a neighbouring square. The maze is...
[ 0.0286865234375, 0.005645751953125, 0.01080322265625, -0.004486083984375, 0.00933837890625, 0.00579833984375, -0.00537109375, 0.00994873046875, 0.0113525390625, -0.03369140625, 0.0123291015625, 0.0191650390625, -0.021728515625, -0.005218505859375, 0.015380859375, 0.0030059814453125, ...
[ 1250, 4867, 29678, 13, 108421, 111607, 214, 291, 731, 60875, 502, 106015, 51484, 19441, 4785, 111, 31089, 32562, 7477, 18770, 738, 1295, 1632, 108047, 47, 3789, 831, 26366, 3642, 14192, 2174, 1556, 108, 6958, 38648, 83, 190, 425, 758, 120...
[ 0.159423828125, 0.22802734375, 0.175537109375, 0.10791015625, 0.1483154296875, 0.183837890625, 0.052703857421875, 0.149658203125, 0.1944580078125, 0.176513671875, 0.1285400390625, 0.2235107421875, 0.046417236328125, 0.015533447265625, 0.03558349609375, 0.0352783203125, 0.078979492187...
embed
40978674_c1
40978674
prolog
1
"),positive( has, hair). it_is(mammal):-write("\nit_is(mammal)1\n"),positive( does, give_milk). it_is(bird):-positive( has, feathers). it_is(bird):-positive( does, fly),positive(does, lay_eggs). it_is(carnivore):-positive(does, eat_meat). it_is(carnivore):-positive(has, pointed_teeth),positive(has, claws),positive(has,...
"),positive( has, hair). it_is(mammal):-write("\nit_is(mammal)1\n"),positive( does, give_milk). it_is(bird):-positive( has, feathers). it_is(bird):-positive( does, fly),positive(does, lay_eggs). it_is(carnivore):-positive(does, eat_meat). it_is(carnivore):-positive(has, pointed_teeth),positive(has, claws),positive(has,...
[ -0.00848388671875, 0.00775146484375, 0.0050048828125, 0.02685546875, -0.0089111328125, 0.021484375, 0.006805419921875, 0.00787353515625, 0.004852294921875, -0.0267333984375, 0.0164794921875, -0.0015869140625, -0.000904083251953125, -0.0157470703125, 0.0244140625, 0.0015716552734375, ...
[ 44, 247, 67890, 4935, 132, 1556, 4, 24887, 194, 442, 454, 164, 19066, 2749, 2077, 434, 18781, 6773, 418, 19, 74054, 14602, 8337, 12397, 92, 91157, 3820, 10519, 1314, 12403, 21, 2507, 9405, 3284, 93, 104297, 73203, 282, 10557, 6275, 67, ...
[ 0.0855712890625, 0.1146240234375, 0.263916015625, 0.228271484375, 0.0628662109375, 0.27392578125, 0.047760009765625, 0.32666015625, 0.1080322265625, 0.217041015625, 0.000640869140625, 0.216796875, 0.1383056640625, 0.1865234375, 0.027679443359375, 0.11962890625, 0.1890869140625, 0.1...
embed
47245282_c0
47245282
prolog
0
Title: Prolog example for forward and backward chaining Problem title: Prolog example for forward and backward chaining Tags: prolog Problem: Prolog example for forward and backward chaining As per the rule of inst., any security person who allows any outsider to enter the campus without any valid ID-proof will be susp...
Prolog example for forward and backward chaining Prolog example for forward and backward chaining prolog Prolog Implement Using Compare Call Exit _G1937 _G1938 Prolog example for forward and backward chaining As per the rule of inst., any security person who allows any outsider to enter the campus without any valid ID-...
[ 0.0361328125, 0.02392578125, 0.0120849609375, 0.025390625, -0.0177001953125, 0.016845703125, 0.00628662109375, 0.0157470703125, 0.0035858154296875, -0.040283203125, 0.0152587890625, 0.0002155303955078125, -0.00075531005859375, 0.01611328125, 0.006927490234375, -0.0037841796875, 0.005...
[ 1250, 4867, 27781, 40225, 136, 4420, 19364, 1608, 14653, 502, 153941, 113307, 13, 26265, 5443, 217, 190891, 179937, 79986, 23, 271, 2499, 48031, 3445, 2750, 114864, 50782, 42, 47, 30957, 78132, 15490, 35604, 11338, 98869, 1221, 45890, 4295, ...
[ 0.1766357421875, 0.2470703125, 0.221923828125, 0.182373046875, 0.102294921875, 0.1549072265625, 0.167236328125, 0.180419921875, 0.1552734375, 0.1417236328125, 0.1463623046875, 0.171142578125, 0.03857421875, 0.1444091796875, 0.111083984375, 0.0289459228515625, 0.1693115234375, 0.138...
embed
44218072_c0
44218072
prolog
0
Title: Prolog Extended Euclidian Algorithm Problem title: Prolog Extended Euclidian Algorithm Tags: prolog Problem: Prolog Extended Euclidian Algorithm I have been struggling with some prolog code for several days and I couldn't find a way out of it. I am trying to write the extended Euclidean algorithm and find values...
Prolog Extended Euclidian Algorithm Prolog Extended Euclidian Algorithm prolog Prolog Extended Euclidian Algorithm si_finder ti_finder Prolog Extended Euclidian Algorithm I have been struggling with some prolog code for several days and I couldn't find a way out of it. I am trying to write the extended Euclidean algori...
[ 0.01043701171875, 0.0240478515625, 0.01220703125, -0.0203857421875, -0.01153564453125, -0.0029144287109375, -0.01031494140625, -0.00732421875, 0.0029296875, -0.045166015625, 0.02978515625, 0.002532958984375, -0.0068359375, -0.0137939453125, 0.00164794921875, -0.001953125, 0.021606445...
[ 1250, 4867, 5443, 35548, 5177, 238, 150, 27201, 109847, 2783, 18337, 502, 78, 168719, 1053, 237875, 18151, 40368, 69427, 7413, 1810, 31577, 33022, 65042, 34937, 130265, 234873, 142424, 915, 136, 91, 23, 28, 5490, 37842, 10176, 33938, 14037, ...
[ 0.20361328125, 0.28662109375, 0.0869140625, 0.1806640625, 0.121337890625, 0.058319091796875, 0.134033203125, 0.1689453125, 0.1429443359375, 0.1248779296875, 0.0224456787109375, 0.18017578125, 0.157958984375, 0.244140625, 0.1727294921875, 0.1053466796875, 0.1356201171875, 0.01266479...
embed
53660041_c0
53660041
prolog
0
Title: A solution for a variation of N-Queen problem for N &lt; 4 in Prolog? Problem title: A solution for a variation of N-Queen problem for N &lt; 4 in Prolog? Tags: n-queens, prolog Problem: A solution for a variation of N-Queen problem for N < 4 in Prolog? I need to resolve a variation of N-Queens as noted in Wolfr...
A solution for a variation of N-Queen problem for N &lt; 4 in Prolog? A solution for a variation of N-Queen problem for N &lt; 4 in Prolog? n-queens prolog N-Queen Prolog Result List Comb N-1 A solution for a variation of N-Queen problem for N < 4 in Prolog? I need to resolve a variation of N-Queens as noted in Wolfram...
[ -0.0115966796875, -0.0033416748046875, 0.031982421875, 0.0052490234375, 0.004119873046875, -0.00185394287109375, -0.0118408203125, 0.00762939453125, 0.00994873046875, -0.00135040283203125, -0.01177978515625, 0.006500244140625, -0.00531005859375, 0.0076904296875, -0.006500244140625, -0....
[ 29806, 143834, 541, 41732, 33, 2967, 1277, 201, 1250, 4867, 100, 9, 23, 653, 944, 1755, 502, 126684, 32036, 3288, 275, 5759, 4426, 103608, 45492, 2198, 38132, 14012, 41, 55257, 76067, 120262, 4358, 29479, 16093, 617, 7722, 180346, 304, 23...
[ 0.1444091796875, 0.25390625, 0.1710205078125, 0.222412109375, 0.1829833984375, 0.1895751953125, 0.050506591796875, 0.1956787109375, 0.144287109375, 0.2056884765625, 0.0188446044921875, 0.0203399658203125, 0.03985595703125, 0.08746337890625, 0.1773681640625, 0.18359375, 0.096313476562...
embed
42358271_c0
42358271
prolog
0
Title: Prolog Family Tree, cousins issues Problem title: Prolog Family Tree, cousins issues Tags: prolog Problem: Prolog Family Tree, cousins issues I am trying to list all the cousins of a particular person in my prolog program but can't seem to get it to work. I've checked my code and it seems correct but I am not ge...
Prolog Family Tree, cousins issues Prolog Family Tree, cousins issues prolog Prolog Family Tree grandpa1 grandpa2 grandma1 grandma2 Prolog Family Tree, cousins issues I am trying to list all the cousins of a particular person in my prolog program but can't seem to get it to work. I've checked my code and it seems corre...
[ 0.0284423828125, 0.0101318359375, 0.0001983642578125, 0.0179443359375, -0.016357421875, 0.01080322265625, -0.02099609375, 0.0191650390625, -0.001556396484375, -0.0341796875, 0.0045166015625, -0.034423828125, -0.01416015625, 0.004608154296875, 0.01007080078125, -0.005157470703125, 0.0...
[ 1250, 4867, 59745, 101344, 193429, 7, 37348, 502, 9963, 763, 418, 304, 192, 31577, 47, 5303, 756, 70, 17311, 3445, 1528, 831, 18, 48903, 4488, 18151, 26785, 959, 20949, 140992, 3444, 41, 1294, 1542, 1221, 11065, 30646, 116, 4734, 98320, ...
[ 0.135498046875, 0.21728515625, 0.0869140625, 0.2152099609375, 0.2373046875, 0.14208984375, 0.1571044921875, 0.1109619140625, 0.1025390625, 0.10174560546875, 0.0318603515625, 0.10302734375, 0.106689453125, 0.0496826171875, 0.01361083984375, 0.1529541015625, 0.101318359375, 0.0221862...
embed
42973822_c0
42973822
prolog
0
Title: Prolog - sort results but return one by one Problem title: Prolog - sort results but return one by one Tags: sorting, prolog Problem: Prolog - sort results but return one by one How to sort results in prolog by the last element in list, but still return them one by one, when pressing ; , not just a list with all...
Prolog - sort results but return one by one Prolog - sort results but return one by one sorting prolog Prolog route_with_total_dist Prolog - sort results but return one by one How to sort results in prolog by the last element in list, but still return them one by one, when pressing ; , not just a list with all of them....
[ 0.0201416015625, -0.01068115234375, 0.0034637451171875, -0.0033416748046875, -0.006256103515625, -0.004119873046875, 0.00885009765625, -0.020263671875, 0.02294921875, -0.04736328125, 0.012451171875, 0.013427734375, -0.007354736328125, -0.00762939453125, 0.0159912109375, 0.005126953125,...
[ 1250, 4867, 12096, 50339, 1284, 30646, 1632, 390, 502, 36439, 76228, 188, 1803, 46295, 47, 23, 4568, 12830, 5303, 7464, 24234, 1653, 2063, 18113, 81814, 17721, 6275, 25550, 48225, 3622, 62488, 1884, 186500, 525, 5117, 31358, 35829, 176377, ...
[ 0.18359375, 0.26123046875, 0.268310546875, 0.2509765625, 0.081298828125, 0.2218017578125, 0.1287841796875, 0.127197265625, 0.1756591796875, 0.1883544921875, 0.0631103515625, 0.0567626953125, 0.1092529296875, 0.1561279296875, 0.00238037109375, 0.049285888671875, 0.1939697265625, 0.1...
embed
29403291_c0
29403291
prolog
0
Title: Please explain this Turing Machine simulator written in Prolog Problem title: Please explain this Turing Machine simulator written in Prolog Tags: turing-machines, prolog Problem: Please explain this Turing Machine simulator written in Prolog The Wikipedia Prolog article includes this Turing Machine simulator: t...
Please explain this Turing Machine simulator written in Prolog Please explain this Turing Machine simulator written in Prolog turing-machines prolog Please Turing Machine Prolog Tape0 Tape Ls1 Ls0 Rs0 Sym RsRest NewSym Action Rs1 Please explain this Turing Machine simulator written in Prolog The Wikipedia Prolog articl...
[ 0.0302734375, 0.0005035400390625, 0.0186767578125, 0.013671875, -0.001251220703125, -0.000347137451171875, -0.0024261474609375, 0.004150390625, 0.008056640625, -0.0283203125, 0.0101318359375, 0.040283203125, -0.01318359375, -0.002655029296875, 0.0035400390625, 0.0031585693359375, 0.0...
[ 30607, 73342, 903, 4252, 214, 68311, 40226, 1290, 59121, 23, 1250, 4867, 109561, 103149, 502, 50266, 13, 2389, 418, 115034, 4843, 39, 525, 2356, 294, 4650, 57945, 8162, 5582, 96853, 121413, 1528, 2161, 16454, 25813, 10336, 7108, 44237, 3302...
[ 0.0941162109375, 0.2105712890625, 0.0926513671875, 0.196044921875, 0.14453125, 0.1650390625, 0.2408447265625, 0.15234375, 0.0679931640625, 0.037811279296875, 0.15185546875, 0.25537109375, 0.255859375, 0.099853515625, 0.10009765625, 0.150390625, 0.016143798828125, 0.1553955078125, ...
embed
35990953_c0
35990953
prolog
0
Title: Viewpoints Sudoku Problem title: Viewpoints Sudoku Tags: sudoku, prolog, constraint-programming Problem: Viewpoints Sudoku I'm looking for alternative viewpoints to solve sudoku problems using constraint programming. The classical viewpoint is to use a finite domain (row, column) variables who can take values fr...
Viewpoints Sudoku Viewpoints Sudoku sudoku prolog constraint-programming Viewpoints Sudoku Viewpoints Sudoku I'm looking for alternative viewpoints to solve sudoku problems using constraint programming. The classical viewpoint is to use a finite domain (row, column) variables who can take values from 1 to 9. This is a ...
[ 0.013671875, -0.00121307373046875, 0.01251220703125, -0.00160980224609375, -0.010498046875, -0.007110595703125, -0.030029296875, 0.00140380859375, 0.002105712890625, -0.0322265625, -0.01904296875, -0.020263671875, -0.01287841796875, 0.0023651123046875, -0.0361328125, 0.019775390625, ...
[ 29805, 38496, 15334, 38067, 8932, 502, 4867, 158, 2816, 4288, 28966, 16487, 30700, 21455, 86869, 44402, 17368, 56037, 449, 54704, 289, 83, 4527, 94418, 77758, 15555, 3365, 316, 77336, 2750, 831, 5646, 142424, 1295, 106, 47, 3569, 4127, 2346...
[ 0.2091064453125, 0.27783203125, 0.1353759765625, 0.207275390625, 0.13916015625, 0.0826416015625, 0.1324462890625, 0.1019287109375, 0.200439453125, 0.1444091796875, 0.1380615234375, 0.0499267578125, 0.1365966796875, 0.2330322265625, 0.133056640625, 0.1334228515625, 0.0811767578125, ...
embed
26147360_c0
26147360
prolog
0
Title: Prolog - Finding object with shortest inner List in a List Problem title: Prolog - Finding object with shortest inner List in a List Tags: binding, list, variables, recursion, prolog Problem: Prolog - Finding object with shortest inner List in a List I have a large list BIGLIST that consists solely of any number...
Prolog - Finding object with shortest inner List in a List Prolog - Finding object with shortest inner List in a List binding list variables recursion prolog Prolog Finding List BIGLIST SMALLLIST INNERLIST Shortest Num get_shortest Tail ShortLen nth0 Len NShortest NShortLen Prolog - Finding object with shortest inner L...
[ -0.00555419921875, 0.021728515625, 0.0009765625, -0.00018405914306640625, -0.01025390625, 0.006134033203125, 0.010498046875, -0.00677490234375, 0.0169677734375, -0.00058746337890625, -0.00897216796875, -0.0093994140625, -0.0228271484375, -0.01263427734375, 0.006866455078125, 0.02880859...
[ 1250, 4867, 26040, 214, 36746, 678, 16610, 525, 75414, 32036, 23, 128239, 5303, 77336, 195625, 502, 140836, 195977, 22972, 66437, 5881, 52952, 82990, 52782, 2046, 186500, 1218, 379, 866, 33, 927, 2389, 18226, 5922, 6954, 18, 21334, 58055, 1...
[ 0.15087890625, 0.2476806640625, 0.123291015625, 0.055755615234375, 0.2003173828125, 0.0721435546875, 0.2310791015625, 0.190673828125, 0.2357177734375, 0.18115234375, 0.060150146484375, 0.1507568359375, 0.1824951171875, 0.1898193359375, 0.1251220703125, 0.1099853515625, 0.071960449218...
embed
22977446_c0
22977446
prolog
0
Title: Findall with lists for Pacman netlogo game Problem title: Findall with lists for Pacman netlogo game Tags: pacman, prolog-findall, prolog Problem: Findall with lists for Pacman netlogo game I'm a beginner at prolog and I'm trying to make pacman move by itself using netlogo and prolog. So this is part of my code:...
Findall with lists for Pacman netlogo game Findall with lists for Pacman netlogo game pacman prolog-findall prolog Findall Pacman DirP Lab Ghost Pellet Decision Dir Findall with lists for Pacman netlogo game I'm a beginner at prolog and I'm trying to make pacman move by itself using netlogo and prolog. So this is part ...
[ 0.0157470703125, 0.00171661376953125, 0.0012359619140625, 0.0286865234375, -0.01165771484375, 0.01220703125, 0.0059814453125, 0.00860595703125, -0.0089111328125, -0.03564453125, 0.01470947265625, -0.0003204345703125, 0.0167236328125, -0.00445556640625, -0.002593994140625, -0.0092773437...
[ 26040, 5584, 678, 5303, 7, 100, 49085, 669, 2043, 26989, 6712, 38595, 502, 4867, 111607, 19946, 683, 21488, 130966, 19460, 1974, 49132, 6889, 9842, 25, 39, 47, 25813, 390, 68034, 17368, 136, 2831, 18151, 35691, 20549, 4, 454, 2263, 481, ...
[ 0.2122802734375, 0.270751953125, 0.0709228515625, 0.2281494140625, 0.007049560546875, 0.007110595703125, 0.1907958984375, 0.1761474609375, 0.105712890625, 0.2242431640625, 0.07379150390625, 0.154296875, 0.138427734375, 0.1810302734375, 0.09161376953125, 0.1024169921875, 0.15173339843...
embed
28226568_c0
28226568
prolog
0
Title: Finding all solutions in prolog Problem title: Finding all solutions in prolog Tags: prolog, prolog-findall Problem: Finding all solutions in prolog In prolog I'm trying to unify every valid pairing of needs with resources needs([ece2090,1,m,13,16]). needs([ece3520,1,tu,11,14]). needs([ece4420,1,w,13,16]). resou...
Finding all solutions in prolog Finding all solutions in prolog prolog prolog-findall Finding ece2090 ece3520 ece4420 ece2010 make_bid Sect Day Name Cap Unavail no_conflict_all_unavailable course_capable Listing Bag _G4310 Finding all solutions in prolog In prolog I'm trying to unify every valid pairing of needs with r...
[ 0.0034637451171875, 0.0093994140625, -0.003753662109375, 0.00119781494140625, 0.0017852783203125, 0.018798828125, -0.024169921875, -0.01177978515625, 0.01312255859375, -0.031982421875, 0.005859375, -0.01361083984375, -0.006988525390625, -0.0074462890625, 0.0005950927734375, 0.000808715...
[ 26040, 756, 51347, 502, 4867, 111607, 5584, 329, 5039, 5843, 1549, 12465, 11436, 3249, 34833, 72199, 10013, 15757, 14304, 4228, 330, 134225, 2886, 15411, 15644, 32036, 19413, 11548, 963, 23, 31577, 51, 40383, 11907, 35604, 80836, 27117, 65514...
[ 0.1080322265625, 0.1563720703125, 0.22509765625, 0.150634765625, 0.232666015625, 0.1041259765625, 0.1973876953125, 0.0246124267578125, 0.1802978515625, 0.07421875, 0.08953857421875, 0.06402587890625, 0.1214599609375, 0.002044677734375, 0.148681640625, 0.0276641845703125, 0.0462341308...
embed
36368508_c0
36368508
prolog
0
Title: Creating a table of square roots of a given list in Prolog Problem title: Creating a table of square roots of a given list in Prolog Tags: prolog, list Problem: Creating a table of square roots of a given list in Prolog I am a newbie to Prolog and trying to develop a simple code to get the following output. ?-sq...
Creating a table of square roots of a given list in Prolog Creating a table of square roots of a given list in Prolog prolog list Creating Prolog sqrt_table Result full_list Out get_sqrt Rest Creates Low High NewLow Calculates Input Squareroot Sqrt SqrtRest SqrtOf_H Creating a table of square roots of a given list in P...
[ -0.006378173828125, 0.012939453125, -0.003662109375, -0.007171630859375, -0.000125885009765625, -0.0027618408203125, 0.0135498046875, -0.002044677734375, 0.00072479248046875, 0.01214599609375, 0.01806640625, 0.01214599609375, -0.01300048828125, -0.00836181640625, -0.015380859375, 0.000...
[ 56781, 23180, 111, 108047, 74855, 34475, 5303, 1250, 4867, 502, 864, 3198, 22819, 126684, 4393, 6562, 2046, 49756, 151313, 61187, 19694, 15363, 212467, 68305, 148920, 525, 132887, 841, 9014, 8781, 18151, 25632, 140992, 5351, 31089, 8512, 71, ...
[ 0.12060546875, 0.207275390625, 0.03033447265625, 0.1517333984375, 0.209228515625, 0.03662109375, 0.1502685546875, 0.120849609375, 0.1907958984375, 0.081298828125, 0.119140625, 0.1275634765625, 0.162841796875, 0.07391357421875, 0.029754638671875, 0.1060791015625, 0.08349609375, 0.12...
embed
54259696_c1
54259696
prolog
1
"{", !, { Token = tokLMusta} ; "}", !, { Token = tokRMusta} ; "\\", !, { Token = tokSlash} ; "->", !, { Token = tokImpl} ; "+", !, { Token = tokPlus } ; "-", !, { Token = tokMinus } ; "*", !, { Token = tokTimes } ; "=", !, { Token = tokEqual } ; "<", !, { Token = tokLt } ; ">", !, { Token = tokGt } ; "_", !, { Token =...
"{", !, { Token = tokLMusta} ; "}", !, { Token = tokRMusta} ; "\\", !, { Token = tokSlash} ; "->", !, { Token = tokImpl} ; "+", !, { Token = tokPlus } ; "-", !, { Token = tokMinus } ; "*", !, { Token = tokTimes } ; "=", !, { Token = tokEqual } ; "<", !, { Token = tokLt } ; ">", !, { Token = tokGt } ; "_", !, { Token =...
[ 0.01226806640625, 0.00010156631469726562, 0.00665283203125, -0.00811767578125, 0.005645751953125, 0.00830078125, -0.00157928466796875, -0.010009765625, 0.01220703125, -0.0233154296875, -0.00164794921875, 0.00531005859375, -0.027587890625, -0.01806640625, 0.01348876953125, 0.00662231445...
[ 44, 24854, 830, 711, 717, 1098, 2203, 25636, 37150, 5394, 2819, 8152, 294, 5544, 103607, 128878, 141, 1328, 88225, 9, 169929, 1639, 70059, 71723, 866, 18, 14256, 14202, 30854, 15277, 14, 2199, 19364, 10770, 192, 46029, 4759, 153939, 397, ...
[ 0.056549072265625, 0.0865478515625, 0.0880126953125, 0.125244140625, 0.1632080078125, 0.242431640625, 0.079345703125, 0.2110595703125, 0.062255859375, 0.210205078125, 0.059356689453125, 0.07958984375, 0.0308990478515625, 0.2030029296875, 0.0760498046875, 0.0928955078125, 0.1239013671...
embed
30026151_c0
30026151
prolog
0
Title: Uneven tabling performance in BProlog 8.1 Problem title: Uneven tabling performance in BProlog 8.1 Tags: performance, prolog, prolog-tabling, memoization, b-prolog Problem: Uneven tabling performance in BProlog 8.1 I did a few experiments with the tabling capabilities of b-prolog version 8.1 and was quite surpri...
Uneven tabling performance in BProlog 8.1 Uneven tabling performance in BProlog 8.1 performance prolog prolog-tabling memoization b-prolog Uneven BProlog posInt_CollatzSteps i0_i_maxSteps0_maxSteps MaxSteps Uneven tabling performance in BProlog 8.1 I did a few experiments with the tabling capabilities of b-prolog versi...
[ 0.01043701171875, -0.00136566162109375, 0.0023040771484375, -0.00439453125, -0.0218505859375, 0.01263427734375, -0.004974365234375, -0.0035858154296875, 0.0076904296875, -0.0078125, 0.0252685546875, 0.0191650390625, -0.01519775390625, 0.01190185546875, 0.01513671875, 0.01446533203125, ...
[ 8975, 1353, 308, 79298, 23718, 335, 10752, 4867, 70885, 502, 102, 163, 432, 876, 3454, 3864, 2335, 169, 191644, 2389, 24084, 9920, 28007, 130732, 9, 11389, 144285, 139999, 18151, 54529, 88842, 98441, 541, 56065, 241866, 3060, 24491, 892, 15...
[ 0.0687255859375, 0.1932373046875, 0.1656494140625, 0.1668701171875, 0.15380859375, 0.1005859375, 0.1651611328125, 0.1982421875, 0.2081298828125, 0.08544921875, 0.1358642578125, 0.051361083984375, 0.0501708984375, 0.1168212890625, 0.1287841796875, 0.065185546875, 0.03448486328125, 0...
embed
30134535_c0
30134535
prolog
0
Title: How to solve this arithmetic expression puzzle in Prolog? Problem title: How to solve this arithmetic expression puzzle in Prolog? Tags: python, prolog, constraints Problem: How to solve this arithmetic expression puzzle in Prolog? sum(First,[Second|Tail],['+'|Signs],Result) :- Head is First + Second, sum(Head,T...
How to solve this arithmetic expression puzzle in Prolog? How to solve this arithmetic expression puzzle in Prolog? python prolog constraints itertools How Prolog itertools.product itertools.chain Head Tail Signs Result First Second Third How to solve this arithmetic expression puzzle in Prolog? I have a programming pr...
[ 0.0096435546875, -0.00921630859375, 0.00970458984375, 0.031494140625, -0.0159912109375, 0.0167236328125, -0.0194091796875, 0.0036468505859375, 0.01287841796875, -0.02294921875, -0.007476806640625, -0.0030670166015625, 0.004486083984375, -0.005706787109375, 0.006591796875, 0.00854492187...
[ 11249, 86869, 903, 8962, 282, 125195, 104192, 23, 1250, 4867, 187, 17198, 50828, 502, 2816, 4288, 720, 89110, 17, 57877, 115097, 44816, 1218, 379, 48838, 126684, 23972, 77648, 198387, 56037, 2967, 65030, 166589, 188, 38953, 10342, 197271, 100...
[ 0.06695556640625, 0.186767578125, 0.0872802734375, 0.145751953125, 0.0179901123046875, 0.234375, 0.229248046875, 0.0623779296875, 0.1871337890625, 0.2744140625, 0.010040283203125, 0.0379638671875, 0.0787353515625, 0.1376953125, 0.136474609375, 0.0484619140625, 0.1453857421875, 0.22...
embed
59011516_c0
59011516
prolog
0
Title: How to properly construct prolog parser? Problem title: How to properly construct prolog parser? Tags: dcg, nlp, prolog Problem: How to properly construct prolog parser? I'm writing a parser in prolog and getting the following error: procedure `copula_verb(A)' does not exist Reachable from: proper_noun(A,B) np(A...
How to properly construct prolog parser? How to properly construct prolog parser? dcg nlp prolog How Word proper_noun Rest np2 common_noun Words Start End copula_verb transitive_verb intransitive_verb LEXICON WORLD MODEL Maru Grumpycat Henri Nala Pusheen Shironeko Nyancat box1 box2 Basket1 How to properly construct pro...
[ 0.00518798828125, -0.0096435546875, -0.00007009506225585938, 0.0185546875, -0.00165557861328125, 0.03271484375, -0.002166748046875, -0.00994873046875, 0.00909423828125, -0.06494140625, 0.00836181640625, -0.01904296875, 0.00201416015625, -0.0034027099609375, 0.032958984375, 0.0078125, ...
[ 11249, 155965, 64549, 502, 4867, 366, 2189, 177, 26775, 22543, 27798, 157, 309, 49756, 25037, 304, 39210, 13794, 18878, 552, 42943, 81465, 62621, 77980, 200702, 34, 2676, 4460, 80640, 353, 143, 114405, 5997, 3630, 265, 16530, 152327, 47, 32...
[ 0.0458984375, 0.1439208984375, 0.21435546875, 0.1846923828125, 0.2440185546875, 0.1763916015625, 0.2161865234375, 0.0626220703125, 0.09716796875, 0.10357666015625, 0.13330078125, 0.010467529296875, 0.0819091796875, 0.1683349609375, 0.08892822265625, 0.06268310546875, 0.06216430664062...
embed
65015404_c0
65015404
prolog
0
Title: Two conditional based replace function over same list in prolog? Problem title: Two conditional based replace function over same list in prolog? Tags: prolog, list Problem: Two conditional based replace function over same list in prolog? I need to replace elements in a list based on its value, for certain type o...
Two conditional based replace function over same list in prolog? Two conditional based replace function over same list in prolog? prolog list Two Char Response Res Two conditional based replace function over same list in prolog? I need to replace elements in a list based on its value, for certain type of value I need t...
[ -0.004547119140625, -0.019775390625, 0.000782012939453125, 0.0032196044921875, 0.0019683837890625, 0.017333984375, -0.0032806396484375, -0.002227783203125, 0.02294921875, -0.0021514892578125, 0.0186767578125, -0.003631591796875, 0.00250244140625, -0.00494384765625, 0.0081787109375, 0.0...
[ 32964, 35431, 289, 35509, 91995, 32354, 645, 5701, 5303, 502, 4867, 21656, 92748, 9624, 3871, 80854, 6863, 34292, 24233, 10644, 71924, 8562, 17932, 119591, 30646, 12830, 3444, 4527, 27781, 217063, 101935, 136, 120820, 31330, 11, 135179, 62816, ...
[ 0.1566162109375, 0.1929931640625, 0.10693359375, 0.1473388671875, 0.2076416015625, 0.1859130859375, 0.08203125, 0.071533203125, 0.1422119140625, 0.132568359375, 0.2152099609375, 0.096435546875, 0.1644287109375, 0.141845703125, 0.040313720703125, 0.115478515625, 0.01068115234375, 0....
embed
2994246_c0
2994246
prolog
0
Title: Learn Prolog Now! DCG Practice Example Problem title: Learn Prolog Now! DCG Practice Example Tags: prolog, grammar, dcg Problem: Learn Prolog Now! DCG Practice Example I have been progressing through Learn Prolog Now! as self-study and am now learning about Definite Clause Grammars. I am having some difficulty w...
Learn Prolog Now! DCG Practice Example Learn Prolog Now! DCG Practice Example prolog grammar dcg Learn Prolog Now DCG Practice Example Learn Prolog Now! DCG Practice Example I have been progressing through Learn Prolog Now! as self-study and am now learning about Definite Clause Grammars. I am having some difficulty wi...
[ 0.003082275390625, 0.0267333984375, -0.0096435546875, 0.01611328125, -0.0010528564453125, 0.0240478515625, -0.016357421875, -0.00958251953125, 0.01019287109375, -0.033935546875, -0.01202392578125, -0.020751953125, -0.00921630859375, 0.00186920166015625, 0.004119873046875, 0.02416992187...
[ 134031, 1250, 4867, 14240, 38, 391, 56367, 109613, 89536, 502, 122092, 147, 104, 238, 177, 42658, 15970, 1459, 5036, 52080, 88606, 67, 100700, 13, 48078, 1727, 19441, 34844, 289, 148735, 66211, 12301, 19048, 33022, 91736, 139392, 653, 876, ...
[ 0.1146240234375, 0.1522216796875, 0.234130859375, 0.1856689453125, 0.096923828125, 0.10028076171875, 0.215087890625, 0.150634765625, 0.1689453125, 0.1466064453125, 0.1141357421875, 0.0723876953125, 0.10595703125, 0.0638427734375, 0.06512451171875, 0.06146240234375, 0.037139892578125,...
embed
74257987_c0
74257987
prolog
0
Title: Prolog recursive method printing out and returning different things. Possible issue with tail recursion Problem title: Prolog recursive method printing out and returning different things. Possible issue with tail recursion Tags: tail-recursion, recursion, prolog Problem: Prolog recursive method printing out and ...
Prolog recursive method printing out and returning different things. Possible issue with tail recursion Prolog recursive method printing out and returning different things. Possible issue with tail recursion tail-recursion recursion prolog the Prolog Possible FinalList Cost Result SLD Adds append_list _Goal NodeList Pc...
[ 0.0263671875, 0.002777099609375, 0.0167236328125, 0.00665283203125, 0.00811767578125, -0.0006103515625, -0.0115966796875, -0.01904296875, 0.01611328125, 0.006988525390625, 0.0284423828125, -0.02392578125, 0.01043701171875, -0.01513671875, 0.01422119140625, 0.00634765625, 0.0074768066...
[ 1250, 4867, 195625, 5844, 55300, 2448, 1916, 1810, 30646, 12921, 8966, 115861, 31089, 46741, 1830, 107, 48650, 502, 27188, 154663, 63099, 126684, 30693, 29117, 114689, 6562, 17903, 438, 587, 271, 24784, 44816, 1218, 379, 192, 5021, 2016, 4713...
[ 0.16845703125, 0.2457275390625, 0.226806640625, 0.15380859375, 0.1572265625, 0.1409912109375, 0.007354736328125, 0.111572265625, 0.1552734375, 0.139892578125, 0.0989990234375, 0.07470703125, 0.1175537109375, 0.251708984375, 0.0828857421875, 0.002197265625, 0.150146484375, 0.1103515...
embed
3905542_c0
3905542
prolog
0
Title: Executing prolog code on an iPhone Problem title: Executing prolog code on an iPhone Tags: iphone, logic-programming, prolog Problem: Executing prolog code on an iPhone I currently have the need to execute prolog code in an application I am making. I am aware that Apple probably never would allow something like ...
Executing prolog code on an iPhone Executing prolog code on an iPhone iphone logic-programming prolog Executing Executing prolog code on an iPhone I currently have the need to execute prolog code in an application I am making. I am aware that Apple probably never would allow something like this in the App Store, but th...
[ 0.037841796875, 0.00396728515625, -0.00049591064453125, 0.0125732421875, -0.00927734375, 0.0031890869140625, 0.004913330078125, 0.011474609375, 0.0017242431640625, -0.08349609375, 0.004486083984375, 0.0086669921875, -0.031494140625, 0.0012664794921875, 0.0087890625, 0.0009765625, 0.0...
[ 211603, 214, 502, 4867, 18151, 98, 142, 4289, 71798, 62775, 28966, 82424, 3871, 71924, 13, 38415, 20662, 87, 444, 107419, 450, 4129, 31895, 8306, 2806, 63769, 1884, 23, 70, 5659, 14934, 4, 1284, 83, 959, 91177, 3293, 1286, 14375, 13452, ...
[ 0.21435546875, 0.04315185546875, 0.215576171875, 0.290283203125, 0.2366943359375, 0.1007080078125, 0.065673828125, 0.251708984375, 0.1971435546875, 0.178466796875, 0.1385498046875, 0.04193115234375, 0.10888671875, 0.2056884765625, 0.012451171875, 0.144775390625, 0.0418701171875, 0....
embed
75873448_c0
75873448
prolog
0
Title: Jug Water Problem using DFS and State Space in Prolog Problem title: Jug Water Problem using DFS and State Space in Prolog Tags: prolog, water-jug-problem Problem: Jug Water Problem using DFS and State Space in Prolog I'm solving the water jug problem using state space and dfs,jug 1 have capacity of 4,jug 2 have...
Jug Water Problem using DFS and State Space in Prolog Jug Water Problem using DFS and State Space in Prolog prolog water-jug-problem DFS Jug Water Problem State Space Prolog Define fill1 fill2 empty1 empty2 pour1to2 pour2to1 Action Actions Visited State1 Jug Water Problem using DFS and State Space in Prolog I'm solving...
[ 0.007293701171875, 0.0198974609375, -0.00860595703125, 0.015625, -0.011962890625, 0.01202392578125, -0.046630859375, 0.00909423828125, -0.0128173828125, 0.00616455078125, 0.0205078125, 0.00384521484375, -0.0022125244140625, 0.0205078125, -0.004364013671875, 0.0137939453125, -0.001441...
[ 3314, 177, 27646, 15649, 17368, 391, 36381, 136, 22836, 43045, 1250, 4867, 23, 502, 7401, 461, 38953, 64552, 26292, 418, 304, 201505, 578, 188, 57945, 98684, 103863, 2967, 11341, 32628, 104, 17447, 106, 177399, 201, 116, 138, 31374, 60875, ...
[ 0.22607421875, 0.1605224609375, 0.2305908203125, 0.1976318359375, 0.061187744140625, 0.0655517578125, 0.1949462890625, 0.0521240234375, 0.133056640625, 0.171630859375, 0.143310546875, 0.2081298828125, 0.06298828125, 0.103271484375, 0.187255859375, 0.1763916015625, 0.1912841796875, ...
embed
25170868_c0
25170868
prolog
0
Title: Search heuristics for cumulatives Problem title: Search heuristics for cumulatives Tags: clpfd, constraint-programming, prolog, sicstus-prolog Problem: Search heuristics for cumulatives I have through several other questions ( Use of cumulatives , Expressing setup time with cumulatives ) got excellent feedback o...
Search heuristics for cumulatives Search heuristics for cumulatives clpfd constraint-programming prolog sicstus-prolog global many Search Task Dur Exe Resources All t10 t11 t12 t13 t14 t15 t16 t17 t18 t19 t20 use_module Maxspan Timeout S10 S11 S12 S13 S14 S15 S16 S17 S18 S19 S20 E10 E11 E12 E13 E14 E15 E16 E17 E18 E19 ...
[ 0.01141357421875, -0.005401611328125, -0.01043701171875, 0.001983642578125, -0.02001953125, -0.01251220703125, 0.00017642974853515625, -0.0211181640625, -0.0057373046875, -0.057861328125, 0.00408935546875, 0.005096435546875, 0.01507568359375, 0.0128173828125, 0.003326416015625, -0.0198...
[ 33086, 764, 62210, 41637, 100, 314, 19908, 42991, 39557, 71, 2816, 4288, 28966, 502, 4867, 18253, 3454, 7964, 5941, 9598, 92, 24344, 5443, 152055, 808, 963, 1662, 1530, 2681, 2485, 2489, 1819, 2947, 1549, 4527, 83279, 9920, 19332, 19055, ...
[ 0.2396240234375, 0.07269287109375, 0.203125, 0.103515625, 0.044830322265625, 0.13037109375, 0.2254638671875, 0.176513671875, 0.03607177734375, 0.058441162109375, 0.1201171875, 0.021453857421875, 0.07373046875, 0.0782470703125, 0.15869140625, 0.16259765625, 0.0828857421875, 0.106811...
embed
64271570_c1
64271570
prolog
1
(andorra,'Europe',100). encompasses(angola,'Africa',100). encompasses(armenia,'Asia',100). encompasses(aruba,'America',100). encompasses(australia,'Australia/Oceania',100). encompasses(anguilla,'America',100). encompasses(azerbaijan,'Asia',100). encompasses(bangladesh,'Asia',100). encompasses(barbados,'America',100). e...
(andorra,'Europe',100). encompasses(angola,'Africa',100). encompasses(armenia,'Asia',100). encompasses(aruba,'America',100). encompasses(australia,'Australia/Oceania',100). encompasses(anguilla,'America',100). encompasses(azerbaijan,'Asia',100). encompasses(bangladesh,'Asia',100). encompasses(barbados,'America',100). e...
[ -0.006591796875, 0.002777099609375, -0.0111083984375, 0.0084228515625, -0.004913330078125, 0.004241943359375, 0.0010223388671875, -0.0031585693359375, 0.0220947265625, 0.028564453125, 0.0255126953125, -0.0069580078125, 0.0003261566162109375, -0.01324462890625, -0.01214599609375, -0.018...
[ 15, 3448, 16461, 4, 25, 99733, 3559, 194, 22, 277, 13409, 90, 132, 27803, 143, 284, 72428, 114218, 399, 143946, 137575, 190474, 916, 2816, 7884, 231833, 64, 7925, 1463, 34, 2298, 11, 4383, 28449, 2864, 8900, 132217, 1299, 402, 1140, 776...
[ 0.13671875, 0.18408203125, 0.274658203125, 0.0361328125, 0.1151123046875, 0.2215576171875, 0.22119140625, 0.1015625, 0.1177978515625, 0.203125, 0.26953125, 0.1260986328125, 0.01458740234375, 0.149169921875, 0.189208984375, 0.039306640625, 0.195068359375, 0.1759033203125, 0.121826...
embed
13688792_c0
13688792
prolog
0
Title: Is this a good implementation of a loop in Prolog? Problem title: Is this a good implementation of a loop in Prolog? Tags: state-machine, prolog Problem: Is this a good implementation of a loop in Prolog? First of all, let me tell you that this happens to be the first time I ask something here, so if it's not th...
Is this a good implementation of a loop in Prolog? Is this a good implementation of a loop in Prolog? state-machine prolog Prolog Finite State Transition Network st0 evnt0 st1 evnt1 st2 evnt2 fsm_state Energy ActivePayloads NextState Params Sys Is this a good implementation of a loop in Prolog? First of all, let me tel...
[ -0.0009002685546875, -0.018310546875, 0.001495361328125, 0.017333984375, 0.003936767578125, -0.009521484375, -0.0177001953125, 0.0002079010009765625, -0.00011730194091796875, -0.050048828125, 0.03515625, 0.026123046875, -0.027587890625, 0.00787353515625, 0.033935546875, -0.010864257812...
[ 2071, 903, 10, 4127, 208124, 111, 40956, 23, 1250, 4867, 11341, 103149, 502, 13316, 1486, 22836, 162774, 28997, 6138, 2389, 3404, 660, 418, 304, 1238, 39, 61340, 67005, 88441, 104709, 63033, 4997, 135206, 13, 1720, 4432, 4843, 7, 26458, 1...
[ 0.048553466796875, 0.1427001953125, 0.07257080078125, 0.1859130859375, 0.2127685546875, 0.02294921875, 0.2464599609375, 0.0938720703125, 0.1929931640625, 0.251220703125, 0.1053466796875, 0.1046142578125, 0.1507568359375, 0.13818359375, 0.1204833984375, 0.12060546875, 0.154296875, 0...
embed
68850347_c0
68850347
prolog
0
Title: How to implement the factorial sequence in successor arithmetics for all argument modes? Problem title: How to implement the factorial sequence in successor arithmetics for all argument modes? Tags: failure-slice, prolog, successor-arithmetics, termination, factorial Problem: How to implement the factorial seque...
How to implement the factorial sequence in successor arithmetics for all argument modes? How to implement the factorial sequence in successor arithmetics for all argument modes? failure-slice prolog successor-arithmetics termination factorial How Stack Choice garbage_collected _1328 _1330 swish_trace:swish_call How to ...
[ 0.017578125, 0.0135498046875, 0.001922607421875, 0.0130615234375, 0.00830078125, -0.01611328125, 0.0006103515625, 0.0081787109375, -0.0023956298828125, -0.005035400390625, 0.020263671875, 0.00726318359375, -0.026123046875, -0.022705078125, 0.0262451171875, -0.00616455078125, 0.017944...
[ 11249, 29479, 31461, 15403, 40, 944, 3956, 39457, 42, 8962, 282, 41637, 756, 10750, 13736, 23, 137578, 13348, 502, 4867, 29527, 6512, 2594, 181948, 3671, 402, 429, 196352, 2681, 3882, 1197, 114686, 39989, 85763, 25632, 1250, 1528, 61924, 16...
[ 0.0501708984375, 0.2078857421875, 0.2139892578125, 0.2154541015625, 0.085693359375, 0.158935546875, 0.09521484375, 0.21240234375, 0.1318359375, 0.1383056640625, 0.057952880859375, 0.0150299072265625, 0.0404052734375, 0.2138671875, 0.1513671875, 0.002197265625, 0.171142578125, 0.109...
embed
56759404_c0
56759404
prolog
0
Title: Verify_attributes in SICStus Prolog Problem title: Verify_attributes in SICStus Prolog Tags: clp, prolog, sicstus-prolog Problem: Verify_attributes in SICStus Prolog Attribute variables permit to extend unification. The following is about arcane details of the interface. Let's cut right to the chase! In sicstus-...
Verify_attributes in SICStus Prolog Verify_attributes in SICStus Prolog clp prolog sicstus-prolog Verify_attributes SICStus Prolog Value Goals Verify_attributes in SICStus Prolog Attribute variables permit to extend unification. The following is about arcane details of the interface. Let's cut right to the chase! In si...
[ 0.00537109375, -0.00150299072265625, -0.003631591796875, -0.002777099609375, -0.0086669921875, -0.006195068359375, -0.006805419921875, 0.0020599365234375, -0.00616455078125, 0.0023193359375, 0.0079345703125, 0.01104736328125, -0.00799560546875, -0.0020599365234375, -0.00092315673828125, ...
[ 1446, 40383, 257, 191145, 7, 159, 102198, 2143, 1250, 4867, 254, 502, 26536, 18253, 3454, 190060, 2016, 16765, 1913, 77336, 28897, 47, 65042, 51, 41274, 86553, 41653, 101758, 1608, 35773, 27639, 1653, 2063, 17368, 150380, 2046, 53400, 111021,...
[ 0.204833984375, 0.2083740234375, 0.090087890625, 0.25146484375, 0.0184478759765625, 0.1197509765625, 0.119384765625, 0.196533203125, 0.1380615234375, 0.1959228515625, 0.04425048828125, 0.0845947265625, 0.11279296875, 0.206787109375, 0.1090087890625, 0.14794921875, 0.136474609375, 0...
embed
50657460_c0
50657460
prolog
0
Title: prolog nurikabe puzzle:Predicate not defined Problem title: prolog nurikabe puzzle:Predicate not defined Tags: gnu-prolog, infinite-loop, prolog Problem: prolog nurikabe puzzle:Predicate not defined I am trying to run this code in prolog to solve nurikabe puzzle , but i get this error Predicate fd_domain/3 not d...
prolog nurikabe puzzle:Predicate not defined prolog nurikabe puzzle:Predicate not defined gnu-prolog infinite-loop prolog puzzle:Predicate Predicate fd_domain SWI-Prolog Jan Wielemaker swi-prolog.org en.wikipedia.org Nurikabe_ check_domain_list check_count_grid check_2x2_grid check_walls Nb_values check_values Grid get...
[ -0.006011962890625, 0.003753662109375, 0.006195068359375, -0.000797271728515625, -0.01190185546875, 0.006988525390625, 0.00185394287109375, -0.006927490234375, 0.00124359130859375, -0.025390625, 0.001190185546875, -0.001007080078125, -0.00469970703125, -0.01416015625, 0.0032196044921875,...
[ 502, 4867, 315, 14265, 372, 104192, 19273, 18601, 67, 959, 61924, 104155, 3454, 54241, 28354, 7145, 2063, 1238, 71, 56206, 38969, 10752, 3342, 157617, 55474, 2452, 7168, 1429, 12765, 6562, 71013, 120067, 425, 304, 66769, 27494, 31945, 5701, ...
[ 0.1475830078125, 0.1917724609375, 0.133056640625, 0.1866455078125, 0.2032470703125, 0.186767578125, 0.1287841796875, 0.2147216796875, 0.1053466796875, 0.10711669921875, 0.216064453125, 0.142578125, 0.122314453125, 0.0791015625, 0.125, 0.14794921875, 0.16796875, 0.048004150390625, ...
embed
26367865_c0
26367865
prolog
0
Title: How to get values existing in two lists Problem title: How to get values existing in two lists Tags: prolog Problem: How to get values existing in two lists I have two lists with song names and the singer - top 10 for EU and top 10 for US. The result should be a list containing the songs which exists in both lis...
How to get values existing in two lists How to get values existing in two lists prolog How top10us all_About_That_Bass Meghan Trainor shake_It_Off Taylor Swift black_Widow Iggy Azalea Featuring Rita Ora bang_Bang Jessie Ariana Grande Nicki Minaj Tove dont_Tell_Em Jeremih Maroon stay_With_Me Sam Smith break_Free Zedd to...
[ 0.00176239013671875, 0.0157470703125, 0.0184326171875, -0.0091552734375, -0.017578125, 0.0203857421875, 0.000044345855712890625, -0.0091552734375, 0.00005078315734863281, -0.033935546875, -0.000316619873046875, 0.031494140625, 0.00201416015625, -0.00848388671875, 0.018310546875, 0.0014...
[ 11249, 47, 2046, 142424, 144573, 23, 6626, 5303, 7, 502, 4867, 2663, 963, 223, 756, 24988, 6056, 115743, 63473, 167361, 137879, 748, 174450, 23389, 150369, 63569, 130643, 22556, 36119, 24293, 67192, 1155, 1935, 11, 109561, 76728, 18265, 11339...
[ 0.09075927734375, 0.037628173828125, 0.1796875, 0.303466796875, 0.30908203125, 0.154052734375, 0.24462890625, 0.28369140625, 0.017364501953125, 0.1710205078125, 0.191650390625, 0.154052734375, 0.1732177734375, 0.1605224609375, 0.1048583984375, 0.056884765625, 0.1683349609375, 0.163...
embed
26936560_c0
26936560
prolog
0
Title: Multiply Two Polynomials in Prolog Problem title: Multiply Two Polynomials in Prolog Tags: prolog Problem: Multiply Two Polynomials in Prolog I am trying to use Prolog to implement the polynomial multiplication that multiplies two polynomials. Below is the code given in SML, but I need it in Prolog. A test solut...
Multiply Two Polynomials in Prolog Multiply Two Polynomials in Prolog prolog Multiply Two Polynomials Prolog poly_add m:real n::nr scalar_mult poly_mult Constant Constant2 Head1 Head2 Tail Tail2 HeadSum TailSum Head scal_mult HeadMult TailMult Multiply Two Polynomials in Prolog I am trying to use Prolog to implement th...
[ -0.01434326171875, 0.027587890625, 0.01611328125, 0.01007080078125, 0.0098876953125, 0.0240478515625, -0.00848388671875, -0.018310546875, 0.0027618408203125, -0.01708984375, 0.0194091796875, 0.00750732421875, -0.016357421875, -0.01373291015625, -0.00064849853515625, -0.005035400390625,...
[ 19335, 62479, 32964, 63306, 1687, 15403, 23, 1250, 4867, 502, 35874, 4028, 347, 30544, 653, 53313, 146232, 81944, 148416, 304, 44816, 1218, 379, 316, 117906, 50657, 29479, 127664, 118126, 6626, 18151, 39456, 3871, 3034, 29806, 159, 102107, 10...
[ 0.1396484375, 0.12158203125, 0.1986083984375, 0.1968994140625, 0.150390625, 0.14404296875, 0.033203125, 0.16064453125, 0.251220703125, 0.1112060546875, 0.1900634765625, 0.0748291015625, 0.05999755859375, 0.1358642578125, 0.001495361328125, 0.058380126953125, 0.04754638671875, 0.213...
embed
27316966_c0
27316966
prolog
0
Title: Trouble displaying constraint values - SICStus clpfd Problem title: Trouble displaying constraint values - SICStus clpfd Tags: sicstus-prolog, prolog, clpfd, constraints Problem: Trouble displaying constraint values - SICStus clpfd I am trying to solve a problem for a class that consists of this: Fill the white ...
Trouble displaying constraint values - SICStus clpfd Trouble displaying constraint values - SICStus clpfd sicstus-prolog prolog clpfd constraints Trouble SICStus _24087 _24343 _24471 _24535 Result Resumptions Entailments Prunings Backtracks Constraints Matrix CounterX CounterY InnerSize Value all_distinct SSet VSet Set...
[ 0.0078125, 0.006439208984375, -0.00433349609375, -0.00157928466796875, -0.0147705078125, -0.013671875, -0.0281982421875, 0.005767822265625, 0.004486083984375, 0.00054168701171875, -0.0086669921875, 0.00897216796875, -0.0067138671875, -0.0013580322265625, 0.0067138671875, -0.00595092773...
[ 119671, 2661, 44116, 158, 2816, 4288, 142424, 159, 2143, 39557, 71, 102198, 26536, 18253, 3454, 4867, 502, 62635, 19308, 10289, 363, 158222, 4633, 5843, 126684, 71836, 46741, 55386, 26828, 125728, 194234, 197956, 1542, 1723, 137657, 127167, 190...
[ 0.1453857421875, 0.07391357421875, 0.1842041015625, 0.052764892578125, 0.1837158203125, 0.1356201171875, 0.183349609375, 0.07012939453125, 0.2109375, 0.041412353515625, 0.0865478515625, 0.026824951171875, 0.052154541015625, 0.175537109375, 0.06915283203125, 0.1544189453125, 0.0670166...
embed
79009699_c0
79009699
prolog
0
Title: Solving N-queens with Constraint Handling Rules Problem title: Solving N-queens with Constraint Handling Rules Tags: constraint-handling-rules, prolog Problem: Solving N-queens with Constraint Handling Rules I've run into the obvious problem with using CHR to solve a problem that requires backtracking. I'm sure ...
Solving N-queens with Constraint Handling Rules Solving N-queens with Constraint Handling Rules constraint-handling-rules prolog Solving N-queens Constraint Handling Rules use_module chr_constraint n_queens Solving N-queens with Constraint Handling Rules I've run into the obvious problem with using CHR to solve a probl...
[ 0.0024261474609375, 0.00482177734375, 0.033447265625, -0.005859375, 0.009033203125, -0.0196533203125, -0.01324462890625, -0.01007080078125, -0.0034942626953125, -0.0576171875, -0.0078125, 0.0004024505615234375, -0.004913330078125, 0.00921630859375, -0.00183868408203125, -0.010925292968...
[ 6678, 541, 944, 1755, 678, 1657, 2816, 193237, 139118, 4288, 54885, 13500, 502, 4867, 4527, 83279, 17656, 2271, 653, 11675, 3934, 162520, 2967, 17368, 313, 29562, 86869, 10, 144570, 4420, 125728, 214, 54704, 29806, 47, 7413, 18151, 33342, 4...
[ 0.1005859375, 0.1490478515625, 0.1502685546875, 0.0966796875, 0.016448974609375, 0.0231170654296875, 0.1475830078125, 0.1922607421875, 0.141845703125, 0.052734375, 0.1663818359375, 0.1187744140625, 0.06573486328125, 0.1024169921875, 0.05322265625, 0.089111328125, 0.08795166015625, ...
embed
39711616_c0
39711616
prolog
0
Title: Using Prolog to compute the GCD of a polynomial Problem title: Using Prolog to compute the GCD of a polynomial Tags: greatest-common-divisor, polynomial-math, prolog Problem: Using Prolog to compute the GCD of a polynomial The title kind of says it all. I'm looking to compute the GCD of two polynomials. Is there...
Using Prolog to compute the GCD of a polynomial Using Prolog to compute the GCD of a polynomial greatest-common-divisor polynomial-math prolog Using Prolog GCD Tail Head Old mult_GCD List Out poly_deg poly_red Poly scal_div poly_sub P1_head P1_rest P2_head P2_rest PSub_head PSub_rest P1_head-P2_head scal_prod _Sc Poly_...
[ -0.0089111328125, 0.0159912109375, 0.0208740234375, -0.0152587890625, 0.016845703125, 0.0196533203125, -0.0157470703125, -0.0205078125, 0.02197265625, -0.03466796875, 0.017822265625, 0.0179443359375, -0.00677490234375, -0.00457763671875, -0.002166748046875, -0.00433349609375, 0.00915...
[ 345, 1250, 4867, 9969, 6743, 527, 16069, 35874, 1687, 15403, 70, 158036, 277, 3796, 428, 51858, 125458, 502, 1218, 379, 44816, 25074, 3869, 724, 32036, 13538, 33215, 2822, 63306, 117906, 30618, 22144, 304, 96472, 31251, 112348, 56644, 52782, ...
[ 0.03472900390625, 0.1546630859375, 0.233642578125, 0.115234375, 0.1083984375, 0.1087646484375, 0.26171875, 0.14990234375, 0.12939453125, 0.099853515625, 0.0304718017578125, 0.1287841796875, 0.049957275390625, 0.13916015625, 0.09747314453125, 0.1871337890625, 0.0302276611328125, 0.1...
embed
14949537_c0
14949537
prolog
0
Title: How can you add elements to a list or compute them from the knowledge base without using findall or assert/retract in Prolog? Problem title: How can you add elements to a list or compute them from the knowledge base without using findall or assert/retract in Prolog? Tags: prolog, backtracking, prolog-assert, pro...
How can you add elements to a list or compute them from the knowledge base without using findall or assert/retract in Prolog? How can you add elements to a list or compute them from the knowledge base without using findall or assert/retract in Prolog? prolog backtracking prolog-assert prolog-findall the findall How Pro...
[ 0.01287841796875, 0.01104736328125, 0.004119873046875, 0.020751953125, -0.018798828125, 0.003692626953125, 0.00616455078125, 0.00732421875, 0.00555419921875, -0.045654296875, 0.0234375, 0.00897216796875, 0.006195068359375, -0.005859375, 0.01025390625, 0.00543212890625, 0.005859375, ...
[ 11249, 831, 15190, 80854, 47, 5303, 9969, 6743, 1295, 51359, 3647, 15490, 7413, 5584, 237, 33657, 39989, 1250, 4867, 17368, 502, 4420, 125728, 214, 162, 111607, 15757, 908, 16797, 32036, 4390, 73484, 363, 22144, 75161, 30854, 25921, 63399, ...
[ 0.037567138671875, 0.0423583984375, 0.1763916015625, 0.2001953125, 0.04473876953125, 0.202880859375, 0.119873046875, 0.1728515625, 0.1329345703125, 0.154541015625, 0.21826171875, 0.1273193359375, 0.1195068359375, 0.1771240234375, 0.0174102783203125, 0.1717529296875, 0.101806640625, ...
embed
16162996_c0
16162996
prolog
0
Title: Prolog cut behaviour doesn&#x27;t make sense to me Problem title: Prolog cut behaviour doesn&#x27;t make sense to me Tags: prolog, backtrace, backtracking, prolog-cut Problem: Prolog cut behaviour doesn't make sense to me I've come across very strange behaviour (to me) regarding a particular cut. From what I und...
Prolog cut behaviour doesn&#x27;t make sense to me Prolog cut behaviour doesn&#x27;t make sense to me prolog backtrace backtracking prolog-cut Prolog Tail NewTail Prolog cut behaviour doesn't make sense to me I've come across very strange behaviour (to me) regarding a particular cut. From what I understood, once the ex...
[ 0.0322265625, 0.035400390625, 0.016845703125, -0.00311279296875, -0.00188446044921875, 0.006683349609375, -0.005706787109375, -0.016845703125, 0.01446533203125, 0.0032806396484375, -0.00762939453125, 0.00469970703125, -0.007171630859375, -0.017333984375, 0.03125, 0.00179290771484375, ...
[ 1250, 4867, 59226, 224833, 3768, 18, 3249, 10422, 47, 163, 502, 4420, 39989, 125728, 19774, 1218, 379, 2356, 9874, 114453, 17311, 24145, 71924, 10922, 53418, 36917, 18151, 73342, 15400, 678, 110, 314, 933, 140992, 107730, 15190, 25632, 2806, ...
[ 0.1630859375, 0.22802734375, 0.2193603515625, 0.1558837890625, 0.0270843505859375, 0.01177978515625, 0.04986572265625, 0.1175537109375, 0.047088623046875, 0.0224761962890625, 0.1263427734375, 0.14013671875, 0.1348876953125, 0.2100830078125, 0.1707763671875, 0.1087646484375, 0.0760498...
embed
5520728_c0
5520728
prolog
0
Title: prolog natural language parsing Problem title: prolog natural language parsing Tags: prolog Problem: prolog natural language parsing i have a college assignment to make a prolog program parse natural language, ie it should output P = np(det(the), np2(noun(cat))), vp(verb(sat), pp(prep(on), np(det(the), np2(noun(...
prolog natural language parsing prolog natural language parsing prolog np2 Sentence Noun_Phrase Verb_Phrase Rem Parse Rem1 Rest RestParsed ran_away prolog natural language parsing i have a college assignment to make a prolog program parse natural language, ie it should output when i input np([the, cat, sat, on, the, ma...
[ -0.0025787353515625, 0.016357421875, -0.0040283203125, 0.005523681640625, -0.00421142578125, 0.024658203125, -0.00066375732421875, -0.00946044921875, 0.006683349609375, -0.046630859375, 0.03173828125, 0.0034332275390625, -0.022216796875, -0.00933837890625, -0.0037384033203125, 0.024047...
[ 502, 4867, 6083, 46876, 366, 6953, 25037, 304, 63999, 6620, 438, 309, 45689, 78728, 1446, 38645, 2392, 49756, 28636, 13028, 72274, 40466, 95486, 674, 1528, 184, 5608, 140992, 3229, 107730, 2347, 7515, 11736, 98, 70, 2589, 683, 866, 64457, ...
[ 0.158447265625, 0.236572265625, 0.1363525390625, 0.1114501953125, 0.1395263671875, 0.046295166015625, 0.15869140625, 0.1309814453125, 0.083740234375, 0.0118408203125, 0.0175933837890625, 0.09027099609375, 0.01177978515625, 0.07861328125, 0.08172607421875, 0.143798828125, 0.12109375, ...
embed
40426413_c1
40426413
prolog
1
(1,Room1,Ys), curVal(Xs,Ys,Maze,V2), %Get the value of the findPika(Xs,Ys,V2,Maze,[[Xs,Ys]]). %Find pika % findMasterball - recursive predicate that searches for the Masterball % X,Y - current location % Val - current value of location % PathMB - Path traveled so far % newPath - Path returned % %Base Case findMasterbal...
(1,Room1,Ys), curVal(Xs,Ys,Maze,V2), %Get the value of the findPika(Xs,Ys,V2,Maze,[[Xs,Ys]]). %Find pika % findMasterball - recursive predicate that searches for the Masterball % X,Y - current location % Val - current value of location % PathMB - Path traveled so far % newPath - Path returned % %Base Case findMasterbal...
[ 0.005157470703125, 0.006988525390625, 0.017822265625, 0.0157470703125, 0.0140380859375, 0.03515625, 0.0034027099609375, 0.012451171875, 0.0128173828125, -0.0250244140625, 0.01806640625, 0.002716064453125, 0.01263427734375, -0.031982421875, 0.001953125, 0.0007781982421875, 0.000667572...
[ 2858, 12724, 306, 418, 1723, 7, 247, 9709, 42272, 1542, 4613, 731, 856, 10461, 1745, 724, 126, 34292, 7413, 683, 2959, 304, 194, 204582, 32418, 116527, 12126, 20, 195625, 5844, 1653, 2063, 67, 33938, 100, 18897, 1193, 43581, 31913, 4769, ...
[ 0.093505859375, 0.1402587890625, 0.09271240234375, 0.02740478515625, 0.1304931640625, 0.068359375, 0.0145721435546875, 0.16552734375, 0.23046875, 0.127197265625, 0.0870361328125, 0.1727294921875, 0.146484375, 0.1124267578125, 0.09661865234375, 0.1107177734375, 0.1209716796875, 0.21...
embed
55331162_c0
55331162
prolog
0
Title: How to ignore the first and last element on each line when reading from a text file in Prolog? Problem title: How to ignore the first and last element on each line when reading from a text file in Prolog? Tags: prolog Problem: How to ignore the first and last element on each line when reading from a text file in...
How to ignore the first and last element on each line when reading from a text file in Prolog? How to ignore the first and last element on each line when reading from a text file in Prolog? prolog a How Prolog InStream lst_2_lst_of_lst lst_2_lst_of_lst_helper TMP Input How to ignore the first and last element on each l...
[ -0.0029144287109375, -0.0172119140625, 0.0169677734375, 0.0009307861328125, 0.003021240234375, -0.0016937255859375, 0.01239013671875, 0.00153350830078125, 0.00396728515625, -0.001708984375, 0.0028076171875, 0.0157470703125, -0.0185546875, -0.0157470703125, 0.0306396484375, -0.001937866...
[ 11249, 47, 124962, 5117, 136, 4568, 12830, 12638, 13315, 16454, 1295, 7986, 11435, 1250, 4867, 502, 360, 115061, 304, 4390, 271, 73866, 9088, 12301, 10941, 188347, 51727, 3934, 5303, 23708, 39041, 112, 107730, 96853, 15555, 99954, 80854, 138,...
[ 0.064208984375, 0.0275726318359375, 0.227783203125, 0.1492919921875, 0.1392822265625, 0.1927490234375, 0.1788330078125, 0.101318359375, 0.1441650390625, 0.162841796875, 0.066162109375, 0.10162353515625, 0.13037109375, 0.155029296875, 0.2110595703125, 0.07049560546875, 0.0628662109375...
embed
76082574_c0
76082574
prolog
0
Title: How can I create in prolog a list of lists of triplets with the prev and the next elements of each element? Problem title: How can I create in prolog a list of lists of triplets with the prev and the next elements of each element? Tags: prolog Problem: How can I create in prolog a list of lists of triplets with ...
How can I create in prolog a list of lists of triplets with the prev and the next elements of each element? How can I create in prolog a list of lists of triplets with the prev and the next elements of each element? prolog How take_with_neighbors Result Prev Next get_adjacent_elements_helper Primero Rest How can I crea...
[ -0.005279541015625, 0.01251220703125, 0.013671875, 0.01068115234375, -0.021728515625, -0.003326416015625, -0.012451171875, -0.005096435546875, 0.014892578125, -0.054443359375, 0.00628662109375, 0.0152587890625, -0.004241943359375, 0.00823974609375, 0.00579833984375, 0.0262451171875, ...
[ 11249, 831, 28282, 23, 502, 4867, 5303, 162738, 933, 678, 28468, 11737, 80854, 12638, 12830, 5646, 76228, 6958, 3422, 126684, 74717, 4997, 2046, 145, 16797, 62766, 73866, 46282, 31, 49756, 136, 31577, 8, 3249, 17262, 1295, 82449, 16750, 139...
[ 0.02142333984375, 0.0343017578125, 0.1412353515625, 0.052581787109375, 0.1634521484375, 0.210205078125, 0.1768798828125, 0.2193603515625, 0.1400146484375, 0.06964111328125, 0.17919921875, 0.080078125, 0.169189453125, 0.031982421875, 0.1392822265625, 0.084716796875, 0.1331787109375, ...
embed
46446407_c0
46446407
prolog
0
Title: Combining pure predicates Problem title: Combining pure predicates Tags: logical-purity, prolog Problem: Combining pure predicates I am trying to combine some pure predicates from previous stack overflow questions to make my own predicate. I want to give a list of c's (which have associated facts -'ats' with the...
Combining pure predicates Combining pure predicates logical-purity prolog Combining cpgpartition_ts_fs_feature at2 use_module Xs0 Feature FValue cpg_ats_i AtList atom_concat Op2 Test AtValue3 if_ memberd_t Ts0 Fs0 If_1 Then_0 Else_0 type_error instantiation_error bool01_t ISO Truth list_memberd_t list_memberd_truth val...
[ -0.013427734375, -0.0028839111328125, 0.0018157958984375, -0.0302734375, 0.00970458984375, -0.004302978515625, 0.0185546875, 0.00762939453125, -0.00830078125, 0.00726318359375, 0.008056640625, 0.00933837890625, -0.01611328125, 0.0185546875, 0.01190185546875, 0.0169677734375, -0.02502...
[ 106935, 592, 34166, 1653, 2063, 1636, 62775, 289, 4717, 2481, 502, 4867, 254, 177, 15866, 933, 17447, 88981, 99, 304, 4527, 83279, 2389, 106594, 563, 856, 50770, 9821, 1913, 154663, 34627, 2271, 4460, 2331, 8647, 32786, 10644, 188800, 34648...
[ 0.24267578125, 0.0240936279296875, 0.21142578125, 0.2125244140625, 0.2142333984375, 0.050140380859375, 0.1148681640625, 0.0118408203125, 0.122314453125, 0.0145263671875, 0.1055908203125, 0.1307373046875, 0.06768798828125, 0.054107666015625, 0.142333984375, 0.030853271484375, 0.116577...
embed
40787762_c0
40787762
prolog
0
Title: Prolog: How to use answer of one rule in next rule Problem title: Prolog: How to use answer of one rule in next rule Tags: prolog, duplicates Problem: Prolog: How to use answer of one rule in next rule I am struggling to work out why this isn't working. Using SWI-Prolog, I am trying to: Use the people(List) rule...
Prolog: How to use answer of one rule in next rule Prolog: How to use answer of one rule in next rule prolog duplicates Prolog How List Element _Element_ _List_ First Rest duplicate_1 duplicate_2 Second Prolog: How to use answer of one rule in next rule I am struggling to work out why this isn't working. Using SWI-Prol...
[ 0.007781982421875, 0.01361083984375, 0.004150390625, 0.0255126953125, -0.004180908203125, 0.02392578125, 0.0068359375, 0.020751953125, -0.0038299560546875, -0.044921875, -0.018310546875, -0.0020599365234375, -0.00323486328125, 0.00848388671875, 0.00927734375, 0.016845703125, 0.021972...
[ 1250, 4867, 11249, 4527, 35166, 111, 1632, 79986, 23, 11737, 502, 171763, 1636, 32036, 48325, 19929, 154663, 23972, 49756, 67, 115187, 304, 77648, 237875, 18, 20697, 159, 38969, 10752, 31577, 36836, 3395, 28282, 5303, 117776, 123055, 1295, 11...
[ 0.1566162109375, 0.2188720703125, 0.042724609375, 0.14453125, 0.216552734375, 0.1168212890625, 0.11767578125, 0.1990966796875, 0.08837890625, 0.1392822265625, 0.1368408203125, 0.2042236328125, 0.064208984375, 0.1339111328125, 0.1597900390625, 0.0953369140625, 0.1427001953125, 0.021...
embed
53745648_c0
53745648
prolog
0
Title: How to connect Eclipse with JPL on OS X Problem title: How to connect Eclipse with JPL on OS X Tags: java, eclipse, jpl, prolog Problem: How to connect Eclipse with JPL on OS X I've got problem which wasn't solved anywhere else. I've downloaded libjpl.dylib and copied to /usr/local/Cellar/swi-prolog/7.6.4/libexe...
How to connect Eclipse with JPL on OS X How to connect Eclipse with JPL on OS X java eclipse jpl prolog jpl How Eclipse libjpl.dylib Djava.library.path Cellar swipl-7.6.4 Pro System.load Term Compound teacher_of Atom Query q.hasSolution How to connect Eclipse with JPL on OS X I've got problem which wasn't solved anywhe...
[ -0.00518798828125, 0.0257568359375, 0.004730224609375, 0.008544921875, -0.019287109375, -0.01104736328125, -0.01129150390625, 0.00677490234375, -0.01318359375, -0.0255126953125, -0.0113525390625, -0.0208740234375, -0.0201416015625, 0.00640869140625, 0.0021209716796875, -0.007080078125,...
[ 11249, 37067, 234962, 678, 821, 21130, 98, 11787, 1193, 79, 330, 28, 106371, 184, 1647, 2424, 502, 4867, 25474, 170, 1459, 5612, 24071, 150, 2844, 128405, 10077, 320, 2452, 180347, 617, 1250, 12353, 63033, 2994, 31, 117914, 4390, 69728, 5...
[ 0.030914306640625, 0.1995849609375, 0.2822265625, 0.1640625, 0.1568603515625, 0.2783203125, 0.03662109375, 0.136962890625, 0.15576171875, 0.111572265625, 0.1588134765625, 0.002593994140625, 0.1783447265625, 0.0716552734375, 0.049957275390625, 0.2454833984375, 0.09320068359375, 0.17...
embed
47314597_c0
47314597
prolog
0
Title: Beginner Prolog Stack Overflow Problem title: Beginner Prolog Stack Overflow Tags: transitive-closure, prolog, failure-slice Problem: Beginner Prolog Stack Overflow I am working on my very first Prolog assignment, and on recursive problems, I cannot seem to stop overflowing the stack. It's like an addiction; I d...
Beginner Prolog Stack Overflow Beginner Prolog Stack Overflow transitive-closure prolog failure-slice Beginner Prolog Stack Overflow Parts Database steering_wheel Determines ERROR Out Beginner Prolog Stack Overflow I am working on my very first Prolog assignment, and on recursive problems, I cannot seem to stop overflo...
[ 0.022705078125, 0.01416015625, 0.01483154296875, 0.004852294921875, -0.0004425048828125, -0.0157470703125, -0.033203125, -0.005889892578125, 0.0185546875, -0.044921875, 0.016357421875, -0.001800537109375, -0.00927734375, -0.01031494140625, 0.0235595703125, 0.0022735595703125, -0.0060...
[ 67053, 56, 1250, 4867, 6512, 2594, 9578, 118664, 62621, 5844, 170224, 502, 137578, 13348, 16995, 187781, 2288, 4209, 144009, 30524, 151206, 24638, 13538, 20697, 4552, 5117, 95486, 195625, 44402, 53418, 48903, 7279, 645, 214, 70, 177261, 1884, ...
[ 0.1201171875, 0.06365966796875, 0.17138671875, 0.25830078125, 0.1099853515625, 0.0947265625, 0.1224365234375, 0.279296875, 0.1217041015625, 0.07177734375, 0.1744384765625, 0.130126953125, 0.1654052734375, 0.1075439453125, 0.1016845703125, 0.1259765625, 0.06640625, 0.111572265625, ...
embed