See 3-SAT in All languages combined, or Wiktionary
{
"etymology_text": "From SAT and 3, the number of literals per clause.",
"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": "",
"nolinkhead": "",
"sc": "Latn",
"sort": ""
},
"expansion": "3-SAT",
"name": "head"
},
{
"args": {},
"expansion": "3-SAT",
"name": "mul-symbol"
}
],
"lang": "Translingual",
"lang_code": "mul",
"pos": "symbol",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Translingual entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"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"
}
],
"glosses": [
"The decision problem of deciding whether a given Boolean formula in conjunctive normal form with three literals per clause is satisfiable. A famous NP-complete problem."
],
"id": "en-3-SAT-mul-symbol--rhkrrqU",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"decision problem",
"decision problem"
],
[
"Boolean",
"Boolean"
],
[
"formula",
"formula"
],
[
"conjunctive normal form",
"conjunctive normal form"
],
[
"literal",
"literal"
],
[
"clause",
"clause"
],
[
"satisfiable",
"satisfiable"
],
[
"NP-complete",
"NP-complete"
]
],
"raw_glosses": [
"(computing theory) The decision problem of deciding whether a given Boolean formula in conjunctive normal form with three literals per clause is satisfiable. A famous NP-complete problem."
],
"related": [
{
"word": "SAT"
}
],
"synonyms": [
{
"word": "3SAT"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "3-SAT"
}
{
"etymology_text": "From SAT and 3, the number of literals per clause.",
"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": "",
"nolinkhead": "",
"sc": "Latn",
"sort": ""
},
"expansion": "3-SAT",
"name": "head"
},
{
"args": {},
"expansion": "3-SAT",
"name": "mul-symbol"
}
],
"lang": "Translingual",
"lang_code": "mul",
"pos": "symbol",
"related": [
{
"word": "SAT"
}
],
"senses": [
{
"categories": [
"Pages with 1 entry",
"Pages with entries",
"Translingual entries with incorrect language header",
"Translingual lemmas",
"Translingual symbols",
"Translingual terms spelled with numbers",
"Translingual terms with redundant script codes",
"mul:Theory of computing"
],
"glosses": [
"The decision problem of deciding whether a given Boolean formula in conjunctive normal form with three literals per clause is satisfiable. A famous NP-complete problem."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"decision problem",
"decision problem"
],
[
"Boolean",
"Boolean"
],
[
"formula",
"formula"
],
[
"conjunctive normal form",
"conjunctive normal form"
],
[
"literal",
"literal"
],
[
"clause",
"clause"
],
[
"satisfiable",
"satisfiable"
],
[
"NP-complete",
"NP-complete"
]
],
"raw_glosses": [
"(computing theory) The decision problem of deciding whether a given Boolean formula in conjunctive normal form with three literals per clause is satisfiable. A famous NP-complete problem."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"synonyms": [
{
"word": "3SAT"
}
],
"word": "3-SAT"
}
Download raw JSONL data for 3-SAT meaning in Translingual (1.8kB)
This page is a part of the kaikki.org machine-readable Translingual dictionary. This dictionary is based on structured data extracted on 2024-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.