Circumscription: Completeness reviewed
โ Scribed by Manfred Jaeger
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 433 KB
- Volume
- 60
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper we demonstrate that some results on the completeness of P-defining theories published earlier are incorrect. We point out that by restricting the original propositions to well-founded theories results somewhat weaker than the original ones can be retained. We also present a theorem that provides some insight into the relation between completeness and reducibility and helps to identify the theories whose minimal models can be adequately handled with circumscription.
๐ SIMILAR VOLUMES
This paper deals with computing circumscription in the case of Horn data with additional protection (indefinite data), an intermediate investigation between Reiter's result on predicate completion and Lifschitz's efforts to make general (formula) circumscription more efficient as a computational too
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