Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Classification of reusable modules
Software reusability: vol. 1, concepts and models
Implementing faceted classification for software reuse
Communications of the ACM - Special issue on software engineering
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Query evaluation under the well-founded semantics
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Reasoning in description logics
Principles of knowledge representation
A faceted approach to hypertext?
Hypertext: theory into practice
A declarative approach to business rules in contracts: courteous logic programs in XML
Proceedings of the 1st ACM conference on Electronic commerce
Mathematical Foundations of Computer Science: Sets, Relations, and Induction
Mathematical Foundations of Computer Science: Sets, Relations, and Induction
Faceted metadata for image search and browsing
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
XSB: A System for Effciently Computing WFS
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Compound term composition algebra: the semantics
Journal on Data Semantics II
An algebra for specifying valid compound terms in faceted taxonomies
Data & Knowledge Engineering
Specifying Valid Compound Terms in Interrelated Faceted Taxonomies
ER '09 Proceedings of the 28th International Conference on Conceptual Modeling
Hi-index | 0.00 |
The Compound Term Composition Algebra (CTCA) is an algebra with four algebraic operators, which can be used to generate the valid (meaningful) compound terms of a given faceted taxonomy, in an efficient and flexible manner. The positive operations allow the derivation of valid compound terms through the declaration of a small set of valid compound terms. The negative operations allow the derivation of valid compound terms through the declaration of a small set of invalid compound terms. In this paper, we show how CTCA can be represented in logic programming with negation-as-failure, according to both Clark's and well-founded semantics. Indeed, the SLDNF-resolution can be used for checking compound term validity and well-formedness of an algebraic expression in polynomial time w.r.t. the size of the expression and the number of terms in the taxonomy. This result makes our logic programming representation a competitive alternative to imperative algorithms. Embedding of our logic programming representation to the programming environment of a web portal for a computer sales company is demonstrated.