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

Overcoming global issues in e-commerce, E-commerce advance tremendous chanc...

E-commerce advance tremendous chance by permitting industrialist to buy Materials at a low price internationally. Also they give companies the opportunity to sell to universal stor

Convergence mean with respect to e-commerce, What does the term convergence...

What does the term convergence mean with respect to E-commerce? Convergence with respect to e-commerce   The ability to leverage and integrate the several data sources and

Which datatype cannot be used to define parameters, Which datatype cannot b...

Which datatype cannot be used to define parameters. Type F datatype is not used to explain parameters.

What is an compiled languages, What is an compiled languages In compile...

What is an compiled languages In compiled languages the instructions into machine code and kept them  in a separate file for later implementation. Many modern compilers can com

Determine the odd parity bit for f, Q. Determine the odd parity bit for F. ...

Q. Determine the odd parity bit for F. Q. Convert the following from binary to decimal, hexadecimal, BCD and octal. a) 1000000011   b) 0001010110101  c) 1 Q. Convert the f

Prolog programming language, Prolog Programming Language : Probably pr...

Prolog Programming Language : Probably programming languages are procedural: than the programmer specifies exactly the right instructions (algorithms) required to get an agent

C++, find the minimum total number of shelves including the loading process...

find the minimum total number of shelves including the loading process

Explain the access methods used in lans, Explain the access methods used in...

Explain the access methods used in LANs. Access methods utilized in LAN: i. Switched access: this is used in LANs which are assigned around CBXs. Electronic switching

Simplified boolean expression, Simplified the Boolean Algebra (x + y)(x + z...

Simplified the Boolean Algebra (x + y)(x + z) simplifies to ? Ans. x + yz as simplified the Boolean Algebra expression. [(x + y) (x + z)] = xx + xz + xy + yz = x + xz + xy + y

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