The relation between logic programming and logic specification (Q3341879)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3876572
Language Label Description Also known as
default for all languages
No label defined
    English
    The relation between logic programming and logic specification
    scientific article; zbMATH DE number 3876572

      Statements

      The relation between logic programming and logic specification (English)
      0 references
      1984
      0 references
      logic programming
      0 references
      program derivation
      0 references
      program verification
      0 references
      program specification
      0 references
      predicate logic
      0 references
      Predicate logic is widely used in computing as a program specification language. It is less widely used as a programming language. However, the use of backwards reasoning transforms Horn clauses of the form \[ ''A\quad if\quad B\quad and\quad C\quad and\quad...'' \] into procedures: \[ ''to\quad do\quad A,\quad do\quad B\quad and\quad do\quad C\quad and\quad...'' \] This allows Horn clause logic to be used as a high level computer programming language. This paper investigates the relationships which hold when both programs and program specifications are expressed in predicate logic. In many cases, when a specification completely defines the relations to be computed, there is no syntactic distinction between specification and program. Moreover the same mechanism that is used to execute logic programs, namely automated deduction, can be used to execute logic specifications. Thus all relations defined by complete specifications are executable. The only difference between a complete specification and a program is one of efficiency. A program is more efficient than a specification.
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references