Research this topic
Explore the main themes, entities and connections around Prolog. Start with the topic map, then use the sections below for research and deeper semantic analysis.
Explore this topic
Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.
History
Syntax and semantics
Implementation
Extensions
Key facts & relationships
High-confidence facts extracted from structured source data. Use them as anchors for further research.
- Designed by
- Alain Colmerauer
- Filename extensions
- .pl, .pro, .P
- First appeared
- 1972; 54 years ago (1972)
- Paradigm
- Logic
- Stable release
- Part 1: General core-Edition 1 (June 1995; 31 years ago (1995-06)) Part 2: Modules-Edition 1 (June 2000; 26 years ago (2000-06)) Part 3: Definite clause grammar rules (June 2025…
- Typing discipline
- Untyped (its single data type is "term")
Topics to explore
A structured outline of related entities, concepts and subtopics. Open any item to build a new map centered on it.Browse the full topic structure. Each item opens a new analysis centered on that subject.
Overview
- Logic programming
- Artificial intelligence
- Theorem proving Automated theorem proving
- Computational linguistics
- First-order logic
- Formal logic
- Programming languages Programming language
- Declarative programming
- Rules Horn clause
- Relations Finitary relation
- Computation
- Expert systems Expert system
- Term rewriting
- Type systems Type system
- Automated planning
- Question answering
- Natural language processing
- Turing-complete Turing completeness
History
- Logic
- Alain Colmerauer
- Faculty of Sciences of Luminy Aix-Marseille University Faculty of Sciences
- Aix-Marseille II University University of the Mediterranean
- Robert Kowalski
- Fortran
- David H. D. Warren
- University of Edinburgh
- Warren Abstract Machine
- Lisp Lisp (programming language)
- Fifth Generation Computer Systems project
- Kernel Language KL1
- Operating system
- Resolution Resolution (logic)
- Negation as failure
- Constraint logic programming
- Programming in the large
- Cut operator Cut (logic programming)
- Datalog
- Depth-first search
- Watson Watson (computer)
- UIMA
- SUSE Linux Enterprise Server
- Apache Hadoop
- Pattern matching
- Expressiveness Expressive power (computer science)
- GeneXus
- Graph database
- TerminusDB
- Knowledge graphs Knowledge graph
Syntax and semantics
- Refutation
- Logical consequence
- Symbolic mathematics
- Predicates Predicate (mathematical logic)
- Truth value
- Side effect Side effect (computer science)
- Imperative programming
- Data type
- Atoms Symbol (programming)
- Floats Floating-point arithmetic
- Integers Integer
- Arity
- Logical operator
- Operator Operator (programming)
- Conjunction Logical conjunction
- Disjunction Logical disjunction
- Input/output
- Recursive Recursion
- SLD resolution
- Unifies Unification (computer science)
- Backtracking
- Non-monotonic Non-monotonic logic
- Sound Soundness
- "ground" Ground expression
Programming in Prolog
- Optimizing compiler
- DCG Definite clause grammar
- Quicksort
Design patterns of Prolog
- Design pattern Design pattern (computer science)
- Software design
- Higher-order programming
Higher-order programming
- Currying
- List comprehension
- Perfect numbers
- Map Map (higher-order function)
- Functional programming
- HiLog
- ΛProlog
Modules
- Programming in the large Programming in the large and programming in the small
- Module system Modular programming
- Prolog systems Comparison of Prolog implementations
- Quintus Quintus Prolog
- SICStus
- Logtalk
- Contextual Logic Programming Contextual Logic Programming?action=edit&redlink=1
- Ciao Ciao (programming language)
- XSB
Parsing
- Monads Monads in functional programming
Meta-interpreters and reflection
Turing completeness
Implementation
- International Organization for Standardization
- Technical standard
- ISO/IEC JTC1 JTC1
- SC22
- Abstract interpretation
- Clause binarization Clause binarization?action=edit&redlink=1
- Stack-based virtual machines Stack machines
- Tail call optimization Tail call
- Tail recursion
- Term indexing
- Data structure
- Sub-linear-time Sublinear time
- Superimposed Superimposed code
- WIN-PROLOG Logic Programming Associates
- WordNet
- B-Prolog
- SWI-Prolog
- YAP YAP (Prolog)
- Memoization
- Space–time tradeoff
- Field-programmable gate array
- Sega
- Sega AI Computer
- Natural language
- Japanese language
- Touch pad
Extensions
- Object-oriented Object-oriented programming
- Linear logic
- Higher-order logic
- Knowledge bases Knowledge base
- Type safety
- Constraint satisfaction
- Combinatorial optimisation
- Production scheduling
- Rational numbers Rational number
- Flora-2
- F-logic
- Transaction logic
- Defeasible reasoning
- Oblog Oblog?action=edit&redlink=1
- Prolog++
- Visual Prolog
- Graphics library
- Distributed computing
- Message Passing Interface
- Server-side
- Web programming
- HTML
- XML
- Semantic web
- Resource Description Framework
- Web Ontology Language
- Client-side
- JSON-RPC
- Websockets
- Knowledge representation
Interfaces to other languages
Related languages
- Gödel Gödel (programming language)
- Concurrent constraint logic programming
- SICStus Prolog
- Turing-complete
- Mercury Mercury (programming language)
- Planner Planner (programming language)
- Scientific Community Metaphor
- AgentSpeak
- Multi-agent systems Multi-agent system
- Erlang Erlang (programming language)
- PicoLisp
Advanced semantic analysis
Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.
Map overview Semantic statistics
Number of nodes, edges, triples, density and central hubs. Use it to gauge the size and connectivity of the map.Prolog
How this topic connects Entity context
Quick relationship hints grouped by predicate. Useful for spotting recurring semantic connections around the current entity.See the strongest relationship patterns around the current topic before diving into the raw triples.
Prolog
Top relations
Important terminology Word statistics
Frequent words and multi-word phrases across the lead, headings, infobox and body. Useful for terminology coverage.Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.
Important terminology
programming logic language predicates query used program languages clauses system example systems term terms called also iso java implementations swi-prolog
Entity relationships Subject–Predicate–Object triples
Extracted RDF-like relationships with confidence and source. The table includes structured facts and lower-confidence contextual relations.| Subject | Predicate | Object | Confidence | Src |
|---|---|---|---|---|
| Prolog | Designed by | Alain Colmerauer | 1.00 | infobox |
| Prolog | Filename extensions | .pl, .pro, .P | 1.00 | infobox |
| Prolog | First appeared | 1972; 54 years ago (1972) | 1.00 | infobox |
| Prolog | Paradigm | Logic | 1.00 | infobox |
| Prolog | Stable release | Part 1: General core-Edition 1 (June 1995; 31 years ago (1995-06)) Part 2: Modules-Edition 1 (June 2000; 26 years ago (2000-06)) Part 3: Definite clause grammar rules (June 2025… | 1.00 | infobox |
| Prolog | Typing discipline | Untyped (its single data type is "term") | 1.00 | infobox |
| Prolog | Website | Part 1: www.iso.org/standard/21413.html Part 2: www.iso.org/standard/20775.html Part 3: www.iso.org/standard/83635.html | 1.00 | infobox |
| Prolog | is a | logic programming language that has its origins in artificial intelligence | 0.90 | text |
| Prolog | is a | Turing-complete | 0.90 | text |
| Prolog | is a | multi-paradigm language with interfaces | 0.90 | text |
| Prolog | is a | Prolog interpreter written in | 0.90 | text |
| Prolog | is a | subset of Planner | 0.90 | text |
Related concept clusters Concept neighborhoods
Clusters of nearby vocabulary surrounding the topic. Scan them for adjacent concepts and language you may have missed.These clusters group vocabulary that occurs around closely connected concepts in the source material.
Connections between topic areas Semantic bridges
Bridge nodes connect otherwise separate parts of the map. Expand a row to inspect the topic groups on each side.Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.