Conmerge – arbitration of constraint-based knowledge bases

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

Abstract

Due to the increasing need to individualize mass products, product configurators are becoming more and more a manifest in the environment of business to customer retailers. Furthermore, technology-driven companies try to formalize expert knowledge to maintain their most valuable asset – their technological know-how. Consequently, insulated and diversified knowledge bases are created leading to complex challenges whenever knowledge needs to be consolidated. In this paper, we present the ConMerge-Algorithm which can integrate two constraint-based knowledge bases by applying redundancy detection and conflict detection. Based on detected conflicts, our algorithm applies resolution strategies and assures consistency of the resulting knowledge bases. Furthermore, the user can choose the operation mode of the algorithm: keeping all configuration solutions of each individual input knowledge base or only solutions which are valid in both original knowledge bases. With this method of knowledge base arbitration, the ability to consolidating distributed product configuration knowledge bases is provided.

Cite

CITATION STYLE

APA

Uta, M., & Felfernig, A. (2020). Conmerge – arbitration of constraint-based knowledge bases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12144 LNAI, pp. 127–139). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-55789-8_12

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