Circumscripte Skelerodermie
โ Scribed by Chr. Eberhartinger
- Publisher
- Springer-Verlag
- Year
- 1957
- Tongue
- English
- Weight
- 76 KB
- Volume
- 206
- Category
- Article
- ISSN
- 0340-3696
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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 tha
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 [6], a generalization of first-order logic was introduced that led to the development of an effective theorem prover for some simple sorts of default reasoning. In this paper, we show that these ideas can also be used to construct a theorem prover for a wide class of circumscriptive theories. Th
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