🚀 go-pugleaf

In article <6500005@uicsl> gooley@uicsl.UUCP writes:
>
>Consider the following trivial predicate:
>
>a([]).
>a(_).
>
>Given the query :-a([]). , C-Prolog finds one match and UNSW Prolog finds two.
>Which is standard behavior?  How do other implementations behave?
>

Hmmmm, not exactly.
Depends on what you mean by finding a match and how you apply
the query. If you type

a([]).

to the C-prolog interpreter it comes back and says 'yes', ie the
predicate can be satisfied. However, when you present such a query to
the C-prolog top level interpreter it doesnt give you any opporunity
to backtrack, you only get this opportunity if there are any variables
given in your query, and you make use of this opportunity by typing
';' which invites the interpreter to backtrack.

Below follows two dialogs with C prolog that indicate there are indeed
two solutions to the query you mentioned.(Note that '?-' is the
interpreter's prompt for you to type a query, and that ^ appears under
user input)

?- a(X).			-- initial query
   ^^^^^

X = [] ;			-- first solution, ; typed so invoke
       ^			   backtracking.

X = _0 ;			-- second solution..
       ^

no				-- prolog says no more solutions.

?- a([]), write(a), fail.	-- need to phrase it like this to
   ^^^^^^^^^^^^^^^^^^^^^^	   invoke backtracking since the
				   interpreter will not give us the
				   opportunity..
aa				-- indicates 'write(a)' called twice.

no				-- no more solutions.

?-


-- 
UUCP : { ENGLAND or WALES }!ukc!aber-cs!jhc
JANET: jhc@uk.ac.aber.cs           PHONE:    +44 970 3111 x 3373	
Post: University College of Wales, Penglais, Aberystwyth, UK, SY23 3BZ.