Warning:
This wiki has been archived and is now read-only.
Chaining strategy numeric-add 1
From RIF
| Test Type | PositiveEntailmentTest | ||||
|---|---|---|---|---|---|
| Contributor | Axel Polleres | ||||
| Status | Approved | ||||
| Record | F2F11 | ||||
| Dialect | Core | ||||
| Purpose | This test highlights the different behavior of forward-chaining vs. backward-chaining engines | ||||
| Description | The 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. | ||||
| SeeAlso | Chaining_strategy_numeric-add_2 Chaining_strategy_numeric-subtract_1 | ||||
| SpecRef | http://www.w3.org/2005/rules/wiki/DTB#func:numeric-add_.28adapted_from_op:numeric-add.29 | ||||
| Premises |
|
||||
| Conclusion |
|