On Melnikov’s persistency problem

Persistency in the Traveling Salesman Problem on Halin graphs

For the Traveling Salesman Problem (TSP) on Halin graphs with three types of cost functions: sum, bottleneck and balanced and with arbitrary real edge costs we compute in polynomial time the persistency partition EAll, ESome, ENone of the edge set E, where: EAll = {e ∈ E, e belongs to all optimum solutions}, ENone = {e ∈ E, e does not belong to any optimum solution} and ESome = {e ∈ E, e belong...

Studies on the Inheritance of Persistency.

Persistency of Connuence 1

A property P of term rewriting systems (TRSs, for short) is said to be persistent if for any many-sorted TRS R, R has the property P if and only if its underlying unsorted TRS (R) has the property P. This notion was introduced by H. Zantema (1994). In this paper, it is shown that con uence is persistent.

Formalizing and Using Persistency

In many formalizations of a changing world things do not change all the t ime but are persistent thoughout a time interval. Often this persistency is represented by facts refering to intervals int which are still valid if int is replaced by any subinterval i n t ' Approaches l ike episode propagat ion or Penberthy's temporal unification try to employ this property for efficient reasoning. Howev...

Generalized Persistency of Excitation

The paper presents the generalized persistency of excitation conditions. They are not only valid for much broader range of applications than their classical counterparts but also elegantly prove the validity of the latter. The novelty and the significance of the approach presented in this publication is due to employing the time averaging technique.