Tractable Combinations of Temporal CSPs
The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T. We study the computational complexity of CSP$(T_1 \cup T_2)$ where $T_1$ and $T_2$ are theories with disjoint...
| Published in: | Logical Methods in Computer Science |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2022-05-01
|
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/7013/pdf |