Ok so I wrote and update function
update :: Node - [Node]
It takes in a Node and returns a list of the Nodes
that result from assigning True to an unassigned atom in one case and False in
the other (ie. a case
split). The list returned has two nodes as elements. One node contains
I'm
writting a function that will remove tautologies from a fomula.The
basic idea is that if in a clause, a literal and its negation are found,
it means that the clause will be true, regardless of the value finally
assigned to that propositional variable.My appoach is to create a
function
Hello all I'm working on a project and I'm down to my last 3 functions.I need
some help(in any form) with them as I'm a beginner in haskell.I tried to create
a description on how the functions should behave below ,if you still have some
questions don't hesitate to ask.
Also here is the code for
On Wed, 3 Jan 2001, Simon Peyton-Jones wrote:
I'm sure that's right. Trouble is, we're the last people qualified
to write one!
Here's a suggestion: would someone like to write such a guide,
from the point of view of a beginner, leaving blanks that we can fill in,
when you come across a
