An important reasoning task, in addition to the standard DL reasoning services, is conjunctive query answering. In this paper, we present algorithms for conjunctive query answering in the expressive Description Logics SHQ and SHOQ. In particular, we allow for transitive (or nonsimple) roles in the query body, which is a feature that is not supported by other existing conjunctive query answering...

In this paper, we firstly show that the $N$-dual operation of the right residual implication, which is induced by a left-conjunctive right arbitrary $vee$-distributive left semi-uninorm, is the right residual coimplication induced by its $N$-dual operation. As a dual result, the $N$-dual operation of the right residual coimplication, which is induced by a left-disjunctive right arbitrary $wedge...

In the paper we consider the generalization of the conjunctive rule in the theory of imprecise probabilities. Let us remind that the conjunction rule, produced on credal sets, gives their intersection and it is not defined if this intersection is empty. In the last case the sources of information are called contradictory1. Meanwhile, in the Dempster-Shafer theory it is possible to use the conju...

We assessed the role of the DRD2 dopaminergic striatal gene polymorphism on performance in unidimensional and conjunctive rule-based category learning tasks. The unidimensional task requires a rule along a single stimulus dimension, while the conjunctive rule task utilizes a combination of two dimensions to distinguish members of each category. The results show that DRD2 C957T T allele carriers...

This paper presents a syntactic analysis method that first detects conjunctive structures in a sentence by checking parallelism of two series of words and then analyzes the dependency structure of the sentence with the help of the information about the conjunctive structures. Analysis of long sentences is one of the most difficult problems in natural language processing. The main reason for thi...

We consider a problem for storing a map that associates a key with a set of values. To store n values from the universe of size m, it requires log2 ( m n ) bits of space, which can be approximated as (1.44 + n) log2 m/n bits when n ≪ m. If we allow ε fraction of errors in outputs, we can store it with roughly n log2 1 ε bits, which matches the entropy bound. Bloom filter is a wellknown example ...