Modal logic is a widely applicable method of reasoning for many areas of computer science. These areas include artificial intelligence, database theory, distributed systems, program verification, and cryptography theory. Modal logic operators contain propositional logic operators, such as conjunction and negation, and operators that can have the following meanings: "it is necessary that," "after a program has terminated," "an agent knows or believes that," "it is always the case that," etc. Computer scientists have examined the difficulty of problems in modal logic, such as satisfiability. Satisfiability determines whether a formula in a given logic is satisfiable. The complexity of satisfiability in modal logic has a wide range. Depending on how a modal logic is restricted, the complexity can be anywhere from NP-complete to highly undecidable. This project gives an introduction to common variations of modal logic in computer science and their complexity results.
Department, Program, or Center
Computer Science (GCCIS)
van Wie, Michael
Lambert, Leigh, "Modal logic in computer science" (2006). Thesis. Rochester Institute of Technology. Accessed from
RIT – Main Campus
Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2013.