|
Yves Moinard
Pointwise circumscription is equivalent to predicate completion (Sometimes)
, LP'88 (Int. Conf. on Logic Programming)
, MIT Press
, Seattle
, 1097--1105
, 1988
|
|
Abstract
Two ways of minimizing positive information are predicate completion, which comes from logic programming theory, and circumscription, which is one of the bets known methods of non-monotonic reasoning. here it is proved that, under certain hypotheses, there is equivalence between predicate completion and a special kind of circumscription.
|
|