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.
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.

Graeme Taylor
University of Bristol
About this blog

