Papers by Jesus S. Medina
Fuzzy Sets and Systems, 2004
The aim of this paper is to build a formal model for fuzzy unification in multi-adjoint logic pro... more The aim of this paper is to build a formal model for fuzzy unification in multi-adjoint logic programs containing both a declarative and a procedural part, and prove its soundness and completeness. Our approach is based on a general framework for logic programming, which gives a formal model of fuzzy logic programming extended by fuzzy similarities and axioms of first-order logic with equality.
Fuzzy Sets and Systems, 2009
Several fuzzifications of formal concept analysis have been proposed to deal with uncertain infor... more Several fuzzifications of formal concept analysis have been proposed to deal with uncertain information. In this paper, we focus on concept lattices under a multiadjoint paradigm, which enriches the language providing greater flexibility to the user in that she can choose from a number of different connectives. Multi-adjoint concept lattices are shown to embed different fuzzy extensions of concept lattices found in the literature, the main results of the paper being the representation theorem of this paradigm and the embedding of other well-known approaches.
A general framework of logic programming allowing for the combination of several adjoint lattices... more A general framework of logic programming allowing for the combination of several adjoint lattices of truth-values is presented. The main contribution is a new sufficient condition which guarantees termination of all queries for the fixpoint semantics for an interesting class of programs. Several extensions of these conditions are presented and related to some well-known formalisms for probabilistic logic programming.
Considering different implication operators, such as Lukasiewicz, Gödel or product implication in... more Considering different implication operators, such as Lukasiewicz, Gödel or product implication in the same logic program, naturally leads to the allowance of several adjoint pairs in the lattice of truthvalues. In this paper we apply this idea to introduce multi-adjoint logic programs as an extension of monotonic logic programs. The continuity of the immediate consequences operators is proved and the assumptions required to get continuity are further analysed.
Multi-adjoint logic program generalise monotonic logic programs introduced in [1] in that simulta... more 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.
Uploads
Papers by Jesus S. Medina