Newsgroups: comp.lang.prolog
Path: cantaloupe.srv.cs.cmu.edu!rochester!udel!gatech!swrinde!cs.utexas.edu!news.sprintlink.net!EU.net!chsun!usenet
From: Reto Kramer <kramer@al.esec.ch>
Subject: How to implement quantifiers ?
Message-ID: <D6xCzM.16D@eunet.ch>
Sender: usenet@eunet.ch
Organization: EUnet AG, Switzerland
Date: Wed, 12 Apr 1995 13:47:45 GMT
Lines: 23

I wonder how to implement existential and universal
quantifier in a readeable way.

I understand that this involves 2nd order programming
and that "setof" and things like 
"for_all" [Art of Prolog, p.303] are the key to the
solution.
However when I try to translate my math, 
which also involves the negation of existential 
quantifiers, I end up with pretty unreadable code !

Is there a guideline for translating statements like:

- there is no X for which predicate(X) is true
- there is only a single X such that predicate(X) is true
- for all X predicate(X) is true

Is there any prolog extension to make this easy to 
express (I understand that Goedel provides the
quantifiers as built in stuff).

Reto

