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
9797238_c0
9797238
prolog
0
Title: Implementing nth1 list operation in SWI prolog Problem title: Implementing nth1 list operation in SWI prolog Tags: prolog, predicate, list Problem: Implementing nth1 list operation in SWI prolog How would you code your own predicate in Prolog, to do exactly what the nth1 function does? For those not familiar wit...
Implementing nth1 list operation in SWI prolog Implementing nth1 list operation in SWI prolog prolog predicate list Implementing nth1 SWI Implementing nth1 list operation in SWI prolog How would you code your own predicate in Prolog, to do exactly what the nth1 function does? For those not familiar with that function, ...
[ 0.00007343292236328125, 0.0076904296875, 0.023681640625, 0.006439208984375, -0.00543212890625, 0.00494384765625, -0.002471923828125, 0.003082275390625, 0.0084228515625, -0.0203857421875, 0.021484375, 0.000484466552734375, -0.02099609375, -0.006805419921875, 0.01177978515625, -0.0049743...
[ 153941, 653, 927, 418, 5303, 41018, 159, 38969, 502, 4867, 1653, 2063, 67, 18151, 10002, 23, 1250, 66161, 32354, 14602, 16031, 14537, 2965, 44116, 8305, 27781, 705, 54753, 627, 241, 876, 35839, 115081, 63262, 12830, 184750, 959, 45234, 4711...
[ 0.17919921875, 0.1673583984375, 0.258056640625, 0.1778564453125, 0.196044921875, 0.163330078125, 0.070068359375, 0.23974609375, 0.1365966796875, 0.2220458984375, 0.177490234375, 0.19482421875, 0.093505859375, 0.17333984375, 0.09161376953125, 0.004608154296875, 0.16943359375, 0.0259...
embed
10061343_c0
10061343
prolog
0
Title: Euclidean recursive algorithm Problem title: Euclidean recursive algorithm Tags: prolog, greatest-common-divisor, visual-prolog Problem: Euclidean recursive algorithm Ok, I know it's really a stupid question, but I can't get it. There is a task where I should find a recursive algorithm of Euclid (gcd). I've done...
Euclidean recursive algorithm Euclidean recursive algorithm prolog greatest-common-divisor visual-prolog Euclidean CLAUSES PREDICATES nod1 Otvet Euclidean recursive algorithm Ok, I know it's really a stupid question, but I can't get it. There is a task where I should find a recursive algorithm of Euclid (gcd). I've don...
[ -0.029296875, 0.0191650390625, 0.01300048828125, 0.00174713134765625, 0.0172119140625, 0.031982421875, -0.00482177734375, -0.008544921875, 0.00421142578125, -0.042236328125, 0.0216064453125, -0.025390625, 0.002593994140625, -0.00323486328125, 0.0128173828125, -0.0172119140625, 0.0060...
[ 5177, 34937, 130265, 195625, 5844, 234873, 502, 4867, 158036, 277, 3796, 428, 51858, 21176, 3454, 129636, 78441, 134366, 30941, 110, 418, 19546, 3618, 3714, 6183, 110833, 9655, 831, 2046, 66211, 5608, 7413, 10, 111, 238, 12472, 177, 71574, ...
[ 0.118896484375, 0.15234375, 0.1539306640625, 0.255859375, 0.185302734375, 0.282958984375, 0.10205078125, 0.1627197265625, 0.1185302734375, 0.02703857421875, 0.098388671875, 0.08868408203125, 0.1851806640625, 0.1588134765625, 0.05682373046875, 0.05902099609375, 0.0513916015625, 0.11...
embed
32698960_c1
32698960
prolog
1
bound" trains. this is done by having predicates like car , shape , has_car(train, car) etc. originally all the background knowledge relating to these is located in the .b file and the five positive examples (e.g eastbound(east1). ) in the .f file (+ five negative examples, e.g. eastbound(west1). , in the .n file). lea...
bound" trains. this is done by having predicates like car , shape , has_car(train, car) etc. originally all the background knowledge relating to these is located in the .b file and the five positive examples (e.g eastbound(east1). ) in the .f file (+ five negative examples, e.g. eastbound(west1). , in the .n file). lea...
[ 0.0174560546875, 0.00860595703125, 0.006195068359375, -0.00897216796875, -0.00689697265625, 0.0380859375, 0.01806640625, -0.01116943359375, 0.00469970703125, -0.033203125, 0.01171875, -0.0028076171875, -0.0036163330078125, 0.0101318359375, 0.0087890625, 0.0081787109375, 0.01556396484...
[ 99091, 58, 25550, 7, 16940, 19441, 1653, 2063, 1636, 2258, 115700, 1556, 3284, 1517, 73, 76615, 51359, 105866, 5, 275, 11435, 43606, 24491, 27781, 4438, 17727, 420, 40907, 25617, 19, 137802, 102158, 152028, 65572, 51042, 135989, 13, 27489, ...
[ 0.281494140625, 0.008544921875, 0.268310546875, 0.07379150390625, 0.010528564453125, 0.05657958984375, 0.1024169921875, 0.1351318359375, 0.038543701171875, 0.1549072265625, 0.121826171875, 0.1156005859375, 0.1787109375, 0.157958984375, 0.05078125, 0.1522216796875, 0.1639404296875, ...
embed
38284686_c0
38284686
prolog
0
Title: How to perform long concatenation of lists in Prolog? Problem title: How to perform long concatenation of lists in Prolog? Tags: list, concatenation, prolog Problem: How to perform long concatenation of lists in Prolog? I am interested in performing a long concatenation of lists, using Prolog language. The objec...
How to perform long concatenation of lists in Prolog? How to perform long concatenation of lists in Prolog? list concatenation prolog How Prolog l_conc Tail Head How to perform long concatenation of lists in Prolog? I am interested in performing a long concatenation of lists, using Prolog language. The objective is to ...
[ 0.01214599609375, 0.0184326171875, -0.0054931640625, 0.00634765625, -0.0123291015625, 0.0036773681640625, -0.003662109375, -0.0057373046875, 0.005615234375, -0.037353515625, 0.00848388671875, -0.015380859375, 0.005279541015625, 0.00152587890625, 0.0135498046875, -0.005523681640625, 0...
[ 11249, 47, 51339, 4989, 158, 4460, 33, 2320, 5303, 7, 23, 1250, 4867, 502, 96, 2271, 238, 1218, 379, 44816, 60892, 17368, 46876, 151814, 61924, 1653, 2063, 69723, 33478, 756, 1632, 17932, 10750, 28219, 8060, 99091, 13267, 35166, 11, 275, ...
[ 0.08819580078125, 0.04498291015625, 0.18359375, 0.173583984375, 0.1044921875, 0.17236328125, 0.1351318359375, 0.060394287109375, 0.2308349609375, 0.05279541015625, 0.057952880859375, 0.1785888671875, 0.256591796875, 0.1229248046875, 0.0288238525390625, 0.092529296875, 0.068115234375,...
embed
39352573_c0
39352573
prolog
0
Title: Circuit Verification using prolog Problem title: Circuit Verification using prolog Tags: clpb, prolog Problem: Circuit Verification using prolog i have been given functions and predicate to use to verify a 2 bit full adder circuit. This is what I have understood so far:- a function signal(t) where t is terminal ...
Circuit Verification using prolog Circuit Verification using prolog clpb prolog prolog Circuit Verification Circuit Verification using prolog i have been given functions and predicate to use to verify a 2 bit full adder circuit. This is what I have understood so far:- For these I am not sure how to convert them to prol...
[ 0.042236328125, 0.016357421875, -0.0035552978515625, 0.023193359375, -0.0189208984375, -0.001983642578125, -0.007080078125, 0.01129150390625, -0.01300048828125, -0.029296875, 0.005096435546875, -0.0198974609375, -0.003753662109375, 0.000690460205078125, 0.004302978515625, -0.0016708374...
[ 167190, 1446, 41274, 17368, 502, 4867, 33139, 254, 275, 34475, 32354, 1653, 2063, 67, 4527, 493, 40383, 116, 4785, 4393, 606, 820, 61404, 217064, 2060, 9077, 3642, 96760, 2856, 47, 18151, 28219, 30646, 5351, 16750, 62952, 171859, 39527, 802...
[ 0.19580078125, 0.17236328125, 0.15087890625, 0.0645751953125, 0.15576171875, 0.2320556640625, 0.0215606689453125, 0.052703857421875, 0.10516357421875, 0.0294952392578125, 0.1533203125, 0.07177734375, 0.119384765625, 0.02734375, 0.04620361328125, 0.1436767578125, 0.163818359375, 0.0...
embed
69468064_c0
69468064
prolog
0
Title: How to print prolog list variable's output on separate lines? Problem title: How to print prolog list variable's output on separate lines? Tags: swi-prolog, prolog, logic, list Problem: How to print prolog list variable's output on separate lines? Initial code: nutrition(fruits, NutritionList) :- finda...
How to print prolog list variable's output on separate lines? How to print prolog list variable's output on separate lines? swi-prolog prolog logic list How NutritionList Nutrition How to print prolog list variable's output on separate lines? Initial code: The problem with this is that it tries to print all n...
[ -0.007232666015625, -0.0181884765625, 0.002655029296875, -0.0016937255859375, -0.022705078125, 0.01806640625, 0.017333984375, 0.0078125, 0.00823974609375, 0.0224609375, -0.00885009765625, -0.000347137451171875, 0.0086669921875, -0.01165771484375, 0.009033203125, -0.007781982421875, 0...
[ 11249, 47, 28412, 502, 4867, 5303, 77336, 3768, 140992, 98, 84797, 124519, 91, 2452, 3454, 62775, 191699, 154663, 1890, 18151, 2967, 1927, 756, 150017, 7, 106, 11001, 13315, 3444, 53983, 42335, 37842, 55300, 15969, 22027, 18, 9351, 2663, 24...
[ 0.089599609375, 0.0374755859375, 0.2183837890625, 0.16455078125, 0.221435546875, 0.2039794921875, 0.255859375, 0.0694580078125, 0.240478515625, 0.115966796875, 0.215576171875, 0.180419921875, 0.025390625, 0.156982421875, 0.1107177734375, 0.10296630859375, 0.213134765625, 0.19909667...
embed
76248865_c0
76248865
prolog
0
Title: I dont know how to configure Prolog for VScode, can someone help me? Problem title: I dont know how to configure Prolog for VScode, can someone help me? Tags: swi-prolog, visual-studio-code, prolog Problem: I dont know how to configure Prolog for VScode, can someone help me? I have opened a folder where I have s...
I dont know how to configure Prolog for VScode, can someone help me? I dont know how to configure Prolog for VScode, can someone help me? swi-prolog visual-studio-code prolog Prolog VScode I dont know how to configure Prolog for VScode, can someone help me? I have opened a folder where I have some projects on Prolog, a...
[ 0.0177001953125, -0.00101470947265625, -0.0033416748046875, 0.0289306640625, -0.01336669921875, 0.0101318359375, -0.00433349609375, 0.00188446044921875, -0.0069580078125, -0.0155029296875, -0.0086669921875, 0.0084228515625, -0.0096435546875, 0.00439453125, 0.01104736328125, -0.00105285...
[ 13319, 3714, 3642, 47, 222495, 1250, 4867, 100, 44160, 40899, 4358, 91, 2452, 3454, 21176, 52629, 502, 142096, 78303, 77635, 9803, 88898, 42, 9790, 33949, 4527, 75101, 2424, 903, 18499, 7426, 2367, 765, 86869, 41206, 4488, 678 ]
[ 0.04742431640625, 0.0762939453125, 0.050537109375, 0.002777099609375, 0.228271484375, 0.1807861328125, 0.274658203125, 0.07916259765625, 0.1956787109375, 0.258544921875, 0.037353515625, 0.05078125, 0.21484375, 0.129150390625, 0.16064453125, 0.1334228515625, 0.1195068359375, 0.05444...
embed
73042869_c0
73042869
prolog
0
Title: Prolog - substitute substring of string by letter not used in string itself Problem title: Prolog - substitute substring of string by letter not used in string itself Tags: prolog, substitution, swi-prolog Problem: Prolog - substitute substring of string by letter not used in string itself I am searching some pr...
Prolog - substitute substring of string by letter not used in string itself Prolog - substitute substring of string by letter not used in string itself prolog substitution swi-prolog Prolog StringInput SubString Substitution SubstitutionLetter Substition SubstitionLetter Monday Prolog - substitute substring of string b...
[ -0.00396728515625, 0.00970458984375, 0.0003299713134765625, 0.024169921875, -0.01190185546875, -0.0021209716796875, 0.0086669921875, 0.00439453125, -0.00005507469177246094, 0.005340576171875, -0.0238037109375, 0.01190185546875, -0.0184326171875, 0.0003108978271484375, -0.002685546875, ...
[ 1250, 4867, 161740, 13, 1614, 91693, 79315, 390, 31330, 959, 11814, 68034, 502, 1830, 2452, 3454, 23351, 214, 4153, 7077, 8273, 71713, 13480, 5267, 3055, 1084, 68318, 23, 157318, 1653, 2063, 1328, 997, 96472, 756, 31943, 678, 74918, 11651, ...
[ 0.1715087890625, 0.2437744140625, 0.2158203125, 0.083740234375, 0.1861572265625, 0.2020263671875, 0.2041015625, 0.033477783203125, 0.1341552734375, 0.10076904296875, 0.126953125, 0.09698486328125, 0.127685546875, 0.0145416259765625, 0.116455078125, 0.1168212890625, 0.1446533203125, ...
embed
74456400_c0
74456400
prolog
0
Title: How to write a Prolog rule to define a predicate? Problem title: How to write a Prolog rule to define a predicate? Tags: prolog-toplevel, prolog Problem: How to write a Prolog rule to define a predicate? here's the assignment: In a Prolog program, predicates are defined: mother(M,Y) — M is the mother of Y father...
How to write a Prolog rule to define a predicate? How to write a Prolog rule to define a predicate? prolog-toplevel prolog How Prolog brother_or_sister How to write a Prolog rule to define a predicate? here's the assignment: In a Prolog program, predicates are defined: mother(M,Y) — M is the mother of Y father(F,X) — F...
[ 0.0230712890625, 0.008544921875, -0.016845703125, 0.01007080078125, -0.0220947265625, 0.01226806640625, 0.006622314453125, 0.006195068359375, 0.00555419921875, -0.04443359375, 0.0108642578125, -0.01385498046875, -0.00244140625, -0.00775146484375, 0.017578125, 0.00153350830078125, 0.0...
[ 11249, 33022, 1250, 4867, 79986, 61924, 1653, 2063, 67, 47, 502, 13784, 67919, 82953, 748, 7, 19656, 10, 95486, 1528, 1636, 42732, 594, 1723, 276, 83, 111, 990, 67373, 919, 1542, 563, 1193, 601, 18781, 18151, 29479, 193429, 136, 707, 11...
[ 0.0654296875, 0.178955078125, 0.1683349609375, 0.24169921875, 0.1873779296875, 0.2037353515625, 0.1885986328125, 0.2269287109375, 0.1510009765625, 0.02593994140625, 0.1072998046875, 0.06634521484375, 0.1376953125, 0.1868896484375, 0.125244140625, 0.107421875, 0.1717529296875, 0.007...
embed
24167722_c0
24167722
prolog
0
Title: Workaround ensure_loaded/1 B-Prolog? Problem title: Workaround ensure_loaded/1 B-Prolog? Tags: b-prolog, prolog Problem: Workaround ensure_loaded/1 B-Prolog? Is there a workaround to make ensure_loaded/1 work in B-Prolog as it works in many other Prolog systems? The goal is to have a preamble so that the rest of...
Workaround ensure_loaded/1 B-Prolog? Workaround ensure_loaded/1 B-Prolog? b-prolog prolog Workaround ensure_loaded B-Prolog set_prolog_flag redefine_builtin atom_concat suite.p Workaround ensure_loaded/1 B-Prolog? Is there a workaround to make ensure_loaded/1 work in B-Prolog as it works in many other Prolog systems? T...
[ 0.011962890625, 0.00103759765625, 0.006927490234375, 0.0263671875, -0.0201416015625, 0.0167236328125, -0.01531982421875, 0.003936767578125, 0.0123291015625, -0.050537109375, 0.016845703125, 0.0240478515625, -0.0185546875, -0.02978515625, 0.0220947265625, 0.01220703125, 0.010925292968...
[ 27985, 11, 67688, 63284, 63033, 297, 11583, 335, 9, 10752, 4867, 876, 3454, 502, 5423, 190872, 15265, 64552, 978, 379, 2311, 34627, 2271, 4460, 14947, 5, 254, 4488, 3249, 454, 23, 43240, 1250, 76519, 69236, 19542, 40099, 10588, 18151, 452...
[ 0.1171875, 0.06231689453125, 0.189453125, 0.297607421875, 0.2451171875, 0.1524658203125, 0.2076416015625, 0.2083740234375, 0.041473388671875, 0.1822509765625, 0.2103271484375, 0.1544189453125, 0.1536865234375, 0.1396484375, 0.119873046875, 0.1915283203125, 0.059112548828125, 0.1304...
embed
27404562_c0
27404562
prolog
0
Title: plan schedule based on flights cost Problem title: plan schedule based on flights cost Tags: prolog Problem: plan schedule based on flights cost Suppose to have a list of air planes defined as follow: plane(rome,berlin). plane(berlin,london). plane(london,lisboa). plane(london,dublin). plane(dublin,paris). plane...
plan schedule based on flights cost plan schedule based on flights cost prolog Dep Arr plan schedule based on flights cost Suppose to have a list of air planes defined as follow: I will solve the problem to find all routes between two cities in the following way: For example with I obtain: false. The problem comes if I...
[ 0.00830078125, 0.022216796875, 0.005401611328125, 0.0252685546875, -0.0111083984375, -0.0031890869140625, -0.00762939453125, -0.004608154296875, 0.01287841796875, -0.03271484375, -0.01336669921875, 0.006927490234375, -0.00830078125, 0.00616455078125, 0.000835418701171875, -0.0041809082...
[ 1774, 80889, 35509, 98, 113014, 7, 11034, 502, 4867, 262, 1172, 5303, 1831, 143561, 61924, 28960, 86869, 2967, 7413, 756, 36439, 17721, 6626, 162708, 27781, 113054, 98320, 15190, 112034, 17582, 4568, 33636, 11249, 831, 2046, 678, 3622, 27167,...
[ 0.199951171875, 0.254638671875, 0.1231689453125, 0.0732421875, 0.1700439453125, 0.061676025390625, 0.18994140625, 0.051361083984375, 0.104248046875, 0.0050048828125, 0.0142974853515625, 0.1396484375, 0.07269287109375, 0.172607421875, 0.08355712890625, 0.006072998046875, 0.08813476562...
embed
66623602_c0
66623602
prolog
0
Title: Prolog, Generate all paths from a node to another, limiting the maximum number of hops Problem title: Prolog, Generate all paths from a node to another, limiting the maximum number of hops Tags: prolog Problem: Prolog, Generate all paths from a node to another, limiting the maximum number of hops my problem: Gen...
Prolog, Generate all paths from a node to another, limiting the maximum number of hops Prolog, Generate all paths from a node to another, limiting the maximum number of hops prolog a Prolog Generate Y-1 X-1 Prolog, Generate all paths from a node to another, limiting the maximum number of hops my problem: Generate all p...
[ 0.016845703125, 0.01123046875, -0.00982666015625, 0.0177001953125, -0.00408935546875, 0.021240234375, 0.0078125, -0.00830078125, 0.01611328125, -0.064453125, -0.0233154296875, -0.032470703125, -0.01495361328125, -0.004302978515625, 0.0140380859375, -0.0179443359375, 0.01507568359375,...
[ 1250, 4867, 155370, 67, 756, 60875, 1295, 110, 112, 47, 15700, 17475, 214, 38132, 14012, 72720, 502, 990, 5759, 1193, 7, 2967, 21771, 16940, 18151, 3642, 831, 15549, 442, 139392, 3444, 3126, 238, 2389, 17727, 106, 30646, 248, 63527, 116, ...
[ 0.2061767578125, 0.27099609375, 0.1697998046875, 0.06298828125, 0.120361328125, 0.2158203125, 0.107421875, 0.1640625, 0.08837890625, 0.09375, 0.109375, 0.1832275390625, 0.027618408203125, 0.1397705078125, 0.058135986328125, 0.2161865234375, 0.166259765625, 0.12646484375, 0.136108...
embed
42937638_c0
42937638
prolog
0
Title: Prolog check for predicate category Problem title: Prolog check for predicate category Tags: prolog Problem: Prolog check for predicate category I have been working with Prolog since today, and wanted to create a simple test case. The basic idea was to have multiple sports defined, and it looks as follows: socce...
Prolog check for predicate category Prolog check for predicate category prolog Prolog ball_sport has_11_players_per_team large_ball use_feet has_a_ball both_ballsports sport_one sport_two has_category has_category_sport_two Prolog check for predicate category I have been working with Prolog since today, and wanted to c...
[ 0.007293701171875, -0.00147247314453125, -0.007598876953125, 0.0087890625, -0.0068359375, 0.00872802734375, -0.01055908203125, -0.01611328125, 0.005615234375, -0.0186767578125, 0.00677490234375, -0.00244140625, -0.01031494140625, -0.007232666015625, 0, 0.01318359375, 0.01080322265625...
[ 1250, 4867, 12765, 100, 1653, 2063, 67, 95487, 502, 16446, 10033, 1556, 1662, 139570, 1264, 44420, 21334, 12126, 4527, 2242, 126, 11, 15044, 85927, 2896, 3630, 55547, 33478, 6504, 20697, 28282, 8781, 3034, 7225, 62822, 6528, 48716, 29681, 6...
[ 0.1837158203125, 0.26025390625, 0.210693359375, 0.09210205078125, 0.1773681640625, 0.2349853515625, 0.072265625, 0.2685546875, 0.124755859375, 0.1583251953125, 0.1759033203125, 0.08673095703125, 0.117919921875, 0.177734375, 0.065185546875, 0.1121826171875, 0.0743408203125, 0.170410...
embed
11018338_c0
11018338
prolog
0
Title: Prolog remove character spaces from atom for using term_to_atom Problem title: Prolog remove character spaces from atom for using term_to_atom Tags: prolog, swi-prolog Problem: Prolog remove character spaces from atom for using term_to_atom At some point of my program I have an atom formed by what previously wer...
Prolog remove character spaces from atom for using term_to_atom Prolog remove character spaces from atom for using term_to_atom prolog swi-prolog atom term_to_atom Prolog Result second2 Sea no_value third3 Type Prolog remove character spaces from atom for using term_to_atom At some point of my program I have an atom fo...
[ -0.00335693359375, 0.02734375, 0.00099945068359375, 0.03125, -0.01092529296875, -0.0015716552734375, 0.005462646484375, 0.003814697265625, -0.01519775390625, -0.0216064453125, 0.016357421875, 0.0113525390625, -0.032470703125, -0.01190185546875, 0.009765625, 0.01416015625, 0.030883789...
[ 1250, 4867, 87388, 62816, 32628, 7, 1295, 34627, 17368, 13579, 188, 5928, 502, 2452, 3454, 126684, 17932, 304, 27414, 110, 27494, 50960, 363, 60457, 1528, 100, 198395, 3444, 28032, 4527, 7136, 191633, 80938, 71721, 15477, 157, 95037, 21320, ...
[ 0.150634765625, 0.2135009765625, 0.163818359375, 0.189697265625, 0.2236328125, 0.0523681640625, 0.07000732421875, 0.220458984375, 0.07275390625, 0.19873046875, 0.15380859375, 0.165283203125, 0.0869140625, 0.10223388671875, 0.081787109375, 0.1529541015625, 0.07659912109375, 0.032836...
embed
22510930_c0
22510930
prolog
0
Title: Prolog integer comparison Problem title: Prolog integer comparison Tags: logic, prolog Problem: Prolog integer comparison Hi there I have a simple clock in Prolog which measures time in 5min intervals nextTime(Hrs:Mins1, Hrs:Mins2) :- nextMins(Mins1, Mins2). nextTime(Hrs1:'55', Hrs2:'00') :- nextHrs(Hrs1, Hrs2)....
Prolog integer comparison Prolog integer comparison logic prolog Prolog Hrs:Mins1 Hrs:Mins2 Mins1 Mins2 Hrs1 Hrs2 H1:M1 H2:M2 Prolog integer comparison Hi there I have a simple clock in Prolog which measures time in 5min intervals Now I want to write a predicate which allows me to say whether time t2 is later or before...
[ 0.00689697265625, -0.00634765625, 0.0167236328125, 0.0169677734375, -0.004150390625, -0.0069580078125, -0.01171875, -0.003997802734375, 0.00482177734375, -0.01373291015625, 0.0021209716796875, 0.01226806640625, 0.00616455078125, -0.00494384765625, 0.0179443359375, -0.00732421875, 0.0...
[ 1250, 4867, 892, 1505, 225490, 62775, 502, 38787, 59076, 418, 304, 4211, 572, 82825, 594, 2685, 8781, 501, 21135, 72350, 1733, 23, 190, 1249, 51514, 3444, 33022, 1653, 2063, 67, 114864, 5154, 36766, 808, 14432, 8108, 45730, 13319, 3714, 3...
[ 0.1895751953125, 0.271240234375, 0.1756591796875, 0.09417724609375, 0.2020263671875, 0.142578125, 0.1427001953125, 0.16650390625, 0.1854248046875, 0.057037353515625, 0.178955078125, 0.1593017578125, 0.0635986328125, 0.0172882080078125, 0.014892578125, 0.01690673828125, 0.073547363281...
embed
46902301_c0
46902301
prolog
0
Title: Prolog unknowns in the knowledge base Problem title: Prolog unknowns in the knowledge base Tags: knowledge-base-population, prolog Problem: Prolog unknowns in the knowledge base I am trying to learn Prolog and it seems the completeness of the knowledge is very important because obviously if the knowledge base do...
Prolog unknowns in the knowledge base Prolog unknowns in the knowledge base knowledge-base-population prolog Prolog great_ruler second_ruler Prolog unknowns in the knowledge base I am trying to learn Prolog and it seems the completeness of the knowledge is very important because obviously if the knowledge base does not...
[ 0.0478515625, -0.00732421875, 0.026611328125, 0.012939453125, -0.0145263671875, 0.019287109375, 0.01806640625, -0.0087890625, 0.00189208984375, 0.00347900390625, 0.01519775390625, 0.0017547607421875, -0.01336669921875, 0.00604248046875, 0.0067138671875, 0.000392913818359375, 0.022705...
[ 1250, 4867, 51, 69723, 1779, 23, 51359, 3647, 37382, 33554, 72403, 502, 6782, 882, 603, 17932, 31577, 30698, 28484, 7432, 111, 5526, 959, 15824, 214552, 52490, 41, 1294, 50339, 149016, 3642, 2965, 47, 34831, 41653, 3395, 15190, 2806, 7464, ...
[ 0.1837158203125, 0.26513671875, 0.1396484375, 0.263427734375, 0.121826171875, 0.06768798828125, 0.1776123046875, 0.2196044921875, 0.1968994140625, 0.0904541015625, 0.113525390625, 0.1455078125, 0.073486328125, 0.137939453125, 0.1611328125, 0.139404296875, 0.006500244140625, 0.03958...
embed
74239040_c0
74239040
prolog
0
Title: How to emulate ulp/1 evaluable function in Prolog Problem title: How to emulate ulp/1 evaluable function in Prolog Tags: prolog, iso-prolog Problem: How to emulate ulp/1 evaluable function in Prolog I find myself using the Java function Math.ulp() from time to time. It has an implementation based on unpacking a ...
How to emulate ulp/1 evaluable function in Prolog How to emulate ulp/1 evaluable function in Prolog prolog iso-prolog How Prolog Math How to emulate ulp/1 evaluable function in Prolog I find myself using the Java function Math.ulp() from time to time. It has an implementation based on unpacking a float number, and doin...
[ 0.00927734375, -0.007568359375, 0.0274658203125, -0.015869140625, -0.002227783203125, 0.00933837890625, 0.0252685546875, -0.002471923828125, 0.00384521484375, -0.01507568359375, -0.00157928466796875, 0.033203125, -0.01458740234375, 0.00946044921875, 0.0115966796875, 0.005859375, 0.00...
[ 11249, 28, 19908, 67, 75, 26775, 11583, 159258, 2661, 32354, 1250, 4867, 47, 502, 13882, 3454, 78804, 23, 17368, 41925, 202, 254, 132, 208124, 35509, 51, 29102, 21917, 14012, 4785, 4902, 49935, 7, 107617, 1295, 17408, 56458, 5570, 8962, 2...
[ 0.07568359375, 0.09478759765625, 0.257080078125, 0.0892333984375, 0.1153564453125, 0.279296875, 0.1888427734375, 0.181396484375, 0.1510009765625, 0.195556640625, 0.19091796875, 0.281982421875, 0.0054931640625, 0.138427734375, 0.0888671875, 0.0911865234375, 0.188720703125, 0.0516357...
embed
42700686_c0
42700686
prolog
0
Title: Not getting full result when output is on one line Problem title: Not getting full result when output is on one line Tags: prolog-toplevel, prolog, swi-prolog Problem: Not getting full result when output is on one line Im new at Prolog , and I am trying some manipulation on graphs . I have a problem in my implem...
Not getting full result when output is on one line Not getting full result when output is on one line prolog-toplevel prolog swi-prolog Not Graph A-B B-A Not getting full result when output is on one line Im new at Prolog , and I am trying some manipulation on graphs . I have a problem in my implementation, and since i...
[ 0.0022430419921875, 0.0133056640625, 0.01068115234375, 0.005706787109375, -0.02392578125, 0.006683349609375, -0.01708984375, 0.015380859375, 0.004150390625, -0.022705078125, 0.00347900390625, -0.0064697265625, -0.00494384765625, 0.004119873046875, 0.01116943359375, 0.017333984375, 0....
[ 11205, 20949, 4393, 16750, 3229, 140992, 83, 98, 1632, 13315, 502, 4867, 67919, 2452, 3454, 6524, 11727, 571, 284, 1250, 45258, 41382, 2967, 208124, 172554, 333, 80581, 18151, 71924, 41, 2046, 50339, 1957, 18, 28484, 11343, 382, 121303, 105...
[ 0.067626953125, 0.08880615234375, 0.18017578125, 0.203857421875, 0.033721923828125, 0.2205810546875, 0.05157470703125, 0.12744140625, 0.1309814453125, 0.1708984375, 0.098876953125, 0.2049560546875, 0.0802001953125, 0.1005859375, 0.088623046875, 0.0838623046875, 0.087158203125, 0.00...
embed
31652482_c1
31652482
prolog
1
],[noah,building1,2,3],[noah,building1,2,4],[noah,building1,2,5],[noah,building1,3,3],[noah,building1,3,4],[noah,building1,3,5] ,[joni,building1,1,3],[joni,building1,1,4],[joni,building1,1,5],[joni,building1,2,3],[joni,building1,2,4],[joni,building1,2,5],[joni,building1,3,3],[joni,building1,3,4],[joni,building1,3,5] ,[...
],[noah,building1,2,3],[noah,building1,2,4],[noah,building1,2,5],[noah,building1,3,3],[noah,building1,3,4],[noah,building1,3,5] ,[joni,building1,1,3],[joni,building1,1,4],[joni,building1,1,5],[joni,building1,2,3],[joni,building1,2,4],[joni,building1,2,5],[joni,building1,3,3],[joni,building1,3,4],[joni,building1,3,5] ,[...
[ -0.0211181640625, 0.007080078125, -0.00531005859375, 0.00616455078125, 0.00994873046875, 0.00384521484375, -0.0172119140625, 0.0184326171875, 0.0033721923828125, 0.0302734375, 0.006744384765625, 0.017822265625, -0.0072021484375, -0.0167236328125, -0.01123046875, 0.01611328125, 0.0055...
[ 10114, 4, 1065, 157, 1366, 146049, 133063, 96386, 617, 268, 418, 71928, 363, 82449, 92714, 6, 513, 93, 163324, 57626, 55525, 1900, 36901, 86245, 563, 977, 304, 2740, 919, 69112, 627, 758, 126188, 21748, 138, 190, 74, 910, 21162, 146, 13...
[ 0.149658203125, 0.08984375, 0.05517578125, 0.2117919921875, 0.2366943359375, 0.27001953125, 0.1771240234375, 0.1971435546875, 0.174560546875, 0.0141448974609375, 0.0875244140625, 0.1917724609375, 0.1719970703125, 0.191162109375, 0.1944580078125, 0.0258331298828125, 0.1143798828125, ...
embed
55303433_c0
55303433
prolog
0
Title: Permutation of a list where numbers must change its position in Prolog Problem title: Permutation of a list where numbers must change its position in Prolog Tags: prolog Problem: Permutation of a list where numbers must change its position in Prolog I'm trying to solve this question for my assignment. The predic...
Permutation of a list where numbers must change its position in Prolog Permutation of a list where numbers must change its position in Prolog prolog Permutation Prolog acceptable_permutation Permutation of a list where numbers must change its position in Prolog I'm trying to solve this question for my assignment. The p...
[ -0.0086669921875, 0.023193359375, 0.002105712890625, -0.0002899169921875, -0.0084228515625, 0.0238037109375, -0.0252685546875, 0.0034332275390625, 0.0152587890625, -0.00714111328125, 0.0223388671875, 0.01495361328125, 0.033203125, 0.0240478515625, -0.004547119140625, 0.0255126953125, ...
[ 908, 561, 22062, 5303, 7440, 101935, 8110, 15549, 19069, 1250, 4867, 502, 213850, 1264, 6863, 31577, 86869, 95486, 1653, 2063, 67, 866, 1052, 5608, 214493, 4734, 2174, 627, 33636, 117, 339, 304, 96386, 959, 142, 155761, 138, 140992, 134598,...
[ 0.109130859375, 0.2091064453125, 0.109375, 0.1790771484375, 0.01629638671875, 0.1602783203125, 0.1094970703125, 0.1673583984375, 0.16845703125, 0.1583251953125, 0.213134765625, 0.12060546875, 0.2393798828125, 0.105712890625, 0.03216552734375, 0.004608154296875, 0.0499267578125, 0.0...
embed
40733509_c0
40733509
prolog
0
Title: how to convert -> into clauses in prolog Problem title: how to convert -> into clauses in prolog Tags: prolog Problem: how to convert -> into clauses in prolog So I am working on a practice problem, where I need to find the number of cells with opening right, up , down and left. I have a working solution b...
how to convert -> into clauses in prolog how to convert -> into clauses in prolog prolog Size Out Dirs contains1 how to convert -> into clauses in prolog So I am working on a practice problem, where I need to find the number of cells with opening right, up , down and left. I have a working solution but I want to ...
[ 0.01068115234375, 0.027099609375, 0.01171875, -0.00101470947265625, -0.0050048828125, 0.0064697265625, 0.012451171875, 0.00396728515625, 0.0021514892578125, -0.0135498046875, -0.015869140625, -0.0029754638671875, 0.00390625, -0.006103515625, 0.0296630859375, -0.0125732421875, 0.00451...
[ 3642, 47, 96760, 20, 1230, 5386, 3934, 70731, 90, 23, 502, 4867, 80378, 13538, 19946, 70541, 418, 33079, 20697, 41361, 2967, 7413, 14012, 38750, 7, 73432, 7108, 1257, 7565, 25737, 29806, 3444, 15549, 4527, 61924, 2174, 37076, 30022, 18151, ...
[ 0.043914794921875, 0.03387451171875, 0.15380859375, 0.107177734375, 0.08203125, 0.1845703125, 0.1219482421875, 0.251708984375, 0.1822509765625, 0.05218505859375, 0.140380859375, 0.2193603515625, 0.10498046875, 0.12353515625, 0.08349609375, 0.10284423828125, 0.0213623046875, 0.19128...
embed
36844815_c0
36844815
prolog
0
Title: Checking if a string is contained in a language (Prolog) Problem title: Checking if a string is contained in a language (Prolog) Tags: dcg, context-free-grammar, prolog Problem: Checking if a string is contained in a language (Prolog) This is the CFG: S -> T | V T -> UU U -> aUb | ab V -> aVb | aWb W -> bWa | ba...
Checking if a string is contained in a language (Prolog) Checking if a string is contained in a language (Prolog) dcg context-free-grammar prolog Checking Prolog in_lang Checking if a string is contained in a language (Prolog) This is the CFG: so this will accept some form of: And here is the code I'm working with: As ...
[ 0.006805419921875, 0.01416015625, 0.022216796875, 0.0390625, -0.02490234375, -0.0029449462890625, -0.00994873046875, -0.01434326171875, 0.01446533203125, -0.041015625, 0.0159912109375, -0.00099945068359375, -0.006805419921875, 0.004974365234375, 0.01116943359375, 0.0037841796875, 0.0...
[ 38679, 214, 2174, 79315, 70541, 297, 23, 46876, 10752, 4867, 83, 238, 177, 43701, 32087, 107415, 147, 502, 1250, 3066, 123254, 26946, 3173, 18151, 20697, 30646, 98320, 17262, 4358, 149201, 104577, 978 ]
[ 0.171630859375, 0.017120361328125, 0.0992431640625, 0.2269287109375, 0.2032470703125, 0.0859375, 0.09423828125, 0.1964111328125, 0.11767578125, 0.23876953125, 0.010040283203125, 0.002532958984375, 0.0662841796875, 0.1009521484375, 0.0550537109375, 0.03387451171875, 0.012054443359375,...
embed
45596072_c0
45596072
prolog
0
Title: Gerrit: Can I specify reviewer (-2 ... +2) commit thresholds per directory? Problem title: Gerrit: Can I specify reviewer (-2 ... +2) commit thresholds per directory? Tags: gerrit, prolog Problem: Gerrit: Can I specify reviewer (-2 ... +2) commit thresholds per directory? I'm configuring a Gerrit server for code...
Gerrit: Can I specify reviewer (-2 ... +2) commit thresholds per directory? Gerrit: Can I specify reviewer (-2 ... +2) commit thresholds per directory? gerrit prolog Gerrit Can Gerrit: Can I specify reviewer (-2 ... +2) commit thresholds per directory? I'm configuring a Gerrit server for code review. I'd like an explic...
[ -0.0033721923828125, 0.002532958984375, 0.0167236328125, -0.0263671875, -0.01531982421875, 0.0106201171875, 0.003997802734375, 0.00066375732421875, -0.00750732421875, 0.0218505859375, 0.007781982421875, 0.029296875, -0.013671875, 0.000133514404296875, 0.0084228515625, 0.025634765625, ...
[ 8022, 2783, 4171, 40140, 18929, 8347, 56, 5428, 153, 94369, 375, 4007, 159399, 7, 16200, 117, 14364, 53, 4155, 502, 4867, 59994, 10723, 18151, 1884, 143726, 16711, 1614, 80581, 30675, 93392, 230648, 98865, 18, 56065, 38937, 31577, 25944, 11...
[ 0.134521484375, 0.2440185546875, 0.06317138671875, 0.1866455078125, 0.08148193359375, 0.22119140625, 0.14990234375, 0.1614990234375, 0.08270263671875, 0.22900390625, 0.0924072265625, 0.187255859375, 0.1807861328125, 0.025970458984375, 0.1890869140625, 0.0936279296875, 0.1441650390625...
embed
15510350_c0
15510350
prolog
0
Title: Removing element from a list Problem title: Removing element from a list Tags: prolog-dif, prolog Problem: Removing element from a list I know this question has been asked already, but I just want to ask about my specific implementation. I'm writing this function just to practice Prolog and better understand Pro...
Removing element from a list Removing element from a list prolog-dif prolog a Removing Ele Removing element from a list I know this question has been asked already, but I just want to ask about my specific implementation. I'm writing this function just to practice Prolog and better understand Prolog. Here's what I have...
[ 0.0019683837890625, 0.00994873046875, 0.00872802734375, 0.00136566162109375, -0.02197265625, 0.00921630859375, -0.007598876953125, 0.01141357421875, -0.00186920166015625, -0.005645751953125, 0.002960205078125, -0.0106201171875, 0.000621795654296875, 0.003692626953125, -0.005401611328125,...
[ 853, 432, 6496, 12830, 1295, 5303, 10, 502, 4867, 428, 420, 12701, 208124, 32354, 41361, 1250, 6528, 15190, 47, 3525, 35839, 2356, 2174, 3444, 154109, 959, 105950, 572, 28219, 18151, 18, 20697, 7279, 3229, 58359, 41872, 25647, 30022, 146, ...
[ 0.043426513671875, 0.1500244140625, 0.09271240234375, 0.2427978515625, 0.151611328125, 0.2154541015625, 0.01556396484375, 0.1192626953125, 0.1915283203125, 0.053619384765625, 0.099853515625, 0.2369384765625, 0.1212158203125, 0.1239013671875, 0.0384521484375, 0.08929443359375, 0.06677...
embed
33056750_c0
33056750
prolog
0
Title: How could I encode "implies" logic in LogicBlox? Problem title: How could I encode "implies" logic in LogicBlox? Tags: prolog, logicblox, logic, encoding, datalog Problem: How could I encode "implies" logic in LogicBlox? I would like to encode "implies" logic in LogicBlox. I have a predicate:...
How could I encode "implies" logic in LogicBlox? How could I encode "implies" logic in LogicBlox? prolog logicblox logic encoding datalog How LogicBlox Number n:i How could I encode "implies" logic in LogicBlox? I would like to encode "implies" logic in LogicBlox. I have a predicate: And I add some ...
[ 0.0150146484375, 0.00084686279296875, 0.009765625, 0.02880859375, -0.006103515625, 0.0400390625, 0.01141357421875, 0.009521484375, 0.01031494140625, -0.030029296875, 0.0216064453125, 0.0096435546875, -0.004302978515625, -0.0126953125, 0.00958251953125, 0.0181884765625, 0.0087890625, ...
[ 11249, 5809, 87, 22, 40899, 116120, 3387, 62775, 23, 50592, 238, 571, 365, 425, 502, 4867, 12986, 587, 2053, 103332, 653, 14, 1884, 1653, 2063, 67, 15190, 3444, 28282, 14012, 116, 136, 138, 85027, 34292, 6626, 79986, 4263, 83, 882, 2525...
[ 0.035919189453125, 0.07257080078125, 0.0178985595703125, 0.1263427734375, 0.2413330078125, 0.208984375, 0.2169189453125, 0.260986328125, 0.060455322265625, 0.1878662109375, 0.07025146484375, 0.05413818359375, 0.1727294921875, 0.12841796875, 0.06756591796875, 0.1243896484375, 0.160034...
embed
5222550_c0
5222550
prolog
0
Title: First use of SWI-Prolog Problem title: First use of SWI-Prolog Tags: prolog Problem: First use of SWI-Prolog I'm brand new to Prolog. I am simply trying to get some output from Prolog on Windows Vista. I have downloaded and installed Prolog 5.1; I chose the .pro file extension when installing (not to confuse wit...
First use of SWI-Prolog First use of SWI-Prolog prolog First SWI-Prolog test.pro ERROR Undefined DWIM First use of SWI-Prolog I'm brand new to Prolog. I am simply trying to get some output from Prolog on Windows Vista. I have downloaded and installed Prolog 5.1; I chose the .pro file extension when installing (not to c...
[ 0.0189208984375, 0.00762939453125, 0.0145263671875, 0.0179443359375, -0.0201416015625, 0.007476806640625, -0.00012302398681640625, 0.005157470703125, -0.0002880096435546875, -0.0250244140625, 0.0032958984375, 0.01544189453125, -0.031494140625, 0.00162506103515625, 0.020263671875, 0.008...
[ 23972, 4527, 159, 38969, 10752, 4867, 502, 3034, 3454, 151206, 24638, 79912, 5983, 30439, 17199, 3525, 1250, 31577, 2046, 140992, 3773, 49470, 7026, 20600, 68433, 19667, 5, 11435, 111938, 908, 141, 102158, 75935, 187040, 3884, 25632, 41929, 1...
[ 0.1026611328125, 0.1251220703125, 0.0885009765625, 0.246337890625, 0.1839599609375, 0.253173828125, 0.1474609375, 0.25390625, 0.2337646484375, 0.1265869140625, 0.0509033203125, 0.06597900390625, 0.190673828125, 0.13720703125, 0.199951171875, 0.080810546875, 0.1864013671875, 0.03564...
embed
27077920_c0
27077920
prolog
0
Title: Prolog: Split list at integer in list of lists Problem title: Prolog: Split list at integer in list of lists Tags: recursion, split, prolog, list Problem: Prolog: Split list at integer in list of lists I would like to split a list of words separated through integers into a list of lists. Sample query and expecte...
Prolog: Split list at integer in list of lists Prolog: Split list at integer in list of lists recursion split prolog list Prolog Split take1word Prolog: Split list at integer in list of lists I would like to split a list of words separated through integers into a list of lists. Sample query and expected result: The fol...
[ -0.00128173828125, -0.0203857421875, -0.009765625, 0.00909423828125, -0.033203125, 0.01953125, 0.0021514892578125, 0.024658203125, 0.000946044921875, -0.0172119140625, -0.0019073486328125, 0.001007080078125, 0.00144195556640625, 0.004150390625, 0.0167236328125, -0.0089111328125, 0.01...
[ 1250, 4867, 46474, 5303, 99, 892, 1505, 23, 111, 195625, 1830, 65450, 502, 5646, 418, 47416, 1884, 34153, 84797, 71, 8305, 26255, 3934, 33209, 41, 84751, 16750, 21771, 69307, 1916, 1632, 8108, 5117, 7103, 18151, 38310, 214, 4734, 8337, 98...
[ 0.1458740234375, 0.197021484375, 0.2188720703125, 0.19482421875, 0.0662841796875, 0.1024169921875, 0.12548828125, 0.0259552001953125, 0.0362548828125, 0.138671875, 0.0282745361328125, 0.2161865234375, 0.1187744140625, 0.114013671875, 0.035186767578125, 0.1490478515625, 0.054290771484...
embed
29272927_c0
29272927
prolog
0
Title: Enumerating binary trees in Prolog Problem title: Enumerating binary trees in Prolog Tags: catalan, prolog, instantiation-error, logic-programming Problem: Enumerating binary trees in Prolog I am trying to create Prolog rules to enumerate 'binary trees' in list form in Prolog. I am new to Prolog. A tree with 0 n...
Enumerating binary trees in Prolog Enumerating binary trees in Prolog catalan prolog instantiation-error logic-programming Enumerating Prolog ERROR Arguments Enumerating binary trees in Prolog I am trying to create Prolog rules to enumerate 'binary trees' in list form in Prolog. I am new to Prolog. A tree with 0 nodes ...
[ 0.0234375, 0.0028076171875, -0.00335693359375, 0.00567626953125, 0.0174560546875, 0.019775390625, -0.01171875, 0.00201416015625, 0.00579833984375, -0.0203857421875, 0.002838134765625, -0.037353515625, 0.01348876953125, -0.00921630859375, 0.0194091796875, -0.00775146484375, 0.03857421...
[ 357, 15537, 98767, 2394, 6635, 1360, 90, 1250, 4867, 377, 19642, 502, 14, 188800, 62775, 28966, 151206, 112140, 28282, 91736, 189085, 67, 19155, 1294, 5303, 3173, 3525, 53201, 757, 110, 201505, 678, 106, 116, 97370, 5813, 10484, 136, 171259...
[ 0.002838134765625, 0.1802978515625, 0.051239013671875, 0.1729736328125, 0.0916748046875, 0.2008056640625, 0.1021728515625, 0.1585693359375, 0.2265625, 0.0207672119140625, 0.0792236328125, 0.0357666015625, 0.000091552734375, 0.1024169921875, 0.038787841796875, 0.0193634033203125, 0.09...
embed
2102514_c0
2102514
prolog
0
Title: Prolog First Order Logic - Printing a Truth Table Problem title: Prolog First Order Logic - Printing a Truth Table Tags: boolean-expression, truthtable, prolog Problem: Prolog First Order Logic - Printing a Truth Table I have to write program that prints a truth table of expressions. So, I wrote the following fu...
Prolog First Order Logic - Printing a Truth Table Prolog First Order Logic - Printing a Truth Table boolean-expression truthtable prolog Prolog First Order Logic Printing Truth Table Prolog First Order Logic - Printing a Truth Table I have to write program that prints a truth table of expressions. So, I wrote the follo...
[ 0.01483154296875, 0.005035400390625, 0.01287841796875, 0.00732421875, 0.004058837890625, 0.0133056640625, 0.0023956298828125, -0.00946044921875, -0.0025634765625, 0.0025177001953125, -0.01513671875, 0.01251220703125, -0.0157470703125, 0.001373291015625, 0.0120849609375, 0.0172119140625...
[ 1250, 4867, 23972, 81206, 50592, 39754, 214, 184431, 112997, 238, 31, 34677, 204629, 85027, 22819, 502, 33022, 1528, 28412, 23180, 111, 125195, 54397, 25632, 32354, 2967, 241, 69696, 70541, 62, 136, 335, 959, 151575, 1284, 237, 27781, 60892, ...
[ 0.14013671875, 0.2296142578125, 0.103271484375, 0.157958984375, 0.1663818359375, 0.19482421875, 0.044342041015625, 0.20703125, 0.247802734375, 0.0489501953125, 0.055084228515625, 0.14306640625, 0.1776123046875, 0.19921875, 0.201904296875, 0.0985107421875, 0.133056640625, 0.12878417...
embed
29908207_c0
29908207
prolog
0
Title: How to compile VTProlog from source code? Problem title: How to compile VTProlog from source code? Tags: c, pascal, prolog Problem: How to compile VTProlog from source code? I am a student in Computer Science, and I am learning about logic programming with Prolog. I have found an interesting Prolog interpreter, ...
How to compile VTProlog from source code? How to compile VTProlog from source code? c pascal prolog source How VTProlog How to compile VTProlog from source code? I am a student in Computer Science, and I am learning about logic programming with Prolog. I have found an interesting Prolog interpreter, VTProlog ( https://...
[ 0.00836181640625, 0.01019287109375, 0.0024261474609375, 0.01092529296875, -0.00830078125, -0.011474609375, -0.006317138671875, 0.006256103515625, -0.0216064453125, -0.051513671875, 0.0047607421875, -0.011962890625, 0.00156402587890625, -0.002685546875, 0.0135498046875, -0.0044555664062...
[ 11249, 47, 9969, 1340, 310, 23658, 42, 14071, 1295, 31344, 18151, 32, 501, 452, 6827, 502, 4867, 9836, 23, 40139, 28745, 52080, 62775, 56037, 678, 1250, 14037, 142, 49041, 29481, 56, 32102, 98385, 77308, 13817, 47327, 3454, 73, 66456, 550...
[ 0.1263427734375, 0.0716552734375, 0.1937255859375, 0.173828125, 0.18505859375, 0.1461181640625, 0.1409912109375, 0.271240234375, 0.150634765625, 0.2454833984375, 0.23193359375, 0.0156402587890625, 0.10498046875, 0.10546875, 0.1298828125, 0.1566162109375, 0.259033203125, 0.104980468...
embed
50578302_c0
50578302
prolog
0
Title: how can i make my merge function show the possible combinations of lists in PROLOG Problem title: how can i make my merge function show the possible combinations of lists in PROLOG Tags: merge, prolog Problem: how can i make my merge function show the possible combinations of lists in PROLOG i am working on merg...
how can i make my merge function show the possible combinations of lists in PROLOG how can i make my merge function show the possible combinations of lists in PROLOG merge prolog PROLOG how can i make my merge function show the possible combinations of lists in PROLOG i am working on merging of lists in PROLOG. What ar...
[ -0.00055694580078125, 0.0303955078125, 0.01470947265625, -0.004119873046875, -0.006927490234375, 0.01263427734375, -0.031005859375, -0.0036163330078125, 0.0023956298828125, 0.00811767578125, -0.0064697265625, -0.0172119140625, 0.0125732421875, 0.0146484375, 0.01239013671875, 0.00155639...
[ 3642, 831, 3249, 759, 42564, 32354, 7639, 7722, 162515, 7, 111, 5303, 10514, 47510, 502, 4867, 23, 1143, 9966, 65572, 18151, 140992, 5036, 129745 ]
[ 0.048736572265625, 0.0167083740234375, 0.060516357421875, 0.0254669189453125, 0.239990234375, 0.1556396484375, 0.1405029296875, 0.16552734375, 0.1937255859375, 0.0755615234375, 0.00634765625, 0.185302734375, 0.1402587890625, 0.21484375, 0.0819091796875, 0.1439208984375, 0.02081298828...
embed
52924550_c0
52924550
prolog
0
Title: Computing a Matrix Vector Product in Prolog Simply Problem title: Computing a Matrix Vector Product in Prolog Simply Tags: prolog Problem: Computing a Matrix Vector Product in Prolog Simply I'm very new to prolog, specifically, SWI-PL. I've seen several related questions about computing matrix-vector products. I...
Computing a Matrix Vector Product in Prolog Simply Computing a Matrix Vector Product in Prolog Simply prolog Computing Matrix Vector Product Prolog Simply Result Prod Remaining Computing a Matrix Vector Product in Prolog Simply I'm very new to prolog, specifically, SWI-PL. I've seen several related questions about comp...
[ 0.000385284423828125, 0.025390625, -0.00146484375, 0.0037384033203125, -0.01434326171875, -0.0004711151123046875, -0.01611328125, 0.0128173828125, -0.01031494140625, -0.03369140625, -0.00433349609375, 0.004974365234375, -0.016845703125, -0.00106048583984375, -0.031982421875, -0.0039367...
[ 159415, 194234, 2609, 18770, 73111, 23, 1250, 4867, 55331, 538, 214, 502, 126684, 71, 192, 4552, 3525, 159, 38969, 21130, 17582, 242122, 50944, 425, 272, 38742, 37202, 96704, 35773, 26267, 5117, 24702, 1577, 208124, 20633, 12996, 5809, 2046, ...
[ 0.2008056640625, 0.1988525390625, 0.215087890625, 0.1734619140625, 0.25048828125, 0.04437255859375, 0.1622314453125, 0.2354736328125, 0.1236572265625, 0.02685546875, 0.0040283203125, 0.105712890625, 0.146728515625, 0.010772705078125, 0.04962158203125, 0.009796142578125, 0.02145385742...
embed
59122409_c0
59122409
prolog
0
Title: Quicksort using the second element as a pivot (Prolog) Problem title: Quicksort using the second element as a pivot (Prolog) Tags: prolog Problem: Quicksort using the second element as a pivot (Prolog) I want to implement Quicksort in Prolog using the second element of the list as a pivot but I'm not sure how I ...
Quicksort using the second element as a pivot (Prolog) Quicksort using the second element as a pivot (Prolog) prolog the Quicksort Prolog Pivot Tail Sorted Less Greater SortedLess SortedGreater Quicksort using the second element as a pivot (Prolog) I want to implement Quicksort in Prolog using the second element of the...
[ -0.00848388671875, 0.003662109375, 0.0152587890625, -0.015869140625, -0.007476806640625, 0.0303955078125, -0.0172119140625, -0.01171875, 0.00885009765625, 0.0025482177734375, 0.0299072265625, 0.0234375, -0.0164794921875, -0.031494140625, -0.006256103515625, 0.00482177734375, -0.00004...
[ 89038, 62351, 17368, 17932, 12830, 237, 80953, 18, 10752, 4867, 502, 1250, 436, 5777, 1218, 379, 53666, 1734, 32774, 56, 68016, 46429, 3444, 29479, 23, 5303, 10, 9077, 33636, 107730, 3934, 80836, 207263, 683, 58745, 4527, 4358, 5122, 77947,...
[ 0.2059326171875, 0.287841796875, 0.04803466796875, 0.1722412109375, 0.1905517578125, 0.049102783203125, 0.2408447265625, 0.15283203125, 0.1075439453125, 0.2342529296875, 0.09814453125, 0.15185546875, 0.0308990478515625, 0.182861328125, 0.147705078125, 0.1451416015625, 0.1834716796875...
embed
61059057_c0
61059057
prolog
0
Title: Prolog pack_install SSL Error to swi-prolog.org Problem title: Prolog pack_install SSL Error to swi-prolog.org Tags: swi-prolog, download, installation, module, prolog Problem: Prolog pack_install SSL Error to swi-prolog.org I'm not sure if this is the right place to ask this question: I am trying to run a prolo...
Prolog pack_install SSL Error to swi-prolog.org Prolog pack_install SSL Error to swi-prolog.org swi-prolog download installation module prolog Prolog pack_install SSL Error swi-prolog.org use_module source_link Goal atoms:use_module Contacting www.swi-prolog.org ssl3_get_server_certificate Prolog pack_install SSL Error...
[ 0.029296875, 0.0034027099609375, 0.00787353515625, 0.00762939453125, -0.0194091796875, -0.01416015625, -0.00177764892578125, -0.01123046875, -0.008056640625, -0.0194091796875, 0.02001953125, -0.02197265625, -0.002197265625, 0.0089111328125, -0.0025634765625, 0.020263671875, -0.007415...
[ 1250, 4867, 43824, 80383, 103527, 212059, 47, 91, 2452, 3454, 1478, 7026, 59720, 88996, 502, 4527, 83279, 31344, 10187, 2016, 289, 34627, 4032, 27627, 24861, 363, 39642, 3443, 61093, 31577, 11675, 11435, 150, 2844, 8, 5259, 86595, 25632, 13...
[ 0.1878662109375, 0.2578125, 0.2052001953125, 0.16650390625, 0.262451171875, 0.21044921875, 0.07861328125, 0.0312347412109375, 0.186279296875, 0.158203125, 0.1539306640625, 0.0653076171875, 0.1016845703125, 0.1195068359375, 0.15087890625, 0.032958984375, 0.09283447265625, 0.09838867...
embed
34707774_c0
34707774
prolog
0
Title: Coloring of a non-oriented planar graph in Prolog Problem title: Coloring of a non-oriented planar graph in Prolog Tags: prolog, graph-theory, graph-coloring Problem: Coloring of a non-oriented planar graph in Prolog I have a program for coloring graphs with 3 colors, neighbouring nodes need to have different co...
Coloring of a non-oriented planar graph in Prolog Coloring of a non-oriented planar graph in Prolog prolog graph-theory graph-coloring Coloring Prolog V-C V1-C1 List Len Coloring of a non-oriented planar graph in Prolog I have a program for coloring graphs with 3 colors, neighbouring nodes need to have different colors...
[ -0.0238037109375, 0.0048828125, -0.013916015625, 0.009521484375, 0.00982666015625, 0.009765625, -0.0125732421875, 0.01446533203125, 0.0002994537353515625, -0.041259765625, 0.00634765625, -0.00799560546875, 0.005859375, -0.00958251953125, 0.008056640625, 0.0167236328125, -0.0051269531...
[ 51193, 214, 351, 49133, 1774, 147, 41382, 23, 1250, 4867, 502, 46133, 310, 441, 32036, 18226, 1528, 10576, 678, 138, 104988, 6958, 38648, 110, 988, 3871, 12921, 2967, 20697, 4734, 100, 8951, 80581, 35782, 177261, 645, 118664, 121742, 4488, ...
[ 0.182861328125, 0.094970703125, 0.1092529296875, 0.12939453125, 0.0885009765625, 0.0804443359375, 0.1805419921875, 0.014739990234375, 0.140380859375, 0.22412109375, 0.0802001953125, 0.1163330078125, 0.08648681640625, 0.002105712890625, 0.05242919921875, 0.1114501953125, 0.11474609375...
embed
16547822_c0
16547822
prolog
0
Title: prolog: rule to check pythagorean triplet? Problem title: prolog: rule to check pythagorean triplet? Tags: prolog, pythagorean, math Problem: prolog: rule to check pythagorean triplet? Prolog Keeps saying 'no' to me.... :( I am very new to prolog, I have a basic question: So I'm trying to produce a simple rule t...
prolog: rule to check pythagorean triplet? prolog: rule to check pythagorean triplet? prolog pythagorean math GNU Prolog Daniel Diaz Copyright prolog: rule to check pythagorean triplet? Prolog Keeps saying 'no' to me.... :( I am very new to prolog, I have a basic question: So I'm trying to produce a simple rule that ch...
[ 0.0167236328125, 0.01251220703125, 0.0179443359375, 0.010009765625, -0.0177001953125, 0.02978515625, -0.01300048828125, 0.004241943359375, 0.00927734375, -0.009033203125, 0.00445556640625, -0.002960205078125, -0.0111083984375, -0.0169677734375, -0.00091552734375, 0.0101318359375, 0.0...
[ 502, 4867, 79986, 12765, 17198, 3238, 6504, 5073, 162738, 18, 48909, 165132, 1250, 11555, 4512, 169, 4189, 83041, 54433, 157, 163, 62822, 31577, 27489, 8781, 2174, 17262, 101935, 11764, 140909, 5609, 7108, 109217, 1927, 134234, 11, 4028, 2037...
[ 0.1328125, 0.223388671875, 0.1788330078125, 0.2110595703125, 0.07342529296875, 0.125732421875, 0.13623046875, 0.1116943359375, 0.2161865234375, 0.14599609375, 0.07781982421875, 0.1007080078125, 0.16064453125, 0.0152740478515625, 0.0166473388671875, 0.008941650390625, 0.12744140625, ...
embed
58985904_c0
58985904
prolog
0
Title: Fold-add all items in List, using Prolog Problem title: Fold-add all items in List, using Prolog Tags: recursion, prolog, list, addition Problem: Fold-add all items in List, using Prolog I'm trying to write a function that recursively adds the first two items in a List, and returns when one item remains. Example...
Fold-add all items in List, using Prolog Fold-add all items in List, using Prolog recursion prolog list addition Prolog Fold-add List Fold-add all items in List, using Prolog I'm trying to write a function that recursively adds the first two items in a List, and returns when one item remains. Example: (Steps here would...
[ 0.00054931640625, 0.00787353515625, 0.00958251953125, 0.00823974609375, -0.0194091796875, 0.01513671875, -0.0196533203125, -0.000059604644775390625, 0.0034332275390625, -0.0125732421875, 0.044189453125, -0.03076171875, -0.01251220703125, 0.030517578125, 0.0125732421875, -0.007019042968...
[ 30077, 71, 11, 4028, 756, 55769, 23, 32036, 17368, 1250, 4867, 195625, 1830, 502, 5303, 66044, 31577, 33022, 32354, 5844, 15190, 5117, 6626, 30646, 3229, 1632, 35735, 47143, 89536, 191644, 133063, 82449, 150643, 63709, 7086, 20653, 113660, 18...
[ 0.1729736328125, 0.054656982421875, 0.08575439453125, 0.1866455078125, 0.1358642578125, 0.1785888671875, 0.07476806640625, 0.1878662109375, 0.036895751953125, 0.1285400390625, 0.195556640625, 0.173583984375, 0.040557861328125, 0.111572265625, 0.14990234375, 0.1209716796875, 0.0392761...
embed
13577872_c0
13577872
prolog
0
Title: How to find the minimum value of a prolog variable in O(n) time without high order procedures Problem title: How to find the minimum value of a prolog variable in O(n) time without high order procedures Tags: minimum, prolog Problem: How to find the minimum value of a prolog variable in O(n) time without high or...
How to find the minimum value of a prolog variable in O(n) time without high order procedures How to find the minimum value of a prolog variable in O(n) time without high order procedures minimum prolog How How to find the minimum value of a prolog variable in O(n) time without high order procedures So I have an assign...
[ 0.005859375, 0.0048828125, 0.0279541015625, -0.00823974609375, -0.007171630859375, -0.0098876953125, 0.006317138671875, -0.002777099609375, 0.01397705078125, -0.035400390625, 0.01080322265625, 0.0003452301025390625, -0.0030059814453125, -0.03955078125, 0.0159912109375, 0.0135498046875,...
[ 11249, 7413, 70, 15440, 34292, 502, 4867, 77336, 180, 19, 1733, 15490, 12989, 50491, 11192, 95486, 4488, 55681, 2967, 31577, 163846, 91736, 3444, 13267, 35971, 138, 37397, 190, 3082, 361, 116, 65395, 615, 3917, 1957, 20594, 4420, 125728, 15...
[ 0.041778564453125, 0.12646484375, 0.016204833984375, 0.25927734375, 0.2025146484375, 0.1751708984375, 0.234130859375, 0.2332763671875, 0.1361083984375, 0.061737060546875, 0.1619873046875, 0.117431640625, 0.1583251953125, 0.112060546875, 0.0230712890625, 0.09906005859375, 0.0053100585...
embed
33906575_c0
33906575
prolog
0
Title: No permission to satisfy static procedure setof/3 in prolog Problem title: No permission to satisfy static procedure setof/3 in prolog Tags: prolog-setof, prolog Problem: No permission to satisfy static procedure setof/3 in prolog I'm using SWI prolog and was wondering how I can use setof in my source code. I ha...
No permission to satisfy static procedure setof/3 in prolog No permission to satisfy static procedure setof/3 in prolog prolog-setof prolog prolog_example.pl X-Y ListOfMatches ERROR prolog_example.pl:37 No permission to satisfy static procedure setof/3 in prolog I'm using SWI prolog and was wondering how I can use seto...
[ 0.028076171875, 0.007080078125, 0.042236328125, -0.00537109375, -0.0172119140625, -0.00341796875, -0.029052734375, 0.0002269744873046875, 0.013427734375, -0.04541015625, -0.0057373046875, 0.0001239776611328125, 0.00182342529296875, -0.017578125, 0.00885009765625, 0.000911712646484375, ...
[ 438, 168081, 40407, 53, 201939, 50491, 5423, 4390, 18113, 502, 4867, 3509, 3355, 11, 33209, 2424, 1193, 1723, 32036, 132887, 79520, 17007, 151206, 30225, 23, 159, 38969, 4527, 31344, 18151, 11435, 15824, 3444, 2046, 756, 65272, 136, 144477, ...
[ 0.0684814453125, 0.2333984375, 0.1776123046875, 0.058074951171875, 0.225830078125, 0.173095703125, 0.2005615234375, 0.2783203125, 0.2337646484375, 0.1534423828125, 0.201416015625, 0.1544189453125, 0.060638427734375, 0.0845947265625, 0.1038818359375, 0.11181640625, 0.03680419921875, ...
embed
76013232_c1
76013232
prolog
1
the Blue shirt. The one that likes Painting is somewhere between the DJ wearing Green and the DJ wearing Blue, in that order. At the fifth position is the DJ who plays Drum and bass. In the middle is the DJ who is going to play on the Asgard stage. The one who plays Trance is next to the one who plays Dubstep. The Can...
the Blue shirt. The one that likes Painting is somewhere between the DJ wearing Green and the DJ wearing Blue, in that order. At the fifth position is the DJ who plays Drum and bass. In the middle is the DJ who is going to play on the Asgard stage. The one who plays Trance is next to the one who plays Dubstep. The Can...
[ -0.0081787109375, 0.00147247314453125, 0.021728515625, 0.014404296875, -0.00994873046875, -0.001739501953125, -0.014892578125, 0.0185546875, 0.0128173828125, -0.01953125, -0.00469970703125, 0.01190185546875, 0.0263671875, 0.0238037109375, -0.00604248046875, -0.0201416015625, -0.02209...
[ 70, 22928, 38184, 5, 1632, 450, 1884, 7, 147854, 214, 83, 174653, 17721, 22828, 179493, 15497, 4, 23, 12989, 1913, 809, 2480, 127, 19069, 2750, 11301, 131837, 136, 4950, 86991, 7730, 47, 98, 1301, 42077, 36541, 581, 60532, 329, 11737, 3...
[ 0.07391357421875, 0.2135009765625, 0.18994140625, 0.0443115234375, 0.049102783203125, 0.0478515625, 0.200927734375, 0.02178955078125, 0.186279296875, 0.13818359375, 0.04278564453125, 0.1317138671875, 0.1473388671875, 0.272705078125, 0.102783203125, 0.0982666015625, 0.0161895751953125...
embed
37480427_c1
37480427
prolog
1
,NY,NewY), \+ permutation(NewY,_Y) | rect(Hint,c(_X,NewY),S). rect(_,c(X,Y),s(W,H))\rect(Hint,c(_X,_Y),S)<=> number(X),number(Y),number(W),number(H),\+ number(_X),number(_Y), _Y >= Y, _Y < Y+H, Z is X+W-1, numlist(X,Z,NX), subtract(_X,NX,NewX), \+ permutation(NewX,_X) | rect(Hint,c(NewX,_Y),S). % better version of equa...
,NY,NewY), \+ permutation(NewY,_Y) | rect(Hint,c(_X,NewY),S). rect(_,c(X,Y),s(W,H))\rect(Hint,c(_X,_Y),S)<=> number(X),number(Y),number(W),number(H),\+ number(_X),number(_Y), _Y >= Y, _Y < Y+H, Z is X+W-1, numlist(X,Z,NX), subtract(_X,NX,NewX), \+ permutation(NewX,_X) | rect(Hint,c(NewX,_Y),S). % better version of equa...
[ -0.006256103515625, 0.011962890625, 0.034423828125, 0.02294921875, -0.00732421875, 0.007781982421875, -0.0238037109375, -0.01068115234375, 0.0279541015625, 0.0322265625, -0.00069427490234375, 0.00167083740234375, 0.024169921875, 0.0022430419921875, 0.0045166015625, 0.006103515625, 0....
[ 25182, 46568, 1723, 41872, 1328, 117, 561, 22062, 454, 58745, 173247, 841, 4288, 1542, 294, 6, 1456, 14012, 2606, 990, 567, 1193, 5759, 13269, 6562, 166989, 1614, 39989, 1745, 11522, 11389, 105950, 618, 627, 154109, 101935, 64457, 5303, 691...
[ 0.132568359375, 0.126953125, 0.1353759765625, 0.00372314453125, 0.1502685546875, 0.09796142578125, 0.182373046875, 0.08251953125, 0.00030517578125, 0.078125, 0.1668701171875, 0.10467529296875, 0.1002197265625, 0.0821533203125, 0.039215087890625, 0.002593994140625, 0.0833740234375, ...
embed
75147122_c0
75147122
prolog
0
Title: How do I fix the following error in my prolog code for the queen problem Problem title: How do I fix the following error in my prolog code for the queen problem Tags: prolog, n-queens Problem: How do I fix the following error in my prolog code for the queen problem I can't figure out why my code isn't working. I...
How do I fix the following error in my prolog code for the queen problem How do I fix the following error in my prolog code for the queen problem prolog n-queens How X-Y n_queens Board How do I fix the following error in my prolog code for the queen problem I can't figure out why my code isn't working. I want the code ...
[ 0.007415771484375, 0.008056640625, 0.03076171875, 0.000606536865234375, 0.004058837890625, -0.01055908203125, -0.0032958984375, -0.011962890625, -0.00360107421875, -0.054931640625, -0.0057373046875, 0.003448486328125, 0.0184326171875, 0.005706787109375, -0.0191650390625, -0.00567626953...
[ 30022, 25632, 18499, 502, 4867, 18151, 41, 33, 2967, 653, 944, 1755, 11249, 1193, 9, 1723, 454, 62554, 20697, 7722, 162515, 541, 425, 839, 290, 7, 24351, 304, 201, 106, 138, 617, 98423, 153939, 33636, 3365, 15537, 158012, 8305, 5303, 15...
[ 0.1300048828125, 0.053955078125, 0.17138671875, 0.1492919921875, 0.1953125, 0.1846923828125, 0.1783447265625, 0.16748046875, 0.1649169921875, 0.0867919921875, 0.1927490234375, 0.173095703125, 0.037933349609375, 0.047027587890625, 0.021270751953125, 0.136474609375, 0.001800537109375, ...
embed
32618891_c0
32618891
prolog
0
Title: Prolog Knowledge bases Unification Problem title: Prolog Knowledge bases Unification Tags: prolog Problem: Prolog Knowledge bases Unification I have to make the following problem in prolog, I have to build the rules: recetar_a(X,Y) , alivia(X,Y) and enfermo_de(X,Y) I know my solution for enfermo_de(X,Y) works, b...
Prolog Knowledge bases Unification Prolog Knowledge bases Unification prolog Prolog Knowledge Unification recetar_a enfermo_de tiene_sintoma sintoma_de Prolog Knowledge bases Unification I have to make the following problem in prolog, I have to build the rules: recetar_a(X,Y) , alivia(X,Y) and enfermo_de(X,Y) I know my...
[ 0.028076171875, 0.01080322265625, 0.0233154296875, 0.031005859375, 0.000888824462890625, -0.0050048828125, -0.0225830078125, 0.020263671875, 0.010009765625, -0.0146484375, 0.009521484375, 0.005859375, -0.000476837158203125, 0.0135498046875, 0.0054931640625, -0.01007080078125, 0.03637...
[ 1250, 4867, 191428, 51039, 992, 41274, 502, 100442, 42, 11, 22, 122680, 112, 5904, 1596, 63348, 106658, 192, 2967, 45367, 91736, 1542, 1723, 923, 3459, 29806, 43240, 3714, 51347, 26785, 55681, 4358, 3642, 70, 51, 6097, 50218, 91084, 12638, ...
[ 0.14697265625, 0.23095703125, 0.1787109375, 0.1766357421875, 0.174560546875, 0.2098388671875, 0.1119384765625, 0.19384765625, 0.175048828125, 0.12548828125, 0.08447265625, 0.2646484375, 0.1778564453125, 0.1212158203125, 0.09393310546875, 0.1220703125, 0.1419677734375, 0.02600097656...
embed
53549948_c0
53549948
prolog
0
Title: Collapsing pairs of duplicates in Prolog Problem title: Collapsing pairs of duplicates in Prolog Tags: prolog Problem: Collapsing pairs of duplicates in Prolog I'm trying to write a program in Prolog to collapse pairs of duplicates when they are next to each other. Here's some examples, [1,2,2,3,4] -> [1,2,3,4] ...
Collapsing pairs of duplicates in Prolog Collapsing pairs of duplicates in Prolog prolog Collapsing Prolog Look Collapsing pairs of duplicates in Prolog I'm trying to write a program in Prolog to collapse pairs of duplicates when they are next to each other. Here's some examples, [1,2,2,3,4] -> [1,2,3,4] [1,2,2,2,3,4] ...
[ 0.006195068359375, 0.01904296875, 0.01324462890625, 0.007568359375, -0.009765625, 0.0341796875, -0.01483154296875, -0.00154876708984375, -0.00201416015625, 0.006988525390625, -0.00555419921875, 0.02490234375, -0.0034332275390625, -0.01141357421875, 0.0036468505859375, 0.021484375, 0....
[ 11554, 96091, 214, 80836, 7, 111, 171763, 1636, 23, 1250, 4867, 502, 60818, 31577, 33022, 1528, 47, 3365, 127966, 3229, 11737, 12638, 3789, 3060, 27781, 133063, 304, 82449, 33079, 3370, 33342, 1884, 903, 5351, 62775, 5608, 4488, 4552, 3525,...
[ 0.151123046875, 0.25341796875, 0.0567626953125, 0.2481689453125, 0.091796875, 0.03607177734375, 0.270751953125, 0.147216796875, 0.072265625, 0.1920166015625, 0.254150390625, 0.136962890625, 0.2109375, 0.08056640625, 0.08380126953125, 0.1353759765625, 0.08905029296875, 0.16320800781...
embed
63382672_c0
63382672
prolog
0
Title: How Can I Remove the 1st Matching Element From a List Without a Cut Problem title: How Can I Remove the 1st Matching Element From a List Without a Cut Tags: prolog Problem: How Can I Remove the 1st Matching Element From a List Without a Cut I'm trying to delete the first matching item from a list without using b...
How Can I Remove the 1st Matching Element From a List Without a Cut How Can I Remove the 1st Matching Element From a List Without a Cut prolog a cut How Can Remove Matching Element List Without delete_one Tail Tail1 delete_one_no_cut How Can I Remove the 1st Matching Element From a List Without a Cut I'm trying to dele...
[ 0.011962890625, 0.0361328125, 0.007080078125, 0.00897216796875, -0.005157470703125, 0.0035858154296875, 0.000202178955078125, -0.0020599365234375, 0.0272216796875, -0.0262451171875, 0.004180908203125, 0.00531005859375, -0.01519775390625, -0.01239013671875, 0.01141357421875, -0.00576782...
[ 11249, 4171, 87, 181139, 106, 271, 67407, 214, 48325, 28090, 32036, 177417, 3003, 18, 502, 4867, 59226, 154109, 3630, 1218, 379, 418, 157, 19774, 31577, 5117, 14858, 35735, 5303, 15490, 4420, 125728, 74918, 12830, 7279, 22691, 51347, 43240, ...
[ 0.0305633544921875, 0.0731201171875, 0.0232391357421875, 0.1796875, 0.10137939453125, 0.129150390625, 0.228515625, 0.1590576171875, 0.175048828125, 0.08294677734375, 0.19384765625, 0.134521484375, 0.1385498046875, 0.0380859375, 0.10638427734375, 0.1461181640625, 0.1619873046875, 0....
embed
27199774_c0
27199774
prolog
0
Title: Predicate that turns an expression into right bracketed form? Problem title: Predicate that turns an expression into right bracketed form? Tags: prolog Problem: Predicate that turns an expression into right bracketed form? I am trying to write a predicate rightBrack(E1, E2) where E2 is the expression E1 but in r...
Predicate that turns an expression into right bracketed form? Predicate that turns an expression into right bracketed form? prolog Predicate Expr Predicate that turns an expression into right bracketed form? I am trying to write a predicate rightBrack(E1, E2) where E2 is the expression E1 but in right bracketed form. A...
[ 0.005584716796875, -0.01263427734375, 0.01092529296875, 0.00830078125, 0.021484375, 0.0211181640625, 0.001434326171875, 0.0021514892578125, 0.0145263671875, -0.017822265625, 0.00927734375, 0.0027313232421875, -0.01507568359375, 0.0023651123046875, 0.00885009765625, 0.00811767578125, ...
[ 7145, 2063, 67, 450, 15504, 125195, 3934, 7108, 1620, 27853, 297, 3173, 502, 4867, 60075, 42, 31577, 33022, 1653, 571, 86147, 647, 418, 241, 10461, 304, 61924, 15190, 4028, 4353, 16060, 69829, 99217, 124534, 5608, 104577, 1250, 37842, 32562...
[ 0.1650390625, 0.2215576171875, 0.10552978515625, 0.0267181396484375, 0.115478515625, 0.263427734375, 0.05340576171875, 0.1805419921875, 0.1583251953125, 0.142822265625, 0.0660400390625, 0.13525390625, 0.106689453125, 0.1873779296875, 0.1092529296875, 0.1124267578125, 0.03143310546875...
embed
63574077_c1
63574077
prolog
1
00013, '2017-11-08'|...], [100014|...], [...|...]|...]. But after doesn't work: ?- after(ID,'2000-01-01',Category,Rows). false. Note that the only difference between these two rules is the @< vs. @> operator. I've tried changing the order of the operands around, and changing the order of the statements in the rule, but...
00013, '2017-11-08'|...], [100014|...], [...|...]|...]. But after doesn't work: ?- after(ID,'2000-01-01',Category,Rows). false. Note that the only difference between these two rules is the @< vs. @> operator. I've tried changing the order of the operands around, and changing the order of the statements in the rule, but...
[ 0.00225830078125, 0.001312255859375, 0.01373291015625, 0.0272216796875, -0.0036468505859375, 0.002655029296875, -0.01519775390625, 0.015380859375, 0.019287109375, -0.004974365234375, 0.0079345703125, -0.0277099609375, 0.0011444091796875, -0.022216796875, 0.0018157958984375, 0.004089355...
[ 2445, 2681, 3259, 36099, 8318, 14105, 2592, 4966, 7103, 22027, 18, 4488, 705, 9, 7146, 13821, 45669, 6746, 76775, 3081, 1294, 12724, 19725, 98320, 4734, 60212, 17721, 6097, 6626, 91736, 1374, 16093, 20209, 2740, 39933, 37842, 151134, 12989, ...
[ 0.16796875, 0.13427734375, 0.142578125, 0.0709228515625, 0.07891845703125, 0.1195068359375, 0.09625244140625, 0.0269775390625, 0.2413330078125, 0.0972900390625, 0.1055908203125, 0.153564453125, 0.0325927734375, 0.00408935546875, 0.13330078125, 0.1766357421875, 0.0948486328125, 0.11...
embed
33469487_c1
33469487
prolog
1
(tom(W),jim(X),jack(Y),bill(Z),c(C)), state(tom(W1),jim(X),jack(Y),bill(Z),c(C1))):- ((canoe(W1),W=r,W=C,C1=m);(canoe(W),W1=l,W1=C1)). move(state(tom(W),jim(X),jack(Y),bill(Z),c(C)), state(tom(W),jim(X1),jack(Y),bill(Z),c(C1))):- ((canoe(X1),X=r,X=C,C1=m);(canoe(X),X1=l,X1=C1)). move(state(tom(W),jim(X),jack(Y),bill(Z)...
(tom(W),jim(X),jack(Y),bill(Z),c(C)), state(tom(W1),jim(X),jack(Y),bill(Z),c(C1))):- ((canoe(W1),W=r,W=C,C1=m);(canoe(W),W1=l,W1=C1)). move(state(tom(W),jim(X),jack(Y),bill(Z),c(C)), state(tom(W),jim(X1),jack(Y),bill(Z),c(C1))):- ((canoe(X1),X=r,X=C,C1=m);(canoe(X),X1=l,X1=C1)). move(state(tom(W),jim(X),jack(Y),bill(Z)...
[ 0.006866455078125, 0.006622314453125, -0.005645751953125, 0.031494140625, -0.00909423828125, 0.012451171875, -0.035888671875, -0.002166748046875, 0.00994873046875, -0.0031890869140625, 0.00836181640625, 0.00469970703125, 0.004608154296875, -0.01141357421875, -0.012939453125, -0.0054931...
[ 15, 5928, 132, 1456, 247, 20304, 1542, 135758, 1723, 2721, 141, 1511, 238, 441, 16, 11341, 17727, 4, 418, 32149, 12, 9, 60494, 38938, 13, 1369, 42, 39, 3142, 194, 25813, 61340 ]
[ 0.077392578125, 0.2239990234375, 0.0343017578125, 0.19970703125, 0.1231689453125, 0.25634765625, 0.17236328125, 0.2088623046875, 0.1591796875, 0.1646728515625, 0.1358642578125, 0.1646728515625, 0.10345458984375, 0.10076904296875, 0.003265380859375, 0.1956787109375, 0.143310546875, ...
embed
26415643_c0
26415643
prolog
0
Title: Nested pairs using operator hyphen Problem title: Nested pairs using operator hyphen Tags: prolog Problem: Nested pairs using operator hyphen I want to represent edges as pairs using the hyphen operator, i.e., From-To . I want to represent nodes as pairs as well (denoting FCA concepts), i.e., Extent-Intent . So ...
Nested pairs using operator hyphen Nested pairs using operator hyphen prolog operator Nested From-To Extent-Intent Y1-Y2-Y3 current_op Nested pairs using operator hyphen I want to represent edges as pairs using the hyphen operator, i.e., From-To . I want to represent nodes as pairs as well (denoting FCA concepts), i.e....
[ 0.004852294921875, 0.00970458984375, 0.00653076171875, 0.0208740234375, 0.01519775390625, 0.0084228515625, -0.005096435546875, -0.008056640625, 0.004638671875, -0.0262451171875, -0.004852294921875, -0.0172119140625, -0.0035858154296875, -0.0172119140625, -0.01025390625, 0.0006790161132...
[ 28701, 71, 80836, 17368, 39933, 2119, 88322, 502, 4867, 28090, 7763, 5443, 25352, 4153, 990, 20268, 1723, 18504, 363, 43581, 2146, 3444, 33636, 121303, 7, 237, 110, 988, 15161, 284, 23755, 1620, 27853, 125195, 155965, 6392, 6332, 11001, 181...
[ 0.26220703125, 0.1298828125, 0.2244873046875, 0.07379150390625, 0.2392578125, 0.1356201171875, 0.2255859375, 0.1043701171875, 0.1717529296875, 0.1873779296875, 0.261962890625, 0.070068359375, 0.1822509765625, 0.0963134765625, 0.07012939453125, 0.0595703125, 0.05584716796875, 0.0853...
embed
51290087_c0
51290087
prolog
0
Title: Is there a way to, using library functions, remove the last element of a list? Problem title: Is there a way to, using library functions, remove the last element of a list? Tags: prolog Problem: Is there a way to, using library functions, remove the last element of a list? Say that I want to remove the last elem...
Is there a way to, using library functions, remove the last element of a list? Is there a way to, using library functions, remove the last element of a list? prolog library WithoutLastElement List list_butlast list_butlast_prev Is there a way to, using library functions, remove the last element of a list? Say that I wa...
[ -0.000885009765625, 0.026123046875, 0.002716064453125, 0.012451171875, -0.012939453125, -0.003448486328125, -0.01202392578125, 0.004547119140625, 0.019775390625, -0.0390625, 0.00927734375, -0.010498046875, -0.013916015625, -0.00091552734375, -0.005615234375, -0.00518798828125, 0.0181...
[ 10, 3917, 47, 17368, 35773, 1294, 32354, 87388, 4568, 12830, 111, 5303, 502, 4867, 177417, 2729, 271, 647, 19929, 32036, 8789, 19777, 4692, 334, 2685, 3444, 114689, 71, 18113, 31358, 50155, 44126, 38496, 1542, 116, 33022, 10002, 1653, 2063,...
[ 0.0272216796875, 0.1334228515625, 0.056640625, 0.0860595703125, 0.1668701171875, 0.12451171875, 0.170654296875, 0.2327880859375, 0.2464599609375, 0.2203369140625, 0.08868408203125, 0.2108154296875, 0.085693359375, 0.15478515625, 0.10223388671875, 0.139892578125, 0.1187744140625, 0....
embed
36970306_c0
36970306
prolog
0
Title: Prolog Lists and Internal Variables Problem title: Prolog Lists and Internal Variables Tags: recursion, prolog, list Problem: Prolog Lists and Internal Variables I have a created a predicate that finds a path through a maze, this predicate uses recursion and five parameters, and one of which is a list that retur...
Prolog Lists and Internal Variables Prolog Lists and Internal Variables recursion prolog list Prolog Lists Internal Variables _G2612 Colour Visited Route Colour2 Visited2 Prolog Lists and Internal Variables I have a created a predicate that finds a path through a maze, this predicate uses recursion and five parameters,...
[ 0.023193359375, 0.01031494140625, -0.0023345947265625, 0.016357421875, 0.00994873046875, 0.037109375, -0.01226806640625, 0.004913330078125, 0.0087890625, -0.031005859375, 0.0283203125, 0.00152587890625, -0.009033203125, 0.0255126953125, 0.022705078125, 0.01092529296875, 0.00616455078...
[ 1250, 4867, 32036, 136, 106745, 111477, 13566, 141, 195625, 1830, 502, 5303, 724, 4046, 1530, 196431, 98684, 106015, 304, 297, 75935, 1653, 2063, 67, 7413, 60875, 8305, 291, 731, 4527, 43606, 171859, 30646, 14037, 26818, 43240, 5885, 26785, ...
[ 0.1815185546875, 0.2440185546875, 0.2025146484375, 0.0445556640625, 0.1929931640625, 0.1826171875, 0.09423828125, 0.0203094482421875, 0.1829833984375, 0.035400390625, 0.1341552734375, 0.161865234375, 0.009765625, 0.10101318359375, 0.0863037109375, 0.129638671875, 0.1455078125, 0.13...
embed
23038293_c0
23038293
prolog
0
Title: Prolog not showing output in correct format Problem title: Prolog not showing output in correct format Tags: list, output, prolog Problem: Prolog not showing output in correct format I am new to Prolog and I am trying to remove the last element from a list. The code I have tried: removeLast([],[_]). removeLast([...
Prolog not showing output in correct format Prolog not showing output in correct format list output prolog Prolog _G299 _G302 _G305 _G3248 Prolog not showing output in correct format I am new to Prolog and I am trying to remove the last element from a list. The code I have tried: Obtained from here . I executed the cod...
[ 0.017822265625, 0.02587890625, -0.0020904541015625, -0.00897216796875, -0.01324462890625, 0.00897216796875, -0.00933837890625, -0.004302978515625, 0.002410888671875, 0.00579833984375, 0.02294921875, -0.0184326171875, -0.01171875, -0.00634765625, 0.00445556640625, -0.0012969970703125, ...
[ 1250, 4867, 959, 141377, 140992, 26785, 9384, 5303, 502, 724, 304, 5046, 1197, 169920, 363, 110763, 3525, 31577, 87388, 4568, 12830, 1295, 18151, 37842, 3545, 122009, 3688, 71924, 61595, 14, 179459, 134598, 7639, 68252, 155761, 64457, 3060, 1...
[ 0.19189453125, 0.271240234375, 0.031768798828125, 0.1427001953125, 0.2232666015625, 0.1629638671875, 0.2054443359375, 0.1783447265625, 0.1407470703125, 0.0604248046875, 0.11962890625, 0.2127685546875, 0.162353515625, 0.215087890625, 0.107421875, 0.2091064453125, 0.03253173828125, 0...
embed
68437431_c0
68437431
prolog
0
Title: Can I restore a mongo db from within mongo shell? Problem title: Can I restore a mongo db from within mongo shell? Tags: mongodb, mongodump, python, prolog, mongorestore Problem: Can I restore a mongo db from within mongo shell? Dumping and restoring a mongo db seems fairly straightforward when you are using the...
Can I restore a mongo db from within mongo shell? Can I restore a mongo db from within mongo shell? mongodb mongodump python prolog mongorestore within Can os.system process_create Can I restore a mongo db from within mongo shell? Dumping and restoring a mongo db seems fairly straightforward when you are using the shel...
[ -0.0013275146484375, 0.01214599609375, -0.01025390625, 0.035400390625, -0.017333984375, 0.029541015625, -0.00628662109375, -0.018798828125, -0.013671875, -0.0296630859375, 0.01458740234375, 0.03759765625, -0.00408935546875, 0.00469970703125, 0.0233154296875, -0.004913330078125, -0.00...
[ 4171, 14359, 107, 14896, 31, 40041, 1295, 28032, 128019, 10, 2667, 7803, 275, 43958, 2676, 17198, 50828, 502, 4867, 19058, 7535, 362, 16751, 9433, 7612, 2182, 87, 786, 44287, 2852, 80560, 2472, 17368, 4527, 75101, 7, 64209, 31358, 36457, ...
[ 0.07586669921875, 0.2120361328125, 0.1322021484375, 0.2149658203125, 0.237060546875, 0.255126953125, 0.0936279296875, 0.1641845703125, 0.248779296875, 0.03912353515625, 0.1026611328125, 0.099365234375, 0.1351318359375, 0.06298828125, 0.1751708984375, 0.018280029296875, 0.084899902343...
embed
14936843_c0
14936843
prolog
0
Title: Applying arithmetic operators to lists of values Problem title: Applying arithmetic operators to lists of values Tags: prolog Problem: Applying arithmetic operators to lists of values Let's say I have list(s) of values and I want to apply an arithmetic operator to each value. For a binary operator like addition,...
Applying arithmetic operators to lists of values Applying arithmetic operators to lists of values prolog Applying add_lists arithop_lists _Op Applying arithmetic operators to lists of values Let's say I have list(s) of values and I want to apply an arithmetic operator to each value. For a binary operator like addition,...
[ 0.006317138671875, -0.006622314453125, -0.00109100341796875, -0.00836181640625, -0.0115966796875, 0.00946044921875, 0.0255126953125, -0.00433349609375, 0.001312255859375, -0.021728515625, 0.0087890625, -0.00775146484375, 0.0050048828125, 0.01019287109375, 0.0009307861328125, -0.0208740...
[ 5659, 538, 187, 8962, 282, 9523, 39933, 7, 47, 5303, 111, 142424, 214, 502, 4867, 15190, 6562, 2783, 58052, 39029, 3444, 59911, 142, 12638, 34292, 2394, 6635, 66044, 29459, 36663, 33022, 3293, 43240, 111531, 57357, 7413, 99156, 54, 903, 5...
[ 0.119873046875, 0.10565185546875, 0.040313720703125, 0.149169921875, 0.1220703125, 0.1068115234375, 0.272705078125, 0.06146240234375, 0.1025390625, 0.19775390625, 0.045440673828125, 0.18994140625, 0.00408935546875, 0.06884765625, 0.1466064453125, 0.099365234375, 0.2022705078125, 0....
embed
14590761_c1
14590761
prolog
1
1g), word(H2, H2a, V1dH2b, H2c, V2dH2d, H2e, V3dH2f, H2g), word(H3, H3a, V1fH3b, H3c, V2fH3d, H3e, V3fH3f, H3g). With V1a to V1g etc. being the characters of each word, and the V1bH1b to V3fH3f being the characters in common between words in the crossword. The solution seems to work, however the result is producing dup...
1g), word(H2, H2a, V1dH2b, H2c, V2dH2d, H2e, V3dH2f, H2g), word(H3, H3a, V1fH3b, H3c, V2fH3d, H3e, V3fH3f, H3g). With V1a to V1g etc. being the characters of each word, and the V1bH1b to V3fH3f being the characters in common between words in the crossword. The solution seems to work, however the result is producing dup...
[ -0.0002918243408203125, -0.007232666015625, -0.0091552734375, 0.00154876708984375, -0.007415771484375, 0.00897216796875, -0.0257568359375, 0.000507354736328125, 0.01239013671875, -0.0262451171875, 0.003082275390625, 0.01043701171875, 0.02685546875, 0.01092529296875, -0.0322265625, 0.01...
[ 106, 177, 2565, 841, 304, 572, 11, 310, 275, 13, 363, 420, 71, 418, 47, 8035, 124850, 12638, 39210, 17721, 34153, 41421, 47416, 29806, 37202, 4488, 49903, 16750, 27024, 171763, 142424, 5117, 705, 856, 21320, 8786, 1479, 78935, 188, 15978,...
[ 0.06695556640625, 0.130126953125, 0.149658203125, 0.103759765625, 0.12158203125, 0.127197265625, 0.056396484375, 0.1776123046875, 0.0206451416015625, 0.0040283203125, 0.1990966796875, 0.0543212890625, 0.01361083984375, 0.1268310546875, 0.032562255859375, 0.003509521484375, 0.14892578...
embed
42071334_c0
42071334
prolog
0
Title: prolog avoiding duplicate predicates Problem title: prolog avoiding duplicate predicates Tags: database, prolog, duplicates Problem: prolog avoiding duplicate predicates I was wondering whether it is possible to test whether a predicate already exists (with the same information) to then avoid the user being able...
prolog avoiding duplicate predicates prolog avoiding duplicate predicates database prolog duplicates Yes Pred prolog avoiding duplicate predicates I was wondering whether it is possible to test whether a predicate already exists (with the same information) to then avoid the user being able to input the same information...
[ -0.00156402587890625, 0.00836181640625, 0.0067138671875, -0.0125732421875, -0.021240234375, 0.01458740234375, 0.0186767578125, 0.01373291015625, -0.0023040771484375, -0.04931640625, -0.01214599609375, -0.00439453125, -0.0002193450927734375, -0.0205078125, 0.0191650390625, 0.01153564453...
[ 502, 4867, 71864, 214, 171763, 67, 1653, 2063, 1636, 63399, 32635, 7145, 149016, 7722, 3034, 36766, 21771, 32316, 76228, 5701, 4677, 38937, 19048, 107730, 13438, 145755, 11001, 11389, 43240, 5885, 30646, 91480, 2174, 5021, 22027, 54, 48716, 8...
[ 0.1888427734375, 0.2279052734375, 0.19677734375, 0.02374267578125, 0.23095703125, 0.1285400390625, 0.20849609375, 0.2327880859375, 0.1241455078125, 0.107421875, 0.127685546875, 0.2452392578125, 0.0146026611328125, 0.1541748046875, 0.2529296875, 0.1483154296875, 0.2159423828125, 0.2...
embed
16869624_c0
16869624
prolog
0
Title: Translate a sentence in prolog Problem title: Translate a sentence in prolog Tags: translate, prolog, cpu-word Problem: Translate a sentence in prolog can anyone help me to display untranslated word? for example i want to translate, 'i want to eat', in fact, there is no argument of to...so it will display 'saya ...
Translate a sentence in prolog Translate a sentence in prolog translate prolog cpu-word Translate Enter try2 Space Word List Tail _Space Translate a sentence in prolog can anyone help me to display untranslated word? for example i want to translate, 'i want to eat', in fact, there is no argument of to...so it will disp...
[ 0.0086669921875, -0.005462646484375, 0.006683349609375, 0.00927734375, -0.01470947265625, 0.0106201171875, -0.0164794921875, -0.003021240234375, 0.003570556640625, -0.0177001953125, 0.022216796875, 0.004364013671875, -0.0260009765625, -0.01043701171875, -0.01129150390625, 0.01696777343...
[ 11062, 19309, 10, 149357, 23, 502, 4867, 3900, 1766, 47416, 60816, 9790, 304, 43045, 22543, 32036, 1218, 379, 141012, 4358, 44116, 51, 30145, 143, 3674, 2565, 3444, 14, 47, 73203, 15824, 110, 10750, 111, 46907, 16346, 9352, 83, 47143, 570...
[ 0.1669921875, 0.18994140625, 0.046112060546875, 0.1785888671875, 0.037353515625, 0.1546630859375, 0.2181396484375, 0.1531982421875, 0.126953125, 0.1043701171875, 0.046875, 0.077880859375, 0.047760009765625, 0.1131591796875, 0.0667724609375, 0.0777587890625, 0.03497314453125, 0.0544...
embed
49967625_c0
49967625
prolog
0
Title: Prolog predicate to see if a square sequence converges to 1 Problem title: Prolog predicate to see if a square sequence converges to 1 Tags: prolog Problem: Prolog predicate to see if a square sequence converges to 1 Basically, the problem is the following: Given a number N, we define the sequence where each num...
Prolog predicate to see if a square sequence converges to 1 Prolog predicate to see if a square sequence converges to 1 prolog Prolog Prolog predicate to see if a square sequence converges to 1 Basically, the problem is the following: Given a number N, we define the sequence where each number is the sum of the squares ...
[ 0.0025482177734375, 0.03271484375, -0.002197265625, 0.0078125, -0.0244140625, 0.007568359375, 0.0016632080078125, 0.02734375, -0.00083160400390625, -0.015869140625, 0.00677490234375, 0.0361328125, -0.01806640625, -0.01214599609375, 0.0130615234375, 0.018310546875, 0.0089111328125, ...
[ 1250, 4867, 1653, 2063, 67, 1957, 2174, 108047, 40, 944, 3956, 158, 74789, 47, 106, 502, 7, 2967, 77878, 14012, 541, 61924, 12638, 10554, 153939, 96362, 34475, 12765, 615, 5896, 2789, 17480, 209, 2060, 51515, 43240, 5885, 156892, 54241, 4...
[ 0.161376953125, 0.1956787109375, 0.15478515625, 0.192626953125, 0.04345703125, 0.1326904296875, 0.09686279296875, 0.15625, 0.058349609375, 0.134521484375, 0.0736083984375, 0.13134765625, 0.2109375, 0.117919921875, 0.1436767578125, 0.1168212890625, 0.0213470458984375, 0.071838378906...
embed
71545034_c0
71545034
prolog
0
Title: Implementing Reg. expression in prolog Problem title: Implementing Reg. expression in prolog Tags: prolog Problem: Implementing Reg. expression in prolog I have a question regarding implementing some predicates in prolog.(for regular expression.) I need to implement 4 predicates My implementation is sublist( Sub...
Implementing Reg. expression in prolog Implementing Reg. expression in prolog prolog Implementing Reg Sublist List Implementing Reg. expression in prolog I have a question regarding implementing some predicates in prolog.(for regular expression.) I need to implement 4 predicates My implementation is Now, my problem is....
[ 0.0091552734375, 0.00860595703125, 0.0234375, 0.0089111328125, -0.0220947265625, 0.01007080078125, -0.01385498046875, 0.017578125, 0.0213623046875, -0.0164794921875, 0.01171875, 0.0244140625, -0.01116943359375, -0.0137939453125, 0.01171875, 0.01202392578125, 0.036376953125, 0.02026...
[ 153941, 214, 11678, 5, 125195, 23, 502, 4867, 8273, 6562, 32036, 9655, 29479, 1653, 2063, 1636, 20324, 3871, 201, 208124, 14240, 2967, 110, 6528, 1286, 74918, 69098, 36663, 11782, 1884, 14858, 35593, 2806, 294, 140909, 21320, 98753, 5613, 2...
[ 0.210205078125, 0.0030517578125, 0.206787109375, 0.021453857421875, 0.227294921875, 0.022674560546875, 0.1544189453125, 0.21533203125, 0.1322021484375, 0.155517578125, 0.1019287109375, 0.0235443115234375, 0.2088623046875, 0.168701171875, 0.177001953125, 0.04718017578125, 0.1859130859...
embed
40799447_c0
40799447
prolog
0
Title: Prolog sequences Problem title: Prolog sequences Tags: prolog Problem: Prolog sequences Good Day, I have a task (not homework), but test preparation question. Given a value of n where n > 0. I need to find out what 3**n value is. I do have something that works. % expo expo([],[]). expo([X|T], [Y|Result]):- numbe...
Prolog sequences Prolog sequences prolog Prolog Result ThrowAway Tail do_list Num Prolog sequences Good Day, I have a task (not homework), but test preparation question. Given a value of n where n > 0. I need to find out what 3**n value is. I do have something that works. When I run this at the console: So it does give...
[ 0.0162353515625, 0.0228271484375, -0.0169677734375, -0.00022411346435546875, -0.003631591796875, 0.0106201171875, 0.00127410888671875, 0.0010528564453125, 0.0225830078125, -0.0230712890625, -0.00109100341796875, 0.006317138671875, -0.0152587890625, 0.01806640625, 0.01318359375, -0.0004...
[ 1250, 4867, 40, 26513, 5170, 502, 126684, 15555, 7514, 1218, 379, 54, 6562, 52782, 10013, 765, 66211, 5368, 18244, 3034, 212485, 9655, 77878, 34292, 653, 977, 757, 3871, 7413, 1810, 2367, 138, 25442, 19, 83, 43240, 11675, 130250, 8337, 87...
[ 0.1865234375, 0.268798828125, 0.0616455078125, 0.19677734375, 0.05645751953125, 0.11181640625, 0.1422119140625, 0.1246337890625, 0.1607666015625, 0.1217041015625, 0.09368896484375, 0.084716796875, 0.172119140625, 0.1771240234375, 0.0245208740234375, 0.0177459716796875, 0.154907226562...
embed
7868684_c0
7868684
prolog
0
Title: Depth limited search in prolog (vanilla meta-interpreter) Problem title: Depth limited search in prolog (vanilla meta-interpreter) Tags: prolog-metainterpreter, prolog, metaprogramming Problem: Depth limited search in prolog (vanilla meta-interpreter) I need to modify the vanilla meta-interpreter in order to mak...
Depth limited search in prolog (vanilla meta-interpreter) Depth limited search in prolog (vanilla meta-interpreter) prolog-metainterpreter prolog metaprogramming Depth wire1 wire2 wire3 wire4 wire5 wire6 wire7 wire8 wire9 Depth limited search in prolog (vanilla meta-interpreter) I need to modify the vanilla meta-interp...
[ 0.01214599609375, 0.0048828125, 0.00135040283203125, 0.0167236328125, -0.009033203125, 0.01287841796875, -0.013916015625, -0.007476806640625, 0.0186767578125, -0.047119140625, 0.00616455078125, -0.0146484375, -0.00054931640625, 0.0068359375, 0.025634765625, 0.006195068359375, 0.01953...
[ 262, 254, 927, 84046, 33938, 23, 502, 4867, 2187, 2298, 23550, 158288, 56, 35273, 28966, 1439, 617, 758, 1019, 1126, 3871, 2811, 40383, 131, 3249, 10, 678, 168867, 17368, 25632, 18151, 134234, 9519, 34, 30388, 1884, 3311, 3917, 759, 83, ...
[ 0.12890625, 0.1630859375, 0.1187744140625, 0.262451171875, 0.2548828125, 0.0279388427734375, 0.152587890625, 0.20947265625, 0.144287109375, 0.2113037109375, 0.202392578125, 0.214599609375, 0.1036376953125, 0.14111328125, 0.094482421875, 0.122314453125, 0.02203369140625, 0.022338867...
embed
64850666_c0
64850666
prolog
0
Title: WAM register allocation for same structures Problem title: WAM register allocation for same structures Tags: prolog, warren-abstract-machine Problem: WAM register allocation for same structures Warren’s Abstract Machine A Tutorial Reconstruction states the following for Variable Register Allocation rules: Variab...
WAM register allocation for same structures WAM register allocation for same structures prolog warren-abstract-machine WAM WAM register allocation for same structures Warren’s Abstract Machine A Tutorial Reconstruction states the following for Variable Register Allocation rules: Variable registers are allocated accordi...
[ 0.0147705078125, 0.026123046875, -0.00439453125, 0.00970458984375, -0.00738525390625, 0.01068115234375, -0.0169677734375, 0.0009002685546875, 0.01123046875, -0.0162353515625, 0.005523681640625, 0.01177978515625, -0.00311279296875, -0.0252685546875, 0.0034332275390625, -0.0113525390625,...
[ 4336, 594, 68067, 144, 87632, 100, 5701, 45646, 502, 4867, 1631, 982, 2816, 103149, 171458, 26, 233973, 68311, 183447, 853, 238478, 84572, 2886, 131423, 884, 91736, 116292, 59499, 19713, 19882, 63262, 1193, 418, 11343, 628, 32166, 5510, 13579...
[ 0.1611328125, 0.158203125, 0.28076171875, 0.1279296875, 0.1689453125, 0.00299072265625, 0.158935546875, 0.159912109375, 0.1622314453125, 0.203125, 0.047760009765625, 0.0941162109375, 0.09210205078125, 0.09375, 0.204833984375, 0.05816650390625, 0.2086181640625, 0.1376953125, 0.156...
embed
52976168_c0
52976168
prolog
0
Title: Prolog - is the following query satisfied? Problem title: Prolog - is the following query satisfied? Tags: prolog Problem: Prolog - is the following query satisfied? I am doing exercise from the following link Here is knowledge base: house_elf(dobby). witch(hermione). witch(’McGonagall’). witch(rita_skeeter). ma...
Prolog - is the following query satisfied? Prolog - is the following query satisfied? prolog Prolog house_elf McGonagall rita_skeeter ERROR Stream user_input:450:4 Syntax Unexpected Undefined some_user ex2_2.pl:6 Exception Prolog - is the following query satisfied? I am doing exercise from the following link Here is kn...
[ -0.0084228515625, 0.033203125, 0.0027618408203125, 0.0142822265625, -0.0045166015625, 0.005279541015625, -0.01123046875, 0.0059814453125, -0.00274658203125, -0.0220947265625, -0.008544921875, -0.00823974609375, -0.0068359375, 0.00177764892578125, 0.0009765625, -0.00848388671875, 0.02...
[ 1250, 4867, 83, 70, 25632, 41, 1294, 214521, 502, 18276, 17463, 157580, 2477, 119876, 13992, 1205, 45673, 151206, 24638, 115061, 38937, 73, 7077, 60450, 617, 19010, 86531, 83613, 79912, 5983, 3060, 65918, 1119, 304, 2424, 910, 5443, 63928, ...
[ 0.2039794921875, 0.28466796875, 0.09722900390625, 0.0087890625, 0.1514892578125, 0.15478515625, 0.1485595703125, 0.214599609375, 0.180419921875, 0.119384765625, 0.1424560546875, 0.09423828125, 0.127685546875, 0.205322265625, 0.188720703125, 0.137451171875, 0.2174072265625, 0.117553...
embed
51562887_c0
51562887
prolog
0
Title: Custom DCG Operators Problem title: Custom DCG Operators Tags: dcg, meta-predicate, prolog Problem: Custom DCG Operators Suppose I want to write a custom operator for composing DCG rules in a way that would otherwise be repetitive. For example, suppose I had I a DCG, ws such that: ws --> []. ws --> " ", ws. to m...
Custom DCG Operators Custom DCG Operators dcg meta-predicate prolog Custom DCG Operators meta_predicate Custom DCG Operators Suppose I want to write a custom operator for composing DCG rules in a way that would otherwise be repetitive. For example, suppose I had I a DCG, ws such that: to match zero or more spaces. Obvi...
[ 0.024658203125, -0.00909423828125, 0.007781982421875, 0.01214599609375, -0.01007080078125, 0.0196533203125, -0.0147705078125, -0.00567626953125, 0.01904296875, -0.029541015625, -0.006622314453125, -0.0159912109375, 0.004119873046875, -0.0205078125, 0.000614166259765625, 0.008056640625,...
[ 130664, 391, 56367, 150922, 104, 238, 177, 23550, 19714, 2063, 502, 4867, 3444, 33022, 114122, 39933, 9969, 232, 91736, 120262, 57346, 4935, 139124, 148, 7, 14858, 45234, 1286, 32628, 35829, 35011, 65421, 17721, 12638, 47, 1098, 122092, 995, ...
[ 0.139404296875, 0.0858154296875, 0.1907958984375, 0.2032470703125, 0.01678466796875, 0.00140380859375, 0.07275390625, 0.11669921875, 0.0635986328125, 0.0787353515625, 0.0643310546875, 0.1160888671875, 0.0276947021484375, 0.091552734375, 0.16650390625, 0.238037109375, 0.0458984375, ...
embed
53354968_c0
53354968
prolog
0
Title: SWI-prolog semweb library processing of URI Problem title: SWI-prolog semweb library processing of URI Tags: prolog, semweb, swi-prolog Problem: SWI-prolog semweb library processing of URI Being new to prolog I am reading existing code (as well as trying to write some code). Having some prior background in semwe...
SWI-prolog semweb library processing of URI SWI-prolog semweb library processing of URI prolog semweb swi-prolog rules SWI-prolog URI rdf_assert ex:bob rdf:type Person Remember Internally goal_expansion rdf_db module_name:predicate SWI-prolog semweb library processing of URI Being new to prolog I am reading existing co...
[ 0.01092529296875, 0.0198974609375, -0.00103759765625, 0.0235595703125, -0.0027313232421875, -0.00081634521484375, 0.01043701171875, 0.019287109375, -0.0198974609375, -0.0341796875, 0.0279541015625, -0.0106201171875, -0.00433349609375, -0.0004291534423828125, 0.010009765625, -0.00124359...
[ 159, 38969, 3454, 4867, 484, 14051, 35773, 1294, 9433, 214, 111, 46492, 502, 2452, 91736, 4216, 420, 162, 33657, 1119, 837, 275, 50986, 15270, 157492, 106745, 69236, 83613, 66, 48073, 88996, 11627, 19714, 2063, 3525, 16454, 144573, 18151, 7...
[ 0.06365966796875, 0.245361328125, 0.1395263671875, 0.2301025390625, 0.1806640625, 0.259765625, 0.1973876953125, 0.1021728515625, 0.10595703125, 0.0207672119140625, 0.026397705078125, 0.27001953125, 0.140380859375, 0.1400146484375, 0.144287109375, 0.1190185546875, 0.169677734375, 0....
embed
13408215_c0
13408215
prolog
0
Title: Using the Cut to Increase Efficiency Problem title: Using the Cut to Increase Efficiency Tags: prolog-cut, prolog Problem: Using the Cut to Increase Efficiency If I have the following knowledge base, how do I add a cut to the parent_of term so that if an X is already determined to be a father, prolog won't attem...
Using the Cut to Increase Efficiency Using the Cut to Increase Efficiency prolog-cut prolog Using Cut Increase Efficiency father_of mother_of parent_of Using the Cut to Increase Efficiency If I have the following knowledge base, how do I add a cut to the parent_of term so that if an X is already determined to be a fath...
[ 0.013916015625, 0.02392578125, 0.0167236328125, 0.030029296875, -0.009521484375, 0.006072998046875, -0.01055908203125, -0.00299072265625, 0.01416015625, -0.037841796875, 0.00225830078125, -0.0234375, -0.00592041015625, 0.00885009765625, 0.025146484375, -0.000782012939453125, -0.01336...
[ 345, 70, 3003, 18, 47, 8942, 1283, 14467, 11044, 33, 502, 4867, 19774, 6953, 67373, 454, 4390, 42732, 49129, 184, 25632, 51359, 3647, 3642, 54, 15190, 10, 59226, 13579, 221, 1193, 21771, 83324, 186, 23742, 81887, 78292, 2174, 2843, 3444, ...
[ 0.06866455078125, 0.07623291015625, 0.2137451171875, 0.147216796875, 0.0631103515625, 0.041229248046875, 0.115234375, 0.06658935546875, 0.1099853515625, 0.048919677734375, 0.1417236328125, 0.20654296875, 0.197021484375, 0.009552001953125, 0.24169921875, 0.06109619140625, 0.2722167968...
embed
73550836_c0
73550836
prolog
0
Title: How to fill a list with values from another list Problem title: How to fill a list with values from another list Tags: prolog Problem: How to fill a list with values from another list I'm just starting to learn about prolog, and I'd like to create a program that helps me do the following: Given two lists: List1 ...
How to fill a list with values from another list How to fill a list with values from another list prolog another How List1 List2 How to fill a list with values from another list I'm just starting to learn about prolog, and I'd like to create a program that helps me do the following: Given two lists: I'd like to make su...
[ -0.00074005126953125, 0.001220703125, 0.00897216796875, 0.007293701171875, -0.020751953125, 0.0240478515625, -0.005096435546875, 0.01708984375, 0.0152587890625, 0.0020294189453125, 0.0177001953125, -0.00653076171875, 0.0028533935546875, 0.01470947265625, -0.0081787109375, -0.0036773681...
[ 11249, 47, 26292, 10, 5303, 678, 142424, 1295, 15700, 502, 4867, 32036, 418, 304, 1528, 6626, 1884, 3249, 9077, 621, 32316, 12921, 51347, 54, 903, 1250, 15190, 34292, 131148, 1286, 80854, 171763, 3674 ]
[ 0.06195068359375, 0.0203704833984375, 0.1961669921875, 0.034088134765625, 0.2203369140625, 0.140625, 0.211669921875, 0.139404296875, 0.156982421875, 0.10791015625, 0.197509765625, 0.158935546875, 0.04058837890625, 0.1612548828125, 0.0723876953125, 0.0743408203125, 0.006072998046875, ...
embed
77776623_c0
77776623
prolog
0
Title: Rotations in Prolog Problem title: Rotations in Prolog Tags: prolog Problem: Rotations in Prolog I have started a tetris-like program in prolog. I've defined the initial pieces without rotations or movements to the right (these are the only 2 options I want in my program). % Definir o tamanho do tabuleiro n(4). ...
Rotations in Prolog Rotations in Prolog prolog Rotations Prolog Definir NROT NDIR Rotations in Prolog I have started a tetris-like program in prolog. I've defined the initial pieces without rotations or movements to the right (these are the only 2 options I want in my program). n is width, m is height, peca are the pie...
[ -0.00145721435546875, 0.0035552978515625, 0.033935546875, -0.002197265625, -0.00604248046875, 0.004852294921875, -0.0017852783203125, 0.0189208984375, 0.00005817413330078125, -0.00439453125, -0.01312255859375, 0.01220703125, 0.00119781494140625, -0.0224609375, 0.006622314453125, 0.0150...
[ 146283, 5256, 23, 1250, 4867, 502, 88606, 42, 71641, 23973, 541, 123237, 26859, 120, 43291, 5062, 1528, 61924, 61475, 126371, 15490, 47014, 112664, 47, 7108, 4734, 116, 50717, 3444, 653, 83, 146984, 347, 155955, 280, 408, 58055, 34627, 1768...
[ 0.259033203125, 0.1640625, 0.09051513671875, 0.174072265625, 0.285888671875, 0.13671875, 0.1614990234375, 0.026611328125, 0.127685546875, 0.2484130859375, 0.083740234375, 0.2076416015625, 0.036712646484375, 0.03955078125, 0.19482421875, 0.04681396484375, 0.123046875, 0.148315429687...
embed
66341563_c0
66341563
prolog
0
Title: Water Jug Problem in Prolog with Best First Search Problem title: Water Jug Problem in Prolog with Best First Search Tags: prolog, water-jug-problem Problem: Water Jug Problem in Prolog with Best First Search I failed to write a Prolog program using RBFS algorithm to solve a task - how to measure exactly 3 liter...
Water Jug Problem in Prolog with Best First Search Water Jug Problem in Prolog with Best First Search prolog water-jug-problem Water Jug Problem Prolog Best First Search write1 add1 VA-A Min B-Min VB-B A-Min Water Jug Problem in Prolog with Best First Search I failed to write a Prolog program using RBFS algorithm to so...
[ 0.0013580322265625, 0.032470703125, -0.01348876953125, 0.01031494140625, -0.0107421875, 0.01336669921875, -0.01220703125, 0.004486083984375, 0.00750732421875, 0.001495361328125, 0.0235595703125, 0.0162353515625, 0.00909423828125, -0.006805419921875, 0.0093994140625, 0.00089645385742187...
[ 27646, 3314, 177, 15649, 23, 1250, 4867, 678, 11345, 23972, 33086, 502, 7401, 461, 38953, 33022, 15190, 418, 25875, 4211, 335, 9, 59076, 6, 75034, 571, 62, 165523, 10, 1528, 45176, 36381, 234873, 86869, 66211, 3642, 72350, 66161, 138, 156...
[ 0.2181396484375, 0.276611328125, 0.1898193359375, 0.196533203125, 0.0794677734375, 0.171630859375, 0.263916015625, 0.06854248046875, 0.1641845703125, 0.1722412109375, 0.245849609375, 0.1126708984375, 0.2344970703125, 0.2381591796875, 0.1783447265625, 0.1094970703125, 0.0938720703125,...
embed
41724116_c1
41724116
prolog
1
1, e4). isADirectRelation( e3, r1, e4). % derived relations calculations % Structural Chains isADerivedRelation( Source, Relation, Target, Visited) :- \+ member( [Source,Relation,Target], Visited), weakest( Relation, RelationOne, RelationTwo), isARelation( Source, RelationOne, Intermediate, [[Source,Relation,Target]|Vi...
1, e4). isADirectRelation( e3, r1, e4). % derived relations calculations % Structural Chains isADerivedRelation( Source, Relation, Target, Visited) :- \+ member( [Source,Relation,Target], Visited), weakest( Relation, RelationOne, RelationTwo), isARelation( Source, RelationOne, Intermediate, [[Source,Relation,Target]|Vi...
[ 0.004852294921875, 0.0223388671875, 0.021240234375, 0.004364013671875, 0.0203857421875, -0.0146484375, -0.0269775390625, -0.019287109375, 0.006439208984375, -0.0267333984375, 0.00970458984375, 0.02587890625, -0.0234375, 0.01361083984375, 0.017822265625, -0.00537109375, -0.00199890136...
[ 106, 28, 29557, 83, 284, 184911, 4332, 57860, 363, 1690, 418, 1745, 16406, 4126, 91582, 74481, 63667, 73317, 4841, 5425, 12351, 4207, 77641, 116822, 160017, 98684, 1328, 32786, 211235, 63031, 3794, 642, 344, 525, 62068, 3613, 11909, 13, 533...
[ 0.035491943359375, 0.1273193359375, 0.2122802734375, 0.1531982421875, 0.111328125, 0.202392578125, 0.162841796875, 0.2305908203125, 0.1636962890625, 0.08489990234375, 0.1129150390625, 0.1240234375, 0.17431640625, 0.161376953125, 0.22265625, 0.1292724609375, 0.1212158203125, 0.14477...
embed
26679486_c1
26679486
prolog
1
3@>2 ? creep 6 Exit: (9) gt(3, 2) ? creep 7 Call: (9) split(3, [4, 1, 5], _G4261, _G4273) ? creep 8 Call: (10) gt(3, 4) ? creep 9 Call: (11) 3@>4 ? creep 10 Fail: (11) 3@>4 ? creep 11 Fail: (10) gt(3, 4) ? creep 12 Redo: (9) split(3, [4, 1, 5], _G4261, _G4273) ? creep 13 Call: (10) split(3, [1, 5], _G4261, _G4264) ? cr...
3@>2 ? creep 6 Exit: (9) gt(3, 2) ? creep 7 Call: (9) split(3, [4, 1, 5], _G4261, _G4273) ? creep 8 Call: (10) gt(3, 4) ? creep 9 Call: (11) 3@>4 ? creep 10 Fail: (11) 3@>4 ? creep 11 Fail: (10) gt(3, 4) ? creep 12 Redo: (9) split(3, [4, 1, 5], _G4261, _G4273) ? creep 13 Call: (10) split(3, [1, 5], _G4261, _G4264) ? cr...
[ 0.00171661376953125, 0.019287109375, 0.0034637451171875, 0.003021240234375, -0.000728607177734375, 0.01904296875, 0.005279541015625, -0.0002002716064453125, 0.0274658203125, 0.0308837890625, -0.00077056884765625, 0.007568359375, -0.0225830078125, -0.006805419921875, 0.032470703125, 0.0...
[ 138, 981, 2740, 304, 705, 49512, 254, 305, 5443, 217, 11438, 5386, 86827, 4958, 361, 26265, 65450, 190, 724, 179122, 418, 13023, 13574, 382, 17857, 483, 21282, 209, 190355, 534, 427, 6096, 31, 702, 88235, 13315, 116, 502, 4867, 59911, 7...
[ 0.15625, 0.1328125, 0.1112060546875, 0.09893798828125, 0.0196380615234375, 0.164306640625, 0.080810546875, 0.123779296875, 0.1063232421875, 0.0841064453125, 0.1754150390625, 0.1275634765625, 0.1180419921875, 0.0289306640625, 0.013031005859375, 0.200927734375, 0.24609375, 0.11535644...
embed
47161683_c0
47161683
prolog
0
Title: Get Prolog DCG arguments generated from sentence being parsed Problem title: Get Prolog DCG arguments generated from sentence being parsed Tags: prolog, parsing, dcg, lexical-analysis Problem: Get Prolog DCG arguments generated from sentence being parsed I'm putting together a lexer/parser for a simple programmi...
Get Prolog DCG arguments generated from sentence being parsed Get Prolog DCG arguments generated from sentence being parsed prolog parsing dcg lexical-analysis sentence Get Prolog DCG number_codes Get Prolog DCG arguments generated from sentence being parsed I'm putting together a lexer/parser for a simple programming ...
[ 0.020263671875, -0.00408935546875, 0.004547119140625, 0.0255126953125, 0.00885009765625, 0.026611328125, 0.0038299560546875, 0.013916015625, 0.01055908203125, -0.0419921875, 0.005889892578125, -0.0206298828125, -0.0242919921875, -0.0003681182861328125, 0.006439208984375, -0.00075912475...
[ 20779, 1250, 4867, 391, 56367, 10750, 7, 139392, 71, 1295, 149357, 8035, 366, 5281, 502, 6953, 104, 238, 177, 75675, 21533, 174976, 164, 14012, 40899, 95, 34058, 2500, 2189, 8781, 56037, 46876, 5303, 47, 84694, 86531, 53201, 6002, 88303, ...
[ 0.0816650390625, 0.120361328125, 0.1964111328125, 0.0765380859375, 0.204345703125, 0.2388916015625, 0.0267181396484375, 0.168701171875, 0.01385498046875, 0.0828857421875, 0.1522216796875, 0.053497314453125, 0.132568359375, 0.06317138671875, 0.0789794921875, 0.0731201171875, 0.0168304...
embed
34121835_c0
34121835
prolog
0
Title: On solving project Euler #303 in with Prolog / clpfd Problem title: On solving project Euler #303 in with Prolog / clpfd Tags: prolog, clpfd Problem: On solving project Euler #303 in with Prolog / clpfd Here comes Project Euler Problem 303 , "Multiples with small digits". For a positive integer n, define f(n) as...
On solving project Euler #303 in with Prolog / clpfd On solving project Euler #303 in with Prolog / clpfd prolog clpfd Euler Prolog use_module n_fn digits_number On solving project Euler #303 in with Prolog / clpfd Here comes Project Euler Problem 303 , "Multiples with small digits". This is the code I have already wri...
[ -0.0198974609375, -0.01202392578125, 0.01409912109375, 0.0011138916015625, -0.03076171875, 0.0036773681640625, 0.011962890625, -0.0047607421875, 0.007080078125, -0.05712890625, 0.00130462646484375, -0.0301513671875, -0.00982666015625, 0.0157470703125, 0.0130615234375, 0.000751495361328...
[ 2161, 3115, 6496, 13452, 5177, 603, 111378, 9513, 23, 678, 1250, 4867, 33139, 39557, 71, 502, 4527, 83279, 653, 14783, 153939, 2606, 1297, 11853, 27331, 15649, 496, 363, 50657, 118, 99726, 19336, 70, 18151, 21771, 3444, 52295, 43240, 14012,...
[ 0.036407470703125, 0.1065673828125, 0.016571044921875, 0.1243896484375, 0.153076171875, 0.2138671875, 0.07562255859375, 0.2093505859375, 0.06195068359375, 0.10418701171875, 0.1285400390625, 0.2166748046875, 0.0145111083984375, 0.067138671875, 0.083984375, 0.0848388671875, 0.086364746...
embed
55092914_c1
55092914
prolog
1
\= B, C \= D), ( C = B -> C \= A, C \= D), ( C = D -> C \= A, C \= B), ( D = A -> D \= B, D \= C), ( D = B -> D \= A, D \= C), ( D = C -> D \= A, D \= B). In which im just trying to say if A = B then it is so that it isn't equal to all others, but i still lack that it needs to have that all element have an other eleme...
\= B, C \= D), ( C = B -> C \= A, C \= D), ( C = D -> C \= A, C \= B), ( D = A -> D \= B, D \= C), ( D = B -> D \= A, D \= C), ( D = C -> D \= A, D \= B). In which im just trying to say if A = B then it is so that it isn't equal to all others, but i still lack that it needs to have that all element have an other eleme...
[ -0.001708984375, 0.0027313232421875, 0.0137939453125, 0.02734375, -0.007415771484375, -0.0037994384765625, -0.025634765625, -0.00506591796875, 0.0145263671875, -0.0023956298828125, 0.0030364990234375, 0.00653076171875, 0.025634765625, 0.002197265625, -0.01165771484375, 0.00091171264648...
[ 41872, 1369, 335, 313, 391, 2203, 33079, 62, 31577, 5154, 2174, 56112, 18, 105950, 47, 756, 27060, 7464, 92635, 12830, 83, 5701, 27781, 37842, 117781, 8789, 304, 284, 571, 441, 397, 164, 71723, 959, 29598, 41, 133063, 10461, 29568, 3789, ...
[ 0.0154571533203125, 0.09564208984375, 0.1768798828125, 0.12109375, 0.1260986328125, 0.147705078125, 0.05706787109375, 0.0885009765625, 0.05548095703125, 0.0792236328125, 0.0726318359375, 0.039794921875, 0.069580078125, 0.1441650390625, 0.03564453125, 0.04962158203125, 0.0789794921875...
embed
48528251_c0
48528251
prolog
0
Title: Algorithmically pick which rule to apply? Problem title: Algorithmically pick which rule to apply? Tags: prolog Problem: Algorithmically pick which rule to apply? Let say I have the following rules : ?- assert(test(5,2) :- true). true. ?- assert(test(5,3) :- true). true. ?- assert(test(5,4) :- true). true. ?- te...
Algorithmically pick which rule to apply? Algorithmically pick which rule to apply? prolog Algorithmically Algorithmically pick which rule to apply? Let say I have the following rules : I can find all the solutions. But I want something different. In this scenario "5" is the condition and the second term K is a SCORE. ...
[ -0.005462646484375, 0.015869140625, 0.0147705078125, 0.0223388671875, -0.00836181640625, 0.0098876953125, -0.0074462890625, 0.0198974609375, 0.006378173828125, -0.0225830078125, 0.018798828125, 0.001739501953125, -0.0126953125, -0.0035552978515625, 0.0218505859375, 0.012939453125, 0....
[ 109847, 2783, 18337, 71407, 39580, 3129, 79986, 47, 59911, 502, 4867, 5154, 765, 25632, 91736, 87, 831, 7413, 756, 70, 51347, 4966, 3444, 9844, 12921, 106117, 758, 83, 35431, 17932, 13579, 341, 10, 17715, 54003, 14858, 830, 186, 19048, 16...
[ 0.127197265625, 0.14404296875, 0.130859375, 0.1375732421875, 0.26220703125, 0.1251220703125, 0.26171875, 0.06890869140625, 0.209228515625, 0.05828857421875, 0.1207275390625, 0.01116943359375, 0.05072021484375, 0.061767578125, 0.197998046875, 0.008056640625, 0.06488037109375, 0.1059...
embed
3860209_c0
3860209
prolog
0
Title: Custom reverse of a list in Prolog Problem title: Custom reverse of a list in Prolog Tags: prolog, reverse, nested, list Problem: Custom reverse of a list in Prolog I am trying to write a predicate that given the following list in Prolog: [[1,a,b],[2,c,d],[[3,e,f],[4,g,h],[5,i,j]],[6,k,l]] will produce the follo...
Custom reverse of a list in Prolog Custom reverse of a list in Prolog prolog reverse nested list Custom Prolog Custom reverse of a list in Prolog I am trying to write a predicate that given the following list in Prolog: will produce the following list: As you can see I would like to preserve the order of the elements a...
[ -0.00830078125, 0.03466796875, 0.010009765625, 0.0184326171875, -0.008544921875, 0.0159912109375, -0.00106048583984375, 0.00421142578125, 0.0172119140625, -0.01068115234375, 0.016357421875, 0.012451171875, -0.00130462646484375, 0.00006961822509765625, 0.006103515625, 0.007232666015625,...
[ 130664, 39531, 184, 111, 5303, 1250, 4867, 23, 502, 8512, 71, 31577, 33022, 1653, 2063, 67, 34475, 25632, 27489, 1884, 479, 86687, 12989, 80854, 459, 25617, 17366, 106, 876, 86725, 10, 615, 168867, 7311, 176377, 145755, 69307, 104851, 18151...
[ 0.1939697265625, 0.256591796875, 0.1700439453125, 0.0614013671875, 0.193603515625, 0.1746826171875, 0.228271484375, 0.01806640625, 0.1337890625, 0.2066650390625, 0.02789306640625, 0.034027099609375, 0.0362548828125, 0.1038818359375, 0.123779296875, 0.0477294921875, 0.0133056640625, ...
embed
5753543_c0
5753543
prolog
0
Title: Prolog lists and recursion Problem title: Prolog lists and recursion Tags: prolog, list, recursion Problem: Prolog lists and recursion I'm having problems understanding contrived recursion in Prolog. Some helper predicates that are just append to beginning and end respectively: add_number(Numbers, N, NewNumbers)...
Prolog lists and recursion Prolog lists and recursion prolog list recursion Prolog add_number Numbers NewNumbers add_letter Letters NewLetters Nums NewNums Prolog lists and recursion I'm having problems understanding contrived recursion in Prolog. Some helper predicates that are just append to beginning and end respect...
[ 0.00653076171875, 0.0078125, -0.01068115234375, 0.003662109375, 0.0020294189453125, 0.0260009765625, -0.00946044921875, 0.0036773681640625, 0.023193359375, -0.006927490234375, 0.01116943359375, 0.0030517578125, -0.0179443359375, 0.03076171875, 0.0223388671875, -0.0286865234375, 0.012...
[ 1250, 4867, 5303, 136, 195625, 1830, 502, 15190, 2606, 103332, 2356, 18444, 26278, 63049, 105451, 124480, 23962, 52782, 10321, 44402, 100094, 158, 3996, 4126, 4358, 56, 1653, 2063, 114689, 86595, 3564, 69236, 5646, 120820, 101935, 30646, 6626, ...
[ 0.18017578125, 0.245361328125, 0.1898193359375, 0.095703125, 0.2254638671875, 0.107177734375, 0.1229248046875, 0.084228515625, 0.098876953125, 0.10662841796875, 0.0819091796875, 0.05499267578125, 0.10498046875, 0.10333251953125, 0.0904541015625, 0.04644775390625, 0.03656005859375, ...
embed
23074116_c0
23074116
prolog
0
Title: Cut on a higher level in Prolog Problem title: Cut on a higher level in Prolog Tags: prolog, prolog-cut Problem: Cut on a higher level in Prolog Say you have a program: a(X) :- b(X). a(X) :- c(X). b(a). b(b) :- !,fail. b(c). c(a). A query a(X) will return A=a; X=a . I'm looking however for a mechanism where the ...
Cut on a higher level in Prolog Cut on a higher level in Prolog prolog prolog-cut Cut Prolog Cut on a higher level in Prolog Say you have a program: A query a(X) will return A=a; X=a . I'm looking however for a mechanism where the cut ( ! ) does not only prevent one from further executing predicates in the same node of...
[ 0.0250244140625, 0.0238037109375, 0.0274658203125, 0.018798828125, 0.01483154296875, 0.003265380859375, -0.007659912109375, -0.006805419921875, -0.00714111328125, -0.0167236328125, -0.012451171875, 0.008056640625, -0.01031494140625, 0.0016326904296875, 0.01531982421875, -0.012145996093...
[ 3003, 18, 98, 77546, 17366, 23, 1250, 4867, 10, 502, 19774, 765, 1528, 41, 1294, 1542, 1221, 30646, 62, 1369, 11, 1193, 16487, 191619, 70, 59226, 711, 14602, 56282, 1295, 53333, 71924, 1653, 2063, 5701, 110, 53201, 4420, 125728, 24233, ...
[ 0.2259521484375, 0.153564453125, 0.15234375, 0.179443359375, 0.2015380859375, 0.03631591796875, 0.173095703125, 0.2303466796875, 0.059051513671875, 0.136962890625, 0.215087890625, 0.00750732421875, 0.1756591796875, 0.101806640625, 0.111328125, 0.109619140625, 0.0626220703125, 0.140...
embed
52347609_c0
52347609
prolog
0
Title: Find last item in a difference list Problem title: Find last item in a difference list Tags: difference-lists, prolog Problem: Find last item in a difference list I'm trying to find the last item (all numbers) without "ruining" the list. What I currently have is this: max([_|Xs]-Xs,R):- Xs \= [], max2(Xs,R),!. m...
Find last item in a difference list Find last item in a difference list difference-lists prolog Find max2 Stack Choice Probable _1452 _1484 Find last item in a difference list I'm trying to find the last item (all numbers) without "ruining" the list. What I currently have is this: Max2 is a function that finds the last...
[ -0.00188446044921875, -0.00054168701171875, 0.00531005859375, 0.01104736328125, 0.00384521484375, 0.03076171875, -0.0037841796875, 0.021240234375, 0.0177001953125, -0.02392578125, 0.0048828125, -0.00592041015625, 0.0152587890625, 0.003875732421875, 0.01104736328125, 0.00555419921875, ...
[ 26040, 4568, 35735, 23, 60212, 5303, 10, 6562, 502, 4867, 18389, 304, 6512, 2594, 181948, 1250, 275, 2886, 117444, 2592, 13903, 31577, 7413, 5584, 101935, 15490, 882, 14653, 82424, 9920, 83, 32354, 23335, 9790, 678, 1632, 43240, 35782, 2603...
[ 0.144775390625, 0.25830078125, 0.221923828125, 0.0950927734375, 0.263916015625, 0.203125, 0.0452880859375, 0.136474609375, 0.09332275390625, 0.124755859375, 0.1873779296875, 0.228759765625, 0.07196044921875, 0.065185546875, 0.1441650390625, 0.09716796875, 0.113037109375, 0.06359863...
embed
58867730_c0
58867730
prolog
0
Title: How do I run a prolog file from the command line and not drop to the repl? Problem title: How do I run a prolog file from the command line and not drop to the repl? Tags: swi-prolog, prolog Problem: How do I run a prolog file from the command line and not drop to the repl? I am trying to execute a prolog script ...
How do I run a prolog file from the command line and not drop to the repl? How do I run a prolog file from the command line and not drop to the repl? swi-prolog prolog the How temp.p Warning temp.p:10 Singleton ERROR temp.p:11 Defined init.pl:3867 How do I run a prolog file from the command line and not drop to the rep...
[ 0.0115966796875, 0.0284423828125, -0.004119873046875, -0.001983642578125, -0.040771484375, 0.000644683837890625, 0.003875732421875, -0.015380859375, 0.003570556640625, -0.0625, 0.0201416015625, 0.01336669921875, -0.027099609375, -0.0014190673828125, 0.01708984375, -0.0079345703125, 0...
[ 11249, 11675, 502, 4867, 11435, 1295, 75101, 13315, 959, 36069, 456, 2424, 136, 47, 91, 2452, 3454, 20805, 254, 5550, 15110, 43609, 1507, 151206, 19993, 5983, 217, 34179, 18197, 31577, 71924, 26499, 5438, 81887, 159, 38969, 10752, 20697, 27...
[ 0.09442138671875, 0.1649169921875, 0.1954345703125, 0.2529296875, 0.1494140625, 0.134521484375, 0.18017578125, 0.1568603515625, 0.0897216796875, 0.1258544921875, 0.037506103515625, 0.1929931640625, 0.048583984375, 0.053741455078125, 0.0062255859375, 0.1956787109375, 0.1488037109375, ...
embed
40665082_c0
40665082
prolog
0
Title: Finding out which rule fired in a prolog file Problem title: Finding out which rule fired in a prolog file Tags: prolog, prolog-toplevel Problem: Finding out which rule fired in a prolog file I have a prolog file that classifies a given predicate bongard(A, X) with given background facts. Snippet of the rules: b...
Finding out which rule fired in a prolog file Finding out which rule fired in a prolog file prolog prolog-toplevel Finding file.pl Finding out which rule fired in a prolog file I have a prolog file that classifies a given predicate bongard(A, X) with given background facts. Snippet of the rules: I am executing this pro...
[ 0.013427734375, 0.015869140625, 0.00311279296875, 0.0142822265625, -0.00933837890625, 0.0166015625, 0.0026397705078125, 0.0096435546875, 0.0068359375, -0.037353515625, 0.00970458984375, -0.0106201171875, -0.01202392578125, -0.00518798828125, 0.0208740234375, 0.00762939453125, 0.01397...
[ 26040, 1810, 3129, 79986, 11476, 71, 23, 502, 4867, 11435, 13784, 67919, 214, 2424, 18507, 27430, 1653, 2063, 67, 3948, 42077, 284, 1193, 76615, 15824, 91736, 71924, 1528, 1884, 2452, 177, 31996, 5861, 11, 33022, 1542, 113054, 40865, 47, ...
[ 0.09027099609375, 0.09912109375, 0.05999755859375, 0.2071533203125, 0.18701171875, 0.101318359375, 0.053619384765625, 0.16259765625, 0.2198486328125, 0.1854248046875, 0.03564453125, 0.1531982421875, 0.01788330078125, 0.13916015625, 0.1207275390625, 0.1173095703125, 0.085693359375, ...
embed
26075463_c1
26075463
prolog
1
the rest of the helper predicates for the clique to work. goodfriends(G, FriendOne, FriendTwo):- getPerson(G, FriendOne, PersonOne), getPerson(G, FriendTwo, PersonTwo), hasFriend(PersonOne, FriendTwo), hasFriend(PersonTwo, FriendOne). %% checks if this friend is goodfriend with all these friends goodFriendWith(_, _, [...
the rest of the helper predicates for the clique to work. goodfriends(G, FriendOne, FriendTwo):- getPerson(G, FriendOne, PersonOne), getPerson(G, FriendTwo, PersonTwo), hasFriend(PersonOne, FriendTwo), hasFriend(PersonTwo, FriendOne). %% checks if this friend is goodfriend with all these friends goodFriendWith(_, _, [...
[ 0.013671875, 0.000545501708984375, 0.0015411376953125, 0.023681640625, -0.0146484375, 0.0263671875, -0.011962890625, -0.0081787109375, 0.0037384033203125, -0.02197265625, 0.020751953125, 0.00154876708984375, -0.0252685546875, -0.0067138671875, 0.004364013671875, 0.0189208984375, 0.00...
[ 10588, 4358, 56, 1653, 2063, 1636, 100, 84435, 4488, 4127, 84240, 7, 724, 128938, 62068, 618, 3613, 2046, 160054, 15270, 1556, 416, 3611, 3949, 12765, 2174, 34391, 83, 678, 756, 23902, 194583, 154663, 1745, 62163, 29458, 3445, 9351, 41382, ...
[ 0.08502197265625, 0.2242431640625, 0.1258544921875, 0.1644287109375, 0.196533203125, 0.08538818359375, 0.0123291015625, 0.265380859375, 0.10009765625, 0.10174560546875, 0.2003173828125, 0.01373291015625, 0.0572509765625, 0.140869140625, 0.1783447265625, 0.042144775390625, 0.165405273...
embed
50283143_c0
50283143
prolog
0
Title: Deleting unwanted elements from list in PROLOG Problem title: Deleting unwanted elements from list in PROLOG Tags: prolog Problem: Deleting unwanted elements from list in PROLOG I have a list, for example [(1,2), (3,4), (5,2), (4,2), (8,0)], and I want to remove, for example, all elements that are not (_,2). So ...
Deleting unwanted elements from list in PROLOG Deleting unwanted elements from list in PROLOG prolog list Deleting PROLOG conta_pos Idk conta_pos_aux Deleting unwanted elements from list in PROLOG I have a list, for example [(1,2), (3,4), (5,2), (4,2), (8,0)], and I want to remove, for example, all elements that are no...
[ -0.006072998046875, 0.0086669921875, 0.00010156631469726562, 0.0015411376953125, -0.0186767578125, 0.01080322265625, -0.004547119140625, -0.0155029296875, 0.020263671875, -0.0220947265625, -0.00872802734375, -0.00160980224609375, -0.003692626953125, 0.0164794921875, -0.000621795654296875...
[ 262, 133, 1916, 51, 3206, 3674, 80854, 1295, 5303, 10514, 47510, 502, 4867, 6615, 7522, 5740, 10442, 23, 765, 133063, 82449, 11516, 10461, 9451, 209069, 3444, 87388, 756, 959, 3564, 1884, 903, 31577, 5117, 10750, 33636, 61475, 12830, 13695,...
[ 0.0650634765625, 0.1470947265625, 0.0029296875, 0.084228515625, 0.1634521484375, 0.059783935546875, 0.1734619140625, 0.07977294921875, 0.1776123046875, 0.191650390625, 0.244140625, 0.1439208984375, 0.2120361328125, 0.152587890625, 0.1478271484375, 0.089111328125, 0.14404296875, 0.0...
embed
74527303_c0
74527303
prolog
0
Title: Why is schedule returning true 3 time instead of the values associated (Prolog) Problem title: Why is schedule returning true 3 time instead of the values associated (Prolog) Tags: prolog Problem: Why is schedule returning true 3 time instead of the values associated (Prolog) /*facts 3.1*/ department(jack,cs). d...
Why is schedule returning true 3 time instead of the values associated (Prolog) Why is schedule returning true 3 time instead of the values associated (Prolog) prolog Why Prolog computer_science software_eng CSE305 CSE332 SE212 SE102 ECO304 ECO302 FIN102 FIN103 Rules Why is schedule returning true 3 time instead of the...
[ 0.0247802734375, 0.021484375, 0.00836181640625, 0.037841796875, -0.04345703125, -0.004974365234375, -0.00787353515625, 0.007354736328125, 0.006439208984375, -0.0284423828125, -0.004119873046875, -0.0076904296875, -0.0201416015625, 0.00787353515625, -0.0107421875, 0.0108642578125, 0.0...
[ 44084, 80889, 30646, 214, 29568, 138, 1733, 64457, 142424, 137272, 10752, 4867, 502, 1250, 13909, 175201, 10975, 13305, 9127, 169920, 123128, 6755, 1530, 49150, 117931, 167555, 1197, 67227, 63620, 139118, 14602, 32354, 3229, 115081, 135758, 1193,...
[ 0.1055908203125, 0.30419921875, 0.1798095703125, 0.022796630859375, 0.1917724609375, 0.1595458984375, 0.193115234375, 0.0953369140625, 0.12890625, 0.14501953125, 0.0797119140625, 0.241943359375, 0.0850830078125, 0.112548828125, 0.03948974609375, 0.08831787109375, 0.140380859375, 0....
embed
14144730_c1
14144730
prolog
1
want in a PEG parser, which is to commit to an option after a certain token sequence has been seen, so the error reporting is refers to that location in the source, instead of to another location where some other option might have been available. It just occurred to me that if the code generated for a rule/predicate c...
want in a PEG parser, which is to commit to an option after a certain token sequence has been seen, so the error reporting is refers to that location in the source, instead of to another location where some other option might have been available. It just occurred to me that if the code generated for a rule/predicate c...
[ 0.026611328125, 0.02001953125, 0.0218505859375, 0.0289306640625, 0, 0.01513671875, 0.0007171630859375, -0.0003948211669921875, 0.00701904296875, 0.013671875, -0.000659942626953125, 0.0185546875, 0.0021209716796875, -0.007476806640625, 0.0159912109375, -0.0012969970703125, -0.01000976...
[ 3444, 23, 436, 25176, 366, 2189, 83, 47, 375, 4007, 35829, 7103, 24233, 1098, 40, 944, 3956, 1556, 51592, 18499, 13416, 15005, 31913, 31344, 64457, 13648, 19882, 18151, 139392, 79986, 19714, 2063, 105556, 190355, 297, 441, 1003, 3900, 3638,...
[ 0.166015625, 0.07257080078125, 0.12939453125, 0.2427978515625, 0.174072265625, 0.1759033203125, 0.01324462890625, 0.1187744140625, 0.1376953125, 0.21728515625, 0.2255859375, 0.111328125, 0.06402587890625, 0.197021484375, 0.0300445556640625, 0.0947265625, 0.0203399658203125, 0.04501...
embed
59057964_c0
59057964
prolog
0
Title: Tree Breadth-First in Prolog Problem title: Tree Breadth-First in Prolog Tags: prolog Problem: Tree Breadth-First in Prolog I have a tree : Whith this code : /* The tree database */ :- op(500,xfx,'is_parent'). a is_parent b. c is_parent g. f is_parent l. j is_parent q. a is_parent c. c is_parent h. f is_parent m...
Tree Breadth-First in Prolog Tree Breadth-First in Prolog prolog Tree Breadth-First Prolog is_parent Tree Breadth-First in Prolog I have a tree : Whith this code : I would like to do a depth-first research and a breadth-first research : For the depth-first research, I did: The rule works : a -> b -> e -> k -> f -> l ->...
[ 0.0341796875, 0.0225830078125, 0.00156402587890625, 0.020751953125, -0.009521484375, -0.00787353515625, -0.0179443359375, -0.00732421875, -0.01092529296875, -0.06298828125, 0.00148773193359375, -0.02099609375, -0.009521484375, 0.01416015625, 0.000606536865234375, -0.00787353515625, -...
[ 101344, 6499, 712, 927, 207263, 23, 1250, 4867, 502, 83, 99547, 765, 53201, 127325, 18151, 2806, 1884, 54, 168867, 13448, 271, 25188, 179967, 79986, 43240, 876, 472, 1238, 347, 8096, 91, 3714, 3642, 903, 1810, 214, 1647, 808, 110, 37105, ...
[ 0.26025390625, 0.196044921875, 0.1572265625, 0.1773681640625, 0.1993408203125, 0.03753662109375, 0.175048828125, 0.215576171875, 0.1419677734375, 0.035736083984375, 0.1939697265625, 0.0489501953125, 0.2120361328125, 0.00299072265625, 0.132568359375, 0.006317138671875, 0.076171875, ...
embed
47116350_c0
47116350
prolog
0
Title: How to Compare two lists with values and ranges in Prolog Problem title: How to Compare two lists with values and ranges in Prolog Tags: range, prolog, list, comparison Problem: How to Compare two lists with values and ranges in Prolog I'm doing a project, and i'm stuck in a situation where i need to compare two...
How to Compare two lists with values and ranges in Prolog How to Compare two lists with values and ranges in Prolog range prolog list comparison How Compare Prolog How to Compare two lists with values and ranges in Prolog I'm doing a project, and i'm stuck in a situation where i need to compare two lists and return if ...
[ -0.01458740234375, 0.006317138671875, 0.0150146484375, 0.0169677734375, -0.003814697265625, 0.00177001953125, 0.0029754638671875, 0.009521484375, 0.00022602081298828125, 0.0224609375, 0.0172119140625, 0.032958984375, 0.02099609375, -0.00787353515625, 0.016845703125, 0.003265380859375, ...
[ 11249, 113307, 13, 6626, 5303, 7, 678, 142424, 136, 37457, 1250, 4867, 502, 225490, 13452, 179933, 69101, 30646, 2174, 19713, 32786, 83, 15700, 8781, 70541, 101935, 363, 94250, 50258, 2588, 2967, 17, 67, 98767, 29568, 5117, 14858, 34627, 18...
[ 0.03924560546875, 0.2022705078125, 0.0860595703125, 0.1383056640625, 0.2462158203125, 0.00457763671875, 0.07891845703125, 0.1373291015625, 0.0421142578125, 0.1842041015625, 0.152099609375, 0.2255859375, 0.1217041015625, 0.20703125, 0.012420654296875, 0.0204620361328125, 0.20202636718...
embed
12175377_c0
12175377
prolog
0
Title: Deleting all occurrences of an element from a list Problem title: Deleting all occurrences of an element from a list Tags: prolog-dif, prolog Problem: Deleting all occurrences of an element from a list Trying to write a procedure that given a value and a list, it deletes all the occurence of that value in the li...
Deleting all occurrences of an element from a list Deleting all occurrences of an element from a list prolog-dif prolog a Deleting Deleting all occurrences of an element from a list Trying to write a procedure that given a value and a list, it deletes all the occurence of that value in the list a wrote: Since the cut t...
[ 0.01519775390625, 0.01129150390625, 0.0135498046875, -0.005645751953125, -0.00311279296875, -0.00384521484375, 0.003326416015625, 0.015625, 0.01519775390625, -0.0201416015625, 0.003387451171875, 0.004150390625, -0.005096435546875, 0.002838134765625, -0.004974365234375, -0.0040893554687...
[ 262, 133, 1916, 756, 74918, 42, 69098, 12830, 1295, 5303, 502, 4867, 428, 420, 10, 40858, 33022, 50491, 34292, 8, 74635, 6620, 54397, 59226, 18151, 53418, 35166, 26785, 41, 154109, 70, 314, 933, 35782, 65395, 29568, 98320, 43240, 12765, 1...
[ 0.06488037109375, 0.15966796875, 0.07763671875, 0.1446533203125, 0.16259765625, 0.119873046875, 0.097900390625, 0.1722412109375, 0.0928955078125, 0.1849365234375, 0.114990234375, 0.1795654296875, 0.0538330078125, 0.0977783203125, 0.004608154296875, 0.01348876953125, 0.05889892578125,...
embed
21067160_c0
21067160
prolog
0
Title: How to write prolog rule? Problem title: How to write prolog rule? Tags: prolog Problem: How to write prolog rule? I am trying to create a prolog rule which will generate all the people in a social network using S number degrees of separation. This is the rule that i have made but it is only printing empty lists...
How to write prolog rule? How to write prolog rule? prolog How Separation Separation-1 How to write prolog rule? I am trying to create a prolog rule which will generate all the people in a social network using S number degrees of separation. This is the rule that i have made but it is only printing empty lists. Can som...
[ 0.015869140625, 0.021240234375, -0.010498046875, 0.04638671875, -0.00946044921875, 0.0089111328125, -0.0194091796875, 0.0084228515625, 0.000171661376953125, -0.03515625, 0.0189208984375, -0.0169677734375, 0.00823974609375, 0.0020904541015625, 0.0162353515625, 0.00001990795135498047, ...
[ 11249, 47, 33022, 502, 4867, 79986, 503, 2500, 2320, 5759, 31577, 28282, 139392, 756, 3395, 2265, 33120, 159, 14012, 79385, 37451, 1363, 7228, 1284, 4734, 2448, 1916, 201505, 5303, 4358, 120592, 28219, 15400, 123087, 7730, 44691, 15824, 7880,...
[ 0.118408203125, 0.060546875, 0.2242431640625, 0.2012939453125, 0.270751953125, 0.2373046875, 0.116943359375, 0.208984375, 0.0697021484375, 0.132568359375, 0.05010986328125, 0.1007080078125, 0.1572265625, 0.0716552734375, 0.120361328125, 0.1219482421875, 0.1751708984375, 0.087585449...
embed
13895668_c0
13895668
prolog
0
Title: How to write optional in SWI-Prolog Problem title: How to write optional in SWI-Prolog Tags: prolog, dcg Problem: How to write optional in SWI-Prolog I need to implement some rules by Prolog ex: S ---> A,[b],{c}. Where: [b] could happen once or none like 0 or 1 time {c} could happen 0,1,2,...times How can i writ...
How to write optional in SWI-Prolog How to write optional in SWI-Prolog prolog dcg How SWI-Prolog feal_amr mfoal_beh sefa_optional shbh_gomla mfoal_motlk parse_topdown Category Reststring Subtrees RHS How to write optional in SWI-Prolog I need to implement some rules by Prolog ex: S ---> A,[b],{c}. Where: [b] could hap...
[ 0.035888671875, 0.0189208984375, 0.01483154296875, 0.0263671875, -0.0250244140625, 0.006195068359375, -0.00946044921875, -0.0218505859375, 0.004302978515625, -0.01263427734375, -0.005523681640625, -0.0137939453125, 0.0057373046875, -0.02001953125, 0.0152587890625, 0.0250244140625, 0....
[ 11249, 47, 33022, 35829, 289, 23, 159, 38969, 10752, 4867, 502, 238, 177, 3820, 302, 42, 3584, 35074, 40, 1021, 109585, 5871, 40766, 143, 12121, 366, 13784, 34695, 49057, 49756, 91693, 8273, 2921, 68416, 294, 29479, 91736, 1250, 20, 15274...
[ 0.07000732421875, 0.031005859375, 0.2100830078125, 0.234130859375, 0.248291015625, 0.05242919921875, 0.112060546875, 0.2081298828125, 0.1402587890625, 0.2132568359375, 0.114501953125, 0.04180908203125, 0.09130859375, 0.1531982421875, 0.040985107421875, 0.0909423828125, 0.081115722656...
embed
74493152_c1
74493152
prolog
1
implementation of unique/1 , subset/2 and unordered_subset/2 I used in my program (Found on StackOverflow, don't know if there is better but it seems to work). % unique/1 detect list formed by unique elements unique([]). unique([X|Xs]) :- \+ memberchk(X, Xs), unique(Xs). % subset/2 (set, subset) true if subset is a su...
implementation of unique/1 , subset/2 and unordered_subset/2 I used in my program (Found on StackOverflow, don't know if there is better but it seems to work). % unique/1 detect list formed by unique elements unique([]). unique([X|Xs]) :- \+ memberchk(X, Xs), unique(Xs). % subset/2 (set, subset) true if subset is a su...
[ 0.0213623046875, 0.0225830078125, 0.0257568359375, -0.0087890625, 0.00506591796875, -0.000293731689453125, -0.00457763671875, -0.01513671875, 0.0260009765625, 0.00238037109375, -0.00421142578125, 0.024169921875, -0.00145721435546875, -0.006317138671875, -0.01226806640625, -0.0108642578...
[ 208124, 36998, 11583, 1614, 3509, 12477, 136, 51, 80596, 297, 22144, 11814, 1528, 156673, 118664, 11522, 4488, 1745, 96391, 5303, 100, 80854, 1542, 58745, 1328, 32786, 206, 92, 1193, 29568, 2174, 5423, 5701, 12989, 9874, 379, 25820, 294, 12...
[ 0.1903076171875, 0.29296875, 0.2159423828125, 0.2255859375, 0.1981201171875, 0.29638671875, 0.03948974609375, 0.07476806640625, 0.2095947265625, 0.0306243896484375, 0.1981201171875, 0.10357666015625, 0.124267578125, 0.016143798828125, 0.04302978515625, 0.07244873046875, 0.09875488281...
embed
23283690_c0
23283690
prolog
0
Title: Generating A List Of Prime Numbers Problem title: Generating A List Of Prime Numbers Tags: primes, prolog Problem: Generating A List Of Prime Numbers I need to generate a list of prime numbers in a given range (between 1 and N). I developed an algorithm to check whether an given number is prime and it is working...
Generating A List Of Prime Numbers Generating A List Of Prime Numbers primes prolog Generating List Prime Numbers P39 Given ensure_loaded p31 is_prime prime_list p_list Generating A List Of Prime Numbers I need to generate a list of prime numbers in a given range (between 1 and N). I developed an algorithm to check whe...
[ -0.0213623046875, 0.0167236328125, 0.024658203125, 0.00384521484375, 0.00811767578125, 0.012451171875, -0.015380859375, -0.00909423828125, 0.021240234375, -0.011474609375, -0.013427734375, -0.0091552734375, 0.007080078125, 0.006988525390625, -0.0033416748046875, 0.004180908203125, 0....
[ 155370, 1916, 32036, 6619, 56195, 103332, 62, 20809, 7, 502, 4867, 436, 9323, 77878, 63284, 63033, 915, 5016, 83, 114654, 6562, 3871, 139392, 5303, 111, 101935, 34475, 37457, 1177, 106, 136, 541, 126809, 234873, 12765, 36766, 14012, 20697, ...
[ 0.1998291015625, 0.07037353515625, 0.1937255859375, 0.0968017578125, 0.206298828125, 0.1873779296875, 0.029022216796875, 0.2294921875, 0.005279541015625, 0.129150390625, 0.1588134765625, 0.0823974609375, 0.2255859375, 0.046478271484375, 0.2109375, 0.12060546875, 0.066162109375, 0.2...
embed
59425760_c0
59425760
prolog
0
Title: Prolog: eliminate repetitions in query Problem title: Prolog: eliminate repetitions in query Tags: prolog Problem: Prolog: eliminate repetitions in query I've been trying to write a simple code, that would behave in this manner: | ?- hasCoppiesOf(X,[a,b,a,b,a,b,a,b]). X = [a,b] ? ; X = [a,b,a,b] ? ; X = [a,b,a,b...
Prolog: eliminate repetitions in query Prolog: eliminate repetitions in query prolog Prolog Prolog: eliminate repetitions in query I've been trying to write a simple code, that would behave in this manner: And This desire resulted in next piece of code: And it gives me what I want on the second query, however, the firs...
[ -0.009033203125, 0.01446533203125, 0.0164794921875, 0.00058746337890625, 0.0034332275390625, -0.013916015625, 0.00124359130859375, 0.00787353515625, 0.015625, -0.055419921875, -0.0038299560546875, 0.01611328125, 0.009765625, 0.00885009765625, 0.0162353515625, 0.015625, 0.018310546875...
[ 1250, 4867, 27169, 67, 57346, 5256, 23, 41, 1294, 502, 31577, 33022, 8781, 18151, 68991, 104851, 11737, 76199, 2367, 3444, 17932, 5117, 50339, 37202, 20697, 5885, 1363, 5701, 35166, 15044, 1314, 121742, 3917, 3249, 140992, 4589, 31182, 42551,...
[ 0.1734619140625, 0.2396240234375, 0.1739501953125, 0.07562255859375, 0.29150390625, 0.128662109375, 0.07891845703125, 0.17041015625, 0.125244140625, 0.1351318359375, 0.032318115234375, 0.01171875, 0.0531005859375, 0.1104736328125, 0.0426025390625, 0.12548828125, 0.0250244140625, 0....
embed
16667038_c0
16667038
prolog
0
Title: Finding values without creating new unifications Problem title: Finding values without creating new unifications Tags: unification, prolog Problem: Finding values without creating new unifications I have a set of definitions of the form pair/2 and a predicate propagate/3 : pair(1, 2). pair(2, 3). pair(3, 4). pai...
Finding values without creating new unifications Finding values without creating new unifications unification prolog Finding Num Tail ResultTail Result List Finding values without creating new unifications I have a set of definitions of the form pair/2 and a predicate propagate/3 : If I have List = [pair(1, 2), pair(2,...
[ 0.01287841796875, 0.018310546875, 0.037841796875, -0.0023040771484375, -0.006591796875, -0.003326416015625, -0.0302734375, -0.006256103515625, 0.0033416748046875, -0.0283203125, 0.00494384765625, 0.00091552734375, 0.0047607421875, -0.021240234375, 0.004730224609375, 0.0079345703125, ...
[ 26040, 214, 142424, 15490, 105233, 3525, 51, 41274, 502, 4867, 52782, 1218, 379, 126684, 9874, 32036, 80934, 3173, 80836, 12477, 1653, 2063, 175648, 67, 18113, 109637, 4958, 8439, 86827, 13956, 105801, 21162, 2046, 104851, 140992, 138, 5303, ...
[ 0.1484375, 0.00738525390625, 0.231201171875, 0.1273193359375, 0.1025390625, 0.05682373046875, 0.1309814453125, 0.12548828125, 0.096923828125, 0.1510009765625, 0.151611328125, 0.1385498046875, 0.119873046875, 0.2454833984375, 0.09661865234375, 0.19189453125, 0.1336669921875, 0.17297...
embed
71637397_c0
71637397
prolog
0
Title: How can I return a list of numbers from a given list that mod 0 a target number? Problem title: How can I return a list of numbers from a given list that mod 0 a target number? Tags: prolog, sublist, math, list, recursion Problem: How can I return a list of numbers from a given list that mod 0 a target number? I...
How can I return a list of numbers from a given list that mod 0 a target number? How can I return a list of numbers from a given list that mod 0 a target number? prolog sublist math list recursion a How Base Recursive Want How can I return a list of numbers from a given list that mod 0 a target number? In my function m...
[ -0.035400390625, -0.0064697265625, 0.0191650390625, -0.006744384765625, 0.00433349609375, 0.0235595703125, -0.008544921875, -0.0017852783203125, 0.026611328125, 0.003875732421875, 0.0150146484375, -0.01708984375, 0.0010986328125, -0.005523681640625, 0.0125732421875, -0.00860595703125, ...
[ 11249, 831, 30646, 5303, 101935, 1295, 34475, 2811, 757, 30388, 14012, 450, 502, 4867, 1614, 6562, 48909, 195625, 1830, 44978, 853, 48650, 5844, 42335, 32354, 98198, 297, 1542, 1723, 1511, 10, 139392, 35509, 5773, 990, 567, 8305, 12638, 142...
[ 0.07025146484375, 0.0841064453125, 0.238525390625, 0.2083740234375, 0.1741943359375, 0.1083984375, 0.1285400390625, 0.1907958984375, 0.2000732421875, 0.253662109375, 0.1441650390625, 0.0271759033203125, 0.1024169921875, 0.212158203125, 0.1436767578125, 0.175048828125, 0.0817260742187...
embed
62465661_c0
62465661
prolog
0
Title: Deterministic Finite Automaton with Prolog Problem title: Deterministic Finite Automaton with Prolog Tags: prolog, state-machine Problem: Deterministic Finite Automaton with Prolog I'm trying to create a Deterministic Finite Automaton(DFA) with Prolog but I'm stuck. I didn't have this problem with Haskell, so I ...
Deterministic Finite Automaton with Prolog Deterministic Finite Automaton with Prolog prolog state-machine Deterministic Finite Automaton Prolog State Symbol Symbols NextState df1 Deterministic Finite Automaton with Prolog I'm trying to create a Deterministic Finite Automaton(DFA) with Prolog but I'm stuck. I didn't ha...
[ 0.031005859375, -0.004547119140625, 0.01177978515625, 0.031005859375, -0.01348876953125, -0.01068115234375, -0.01806640625, 0.01239013671875, -0.005767822265625, -0.02001953125, 0.017822265625, 0.00823974609375, -0.0067138671875, 0.01104736328125, 0.01019287109375, 0.004547119140625, ...
[ 262, 30524, 48242, 13316, 1486, 51719, 191, 678, 1250, 4867, 502, 11341, 103149, 22836, 131899, 4997, 135206, 104, 420, 418, 31577, 28282, 397, 14676, 179933, 765, 2967, 20625, 142508, 77947, 4358, 2060, 16940, 14847, 11675, 5608, 2046, 29568...
[ 0.081298828125, 0.207275390625, 0.09130859375, 0.145263671875, 0.114501953125, 0.2044677734375, 0.145263671875, 0.0777587890625, 0.175537109375, 0.265380859375, 0.1253662109375, 0.1085205078125, 0.1173095703125, 0.129150390625, 0.193115234375, 0.10479736328125, 0.131103515625, 0.04...
embed
67507544_c0
67507544
prolog
0
Title: list of repetitions of another list given the number of repetitions Problem title: list of repetitions of another list given the number of repetitions Tags: prolog Problem: list of repetitions of another list given the number of repetitions im trying to build a predicate itrepeats(all,part,num0,num) "all" is the...
list of repetitions of another list given the number of repetitions list of repetitions of another list given the number of repetitions prolog N-1 list of repetitions of another list given the number of repetitions im trying to build a predicate itrepeats(all,part,num0,num) "all" is the complete list of repetitions of ...
[ -0.0030364990234375, -0.007110595703125, 0.000873565673828125, 0.03662109375, -0.007568359375, 0.0130615234375, -0.00799560546875, 0.0029296875, 0.0238037109375, -0.0133056640625, 0.0037078857421875, -0.00171661376953125, -0.01324462890625, 0.02099609375, 0.005462646484375, 0.005401611...
[ 5303, 57346, 5256, 111, 15700, 34475, 14012, 502, 4867, 541, 5759, 31577, 45367, 1653, 2063, 442, 107, 1081, 9821, 5584, 17365, 2606, 2389, 83, 28484, 51312, 27781, 13538, 7077, 5608, 201505, 37842, 22027, 18, 4488, 6626, 80854, 1884, 71924...
[ 0.200927734375, 0.298583984375, 0.1361083984375, 0.040618896484375, 0.09771728515625, 0.0738525390625, 0.0863037109375, 0.1153564453125, 0.1490478515625, 0.02197265625, 0.10107421875, 0.035980224609375, 0.09222412109375, 0.0811767578125, 0.1207275390625, 0.036224365234375, 0.10803222...
embed
44354599_c0
44354599
prolog
0
Title: Write a function accepting wrapped constants, but only one level deep Problem title: Write a function accepting wrapped constants, but only one level deep Tags: prolog Problem: Write a function accepting wrapped constants, but only one level deep I want to write a function ( apologies for probably not using the ...
Write a function accepting wrapped constants, but only one level deep Write a function accepting wrapped constants, but only one level deep prolog Write not_in_knowledge_base Write a function accepting wrapped constants, but only one level deep I want to write a function ( apologies for probably not using the correct t...
[ 0.021728515625, 0.017822265625, -0.00015354156494140625, 0.006103515625, 0.003936767578125, 0.01129150390625, -0.0198974609375, -0.023681640625, -0.01104736328125, 0.00439453125, 0.002288818359375, 0.0203857421875, 0.0024566650390625, 0.0194091796875, 0.0035400390625, 0.011474609375, ...
[ 601, 18781, 32354, 26946, 214, 137565, 20051, 53697, 1284, 4734, 1632, 17366, 53894, 502, 4867, 959, 73, 69723, 181606, 37382, 3444, 33022, 148, 34, 73163, 29568, 29458, 3934, 15700, 135355, 89536, 5844, 78574, 208124, 33342, 1884, 43240, 831...
[ 0.06292724609375, 0.1029052734375, 0.2039794921875, 0.1595458984375, 0.016143798828125, 0.2109375, 0.1331787109375, 0.215087890625, 0.047271728515625, 0.08587646484375, 0.1131591796875, 0.214599609375, 0.22314453125, 0.13720703125, 0.2061767578125, 0.153076171875, 0.11669921875, 0....
embed
38241088_c0
38241088
prolog
0
Title: Prolog select only first solution Problem title: Prolog select only first solution Tags: prolog Problem: Prolog select only first solution I have this code that return a lot of solutions, but I only need the first list, I think that I must work with some cut but I'm new to Prolog and I don't find where i must pu...
Prolog select only first solution Prolog select only first solution prolog Prolog list_s ListS list_slope new_s Nls _G2260 _G2266 _G2272 Prolog select only first solution I have this code that return a lot of solutions, but I only need the first list, I think that I must work with some cut but I'm new to Prolog and I d...
[ 0.0126953125, 0.01251220703125, 0.0142822265625, -0.00116729736328125, -0.030029296875, -0.002410888671875, -0.01373291015625, 0.00970458984375, 0.01385498046875, -0.0281982421875, 0.0137939453125, 0.0208740234375, -0.016845703125, 0.0166015625, 0.0361328125, 0.00897216796875, 0.0052...
[ 1250, 4867, 36849, 4734, 5117, 29806, 502, 5303, 32036, 294, 7, 89059, 3525, 8080, 4015, 4598, 14604, 12825, 903, 18151, 30646, 5915, 51347, 3871, 5351, 4488, 59226, 7440, 8110, 3884, 442, 7103, 114689, 71, 18113, 30022, 2967, 15549, 52295,...
[ 0.1768798828125, 0.263671875, 0.19384765625, 0.1353759765625, 0.15966796875, 0.238037109375, 0.119384765625, 0.192626953125, 0.1905517578125, 0.035736083984375, 0.03466796875, 0.2293701171875, 0.099609375, 0.0941162109375, 0.02960205078125, 0.1307373046875, 0.13623046875, 0.0974121...
embed
23427515_c0
23427515
prolog
0
Title: Endtime for machine in cumulatives Problem title: Endtime for machine in cumulatives Tags: sicstus-prolog, prolog, clpfd Problem: Endtime for machine in cumulatives I'm working on a scheduling problem which I have used cumulatives/3 to model. Ex: s1(Ss, Es, Ms ) :- Ss = [S1,S2,S3,S4,S5,S6,S7], Es = [E1,E2,E3,E4,...
Endtime for machine in cumulatives Endtime for machine in cumulatives sicstus-prolog prolog clpfd Endtime StartTime Duration ResourceCons MachineId Tasks ResourceBound Machines Vars Endtime for machine in cumulatives I'm working on a scheduling problem which I have used cumulatives/3 to model. Ex: If I run the predicat...
[ 0.0238037109375, 0.0021514892578125, 0.013671875, 0.01556396484375, -0.015869140625, -0.0023651123046875, -0.0115966796875, -0.00135040283203125, -0.002044677734375, -0.048828125, 0.0006561279296875, 0.00518798828125, 0.0157470703125, 0.000858306884765625, 0.01177978515625, 0.000033855...
[ 18878, 6032, 100, 36279, 314, 19908, 42991, 23, 18253, 3454, 4867, 502, 71, 13794, 70059, 79843, 152055, 11935, 68311, 9598, 7030, 3323, 20697, 5094, 15246, 2967, 11814, 18113, 3299, 11675, 1653, 2063, 67, 91, 131530, 2046, 27781, 347, 418,...
[ 0.1826171875, 0.24365234375, 0.026397705078125, 0.2113037109375, 0.1019287109375, 0.2205810546875, 0.183349609375, 0.017913818359375, 0.1693115234375, 0.037506103515625, 0.1429443359375, 0.0241851806640625, 0.02880859375, 0.06964111328125, 0.2061767578125, 0.162109375, 0.134521484375...
embed