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

Explain loop level of parallel processing, Loop Level At this stage, fo...

Loop Level At this stage, following loop iterations are candidates for parallel execution. Though, data dependencies among subsequent iterations can restrict parallel execution

Describe miscellaneous and privileged instructions, Q. Describe Miscellaneo...

Q. Describe Miscellaneous and Privileged Instructions? These instructions don't fit in any of above categories. I/O instructions: start I/O, stop I/O, and test I/O. Characteris

Which TTL logic gate is used for wired anding, Which TTL logic gate is used...

Which TTL logic gate is used for wired ANDing ? Ans. Open collector output, TTL logic gate is used.

Control hazard and delayed branching, Described Instruction or control haza...

Described Instruction or control hazard? Ans: The pipeline can be stalled due to delay in the availability of an instruction. For instance, this may be a result of a miss in t

Pipelining - computer architecture, Pipelining - computer architecture: ...

Pipelining - computer architecture: The Pipeline Defined According to John Hayes "A pipeline processor consists of a sequence of processing circuits, called stages or

Find how many bits of adc are required to get an resolution, Find how many ...

Find how many bits of ADC are required to get an resolution of 0.5 mV if the maximum full scale voltage is 10 V Ans. Given Resolution=.5mV Full scale output=+10v %resolut

Visual basic application, Name the platforms by which visual basic applicat...

Name the platforms by which visual basic applications are available? Ans) Most of the visual basic applications are available on 32 bit Intel platforms. These applications also

Illustrate abstract class, What is an abstract class? Please, expand by exa...

What is an abstract class? Please, expand by examples of using both. Explain why?   Abstract classes are closely related to interfaces. They are classes that cannot be instanti

Perfect induction, Any identity or equality in Boolean algebra, suchas de M...

Any identity or equality in Boolean algebra, suchas de Morgan's Theorem can be proved usingthe method of perfect induction. 1. All combinations of variables are written down.

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