Does Treewidth Help in Modal Satisfiability?

DOI10.1145/2499937.2499939zbMath1354.68133arXiv1006.2461OpenAlexW2149632978MaRDI QIDQ5892171

M. Praveen

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.2461

zbMATH Keywords

treewidthsatisfiabilityparameterized complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Parametrised Complexity of Satisfiability in Temporal Logic ⋮ Parameterized Complexity of CTL

This page was built for publication: Does Treewidth Help in Modal Satisfiability?