Abstract
In this paper we will present an implementation of a theorem prover for substructural logics, as they are presented in the framework of Labelled Deductive Systems [3]. This implementation is an instance of a general theorem proving environment described in [4].
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Leo Bachmair, H. Gazinger, and U. Waldmann. Refutational theorem proving for hierarchic first-order theories. Applicable Algebra in Engineering, Communication and Computing, 5:193–212, 1994.
Marcello D'Agostino and Dov M. Gabbay. A generalization of analytic deduction via labelled deductive systems. part I: basic substructural logics. Journal of Automated Reasoning, 13, 1994. To appear.
Dov Gabbay. Labelled deductive systems — part i. 5th Draft, Dec 1990. To be published by Oxford University Press.
Claudia Oliveira. An Architecture for Labelled Theorem Proving. PhD thesis, University of London — Imperial College, 1995.
Mark E. Stickel. Automated deduction by theory resolution. Journal of Automated Reasoning, 1:333–355, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oliveira, C.M.G.M. (1995). Labelled theorem proving for substructural logics. In: Wainer, J., Carvalho, A. (eds) Advances in Artificial Intelligence. SBIA 1995. Lecture Notes in Computer Science, vol 991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034801
Download citation
DOI: https://doi.org/10.1007/BFb0034801
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60436-5
Online ISBN: 978-3-540-47467-8
eBook Packages: Springer Book Archive