Re: a problem with comprehensive entailments

Jonathan,

> Is there a way that you can place a finite boundary on the number of
times
> this back and forth will occur, that is, is there a way, using
comprehensive
> entailments, that you will be absolutely certain that the entailments are
> actually comprehensive? For example, suppose we decide to go with this
> approach, and then just after CR, for example, someone demonstrates yet
> another example of a paradox for which no easy rule can be developed.
What
> then?

well, I think it comes down to what you do with what you have derived
e.g.
  rdfs:Class a [ owl:complementOf [ a owl:Restriction; owl:onProperty
      rdf:type; owl:maxCardinality "0"; owl:hasClass
          rdfs:Class]]

is obtained via some entailment rules, but I think there
is no reason to ``assert such a graph i.e. I wouldn't
consider entailment rules as comprehension rules