Abstract: An embodiment includes receiving an explanation request that includes an undesired output resulting from an input case of a hierarchical rule-based decision policy specified by an acyclic dependency graph, and further includes an alternative desired output from the hierarchical rule-based decision policy. The embodiment also includes computing a network of intermediate explanations for required ranges of respective decision nodes that achieve the desired output from the hierarchical rule-based decision policy. The embodiment also includes computing a user-facing explanation that includes a range constraint for achieving the desired output by aggregating the intermediate explanations. The embodiment also includes transmitting, as a response to the explanation request, an explanation for achieving the desired output from the hierarchical rule-based decision policy based on the user-facing explanation.

Abstract: A method for receiving an ownership graph, wherein the ownership graph comprises a first set of nodes and a first set of directional edges, and wherein each of the first set of directional edges connects two nodes and indicates ownership of a first node by a second node, each node having at most one owner, the ownership graph being acyclic. The method further includes receiving a dependency graph that also comprises a set of nodes and a set of directional edges. The method further includes creating a respective enumerating variable declaration for each node in a path from an owner node to a root node in the ownership graph. The method further includes creating a respective accessing variable declaration for each owner node in the dependency graph of the current node.

Abstract: An original set of rules are transformed into a resulting set of generalized rules in a rule management system. An original set of rules stored in a data structure for transforming into a resulting set of rules are accessed. The original set of rules is automatically processed by building a compact description of one or more rules in the original set of rules and their actions in the form of logical constraints and solving constraints to find a solution that represents a case and an applied action, building a family of cases by taking all logical tests or their negation that are satisfied by the solution, and generalizing the family of cases by removal of specific logical tests which do not apply to the action, resulting in a most-general rule.

Abstract: A method for receiving an ownership graph, wherein the ownership graph comprises a first set of nodes and a first set of directional edges, and wherein each of the first set of directional edges connects two nodes and indicates ownership of a first node by a second node, each node having at most one owner, the ownership graph being acyclic. The method further includes receiving a dependency graph that also comprises a set of nodes and a set of directional edges. The method further includes creating a respective enumerating variable declaration for each node in a path from an owner node to a root node in the ownership graph. The method further includes creating a respective accessing variable declaration for each owner node in the dependency graph of the current node.

Abstract: A device is provided having a touchscreen, a storage device and a processor connected to the touchscreen and the storage device. The touchscreen is arranged to display a keyboard defined by a keyboard layout and to receive an input on the keyboard. The storage device is arranged to store a specification for a restricted language, and the specification includes a grammar and vocabulary for the restricted language and includes annotations defining additional keyboard components in relation to specific elements within the grammar. The processor is arranged to define the keyboard layout, determine a specific element within the grammar referred to by a received input, and redefine the keyboard layout to include the additional keyboard components defined in the annotation for the determined specific element within the grammar.

Abstract: Disclosed embodiments provide techniques for analyzing rule-based decision policies. Data is obtained for a plurality of events. The events can be customer behaviors, or other events that can be interpreted by rules. A rule set is obtained for the plurality of events, where the rule set comprises a plurality of rules. Regions are computed based on the rules within the rule set. Frequency data is computed for the plurality of events, and an indication of frequency density is provided for each region. This allows a user to quickly and easily analyze the effectiveness and appropriateness of the rules as they relate to observed customer behaviors. Recommendations for rule changes can be provided as an output of the disclosed techniques.

Abstract: Augmenting a software module test suite is provided, which includes: providing a test suite including test cases for a module to convert an N-dimensional space into an output space, where N?2, the cases covering a first portion of the N-dimensional space; exploring the N-dimensional space by repeating: partitioning a further portion of the N-dimensional space by exploring a partition of the further portion, the partition including partition boundaries defined by a constant value of one of the N input values, each partition having a partition boundary bordering one of the test cases; evaluating the partition and generating a further test case if the evaluation reveals that the partition is not covered by the test cases; and adding the partition to the first portion; until the further portion has been explored or a termination criterion met; and producing an augmented test suite including the generated further test cases.

Abstract: An original set of rules are transformed into a resulting set of generalized rules in a rule management system. An original set of rules stored in a data structure for transforming into a resulting set of rules are accessed. The original set of rules is automatically processed by building a compact description of one or more rules in the original set of rules and their actions in the form of logical constraints and solving constraints to find a solution that represents a case and an applied action, building a family of cases by taking all logical tests or their negation that are satisfied by the solution, and generalizing the family of cases by removal of specific logical tests which do not apply to the action, resulting in a most-general rule.

Abstract: An original set of rules are transformed into a resulting set of generalized rules in a rule management system. An original set of rules stored in a data structure for transforming into a resulting set of rules are accessed. The original set of rules is automatically processed by building a compact description of one or more rules in the original set of rules and their actions in the form of logical constraints and solving constraints to find a solution that represents a case and an applied action, building a family of cases by taking all logical tests or their negation that are satisfied by the solution, and generalizing the family of cases by removal of specific logical tests which do not apply to the action, resulting in a most-general rule.

Abstract: Aspects include identifying, for a set of decision rules, one or more decision rules missing from the set of decision rules, the one or more missing decision rules satisfying a set of limitations. A decision rule determines whether a decision is made for a case, and a limitation determines the cases for which a decision should be made. A constraint graph that represents the cases for which no rule of the set of rules makes a decision, and for which all limitations of the set of limitations are satisfied, is built. A missing case represented by the constraint graph is created, and a family description is created from the missing case. The family description is a set of cases for which no rule of the set of rules makes a decision. The one or more missing decision rules are then constructed from the family description.

