Computational linguistics

Solvable set/hyperset contexts: II. A goal driven unification algorithm for the blended case

A universe composed by rational ground terms is characterized, both constructively and axiomatically, where the interpreted construct with, which designates the operation of adjoining one element to a set, coexists with free Herbrand functors. …