Language recognition and generation in Prolog

January 29th, 2004

View as: view on E2  view as PDF

A demonstration of weaknesses in Prolog’s goal-matching method in the context of language recognition/generation. Considers decidability, term languages, statement form, arbitrary strings from a restricted alphabet.

Leave a Reply