<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments for A.I. programming in Prolog and Assembler</title>
	<atom:link href="http://prologsource.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://prologsource.wordpress.com</link>
	<description>Just another WordPress.com weblog</description>
	<lastBuildDate>Sat, 12 Sep 2009 09:25:16 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on Ultra-Fast Hybrid Genetic Algorithm in Assembly Language for the Travelling Salesman Problem (DLL for LPA Prolog) by 6000 Delicious Links &#8211; in need of Automatic Text-tagging &#171; OMADEON</title>
		<link>http://prologsource.wordpress.com/2009/05/08/ultra-fast-hybrid-genetic-algorithm-in-assembly-language-for-the-travelling-salesman-problem-dll-for-lpa-prolog/#comment-212</link>
		<dc:creator>6000 Delicious Links &#8211; in need of Automatic Text-tagging &#171; OMADEON</dc:creator>
		<pubDate>Sat, 12 Sep 2009 09:25:16 +0000</pubDate>
		<guid isPermaLink="false">http://prologsource.wordpress.com/?p=84#comment-212</guid>
		<description>[...] software in Prolog (with Assembly language for speed). However, other obligations (in a scheduling project) as well as the absence of anyone&#8217;s&#8230; willingness to finance a project in tagging, not [...]</description>
		<content:encoded><![CDATA[<p>[...] software in Prolog (with Assembly language for speed). However, other obligations (in a scheduling project) as well as the absence of anyone&#8217;s&#8230; willingness to finance a project in tagging, not [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Ultra-Fast Hybrid Genetic Algorithm in Assembly Language for the Travelling Salesman Problem (DLL for LPA Prolog) by omadeon</title>
		<link>http://prologsource.wordpress.com/2009/05/08/ultra-fast-hybrid-genetic-algorithm-in-assembly-language-for-the-travelling-salesman-problem-dll-for-lpa-prolog/#comment-210</link>
		<dc:creator>omadeon</dc:creator>
		<pubDate>Tue, 23 Jun 2009 17:53:42 +0000</pubDate>
		<guid isPermaLink="false">http://prologsource.wordpress.com/?p=84#comment-210</guid>
		<description>@adamo
Thanks for your comment, it&#039;s perfectly ON TOPIC in this blog.

Well, I would strongly recommend LPA Prolog, if one&#039;s knowledge of standard Prolog is of a higher priority. I would also certainly, gladly write about this, since it depends on one&#039;s priorities and goals.

Normally, for many practical programming projects, Visual (PDC-) Prolog could be better... if only it didn&#039;t have a VERY SERIOUS problem, which I personally can&#039;t tolerate at all: 
- It compiles VERY SLOWLY!!!

About 2 minutes total compilation time for a  small- to- medium- sized project, is simply TOO MUCH for me! :) Unfortunately, this dreadful slowdown took place ever since PDC/Visual Prolog became object-oriented and they started using it to &quot;compile itself&quot;, as a kind of boot-strapping. They forgot ALL about &#039;C&#039; or Assembly, in the meantime. The whole company (PDC) started &quot;thinking in Visual Prolog&quot; and its object-oriented structure was certainly a great benefit, but the price they paid for this was a great loss of speed. I&#039;m not even sure about the final speed of executable programs; however the compilation time is unacceptable for most serious programmers.

As a matter of fact, I _still_ use an older version of Visual Prolog, now obsolete and UNavailable, Visual Prolog 5.1, which is many times faster than the new versions (after version 6.0) but almost without any object-orientedness. It&#039;s one of the fastest, neatest compilers ever made. I still use it, but quite often I use it to compile DLL-libraries, which are then called by LPA Prolog. So, a short answer to your question is &quot;use BOTH&quot;  - except  that Visual Prolog is no longer what it used to be....

( I will write about these topics soon, anyway )</description>
		<content:encoded><![CDATA[<p>@adamo<br />
Thanks for your comment, it&#8217;s perfectly ON TOPIC in this blog.</p>
<p>Well, I would strongly recommend LPA Prolog, if one&#8217;s knowledge of standard Prolog is of a higher priority. I would also certainly, gladly write about this, since it depends on one&#8217;s priorities and goals.</p>
<p>Normally, for many practical programming projects, Visual (PDC-) Prolog could be better&#8230; if only it didn&#8217;t have a VERY SERIOUS problem, which I personally can&#8217;t tolerate at all:<br />
- It compiles VERY SLOWLY!!!</p>
<p>About 2 minutes total compilation time for a  small- to- medium- sized project, is simply TOO MUCH for me! <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' />  Unfortunately, this dreadful slowdown took place ever since PDC/Visual Prolog became object-oriented and they started using it to &#8220;compile itself&#8221;, as a kind of boot-strapping. They forgot ALL about &#8216;C&#8217; or Assembly, in the meantime. The whole company (PDC) started &#8220;thinking in Visual Prolog&#8221; and its object-oriented structure was certainly a great benefit, but the price they paid for this was a great loss of speed. I&#8217;m not even sure about the final speed of executable programs; however the compilation time is unacceptable for most serious programmers.</p>
<p>As a matter of fact, I _still_ use an older version of Visual Prolog, now obsolete and UNavailable, Visual Prolog 5.1, which is many times faster than the new versions (after version 6.0) but almost without any object-orientedness. It&#8217;s one of the fastest, neatest compilers ever made. I still use it, but quite often I use it to compile DLL-libraries, which are then called by LPA Prolog. So, a short answer to your question is &#8220;use BOTH&#8221;  &#8211; except  that Visual Prolog is no longer what it used to be&#8230;.</p>
<p>( I will write about these topics soon, anyway )</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Ultra-Fast Hybrid Genetic Algorithm in Assembly Language for the Travelling Salesman Problem (DLL for LPA Prolog) by adamo</title>
		<link>http://prologsource.wordpress.com/2009/05/08/ultra-fast-hybrid-genetic-algorithm-in-assembly-language-for-the-travelling-salesman-problem-dll-for-lpa-prolog/#comment-209</link>
		<dc:creator>adamo</dc:creator>
		<pubDate>Tue, 23 Jun 2009 12:54:38 +0000</pubDate>
		<guid isPermaLink="false">http://prologsource.wordpress.com/?p=84#comment-209</guid>
		<description>Since you seem fluent in both LPA and PDC Prolog, would you like to write an article on how to choose between them?  Not for a specific application, just as a general Prolog programming environment.

(Excuse the off-topicness of the comment)</description>
		<content:encoded><![CDATA[<p>Since you seem fluent in both LPA and PDC Prolog, would you like to write an article on how to choose between them?  Not for a specific application, just as a general Prolog programming environment.</p>
<p>(Excuse the off-topicness of the comment)</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Ultra-Fast Hybrid Genetic Algorithm in Assembly Language for the Travelling Salesman Problem (DLL for LPA Prolog) by Avertedd</title>
		<link>http://prologsource.wordpress.com/2009/05/08/ultra-fast-hybrid-genetic-algorithm-in-assembly-language-for-the-travelling-salesman-problem-dll-for-lpa-prolog/#comment-177</link>
		<dc:creator>Avertedd</dc:creator>
		<pubDate>Tue, 26 May 2009 08:08:53 +0000</pubDate>
		<guid isPermaLink="false">http://prologsource.wordpress.com/?p=84#comment-177</guid>
		<description>спасибо за статью… добавил в ридер</description>
		<content:encoded><![CDATA[<p>спасибо за статью… добавил в ридер</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Ultra-Fast Hybrid Genetic Algorithm in Assembly Language for the Travelling Salesman Problem (DLL for LPA Prolog) by Cederash</title>
		<link>http://prologsource.wordpress.com/2009/05/08/ultra-fast-hybrid-genetic-algorithm-in-assembly-language-for-the-travelling-salesman-problem-dll-for-lpa-prolog/#comment-173</link>
		<dc:creator>Cederash</dc:creator>
		<pubDate>Sat, 23 May 2009 21:48:27 +0000</pubDate>
		<guid isPermaLink="false">http://prologsource.wordpress.com/?p=84#comment-173</guid>
		<description>Кстати, по радио программа была об этом. Не помню, правда на какой волне…</description>
		<content:encoded><![CDATA[<p>Кстати, по радио программа была об этом. Не помню, правда на какой волне…</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Ultra-Fast Hybrid Genetic Algorithm in Assembly Language for the Travelling Salesman Problem (DLL for LPA Prolog) by omadeon</title>
		<link>http://prologsource.wordpress.com/2009/05/08/ultra-fast-hybrid-genetic-algorithm-in-assembly-language-for-the-travelling-salesman-problem-dll-for-lpa-prolog/#comment-165</link>
		<dc:creator>omadeon</dc:creator>
		<pubDate>Sat, 09 May 2009 21:29:38 +0000</pubDate>
		<guid isPermaLink="false">http://prologsource.wordpress.com/?p=84#comment-165</guid>
		<description>@Serge
BTW, I did NOT say &quot;faster than ALL other algorithms&quot;, I only said &quot;faster than all the algorithms I TRIED&quot;! :)

P.S. I tried Concorde and it does seem EXTREMELY fast, so the &quot;fight&quot; may be... close! Ah, well, we shall soon find out...

Another reason to finish the remaining optimisations in the calling program, which is in Prolog (an interpreter, in fact).</description>
		<content:encoded><![CDATA[<p>@Serge<br />
BTW, I did NOT say &#8220;faster than ALL other algorithms&#8221;, I only said &#8220;faster than all the algorithms I TRIED&#8221;! <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
<p>P.S. I tried Concorde and it does seem EXTREMELY fast, so the &#8220;fight&#8221; may be&#8230; close! Ah, well, we shall soon find out&#8230;</p>
<p>Another reason to finish the remaining optimisations in the calling program, which is in Prolog (an interpreter, in fact).</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Ultra-Fast Hybrid Genetic Algorithm in Assembly Language for the Travelling Salesman Problem (DLL for LPA Prolog) by omadeon</title>
		<link>http://prologsource.wordpress.com/2009/05/08/ultra-fast-hybrid-genetic-algorithm-in-assembly-language-for-the-travelling-salesman-problem-dll-for-lpa-prolog/#comment-164</link>
		<dc:creator>omadeon</dc:creator>
		<pubDate>Sat, 09 May 2009 17:48:05 +0000</pubDate>
		<guid isPermaLink="false">http://prologsource.wordpress.com/?p=84#comment-164</guid>
		<description>Thanks a lot, Serge.

It will be fascinating to compare it with Concorde.</description>
		<content:encoded><![CDATA[<p>Thanks a lot, Serge.</p>
<p>It will be fascinating to compare it with Concorde.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Ultra-Fast Hybrid Genetic Algorithm in Assembly Language for the Travelling Salesman Problem (DLL for LPA Prolog) by Serge</title>
		<link>http://prologsource.wordpress.com/2009/05/08/ultra-fast-hybrid-genetic-algorithm-in-assembly-language-for-the-travelling-salesman-problem-dll-for-lpa-prolog/#comment-163</link>
		<dc:creator>Serge</dc:creator>
		<pubDate>Sat, 09 May 2009 13:49:18 +0000</pubDate>
		<guid isPermaLink="false">http://prologsource.wordpress.com/?p=84#comment-163</guid>
		<description>Before claiming &quot;Faster than all other algorithm&quot;, maybe you want to compare with Concorde.  

http://www.tsp.gatech.edu/concorde.html</description>
		<content:encoded><![CDATA[<p>Before claiming &#8220;Faster than all other algorithm&#8221;, maybe you want to compare with Concorde.  </p>
<p><a href="http://www.tsp.gatech.edu/concorde.html" rel="nofollow">http://www.tsp.gatech.edu/concorde.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Assembly Language for Visual Prolog Meta-programming by Ultra-Fast Hybrid Genetic Algorithm in Assembly Language for the Travelling Salesman Problem (DLL for LPA Prolog) &#171; A.I. programming in Prolog and Assembler</title>
		<link>http://prologsource.wordpress.com/2009/02/15/assembly-language-for-visual-prolog-meta-programming/#comment-162</link>
		<dc:creator>Ultra-Fast Hybrid Genetic Algorithm in Assembly Language for the Travelling Salesman Problem (DLL for LPA Prolog) &#171; A.I. programming in Prolog and Assembler</dc:creator>
		<pubDate>Fri, 08 May 2009 16:51:52 +0000</pubDate>
		<guid isPermaLink="false">http://prologsource.wordpress.com/2009/02/15/assembly-language-for-visual-prolog-meta-programming/#comment-162</guid>
		<description>[...] Assembly Language for Visual Prolog&#160;Meta-programming  [...]</description>
		<content:encoded><![CDATA[<p>[...] Assembly Language for Visual Prolog&nbsp;Meta-programming  [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on reading/writing/sorting Prolog variables, using the original variable-names (LPA Prolog code) by Mahmoud</title>
		<link>http://prologsource.wordpress.com/2007/09/27/varnamesort/#comment-160</link>
		<dc:creator>Mahmoud</dc:creator>
		<pubDate>Tue, 24 Mar 2009 11:48:43 +0000</pubDate>
		<guid isPermaLink="false">http://prologsource.wordpress.com/2007/09/27/varnamesort/#comment-160</guid>
		<description>hi all</description>
		<content:encoded><![CDATA[<p>hi all</p>
]]></content:encoded>
	</item>
</channel>
</rss>
