Constraint Programming for Modelling and Solving Modal Satisfability

Sebastian Brand, Rosella Gennari, Maarten de Rijke

Abstract: We explore to what extent and how efficiently constraint programming can be used in the context of automated reasoning for modal logics. We encode modal satisfiability problems as constraint satisfaction problems with non-boolean domains, together with suitable constraints. Experiments show that the approach is very promising.