SE547: BDDs: Logical Satisfaction [6/22] Previous pageContentsNext page

What is first order predicate logic? What is logical satisfaction?

Logical satisfaction is NP-complete. What does this mean? What is the best-known running time for an NP-complete problem?

For example, how long will it take to determine satisfaction for:

x : uint16 . y : uint16 . z : uint16 . (x + y) + z = x + (y + z)

Try it... contains a file:simplebdd/test/ [source] [doc-public] [doc-private] class.

Previous pageContentsNext page