J. Cohen. A view of the origins and development of prolog. Commun. ACM, 31(1):26--36, 1988.  Home/Search   Document Not in Database   Summary   ACM   TOC   Related Articles   Check

....to matching is needed in order to retain certain completeness properties in the presence of committed choice [68] A short description of Horn clause programs and SLD resolution can be found in Appendix A. Multi headed rules have not only been investigated for CHR, but according to [37] also for variants of logic programming languages, mainly for coordination languages. CHR allows adding guards to rules. This is needed also as a consequence of committed choice: Guards must frequently be used to avoid application of inappropriate rules, which cannot be backtracked as in SLD ....

J. Cohen. A view of the origins and development of Prolog. Communications of the ACM, 31(1):26-36, 1988.

....theorem proving techniques for some time for use in plan inference. Further, first order logic was widely accepted as a convenient language for knowledge representation and reasoning [23] Meanwhile, language researchers were investigating non deterministic bottom up parsing of natural language [14]. Kowalski was one of the first to propose the use of logic as a general purpose programming language. He proposed that a set of first order rules and axioms has not only a denotational interpretation (i.e. the set of all relationships derivable from the set under some set of inference rules) but ....

Jacques Cohen. A view of the origins and development of Prolog. Communications of the ACM, 31(1):26--36, January 1988.

....Choice Languages, Higher Order Logic (HOL) and Object oriented Logic Programming (OOLP) In next paragraphs, basic terminology employed in this tutorial will be presented. For a more detailed discussion on the Prolog syntax and its origin, the reader is reported to the following references [23, 21, 89, 7]. The data structures manipulated in Prolog are first order terms. A term can be either a variable, started with an upper case letter, a constant, started with a lower case letter, or a structure in the format f1(t 1 , t n ) where f is a functor and t i is a term. Variables in Prolog have ....

J. COHEN. A View of the Origins and Development of Prolog. Communications of the ACM, 31(1):26--36, 1988.

....Readers versed in Prolog may observe that the notations of W grammars and Prolog programs have a great deal in common, even to the use of upper case letters to denote variables. This is not a coincidence. W grammars were an important intellectual influence on the early development of Prolog; see [Cohe 88] In terms of technical features, W grammars are the simplest Turing powerful model surveyed in Part I of this thesis, save the Chomsky model itself. The derivation process is based entirely on string rewriting by substitution. There are no additional devices, such as the semantic functions of ....

Jacques Cohen, "A View of the Origins and Development of Prolog", Communications of the ACM 31 no. 1 (January 1988), pp. 26--36.

....rules, which can be seen as LP rules. The procedural solutions use destructive assignment, thus an ordering has to be imposed on the solutions steps to avoid read write conflicts. The approach has some capabilities to deal with added and removed constraints. 3.2. Multiple Head Atoms According to [Coh88] at the very beginning of the development of Prolog in the early 70 s by Colmerauer and Kowalski, experiments were performed with clauses having multiple head atoms. In committed choice languages, multiple head atoms have been considered only rarely. In his thesis, Saraswat remarks on multiple ....

J. Cohen, A View of the Origins and Development of Prolog, Communications of the ACM 31(1):26-36, January 1988.

....of the host language (e.g. cut in the case of Prolog) Like most logic programming languages, AKL itself does not support two of the essential features for defining simplification of user defined constraints: propagation rules and multiple head atoms. 6. 3 Multiple Head Atoms According to [Coh88] at the very beginning of the development of Prolog in the early 70 s by Colmerauer and Kowalski, experiments were performed with clauses having multiple head atoms. More recently, clauses with multiple head atoms were proposed to model parallelism and distributed processing as well as objects, ....

J. Cohen, A View of the Origins and Development of Prolog, CACM 31(1):26-36, Jan. 1988.

....combines a variant of Prolog with a committed choice language. Like most logic programming languages, AKL itself does not support two of the essential features for defining simplification of user defined constraints: Augmentation rules and multiple head atoms. 6. 3 Multiple Head Atoms According to [Coh88] at the very beginning of the development of Prolog in the early 70 s by Colmerauer and Kowalski, experiments were performed with clauses having multiple head atoms. More recently, clauses with multiple head atoms were proposed to model parallelism and distributed processing, e.g. Br90, AnPa91] ....

J. Cohen, A View of the Origins and Development of Prolog, CACM 31(1):26-36, Jan. 1988.

....to the introduction of Prolog , a language containing key features of imperative programming and functional programming, but really based upon the idea of resolution in Horn clause logics. Good accounts of the origins of Prolog were given in a recent issue of the Communications of the ACM [7, 20]. Prolog semantics are relatively straightforward, although a natural language description, as given here, is perhaps less than satisfactory. A Prolog program consists of a number of clauses. Each clause has a head, consisting of zero or more terms, and a body, which consists of zero or ....

