Algorithm = logic + control

@article{Kowalski1979AlgorithmL,
  title={Algorithm = logic + control},
  author={Robert A. Kowalski},
  journal={Commun. ACM},
  year={1979},
  volume={22},
  pages={424-436}
}
  • R. Kowalski
  • Published 1 July 1979
  • Computer Science
  • Commun. ACM
The notion that computation = controlled deduction was first proposed by Pay Hayes [19] and more recently by Bibel [2] and Vaughn-Pratt [31]. A similar thesis that database systems should be regarded as consisting of a relational component, which defines the logic of the data, and a control component, which stores and retrieves it, has been successfully argued by Codd [10]. Hewitt's argument [20] for the programming language PLANNER, though generally regarded as an argument against logic, can… Expand
Computational Logic: Logic Programming and Beyond
TLDR
A distributed object oriented logic programming language in which an object is a collection of threads deductively accessing and updating a shared logic program, and a class of co-operative reasoning agents that can do resource bounded inference for full first order predicate logic. Expand
Analysis of the behavior of logic-based computation for deductive databases and default reasoning
TLDR
This paper attempts to present to the non-logician known program behavior results for logic programs in the context of deductive databases that indicate that under certain conditions the solution to the last ILP yields a Herbrand model for the original set of statements in logic. Expand
The Di erential Fixpoint Operatorwith SubsumptionGerhard
Declarative languages for deductive and object-oriented databases require some high-level mechanism for specifying semantic control knowledge. This paper proposes user-supplied subsumptionExpand
The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference
TLDR
This paper presents a novel algorithm for automatic finding of lowest-cost subgoal orderings using the divide-and-conquer strategy, and experimentally demonstrates the utility of the algorithm by testing it in several domains, and discusses the possibilities of its cooperation with other existing methods. Expand
Middle History of Logic Programming: Resolution, Planner, Edinburgh Logic for Computable Functions, Prolog and the Japanese Fifth Generation Project
TLDR
The focus of this article is on the development of Logic Programming, and it does not treat any other associated topics related to Logic Programming such as constraints, abduction, etc. Expand
Logic Programming and Nonmonotonic Reasoning
TLDR
I suggest that this is an appropriate level for dealing with change in logic programs, complementing earlier syntax-dependent approaches, and touches on work concerning AS revision, with respect to both specific approaches and logical characterisations. Expand
Declarative Priority in a Concurrent Logic Language ON
TLDR
A model of priority is defined and some properties of the model are proved, and a concurrent logic language called ON is designed based on the theoretical framework and some prominent characteristics that are embodied in sample programs written in ON are discussed. Expand
Negation in Logic Programming
  • K. Kunen
  • Computer Science, Mathematics
  • J. Log. Program.
  • 1987
TLDR
A complete interpreter for negation as failure in logic programming exists in theory, although it is pointed out that there are serious difficulties in building one that works well in practice. Expand
Communicating control knowledge to a deductive database system
TLDR
The architecture of a deductive database system which offers the user a framework for specifying control knowledge is recaptured, and it is shown how these two examples can be solved more efficiently with the system. Expand
Non-Monotonic Formalisms and Logic Programming
\It seems to me, that work in databases, logic programming, deductive databases, artii-cial intelligence and expert systems will move closer towards one another. Formalisms and techniques developedExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 91 REFERENCES
A Man-Machine Theorem-Proving System
TLDR
A man-machine theorem proving system at the University of Texas (Austin) which has been used to prove a few theorems in general topology, built around a modified form of IMPLY, a natural-deduction-like theorem proving technique. Expand
The Competence/Performance Dichotomy in Programming
TLDR
The immediate objectives of this research are to learn how to program keeping fact and control separate, and to identify those aspects of control amenable to automation. Expand
A Proof Procedure Using Connection Graphs
TLDR
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
A Relational Model for Large Shared Data Banks
TLDR
His goal is to describe data, not to build a model of computation (which one would then be expected to prove equivalent to Turing Machines), and the idea of using a relation view of data to avoid ordering dependencies, access path dependencies and other implementation dependencies. Expand
Non-Deterministic Algorithms
TLDR
Two examples follow, showing the usefulness of the primitwes m computer-reded problem solving: the first is a simple question-answering program, the other is a parser for a context-sensitive language. Expand
The competence/performance dichotomy in programming preliminary report
TLDR
The claim that data management has been automated to the point where the programmer concerned only about the correctness of his program need not involve himself in any aspect of the storage allocation problem is taken as a point of departure. Expand
Relational Completeness of Data Base Sublanguages
  • E. Codd
  • Computer Science
  • Research Report / RJ / IBM / San Jose, California
  • 1972
TLDR
This paper attempts to provide a theoretical basis which may be used to determine how complete a selection capability is provided in a proposed data sublanguage independently of any host language in which the sublanguage may be embedded. Expand
Prolog - the language and its implementation compared with Lisp
TLDR
It is argued that pattern matching is a better method for expressing operations on structured data than conventional selectors and constructors - both for the user and for the implementor. Expand
Prolog - the language and its implementation compared with Lisp
TLDR
It is argued that pattern matching is a better method for expressing operations on structured data than conventional selectors and constructors - both for the user and for the implementor. Expand
PLANNER: A Language for Proving Theorems in Robots
  • C. Hewitt
  • Mathematics, Computer Science
  • IJCAI
  • 1969
TLDR
The deductive system of PLANNER is subordinate to the hierarchical control structure in order to make the language efficient and the use of a general purpose matching language makes the deductives system more powerful. Expand
...
1
2
3
4
5
...