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
A full theorem-prover under uncertainty
β Scribed by G. Papakonstantinou; T. Panayiotopoulos
- Publisher
- Springer Netherlands
- Year
- 1993
- Tongue
- English
- Weight
- 635 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0921-0296
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we present the results of an ongoing effort in building user interfaces for proof systems. Our approach is generic: we are not constructing a user interface for a particular proof system, rather we have developed techniques and tools that have been applied to several proof systems. We
The mechanisation of the real numbers within theorem provers is of practical benefit for the verification of real-time systems. The real numbers provide a foundation within the theorem prover for classical mathematical analysis such as differentiation and integration. The approach we have taken make