- M. Praveen:
Does Treewidth Help in Modal Satisfiability? - (Extended Abstract). MFCS 2010: 580-591 - M. Praveen:
Does Treewidth Help in Modal Satisfiability? CoRR abs/1006.2461 (2010) - 2009
- Roberto Sebastiani, Michele Vescovi:
Automated Reasoning in Modal and Description Logics via SAT Encoding: the Case Study of K(m)/ALC-Satisfiability. J. Artif. Intell. Res. 35: 343-389 (2009) - Yevgeny Kazakov, Ian Pratt-Hartmann:
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. LICS 2009: 407-416 - Roberto Sebastiani, Armando Tacchella:
SAT Techniques for Modal and Description Logics. Handbook of Satisfiability 2009: 781-824 - Yevgeny Kazakov, Ian Pratt-Hartmann:
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics. CoRR abs/0905.3108 (2009) - Antonis Achilleos, Michael Lampis, Valia Mitsou:
Parameterized Modal Satisfiability. CoRR abs/0912.4941 (2009) - 2008
- Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Generalized Modal Satisfiability. CoRR abs/0804.2729 (2008) - 2007
- Joseph Y. Halpern, Leandro Chaves Rêgo:
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic. J. Log. Comput. 17(4): 795-806 (2007) - Joseph Y. Halpern, Leandro Chaves Rêgo:
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic. IJCAI 2007: 2306-2311 - 2006
- Roberto Sebastiani, Michele Vescovi:
Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ALC. SAT 2006: 130-135 - Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Generalized Modal Satisfiability. STACS 2006: 500-511 - Joseph Y. Halpern, Leandro Chaves Rêgo:
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic. CoRR abs/cs/0603019 (2006) - 2004
- Franz Baader, Stephan Tobies:
The Inverse Method Implements the Automata Approach for Modal Satisfiability. CoRR abs/cs/0412101 (2004) - 2003
- Sebastian Brand, Rosella Gennari, Maarten de Rijke:
Constraint Methods for Modal Satisfiability. CSCLP 2003: 66-86 - Christof Löding, Philipp Rohde:
Model Checking and Satisfiability for Sabotage Modal Logic. FSTTCS 2003: 302-313 - 2002
- Ian Horrocks, Peter F. Patel-Schneider:
Evaluating Optimized Decision Procedures for Propositional Modal K(m) Satisfiability. J. Autom. Reason. 28(2): 173-204 (2002) - Ullrich Hustadt, Renate A. Schmidt:
Using Resolution for Testing Modal Satisfiability and Building Models. J. Autom. Reason. 28(2): 205-232 (2002) - Marcus Kracht:
Notes on the Space Requirements for Checking Satisfiability in Modal Logics. Advances in Modal Logic 2002: 243-264 - Jean-Marie Le Bars:
The 0-1 law fails for frame satisfiability of propositional modal logic. LICS 2002: 225-234 - 2001
- Enrico Giunchiglia, Armando Tacchella:
A Subset-Matching Size-Bounded Cache for Testing Satisfiability in Modal Logics. Ann. Math. Artif. Intell. 33(1): 39-67 (2001) - Franz Baader, Stephan Tobies:
The Inverse Method Implements the Automata Approach for Modal Satisfiability. IJCAR 2001: 92-106 - 2000
- Edith Hemaspaandra:
Modal Satisfiability Is in Deterministic Linear Space. CSL 2000: 332-342 - Enrico Giunchiglia, Armando Tacchella:
A Subset-Matching Size-Bounded Cache for Satisfiability in Modal Logics. TABLEAUX 2000: 237-251 - 1998
- Ian Horrocks, Peter F. Patel-Schneider:
Optimising Propositional Modal Satisfiability for Description Logic Subsumption. AISC 1998: 234-246 - 1994
- Cheng-Chia Chen, I-Peng Lin:
The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics. Theor. Comput. Sci. 129(1): 95-121 (1994) - 1987
- Luis Fariñas del Cerro, Martti Penttonen:
A Note of the Complexity of the Satisfiability of Modal Horn Clauses. J. Log. Program. 4(1): 1-10 (1987)