Jump to content

Multi-adjoint logic programming

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Brad Joseph (talk | contribs) at 02:22, 19 December 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Multi-adjoint logic programming means to express a computer program in the language of multi-adjoint logic.

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 <(A B), δ> such that:

1. The rule (A ← B) is a formula of F;

2. The confidence factor δ is an element (a truth-value) of L;

3. The body B is a formula built from atoms B1, … , Bn (n ≥ 0) by the use of conjunctors, disjunctors, and aggregators.

4. Facts are rules with body ┬.

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