Logic program forms
In this paper we propose the concept of a logic program form. A logic program form is a kind of program abstraction where the skeleton of a program called program form is separated from its detailed structural information called interpretation. Given a logic program form, the class of logic programs obtained from the master form by giving interpretations is defined. It is shown that there exists a fixed logic program form which can provide a universal descriptive capability in the sense that any recursively enumerable language is expressed by a logic program obtained from the program form. Further, some application issues are discussed in the contexts of logic program representation and analogical reasoning in logic programs.
- A Transformation System for Developing Recursive Programs
- Context-free grammar forms
- Horn clause computability
- scientific article; zbMATH DE number 4016224 (Why is no real title available?)
- scientific article; zbMATH DE number 3466489 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 3640922 (Why is no real title available?)
- The Semantics of Predicate Logic as a Programming Language
- Process logic with regular formulas
- scientific article; zbMATH DE number 4139316 (Why is no real title available?)
- scientific article; zbMATH DE number 5347850 (Why is no real title available?)
- scientific article; zbMATH DE number 4028939 (Why is no real title available?)
- The theory of form logic
- Logical forms, substitutions and information types
This page was built for publication: Logic program forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822224)