Given a directed graph, k-hop reachability query, u→?kv, is used to check for the existence of path from u v that has length at most k. Addressing queries fundamental task in graph theory and been extensively investigated. However, existing algorithms can be inefficient when answering because they require costly traversal operations. To improve query performance, we propose an approach based on...

Model interpreters play an essential role in modelintegrated systems: they transform domain-specific models into executable models. The state-ot-the-art of model interpreter writing needs to be advanced to enhance the reusability and maintainability of this software. This paper presents an approach which makes this possible through the use of structured specifications. These specifications let ...

Forward traversal methods are used to process queries having nested predicates in object-oriented databases. To expedite the forward traversal, a signature replication technique is proposed. Object signature is a signature formed b y values of all atomic attributes defined in the object. When an object refers to other objects through its attribute, the object signature of the referred object is...

To a given finite graph we associate three kinds of adic, or BratteliVershik, systems: stationary, symbol-count, and reinforced. We give conditions for the natural walk measure to be adic-invariant and identify the ergodic adicinvariant measures for some classes of examples. If the walk measure is adicinvariant we relate its ergodic decomposition to the vector of limiting edge traversal frequen...

Resolution is a proof-search method on proving satisfiability problems. Various refinements have been proposed to improve the efficiency of this method. However, when we try to prove some graph properties, none of the refinements have an efficiency comparable with traditional graph traversal algorithms. In this paper we propose a way of solving some graph traversal problems with resolution. And...

In this paper, author uses set theory to construct a logic model of abstract figure from binary relation. Based on the uniform quantified structure, author gives two logic system for graph traversal and graph coloring respectively, moreover shows a new method of cutting graph. Around this model, there are six algorithms in this paper including exact graph traversal, Algebra calculation of natur...