scientific article; zbMATH DE number 4098708

From MaRDI portal
Publication:3823786





The aim of this article is to discuss an important case of the logic programming, and to establish the connexion with the usual case. The alphabet consists here in an additional class of parameter (procedure) symbols, \({\mathcal P}\). If \(\Omega\) is an initial signature, than an parametric program differs from the usual case by the relation symbols which are the terms in \(F_{\Omega}({\mathcal P})\). A parametric rule (a program clause) is written as: \[ A_ 0\leftarrow A_ 1,\quad...,\quad A_ m,\quad m\geq 0 \] where \(A_ i\) is an atom of the form \(\sigma (t_ 1\),..., \(t_ n)\), \(t_ i\in F_{\Sigma}(x)\), and \(\sigma \in F_{\Omega}({\mathcal P})\). Two results are given about a parametric program (which is a finite set of the parametric rules).











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3823786)