Source: http://www.google.com/patents/US7587380?dq=5842224
Timestamp: 2017-08-23 12:26:15
Document Index: 359263233

Matched Legal Cases: ['art 1', 'art 2', 'art 3', 'art 4', 'art 5', 'art 1', 'art 1']

Patent US7587380 - Rule processing method, apparatus, and computer-readable medium to generate ... - Google Patents
A method of providing, in response to user-selected ones of attributes and/or enumerations thereof, a list of product choices from products whose compatibility is characterized by a ZDD rule model having one or more Include and Exclude ZDDs. The method comprises creating a ZDD sub-tree by scanning the...http://www.google.com/patents/US7587380?utm_source=gb-gplus-sharePatent US7587380 - Rule processing method, apparatus, and computer-readable medium to generate valid combinations for selection
Publication number US7587380 B2
Application number US 10/950,809
Also published as US20050080648
Publication number 10950809, 950809, US 7587380 B2, US 7587380B2, US-B2-7587380, US7587380 B2, US7587380B2
Inventors David L. Huelsman, Sharon E. Love, Douglas M. Mair
Original Assignee Huelsman David L, Love Sharon E, Mair Douglas M
Patent Citations (57), Non-Patent Citations (28), Referenced by (5), Classifications (4), Legal Events (7)
Rule processing method, apparatus, and computer-readable medium to generate valid combinations for selection
US 7587380 B2
A method of providing, in response to user-selected ones of attributes and/or enumerations thereof, a list of product choices from products whose compatibility is characterized by a ZDD rule model having one or more Include and Exclude ZDDs. The method comprises creating a ZDD sub-tree by scanning the Include ZDDs and keeping paths having the selected enumerations set, determining complete paths through the sub-tree to produce potentially valid combinations, checking the potentially valid combinations against the Exclude ZDDs to exclude invalid combinations, and providing resulting valid combinations. The scanning optionally includes examining nodes of the Include ZDDs or of the sub-tree against Index values of the selected enumerations to create nodes in the sub-tree. Other aspects include an apparatus implementing the method, and a computer-readable medium including program instructions enabling a processing device to perform the method.
characterizing compatibility between one or more enumerations of one or more products using a Zero-suppressed binary Decision Diagram (ZDD) rule model including one or more Include rules and one or more Exclude rules;
receiving one or more enumerations of a product selected by a user using a graphical interface;
recursively creating a ZDD sub-tree by scanning the one or more Include rules and, for nodes traversed during the scanning, one or more of:
if an index matches one of the one or more enumerations of the product selected by the user or if the index matches one or more valid combinations of one or more enumerations of the product provided to the user, creating a new node in a ZDD sub-tree that includes the index and one or more graphs pointed to by the Then and Else legs of the node;
if a Constant node is encountered, returning the constant; or
returning one or more graphs pointed to by the Else leg of the node;
determining complete paths through the ZDD sub-tree terminating at a One node to produce potentially valid combinations;
excluding some of the potentially valid combinations by applying the one or more Exclude rules to the potentially valid combinations as each of the potentially valid combinations is produced;
determining the one or more valid combinations of one or more enumerations of the product responsive to the excluding the some of the potentially valid combinations; and
providing the one or more valid combinations as the list of product choices to the user.
2. The computer-implemented method of claim 1, where the providing includes displaying at least some of the list of product choices on a display monitor.
3. The computer-implemented method of claim 1, where each of the potentially valid combinations includes ones of the nodes of the ZDD sub-tree on a respective one of the complete paths.
4. The method of claim 1 where determining complete paths through the ZDD sub-tree includes bookmarking potentially valid combinations by creating a collection of indexes on the complete paths of the ZDD sub-tree.
5. A system to provide a list of product choices from products whose compatibility is characterized by a Zero-suppressed binary Decision Diagram (ZDD) rule model having one or more Include rules and one or more Exclude rules, the apparatus comprising:
an input device to aid a user in selecting, from a list of attributes or enumerations of the products, a particular one or more of the enumerations;
a processor to execute instructions that enable the processor to:
recursively create a ZDD sub-tree by scanning the Include rules and keeping paths including the selected particular one or more of the enumerations and, for nodes of the Include rules traversed during the scanning, one or more of:
if an index matches the selected particular one or more of the enumerations or if the index matches one or more valid ones of potentially valid combinations of a list of product choices provided to the user, creating a new node in a ZDD sub-tree that includes the index and one or more graphs pointed to by the Then and Else legs of the node;
determine complete paths through the ZDD sub-tree terminating at a One node to produce potentially valid combinations; and
check the potentially valid combinations against the Exclude rules to find valid ones of the potentially valid combinations as each of the potentially valid combinations is produced; and
an output device enabled to output the valid ones of the potentially valid combinations as the list of product choices to the user.
where the input device comprises at least one of a keyboard and a pointing device; and
where the output device comprises one of a display monitor and a printer.
7. The system of claim 5, where the processor includes an identification circuit to identify each of the potentially valid combinations as ones of the nodes of the ZDD sub-tree on a respective one of the complete paths.
8. A computer-readable medium having a set of instructions stored therein which, when executed by a processing device, causes the processing device to perform procedures comprising:
receiving one or more enumerations selected by a user using a graphical interface;
recursively creating a ZDD sub-tree by scanning the Include rules and, for nodes traversed during the scanning, one or more of:
if an index matches one of the one or more enumerations of the product selected by the user or if the index matches one or more valid ones of potentially valid combinations of product choices provided to the user, creating a new node in a ZDD sub-tree that includes the index and one or more graphs pointed to by the Then and Else legs of the node;
checking the potentially valid combinations against the Exclude rules to determine valid ones of the potentially valid combinations by excluding ones of the potentially valid combinations that are excluded under the Exclude rules as each of the potentially valid combinations is produced; and
providing the valid ones of the potentially valid combinations as the product choices to the user.
9. The computer-readable medium of claim 8, where the providing includes displaying at least some of the product choices on a display monitor.
10. The computer-readable medium of claim 8, where each of the potentially valid combinations includes ones of the nodes of the ZDD sub-tree on a respective one of the complete paths.
This invention claims the benefit of Provisional Application Ser. No. 60/506,156 filed on Sep. 29, 2003 in the names of Huelsman, et al., entitled Improved Method and Apparatus for Rule Processing, which is incorporated herein by reference.
This invention is also related to U.S. patent application Ser. Nos. 10/101,151 and 10/101,154, each filed on Mar. 20, 2002 in the names of the same inventors hereof, which are incorporated herein by reference.
This invention concerns an improvement to a method or apparatus for rule processing preferably utilizing zero-suppressed binary decision diagrams (ZDDs) to express and manipulate a business rule, but more specifically, to a method or an apparatus to generate valid combinations of features or components of a product or service for selection by a user based on an arbitrary set of input specifications.
Specialized rule processing or artificial intelligence (AI) applications are often employed to produce valid combinations of compatible product components, features, or operational characteristics. These applications typically display a table of alternatives product selections on a computer monitor given an arbitrary set of search criteria supplied by an end user, such as a customer engaged in on-line shopping. It becomes a challenge to generate compatible product or service configurations when subparts or components of the product or service become numerous thereby exponentially multiplying the number of possible valid or invalid combinations.
For customer service applications, it is also desirable to provide search results instantaneously, e.g., within a couple of seconds or less. For many complex products, such a constraint is difficult to meet with prior systems.
A rule processing system described in the above-mentioned, incorporated U.S. patent application Ser. Nos. 10/101,151 and 10/101,154 utilizes a form a binary decision diagrams (or directed acylic graphs) to provide a user with conflict and selection advice based on a given set of input parameters, therein called attributes and enumerations thereof. To extend the utility of that invention, the present invention also utilizes a form of binary decision diagrams (or directed acylic graph), preferably zero-suppressed binary decision diagrams, to provide an end user or customer with a number of valid choices of product or service configurations based on a given arbitrary set of input parameters, e.g., product specifications. FIG. 1 shows an example of graphic shown on a user interface when a customer seeks to purchase a computer monitor. In the example, the customer may specify attributes, such as a manufacturer, viewable size, interface type, resolution, contrast ratio, or system type. Based on these search criteria, the rule processing system may display all available computer monitors meeting the criteria along with a listing of enumerations, such as product features, characteristics, price, rebates, or other data about each selected product attribute.
The present invention takes advantage of the rule processing procedures of the prior related inventions to provide a user with valid selections of a product or service based on a set of specified inputs or search criteria.
The present describes an embodiment of a method of providing a list of product choices from products having specifications whose compatibility is characterized by a Zero-suppressed binary Decision Diagram (ZDD) rule model including one or more Include rules and one or more Exclude rules. The method comprises selecting, from a list of attributes and enumerations of the products, one or more of the enumerations, creating a ZDD sub-tree by scanning the one or more Include rules and keeping paths having the selected one or more of the enumerations asserted, and determining complete paths through the ZDD sub-tree terminating at a “one” node to produce potentially valid combinations. The method further comprises excluding some of the potentially valid combinations by applying the one or more Exclude rules to the potentially valid combinations, determining valid combinations responsive to the excluding the some of the potentially valid combinations, and providing the valid combinations as the list of product choices for access by a user.
The present further describes an embodiment of an apparatus to provide a list of product choices from products whose compatibility is characterized by a Zero-suppressed binary Decision Diagram (ZDD) rule model having one or more Include rules and one or more Exclude rules. The apparatus comprises an input device, a processor, and an output device. The input device selects, from a list of attributes or enumerations of the products, a particular one or more of the enumerations. The processor includes a ZDD sub-tree creating circuit to create a ZDD sub-tree by scanning the Include rules and keeping paths including the selected particular one or more of the enumerations, a determining circuit to determine complete paths through the ZDD sub-tree terminating at a “one” node to produce potentially valid combinations, and a check circuit to check the potentially valid combinations against the Exclude rules to find valid ones of the potentially valid combinations. The output device outputs the valid ones of the potentially valid combinations as the list of product choices for access by a user.
The present further describes a computer-readable medium having a set of instructions stored thereon which, when executed by a processing device, causes the processing device to perform procedures to provide a list of product choices from products having specifications whose compatibility is characterized by a Zero-suppressed binary Decision Diagram (ZDD) rule model including one or more Include rules and one or more Exclude rules, the procedures includes selecting, from a list of attributes and enumerations of the products, one or more of the enumerations, creating a ZDD sub-tree by scanning the Include rules and keeping paths having the selected one or more of the enumerations set, determining complete paths through the ZDD sub-tree terminating at a “one” node to produce potentially valid combinations checking the potentially valid combinations against the Exclude rules to determine valid ones of the potentially valid combinations by excluding ones of the potentially valid combinations that are excluded under the Exclude rules, and providing the valid ones of the potentially valid combinations as the list of product choices for access by a user.
Other aspects and features of the invention will become apparent upon review of the following description. The invention, though, is pointed out with particularity by the appended claims.
FIG. 1 is GUI display illustrating user-selections of attributes and enumerations, e.g., product specifications, and a resulting list of product choices responsive to the user-selected attributes and enumerations.
FIG. 2 is a flow diagram of an illustrative procedure according to an aspect of the present invention.
The present invention makes use of zero-suppressed binary decision diagrams (ZDDs), which are referenced above in the Cross-References To Related Patents and Patent Applications. A ZDD is made up of an Index that maps directly to enumerations (e.g., product features), a “Then” leg that points to a ZDD node, and an “Else” leg that points to another ZDD node. To obtain a list of choices according to the herein described illustrative embodiment as shown in FIG. 2, a user typically uses a keyboard and pointing device of a computer to provide a given a set of selections on various input product attributes and enumerations. In response, the method and apparatus of the present invention acts on the user-selected inputs to output another set of output attributes with valid combinations of input selections. The output is preferably displayed on a computer monitor, or supplied to an I/O device for printing or other output.
Include Processing:
To generate valid choices or combinations, the method or computer implementation thereof scans through an Include ZDD of a packaged ZDD rule model and keeps all paths in the Include ZDD that have enumerations set (e.g., asserted or selected). For every node traversed during the scan, one of the following steps occurs with respect to a node in the include ZDD:
If the index encountered matches one of the input enumerations selected by a user, a node is created in a new ZDD tree that includes this index and the subgraphs pointed to by the Then and Else legs of the node.
If the index is in the set of output enumerations, a new node is created, as above.
If a Constant node is encountered, the constant is returned.
Otherwise, the subgraphs pointed to on the Else leg of the node is returned.
The above rules describe a recursive procedure to create the ZDD. The resulting ZDD is a sub-tree of the original Include ZDD of the rule model characterizing the product or service in question, and is used to produce valid combinations or choices based on user-selected input criteria. The preferred method or apparatus then adds in nodes for all of the enumerations that are always valid. This modified ZDD is then stored as a SelectionCombos object described in the appendix, which is returned to the user or calling routine.
Traversing the SelectionCombos Tree Object:
Valid combinations are read from the SelectionCombos object using a GetFirstCombo routine, also described in the appendix, to move to the first valid combination. A first combination by finding a complete path through the ZDD that ends on the “one” node. Then the GetNextCombo routine is invoked to get the next valid combination. GetNextCombo walks the next path in the ZDD. It's important to note that the order of the combinations is the same as the index order from the Include ZDD.
As each possible combination or choice is produced, it is checked against the Exclude ZDD of a packaged rule model characterizing the product or service. If the resulting combination is excluded, then another combination is produced. When a combination is found that isn't excluded, it is returned to the calling routine or end user by way of a display or other output as a valid choice or combination. Thus, combinations are excluded in real-time. Because combinations are excluded in real-time, one cannot obtain an accurate count of valid combinations until completion. One can, however, obtain an upper limit of the number of valid combinations by counting all paths in the resulting include ZDD.
As the SelectionCombos object is traversed, locations can be bookmarked. This allows the user to jump back to the bookmark and start getting combinations from that location. A MakeBookmark routine writes a new bookmark in memory for later recall. It creates a collection of the enumeration indexes on a current path and adds this collection to the end of an array in the SelectionCombos object. The routine returns the index of the new array entry. A GotoBookmark requires an integer. This routine will move to an existing bookmark in the array of bookmarks.
Preferable, the bookmarks are not ordered or sorted. They stay in the order that they are created. For example, if the following sequence of operations is performed:
GetFirstCombo,
GetNextCombo, GetNextCombo, GetNextCombo,
MakeBookMark,
GetNextCombo, GetNextCombo, GetNextCombo, GetNextCombo,
GotoBookMark(0),
GetNextCombo, GetNextCombo,
MakeBookMark
The bookmarks will appear, as follows:
Bookmark Index 0 1 2
Combination # 2 6 4
The bookmarks preferably remain for the entire life of the SelectionCombos object.
Based on the above teachings, the invention also embraces modifications not explicitly shown in the drawings or written description. In particular, the invention is preferably practiced utilizing zero-suppressed binary decision diagrams (ZDDs) but software emulations or other representations of ZDDs may be employed to achieve substantially the same results. Typically, a keyboard and pointing device (e.g., a mouse) is used to supply inputs to a GUI (graphical user interface). The GUI also is used to provide results to the user. A processor (desktop, handheld, or other portable computing device) typically implements the method. Access and transfer of data may occur locally or via a network, e.g. the Internet or a LAN. Also, the illustration was directed to a product configuration business rule, but may be extended to other scenarios to the same extent described in the incorporated and related patents and patent applications. Accordingly, the disclosure is not intended to limit the scope of the invention set forth by the appended claims.
The notation used for attributes in this document is “Attr” followed by a number. The first attribute in the examples is Attr1.
The notation for enumerations is “Enum” followed by two numbers. The first number is the attribute that it belongs to. The second number is its number within the attribute from 1 to 5.
The ellipses symbol “ . . . ” is used to show a range of enumerations.
The word “related” means that the attributes are in the same rule. The double arrow symbol “
” also means that the attributes are related.
GetCombosForSelections Algorithm
Description: Given a set of selections (enumerations and attributes), returns all combinations of a second set of attributes.
This routine is only accessible through an API interface. The entry points are:
CombosForSelections to create the object
GetNextCombo to display the next combo
GetComboCount to determine the total number of combos.
Proc: CombosForSelections(zdd, selections, inputGroups, outputGroups)
SelectionCombos *CombosForSelections(HBdd hBddI, HBdd hBddX, IntArray &aSelections,
IntArray &aInputGroups, IntArray &aOutputGroups, IntArray &aCombo)
BddErrorCode retVal = ecSuccess;
Dm_Manager *ddI, *ddX;
Dm_Node *pZddI, *pZddX;
GroupItem *pGroupInfo;
HManager hManagerI = g_BddTableArray[hBddI].hManager;
SelectionCombos *sc = NULL;
if (ecSuccess == (retVal = GetBddFromHandle(hBddI, &pZddI, &ddI)))
if (ecSuccess == (retVal = GetBddFromHandle(hBddX, &pZddX, &ddX)))
pGroupInfo = g_ManagerTableArray[hManagerI].groups;
nGroups = g_ManagerTableArray[hManagerI].nGroups;
sc = CombosForSelectionsC(ddI, ddX, pZddI, pZddX, aSelections,
aInputGroups, aOutputGroups, aCombo, nGroups, pGroupInfo);
SelectionCombos *CombosForSelectionsC(Dm_Manager *ddI, Dm_Manager *ddX,
Dm_Node *pZddI, Dm_Node *pZddX, IntArray &aSelections,
IntArray &aInputGroups, IntArray &aOutputGroups,
IntArray &aCombo, int nGroups, GroupItem *pGroupInfo)
SelectionCombos *sc = new SelectionCombos( );
sc->setGroupInfo(nGroups, pGroupInfo);
sc->setIncludePac(ddI, pZddI);
sc->setExcludePac(ddX, pZddX);
sc->setInputs(aSelections, aInputGroups, aOutputGroups);
sc->generateCombos( );
sc->getFirstCombo(aCombo);
sc->getNextCombo(aCombo);
Proc: GetNextCombo(tree, currentCombo)
void GetNextCombo(SelectionCombos &sc, IntArray &aCombo)
sc.getNextCombo(aCombo);
Proc: GetComboCount(tree)
int GetComboCount(SelectionCombos &sc)
return sc.getCount( );
From the SelectionCombos.H File
#if !defined(——SELECTIONCOMBOS_H——)
#define ——SELECTIONCOMBOS_H——
#pragma warning(disable : 4512)
#define UNDEFINED −1
typedef std::map<Dm_Node*, Dm_Node*> MapNode;
typedef std::map<int, NodeArray> MapCache;
enum UsageType {UTDontCare, UTNotUsed, UTSelected};
enum SourceType {STNone=0, STInclude=1, STExclude=2, STBoth=3};
Class: SelecionCombos
This routine will return a tree that contains the advice for the input set of
The inputs can be multi-select.
We need to look through pending attributes.
What if the attributes of the input set are not all related. This shouldn't
be a problem at all. Relationships should not be an issue in this algorithm.
Do we need to create a smaller exclude tree also? Yes, or we can NAND out
all of the excluded items.
We need to get the group information down to this class.
class SelectionCombos
bool m_bHasExcludedEnums;
int m_nNCCount,
m_nNumGroups,
m_nNumBookmarks;
Dm_Manager *m_ddI,
*m_ddX;
Dm_Node *m_pZddI,
*m_pCurI,
*m_pZddX,
*m_pCurX;
GroupItem *m_pGroupInfo;
IntArray m_aSelections,
m_aInputGroups,
m_aOutputGroups,
m_aEnumUsage,
m_aEnumSource,
m_aGroupSource,
m_aEnum2Group;
MapNode m_GenCache;
NodeArray m_aNodeCache;
MapCache m_Bookmarks;
bool isComboExcluded(IntArray &aCombo);
void buildEnumSource(Dm_Node *pCur, int nCurSource);
void buildEnumUsage( );
Dm_Node *removeIndexes(Dm_Manager *dd, Dm_Node *pZdd);
Dm_Node *addAlwaysPaths(Dm_Node *pInZdd);
Dm_Node *removeExcludedPaths(Dm_Node *pI, Dm_Node *pX);
Proc: SelectionCombos − Constructor
SelectionCombos( )
m_nNumBookmarks = UNDEFINED;
Proc: ~SelectionCombos − Destructor
\************************************************************************************
virtual ~SelectionCombos( )
void generateCombos( );
int getCount( );
bool getFirstCombo(IntArray &aCombo);
bool getNextCombo(IntArray &aCombo);
void setGroupInfo(int nNumGroups, GroupItem *pGroupInfo);
void setIncludePac(Dm_Manager *ddI, Dm_Node * pZddI);
void setExcludePac(Dm_Manager *ddX, Dm_Node * pZddX);
void setInputs(IntArray &aSelections, IntArray &aInputGroups, IntArray
&aOutputGroups);
int makeBookmark( );
void gotoBookmark(int nBookmark, IntArray &aCombo);
#endif /* ——SELECTIONCOMBOS_H—— */
US5576965 Apr 12, 1993 Nov 19, 1996 Hitachi, Ltd. Method and apparatus for aiding of designing process
US5630025 Jul 13, 1994 May 13, 1997 Unisys Corporation Generalized configurator using a declaratively constructed two-level bi-partite graph as a knowledge representation
US6256618 Apr 23, 1998 Jul 3, 2001 Christopher Spooner Computer architecture using self-manipulating trees
US6385617 Oct 7, 1999 May 7, 2002 International Business Machines Corporation Method and apparatus for creating and manipulating a compressed binary decision diagram in a data processing system
US6389576 Sep 2, 1999 May 14, 2002 Sun Microsystems, Inc. Method and apparatus for optimizing real functions in Boolean domain
US6424962 Sep 19, 1997 Jul 23, 2002 Bull S.A. Method of automated proving for unrestricted first-order logic
US6442732 Apr 21, 1999 Aug 27, 2002 Lucent Technologies, Inc. Virtual logic system for solving satisfiability problems using reconfigurable hardware
US6529890 Aug 19, 1998 Mar 4, 2003 Ensys, Inc. Method for representing synoptic climatology information in a class-object-attribute hierarchy and an expert system for obtaining synoptic climatology information
US6556978 Mar 8, 2000 Apr 29, 2003 The State Of Oregon Acting By And Through The State Board Of Higher Education On Behalf Of The University Of Oregon Satisfiability algorithms and finite quantification
US6961913 Nov 8, 2000 Nov 1, 2005 Matsushita Electric Industrial Co., Ltd. IP base LSI designing system and designing method
US7130783 Jan 12, 2001 Oct 31, 2006 Synopsys, Inc. Simulation-based functional verification of microcircuit designs
US7188333 Jan 22, 2002 Mar 6, 2007 Sprint Communications Company L.P. Product incompatibility system
US20010029499 Dec 28, 2000 Oct 11, 2001 Tuatini Jeffrey Taihana Rules processing system
US20020065701 Nov 30, 2000 May 30, 2002 Kim Kyu Dong System and method for automating a process of business decision and workflow
US20020078431 Feb 2, 2001 Jun 20, 2002 Reps Thomas W. Method for representing information in a highly compressed fashion
US20020095645 Jan 16, 2001 Jul 18, 2002 International Business Machines Corporation Searching for counter-examples intelligently
US20020108093 Dec 11, 2000 Aug 8, 2002 Intel Corporation Method and system for formal verification of a circuit model
US20020112213 Feb 13, 2001 Aug 15, 2002 Abadir Magdy S. Design analysis tool for path extraction and false path identification and method thereof
US20020165701 * Nov 30, 2001 Nov 7, 2002 Jakob Lichtenberg Method of configuring a product
WO1999048031A1 Mar 16, 1999 Sep 23, 1999 Array Technology Aps A database useful for configuring and/or optimizing a system and a method for generating the database
1 "Array". Microsoft Computer Dictionary, Fifth Edition. May 1, 2002.
2 * Alan Mischenko ("An Introduction to Zero-Suppressed Binary Decision Diagrams" 2001.
3 Anderson, An Introduction to Binary Decision Diagrams, University of Denmark, Oct. 1997, pp. 8-11.
4 Beck, M., et al., Enabling Full Service Surrogates Using the Portable Channel Representation, Proceedings of the Tenth International Conference on World Wide Web, Apr. 2001, pp. 376-385.
5 Bryant, Binary Decision Diagrams and Beyond, Enabling Technologies for Formal Verification, IEEE, 1995, pp. 236-243.
6 Cabodi, et al., Symbolic Traversals of Data Paths with Auxilary Variables, IEEE, 1994, pp. 93-96.
7 Cosnard, et al., Automatic Task Graph Generation Techniques, Proceedings of the Twenty-Eighth Hawaii International Conference on System Sciences, Vo. 2, Jan. 3, 1995, pp. 113-122.
8 Cugola, G, et al., Exploiting an event-based infrastructure to develop complex distributed systems, Proceedings of the 20th International Conference on Software Engineering, Apr. 1998, pp. 261-270.
9 Ejnioui, et al., Design Partitioning on Single-chip Emulations Systems, Thirteenth International Conference on VLSI Design, Jan. 3, 2000, pp. 234-239.
10 * F. Aloul, M. Mneimneh, and K. Sakallah "ZBDD-Based Backtrack Search SAT Solver" International Workshop on Logic Synthesis (IWLS), New Orleans, Louisiana, pp. 131-136, 2002. url = http://www.eecs.umich.edu/~faloul/.
11 Gottlob, et al., The complexity of acyclic conjunctive queries, 39th Annual Symposium on Foundations of Computer Science Proceedings, Nov. 8, 1998, pp. 706-715.
12 J Moller, HR Andersen, H Hulgaard, "Product Configuration over the Internet presented at", The 6th Informs Conference on Information Systems and Technology, Nov. 3-4, 2001, Miami Beach, Florida.
13 Jesper Moller "Configuration and E-commerce", IFORS Jul. 2002.
14 Kurihara, et al., BDD Encoding for Partial Order Constraints and its Application to Expert Systems in Software Verification Domains, 2000 IEEE International Conference on Systems, Man, Cybernetics, vol. 3, Oct. 8-11, 2000, pp. 2062-2067.
15 Minato, S., "Zero-Suppressed BDDs and Their Applications", International Journal on Software Tools for Technology Transfer, vol. 3, No. 2, pp. 156-170, Springer, May 2001.
16 Minato, S., Representations of Discrete Funtions, Chapter 1, Graph-Based Representations of Discrete Functions, Sasao and Fujia, ed.s, 1996, Kluwer Academic Publishing, pp. 1-23.
17 Minato, Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems, Proceedings of the 30th Conference on Design Automation, Jul. 1993, pp. 272-277.
18 Mishchenko, Alan. "An Introduction to Zero-Suppressed Binary Decision Diagrams" 2001, Jun. 8, Department of Electrical Engineering Portland State University. pp. 1-15.
19 Panda, et al., Symmetry Detection and Dynamic Variable Ordering of Decision Diagrams, Proceedings of the 1994 IEEE/ACM International Conference on Computer-Aided Design, Nov. 1994, pp. 628-631.
20 S. Minato: "Zero-Suppressed BDDs and Their Applications", International Journal on Software Tools for Technology Transfer, vol. 3, No. 2, pp. 156-170, Springer, May 2001.
21 USPTO; File History U.S. Appl. No. 10/950,622 to Huelsman et al., filed Sep. 28, 2004; Part 1, Sep. 2004 through Mar. 2007.
22 USPTO; File History U.S. Appl. No. 10/950,622 to Huelsman et al., filed Sep. 28, 2004; Part 2, Sep. 2007 through Dec. 2007.
23 USPTO; File History U.S. Appl. No. 10/950,622 to Huelsman et al., filed Sep. 28, 2004; Part 3,Apr. 2008 through May 2008.
24 USPTO; File History U.S. Appl. No. 10/950,622 to Huelsman et al., filed Sep. 28, 2004; Part 4, May 2008 through Aug. 2008.
25 USPTO; File History U.S. Appl. No. 10/950,622 to Huelsman et al., filed Sep. 28, 2004; Part 5, Aug. 2008 through Dec. 2008.
26 USPTO; File History U.S. Appl. No. 10/950,815 to Huelsman et al., filed Sep. 28, 2004; Part 1, May 2007 through Feb. 2009.
27 USPTO; File History U.S. Appl. No. 10/950,815 to Huelsman et al., filed Sep. 28, 2004; Part 1, Sep. 2004 through Feb. 2007.
28 Yang, Optimizing Model Checking Based on BDD Characterizaiton, Thesis, Carnegie Mellon U.,May 1999, pp. 9-11.
International Classification G06N5/02, G06Q30/00
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HUELSMAN, DAVID L.;LOVE, SHARON E.;MAIR, DOUGLAS M.;REEL/FRAME:016091/0144