Is there such an algorithm and what is it called?

Question

Algorithms

You need to implement the following solution.
There is a list of products
Each product has a group (breakfast, snack, lunch, dinner)
Each product has a subgroup or category (soups, salads, desserts, sauces, side dishes, main course, drink, fruit, vegetable, cheese, additives, nuts, yogurt, dressing, porridge, butter, bread, legumes, berries)
For each group there are conditions for possible combinations of subgroups (the number of conditions is about 20. That is, subgroups can be created based on one or more of the conditions, and not on the sum of all 20 conditions )
As a result, the algorithm should select combinations of products for each group. For example,
Breakfast: oatmeal, cherry
Snack: toast, avocado, salmon
Lunch: pasta, chicken breast, tomato
Snack: cottage cheese, banana
Dinner: rice, beef, asparagus

Answer 1

There is such an algorithm .

Answer 2

perhaps something like this is needed,
although the task is described by you rather poorly , it is
not entirely clear what exactly you need

Answer 3

This algorithm is called a picker. You can implement, for example, by writing all the conditions manually.

Answer 4

In the PROLOG language, such problems are solved quickly. It is necessary to make a set of predicates by which a solution will be found. Recursively by the iteration method built into the language, if I'm not mistaken.