{{language
    | SWI-Prolog
    | strength = strong
    | checking = dynamic
    | gc = yes
    | exec = both
    | LCT = yes
    | compat = structural
    | parampass = value
    | bnf = [http://cdn.bitbucket.org/muspellsson/rosetta/downloads/prolog-bnf.html]
}}
{{ language programming paradigm | Declarative}}
{{ language programming paradigm | Logic_Programming }}
[[wp:SWI-Prolog|SWI-Prolog]] is a [[logic programming]] language.

It is programmed declaratively, using ''resolution'' and ''backtracking'' to confirm propositions based on declared facts and rules.
<br clear="both">