A Procedural Semantics for Multi-adjoint Logic Programming

  • Authors:
  • Jesús Medina;Manuel Ojeda-Aciego;Peter Vojtás

  • Affiliations:
  • -;-;-

  • Venue:
  • EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

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.