Satisfiability for relation-changing logics.
Carlos ArecesRaul FervariGuillaume HoffmannMauricio MartelPublished in: J. Log. Comput. (2018)
Keyphrases
- decision procedures
- satisfiability problem
- computational properties
- expressive power
- modal logic
- np complete
- computational complexity
- nonmonotonic logics
- classical logic
- theorem proving
- terminological reasoning
- quantified boolean formulas
- conditional logic
- sat problem
- database
- phase transition
- orders of magnitude
- neural network