((a b ...)

       (and (null? (filter

                     (lambda (t)

                     b))

            (compatible? b)))))

           (valid-subclasses? graph)))

      ((_ graph ...)

       (valid-subclasses? graph))))

;; G entails E if E has an instance (where blank nodes are replaced by literals

;; or IRIs) that is a subgraph of G.

              (map

                (lambda (t)

                  (make-rdf-triple t (rdf-iri "type") (rdfs-iri "Datatype")))

         (g (append

              (append-map rdfs-axioms-container (rdf-container-properties g))

              g)))

                           added? augment-set)

               (let ((p (rdf-triple-predicate t)))

                 (cond

                    (inner-loop (cons t graph) (cons t subclasses) subprops

                                ranges domains types #t augment-set))

                    (inner-loop (cons t graph) subclasses (cons t subprops)

                                ranges domains types #t augment-set))

                    (inner-loop (cons t graph) subclasses subprops

                                (cons t ranges) domains types #t augment-set))

                    (inner-loop (cons t graph) subclasses subprops

                                ranges (cons t domains) types #t augment-set))

                    (inner-loop (cons t graph) subclasses subprops

                                ranges domains (cons t types) #t augment-set))

                   (else

;;     be well-formed according to section 2.2.9 of [BCP47].

(define-record-type rdf-literal

  rdf-literal?

  (lexical-form rdf-literal-lexical-form)

  (type         rdf-literal-type)

;; From the specification:

;;   Blank nodes are disjoint from IRIs and literals.  Otherwise, the set of