Decomposition strategies for configuration problems
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Ontology-based coalition formation in heterogeneous MRS
PCAR '06 Proceedings of the 2006 international symposium on Practical cognitive agents and robots
Reasoning with very expressive fuzzy description logics
Journal of Artificial Intelligence Research
Bridging software languages and ontology technologies: tutorial summary
Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion
PODD: an ontology-driven data repository for collaborative phenomics research
ICADL'10 Proceedings of the role of digital libraries in a time of global change, and 12th international conference on Asia-Pacific digital libraries
Tractable reasoning with vague knowledge using fuzzy $\mathcal{EL}^{++}$
Journal of Intelligent Information Systems
Hi-index | 0.00 |
Description Logics are used to solve a wide variety of problems, with configuration applications being some of the largest and longest-lived. There is concrete, commercial evidence that shows that DL-based configurators have been successfully fielded for over a decade. Additionally, it appears that configuration applications have a number of characteristics that make them well-suited to DL-based solutions. This chapter will introduce the problem of configuration, describe some requirements of configuration applications that make them candidates for DL-based solutions, show examples of these requirements in a configuration example, and introduce the largest and longest-lived family of DL-based configurators.