Complexity of Combinations of Qualitative Constraint Satisfaction Problems

@inproceedings{Bodirsky2018ComplexityOC,
  title={Complexity of Combinations of Qualitative Constraint Satisfaction Problems},
  author={Manuel Bodirsky and Johannes Greiner},
  booktitle={IJCAR},
  year={2018}
}
The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures. Nelson and Oppen presented conditions that imply decidability (or polynomial-time decidability) of $\mathrm{CSP}(T_1 \cup T_2)$ under the assumption that $\mathrm{CSP}(T_1)$ and $\mathrm{CSP}(T_2)$ are decidable (or polynomial-time decidable). We show that for a… CONTINUE READING
BETA
3
Twitter Mentions

References

Publications referenced by this paper.
SHOWING 1-10 OF 22 REFERENCES

A Dichotomy Theorem for Nonuniform CSPs

  • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017

A modeltheoretic view on qualitative constraint reasoning

P. Jonsson M. Bodirsky, T. V. Pham
  • Journal of Artificial Intelligence Research
  • 2017

The Complexity of Phylogeny Constraint Satisfaction Problems

J. Kára
  • ACM Transactions on Computational Logic ( TOCL )
  • 2017

The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems

  • 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2016

Similar Papers

Loading similar papers…