Extended multi-adjoint logic programming arises as an extension of multi-adjoint normal logicprogramming where constraints and a special type of aggregator operator have been included. The use of this general aggrega...
详细信息
Extended multi-adjoint logic programming arises as an extension of multi-adjoint normal logicprogramming 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-adjointlogic program. This mechanism will allow us to establish technical properties relating the different stable models of both logicprogramming 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-adjointlogic programs. (C) 2019 Elsevier B.V. All rights reserved.
Reductants are a special kind of fuzzy rules which constitute an essential theoretical tool for proving correctness properties. As it has been reported, when interpreted on a partially ordered structure, a multi-adjoi...
详细信息
Reductants are a special kind of fuzzy rules which constitute an essential theoretical tool for proving correctness properties. As it has been reported, when interpreted on a partially ordered structure, a multi-adjointlogic program has to include all its reductants in order to preserve the approximate completeness property. After a short survey of the different notions of reductant that have been developed for multi-adjointlogic programs, we introduce a new and more adequate notion of reductant in the multi-adjoint framework. We study some of its properties and its relationships with other notions of reductants, and provide an algorithm for computing all the reductants associated with a multi-adjointlogic program. (C) 2016 Elsevier B.V. All rights reserved.
This paper includes the main notions associated with the syntax and semantics of two interesting paradigms in fuzzy logicprogramming with default negation: multi-adjoint normal logicprogramming introduced in [5] and...
详细信息
ISBN:
(纸本)9783319914794;9783319914787
This paper includes the main notions associated with the syntax and semantics of two interesting paradigms in fuzzy logicprogramming with default negation: multi-adjoint normal logicprogramming introduced in [5] and the fuzzy answer set logicprogramming approach presented in [16]. We will show that fuzzy answer set logic programs can be translated into multi-adjoint normal logic programs, as long as the implication operator used in the former is a residuated implication. Moreover, we will relate the notions of fuzzy y-model and model by means of a characterization theorem which allow us to guarantee the existence of fuzzy y-models of fuzzy answer set logic programs.
In 'multi-adjoint logic programming', MALP in brief, each fuzzy logic program is associated with its own 'multi-adjoint lattice' for modelling truth degrees beyond the simpler case of true and false, w...
详细信息
In 'multi-adjoint logic programming', MALP in brief, each fuzzy logic program is associated with its own 'multi-adjoint lattice' for modelling truth degrees beyond the simpler case of true and false, where a large set of fuzzy connectives can be defined. On this wide repertoire, it is crucial to connect each implication symbol with a proper conjunction thus conforming constructs of the form (<-(i), &(i)) called 'adjoint pairs', whose use directly affects both declarative and operational semantics of the MALP framework. In this work, we firstly show how the strong dependence of adjoint pairs can be largely weakened for an interesting 'sub-class' of MALP programs. Then, we reason in a similar way till conceiving a 'super-class' of fuzzy logic programs beyond MALP, which definitively drops out the need for using adjoint pairs, since the new semantics behaviour relies on much more relaxed lattices than multi-adjoint ones.
In this work, after revisiting the different notions of reductant arisen in the framework of multi-adjoint logic programming and akin frameworks, we introduce a new, more adequate, notion of reductant in the context o...
详细信息
ISBN:
(纸本)9783319115580;9783319115573
In this work, after revisiting the different notions of reductant arisen in the framework of multi-adjoint logic programming and akin frameworks, we introduce a new, more adequate, notion of reductant in the context of multi-adjointlogic programs. We study some of its properties and its relationships with other notions of reductants.
暂无评论