The class of distance hereditary graphs consists of the isometric graphs. That is, for each pair of vertices, its distance is invariant for any induced path in a distance hereditary graph. In the paper, a canonical tree representation of a distance hereditary graph is proposed. A linear time algorithm for computing the tree representation is also presented. Hence the recognition problem and the...

It has been shown recently that deterministic semiautomata can be represented by canonical words and equivalences; that work was motivated by the trace-assertion method for specifying software modules. Here, we generalize these ideas to a class of nondeterministic semiautomata. A semiautomaton is settable if, for every state q, there exists a word wq such that q, and no other state, can be reac...

Building a model of individual preferences is a key for rational decision-making under uncertainty. Since preference can hardly be studied completely, its approximation from partially known preference is very important. The present paper provides a framework for building such approximation for regular preferences on abstract partially ordered set, and then applies the results to preferences on ...

We identify a new representation of propositional knowledge bases, the Sentential Decision Diagram (SDD), which is interesting for a number of reasons. First, it is canonical in the presence of additional properties that resemble reduction rules of OBDDs. Second, SDDs can be combined using any Boolean operator in polytime. Third, CNFs with n variables and treewidth w have canonical SDDs of size...

We give an SU(2) covariant representation of the constraints of Euclidean general relativity in the Ashtekar variables. The guiding principle is the use of triads to transform all free spatial indices into SU(2) indices. A central role is played by a special covariant derivative. The Gauss, diffeomorphism and Hamiltonian constraints become purely algebraic restrictions on the curvature and the ...

We give linear time algorithms constructing canonical representations of partial 2-trees (series-parallel graphs) and partial 3-trees.

This paper surveys problems encountered in studying the logico-semantic form and discourse problems of Finnish query sentences. W e ca ll the logico-semantic form a predication graph. The basic framework we use to represent the logica l form of Finnish query sentences is an annotated logical tree transformed from the dependency parse tree using graph transformations of the AWARE-system. Example...

In this paper, we interpret the Gindikin–Karpelevich formula and the Casselman–Shalika formula as sums over Kashiwara–Lusztig’s canonical bases, generalizing the results of Bump and Nakasuji (2010) [7] to arbitrary split reductive groups. We also rewrite formulas for spherical vectors and zonal spherical functions in terms of canonical bases. In a subsequent paper Kim and Lee (preprint) [14], w...

Related Articles Exploring quantum non-locality with de Broglie-Bohm trajectories J. Chem. Phys. 136, 034116 (2012) Categorical Tensor Network States AIP Advances 1, 042172 (2011) The quantum free particle on spherical and hyperbolic spaces: A curvature dependent approach J. Math. Phys. 52, 072104 (2011) Quantum mechanics without an equation of motion J. Math. Phys. 52, 062107 (2011) Understand...

Interoperation between business partners is extremely important. However, most product data produced in many firms are considered as ad hoc and are not qualified for interoperation. To solve this problem, this paper has proposed a concept-centric definition transformation approach, which transforms irregular local product definitions from different data sources to a set of canonical local produ...