COLMERAUER, A., H. KANOUI, R. PASERO, & P. ROUSSEL. 1973. Un systeme de communication homme-machine en Francais. Technical report, Research Report, Groupe Intelligence Artificialle, Groupe Intelligence Artificielle, Universite Aix-Marseille II.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....can be found in [Llo87] A particular Logic Programming language is defined by choosing a rule for the selection of the literals in the current formula to be reduced at each step (computation rule) and by choosing a search strategy, that can be either depth first or breadth first. In the Prolog [CKRP73] programming language the computation rule selects the left most literal in the current goal and the search strategy is depth first with chronological backtracking. Moreover, Prolog adopts an extension of SLD resolution called SLDNF resolution that is able to deal with normal clauses by negation ....

A. Colmerauer, H. Kanoui, P. Roussel, and R. Pasero. Un systeme de communication homme-machine en Francais. Technical report, Groupe de Recherche en Intelligence Artificielle, Universit'e d'Aix-Marseille, 1973.

....would quickly become a dominant programming paradigm because of its declarative nature: it allows programmers to focus on modeling problem speci cations in a declarative way as theories and frees them from the need to describe control. These expectations were reinforced by the emergence of Prolog [2]. However, despite the initial excitement generated by logic programming and its prominent role in the fth generation computing initiative in Japan, logic programming has been slow in winning broad acceptance and has yet to live up to early expectations. This paper presents our attempt to ....

A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un systeme de communication homme-machine en francais. Technical report, University of Marseille, 1973.

....should be computed. As Kowalski observes in [57] this is desirable because this allows the control component of the program to be changed (possibly automatically) to make the program execute faster without altering the meaning of the program. Control strategies include those of Edinburgh Prolog [22] which executes goals in a fixed depth first, left to right manner; NU Prolog [104] and SICStus Prolog [17] which allow the order in which goals are executed to be constrained to allow predicates to be evaluated only when their arguments have or exceed particular instantiations; and XSB Prolog ....

A. Colmerauer, H. Kahoui, and M. van Caneghem. Un systeme de communication hommemachine en francais. Technical report, Groupe de Rescherche en Intelligence Artificielle, Universite Aix-Marseille II, 1973.

....Systems Department, TU Vienna, Paniglgasse 16, A1040 Vienna. Email gottlob dbai.tuwien.ac.at. 4 Computing Science Department, Uppsala University, P.O. Box 311, S 751 05, Uppsala, Sweden. Email voronkov csd.uu.se. Supported by a TFR grant. With the advent of the programming language Prolog [32], the paradigm of logic programming became soon ready for practical use. Many applications in different areas were and are successfully implemented in Prolog. Note that Prolog is in a sense only an approximation to fully declarative LP. In fact, the clause matching and backtracking ....

A. Colmerauer, H. Kanoui, P. Roussel, and R. Passero. Un systeme de communication homme-machine en Francais. Technical report, Groupe de Recherche en Intelligence Artificielle, Universite d'Aix-Marseille, 1973.

....declarative speci cations of objects to be computed was signi cantly hampered by disallowing the negation operator from the bodies of clauses. This was recognized very early on in the development of the eld. In particular, the negation operator has been available in PROLOG since its creation [CKPR73] and extensions of Horn logic programming with negation in the bodies of program clauses were studied since mid 1970s. Proposals to address the problem of semantics for negation in logic programming can be divided into two classes. Proposals of the rst type attempt to salvage the notion of a ....

A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un systeme de communication homme-machine en francais. Technical report, University of Marseille, 1973.

....and continued by many others, combined the idea of logic as a representation language with the theory of automated deduction and constructive logic. This led Kowalski and Colmerauer to the creation of logic programming [Llo87] and the development of the first logic programming language, Prolog [CKPR73]. Even though logic programming and nonmonotonic logic share many common goals and techniques, until recently, there were no strong ties between the two research communities. Originally, declarative Prolog was defined as a small subset of predicate calculus. This dialect of Prolog is now called ....

A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un Systeme de Communication Homme-Machine en Francais. Technical report, Groupe de Intelligence Artificielle Universitae de Aix-Marseille II, Marseille, 1973.

