Sentence examples for this restricted version from inspiring English sources

nato was unprepared for even this restricted version of war.

This restricted version of circumscription is shown to have the unitary redundancy property: a CNF formula is redundant (it is equivalent to one of its proper subsets) if and only if it contains a redundant clause (it is equivalent to itself minus one clause); default logic does not have this property in general.

We also introduce a restricted version of MTC and we show that the same inapproximability results hold for this restricted version as well.

For this problem, we first show how to lower bound the bending energy of an optimal curve with bounded curvature, and then use this lower bound to design a (1+ϵ -approximation algorithm for this restricted version of the MinBEP problem.

We combine the large samples of the restricted version of the Canadian Census (1991-2006) with both a new measure of linguistic proximity of the immigrant's mother tongue to that of the destination country, and with information of the occupational skills embodied in the jobs immigrants hold.

[For a full discussion of the required repairs of CP, see David and Warfield 2008; and Hawthorne 2014.] There is one other important, required clarification of the restricted version of CP. "Justified belief" is ambiguous.

Next, we prove set-cover-like inapproximability results for SBC and for the maximum-length version of SBC via a common reduction from the restricted version of MTC introduced in the first section.

In this experiment we tested discrimination of frontal views; this is a very restricted version of the task humans must perform in order to rapidly and accurately discriminate human faces in real situations.

An important outcome of our research is the result, whose proof is also presented in this paper, that a restricted version of the discretized model gives an extended description of the convex hull of the integer solutions of a subproblem that usually arises in network design problems with modular costs.

We also consider a restricted version of this problem with a "fixed maximum" number of possible stars and show that it has a simple polynomial time solution.

This can be seen as a restricted version of the general problem of computing the maximum size of an object to move collision-free from a start position to a goal position.