CADE
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. We present a theorem proving environment for the development of reliable and efficient group communication systems. Our approach makes methods of automated deduction appl...
CADE
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
CADE
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. The theorem prover Isabelle is used to formalise and reproduce some of the styles of reasoning used by Newton in his Principia. The Principia's reasoning is resolute...
CADE
1998
Springer
13 years 8 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
CADE
1998
Springer
13 years 8 months ago
1998
Springer
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
CADE
1998
Springer
13 years 8 months ago
1998
Springer
CADE
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
CADE
1999
Springer
13 years 8 months ago
1999
Springer
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
CADE
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. Twelf is a meta-logical framework for the specification, implementation, and meta-theory of deductive systems from the theory of programming languages and logics. It rel...
CADE
1999
Springer
13 years 8 months ago
1999
Springer