Multi-adjoint Logic Programming with Continuous Semantics

Abstract. Considering different implication operators, such as Lukasiewicz, G¨odel or product implication in the same logic program, naturally leads to the allowance of several adjoint pairs in the lattice of truthvalues. In this paper we apply this idea to introduce multi-adjoint logic programs as an extension of monotonic logic programs. The continuity of the immediate consequences operators is proved and the assumptions required to get continuity are further analysed.

• Type: Conference
• Year: 2001
• Where: LPNMR
• Authors: Jesús Medina, Manuel Ojeda-Aciego, Peter Vojtás
• Keywords: Automated Reasoning, Different Implication Operators, Logic Programs, LPNMR 2001, Multi-adjoint Logic Programs