jagomart
digital resources
picture1_Computer Science Thesis Pdf 192267 | Lect08


 173x       Filetype PDF       File size 0.12 MB       Source: courses.cs.vt.edu


File: Computer Science Thesis Pdf 192267 | Lect08
programming languages lecture 8 logic programming languages benjamin j keller department of computer science virginia tech blacksburg virginia 24061 usa programming languages lecture 16 logic programming languages 2 history and ...

icon picture PDF Filetype PDF | Posted on 05 Feb 2023 | 2 years ago
Partial capture of text on file.
                Programming Languages
      Lecture 8: Logic Programming Languages
                   Benjamin J. Keller
         Department of Computer Science, Virginia Tech
              Blacksburg, Virginia 24061 USA
           Programming Languages — Lecture 16 — Logic Programming Languages               2
                 History and Goals of Logic Programming
             • Competitor to LISP for AI programming in 80’s
             • Adopted by Japanese for Fifth Generation Computing Project
                (Prolog).
             • What is logic programming?
                 – Programming based on the notion of logical deduction in
                    symbolic logic.
                 – Implementation typically based on mechanisms for
                    automatic theorem proving.
           Programming Languages — Lecture 16 — Logic Programming Languages               3
            History and Goals of Logic Programming (cont)
             • “A constructive proof that for every list L there is a
                corresponding sorted list S composed of the same elements as L
                yields an algorithm for sorting a list.”
             • Philosophy is shared by others not working on “logic
                programming”
                 – Constable at Cornell, Martin-L¨of in Sweden, Calculus of
                    Constructions group in France.
                 – These groups want to extract (more traditional) program
                    from constructive proofs.
             • Very-High-Level Languages - non-procedural
             • State what must be done, not how to do it. Idea is to separate
                logic from control.
           Programming Languages — Lecture 16 — Logic Programming Languages               4
                                Introduction to Prolog
             • Prolog (PROgramming in LOGic), first and most important
                logic programming language.
             • Developed in 1972 by Alain Colmerauer in Marseilles.
             • Relational rather than functional programming language
             • Often best to start out as thinking of Prolog in terms of
                language for working with a data base.
The words contained in this file might help you see if this file matches what you are looking for:

...Programming languages lecture logic benjamin j keller department of computer science virginia tech blacksburg usa history and goals competitor to lisp for ai in s adopted by japanese fifth generation computing project prolog what is based on the notion logical deduction symbolic implementation typically mechanisms automatic theorem proving cont a constructive proof that every list l there corresponding sorted composed same elements as yields an algorithm sorting philosophy shared others not working constable at cornell martin sweden calculus constructions group france these groups want extract more traditional program from proofs very high level non procedural state must be done how do it idea separate control introduction rst most important language developed alain colmerauer marseilles relational rather than functional often best start out thinking terms with data base...

no reviews yet
Please Login to review.