Warning:
This wiki has been archived and is now read-only.
Named Argument Uniterms non-polymorphic
From RIF
Test Type | NegativeEntailmentTest | ||||
---|---|---|---|---|---|
Contributor | Dave Reynolds | ||||
Status | Approved | ||||
Record | Telecon 20 April 2010 | ||||
Dialect | BLD | ||||
Purpose | Illustrate difference between frames and named-argument uniterms | ||||
Description | Named argument uniterms with the same predicate symbol but different arities represent distinct predicates and so pattern p(a->?) will not match a fact p(a->foo,b->bar), whereas Frames are essentially syntactic sugar for an open set of binary predicates and so such partial patterns do match. | ||||
SeeAlso | Frame_slots_are_independent | ||||
SpecRef | http://www.w3.org/2005/rules/wiki/BLD#Well-formed_Formulas | ||||
Premises |
|
||||
Non-conclusion |
|