[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index] | [Elist Home]
Subject: [xacml] Proposed resolution to PM-5-17: Boolean Expression of rules
Based on the March 2002 Face-to-Face, I believe this issue, for which Pierangela is the champion, is ready to be closed. Resolution: The <condition> element in a <rule> can be a boolean expression of predicates. <rule>s are combined in a <policyStatement> using a "combiner" algorithm, which specifies how the results of the <rule>s are combined. Likewise, <policyStatement>s and other <policyCombinationStatment>s are combined in a <policyCombinationStatement> using a "combiner" algorithm, which specifies how the results of the <policyStatement>s and <policyCombinationStatement>s are combined. Some combiner algorithms may be expressed using boolean expressions, but other combiner algorithms will use other logic. A combiner algorithm MAY be expressed using descriptive text rather than a formal language or pseudo-code. Anne -- Anne H. Anderson Email: Anne.Anderson@Sun.COM Sun Microsystems Laboratories 1 Network Drive,UBUR02-311 Tel: 781/442-0928 Burlington, MA 01803-0902 USA Fax: 781/442-1692
[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index] | [Elist Home]
Powered by eList eXpress LLC