Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Dynamic Taxonomies: A Model for Large Information Bases
IEEE Transactions on Knowledge and Data Engineering
Faceted metadata for image search and browsing
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
FaThumb: a facet-based interface for mobile search
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Knowledge and Information Systems
A case study of Vinmonopolet.no: faceted search and navigation for e-commerce
Proceedings of the 4th Nordic conference on Human-computer interaction: changing roles
Logic Programming Representation of the Compound Term Composition Algebra
Fundamenta Informaticae
An algebra for specifying valid compound terms in faceted taxonomies
Data & Knowledge Engineering
Research Results in Dynamic Taxonomy and Faceted Search Systems
DEXA '07 Proceedings of the 18th International Conference on Database and Expert Systems Applications
An algebraic method for compressing symbolic data tables
Intelligent Data Analysis - Analysis of Symbolic and Spatial Data
MuseumFinland-Finnish museums on the semantic web
Web Semantics: Science, Services and Agents on the World Wide Web
Compound term composition algebra: the semantics
Journal on Data Semantics II
Guided interactive information access for e-citizens
EGOV'05 Proceedings of the 4th international conference on Electronic Government
Hi-index | 0.00 |
In previous work, we proposed an algebra whose operators allow to specify the valid compound terms of a faceted taxonomy, in a flexible manner (by combining positive and negative statements). In this paper, we treat the same problem but in a more general setting, where the facet taxonomies are not independent but are (possibly) interrelated through narrower/broader relationships between their terms. The proposed algebra, called Interrelated Facet Composition Algebra (IFCA ), is more powerful, as the valid compound terms of a faceted taxonomy can be derived through a smaller set of declared valid and/or invalid compound terms. An optimized (w.r.t. the naive approach) algorithm that checks compound term validity, according to a well-formed IFCA expression, and its worst-time complexity are provided.