Constraint Programming for Modelling and Solving Modal Satisfiability


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 promisin

Similar works

Full text


Archivio della ricerca - Fondazione Bruno Kessler

Full text is not available time updated on 9/3/2019

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.