 		[(old->new A) (set (map #(substitute % old->new) def-A))]))
      old->new]))
 
-(defn- conjunctors
-  "Returns the elements of the dl-expression connected by
-  conjunction. If the dl-expression is not a conjunction the singelton
-  set containing the expression is returned."
-  [dl-expr]
-  (if (and (compound? dl-expr)
-	   (= 'and (operator dl-expr)))
-    (set (arguments dl-expr))
-    (set [dl-expr])))
-
 (defn- tbox->hash-map
   "Transforms given TBox to a hash-map of defined concepts to the sets
   of concepts in the top-level conjunction."

    (.write out (.trim output))))

;;; Normalizing

(defn- uniquify-tbox-map
  "Renames all defined concepts in the given tbox-map to be globally

  [tbox-map]
  (if (empty? tbox-map)
    tbox-map
    (let [new-names (new-names),
	  ;; doall needed to store new names in new-names!
	  normalized-map (doall (map (fn [[A def-A]]
				       [A (set (map #(normalize-term % new-names) def-A))])
				     tbox-map)),
	  new-names-map (introduce-auxiliary-definitions (get-names new-names))]
      (into normalized-map new-names-map))))

;; normalizing algorithm -- squeezing the concept graph

;; normalizing algorithm -- invokaction point

(defn- normalize-gfp
  "Normalizes given TBox with gfp-semantics."
