... the formula is false. Universallyquantified formulae are evaluated similarly. Theevaluation of a boolean connective is a straightfor-ward recursion. In the case of a conjunction, e.g.,each ... NEGRA export for- mat. CLAUS Report 98, Universitat des Saarlandes,Computerlinguistik, Saarbriicken, Germany.Erhard Hinrichs, Julia Bartels, Yasuhiro Kawata, ValiaKordoni, and Heike Telljohann. ... existen-tial fragment, the underlying data structures canbe more general than trees. TIGERsearch has a nice graphical user interface. Its greatest ad-vantage is probably its usability on many differ-ent...