Logic Programming Representation of the Compound Term Composition Algebra

Article type: Research Article

Authors: Analyti, Anastasia | Pachoulakis, Ioannis

Affiliations: Institute of Computer Science, FORTH-ICS, Crete, Greece. E-mail: analyti@ics.forth.gr | Dept. of Applied Informatics & Multimedia, TEI of Crete, Greece. E-mail: ip@epp.teicrete.gr

Abstract: 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.

Keywords: Faceted Taxonomies, Logic Programming, Computational Complexity, Applications

Journal: Fundamenta Informaticae, vol. 73, no. 3, pp. 321-360, 2006