Syntax and semantics of logic programming

<a href="/facts/Logic_programming/Xgh8lj3F">Logic programming</a> is a <a href="/facts/Programming_paradigm/7LwgRpB3">programming paradigm</a> that includes languages based on formal logic, including <a href="/facts/Datalog/67jbYWDb">Datalog</a> and <a href="/facts/Prolog/r5h66Qh1">Prolog</a>. This article describes the syntax and semantics of the purely <a href="/facts/Declarative_programming/gogtdzcJ">declarative</a> subset of these languages. Confusingly, the name "logic programming" also refers to a specific programming language that roughly corresponds to the declarative subset of Prolog. Unfortunately, the term must be used in both senses in this article.
Declarative logic programs consist entirely of rules of the form

H :- B1, ..., BN.

Each such rule can be read as an <a href="/facts/Material_conditional/hYf4b7AE">implication</a>:

B
          
            1
          
        
        ∧
        …
        ∧
        
          B
          
            n
          
        
        →
        H
      
    
    {\displaystyle B_{1}\land \ldots \land B_{n}\rightarrow H}

meaning "If each 
 
 
 
 
 B
 
 i
 
 
 
 
 {\displaystyle B_{i}}
 
 is true, then 
 
 
 
 H
 
 
 {\displaystyle H}
 
 is true". Logic programs compute the set of facts that are implied by their rules.
Many implementations of Datalog, Prolog, and related languages add procedural features such as Prolog's <a href="/facts/Cut_(logic_programming)/dvwr9fq4">cut operator</a> or extra-logical features such as a <a href="/facts/Foreign_function_interface/ntAxkhK0">foreign function interface</a>. The formal semantics of such extensions are beyond the scope of this article.

Syntax and semantics of logic programming open-in-new

Syntax and semantics of logic programming