Satisfiability versus Finite Satisfiability in Elementary Modal Logics.
Jakub MichaliszynJan OtopPiotr WitkowskiPublished in: Fundam. Informaticae (2018)
Keyphrases
- decision procedures
- modal logic
- satisfiability problem
- temporal logic
- theorem proving
- propositional logic
- quantified boolean formulas
- computational complexity
- automated reasoning
- nonmonotonic logics
- phase transition
- sat problem
- conjunctive queries
- epistemic logic
- np complete
- classical logic
- satisfiability testing
- inference rules
- default logic
- multi agent
- constraint satisfaction
- model checking
- data model
- cooperative