AIJ 1993
Circumscription
Abstract
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.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- Artificial Intelligence
- Archive span
- 1970-2026
- Indexed papers
- 3976
- Paper id
- 808084457308226203