"SAT" meaning in Translingual

{
  "etymology_templates": [
    {
      "args": {
        "1": "mul",
        "2": "Boolean satisfiability problem"
      },
      "expansion": "Abbreviation of Boolean satisfiability problem",
      "name": "abbrev"
    }
  ],
  "etymology_text": "Abbreviation of Boolean satisfiability problem.",
  "head_templates": [
    {
      "args": {
        "1": "mul",
        "10": "",
        "2": "symbol",
        "3": "",
        "4": "",
        "5": "or",
        "6": "",
        "7": "or",
        "8": "",
        "9": "or",
        "cat2": "",
        "f1lang": "en",
        "f1nolink": "",
        "f2lang": "en",
        "f2nolink": "",
        "f3lang": "en",
        "f3nolink": "",
        "f4lang": "en",
        "f4nolink": "",
        "head": "",
        "head2": "",
        "head3": "",
        "head4": "",
        "sc": "Latn",
        "sort": ""
      },
      "expansion": "SAT",
      "name": "head"
    },
    {
      "args": {},
      "expansion": "SAT",
      "name": "mul-symbol"
    }
  ],
  "lang": "Translingual",
  "lang_code": "mul",
  "pos": "symbol",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "Translingual entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Translingual links with redundant alt parameters",
          "parents": [
            "Links with redundant alt parameters",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Translingual links with redundant wikilinks",
          "parents": [
            "Links with redundant wikilinks",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Translingual terms with redundant script codes",
          "parents": [
            "Terms with redundant script codes",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "mul",
          "name": "Theory of computing",
          "orig": "mul:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "0 24 22 22 33",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "0 31 19 20 29",
          "kind": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        },
        {
          "_dis": "5 19 33 31 13",
          "kind": "other",
          "name": "English pseudo-acronyms",
          "parents": [],
          "source": "w+disamb"
        }
      ],
      "glosses": [
        "The decision problem of deciding whether a given Boolean formula has an assignment of Boolean values to its variables that makes it true. A famous NP-complete problem."
      ],
      "id": "en-SAT-mul-symbol-GCRzBWcL",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "decision problem",
          "decision problem"
        ],
        [
          "Boolean",
          "Boolean"
        ],
        [
          "formula",
          "formula"
        ],
        [
          "NP-complete",
          "NP-complete"
        ]
      ],
      "raw_glosses": [
        "(computing theory) The decision problem of deciding whether a given Boolean formula has an assignment of Boolean values to its variables that makes it true. A famous NP-complete problem."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Boolean satisfiability problem"
      ]
    }
  ],
  "word": "SAT"
}

{
  "categories": [
    "English 1-syllable words",
    "English 3-syllable words",
    "English countable nouns",
    "English entries with incorrect language header",
    "English entries with language name categories using raw markup",
    "English initialisms",
    "English lemmas",
    "English nouns",
    "English pseudo-acronyms",
    "English terms with IPA pronunciation",
    "English terms with audio links",
    "English uncountable nouns",
    "Rhymes:English/iː",
    "Rhymes:English/iː/3 syllables",
    "Rhymes:English/æt",
    "Rhymes:English/æt/1 syllable"
  ],
  "etymology_templates": [
    {
      "args": {
        "1": "mul",
        "2": "Boolean satisfiability problem"
      },
      "expansion": "Abbreviation of Boolean satisfiability problem",
      "name": "abbrev"
    }
  ],
  "etymology_text": "Abbreviation of Boolean satisfiability problem.",
  "head_templates": [
    {
      "args": {
        "1": "mul",
        "10": "",
        "2": "symbol",
        "3": "",
        "4": "",
        "5": "or",
        "6": "",
        "7": "or",
        "8": "",
        "9": "or",
        "cat2": "",
        "f1lang": "en",
        "f1nolink": "",
        "f2lang": "en",
        "f2nolink": "",
        "f3lang": "en",
        "f3nolink": "",
        "f4lang": "en",
        "f4nolink": "",
        "head": "",
        "head2": "",
        "head3": "",
        "head4": "",
        "sc": "Latn",
        "sort": ""
      },
      "expansion": "SAT",
      "name": "head"
    },
    {
      "args": {},
      "expansion": "SAT",
      "name": "mul-symbol"
    }
  ],
  "lang": "Translingual",
  "lang_code": "mul",
  "pos": "symbol",
  "senses": [
    {
      "categories": [
        "Translingual abbreviations",
        "Translingual entries with incorrect language header",
        "Translingual lemmas",
        "Translingual links with redundant alt parameters",
        "Translingual links with redundant wikilinks",
        "Translingual symbols",
        "Translingual terms with redundant script codes",
        "mul:Theory of computing"
      ],
      "glosses": [
        "The decision problem of deciding whether a given Boolean formula has an assignment of Boolean values to its variables that makes it true. A famous NP-complete problem."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "decision problem",
          "decision problem"
        ],
        [
          "Boolean",
          "Boolean"
        ],
        [
          "formula",
          "formula"
        ],
        [
          "NP-complete",
          "NP-complete"
        ]
      ],
      "raw_glosses": [
        "(computing theory) The decision problem of deciding whether a given Boolean formula has an assignment of Boolean values to its variables that makes it true. A famous NP-complete problem."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Boolean satisfiability problem"
      ]
    }
  ],
  "word": "SAT"
}