Abstract
This paper investigates the issues related to definability in an incomplete information table by using interval sets. We review the existing results pertaining to definability in a complete information table. We generalize the satisfiability of formulas in a description language in a complete table to a pair of strong and weak satisfiability of formulas in an incomplete table, which leads to an interval-set based interpretation of formulas. While we have definable sets in a complete table, we have definable interval sets in an incomplete table. The results are useful for studying concept analysis and approximations with incomplete tables.
Cite
CITATION STYLE
Hu, M., & Yao, Y. (2016). Definability in incomplete information tables. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9920 LNAI, pp. 177–186). Springer Verlag. https://doi.org/10.1007/978-3-319-47160-0_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
