Prolog programming language - artificial intelligence, Computer Engineering

Assignment Help:

Prolog Programming Language - Artificial intelligence:

Most of the programming languages are procedural: the programmer specifies exactly the correct instructions (algorithms) required to get an agent to function correctly. It wonders for many people that there is another way to write programs. Program is declarative programming when the user declares what the output to a function should look like given some information regarding the input. The agent then searches for an answer which fits the declaration, and returns any it finds.

As an instance, suppose a parent asking their child to run to the shop and buy some groceries. To do this in a declarative fashion,in simple manner, the parent needs to write shopping list. The parents have "programmed" their child to perform their work in the knowledge that the child has underlying search routines which will enable her orhim to get to the shop, find and buy the groceries, and later come home. To instruct their child in a procedural fashion, they would need to tell the child to go out of the front door, turn right, walk down the street, stop after 60 steps, and so on.

We see that declarative programming languages may have some advantages over procedural ones. Actually, it is often said that a Java program written to do the same as a Prolog program typically takes about 10 times the number of lines of code. Many Artificial Intelligence researchers try out an idea in Prolog before implementing it more completely in other languages; because Prolog may be used to perform searches in simple way (see later).

A well-known declarative language which is used many times by Artificial Intelligence researchers is Prolog, which is centred on first-order logic. For any specific declarative programming language, the 2 most important aspects are: how information is denoted, and the underlying search routines upon which the language is based. Robert Kowalski put this in the most succinct way:

Algorithm = Control +Logic

 


Related Discussions:- Prolog programming language - artificial intelligence

Distributivity of connectives, Distributivity of Connectives : In our ...

Distributivity of Connectives : In our last analogy with arithmetic will involve a very well-technique need for playing around with algebraic properties. But assume there if w

Illustrate about the single inheritance, Illustrate about the single inheri...

Illustrate about the single inheritance During inheritance, superclass feature may by override by a subclass defining that feature with the same name. The overriding features (

What is data movement, Data movement instructions shift data from one locat...

Data movement instructions shift data from one location to another. The source and destination locations are verified by the addressing modes, and can be registers or memory. Many

Determine by which final selector is connected, The final selector is conne...

The final selector is connected to the (A) calling subscriber.                     (B) switching network. (C) called subscriber.                      (D) li

Define interrupts and instruction cycle, Q. Define Interrupts and Instructi...

Q. Define Interrupts and Instruction Cycle? Let's precise the interrupt process, on the event of an interrupt, an interrupt request (in form of a signal) is concerned to CPU. T

Define wilkes control unit, Q. Define Wilkes Control Unit? Prof. M. V. ...

Q. Define Wilkes Control Unit? Prof. M. V. Wilkes of the Cambridge University Mathematical Laboratory invented the term microprogramming in 1951. He offered a systematic altern

Illustration of equivalent exe program, Q. Illustration of equivalent EXE p...

Q. Illustration of equivalent EXE program? An illustration of equivalent EXE program for COM program is: ; ABSTRACT this program adds 2 8-bit numbers in the memory locations

Two ways for restricting the value range for a domain, What are the two way...

What are the two ways for restricting the value range for a domain? By specifying fixed values. By stipulating a value table.

Existential introduction, Existential Introduction: Now if we have any...

Existential Introduction: Now if we have any sentence as, A, and variable, v, that does not occur in A, so then for any ground term, g, such occurs in A, than we can turn A in

Gantt chart, The Gantt chart shows the several activities of each processor...

The Gantt chart shows the several activities of each processor with respect to progress in time in idle-overhead -busy modes with respect to each processor. Kiviat diagram:  Th

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd