Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability

Reijo Jaakkola

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

21 Downloads (Pure)

Fingerprint

Dive into the research topics of 'Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability'. Together they form a unique fingerprint.

Keyphrases

Computer Science