Multi-adjoint Logic Programming

Multi-adjoint logic programming defines syntax and semantics of a logic programming program in such a way that the underliying maths justifying the results are 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 we are allowed to use different implications in our rules.

Definition: A multi-adjoint logic program is a set P of rules of the form <(Ai B), δ> 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 conjunctors, disjunctors, and aggregators.

5. Facts are rules with body ┬.

6. A query (or goal) is an atom intended as a question ?A prompting the system.

Read more about Multi-adjoint Logic Programming:  Implementations

Famous quotes containing the words logic and/or programming:

    There is no morality by instinct.... There is no social salvation—in the end—without taking thought; without mastery of logic and application of logic to human experience.
    Katharine Fullerton Gerould (1879–1944)

    If there is a price to pay for the privilege of spending the early years of child rearing in the driver’s seat, it is our reluctance, our inability, to tolerate being demoted to the backseat. Spurred by our success in programming our children during the preschool years, we may find it difficult to forgo in later states the level of control that once afforded us so much satisfaction.
    Melinda M. Marshall (20th century)