{
  "id": "enwiki-001364727547",
  "slug": "multi-adjoint-logic-programming",
  "title": "Multi-adjoint logic programming",
  "qid": "",
  "lead": "Multi-adjoint logic programming defines syntax and semantics of a logic programming program in such a way that the underlying maths justifying the results are a residuated lattice and/or MV-algebra. The definition of a multi-adjoint logic program is given, as usual in fuzzy logic programming, as a set of weighted rules and facts of a given formal language F. Notice that the use of different implications is allowed in these rules. Definition: A multi-adjoint logic program is a set P of rules of the form such that: 1. The rule (A ←i B) is a formula of F; 2. The confidence factor δ is an element (a truth-value) of L; 3. The head A is an atom; 4. The body B is a formula built from atoms B1, …, Bn (n ≥ 0) by the use of conjunctor, disjunctor, and aggregator. 5. Facts are rules with body ┬. 6. A query (or goal) is an atom intended as a question ?A prompting the system.",
  "body": "Multi-adjoint logic programming defines syntax and semantics of a logic programming program in such a way that the underlying maths justifying the results are a residuated lattice and/or MV-algebra. The definition of a multi-adjoint logic program is given, as usual in fuzzy logic programming, as a set of weighted rules and facts of a given formal language F. Notice that the use of different implications is allowed in these rules. Definition: A multi-adjoint logic program is a set P of rules of the form such that: 1. The rule (A ←i B) is a formula of F; 2. The confidence factor δ is an element (a truth-value) of L; 3. The head A is an atom; 4. The body B is a formula built from atoms B1, …, Bn (n ≥ 0) by the use of conjunctor, disjunctor, and aggregator. 5. Facts are rules with body ┬. 6. A query (or goal) is an atom intended as a question ?A prompting the system. ==Implementations== Examples of implementations of multi-adjoint logic programming: Rfuzzy Floper ==References==",
  "categories": [
    "10363121",
    "20161863",
    "23468805",
    "23603337",
    "24745121",
    "26220375",
    "73139830"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1364727547",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1784341995.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001364727547",
    "type": "webpage",
    "title": "Multi-adjoint logic programming",
    "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/multi-adjoint-logic-programming",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          20
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          20
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001364727547",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1364727547",
    "note": "Immutable snapshot enwiki-001364727547"
  }
}