....of the problem (Section 1.1) and present in Section 1.2 our own approach. The organization of the paper is given in Section 1.3. 1.1 Some historical remarks Historically, semantics for logic programs have been considered in the logic programming community for about 20 years. It began with [CKPR73, Kow74, vEK76] and led to the definition and implementation of PROLOG, a by now theoretically well understood programming language (at least the declarative part consisting of Horn clauses: pure PROLOG) Extensions of PROLOG allowing negative literals have been also considered in this area: they ....

A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un syst eme de communication homme-machine en francais. Technical report, Groupe de Intelligence Artificielle Universite de Aix-Marseille II, 1973.

....logically lead to the development of automated theorem proving, which took up the promise of giving logic to artificial intelligence. As a result of the effort to find simple and efficient theorem proving strategies, Horn clause programming under SLD resolution was discovered and implemented [16, 37]. DMAT, Univ. Evora, 7000 Evora, Portugal and CRIA, Uninova, jja fct.unl.pt y CRIA, Uninova and DCS, U. Nova de Lisboa, 2825 Monte da Caparica, Portugal, fcdjlmpg fct.unl.pt. We all thank Esprit BR project Compulog 2 (no. 6810) and JNICT Portugal for their support. However, because ....

A. Colmerauer, H. Kanoui, P. Roussel, and R. Pasero. Un syst'eme de communication homme-- machine en fran¸cais. Technical report, Groupe de Recherche en Intelligence Artificielle, Universit'e d'Aix--Marseille II, 1973.

....declarative specifications of objects to be computed was significantly hampered by disallowing the negation operator from the bodies of clauses. This was recognized very early on in the development of the field. In particular, the negation operator has been available in PROLOG since its creation [CKPR73] and extensions of Horn logic programming with negation in the bodies of program clauses were studied since mid 1970s. In fact, the effort to extend Horn logic programming by allowing the negation operator in the bodies was among the strongest driving forces behind the development of the area in ....

A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un systeme de communication homme-machine en francais. Technical report, University of Marseille, 1973.

....objects, logic programming with continuations. 1 Introduction From its very inception, logic programming has cross fertilized with computational linguistics in very productive ways. Indeed, logic programming itself grew from the automatic deduction needs of a question answering system in French [7]. Over the years we have seen other interesting instances of this close relatedness. The idea of continuations, developed in the field of denotational semantics [22] and functional programming [27, 26] has found its way into programming applications, and has in particular been useful recently in ....

A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un systeme de communication homme-machine en francais. Technical report, Groupe d'Intelligence Artificielle, Universite d'Aix-Marseille II, Marseille, 1973.

....order to make the thesis self contained but does not intend to be a tutorial on the subject. Lloyd 87] is an excellent and more extensive introduction to the topic. A great part of the key ideas of logic programming are attributed to Robinson [Robinson 65] Kowalski [Kowalski 74] and Colmerauer [Colmerauer 73] among others, and emerged as a consequence of earlier work on automated theorem proving. 2.1 Introduction Most of the interest in logic programming comes from its declarative nature, which allows programs to be expressed as first order theories. Such programs, in addition to their declarative ....

Colmerauer, A., Kanoui, H., Roussel, P. and Pasero, R. 1973. Un systeme de communication homme-machine en fran¸cais, Groupe de Recherche en Intelligence Artificielle, Universit'e d'Aix Marseille.

....and continued by many others, combined the idea of logic as a representation language with the theory of automated deduction and constructive logic. This led Kowalski and Colmerauer to the creation of logic programming [Llo87] and the development of the first logic programming language, Prolog [CKPR73]. Even though logic programming and nonmonotonic logic share many common goals and techniques, until recently, there were no strong ties between the two research communities. Originally, declarative Prolog was defined as a small subset of predicate calculus. This dialect of Prolog is now called ....

A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un Systeme de Communication Homme-Machine en Francais. Technical report, Groupe de Intelligence Artificielle Universitae de Aix-Marseille II, Marseille, 1973.

