The semantics of everyday language and the semantics of its naive translation into classical first-order language considerably differ. An important discrepancy that is addressed in this paper is about the implicit assumption what exists. For instance, in the case of universal quantification natural language uses restrictions and presupposes that these restrictions are non-empty, while in classi...

The research and application of predictive functional control is mainly focused on single-variable system. The actual object is multivariable systems. So it is necessary to research a predictive functional control for multivariable systems. This paper mainly studied the basis function, reference trajectory, and the output of the predictive model. Finally, The expressions of control of the multi...

We show that Hilbert type proof systems for classical firstorder logic can be reduced to if-then-else equational logic without losing any substantial efficiency: i.e., for any such proof system H, there exist constants k1, k2 > 0 such that for any proof ψ with size ` in H, there exists a corresponding proof ψ̄ in the if-then-else equational proof system, denoted ITE, with size less than or equal...

Many search trees are impractically large to explore exhaustively. Recently, techniques like limited discrepancy search have been proposed for improving the chance of nding a goal in a limited amount of search. Depth-bounded discrepancy search ooers such a hope. The motivation behind depth-bounded discrepancy search is that branching heuristics are more likely to be wrong at the top of the tree...

It has been shown recently that heuristic and width-based search can be combined to produce planning algorithms with a performance that goes beyond the state-of-the-art. Such algorithms are based on best-first width search (BFWS), a plain best-first search set with evaluations functions combined lexicographically to break ties, some of which express noveltybased preferences. In BFWS(f5), for ex...

Recently, Tu and Deng [1] proposed a combinatorial conjecture on binary string, on the premise that the conjecture is correct they obtain two classes of Boolean functions which are both algebraic immunity optimal: the first class of functions are also bent. The second class are balanced functions, which have optimal algebraic degree and the best nonlinearity up to now. In this paper, from three...

Monotone systems preserve a partial ordering of states along system trajectories and are often amenable to separable Lyapunov functions that are either the sum or the maximum of a collection of functions of a scalar argument. In this paper, we consider constructing separable Lyapunov functions for monotone systems that are also contractive, that is, the distance between any pair of trajectories...

an operator associated with the wright function is introduced in the open unit disk. differential subordination and superordination results associated with this operator are obtained by investigating appropriate classes of admissible functions. in particular, some inequalities for modified bessel functions are also obtained.