Related papers: Briefly on Bottom-up
We present some new lower bound estimates for certain numbers in Laver table theory and introduce several related structures of interest.
This very short correction notes a gap in an argument of an earlier paper, and also provides a theorem of similar flavor to the main result of that paper.
These notes give an elementary approach to parts of the theory of standard Borel and analytic spaces.
We describe an efficient bottom-up parser that interleaves syntactic and semantic structure building. Two techniques are presented for reducing search by reducing local ambiguity: Limited left-context constraints are used to reduce local…
These are notes from a basic course in Several Complex Variables
This short note contains elementary evaluations of some Euler sums.
This paper has the goals (1) of unifying top-down parsing with shift-reduce parsing to yield a single simple and consistent framework, and (2) of producing provably correct parsing methods, deterministic as well as tabular ones, for…
The purpose of this short communication is to make some observations on the connections between various existing formulas of counting the number of sublattices of a fixed index in an $n$-dimensional lattice and their connection with the…
This paper presents a unified approach to parsing, in which top-down, bottom-up and left-corner parsers are related to preorder, postorder and inorder tree traversals. It is shown that the simplest bottom-up and left-corner parsers are left…
This paper proposes a new way to do event generation and analysis in searches for new physics at the LHC. An abstract notation is used to describe the new particles on a level which better corresponds to detector resolution of LHC…
This paper describes how XSB combines top-down and bottom-up computation through the mechanisms of variant tabling and subsumptive tabling with abstraction, respectively. It is well known that top-down evaluation of logical rules in Prolog…
The aim of this note (as well as of the course itself) is to give a largely self-contained proof of two of the main results in the field of low-rank matrix recovery. This field aims for identification of low-rank matrices from only limited…
Using Singular Rescaling We Prove Some Bifurcation Results. This note Presents short proofs for some Bifurcation results which had been appeared with other authors.
These informal notes discuss a few basic notions and examples, with emphasis on constructions that may be relevant for analysis on metric spaces.
Bottom-up evaluation of Datalog has been studied for a long time, and is standard material in textbooks. However, if one actually wants to develop a deductive database system, it turns out that there are many implementation options. For…
These are some informal notes concerning topological vector spaces, with a brief overview of background material and basic notions, and emphasis on examples related to classical analysis.
The purpose of this text is to set up a few basic notions concerning quantum graphs, to indicate some areas addressed in the quantum graph research, and to provide some pointers to the literature. The pointers in many cases are secondary,…
These are notes for a very rapid introduction to the basics of exterior differential systems and their connection with what is now known as Lie theory, together with some typical and not-so-typical applications to illustrate their use.
This is a tutorial on tabular parsing, on the basis of tabulation of nondeterministic push-down automata. Discussed are Earley's algorithm, the Cocke-Kasami-Younger algorithm, tabular LR parsing, the construction of parse trees, and further…
A table of sums useful for generating function applications (discrete Laplace transforms or z-transforms). Related definitions and formulas (including Lagrange's expansion), and reference to formulas in Abramowitz and Stegun, Handbook of…