View as:
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.
This entry was posted
on Thursday, January 29th, 2004 at 7:40 pm and is filed under CM20019, Logic, Prolog.