Prolog is a weakly typed language with static scope rules and dynamic type checking. To generate another solution, use the backtracking strategy.
In such case, the run time system will be asked to find another solution.
To deduce the answer, there will be more than one way. Prolog features are 'Logical variable', which means that they behave like uniform data structure, a backtracking strategy to search for proofs, a pattern-matching facility, mathematical variable, and input and out are interchangeable. Prologs of PrologII family are the other kind of prologs which are descendants of Marseille Prolog. In this tutorial, the program was written in the 'Standard' Edinburgh Prolog. After that, it was adopted Prolog as a development language. In 1981, a Japanese computer Project of 5 th generation was announced. It supports the declarative programming paradigm. The major example of fourth-generation programming language was prolog. The first Prolog was 'Marseille Prolog', which is based on work by Colmerauer. When a user asks a question, then to determine the answer, the run time system searches through the database of facts and rules. To obtain the solution, the user asks a question rather than running a program. A logical relationship describes the relationships which hold for the given application. Prolog is a declarative language, which means that a program consists of data based on the facts and rules (Logical relationship) rather than computing how to find a solution. In the logic programming paradigm, prolog language is most widely available. Prolog stands for programming in logic.
0 kommentar(er)
