A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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.doi:10.1145/2629454 fatcat:pbnbxboitzhmrlalfqdsstjixq