I\'m working on an application in Java, that needs to do some complex logic rule deductions as part of its functionality. I\'d like to code my logic deductions in Prolog or some other logic/constraint
I know how to find the largest element of a list—no problem, but 开发者_JS百科how should I go about finding the second largest element?
Lots of Prolog-in-Scheme implementations are out there. 开发者_如何学编程E.g. Kanren, Schelog.
I need some help writing a predicate heap(Tree) in prolog that succeeds if Tree is a heap that satisfies both the heap property and the shape property:
How would I write a two clause recursive definition to find the maximum value in a list.So far I have written this:
First off let me state that this is part of a class exercise given as homework.But, the entire assignment is much more involved than the subject of this question.So..
I\'d like to define a members predicate. members(A, B) means that all members of the list A are members of list B.
here is the prolog code (which i sort of follow). len([],0). len([_|T],N) :- len(T,X), N is X+1. and here is the trace for it (im running linux, swi)
I\'m trying to make a prolog function. The function reads in a sentence, and then tries to extract a key word. If a key word is found, it prints a message. I want it to also print a message if no keyw
I have a database consisting of the following rules; speaks(fred [german, english, dutch]). speaks(mary [spanish, arabic, dutch]).
加载中,请稍侯......