The early years of logic programming

  title={The early years of logic programming},
  author={Robert A. Kowalski},
  journal={Commun. ACM},
This firsthand recollection of those early days of logic programming traces the shared influences and inspirations that connected Edinburgh, Scotland, and Marseilles, France. 
Introduction to Logic Programming
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
The focus of this paper is on the development of Logic Programming, and it does not treat any other associated topics related to Logic Programming such as constraints.
Compiling Prolog From the PLM to the WAM and Beyond
This paper summarizes efforts to develop an efficient scheme for compiling the computer language Prolog and describes the current state of the art.
Automation of Mathematical Induction as part of the History of Logic
The history of the automation of mathematical induction is reviewed and the role of computer programming in this work is reviewed.
TFLPL: Programación con lógica de términos
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.
Overview of disjunctive logic programming
  • J. Minker
  • 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.
On Principles of Software Engineering - Role of the Inductive Inference
  • L. Samuelis
  • 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.
The Symbolic Term Abstract Domain
It is shown that the abstract domain of symbolic terms ordered by subsumption by abstraction of the powerset of ground terms ordering by inclusion is the same as that of the real world.
Visual Compositional-Relational Programming
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; ...


The Semantics of Predicate Logic as a Programming Language
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.
Refinement Theorems in Resolution Theory
It is proved that two of the refinements of the Resolution Principle preserve the logical complete­ness of the proof procedure when used separately, but not when used in conjunction.
Computation and Deduction
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.
Proving Theorems about LISP Functions
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
Algorithm = logic + control
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.
A Machine-Oriented Logic Based on the Resolution Principle
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.
A Proof Procedure Using Connection Graphs
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.
Logic for problem solving
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
A Linear Format for Resolution
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
Coloring maps and the Kowalski doctrine
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.