LogicProgrammingRepresentationoftheCompound-ICS.PDFVIP

A. Analyti, I. Pachoulakis / Logic Programming Representation of CTCA 1 Logic Programming Representation of the Compound Term Composition Algebra 1 23 Anastasia Analyti , Ioannis Pachoulakis 1 Institute of Computer Science, FORTH-ICS, Crete, Greece 2 Dept. of Applied Informatics Multimedia, TEI of Crete, Greece 3 Centre for Technological Research of Crete (CTRC), Greece Email : analyti@ics.forth.gr, ip@epp.teicrete.gr Abstract. The Compound Term Composition Algebra (CTCA) is an algebra with four algebraic op- erators, 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 program- ming 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 sale