A number of important program rewriting scenarios can be recast as type-directed coercion insertion. These range from more theoretical applications such as coercive subtyping and ...
: The mathematical nature of description logics has meant that domain experts find them hard to understand. This forms a significant impediment to the creation and adoption of onto...
This paper describes an application for computing first-order semantic representations of English texts. It is based on a combination of hybrid shallow-deep components arranged wit...
A new sort of generative grammar (Sec2) will be demonstrated which is more radically “lexicalist” than any earlier one (Sec1). It is a modified Unification Categorial Gramma...
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...