Mu-calculus satisfiability with arithmetic constraints

DOI10.1134/S0361768820080137zbMath1467.68087OpenAlexW3117776591MaRDI QIDQ2226964

Y. Limón, Alejandro Velázquez-Mena, G. Molero Castillo, Everardo Bárcenas, Edgard Benítez-Guerrero

Publication date: 9 February 2021

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768820080137

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Algorithmic correspondence for intuitionistic modal mu-calculus
• XML applications development in scheme
• Complexity of modal logics with Presburger constraints
• The Complexity of Enriched Mu-Calculi
• Deciding Effectively Propositional Logic Using DPLL and Substitution Sets
• Global Numerical Constraints on Trees

This page was built for publication: Mu-calculus satisfiability with arithmetic constraints