Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


What is the language used for Artificial Intelligence?



What is the language used for Artificial Intelligence?..

Answer / muhammad ahmed

Artificial Intelligence is a theory and can be implemented
in almost every language.

Just like we can supply a code in any language that uses
Newton's law of motions , we can supply such code that
implemenents AI concepts in any language (almost).

Some languages however do stand out , which were built to
design AI based knowledge basis.

One such language is LISP, another widely used language is
Prolog that is available with a visual IDE too , known as
Visual Prolog. These languages work on facts we provide ,
then answer our queries using various inference algorithms

Is This Answer Correct ?    0 Yes 1 No

Post New Answer

More Programming Languages AllOther Interview Questions

How to call static method in Java?

2 Answers   Epoch,


In Bioinformatics, a DNA sequence is made up of a combination of 4 characters, namely “A,C,G,T”. A subsequence of a given sequence of characters a0, a1, …an- 1, is any subset of the characters taken in order, of the form ai0 , ai1 ,…..aik-1 where 0 &#8804; i0 <i1….< ik-1 &#8804; n-1. For example in the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, we can have subsequences “A,G,T”, “A,C,A,A” and many more. A subsequence is palindromic if it is the same whether read left to right or right to left. For instance, the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, has many palindromic subsequences, including “A,C,G,C,A” and “A,A,A,A” (on the other hand, the subsequence “A,C,T” is not palindromic). Devise an algorithm (using dynamic programming) that takes a sequence of characters X[0 … n-1] from the alphabet set (A,C,G,T) and returns the (length of the) longest palindromic subsequence. Implement the algorithm in an appropriate language.

1 Answers  


what is the system development cycle

0 Answers  


Is CTS company do serious backgroung check?

0 Answers   CTS,


THE CHANNEL IN DATA COMMUNICATION CAN BE?

0 Answers   TCS,


i want to insert textbox value to sql db. i have only one text box but store four values. ple give any one give sample code in asp.net c#..

1 Answers   Concentrix,


kindly send interview materials

0 Answers   SoftSquare,


What is %Type,%Rowtype?

0 Answers  


About CLR, reflection and assemblies?

2 Answers   pspl,


how many types of operating system are avaliable?

0 Answers   IBM,


Explain the difference between an expert and a novice user. How would your strategy for designing user interfaces for an expert user differ from that for designing user interfaces for a novice user.

0 Answers  


A combination of multiple keys defined in a physical file or logical file is called a _________ key

3 Answers   IBM,


Categories