Multi-adjoint logic programming[1] 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 <(A ←i 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.

Implementations

edit

Examples of implementations of multi-adjoint logic programming:

References

edit
  1. ^ Medina, Jesús; Ojeda-Aciego, Manuel; Vojtaš, Peter (2001). "Multi-adjoint Logic Programming with Continuous Semantics". Logic Programming and Nonmotonic Reasoning. Lecture Notes in Computer Science. Vol. 2173. pp. 351–364. doi:10.1007/3-540-45402-0_26. ISBN 978-3-540-42593-9.
  2. ^ "Rfuzzy". Archived from the original on 2012-02-28. Retrieved 2012-01-21.
  3. ^ "Floper".


Stub icon

This computing article is a stub. You can help Wikipedia by adding missing information.

📚 Artikel Terkait di Wikipedia

Commutative property

Valverde, Agustín; Vojtáš, Peter (2004). "Towards Biresiduated Multi-adjoint Logic Programming". In Conejo, Ricardo; Urretavizcaya, Maite; Pérez-de-la-Cruz

Separation logic

precisely, the adjoint operators are _ ∗ Q {\displaystyle \_\ast Q} and Q − ∗ _ {\displaystyle Q-\!\!\ast \,\_} . In separation logic, Hoare triples have

Quantum logic gate

computation, a quantum logic gate (or simply quantum gate) is a basic quantum circuit operating on a small number of qubits. Quantum logic gates are the building

Currying

Propositional Calculus, 8. Heyting Algebras, and 9. Quantifiers as Adjoints". Sheaves in Geometry and Logic: A First Introduction to Topos Theory. New York: Springer-Verlag

Grigore Moisil

Quantum computers Algebraic logic: MV-algebra Symbolic logic: Mathematical logic Algebra Category theory: Categorical logic, Adjoint functors Institute of Electrical

Jacob T. Schwartz

parallel computing, programming language design and implementation, robotics, set-theoretic approaches in computational logic, proof and program verification

Backpropagation

networks in terms of matrix multiplication, or more generally in terms of the adjoint graph. For the basic case of a feedforward network, where nodes in each

John von Neumann

equivalence between matrix games and linear programming. Later, von Neumann suggested a new method of linear programming, using the homogeneous linear system