2013/08/27 by Matteo Mio, Alex Simpson
Computer Science · Mathematics · #Advanced Algebra and Logic #Algebra over a field #Artificial intelligence #Calculus (dental) #Computer science #Description logic #Discrete mathematics #Formal Methods in Verification #Logic, Reasoning, and Knowledge #Many-valued logic #Mathematics #Modal logic #Probabilistic CTL #Probabilistic analysis of algorithms #Probabilistic argumentation #Probabilistic logic #Pure mathematics #Situation calculus #Substructural logic #cs.DS #cs.LO #Łukasiewicz logic
paper · pdf · doi:10.4204/eptcs.126.7
published as EPTCS 126, 2013, pp. 87-104 · In Proceedings FICS 2013, arXiv:1308.5896
openalex publication_date 2013/08/27 · arxiv created 2013/09/04 · arxiv updated 2013/09/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
The paper explores properties of \Lukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from \Lukasiewicz (fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL. And we give a model-checking algorithm for computing the rational denotational value of a formula at any state in a finite rational probabilistic nondeterministic transition system.