who can help me?

Discussion in 'Intelligence & Machines' started by kelvin, Jun 1, 2004.

Not open for further replies.
1. kelvinRegistered Member

Messages:
1
I have some problem in Boolean Reasoning:the general scheme of applying Boolean reasoning to solve a problem P,following the presentation of Brown , can be formulated as follows:
1. Encode the problem P as a system of simultaneously-asserted Boolean equations.
2. Reduce the equation system to a single Boolean equation .
3. Compute BCF, the prime implicants of fP.
4. Solutions to P are obtained by interpreting the prime implicants of fP.
What they really mean?Thanks in advance.

3. CaptainCaperRegistered Senior Member

Messages:
44
What they mean is that both non-determinism and multi-level networks compactly characterize the flexibility allowed in implementing a circuit. A theory for representing and manipulating non-deterministic (lets just use ND) networks is introduced. The theory supports the usual network manipulations, done on deterministic binary networks, such as node minimization, elimination, decomposition etc. Three ways to interpret the behavior of a ND network are given. Operations performed on ND networks are analyzed for how they can change behavior under each interpretation. Some common network operations can increase different behaviors and thus might cause the network to violate its external specification. Several methods to correct this problem are possible, and it appears you're being asked to find at least one.