Abstract The paper introduces a new type of rules into Natural Deduction, elimination by composition. Elimination composition replace usual in the style disjunction and give more direct treatment additive disjunction, multiplicative conjunction, existence quantifier possibility modality. have an enormous impact on proof-structures deductions: they do not produce segments, deduction trees remain...

This paper deals with the formal derivation of an eecient tabulation algorithm for table-driven bottom-up tree acceptors. Bottom-up tree acceptors are based on a notion of match sets. First we derive a naive acceptance algorithm using dynamic computation of match sets. Tabulation of match sets leads to an eecient acceptance algorithm, but tables may be so large that they can not be generated du...

We present cTI, a system for bottom-up termination inference. Termination inference is a generalization of termination analy-sis/checking. Traditionally, a termination analyzer tries to prove that a given class of queries terminates. This class must be provided to the system, requiring user annotations. With termination inference such annotations are not necessary. Instead, all provably termina...

Title of Document: BOTTOM-UP MULTIFERROIC NANOSTRUCTURES. Shenqiang Ren, Doctor of Philosophy, 2009 Directed By: Professor Manfred Wuttig Department of Materials Science and Engineering Multiferroic and especially magnetoelectric (ME) nanocomposites have received extensive attention due to their potential applications in spintronics, information storage and logic devices. The extrinsic ME coupl...

In this paper, we present a new method for propositionalization that works in a bottom-up, data-driven manner. It is tailored for biochemical databases, where the examples are 2-D descriptions of chemical compounds. The method generates all frequent fragments (i.e., linearly connected atoms) up to a user-specified length. A preliminary experiment in the domain of carcinogenicity prediction show...

In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We present our algorithm as an inference system for computing Hoare triples summarizing heap manipulating programs. Our inference rules are compositional: Hoare triples for a compound statement are computed from the Hoare tr...