Skip to main content
Conference Proceedings

Standard completeness for extensions of MTL: An automated approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7456 LNCS 154-167
DOI: 10.1007/978-3-642-32621-9_12
10Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We provide general conditions on hypersequent calculi that guarantee standard completeness for the formalized logics. These conditions are implemented in the PROLOG system AxiomCalc that takes as input any suitable axiomatic extension of Monoidal T-norm Logic MTL and outputs a hypersequent calculus for the logic and the result of the check. Our approach subsumes many existing results and allows for the computerized discovery of new fuzzy logics. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Baldi, P., Ciabattoni, A., & Spendier, L. (2012). Standard completeness for extensions of MTL: An automated approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7456 LNCS, pp. 154–167). https://doi.org/10.1007/978-3-642-32621-9_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free