....logic programming restricts clauses to Horn clauses. A Horn program consists of program clauses of the form : A B 1 : Bm where m 0, and the A and the Bs are atomic formulas. ON GENERAL DISJUNCTIVE LOGIC PROGRAMS The first implementation of a logic programming system was achieved by Colmerauer and his students (1973) while the first theoretical results were described by van Emden and Kowalski (1976) The semantics for Horn logic programs, as described in van Emden and Kowalski (1976) are a fixpoint semantics based on model theory, and an operational semantics based on proof theory. Van Emden and Kowalski ....

Colmerauer A., Kanoui H., Pasero R., and Roussel P. (1973). Un systeme de communication homme-machine en francais. Technical report, Groupe de Intelligence Artificielle Universitae de Aix-Marseille II, Marseille.

....various properties. The paradigm, which first appeared in artificial intelligence, had substantial impact on other areas of computing science, such as databases, programming languages and software engineering, and led to the development of programming language Prolog and its dialects (see [6, 16]) In declarative logic programming the software development process starts with a natural language description of the domain. The description is analyzed and represented in a formal logical language with precisely defined entailment relation. Originally, proponents of the approach believed that ....

A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un Systeme de Communication Homme-Machine en Francais. Technical report, Groupe de Intelligence Artificielle Universitae de Aix-Marseille II, Marseille, 1973.

....on the subject [Ull88] has been recently published and implementation of large experimental deductive database systems [MUG86, Zan88] has begun. More information on the historical perspective of the field can be found in [Min88b] Logic programming was introduced in the early 1970 s by Colmerauer [CKRP73] and Kowalski [Kow74] and the first Prolog interpreter was implemented by Roussel in 1972 [Rou75] Logic programming introduced to computer science the important concept of declarative as opposed to procedural programming. It is based on Kowalski s principle of separation of logic and ....

A. Colmerauer, H. Kanoui, P. Roussel, and R. Passero. Un systeme de communication homme-machine en francais. Research report, Groupe de Recherche en Intelligence Artificielle, Universite d'AixMarseille, 1973.

....of automated backtracking from logic programming comes with doubts about its suitability as a feature for programming languages. Ironically, one of the strongest attacks on automated backtracking as a language feature [Sussman McDermott 72] came in the very year that Prolog was first defined [Colmerauer et al. 72] Colmerauer Roussel 93] directed at the language PLANNER, which in many ways was a precursor to Prolog [Dowson 84] But the abandonment of PLANNER in favour of CONNIVER, which may in retrospect be seen as a precursor to the committed choice logic languages with its dropping of PLANNER s ....

A.Colmerauer, H.Kanoui, R.Pasero and P.Roussel. Un Systeme de Communications Homme-Machine en Franc,ais, Rapport preliminaire, Groupe de Research en Intelligence Artificielle, Universite d'Aix-Marseille, Luminy.

....The procedure described by Kowalski may be seen as a restriction of the SL resolution procedure to Horn programs. While originally called LUSH resolution by Hill [Hil74] it has since become known as SLD resolution, i.e. SL resolution for Definite (Horn) programs. Colmerauer and his students [CKPR73] were the first to implement a language based on Horn clauses, which they called Prolog (PROgrammation en LOGique) Prolog, with some modification, has since become the standard language for logic programming. In their classic 1976 paper [vEK76] van Emden and Kowalski laid the theoretical ....

A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un systeme de communication homme-machine en francais. Technical report, Groupe de Intelligence Artificielle de Aix-Marseille II, 1973.

....Logic Programming One of the unquestionable successes of the logical approach to knowledge representation was the introduction of logic programming and the rapid proliferation of logic programming languages especially Prolog. Logic programming was introduced in the early 1970 s by Colmerauer [CKRP73] and Kowalski [Kow74] and the first Prolog interpreter was implemented by Roussel in 1972 [Rou75] The emergence of logic programming was made possible by the earlier fundamental discovery by Robinson of the resolution principle [Rob65] and subsequent development of efficient resolution refutation ....

A. Colmerauer, H. Kanoui, P. Roussel, and R. Passero. Un Systeme de Communication Homme-Machine en Francais. Research report, Groupe de Recherche en Intelligence Artificielle, Universite d'Aix-Marseille, 1973.

