Chaining strategy numeric-add 1

From RIF
Revision as of 12:57, 2 February 2010 by StellaMitchell (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search




Test TypePositiveEntailmentTest
ContributorAxel Polleres
StatusApproved
RecordF2F11
DialectCore
PurposeThis test highlights the different behavior of forward-chaining vs. backward-chaining engines
DescriptionThe entailment holds, but some engines may have difficulty finding it and/or may behave badly with it. This particular test case may be hard to handle for backward-chaining engines, depending on their implementation of the func:numeric-add builtin. In a forward-chaining strategy, the entailment should be found, but since the minimal model itself is infinite, a naive engine, which tries to materialize the whole minimal model may not terminate.
SeeAlsoChaining_strategy_numeric-add_2

Chaining_strategy_numeric-subtract_1

Chaining_strategy_numeric-subtract_2
SpecRefhttp://www.w3.org/2005/rules/wiki/DTB#func:numeric-add_.28adapted_from_op:numeric-add.29
Premises
Presentation SyntaxDocument( Prefix(ex <http://example.org/example#>) Prefix(func <http://www.w3.org/2007/rif-builtin-function#>) Group ( Forall ?x ( ex:a(External(func:numeric-add(?x 1))) :- ex:a(?x) ) ex:a(1) ) )
XMLview RIF/XML
Conclusion
Presentation Syntaxex:a(3)
XMLview RIF/XML