Constraint satisfaction is a challenging problem in Interval Algebra (IA). So there are many efforts to attack this problem. After building a matrix method to deal with temporal reasoning problems, we develop basic techniques for applying the matrix method to constraint satisfaction in this paper. Thus, the propagating rules and the algorithms of 3and path-consistency are studied. If our matrix...

INTRODUCTION Tinnitus is considered as one of the major symptom associated with many pathologies along with its presence in individuals with normal hearing. With varied cause and mechanism of its generation and increase in number of individuals with complaint of tinnitus, rehabilitation becomes crucial for Audiologists. OBJECTIVE Study was undertaken to find the efficacy of Residual Inhibitio...

An abstract polytope of rank n is said to be chiral if its automorphism group has two orbits on flags, with adjacent flags lying in different orbits. In this paper, we describe a method for constructing finite chiral n-polytopes, by seeking particular normal subgroups of the orientation-preserving subgroup of n-generator Coxeter group (having the property that the subgroup is not normalized by ...

The main result of this paper states that the isomorphism for ω-automatic trees of finite height is at least has hard as second-order arithmetic and therefore not analytical. This strengthens a recent result by Hjorth, Khoussainov, Montalbán, and Nies [HKMN08] showing that the isomorphism problem for ωautomatic structures is not in Σ 2 . Moreover, assuming the continuum hypothesis CH, we can sh...

The main result of this paper is that the isomorphism for ω-automatic trees of finite height is at least has hard as second-order arithmetic and therefore not analytical. This strengthens a recent result by Hjorth, Khoussainov, Montalbán, and Nies [9] showing that the isomorphism problem for ω-automatic structures is not Σ 2 . Moreover, assuming the continuum hypothesis CH, we can show that the...