Automated Qualitative Domain Abstraction

Abstract

Automated problem-solving for engineered devices is based on models that capture the essential aspects of their behavior. In this paper, we deal with the problem of automatically abstracting behavior models such that their level of granularity is as coarse as possible, but still sufficiently detailed to carry out a given behavioral prediction or diagnostic task. A task is described by a behavior model, as composed from a library, a specified granularity of the possible observations, and a specified granularity of the desired results. The goal is to determine partitions for the domains of the variables (termed qualitative values) that are both necessary and sufficient for the task at hand. We present a formalization of the problem within a common relational (constraint-based) framework, present results regarding solutions to task-dependent qualitative domain abstraction, and devise methods for automatically determining qualitative values for a device model. 1

Cite

Text

Sachenbacher and Struss. "Automated Qualitative Domain Abstraction." International Joint Conference on Artificial Intelligence, 2003. doi:10.1016/s1083-3188(02)00140-7

Markdown

[Sachenbacher and Struss. "Automated Qualitative Domain Abstraction." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/sachenbacher2003ijcai-automated/) doi:10.1016/s1083-3188(02)00140-7

BibTeX

@inproceedings{sachenbacher2003ijcai-automated,
  title     = {{Automated Qualitative Domain Abstraction}},
  author    = {Sachenbacher, Martin and Struss, Peter},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2003},
  pages     = {382-387},
  doi       = {10.1016/s1083-3188(02)00140-7},
  url       = {https://mlanthology.org/ijcai/2003/sachenbacher2003ijcai-automated/}
}