: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no fini...
: Interval algebra networks are traditionally defined over finite intervals. In this paper, we relax this restriction by allowing one or more of the intervals involved to be infini...
: In this paper we consider a multiagent system with multiple ontologies. The agents maintain the ontologies individually which leads to frequent changes and possible knowledge inc...
: Information Systems usually rely on external and independent data sources. When integrating the data to build the integrated repository it is possible to make use of the temporal...
: We prove that two conditions are sufficient, and with three exceptions also necessary, for reachability of any position in restricted walk on integers in which the sizes of the m...