# 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} }

- Published in IJCAR 2018
DOI:10.1007/978-3-319-94205-6_18

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

#### Citations

##### Publications citing this paper.

## A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 22 REFERENCES

## A modeltheoretic view on qualitative constraint reasoning

## The Complexity of Phylogeny Constraint Satisfaction Problems

#### Similar Papers

Loading similar papers…