Yves Moinard Computing circumscription of Horn theories , ECAI'88 (European Conference on Artificial Intelligence) , Pitman Publishing , Munich , 513--515 , 1988 Abstract Circumscription and predicate completion deal with reasoning from incomplete information. Circumscription has a clear semantics but is hard to compute. Pointwise circumscription is only slightly easier to compute. If we circumscribe several predicates, the computational problems become harder. For Horn theories, we show that one joint circumscription of several predicates is equivalent to a conjunction of single circumscriptions. Also, there is equivalence between pointwise circumscription and predicate completion when no tautologous clause occurs. the proof needs a result which itself has a computational interest for any theory. This web site is maintained by René Quiniou using the Weave system from the Caravel project: http://www-caravel.inria.fr. Last modification: 10-07-2011 09:54:25