β Scribed by Churn Jung Liau; Bertrand I-peng Lin
No coin nor oath required. For personal study only.
In this paper, we present an alternative approach to the generalization of circumscription. Traditionally, the generalization of circumscription involves the change of ordering among models, while in the present study we only try to generalize the minimality criteria of models. We define the notion of abstractly minimal (or (P, Z)-minimal) models by isomorphism. Under this generalization we come up with the fact that some theories which are unsatisfiable in the original circumscription will be satisfiable now. Moreover, we prove that this generalization is completely coincident with the original circumscription in the case of well-founded theories.
π SIMILAR VOLUMES
We compare two forms of non-monotonic reasoning: closed-worm evaluation of queries in databases and circumscription. For closed E-saturated databases we show that the closed-world assumption, if consistent, is equivalent to circumscribing all predicates in the database.