HDTenEightyP/NetNews huggingface dataset:
From: meskes@ulysses.informatik.rwth-aachen.de (Michael Meskes)
Subject: Re: Help on problem needed!
Keywords: help
Organization: Rechnerbetrieb Informatik  /  RWTH Aachen
Date: 17 Aug 92 12:05:55 GMT

Excuse me for posting an incomplete message. I should have told you also not
to use the predicate not/1 since it needs a cut to be defined, doesn't it?
That means I only want to use pure first-order-logic with functional symbols.
I hope that's possible.

Thanks

Michael
-- 
Michael Meskes, Lehrstuhl fuer angewandte Mathematik insb. Informatik,
RWTH-Aachen, Ahornstr. 55, D-W-5100 Aachen
Email: meskes@ulysses.informatik.rwth-aachen.de
Newsgroups: comp.lang.prolog
From: andka@IDA.LiU.SE (Andreas Kagedal)
Subject: Re: SICStus Prolog singleton warnings slow down while consulting a file
Organization: CIS Dept, University of Linkoping, Sweden
Date: Tue, 18 Aug 1992 09:43:11 GMT

In article <1992Aug17.172126.19111@watson.ibm.com> rah@ybrig.zurich.ibm.com (Ralf Hauser) writes:
   While porting a big C-Prolog program to SICStus Prolog, I encounter
   the following problem:

   To make the program readable, I gave a name to many variables which
   are essentially _ (don't care). When (re)consulting my program,
   every time many screens of such warnings are produced which
   slow down the testing and programming annoyingly.
   [...]

A variable is considered "don't care" if it is *prefixed* with _. i.e.
if you want the variable ListOfTerms to be a don't-care variable for
which you don't want a singleton-variable-warning, you can write it as
_ListOfTerms.

/Andreas
--
----------------------------------- < * > ------------------------------------
Andreas Kagedal                           Internet: andka@IDA.LIU.SE
Dep. of Computer and information science  UUCP: {uunet,mcsun,...}!liuida!andka
University of Linkoping, Sweden           BITNET: andka@SELIUIDA
From: boucher@ug.cs.dal.ca (Darren B. Boucher)
Subject: Prolog for the PC
Organization: Math, Stats & CS, Dalhousie University, Halifax, NS, Canada
Date: Fri, 14 Aug 1992 17:25:19 GMT

   Can someone tell me if there is a, and where I can get a public domain, or shareware version of 
Prolog for the PC. I have seen one on an FTP site in Germany but have had a problem retrieving it.
If you can send me an FTP site or something it would be greatly appreciated.

 boucher@ug.cs.dal.ca

Newsgroups: comp.lang.prolog
From: ludemann@quintus.com (Peter Ludemann)
Subject: Re: fuzzy unification of floating point numbers
Organization: Quintus Corporation, Palo Alto, CA
Date: Mon, 17 Aug 1992 16:50:13 GMT

In article <1992Aug12.210954.15241@cs.ucla.edu>, mika@oahu.cs.ucla.edu (Mikhail Karpoukhin) writes:
> Does anybody know the prolog for UNIX which supports
> the fuzzy unification of floating point numbers,     
> that is two floating point numbers are considered 
> equal if | X - Y | =< FUZZVALUE  and this FUZZVALUE
> can be changed by user? I know that VM/Prolog has
> this feature, but it works on mainframe.

I suspect that IBM Prolog's method is more sophisticated that this,
although the manual implies that an absolute test is done.

Quintus Prolog's library has the "fuzzy" module, which defines (I quote):

    For a fixed epsilon, the fuzzy comparison predicates are defined
    in section 4.2.2 (Accuracy of floating point arithmetic) of
    Knuth, The Art of Computer Programming, vol 2, Seminumerical Algorithms
    (2nd edition) on page 218.

    (21)  'fuzzy <'(U, V) <->  V-U  >  epsilon.b^max(e_u, e_v)
    (22)  'fuzzy ~'(U, V) <-> |V-U| =< epsilon.b^max(e_u, e_v)
    (23)  'fuzzy >'(U, V) <->  U-V  >  epsilon.b^max(e_u, e_v)
    (24)  'fuzzy ='(U, V) <-> |V-U| =< epsilon.b^min(e_u, e_v)

    where U = F.b^e_u and |F| < 1
      and V = G.b^e_v and |G| < 1

The "fuzzvalue" can be set by the user.

---
	Peter Ludemann  +1-415-813-3800  ludemann@quintus.com
From: csa09@seq1.keele.ac.uk (Paul Singleton)
Newsgroups: comp.lang.prolog
Subject: UNIX 'diff' algorithm in Prolog?
Keywords: string matching
Date: 19 Aug 92 17:14:32 GMT
Organization: University of Keele, England

Please can someone point me towards a Prolog implementation of the UNIX
'diff' algorithm for finding ("Except in rare circumstances") a smallest
sufficient set of differences between two lists.  Or any algorithm which
does a similar job.  With or without rearrangements.  If not a Prolog
implementation, then a nice abstract description amenable to declarative
implementation.
----
  __   __    Paul Singleton (Mr)           JANET: paul@uk.ac.keele.cs
 |__) (__    Computer Science Dept.        other: paul@cs.keele.ac.uk
 |  .  __).  Keele University, Newcastle,    tel: +44 (0)782 621111 x7355
             Staffs ST5 5BG, ENGLAND         fax: +44 (0)782 713082
