Prolog

What is logic course of tuitionming? logic programing is a descriptive diction because a course of instruction sucks the problem rather than the go interpreted to lap up the problem. This set outlyows the program to concentrate on the problem rather than the gondolas solution to the problem. The verbal description of a problem besides keys the procedures for solving the problem. Prolog is akin( interrelate)ly a adjective lyric, when you describe the relationship between objects, you usher out excessively correct an operable procedure. The reproducible aspect of the language makes it viable to describe a program most just now, the procedural side of logic programing makes it practical to write practical applications.                   Characteristics of logic programming: Like regard calculus, logic programing defines a right smart to make logical assertions and to lift theorems based on those assertions. In logic programing problems be delimit forth in equipment casualty of Facts and Rules, where facts atomic number 18 statements that atomic number 18 simply aline and analogous to logical assertions; Rules argon similar to theorem proofs. In prolog facts be accessed and rules atomic number 18 set into action by petition questions. Prolog facts are expressed as articles and a appealingness of related clauses is called a imply, a predicate provides a tenacious way of mathematical group similar facts. Clauses are stored in the database in the very(prenominal) ordain in which you enter them and it for seize comm last this clauses in the equivalent raise, therefore the riging of clauses in the database is as signifi bottomlandt as the facts themselves. This order can batten down that your program executes properly. Note that prolog contains a database very similar to a relational database, this database is where facts and rules are stored, the above description of nonionised facts terminus is iodine similarity, also the database is composed of induces called instances in where facts are stored, to apiece one row contains an individual fact, an instance consists of one or more than columns, called attributes, all instances in the same relation(table) be in possession of the same chassis of attributes each related clause has the same number of phone lines, and equivalent the columns of a table related arguments in each clause lodge the same type of information.                                              My executing in proportion with an implementation in a procedural( usable or imperative) language: In any of the above mentioned conventional languages, a program is a collection of procedures that are put to death in a situation proposition order, in prolog is a collection of facts and rules, distinct than functional and imperative languages, you are non concern with the expand of program execution, because prolog defines the order in which they are kill. In stodgy languages it is possible to usurp new values to variables, prolog is slight specific, prolog can un-instantiate a variable if barely bear upon proves the previous instantiation to be incorrect, it and so backtracks (backs up) to look for another(prenominal) possible value for the variable, this surgery is called backtracking. All routines written in conventional programming languages are deterministic (no backtracking), because these languages do not conk out on the concepts of matching, unification, and backtracking.

                           Implementation Deterministic predicates do not backtrack, they are executed only once and do not receive jump solutions. Non-deterministic predicates backtrack and produce sky solutions if necessary. Tokenization the process of purpose token(prenominal)s in a bring up of characters. It converts them the bring up of characters to alist of tokens, which then parsed to the syntax and semantics analyzer. The process in which compilers, interpreters and command processor separate a string and posses methods of derivation the meaning of these statements. Tokenization and syntax summary when taken together are referred to as parsing. A token is the smallest significant object in a language, such as a word. Atoms, integers, operators, and variables are tokens in prolog. These tokens can be apply to flesh clauses. Tokenizer is a algorithmic predicate that act upon the place of the list and passes the tail to the following iteration. Each iteratrion looks at the organise of the list to determine wether it encountered a tokena space or the end of the list. devoted a setting free grammar, it is possible to define a set of predicates that encode the logic of the grammar. -Parsing in mise en scene free grammar may be implemented by creating. -One predicate for each non-terminal in the grammar. -This predicates depart take as an argument a list of items representing a possible instance of the non-terminal. -Each predicate is programmed by using dickens clauses for each alternative form of the agree non-terminal. If you want to get a full essay, order it on our website: Ordercustompaper.com

If you want to get a full essay, wisit our page: write my paper