# The early years of logic programming

@article{Kowalski1988TheEY, title={The early years of logic programming}, author={Robert A. Kowalski}, journal={Commun. ACM}, year={1988}, volume={31}, pages={38-43} }

This firsthand recollection of those early days of logic programming traces the shared influences and inspirations that connected Edinburgh, Scotland, and Marseilles, France.

#### Topics from this paper

#### 160 Citations

Introduction to Logic Programming

- Computer Science
- Synthesis Lectures on Artificial Intelligence and Machine Learning
- 2020

Abstract Logic Programming is a style of programming in which programs take the form of sets of sentences in the language of Symbolic Logic. Over the years, there has been growing interest in Logic...

Development of Logic Programming : What went wrong

- 2008

Logic Programming can be broadly defined as “using logic to deduce computational steps from existing propositions” (although this is somewhat controversial). The focus of this paper is on the… Expand

Compiling Prolog From the PLM to the WAM and Beyond

- Computer Science
- 1990

This paper summarizes efforts to develop an efficient scheme for compiling the computer language Prolog and describes the current state of the art. Expand

TFLPL: Programación con lógica de términos

- Computer Science
- Res. Comput. Sci.
- 2018

Given the system Term Functor Logic and the concept of Aristotelian database, the development of a programming language called TFL is presented, which is a combination of TFL and TFL with semantics derived from TFL. Expand

Automation of Mathematical Induction as part of the History of Logic

- Computer Science
- FLAP
- 2017

The history of the automation of mathematical induction is reviewed and the role of computer programming in this work is reviewed. Expand

Overview of disjunctive logic programming

- Mathematics, Computer Science
- Annals of Mathematics and Artificial Intelligence
- 2005

An overview is presented of the developments that have taken place in the field of disjunctive programming, which include model theoretic, proof theoretic and fixpoint semantics for dis junctive semantics, and extended normal dis Junctive theories including alternative forms of negation. Expand

Absys: The First Logic Programming Language - A Retrospective and a Commentary

- Computer Science
- J. Log. Program.
- 1990

It is hoped that logic programmers might be interested to hear how subsequent developments in what is now called equational programming, and alternative presentations of the unification algorithm, allow Absys to be recognized for what it was. Expand

On Principles of Software Engineering - Role of the Inductive Inference

- Computer Science
- e Informatica Softw. Eng. J.
- 2012

The inductive inference mechanism’s role behind the automatic program construction activities and software evolution is focused on and the revision of rather ln old ideas in the new context of software engineering could enhance the endeavour. Expand

The Symbolic Term Abstract Domain

- 2020

We construct the abstract domain of symbolic terms ordered by subsumption by abstraction of the powerset of ground terms ordered by inclusion.

Visual Compositional-Relational Programming

- Computer Science
- 2010

In an ever faster changing environment, software developers not only need agile methods, but also agile programming paradigms and tools. A paradigm shift towards declarative programming has begun; ...

#### References

SHOWING 1-10 OF 42 REFERENCES

The Semantics of Predicate Logic as a Programming Language

- Mathematics, Computer Science
- JACM
- 1976

In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated, and it is concluded that operational semantics is a part ofProof theory and that fixpoint semantic is a special case of model-theoretic semantics. Expand

Refinement Theorems in Resolution Theory

- Mathematics
- 1970

The paper discusses some basic refinements of the Resolution Principle which are intended to improve the speed and efficiency of theorem-proving programs based on this rule of inference. It is proved… Expand

Computation and Deduction

- Computer Science
- MFCS
- 1973

Draft notes for a course given at Carnegie Mellon University during the fall semester of 1994, with author Frank Pfenning and the National Football League. Expand

Proving Theorems about LISP Functions

- Mathematics, Computer Science
- JACM
- 1975

We describe some simple heuristics combining evaluation and mathematical induction which we have implemented in a program that automatically proves a wide variety of theorems about recursive LISP… Expand

Algorithm = logic + control

- Computer Science
- CACM
- 1979

The notion that computation = controlled deduction was first proposed by Pay Hayes and more recently by Bibel and Vaughn-Pratt and the thesis that algorithms be regarded as consisting of both logic and control components is explored. Expand

A Machine-Oriented Logic Based on the Resolution Principle

- Computer Science
- JACM
- 1965

The paper concludes with a discussion of several principles which are applicable to the design of efficient proof-procedures employing resolution as the basle logical process. Expand

A Proof Procedure Using Connection Graphs

- Computer Science
- JACM
- 1975

A new theorem-proving system designed to remedy deficiencies of resolution systems is presented, beginning as a supplement to SL-resolution in the form of classificatmn trees and incorporating an analogue of the Waltz algorithm for picture Interpretation. Expand

Logic for problem solving

- Computer Science
- SOEN
- 1982

This book investigates the application of logic to problem-solving and computer programming. It assumes no previous knowledge of these fields, and may be Karl duncker in addition to make difficult… Expand

A Linear Format for Resolution

- Mathematics
- 1970

The Resolution procedure of J. A. Robinson is shown to remain a complete proof procedure when the refutations permitted are restricted so that clauses C and D and resolvent R of clauses C and D meet… Expand

Coloring maps and the Kowalski doctrine

- Computer Science
- 1982

A map coloring program proposed by Pereira and Porto and two coloring algorithms that can be regarded as control applied to its logic are discussed. Expand