{
  "id": "binary-decision-560929-680bbd6f2e1a0c94",
  "slug": "binary-decision",
  "title": "Binary decision",
  "qid": "Q4913887",
  "lead": "A binary decision is a choice between two alternatives, for instance between taking some specific action or not taking it. Binary decisions are basic to many fields. Examples include: *Truth values in mathematical logic, and the corresponding Boolean data type in computer science, representing a value which may be chosen to be either true or false. *Conditional statements (if-then or if-then-else) in computer science, binary decisions about which piece of code to execute next. *Decision trees and binary decision diagrams, representations for sequences of binary decisions. *Binary choice, a statistical model for the outcome of a binary decision.",
  "body": "A binary decision is a choice between two alternatives, for instance between taking some specific action or not taking it. Binary decisions are basic to many fields. Examples include: Truth values in mathematical logic, and the corresponding Boolean data type in computer science, representing a value which may be chosen to be either true or false. Conditional statements (if-then or if-then-else) in computer science, binary decisions about which piece of code to execute next. Decision trees and binary decision diagrams, representations for sequences of binary decisions. Binary choice, a statistical model for the outcome of a binary decision. ==Binary decision diagrams== A binary decision diagram (BDD) is a way to visually represent a boolean function. One application of BDDs is in CAD software and digital circuit analysis where they are an efficient way to represent and manipulate boolean functions. The value of a boolean function can be determined by following a path in its BDD down to a terminal, making a binary decision at each node where a solid line is followed if the value of the variable at the node is true and a dotted line if it is false. A BDD is said to be 'ordered' if the order of the variables tested is fixed. A BDD is said to be 'reduced' if the two following conditions are true: Each successor of each node is distinct. There are no two distinct nodes of the same variable with the same successors. BDDs that are ordered and reduced can be called Reduced Ordered Binary Decision Diagrams (ROBDD). An example of a ROBDD is the figure to the right, which represents the function f(x_1,x_2,x_3)=\\bar{x}_1\\bar{x}_2\\bar{x}_3+x_1x_2+x_2x_3 . The order of the variables along any path is always x_1 , x_2 , then x_3 , all nodes have distinct successors, and there are no two nodes of the same variable and the same successors. ==References==",
  "categories": [
    "24496510"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1357375989",
  "content_hash": "680bbd6f2e1a0c94759205ac09eb543b7ab9c18a9806a939d0c231c53167cc97",
  "created_at": 1792311237.7559597,
  "updated_at": 1780378748.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "binary-decision-560929-680bbd6f2e1a0c94",
    "type": "webpage",
    "title": "Binary decision",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/binary-decision",
    "issued": {
      "date-parts": [
        [
          2026,
          10,
          18
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:binary-decision-560929-680bbd6f2e1a0c94",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1357375989",
    "note": "Immutable snapshot binary-decision-560929-680bbd6f2e1a0c94, content root 680bbd6f2e1a0c94…"
  }
}