As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
In the last two decades, modal and description logics have provided a theoretical framework for important applications in many areas of computer science. For this reason, the problem of automated reasoning in modal and description logics has been thoroughly investigated. In this chapter we show how efficient Boolean reasoning techniques have been imported, used and integrated into reasoning tools for modal and description logics. To this extent, we focus on modal logics, and in particular mainly on K(m). In particular, we provide some background in modal logics; we describe a basic theoretical framework and we present and analyze the basic tableau-based and DPLL-based techniques; we describe optimizations and extensions of the DPLL-based procedures; we introduce the automata-theoretic/OBDD-based approach; finally, we present the eager approach.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.