16 search results - page 2 / 4 » cade 2002 |
14
Voted
CADE
2002
Springer
14 years 6 months ago
2002
Springer
CADE
2002
Springer
14 years 6 months ago
2002
Springer
The reflection theorem has been proved using Isabelle/ZF. This theorem cannot be expressed in ZF, and its proof requires reasoning at the meta-level. There is a particularly elegan...
CADE
2002
Springer
14 years 6 months ago
2002
Springer
In this paper we define a new clausal class, called BU, which can be decided by hyperresolution with splitting. We also consider the model generation problem for BU and show that h...
CADE
2002
Springer
14 years 6 months ago
2002
Springer
Abstract. Description Logics are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from simpler ...
CADE
2002
Springer
14 years 6 months ago
2002
Springer
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...