Logic programming that computational steps cannot be logically deduced. However, in concurrent logic programming, any result of a terminating computation is a logical consequence of the program, and any partial result of a partial computation is a logical consequence of the program and the residual goal (process network). Consequently, the indeterminacy of computations implies that not all logical consequences of the program can be deduced. Concurrent constraint logic programming combines concurrent logic programming and constraint logic programming, using constraints to control concurrency. A clause can contain a guard, which is a set of constraints that may block the applicability of the clause.
Logical possibility Logical possibility Logically possible refers to a proposition which can be the logical consequence of another, based on the axioms of a given system of logic. The logical possibility of a proposition will depend on the system of logic being considered, rather than on the violation of any single rule. Some systems of logic restrict inferences from inconsistent propositions or even allow for true contradictions. Other logical systems have more than two truth-values instead of a binary of such values. However, when talking about logical possibility it is often assumed that the system in question is classical propositional logic. Similarly,