Abstract
We present a graph-based decision procedure for Gödel-Dummett logics and an algorithm to compute countermodels. A formula is transformed into a conditional bicolored graph in which we detect some specific cycles and alternating chains using matrix computations. From an instance graph containing no such cycle, (resp. no (n + 1)-alternating chain) we extract a countermodel in LC, (resp. LC n ).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Avellone, A., Ferrari, M., Miglioli, P.: Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics. Log. J. IGPL 7(4), 447–480 (1999)
Avron, A.: A tableau system for Gödel-Dummett logic based on a hypersequent calculus. In: TABLEAUX 2000. Lecture Notes in Artificial Intelligence, vol. 1847, pp. 98–111. Springer, Berlin Heidelberg New York (2000)
Avron, A., Konikowska, B.: Decomposition proof systems for Gödel-Dummett logics. Stud. Log. 69(2), 197–219 (2001)
Baaz, M., Ciabattoni, A., Fermüller, C.: Cut-elimination in a sequents-of-relations calculus for Gödel logic. In: ISMVL 2001. pp. 181–186. IEEE Computer Society, Los Alamitos, CA (2001)
Baaz, M., Ciabattoni, A., Fermüller, C.: Hypersequent calculi for Gödel logics – a survey. J. Log. Comput. 13(6), 835–861 (2003)
Ciabattoni, A., Fermüller, C., Metcalfe, G.: Uniform rules and dialogue games for fuzzy logics. In: LPAR 2004. Lecture Notes in Computer Science, vol. 3452, pp. 496–510. Springer, Berlin Heidelberg New York (2004)
Dummett, M.: A propositional calculus with a denumerable matrix. J. Symb. Log. 24, 96–107 (1959)
Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. J. Symb. Log. 57(3), 795–807 (1992)
Dyckhoff, R.: A deterministic terminating sequent calculus for Gödel-Dummett logic. Log. J. IGPL 7(3), 319–326 (1999)
Gödel, K.: Zum intuitionistischen aussagenkalkül. Anz. Akad. Wiss. Wien 69, 65–66 (1932)
Hajek, P.: Metamathematics of Fuzzy Logic. Kluwer, Dordrecht, The Netherlands (1998)
Larchey-Wendling, D.: Combining proof-search and counter-model construction for deciding Gödel-Dummett logic. In: CADE-18. Lecture Notes in Artificial Intelligence, vol. 2392, pp. 94–110. Springer, Berlin Heidelberg New York (2002)
Larchey-Wendling, D.: Counter-model search in Gödel-Dummett logics. In: IJCAR 2004. Lecture Notes in Artificial Intelligence, vol. 3097, pp. 274–288. Springer, Berlin Heidelberg New York (2004)
Larchey-Wendling, D.: Bounding resource consumption with Gödel-Dummett logics. In: LPAR 2005, Lecture Notes in Artificial Intelligence, vol. 3835, pp. 682–696. Springer, Berlin Heidelberg New York (2005a)
Larchey-Wendling, D.: Gödel-Dummett counter-models through matrix computation. Electron. Notes Theor. Comp. Sci. 125(3), 137–148 (2005b)
Metcalfe, G., Olivetti, N., Gabbay, D.: Goal-directed calculi for Gödel-Dummett logics. In: CSL’03. Lecture Notes in Computer Science, vol. 2803, pp. 413–426. Springer, Berlin Heidelberg New York (2003)
Warshall, S.: A theorem on Boolean matrices. J. ACM. 9(1), 11–12 (1962)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Larchey-Wendling, D. Graph-based Decision for Gödel-Dummett Logics. J Autom Reasoning 38, 201–225 (2007). https://doi.org/10.1007/s10817-006-9047-9
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10817-006-9047-9