A Procedural Semantics for Multi-adjoint Logic Programming

Abstract. Multi-adjoint logic program generalise monotonic logic programs introduced in [1] in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. In this work, a procedural semantics is given for the paradigm of multiadjoint logic programming and completeness theorems are proved.

• Type: Conference
• Year: 2001
• Where: EPIA
• Authors: Jesús Medina, Manuel Ojeda-Aciego, Peter Vojtás
• Keywords: Artificial Intelligence, EPIA 2001, Logic Program Generalise, Logic Programs, Monotonic Logic Programs