Boolean quantifier elimination for automotive configuration - A case study

12Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper evaluates different algorithms for existential Boolean quantifier elimination in the area of automotive configuration. We compare approaches based on model enumeration, on resolution, on dependency sequents, on substitution, and on knowledge compilation with projection. We describe two real-life applications: model counting on a set of customer-relevant options and projection of BOM (bill of materials) constraints. Our work includes an implementation of the presented techniques on top of state-of-the-art tools. We evaluate the different approaches on real production data from our collaboration with BMW. © Springer-Verlag 2013.

Cite

CITATION STYLE

APA

Zengler, C., & Küchlin, W. (2013). Boolean quantifier elimination for automotive configuration - A case study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8187 LNCS, pp. 48–62). https://doi.org/10.1007/978-3-642-41010-9_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free