A SEMANTICS OF LOGIC PROGRAMS WITH PARAMETERS

TitleA SEMANTICS OF LOGIC PROGRAMS WITH PARAMETERS
Publication TypeJournal Article
Year of Publication2003
AuthorsBaleva V
JournalAnnuaire de l’Université de Sofia “St. Kliment Ohridski”. Faculté de Mathématiques et Informatique
Volume95
Keywordsabstract structures, logic programming, parameters, semantics
Abstract

A generalized version of the declarative semantics of Horn clause programs on abstract structures with parameters is presented. The parameters are subsets of the domain of the structure. They are treated as effectively enumerable sets. The main feature of the semantics is that it does not admit searching in the domain of the structure. The obtained programming language is closed under recursion and has the greatest expressive power among the languages satisfying certain natural model-theoretic properties. It is shown that the obtained notion of computability is transitive.

2000 MSC

03D75, 68Q05, 68Q55

AttachmentSize
PDF icon 0495.pdf25.18 KB
AttachmentSize
PDF icon 95-015-039.pdf2.25 MB