Related papers: Briefly on Bottom-up
This is a very short paper that briefly discusses some of the tasks that NLG systems perform. It is of no research interest, but I have occasionally found it useful as a way of introducing NLG to potential project collaborators who know…
These notes concern linear transformations on R^n and C^n, exponentials of linear transformations, and some related geometric questions.
Logical relations (LR) have been around for many years, and today they are used in many formal results. However, it can be difficult to LR beginners to find a good place to start to learn. Papers often use highly specialized LRs that use…
This note presents an interesting counterexample to a basic covering problem.
We introduce the notion of a lowering-raising (or LR) triple of linear transformations on a nonzero finite-dimensional vector space. We show how to normalize an LR triple, and classify up to isomorphism the normalized LR triples. We…
Top-down and bottom-up theorem proving approaches each have specific advantages and disadvantages. Bottom-up provers profit from strong redundancy control but suffer from the lack of goal-orientation, whereas top-down provers are…
Every reduced ring $R$ has a natural partial order defined by $a\le b$ if $a^2=ab$; it generalizes the natural order on a boolean ring. The article examines when $R$ is a lower semi-lattice in this order with examples drawn from weakly Baer…
We construct compact descriptions of function fields and number fields.
We derive the short-range contributions and the leading relativistic corrections to the three-nucleon force at next-to-next-to-next-to-leading order in the chiral expansion.
Lecture notes on an introductory course on arithmetic lattices (EPFL 2014).
These informal notes briefly discuss some basic topics involving Lipschitz functions, connectedness, and Hausdorff content in particular.
These informal notes deal with a number of questions related to sums and integrals in analysis.
Recently delivered lectures on Self-Referential Mathematics, [2], at the Department of Mathematics and Applied Mathematics, University of Pretoria, are briefly presented. Comments follow on the subject, as well as on Inconsistent…
We provide simple proofs of analogues for coverings numbers of lattices of several recently studied basic statements on the ranks of tensors. We highlight the differences and analogies between the proofs in both settings.
We present two novel algorithms for learning formulas in Linear Temporal Logic (LTL) from examples. The first learning algorithm reduces the learning task to a series of satisfiability problems in propositional Boolean logic and produces a…
Both bottom-up and top-down strategies have been used for neural transition-based constituent parsing. The parsing strategies differ in terms of the order in which they recognize productions in the derivation tree, where bottom-up…
This short paper describes a simple and intuitive Prolog program, a metainterpreter, that computes the bottom up meaning of a simple positive Horn clause definition. It involves a simple transformation of the object program rules into…
We present a first result towards the use of entailment in- side relational dual tableau-based decision procedures. To this end, we introduce a fragment of RL(1) which admits a restricted form of composition, (R ; S) or (R ; 1), where the…
The short note here is to give a few heuristic arguments on the weird looking fractional Laplacian operator. This is certainly going to expand the vision of a reader who is looking to develope a taste for research in this direction.
This paper discusses the relationship between memoized top-down recognizers and chart parsers. It presents a version of memoization suitable for continuation-passing style programs. When applied to a simple formalization of a top-down…