Scribd
Upload
144 views6 pages

PROLOG Programming Language

Prolog is a logic programming language used for artificial intelligence, databases, and mathematics. It is declarative, meaning programs consist of facts and logical rules rather than instructions. The user asks questions of the program, and Prolog searches its database to logically deduce answers through techniques like resolution and unification rather than running code to compute solutions. Prolog was developed in the 1970s from research collaborations in France and Scotland.

Uploaded by

Sàlà Lâ Bãd Bøÿž
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
144 views6 pages

PROLOG Programming Language

Prolog is a logic programming language used for artificial intelligence, databases, and mathematics. It is declarative, meaning programs consist of facts and logical rules rather than instructions. The user asks questions of the program, and Prolog searches its database to logically deduce answers through techniques like resolution and unification rather than running code to compute solutions. Prolog was developed in the 1970s from research collaborations in France and Scotland.

Uploaded by

Sàlà Lâ Bãd Bøÿž
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 6

PROLOG

INTRODUCTION TO PROLOG PROGRAMMING


Prolog

 PROgramming in LOGic
 It is the most widely used logic programming language
 Its development started in 1970 and it was result of the collaboration between
researchers from Marseille, France, and Edinburgh, Scotland
 Main applications:
 Artificial intelligence: expert systems, natural language processing, …
 Databases: query languages, data mining,…
 Mathematics: theorem proving, symbolic packages,…
Prolog

 Prolog is a declarative language


 A program is a collection of axioms from which theorems can be proven.
 Rather than describing how to compute a solution, a program consists of a data base of
facts and logical relationships (rules).
 Rather then running a program to obtain a solution, the user asks a question. When
asked a question, the run time system searches through the data base of facts and rules
to determine (by logical deduction) the answer.
Resolution

 Horn clauses can capture most logical statements


 But not all
 The derivation of new statements is known as resolution
 The logic programming system combines existing statements to find new statements
 For instance,
C  A, B A and B imply C
DC
 D  A, B If we know that A and B imply C,
and that C implies D,
then we can deduce that A and B imply D
Example

flowery(X)  rainy(X) Predicate Applied to a Variable


rainy(Rochester) Predicate Applied to an Atom

 flowery(Rochester) Free Variable X acquired value


Rochester during the resolution
This is known as Unification
THANK YOU

You might also like