Welcome! Log In Create A New Profile

ass2 q2a

Posted by Anonymous User

Announcements		Last Post
	SoC Curricula	09/30/2017 01:08PM
	Demarcation or scoping of examinations and assessment	02/13/2017 07:59AM
	School of Computing Short Learning Programmes	11/24/2014 08:37AM
	Unisa contact information	07/28/2011 01:28PM

Forums Messages New

Anonymous User

ass2 q2a
June 21, 2006 06:35PM

IP/Host: ---.gprs.vodacom.co.za

Rating: 0

Hi, the question states:

Write a procedure satisfy(P,L) that receives a unary predicate symbol P and returns the
list L of all terms X such that P(X) succeeds.

Is there part of the question missing? Can someone please tell me exactly what is required or at least point me in the right direction.

Thanks
Celene

Reply Quote

malcolm

Re: ass2 q2a
July 14, 2006 12:31AM

IP/Host: ---.saix.net
Registered: 18 years ago
Posts: 3,747
Rating: 0

Nah Im sure the question is complete. The way I understand it what they want is say you have a whole bunch of predicates:
father(john). father(mary). sister(adam). pope(john).

then if you pass the procedure the predicate and L it should fill L with all variables that satisfy P.

Eg/

?-P(father,X).
X = [john.mary]

?-P(pope,X)
X = [john]
etc. etc.

I hope you get the idea, this is how I interpretted it although I could be wrong...