A Constraint Solver for Equations over Sequences and Contexts

Abstract

In this paper we propose a solving algorithm for equational constraints over unranked terms, contexts, and sequences. Unranked terms are constructed over function symbols which do not have fixed arity. For some function symbols, the order of the arguments matters (ordered symbols). For some others, this order is irrelevant (unordered symbols). Contexts are unranked terms with a single occurrence of hole. Sequences consist of unranked terms and contexts. Term variables stand for single unranked terms, sequence variables for sequences, context variables for contexts, and function variables for function symbols. We design an terminated and incomplete constraint solving algorithm, and indicate a fragment for which the algorithm is complete.

Application of CLP(SC) in Membrane Computing

“…In (Beriashvili & Dundua, 2016;Dundua, 2014) we have constructed a constraint solving algorithm which simplifies constraints built over the language given in this paper. In particular, the solving algorithm transforms constraints in DNF into constraints in DNF.…”