{
  "aliases": [
    "davis-logemann-loveland-algorithm",
    "davis-putnam-logeman-loveland-algorithm",
    "davis-putnam-logemann-loveland",
    "davis-putnam-logemann-loveland-algorithm"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn logic and computer science, the **Davis–Putnam–Logemann–Loveland** (**DPLL**) **algorithm** is a complete, backtracking-based search algorithm for deciding the satisfiability of [[propositional logic formulae|09K9MWD2QQ]] in [[conjunctive normal form|07C4A8Y18K]], i.e. for solving the CNF-SAT problem.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "aliases": [
      "davis-logemann-loveland-algorithm",
      "davis-putnam-logeman-loveland-algorithm",
      "davis-putnam-logemann-loveland",
      "davis-putnam-logemann-loveland-algorithm"
    ],
    "inventory": [
      "217JWT2N1D"
    ],
    "kind": "concept",
    "name": "DPLL algorithm",
    "same_as": {
      "wikidata": "Q2030088",
      "wikipedia": "DPLL algorithm"
    },
    "sources": [
      {
        "locator": "DPLL algorithm",
        "mention": "wikipedia://en/2745094",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:2745094@r1341870655"
      }
    ],
    "tag": "K7R9D390SP"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/K7R9D390SP/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/K7R9D390SP.md",
  "msc": null,
  "name": "DPLL algorithm",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/K7R/K7R9D390SP.md",
  "status": null,
  "tag": "K7R9D390SP",
  "uri": "m2://K7R9D390SP",
  "url": "https://math2.tamnd.com/wiki/dpll-algorithm/",
  "writing": {
    "tag": "K7R9D390SP",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}