scientific article; zbMATH DE number 4028939

From MaRDI portal
Publication:3769992





Several representation theorems for logic programs are presented which assert that effectively a fixed logic program exists. This so-called generator program has the following property: for any logic program an equivalent logic program exists such that it can be expressed as a conjunctive formula of a simple program and the fixed program. The problem of what operation is primitive for representation of logic programs is considered. It is shown that the filtering function by a homomorphism and the merging function are sufficiently primitive. Further it is proved that only ``append and ``extended reverse functions are needed to represent logic programs. The presented results are proved by using 1) an encoding technique that associates logic programs with a formal language over a finite alphabet (so called success language), 2) facts well known from formal language theory (e.g., properties of Dyck languages), and 3) the author's previous results.











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 Q3769992)