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.
Standard completeness for extensions of MTL: An automated approach / P. Baldi, A. Ciabattoni, L. Spendier (LECTURE NOTES IN ARTIFICIAL INTELLIGENCE). - In: Logic, Language, Information and Computation / [a cura di] L. Ong, R. de Queiroz. - [s.l] : Springer, 2012. - ISBN 978-3-642-32620-2. - pp. 154-167 (( Intervento presentato al 19. convegno International Workshop on Logic, Language, Information and Computation, WoLLIC tenutosi a Buenos Aires nel 2012 [10.1007/978-3-642-32621-9_12].
Standard completeness for extensions of MTL: An automated approach
P. Baldi
;
2012
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.
| File | Dimensione | Formato | |
|---|---|---|---|
|
Baldi2012_Chapter_StandardCompletenessForExtensi.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
280.15 kB
Formato
Adobe PDF
|
280.15 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
