<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
<rss version="2.0">
  <channel>
  <title>comp.lang.prolog Google Group</title>
  <link>http://groups.google.at/group/comp.lang.prolog</link>
  <description>Discussion about PROLOG.</description>
  <language>en</language>
  <item>
  <title>Re: Is Prolog the best language to solve this kind of problem?</title>
  <link>http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/ec7b01b3a930de01?show_docid=ec7b01b3a930de01</link>
  <description>
  A.L. schrieb: &lt;br&gt; Well the following should be Folk knowledge: &lt;br&gt; 1) It is pretty clear that the problem cannot be solved declaratively &lt;br&gt; with normal Prolog, since the declarative semantic corresponds &lt;br&gt; to Horn Clauses with a restricted form of search. And Horn Clause &lt;br&gt; don&#39;t know about algebraic formulas. &lt;br&gt; 2) Further it is pretty clear that any algorithmic problem can be
  </description>
  <guid isPermaLink="true">http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/ec7b01b3a930de01?show_docid=ec7b01b3a930de01</guid>
  <author>
  janbu...@fastmail.fm
  (Jan Burse)
  </author>
  <pubDate>Sun, 21 Mrz. 2010 00:19:34 UT
</pubDate>
  </item>
  <item>
  <title>Re: Quintus --&gt; Sicstus</title>
  <link>http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/f902c890fd60c74a/91f4a88ca0e9faad?show_docid=91f4a88ca0e9faad</link>
  <description>
  ISO 13211-1 demands in 5.1 e such a strict mode that rejects *all* &lt;br&gt; implementation specific extensions. However, the precise way how this &lt;br&gt; strict mode is provided is not specified. That is, a conforming &lt;br&gt; implementation has to document how to enable strict mode in accordance &lt;br&gt; with 5.4. &lt;br&gt; The absence of one particular flag for strict mode is for very good
  </description>
  <guid isPermaLink="true">http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/f902c890fd60c74a/91f4a88ca0e9faad?show_docid=91f4a88ca0e9faad</guid>
  <author>
  ulr...@mips.complang.tuwien.ac.at
  (Ulrich Neumerkel)
  </author>
  <pubDate>Sat, 20 Mrz. 2010 21:22:44 UT
</pubDate>
  </item>
  <item>
  <title>Re: Is Prolog the best language to solve this kind of problem?</title>
  <link>http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/e19794515585b490?show_docid=e19794515585b490</link>
  <description>
  Reading that book I have learned how to solve this (now I&#39;m off to &lt;br&gt; Amazon to buy a copy). &lt;br&gt; I wish to thank everyone who replied. In managed to get correct &lt;br&gt; solutions for my small test problem. Soon, I will try it out on few &lt;br&gt; thousand variables to see how it scales. If MIP shows to be slow I &lt;br&gt; might look into other solutions you guys have suggested (BTW, I did
  </description>
  <guid isPermaLink="true">http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/e19794515585b490?show_docid=e19794515585b490</guid>
  <author>
  milan.babus...@gmail.com
  (Milan Babuskov)
  </author>
  <pubDate>Sat, 20 Mrz. 2010 21:29:06 UT
</pubDate>
  </item>
  <item>
  <title>Re: Is Prolog the best language to solve this kind of problem?</title>
  <link>http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/33fc61a591d7014f?show_docid=33fc61a591d7014f</link>
  <description>
  A.L. wrote: &lt;br&gt; I am not sure I understand what you mean by &#39;defining problem on the &lt;br&gt; matrix level&#39;. Can you expand on this? As a normal user of eplex, you &lt;br&gt; certainly don&#39;t need to normalise your constraints or know how the &lt;br&gt; constraints are mapped to the matrix that a MP solver use for solving &lt;br&gt; the problem.
  </description>
  <guid isPermaLink="true">http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/33fc61a591d7014f?show_docid=33fc61a591d7014f</guid>
  <author>
  kishs...@yahoo.com
  (Kish Shen)
  </author>
  <pubDate>Sat, 20 Mrz. 2010 20:19:26 UT
</pubDate>
  </item>
  <item>
  <title>Re: Is Prolog the best language to solve this kind of problem?</title>
  <link>http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/beb5604d73fcffab?show_docid=beb5604d73fcffab</link>
  <description>
  On Sat, 20 Mar 2010 18:10:41 +0100, Jan Burse &amp;lt;janbu...@fastmail.fm&amp;gt; &lt;br&gt; wrote: &lt;br&gt; Do you know what you are taking about?... Wnd what the original &lt;br&gt; question was?... &lt;br&gt; A.L.
  </description>
  <guid isPermaLink="true">http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/beb5604d73fcffab?show_docid=beb5604d73fcffab</guid>
  <author>
  alewa...@aol.com
  (A. L.)
  </author>
  <pubDate>Sat, 20 Mrz. 2010 18:51:35 UT
</pubDate>
  </item>
  <item>
  <title>Re: Is Prolog the best language to solve this kind of problem?</title>
  <link>http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/c7a69556460fb7c1?show_docid=c7a69556460fb7c1</link>
  <description>
  A.L. schrieb: &lt;br&gt; Yes, full formulation would be: &lt;br&gt; P(x1,y1,z) &amp;amp; ~exists x2,y2 (P(x2,y2,z) &amp;amp; y2&amp;lt;y1)) &lt;br&gt; where z are the true parameters. z and x1, and thus &lt;br&gt; x2 can of course be vectors of variables. y1, respectively &lt;br&gt; y2 is the objective variable. &lt;br&gt; I guess the above formulation is valid. Leave it to the &lt;br&gt; system to optimize. Can be extended to multi objective
  </description>
  <guid isPermaLink="true">http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/c7a69556460fb7c1?show_docid=c7a69556460fb7c1</guid>
  <author>
  janbu...@fastmail.fm
  (Jan Burse)
  </author>
  <pubDate>Sat, 20 Mrz. 2010 17:10:41 UT
