satisfiability modulo theories
problem of determining whether a mathematical formula is satisfiable
Facts
2 properties- Instance of
- decision problem
- Computational complexity
- NP-complete[2]
🏷️ Also known as
en satisfiability modulo theories
en SMT
es teorias de satisfacibilidad modulo
es teorías de satisfacibilidad módulo
fa صدقپذیری در پیمانه نظریات
hu Kielégíthetőségi modulo elméletek
it soddisfacibilità modulo teoria
it soddisfacibilità modulo teorie
ja 背景理論付き充足可能性問題
sv satisfierbarhet modulo teorier
zh 可滿足性的理論
🔖 Identifiers · 3
- OpenAlex ID
- C164155591
- Freebase ID
- /m/0d4jbt
- Microsoft Academic ID (discontinued)
- 164155591
Press Enter · cited answer in seconds
0 sources
Summary
satisfiability modulo theories is a decision problem[1].