9 search results - page 1 / 2 » cade 1999 |
152
Voted
CADE
1999
Springer
15 years 5 months ago
1999
Springer
103
Voted
CADE
1999
Springer
15 years 5 months ago
1999
Springer
84
Voted
CADE
1999
Springer
15 years 5 months ago
1999
Springer
98
Voted
CADE
1999
Springer
15 years 5 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...
106
Voted
CADE
1999
Springer
15 years 5 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 ...