</pubDate>
  </item>
  <item>
  <title>Re: Quintus --&gt; Sicstus</title>
  <link>http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/f902c890fd60c74a/c2dabe6d4d20a301?show_docid=c2dabe6d4d20a301</link>
  <description>
  Many implementors want to be cover the ISO-Standard and meaningful &lt;br&gt; extensions and/or extensions found in other implementations. That &lt;br&gt; makes sense. It makes porting programs to an implementation easier. &lt;br&gt; As long as the implementors watch each other (and I have the &lt;br&gt; impression that is increasingly the case), it also establishes new
  </description>
  <guid isPermaLink="true">http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/f902c890fd60c74a/c2dabe6d4d20a301?show_docid=c2dabe6d4d20a301</guid>
  <author>
  j...@hppc323.few.vu.nl
  (Jan Wielemaker)
  </author>
  <pubDate>Sat, 20 Mrz. 2010 16:43:04 UT
</pubDate>
  </item>
  <item>
  <title>Re: Is Prolog the best language to solve this kind of problem?</title>
  <link>http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/5ec331e2d030038c?show_docid=5ec331e2d030038c</link>
  <description>
  On Sat, 20 Mar 2010 15:17:05 +0100, Jan Burse &amp;lt;janbu...@fastmail.fm&amp;gt; &lt;br&gt; wrote: &lt;br&gt; Quote: &amp;quot;Please note that the above is only an example. In real &lt;br&gt; program, I would use up to 10000 variables ..&amp;quot; &lt;br&gt; A.L.
  </description>
  <guid isPermaLink="true">http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/5ec331e2d030038c?show_docid=5ec331e2d030038c</guid>
  <author>
  alewa...@aol.com
  (A. L.)
  </author>
  <pubDate>Sat, 20 Mrz. 2010 15:03:52 UT
</pubDate>
  </item>
  <item>
  <title>Re: Is Prolog the best language to solve this kind of problem?</title>
  <link>http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/54eb3b75c4e28440?show_docid=54eb3b75c4e28440</link>
  <description>
  Milan Babuskov schrieb: &lt;br&gt; The if-then-else should not so much be a problem, since: &lt;br&gt; f = 0 v g = 0 &lt;br&gt; Is the same as: &lt;br&gt; f * g = 0 &lt;br&gt; Use a Prolog that can handle Quantifier Elimination. &lt;br&gt; Minimizing a predicate can be reformulated with quantifiers: &lt;br&gt; find the x that minimizes the y of P(x,y) &lt;br&gt; Is the same:
  </description>
  <guid isPermaLink="true">http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/54eb3b75c4e28440?show_docid=54eb3b75c4e28440</guid>
  <author>
  janbu...@fastmail.fm
  (Jan Burse)
  </author>
  <pubDate>Sat, 20 Mrz. 2010 14:17:05 UT
</pubDate>
  </item>
  <item>
  <title>Re: Is Prolog the best language to solve this kind of problem?</title>
  <link>http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/2005e919dd4164d8?show_docid=2005e919dd4164d8</link>
  <description>
  By the way, look for topics with title like &amp;quot;how to linearize this...&amp;quot; &lt;br&gt; A.L.
  </description>
  <guid isPermaLink="true">http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/2005e919dd4164d8?show_docid=2005e919dd4164d8</guid>
  <author>
  alewa...@aol.com
  (A. L.)
  </author>
  <pubDate>Sat, 20 Mrz. 2010 13:29:08 UT
