Apologies if you receive multiple copies
________________________________________

Call for Papers

------------------------------------------------------------
Fifth Workshop on Constraint Handling Rules
CHR 2008

July 14, 2008
Hagenberg, Austria

Co-located with the International Conference on
Rewriting Techniques and Applications (RTA 2008)
------------------------------------------------------------

http://www.uni-ulm.de/in/pm/research/events/chr2008

Introduction
------------

On 26 Jan 2008 16:44:35 GMT, Jan Wielemaker
wrote:

Thanks for comments. I wrote longer response to Bart's post. Your
recommendations are exactly as his recommendations, therefore I
comment his post only.

A.L.

On Sat, 26 Jan 2008 09:19:20 -0600, A.L wrote:

It depends on what you mean by a memory leak.
Of course the programmer can "mess up" - here is an example that
causes a memory leak in some Prolog systems:

a(N,_) :- N > 0, M is N - 1, a(M,foo(1,2,3,4,5)).
a(N,_) :- N =< 0.

Try the query ?- a(,[]).
with equal to 10000000 in SICStus, Yap, SWI and you will see.

Did the programmer mess up, or the implementation ?
In B-Prolog (and hProlog) this query runs in a flash.

Let's remember what went "wrong" as (1).

I am reading "Learn Prolog Now!" as a form of self study to learn some of
the basics of Prolog.
The spesification of the problem is in the comment. Maybe I am dense, but
I can't seem to wrap my mind around this problem. Any hints?

/*
There is a street with three neighboring houses that all have a different
color.
They are red, blue, and green.
People of different nationalities live in the different houses and they all
have a different pet. Here are some more facts about them:

The Englishman lives in the red house.

The jaguar is the pet of the Spanish family.

The Japanese lives to the right of the snail keeper.

The snail keeper lives to the left of the blue house.

Who keeps the zebra?
*/

member(X, [H | T]) :- X = H; member(X, T).

PÃ¥ Sun, 20 Jan 2008 15:50:33 +0100, skrev Slobodan Blazeski
gmail.com>:

In message
<898768bf-96f0-4ec0-b467-8fe521db8734@i7g2000prf.googlegroups.com>,
Slobodan Blazeski gmail.com> writes

To translate a list, you need to
translate the head of the list, and
translate the rest of the list.
Except of course when the list is empty, and then you need to terminate
your recursion with translate( [], [] ).

So you need to write a clause that starts
translate( [HeadGerman|TailGerman], [HeadEnglish|TailEnglish] ) :-

Hello,

I study the possibility of parsing context-free languages with Prolog.

Head -> Body

I found the DCG (definite clause grammar).

I think that is possible with Prolog to handle context-sensitive construct :

before Head after -> before Body after

but I seek a *good* exemple in Prolog, perhaps with the langage { a^n
b^n c^n } that is known to be context-sensitive (and not context-free).

Thanks :-)

I'm a Prolog newbie, just playing around with the system. I can't understand
the answer Prolog is giving me in the following simple little database. I
decided I would play around with a simple database describing nodes being
connected or not. Just three nodes for now, with two connections, and a rule
the defines transitive connectivity.

connected(node1, node2).
connected(node2, node3).
path(X, Y) :- connected(X,Y).
path(X, Y) :- connected(X, Z), path(Z, Y).

But when I query, Prolog immediately responds with "More?". When I hit ";",
it responds with "No":

44 ?- path(node1, node2).
More? ;

No

Den Thu, 17 Jan 2008 07:29:11 -0800 skrev Chip Eastham:

[snip long quote]

Chip Eastham wrote: