in class we went over the subset_of/2 predicate that my teacher gave as follows: subset_of([],[]). subset_of([X|Xs],Zs):-subset_of(Xs,Ys),maybe_add(X,Ys,Zs).
i have a college assignment to make a prolog program parse natural language, ie it should output P = np(det(the), np2(noun(cat))), vp(verb(sat), pp(prep(on), np(det(the), np2(noun(mat)))))
Flora-2 is an eccentric language and I know this is a long shot b开发者_C百科ut I haven\'t found any active resources devoted to it so I\'m trying here.Its so popular... there is no stackoverflow tag
What\'s the best way to go about autogenerated keys for Pilog? i\'ve been digging arou开发者_开发技巧nd a bit and can\'t find anything related.
I have a prolog program. These lines are preventing it from compiling: wins(A,B,C,D) :- convert(A,W), value(W,P), convert(B,X), value(X,Q),
How can I check if a query gives me a speci开发者_如何转开发fic number of results. So for example, I want to retrieve a car model of a car that has only been on three specific races.
Am writing a logic pro开发者_JS百科gram for kth_largest(Xs,K) that implements the linear algorithm for finding the
I\'d like to print a message and stop the evaluation of the predicate. How do I do开发者_StackOverflow社区 that?Take a look at this link where the catch/3 and throw/1 mechanisms in Prolog are describe
I am trying to solve a simple query in Prolog that uses negation but I can\'t crack it. The query is \"Find the categories that have never been sold\".
Let\'s say I want to have some rule for comparison similar to isin(0,_). isin(N,List) :- member(N,List), write(N), N1 is N-1, isin(N1,List).
加载中,请稍侯......