Reducing arbitrary poposition to CNF with prolog

D4cab3b10647b0a0c3553c2faf308d90
0
mexicanwings 101 Oct 18, 2005 at 12:32

Hi all,

I need to reduce an arbitrary proposition into Conjuntive Normal Form (CNF) with prolog. Can someone give me some idea of which language feature of prolog i should be reading up on in order to know how to do this?

Thanks alot in advance!

2 Replies

Please log in or register to post a reply.

D4cab3b10647b0a0c3553c2faf308d90
0
mexicanwings 101 Oct 18, 2005 at 12:49

perhaps i may not have made myself clear. I’m a beginner to prolog and so far have done nothing more than getting prolog to answer “yes” or “no”.

the way to tackle the question as it seems to me would require the use of “if-else” statements or its prolog equivalent. I’m not too sure if i got the logic correct. In fact, i would say have no idea on how to go about tackling the question. Any pointers (even on just the topics i need to know) would certainly prove invaluable.

once again. thanks in advance!


A9102969e779768e6f0b8cb87e864c94
0
dave_ 101 Oct 18, 2005 at 16:11

Perhaps you should look elsewhere, that is on a Prolog development site. Prolog isnt really heavily used in game development and there probably arent many experts here.

That or do your homework yourself! :lol:

Edit: Or search the web. There is at least one site with an explaination of how to do exactly that problem on googles first page.