Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates. We go outside Boolean realm and consider circuits built of any fixed set of gates on an arbitrary large finite domain. From the complexity point of view this...

Landmark heuristics are perhaps the most accurate current known admissible heuristics for optimal planning. A disjunctive action landmark can be seen a form of at-least-one constraint on the actions it contains. In many domains, some critical propositions have to be established for a number of times. Propositional landmarks are too weak to express this kind of constraints. In this paper, we pro...

When transmitting the data in digital communication, it is well desired that bits should be as minimal possible, so many techniques are used to compress data. In this paper, a Lempel-Ziv algorithm for compression was implemented through VHDL coding. One of most lossless algorithms commonly Lempel-Ziv. The work paper devoted improve rate, space-saving, and utilization using systolic array approa...

This paper introduces a multi-valued variant of higher-order resolution and proves it correct and complete with respect to a variant of Henkin’s general model semantics. This resolution method is parametric in the number of truth values as well as in the particular choice of the set of connectives (given by arbitrary truth tables) and even substitutional quantifiers. In the course of the comple...

Interval-valued intuitionistic fuzzy number uses membership degree and non-member ship degree to express a decision-maker’s hesitation, which make decision-maker express his/her opinion in uncertainty decision-making environment easily. The comparison between some intervalvalued intuitionistic fuzzy numbers can not be undertaken because of its limitation. In application such as weak consistency...

In this paper, based on viscosity technique with perturbation, we introduce a new non-linear viscosity algorithm for finding a element of the set of fixed points of nonexpansivemulti-valued mappings in a Hilbert space. We derive a strong convergence theorem for thisnew algorithm under appropriate assumptions. Moreover, in support of our results, somenumerical examples (u...

Permutation Lempel-Ziv complexity (PLZC) is a recently proposed method for analyzing signal complexity. However, PLZC only characterizes the from single scale and has certain limitations. In order to overcome these shortcomings improve performance of feature extraction underwater acoustic signal, this paper introduced coarse graining operation, multi-scale permutation (MPLZC), an automatic hybr...