Skip to search formSkip to main contentSkip to account menu

Multi-adjoint logic programming

Multi-adjoint logic programming defines syntax and semantics of a logic programming program in such a way that the underliying maths justifying the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Declarative programming has been classically used for solving computational problems regarding AI, knowledge representation and… 
2009
2009
The notion of least Herbrand model has been traditionally accepted as the declarative semantics for programs in the context of… 
2008
2008
Multi-adjoint logic programming represents an extremely flexible attempt for fuzzifying logic programming, where the classical… 
2006
2006
Multi-adjoint logic programming represents a very recent, extremely flex- ible attempt for introducing fuzzy logic into logic… 
2004
2004
A general framework of logic programming allowing for the combination of several adjoint lattices of truth-values is presented… 
2004
2004
A synthesis of results of the recently introduced paradigm of multi-adjoint logic programming is presented. These results range… 
2004
2004
In this paper we present a logic programming-based language allowing for the combination of several adjoint lattices of truth… 
Highly Cited
2001
Highly Cited
2001
Multi-adjoint logic program generalise monotonic logic programs introduced in [1] in that simultaneous use of several… 
Highly Cited
2001
Highly Cited
2001
Considering different implication operators, such as "Łukasiewicz, Godel or product implication in the same logic program… 
2001
2001
Multi-adjoint logic programs generalise monotonic and residuated logic programs in that simultaneous use of several implications…