Modal Satisfiability via SMT Solving - Archive ouverte HAL Access content directly
Book Sections Year : 2015

Modal Satisfiability via SMT Solving


Modal logics extend classical propositional logic, and they are robustly decidable. Whereas most existing decision procedures for modal logics are based on tableau constructions, we propose a framework for obtaining decision procedures by adding instantiation rules to standard SAT and SMT solvers. Soundness, completeness, and termination of the procedures can be proved in a uniform and elementary way for the basic modal logic and some extensions.
Fichier principal
Vignette du fichier
main.pdf (194.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01127966 , version 1 (09-03-2015)



Carlos Areces, Pascal Fontaine, Stephan Merz. Modal Satisfiability via SMT Solving. Software, Services, and Systems. Essays Dedicated to Martin Wirsing on the Occasion of His Retirement from the Chair of Programming and Software Engineering, 8950, Springer, pp.30-45, 2015, Lecture Notes in Computer Science, ⟨10.1007/978-3-319-15545-6_5⟩. ⟨hal-01127966⟩
171 View
143 Download



Gmail Facebook Twitter LinkedIn More