Abstract: A method, device, and/or computer program product operates a touch-screen device. One or more processors detect a first moving touch on a touch-screen, where the touch-screen is able to detect a presence of the first moving touch but is not able to detect an amount of pressure being applied by the first moving touch. The processor(s) detect a simultaneous second moving touch on the touch-screen, and detect a line being drawn on the touch-screen by the first moving touch. The processor(s) calculate a calculated pressure for the first moving touch based on a distance on the touch-screen between the first moving touch and the second moving touch while the line is being drawn on the touch-screen by the first moving touch, and then adjust a thickness of the line being drawn on the touch-screen by the calculated pressure for the first moving touch.

Abstract: A device is provided having a touchscreen, a storage device and a processor connected to the touchscreen and the storage device. The touchscreen is arranged to display a keyboard defined by a keyboard layout and to receive an input on the keyboard. The storage device is arranged to store a specification for a restricted language, and the specification includes a grammar and vocabulary for the restricted language and includes annotations defining additional keyboard components in relation to specific elements within the grammar. The processor is arranged to define the keyboard layout, determine a specific element within the grammar referred to by a received input, and redefine the keyboard layout to include the additional keyboard components defined in the annotation for the determined specific element within the grammar.

Abstract: A method, device, and/or computer program product operates a touch-screen device. One or more processors detect a first moving touch on a touch-screen, where the touch-screen is able to detect a presence of the first moving touch but is not able to detect an amount of pressure being applied by the first moving touch. The processor(s) detect a simultaneous second moving touch on the touch-screen, and detect a line being drawn on the touch-screen by the first moving touch. The processor(s) calculate a calculated pressure for the first moving touch based on a distance on the touch-screen between the first moving touch and the second moving touch while the line is being drawn on the touch-screen by the first moving touch, and then adjust a thickness of the line being drawn on the touch-screen by the calculated pressure for the first moving touch.

Abstract: A method, device, and/or computer program product operates a touch-screen device. A first touch at a location on a touch-screen is detected. A second touch on the touch-screen, which occurs simultaneously with the first touch on the touch-screen, is detected. A pressure of the detected second touch is calculated and assigned to the detected first touch. A specific touch-screen output is generated according to the location and assigned calculated pressure of the detected first touch.

Abstract: Embodiments relate to validating logical statements in code for domain specific languages. An aspect includes parsing logical statements and annotating constraint type logical statements with specific constraint annotations from the logical grammar of the domain specific language. A non-contradiction graph is built using specific constraint annotations constrained to represent cases satisfying the logical statements and is solved to find a case that satisfies the logical statement or prove that no such case exists, thus locating a contradiction. The non-contradiction graph is negated to form a non-tautology graph constrained to represent cases violating the logical statements and the non-tautology graph is solved to find a case that violates the logical statement or prove that no such case exists, thus locating a tautology. A report is provided regarding at least one case satisfying the logical statement and at least one case violating the logical statement whereby the logical statement is validated.

Abstract: Augmenting a software module test suite is provided, which includes: providing a test suite including test cases for a module to convert an N-dimensional space into an output space, where N?2, the cases covering a first portion of the N-dimensional space; exploring the N-dimensional space by repeating: partitioning a further portion of the N-dimensional space by exploring a partition of the further portion, the partition including partition boundaries defined by a constant value of one of the N input values, each partition having a partition boundary bordering one of the test cases; evaluating the partition and generating a further test case if the evaluation reveals that the partition is not covered by the test cases; and adding the partition to the first portion; until the further portion has been explored or a termination criterion met; and producing an augmented test suite including the generated further test cases.

Abstract: An original set of rules are transformed into a resulting set of generalized rules in a rule management system. An original set of rules stored in a data structure for transforming into a resulting set of rules are accessed. The original set of rules is automatically processed by building a compact description of one or more rules in the original set of rules and their actions in the form of logical constraints and solving constraints to find a solution that represents a case and an applied action, building a family of cases by taking all logical tests or their negation that are satisfied by the solution, and generalizing the family of cases by removal of specific logical tests which do not apply to the action, resulting in a most-general rule.

Abstract: Mechanisms for operating a business rule management system are provided. The mechanisms access a text file describing one or more business processes, and bindings of a plurality of text chunks within the text file to a respective plurality of elements within the business rule management system. The mechanisms detect a change in a bound text chunk in the text file and modify the respective bound element within the business rule management system according to the detected change in the bound text chunk in the text file.

Abstract: A method, system, and/or computer program product operate a touch-screen device. A first touch on a touch-screen is detected, and a character is selected therefrom. A second touch on the touch-screen is detected, and a diacritic is selected therefrom. A location of the second touch on the touch-screen is determined. A location for the diacritic is selected according to a determined location of the second touch on the touch-screen. A specific touch-screen output of a selected character and a selected diacritic is then generated, where the selected diacritic is located on the selected character according to a selected diacritic location.

Abstract: A method, device, and/or computer program product operates a touch-screen device. A first touch at a location on a touch-screen is detected. A second touch on the touch-screen, which occurs simultaneously with the first touch on the touch-screen, is detected. A pressure of the detected second touch is calculated and assigned to the detected first touch. A specific touch-screen output is generated according to the location and assigned calculated pressure of the detected first touch.