Egor Urvanov

Prolog

Specs and architecture · a logic programming language

A language in which a program is facts and inference rules, and an engine finds the answer to a question by itself. Facts: “booking b1 is room 2, from 10 to 11”. A rule: “two bookings overlap if the room is the same and the times overlap”. A question: “which bookings overlap b1?”. Created in 1972 in France. Any program can be written in Prolog, including one that never finishes, so Rice’s theorem applies to it.

fact: booking b1: room 2, 10–11fact: booking b2: room 2, 10:30–12rule: overlap if same room and times overlapquestion: what overlaps b1?the engine searches?b2, or an endless searcha complete language: an endless loop can be written, Rice’s theorem applies● model, people, systems, data  ● agent and harness  ● risk, stop, boundaryFacts and a rule, a question: the engine finds the answer itself. The language is complete: the search may never finish

Source: Wikipedia: Prolog

Related terms

Whole glossary

© 2026 Egor Urvanov