We study the computational complexity of the qualitative algebra which is a temporal formalism that combines the point algebra, the point-interval algebra and Allen’s interval algebra. We identify all tractable fragments containing the point algebra and show that, for all other fragments containing the point algebra, the problem is NP-complete.

advance a modern extension formation of cubic vague sets identified as interval (CIVSs). similarly describe the idea (ICIVSs) (ECIVSs) by examples debate their exciting properties, excluding ICIVSs ECIVSs - . Additionally, show ( ECIVSs) necessity not be an ICIVS (or ECIVS). apply (CIVS) to topological spaces and present spaces. Further, we introduce P-cubic space R-cubic space. We discuss basi...

In many practical situations, one may be interested in knowing the extent to which the system will survive an interval of duration after it has been run for a long time. In such situation, the limiting interval reliability may be used as an appropriate measure for system effectiveness. Also, since it is difficult to obtain closed form expressions for the interval reliability, except for few sim...