he computational model for Logic Programs is based on a ´specific kind of Logical Inference. Which? Recursion Subsumption Resolution Unification

The computational model for Logic Programs is primarily based on Unification. Unification is a process that allows for the matching of different logical expressions by finding a substitution that makes the different expressions identical. It plays a critical role in resolution, a fundamental aspect of logic programming, particularly in Prolog.

1. Unification enables the integration of variables into logical statements, allowing for the handling of complex predicates and rules in a flexible manner.
2. In logic programming, unification acts as the mechanism through which clauses can be made compatible, enabling the system to derive conclusions from a set of facts and rules.
3. Although recursion plays a significant part in logic programming, it is not a core computational model but rather a method used within the framework that benefits from unification.

In summary, while several concepts play roles in logic programming, unification is the specific kind of logical inference that underpins the computational model for Logic Programs.