Motivated by the problem of query answering over multiple structured commonsense theories, we exploit graph-based techniques to improve the efficiency of theorem proving for structured theories. Theories are organized into subtheories that are minimally connected by the literals they share. We present message-passing algorithms that reason over these theories using consequence finding, speciali...

Reciprocal space methods for solving Poisson’s equation for finite charge distributions are investigated. Improvements to previous proposals are presented, and their performance is compared in the context of a real-space density functional theory code. Two basic methodologies are followed: calculation of correction terms, and imposition of a cut-off to the Coulomb potential. We conclude that th...

the annihilating-ideal graph of a commutative ring $r$ is denoted by $ag(r)$, whose vertices are all nonzero ideals of $r$ with nonzero annihilators and two distinct vertices $i$ and $j$ are adjacent if and only if $ij=0$. in this article, we completely characterize rings $r$ when $gr(ag(r))neq 3$.

The spirodienone structure in lignin is a relatively recent discovery, and it has been found to occur in lignin of various plant species at concentrations of ∼3%, which is sufficiently high to be important for better understanding of its properties and reactivity. The cyclic structure, with a β-1 bond, has been proposed to be a precursor for acyclic β-1 linkages in lignin. Previous analytical w...

We use ab initio calculations to study the compositional ordering and quantum transport in Mo6S9−xIx nanowires. The skeleton of these nanowires consists of Mo octahedra, which are functionalized by S and I adsorbates and connected by flexible S3 bridges. The optimum geometries and relative stabilities at different compositions are determined by using density functional theory. We find nanowires...

a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

it is necessary to generate the automorphism group of a chemical graph in computer-aidedstructure elucidation. an euclidean graph associated with a molecule is defined by a weightedgraph with adjacency matrix m = [dij], where for i≠j, dij is the euclidean distance between thenuclei i and j. in this matrix dii can be taken as zero if all the nuclei are equivalent. otherwise,one may introduce dif...

in this paper, we introduce the notions of product vague graph, balanced product vague graph, irregularity and total irregularity of any irregular vague graphs and some results are presented. also, density and balanced irregular vague graphs are discussed and some of their properties are established. finally we give an application of vague digraphs.

We discuss, on general grounds, how two subgraphs of a given Feynman graph can overlap with each other. For this, we use the notion connecting and returning lines that describe any subgraph is inserted within original graph. This, in turn, allows us to derive ``nonoverlap'' theorems for one-particle-irreducible 2, 3 4 external legs. As an application, provide simple justification skeleton expan...