Abstract
Fuzzy programming languages, such as the Fuzzy Arden Syntax (FAS), are used to describe behaviours which evolve in a fuzzy way and thus cannot be characterized neither by a Boolean outcome nor by a probability distribution. This paper introduces a semantics for FAS, focusing on the weighted parallel interpretation of its conditional statement. The proposed construction is based on the notion of a fuzzy multirelation which associates with each state in a program a fuzzy set of weighted possible evolutions. The latter is parametric on a residuated lattice which models the underlying semantic ‘truth space’. Finally, a family of dynamic logics, equally parametric on the residuated lattice, is introduced to reason about FAS programs.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Notes
Note that while the most common nomenclature for \(\leftarrow \) (\(\rightarrow \)) is right (left) division, we follow reference Kozen (1993), where \(\leftarrow \) (\(\rightarrow \)) is called left (right) residual.
Note that the system only suggests a modification in the value of PIP_inc and such alteration is carried out manually by some health professional.
References
Anand V, Carroll AE, Biondich PG, Dugan TM, Downs SM (2018) Pediatric decision support using adapted arden syntax. Artif Intell Med 92:15–23
Behounek L (2008) Modeling costs of program runs in fuzzified propositional dynamic logic. In: Hakl F (ed) Doktorandské dny 08. ICS AS CR and Matfyzpress, pp 6–14
Blok WJ, Ferreirim I (2000) On the structure of hoops. Algebra Univ 43:233–257
Bou F, Esteva F, Godo L, Rodríguez R (2011) On the minimum many-valued modal logic over a finite residuated lattice. J Logic Comput 21:739–790
Caicedo X, Rodriguez R (2010) Standard Gödel modal logics. Stud Logica 94:189–214
Cingolani P, Alcalá-fdez J (2013) jFuzzyLogic: a java library to design fuzzy logic controllers according to the standard for fuzzy control programming. Int J Comput Intell Syst 6:61–75
den Hartog J, de Vink EP (2002) Verifying probabilistic programs using a Hoare like logic. Int J Found Comput Sci 13(3):315–340
Di Nola A, Grigolia R, Vitale G (2020) Dynamic Łukasiewicz logic and dynamic MV-algebras. Int J Approx Reason 124:103–110
Fischer MJ, Ladner RE (1979) Propositional dynamic logic of regular programs. J Comput Syst Sci 18(2):194–211
Foster N, Kozen D, Mamouras K, Reitblatt M, Silva A (2016) Probabilistic NetKAT. In: Thiemann P (ed) Programming languages and systems—ESOP 2016, Held as Part of ETAPS 2016, Eindhoven, The Netherlands, Proceedings, volume 9632 of LNCS. Springer, Berlin, pp 282–309
Furusawa H, Kawahara Y, Struth G, Tsumagari N (2017) Kleisli, Parikh and Peleg compositions and liftings for multirelations. J Loginc Algebraic Methods Program 90:84–101
Furusawa H, Struth G (2015) Concurrent dynamic algebra. ACM Trans Comput Logic 16(4):30:1–30:38
Galatos N, Jipsen P, Kowalski T, Ono H (2007) Residuated Lattices: an algebraic glimpse at substructural logics. Elsevier, Amsterdam
Gomes L, Madeira A, Barbosa LS (2019) Generalising KAT to verify weighted computations. Sci Ann Comput Sci 29(2):141–184
Hansoul G, Teheux B (2013) Extending Łukasiewicz logics with a modality: algebraic approach to relational semantics. Studia Logica 101
Harel D, Kozen D, Tiuryn J (2000) Dynamic logic. MIT Press, Cambridge
Hoare T, Möller B, Struth G, Wehrman I (2011) Concurrent Kleene algebra and its foundations. J Logic Algebraic Methods Program 80(6):266–296
Hughes J, Kimiaghalam B (2006) Means-end relations and a measure of efficacy. J Logic Lang Inf 15:83–108
Hájek P (2010) On fuzzy modal logics s5(c). Fuzzy Sets Syst 161(18):2389–2396
Kozen D (1985) A probabilistic PDL. J Comput Syst Sci 30(2):162–178
Kozen D (1993) On action algebras. In: Logic and the flow of information. Amsterdam
Kozen D (1994) A completeness theorem for Kleene algebras and the algebra of regular events. Inf Comput 110:366–390
Kozen D (2000) On Hoare logic and Kleene algebra with tests. ACM Trans Comput Logic TOCL 1(212):1–14
Liau C-J (1999) Many-valued dynamic logic for qualitative decision theory. In: Zhong N, Skowron A, Ohsuga S (eds) New directions in rough sets, data mining, and granular-soft computing. Springer, Berlin, pp 294–303
Madeira A, Neves R, Martins MA (2016) An exercise on the generation of many-valued dynamic logics. J Log Algebraic Methods Program 1:1–29
McIver A, Gonzalia C, Cohen E, Morgan C (2008) Using probabilistic Kleene algebra for protocol verification. J Logic Algebraic Methods Program 76(1):90–111
McIver A, Rabehaja TM, Struth G (2013) Probabilistic concurrent Kleene algebra. In: Bortolussi L, Wiklicky H (eds) Proceedings QAPL 2013, Rome, Italy, volume 117 of EPTCS, pp 97–115
Parikh R (1983) Propositional game logic. In: 24th annual symposium on foundations of computer science, Tucson, Arizona, USA, 1983, SFCS’83. IEEE Computer Society, pp 195–200
Parikh R (1985) The logic of games and its applications. In: Karplnski M, van Leeuwen J (eds) Topics in the theory of computation, volume 102 of North-Holland mathematics studies. North-Holland, pp 111 – 139
Peleg D (1987) Concurrent dynamic logic. J ACM 34(2):450–479
Pratt VR (1991) Action logic and pure induction. In: van Eijck J (ed) Logics in AI, JELIA 1990 proceedings, volume 478 of LNCS (lecture notes in artificial intelligence). Springer, Berlin, pp 97–120
Prisacariu C (2010) Synchronous Kleene algebra. J Log Algebraic Methods Program 79(7):608–635
Qiao R, Wu J, Wang Y, Gao X (2008) Operational semantics of probabilistic Kleene algebra with tests. In: Proceedings—IEEE symposium on computers and communications, pp 706–713
Rewitzky I (2003) Binary multirelations. In de Swart HCM, Orlowska E, Schmidt G, Roubens M (eds) Theory and applications of relational structures as knowledge instruments, COST Action 274, TARSKI, revised papers, volume 2929 of Lecture notes in computer science. Springer, Berlin, pp 256–271
Rewitzky I, Brink C (2006) Monotone predicate transformers as up-closed multirelations. In: Schmidt RA (ed) Relations and Kleene algebra in computer science. Springer, Berlin, pp 311–327
Samwald M, Fehre K, de Bruin J, Adlassnig K-P (2012) The Arden Syntax standard for clinical decision support: experiences and directions. J Biomed Inform 45(4):711–718
Sedlár I (2020) Finitely-valued propositional dynamic logic. In: Olivetti N, Sandu G, Verbrugge R, Negri S (eds) Advances in modal logic, vol 13. College Publications, Bern, pp 561–579
Starren JB, Hripcsak G, Jordan D, Allen B, Weissman C, Clayton PD (1994) Encoding a post-operative coronary artery bypass surgery care plan in the Arden Syntax. Comput Biol Med 24(5):411–417
Teheux B (2014) Propositional dynamic logic for searching games with errors. J Appl Logic 12(4):377–394
Tsumagari N (2012) Probabilistic relational models of complete IL-semirings. Bull Inf Cybern 44:87–109
Vetterlein T, Mandl H, Adlassnig K-P (2010) Fuzzy Arden syntax: a fuzzy programming language for medicine. Artif Intell Med 49(1):1–10
Zadeh LA (1965) Fuzzy sets. Inf Control 8(3):338–353
Acknowledgements
This work was founded by the ERDF—European Regional Development Fund through the Operational Programme for Competitiveness and Internationalisation—COMPETE 2020 Programme and by National Funds through the Portuguese funding agency, FCT—Fundação para a Ciência e a Tecnologia, within projects POCI-01-0145-FEDER-030947 and POCI-01-0145-FEDER-029946
Author information
Authors and Affiliations
Contributions
The three authors contributed to the planning, design and writing of the manuscript. The conception of the definitions, results and correspondent proofs were regularly discussed by the three authors. The first draft of the manuscript was written by Leandro Rafael Moreira Gomes, and all authors read and comment on each version and future directions to take. The final version was read and approved by all authors.
Corresponding author
Ethics declarations
Conflict of interest
The authors have no conflict of interest to declare.
Ethics approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Communicated by Tomas Veloz.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Gomes, L., Madeira, A. & Barbosa, L.S. A semantics and a logic for Fuzzy Arden Syntax. Soft Comput 25, 6789–6805 (2021). https://doi.org/10.1007/s00500-021-05593-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-021-05593-9