J. Cohen. A View Of The Origins And Development Of Prolog. Communications of the ACM, 31(1):26--36, January 1988.

....interest in solving several problems thatwere notvery easily solvable by the existing imperative programming model. The main concern of researchers at around 1970 was, from one side, to build theorem provers [79] and from another side, to do parsing and syntactic analysis for natural languages [25]. Prolog was the fi rst practical logic programming language, designed by Alain Colmerauer w ith its theoretical groundwork laid by RobertKowalski, in 1974. Prolog is the mostwidely known representative of logic programming languages. Most other logic programming languages are derivatives of the ....

.... 8 , 8 , 4 , 4 , 2 ] 0 , 0 , 0 , 0 , 0 , 1 , 2 , 5 , 6 , 4 , 4 , 6 , 7 , 7 , 8 , 8 , 5 , 6 , 6 , 6 , 6 , 5 , 5 , 3 , 3 , 1 , 1 , 1 , 0 , 0 ] 0 , 1 , 2 , 3 , 3 , 3 , 2 , 4 , 5 , 5 , 7 , 9 , 9 , 6 , 6 , 5 , 4 , 5 , 5 , 4 , 5 , 4 , 2 , 2 , 2 , 2 , 1 , 0 , 0 , 0 ] s c anne r dat a( vt 100 , [ 0 , 0 , 0 , 26 , 20 , 13 , 13 , 11 , 11 , 11 , 12 , 11 , 11 , 10 , 13 , 24 , 18 , 2 , 2 , 14 , 2 , 16 , 9 , 26 , 15 , 25 , 13 , 16 , 28 , 6 , 0 , 0 ] , 0 , 6 , 18 , 6 , 8 , 21 , 20 , 14 , 14 , 15 , 14 , 13 , 12 , 13 , 13 , 13 , 12 , 14 , 14 , 16 , 14 , 20 , 16 , 3 , 10 , 7 , 11 , 8 , 10 , 17 , 6 , 0 ] 0 , 0 , 0 , 0 , 0 , 0 , 2 , 2 , 2 , 3 , 4 , 5 , 6 , 5 , 8 , 5 , 10 , 5 , 11 , 5 , 12 , 3 , 14 , 7 , 10 , 6 , 16 , 10 , 14 , 10 , 13 , 12 , ....

[Article contains additional citation context not shown here]

Jacques Cohen. A View of the Origins and Development of Prolog. Communications of the ACM, 31(1):26-- 36, 1988.

....patterns. Search tree unification can serve as a basis for the declarative interpretation of process based logic programs. 1 An Historical Introduction Logic programming was born from the confluence of two research endeavors: automated theorem proving and natural language processing [1]. The main idea behind logic programming is that the programmer must define only the logic component of an algorithm and leave the way how the solutions are found to the machine it is also expressed by the equation coined by Kowalski [2] A(lgorithm) L(ogic) C(ontrol) where the Control ....

Jacques Cohen. A View of the Origins and Development of Prolog. Communications of the ACM, 31(1):26--36, January 1988.

....Fig. 4. An SLD tree leaf are a failing and successful, respectively. A naive transformation into a CHR program might lead to: fp , q; p , r; q , false; r , g As we have discussed above, Horn clauses are converted to 6 Multi headed rules have not only been investigated for CHR, but according to [6] also for variants of logic programming languages, mainly for coordination languages. simplification rules because these consume the selected constraint from the userdefined constraint store. Notice that a rule for q has been introduced because a CHR computation would not fail just because an ....

J. Cohen. A view of the origins and development of Prolog. Communications of the ACM, 31(1):26--36, 1988.

....Processing considerations. Prolog was created in 1972 by Colmerauer and Kowalski by merging Robinson s notion of unification in Automated Theorem Proving with the insights provided by Colmerauer s previous Q systems, a programming language which he had designed for use in Machine Translation [42]. At the beginning of the eighties, the Unification Grammar paradigm [110,106,84] strongly connected to Logic Programming [94] gained more and more popularity in Computational Linguistics circles. One of the key advantages of such formalisms was their ability to free the grammar writer from an ....

Jacques Cohen. A view of the origins and development of Prolog. Communications of the ACM, 31(1):26--37, January 1988.

No context found.

J. Cohen. A view of the origins and development of prolog. Commun. ACM, 31(1):26--36, 1988.

No context found.

J. Cohen. A view of the origins and development of prolog. Commun. ACM, 31(1):26--36, 1988.

No context found.

Cohen J. 1988. \A View of the Origins and Development of Prolog", Comm. of the ACM, Vol. 31, No. 1, January, pp.26-36.

No context found.

J. Cohen. A view of the origins and development of Prolog. Communications of the ACM, 31(1):26-36, 1988.

No context found.

Cohen, J. 1988 A View of the Origins and Development of Prolog. Communications of the ACM 31(1) :26-36.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC