This document is also available in these non-normative formats: PDF version.
Copyright © 2009 W3C® (MIT, ERCIM, Keio), All Rights Reserved. W3C liability, trademark and document use rules apply.
This document, developed by the Rule Interchange Format (RIF) Working Group, specifies the Basic Logic Dialect, RIF-BLD, a format that allows logic rules to be exchanged between rule systems. The RIF-BLD presentation syntax and semantics are specified both directly and as specializations of the RIF Framework for Logic Dialects, or RIF-FLD. The XML serialization syntax of RIF-BLD is specified via a mapping from the presentation syntax. A normative XML schema is also provided.
This section describes the status of this document at the time of its publication. Other documents may supersede this document. A list of current W3C publications and the latest revision of this technical report can be found in the W3C technical reports index at http://www.w3.org/TR/.
This document is being published as one of a set of 610 documents:
The Rule Interchange Format (RIF) Working Group seeks
public feedback onto gather experience from implementations in order to
increase confidence in the language and meet specific exit criteria. This Editor's Draft.document will remain a Candidate Recommendation until at least 23 October 2009. After that date, when
and if the exit criteria are met, the group intends to request Proposed
Recommendation status.
Please send your commentsreports of implementation experience, and other
feedback, to public-rif-comments@w3.org
(public
archive). If possible, please offer specific changes to the text that would address your concern. You may also wish to check the Wiki VersionReports of this document and see ifany success or difficulty with the relevant text has already been updated.test cases are encouraged. Open discussion among developers is welcome at public-rif-dev@w3.org (public archive).
Publication as a Editor's Draft does not imply endorsement by the W3C Membership. This is a draft document and may be updated, replaced or obsoleted by other documents at any time. It is inappropriate to cite this document as other than work in progress.
This document was produced by a group operating under the 5 February 2004 W3C Patent Policy. W3C maintains a public list of any patent disclosures made in connection with the deliverables of the group; that page also includes instructions for disclosing a patent. An individual who has actual knowledge of a patent which the individual believes contains Essential Claim(s) must disclose the information in accordance with section 6 of the W3C Patent Policy.
This specification develops RIF-BLD (the Basic Logic Dialect of the Rule Interchange Format). From a theoretical perspective, RIF-BLD corresponds to the language of definite Horn rules with equality and a standard first-order semantics [CL73]. Syntactically, RIF-BLD has a number of extensions to support features such as objects and frames as in F-logic [KLW95], internationalized resource identifiers (or IRIs, defined by [RFC-3987]) as identifiers for concepts, and XML Schema datatypes [XML-SCHEMA2]. In addition, RIF RDF and OWL Compatibility [RIF-RDF+OWL] defines semantics for the integrated RIF-BLD/RDF and RIF-BLD/OWL languages. These features make RIF-BLD a Web-aware language. However, it should be kept in mind that RIF is designed to enable interoperability among rule languages in general, and its uses are not limited to the Web.
While rule interchange (and not, e.g., execution) is the principle design goal for RIF-BLD, the design clearly indicates a decision to avoid solving the (probably impossible) problem of rule interchange in general. Instead, the design of RIF reflects the rationale of identifying specific kinds of rules within existing rule systems, called RIF dialects, that can be translated into other rule systems without changing their meaning. RIF-BLD is just the first in a series of such dialects. In particular, RIF-BLD has the RIF-Core dialect [RIF-Core] as a subset. It is not expected that most rule systems will be able to translate all their rules into RIF-BLD, rather it is expected that only certain kinds of rules will be translatable. Since there are many existing rule languages with useful features that are not supported in RIF-BLD, it is expected that RIF-BLD translators will not translate rules that use such features. This could drive the design of "BLD-specific" rule sets in which rules are specifically written by the implementor to be within the BLD dialect and thus be portable between many rule system implementations.
Among its many influences, RIF shares certain characteristics with ISO Common Logic (CL) [ISO-CL], itself an evolution of KIF [KIF] and Conceptual Graphs [CG]. Like CL, RIF employs XML as its primary normative syntax, uses IRIs as identifiers, specifies integrated RIF-BLD/RDF and RIF-BLD/OWL languages for Semantic Web Compatibility [RIF-RDF+OWL], and provides a rich set of datatypes and built-ins that are designed to be well aligned with Web-aware rule system implementations [RIF-DTB]. Unlike CL, RIF-BLD was designed to be a simple dialect with limited expressiveness that lies within the intersection of first-order and logic-programming systems. This is why RIF-BLD does not support negation. More generally, RIF-BLD is part of a coherent array of RIF rule dialects, which encompasses both logic rules -- through the RIF framework for logic dialects [RIF-FLD] also including a variety of rule languages based on non-monotonic theories -- and production rules, as defined in [RIF-PRD]. CL, on the other hand, is strictly first-order; it does not account for non-monotonic semantics (e.g. negation as failure, defaults, priorities, etc.). For rule interchange between CL and RIF dialects, it is expected that partial RIF-CL mappings will be defined.
RIF-BLD also bears some similarity to SPARQL, in particular with respect to RDF Compatibility [RIF-RDF+OWL]. As with the well-known correspondence between a fragment of SQL and Datalog, SPARQL can be partially mapped to Datalog (and thus to the RIF-Core subset of RIF-BLD), see [AP07] and [AG08] for details. A full mapping of SPARQL would need constructs beyond RIF-BLD, such as non-monotonic negation. Likewise, not all of SPARQL's FILTER functions are expressible in RIF-DTB built-in predicates. Not all of RIF-BLD is expressible in SPARQL either, for instance recursive rules over RDF Data are not expressible as SPARQL CONSTRUCT statements.
RIF-BLD is defined in two different ways -- both normative:
Logic-based RIF dialects that specialize or extend RIF-BLD in accordance with the RIF framework for logic dialects [RIF-FLD] include RIF-Core as a specialization of RIF-BLD. It is expected that other specifications will develop further logic dialects based on RIF-BLD such as a RIF-BLD extension capturing uncertainty [URD08].
As a preview, here is a simple complete RIF-BLD example deriving a ternary relation from its inverse.
Example 1 (An introductory RIF-BLD example).
A rule can be written in English to derive the buy relationships (rather than store them) from the sell relationships that are stored as facts (e.g., as exemplified by the English statement below):
Intuitively, the fact Mary buys LeRif from John should be logically derivable from the above premises. Assuming Web IRIs for the predicates buy and sell, as well as for the individuals John, Mary, and LeRif, the above English text can be represented in the RIF-BLD Presentation Syntax as follows.
Document( Prefix(cpt <http://example.com/concepts#>) Prefix(ppl <http://example.com/people#>) Prefix(bks <http://example.com/books#>) Group ( Forall ?Buyer ?Item ?Seller ( cpt:buy(?Buyer ?Item ?Seller) :- cpt:sell(?Seller ?Item ?Buyer) ) cpt:sell(ppl:John bks:LeRif ppl:Mary) ) )
Whenever a RIF-BLD document falls into the Core subset or can be translated to it, the document should be produced in RIF-Core to allow its interchange with a maximum number of RIF consumers.
For instance, the Datalog-like RIF document in Example 1 is also a RIF-Core example.
For the interchange of documents containing RIF-BLD rules (and facts), a concrete RIF-BLD XML Syntax is given in this specification. To formalize their meaning, a model-theoretic RIF-BLD Semantics is specified.
This section specifies the presentation syntax of RIF-BLD directly, without relying on [RIF-FLD]. In the first five (normative) subsections, the presentation syntax is defined using "mathematical English," a special form of English for communicating mathematical definitions, examples, etc. In the non-normative subsection EBNF Grammar for the Presentation Syntax of RIF-BLD, a grammar for a superset of the presentation syntax is given using Extended Backus–Naur Form (EBNF). Neither the mathematical English nor the EBNF is intended to be a concrete syntax for RIF-BLD. The mathematical English deliberately leaves out details such as the delimiters of the various syntactic components, escape symbols, parenthesizing, precedence of operators, and the like. The EBNF does not specify context-sensitive syntactic constraints. Since RIF is an interchange format, it uses XML as the only concrete syntax, which will be defined in XML Serialization Syntax for RIF-BLD. Hence RIF-BLD conformance is described in terms of semantics-preserving transformations.
Note to the reader: this section depends on Section Constants, Symbol Spaces, and Datatypes of [RIF-DTB].
Definition (Alphabet). The alphabet of the presentation language of RIF-BLD consists of
The set of connective symbols, quantifiers, =, etc., is disjoint from Const and Var. The argument names in ArgNames are written as Unicode strings that must not start with a question mark, "?". Variables are written as Unicode strings preceded with the symbol "?".
Constants are written as "literal"^^symspace, where literal is a sequence of Unicode characters and symspace is an identifier for a symbol space. Symbol spaces are defined in Section Constants, Symbol Spaces, and Datatypes of [RIF-DTB].
The symbols =, #, and ## are used in formulas that define equality, class membership, and subclass relationships. The symbol -> is used in terms that have named arguments and in frame formulas. The symbol External indicates that an atomic formula or a function term is defined externally (e.g., a built-in) and the symbols Prefix and Base enable compact representations of IRIs [RFC-3987].
The symbol Document is used to specify RIF-BLD documents, the symbol Import is an import directive, and the symbol Group is used to organize RIF-BLD formulas into collections. ☐
The language of RIF-BLD is the set of formulas constructed using the above alphabet according to the rules given below.
RIF-BLD defines several kinds of terms: constants and variables, positional terms, terms with named arguments, plus equality, membership, subclass, frame, and external terms. The word "term" will be used to refer to any of these constructs.
To simplify the next definition, we will use the phrase base term to refer to simple, positional, or named-argument terms, or to terms of the form External(t), where t is a positional or a named-argument term.
Definition (Term).
Positional terms correspond to the usual terms and atomic formulas of classical first-order logic [Enderton01, Mendelson97].
The constant t here represents a predicate or a function; s1, ..., sn represent argument names; and v1, ..., vn represent argument values. The argument names, s1, ..., sn, are required to be pairwise distinct. Terms with named arguments are like positional terms except that the arguments are named and their order is immaterial. Note that a term of the form f() is, trivially, both a positional term and a term with named arguments.
Terms with named arguments are introduced to support exchange of languages that permit argument positions of predicates and functions to be named (in which case the order of the arguments does not matter).
The last argument, t, represents the tail of the list and so it is normally a list as well. However, the syntax does not restrict t in any way: it could be an integer, a variable, another list, or, in fact, any term. An example is List(1 2 | 3). This is not an ordinary list, where the last argument, 3, would represent the tail of a list (and thus would also be a list, which 3 is not). Such general open lists correspond to Lisp's dotted lists [Steele90]. Note that they can be the result of instantiating an open list with a variable in the tail, hence are hard to avoid. For instance, List(1 2 | 3) is List(1 2 | ?X), where the variable ?X is replaced with 3.
A closed list of the form List() (i.e., a list in which m=0, corresponding to Lisp's nil) is called the empty list.
Membership, subclass, and frame terms are used to describe objects and class hierarchies.
External terms are used for representing built-in functions and predicates as well as "procedurally attached" terms or predicates, which might exist in various rule-based systems, but are not specified by RIF.
Observe that the argument names of frame terms, p1, ..., pn, are base terms and so, as a special case, can be variables. In contrast, terms with named arguments can use only the symbols from ArgNames to represent their argument names. They cannot be constants from Const or variables from Var. The reason for not allowing variables for those is to control the complexity of unification, which is used by several inference mechanisms of first-order logic.
Example 2 (Terms)
a. Positional term: "http://example.com/ex1"^^rif:iri(1 "http://example.com/ex2"^^rif:iri(?X 5) "abc")
b. Term with named arguments: "http://example.com/Person"^^rif:iri(id->"http://example.com/John"^^rif:iri "age"^^rif:local->?X "spouse"^^rif:local->?Y)
c. Frame term: "http://example.com/John"^^rif:iri["age"^^rif:local->?X "spouse"^^rif:local->?Y]
d. Lists
- Empty list: List()
- Closed list with variable inside: List("a"^^xs:string ?Y "c"^^xs:string)
- Open list with variables: List("a"^^xs:string ?Y "c"^^xs:string | ?Z)
- Equality term with lists inside: List(Head | Tail) = List("a"^^xs:string ?Y "c"^^xs:string)
- Nested list: List("a"^^xs:string List(?X "b"^^xs:string) "c"^^xs:string)
e. Classification terms
- Membership: ?X # ?Y
- Subclass: ?X ## "http://example.com/ex1"^^rif:iri(?Y)
- Membership: "http://example.com/John"^^rif:iri # "http://example.com/Person"^^rif:iri
- Subclass: "http://example.com/Student"^^rif:iri ## "http://example.com/Person"^^rif:iri
f. External term: External(pred:numeric-greater-than(?diffdays 10)))
RIF-BLD distinguishes certain subsets of the set Const of symbols, including the subsetsubsets of predicate symbols and function symbols. Section Well-formed Formulas gives more details, but we do not need those details yet.
Definition (Atomic Formula). Any term (positional or with named arguments) of the form p(...), where p is a predicate symbol, is also an atomic formula. Equality, membership, subclass, and frame terms are also atomic formulas. An externally defined term of the form External(φ), where φ is an atomic formula, is also an atomic formula, called an externally defined atomic formula. ☐
Note that simple terms (constants and variables) are not formulas.
More general formulas are constructed from atomic formulas with the help of logical connectives.
Definition (Formula). A formula can have several different forms and is defined as follows:
Condition formulas are intended to be used inside the premises of rules. Next we define the notions of rule implications, universal rules, universal facts, groups (i.e., sets of rules and facts), and documents.
Feature At Risk #2: Equality in the rule conclusion (φ in the above)
Note: This feature is "at risk" and may be removed from this specification based on feedback. Please send feedback to public-rif-comments@w3.org.
Universal facts are often considered to be rules without premises.
Non-empty group formulas are used to represent sets of rules and facts. Note that some of the φi's can be group formulas themselves, which means that groups can be nested.
The Base directive defines a syntactic shortcut for expanding relative IRIs into full IRIs, as described in Section Constants, Symbol Spaces, and Datatypes of [RIF-DTB].
Like the Base directive, the Prefix directives define shorthands to allow more concise representation of constants that come from the symbol space rif:iri (we will call such constants rif:iri constants). This mechanism is explained in [RIF-DTB], Section Constants, Symbol Spaces, and Datatypes.
Section Direct Specification of RIF-BLD Semantics of this document defines the semantics for the directive Import(<loc>) only. The two-argument directive, Import(<loc> <p>), is intended for importing non-RIF-BLD documents, such as rules from other RIF dialects, RDF data, or OWL ontologies. The profile, p, indicates what kind of entity is being imported and under what semantics (for instance, the various RDF entailment regimes have different profiles). The semantics of Import(<loc> <p>) (for various p) are expected to be given by other specifications on a case-by-case basis. For instance, [RIF-RDF+OWL] defines the semantics for the profiles that are recommended for importing RDF and OWL.
Note that although Base, Prefix, and Import all use symbols of the form <iri> to indicate the connection of these symbols to IRIs, these symbols are not rif:iri constants, as semantically they are interpreted in a way that is quite different from constants.
A document formula can contain at most one Base directive. The Base directive, if present, must be first, followed by any number of Prefix directives, followed by any number of Import directives.
In the definition of a formula, the component formulas φ, φi, ψi, and Γ are said to be subformulas of the respective formulas (condition, rule, group, etc.) that are built using these components. ☐
RIF-BLD allows every term and formula (including terms and formulas that occur inside other terms and formulas) to be optionally preceded by an annotation of the form (* id φ *), where id is a rif:iri constant and φ is a frame formula or a conjunction of frame formulas. Both items inside the annotation are optional. The id part represents the identifier of the term or formula to which the annotation is attached and φ is the metadata part of the annotation. RIF-BLD does not impose any restrictions on φ apart from what is stated above. This means that it may include variables, function symbols, constants from the symbol space rif:local (often referred to as local or rif:local constants), and so on.
Document formulas with and without annotations will be referred to as RIF-BLD documents.
The following convention is used to avoid a syntactic ambiguity with respect to annotations. The annotation scoping convention associates each annotation to the largest term or formula it precedes. For instance, in (* id φ *) t[w -> v] the metadata annotation could be attributed to the term t or to the entire frame t[w -> v]. The convention specifies that the above annotation is considered to be syntactically attached to the entire frame. Yet, since φ can be a conjunction, some conjuncts can be used to provide metadata targeted to the object part, t, of the frame. For instance, (* And(_foo[meta_for_frame->"this is an annotation for the entire frame"] _bar[meta_for_object->"this is an annotation for t" meta_for_property->"this is an annotation for w"]) *) t[w -> v].
We suggest to use Dublin Core, RDFS, and OWL properties for metadata, along the lines of Section 7.1 of [OWL-Reference]-- specifically owl:versionInfo, rdfs:label, rdfs:comment, rdfs:seeAlso, rdfs:isDefinedBy, dc:creator, dc:description, dc:date, and foaf:maker.
Not all formulas and thus not all documents are well-formed in RIF-BLD: it is required that no constant appear in more than one context. What this means precisely is explained below.
The set of all constant symbols, Const, is partitioned into the following subsets:
The symbols in Const that belong to the symbol spaces of Datatypes are required to be individuals.
The above subsets do not differentiate between positional and named argument symbols. Also, as seen from the following definitions, these subsets are not specified explicitly but, rather, are inferred from the occurrences of the symbols.
Definition (Context of a symbol).
The context of an occurrence of a symbol, s∈Const, in a formula, φ, is determined as follows:
Definition (Imported document). Let Δ be a document formula and Import(loc) be one of its import directives, where loc is a locator of another document formula, Δ'. We say that Δ' is directly imported into Δ.
A document formula Δ' is said to be imported into Δ if it is either directly imported into Δ or it is imported (directly or not) into some other formula that is directly imported into Δ. ☐
The above definition deals only with one-argument import directives, since only such directives can be used to import other RIF-BLD documents. Two-argument import directives are provided to enable import of other types of documents, and their semantics are supposed to be covered by other specifications, such as [RIF-RDF+OWL].
Definition (Well-formed formula).
A formula φ is well-formed iff:
Definition (Language of RIF-BLD).
The language of RIF-BLD consists of the set of all well-formed formulas and is determined by:
Until now, we have been using mathematical English to specify the syntax of RIF-BLD. Tool developers, however, may prefer EBNF notation, which provides a more succinct view of the syntax. Several points should be kept in mind regarding this notation.
The EBNF for the RIF-BLD presentation syntax is given as follows, showing the entire (top-down) context of its three parts for rules, conditions, and annotations.
Rule Language:
Document ::= IRIMETA? 'Document' '(' Base? Prefix* Import* Group? ')' Base ::= 'Base' '(' ANGLEBRACKIRI ')' Prefix ::= 'Prefix' '(' Name ANGLEBRACKIRI ')' Import ::= IRIMETA? 'Import' '(' LOCATOR PROFILE? ')' Group ::= IRIMETA? 'Group' '(' (RULE | Group)* ')' RULE ::= (IRIMETA? 'Forall' Var+ '(' CLAUSE ')') | CLAUSE CLAUSE ::= Implies | ATOMIC Implies ::= IRIMETA? (ATOMIC | 'And' '(' ATOMIC* ')') ':-' FORMULA LOCATOR ::= ANGLEBRACKIRI PROFILE ::= ANGLEBRACKIRI
Condition Language:
FORMULA ::= IRIMETA? 'And' '(' FORMULA* ')' | IRIMETA? 'Or' '(' FORMULA* ')' | IRIMETA? 'Exists' Var+ '(' FORMULA ')' | ATOMIC | IRIMETA? 'External' '(' Atom ')' ATOMIC ::= IRIMETA? (Atom | Equal | Member | Subclass | Frame) Atom ::= UNITERM UNITERM ::= Const '(' (TERM* | (Name '->' TERM)*) ')' Equal ::= TERM '=' TERM Member ::= TERM '#' TERM Subclass ::= TERM '##' TERM Frame ::= TERM '[' (TERM '->' TERM)* ']' TERM ::= IRIMETA? (Const | Var | Expr | List | 'External' '(' Expr ')') Expr ::= UNITERM List ::= 'List' '(' TERM* ')' | 'List' '(' TERM+ '|' TERM ')' Const ::= '"' UNICODESTRING '"^^' SYMSPACE | CONSTSHORT Name ::= UNICODESTRING Var ::= '?' UNICODESTRING SYMSPACE ::= ANGLEBRACKIRI | CURIE
Annotations:
IRIMETA ::= '(*' IRICONST? (Frame | 'And' '(' Frame* ')')? '*)'
The following subsections explain and exemplify these parts, starting with the basic language of positive conditions.
The Condition Language represents formulas that can be used in the premises of RIF-BLD rules (also called rule bodies). The EBNF grammar for a superset of the RIF-BLD condition language is shown in the above conditions part.
The production rule for the non-terminal FORMULA represents RIF condition formulas (defined earlier). The connectives And and Or define conjunctions and disjunctions of conditions, respectively. Exists introduces existentially quantified variables. Here Var+ stands for the list of variables that are free in FORMULA. RIF-BLD conditions permit only existential variables. A RIF-BLD FORMULA can also be an ATOMIC term, i.e. an Atom, External Atom, Equal, Member, Subclass, or Frame. A TERM can be a constant, variable, Expr, List, or External Expr.
The RIF-BLD presentation syntax does not commit to any particular vocabulary and permits arbitrary Unicode strings in constant symbols, argument names, and variables. Constant symbols can have this form: "UNICODESTRING"^^SYMSPACE, where SYMSPACE is an ANGLEBRACKIRI or CURIE that represents the identifier of the symbol space of the constant, and UNICODESTRING is a Unicode string from the lexical space of that symbol space. ANGLEBRACKIRI and CURIE are defined in Section Shortcuts for Constants in RIF's Presentation Syntax of [RIF-DTB]. Constant symbols can also have several shortcut forms, which are represented by the non-terminal CONSTSHORT. These shortcuts are also defined in the same section of [RIF-DTB]. One of them is the CURIE shortcut, which is extensively used in the examples in this document. Names are Unicode character sequences. Variables are composed of UNICODESTRING symbols prefixed with a ?-sign.
Equality, membership, and subclass terms are self-explanatory. An Atom and Expr (expression) can either be positional or have named arguments. A frame term is a term composed of an object identifier and a collection of attribute-value pairs. The term External(Atom) is a call to an externally defined predicate. Likewise, External(Expr) is a call to an externally defined function.
Example 3 (RIF-BLD conditions).
This example shows conditions that are composed of atoms, expressions, equalities with lists, frames, and existentials. In frame formulas, variables are shown in the positions of object identifiers, object properties, and property values. For brevity, we use the shortcut CURIE notation prefix:suffix for constant symbols defined in [RIF-DTB]. This is understood as a shorthand for an IRI obtained by concatenation of the prefix definition and suffix. Thus, if bks is a prefix that expands into http://example.com/books# then bks:LeRif is an abbreviation for "http://example.com/books#LeRif"^^rif:iri.
Prefix(bks <http://example.com/books#>) Prefix(auth <http://example.com/authors#>) Prefix(cpt <http://example.com/concepts#>)
Positional terms:
cpt:book(auth:rifwg bks:LeRif) Exists ?X (cpt:book(?X bks:LeRif))
Terms with named arguments:
cpt:book(cpt:author->auth:rifwg cpt:title->bks:LeRif) Exists ?X (cpt:book(cpt:author->?X cpt:title->bks:LeRif))
Equalities with list terms:
?L = List(?X ?Y ?X) List(?Head | ?Tail) = List("a"^^rif:local ?Y "c"^^rif:local)
Frames:
bks:wd1[cpt:author->auth:rifwg cpt:title->bks:LeRif] Exists ?X (bks:wd2[cpt:author->?X cpt:title->bks:LeRif]) Exists ?X (And (bks:wd2#cpt:book bks:wd2[cpt:author->?X cpt:title->bks:LeRif])) Exists ?I ?X (?I[cpt:author->?X cpt:title->bks:LeRif]) Exists ?I ?X (And (?I#cpt:book ?I[cpt:author->?X cpt:title->bks:LeRif])) Exists ?S (bks:wd2[cpt:author->auth:rifwg ?S->bks:LeRif]) Exists ?X ?S (bks:wd2[cpt:author->?X ?S->bks:LeRif]) Exists ?I ?X ?S (And (?I#cpt:book ?I[author->?X ?S->bks:LeRif]))
The presentation syntax for RIF-BLD rules is based on the syntax in Section EBNF for RIF-BLD Condition Language with the productions shown in the above rules part.
A RIF-BLD Document consists of an optional Base, followed by any number of Prefixes, followed by any number of Imports, followed by an optional Group. Base and Prefix serve as shortcut mechanisms for IRIs. IRI has the form of an internationalized resource identifier as defined by [RFC-3987]. An Import indicates the location of a document to be imported and an optional profile. A RIF-BLD Group is a collection of any number of RULE elements along with any number of nested Groups.
Rules are generated using CLAUSE elements. The RULE production has two alternatives:
Var, ATOMIC, and FORMULA were defined as part of the syntax for positive conditions in Section EBNF for RIF-BLD Condition Language. In the CLAUSE production, an ATOMIC is what is usually called a fact. An Implies rule can have an ATOMIC or a conjunction of ATOMIC elements as its conclusion; it has a FORMULA as its premise. Note that, by the definition of formulas, externally defined atoms (i.e., formulas of the form External(Atom)) are not allowed in the conclusion part of a rule (ATOMIC does not expand to External).
Example 4 (RIF-BLD rules).
This example shows a business rule borrowed from the document RIF Use Cases and Requirements:
As before, for better readability we use the compact URI notation defined in [RIF-DTB], Section Constants, Symbol Spaces, and Datatypes. Again, prefix directives are assumed in the preamble to the document. Then, two versions of the main part of the document are given.
Prefix(ppl <http://example.com/people#>) Prefix(cpt <http://example.com/concepts#>) Prefix(func <http://www.w3.org/2007/rif-builtin-function#>) Prefix(pred <http://www.w3.org/2007/rif-builtin-predicate#>)
a. Universal form:
Forall ?item ?deliverydate ?scheduledate ?diffduration ?diffdays ( cpt:reject(ppl:John ?item) :- And(cpt:perishable(?item) cpt:delivered(?item ?deliverydate ppl:John) cpt:scheduled(?item ?scheduledate) ?diffduration = External(func:subtract-dateTimes(?deliverydate ?scheduledate)) ?diffdays = External(func:days-from-duration(?diffduration)) External(pred:numeric-greater-than(?diffdays 10))) )
b. Universal-existential form:
Forall ?item ( cpt:reject(ppl:John ?item ) :- Exists ?deliverydate ?scheduledate ?diffduration ?diffdays ( And(cpt:perishable(?item) cpt:delivered(?item ?deliverydate ppl:John) cpt:scheduled(?item ?scheduledate) ?diffduration = External(func:subtract-dateTimes(?deliverydate ?scheduledate)) ?diffdays = External(func:days-from-duration(?diffduration)) External(pred:numeric-greater-than(?diffdays 10))) ) )
The EBNF grammar production for RIF-BLD annotations is shown in the above annotations part.
As explained in Section RIF-BLD Annotations in the Presentation Syntax, RIF-BLD formulas and terms can be prefixed with optional annotations, IRIMETA, for identification and metadata. IRIMETA is represented using (*...*)-brackets that contain an optional rif:iri constant, IRICONST, as identifier followed by an optional Frame or conjunction of Frames as metadata.
An IRICONST is rif:iri constant, again permitting the shortcut forms defined in [RIF-DTB]. One such specialization is '"' IRI '"^^' 'rif:iri' from the Const production, where IRI is a sequence of Unicode characters that forms an internationalized resource identifier as defined by [RFC-3987].
Example 5 (A RIF-BLD document containing an annotated group).
This example shows a complete document containing a group formula that consists of two RIF-BLD rules. The first of these rules is copied from Example 4a. The group is annotated with an IRI identifier and metadata represented using Dublin Core vocabulary.
Document( Prefix(ppl <http://example.com/people#>) Prefix(cpt <http://example.com/concepts#>) Prefix(dc <http://purl.org/dc/terms/>) Prefix(func <http://www.w3.org/2007/rif-builtin-function#>) Prefix(pred <http://www.w3.org/2007/rif-builtin-predicate#>) Prefix(xs <http://www.w3.org/2001/XMLSchema#>) (* "http://sample.org"^^rif:iri _pd[dc:publisher -> "http://www.w3.org/"^^rif:iri dc:date -> "2008-04-04"^^xs:date] *) Group ( Forall ?item ?deliverydate ?scheduledate ?diffduration ?diffdays ( cpt:reject(ppl:John ?item) :- And(cpt:perishable(?item) cpt:delivered(?item ?deliverydate ppl:John) cpt:scheduled(?item ?scheduledate) ?diffduration = External(func:subtract-dateTimes(?deliverydate ?scheduledate)) ?diffdays = External(func:days-from-duration(?diffduration)) External(pred:numeric-greater-than(?diffdays 10))) ) Forall ?item ( cpt:reject(ppl:Fred ?item) :- cpt:unsolicited(?item) ) ) )
This normative section specifies the semantics of RIF-BLD directly, without relying on [RIF-FLD].
Recall that the presentation syntax of RIF-BLD allows shorthand notation, which is specified via the Prefix and Base directives, and various shortcuts for integers, strings, and rif:local symbols. The semantics, below, is described using the full syntax, i.e., we assume that all shortcuts have already been expanded as defined in [RIF-DTB], Section Constants, Symbol Spaces, and Datatypes.
The set TV of truth values in RIF-BLD consists of two values, t and f.
The key concept in a model-theoretic semantics of a logic language is the notion of a semantic structure [Enderton01, Mendelson97]. The definition is slightly more general than what is strictly necessary for RIF-BLD alone. This lays the groundwork for extensions to RIF-BLD and makes the connection with the semantics of the RIF framework for logic-based dialects [RIF-FLD] more obvious.
Definition (Semantic structure). A semantic structure, I, is a tuple of the form <TV, DTS, D, Dind, Dfunc, IC, IV, IF, INF, Ilist, Itail, Iframe, Isub, Iisa, I=, Iexternal, Itruth>. Here D is a non-empty set of elements called the domain of I, and Dind, Dfunc are nonempty subsets of D. Dind is used to interpret the elements of Const that occur as individuals and Dfunc is used to interpret the elements of Const that occur in the context of function symbols. As before, Const denotes the set of all constant symbols and Var the set of all variable symbols. DTS denotes a set of identifiers for datatypes (please refer to Section Datatypes of [RIF-DTB] for the semantics of datatypes).
The other components of I are total mappings defined as follows:
This mapping interprets constant symbols. In addition:
This mapping interprets variable symbols.
This mapping interprets positional terms. In addition:
This mapping interprets function symbols with named arguments. In addition:
In addition, these mappings are required to satisfy the following conditions:
Note that the last condition above restricts Itail only when its last argument is in Dlist. If the last argument of Itail is not in Dlist, then the list is a general open one and there are no restrictions on the value of Itail except that it must be in Dind.
This mapping interprets frame terms. An argument, d ∈ Dind, to Iframe represents an object and the finite bag {<a1,v1>, ..., <ak,vk>} represents a bag of attribute-value pairs for d. We will see shortly how Iframe is used to determine the truth valuation of frame terms.
Bags (multi-sets) are used here because the order of the attribute/value pairs in a frame is immaterial and pairs may repeat. Such repetitions arise naturally when variables are instantiated with constants. For instance, o[?A->?B ?C->?D] becomes o[a->b a->b] if variables ?A and ?C are instantiated with the symbol a while ?B and ?D are instantiated with b. (We shall see later that o[a->b a->b] is equivalent to o[a->b].)
Isub will be further restricted in Section Interpretation of Formulas to ensure that the operator ## is transitive, i.e., that c1 ## c2 and c2 ## c3 imply c1 ## c3.
Iisa will be further restricted in Section Interpretation of Formulas to ensure that the relationships # and ## have the usual property that all members of a subclass are also members of the superclass, i.e., that o # cl and cl ## scl imply o # scl.
It gives meaning to the equality operator.
It is used to define truth valuation for formulas.
For every external schema, σ, associated with the language, Iexternal(σ) is assumed to be specified externally in some document (hence the name external schema). In particular, if σ is a schema of a RIF built-in predicate or function, Iexternal(σ) is specified in [RIF-DTB] so that:
We also define the following mapping from terms to D, which we denote using the same symbol I as the one used for semantic structures. This overloading is convenient and creates no ambiguity.
Here we use {...} to denote a set of argument/value pairs.
Here <> denotes an empty list of elements of Dind. (Note that the domain of Ilist is Dind*, so Dind0 is an empty list of elements of Dind.)
Here {...} denotes a bag of attribute/value pairs. Jumping ahead, we note that duplicate elements in such a bag do not affect the truth value of Ia frame ( I ( o )) -- see Section Interpretation of Non-document Formulas .formula. Thus, for instance, I ( o[a->b[a->b a->b] ) = I (and o[a->b] ).always have the same truth value.
Note that, by definition, External(t) is well-formed only if t is an instanceinstantiation of an external schema. Furthermore, by the definition of coherent sets of external schemas, t can be an instanceinstantiation of at most one such schema, so I(External(t)) is well-defined.
The effect of datatypes. The set DTS must include the datatypes described in Section Datatypes of [RIF-DTB].
The datatype identifiers in DTS impose the following restrictions. Given dt ∈ DTS, let LSdt denote the lexical space of dt, VSdt denote its value space, and Ldt: LSdt → VSdt the lexical-to-value-space mapping (for the definitions of these concepts, see Section Datatypes of [RIF-DTB]). Then the following must hold:
That is, IC must map the constants of a datatype dt in accordance with Ldt.
RIF-BLD does not impose restrictions on IC for constants in symbol spaces that are not datatypes included in DTS. ☐
RIF-BLD annotations are stripped before the mappings that constitute RIF-BLD semantic structures are applied. Likewise, they are stripped before applying the truth valuation, TValI, defined in the next section. Thus, identifiers and metadata have no effect on the formal semantics.
Note that although identifiers and metadata associated with RIF-BLD formulas are ignored by the semantics, they can be extracted by XML tools. The frame terms used to represent RIF-BLD metadata can then be fed to other RIF-BLD rules, thus enabling reasoning about metadata. RIF-BLD does not define any particular semantics for metadata, however.
This section defines how a semantic structure, I, determines the truth value TValI(φ) of a RIF-BLD formula, φ, where φ is any formula other than a document formula. Truth valuation of document formulas is defined in the next section.
We define a mapping, TValI, from the set of all non-document formulas to TV. Note that the definition implies that TValI(φ) is defined only if the set DTS of the datatypes of I includes all the datatypes mentioned in φ and Iexternal is defined on all externally defined functions and predicates in φ.
Definition (Truth valuation). Truth valuation for well-formed formulas in RIF-BLD is determined using the following function, denoted TValI:
To ensure that the operator ## is transitive, i.e., c1 ## c2 and c2 ## c3 imply c1 ## c3, the following is required:
To ensure that all members of a subclass are also members of the superclass, i.e., o # cl and cl ## scl imply o # scl, the following is required:
Since the bag of attribute/value pairs associated with an object o represents the conjunction of pairs each separately associated with o ,assertions represented by these pairs, the following is required, if k > 0:
Note that, by definition, External(t) is well-formed only if t is an instanceinstantiation of an external schema. Furthermore, by the definition of coherent sets of external schemas, t can be an instanceinstantiation of at most one such schema, so I(External(t)) is well-defined.
The empty conjunction is treated as a tautology, so TValI(And()) = t.
The empty disjunction is treated as a contradiction, so TValI(Or()) = f.
Here I* is a semantic structure of the form <TV, DTS, D, Dind, Dfunc, IC, I*V, IF, INF, Ilist, Itail, Iframe, Isub, Iisa, I=, Iexternal, Itruth>, which is exactly like I, except that the mapping I*V, is used instead of IV. I*V is defined to coincide with IV on all variables except, possibly, on ?v1,...,?vn.
If Γ is a group formula of the form Group(φ1 ... φn) then
This means that a group of rules is treated as a conjunction. In particular, the empty group is treated as a tautology, so TValI(Group()) = t. ☐
Document formulas are interpreted using semantic multi-structures, which are sets of closely related semantics structures. The need for multi-structures arises due to the fact that a RIF-BLD document can import other documents and thus is essentially a multi-document object. One interesting aspect of the multi-document semantics is that rif:local symbols that belong to different documents can have different meanings.
Definition (Semantic multi-structure). A semantic multi-structure Î is a set of semantic structures of the form {J,I; Ii1, Ii2, ...}, where
All the structures in Î (adorned and non-adorned) are identical in all respects except for the following:
As will be seen from the next definition, the structure I in the above is used to interpret document formulas, and the adorned structures of the form Iik are used to interpret imported documents. The structure J is used in the definition of entailment to interpret non-document formulas.
The semantics of RIF documents is now defined as follows.
Definition (Truth valuation of document formulas). Let Δ be a document formula and let Δ1, ..., Δn be all the RIF-BLD document formulas that are imported (directly or indirectly, according to Definition Imported document) into Δ. Let Γ, Γ1, ..., Γn denote the respective group formulas associated with these documents. Let Î = {J,I; Ii1, ..., Iin, ...} be a semantic multi-structure that contains the semantic structures adorned with the locators i1, ..., in of the documents Δ1, ..., Δn. Then we define:
Note that this definition considers only those document formulas that are reachable via the one-argument import directives. Two argument import directives are not covered here. Their semantics is defined by the document RIF RDF and OWL Compatibility [RIF-RDF+OWL].
Also note that some of the Γi above may be missing since all parts in a document formula are optional. In this case, we assume that Γi is a tautology, such as And(), and every TVal function maps such a Γi to the truth value t.
For non-document formulas, we extend TValÎ(φ) from regular semantic structures to multi-structures as follows. Let Î = {J, I; ...} be a semantic multi-structure. Then TValÎ(φ) = TValJ(φ).
The above definitions make the intent behind the rif:local constants clear: occurrences of such constants in different documents can be interpreted differently even if they have the same name. Therefore, each document can choose the names for the rif:local constants freely and without regard to the names of such constants used in the imported documents.
For the relationship between rif:local and RDF blank nodes readers are referred to Section Symbols in RIF Versus RDF/OWL (Informative) of [RIF-RDF+OWL].
We now define what it means for a set of RIF-BLD rules (embedded in a group or a document formula) to entail another RIF-BLD formula. In RIF-BLD we are mostly interested in entailment of RIF condition formulas, which can be viewed as queries to RIF-BLD groups or documents. Entailment of condition formulas provides formal underpinning to RIF-BLD queries.
Definition (Models).
A multi-structure Î is a model of a formula, φ, written as Î |= φ, iff TValÎ(φ) = t. Here φ can be a document or a non-document formula. ☐
Definition (Logical entailment).
Let φ and ψ be (document or non-document) formulas. We say that φ entails ψ, written as φ |= ψ, if and only if for every multi-structure, Î, for which both TVal Î ( φ ) and TVal Î ( ψ ) are defined,Î |= φ implies Î |= ψ. ☐
Note that one consequence of the multi-document semantics of RIF-BLD is that local constants specified in one document cannot be queried from another document. For instance, if one document, Δ', has the fact "http://example.com/ppp"^^rif:iri("abc"^^rif:local) while another document formula, Δ, imports Δ' and has the rule "http://example.com/qqq"^^rif:iri(?X) :- "http://example.com/ppp"^^rif:iri(?X), then Δ |= "http://example.com/qqq"^^rif:iri("abc"^^rif:local) does not hold. This is because the symbol "abc"^^rif:local in Δ' and Δ is treated as different constants by semantic multi-structures.
This behavior of local symbols should be contrasted with the behavior of rif:iri symbols. Suppose, in the above scenario, Δ' also has the fact "http://example.com/ppp"^^rif:iri("http://cde.example.org"^^rif:iri). Then Δ |= "http://example.com/qqq"^^rif:iri("http://cde.example.org"^^rif:iri) does hold.
The RIF-BLD XML serialization defines
Recall that the syntax of RIF-BLD is not context-free and thus cannot be fully captured by EBNF or XML Schema. Still, validity with respect to XML Schema can be a useful test. To reflect this state of affairs, we define two notions of syntactic correctness. The weaker notion checks correctness only with respect to XML Schema, while the stricter notion represents "true" syntactic correctness.
Definition (Valid BLD document in XML syntax). A valid BLD document in the XML syntax is an XML document that is valid with respect to the XML schema in Appendix XML Schema for BLD. ☐
Definition (Admissible BLD document in XML syntax). An admissible BLD document in the XML syntax is a valid BLD document in XML syntax that is the image of a well-formed RIF-BLD document in the presentation syntax (see Definition Well-formed formula in Section Formulas) under the presentation-to-XML syntax mapping χbld defined in Section Mapping from the Presentation Syntax to the XML Syntax. ☐
The XML serialization for RIF-BLD is based on an alternating or striped syntax [ANF01]. A striped serialization views XML documents as objects and divides all XML tags into class descriptors, called type tags, and property descriptors, called role tags [TRT03]. We follow the tradition of using capitalized names for type tags and lowercase names for role tags.
The all-uppercase classes in the presentation syntax, such as FORMULA, become XML Schema groups in Appendix XML Schema for BLD. They are not visible in instance markup. The other classes as well as non-terminals and symbols (such as Exists or =) become XML elements with optional attributes, as shown below.
RIF-BLD uses [XML1.0] for its XML syntax.
XML serialization of RIF-BLD in Section EBNF for RIF-BLD Condition Language uses the following elements.
- And (conjunction) - Or (disjunction) - Exists (quantified formula for 'Exists', containing declare and formula roles) - declare (declare role, containing a Var) - formula (formula role, containing a FORMULA) - Atom (atom formula, positional or with named arguments) - External (external call, containing a content role) - content (content role, containing an Atom, for predicates, or Expr, for functions) - Member (member formula) - Subclass (subclass formula) - Frame (Frame formula) - object (Member/Frame role, containing a TERM or an object description) - op (Atom/Expr role for predicates/functions as operations) - args (Atom/Expr positional arguments role, with ordered="yes" attribute, containing n TERMs) - instance (Member instance role) - class (Member class role) - sub (Subclass sub-class role) - super (Subclass super-class role) - slot (Atom/Expr or Frame slot role, with ordered="yes" attribute, containing a Name or TERM followed by a TERM) - Equal (prefix version of term equation '=') - left (Equal left-hand side role) - right (Equal right-hand side role) - Expr (expression formula, positional or with named arguments) - List (list term, closed or open) - rest (list rest role, corresponding to '|') - Const (individual, function, or predicate symbol, with 'type' attribute) - Name (name of named argument) - Var (logic variable) - id (identifier role, containing IRICONST) - meta (meta role, containing metadata as a Frame or Frame conjunction)
The name of a prefix is not associated with an XML element, since it is handled via preprocessing as discussed in Section Mapping of the Condition Language.
The id and meta elements, which are expansions of the IRIMETA element, can occur optionally as the initial children of any Class element.
For the XML Schema definition of the RIF-BLD condition language see Appendix XML Schema for BLD.
The XML syntax for symbol spaces uses the type attribute associated with the XML element Const. For instance, a literal in the xs:dateTime datatype is represented as follows:
<Const type="&xs;dateTime">2007-11-23T03:55:44-02:30</Const>
RIF-BLD also uses the ordered="yes" attribute to indicate that the children of args and slot elements are ordered.
Example 6 (A RIF condition and its XML serialization).
This example illustrates XML serialization for RIF conditions. As before, the compact URI notation is used for better readability. Assume that the following prefix directives are found in the preamble to the document, whose XML form will be illustrated in Example 8:
Prefix(bks <http://example.com/books#>) Prefix(cpt <http://example.com/concepts#>) Prefix(curr <http://example.com/currencies#>) Prefix(rif <http://www.w3.org/2007/rif#>) Prefix(xs <http://www.w3.org/2001/XMLSchema#>)
RIF condition:
And (Exists ?Buyer (cpt:purchase(?Buyer ?Seller cpt:book(?Author bks:LeRif) curr:USD(49))) ?Seller=?Author )
XML serialization:
<And> <formula> <Exists> <declare><Var>Buyer</Var></declare> <formula> <Atom> <op><Const type="&rif;iri">&cpt;purchase</Const></op> <args ordered="yes"> <Var>Buyer</Var> <Var>Seller</Var> <Expr> <op><Const type="&rif;iri">&cpt;book</Const></op> <args ordered="yes"> <Var>Author</Var> <Const type="&rif;iri">&bks;LeRif</Const> </args> </Expr> <Expr> <op><Const type="&rif;iri">&curr;USD</Const></op> <args ordered="yes"><Const type="&xs;integer">49</Const></args> </Expr> </args> </Atom> </formula> </Exists> </formula> <formula> <Equal> <left><Var>Seller</Var></left> <right><Var>Author</Var></right> </Equal> </formula> </And>
Example 7 (An XML serialization of a RIF condition with a frame and a named-argument term).
This example illustrates XML serialization of RIF conditions that involve terms with named arguments. As in Example 6, we assume the following prefix directives, whose XML form will be illustrated in Example 8:
Prefix(bks <http://example.com/books#>) Prefix(cpt <http://example.com/concepts#>) Prefix(curr <http://example.com/currencies#>) Prefix(rif <http://www.w3.org/2007/rif#>) Prefix(xs <http://www.w3.org/2001/XMLSchema#>)
RIF condition:
And (Exists ?Buyer ?P ( And (?P#cpt:purchase ?P[cpt:buyer->?Buyer cpt:seller->?Seller cpt:item->cpt:book(cpt:author->?Author cpt:title->bks:LeRif) cpt:price->49 cpt:currency->curr:USD])) ?Seller=?Author)
XML serialization:
<And> <formula> <Exists> <declare><Var>Buyer</Var></declare> <declare><Var>P</Var></declare> <formula> <And> <formula> <Member> <instance><Var>P</Var></instance> <class><Const type="&rif;iri">&cpt;purchase</Const></class> </Member> </formula> <formula> <Frame> <object> <Var>P</Var> </object> <slot ordered="yes"> <Const type="&rif;iri">&cpt;buyer</Const> <Var>Buyer</Var> </slot> <slot ordered="yes"> <Const type="&rif;iri">&cpt;seller</Const> <Var>Seller</Var> </slot> <slot ordered="yes"> <Const type="&rif;iri">&cpt;item</Const> <Expr> <op><Const type="&rif;iri">&cpt;book</Const></op> <slot ordered="yes"> <Name>&cpt;author</Name> <Var>Author</Var> </slot> <slot ordered="yes"> <Name>&cpt;title</Name> <Const type="&rif;iri">&bks;LeRif</Const> </slot> </Expr> </slot> <slot ordered="yes"> <Const type="&rif;iri">&cpt;price</Const> <Const type="&xs;integer">49</Const> </slot> <slot ordered="yes"> <Const type="&rif;iri">&cpt;currency</Const> <Const type="&rif;iri">&curr;USD</Const> </slot> </Frame> </formula> </And> </formula> </Exists> </formula> <formula> <Equal> <left><Var>Seller</Var></left> <right><Var>Author</Var></right> </Equal> </formula> </And>
We now extend the set of RIF-BLD serialization elements from Section XML for RIF-BLD Condition Language by including rules, along with their enclosing groups and documents, as described in Section EBNF for RIF-BLD Rule Language. The extended set includes the tags listed below. While there is a RIF-BLD element tag for the Import directive, there are none for the Prefix and Base directives: they are handled as discussed in Section Mapping of the RIF-BLD Rule Language.
- Document (document, containing optional directive and payload roles) - directive (directive role, containing Import) - payload (payload role, containing Group) - Import (importation, containing location and optional profile) - location (location role, containing ANYURICONST) - profile (profile role, containing PROFILE) - Group (nested collection of sentences) - sentence (sentence role, containing RULE or Group) - Forall (quantified formula for 'Forall', containing declare and formula roles) - Implies (implication, containing if and then roles) - if (antecedent role, containing FORMULA) - then (consequent role, containing ATOMIC or conjunction of ATOMICs)
The XML Schema Definition of RIF-BLD is given in Appendix XML Schema for BLD.
Example 8 (Serializing a RIF-BLD document containing an annotated group).
This example shows a serialization for the document from Example 5. For convenience, the document is reproduced at the top and then is followed by its serialization.
Presentation syntax:
Document( Prefix(ppl <http://example.com/people#>) Prefix(cpt <http://example.com/concepts#>) Prefix(dc <http://purl.org/dc/terms/>) Prefix(rif <http://www.w3.org/2007/rif#>) Prefix(func <http://www.w3.org/2007/rif-builtin-function#>) Prefix(pred <http://www.w3.org/2007/rif-builtin-predicate#>) Prefix(xs <http://www.w3.org/2001/XMLSchema#>) (* "http://sample.org"^^rif:iri _pd[dc:publisher -> "http://www.w3.org/"^^rif:iri dc:date -> "2008-04-04"^^xs:date] *) Group ( Forall ?item ?deliverydate ?scheduledate ?diffduration ?diffdays ( cpt:reject(ppl:John ?item) :- And(cpt:perishable(?item) cpt:delivered(?item ?deliverydate ppl:John) cpt:scheduled(?item ?scheduledate) ?diffduration = External(func:subtract-dateTimes(?deliverydate ?scheduledate)) ?diffdays = External(func:days-from-duration(?diffduration)) External(pred:numeric-greater-than(?diffdays 10))) ) Forall ?item ( cpt:reject(ppl:Fred ?item) :- cpt:unsolicited(?item) ) ) )
XML syntax:
<!DOCTYPE Document [ <!ENTITY ppl "http://example.com/people#"> <!ENTITY cpt "http://example.com/concepts#"> <!ENTITY dc "http://purl.org/dc/terms/"> <!ENTITY rif "http://www.w3.org/2007/rif#"> <!ENTITY func "http://www.w3.org/2007/rif-builtin-function#"> <!ENTITY pred "http://www.w3.org/2007/rif-builtin-predicate#"> <!ENTITY xs "http://www.w3.org/2001/XMLSchema#"> ]> <Document xmlns="http://www.w3.org/2007/rif#" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xs="http://www.w3.org/2001/XMLSchema#"> <payload> <Group> <id> <Const type="&rif;iri">http://sample.org</Const> </id> <meta> <Frame> <object> <Const type="&rif;local">pd</Const> </object> <slot ordered="yes"> <Const type="&rif;iri">&dc;publisher</Const> <Const type="&rif;iri">http://www.w3.org/</Const> </slot> <slot ordered="yes"> <Const type="&rif;iri">&dc;date</Const> <Const type="&xs;date">2008-04-04</Const> </slot> </Frame> </meta> <sentence> <Forall> <declare><Var>item</Var></declare> <declare><Var>deliverydate</Var></declare> <declare><Var>scheduledate</Var></declare> <declare><Var>diffduration</Var></declare> <declare><Var>diffdays</Var></declare> <formula> <Implies> <if> <And> <formula> <Atom> <op><Const type="&rif;iri">&cpt;perishable</Const></op> <args ordered="yes"><Var>item</Var></args> </Atom> </formula> <formula> <Atom> <op><Const type="&rif;iri">&cpt;delivered</Const></op> <args ordered="yes"> <Var>item</Var> <Var>deliverydate</Var> <Const type="&rif;iri">&ppl;John</Const> </args> </Atom> </formula> <formula> <Atom> <op><Const type="&rif;iri">&cpt;scheduled</Const></op> <args ordered="yes"> <Var>item</Var> <Var>scheduledate</Var> </args> </Atom> </formula> <formula> <Equal> <left><Var>diffduration</Var></left> <right> <External> <content> <Expr> <op><Const type="&rif;iri">&func;subtract-dateTimes</Const></op> <args ordered="yes"> <Var>deliverydate</Var> <Var>scheduledate</Var> </args> </Expr> </content> </External> </right> </Equal> </formula> <formula> <Equal> <left><Var>diffdays</Var></left> <right> <External> <content> <Expr> <op><Const type="&rif;iri">&func;days-from-duration</Const></op> <args ordered="yes"> <Var>diffduration</Var> </args> </Expr> </content> </External> </right> </Equal> </formula> <formula> <External> <content> <Atom> <op><Const type="&rif;iri">&pred;numeric-greater-than</Const></op> <args ordered="yes"> <Var>diffdays</Var> <Const type="&xs;integer">10</Const> </args> </Atom> </content> </External> </formula> </And> </if> <then> <Atom> <op><Const type="&rif;iri">&cpt;reject</Const></op> <args ordered="yes"> <Const type="&rif;iri">&ppl;John</Const> <Var>item</Var> </args> </Atom> </then> </Implies> </formula> </Forall> </sentence> <sentence> <Forall> <declare><Var>item</Var></declare> <formula> <Implies> <if> <Atom> <op><Const type="&rif;iri">&cpt;unsolicited</Const></op> <args ordered="yes"><Var>item</Var></args> </Atom> </if> <then> <Atom> <op><Const type="&rif;iri">&cpt;reject</Const></op> <args ordered="yes"> <Const type="&rif;iri">&ppl;Fred</Const> <Var>item</Var> </args> </Atom> </then> </Implies> </formula> </Forall> </sentence> </Group> </payload> </Document>
This section defines a normative mapping, χbld, from the presentation syntax to the XML syntax of RIF-BLD. The mapping is given via tables where each row specifies the mapping of a particular syntactic pattern in the presentation syntax. These patterns appear in the first column of the tables and the bold-italic symbols represent metavariables. The second column represents the corresponding XML patterns, which may contain applications of the mapping χbld to these metavariables. When an expression χbld(metavar) occurs in an XML pattern in the right column of a translation table, it should be understood as a recursive application of χbld to the presentation syntax represented by the metavariable. The XML syntax result of such an application is substituted for the expression χbld(metavar). A sequence of terms containing metavariables with subscripts is indicated by an ellipsis. For the subscript m it is understood that m≥1, i.e. the ellipsis indicates at least one term. For the subscript n it is understood that n≥0, i.e. the ellipsis indicates zero or more terms. A metavariable or a well-formed XML subelement is marked as optional by appending a bold-italic question mark, ?, on its right.
The χbld mapping from the presentation syntax to the XML syntax of the RIF-BLD Condition Language is specified by the table below. Each row indicates a translation χbld(Presentation) = XML. Since the presentation syntax of RIF-BLD is context sensitive, the mapping must differentiate between the terms that occur in the position of individuals and the terms that occur as atomic formulas. To this end, in the translation table, the positional and named-argument terms that occur in the context of atomic formulas are denoted by expressions of the form pred(...) and the terms that occur as individuals are denoted by expressions of the form func(...). In the table, each metavariable for an (unnamed) positional argumenti is assumed to be instantiated to values unequal to the instantiations of named arguments unicodestringj -> fillerj. Regarding the last but first row, we assume that shortcuts for constants [RIF-DTB] have already been expanded to their full form ("..."^^symspace).
Presentation Syntax | XML Syntax |
---|---|
And ( conjunct1 . . . conjunctn ) |
<And> <formula>χbld(conjunct1)</formula> . . . <formula>χbld(conjunctn)</formula> </And> |
Or ( disjunct1 . . . disjunctn ) |
<Or> <formula>χbld(disjunct1)</formula> . . . <formula>χbld(disjunctn)</formula> </Or> |
Exists variable1 . . . variablen ( premise ) |
<Exists> <declare>χbld(variable1)</declare> . . . <declare>χbld(variablen)</declare> <formula>χbld(premise)</formula> </Exists> |
External ( atomexpr ) |
<External> <content>χbld(atomexpr)</content> </External> |
pred ( argument1 . . . argumentn ) |
<Atom> <op>χbld(pred)</op> <args ordered="yes"> χbld(argument1) . . . χbld(argumentn) </args> </Atom> |
func ( argument1 . . . argumentn ) |
<Expr> <op>χbld(func)</op> <args ordered="yes"> χbld(argument1) . . . χbld(argumentn) </args> </Expr> |
List ( element1 . . . elementn ) |
<List> χbld(element1) . . . χbld(elementn) </List> |
List ( element1 . . . elementm | remainder ) |
<List> χbld(element1) . . . χbld(elementm) <rest>χbld(remainder)</rest> </List> |
pred ( unicodestring1 -> filler1 . . . unicodestringn -> fillern ) |
<Atom> <op>χbld(pred)</op> <slot ordered="yes"> <Name>unicodestring1</Name> χbld(filler1) </slot> . . . <slot ordered="yes"> <Name>unicodestringn</Name> χbld(fillern) </slot> </Atom> |
func ( unicodestring1 -> filler1 . . . unicodestringn -> fillern ) |
<Expr> <op>χbld(func)</op> <slot ordered="yes"> <Name>unicodestring1</Name> χbld(filler1) </slot> . . . <slot ordered="yes"> <Name>unicodestringn</Name> χbld(fillern) </slot> </Expr> |
inst [ key1 -> filler1 . . . keyn -> fillern ] |
<Frame> <object>χbld(inst)</object> <slot ordered="yes"> χbld(key1) χbld(filler1) </slot> . . . <slot ordered="yes"> χbld(keyn) χbld(fillern) </slot> </Frame> |
inst # class |
<Member> <instance>χbld(inst)</instance> <class>χbld(class)</class> </Member> |
sub ## super |
<Subclass> <sub>χbld(sub)</sub> <super>χbld(super)</super> </Subclass> |
left = right |
<Equal> <left>χbld(left)</left> <right>χbld(right)</right> </Equal> |
"unicodestring"^^symspace |
<Const type="symspace">unicodestring</Const> |
?unicodestring |
<Var>unicodestring</Var> |
The χbld mapping from the presentation syntax to the XML syntax of the RIF-BLD Rule Language is specified by the table below. It extends the translation table of Section Mapping of the Condition Language. While the Import directive is handled by the presentation-to-XML syntax mapping, the Prefix and Base directives are not. Instead, these directives should be handled by expanding the associated shortcuts (compact URIs). Namely, a prefix name declared in a Prefix directive is expanded into the associated IRI, while relative IRIs are completed using the IRI declared in the Base directive. The mapping χbld applies only to such expanded documents. RIF-BLD also allows other treatments of Prefix and Base provided that they produce equivalent XML documents. One such treatment is employed in the examples in this document, especially Example 8. It replaces prefix names with definitions of XML entities as follows. Each Prefix declaration becomes an ENTITY declaration [XML1.0] within a DOCTYPE DTD attached to the RIF-BLD Document. The Base directive is mapped to the xml:base attribute [XML-Base] in the XML Document tag. Compact URIs of the form prefix:suffix are then mapped to &prefix;suffix.
Presentation Syntax | XML Syntax |
---|---|
Document( Import(loc1 prfl1?) . . . Import(locn prfln?) group? ) |
<Document> <directive> <Import> <location>χbld(loc1)</location> <profile>χbld(prfl1)</profile>? </Import> </directive> . . . <directive> <Import> <location>χbld(locn)</location> <profile>χbld(prfln)</profile>? </Import> </directive> <payload>χbld(group)</payload>? </Document> |
Group( clause1 . . . clausen ) |
<Group> <sentence>χbld(clause1)</sentence> . . . <sentence>χbld(clausen)</sentence> </Group> |
Forall variable1 . . . variablen ( rule ) |
<Forall> <declare>χbld(variable1)</declare> . . . <declare>χbld(variablen)</declare> <formula>χbld(rule)</formula> </Forall> |
conclusion :- condition |
<Implies> <if>χbld(condition)</if> <then>χbld(conclusion)</then> </Implies> |
The χbld mapping from RIF-BLD annotations in the presentation syntax to the XML syntax is specified by the table below. It extends the translation tables of Sections Mapping of the Condition Language and Mapping of the Rule Language. The metavariable Typetag in the presentation and XML syntaxes stands for any of the class names And, Or, External, Document, or Group, and Quantifier for Exists or Forall. The dollar sign, $, stands for any of the binary infix operator names #, ##, =, or :-, while Binop stands for their respective class names Member, Subclass, Equal, or Implies. Again, each metavariable for an (unnamed) positional argumenti is assumed to be instantiated to values unequal to the instantiations of named arguments unicodestringj -> fillerj.
Presentation Syntax | XML Syntax |
---|---|
(* iriconst? frameconj? *) Typetag ( e1 . . . en ) |
<Typetag> <id>χbld(iriconst)</id>? <meta>χbld(frameconj)</meta>? e1' . . . en' </Typetag> where e1', . . ., en' are defined by the equation χbld(Typetag(e1 . . . en)) = <Typetag>e1' . . . en'</Typetag> |
(* iriconst? frameconj? *) Quantifier variable1 . . . variablen ( formula ) |
<Quantifier> <id>χbld(iriconst)</id>? <meta>χbld(frameconj)</meta>? <declare>χbld(variable1)</declare> . . . <declare>χbld(variablen)</declare> <formula>χbld(formula)</formula> </Quantifier> |
(* iriconst? frameconj? *) pred ( argument1 . . . argumentn ) |
<Atom> <id>χbld(iriconst)</id>? <meta>χbld(frameconj)</meta>? <op>χbld(pred)</op> <args ordered="yes"> χbld(argument1) . . . χbld(argumentn) </args> </Atom> |
(* iriconst? frameconj? *) func ( argument1 . . . argumentn ) |
<Expr> <id>χbld(iriconst)</id>? <meta>χbld(frameconj)</meta>? <op>χbld(func)</op> <args ordered="yes"> χbld(argument1) . . . χbld(argumentn) </args> </Expr> |
(* iriconst? frameconj? *) pred ( unicodestring1 -> filler1 . . . unicodestringn -> fillern ) |
<Atom> <id>χbld(iriconst)</id>? <meta>χbld(frameconj)</meta>? <op>χbld(pred)</op> <slot ordered="yes"> <Name>unicodestring1</Name> χbld(filler1) </slot> . . . <slot ordered="yes"> <Name>unicodestringn</Name> χbld(fillern) </slot> </Atom> |
(* iriconst? frameconj? *) func ( unicodestring1 -> filler1 . . . unicodestringn -> fillern ) |
<Expr> <id>χbld(iriconst)</id>? <meta>χbld(frameconj)</meta>? <op>χbld(func)</op> <slot ordered="yes"> <Name>unicodestring1</Name> χbld(filler1) </slot> . . . <slot ordered="yes"> <Name>unicodestringn</Name> χbld(fillern) </slot> </Expr> |
(* iriconst? frameconj? *) inst [ key1 -> filler1 . . . keyn -> fillern ] |
<Frame> <id>χbld(iriconst)</id>? <meta>χbld(frameconj)</meta>? <object>χbld(inst)</object> <slot ordered="yes"> χbld(key1) χbld(filler1) </slot> . . . <slot ordered="yes"> χbld(keyn) χbld(fillern) </slot> </Frame> |
(* iriconst? frameconj? *) e1 $ e2 |
<Binop> <id>χbld(iriconst)</id>? <meta>χbld(frameconj)</meta>? e1' e2' </Binop> where Binop, e1', e2' are defined by the equation χbld(e1 $ e2) = <Binop>e1' e2'</Binop> |
(* iriconst? frameconj? *) unicodestring^^symspace |
<Const type="symspace"> <id>χbld(iriconst)</id>? <meta>χbld(frameconj)</meta>? unicodestring </Const> |
(* iriconst? frameconj? *) ?unicodestring |
<Var> <id>χbld(iriconst)</id>? <meta>χbld(frameconj)</meta>? unicodestring </Var> |
RIF-BLD does not require or expect conformant systems to implement the RIF-BLD presentation syntax. Instead, conformance is described in terms of semantics-preserving transformations between the native syntax of a compliant system and the XML syntax of RIF-BLD.
Let Τ be a set of datatypes and symbol spaces that includes the datatypes specified in [RIF-DTB], and the symbol spaces rif:iri, and rif:local. Suppose Ε is a coherent set of external schemas that includes the built-ins listed in [RIF-DTB]. We say that a formula φ is a BLDΤ,Ε formula iff
A RIF processor is a conformant BLDΤ,Ε consumer iff it implements a semantics-preserving mapping, μ, from the set of all BLDΤ,Ε formulas to the language L of the processor (μ does not need to be an "onto" mapping).
Formally, this means that for any pair φ, ψ of BLDΤ,Ε formulas for which φ |=BLD ψ is defined, φ |=BLD ψ iff μ(φ) |=L μ(ψ). Here |=BLD denotes the logical entailment in RIF-BLD and |=L is the logical entailment in the language L of the RIF processor.
A RIF processor is a conformant BLDΤ,Ε producer iff it implements a semantics-preserving mapping, ν, from the language L of the processor to the set of all BLDΤ,Ε formulas (ν does not need to be an "onto" mapping).
Formally, this means that for any pair φ, ψ of formulas in L for which φ |=L ψ is defined, φ |=L ψ iff ν(φ) |=BLD ν(ψ).
An admissible document is one which conforms to all the syntactic constraints of RIF-BLD, including ones that cannot be checked by an XML Schema validator (cf. Definition Admissible BLD document in XML syntax).
The above definitions are specializations to BLD of the general conformance clauses defined in the RIF framework for logic dialects [RIF-FLD]. The following clauses are further restrictions that are specific to RIF-BLD.
RIF-BLD specific clauses
Feature At Risk #3: Strictness Requirement
Note: This feature is "at risk" and may be removed from this specification based on feedback. Please send feedback to public-rif-comments@w3.org.
The two preceding clauses are features AT RISK. In particular, the "strictness" requirement is under discussion.
RIF-BLD supports a wide variety of syntactic forms for terms and formulas, which creates infrastructure for exchanging syntactically diverse rule languages. It is important to realize, however, that the above conformance statements make it possible for systems that do not support some of the syntax directly to still support it through syntactic transformations. For instance, disjunctions in rule premises can be eliminated through a standard transformation, such as replacing p :- Or(q r) with a pair of rules p :- q, p :- r. Terms with named arguments can be reduced to positional terms by ordering the arguments by their names and incorporating the ordered argument names into the predicate name. For instance, p(bb->1 aa->2) can be represented as p_aa_bb(2 1).
This normative section describes RIF-BLD by specializing RIF-FLD. The reader is assumed to be familiar with RIF-FLD as described in RIF framework for logic dialects [RIF-FLD]. The reader who is not interested in how RIF-BLD is derived from the framework can skip this section.
This section defines the precise relationship between the presentation syntax of RIF-BLD and the syntactic framework of RIF-FLD.
The presentation syntax of the RIF Basic Logic Dialect is defined by specialization from the presentation syntax of the RIF Syntactic Framework for Logic Dialects described in [RIF-FLD]. Section Syntax of a RIF Dialect as a Specialization of the RIF Framework in [RIF-FLD] lists the parameters of the syntactic framework in mathematical English, which we will now specialize for RIF-BLD.
All extension points of RIF-FLD are removed (specialized by replacing them with zero objects).
The alphabet of the RIF-BLD presentation syntax is the alphabet of RIF-FLD with the symbols Dialect, Neg, and Naf excluded.
The signature set of RIF-BLD contains the following signatures:
The signature individual{ } represents the context in which individual objects (but not atomic formulas) can appear.
The signature atomic{ } represents the context where atomic formulas can occur.
In the RIF-BLD specialization of RIF-FLD, the argument names s1, ..., sk must be pairwise distinct.
A constant cannot have the signature atomic, since only complex terms can have such signatures. Thus, by itself a symbol, p, cannot be a proposition in RIF-BLD, but a term of the form p() can.
According to the above, each constant symbol in RIF-BLD can be either an individual, a plain function, a plain predicate, an externally defined function, or an externally defined predicate. However, the same function symbol (plain or external) can occur with different numbers of arguments in different places. Similarly, predicate symbols can occur with different numbers of arguments. Note that such polyadic terms with the same function or predicate symbol but different arities could be replaced by terms with fixed arities: the arity information could be encoded in the function or predicate names. For instance, the polyadic predicate terms p(?X) and p(?X,?Y) could be represented, Prolog-style, as p/1(?X) and p/2(?X,?Y), respectively, regarding the slash as part of the predicate names.
This means that equality can compare only those terms whose signature is individual; it cannot compare predicate or function symbols. Equality terms are also not allowed to occur inside other terms, since the above signature implies that any term of the form t = s has signature atomic and not individual.
Note that this precludes the possibility that a frame term might occur as an argument to a predicate, a function, or inside some other term.
Note that this precludes the possibility that a membership term might occur as an argument to a predicate, a function, or inside some other term.
As with frames and membership terms, this precludes the possibility that a subclass term might occur inside some other term.
RIF-BLD uses no special syntax for declaring signatures. Instead, the rule author specifies signatures contextually. That is, since RIF-BLD requires that each symbol is associated with a unique signature, the signature is determined from the context in which the symbol is used. If a symbol is used in more than one context, the parser must treat this as a syntax error. If no errors are found, all terms and atomic formulas are guaranteed to be well-formed. Thus, signatures are not part of the RIF-BLD language, and individual and atomic are not reserved keywords.
Combined with the fact that in a well-formed term of the form External(t) the subterm t must be an instanceinstantiation of an external schema (by the definition of well-formed external terms in RIF-FLD), it follows that a predicate or a function symbol, p, that occurs in an external term External(p(...)) cannot also occur as a non-external symbol.
RIF-BLD requires the symbol spaces defined in Section Constants, Symbol Spaces, and Datatypes of [RIF-DTB].
RIF-BLD supports the following types of formulas (see Well-formed Terms and Formulas in [RIF-FLD] for the definitions):
A RIF-BLD condition is an atomic formula, a conjunctive or disjunctive combination of atomic formulas, or an external atomic formula. All these can optionally have existential quantifiers.
A RIF-BLD rule is a universally quantified RIF-FLD rule with the following restrictions:
Note: This feature (Equality in the rule conclusion) is "at risk". See feature at risk #2
A universal fact is a universally quantified atomic formula with no free variables.
A RIF-BLD group is a RIF-FLD group that contains only RIF-BLD rules, universal facts, variable-free rule implications, variable-free atomic formulas, and RIF-BLD groups.
A RIF-BLD document is a RIF-FLD document that consists of directives and a RIF-BLD group formula. There is no Dialect or Module directives, and the Import(<loc>) directive (with one argument) can import RIF-BLD documents only. Here loc must be a Unicode character sequence that forms an IRI. There are no BLD-specific restrictions on the two-argument directive Import except that the second argument must be a Unicode sequence of characters of the form <loc>, where loc is an IRI.
Negation (whether classical or default) is not allowed in RIF-BLD rules: neither in rule conclusions nor in premises.
This normative section defines the precise relationship between the semantics of RIF-BLD and the semantic framework of RIF-FLD. Specification of the semantics that does not rely on RIF-FLD is given in Section Direct Specification of RIF-BLD Semantics.
The semantics of the RIF Basic Logic Dialect is defined by specialization from the semantics of the semantic framework for logic dialects of RIF. Section Semantics of a RIF Dialect as a Specialization of the RIF Framework in [RIF-FLD] lists the parameters of the semantic framework that can be specialized. Thus, for RIF-BLD, we need to look at the following parameters:
RIF-BLD does not support negation. This is the only obvious simplification with respect to RIF-FLD as far as the semantics is concerned. The restrictions on the signatures of symbols in RIF-BLD do not affect the semantics in a significant way.
The set TV of truth values in RIF-BLD consists of two values, t and f, such that f <t t. The order <t is total.
RIF-BLD supports the datatypes listed in Section Datatypes of [RIF-DTB].
Recall that logical entailment in RIF-FLD is defined with respect to an unspecified set of intended semantic structures and that dialects of RIF must make this notion concrete. For RIF-BLD, this set is defined as the set of all models.
The semantics of the two-argument Import directive is given in [RIF-RDF+OWL]. The semantics of the one-argument directive is the same as in RIF-FLD.
Section Mapping from the RIF-FLD Presentation Syntax to the XML Syntax of [RIF-FLD] defines a mapping, χfld, from the presentation syntax of RIF-FLD to its XML serialization. When restricted to well-formed RIF-BLD formulas, χfld coincides with the BLD-to-XML mapping χbld. In this way, the XML serialization of RIF-BLD is a specialization of the RIF-FLD XML Serialization Framework defined in [RIF-FLD].
If T is a set of datatypes and symbol spaces and E a coherent set of external schemas for functions and predicates, then the general definition of conformance in RIF-FLD yields the notion of conformant BLDT,E producers and consumers.
BLD further requires strictness, i.e., that a conformant producer produces only the documents where T are precisely the datatypes/symbol spaces and E are the external schemas specified in [RIF-DTB], and that a conformant consumer consumes only such documents.
Note: This feature (Strictness requirement) is "at risk". See feature at risk #3
This document is the product of the Rules Interchange Format (RIF) Working Group (see below) whose members deserve recognition for their time and commitment. The editors extend special thanks to: Jos de Bruijn, Gary Hallmark, Stella Mitchell, Leora Morgenstern, Adrian Paschke, Axel Polleres, and Dave Reynolds, for their thorough reviews and insightful discussions; the working group chairs, Chris Welty and Christian de Sainte-Marie, for their invaluable technical help and inspirational leadership; and W3C staff contact Sandro Hawke, a constant source of ideas, help, and feedback.
The regular attendees at meetings of the Rule Interchange Format (RIF) Working Group at the time of the publication were:
Adrian Paschke (Freie Universitaet Berlin),
Axel Polleres (DERI),
Changhai Ke (ILOG),
Chris Welty (IBM),
Christian de Sainte Marie (ILOG),
Dave Reynolds (HP),
Gary Hallmark (ORACLE),
Harold Boley (NRC),
Hassan Aït-Kaci (ILOG),
Jos de Bruijn (FUB),
Leora Morgenstern (IBM),
Michael Kifer (Stony Brook),
Mike Dean (BBN),
Sandro Hawke (W3C/MIT), and
Stella Mitchell (IBM).
We would also like to thank past members of the working group, Allen Ginsberg, David Hirtle, Igor Mozetic, and Paula-Lavinia Patranjan.
The namespace of RIF is http://www.w3.org/2007/rif#.
XML schemas for the RIF-BLD sublanguages are defined below and are also available here with additional examples.
<?xml version="1.0" encoding="UTF-8"?> <xs:schema xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xml="http://www.w3.org/XML/1998/namespace" xmlns="http://www.w3.org/2007/rif#" targetNamespace="http://www.w3.org/2007/rif#" elementFormDefault="qualified" version="Id: BLDCond.xsd, v. 1.4, 2009-06-25, dhirtle/hboley"> <xs:import namespace='http://www.w3.org/XML/1998/namespace' schemaLocation='http://www.w3.org/2001/xml.xsd'/> <xs:annotation> <xs:documentation> This is the XML schema for the Condition Language as defined by the Last Call Draft of the RIF Basic Logic Dialect. The schema is based on the following EBNF for the RIF-BLD Condition Language: FORMULA ::= IRIMETA? 'And' '(' FORMULA* ')' | IRIMETA? 'Or' '(' FORMULA* ')' | IRIMETA? 'Exists' Var+ '(' FORMULA ')' | ATOMIC | IRIMETA? 'External' '(' Atom ')' ATOMIC ::= IRIMETA? (Atom | Equal | Member | Subclass | Frame) Atom ::= UNITERM UNITERM ::= Const '(' (TERM* | (Name '->' TERM)*) ')' Equal ::= TERM '=' TERM Member ::= TERM '#' TERM Subclass ::= TERM '##' TERM Frame ::= TERM '[' (TERM '->' TERM)* ']' TERM ::= IRIMETA? (Const | Var | Expr | List | 'External' '(' Expr ')') Expr ::= UNITERM List ::= 'List' '(' TERM* ')' | 'List' '(' TERM+ '|' TERM ')' Const ::= '"' UNICODESTRING '"^^' SYMSPACE | CONSTSHORT Name ::= UNICODESTRING Var ::= '?' UNICODESTRING SYMSPACE ::= ANGLEBRACKIRI | CURIE IRIMETA ::= '(*' IRICONST? (Frame | 'And' '(' Frame* ')')? '*)' </xs:documentation> </xs:annotation> <xs:group name="FORMULA"> <!-- FORMULA ::= IRIMETA? 'And' '(' FORMULA* ')' | IRIMETA? 'Or' '(' FORMULA* ')' | IRIMETA? 'Exists' Var+ '(' FORMULA ')' | ATOMIC | IRIMETA? 'External' '(' Atom ')' --> <xs:choice> <xs:element ref="And"/> <xs:element ref="Or"/> <xs:element ref="Exists"/> <xs:group ref="ATOMIC"/> <xs:element name="External" type="External-FORMULA.type"/> </xs:choice> </xs:group> <xs:complexType name="External-FORMULA.type"> <!-- sensitive to FORMULA (Atom) context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element name="content" type="content-FORMULA.type"/> </xs:sequence> </xs:complexType> <xs:complexType name="content-FORMULA.type"> <!-- sensitive to FORMULA (Atom) context--> <xs:sequence> <xs:element ref="Atom"/> </xs:sequence> </xs:complexType> <xs:element name="And"> <xs:complexType> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="formula" minOccurs="0" maxOccurs="unbounded"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="Or"> <xs:complexType> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="formula" minOccurs="0" maxOccurs="unbounded"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="Exists"> <xs:complexType> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="declare" minOccurs="1" maxOccurs="unbounded"/> <xs:element ref="formula"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="formula"> <xs:complexType> <xs:sequence> <xs:group ref="FORMULA"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="declare"> <xs:complexType> <xs:sequence> <xs:element ref="Var"/> </xs:sequence> </xs:complexType> </xs:element> <xs:group name="ATOMIC"> <!-- ATOMIC ::= IRIMETA? (Atom | Equal | Member | Subclass | Frame) --> <xs:choice> <xs:element ref="Atom"/> <xs:element ref="Equal"/> <xs:element ref="Member"/> <xs:element ref="Subclass"/> <xs:element ref="Frame"/> </xs:choice> </xs:group> <xs:element name="Atom"> <!-- Atom ::= UNITERM --> <xs:complexType> <xs:sequence> <xs:group ref="UNITERM"/> </xs:sequence> </xs:complexType> </xs:element> <xs:group name="UNITERM"> <!-- UNITERM ::= Const '(' (TERM* | (Name '->' TERM)*) ')' --> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="op"/> <xs:choice> <xs:element ref="args" minOccurs="0" maxOccurs="1"/> <xs:element name="slot" type="slot-UNITERM.type" minOccurs="0" maxOccurs="unbounded"/> </xs:choice> </xs:sequence> </xs:group> <xs:element name="op"> <xs:complexType> <xs:sequence> <xs:element ref="Const"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="args"> <xs:complexType> <xs:sequence> <xs:group ref="TERM" minOccurs="1" maxOccurs="unbounded"/> </xs:sequence> <xs:attribute name="ordered" type="xs:string" fixed="yes"/> </xs:complexType> </xs:element> <xs:complexType name="slot-UNITERM.type"> <!-- sensitive to UNITERM (Name) context--> <xs:sequence> <xs:element ref="Name"/> <xs:group ref="TERM"/> </xs:sequence> <xs:attribute name="ordered" type="xs:string" fixed="yes"/> </xs:complexType> <xs:element name="Equal"> <!-- Equal ::= TERM '=' TERM --> <xs:complexType> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="left"/> <xs:element ref="right"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="left"> <xs:complexType> <xs:sequence> <xs:group ref="TERM"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="right"> <xs:complexType> <xs:sequence> <xs:group ref="TERM"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="Member"> <!-- Member ::= TERM '#' TERM --> <xs:complexType> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="instance"/> <xs:element ref="class"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="Subclass"> <!-- Subclass ::= TERM '##' TERM --> <xs:complexType> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="sub"/> <xs:element ref="super"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="instance"> <xs:complexType> <xs:sequence> <xs:group ref="TERM"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="class"> <xs:complexType> <xs:sequence> <xs:group ref="TERM"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="sub"> <xs:complexType> <xs:sequence> <xs:group ref="TERM"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="super"> <xs:complexType> <xs:sequence> <xs:group ref="TERM"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="Frame"> <!-- Frame ::= TERM '[' (TERM '->' TERM)* ']' --> <xs:complexType> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="object"/> <xs:element name="slot" type="slot-Frame.type" minOccurs="0" maxOccurs="unbounded"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="object"> <xs:complexType> <xs:sequence> <xs:group ref="TERM"/> </xs:sequence> </xs:complexType> </xs:element> <xs:complexType name="slot-Frame.type"> <!-- sensitive to Frame (TERM) context--> <xs:sequence> <xs:group ref="TERM"/> <xs:group ref="TERM"/> </xs:sequence> <xs:attribute name="ordered" type="xs:string" fixed="yes"/> </xs:complexType> <xs:group name="TERM"> <!-- TERM ::= IRIMETA? (Const | Var | Expr | List | 'External' '(' Expr ')') --> <xs:choice> <xs:element ref="Const"/> <xs:element ref="Var"/> <xs:element ref="Expr"/> <xs:element ref="List"/> <xs:element name="External" type="External-TERM.type"/> </xs:choice> </xs:group> <xs:element name="List"> <!-- List ::= 'List' '(' TERM* ')' | 'List' '(' TERM+ '|' TERM ')' rewritten as List ::= 'List' '(' LISTELEMENTS? ')' --> <xs:complexType> <xs:sequence> <xs:group ref="LISTELEMENTS" minOccurs="0" maxOccurs="1"/> </xs:sequence> </xs:complexType> </xs:element> <xs:group name="LISTELEMENTS"> <!-- LISTELEMENTS ::= TERM+ ('|' TERM)? --> <xs:sequence> <xs:group ref="TERM" minOccurs="1" maxOccurs="unbounded"/> <xs:element ref="rest" minOccurs="0" maxOccurs="1"/> </xs:sequence> </xs:group> <xs:element name="rest"> <xs:complexType> <xs:sequence> <xs:group ref="TERM"/> </xs:sequence> </xs:complexType> </xs:element> <xs:complexType name="External-TERM.type"> <!-- sensitive to TERM (Expr) context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element name="content" type="content-TERM.type"/> </xs:sequence> </xs:complexType> <xs:complexType name="content-TERM.type"> <!-- sensitive to TERM (Expr) context--> <xs:sequence> <xs:element ref="Expr"/> </xs:sequence> </xs:complexType> <xs:element name="Expr"> <!-- Expr ::= UNITERM --> <xs:complexType> <xs:sequence> <xs:group ref="UNITERM"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="Const"> <!-- Const ::= '"' UNICODESTRING '"^^' SYMSPACE | CONSTSHORT --> <xs:complexType mixed="true"> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> </xs:sequence> <xs:attribute name="type" type="xs:anyURI" use="required"/> <xs:attribute ref="xml:lang"/> </xs:complexType> </xs:element> <xs:element name="Name" type="xs:string"> <!-- Name ::= UNICODESTRING --> </xs:element> <xs:element name="Var"> <!-- Var ::= '?' UNICODESTRING --> <xs:complexType mixed="true"> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> </xs:sequence> </xs:complexType> </xs:element> <xs:group name="IRIMETA"> <!-- IRIMETA ::= '(*' IRICONST? (Frame | 'And' '(' Frame* ')')? '*)' --> <xs:sequence> <xs:element ref="id" minOccurs="0" maxOccurs="1"/> <xs:element ref="meta" minOccurs="0" maxOccurs="1"/> </xs:sequence> </xs:group> <xs:element name="id"> <xs:complexType> <xs:sequence> <xs:element name="Const" type="IRICONST.type"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="meta"> <xs:complexType> <xs:choice> <xs:element ref="Frame"/> <xs:element name="And" type="And-meta.type"/> </xs:choice> </xs:complexType> </xs:element> <xs:complexType name="And-meta.type"> <!-- sensitive to meta (Frame) context--> <xs:sequence> <xs:element name="formula" type="formula-meta.type" minOccurs="0" maxOccurs="unbounded"/> </xs:sequence> </xs:complexType> <xs:complexType name="formula-meta.type"> <!-- sensitive to meta (Frame) context--> <xs:sequence> <xs:element ref="Frame"/> </xs:sequence> </xs:complexType> <xs:complexType name="IRICONST.type" mixed="true"> <!-- sensitive to location/id context--> <xs:sequence/> <xs:attribute name="type" type="xs:anyURI" use="required" fixed="http://www.w3.org/2007/rif#iri"/> </xs:complexType> </xs:schema>
<?xml version="1.0" encoding="UTF-8"?> <xs:schema xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xml="http://www.w3.org/XML/1998/namespace" xmlns="http://www.w3.org/2007/rif#" targetNamespace="http://www.w3.org/2007/rif#" elementFormDefault="qualified" version="Id: BLDRule.xsd, v.1.4,2009-06-25,1.5, 2009-07-03, dhirtle/hboley"> <xs:annotation> <xs:documentation> This is the XML schema for the Rule Language as defined by the Last Call Draft of the RIF Basic Logic Dialect. The schema is based on the following EBNF for the RIF-BLD Rule Language: Document ::= IRIMETA? 'Document' '(' Base? Prefix* Import* Group? ')' Base ::= 'Base' '(' ANGLEBRACKIRI ')' Prefix ::= 'Prefix' '(' Name ANGLEBRACKIRI ')' Import ::= IRIMETA? 'Import' '(' LOCATOR PROFILE? ')' Group ::= IRIMETA? 'Group' '(' (RULE | Group)* ')' RULE ::= (IRIMETA? 'Forall' Var+ '(' CLAUSE ')') | CLAUSE CLAUSE ::= Implies | ATOMIC Implies ::= IRIMETA? (ATOMIC | 'And' '(' ATOMIC* ')') ':-' FORMULA LOCATOR ::= ANGLEBRACKIRI PROFILE ::= ANGLEBRACKIRI Note that this is an extension of the syntax for the RIF-BLD Condition Language (BLDCond.xsd). </xs:documentation> </xs:annotation> <!-- The Rule Language includes the Condition Language from the same directory --> <xs:include schemaLocation="BLDCond.xsd"/> <xs:element name="Document"> <!-- Document ::= IRIMETA? 'Document' '(' Base? Prefix* Import* Group? ')' --> <xs:complexType> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="directive" minOccurs="0" maxOccurs="unbounded"/> <xs:element ref="payload" minOccurs="0" maxOccurs="1"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="directive"> <!-- Base and Prefix represented directly in XML --> <xs:complexType> <xs:sequence> <xs:element ref="Import"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="payload"> <xs:complexType> <xs:sequence> <xs:element ref="Group"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="Import"> <!-- Import ::= IRIMETA? 'Import' '(' LOCATOR PROFILE? ')' LOCATOR ::= ANGLEBRACKIRI PROFILE ::= ANGLEBRACKIRI --> <xs:complexType> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="location"/> <xs:element ref="profile" minOccurs="0" maxOccurs="1"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="location"> <xs:complexType> <xs:sequence> <xs:element name="Const"type="IRICONST.type"/>type="ANYURICONST.type"/> <!-- type="&xs;anyURI" --> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="profile"> <xs:complexType> <xs:sequence> <xs:element name="Const"type="IRICONST.type"/>type="ANYURICONST.type"/> <!-- type="&xs;anyURI" --> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="Group"> <!-- Group ::= IRIMETA? 'Group' '(' (RULE | Group)* ')' --> <xs:complexType> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="sentence" minOccurs="0" maxOccurs="unbounded"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="sentence"> <xs:complexType> <xs:choice> <xs:group ref="RULE"/> <xs:element ref="Group"/> </xs:choice> </xs:complexType> </xs:element> <xs:group name="RULE"> <!-- RULE ::= (IRIMETA? 'Forall' Var+ '(' CLAUSE ')') | CLAUSE --> <xs:choice> <xs:element ref="Forall"/> <xs:group ref="CLAUSE"/> </xs:choice> </xs:group> <xs:element name="Forall"> <xs:complexType> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="declare" minOccurs="1" maxOccurs="unbounded"/> <!-- different from formula in And, Or and Exists --> <xs:element name="formula"> <xs:complexType> <xs:group ref="CLAUSE"/> </xs:complexType> </xs:element> </xs:sequence> </xs:complexType> </xs:element> <xs:group name="CLAUSE"> <!-- CLAUSE ::= Implies | ATOMIC --> <xs:choice> <xs:element ref="Implies"/> <xs:group ref="ATOMIC"/> </xs:choice> </xs:group> <xs:element name="Implies"> <!-- Implies ::= IRIMETA? (ATOMIC | 'And' '(' ATOMIC* ')') ':-' FORMULA --> <xs:complexType> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="if"/> <xs:element ref="then"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="if"> <xs:complexType> <xs:sequence> <xs:group ref="FORMULA"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="then"> <xs:complexType> <xs:choice> <xs:group ref="ATOMIC"/> <xs:element name="And" type="And-then.type"/> </xs:choice> </xs:complexType> </xs:element> <xs:complexType name="And-then.type"> <!-- sensitive to then (ATOMIC) context--> <xs:sequence> <xs:element name="formula" type="formula-then.type" minOccurs="0" maxOccurs="unbounded"/> </xs:sequence> </xs:complexType> <xs:complexType name="formula-then.type"> <!-- sensitive to then (ATOMIC) context--> <xs:sequence> <xs:group ref="ATOMIC"/> </xs:sequence> </xs:complexType> <xs:complexType name="ANYURICONST.type" mixed="true"> <!-- sensitive to location/profile context--> <xs:sequence/> <xs:attribute name="type" type="xs:anyURI" use="required" fixed="http://www.w3.org/2001/XMLSchema#anyURI"/> </xs:complexType> </xs:schema>
This sectionappendix summarizes the main changes to this documentdocument.
Changes since the "last call" public snapshotdraft of July 30, 2008.
Changes since the draft of July 3, 2009.