Does Treewidth Help in Modal Satisfiability? - (Extended Abstract).
M. PraveenPublished in: MFCS (2010)
Keyphrases
- extended abstract
- description logic alc
- modal logic
- bounded treewidth
- np complete
- satisfiability problem
- decision procedures
- search space
- propositional logic
- description logics
- space complexity
- upper bound
- boolean functions
- phase transition
- computational complexity
- sat problem
- discrete random variables
- nonmonotonic logics
- satisfiability testing
- neural network
- terminological reasoning
- tree decompositions
- propositional variables
- situation calculus
- first order logic