Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
We consider computational issues in combining logical knowledge bases represented by their characteristic models; in particular, we study taking their logical intersection. We present efficient algorithms or prove intractability for the major computation problems for Horn knowledge bases. We also consider an extension of Horn theories, for which negative results are obtained. They indicate that generalizing the positive results beyond Horn theories is not immediate.