Patent ID: 9026410
Filing Date: 2015-05-05
Classification: G06N

Abstract:
1. A method for simplifying a complex well-formed formula (WFF) comprising the steps of: receiving, in a processor, an input WFF and performing the following: converting, with a formula converter, the input WFF through a series of recursive steps into an initial bit array, wherein the recursive steps include representing components of an input WFF into corresponding bit arrays and using bit array operations And, Or, and Not corresponding to respective Boolean operations on components of the input WFF to yield the initial bit array representing an entire initial input WFF; simplifying, with a bit array simplifier, the initial bit array into a simplified bit array by removing predicates from the initial bit array not necessary to represent the input WFF; and converting, with a bit array converter, the simplified bit array into a return WFF in either a conjunctive normal form or a disjunctive normal form; and returning, with the processor, the return WFF.