</pubDate>
  </item>
  <item>
  <title>Re: Is Prolog the best language to solve this kind of problem?</title>
  <link>http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/7c738aa2cd6042bf?show_docid=7c738aa2cd6042bf</link>
  <description>
  On Sat, 20 Mar 2010 00:37:58 +0000, Kish Shen &amp;lt;kishs...@yahoo.com&amp;gt; &lt;br&gt; wrote: &lt;br&gt; With all respect, but problem interface in ECLiPSE is rather &lt;br&gt; primitive. It requires defining problem on the matrix level, what is &lt;br&gt; good for small problems and problems without internal structure. Try &lt;br&gt; to program one of more complex examples from AMPL book or Williams
  </description>
  <guid isPermaLink="true">http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/7c738aa2cd6042bf?show_docid=7c738aa2cd6042bf</guid>
  <author>
  alewa...@aol.com
  (A. L.)
  </author>
  <pubDate>Sat, 20 Mrz. 2010 13:05:20 UT
</pubDate>
  </item>
  <item>
  <title>Re: Is Prolog the best language to solve this kind of problem?</title>
  <link>http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/23da9d65ce44cbc3?show_docid=23da9d65ce44cbc3</link>
  <description>
  On Sat, 20 Mar 2010 02:05:50 -0700 (PDT), Milan Babuskov &lt;br&gt; Right group to ask quetions like yours is sci.op-research (Operations &lt;br&gt; Research group). Questions about linearizing nonlinear/logical &lt;br&gt; expressions for LP pop up at least once a month. You can find a lot of &lt;br&gt; information just browsing old posts. You can also ask specific
  </description>
  <guid isPermaLink="true">http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/23da9d65ce44cbc3?show_docid=23da9d65ce44cbc3</guid>
  <author>
  alewa...@aol.com
  (A. L.)
  </author>
  <pubDate>Sat, 20 Mrz. 2010 12:47:05 UT
</pubDate>
  </item>
  <item>
  <title>Re: Is Prolog the best language to solve this kind of problem?</title>
  <link>http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/f559c0c2428bb0f5?show_docid=f559c0c2428bb0f5</link>
  <description>
  Thanks A.L. &lt;br&gt; I&#39;m just reading the book and it really explains some problems I &lt;br&gt; encountered so far. I still haven&#39;t found the solution to my problem, &lt;br&gt; but hopefully I will by the time I read it completely. &lt;br&gt; Regards, &lt;br&gt; M.
  </description>
  <guid isPermaLink="true">http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/f559c0c2428bb0f5?show_docid=f559c0c2428bb0f5</guid>
  <author>
  milan.babus...@gmail.com
  (Milan Babuskov)
  </author>
  <pubDate>Sat, 20 Mrz. 2010 09:05:50 UT
</pubDate>
  </item>
  <item>
  <title>Re: Is Prolog the best language to solve this kind of problem?</title>
  <link>http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/28a776b4e9ff58ea?show_docid=28a776b4e9ff58ea</link>
  <description>
  A.L. wrote: &lt;br&gt; ECLiPSe has the eplex library, which interfaces to MP solvers (CPLEX, &lt;br&gt; Xpress-MP, and the open-source COIN-OR&#39;s CLP/CBC solvers). In &lt;br&gt; particular, the solving of a MP problem can be triggered in a &lt;br&gt; data-driven manner (i.e. behaving in a similar way to constraints in &lt;br&gt; Constraint Programming), all using ECLiPSe/Prolog syntax, and other
  </description>
  <guid isPermaLink="true">http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/28a776b4e9ff58ea?show_docid=28a776b4e9ff58ea</guid>
  <author>
  kishs...@yahoo.com
  (Kish Shen)
  </author>
  <pubDate>Sat, 20 Mrz. 2010 00:37:58 UT
</pubDate>
  </item>
  <item>
  <title>Re: Is Prolog the best language to solve this kind of problem?</title>
  <link>http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/6bc8f9ad3ea480a3?show_docid=6bc8f9ad3ea480a3</link>
  <description>
  On Fri, 19 Mar 2010 14:49:20 -0700 (PDT), Chip Eastham &lt;br&gt; Linear programming solvers usually come with their own languages that &lt;br&gt; are integrated with the solver and have been designed specifically for &lt;br&gt; LP (MIP) problems. These are OPL for CPLEX, MOSEL for Xpress-MP and &lt;br&gt; many others. There are also &amp;quot;generic&amp;quot; LP languages that work with
  </description>
  <guid isPermaLink="true">http://groups.google.at/group/comp.lang.prolog/browse_thread/thread/a7765cdfa1d07f1f/6bc8f9ad3ea480a3?show_docid=6bc8f9ad3ea480a3</guid>
  <author>
  alewa...@aol.com
  (A. L.)
  </author>
  <pubDate>Fri, 19 Mrz. 2010 23:50:55 UT
</pubDate>
  </item>
  </channel>
</rss>
