Create A New Profile
Posted by Anonymous User
Demarcation or scoping of examinations and assessment
School of Computing Short Learning Programmes
Unisa contact information
June 21, 2006 06:35PM
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.
Re: ass2 q2a
July 14, 2006 12:31AM
Registered: 14 years ago
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.
X = [john.mary]
X = [john]
I hope you get the idea, this is how I interpretted it although I could be wrong...
Sorry, only registered users may post in this forum.
Click here to login
is powered by