Extended multi-adjoint logic programming

TL;DR

This paper introduces extended multi-adjoint logic programming, incorporating constraints and a novel aggregator operator, enabling more flexible negation and semantics, and linking it to existing stable model theories.

Contribution

It defines the syntax and semantics of extended multi-adjoint logic programming and presents a mechanism to relate it to existing multi-adjoint normal logic programming.

Findings

Introduced syntax and semantics for the new paradigm

Developed a mechanism to derive multi-adjoint normal logic programs from extended versions

Established properties relating stable models of both frameworks

Abstract

Extended multi-adjoint logic programming arises as an extension of multi-adjoint normal logic programming where constraints and a special type of aggregator operator have been included. The use of this general aggregator operator permits to consider, for example, different negation operators in the body of the rules of a logic program. We have introduced the syntax and the semantics of this new paradigm, as well as an interesting mechanism for obtaining a multi-adjoint normal logic program from an extended multi-adjoint logic program. This mechanism will allow us to establish technical properties relating the different stable models of both logic programming frameworks. Moreover, it makes possible that the already developed and future theory associated with stable models of multi-adjoint normal logic programs can be applied to extended multi-adjoint logic programs.