®®®® SIIA Público

Título del libro: Proceedings - 2023 11th International Conference In Software Engineering Research And Innovation, Conisoft 2023
Título del capítulo: A satisfiability algorithm for multimodal logic with converse

Autores UNAM:
DIEGO ROBERTO MEDINA MARTINEZ; ISMAEL EVERARDO BARCENAS PATIÃ?O; ROCIO ALEJANDRA ALDECO PEREZ; GUILLERMO GILBERTO MOLERO CASTILLO; ALEJANDRO VELAZQUEZ MENA;
Autores externos:

Idioma:

Año de publicación:
2023
Palabras clave:

Computer circuits; Computer programming languages; Formal logic; Knowledge representation; Trees (mathematics); Database programming languages; Knowledge-representation; Modal logic; Model properties; Multi-modal logic; Property; SAT algorithm; Satisfiability; Satisfiability algorithms; Tree modeling; Formal languages


Resumen:

Modal logics as formal languages has many ap-plications in computer science, such as in formal verification, databases, programming languages, knowledge representation. Converse modalities are specially purposed constructors that allow modeling reverse properties, for instance, in temporal logics converse modalities are interpreted as past operators. In this paper, we propose a satisfiability algorithm for the traditional multimodal logic with converse. The algorithm is based on the tree-model property, that is, if a formula is satisfiable, then the algorithm provides a tree model of it, otherwise the algorithm outputs it is not satisfiable. We also implemented it with dynamic data structures in order to improve the execution time. Furthermore, several benchmark experiments are also provided. © 2023 IEEE.


Entidades citadas de la UNAM: