Does Treewidth Help in Modal Satisfiability?

  title={Does Treewidth Help in Modal Satisfiability?},
  author={M. Praveen},
  journal={ACM Trans. Comput. Log.},
Many tractable algorithms for solving the Constraint Satisfaction Problem (Csp) have been developed using the notion of the treewidth of some graph derived from the input Csp instance. In particular, the incidence graph of the Csp instance is one such graph. We introduce the notion of an incidence graph for modal logic formulas in a certain normal form. We investigate the parameterized complexity of modal satisfiability with the modal depth of the formula and the treewidth of the incidence… CONTINUE READING
4 Extracted Citations
12 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.

Similar Papers

Loading similar papers…