@prefix rdf:  <http://www.w3.org/1999/02/22-rdf-syntax-ns#>.
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#>.
@prefix daml: <http://www.daml.org/2000/10/daml-ont#>.
@prefix nph:  <http://www.w3.org/2001/04/18/noun-phrase-names#>.
@prefix set:  <http://www.w3.org/2001/04/18/set#>.
@prefix tmpl: <http://www.w3.org/2001/04/18/template#>.
@prefix :     <http://www.w3.org/2001/04/18/rule#>.


:Rule a rdf:class;
      rdf:description 
"""I believe this kind of rule to have the minimum expressive power to
express the equivalence of templates (subgraph patterns) with
different structures.  I also believe it is equivalent to full
first-order logic.  Moreover, since the rule itself exists in the
same domain as it operates, it is really a higher-order logic.  One
need not apply it in that manner, however, and I chose to have my
software not even attempt to determine whether something is implied in
a higher-order sense.""".
      
:premise a rdfs:property;
    rdfs:domain :Rule;
    rdfs:range tmpl:Template.

:conclusion a rdfs:property;
    rdfs:domain :Rule;
    rdfs:range tmpl:Template.