Description of restricted natural language (original) (raw)

1999

Abstract

Abstract To verify hardware designs by model checking, circuit specifications are commonly expressed in the temporal logic CTL. Automatic conversion of English to CTL requires the definition of an appropriately restricted subset of English. We show how the limited semantic expressibility of CTL can be exploited to derive a hierarchy of subsets. Our strategy potentially avoids difficulties with approaches that take existing computational semantic analyses of English as their starting point.

Ewan Klein hasn't uploaded this paper.

Let Ewan know you want this paper to be uploaded.

Ask for this paper to be uploaded.