Re: [UCR] Design constraints: early example goal/csf hierarchy

This is great Dave
Frank

On Apr 4, 2006, at 6:05 AM, Dave Reynolds wrote:

>
> This is an incomplete attempt to sketch out an example goal/csf/ 
> requirement hierarchy to help me at least see the wood for the trees.
>
> This is not "right", just preliminary musings, so it can't go into  
> the Design Constraints page (violates the stated ground rules for  
> that). Posted in its current highly preliminary state in case it is  
> a useful seed.
>
> Dave
> "the job of a strawman is to have bayonets stuck in it"
>
> ** Goals
> G1 Enable effective interchange of rules between existing rule systems
> G2 Widespread adoption
> G3 Foundation for a semantic web rule language
>
> ** Breakdown
>
> G1 Enable effective interchange of rules between existing rule systems
>  C1.1 Able to express the main features of relevant commercial rule  
> systems
>    R1.1.1 Support for production rule languages
>    ...
>
>  C1.2 Interchanges can be meaning preserving
>    R1.2.1 RIF semantics is clear and precise
>    R1.2.2 RIF semantics is compatible with the rule languages to be
>           exchanged
>
>  C1.3 Cohesive, sufficiently few RIF dialects that there is useful
>       interchange
>
> G2 Widespread adoption
>  C2.1 Low cost of entry
>   R2.1.1 comprehensible and succinct specification documents
>   R2.1.2 (auxiliary) human readable syntax
>
>  C2.2 Ease of "implementation"
>   R2.2.1 Sufficiently expressive that RLi -> RIFdialect is easy
>   R2.2.2 Sufficiently inexpressive that RIFdialect -> RLj is easy
>   R2.2.3 modest number of RIF dialects
>
>  C2.3 Can be extended to handle interchange between languages not
>       explicitly considered by WG
>   R2.3.1 Extensibility mechanism
>
> G3 Foundation for a semantic web rule language
>  C3.1 Webized
>   R3.1.1 predicates, instance objects etc designated by URIs
>    ...
>
>  C3.2 Compatible with RDF
>   R3.2.1 RIF core must be able to accept RDF triples as data
>   R3.2.2 RIF core must be able to express RDF deduction rules
>   ...
>
>  C3.3 Compatible with OWL
>   R3.3.1 RIF Standard inference and OWL inference can be combined in a
>           well-defined fashion
>   ...
>
>  C3.4 Compatible with SPARQL
>   R3.4.1 RIF Standard rules can query SPARQL data sources
>   R3.4.2 RIF Standard include SPARQL-compatible named graph support?
>   ...
>
>
>
>

Received on Tuesday, 4 April 2006 15:05:00 UTC