How to optimize proof-search in modal logics: new methods of proving redundancy criteria for sequent calculi

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> ACM Transactions on Computer Logic

How to optimize proof-search in modal logics: new methods of proving redundancy criteria for sequent calculi

Andrei Voronkov

Journal Title: ACM Transactions on Computer Logic

Date: 2001

Volume: 2

Issue: 2

p. 182 - 215

We have been looking for this document on the Web. We think we have found the following, freely available version(s) of it:

http://www.cs.man.ac.uk/~voronkov/papers/acmtocl_modal.ps

For further information about this item go to:

http://doi.acm.org/10.1145/371316.371511

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12