CADE
1999
Springer
13 years 8 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
CADE
1999
Springer
13 years 8 months ago
1999
Springer
CADE
1999
Springer
13 years 8 months ago
1999
Springer
CADE
1999
Springer
13 years 8 months ago
1999
Springer
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...
CADE
2000
Springer
13 years 9 months ago
2000
Springer
CADE
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
CADE
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
CADE
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. While there has been a great deal of work on the development of reasoning algorithms for expressive description logics, in most cases only Tbox reasoning is considered. I...
CADE
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. The little theories method, in which mathematical reasoning is distributed across a network of theories, is a powerful technique for describing and analyzing complex syst...
CADE
2000
Springer
13 years 9 months ago
2000
Springer
