scientific article; zbMATH DE number 4098708
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).
- Logic program forms
- Parametrized semantics of logic programs -- a unifying framework
- Dynamic composition of parameterised logic modules
- Decidability and implementation of parametrized logic programs
- scientific article; zbMATH DE number 4139721 (Why is no real title available?)
- scientific article; zbMATH DE number 4009792 (Why is no real title available?)
- scientific article; zbMATH DE number 4072431 (Why is no real title available?)
- scientific article; zbMATH DE number 26616 (Why is no real title available?)
- Semantics of first order parametric specifications
- scientific article; zbMATH DE number 2111988 (Why is no real title available?)
- Parametrized logic programming
- A proof-theoretic semantics for parametric logical constants
- scientific article; zbMATH DE number 2237358 (Why is no real title available?)
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)