The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasible Argumentation has provided a solid foundation over which the standard formalization of this procedure has been constructed. A key element in the warrant procedure is the criterion according to which two contradictin...

We show that one-loop corrections with the hidden gauge boson loop preserve in the low energy limit all the successful tree level predictions of the hidden local symmetry in the SU(2)L×SU(2)R/SU(2)V chiral Lagrangian. Most amazingly, the ρ meson dominance of the pion electromagnetic form factor survives the one-loop corrections at any momentum, if and only if we take the parameter choice a = 2....

The systematics of deuteronlike two-meson bound states, deusons, is discussed. Previous arguments that many of the present non-qq̄ states are such states are elaborated including, in particular, the tensor potential. For pseudoscalar states the important observation is made that the centrifugal barrier from the P-wave can be overcome by the 1/r and 1/r terms of the tensor potential. In the heavy...

The recently developed equation-of-motion electron-attachment coupled-cluster singles and doubles (EOM-EA-CCSD) method augmented by a complex absorbing potential (CAP) is applied to the Πg resonance of N2 and the Σu resonance of H2 at various internuclear distances. The results illustrate the advantages of EOM-CC for treating resonance states over statespecific approaches. CAP-EOM-EA-CCSD produ...

Acetylene, C2H2, is a prototypical molecule in several respects. As a readily available gas and one of the smallest and most symmetric polyatomic molecules, it is amenable to both experimental and computational study. It is the smallest member of the important family of unsaturated hydrocarbons and is isoelectronic with N2, having in common with those molecules both a bonding πu orbital and an ...

The natural invertible extension T̃ of an Nd-action T has been studied by Lacroix. He showed that T̃ may fail to be mixing even if T is mixing for d ≥ 2. We extend this observation by showing that if T is mixing on (k+ 1) sets then T̃ is in general mixing on no more than k sets, simply because Nd has a corner. Several examples are constructed when d = 2: (i) a mixing T for which T̃ (n,m) has an ide...

It is important for robotic agents to be respectful of the intentions of the human members cohabiting an environment and account for conflicts on the shared resources in the environment, in order to be acceptable members of human-robot ecosystems. In this paper we look at how maintaining predictive models of the human cohabitors in the environment can be used to inform the planning process of t...

Theorem. For each 2 ≤ k < ω there is an Lω1,ω-sentence φk such that: (1) φk is categorical in μ if μ ≤ אk−2; (2) φk is not אk−2-Galois stable; (3) φk is not categorical in any μ with μ > אk−2; (4) φk has the disjoint amalgamation property; (5) For k > 2, (a) φk is (א0,אk−3)-tame; indeed, syntactic first-order types determine Galois types over models of cardinality at most אk−3; (b) φk is אm-Gal...

This paper presents a combinatorial, structure based approach to the problem of finding a (di)similarity measure between two Conceptual Graphs. With a growing number of ontologies and an increasing need for quick, on the fly knowledge integration and querying, ontology similarity measures are essential for building the foundations of the Semantic Web. Conceptual Graphs benefit from a graph base...