Prolog

Prolog is a general purpose logic programming language associated with artificial intelligence and computational linguistics.

Prolog has its roots in first-order logic, a formal logic, and unlike many other programming languages, Prolog is declarative: the program logic is expressed in terms of relations, represented as facts and rules. A computation is initiated by running a query over these relations.

The language was first conceived by a group around Alain Colmerauer in Marseille, France, in the early 1970s and the first Prolog system was developed in 1972 by Colmerauer with Philippe Roussel.

Prolog was one of the first logic programming languages, and remains the most popular among such languages today, with many free and commercial implementations available. While initially aimed at natural language processing, the language has since then stretched far into other areas like theorem proving, expert systems, games, automated answering systems, ontologies and sophisticated control systems. Modern Prolog environments support creating graphical user interfaces, as well as administrative and networked applications.

Read more about PrologSyntax and Semantics, Design Patterns, Higher-order Programming, Modules, Parsing, Meta-interpreters and Reflection, Turing Completeness, Criticism, Extensions, Interfaces To Other Languages, History

Other articles related to "prolog":

B-Prolog - CLP(FD)
... Like many Prolog-based finite-domain constraint solvers, B-Prolog's finite-domain solver was heavily influenced by the CHIP system ... The first fully-fledged solver was released with B-Prolog version 2.1 in March 1997 ... implementation language, the constraint solving part of B-Prolog is relatively small (3800 lines of Prolog code and 6000 lines of C code, including ...
Prolog - History
... The name Prolog was chosen by Philippe Roussel as an abbreviation for programmation en logique (French for programming in logic) ... According to Robert Kowalski, the first Prolog system was developed in 1972 by Alain Colmerauer and Phillipe Roussel ... The first implementations of Prolog were interpreters, however, David H ...
How To Determine Machine Epsilon - Approximation Using Prolog
... arithmetic and recursive predicates in Prolog is epsilon(X)- Y is (1.0 + X), Y = 1.0, write(X) ... An example execution in the SWI-Prolog interpreter 1 ?- epsilon(1.0) ...
The Morall Fabillis Of Esope The Phrygian - The Thirteen Fabillis - Prolog and Fabill 1 - Prolog
... The Prolog introduces the whole cycle in principle, not merely the first fabill ... The prolog immediately foreshadows methods that the rest of the cycle will further develop ...
Strawberry Prolog
... Strawberry Prolog is a dialect of the Prolog programming language ... Its syntax is very close to that of ISO-Prolog but it has many extensions which are not part of the standard ... The main idea of Strawberry Prolog is to be very easy to use and that is why some universities use it for their Prolog courses ...