LoCo—A Logic for Configuration Problems | Zendy

Markus Aschinger | Zendy; Conrad Drescher | Zendy; Georg Gottlob | Zendy; Heribert Vollmer | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

LoCo—A Logic for Configuration Problems

Author(s) -

Markus Aschinger,

Conrad Drescher,

Georg Gottlob,

Heribert Vollmer

Publication year - 2014

Publication title -

acm transactions on computational logic

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.593

H-Index - 52

eISSN - 1557-945X

pISSN - 1529-3785

DOI - 10.1145/2629454

Subject(s) - axiom , bounded function , fragment (logic) , answer set programming , set (abstract data type) , theoretical computer science , computer science , mathematics , feature (linguistics) , task (project management) , horn clause , logic program , logic programming , core (optical fiber) , product (mathematics) , programming language , algebra over a field , algorithm , discrete mathematics , pure mathematics , mathematical analysis , telecommunications , linguistics , philosophy , geometry , management , economics

In this work, we present LoCo, a fragment of classical first-order logic carefully tailored for expressing technical product 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 is equivalent to the task of model finding. We present the language, related algorithms, and complexity results as well as a prototypical implementation via answer set programming.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research