Horn clause programs on abstract structures with parameters

Abstract

In the paper abstract structure with parameters are introduced. The parameters are subsets of the domain of a structure which are treated as effectively enumerable rather than semi-computable sets. Semantics of Horn clause programs on such structure is defined. The obtained this way programming language is shown to be closed under recursion and possessing maximal expressive power with respect to all programming languages satisfying certain model-theoretic conditions.