[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index] | [Elist Home]
Subject: RE: [xacml] re: functions
Before we vote: I agree with these definitions below - but I think we do not need to add any additional on-error wrapping functions as part of the core standard. Error is an error - it should not happen, and if happened should not be hidden or silently substituted with a default value. If such functionality is truly needed - a second rule and an appropriate rule-combining algorithm can take care of that without blowing up the default list. Or it can be an extension. Daniel. -----Original Message----- From: Polar Humenn [mailto:polar@syr.edu] Sent: Monday, August 26, 2002 2:38 PM To: XACML Subject: Re: [xacml] re: functions These are my current text for the logical functions: or This function returns false if it has no arguments and returns true if one of its arguments evaluates to true. The order of evaluation is unspecified. The expression results in ERROR if at least one argument results in ERROR and all other arguments result in ERROR or false. and This function returns true if it has no arguments and returns false if one of its arguments evaluates to false. The order of evaluation is unspecified. The expression results in ERROR if at least one argument results in ERROR and all other arguments result in ERROR or true. n-of The first argument to this function is an xs:integer specifying the number of the remaining arguments that are required to evaluate to true for the expression to be considered true. If the first argument is 0, the result is true. If number of arguments after the first one is less than the value of the first argument, the expression is considered to result in ERROR. The order of evaluation is to first evaluate the integer value, then evaluate the subsequent arguments. The order of the evaluation of the subsequent arguments is unspecified. The expression only returns ERROR if the required number of true values can only be reached if the number of ERROR values were considered true. Formally, assume the number of required true values is denoted by N, the number of subsequent boolean arguments is denoted by A, and during the evaluation, the number of false values is denoted by F, the number of true values is denoted by T, and the number of errors is denoted by E, such that A=(T+F+E). The following evaluation semantics shall hold: A < N, ERROR N <= T, true T < N and N <= T+E, ERROR otherwise, false ---------------------------------------------------------------- To subscribe or unsubscribe from this elist use the subscription manager: <http://lists.oasis-open.org/ob/adm.pl>
[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index] | [Elist Home]
Powered by eList eXpress LLC