Abstract: A system of rendering content according to availability data for at least one item includes a server to receive a content request from a user and, in response, to retrieve requested content. A rendering engine coupled to the server identifies at least one rule associated with the content and concerning the item. A rules engine coupled to the rendering engine generates at least one availability request corresponding to the rule and concerning the item. The rules engine receives the availability data for the item, retrieves additional content according to the availability data for the item, the additional content selected from among one or more stored content elements that concern the item, and communicates the additional content to the rendering engine for incorporation into the requested content. The rendering engine renders the requested content, including the additional content concerning the item.

Abstract: A system for rendering content according to availability data for at least one item includes a server to receive a content request from a user and, in response, to retrieve requested content. A rendering engine coupled to the server identifies at least one rule associated with the content and concerning the item. A rules engine coupled to the rendering engine generates at least one availability request corresponding to the rule and concerning the item. The rules engine receives the availability data for the item, retrieves additional content according to the availability data for the item, and communicates the additional content to the rendering engine for incorporation into the requested content. The rendering engine renders the requested content, including the additional content concerning the item. The server communicates the rendered content to the user to satisfy the content request.

Abstract: Generating a price schedule involves generating a graph having paths that include states with values. The graph is generated by determining the values of a successor state from the values of a predecessor state. An optimal path is selected, and a price schedule is determined from the optimal path. Computing an elasticity curve involves having a demand model, values for demand model, and filter sets that restrict the values. Elasticity curves are determined by filtering the values using filter sets, and calculating the elasticity curve using the demand model. A best-fitting elasticity curve is selected. Adjusting a demand forecast value includes estimating an inventory and a demand at a number of locations. An expected number of unrealized sales at each location is calculated. An sales forecast value is determined according to the expected number.

Abstract: A method and system for solving constrained optimization problems. An initial abstract solution represents a prioritized set of decisions. The abstract solution is used as the basis for building a concrete solution. The concrete solution is analyzed to determine one or more local moves that represent a re-prioritization of the abstract solution. After a local moves is made, the process begins again with a new abstract solution, that is closer to an optimal solution. This process continues interactively until an optimal solution is reached or approached. The prioritized set of decisions can be implemented as a priority vector or a priority graph.

Abstract: A system and method for searching a problem space. In an exemplary application, the search constructs a plan associated with a business enterprise and the problem space is a model of the enterprise. The search is divided into subsearches. Each subsearch is performed by a subsearch process having its own goal data, termination data, problem data, problem selection process, move process, and script. The script of a subsearch determines whether the current state of the search shall be advanced by a move of that subsearch or by another subsearch.

Abstract: A system is provided for optimizing a network plan. The system includes a memory which stores information specifying a network plan, a plurality of constraints, and a plurality of interaction coefficients. Each interaction coefficient corresponds to particular constraint. A processor is coupled to the memory. The processor is operable to determine whether the network plan violates any of the constraints, modify the network plan in order to resolve a violation of any constraint, and update a corresponding interaction coefficient in order to reflect an impact upon the network plan caused by the resolution of a violation.

Abstract: The use of nonmonotonic or "common sense" reasoning has often been advocated to speed up reasoning systems. The difficulty has always been that nonmonotonic reasoning requires consistency checks, which are even more computationally intractable than the monotonic reasoning normally used in reasoning systems. Disclosed herein are methods and apparatus for making consistency checks tractable by performing them over a limited context using fast sufficient consistency checks. The results are approximate, but approximate results are expected in nonmonotonic reasoning. Included in the disclosure are techniques for selecting the limited context and making the fast sufficient consistency checks and a default reasoner which employs the techniques to check the consistency of a default conclusion with a limited context.