An introduction to Prolog III
Communications of the ACMPublished 1 July 1990Open access
Alain Colmerauer
Citations572
SJR quartileQ1
SJR score1.15
SNIP3.34
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The Prolog III programming language extended by redefining the fundamental process at its heart: unification is presented and its capabilities are illustrated.
Abstract
The Prolog III programming language extends Prolog by redefining the fundamental process at its heart: unification. This article presents the specifications of this new language and illustrates its capabilities.
Keywords
Computer Science
Journal of the ACMA Machine-Oriented Logic Based on the Resolution Principle
3,885 Citations1965John A. Robinson
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.
Constraint logic programming
1,613 Citations1987Joxan Jaffar, J.-L. Lassez
A class of programming languages, the CLP languages, are defined, all of which share the same essential semantic properties, and are highly declarative and are soundly based within a unified framework of formal semantics.
Cambridge University Press eBooksAn Investigation of the Laws of Thought
649 Citations2009George Boole
Mathematics of Operations ResearchNew Finite Pivoting Rules for the Simplex Method
447 Citations1977Robert G. Bland
A simple proof of finiteness is given for the simplex method under an easily described pivoting rule and a second new finite version of thesimplex method is presented.
Linear Resolution with Selection Function
320 Citations1983Robert Kowalski, D. Brian Kuehner
Wheels, life, and other mathematical amusements
190 Citations1983Martin Gardner
Journal of Symbolic ComputationEmbedding boolean expressions into logic programming
112 Citations1987Wolfram Büttner, Helmut Simonis
This paper presents an algorithm to compute the most general unifier of boolean expressions, which is unique, if it exists, and first experiemes with an integration into a PROLOG system are shown.
L'évaluation sémantique en calcul propositionnel
17 Citations1989Laurent Oxusoff, Antoine Rauzy
Elsevier eBooksAbout Redundant Inequalities Generated by Fourier's Algorithm
9 Citations1990Jean-Louis Imbert
It is shown that, independently of any redundance which may exist in the initial system, Fourier's algorithm itself produces a number of redundant inequalities, and it is observed how each constraint is obtained (the construction) from the initial constraints.