The original ADOPT-ng has three major versions, corresponding to three different classes of feedback possibilities. The first version is identical to the scheme of the original ADOPT, where messages with feedback are communicated only to the variable of one’s parent node in the DFS of the constraint graph. It is similar to the GraphBased Backjumping concept common in Constraint Satisfaction (CS...

Surface realisation from flat semantic formulae is known to be exponential in the length of the input. In this paper, we argue that TAG naturally supports the integration of three main ways of reducing complexity: polarity filtering, delayed adjunction and empty semantic items elimination. We support these claims by presenting some preliminary results of the TAG-based surface realiser GenI.

This paper calls for a change in our theoretical perspectives on the nature of understanding as ideas embedded in the mind-as-container metaphor. In particular, it is suggested that we should adopt Bereiter’s [1] postulation that understanding is best understood as resulting from the ways an individual may be positioned relative to the knowledge object. As such, it is proposed that understandin...

We investigate the problem of formalizing and modeling edits to treebased data structures, evaluating the relative merits of three different approaches inspired by version control systems and database management. The first provides a theoretical backdrop, anchoring the discussion; the second boasts simplicity as well as a tractable algorithm for computing an approximately minimal edit; the thir...