Newsgroups: comp.lang.prolog
From: by609@cleveland.Freenet.Edu (Cameron Antoine Hughes)
Subject: Re: Prolog Development Information Request
Organization: Case Western Reserve University, Cleveland, Ohio, (USA)
Date: Sun, 16 Aug 92 01:36:26 GMT


I do not have their number, however Turbo Prolog was designed
by PDC and really is representative of at least the core of
PDC's prolog implementation.  Its not stringent with respect
to the Edinburgh standard, but its a nice development tool.
Newsgroups: comp.lang.prolog
From: rah@ybrig.zurich.ibm.com (Ralf Hauser)
Subject: SICStus Prolog singleton warnings slow down while consulting a file
Date: Mon, 17 Aug 92 17:21:26 GMT
Reply-To: rah@ybrig.zurich.ibm.com (Ralf Hauser)
Organization: IBM T.J. Watson Research Center
Keywords: singleton


While porting a big C-Prolog program to SICStus Prolog, I encounter
the following problem:

To make the program readable, I gave a name to many variables which
are essentially _ (don't care). When (re)consulting my program,
every time many screens of such warnings are produced which
slow down the testing and programming annoyingly.

Does anybody know, how to suppress these warnings or to
maintain the same expressivity of code without creating those
"singleton variables".

Thanks

	Ralf
Newsgroups: comp.lang.prolog
From: dsouza@fraser.sfu.ca (Keith D'Souza)
Subject: Quintus' Prolog++ -- Some help needed
Organization: Simon Fraser University, Burnaby, B.C., Canada
Distribution: World
Date: Mon, 17 Aug 1992 19:19:07 GMT

Hi!

I have recently begun working with Quintus' PROLOG++ 
and need help with a problem I am facing.

In the problem I am exploring, I use the predicate

newgraph(X,Y,Z):-
                 instance <- new(Y,X),
                 X <- graphtype := Z.

to create a new instance X of the object Y, and assign 
the value Z to the attribute 'graphtype' of X.

So, I can create an instance 'vrp1', of an 'instancegraph' object, 
and assign the value 'vr' to the 'graphtype' attribute of vrp1.

While this predicate succeeds when called, if I attempt to trace 
the call, it returns the following:

call  newgraph(vrp1, instancegraph, vr)
UNIFY 1 []
 call  SEND new(instancegraph, vrp1) FROM prolog TO instance
 EXPAND []
 exit  SEND new(instancegraph, vrp1) FROM prolog TO instance
 call  SEND graphtype:=vr FROM prolog TO vrp1
 EXPAND []
  call  SEND graphtype:=vr FROM prolog TO vrp1 ONTO instancegraph
  UNIFY 2 []
   call  INHERIT := /2 FOR instancegraph ?
   fail  INHERIT := /2 FOR instancegraph ?
  fail  SEND graphtype:=vr FROM prolog TO vrp1 ONTO instancegraph
 fail  SEND graphtype:=vr FROM prolog TO vrp1
 redo  SEND new(instancegraph, vrp1) FROM prolog TO instance
 fail  SEND new(instancegraph, vrp1) FROM prolog TO instance
fail  newgraph(vrp1, instancegraph, vr)

I.e., the call fails!

Obviously, the problem originates around the statements

   call  INHERIT := /2 FOR instancegraph ?
   fail  INHERIT := /2 FOR instancegraph ?

My problem is, being a novice, I do not know why this happens.

Any help in this matter is appreciated!

Thanx

Keith

dsouza@sfu.ca

Newsgroups: comp.lang.prolog
From: etxaha@eua.ericsson.se (Anders Hallberg)
Subject: Re: SICStus Prolog singleton warnings slow down while consulting a file
Keywords: singleton
Organization: Ellemtel Telecom Systems Labs, Stockholm, Sweden
Date: Tue, 18 Aug 1992 07:06:00 GMT

rah@ybrig.zurich.ibm.com (Ralf Hauser) writes:


>Does anybody know, how to suppress these warnings or to
>maintain the same expressivity of code without creating those
>"singleton variables".

I would not advice turning those warnings off.  They can save you the
effort of trying to locate subtle bugs caused by miss-spelled variable
names.  I usually precede each predicate with a comment showing the
head of the predicate with full variable names and then use _ in the
clauses to avoid loads of warnings.

	/Anders Hallberg
Newsgroups: comp.lang.prolog
From: jonas@csd.uu.se (Jonas Barklund)
Subject: Re: Common courtesy
Followup-To: comp.lang.prolog
Organization: Uppsala University, Sweden
	<7141@skye.ed.ac.uk>
Date: Fri, 21 Aug 1992 12:44:00 GMT

In article <7141@skye.ed.ac.uk> ken@aiai.ed.ac.uk (Ken Johnson) writes:
>
>   In article <189@syllogi.syllogic.nl> fdb@syllogic.nl (Frank de Bruijn)
>   writes:
>
>   #  ...a meta-interpreter could handle the symmetry, transitivity, etc.  of
>   #  all relations declared as such.  One implementation technique that can
>   #  be used in such a meta-interpreter is to examine the goal stack for an
>   #  earlier call-frame that matches the current call frame.  This works, but
>   #  it's costly......... 
>
>   I hadn't thought of that.  It is a fascinating possibility.  Have you
>   actually implemented anything this way?

This is something the metalogic programming language Reflective Prolog
is really good at. In fact, this very problem is one of the first
examples the authors take up in their papers about the language. There
is a paper by Costantini and Lanzarone about Reflective Prolog in the
proceedings of the Lisbon ICLP. There is a slow prototype
implementation available from University of Milan and an efficient
compiling version (of a somewhat modified language) is under
development through a collaboration between University of Uppsala and
University of Milan.

-- Jonas B.
--
Jonas Barklund, Computing Science Department, Uppsala University
Email jonas@csd.uu.se, phone +46-18-181050, fax +46-18-521270
Organization: University of Illinois at Chicago
Date: Thursday, 20 Aug 1992 14:00:28 CDT
From: <U55342@uicvm.uic.edu>
Newsgroups: comp.lang.prolog
Subject: English Systems Limited (ESLProlog)

Does anyone know if the makers of ESLProlog, English Systems Limited, have
a contact address or "hotline" number in the United States of America? I
am interested in a sortware package that is advertized in their public-domain
Prolog, but I would like to first ask questions about how it handles
conventional, extended, and expanded memory resources, maximum size of
rule-bases, et cetera.

Please respond via e-mail, for I do not look into this newsgroup
very often. (The group rec.games.chess, however, is another matter entirely!)

                                                    See Ya!
                                                     Bert Wilson


........................................................................
: Bertrand L. Wilson                :                                  :
: Department of Linguistics         : "Chess, like love, has the power :
: University of Illinois at Chicago :   to make men happy."            :
:                                   :                                  :
: u55342@uicvm.uic.edu              :                     Tarrasch     :
:...................................:..................................:

Newsgroups: comp.lang.prolog
From: tim@giaeb.cc.monash.edu.au (Tim Roberts)
Subject: Help - any text book suggestions
Organization: Monash University, Melb., Australia.
Date: Fri, 21 Aug 1992 00:47:33 GMT

Do many US colleges etc teach an undergrad AI unit using Prolog ?  If so, what
textbook do they use ?  I know of some good introductory AI books, and one or
two good introductory Prolog books, but these don't overlap !

Any suggestions would be welcome.  I am looking for a good text covering both
topics for a 14-week semester next year.  Please mail or post suggestions.

Thanks !

Tim S Roberts
School of Applied Science                Tel:    051-226467
Monash University (Gippsland)            Fax:    051-221348
Switchback Road
Churchill                                email:  tim@giaeb.cc.monash.edu.au
Victoria 3842
Australia
Newsgroups: comp.lang.prolog,comp.lang.lisp
From: baechtel@iccgcc.decnet.ab.com
Newsgroups: comp.lang.prolog
Subject: Fuzzy Prolog?
Date: 17 Aug 92 07:44:03 EST

Does anyone have references about Fuzzy Prolog, where the unification
process would return a degree of membership.

This would help me in a solving a wider variety of problems.

Newsgroups: comp.lang.prolog
From: thomas@IFComputer.de (Thomas Schoenauer)
Subject: Re: Fuzzy Prolog?
Date: Wed, 19 Aug 92 08:00:19 GMT
Organization: InterFace Computer GmbH, Munich, Germany

There is a good book about Fuzzy Prolog with a lot of code in it:

A Fuzzy Prolog Database System
By Deyi Li and Dongbo Liu. New York,
John Wiley and Sons Inc., 1990

Thomas Schoenauer, InterFace Computer GmbH, Munich
		   thomas@IFcomputer.de
From: awenn@matilda.vut.edu.au (Andrew Wenn)
Newsgroups: comp.lang.prolog
Subject: Edinburgh Prolog Libraries.
Date: 19 Aug 92 05:41:54 GMT
Organization: Victoria University of Technology

I am after an IP address and/or name of a site preferably in Australia
where I can get hold of the Edinburgh Prolog libraries. 

Any pointers in this direction would be most appreciated.



---------------------------------------------------------------------------
Andrew Wenn          Victoria University of Technology
                     Footscray Campus.
                     awenn@matilda.vut.edu.au

                     phone 03 688 4342
                     fax   03 688 4804
---------------------------------------------------------------------------
Newsgroups: comp.lang.prolog
From: mvelzen@fwi.uva.nl (Marc "VELZ" van Velzen)
Subject: Re: do i *need* a 387 for
Organization: FWI, University of Amsterdam
Date: Thu, 13 Aug 1992 13:05:59 GMT

cyberman@toz.buffalo.ny.us (Cyberman) writes:

[lines deleted]

> M"VV> What's Archie? I usualy perform Human-Directory-Tree-Traversal to find
> M"VV> what  I need.

>Archie is an experimental archive site data base it know 3500
>sites and "most" of their contents [some are of course
>protected].  You can send a request to an archie server and it
>will see if it can find what your looking for.

Sounds great! got 'ny internet addresss?

[some more lines deleted]

>Speaking of Prolog, does this prolog require the machine to run
>in protected mode? [aka > 1 meg memory for 286+ machines]

Yes, I'm affraid so, I think it doesn't run at all on anything less than 
a 386DX (might on 386SX though, not sure about that).

>        Stephen Cyberman@Toz.Buffalo.NY.US
>        Scripted at Tue  08-11-1992  09:03:52

>... Table scraps make Fido fat & cause bad digestion!
>--- Blue Wave/QWK v2.10
>                                                                                                                             
-- 
+--------------------------------------------------------------------------+
| Marc van Velzen (mvelzen@fwi.uva.nl).                                    |
|                                                                          |
| If your delta values specify some far corner of the Universe, Intuition  |
From: ken@aiai.ed.ac.uk (Ken Johnson)
Newsgroups: comp.lang.prolog
Subject: Portray clauses for difference lists
Date: 12 Aug 92 13:48:26 GMT
Followup-To: comp.lang.prolog
Organization: Bugs-R-Us


The following code may be of interest to people who are programming in
Prolog using difference lists (aka open lists).  The test
is_difference_list/1 determines whether a structured term whose
principal functor is -/2 is a properly constructed difference list or
not.  If it is, then show_difference_list/1 will display it as a list
between braces, e.g.  [a,b,c|X]-X displays as {a,b,c}. 

        If you don't know what a difference list is, please
        consult a Prolog wiz at your site or a decent Prolog
        book *before* you mail me about it.  The explanation
        would run to a couple of pages and I don't want to have
        to sit and think of one right now.  In essence, a
        difference list is a Prolog structure which allows
        slightly easier and faster appending and concatenation
        than an ordinary list.  The cost of using it is an
        increased complexity of programming. 

You may use this code freely etc., but if you sell copies of it at a
profit, I want a share. 

%% -----------------------------------------------------------------------
%% Portray clause for Difference List
%% Ken Johnson 12 August 1992
	
portray(X-Y) :-
	is_difference_list(X-Y),
	show_difference_list(X-Y).

%%

is_difference_list(X-Y) :-
	var(X),
	X == Y.

is_difference_list(X-Y) :-
	X \== Y,
	nonvar(X),
	X = [_|T],
	is_difference_list(T-Y).

%%

show_difference_list(X-Y) :-
	X == Y,
	write('{ }').

show_difference_list(X-Y) :-
	X \== Y,
	write('{'),
	show_difference_list_1(X-Y).

show_difference_list_1([H|X]-Y) :-
	X == Y,
	write(H), write('}').


show_difference_list_1([H1,H2|X]-Y) :-
	[H1,H2|X] \== Y,
	write(H1), write(','),
	show_difference_list_1([H2|X]-Y).

%% Ends ------------------------------------------------------------------
-- 
////  Advice to dieters:          ////  Ken Johnson, A I Applications Institute
////    Never eat more than       ////       80 South Bridge, EDINBURGH EH1 1HN
////    you can carry.            ////                 E-mail ken@aiai.ed.ac.uk
////               -- Miss Piggy  ////     phone 031-650 2756  fax 031-650 6513
Newsgroups: comp.lang.prolog
From: ted@nmsu.edu (Ted Dunning)
Subject: Re: SICStus Prolog singleton warnings slow down while consulting a file
Followup-To: comp.lang.prolog
Reply-To: ted@nmsu.edu
Organization: Computing Research Lab
	<7240@skye.ed.ac.uk>
Date: Wed, 19 Aug 1992 18:27:23 GMT


In article <7240@skye.ed.ac.uk> ken@aiai.ed.ac.uk (Ken Johnson) writes:
Path: nmsu.edu!lynx!umn.edu!umeecs!caen!uunet!mcsun!uknet!edcastle!aiai!ken
   From: ken@aiai.ed.ac.uk (Ken Johnson)
   Newsgroups: comp.lang.prolog
   Keywords: singleton
   Date: 18 Aug 92 17:16:03 GMT
   References: <1992Aug17.172126.19111@watson.ibm.com> <5100@sersun1.essex.ac.uk>
   Followup-To: comp.lang.prolog
   Organization: Bugs-R-Us
   Lines: 30

   In article <5100@sersun1.essex.ac.uk> palmm@essex.ac.uk (Palmer M J)
   writes:

   #  Some systems (e.g.  Qunitus Prolog) allow you to use the form _VarName. 
   #  This is still an anonymous variable but with a name.  You might like to
   #  try this. 

   Forgive my pedantry, but (in Edinburgh Prolog) ocurrences of variables
   with the same name are equal to each other, even if the name begins with
   _.  So _A and _B, etc., are not anonymous variables.  The point is that
   the singleton variable check is not applied to such variable names. 


this isn't pedantry, it is error.  each occurence of _ *is* an
anonymous variable.  it is true that _A is *not* anonymous.

for example:

Quintus Prolog Release 3.1.1 (Sun-4, SunOS 4.1)
Copyright (C) 1990, Quintus Corporation.  All rights reserved.
2100 Geng Road, Palo Alto, California U.S.A. (415) 813-3800

| ?- [user].
| diff(_,_).
| diff2(_A,_A).
| 
% user compiled in module user, 0.033 sec 188 bytes

yes
| ?- diff(2,3).

yes
| ?- diff2(2,3).

no
| ?- 
Newsgroups: comp.lang.prolog
From: roland@sun-2.cs.uct.ac.za (Roland Paterson-Jones)
Subject: SBProlog3.1
Keywords: prolog
Organization: Computer Science Department, University of Cape Town
Date: Thu, 13 Aug 1992 16:17:34 GMT

Some people were interested in SBProlog3.1 which I originally had some problems
installing...

From Saumya K. Debray:

> sorry about those problems: carelessness on my part.  I've fixed
> them (I hope!), please try a fresh FTP from cs.arizona.edu (the new
> files are in the directory sbprolog/v3/ ).

I did so and the installation ran with nary a hiccup.
--
Roland P-Jones			aka roland@uctcs.cs.uct.ac.za
University of Cape Town		 or roland@sun-2.cs.uct.ac.za
South Africa
Newsgroups: comp.lang.prolog
From: ue701af@sun1.LRZ-Muenchen.DE ()
Subject: ftp site for SB-Prolog in Germany
Organization: Leibniz-Rechenzentrum, Muenchen (Germany)
Distribution: germany
Date: Thu, 20 Aug 1992 14:23:57 GMT

Hello there in netland,

I am looking for an ftp site for SB-Prolog, if possible
in Germany...

Any information is greatly appreciated,

Christoph Draxler

CIS Centrum fuer Informations- und Sprachverarbeitung
Ludwig-Maximilians-Universitaet Muenchen
Leopoldstr. 139
D 8000 Muenchen 40
Tel. 089 / 36 40 72
From: debray@cs.arizona.edu (Saumya K. Debray)
Newsgroups: comp.lang.prolog
Subject: Re: Does anyone know SBProlog3.1?
Date: 13 Aug 92 03:30:11 GMT
Organization: U of Arizona CS Dept, Tucson

roland@sun-4.cs.uct.ac.za (Roland Paterson-Jones) writes:

> We have been trying to install SBProlog 3.1 on our Sun SparcStation 1+ with
> little success.
[ ... ]

Sorry about that: I've fixed the problems (I think), the files are
in the directory sbprolog/v3/ on cs.arizona.edu.
-- 
Saumya Debray
Dept. of Computer Science, University of Arizona, Tucson
debray@cs.arizona.edu
Newsgroups: comp.lang.prolog
From: mika@oahu.cs.ucla.edu (Mikhail Karpoukhin)
Subject: fuzzy unification of floating point numbers
Originator: mika@oahu.cs.ucla.edu
Organization: UCLA Computer Science Department
Date: Wed, 12 Aug 92 21:09:54 GMT

Does anybody know the prolog for UNIX which supports
the fuzzy unification of floating point numbers,     
that is two floating point numbers are considered 
equal if | X - Y | =< FUZZVALUE  and this FUZZVALUE
can be changed by user? I know that VM/Prolog has
this feature, but it works on mainframe.
Any information is appreciated.

Mike

Newsgroups: comp.lang.prolog
From: gregory@cs.sfu.ca (Gregory Sidebottom)
Subject: Re: Constraint Handling in Prolog?
Organization: CSS, Simon Fraser University, Burnaby, B.C., Canada
Date: Thu, 20 Aug 1992 20:32:41 GMT

In article <1992Aug20.165101.6899@athena.mit.edu> kubali@athena.mit.edu (Volkan C Kubali) writes:

	   Could anyone suggest a source of information about constraint
   handling systems in Prolog? The ones relevant to planning/scheduling
   problems would especially be useful.

The Echidna CLP language contains a constraint handling system which
is relevant to planning and scheduling.  A general description of
Echidna is in:

[HSS*92] Havens, W. S., S. Sidebottom, G. Sidebottom, J. Jones
and R. Ovans (1992) "Echidna: A Constraint Logic Programming Shell."
In Proc.  Pacific Rim International Conference on Aritificial
Intelligence, Seuol, Korea, in press.

The numeric constraint handling built into Echidna is well
suited to scheduling with disjunctive constraints because it is
possible to represent disjoint sets of real intervals directly.  This
is described in detail in:

[SH92]	Sidebottom, G. and W. S. Havens (1992) "Hierarchical Arc
Consistency for Disjoint Real Intervals in Constraint Logic
Programming," Computational Intelligence, 8 (4), in press.

I am happy to send copies of these papers if anybody is interested.
Only paper copies are available, so I'll need snail mail addresses.

Greg
-- 
Greg Sidebottom,                                      | There's not a word that
Expert Systems Laboratory, Centre for Systems Science | goes here that rhymes
Simon Fraser University, Burnaby BC V5A 1S6, Canada   | with anything. -CVB
Newsgroups: comp.lang.prolog