In this contribution, an implicative variant of the conjunctive normal form will be recalled and further studied. This normal form is an alternative to the Perfilieva’s conjunctive normal form. It will be shown that it is a suitable model for a particular case of graded fuzzy rules introduced as a generalization of classical fuzzy rules. Moreover, approximation properties of the implicative var...

The scheme that searching over the encrypted data, which is also named conjunctive keyword searchable scheme, enables one to search the encrypted data by using conjunctive keywords. The concept was first presented by Golle et al., and then Park et al. extended their scheme into a public key system. According to the existing conjunctive keyword searchable schemes and the assumption that Golle et...

Uninorms are a generalization of t-norms and tconorms for which the neutral element is an element of [0,1] which is not necessarily equal to 0 (as for t-norms) or 1 (as for t-conorms). Uninorms on the unit interval are either conjunctive or disjunctive, i.e. they aggregate the pair (0,1) to either 0 or 1. In reallife applications, this kind of aggregation may be counter-intuitive. Atanassov’s i...

It is demonstrated that unambiguous conjunctive grammars over a unary alphabet Σ = {a} have non-trivial expressive power, and that their basic properties are undecidable. The key result is that for every base k > 11 and for every one-way real-time cellular automaton operating over the alphabet of base-k digits { d k+9 4 e, . . . , b k+1 2 c } , the language of all strings a with the base-k nota...

Query containment is a fundamental algorithmic task in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries has long been known to be NP-complete. SQL queries, however, are typically evaluated under bag semantics and return multisets as answers, since duplicates are not eliminated unless explicitly specified. The exact complexity...

Conjunctive queries are the most basic and central class of database queries. With continued growth demands to manage process massive volume different types data, there is little research study conjunctive between relation tree data. In this paper, we Cross-Model Queries (CMCQs) over tree-structured data (XML JSON). To efficiently CMCQs with bounded intermediate results first encode nodes posit...