Sap Se

Conrad Drescher

Jens Krueger

Patrick Zimmer

Patrick Berg

Claudia Moeller

Mirko Rahn

The disclosure generally describes methods, software, and systems for defining a constraint satisfaction problem including floating point variables. Floating-point domains are described using a notation that allows arbitrarily many ranges denoted by at least one of intervals with boundary information or singleton values comprising fully discrete domains. Mathematically correct results are computed using closures combined with interval arithmetic. A new consistency level for constraint propagation is provided, including multi-bounds consistency, over floating point variables, where the multi-bounds consistency achieves domain consistency over monotonic functions.

Floating point constraint solving with holes

Techniques and solutions are provided for analyzing constraints. A disclosed embodiment provides for determining whether a table contains a valid tuple, and if so, the minimum index of the first valid tuple. Determining whether the table contains a valid tuple can provide an early indication of whether a set of constraints is violated or entailed, for positive and negative constraints, respectively. Determining the minimum index of the first valid tuple can expedite subsequent constraint analysis. Further disclosed embodiments provide for removal of duplicate and wildcard values from a set of constraints, which can facilitate negative constraint analysis. An indication can be provided, such as through a user interface, of whether a set of constraints is violated or entailed. Software can restrict selection of values that may result in constraint violation based on the provided indication.

Constraint satisfaction software tool for database tables

An apparatus for handling string variables with open domains is provided. In some implementations, the apparatus performs operations including retrieving a first string variable having a first domain, the first domain comprising at least one undefined string value. The operations further include retrieving a second string variable having a second domain, the second domain comprising one or more string values each assigned an integer value in a second set of integer values. The operations further include applying a constraint relating the first string variable with the second string variable. The operations further include comparing the first set of integer values with the second set of integer values and filtering the first set of integer values in the first domain to a third set of integer values in the first domain. The operations further include displaying the third set of integer values for the first string variable.

Handling of string variables with open domains

Technologies are provided for creating and using template constraint expressions in constraint-based systems. Template constraint expressions can be created that can be used to define multiple usages of a same constraint rule in a configuration model. Using the template constraint expression, the constraint rule can be translated once and used multiple times as different instances of the rule are activated. Updates to the rule can be made to the template constraint expression and applied to all of the related instances. Constraint expressions can be created based on the template constraint expression. Multiple object instances in a configuration model can be identified that satisfy matching criteria of the template constraint expression. Variables of the matching object instances can be mapped to variable placeholders in the template constraint expression to create constraint expressions. A constraint solver can be used to evaluate the constraint expressions.

Growing community of inventors

Mannheim, Germany

Conrad Drescher