LoCo is a fragment of classical first order logic tailored for expressing configuration problems. The core feature of LoCo is that the number of components used in configurations does not have to be finitely bounded explicitly, but instead is bounded implicitly through the axioms. Computing configurations reduces to modelfinding. We present the language, related algorithms and complexity results as well as a prototypical implementation via answer set programming.