Re: Who's a thief?

Ovid says:

My point, which I alluded to in the first paragraph, is that some languages are better suited for some problems than others. AI, I suspect, is not Perl's strong suit.

Backtracking is an important feature of languages like Prolog and CLIPS. There is also a text-processing language called Icon that uses something called generators.

I wonder if perl's pattern matching could be put to use for AI purposes?

/jeorgen

Comment on Re: Who's a thief?

Replies are listed 'Best First'.
Re: Re: Who's a thief? by pjf (Curate) on Jul 05, 2002 at 10:39 UTC
My goodness. It's a common enough occurance for someone to point to a Perl regexp and say something like "EEEeeeewww!!!". I don't want to imagine what people will say once they see the regexps used to implement backtracking in AI. Paul Fenwick Perl Training Australia	[reply]
Re: Who's a thief? by Abigail-II (Bishop) on Jul 05, 2002 at 11:23 UTC
Actually, the only natural backtracking mechanism found in Perl is in regular expressions. Backtracking is what I use to determine primeness of numbers using regular expressions, it's what's used in the Cookbook when regular expressions are used to solve Diophantine equations, and its used in my reduction of 3-CNF-SAT to regular expressions http://perl.plover.com/NPC/NPC-3SAT.html. Abigail	[reply]