Abstract
MUltlog is a system which takes as input the specification of a finitely-valued first-order logic and produces a sequent calculus, a natural deduction system, and a calculus for transforming a many-valued formula to clauses suitable for many-valued resolution. All generated rules are optimized regarding their branching degree. The output is in the form of a scientific paper, written in LATEX.
Supported by FWF grant P10282-MAT.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Baaz and C. G. Fermüller. Resolution-based theorem proving for many-valued logics. J. Symbolic Computation, 19:353–391, 1995.
M. Baaz, C. G. Fermüller, A. Ovrutcki, and R. Zach. MULTLOG: A system for axiomatizing many-valued logics. In A. Voronkov, editor, Logic Programming and Automated Reasoning (LPAR'93), LNCS 698 (LNAI), pages 345–347. Springer, 1993.
M. Baaz, C. G. Fermüller, and R. Zach. Systematic construction of natural deduction systems for many-valued logics. In Proc. 23rd International Symposium on Multiple-valued Logic, pages 208–215. IEEE Computer Society Press, Los Alamitos, May 24–27 1993.
M. Baaz, C. G. Fermüller, and R. Zach. Elimination of cuts in first-order finitevalued logics. J. Inform. Process. Cybernet. (EIK), 29(6):333–355, 1994.
M. Baaz and R. Zach. Approximatig prepositional calculi by finite-valued logics. In Proc. 24th International Symposium on Multiple-valued Logic, pages 257–263. IEEE Press, Los Alamitos, May 25–27 1994.
W. A. Carnielli. Systematization of finite many-valued logics through the method of tableaux. J. Symbolic Logic, 52(2):473–493, 1987.
R. Hähnle. Automated Deduction in Multiple-valued Logics. Clarendon Press, Oxford, 1993.
R. Hähnle. Many-valued logic and mixed integer programming. Annals of Mathematics and Artificial Intelligence, 12(3,4):231–264, Dec. 1994.
R. Hähnle. Commodious axiomatization of quantifiers in multiple-valued logic. In Proc. 26th International Symposium on Multiple-Valued Logics, Santiago de Compostela, Spain. IEEE Press, Los Alamitos, May 1996.
G. Rousseau. Sequents in many valued logic I. Fund. Math., 60:23–33, 1967.
G. Salzer. Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices. In 13th Int. Conf. on Automated Deduction (CADE'96), LNCS (LNAI). Springer, 1996.
K. Schröter. Methoden zur Axiomatisierung beliebiger Aussagen-und Prädikatenkalküle. Z. Math. Logik Grundlag. Math., 1:241–251, 1955.
N. Zabel. Nouvelles Techniques de Déduction Automatique en Logiques Polyvalentes Finies et Infinies du Premier Ordre. PhD thesis, Institut National Polytechnique de Grenoble, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baaz, M., Fermüller, C.G., Salzer, G., Zach, R. (1996). MUltlog 1.0: Towards an expert system for many-valued logics. In: McRobbie, M.A., Slaney, J.K. (eds) Automated Deduction — Cade-13. CADE 1996. Lecture Notes in Computer Science, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61511-3_84
Download citation
DOI: https://doi.org/10.1007/3-540-61511-3_84
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61511-8
Online ISBN: 978-3-540-68687-3
eBook Packages: Springer Book Archive