Application of CLP(SC) in Membrane Computing

Authors

  • Jemal ANTIDZE
  • Besik DUNDUA
  • Mikheili RUKHAIA
  • Lali TIBUA

DOI:

https://doi.org/10.31578/jtst.v5i2.101

Keywords:

Constraint Logic Programming, sequence context matching, membrane computing

Abstract

Present artcile studies semantics of the constraint logic programming built
over sequences and contexts, called CLP(SC). Sequences and contexts are
constructed over function symbols and function variables which do not have
fixed arity, together with term, sequence, and context variables. For some
function symbols, the order of the arguments matter (ordered symbols). For
some others, this order is irrelevant (unordered symbols). Term variables
stand for single terms, sequence variables for sequences, context variables
for contexts, and function variables for function symbols. We have studied the
semantics of CLP(SC) and showed its application in membrane computing.

Author Biography

Jemal ANTIDZE

 

 

Downloads

Published

03-02-2017

Issue

Section

Articles