A new compilation technique for left-linear term rewriting systems is presented, where rewrite rules are transformed into so-called minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM). Keywords and Phrases: minimal term rewriting systems, abstract machines, program transformations Note: Part of this w...

This paper presents a visualized computer aided case tool for non-expert, called Visual Time, for representing and reasoning about incomplete and uncertain temporal information. It is both expressive and versatile, allowing logical conjunctions and disjunctions of both absolute and relative temporal relations, such as “Before”, “Meets”, “Overlaps”, “Starts”, “During”, and “Finishes”, etc. In te...

It is well-known that, in Japanese, classifier phrases (ClPs) (e.g., 3 classifier) or measure phrases (MPs) (e.g., 3 liters) can ‘float’ in that they can be separated from the host noun, as in (1b) and (2b).2 ClPs and MPs in this configuration are referred to as floating quantifiers (FQs), and their non-floated counterparts in (1a) and (2a) in which ClPs or MPs are adjacent to their host noun a...