....logically lead to the development of automated theorem proving, which took up the promise of giving logic to artificial intelligence. As a result of the effort to find simple and efficient theorem proving strategies, Horn clause programming under SLD resolution was discovered and implemented [16, 40]. However, because Horn clauses admit only positive conclusions or facts, they give rise to a monotonic semantics, i.e. one by which previous conclusions are never questioned in spite of additional information, and thus the number of derived conclusions cannot decrease hence the monotonicity. ....

A. Colmerauer, H. Kanoui, P. Roussel, and R. Pasero. Un syst'eme de communication homme-- machine en fran¸cais. Technical report, Groupe de Recherche en Intelligence Artificielle, Universit'e d'Aix--Marseille II, 1973.

....because of my experience with solving problems using a theorem prover. However, after I read Kowalski s paper and realized that he was talking about a subset of clausal form, namely Horn clauses, I became convinced that logic programming was a viable way to do programming. Colmerauer s group [CKPR73] in Marseilles was the first to implement PROLOG, while Warren and the Pereira s [WPP77] were instrumental in developing a fast, commercially viable implementation of PROLOG. Several individuals have a claim to developing logic programming, including Cordell Green, Ted Elcock, and Carl Hewitt ....

A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un systeme de communication homme-machine en francais. Technical report, Groupe de Intelligence Artificielle Universitae de AixMarseille II, Marseille, 1973.

....One of the unquestionable successes of a logical approach in computer science was the introduction of logic programming and the rapid proliferation of logic programming languages especially Prolog. Logic programming was introduced in the early 1970 s by Kowalski [Ko74] and Colmerauer [CKRP73] and the first Prolog interpreter was implemented by Roussel in 1972 [Ro75] The emergence of logic programming was made possible by the earlier fundamental discovery by Robinson of the resolution principle [Rn65] and subsequent development of efficient resolution refutation strategies, that could ....

Colmerauer, A., Kanoui, H., Roussel, P. and Passero, R., `Un Systeme de Communication Homme-Machine en Francais', Groupe de Recherche en Intelligence Artificielle, Universite d'Aix-Marseille, 1973.

....3.1 Beginning Research The start of the field of nonmonotonic reasoning is an outgrowth of McCarthy s 1958 paper on commonsense reasoning [McC58] The paper by Hayes [Hay73] is another important early development. The P rolog programming language developed by Colmerauer and his students [CKPR73] and the PLANNER language developed by Hewitt [Hew69] were the first languages to have a nonmonotonic component. The not operator in P rolog, and the THNOT capability in PLANNER provided default rules for answering questions about data where the facts did not appear explicitly in the program. The ....

A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un systeme de communication homme-machine en francais. Technical report, Groupe de Intelligence Artificielle Universitae de Aix-Marseille II, Marseille, 1973.

No context found.

COLMERAUER, A., H. KANOUI, R. PASERO, & P. ROUSSEL. 1973. Un systeme de communication homme-machine en Francais. Technical report, Research Report, Groupe Intelligence Artificialle, Groupe Intelligence Artificielle, Universite Aix-Marseille II.

No context found.

Colmerauer, A., Kanoui, H., Roussel, P . and Pasero, R. 1973. Un systeme de communication homme-machine en fran#cais, Groupe de Recherche en Intelligence Arti#cielle, Universit#e d'Aix Marseille.

No context found.

Colmerauer, A., et. al. 1973. "Un Systeme de Communication Homme-Machine en Francais", Research Report. France: Universite Aix-Marseille II, Groupe d'Intelligence Artificielle.

No context found.

A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un systeme de communication homme-machine en francais. Technical report, University of Marseille, 1973.

No context found.

Colmerauer, A., et. al. 1973. "Un Systeme de Communication Homme-Machine en Francais," Research Report. France: Universite Aix-Marseille II, Groupe d'Intelligence Artificielle.

No context found.

A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel. Un Systeme de Communication Homme-Machine en Francais. Technical report, Groupe de Intelligence Arti cielle Universitae de Aix-Marseille II, Marseille, 1973.

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