In this paper we extend our clausal resolution method for linear temporal logics to a branching-time framework. The branching-time temporal logics considered are Computation Tree Logic (CTL), often regarded as the simplest useful logic of this class, and Extended CTL (ECTL), which is CTL extended with fairness operators. The key elements of the resolution method, namely the normal form, the con...

An approach to applying clausal resolution, a proof method for classical logics suited to mechanisation, to temporal logics has been developed by Fisher. The method involves translation to a normal form, classical style resolution within states and temporal resolution between states. The method consists of only one temporal resolution rule and is therefore particularly suitable as the basis of ...

This study measured spatial detection and resolution acuity thresholds at 30 deg eccentricity for sinusoidal gratings of different contrast (10-90%) that phrase reverse at different temporal frequencies (0-40 Hz). Resolution performance at any contrast displayed little deterioration with increasing temporal frequency up to 10 Hz, after which it declined smoothly, indicating no definable break w...

Since the facts in knowledge graph (KG) cannot be updated automatically over time, some have temporal conflicts. To discover and eliminate conflicts KG, this paper proposes a novel conflict resolution method based on KG embedding (named TeCre). Firstly, predicate relation timestamp information of time series are incorporated into entity–relation representation by leveraging (KGE) method. Then, ...