Solving a set of boolean equations
- From: Ecirbaf <fabrice.marchant@xxxxxxxxx>
- Date: Tue, 30 Oct 2007 06:37:35 -0700
Hi !
Languages I know are some ASMs, C, C++ and the excellent OCaml.
I have looked a bit at Prolog more than 20 years ago and I now
encounter a problem that makes remember to it :
Please consider you have some boolean equations.
For example these 2 :
X xor Y xor Z = true
X and not Y = false
A solving program should produce for (X, Y, Z) :
{(false, false, true), (false, true, false), (true, true, true)}
Of course an actual question includes much more than 3 variables and
trying the 2^nbr_of_var cases would be impossible...
Although not obvious in current languages, I imagine this contraint
problem would be far easier to solve with Prolog.
Please do you have - small - program example(s) that handle this
kind of problem ?
It would be, for a very beginner, much easier to start with hacking
into existing things.
But maybe the problem I spoke about is common and it soon exists
softs that efficiently solve it ?
Thanks for any hint...
Fabrice
.
- Follow-Ups:
- Re: Solving a set of boolean equations
- From: Chip Eastham
- Re: Solving a set of boolean equations
- From: Neng-Fa Zhou
- Re: Solving a set of boolean equations
- Prev by Date: Re: newbie question - Turbo Prolog
- Next by Date: Re: Solving a set of boolean equations
- Previous by thread: newbie question - Turbo Prolog
- Next by thread: Re: Solving a set of boolean equations
- Index(es):
Relevant Pages
|
|
