Warning:
This wiki has been archived and is now read-only.

View source for Named Argument Uniterms non-polymorphic

← Named Argument Uniterms non-polymorphic

Jump to: navigation, search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in one of the groups: Users, 106, 38457-chairs.

You can view and copy the source of this page.

{{TestCase
|type=NegativeEntailmentTest
|author=[[Dave Reynolds]]
|status=Approved
|approval=[http://www.w3.org/2010/04/20-rif-irc#T16-28-25 Telecon 20 April 2010]
|dialect=BLD
|specRef=http://www.w3.org/2005/rules/wiki/BLD#Well-formed_Formulas
|purpose=Illustrate difference between frames and named-argument uniterms
|desc=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.<br/> 
|seeAlso=[[Frame_slots_are_independent]]  
|pformat=[[Presentation Syntax]]
|premise=
 Document(
  Prefix(ex   <http://example.org/example#>)
  
  Group  (
    ex:p(a->1 b->2)
  ) 
)
|cformat=[[Presentation Syntax]]
|conc=
  ex:p(a->1)
}}

Template used on this page:

Template:TestCase (view source)

Return to Named Argument Uniterms non-polymorphic.

Retrieved from "https://www.w3.org/2005/rules/wiki/Named_Argument_Uniterms_non-polymorphic"

View source for Named Argument Uniterms non-polymorphic

Navigation menu

Personal tools

Namespaces

Variants

Views

More

RIF Working Group

publications

Tools