Please refer to the errata for this document, which may include some normative corrections.
A color-coded version of this document showing changes made since the previous version is also available.
This document is also available in these non-normative formats: PDF version.
See also translations.
Copyright © 2013 W3C^{®} (MIT, ERCIM, Keio, Beihang), All Rights Reserved. W3C liability, trademark and document use rules apply.
This document, developed by the Rule Interchange Format (RIF) Working Group, defines a general RIF Framework for Logic Dialects (RIF-FLD). The framework describes mechanisms for specifying the syntax and semantics of logic RIF dialects through a number of generic concepts such as signatures, symbol spaces, semantic structures, and so on. The actual dialects should specialize this framework to produce their syntaxes and semantics.
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 13 documents:
There have been no changes to the body of this document since the previous version. For details on earlier changes, see the change log.
Please send any comments to public-rif-comments@w3.org (public archive). Although work on this document by the Rule Interchange Format (RIF) Working Group is complete, comments may be addressed in the errata or in future revisions. Open discussion among developers is welcome at public-rif-dev@w3.org (public archive).
This document has been reviewed by W3C Members, by software developers, and by other W3C groups and interested parties, and is endorsed by the Director as a W3C Recommendation. It is a stable document and may be used as reference material or cited from another document. W3C's role in making the Recommendation is to draw attention to the specification and to promote its widespread deployment. This enhances the functionality and interoperability of the Web.
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.
The RIF Framework for Logic Dialects (RIF-FLD) is a formalism for specifying all logic dialects of RIF, including the RIF Basic Logic Dialect [RIF-BLD] and [RIF-Core] (albeit not [RIF-PRD], as the latter is not a logic-based RIF dialect). RIF-FLD is a formalism in which both syntax and semantics are described through a number of mechanisms that are commonly used for various logic languages, but are rarely brought all together. Amalgamation of several different mechanisms is required because the framework must be broad enough to accommodate several different types of logic languages and because various advanced mechanisms are needed to facilitate translation into a common framework. RIF-FLD gives precise definitions to these mechanisms, but allows well-defined aspects to vary. The design of RIF envisions that future standard logic dialects will be based on RIF-FLD. Therefore, for any RIF dialect to become a standard, its development should start as a specialization of FLD and extensions to (or, deviations from) FLD should be justified.
The framework described in this document is very general and captures most of the popular logic rule languages found in Databases, Logic Programming, and on the Semantic Web. However, it is anticipated that the needs of future dialects might stimulate further evolution of RIF-FLD. In particular, future extensions might include a logic rendering of actions as found in production and reactive rule languages. This would support Semantic Web services languages such as [SWSL-Rules] and [WSML-Rules].
This document is mostly intended for the designers of future RIF dialects. All logic RIF dialects should be derived from RIF-FLD by specialization, as explained in Sections Syntax of a RIF Dialect as a Specialization of RIF-FLD and Semantics of a RIF Dialect as a Specialization of RIF-FLD. In addition to specialization, to lower the barrier of entry for their intended audiences, a dialect designer may choose to also specify the syntax and semantics in a direct, but equivalent, way, which does not require familiarity with RIF-FLD. For instance, the RIF Basic Logic Dialect [RIF-BLD] is specified by specialization from RIF-FLD and also directly, without relying on the framework. Thus, the reader who is only interested in RIF-BLD can proceed directly to that document.
RIF-FLD has the following main components:
Syntactic framework. The syntactic framework defines eleven types of RIF terms:
It should be noted that [RIF-DTB] introduces a number of built-in equality predicates for the various data types (for instance, pred:numeric-equal or pred:boolean-equal). Those predicates have fixed interpretations, which coincide with the interpretation of the equality terms defined in this document when the latter are evaluated over data types. However, outside of the data types, the interpretation of the equality terms may vary and is determined by the contents of RIF documents. General use of equality terms is supported in systems such as FLORA-2 [FL2], and special cases are also allowed in Relfun [RF99].
Terms are then used to define several types of RIF-FLD formulas. RIF dialects can choose to permit all or some of the aforesaid categories of terms. In addition, RIF-FLD introduces extension points, one of which allows the introduction of new kinds of terms. An extension point is a keyword that is not a syntactic construct per se, but a placeholder that is supposed to be replaced by specific syntactic constructs of an appropriate kind. RIF-FLD defines several types of extension points: symbols (NEWSYMBOL), connectives (NEWCONNECTIVE), quantifiers (NEWQUANTIFIER), aggregate functions (NEWAGGRFUNC), and terms (NEWTERM).
The syntactic framework also defines the following specialization mechanisms:
Symbol spaces partition the set of non-logical symbols that correspond to individual constants, predicates, and functions, and each partition is then given its own semantics. A symbol space has an identifier and a lexical space, which defines the "shape" of the symbols in that symbol space. Some symbol spaces in RIF are used to identify Web entities and their lexical space consists of strings that syntactically look like internationalized resource identifiers [RFC-3987], or IRIs (e.g., http://www.w3.org/2007/rif#iri). Other symbol spaces are used to represent the datatypes required by RIF (for example, http://www.w3.org/2001/XMLSchema#integer).
Signatures determine which terms and formulas are well-formed. They constitute a generalization of the notion of sorts in classical first-order logic [Enderton01]. Each nonlogical symbol (and some logical symbols, like =) has an associated signature. A signature defines, in a precise way, the syntactic contexts in which the symbol is allowed to occur.
For instance, the signature associated with a symbol p might allow p to appear in a term of the form f(p), but disallow it to occur in a term like p(a,b). The signature for f, on the other hand, might allow that symbol to appear in f(p) and f(p,q), but disallow f(p,q,r) and f(f). In this way, it is possible to control which symbols are used for predicates and which for functions, where variables can occur, and so on.
Depending on their needs, dialects can decide which symbols have which signatures.
A dialect might impose further restrictions on the form of a particular kind of term or formula. For example, variables or aggregate terms might not be allowed in certain places.
Semantic framework. This framework defines the notion of a semantic structure (also known as interpretation in the literature [Enderton01, Mendelson97]). Semantic structures are used to interpret formulas and to define logical entailment. As with the syntax, this framework includes a number of mechanisms that RIF logic dialects can specialize to suit their needs. These mechanisms include:
A set of formulas G logically entails another formula g if for every semantic structure I in some set S, if G is true in I then g is also true in I. Almost all logics define entailment this way. The difference lies in which set S they use. For instance, logics that are based on the classical first-order predicate calculus, such as most Description Logics, assume that S is the set of all semantic structures. In contrast, most Logic Programming languages use default negation. Accordingly, the set S contains only the so-called minimal Herbrand models [Lloyd87] of G and, furthermore, only the minimal models of a special kind. See [Shoham87] for a more detailed exposition of this subject.
XML serialization framework. This framework defines the general principles for mapping the presentation syntax of RIF-FLD to the concrete XML interchange format. This includes:
This specification is the latest draft of the RIF-FLD definition. Each RIF dialect that is derived from RIF-FLD will be described in its own document. The first such dialect, the RIF Basic Logic Dialect, is described in [RIF-BLD]. A core dialect, which is defined by further specializing RIF-BLD, is specified in [RIF-Core].
The next subsection explains how to derive the presentation syntax of a RIF dialect from the presentation syntax of the RIF framework. The actual syntax of the RIF framework is given in subsequent subsections.
In the (normative) subsections 2 to 9, the presentation syntax is defined using "mathematical English," a special form of English for communicating mathematical definitions, examples, etc. In the non-normative final subsection EBNF Grammar for the Presentation Syntax of RIF-FLD, a grammar for a superset of the presentation syntax is given using Extended Backus–Naur Form (EBNF).
The presentation syntax for a RIF dialect can be obtained from the general syntactic framework of RIF by specializing the following parameters, which are defined later in this document:
Signatures determine which terms in the dialect are well-formed and which are not.
The exact way signatures are assigned depends on the dialect. An assignment can be explicit or implicit (for instance, derived from the context in which each symbol is used).
The RIF logic framework introduces the following types of terms:
A dialect might support all of these terms or just a subset. For instance, some dialects might not support terms with named arguments or frame terms or certain forms of external terms (e.g., external frames). A dialect might even support additional kinds of terms that are not listed above (for instance, typing terms of F-logic [KLW95]). This is done by actualizing the extension point NEWTERM, i.e., by replacing it with zero or more new kinds of terms.
Symbol spaces determine the syntax of the constant symbols that are allowed in the dialect. All RIF dialects are expected to support certain symbols spaces (see the section Symbol Spaces). Dialects can also introduce additional symbol spaces, such as a symbol space to represent Skolem constants and functions.
RIF-FLD offers the following kinds of formula terms "out of the box":
A dialect might support all of these formulas or it might impose various restrictions. For instance, the formulas allowed in the conclusion and/or premises of implications might be restricted (e.g., [RIF-BLD] essentially allows Horn rules only), certain types of quantification might be prohibited (e.g., [RIF-BLD] disallows existential quantification in the rule head), symmetric or default negation (or both) might not be allowed (as in RIF-BLD), etc. The Core subdialect of RIF-BLD disallows equality formulas in the conclusions of rules.
More interestingly, dialects can introduce additional types of formulas by adding new connectives (e.g., classical implication or bi-implication) and quantifiers through actualizing the extension points NEWCONNECTIVE and NEWQUANTIFIER.
Note that although the presentation syntax of a RIF logic dialect is normative, since semantics is defined in terms of that syntax, the presentation syntax is not intended as a concrete syntax, and conformant systems are not required to implement it.
Definition (Alphabet). The alphabet of the presentation syntax of RIF-FLD consists of the following disjoint subsets of symbols:
Constants are written as "literal"^^symspace, where literal is a sequence of Unicode characters and symspace is an identifier for a symbol space. This syntax is explained in Section Symbol Spaces.
Variables are written as Unicode strings preceded by the symbol ? (e.g., ?x, ?ABC). This makes the sets Var and Const disjoint.
Argument names in ArgNames are written as Unicode strings that do not start with a ? (e.g., Name, age). They are used in predicates and functions that have named arguments.
NEWCONNECTIVE is not an actual symbol in the alphabet, but rather a RIF-FLD extension point, which must be actualized. Dialects are expected to specialize the set of connectives by
In the actual presentation syntax, we will be linearizing the predefined quantifier symbols and write them as Exists ?X_{1},...,?X_{n} and Forall ?X_{1},...,?X_{n} instead of Exists_{?X1,...,?Xn} and Forall_{?X1,...,?Xn}.
Every quantifier symbol has an associated list of variables that are bound by that quantifier. For the standard quantifiers Exists_{?X1,...,?Xn} and Forall_{?X1,...,?Xn}, the associated list of variables is ?X_{1},...,?X_{n}.
RIF-FLD reserves the following symbols for standard aggregate functions: Min, Max, Count, Avg, Sum, Prod, Set, and Bag. Aggregate functions also have an extension point, NEWAGGRFUNC, which must be actualized. Dialects can specialize the aforesaid set of aggregate functions by
As with other extension points, this is not an actual symbol in the alphabet, but a placeholder that dialects are supposed to replace with zero or more actual new alphabet symbols.
The symbol Naf represents default negation, which is used in rule languages with logic programming and deductive database semantics. Examples of default negation include Clark's negation-as-failure [Clark87], the well-founded negation [GRS91], and stable-model negation [GL88]. The name of the symbol Naf used here comes from negation-as-failure but in RIF-FLD this can refer to any kind of default negation.
The symbol Neg represents symmetric negation (as opposed to default negation, which is asymmetric because completely different inference rules are used to derive p and Naf p). Examples of symmetric negation include classical first-order negation, explicit negation, and strong negation [APP96].
The symbols =, #, and ## are used in formulas that define equality, class membership, and subclass relationships, respectively. The symbol -> is used in terms that have named arguments and in frame terms. The symbol External indicates that an atomic formula or a function term is defined externally (e.g., a built-in), Dialect is a directive used to indicate the dialect of a RIF document (for those dialects that require this), the symbols Base and Prefix enable abridged representations of IRIs, and the symbol Import is an import directive. The Module directive is used to connect remote terms with the actual remote RIF documents.
Finally, the symbol Document is used for specifying RIF-FLD documents and the symbol Group is used to organize RIF-FLD formulas into collections. ☐
Throughout this document, we will be using the following abbreviations:
These and other abbreviations will be used as prefixes in the compact URI-like notation [CURIE], a notation for succinct representation of IRIs [RFC-3987]. The precise meaning of this notation in RIF is defined in [RIF-DTB].
The set of all constant symbols in a RIF dialect is partitioned into a number of subsets, called symbol spaces, which are used to represent XML Schema datatypes, datatypes defined in other W3C specifications, such as rdf:XMLLiteral, and to distinguish other sets of constants. All constant symbols have a syntax (and sometimes also semantics) imposed by the symbol space to which they belong.
Definition (Symbol space). A symbol space is a named subset of the set of all constants, Const. The semantic aspects of symbol spaces will be described in Section Semantic Framework. Each symbol in Const belongs to exactly one symbol space.
Each symbol space has an associated lexical space and a unique identifier. More precisely,
The identifiers for symbol spaces are not themselves constant symbols in RIF. ☐
To simplify the language, we will often use symbol space identifiers to refer to the actual symbol spaces (for instance, we may use "symbol space xs:string" instead of "symbol space identified by xs:string").
To refer to a constant in a particular RIF symbol space, we use the following presentation syntax:
"literal"^^symspace
where literal is called the lexical part of the symbol, and symspace is the identifier of the symbol space. Here literal is a sequence of Unicode characters that must be an element in the lexical space of the symbol space symspace. For instance, "1.2"^^xs:decimal and "1"^^xs:decimal are syntactically valid constants because 1.2 and 1 are members of the lexical space of the XML Schema datatype xs:decimal. On the other hand, "a+2"^^xs:decimal is not a syntactically valid symbol, since a+2 is not part of the lexical space of xs:decimal.
The set of all symbol spaces that partition Const is considered to be part of the logic language of RIF-FLD.
RIF requires that all dialects include the symbol spaces listed and described in Section Constants and Symbol Spaces of [RIF-DTB] as part of their language. These symbol spaces include constants that belong to several important XML Schema datatypes, certain RDF datatypes, and constant symbols specific to RIF. The latter include the symbol spaces rif:iri and rif:local, which are used to represent internationalized resource identifiers (IRIs [RFC-3987]) and constant symbols that are not visible outside of the RIF document in which they occur, respectively. Documents that are exchanged through RIF can use additional symbol spaces (for instance, a symbol space to represent Skolem constants and functions).
We will often refer to constant symbols that come from a particular symbol space, X, as X constants. For instance, the constants in the symbol space rif:iri will be referred to as IRI constants or rif:iri constants and the constants found in the symbol space rif:local as local constants or rif:local constants.
The most basic construct of a logic language is a term. RIF-FLD supports many kinds of terms: constants, variables, the regular positional terms, plus terms with named arguments, equality, classification terms, frames, and more. The word "term" will be used to refer to any kind of term.
Definition (Term). A term can have one of the following forms:
Positional terms in RIF-FLD generalize the regular notion of a term used in first-order logic. For instance, the above definition allows variables everywhere, as in ?X(?Y ?Z(?V "12"^^xs:integer)), where ?X, ?Y, ?Z, and ?V are variables. Even ?X("abc"^^xs:string ?W)(?Y ?Z(?V "33"^^xs:integer)) is a positional term (as in HiLog [CKW93]).
The term t here represents a predicate or a function; s_{1}, ..., s_{n} represent argument names; and v_{1}, ..., v_{n} represent argument values. Terms with named arguments are like regular positional terms except that the arguments are named and their order is immaterial. Note that a term with no arguments, like f(), is, trivially, both a positional term and a term with named arguments.
For instance, "person"^^xs:string("http://example.com/name"^^rif:iri->?Y "http://example.com/address"^^rif:iri->?Z), ?X("123"^^xs:integer ?W)(arg->?Y arg2->?Z(?V)), and "Closure"^^rif:local("http://example.com/relation"^^rif:iri->"http://example.com/Flight"^^rif:iri)("from"^^rif:local->?X "to"^^rif:local->?Y) are terms with named arguments. The second of these named-argument terms uses a positional term, ?X("123"^^xs:integer ?W), in the role of the function, and the third term's function is itself represented by a named-argument term.
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) is called the empty list.
Classification terms are used to describe class hierarchies.
Frame terms are used to describe properties of objects. As in the case of the terms with named arguments, the order of the properties p_{i}->v_{i} in a frame is immaterial.
Such 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. The loc part in an external term is intended to play the role of a locator of the source that defines the external term t. It must uniquely identify the external source. The exact form of the locator loc, the protocol that associates locators with external sources, and the type of the imported documents is left to dialects to specify. However, all dialects must support the form <IRI>, where IRI is a sequence of Unicode characters that forms an IRI.
This syntax enables very flexible representations for externally defined information sources: not only predicates and functions, but also frames, classification, and equality terms can be used. In this way, external sources can be modeled in an object-oriented way. For instance, External("http://example.com/acme"^^rif:iri["http://example.com/mycompany/president"^^rif:iri(?Year) -> ?Pres] <http://example.com/acme>) could be a representation for an external method "http://example.com/mycompany/president"^^rif:iri in an external object identified by the IRI http://example.com/acme.
Since, in most cases, external terms are expected to be based on predicates, RIF-FLD also permits a shorthand notation: If t is a positional or a named-argument term of the form p(...), then External(t) is considered to be a shorthand for External(t <p*>), where p* is the IRI corresponding to p (for instance, if p is "http://example.com/foobar"^^rif:iri then p* is http://example.com/foobar).
Formula terms correspond to compound formulas in logic, i.e., formulas that are constructed from atomic formulas by combining them with connectives and quantifiers. For better visual appeal, some connectives (e.g., rule implication, :-, and default negation, Naf) may be written in infix or prefix form (e.g., a :- b and Naf a), but the above function application form is considered to be canonical.
Let φ be a formula term of the form S(t_{1} ... t_{n}), where S is a quantifier, and let ?X_{1},...,?X_{n} be a list of variables bound by S. We say that all occurrences of these variables are bound in the formula term φ. In general, if τ is a term and ψ a formula term that occurs in τ then all occurrences of the variables that are bound in φ are also said to be bound in τ. The occurrences of variables in a term that are not bound are said to be free. A term that has no free occurrences of variables is closed.
In addition, it is required that the variables ?V, ?X_{1}, ..., ?X_{n} have free occurrences in τ, and all occurrences of other variables in τ are bound.
The comprehension variable ?V and the grouping variables ?X_{1}, ..., ?X_{n} of the symbol sym_{ ?V[?X1 ... ?Xn]} are also said to be the comprehension and grouping variables of the above aggregate term. The comprehension variable ?V is considered bound by the aggregation term, but the grouping variables ?X_{1}, ..., ?X_{n} remain free.
As a practical convenience, dialects may allow more general terms in place of the comprehension variable, similarly to Prolog's findall/3 built-in. In this case, sym{Term [?X_{1} ... ?X_{n}] | τ} is treated as a shorthand for sym{?V [?X_{1} ... ?X_{n}] | And(τ ?V=Term)}.
Remote terms are used to query remote RIF documents, called remote modules. Here φ is the actual query and r is a reference used to identify the remote module. Remote terms should be contrasted with external terms, which are used to query external sources that are not RIF documents. Since remote terms refer to remote RIF documents, their semantics is defined by RIF-FLD. In contrast, external terms are used to query external opaque sources, which are not RIF documents. So, their semantics is opaque in RIF.
The above definitions are very general. They make no distinction between constant symbols that represent individuals, predicates, and function symbols. The same symbol can occur in multiple contexts at the same time. For instance, if p, a, and b are symbols then p(p(a) p(a p c)) is a term. Even variables and general terms are allowed to occur in the position of predicates and function symbols, so p(a)(?v(a c) p) is also a term.
Furthermore, the extensible set of quantifiers and connectives allows dialects to introduce additional features, which could include modal operators, bounded quantification, rule labels, and so on. For instance, to add labels to formulas, as required by some rule languages, a dialect could introduce a new connective, Label, and formulas of the form Label(t φ), where t could be a positional term and φ a formula term. (Note that RIF-FLD also supports a very general form of annotations, which can be used to assign identifiers to rules. However, annotations do not affect the semantics of RIF dialects, so they cannot be used to label rules in dialects where rule labels do affect the semantics. It is in those cases that RIF dialect designers might choose to introduce a special connective, like Label above.)
Frame, classification, and other terms can be freely nested, as exemplified by p(?X q#r[p(1,2)->s](d->e f->g)). Some language environments, like FLORA-2 [FL2], OO jDREW [OOjD], NxBRE [NxBRE], and CycL [CycL] support fairly large (partially overlapping) subsets of RIF-FLD terms, but most languages support much smaller subsets. RIF dialects are expected to carve out the appropriate subsets of RIF-FLD terms, and the general form of the RIF logic framework allows a considerable degree of freedom.
Observe that the argument names of frame terms, p_{1}, ..., p_{n}, are terms and, 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 this restriction has to do with the complexity of unification, which is integral part of many inference rules underlying first-order logic. We are not aware of any rule language where terms with named arguments use anything more general than what is defined here.
Dialects can restrict the contexts in which the various terms are allowed by using the mechanism of signatures. The RIF-FLD language associates a signature with each symbol (both constant and variable symbols) and uses signatures to define well-formed terms. Each RIF dialect is expected to select appropriate signatures for the symbols in its alphabet, and only the terms that are well-formed according to the selected signatures are allowed in that particular dialect.
Example 1 (Terms)
This section introduces the notion of external schemas, which serve as templates for externally defined terms. These schemas determine which externally defined terms are acceptable in a RIF dialect. Externally defined terms include RIF built-ins, which are specified in [RIF-DTB], but are more general. They are designed to accommodate the ideas of procedural attachments and querying of external data sources. Because of the need to accommodate many different possibilities, the RIF logical framework supports a very general notion of an externally defined term. Such a term is not necessarily a function or a predicate -- it can be a frame, a classification term, and so on.
Definition (Schema for external term). An external schema has the form (?X_{1} ... ?X_{n}; τ; loc) where
The names of the variables in an external schema are immaterial, but their order is important. For instance, (?X ?Y; ?X["foo"^^xs:string->?Y]; loc) and (?V ?W; ?V["foo"^^xs:string->?W]; loc) are considered to be indistinguishable, but (?X ?Y; ?X["foo"^^xs:string->?Y]; loc) and (?Y ?X; ?X["foo"^^xs:string->?Y]; loc) are viewed as different schemas.
An external term External(t loc1) is an instantiation of an external schema (?X_{1} ... ?X_{n}; τ; loc) iff loc1=loc and t can be obtained from τ by a simultaneous substitution ?X_{1}/s_{1} ... ?X_{n}/s_{n} of the variables ?X_{1} ... ?X_{n} with terms s_{1} ... s_{n}, respectively. Some of the terms s_{i} can be variables themselves. For example, External(?Z["foo"^^xs:string->f("a"^^rif:local ?P)] loc) is an instantiation of (?X ?Y; ?X["foo"^^xs:string->?Y]; loc) by the substitution ?X/?Z ?Y/f("a"^^rif:local ?P). ☐
Observe that a variable cannot be an instantiation of an external schema, since τ in the above definition cannot be a variable. It will be seen later that this implies that a term of the form External(?X loc) is not well-formed in RIF.
The intuition behind the notion of an external schema, such as (?X ?Y; ?X["foo"^^xs:string->?Y] <http://example.com/acme>) and (?V; pred:isTime(?V) <pred:isTime>), is that ?X["foo"^^xs:string->?Y] or pred:isTime(?V) are invocation patterns for querying external sources, and instantiations of those schemas correspond to concrete invocations. Thus, External("http://foo.bar.com"^^rif:iri["foo"^^xs:string->"123"^^xs:integer]" <http://example.com/acme>) and External(pred:isTime("22:33:44"^^xs:time)" <pred:isTime>) are examples of invocations of external terms -- one querying the external source identified by the IRI http://example.com/acme and the other invoking the built-in identified by the IRI pred:isTime.
Recall that one-argument externals, such as External(t) are shortcuts for two-argument externals. So, we define a one-argument external term to be an instantiation of an external schema iff its corresponding two-argument form is an instantiation of that schema.
Definition (Coherent set of external schemas). A set Ε of external schemas is coherent if there is no term, t, that is an instantiation of two distinct schemas in Ε. ☐
The intuition behind this notion is to ensure that any use of an external term is associated with at most one external schema. This assumption is relied upon in the definition of the semantics of externally defined terms. Note that the coherence condition is easy to verify syntactically and that it implies that schemas like (?X ?Y; ?X["foo"^^xs:string->?Y]; loc) and (?Y ?X; ?X["foo"^^xs:string->?Y]; loc), which differ only in the order of their variables, cannot be in the same coherent set.
It is important to keep in mind that external schemas are not part of the language in RIF, since they do not appear anywhere in RIF expressions. Instead, like signatures, which are defined below, they are best thought of as part of the grammar of the language. In particular, they will be used to determine which external terms, i.e., the terms of the form External(t loc) are well-formed.
In this section we introduce the concept of a signature, which is a key mechanism that allows RIF-FLD to control the context in which the various symbols are allowed to occur. For instance, a symbol f with signature {(term term) => term, (term) => term} can occur in terms like f(a b), f(f(a b) a), f(f(a)), etc., if a and b have signature term. But f is not allowed to appear in the context f(a b a) because there is no =>-expression in the signature of f to support such a context.
The above example provides intuition behind the use of signatures in RIF-FLD. Much of the development, below, is inspired by [CK95]. It should be kept in mind that signatures are not part of the logic language in RIF, since they do not appear anywhere in RIF-FLD formulas. Instead they are part of the grammar: they are used to determine which sequences of tokens are in the language and which are not. The actual way by which signatures are assigned to the symbols of the language may vary from dialect to dialect. In some dialects (for example [RIF-BLD]), this assignment is derived from the context in which each symbol occurs and no separate language for signatures is used. Other dialects may choose to assign signatures explicitly. In that case, they would require a concrete language for signatures (which would be separate from the language for specifying the logic formulas of the dialect).
Definition (Signature name). Let SigNames be a non-empty, partially-ordered finite or countably infinite set of symbols, called signature names. Since signatures are not part of the logic language, their names do not have to be disjoint from Const, Var, and ArgNames. We require that this set includes at least the following reserved signature names:
Dialects may introduce additional signature names. For instance, RIF Basic Logic Dialect [RIF-BLD] introduces the signature name individual. The partial order on SigNames is dialect-specific; it is used in the definition of well-formed terms below.
We use the symbol < to represent the partial order on SigNames. Informally, α < β means that terms with signature α can be used wherever terms with signature β are allowed. We will write α ≤ β if either α = β or α < β.
Definition (Signature). A signature has the form η{e_{1}, ..., e_{n}, ...} where η ∈ SigNames is the name of the signature and {e_{1}, ..., e_{n}, ...} is a countable set of arrow expressions. Such a set can thus be infinite, finite, or even empty. In RIF-BLD, signatures can have at most one arrow expression. Other dialects (such as one for HiLog [CKW93] and Relfun [RF99], for example) may require polymorphic symbols and thus allow signatures with more than one arrow expression in them.
An arrow expression is defined as follows:
For instance, () ⇒ individual and (individual) ⇒ individual are positional arrow expressions, if individual is a signature name.
For instance, (arg1->individual arg2->individual) => individual is an arrow signature expression with named arguments. The order of the arguments in arrow expressions with named arguments is immaterial, so any permutation of arguments yields the same expression. ☐
RIF dialects are always associated with sets of coherent signatures, defined next. The overall idea is that a coherent set of signatures must include all the predefined signatures (such as signatures for equality and classification terms) and the signatures included in a coherent set must not conflict with each other. For instance, two different signatures should not have identical names and if one signature is said to extend another then the arrow expressions of the supersignature should be included among the arrow expressions of the subsignature (a kind of an arrow expression "inheritance").
Definition (Coherent signature set). A set Σ of signatures is coherent iff
All arrow expressions e_{i} here have the form (κ κ) ⇒ γ (the arguments in an equation must be compatible) and at least one of these expressions must have the form (κ κ) ⇒ atomic (i.e., equation terms are also atomic formulas). Dialects may further specialize this signature.
Here all arrow expressions e_{i} are binary (have two arguments) and at least one has the form (κ γ) ⇒ atomic. Dialects may further specialize this signature.
Here all arrow expressions e_{i} have the form (κ κ) ⇒ γ (the arguments must be compatible) and at least one of these arrow expressions has the form (κ κ) ⇒ atomic. Dialects may further specialize this signature.
Here each arrow expression e_{i} has the form (formula) ⇒ κ_{i}, for some signatures κ_{1}, κ_{2}, ....
Here ηA denotes a signature with the name η and the associated set of arrow expressions A; similarly κB is a signature named κ with the set of expressions B. The requirement that B⊆A ensures that symbols that have signature η can be used wherever the symbols with signature κ are allowed. ☐
The requirement that coherent sets of signatures must include the signatures for =, #, ->, and so on is just a technicality that simplifies definitions. Some of these signatures may go "unused" in a dialect even though, technically speaking, they must be present in the signature set associated with that dialect. If a dialect disallows equality, classification terms, or frames in its syntax then the corresponding signatures will remain unused. Such restrictions can be imposed by specializing RIF-FLD -- see Section Syntax of a RIF Dialect as a Specialization of RIF-FLD.
An incoherent set of signatures would be exemplified by one that includes signatures mysig{() ⇒ atomic} and mysig{(atomic) ⇒ atomic} because it has two different signatures with the same name. Likewise, if a set contains mysig_{1}{() ⇒ atomic} and mysig_{2}{(atomic) ⇒ atomic} and mysig_{1} < mysig_{1} then it is incoherent because the set of arrow expressions of mysig_{1} does not contain the set of arrow expressions of mysig_{2}.
The presentation syntax of a RIF dialect is a set of well-formed formulas, as defined in the next section. The language of the dialect is determined by the following parameters (see Syntax of a RIF Dialect as a Specialization of RIF-FLD):
Each variable symbol is associated with exactly one signature from a coherent set of signatures. A constant symbol can have one or more signatures, and different symbols can be associated with the same signature. (Variables are not allowed to have multiple signatures because then well-formed terms would not be closed under substitutions. For instance, a term like f(?X,?X) could be well-formed, but f(a,a) could be ill-formed.)
We have already seen how the alphabet and the symbol spaces are used to define RIF terms. The next section shows how signatures and external schemas are used to further specialize this notion to define well-formed RIF-FLD terms.
Note that the signatures for RIF-FLD connectives are fixed. Therefore, when defining a dialect, there is no need to repeat the definitions of 1-connective, 2-connective, etc. However, since the same symbol can be given several signatures, the syntactic context of connectives can be expanded by assigning more signatures to them. For instance, if a dialect allows rules to be reified and treated as objects, one could add another signature to :- with the arrow expression (formula formula) ⇒ individual, assuming that individual is a suitably chosen signature (e.g., one that is assigned to variables or a subsignature of the variable's signature).
In contrast, the signatures for equality, frames, etc., are not completely fixed and have to be explicitly specialized by the dialects. For instance, in the arrow expression (κ κ) ⇒ atomic for the equality symbol, one has to tell what κ exactly is. Since this kind of signatures must be explicitly defined by the dialects anyway, the dialect designer is allowed to add additional arrow expressions to them. If, for instance, a dialect designer would like to allow reification of the equality statements, the signature for = could be defined as ={(individual individual) ⇒ atomic, (individual individual) ⇒ individual}.
Since signature names uniquely identify signatures in coherent signature sets, we will often refer to signatures simply by their names. For instance, if one of f's signatures is atomic{ }, we may simply say that symbol f has signature atomic.
Definition (Well-formed term).
As a special case, when n=0 we obtain that t() is a well-formed term with signature σ, if t's signature contains the arrow expression () ⇒ σ.
As a special case, when n=0 we obtain that t() is a well-formed term with signature σ, if t's signature contains the arrow expression () ⇒ σ.
Note that, according to the definition of coherent sets of schemas, a term can be an instantiation of at most one external schema. ☐
In the special case of our reserved connectives and quantifiers, t_{1}, ..., t_{n} must have signatures that are below formula (i.e., ≤ formula). Also, if S is :- then n must be equal 2 and if S is Neg, Naf, Forall, or Exists then n=1.
This implies that τ must have the signature formula or < formula. Unless a dialect introduces additional signatures, this also means that τ must be a formula term (i.e., a compound formula) or an atomic formula (see below).
Note that, like the constant symbols, well-formed terms can have more than one signature. Also note that, according to the above definition, f() and f are distinct terms.
Definition (Well-formed formula).
A well-formed atomic formula is a well-formed term one of whose signatures is atomic or < atomic (less than atomic in the order <).
Note that equality, membership, subclass, and frame terms are atomic formulas, since atomic is one of their signatures.
A well-formed formula is
Group and document formulas are defined below. For clarity, we will also give explicit definitions of conjunctive, disjunctive, rule, and other formulas even though they were already defined as special cases of the definition of well-formed formula terms (the first of the above bullets). Recall that all terms have a canonical function application form, but some are also written in a more familiar infix or prefix forms. For instance, rule implication, a :- b, has the canonical form :-(a b) and the canonical form for negation, Naf p and Neg p, is Naf(p) and Neg(p).
As a special case, And() is allowed and is treated as a tautology, i.e., a formula that is always true.
As a special case, Or() is treated as a contradiction, i.e., a formula that is always false.
This type of formulas is also known as an error-producing constraint. The intent is that the constraint formula is satisfied if the premise ψ is false. Constraints can also be viewed as rule implications whose conclusion is false.
are well-formed formula terms. Recall that Forall_{?V1,...,?Vn} and Exists_{?V1,...,?Vn} are the reserved universal and existential quantifiers, respectively. The notation Forall ?V_{1} ... ?V_{n}(φ) is an alternative for Forall_{?V1,...,?Vn}(φ), and similarly for Exists.
Non-empty group formulas are intended to represent sets of formulas. Note that some of the φ_{i}'s can themselves be group formulas, 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 and Symbol Spaces of [RIF-DTB]. This applies to relative IRIs that appear anywhere, including as constants, symbol spaces, location, and profile.
Like the Base directive, the Prefix directives define shorthands to allow more concise representation of rif:iri constants. This mechanism is explained in [RIF-DTB], Section Constants and Symbol Spaces.
Here loc is a locator that uniquely identifies some other document, which is to be imported. The exact form of the locator loc, the protocol that associates locators with documents, and the type of the imported documents is left to dialects to specify. However, all dialects must support the form <IRI>, where IRI is a sequence of Unicode characters that forms an IRI. The second argument to Import, p, is a sequence of Unicode characters called the profile of import.
RIF-FLD gives a semantics only to the one-argument directive Import(loc). The two-argument directive Import(loc p) is reserved for RIF dialects, which can use it to import non-RIF logical entities, such as RDF data and OWL ontologies [RIF-RDF+OWL]. The profile can specify what kind of entity is being imported and under what semantics. For instance, the various RDF entailment regimes are specified in [RIF-RDF+OWL] as profiles that have the form of Unicode strings that form IRIs.
As with Import, RIF-FLD does not restrict n and loc syntactically any further. However, we shall see that it does impose semantic restrictions on n, and loc is required to uniquely identify an existing RIF document. The exact protocol that is used to associate loc with documents and the type of those documents is left to dialects.
Note that although Base, Prefix, and Import all make use of 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 Dialect and at most one Base directive. The Dialect directive, if present, must be first, followed by an optional Base directive, followed by any number of Prefix directives, followed by any number of Import directives, followed by any number of Module directives.
In the definition of a formula, the component formulas φ, φ_{i}, ψ_{i}, and Γ are said to be subformulas of the respective formulas (conjunction, disjunction, negation, implication, group, etc.) that are built using these components. ☐
Observe that the restrictions in (1) -- (8) above imply that groups and documents cannot be nested inside formula terms and documents cannot be nested inside groups.
Example 2 (Signatures, well-formed terms and formulas).
We illustrate the above definitions with the following examples. In addition to atomic, let there be another signature, term{ }, which is intended here to represent the context of the arguments to positional function or atomic formulas.
Consider the term p(p(a) p(a b c)). If p has the (polymorphic) signature mysig{(individual)⇒individual, (individual individual)⇒individual, (individual individual individual)⇒individual} and a, b, c each has the signature individual{ } then p(p(a) p(a b c)) is a well-formed term with signature individual{ }. If instead p had the signature mysig2{(individual individual)⇒individual, (individual individual individual)⇒individual} then p(p(a) p(a b c)) would not be a well-formed term since then p(a) would not be well-formed (in this case, p would have no arrow expression which allows p to take just one argument).
For a more complex example, let r have the signature mysig3{(individual)⇒atomic, (atomic individual)⇒individual, (individual individual individual)⇒individual}. Then r(r(a) r(a b c)) is well-formed. The interesting twist here is that r(a) is an atomic formula that occurs as an argument to a function symbol. However, this is allowed by the arrow expression (atomic individual)⇒ individual, which is part of r's signature. If r's signature were mysig4{(individual)⇒atomic, (atomic individual)⇒atomic, (individual individual individual)⇒individual} instead, then r(r(a) r(a b c)) would be not only a well-formed term, but also a well-formed atomic formula.
An even more interesting example arises when the right-hand side of an arrow expression is something other than individual or atomic. For instance, let John, Mary, NewYork, and Boston have signatures individual{ }; flight and parent have signature h_{2}{(individual individual)⇒atomic}; and closure has signature hh_{1}{(h_{2})⇒p_{2}}, where p_{2} is the name of the signature p_{2}{(individual individual)⇒atomic}. Then flight(NewYork Boston), closure(flight)(NewYork Boston), parent(John Mary), and closure(parent)(John Mary) would be well-formed formulas. Such formulas are allowed in languages like HiLog [CKW93], which support predicate constructors like closure in the above example. ☐
RIF-FLD allows every term and formula (including terms and formulas that occur inside other terms and formulas) to be optionally preceded by one annotation of the form (* id φ *) where id is a constant and φ is a RIF formula that is not a document-formula. 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 rest of the annotation. RIF-FLD does not impose any restrictions on φ apart from what is stated above. This means that φ may include variables, function symbols, rif:local constants, and so on.
Document formulas with and without annotations will be referred to as RIF-FLD documents.
A convention is used to avoid a syntactic ambiguity in the above definition. For instance, in (* id φ *) t[w -> v] the annotation can be attributed to the term t or to the entire frame t[w -> v]. Similarly, for an annotated HiLog-like term of the form (* id φ *) f(a)(b,c), the annotation can be attributed to the entire term f(a)(b,c) or to just f(a). The convention adopted in RIF-FLD is that any annotation is syntactically associated with the largest RIF-FLD term or formula that appears to the right of that annotation. Therefore, in our examples the annotation (* id φ *) is considered to be attached to the entire frame t[w -> v] and to the entire term f(a)(b,c). 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]. Generally, the convention associates each annotation to the largest term or formula it precedes.
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.
Example 3 (A RIF-FLD document with nested groups and annotations).
We illustrate formulas, including documents and groups, with the following complete example (with apologies to Shakespeare for the imperfect rendering of the intended meaning in logic). For better readability, we use the notation defined in [RIF-DTB], which provides shortcuts for writing IRIs. The first shortcut notation lets one write long rif:iri constants in the form prefix:name, where prefix is a short name that expands into an IRI according to a suitable Prefix directive. For instance, ex:man would expand into the rif:iri constant "http://example.org/ontology#man"^^rif:iri, if ex is defined as in the Prefix(ex ...) directive below. The second shortcut notation uses angle brackets as a way to shorten the "..."^^rif:iri idiom. For instance, the prevous rif:iri constant can be alternatively represented as <http://example.org/ontology#man>. The last shortcut notation lets one write rif:iri constants using IRIs relative to a base, where the base IRI is specified in a Base directive. For instance, with the Base directive, below, both <Yorick> and "Yorick"^^rif:iri expand into the rif:iri constant "http://www.shakespeare-literature.com/Hamlet/Yorick"^^rif:iri. The example also illustrates attachment of annotations.
Document( Base(<http://www.shakespeare-literature.com/Hamlet/>) Prefix(dc <http://http://purl.org/dc/terms/>) Prefix(ex <http://example.org/ontology#>) (* <assertions> <assertions>[dc:title->"Hamlet" dc:creator->"Shakespeare"] *) Group( Exists ?X (And(?X # ex:RottenThing ex:partof(?X <http://www.denmark.dk>))) Forall ?X (Or(<tobe>(?X) Naf <tobe>(?X))) Forall ?X (And(Exists ?B (And(ex:has(?X ?B) ?B # ex:business)) Exists ?D (And(ex:has(?X ?D) ?D # ex:desire))) :- ?X # ex:man) (* <facts> *) Group( <Yorick> # ex:poor <Hamlet> # ex:prince ) ) )
The above RIF formulas are (admittedly awkward) logical renderings of the following statements from Shakespeare's Hamlet: "Something is rotten in the state of Denmark," "To be, or not to be," and "Every man has business and desire."
Observe that the above set of formulas has a nested subset with its own annotation, <facts>, which contains only a global IRI. ☐
The following example illustrates the use of imported RIF documents and of remote terms.
Example 4 (A RIF-FLD document with imports, remote module references, and aggregation).
The first document, below, imports the second document, which is assumed to be located at the IRI http://example.org/universityontology. In addition, the first document has references to two remote modules, which are located at http://example.org/university#1 and http://example.org/university#2, respectively. These modules are assumed to be knowledge bases that provide the usual information about university enrollment, courses offered in different semesters, and so on. The rules corresponding to the remote modules are not shown, as they do not illustrate new features. In the simplest case, these knowledge bases can simply be sets of facts for the predicates/frames that supply the requisite information.
Document( Prefix(u <http://example.org/universityontology#>) Prefix(pred <http://www.w3.org/2007/rif-builtin-predicate#>) Import(<http://example.org/universityontology>) Module(_univ(1) <http://example.org/university#1>) Module(_univ(2) <http://example.org/university#2>) Group( Forall ?Stud ?Crs ?Semester ?U (u:takes(?Stud ?Crs ?Semester) :- ?Stud[u:takes(?Semester)->?Crs]@ _univ(?U)) Forall ?Prof ?Crs ?Semester ?U (u:teaches(?Prof ?Crs ?Semester) :- u:teaches(?Prof ?Crs ?Semester)@ _univ(?U)) Forall ?Crs (u:popular_course(?Crs) :- And(?Crs#u:Course pred:numeric-less-than(500 count{?Stud[?Crs]|Exists ?Semester (u:takes(?Stud ?Crs ?Semester))}))) ) )
The imported document, located at http://example.org/universityontology, has the following form:
Document( Group( Forall ?Stud ?Prof ?Sem (u:studentOf(?Stud ?Prof) :- And(u:takes(?Stud ?Crs ?Sem) u:teaches(?Prof ?Crs ?Sem))) ) )
In this example, the main document contains three rules, which define the predicates u:takes, u:teaches and u:popular_course. The information for the first two predicates is obtained by querying the remote modules corresponding to Universities 1 and 2. The rule that defines the first predicate says that if the remote university knowledge base says that a student s takes a course c in a certain semester s then takes(s c s) is true in the main document. The second rule makes a similar statement about professors teaching courses in various semesters. Inside the main document, the external modules are referred to via the terms _univ(1) and _univ(2). The Module directives tie these references to the actual locations. The underscore in front of univ signifies that this is a rif:local symbol and is a shortcut for "univ"^^rif:local, as defined in [RIF-DTB], Section Constants and Symbol Spaces. Note that the remote modules use frames to represent the enrollment information and predicates to represent course offerings. The rules in the main document convert both of these representations to predicates. The third rule illustrates a use of aggregation. The comprehension variable here is ?Stud and ?Crs is a grouping variable. Note that these are the only free variables in the formula over which aggregation is computed. For each course, the aggregate counts the number of students in that course over all semesters, and if the number exceeds 500 then the course is declared popular. Note also that the comprehension variable ?Stud is bound by the aggregate, so it is not quantified in the Forall-prefix of the rule.
The imported document has only one rule, which defines a new concept, u:studentOf (a student is a studentOf of a certain professor if that student takes a course from that professor). Since the main document imports the second document, it can answer queries about u:studentOf as if this concept were defined directly within the main document. ☐
Until now, to specify the syntax of RIF-FLD we relied on "mathematical English," a special form of English for communicating mathematical definitions, examples, etc. We will now specify the syntax using the familiar EBNF notation. The following points about the EBNF notation should be kept in mind:
Keeping the above in mind, the EBNF grammar can be seen as just an intermediary between the mathematical English and the XML. However, it also gives a succinct view of the syntax of RIF-FLD and as such can be useful for dialect designers and users alike.
Document ::= IRIMETA? 'Document' '(' Dialect? Base? Prefix* Import* Module* Group? ')' Dialect ::= 'Dialect' '(' Name ')' Base ::= 'Base' '(' ANGLEBRACKIRI ')' Prefix ::= 'Prefix' '(' NCName ANGLEBRACKIRI ')' Import ::= IRIMETA? 'Import' '(' LOCATOR PROFILE? ')' Module ::= IRIMETA? 'Module' '(' (Const | Expr) LOCATOR ')' Group ::= IRIMETA? 'Group' '(' (FORMULA | Group)* ')' Implies ::= IRIMETA? FORMULA ':-' FORMULA FORMULA ::= Implies | IRIMETA? CONNECTIVE '(' FORMULA* ')' | IRIMETA? QUANTIFIER '(' FORMULA ')' | IRIMETA? 'Neg' FORMULA | IRIMETA? 'Naf' FORMULA | IRIMETA? FORMULA '@' MODULEREF | FORM PROFILE ::= ANGLEBRACKIRI FORM ::= IRIMETA? (Var | ATOMIC | 'External' '(' ATOMIC LOCATOR? ')') ATOMIC ::= Const | Atom | Equal | Member | Subclass | Frame Atom ::= UNITERM UNITERM ::= TERMULA '(' (TERMULA* | (Name '->' TERMULA)*) ')' Equal ::= TERMULA '=' TERMULA Member ::= TERMULA '#' TERMULA Subclass ::= TERMULA '##' TERMULA Frame ::= TERMULA '[' (TERMULA '->' TERMULA)* ']' TERMULA ::= Implies | IRIMETA? CONNECTIVE '(' TERMULA* ')' | IRIMETA? QUANTIFIER '(' TERMULA ')' | IRIMETA? 'Neg' TERMULA | IRIMETA? 'Naf' TERMULA | IRIMETA? TERMULA '@' MODULEREF | TERM TERM ::= IRIMETA? (Var | EXPRIC | List | 'External' '(' EXPRIC LOCATOR? ')' | AGGREGATE | NEWTERM) EXPRIC ::= Const | Expr | Equal | Member | Subclass | Frame Expr ::= UNITERM List ::= 'List' '(' TERM* ')' | 'List' '(' TERM+ '|' TERM ')' AGGREGATE ::= AGGRFUNC '{' Var ('[' Var+ ']')? '|' FORMULA '}' Const ::= '"' UNICODESTRING '"^^' SYMSPACE | CONSTSHORT MODULEREF ::= Var | Const | Expr CONNECTIVE ::= 'And' | 'Or' | NEWCONNECTIVE QUANTIFIER ::= ('Exists' | 'Forall' | NEWQUANTIFIER) Var* AGGRFUNC ::= 'Min' | 'Max' | 'Sum' | 'Prod' | 'Avg' | 'Count' | 'Set' | 'Bag' | NEWAGGRFUNC Var ::= '?' Name Name ::= NCName | '"' UNICODESTRING '"' SYMSPACE ::= ANGLEBRACKIRI | CURIE IRIMETA ::= '(*' Const? (Frame | 'And' '(' Frame* ')')? '*)'
The RIF-FLD presentation syntax does not commit to any particular vocabulary and permits arbitrary sequences of Unicode characters in constant symbols, argument names, and variables. Such sequences are denoted with UNICODESTRING in the above syntax. Constant symbols have this form: "UNICODESTRING"^^SYMSPACE, where SYMSPACE is a ANGLEBRACKIRI or CURIE that represents the identifier of the symbol space of the constant. UNICODESTRING, 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 used in the examples in this document. Names are Unicode character sequences that form valid XML NCNames [XML-Names]. Variables are composed of Names prefixed with a ?-sign.
LOCATOR, which is used in several places in the grammar, is a non-terminal whose definition is left to the dialects. It is intended to specify the protocol by which external sources, remote modules, and imported RIF documents are located. This must include the basic form <IRI>, where IRI is a Unicode string in the form of an absolute IRI.
The symbols NEWCONNECTIVE, NEWQUANTIFIER, NEWAGGRFUNC, and NEWTERM are RIF-FLD extension points. They are not actual symbols in the alphabet. Instead, dialects are supposed to replace NEWCONNECTIVE, NEWQUANTIFIER, and NEWAGGRFUNC, by zero or more actual new symbols, while NEWTERM is to be replaced by zero or more new kinds of terms. Note that the extension point NEWSYMBOL is not shown in the EBNF grammar, since the grammar completely avoids mentioning the alphabet of the language (which is infinite).
Each RIF-FLD formula and term can be prefixed with one optional annotation, IRIMETA, for identification and metadata. IRIMETA is represented using (*...*)-brackets that contain an optional rif:iri constant as identifier followed by an optional Frame or conjunction of Frames as metadata. 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].
Note that the RIF-FLD presentation syntax (as reflected in the above EBNF grammar) strives to have a more familiar look by avoiding some of the formal parts of the syntax defined in Sections Alphabet and Terms. For instance, as mentioned in those sections, the quantifier symbols Exists_{?X1,...,?Xn} and Forall_{?X1,...,?Xn} are linearized as Exists ?X_{1},...,?X_{n} and Forall ?X_{1},...,?X_{n}. Likewise, the symbol OpenList is not used. Instead, open lists are written using the more familiar form LIST(Head|Tail). Also, some connectives, such as :-, are written in infix form. Other connectives, such as Neg and Naf, are written in prefix form without parentheses.
Recall that the presentation syntax of RIF-FLD allows the use of 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 and Symbol Spaces.
The RIF-FLD semantic framework defines the notions of semantic structures and of models for RIF-FLD formulas. The semantics of a dialect is derived from these notions by specializing the following parameters.
For instance, if a dialect's syntax excludes frames or terms with named arguments then the parts of the semantic structures whose purpose is to interpret those types of terms (I_{frame} and I_{NF} in this case) become redundant.
The RIF-FLD semantic framework allows formulas to have truth values from an arbitrary partially ordered set of truth values, TV. A concrete dialect must select a concrete partially or totally ordered set of truth values.
A datatype is a symbol space whose symbols have a fixed interpretation in any semantic structure. RIF-FLD defines a set of core datatypes that each dialect is required to include as part of its syntax and semantics. However, RIF-FLD does not limit dialects to just the core types: they can introduce additional datatypes, and each dialect must define the exact set of datatypes that it includes.
Specialization of the definitions of RIF-BLD directives and logical connectives. Semantics of the syntactic components corresponding to the RIF-FLD extension points.
Logical entailment in RIF-FLD is defined with respect to an unspecified set of intended semantic structures (sometimes also known as preferred semantic structures). This notion of entailment is very general and is known to subsume most of the known logical semantics for rule-based systems.
A RIF dialect must define which semantic structures should considered intended. The actual choice depends on the desired semantics and is typically done by a trained logician. Many "off-the-shelf" semantics -- each suitable for different purposes -- have been defined in the literature. For instance, one dialect might specify that all semantic structures are intended (which leads to classical first-order entailment), another may consider only the minimal models as intended structures, while a third dialect might only use stable or well-founded models [GRS91, GL88].
These notions are defined in the remainder of this specification.
Definition (Set of truth values). Each RIF dialect must define the set of truth values, denoted by TV. This set must have a partial order, called the truth order, denoted <_{t}. In some dialects, <_{t} can be a total order. We write a ≤_{t} b if either a <_{t} b or a and b are the same element of TV. In addition,
The last condition follows from the earlier ones and is listed for didactic purposes only. ☐
RIF dialects can have additional truth values. For instance, the semantics of some versions of NAF, such as well-founded negation, requires three truth values: t, f, and u (undefined), where f <_{t} u <_{t} t. Handling of contradictions and uncertainty usually requires at least four truth values: t, u, f, and i (inconsistent). In this case, the truth order is partial: f <_{t} u <_{t} t and f <_{t} i <_{t} t. The negation operator ~ is then defined to be the identity on the new truth values u and i.
Definition (Datatype). A datatype is a symbol space that has
Semantic structures are always defined with respect to a particular set of datatypes, denoted by DTS. In a concrete dialect, DTS always includes the datatypes supported by that dialect. All RIF dialects must support the datatypes that are listed in Section Datatypes of [RIF-DTB]. Their value spaces and the lexical-to-value-space mappings for these datatypes are described in the same section.
Although the lexical and the value spaces might sometimes look similar, one should not confuse them. Lexical spaces define the syntax of the constant symbols in the RIF language. Value spaces define the meaning of the constants. The lexical and the value spaces are often not even isomorphic. For example, 1.2^^xs:decimal and 1.20^^xs:decimal are two legal -- and distinct -- constants in RIF because 1.2 and 1.20 belong to the lexical space of xs:decimal. However, these two constants are interpreted by the same element of the value space of the xs:decimal type. Therefore, 1.2^^xs:decimal = 1.20^^xs:decimal is a RIF tautology. Likewise, RIF semantics for datatypes implies certain inequalities. For instance, abc^^xs:string ≠ abcd^^xs:string is a tautology, since the lexical-to-value-space mapping of the xs:string type maps these two constants into distinct elements in the value space of xs:string.
The central step in specifying a model-theoretic semantics for a logic-based language is defining the notion of a semantic structure. Semantic structures are used to assign truth values to RIF-FLD formulas.
Definition (Semantic structure). A semantic structure, I, is a tuple of the form <TV, DTS, D, I_{C}, I_{V}, I_{F}, I_{NF}, I_{list}, I_{tail}, I_{frame}, I_{sub}, I_{isa}, I_{=}, I_{external}, I_{connective}, I_{truth}>. Here D is a non-empty set of elements called the domain of I. We will continue to use Const to refer to the set of all constant symbols and Var to refer to the set of all variable symbols. TV denotes the set of truth values that the semantic structure uses and DTS is a set of identifiers for datatypes.
The other components of I are total mappings defined as follows:
This mapping interprets constant symbols.
This mapping interprets variable symbols.
This mapping interprets positional terms.
This is analogous to the interpretation of positional terms with two differences:
To see why such repetition can occur, note that argument names may repeat: p(a->b a->c). This can be understood as treating a as a bag-valued argument. Identical argument/value pairs can then arise as a result of a substitution. For instance, p(a->?A a->?B) becomes p(a->b a->b) if the variables ?A and ?B are both instantiated with the symbol b.
In addition, these mappings are required to satisfy the following conditions:
Note that the last condition above restricts I_{tail} only when its last argument is in D_{list}. If the last argument of I_{tail} is not in D_{list}, then the list is a general open one and there are no restrictions on the value of I_{tail} except that it must be in D.
This mapping interprets frame terms. An argument, d ∈ D, to I_{frame} represents an object and a finite bag {<a1,v1>, ..., <ak,vk>} represents a bag (multiset) of attribute-value pairs for d. We will see shortly how I_{frame} is used to determine the truth valuation of frame terms.
Bags are employed here because the order of the attribute/value pairs in a frame is immaterial and the pairs may repeat. For instance, o[a->b a->b]. 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 and ?B, ?D with b. (We shall see later that o[a->b a->b] is equivalent to o[a->b].)
The operator ## is required to be transitive, i.e., c1 ## c2 and c2 ## c3 must imply c1 ## c3. This is ensured by a restriction in Section Interpretation of Formulas.
The relationships # and ## are required to have the usual property that all members of a subclass are also members of the superclass, i.e., o # cl and cl ## scl must imply o # scl. This is ensured by a restriction in Section Interpretation of Formulas.
It gives meaning to the equality operator.
It is used to define truth valuation for formulas.
For every external schema, σ, associated with the language, I_{external}(σ) 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, I_{external}(σ) is specified in [RIF-DTB] so that:
Further restrictions on the interaction of this function with I_{truth} will be imposed in order to ensure the intended semantics for each connective and quantifier. For aggregates, I_{connective} maps them to functions D → D and additional restrictions are imposed on the mapping I defined below.
We also define the following term-interpreting mapping on well-formed terms, which we denote using the same symbol I that is used for the semantic structure itself. This overloading is convenient and does not lead to ambiguity.
Here we use {...} to denote a bag of argument/value pairs.
Here <> denotes an empty list of elements of D. (Note that the domain of I_{list} is D^{*}, so D^{0} is an empty list of elements of D.)
Here {...} denotes a bag of attribute/value pairs. Jumping ahead, we note that duplicate elements in such a bag do not affect the meaning of a frame formula. So, for instance, o[a->b a->b] and o[a->b] always have the same truth value.
Note that, by definition, External(t loc) is well-formed only if it is an instantiation of an external schema. Furthermore, by the definition of coherent sets of external schemas, it can be an instantiation of at most one such schema, so I(External(t loc)) is well-defined.
I(S(t_{1} ... t_{n})) = I_{connective}(S)(I(t_{1}) ... I(t_{n}))
Let aggr{?X [?X_{1} ... ?X_{n}] | τ} be an aggregate and let S be the following set:
S = {(I_{V}^{*}(?X),I_{V}^{*}(?X_{1}), ..., I_{V}^{*}(?X_{n})) | for all semantic structures I^{*} such that I^{*}(τ) = t and I^{*} is exactly like I except that I_{V}^{*}(?X) can be different from I_{V}(?X)}.
In addition, let S_{set} denote the set of all elements x such that (x,x_{1}, ..., x_{n}) ∈ S and S_{bag} denote the bag of all such elements x (i.e., S_{bag} can have repeated occurrences of the same element).
where L is a sorted list of the elements in S_{set}. Since sorting requires an ordering, the above is well-defined only for semantic structures with totally ordered domains. If L is infinite then the value of the aggregate in I is indeterminate (i.e., it can be any element of the domain D).
The requirement that the list L must be sorted comes from the fact that there can be many ways to represent S_{set} as a list, while I(setof{?X [?X_{1} ... ?X_{n}] | τ}) must be defined as one concrete element of the domain D. Sorting a set is a standard way of providing the requisite unique representation.
where L is a sorted list of the elements in S_{bag}. This is well-defined only for semantic structures with totally ordered domains. If L is infinite then the value of the aggregate in I is indeterminate (i.e., it can be any element of the domain D).
The reason for sorting L is the same as in the case of the set aggregate.
Note that the definitions of I_{NF}, I_{frame}, and of I(x=y) imply that the terms with named arguments that differ only in the order of their arguments are mapped by I to the same element in the domain. Similarly, frame terms that differ only in the order of their attribute/value pairs (or in the number of repetitions of the same attribute/value pair) are mapped to the same domain element. This implies that the equalities like t(a->1 b->2 c->3) = t(c->3 a->1 b->2) and ex:o[ex:a->1 ex:b->"abc" ex:a->1] = ex:o[ex:b->"abc" ex:a->1] are tautologies in RIF-FLD.
The effect of signatures. For every signature, sg, supported by a dialect, there is a subset D_{sg} ⊆ D, called the domain of the signature. Terms that have a given signature, sg, must be mapped by I to D_{sg}, and if a term has more than one signature it must be mapped into the intersection of the corresponding signature domains. To ensure this, the following is required:
The effect of datatypes. The datatype identifiers in DTS impose the following restrictions. If dt ∈ DTS, let LS_{dt} denote the lexical space of dt, VS_{dt} denote its value space, and L_{dt}: LS_{dt} → VS_{dt} the lexical-to-value-space mapping. Then the following must hold:
That is, I_{C} must map the constants of a datatype dt in accordance with L_{dt}. ☐
RIF-FLD does not impose special requirements on I_{C} for constants in the symbol spaces that do not correspond to the identifiers of the datatypes in DTS. Dialects may have such requirements, however. An example of such a restriction could be a requirement that no constant in a particular symbol space (such as rif:local) can be mapped to VS_{dt} of a datatype dt.
RIF-FLD annotations are stripped before the mappings that constitute RIF-FLD semantic structures are applied. Likewise, they are stripped before applying the truth valuation, TVal_{I}, defined in the next section. Thus, identifiers and metadata have no effect on the formal semantics.
Note that although annotations associated with RIF-FLD formulas are ignored by the semantics, they can be extracted by XML tools. Since annotations are represented by frame terms, they can be reasoned with by the rules. The frame terms used to represent metadata can then be fed to other formulas, thus enabling reasoning about metadata. However, RIF does not define any concrete semantics for metadata.
This section defines how a semantic structure, I, determines the truth value TVal_{I}(φ) of a RIF-FLD formula, φ, where φ is any formula other than a document formula or a remote formula. Truth valuation of document formulas is defined in the next section.
To this end, we define a mapping, TVal_{I}, from the set of all non-document formulas to TV. Note that the definition implies that TVal_{I}(φ) is defined only if the set DTS of the datatypes of I includes all the datatypes mentioned in φ.
Definition (Truth valuation). Truth valuation for well-formed formulas in RIF-FLD is determined using the following function, denoted TVal_{I}:
To ensure that equality has precisely the expected properties, it is required that
To ensure that the operator ## is transitive, i.e., c1 ## c2 and c2 ## c3 imply c1 ## c3, the following is required:
Note that this is a restriction on I_{truth} and the mapping I, which is expressed in a more succinct form using TVal_{I}.
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:
Note that this is a restriction on I_{truth} and the mapping I, which is expressed in a more succinct form using TVal_{I}.
Since the bag of attribute/value pairs represents the conjunction of all the pairs, the following is required:
Observe that this is a restriction on I_{truth} and the mapping I. For brevity, it is expressed in a more succinct form using TVal_{I}.
Note that, by definition, External(t loc) is well-formed only if it is an instantiation of an external schema. Furthermore, by the definition of coherent sets of external schemas, it can be an instantiation of at most one external schema, so I(External(t loc)) is well-defined.
To ensure the intended semantics for the RIF-FLD reserved connectives and quantifiers, the following restrictions are imposed (observe that all these are restrictions on I_{truth} and the mapping I, which are expressed via TVal_{I}, for brevity):
The empty conjunction is treated as a tautology, so TVal_{I}(And()) = t.
The empty disjunction is treated as a contradiction, so TVal_{I}(Or()) = f.
The symbol ~ here is the self-inverse operator of negation on TV introduced in Section Truth Values.
The symmetric negation, Neg, is sufficiently general to capture many different kinds of such negation. For instance, classical negation would, in addition, require TVal_{I}(Neg φ) = ~TVal_{I}(φ); strong negation (analogous to the one in [APP96]) can be characterized by TVal_{I}(Neg φ) ≤_{t} ~TVal_{I}(φ); and explicit negation (analogous to [APP96]) would require no additional constraints.
Note that both classical and default negation are interpreted the same way in any concrete semantic structure. The difference between the two kinds of negation comes into play when logical entailment is defined.
Here lub_{t} (respectively, glb_{t}) is taken over all interpretations I* of the form <TV, DTS, D, I_{C}, I*_{V}, I_{F}, I_{NF}, I_{list}, I_{tail}, I_{frame}, I_{sub}, I_{isa}, I_{=}, I_{external}, I_{connective}, I_{truth}>, which are exactly like I, except that the mapping I*_{V}, is used instead of I_{V}. I*_{V} is defined to coincide with I_{V} on all variables except, possibly, on ?v_{1},... ,?v_{n}.
If Γ is a group formula of the form Group(φ_{1} ... φ_{n}) then
This means that a group of formulas is treated as a conjunction. In particular, the empty group is treated as a tautology, so TVal_{I}(Group()) = t. ☐
Note that rule implications and equality formulas are always two-valued, even if TV has more than two values.
Document formulas are interpreted using semantic multi-structures, which are sets of semantic structures. Their purpose is to provide a semantics to RIF multi-documents, i.e., RIF documents that import other RIF documents and/or contain references to other RIF documents via remote module reference formulas.
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, Δ'. In this case, 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 another document, which itself is directly imported into Δ. ☐
The above definition deals only with one-argument import directives, since two-argument directives are expected to be defined on a case-by-case basis by other specifications that might be integrated with RIF. For instance, [RIF-RDF+OWL] defines the semantics of the 2-argument import directive for importing RDF and OWL documents into RIF-BLD.
Definition (Renaming apart of local constants). A renaming mapping, ρ, is a function that maps document formulas to document formulas subject to the following restriction:
Definition (Semantic multi-structure). A semantic multi-structure, Î, is a triple (Î_{ren},Î_{map},Î_{set}) where
All these mappings are subject to the following restrictions:
Intuitively, these conditions say that if some document associates Δ with a particular module then Î_{map} must respect that. Note that different directives Module(n loc_{1}), ..., Module(n loc_{k}) (with different locators but the same module name) have the effect that multiple documents become associated with the same module and the same semantic structure. This association happens through the Module directives that occur inside the same or different documents. The semantic effect is that all these associated document formulas are true in that module. ☐
Definition (Remote module). Let Δ be a document formula and let Module(n loc) be one of its remote module directives, where loc is a locator for another document formula, Δ'. In this case, we say that Δ' is a directly linked remote module of Δ.
A document formula Δ' is said to be a linked remote module for Δ if it is either directly linked to Δ or it is linked (directly or not) to some other document that is either imported into or directly linked to Δ. ☐
In the definition of term-interpreting mappings, we postponed defining remote term references till now. The next definitions fill in this gap. The reason why we postponed this definition was that this could not be defined solely in reference to a single semantic structure I: a multi-structure context is required in addition to I. This leads us to TVal_{I/Î}(φ), the notion of truth valuation in the context of a semantic multi-structure Î.
Definition (Term-interpreting mapping for remote term references). Let φ be a non-document formula, Î a semantic multi-structure, and I ∈ Î_{set}.
First we define I_{Î}(φ), the term-interpreting function for I in the context of a multi-structure, Î. For terms that are not remote references, the definition is exactly as for term-interpreting mappings for ordinary semantic structures with the difference that I_{Î} is used everywhere instead of just I. The definition of TVal_{I/Î}(φ), the truth valuation in the context of Î, is the same as the definition of TVal for ordinary semantic structures in this case.
However, if φ is a remote reference ψ@r then I_{Î}(φ) is defined as follows:
Let I(r) = d. If Î_{set} has no semantic structure adorned with d, the value of I_{Î}(φ) is indeterminate (i.e., it can be any element of the domain of Î). Otherwise, let J ∈ Î_{set} be the structure adorned with d (it is then unique, by definition). In that case, we define:
We now define how truth of document formulas is determined in semantic multi-structures.
Definition (Truth valuation of formulas in multi-document structures). Let Δ be a document formula and let Δ_{1}, ..., Δ_{n}, ... be all the RIF-FLD document formulas that are imported into Δ or linked to it (directly or indirectly). Let furthermore Γ, Γ_{1}, ..., Γ_{n}, ... be the respective group formulas associated with these documents. Let Î = (Î_{ren},Î_{map},Î_{set}) be a semantic multi-structure where Î_{set} = {I^{m1}, I^{m2}, ...}.
We define the truth valuation for Δ as follows.
Observe that, before computing truth values, documents' rif:local constants may be renamed. ☐
It is instructive to see how remote terms are interpreted by a semantic multi-structure Î. Suppose ψ@r is such a term that occurs somewhere in a document, Δ. If J ∈ Î_{map}(Δ) is an ordinary semantic structure assigned to Δ then J(r) determines the semantic structure in which ψ is to be evaluated: it is the structure in Î_{set} adorned with J(r), say M. This is what J_{Î}(ψ@r) is all about. Note that ψ may also contain remote term references (as ψ may be a compound formula). In this case, since ψ is evaluated using M_{Î}, the same principle applies.
Definition (Models). Let I be a semantic structure or a multi-structure. We say that I is a model of a formula, φ, written as I|=φ, iff TVal_{I}(φ) = t. Here φ is a document formula, if I is a multi-structure, and a non-document formula, if I' is an ordinary semantic structure. ☐
The semantics of a set of formulas, Γ, is the set of its intended (or preferred) semantic multi-structures. Intended multi-structures are used to define the notion of logical entailment in RIF dialects. RIF-FLD does not fix what these intended multi-structures should be, leaving the choice to RIF dialects. Different logic dialects may use different criteria for what is to be considered an intended semantic multi-structure, and the freedom to set these criteria lets RIF-FLD cover a wide range of possible logical semantics. The actual choice of intended models for this or that logic dialect is a prerogative of the dialect designer and should be attempted only by a trained logician.
For instance, to model the classical first-order notion of entailment, every semantic structure would be intended. For [RIF-BLD], which is based on Horn rules, intended multi-structures are defined only for sets of rules: an intended semantic multi-structure of a RIF-BLD set of formulas, Γ, is the unique minimal Herbrand model [Lloyd87] of Γ. For dialects in which rule bodies may contain literals negated with the default negation connective Naf, only some of the minimal Herbrand models of Γ are intended. Each logic dialect of RIF must define the set of intended semantic multi-structures precisely. The two most common theories for default negation use the well-founded models [GRS91] and stable models [GL88] as their intended models.
The following example illustrates the notion of intended semantic structures. Suppose Γ consists of a single rule formula p :- Naf q. If Naf were interpreted as classical negation, then this rule would be simply equivalent to Or(p q), and so it would have two kinds of models: those where p is true and those where q is true. In contrast to first-order logic, most rule-based systems do not consider p and q symmetrically. Instead, they view the rule p :- Naf q as a statement that p must be true if it is not possible to establish the truth of q. Since it is, indeed, impossible to establish the truth of q, such theories would derive p even though it does not logically follow from Or(p q). The logic underlying rule-based systems also assumes that only the minimal Herbrand models are intended (minimality here is with respect to the set of true facts). Furthermore, although our example has two minimal Herbrand models -- one where p is true and q is false, and the other where p is false, but q is true, only the first model is considered to be intended.
The above concept of intended semantic multi-structures and the corresponding notion of logical entailment, below, is due to [Shoham87] (where these structures were called preferred).
We will now define what it means for one RIF-FLD formula to entail another. This notion is typically used for defining queries to knowledge bases and for other tasks, such as testing subsumption of concepts (e.g., in OWL). We assume that each set of formulas has an associated set of intended semantic structures (which depend on RIF dialects).
Definition (Logical entailment).
Let φ and ψ be RIF-FLD formulas. We say that φ entails ψ, written as φ |= ψ, if and only if the following holds:
This general notion of entailment covers both first-order logic and the non-monotonic logics that underlie many rule-based languages; it extends the notion of entailment defined in [Shoham87] to the case of multi-valued logics.
Note that one consequence of the multi-document semantics 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 due to the process of renaming apart that takes place prior to truth valuation.
The behavior of local symbols should be contrasted with that of rif:iri symbols. Suppose, in the above scenario, Δ' also has the fact "http://example.com/ppp"^^rif:iri("http://cde"^^rif:iri). Then Δ |= "http://example.com/qqq"^^rif:iri("http:cde"^^rif:iri) does hold.
The RIF-FLD XML serialization framework defines
As explained in the overview section, the design of RIF envisions that the presentation syntaxes of future logic RIF dialects will be specializations of the presentation syntax of RIF-FLD. This means that every well-formed formula in the presentation syntax of a standard logic RIF dialect must also be well-formed in a specialization of RIF-FLD, which includes actualizing the RIF-FLD extension points (see overview section). The goal of the XML serialization framework is to provide a similar yardstick for the RIF XML syntax. This amounts to the requirement that any admissible XML document for a logic RIF dialect must also be an admissible XML document for a specialized RIF-FLD (admissibility is defined below). In terms of the presentation-to-XML syntax mappings, this means that each mapping for a logic RIF dialect must be a restriction of the corresponding mapping for RIF-FLD. For instance, the mapping from the presentation syntax of RIF-BLD to XML in [RIF-BLD] is a restriction of the presentation-syntax-to-XML mapping for RIF-FLD. In this way, RIF-FLD provides a framework for extensibility and mutual compatibility between XML syntaxes of RIF dialects.
Recall that the syntax of RIF-FLD 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 (Specialization of RIF-FLD schema to a dialect schema). If a dialect, D, specializes RIF-FLD then its XML schema must be a specialization of the XML schema of RIF-FLD. This includes elimination of some elements and attributes, restriction of the XML types of the others, and replacement of the extension points with appropriate concrete elements of the specified (possibly restricted) types. ☐
Definition (Valid XML document in RIF-FLD). A valid RIF-FLD document in the XML syntax is an XML document that is valid with respect to the XML schema in Appendix XML Schema for RIF-FLD, where the extension points NEWCONNECTIVE, NEWQUANTIFIER, NEWAGGRFUNC, and NEWTERM are specialized as concrete elements of the types prescribed by the RIF-FLD XML schema.
If a dialect, D, specializes RIF-FLD then a valid XML document in dialect D is one that is valid with respect to the specialized XML schema of D. ☐
Definition (Admissible XML document in a logic dialect). An admissible RIF-FLD document in the XML syntax is a valid FLD document in that syntax that is the image of a well-formed RIF-FLD document in the presentation syntax (see Definition Well-formed formula) under the presentation-to-XML syntax mapping χ_{fld} defined in Section Mapping from the RIF-FLD Presentation Syntax to the XML Syntax.
If a dialect, D, specializes RIF-FLD then an XML document is admissible with respect to D if and only if it is a valid document in D and it is an image under χ_{D} of a well-formed document in the presentation syntax of D, where χ_{D} is the presentation-to-XML mapping defined by the dialect D.
Note that if D requires the directive Dialect(D) as part of its syntax then this implies that any D-admissible document must have this directive. ☐
A round-tripping of an admissible document in a dialect, D, is a semantics-preserving mapping to a document in any language L followed by a semantics-preserving mapping from the L-document back to an admissible D-document. While semantically equivalent, the original and the round-tripped D-documents need not be identical.
RIF-FLD uses [XML1.0] for its XML syntax. The XML serialization for RIF-FLD is alternating or fully striped [ANF01]. A fully 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 EBNF of the presentation syntax, such as FORMULA, become XML Schema groups in Appendix XML Schema for FLD. 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.
The RIF serialization framework for the syntax of Section EBNF Grammar for the Presentation Syntax of RIF-FLD uses the following XML tags.
While there is a RIF-FLD element tag for the Import directive and an attribute for the Dialect directive, there are none for the Base and Prefix directives: they are handled as discussed in Section Mapping from the RIF-FLD Presentation Syntax to the XML Syntax.
- Document (document, with optional 'dialect' attribute, containing optional directive and payload roles) - directive (directive role, containing Import) - payload (payload role, containing Group) - Import (importation, containing location and optional profile) - Module (remote module, associating internal name with location) - location (location role, containing ANYURICONST) - internal (internal role, containing variable-free term as remote module name) - profile (profile role, containing PROFILE) - Group (nested collection of sentences) - sentence (sentence role, containing FORMULA or Group) - Forall (quantified formula for 'Forall', containing declare and formula roles) - Exists (quantified formula for 'Exists', containing declare and formula roles) - declare (declare role, containing a Var) - formula (formula role, containing a FORMULA) - termula (termula role, containing a TERMULA) - Implies (implication, containing if and then roles) - if (antecedent role, containing FORMULA) - then (consequent role, containing FORMULA) - And (conjunction) - Or (disjunction) - Neg (strong negation, containing a formula role) - Naf (default negation, containing a formula role) - Atom (atom formula, positional or with named arguments) - Remote (prefix version of remote term '@', containing a formula/termula and an internal role) - 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 fixed 'ordered' 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 fixed 'ordered' 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) - items (list items role, with ordered="yes" attribute, containing n TERMs) - rest (list rest role, corresponding to '|') - Min (aggregate function) - Max (aggregate function) - Sum (aggregate function) - Prod (aggregate function) - Avg (aggregate function) - Count (aggregate function) - Set (aggregate function) - Bag (aggregate function) - Const (individual, function, or predicate symbol, with optional 'type' attribute) - Name (name of named argument) - Var (logic variable) - id (identifier role, containing CONST) - 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 Non-annotated RIF-FLD Language.
The id and meta elements, which are expansions of the IRIMETA element, can occur optionally as the initial children of any Class element.
The XML Schema Definition of RIF-FLD is given in Appendix XML Schema for FLD.
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 <Const type="&xs;dateTime">2007-11-23T03:55:44-02:30</Const>.
The xml:lang attribute, as defined by 2.12 Language Identification of XML 1.0 or its successor specifications in the W3C recommendation track, is optionally used to identify the language for the presentation of the Const to the user. It is allowed only in association with constants of the type rdf:plainLiteral. A compliant implementation MUST ignore the xml:lang attribute if the type of the Const is not rdf:plainLiteral.
RIF-FLD also uses the ordered attribute to indicate that the children of args and slot elements are ordered.
Example 5 (Serialization of a nested RIF-FLD group with annotations).
This example shows an XML serialization for the formulas in Example 3. For convenience of reference, the original formulas are included at the top. For better readability, we again use the shortcut syntax defined in [RIF-DTB].
Presentation syntax: Document( Dialect(FOL) Base(<http://www.shakespeare-literature.com/Hamlet/>) Prefix(dc <http://http://purl.org/dc/terms/>) Prefix(ex <http://example.org/ontology#>) (* <assertions> <assertions>[dc:title->"Hamlet" dc:creator->"Shakespeare"] *) Group( Exists ?X (And(?X # ex:RottenThing ex:partof(?X <http://www.denmark.dk>))) Forall ?X (Or(<tobe>(?X) Naf <tobe>(?X))) Forall ?X (And(Exists ?B (And(ex:has(?X ?B) ?B # ex:business)) Exists ?D (And(ex:has(?X ?D) ?D # ex:desire))) :- ?X # ex:man) (* <facts> *) Group( <Yorick> # ex:poor <Hamlet> # ex:prince ) ) )
XML serialization: <!DOCTYPE Document [ <!ENTITY dc "http://purl.org/dc/terms/"> <!ENTITY ex "http://example.org/ontology#"> <!ENTITY rif "http://www.w3.org/2007/rif#"> <!ENTITY xs "http://www.w3.org/2001/XMLSchema#"> ]> <Document xml:base="http://www.shakespeare-literature.com/Hamlet/"> dialect="FOL"> <payload> <Group> <meta> <Frame> <object> <Const type="&rif;iri">assertions</Const> </object> <slot ordered="yes"> <Const type="&rif;iri">&dc;title</Const> <Const type="&xs;string">Hamlet</Const> </slot> <slot ordered="yes"> <Const type="&rif;iri">&dc;creator</Const> <Const type="&xs;string">Shakespeare</Const> </slot> </Frame> </meta> <sentence> <Exists> <declare><Var>X</Var></declare> <formula> <And> <formula> <Member> <instance><Var>X</Var></instance> <class><Const type="&rif;iri">ex:RottenThing</Const></class> </Member> </formula> <formula> <Atom> <op><Const type="&rif;iri">ex:partof</Const></op> <args ordered="yes"> <Var>X</Var> <Const type="&rif;iri">http://www.denmark.dk</Const> </args> </Atom> </formula> </And> </formula> </Exists> </sentence> <sentence> <Forall> <declare><Var>X</Var></declare> <formula> <Or> <formula> <Atom> <op><Const type="&rif;iri">tobe</Const></op> <args ordered="yes"><Var>X</Var></args> </Atom> </formula> <formula> <Naf> <formula> <Atom> <op><Const type="&rif;iri">tobe</Const></op> <args ordered="yes"><Var>X</Var></args> </Atom> </formula> </Naf> </formula> </Or> </formula> </Forall> </sentence> <sentence> <Forall> <declare><Var>X</Var></declare> <formula> <Implies> <if> <Member> <instance><Var>X</Var></instance> <class><Const type="&rif;iri">ex:man</Const></class> </Member> </if> <then> <And> <formula> <Exists> <declare><Var>B</Var></declare> <formula> <And> <formula> <Atom> <op><Const type="&rif;iri">ex:has</Const></op> <args> <Var>X</Var> <Var>B</Var> </args> </Atom> </formula> <formula> <Member> <instance><Var>B</Var></instance> <class><Const type="&rif;iri">ex:business</Const></class> </Member> </formula> </And> </formula> </Exists> </formula> <formula> <Exists> <declare><Var>D</Var></declare> <formula> <And> <formula> <Atom> <op><Const type="&rif;iri">ex:has</Const></op> <args> <Var>X</Var> <Var>D</Var> </args> </Atom> </formula> <formula> <Member> <instance><Var>D</Var></instance> <class><Const type="&rif;iri">ex:desire</Const></class> </Member> </formula> </And> </formula> </Exists> </formula> </And> </then> </Implies> </formula> </Forall> </sentence> <sentence> <Group> <meta> <Frame> <object> <Const type="&rif;iri">facts</Const> </object> </Frame> </meta> <sentence> <Member> <instance><Const type="&rif;iri">Yorick</Const></instance> <class><Const type="&rif;iri">ex:poor</Const></class> </Member> </sentence> <sentence> <Member> <instance><Const type="&rif;iri">Hamlet</Const></instance> <class><Const type="&rif;iri">ex:prince</Const></class> </Member> </sentence> </Group> </sentence> </Group> </payload> </Document>
This section defines a normative mapping, χ_{fld}, from the presentation syntax of Section EBNF Grammar for the Presentation Syntax of RIF-FLD to the XML syntax of RIF-FLD. 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 χ_{fld} to these metavariables. When an expression χ_{fld}(metavar) occurs in an XML pattern in the right column of a translation table, it should be understood as a recursive application of χ_{fld} to the presentation syntax represented by the metavariable. The XML syntax result of such an application is substituted for the expression χ_{fld}(metavar). A sequence of terms containing metavariables with subscripts is indicated by an ellipsis. A metavariable or a well-formed XML subelement is marked as optional by appending a bold-italic question mark, ?, to its right.
The χ_{fld} mapping from the presentation syntax to the XML syntax of the non-annotated RIF-FLD Language is given by the table below. Each row indicates a translation χ_{fld}(Presentation) = XML. The function remove-outer-quotes used in the translation removes enclosing double quotes from a string and leaves unquoted strings untouched. Since the presentation syntax of RIF-FLD is context sensitive, the mapping must differentiate between the terms that occur in the position of the 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 the 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 argument_{i} is assumed to be instantiated to values unequal to the instantiations of named arguments name_{j} -> filler_{j}. Regarding the last but first row, we assume that shortcuts for constants [RIF-DTB] have already been expanded to their full form ("..."^^symspace). The AGGRFUNC metavariable stands for any of the aggregation functions Min, Max, Count, Avg, Sum, Prod, Set, Bag, or NEWAGGRFUNC.
Thus, the mapping of the extension point for aggregate functions (NEWAGGRFUNC) is handled by the AGGRFUNC metavariable, along with the mapping of the specific aggregate functions (Min etc.). The mapping of the extension points for quantifiers (NEWQUANTIFIER) and connectives (NEWCONNECTIVE) generalizes the mapping for the specific quantifiers (Forall, Exists) and connectives (And, Or), respectively. The mapping of the extension point for terms (NEWTERM) keeps NEWTERM entirely unconstrained in the presentation syntax and uses a wildcard content model (indicated by ellipses) in the XML syntax. This is because the content of NEWTERM is left entirely up to RIF dialects. Recall that the extension point for symbols (NEWSYMBOL) is part of the alphabet and is not dealt with in the EBNF and XML grammars.
Also recall that OpenList(t_{1} ... t_{m} t), m≥1, is just an alternative form for List(t_{1} ... t_{m} | t), so its mapping is not represented separately.
Note that the Import and Dialect directives are handled by the presentation-to-XML syntax mapping, using an XML attribute for dialect names (values: FOL, BLD, Core, etc.). On the other hand, the Prefix and Base directives are not handled by this mapping but 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 χ_{fld} applies only to such expanded documents. RIF-FLD 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 5. 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-FLD 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( Dialect(name)? Import(iloc_{1} prfl_{1}?) . . . Import(iloc_{n} prfl_{n}?) Module(name_{1} mloc_{1}) . . . Module(name_{k} mloc_{k}) group ) n ≥ 0, k ≥ 0 |
<Document dialect="name"?> <directive> <Import> <location>χ_{fld}(iloc_{1})</location> <profile>χ_{fld}(prfl_{1})</profile>? </Import> </directive> . . . <directive> <Import> <location>χ_{fld}(iloc_{n})</location> <profile>χ_{fld}(prfl_{n})</profile>? </Import> </directive> <directive> <Module> <internal>χ_{fld}(name_{1})</internal> <location>χ_{fld}(mloc_{1})</location> </Module> </directive> . . . <directive> <Module> <internal>χ_{fld}(name_{k})</internal> <location>χ_{fld}(mloc_{k})</location> </Module> </directive> <payload>χ_{fld}(group)</payload> </Document> |
Group( clause_{1} . . . clause_{n} ) n ≥ 0 |
<Group> <sentence>χ_{fld}(clause_{1})</sentence> . . . <sentence>χ_{fld}(clause_{n})</sentence> </Group> |
Forall variable_{1} . . . variable_{n} ( body ) n ≥ 0 |
<Forall> <declare>χ_{fld}(variable_{1})</declare> . . . <declare>χ_{fld}(variable_{n})</declare> <formula>χ_{fld}(body)</formula> </Forall> |
Exists variable_{1} . . . variable_{n} ( body ) n ≥ 0 |
<Exists> <declare>χ_{fld}(variable_{1})</declare> . . . <declare>χ_{fld}(variable_{n})</declare> <formula>χ_{fld}(body)</formula> </Exists> |
NEWQUANTIFIER variable_{1} . . . variable_{n} ( body ) n ≥ 0 |
<NEWQUANTIFIER> <declare>χ_{fld}(variable_{1})</declare> . . . <declare>χ_{fld}(variable_{n})</declare> <formula>χ_{fld}(body)</formula> </NEWQUANTIFIER> |
conclusion :- condition |
<Implies> <if>χ_{fld}(condition)</if> <then>χ_{fld}(conclusion)</then> </Implies> |
And ( conjunct_{1} . . . conjunct_{n} ) n ≥ 0 |
<And> <formula>χ_{fld}(conjunct_{1})</formula> . . . <formula>χ_{fld}(conjunct_{n})</formula> </And> |
Or ( disjunct_{1} . . . disjunct_{n} ) n ≥ 0 |
<Or> <formula>χ_{fld}(disjunct_{1})</formula> . . . <formula>χ_{fld}(disjunct_{n})</formula> </Or> |
NEWCONNECTIVE ( argument_{1} . . . argument_{n} ) n ≥ 0 |
<NEWCONNECTIVE> <formula>χ_{fld}(argument_{1})</formula> . . . <formula>χ_{fld}(argument_{n})</formula> </NEWCONNECTIVE> |
Neg form |
<Neg> <formula>χ_{fld}(form)</formula> </Neg> |
Naf form |
<Naf> <formula>χ_{fld}(form)</formula> </Naf> |
query @ modref |
<Remote> <formula>χ_{fld}(query)</formula> <internal>χ_{fld}(modref)</internal> </Remote> |
External ( atomframexpr ) |
<External> <content>χ_{fld}(atomframexpr)</content> </External> |
pred ( ) |
<Atom> <op>χ_{fld}(pred)</op> </Atom> |
pred ( argument_{1} . . . argument_{m} ) m ≥ 1 |
<Atom> <op>χ_{fld}(pred)</op> <args ordered="yes"> χ_{fld}(argument_{1}) . . . χ_{fld}(argument_{m}) </args> </Atom> |
func ( ) |
<Expr> <op>χ_{fld}(func)</op> </Expr> |
func ( argument_{1} . . . argument_{m} ) m ≥ 1 |
<Expr> <op>χ_{fld}(func)</op> <args ordered="yes"> χ_{fld}(argument_{1}) . . . χ_{fld}(argument_{m}) </args> </Expr> |
List ( element_{1} . . . element_{n} ) n ≥ 0 |
<List> <items ordered="yes"> χ_{fld}(element_{1}) . . . χ_{fld}(element_{n}) </items> </List> |
List ( element_{1} . . . element_{n} | remainder ) n ≥ 1 |
<List> <items ordered="yes"> χ_{fld}(element_{1}) . . . χ_{fld}(element_{n}) </items> <rest>χ_{fld}(remainder)</rest> </List> |
pred ( name_{1} -> filler_{1} . . . name_{n} -> filler_{n} ) n ≥ 0 |
<Atom> <op>χ_{fld}(pred)</op> <slot ordered="yes"> <Name>χ_{bld}(name_{1})</Name> χ_{fld}(filler_{1}) </slot> . . . <slot ordered="yes"> <Name>χ_{bld}(name_{n})</Name> χ_{fld}(filler_{n}) </slot> </Atom> |
func ( name_{1} -> filler_{1} . . . name_{n} -> filler_{n} ) n ≥ 0 |
<Expr> <op>χ_{fld}(func)</op> <slot ordered="yes"> <Name>χ_{bld}(name_{1})</Name> χ_{fld}(filler_{1}) </slot> . . . <slot ordered="yes"> <Name>χ_{bld}(name_{n})</Name> χ_{fld}(filler_{n}) </slot> </Expr> |
inst [ key_{1} -> filler_{1} . . . key_{n} -> filler_{n} ] n ≥ 0 |
<Frame> <object>χ_{fld}(inst)</object> <slot ordered="yes"> χ_{fld}(key_{1}) χ_{fld}(filler_{1}) </slot> . . . <slot ordered="yes"> χ_{fld}(key_{n}) χ_{fld}(filler_{n}) </slot> </Frame> |
inst # class |
<Member> <instance>χ_{fld}(inst)</instance> <class>χ_{fld}(class)</class> </Member> |
sub ## super |
<Subclass> <sub>χ_{fld}(sub)</sub> <super>χ_{fld}(super)</super> </Subclass> |
left = right |
<Equal> <left>χ_{fld}(left)</left> <right>χ_{fld}(right)</right> </Equal> |
AGGRFUNC { variable variable_{1} . . . variable_{m} | compform } m ≥ 0 |
<AGGRFUNC> <declare>χ_{fld}(variable)</declare> <declare>χ_{fld}(variable_{1})</declare> . . . <declare>χ_{fld}(variable_{m})</declare> <formula>χ_{fld}(compform)</formula> </AGGRFUNC> |
"unicodestring"^^space |
<Const type="space">unicodestring</Const> |
?name_{1} |
<Name>χ_{bld}(name_{1})</Name> |
NEWTERM |
<NEWTERM>...</NEWTERM> |
name_{i} |
remove-outer-quotes(name_{i}) |
The χ_{fld} mapping from RIF-FLD annotations in the presentation syntax to the XML syntax is specified by the table below. It extends the translation table of Section Mapping of the Non-annotated RIF-FLD Language. The metavariable Typetag in the presentation and XML syntaxes stands for any of the class names And, Or, External, Document, or Group, Quantifier for Exists or Forall, and Negation for Neg or Naf. The dollar sign, $, stands for any of the binary infix operator names #, ##, =, :-, or @, while Binop stands for their respective class names Member, Subclass, Equal, Implies, or Remote. The metavariable attr? is used with Typetag to capture the optional dialect attribute (with its value) of Document. Again, each metavariable for an (unnamed) positional argument_{i} is assumed to be instantiated to values unequal to the instantiations of named arguments name_{j} -> filler_{j}.
Presentation Syntax | XML Syntax |
---|---|
(* const? frameconj? *) Typetag ( e_{1} . . . e_{n} ) n ≥ 0 |
<Typetag attr?> <id>χ_{fld}(const)</id>? <meta>χ_{fld}(frameconj)</meta>? e_{1}' . . . e_{n}' </Typetag> where attr, e_{1}', . . ., e_{n}' are defined by the equation χ_{fld}(Typetag(e_{1} . . . e_{n})) = <Typetag attr?>e_{1}' . . . e_{n}'</Typetag> |
(* const? frameconj? *) Quantifier variable_{1} . . . variable_{n} ( body ) n ≥ 0 |
<Quantifier> <id>χ_{fld}(const)</id>? <meta>χ_{fld}(frameconj)</meta>? <declare>χ_{fld}(variable_{1})</declare> . . . <declare>χ_{fld}(variable_{n})</declare> <formula>χ_{fld}(body)</formula> </Quantifier> |
(* const? frameconj? *) Negation e |
<Negation> <id>χ_{fld}(const)</id>? <meta>χ_{fld}(frameconj)</meta>? χ_{fld}(e) </Negation> |
(* const? frameconj? *) pred ( argument_{1} . . . argument_{n} ) n ≥ 0 |
<Atom> <id>χ_{fld}(const)</id>? <meta>χ_{fld}(frameconj)</meta>? <op>χ_{fld}(pred)</op> <args ordered="yes"> χ_{fld}(argument_{1}) . . . χ_{fld}(argument_{n}) </args> </Atom> |
(* const? frameconj? *) func ( argument_{1} . . . argument_{n} ) n ≥ 0 |
<Expr> <id>χ_{fld}(const)</id>? <meta>χ_{fld}(frameconj)</meta>? <op>χ_{fld}(func)</op> <args ordered="yes"> χ_{fld}(argument_{1}) . . . χ_{fld}(argument_{n}) </args> </Expr> |
(* const? frameconj? *) List ( element_{1} . . . element_{n} ) n ≥ 0 |
<List> <id>χ_{fld}(const)</id>? <meta>χ_{fld}(frameconj)</meta>? <items ordered="yes"> χ_{fld}(element_{1}) . . . χ_{fld}(element_{n}) </items> </List> |
(* const? frameconj? *) List ( element_{1} . . . element_{n} | remainder ) n ≥ 1 |
<List> <id>χ_{fld}(const)</id>? <meta>χ_{fld}(frameconj)</meta>? <items ordered="yes"> χ_{fld}(element_{1}) . . . χ_{fld}(element_{n}) </items> <rest>χ_{fld}(remainder)</rest> </List> |
(* const? frameconj? *) pred ( name_{1} -> filler_{1} . . . name_{n} -> filler_{n} ) n ≥ 0 |
<Atom> <id>χ_{fld}(const)</id>? <meta>χ_{fld}(frameconj)</meta>? <op>χ_{fld}(pred)</op> <slot ordered="yes"> <Name>χ_{bld}(name_{1})</Name> χ_{fld}(filler_{1}) </slot> . . . <slot ordered="yes"> <Name>χ_{bld}(name_{n})</Name> χ_{fld}(filler_{n}) </slot> </Atom> |
(* const? frameconj? *) func ( name_{1} -> filler_{1} . . . name_{n} -> filler_{n} ) n ≥ 0 |
<Expr> <id>χ_{fld}(const)</id>? <meta>χ_{fld}(frameconj)</meta>? <op>χ_{fld}(func)</op> <slot ordered="yes"> <Name>χ_{bld}(name_{1})</Name> χ_{fld}(filler_{1}) </slot> . . . <slot ordered="yes"> <Name>χ_{bld}(name_{n})</Name> χ_{fld}(filler_{n}) </slot> </Expr> |
(* const? frameconj? *) inst [ key_{1} -> filler_{1} . . . key_{n} -> filler_{n} ] n ≥ 0 |
<Frame> <id>χ_{fld}(const)</id>? <meta>χ_{fld}(frameconj)</meta>? <object>χ_{fld}(inst)</object> <slot ordered="yes"> χ_{fld}(key_{1}) χ_{fld}(filler_{1}) </slot> . . . <slot ordered="yes"> χ_{fld}(key_{n}) χ_{fld}(filler_{n}) </slot> </Frame> |
(* const? frameconj? *) e_{1} $ e_{2} |
<Binop> <id>χ_{fld}(const)</id>? <meta>χ_{fld}(frameconj)</meta>? e_{1}' e_{2}' </Binop> where Binop, e_{1}', e_{2}' are defined by the equation χ_{fld}(e_{1} $ e_{2}) = <Binop>e_{1}' e_{2}'</Binop> |
(* const? frameconj? *) unicodestring^^symspace |
<Const type="symspace"> <id>χ_{fld}(const)</id>? <meta>χ_{fld}(frameconj)</meta>? unicodestring </Const> |
(* const? frameconj? *) ?name_{1} |
<Var> <id>χ_{fld}(const)</id>? <meta>χ_{fld}(frameconj)</meta>? χ_{bld}(name_{1}) </Var> |
RIF does not require or expect conformant systems to implement the presentation syntax of a RIF dialect. 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 also that Ε is a coherent set of external schemas that includes the built-ins listed in [RIF-DTB]. Let D be a RIF dialect (e.g., [RIF-BLD]). We say that a formula φ is a D_{Τ,Ε} formula iff
A RIF processor is a conformant D_{Τ,Ε} consumer iff it implements a semantics-preserving mapping, μ, from the set of all D_{Τ,Ε} formulas to the language L of the processor.
Formally, this means that for any pair φ, ψ of D_{Τ,Ε} formulas for which φ |=_{D} ψ is defined, φ |=_{D} ψ iff μ(φ) |=_{L} μ(ψ). Here |=_{D} denotes the logical entailment in the RIF dialect D and |=_{L} is the logical entailment in the language L of the RIF processor.
A RIF processor is a conformant D_{Τ,Ε} producer iff it implements a semantics-preserving mapping, ν, from the language L of the processor to the set of all D_{Τ,Ε} formulas.
Formally, this means that for any pair φ, ψ of formulas in L for which φ |=_{L} ψ is defined, φ |=_{L} ψ iff ν(φ) |=_{D} ν(ψ).
An admissible document in a logic RIF dialect D is one which conforms to all the syntactic constraints of D, including the ones that cannot be checked by an XML Schema validator (see Definition Admissible XML document in a logic dialect).
This revised version incorporates a number of improvements suggested in [DAA] and fixes errors in the definition of the semantics of document formulas pointed out in that work.
The namespace of RIF is "http://www.w3.org/2007/rif#".
XML schemas for the RIF-FLD language are defined below and are also available at http://www.w3.org/2010/rif-schema/fld with additional examples. For modularity, we define a Baseline schema and a Skyline schema. Baseline is the schema module that provides the foundation up to FORMULAs without Implies. Skyline provides the full schema by augmenting Baseline with the Implies FORMULA as well as with Group and Document.
<?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: FLDBaseline.xsd, v. 1.5, 2010-05-08, hboley/dhirtle"> <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 Baseline module of FLD. It is the foundation of the full schema defined through the Skyline module. The Baseline XML schema is based on the following EBNF (compared to the full EBNF of RIF-FLD, Group and Document are omitted, and 'Implies' is missing from the productions for FORMULA and TERMULA). The nonterminals starting with NEW provide extensions points for FLD (cf. Section 4 XML Serialization Framework). FORMULA ::= IRIMETA? CONNECTIVE '(' FORMULA* ')' | IRIMETA? QUANTIFIER '(' FORMULA ')' | IRIMETA? 'Neg' FORMULA | IRIMETA? 'Naf' FORMULA | IRIMETA? FORMULA '@' MODULEREF | FORM FORM ::= IRIMETA? (Var | ATOMIC | 'External' '(' ATOMIC LOCATOR? ')') ATOMIC ::= Const | Atom | Equal | Member | Subclass | Frame Atom ::= UNITERM UNITERM ::= TERMULA '(' (TERMULA* | (Name '->' TERMULA)*) ')' Equal ::= TERMULA '=' TERMULA Member ::= TERMULA '#' TERMULA Subclass ::= TERMULA '##' TERMULA Frame ::= TERMULA '[' (TERMULA '->' TERMULA)* ']' TERMULA ::= IRIMETA? CONNECTIVE '(' TERMULA* ')' | IRIMETA? QUANTIFIER '(' TERMULA ')' | IRIMETA? 'Neg' TERMULA | IRIMETA? 'Naf' TERMULA | IRIMETA? TERMULA '@' MODULEREF | TERM TERM ::= IRIMETA? (Var | EXPRIC | List | 'External' '(' EXPRIC LOCATOR? ')' | AGGREGATE | NEWTERM) EXPRIC ::= Const | Expr | Equal | Member | Subclass | Frame Expr ::= UNITERM List ::= 'List' '(' TERM* ')' | 'List' '(' TERM+ '|' TERM ')' AGGREGATE ::= AGGRFUNC '{' Var ('[' Var+ ']')? '|' FORMULA '}' Const ::= '"' UNICODESTRING '"^^' SYMSPACE | CONSTSHORT MODULEREF ::= Var | Const | Expr CONNECTIVE ::= 'And' | 'Or' | NEWCONNECTIVE QUANTIFIER ::= ('Exists' | 'Forall' | NEWQUANTIFIER) Var* AGGRFUNC ::= 'Min' | 'Max' | 'Sum' | 'Prod' | 'Avg' | 'Count' | 'Set' | 'Bag' | NEWAGGRFUNC SYMSPACE ::= ANGLEBRACKIRI | CURIE LOCATOR ::= ANGLEBRACKIRI Var ::= '?' Name Name ::= NCName | '"' UNICODESTRING '"' IRIMETA ::= '(*' Const? (Frame | 'And' '(' Frame* ')')? '*)' </xs:documentation> </xs:annotation> <xs:group name="FORMULA"> <!-- 'Implies' omitted from Baseline schema, allowing its modular use FORMULA ::= IRIMETA? CONNECTIVE '(' FORMULA* ')' | IRIMETA? QUANTIFIER '(' FORMULA ')' | IRIMETA? 'Neg' FORMULA | IRIMETA? 'Naf' FORMULA | IRIMETA? FORMULA '@' MODULEREF FORM CONNECTIVE ::= 'And' | 'Or' | NEWCONNECTIVE QUANTIFIER ::= ('Exists' | 'Forall' | NEWQUANTIFIER) Var* rewritten as FORMULA ::= IRIMETA? 'And' '(' FORMULA* ')' | IRIMETA? 'Or' '(' FORMULA* ')' | IRIMETA? 'NEWCONNECTIVE' '(' FORMULA* ')' | IRIMETA? 'Exists' Var* '(' FORMULA ')' | IRIMETA? 'Forall' Var* '(' FORMULA ')' | IRIMETA? 'NEWQUANTIFIER' Var* '(' FORMULA ')' | IRIMETA? 'Neg' FORMULA | IRIMETA? 'Naf' FORMULA | IRIMETA? 'Remote' '(' FORMULA MODULEREF ')' FORM --> <xs:choice> <xs:element name="And" type="And-FORMULA.type"/> <xs:element name="Or" type="Or-FORMULA.type"/> <xs:element name="NEWCONNECTIVE" type="NEWCONNECTIVE-FORMULA.type"/> <xs:element name="Exists" type="Exists-FORMULA.type"/> <xs:element name="Forall" type="Forall-FORMULA.type"/> <xs:element name="NEWQUANTIFIER" type="NEWQUANTIFIER-FORMULA.type"/> <xs:element name="Neg" type="Neg-FORMULA.type"/> <xs:element name="Naf" type="Naf-FORMULA.type"/> <xs:element name="Remote" type="Remote-FORMULA.type"/> <xs:group ref="FORM"/> </xs:choice> </xs:group> <xs:complexType name="And-FORMULA.type"> <!-- sensitive to FORMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element name="formula" minOccurs="0" maxOccurs="unbounded"/> </xs:sequence> </xs:complexType> <xs:complexType name="Or-FORMULA.type"> <!-- sensitive to FORMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element name="formula" minOccurs="0" maxOccurs="unbounded"/> </xs:sequence> </xs:complexType> <xs:complexType name="NEWCONNECTIVE-FORMULA.type"> <!-- sensitive to FORMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element name="formula" minOccurs="0" maxOccurs="unbounded"/> </xs:sequence> </xs:complexType> <xs:complexType name="Exists-FORMULA.type"> <!-- sensitive to FORMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="declare" minOccurs="0" maxOccurs="unbounded"/> <xs:element ref="formula"/> </xs:sequence> </xs:complexType> <xs:complexType name="Forall-FORMULA.type"> <!-- sensitive to FORMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="declare" minOccurs="0" maxOccurs="unbounded"/> <xs:element ref="formula"/> </xs:sequence> </xs:complexType> <xs:complexType name="NEWQUANTIFIER-FORMULA.type"> <!-- sensitive to FORMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="declare" minOccurs="0" maxOccurs="unbounded"/> <xs:element ref="formula"/> </xs:sequence> </xs:complexType> <xs:complexType name="Neg-FORMULA.type"> <!-- sensitive to FORMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="formula" minOccurs="1" maxOccurs="1"/> </xs:sequence> </xs:complexType> <xs:complexType name="Naf-FORMULA.type"> <!-- sensitive to FORMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="formula" minOccurs="1" maxOccurs="1"/> </xs:sequence> </xs:complexType> <xs:complexType name="Remote-FORMULA.type"> <!-- sensitive to FORMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="formula"/> <xs:element ref="internal"/> </xs:sequence> </xs:complexType> <xs:element name="internal"> <xs:complexType> <xs:sequence> <xs:group ref="TERM"/> </xs:sequence> </xs:complexType> </xs:element> <xs:complexType name="External-FORMULA.type"> <!-- sensitive to FORMULA (Atom | Frame) 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 | Frame) context--> <xs:sequence> <xs:choice> <xs:element ref="Atom"/> <xs:element ref="Frame"/> </xs:choice> </xs:sequence> </xs:complexType> <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="FORM"> <!-- FORM ::= IRIMETA? (Var | ATOMIC | 'External' '(' ATOMIC LOCATOR? ')') --> <xs:choice> <xs:element ref="Var"/> <xs:group ref="ATOMIC"/> <xs:element name="External" type="External-FORM.type"/> </xs:choice> </xs:group> <xs:complexType name="External-FORM.type"> <!-- sensitive to FORM (ATOMIC) context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element name="content" type="content-FORM.type"/> <xs:element ref="location" minOccurs="0" maxOccurs="1"/> </xs:sequence> </xs:complexType> <xs:complexType name="content-FORM.type"> <!-- sensitive to FORM (ATOMIC) context--> <xs:sequence> <xs:group ref="ATOMIC"/> </xs:sequence> </xs:complexType> <xs:group name="ATOMIC"> <!-- ATOMIC ::= Const | Atom | Equal | Member | Subclass | Frame --> <xs:choice> <xs:element ref="Const"/> <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 ::= TERMULA '(' (TERMULA* | (Name '->' TERMULA)*) ')' --> <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:group ref="TERMULA"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="args"> <xs:complexType> <xs:sequence> <xs:group ref="TERMULA" 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="TERMULA"/> </xs:sequence> <xs:attribute name="ordered" type="xs:string" fixed="yes"/> </xs:complexType> <xs:element name="Equal"> <!-- Equal ::= TERMULA '=' TERMULA --> <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="TERMULA"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="right"> <xs:complexType> <xs:sequence> <xs:group ref="TERMULA"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="Member"> <!-- Member ::= TERMULA '#' TERMULA --> <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 ::= TERMULA '##' TERMULA --> <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="TERMULA"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="class"> <xs:complexType> <xs:sequence> <xs:group ref="TERMULA"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="sub"> <xs:complexType> <xs:sequence> <xs:group ref="TERMULA"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="super"> <xs:complexType> <xs:sequence> <xs:group ref="TERMULA"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="Frame"> <!-- Frame ::= TERMULA '[' (TERMULA '->' TERMULA)* ']' --> <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="TERMULA"/> </xs:sequence> </xs:complexType> </xs:element> <xs:complexType name="slot-Frame.type"> <!-- sensitive to Frame (TERMULA) context--> <xs:sequence> <xs:group ref="TERMULA"/> <xs:group ref="TERMULA"/> </xs:sequence> <xs:attribute name="ordered" type="xs:string" fixed="yes"/> </xs:complexType> <xs:group name="TERMULA"> <!-- 'Implies' omitted from Baseline schema, allowing its modular use TERMULA ::= IRIMETA? CONNECTIVE '(' TERMULA* ')' | IRIMETA? QUANTIFIER '(' TERMULA ')' | IRIMETA? 'Neg' TERMULA | IRIMETA? 'Naf' TERMULA | IRIMETA? TERMULA '@' MODULEREF | TERM CONNECTIVE ::= 'And' | 'Or' | NEWCONNECTIVE QUANTIFIER ::= ('Exists' | 'Forall' | NEWQUANTIFIER) Var* rewritten as TERMULA ::= IRIMETA? 'And' '(' TERMULA* ')' | IRIMETA? 'Or' '(' TERMULA* ')' | IRIMETA? 'NEWCONNECTIVE' '(' TERMULA* ')' | IRIMETA? 'Exists' Var* '(' TERMULA ')' | IRIMETA? 'Forall' Var* '(' TERMULA ')' | IRIMETA? 'NEWQUANTIFIER' Var* '(' TERMULA ')' | IRIMETA? 'Neg' TERMULA | IRIMETA? 'Naf' TERMULA | IRIMETA? 'Remote' '(' TERMULA MODULEREF ')' TERM --> <xs:choice> <xs:element name="And" type="And-TERMULA.type"/> <xs:element name="Or" type="Or-TERMULA.type"/> <xs:element name="NEWCONNECTIVE" type="NEWCONNECTIVE-TERMULA.type"/> <xs:element name="Exists" type="Exists-TERMULA.type"/> <xs:element name="Forall" type="Forall-TERMULA.type"/> <xs:element name="NEWQUANTIFIER" type="NEWQUANTIFIER-TERMULA.type"/> <xs:element name="Neg" type="Neg-TERMULA.type"/> <xs:element name="Naf" type="Naf-TERMULA.type"/> <xs:element name="Remote" type="Remote-TERMULA.type"/> <xs:group ref="TERM"/> </xs:choice> </xs:group> <xs:complexType name="And-TERMULA.type"> <!-- sensitive to TERMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element name="termula" minOccurs="0" maxOccurs="unbounded"/> </xs:sequence> </xs:complexType> <xs:complexType name="Or-TERMULA.type"> <!-- sensitive to TERMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element name="termula" minOccurs="0" maxOccurs="unbounded"/> </xs:sequence> </xs:complexType> <xs:complexType name="NEWCONNECTIVE-TERMULA.type"> <!-- sensitive to TERMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element name="termula" minOccurs="0" maxOccurs="unbounded"/> </xs:sequence> </xs:complexType> <xs:complexType name="Exists-TERMULA.type"> <!-- sensitive to TERMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="declare" minOccurs="0" maxOccurs="unbounded"/> <xs:element ref="termula"/> </xs:sequence> </xs:complexType> <xs:complexType name="Forall-TERMULA.type"> <!-- sensitive to TERMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="declare" minOccurs="0" maxOccurs="unbounded"/> <xs:element ref="termula"/> </xs:sequence> </xs:complexType> <xs:complexType name="NEWQUANTIFIER-TERMULA.type"> <!-- sensitive to TERMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="declare" minOccurs="0" maxOccurs="unbounded"/> <xs:element ref="termula"/> </xs:sequence> </xs:complexType> <xs:complexType name="Neg-TERMULA.type"> <!-- sensitive to TERMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="termula" minOccurs="1" maxOccurs="1"/> </xs:sequence> </xs:complexType> <xs:complexType name="Naf-TERMULA.type"> <!-- sensitive to TERMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="termula" minOccurs="1" maxOccurs="1"/> </xs:sequence> </xs:complexType> <xs:complexType name="Remote-TERMULA.type"> <!-- sensitive to TERMULA context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="termula"/> <xs:element ref="internal"/> </xs:sequence> </xs:complexType> <xs:element name="termula"> <xs:complexType> <xs:sequence> <xs:group ref="TERMULA"/> </xs:sequence> </xs:complexType> </xs:element> <xs:group name="TERM"> <!-- TERM ::= IRIMETA? (Var | EXPRIC | List | 'External' '(' EXPRIC LOCATOR? ')' | AGGREGATE | NEWTERM) --> <xs:choice> <xs:element ref="Var"/> <xs:group ref="EXPRIC"/> <xs:element ref="List"/> <xs:element name="External" type="External-TERM.type"/> <xs:element ref="AGGREGATE"/> <xs:element ref="NEWTERM"/> </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="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:group ref="LISTELEMENTS" minOccurs="0" maxOccurs="1"/> </xs:sequence> </xs:complexType> </xs:element> <xs:group name="LISTELEMENTS"> <!-- LISTELEMENTS ::= TERM+ ('|' TERM)? --> <xs:sequence> <xs:element ref="items"/> <xs:element ref="rest" minOccurs="0" maxOccurs="1"/> </xs:sequence> </xs:group> <xs:element name="items"> <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: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 (EXPRIC) context--> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element name="content" type="content-TERM.type"/> <xs:element ref="location" minOccurs="0" maxOccurs="1"/> </xs:sequence> </xs:complexType> <xs:complexType name="content-TERM.type"> <!-- sensitive to TERM (EXPRIC) context--> <xs:sequence> <xs:group ref="EXPRIC"/> </xs:sequence> </xs:complexType> <xs:group name="EXPRIC"> <!-- EXPRIC ::= Const | Expr | Equal | Member | Subclass | Frame --> <xs:choice> <xs:element ref="Const"/> <xs:element ref="Expr"/> <xs:element ref="Equal"/> <xs:element ref="Member"/> <xs:element ref="Subclass"/> <xs:element ref="Frame"/> </xs:choice> </xs:group> <xs:element name="Expr"> <!-- Expr ::= UNITERM --> <xs:complexType> <xs:sequence> <xs:group ref="UNITERM"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="AGGREGATE" abstract="true"> <!-- AGGREGATE ::= AGGRFUNC '{' Var ('[' Var+ ']')? '|' FORMULA '}' AGGRFUNC ::= 'Min' | 'Max' | 'Sum' | 'Prod' | 'Avg' | 'Count' | 'Set' | 'Bag' | NEWAGGRFUNC --> <xs:complexType> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:element ref="declare" minOccurs="2" maxOccurs="unbounded"/> <xs:element ref="formula"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="Min" substitutionGroup="AGGREGATE"/> <xs:element name="Max" substitutionGroup="AGGREGATE"/> <xs:element name="Sum" substitutionGroup="AGGREGATE"/> <xs:element name="Prod" substitutionGroup="AGGREGATE"/> <xs:element name="Avg" substitutionGroup="AGGREGATE"/> <xs:element name="Count" substitutionGroup="AGGREGATE"/> <xs:element name="Set" substitutionGroup="AGGREGATE"/> <xs:element name="Bag" substitutionGroup="AGGREGATE"/> <xs:element name="NEWAGGRFUNC" substitutionGroup="AGGREGATE"/> <xs:element name="NEWTERM"> <!-- This uses the XSD wildcard schema component, any, allowing a NEWTERM to have zero or more child elements (role tags). --> <xs:complexType> <xs:sequence> <xs:any processContents="skip" minOccurs="0" maxOccurs="unbounded"/> </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 ::= NCName | '"' UNICODESTRING '"' ... i.e., 'Name' stands for either the NCName string or the UNICODESTRING with the outer quotes stripped off. --> </xs:element> <xs:element name="Var"> <!-- Var ::= '?' Name --> <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 ::= '(*' Const? (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 ref="Const"/> </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:element name="location" type="xs:anyURI"/> </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: FLDSkyline.xsd, v. 1.5, 2010-02-02, hboley/dhirtle"> <xs:annotation> <xs:documentation> This is the Skyline schema module of FLD. It is split off from the Baseline schema for modularity. The Skyline XML schema is based on the following EBNF (which adds Group and Document, and brings 'Implies' into FORMULA and TERMULA): Document ::= IRIMETA? 'Document' '(' Dialect? Base? Prefix* Import* Module* Group? ')' Dialect ::= 'Dialect' '(' Name ')' Base ::= 'Base' '(' ANGLEBRACKIRI ')' Prefix ::= 'Prefix' '(' NCName ANGLEBRACKIRI ')' Import ::= IRIMETA? 'Import' '(' LOCATOR PROFILE? ')' Module ::= IRIMETA? 'Module' '(' (Const | Expr) LOCATOR ')' Group ::= IRIMETA? 'Group' '(' (FORMULA | Group)* ')' Implies ::= IRIMETA? FORMULA ':-' FORMULA FORMULA ::= Implies | IRIMETA? CONNECTIVE '(' FORMULA* ')' | IRIMETA? QUANTIFIER '(' FORMULA ')' | IRIMETA? 'Neg' FORMULA | IRIMETA? 'Naf' FORMULA | IRIMETA? FORMULA '@' MODULEREF | FORM TERMULA ::= Implies | IRIMETA? CONNECTIVE '(' TERMULA* ')' | IRIMETA? QUANTIFIER '(' TERMULA ')' | IRIMETA? 'Neg' TERMULA | IRIMETA? 'Naf' TERMULA | IRIMETA? TERMULA '@' MODULEREF | TERM PROFILE ::= ANGLEBRACKIRI Note that this is an extension of the syntax for the Baseline schema (FLDBaseline.xsd). </xs:documentation> </xs:annotation> <!-- The Skyline schema extends, with Implies, the FORMULA and TERMULA groups of the Baseline schema from the same directory --> <xs:redefine schemaLocation="FLDBaseline.xsd"> <!-- FORMULA ::= Implies | IRIMETA? CONNECTIVE '(' FORMULA* ')' | IRIMETA? QUANTIFIER '(' FORMULA ')' | IRIMETA? 'Neg' FORMULA | IRIMETA? 'Naf' FORMULA | IRIMETA? FORMULA '@' MODULEREF | FORM TERMULA ::= Implies | IRIMETA? CONNECTIVE '(' TERMULA* ')' | IRIMETA? QUANTIFIER '(' TERMULA ')' | IRIMETA? 'Neg' TERMULA | IRIMETA? 'Naf' TERMULA | IRIMETA? TERMULA '@' MODULEREF | TERM --> <xs:group name="FORMULA"> <xs:choice> <xs:group ref="FORMULA"/> <xs:element ref="Implies"/> </xs:choice> </xs:group> <xs:group name="TERMULA"> <xs:choice> <xs:group ref="TERMULA"/> <xs:element ref="Implies"/> </xs:choice> </xs:group> </xs:redefine> <xs:element name="Document"> <!-- Document ::= IRIMETA? 'Document' '(' Dialect? Base? Prefix* Import* Module* Group? ')' Dialect ::= 'Dialect' '(' Name ')' represented with a dialect attribute. Base and Prefix represented directly in XML. --> <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:attribute name="dialect" type="xs:string"/> </xs:complexType> </xs:element> <xs:element name="directive"> <xs:complexType> <xs:choice> <xs:element ref="DIRECTIVE-IMPORT"/> <xs:element ref="DIRECTIVE-MODULE"/> </xs:choice> </xs:complexType> </xs:element> <xs:element name="DIRECTIVE-IMPORT"> <xs:complexType> <xs:sequence> <xs:element ref="Import"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="DIRECTIVE-MODULE"> <xs:complexType> <xs:sequence> <xs:element ref="Module"/> </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="Module"> <!-- Module ::= IRIMETA? 'Module' '(' (Const | Expr) LOCATOR ')' LOCATOR ::= ANGLEBRACKIRI --> <xs:complexType> <xs:sequence> <xs:group ref="IRIMETA" minOccurs="0" maxOccurs="1"/> <xs:choice> <xs:element ref="Const"/> <xs:element ref="Expr"/> </xs:choice> <xs:element ref="location"/> </xs:sequence> </xs:complexType> </xs:element> <xs:element name="profile" type="xs:anyURI"/> <xs:element name="Group"> <!-- Group ::= IRIMETA? 'Group' '(' (FORMULA | 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="FORMULA"/> <xs:element ref="Group"/> </xs:choice> </xs:complexType> </xs:element> <xs:element name="Implies"> <!-- Implies ::= IRIMETA? FORMULA ':-' 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:sequence> <xs:group ref="FORMULA"/> </xs:sequence> </xs:complexType> </xs:element> </xs:schema>
The semantics of most languages in Logic Programming, including the well-founded semantics [GRS91,Prz94] and the answer set (or stable model) semantics [GL88,GL91,GLe02] are defined with respect to Herbrand semantic structures [CL73]. This appendix introduces the concepts of Herbrand Universe, Herbrand Structures, and related notions in the context of RIF-FLD in order to facilitate specializations of the RIF logical framework to logic programming dialects.
A RIF-FLD semantic structure, I = <TV, DTS, D, I_{C}, I_{V}, I_{F}, I_{NF}, I_{list}, I_{tail}, I_{frame}, I_{sub}, I_{isa}, I_{=}, I_{external}, I_{connective}, I_{truth}> is Herbrand if its domain, D, is Herbrand and the mappings I_{C}, I_{V}, I_{F}, I_{NF}, I_{list}, I_{tail}, I_{frame}, I_{sub}, I_{isa}, I_{=}, I_{external}, I_{connective}, I_{truth} satisfy certain conditions. The definitions, below, will make this statement precise.
In what follows, we will be calling any variable-free term a ground term.
Definition (Herbrand Universe and Domain).
Given a language of RIF-FLD,
a Herbrand RIF-FLD universe, HU, is a set consisting of all the ground well-formed terms defined by RIF-FLD except the aggregate terms, external terms, and remote term references.
Given a semantic structure I, as above, we say that it has a Herbrand RIF-FLD domain if D (its domain) is a factor HU/ E, i.e., the set of all equivalence classes, of the elements in HU with respect to an equivalence relation, E, which is defined as the minimal relation that satisfies the following condition:
We will use the symbol HD to denote Herbrand domains. ☐
Note that the general properties of TVal_{I} in semantic structures (Definition Truth valuation) also imply that:
Definition (Herbrand Semantic Structure). A RIF-FLD semantic structure I of the above form is a Herbrand RIF-FLD semantic structure iff:
This mapping implicitly also defines the subdomains of HD, which correspond to the various signatures and are defined earlier -- see the effect of signatures on the semantics. Namely, for any signature sg, its subdomain HD_{sg} ⊆ HD is precisely the set {I(t)| t is a well-formed term that has sg as one of its signatures}.
RIF-FLD semantic multi-structures that are built out of Herbrand RIF-FLD semantic structures will be called Herbrand RIF-FLD semantic multi-structures. ☐
Logic programming dialects often use the following notion of minimal Herbrand RIF-FLD models.
Definition (Minimal Model with Respect to the Truth Order). Let Γ be a ground RIF-FLD document. A Herbrand RIF-FLD semantic multi-structure Î that is a model of Γ is said to be a minimal model in the truth order <_{t} of Γ if there is no other Herbrand RIF-FLD model Î' of Γ such that:
for every formula φ of the form L or Neg L, where L is a ground atomic formula. Dialects may further specialize this notion by imposing additional restrictions. ☐
Least semantic structures, defined below, are often used in the definitions of various fixpoint operators as starting points of the iteration process that computes the least fixpoint.
Definition (Least Herbrand Structure with Respect to the Truth Order). A Herbrand RIF-FLD semantic structure I is said to be the least in the truth order iff I_{true} maps every element of the Herbrand domain to f except for those elements that correspond to tautological formula terms (for example, And()) -- these are mapped to t. Dialects might have additional requirements. For example, some elements of the Herbrand domain might be "tautologically undefined," i.e., always mapped to u. ☐
The standard definitions of the well-founded semantics typically employ so-called "empty" semantic structures -- structures where everything that can be undefined is undefined. The following definition adapts this concept to RIF-FLD. It applies to dialects that have a special undefinedness truth value u such that f <_{t} u <_{t} t. The usual general definition for u is that it is the smallest element in TV with respect to the knowledge order <_{k} -- an order on the sets of truth values, which is sometimes used in addition to the truth order [Fit02]. In many cases, however, the mention of <_{k} is omitted as, for example, in the case of the well-founded semantics (where it is implicitly assumed that u <_{k} f and u <_{k} t) and in the case of stable models (where <_{k} is an empty relation).
Definition (Empty Herbrand Structure). Let I be a Herbrand RIF-FLD semantic structure with the set of truth values TV that has a special undefinedness truth value u such that f <_{t} u <_{t} t. Then I is said to be empty iff I_{true} maps everything to u except for the elements of the Herbrand domain that correspond to tautological formula terms (for example, And()), which are mapped to t; and elements of the domain that correspond to unsatisfiable formulas (e.g., Or()), which are mapped to f. Dialects may have additional requirements. For example, some elements of the Herbrand domain might always have some other truth values specific to the particular dialects. ☐
The above concepts were defined exclusively of ground RIF-FLD documents, but practically interesting RIF documents are usually non-ground. A typical mechanism by which non-ground documents are reduced to the ground ones is called ground instantiation. It applies only to universal RIF-FLD documents.
Definition (Universal RIF-FLD Document). A RIF-FLD document is universal if it has the form Document(directive_{1} ... directive_{n} Γ) or Document(directive_{1} ... directive_{n}). In the former case, when the group formula Γ is present, Γ must be a universal formula.
A non-group, non-document formula is universal if it has the form Forall ?V_{1} ... ?V_{n}(η), where η has no quantifiers and all of its variables are among ?V_{1} ... ?V_{n}. A group formula Group(φ_{1} ... φ_{n}) is universal if either n=0 (i.e., it is an empty group formula) or each φ_{i} is universal. ☐
Ground instantiations are now defined as follows.
Definition (Ground Instantiations). Let Γ be a universal RIF-FLD document. Its ground instantiation is a set of RIF-FLD documents obtained from Γ by replacing every RIF-FLD non-group formula in Γ that is a direct subformula of a group formula with the set of all their ground instances.
A universal formula φ is said to be a ground instance of another formula, ψ, if and only if φ is obtained from ψ by a coherent replacement of variables with ground terms in HU. Coherence here means that, while constructing φ from ψ, the same variables are always substituted with the same terms. (Note: I_{V}(ψ) is a ground instance of ψ, but there can be many others, since variables can be mapped to arbitrary ground terms in HU.) ☐
Note that according to the definition of the truth valuation, TVal_{I}(φ) = ~TVal_{I}(Naf φ), i.e., when φ is true then Naf φ is false, and vice versa (and, for example, when one is undefined in three-valued semantics then so is the other). However, RIF-FLD imposes no constraints on Neg φ. Many logic programming theories require consistency of the Herbrand models, and the following definition is provided for the use by the corresponding dialects. However, the definitions in this section do not rely on this consistency assumption.
Definition (Consistent Semantic Structure). A Herbrand RIF-FLD semantic structure I is said to be consistent if TVal_{I}(φ) and TVal_{I}(Neg φ) are not both t (which is equivalent to saying that I_{true}(I(φ)) and I_{true}(I(Neg φ)) are not both t). However, they can both be f (or, for example, u, in three-valued dialects). A semantic multi-structure is consistent if all its component semantic structures are consistent. ☐
This appendix summarizes the main changes to this document.
Changes since the draft of July 3, 2009.
Changes since the Candidate Recommendation of October 1, 2009.
Changes since the Recommendation of June 22 2010.