# moa-publi.bib

@article{ins-RMM,
author = {Madrid, N. and Medina, J.  and Ojeda-Aciego, M. and Perfilieva, I.},
journal = {Information Sciences},
title = {L-fuzzy relational mathematical morphology based on adjoint triples},
year = {2019},
abstract = {We propose an alternative to  the standard structure of L-fuzzy Mathematical Morphology (MM) by, on the one hand, considering L-fuzzy relations as structuring elements and, on the other hand, by using  adjoint triples to handle membership values. Those modifications lead to a framework based on set-theoretical operations where we can prove a representation theorem for algebraic morphological erosions and dilations. In addition, we also present some new results concerning duality and transformation invariance. Concerning duality, we show that duality and adjointness can coexist in this L-fuzzy relational MM. Concerning transformation invariance, we show sufficient conditions to guarantee the invariance of morphological operators under arbitrary transformations.},
volume = {474},
doi = {https://doi.org/10.1016/j.ins.2018.09.028},
pdf = {./TR/INS18-MM.pdf},
pages = {75--89}
}

@incollection{pub-escim17,
author = {Krídlo, O. and Ojeda-Aciego, M.},
booktitle = {Trends in Mathematics and Computational Intelligence},
title = {An adjoint pair for intuitionistic {$L$}-fuzzy values},
year = {2019},
doi = {https://doi.org/10.1007/978-3-030-00485-9_19},
pages = {167--173},
series = {Studies in Computational Intelligence, vol 796},
abstract = {We continue our prospective study of the generalization of formal concept analysis in terms of intuitionistic $L$-fuzzy sets. The main contribution here is  an adjoint pair in the set $L_i$ of intuitionistic $L$-fuzzy values associated to a complete residuated lattice, which allows   the definition of a pair of derivation operators which form an antitone Galois connection. }
}

@inproceedings{escim18,
author = {Krídlo, O. and Ojeda-Aciego, M.},
booktitle = {Proc. of  Eur. Symp. on Computational Intelligence and Mathematics (ESCIM 2018)},
title = {Relating {Hilbert-Chu} Correspondences and Big Toy Models for Quantum Mechanics },
year = {2018},
note = {To appear}
}

@inproceedings{apsac18,
author = {Cabrera, I.P. and Cordero, P.  and Mu\~noz-Velasco, E. and Ojeda-Aciego, M.},
booktitle = {Proc. of  Applied Physics, System Science and Computers (APSAC 2018)},
title = {Relational Connections between Preordered Sets},
year = {2018},
note = {To appear}
}

@inproceedings{cmmse18,
author = {Cabrera, I.P. and Cordero, P.  and Mu\~noz-Velasco, E. and Ojeda-Aciego, M.},
booktitle = {Proc. of  the Computational and Mathematical Methods in Science and Engineering, CMMSE'18},
title = {Compatibility of {G}alois connections and powering},
year = {2018}
}

@article{igpl18,
author = {Burrieza, A. and Mu\~noz-Velasco, E. and Ojeda-Aciego, M.},
journal = {Logic Journal of the {IGPL}},
title = {A flexible logic-based approach to closeness using order of magnitude qualitative reasoning},
year = {2018},
pdf = {./TR/IGPL17BMO-R2.pdf},
abstract = {In this paper,  we focus on a logical approach to the  important notion of closeness, which has not received much attention in the literature. Our notion of closeness is based on the so-called proximity intervals, which will be used to decide the elements that are close to each other. Some of the intuitions of this definition are explained on the basis of examples. We prove the decidability of  the recently introduced multimodal logic for   closeness and, then, we  show some capabilities of the logic with respect to expressivity in order to denote particular positions of the proximity intervals.},
note = {To appear},
volume = {},
pages = {}
}

@incollection{pub-escim16,
author = {Krídlo, O. and Ojeda-Aciego, M.},
booktitle = {Interactions Between Computational Intelligence and Mathematics (Part 2)},
title = {On the n-ary generalization of dual bonds},
year = {2018},
doi = {https://doi.org/10.1007/978-3-030-01632-6_4},
pages = {55--63},
series = {Studies in Computational Intelligence, vol 794},
abstract = {We propose the generalization of the notion of bond between two formal contexts to the case of n formal contexts. The first properties of the n-ary bonds are given, together with a method for building n-ary bonds. This construction enables to formalize some inference rules within the research topic of building a sequent calculus for formal contexts. }
}

@book{ipmu18a,
editor = {Medina, J. and Ojeda-Aciego, M. and  Verdegay, J.L. and Pelta, D. and Cabrera, I.P. and Bouchon-Meunier, B. and Yager, R.},
title = {Information Processing and Management of Uncertainty in Knowledge-Based Systems: Theory and Foundations I},
year = {2018},
series = {Communications in Computer and Information Science},
doi = {10.1007/978-3-319-91473-2},
publisher = {Springer},
volume = {853}
}

@book{ipmu18b,
editor = {Medina, J. and Ojeda-Aciego, M. and  Verdegay, J.L. and Pelta, D. and Cabrera, I.P. and Bouchon-Meunier, B. and Yager, R.},
title = {Information Processing and Management of Uncertainty in Knowledge-Based Systems: Theory and Foundations II},
year = {2018},
series = {Communications in Computer and Information Science},
doi = {10.1007/978-3-319-91476-3},
publisher = {Springer},
volume = {854}
}

@book{ipmu18c,
editor = {Medina, J. and Ojeda-Aciego, M. and  Verdegay, J.L. and Perfilieva, I.  and Bouchon-Meunier, B. and Yager, R.},
title = {Information Processing and Management of Uncertainty in Knowledge-Based Systems: Applications},
year = {2018},
series = {Communications in Computer and Information Science},
doi = {10.1007/978-3-319-91479-4},
publisher = {Springer},
volume = {855}
}

@inproceedings{ipmu18-cla,
author = {Valverde-Albacete, F. and Peláez-Moreno, C. and Cabrera, I.P. and Cordero, P.  and Ojeda-Aciego, M.},
booktitle = {Proc. of  the Intl Conf on Concept Lattices and their Applications, CLA'18},
title = {A Data Analysis Application of Formal Independence Analysis},
year = {2018},
pdf = {./TR/CLA18-conference.pdf},
pages = {117--128},
abstract = {In this paper we present a new technique for the  analysis of data tables by means of Formal Independence Analysis  (FIA).
This is an analogue of Formal Concept Analysis for the study of independence relations in data, instead of hierarchical relations.
A FIA of a context produces, when possible, its block diagonalization by detecting pairs of sets of objects and attributes that are not mutually incident, or \emph{tomoi},  that partition the context.
In this paper we combine this technique with the exploration of contexts with entries in a semifield to find independent sets in contingency matrices.
Specifically, we apply it to a number of confusion matrices issued from cognitive experiments to find evidences for the hypothesis of perceptual channels.  }
}

@incollection{ewa:2018,
author = {Burrieza, A. and Muñoz-Velasco, E. and Ojeda-Aciego, M.},
booktitle = {Ewa Or{\l}owska on Relational Methods in Logic and Computer Science},
editor = {Zawidzki, M. and Goli\'nska-Pilarek, J.},
publisher = {Springer},
chapter = {8},
pages = {},
series = {Outstanding Contributions to Logic},
title = {Logics for order-of-magnitude qualitative reasoning: formalizing negligibility},
volume = {},
note = {To appear},
abstract = {Qualitative reasoning deals with information expressed in terms of qualitative classes and relations among them, such as comparability, negligibility or closeness.
In this work, we focus  on the different logic-based approaches to the notions of negligibility developed by our group.},
year = {2018}
}

@article{ipmu18-q,
author = {Krídlo, O. and Ojeda-Aciego, M.},
journal = {Communications in Computer and Information Science},
volume = {853},
pages = {574--584},
title = {Formal Concept Analysis and structures underlying Quantum Logics},
pdf = {./TR/Q-FCA-IPMU-final.pdf},
year = {2018},
abstract = {A Hilbert space H induces a formal context, the Hilbert formal context, whose associated concept lattice is isomorphic to the lattice of closed subspaces of H. This set of closed subspaces, denoted  C(H), is important in the development of quantum logic and, as an algebraic structure, corresponds to a so-called propositional system'', that is, a complete, atomistic, orthomodular lattice which satisfies the covering law.
In this paper, we continue with our study of the Chu construction by introducing the Chu correspondences between Hilbert contexts, and showing that the category of Propositional Systems, PropSys, is equivalent to the category of  Chu correspondences between Hilbert contexts. }
}

@article{ipmu18-fia,
author = {Valverde-Albacete, F. and Peláez-Moreno, C. and Cabrera, I.P. and Cordero, P.  and Ojeda-Aciego, M.},
journal = {Communications in Computer and Information Science},
volume = {853},
pages = {596--608},
title = {Formal independence analysis},
pdf = {./TR/ipmu18-final.pdf},
year = {2018},
abstract = {In this paper we propose a new lens through which to observe the information contained in a formal context.
Instead of focusing on the hierarchical relation between objects or attributes induced by their incidence, we focus on the unrelatedness'' of the objects with respect to those attributes with which they are not incident.
The crucial order concept for this is that of maximal anti-chain and the corresponding representation capabilities are provided by Behrendt's theorem.
With these tools we introduce the fundamental theorem of Formal Independence Analysis and use it to provide an example of what its affordances are for the analysis of data tables. We also discuss its relation to Formal Concept Analysis. }
}

@article{fss-file2,
author = {Cabrera, I.P. and Cordero, P. and Garcia-Pardo, F. and  Ojeda-Aciego, M. and De Baets, B.},
journal = {IEEE Transactions on Fuzzy Systems},
volume = {26},
number = {3},
pages = {1274--1287},
doi = {https://doi.org/10.1109/TFUZZ.2017.2718495},
title = {Galois connections between a fuzzy preordered structure and a general fuzzy structure.},
pdf = {./TR/file2-TFS-R3.pdf},
year = 2018,
abstract = {We continue the study of (isotone) Galois connections, also called adjunctions, in the framework of  fuzzy preordered structures, which generalize  fuzzy preposets by considering underlying fuzzy equivalence relations. Specifically, we present necessary and sufficient conditions so that, given a mapping f:  A -> B from a fuzzy preordered structure A  into a fuzzy structure B, it is possible to construct a fuzzy relation rho_B that induces a suitable fuzzy preorder structure  on B and  such that there exists a mapping g: B ->A such that the pair (f,g) constitutes an Galois connection..}
}

@incollection{madrid:2018,
author = {Madrid, N. and Ojeda-Aciego, M.},
booktitle = {Measuring Inconsistency in Information},
editor = {Grant, J. and Martinez, M.V.},
publisher = {College publications},
chapter = {5},
pages = {147--168},
series = {Studies in Logic},
title = {Inconsistency measures in general fuzzy logic programming},
url = {http://collegepublications.co.uk/logic/?00040},
volume = {73},
abstract = {Fuzzy logic  has shown to be a suitable framework to handle contradictions in which, unsurprisingly,  the notion of inconsistency can be defined in different ways. This chapter   analyses the notion of inconsistency in general residuated  logic programming under the answer-set semantics, shows that inconsistency can be somehow decomposed into instability and incoherence and, finally,  shows that each of these notions can be associated with some natural measures of inconsistency. Finally, we focus on measures of inconsistency in the particular framework of fuzzy logic programming.},
year = {2018}
}

@article{ijufks17,
author = {H. Bustince and S. Montes and M. Ojeda-Aciego},
journal = {International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems},
title = {Fuzzy Mathematical Models for Computer Science and Decision Making},
year = {2017},
abstract = {},
doi = {https://doi.org/10.1142/S0218488517020020},
volume = {25},
pages = {1--4}
}

@article{jancl17,
author = {Burrieza, A. and Mu\~noz-Velasco, E. and Ojeda-Aciego, M.},
journal = {Journal of Applied Non-Classical Logics},
title = {A multimodal logic for closeness},
year = {2017},
abstract = {We introduce a multimodal logic for order of magnitude reasoning which considers a new logic-based alternative to the notion of closeness, we provide an axiom system and prove its soundness and completeness.},
pdf = {./TR/LF-bmo-ext-R2.pdf},
doi = {https://doi.org/10.1080/11663081.2018.1442137},
volume = {27},
pages = {225--237}
}

@inproceedings{escim17,
author = {Krídlo, O. and Ojeda-Aciego, M.},
booktitle = {Proc. of  the European Symposium  on Computational Intelligence and Mathematics ESCIM'17},
title = {An adjoint pair for intuitionistic {$L$}-fuzzy values},
year = {2017},
pdf = {./TR/IF-FCA-ESCIM.pdf},
abstract = {We continue our prospective study of the generalization of formal concept analysis in terms of intuitionistic $L$-fuzzy sets. The main contribution here is  an adjoint pair in the set $L_i$ of intuitionistic $L$-fuzzy values associated to a complete residuated lattice, which allows   the definition of a pair of derivation operators which form an antitone Galois connection. }
}

@inproceedings{cmmse17,
author = {Cabrera, I.P. and Cordero, P. and    Ojeda-Aciego, M.},
booktitle = {Computational and Mathematical Methods in Science and Engineering (CMMSE'17)},
title = {Relation-based {G}alois connections: towards the residual of a relation},
year = {2017},
pdf = {./TR/cmmse17.pdf},
abstract = {We explore a suitable generalization of the notion of Galois connection in which their components are binary relations. Many different approaches are possible depending both on the (pre-)order relation between subsets in the underlying powerdomain and the chosen type of relational composition.}
}

@inproceedings{foci17-galois,
author = {Cabrera, I.P. and Cordero, P. and    Ojeda-Aciego, M.},
booktitle = {Foundations of Computational Intelligence  (FOCI@SSCI'17)},
title = {Galois connections in Computational Intelligence: a short survey},
year = {2017},
pdf = {./TR/FOCI-hawaii-beta.pdf},
doi = {https://doi.org/10.1109/SSCI.2017.8285310},
abstract = {The construction of Galois connections between different structures provides a number of advantages, both from the theoretical and the applied standpoints. In this  paper, we survey some works on Galois connections focused essentially on certain aspects of Computational Intelligence.}
}

@inproceedings{foci17-b,
author = {Madrid, N. and Ojeda-Aciego, M.},
booktitle = {Foundations of Computational Intelligence  (FOCI@SSCI'17)},
title = {Modelling Fuzzy Partitions with Fuzzy Answer Sets},
year = {2017},
pdf = {./TR/ExplicitDefInferenceRules.pdf},
doi = {https://doi.org/10.1109/SSCI.2017.8285308},
abstract = {This paper introduces a representation of fuzzy partitions in term of fuzzy logic programming. This representation models  relationships among the different classes that define the fuzzy partition. There are essentially two such relationships. The first one is that classes are disjoint and, therefore, contradictory each other; on the other hand, the second one is that classes cover all the universe. These two relationships are modeled via two different negations, namely, the explicit and default negation. Last but not least, the semantics used to model both negations is the fuzzy answer set semantics.}
}

@article{sum17,
author = {Madrid, N. and    Ojeda-Aciego, M.},
journal = {Lecture Notes in Artificial Intelligence Science},
title = {A view of $f$-indexes of inclusion under different axiomatic definitions of fuzzy inclusion},
volume = {10564},
pdf = {./TR/SUM17v2.pdf},
doi = {https://doi.org/10.1007/978-3-319-67582-4_22},
pages = {307--318},
year = {2017},
abstract = { In this paper we analyze the novel constructive definition of f-index of inclusion with respect to four of the most common axiomatic definitions of inclusion measure, namely Sinha-Dougherty, Kitainik, Young and Fan-Xie-Pei. There exist an important difference between the f-index and these axiomatic definitions of inclusion measure:  the f-index represents the inclusion in terms of a {mapping} in unit interval, whereas the inclusion measure represents such an inclusion as a {value} in the unit interval. }
}

@inproceedings{ifsa17-galois,
author = {Cabrera, I.P. and Cordero, P. and    Ojeda-Aciego, M.},
booktitle = {Joint 17th World Congress of Intl Fuzzy Systems Association
and 9th Intl Conf on Soft Computing and Intelligent Systems (IFSA-SCIS'17)},
title = {Relational fuzzy {G}alois connections},
pdf = {./TR/Galois-ifsa-japan-final.pdf},
doi = {https://doi.org/10.1109/IFSA-SCIS.2017.8023288},
year = {2017},
abstract = {We propose  a suitable generalization of the notion of  Galois connection  whose components are fuzzy relations. We  prove that the construction embeds Yao's notion of fuzzy Galois connection as a particular case. Although the natural framework for the proposed notion is that of fuzzy preposets,  we also prove that it behaves properly with respect to the formation of quotient with respect to the fuzzy symmetric kernel relation.}
}

@inproceedings{ifsa17-chu,
author = {O. Krídlo and Ojeda-Aciego, M.},
booktitle = {Joint 17th World Congress of Intl Fuzzy Systems Association
and 9th Intl Conf on Soft Computing and Intelligent Systems (IFSA-SCIS'17)},
title = {Towards Intuitionistic {$L$}-fuzzy Formal t-Concepts},
year = {2017},
pdf = {./TR/IFSA-FCA-final.pdf},
doi = {https://doi.org/10.1109/IFSA-SCIS.2017.8023268},
abstract = {We continue our study of intuitionistic $L$-fuzzy formal concept analysis by presenting a construction of an adjoint triple based on a non-commutative conjunctor, so that it enables the construction of intuitionistic $L$-fuzzy t-formal concepts.}
}

@inproceedings{fuzzieee17-galois,
author = {Cabrera, I.P. and Cordero, P. and    Ojeda-Aciego, M.},
booktitle = {IEEE Intl Conf on Fuzzy Systems (FUZZ-IEEE'17)},
title = {Towards relational fuzzy adjunctions},
doi = {https://doi.org/10.1109/FUZZ-IEEE.2017.8015677},
year = {2017},
abstract = {The problem of studying the existence of a right adjoint for a mapping defined between  sets with different fuzzy structure naturally leads to the search of new notions of adjunction which fit better with the underlying structure of domain and codomain. In this work, we introduce a version of relational fuzzy adjunction between fuzzy preposets which generalizes previous approaches in that its components are fuzzy relations. We also prove that the construction behaves properly with respect to the formation of quotient with respect to the symmetric kernel relation and, thus, giving rise to a relational fuzzy adjunction between fuzzy posets.}
}

@inproceedings{fuzzieee17-chu,
author = {O. Krídlo and Ojeda-Aciego, M.},
booktitle = {IEEE Intl Conf on Fuzzy Systems (FUZZ-IEEE'17)},
title = {Extending Formal Concept Analysis using Intuitionistic {$L$}-fuzzy Sets},
year = {2017},
pdf = {./TR/IFFCA.pdf},
doi = {https://doi.org/10.1109/FUZZ-IEEE.2017.8015570},
abstract = {A two-fold general  approach to the theory of formal concept analysis  is introduced by considering intuitionistic fuzzy sets valued on a residuated lattice  as underlying structure for the construction.}
}

@article{ijgs-cla15,
author = {L. Antoni and I. P. Cabrera and S. Kraj{\v c}i and O. Krídlo and Ojeda-Aciego, M.},
journal = {Intl J of General Systems},
volume = {46},
pages = {458--474},
title = {The {C}hu construction and generalized formal concept analysis},
year = {2017},
pdf = {./TR/chu-R1.pdf},
doi = {http://dx.doi.org/10.1080/03081079.2017.1349579},
abstract = {We continue studying the connections between the Chu construction on the category ChuCors of formal contexts and Chu correspondences, and generalizations of Formal Concept Analysis (FCA). All the required constructions like categorical product, tensor product, together with its bifunctor properties are introduced and proved. The final section focuses on how the second-order generalization of FCA can be built up in terms of the Chu construction. }
}

@article{fss-file1,
author = {Cabrera, I.P. and Cordero, P. and Garcia-Pardo, F. and  Ojeda-Aciego, M. and De Baets, B.},
journal = {Fuzzy Sets and Systems},
volume = {320},
pages = {81--92},
pdf = {./TR/R1_file1-12may.pdf},
doi = {10.1016/j.fss.2016.09.013},
title = {On the construction of adjunctions between a fuzzy preposet and an unstructured set.},
year = 2017,
abstract = {In this work, we focus on adjunctions, also called isotone Galois connections, in the framework of fuzzy preordered sets (hereafter, fuzzy preposets). Specifically, we present necessary and sufficient conditions so that, given a mapping f : A -> B from a fuzzy preposet A into an unstructured set B, it is possible to construct a suitable fuzzy preorder relation on B for which there exists a mapping g: B -> A such that the pair (f,g) constitutes an adjunction.}
}

@article{fss-reductantes,
author = {Julián, P. and Medina, J. and   Ojeda-Aciego, M.},
journal = {Fuzzy Sets and Systems},
volume = {317},
pages = {27--43},
pdf = {./TR/JMO-FSS-16-03-07.pdf},
doi = {10.1016/j.fss.2016.09.004},
title = {On reductants in the framework of multiadjoint logic programming},
year = 2017,
abstract = {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-adjoint logic 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-adjoint logic programs, we introduce a new and more adequate, notion of reductant in the mult-adjoint framework.  We study some of its properties and its relationships with other notions of reductants. In addition, we give an efficient algorithm for computing all the reductants associated with a multi-adjoint logic program. }
}

@inproceedings{rsme17,
author = {Cabrera, I.P. and Cordero, P. and    Ojeda-Aciego, M.},
booktitle = {Proc. of  the Biennial Congress of the Royal Spanish Mathematical Society RSME'17},
title = {Characterizing the existence of residual for a morphism between a fuzzy preposet and an unordered fuzzy structure},
year = {2017}
}

@article{fss-DMcN,
author = {Medina, J. and Ojeda-Aciego, M. and Pócs, J. and Ramírez-Poussa, E.},
journal = {Fuzzy Sets and Systems},
volume = {303},
number = {},
pages = {1--20},
pdf = {./TR/multilattices-DMcN-FSS-R1-final.pdf},
doi = {10.1016/j.fss.2016.01.007},
title = {On the {Dedekind-MacNeille} completion and formal    concept analysis based on multilattices},
year = 2016,
abstract = {The Dedekind-MacNeille completion of a poset P can be seen as the least complete lattice containing P. In this work, we analyze some results concerning the use of this completion within the framework of Formal Concept Analysis  in terms of the poset of concepts associated with a Galois connection between posets. Specifically, we show an interesting property of the Dedekind-MacNeille completion, in that the completion of the concept poset of a Galois connection between posets coincides with the concept lattice  of the Galois connection extended to the corresponding completions. Moreover, we study the specific case when $P$ has multilattice structure and state and prove the corresponding representation theorem. }
}

@article{ijgs-guest,
author = {Ojeda-Aciego, M. and Outrata, J.},
journal = {Intl J of General Systems},
volume = {45},
number = {2},
pages = {55--56},
doi = {10.1080/03081079.2015.1072921},
title = {Guest editorial: Concept lattices and their applications},
year = 2016
}

@proceedings{scakd-proc,
editor = {Ojeda-Aciego, M. and Ignatov, D. and Lepskiy, A.},
title = {Soft Computing Applications and Knowledge Discovery (SCAKD'16)},
url = {http://ceur-ws.org/Vol-1687},
volume = {1687},
series = {CEUR Proceedings},
year = 2016
}

@article{ijgs-kon-oje,
author = {Konecny, J. and Ojeda-Aciego, M.},
journal = {Intl J of General Systems},
doi = {10.1080/03081079.2015.1072926},
pdf = {./TR/IJGS14.pdf},
title = {On Homogeneous ${L}$-bonds and Heterogeneous ${L}$-bonds},
volume = {45},
number = {2},
pages = {160--186},
year = 2016,
abstract = {In this paper we deal with suitable generalizations of the notion of bond between contexts, as part of the research area  of Formal Concept Analysis.
We study different  generalizations of the notion of bond within the $L$-fuzzy setting. Specifically, given a formal context there are three prototypical pairs of concept-forming operators, and this immediately leads to three possible versions of the notion of bond (so-called homogeneous bond wrt certain pair of concept-forming operators). The first results show a close correspondence between a homogeneous bond between two contexts and certain special types of mappings between the sets of extents (or intents) of the corresponding concept lattices. Later, we introduce the so-called  heterogeneous bonds (considering simultaneously two types of concept-forming operators) and generalize the previous relationship to  mappings between the sets of extents (or intents) of the corresponding concept lattices.
}
}

@article{setvalued16,
author = {N. Madrid and J. Medina and Ojeda-Aciego, M. and Perfilieva, I.},
journal = {Journal of Fuzzy Set Valued Analysis},
volume = {2016},
number = {1},
pages = {12 pages},
doi = {10.5899/2016/jfsva-00270},
title = {Toward the Use of Fuzzy Relations in the Definition of Mathematical Morphology Operators},
year = {2016},
abstract = {In this paper we present a definition of erosions and dilations in terms of fuzzy relations and adjoint triples. We firstly show that we can represent any algebraic erosion and dilation in such a terms and secondly, we present a set of approaches that can be covered by our definition of relational erosions and dilations. }
}

@article{hais16,
author = {Burrieza, A. and Muñoz-Velasco, E. and Ojeda-Aciego, M. },
booktitle = {Proc. of the Intl Conference on Hybrid Artificial Intelligence Systems, HAIS},
journal = {Lect. Notes in Computer Science},
volume = {9648},
pages = {721--729},
title = {A hybrid approach to closeness in the framework of  order of magnitude qualitative reasoning },
doi = {10.1007/978-3-319-32034-2_60},
year = {2016},
abstract = {Qualitative reasoning deals with information expressed in terms of qualitative classes and relations among them, such as comparability, negligibility or closeness.
In this paper, we focus  on the  notion of closeness using a hybrid approach which is based on logic,  order-of-magnitude reasoning, and  on  the so-called proximity structures; these structures  will be used to decide the elements that are close to each other. Some of the intuitions of this approach are explained on the basis of examples. Moreover, we  show some capabilities of the logic with respect to expressivity in order to denote particular positions of the proximity intervals. }
}

@inproceedings{escim16,
author = {Krídlo, O. and Ojeda-Aciego, M.},
booktitle = {Proc. of  the European Symposium  on Computational Intelligence and Mathematics ESCIM'16},
title = {On the n-ary generalization of dual bonds},
year = {2016},
pages = {55--59},
abstract = {We propose the generalization of the notion of bond between two formal contexts to the case of n formal contexts. The first properties of the n-ary bonds are given, together with a method for building n-ary bonds. This construction enables to formalize some inference rules within the research topic of building a sequent calculus for formal contexts.}
}

@inproceedings{escim16-keynote,
author = {Ojeda-Aciego, M.},
booktitle = {Proc. of  the European Symposium  on Computational Intelligence and Mathematics ESCIM'16},
title = {Bonds in a Fuzzy Environment},
year = {2016},
pages = {30},
note = {Keynote talk},
abstract = {Formal Concept Analysis (FCA) has become a very active research topic, both theoretical and practical; its wide applicability justifies the need of a deeper knowledge of its underlying mechanisms, and one important way to obtain this extra knowledge turns out to be via generalization.

Several fuzzy variants of generalized FCA have been introduced and developed both from the theoretical and the practical side. Most of the generalizations focus on including extra features (fuzzy, possibilistic, rough, etc.); however, not much have been published on the suitable general version of certain specific notions, such as the bonds between formal contexts.

One of the motivations for introducing the notion of bond was to provide a tool for studying mappings between formal contexts, somehow mimicking the behavior of Galois connections between their corresponding concept lattices. In this talk we will deal with generalizations of the notion of bond in an L-fuzzy setting.}
}

@inproceedings{fca4ai16,
author = {Krídlo, O. and Ojeda-Aciego, M.},
booktitle = {Proc. of What can FCA do for Artificial Intelligence?'' FCA4AI, collocated with ECAI'16.},
title = {Towards a sequent calculus for formal contexts},
year = {2016},
url = {http://ceur-ws.org/Vol-1703/paper3.pdf},
abstract = {This work focuses on the definition of a  consequence relation   between contexts with which we can decide whether certain contextual information  is a logical consequence from a set of contexts considered as underlying hypotheses.}
}

@inproceedings{foci16,
author = {Cabrera, I.P.  and Cordero, P. and Ojeda-Aciego, M. },
booktitle = {Proc. of Foundations of Computational Intelligence, FOCI},
title = {On fuzzy relations, functional relations, and adjunctions},
pdf = {./TR/FOCI16.pdf},
doi = {10.1109/SSCI.2016.7850149},
year = {2016}
}

@inproceedings{cla16,
author = {Cabrera, I.P.  and Cordero, P. and De Baets, B. and García-Pardo, F. and Ojeda-Aciego, M. },
booktitle = {Proc. of Concept Lattices and their Applications, CLA},
title = {On the existence of right adjoints for surjective mappings between fuzzy structures},
year = {2016},
url = {http://ceur-ws.org/Vol-1624/paper8.pdf},
abstract = {We continue our study of the characterization of existence of adjunctions (isotone Galois connections) whose codomain is insufficiently structured. This paper focuses on the fuzzy case in which we have a fuzzy ordering rho_A on A and a surjective mapping  f: ( A, approx_A) -> ( B, approx_B) compatible with respect to the   fuzzy equivalences approx_A and approx_B. Specifically, the problem is to find a fuzzy ordering rho_B and
a compatible mapping g: (B, approx_B) -> (A, approx_A) such that the pair (f,g) is a fuzzy  adjunction.}
}

@inproceedings{estylf16,
author = {Cabrera, I.P.  and Cordero, P. and De Baets, B. and García-Pardo, F. and Ojeda-Aciego, M. },
booktitle = {Proc. of the Spanish Conference on Fuzzy Logic and Technology, ESTYLF},
year = {2016}
}

@inproceedings{cmmse16,
author = {Cabrera, I.P.  and Cordero, P. and Ojeda-Aciego, M. },
booktitle = {Proc. of Computational and Mathematical Methods in Science and Engineering, CMMSE},
title = {The natural embedding of fuzzy preposets and its  residual mapping},
year = {2016}
}

@inproceedings{caepia15a,
author = {García-Pardo, F. and Cabrera, I.P.  and Cordero, P. and Ojeda-Aciego, M. },
booktitle = {Proc. of the Conference of the Spanish Association for Artificial Intelligence, CAEPIA},
title = {Constructing right adjoints between fuzzy preordered sets},
year = {2015},
abstract = {In this work, we focus on the study of necessary and sufficient conditions in order to ensure the existence  (under some constraints) of monotone Galois connections between fuzzy preordered sets. }
}

@inproceedings{caepia15B,
author = {Burrieza, A. and Mu\~noz, E. and Ojeda-Aciego, M. },
booktitle = {Proc. of the Conference of the Spanish Association for Artificial Intelligence, CAEPIA},
title = {Logic-based order of magnitude qualitative reasoning for closeness via proximity intervals: a first approach},
year = {2015},
abstract = {Qualitative reasoning is an area of AI which provides solutions to problems where the quantitative information either is not available or can not be used; in particular, order of magnitude qualitative reasoning assumes different qualitative classes and relations such as negligibility and closeness. In this paper, we focus mainly on the very important notion of closeness from the logical point of view, which has not received much attention in the literature. Our notion of closeness is based on the so-called proximity intervals, which will be used to decide the elements that are close to each other. Some of the intuitions of this definition are explained on the basis of examples. We introduce a multimodal logic for order of magnitude reasoning which includes the notions of closeness and negligibility, we provide an axiom system, which is sound and complete.}
}

@inproceedings{caepia15c,
author = {Medina, J. and Ojeda-Aciego, M. and Pócs, J.},
booktitle = {Proc. of the Conference of the Spanish Association for Artificial Intelligence, CAEPIA},
title = {Concepts and multilattices: the distributivity of the {D}edekind-{M}ac{N}eille completion},
year = {2015},
abstract = {The Dedekind-MacNeille completion of a poset P can be seen as the least complete lattice containing P . In this work, we analyze some results concerning the use of this completion within the framework of Formal Concept Analysis, notably the distributivity of the Dedekind- MacNeille completion and the construction of the poset of concepts as- sociated with a Galois connection between posets. }
}

@inproceedings{foci15,
author = {García-Pardo, F. and Cabrera, I.P.  and Cordero, P. and Ojeda-Aciego, M. },
booktitle = {IEEE Symposium on Foundations of Computational Intelligence, FOCI 2015},
pages = {},
title = {On Fuzzy Preordered Sets and Monotone {G}alois Connections},
pdf = {./TR/foci15.pdf},
year = {2015},
abstract = {In this work, we focus on the study of necessary and sufficient conditions in order to ensure the existence  (under some constraints) of monotone Galois connections between fuzzy preordered sets. }
}

@inproceedings{cla15,
author = {L. Antoni and I. P. Cabrera and S. Kraj{\v c}i and O. Krídlo and Ojeda-Aciego, M.},
booktitle = {Proc. of Concept Lattices and their Applications},
title = {Using the {C}hu construction for generalizing formal concept analysis},
year = {2015},
abstract = {The goal of this paper is to show a connection between FCA generalisations and the Chu construction on the category ChuCors, the category of formal contexts and Chu correspondences. All needed categorical properties like categorical product, tensor product and its bifunctor properties are presented and proved. Finally, the second order generalisation of FCA is represented by a category built up in terms of the Chu construction. },
url = {http://ceur-ws.org/Vol-1466/paper12.pdf}
}

@article{kbs15,
author = {Cordero, P. and Enciso, M. and Mora, A.  and Ojeda-Aciego, M. and Rossi, C.},
journal = {Knowledge-Based Systems},
pages = {16--25},
title = {Knowledge discovery in social networks by using a logic-based treatment of implications},
volume = {87},
year = 2015,
url = {http://dx.doi.org/10.1016/j.knosys.2015.07.018},
abstract = {This work can be seen as a contribution to the area of social network analysis. By considering Formal Concept Analysis (FCA) as  the underlying formalizing  tool, we use logic-based techniques in order to offer novel solutions to identify user's influence in a social network.  We propose the use of the Simplification Logic SLFD for attribute implications as the core of an automated method to build a structure containing the complete set of influences among users.
}
}

@proceedings{fcaa15-proc,
editor = {Ojeda-Aciego, M. and Baixeries, J. and Sacarea, C.},
title = {Formal Concept Analysis and Applications},
url = {http://ceur-ws.org/Vol-1434},
volume = {1434},
series = {CEUR Proceedings},
year = 2015
}

@article{tfs-nico-humberto,
author = {Bustince, H. and Madrid, N. and Ojeda-Aciego, M.},
journal = {IEEE Transactions on Fuzzy Systems},
number = {4},
pages = {1057-1069},
pdf = {./TR/TFS14.pdf},
url = {http://dx.doi.org/10.1109/TFUZZ.2014.2337934},
title = {The notion of weak-contradiction: definition and measures},
volume = {23},
year = 2015,
abstract = {In this work we present a way to represent contradiction
between fuzzy sets. This representation is given in terms of
the notion of f-weak contradiction. Unlike other approaches, we
do not define contradiction just by using one of the relations of f-
weak-contradiction, but by considering the whole set of relations.
This consideration avoids the need to fix an operator beforehand
in order to take into account all the information between two
fuzzy sets. As a result, we characterize the contradiction between
fuzzy sets and define a family of measures of contradiction
satisfying four interesting properties: symmetry, antitonicity, if
the intersection is empty then the measure is one; and if there
is an element in the intersection with degree of membership 1
then the measure is zero.
}
}

@article{icfca15,
author = {García-Pardo, F. and Cabrera, I.P.  and Cordero, P. and Ojeda-Aciego, M.},
journal = {Lect. Notes in Computer Science},
title = {On closure systems and adjunctions between fuzzy preordered sets},
volume = {9113},
pages = {114--127},
year = 2015,
abstract = {The aim of this work is providing a characterization in terms of closure systems, for the construction, given a mapping f: A -> B from a fuzzy preordered set A into an unstructured set B, of a suitable fuzzy preordering on B for which there exists a mapping g: B -> A such that the pair (f,g) constitutes an adjunction (isotone Galois connection). This contribution continues our research line on the construction of adjunctions in which the theory of fuzzy closure systems is used in order to provide a more meaningful framework for the extension to the fuzzy case of previous results.
}
}

@book{icfca15-book,
editor = {Baixeries, J. and Ojeda-Aciego, M. and Sacarea, C.},
publisher = {Springer-Verlag},
series = {Lecture Notes in Artificial Intelligence},
url = {https://dx.doi.org/10.1007/978-3-319-19545-2},
title = {Formal Concept Analysis},
volume = {9113},
year = 2015
}

@inproceedings{ifsa15,
author = {N. Madrid and Ojeda-Aciego, M. and Perfilieva, I.},
booktitle = {Proc. of IFSA-EUSFLAT},
url = {http://dx.doi.org/10.2991/ifsa-eusflat-15.2015.217},
title = {f-inclusion indexes between fuzzy sets},
year = {2015},
abstract = {We introduce the notion of f-inclusion, which is used to describe different kinds of subsethood relations between fuzzy sets by means of monotonic functions f: [0,1] -> [0,1]. We show that these monotonic functions can be considered indexes of inclusion, since the greater the function considered, the more restrictive is the relationship. Finally, we propose a general index of inclusion by proving the existence of a representative f-inclusion for any two ordered pairs of fuzzy sets. In such a way, our approach is different to others in the literature in no taking a priori assumptions like residuated implications or t-norms.
}
}

@article{amis,
author = {Rodríguez, E. and Bertet, K. and Cordero, P. and Enciso, M. and Mora, A. and Ojeda-Aciego, M.},
journal = {Applied Mathematics and Information Sciences},
number = {2L},
pages = {1--13},
pdf = {./TR/amis15.pdf},
title = {From Implicational Systems to Direct-Optimal bases: a logic-based approach},
volume = {9},
year = 2015,
abstract = {Due to its solid mathematical foundations, Formal Concept Analysis (FCA) has become an emergent topic in the area of
data analysis and knowledge discovering. Information is represented in a binary table defining a relation between a set of objects and
a set of attributes?the formal context. The knowledge extracted from the formal context allows to identify useful patterns in data
in different forms. One very useful knowledge representation in FCA are implications among attributes which are validated over the
objects. The most outstanding feature of implications is that they can be managed by means of inference systems. Equivalent sets of
implications can be obtained using different logic-based transformations. The aim of these transformations is to turn the original set
of implications into an equivalent one fulfilling some desired properties. Among them, the directness and optimality are very popular
targets because getting a direct-optimal basis ensures that the closure of a set of attributes may be computed with lower cost (time and
resources). In this work, we introduce a new method to compute the direct-optimal basis which improves the existing ones. The new
method reduces the input in a first stage and is guided by the idea of limiting the growth of the intermediate sets of implications as a
way to improve the performance. We illustrate the good features of the new method with both a detailed example and by experimental
evaluation.
}
}

@inproceedings{cedya15,
author = {I.P. Cabrera and P. Cordero and Garc{\'\i}a, F. and Ojeda-Aciego, M.},
booktitle = {Proc. of XXIV CEDYA/XIV Congress on Applied Mathematics},
pages = {307--308},
title = {On the definition of fuzzy adjunction},
year = {2015}
}

@inproceedings{cmmse15,
author = {I.P. Cabrera and P. Cordero and Garc{\'\i}a, F. and Ojeda-Aciego, M.},
booktitle = {Proc. of Computational Methods in Mathematics, Science, and Engineering (CMMSE 2015)},
pages = {267--274},
title = {On the notion of  fuzzy adjunctions between fuzzy orders},
year = {2015}
}

@article{amai-ko14,
author = {O. Krídlo and Ojeda-Aciego, M.},
journal = {Annals of Mathematics and Artificial Intelligence},
title = {Linking ${L}$-{C}hu correspondences
and completely lattice ${L}$-ordered sets},
url = {http://dx.doi.org/10.1007/s10472-014-9416-8},
pdf = {./TR/amai-ko14.pdf},
volume = {72},
number = {1--2},
pages = {91--113},
year = 2014,
abstract = {Continuing our categorical  study  of $L$-fuzzy extensions of formal concept analysis, we provide a representation theorem for  the category of $L$-Chu correspondences between $L$-formal contexts and prove that it is equivalent to the category of completely lattice $L$-ordered sets.  }
}

@article{amai-dmo14,
author = {J. Konecny and J. Medina and Ojeda-Aciego, M.},
journal = {Annals of Mathematics and Artificial Intelligence},
volume = {72},
number = {1--2},
pages = {73--89},
title = {Multi-adjoint concept lattices with heterogeneous conjunctors and hedges},
url = {http://dx.doi.org/10.1007/s10472-014-9405-y},
pdf = {./TR/amai-dmo14.pdf},
year = 2014,
abstract = {This paper is related, on the one hand, to the framework of multi-adjoint concept lattices with heterogeneous conjunctors and, on the other hand, to the use of intensifying hedges as truth-stressers. Specifically,  we continue on the line of recent works by Belohlavek and Vychodil, which use  intensifying hedges as a tool to reduce the size of a concept lattice. In this paper  we use hedges as a reduction tool  in the general framework of  multi-adjoint concept lattices with heterogeneous conjunctors. }
}

@article{INS-paqui14,
author = {García-Pardo, F. and Cabrera, I.P.  and Cordero, P. and Ojeda-Aciego, M. and F.J. Rodríguez},
journal = {Information Sciences},
volume = {286},
url = {http://dx.doi.org/10.1016/j.ins.2014.07.006},
pdf = {./TR/INS14.pdf},
pages = {173--187},
title = {On the definition of suitable orderings to generate adjunctions over an unstructured codomain},
year = 2014,
abstract = { }
}

@article{jelia14,
author = {Julián, P. and Medina, J. and   Ojeda-Aciego, M.},
journal = {Lect. Notes in Artificial Intelligence},
volume = {8761},
pages = {694--702},
url = {http://dx.doi.org/10.1007/978-3-319-11558-0_53},
pdf = {./TR/JELIA14.pdf},
title = {Revisiting reductants in the Multi-adjoint Logic Programming framework},
year = {2014},
abstract = {}
}

@inproceedings{cla14,
author = {I.P. Cabrera and Ojeda-Aciego, M. and Jozef Pócs},
booktitle = {Proc. of Concept Lattices and their Applications},
pages = {157--168},
url = {http://ceur-ws.org/Vol-1252/cla2014_submission_19.pdf},
title = {Ordering objects via  attribute preferences},
year = {2014},
abstract = {We apply recent results on the construction of suitable orderings for the existence of right adjoint to the analysis of the following problem: given a preference ordering on the set of attributes of a given context, we seek an induced preference among the objects which is compatible with the information provided by the context. }
}

@inproceedings{fuzzieee14,
author = {Madrid, N. and Medina, J. and Moreno, J.C. and Ojeda-Aciego, M.},
booktitle = {IEEE Intl Conf on Fuzzy Systems (FUZZ-IEEE'14)},
pages = {600--603},
url = {http://dx.doi.org/10.1109/FUZZ-IEEE.2014.6891882},
pdf = {./TR/fuzzieee14.pdf},
title = {New links between mathematical morphology and fuzzy property-oriented concept lattices},
year = {2014},
abstract = {The theory of fuzzy property-oriented concept lattices is a formal tool for modeling and processing incomplete knowledge in information systems. This paper  relates  this research topic to that of   mathematical morphology, a theory whose scope   is to   process and analyze   images and signals. Consequently, the theory developed in the concept lattice framework can be used in   these particular settings.}
}

@article{jrs14-monadas,
author = {P. Eklund and Gal\'an, M.A.  and
J. Kortelainen  and M. Ojeda-Aciego},
journal = {Lect. Notes in Computer Science},
volume = 8536,
pages = {201--210},
title = {Monadic Formal Concept Analysis},
abstract = {Formal Concept Analysis (FCA) as inherently relational can
be formalized and generalized by using categorical constructions. This
provides a categorical view of the relation between 'object' and 'attributes',
which can be further extended to a more generalized view on
relations as morphisms in Kleisli categories of suitable monads. Structure
of sets of 'objects' and 'attributes' can be provided e.g. by term
monads over particular signatures, and specific signatures drawn from
and developed within social and health care can be used to illuminate
the use of the categorical approach.},
year = {2014}
}

@article{jrs14-galois,
author = {García-Pardo, F. and Cabrera, I.P.  and Cordero, P. and Ojeda-Aciego, M.},
journal = {Lect. Notes in Computer Science},
volume = 8536,
pages = {211--221},
title = {On Adjunctions between Fuzzy Preordered Sets:
Necessary Conditions},
abstract = {There exists a direct relation between fuzzy rough sets and
fuzzy preorders. On the other hand, it is well known the existing parallelism
between Formal Concept Analysis and Rough Set Theory. In both
cases, Galois connections play a central role. In this work, we focus on
adjunctions (also named isotone Galois connections) between fuzzy preordered
sets; specifically, we study necessary conditions that have to be
fulfilled in order such an adjunction to exist.},
pdf = {./TR/JRS-paqui-defi.pdf},
year = {2014}
}

@article{icfca14,
author = {García-Pardo, F. and Cabrera, I.P.  and Cordero, P. and Ojeda-Aciego, M. and F.J. Rodríguez},
journal = {Lect. Notes in Computer Science},
volume = 8478,
pages = {67--79},
title = {On the Existence of Isotone {G}alois Connections
between Preorders},
abstract = {Given a mapping  from a preordered set A into
an unstructured set B, we study the problem of defining a suitable preordering
relation on B such that there exists a mapping g from B to A such
that the pair (f, g) forms an adjunction between preordered sets.},
pdf = {./TR/ICFCA-R1-Galois-on-preorders.pdf},
year = {2014}
}

@article{ipmu14,
author = {García-Pardo, F. and Cabrera, I.P.  and Cordero, P. and Ojeda-Aciego, M. and F.J. Rodríguez},
journal = {Communications in Computer and Information Science},
volume = 444,
pages = {91--99},
title = {Generating Isotone {G}alois Connections
on an Unstructured Codomain},
abstract = {Given a mapping f   from a partially ordered set A
into an unstructured set B, we study the problem of defining a suitable
partial ordering relation on B such that there exists a mapping g from B to A
such that the pair of mappings (f, g) forms an isotone Galois connection
between partially ordered sets.},
pdf = {./TR/IPMU-R1-Galois-orders.pdf},
year = {2014}
}

@article{fss-qr,
author = {Burrieza, A. and Mu{\~n}oz, E. and Ojeda-Aciego, M.},
journal = {Fuzzy Sets and Systems},
volume = {242},
pages = {114--131},
title = {A logic framework for reasoning with movement based on fuzzy qualitative representation},
pdf = {./TR/fss-qr.pdf},
url = {http://dx.doi.org/10.1016/j.fss.2013.07.014},
year = 2014,
abstract = {We present a logic approach to reason with moving objects under fuzzy qualitative representation. This way, we can deal both with qualitative and quantitative information, and consequently, to obtain more accurate results. The proposed logic system is introduced as an extension of  Propositional Dynamic Logic: this choice, on the one hand, simplifies the theoretical study  concerning soundness, completeness and decidability;  on the other hand, provides  the possibility of constructing complex relations from simpler ones and the use of a language very close to programming languages. }
}

@article{ijgs13,
author = {Díaz, J.C. and  Medina, J. and M. Ojeda-Aciego},
journal = {Intl Journal of General Systems},
volume = {43},
number = {2},
pages = {149--161},
title = {On basic conditions to generate multi-adjoint concept lattices via {G}alois connections},
pdf = {./TR/ijgs13.pdf},
url = {http://www.tandfonline.com/doi/full/10.1080/03081079.2013.879302},
year = 2014,
abstract = {This paper introduces  sufficient and necessary conditions with respect to  the fuzzy operators considered in a multi-adjoint frame  under which   the standard combinations  of multi-adjoint  sufficiency, possibility and necessity operators  form (antitone or   isotone) Galois connections. The underlying idea is to study the minimal algebraic requirements so that the concept-forming operators (defined using the same syntactical form than the extension and intension operators of multi-adjoint concept lattices) form a Galois connection. As a consequence, given a relational database, we have much more possibilities to construct concept lattices associated with it, so that we can choose the specific version which better suits the situation.}
}

@inproceedings{estylf14,
author = {García-Pardo, F. and Cabrera, I.P.  and Cordero, P. and Ojeda-Aciego, M.},
booktitle = {XVII Spanish Conference on Fuzzy Logic and Technology},
pages = {99--102},
title = {On the construction of fuzzy {G}alois connections},
abstract = {Given a mapping  from a fuzzy poset (A, ?) to
any set B, we introduce conditions which allow
for defining a fuzzy ordering on B and a mapping
from B to A such that the pair (f ,g) forms a fuzzy
Galois connection},
year = {2014}
}

@article{fss-res-mret,
author = {Cabrera, I.P. and Cordero, P. and Guti\'errez, G. and Mart{\'\i}nez, J. and Ojeda-Aciego, M.},
journal = {Fuzzy Sets and Systems},
volume = {234},
pages = {1--21},
title = {On residuation in multilattices: filters, congruences, and homomorphisms},
pdf = {./TR/fss-res-mret.pdf},
url = {http://dx.doi.org/10.1016/j.fss.2013.04.002},
year = 2014,
abstract = {Continuing with our general study of algebraic hyperstructures, we focus on the  residuated operation in the framework of   multilattices.
Firstly, we recall the existing relation between filters, homomorphisms and congruences in the framework of multilattices; then, introduce the notion of residuated multilattice and further study the notion of filter, which has to be suitably modified so that the results in the first section are conveniently preserved also in the residuated case. }
}

@inproceedings{Cla13keys,
author = {Cordero, P. and Enciso, M. and Mora, A. and Ojeda-Aciego, M.},
booktitle = {Proc. of Concept Lattices and Applications, CLA 2013},
pages = {293--298 },
pdf = {http://ceur-ws.org/Vol-1062/paper_short4.pdf},
title = {Computing Left-Minimal Direct Basis of implications},
abstract = {The most popular basis in Formal Concept Analysis is the Duquenne-Guigues basis, which ensure minimality in the number of dependencies and it is built with pseudo-intents, and some method to calculate these basis from an arbitrary set of implications have been introduced. We propose in this paper, an automated method to calculate a left-minimal direct basis from the set of all implications built between a closed set and its corresponding minimal generators. The new basis also has the minimal property demanded in the Duquenne-Guigues basis. It is minimal in the cardinal of the set of implications, and minimal in the size of the left-hand side of the implications.},
year = {2013}
}

@inproceedings{Cla13ondrej,
author = {Kr{\'\i}dlo, O. and   Ojeda-Aciego, M.},
booktitle = {Proc. of Concept Lattices and Applications, CLA 2013},
pages = {105--116},
pdf = {http://ceur-ws.org/Vol-1062/paper9.pdf},
title = {{CRL-C}hu Correspondences },
abstract = {We continue our study of the general notion of L-Chu correspondence by introducing the category CRL-ChuCors incorporating residuation to the underlying complete lattice L, specifically, on the basis of a residuation-preserving isotone Galois connection ?. Then, the L-bonds are generalized within this same framework, and its structure is related to that of the extent of a suitably defined ?-direct product.},
year = {2013}
}

@inproceedings{Cla13jan,
author = {J. Konecny   and Ojeda-Aciego, M.},
booktitle = {Proc. of Concept Lattices and Applications, CLA 2013},
pages = {153--162},
pdf = {http://ceur-ws.org/Vol-1062/paper13.pdf},
title = {Isotone {L}-bonds},
abstract = {L-bonds represent relationships between formal contexts. We  study properties of these intercontextual structures w.r.t. isotone concept- forming operators in fuzzy setting. We also focus on the direct product of two formal fuzzy contexts and show conditions under which a bond can be obtained as an intent of the product. In addition, we show that the previously studied properties of their antitone counterparts can be easily derived from the present results.},
year = {2013}
}

@proceedings{cla13-proc,
editor = {Ojeda-Aciego, M. and Outrata, J.},
title = {Concept Lattices and Their Applications},
url = {http://ceur-ws.org/Vol-1062},
volume = {1062},
series = {CEUR Proceedings},
year = 2013
}

@inproceedings{fuzzieee13,
author = {Bustince, H. and Madrid, N. and Ojeda-Aciego, M.},
booktitle = {IEEE Intl Conf on Fuzzy Systems (FUZZ-IEEE'13)},
pages = {1--6},
pdf = {./TR/fuzzieee13.pdf},
title = {A Measure of Contradiction Based on the Notion of N-Weak-Contradiction},
url = {http://dx.doi.org/10.1109/FUZZ-IEEE.2013.6622563},
year = {2013},
abstract = {In this work we elaborate on the notion of contradiction between fuzzy sets introduced by Trillas et al in a fuzzy logic context. Our approach is parametric in that the operator used to define contradiction is rather a variable than a constant introduced prior to the analysis of contradiction. We give several motivations to consider weaker operators than the usual involutive negations, and obtain some preliminary results which validate this proposal.}
}

@inproceedings{eusflat13,
author = {Díaz, J.C. and  Medina, J. and M. Ojeda-Aciego},
booktitle = {Intl Conference on Fuzzy Logic and Technology (EUSFLAT'13)},
pages = {796--801},
title = {On minimal requirements to obtain fuzzy concept-forming operators},
pdf = {http://dx.doi.org/10.2991/eusflat.2013.118},
year = {2013},
abstract = {In this work, we introduce  sufficient and necessary conditions for a pair of fuzzy conjunctor and implication considered in a multi-adjoint frame  under which   the usual combinations  of multi-adjoint  sufficiency, possibility and necessity operators  form either antitone or isotone Galois connections.}
}

@inproceedings{fca4ai,
author = {Cordero, P. and Enciso, M. and Mora, A. and Ojeda-Aciego, M. },
booktitle = {IJCAI workshop on FCA for AI},
pages = {33--36},
title = {Bases via Minimal Generators},
pdf = {http://ceur-ws.org/Vol-1058/paper4.pdf},
year = {2013},
abstract = {The concept lattice corresponding to a context may be alternatively specified by means of attribute implications. One outstanding problem in formal concept analysis and other areas is the study of the equivalences between a given set of implications and its corresponding basis (notice that there exists a wide range of approaches to basis in the literature). In this work we introduce a method to provide a Duquenne-Guigues basis corresponding to the minimal generators and their closed sets from a context}
}

@inproceedings{cmmse13,
author = {Cordero, P. and Enciso, M. and Mora, A. and Ojeda-Aciego, M. },
booktitle = {Computational Methods in Mathematics, Science, and Engineering},
pages = {},
title = {A method to extract precise implication from contexts},
pdf = {./TR/cmmse13.pdf},
year = {2013.},
abstract = {}
}

@article{iwann13galois,
author = {García-Pardo, F. and Cabrera, I.P. and Cordero, P.  and Ojeda-Aciego, M.},
journal = {Lect. Notes in Computer Science},
volume = {7903},
pages = {224--235},
title = {On {G}alois Connections and Soft Computing},
pdf = {./TR/iwann13galois.pdf},
year = {2013},
abstract = {After recalling the different interpretations usually assigned
to the term Galois connection, both in the crisp and in the fuzzy case,
we survey on several of their applications in Computer Science and,
specifically, in Soft Computing.
}
}

@article{iwann13,
author = {Juli\'an, P. and Medina, J. and Morcillo, P.J. and Moreno, G. and Ojeda-Aciego, M.},
journal = {Lect. Notes in Computer Science},
volume = {7902},
pages = {647--655},
title = {An Unfolding-based   Preprocess   for Reinforcing   Thresholds in   Fuzzy Tabulation},
pdf = {./TR/iwann13.pdf},
year = {2013},
abstract = {We have recently proposed a technique for
generating thresholds (filters) useful for avoiding useless
computations when executing fuzzy logic programs in a tabulated
way. The method was conceived as
a static preprocess practicable on program rules before being
executed with our   fuzzy thresholded tabulation principle,
thus increasing the opportunities of prematurely disregarding
those computation steps which are redundant (tabulation) or
directly lead to non-significant solutions (thresholding). In this
paper we reinforce the power of such static preprocess---which
obviously does not require the consumption of extra computational
resources at execution time---by re-formulating it in terms of the
fuzzy unfolding technique initially designed in
our group for transforming and optimizing
fuzzy logic
programs.
}
}

@inproceedings{icfca13,
author = {Medina, J. and Ojeda-Aciego, M. and Ruiz-Calvi\~no, J.},
booktitle = {Intl Conf on Formal Concept Analysis, Lecture Notes in Artificial Intelligence 7880},
pages = {203--215},
title = {Concept-forming operators on multilattices },
pdf = {./TR/icfca13.pdf},
year = {2013},
abstract = {Adjoint pairs or adjoint triples defined on lattices have   proven to be a  useful tool when   working in fuzzy formal concept analysis. This paper shows that adjoint pairs and triples can play as well an important role   within the framework of multilattices, especially in order to form the Galois connections needed to build concept multilattices.}
}

@inproceedings{foci13,
author = {Madrid, N. and Ojeda-Aciego, M.},
booktitle = {IEEE Symposium on Foundations of Computational Intelligence, FOCI 2013},
pages = {30--37},
title = {On the Measure of Incoherent Information in Extended Multi-Adjoint Logic Programs},
pdf = {./TR/foci13.pdf},
year = {2013},
abstract = {In this paper we continue analyzing the introduction of negation into the framework of residuated logic programming; specifically, we focus on extended programs, that is we consider programs with strong negation. The classical approach to extended logic programs consists in considering negated literals as new, independent, ones and, then apply the usual monotonic approach (based on the fix-point semantics and the $T_\mathbb{P}$ operator); if the least fix-point so obtained is inconsistent, then the approach fails and no meaning is attached to the program. This paper introduces several approaches to measure consistency (under the term \emph{coherence}) into a multi-adjoint setting. },
bdsk-url-1 = {./TR/foci13.pdf}
}

@article{ins-dual,
author = {Medina, J. and Ojeda-Aciego, M.},
journal = {Information Sciences},
volume = {225},
pages = {47--54},
title = {Dual multi-adjoint  concept lattices},
pdf = {./TR/ins-dual.pdf},
url = {http://dx.doi.org/10.1016/j.ins.2012.10.030},
year = 2013,
abstract = {Several papers relate
different  alternative approaches to  classical concept lattices: such as property-oriented  and object-oriented concept lattices and the dual concept lattices. Whereas the usual approach to the latter is via a negation operator, this paper presents  a fuzzy generalization of the dual concept lattice,   the   dual multi-adjoint  concept lattice, in which  the philosophy of the multi-adjoint paradigm is applied and  no negation on the lattices is   needed.}
}

@inproceedings{Cla12keys,
author = {Cordero, P. and Enciso, M. and Mora, A. and Ojeda-Aciego, M.},
booktitle = {Proc. of Concept Lattices and Applications, CLA 2012},
pages = {187--198 },
pdf = {http://cla.inf.upol.cz/papers/cla2012/paper16.pdf},
title = {Computing minimal generators from implications: a logic-guided approach},
abstract = {Sets of attribute implications may have a certain degree of redundancy and the notion of basis appears as a way to characterize the implication set with less redundancy. The most widely accepted is the Duquenne-Guigues basis, strongly based on the notion of pseudo-intents. In this work we propose the minimal generators as an element to remove redundancy in the basis.

The main problem is to enumerate all the minimal generators from a set of implications. We introduce a method to compute all the minimal generators which is based on the Simplification Rule for implications. The simplification paradigm allows us to remove redundancy in the implications by deleting attributes inside the implication without removing the whole implication itself. In this work, the application of the Simplification Rule to the  set of implications guides the search of the minimal generators in a logic-based style, providing a deterministic approach.},
year = {2012}
}

@inproceedings{Cla12ondrej,
author = {Kr{\'\i}dlo, O. and   Ojeda-Aciego, M.},
booktitle = {Proc. of Concept Lattices and Applications, CLA 2012},
pages = {233--244},
pdf = {http://cla.inf.upol.cz/papers/cla2012/paper20.pdf},
title = {Linking {$L$}-Chu correspondences and  completely lattice {$L$}-valued sets},
abstract = {Continuing our categorical study of $L$-fuzzy extensions of formal concept analysis, we provide a representation theorem for the category of $L$-Chu correspondences between $L$-formal contexts and prove that it is equivalent to the category of completely lattice $L$-ordered sets.},
year = {2012}
}

@inproceedings{Cla12jan,
author = {J. Konecny and J. Medina and Ojeda-Aciego, M.},
booktitle = {Proc. of Concept Lattices and Applications, CLA 2012},
pages = {245--256},
pdf = {http://cla.inf.upol.cz/papers/cla2012/paper21.pdf},
title = { Intensifying hedges and the size of multi-adjoint concept lattices with heterogeneous conjunctors},
abstract = {In this work we focus on the use of intensifying hedges as a tool to reduce the size of the recently introduced multi-adjoint concept lattices with heterogeneous conjunctors.},
year = {2012}
}

@inproceedings{nafips12,
author = {Madrid, N. and Ojeda-Aciego, M.},
booktitle = {31st Meeting of the North-American Fuzzy Information Processing Society, NAFIPS'12},
title = {On least coherence-preserving negations},
year = {2012},
url = {http://dx.doi.org/10.1109/NAFIPS.2012.6290981},
abstract = {We focus on the notion of {coherent} $L$-interpretations with respect to a negation operator, as a convenient generalization to  a fuzzy or multiple-valued environment  of the classical notion of consistent interpretation. We   show that, given an $L$-interpretation $I$, the set of negation operators $n$ satisfying that $I$ is coherent wrt $n$ has a structure of    complete  lattice; so there exists the greatest and the least negation operators satisfying such property;  moreover,  the expression of the least negation operator $n$ satisfying that $I$ is coherent wrt $n$ is presented. Finally, for the case in which the underlying set of truth-values is the real unit interval $[0,1]$, we describe a method to achieve a {practical} expression for the  least coherence-preserving negation. }
}

@inproceedings{flins12,
author = {Cabrera, I.P. and Cordero, P. and Guti\'errez, G. and Mart{\'\i}nez, J. and Ojeda-Aciego, M.},
booktitle = {10th Int FLINS Conference on Uncertainty Modeling in Knowledge Engineering and Decision Making},
title = {Filters and Deductive Systems on Residuated Multilattices},
year = {2012},
abstract = {We continue the study of the residuated operations in the framework of hyperstructures. We focus on the case of a  multilattice as underlying algebraic structure and introduce the notions of filter and deductive system. They differ from the analogous concepts in a pocrim due to the connection to congruence relations. Finally, we prove that the set of filters of a residuated multilattice is a complete lattice. }
}

@article{fss-hetero,
author = {Medina, J. and Ojeda-Aciego, M.},
journal = {Fuzzy Sets and Systems},
volume = {208},
pages = {95--110},
title = {On Multi-Adjoint Concept Lattices Based on Heterogeneous Conjunctors},
url = {http://dx.doi.org/10.1016/j.fss.2012.02.008},
pdf = {./TR/fss-het.pdf},
year = 2012,
abstract = {Sets of  attributes and  objects in fuzzy formal concept analysis  are
usually different and, hence, it might not make sense to  evaluate them on
the same carrier. In this context, the
operators used  to obtain the concept lattice could be defined by
associating   different lattices  to attributes and objects;
several reasons exist for which we need to evaluate the sets of
attributes and objects in the same carrier. Following this direction, we
introduce a new definition of a concept lattice,  where  objects and
attributes are evaluated on the same lattice $L$,  although   operators
evaluating  objects and attributes in different carriers are used.
Moreover, we  study the relationship between this new  concept lattice  and
the   alternative one which can be obtained directly  by using  different
carriers for the sets of  attributes and objects.},
bdsk-url-1 = {./TR/fss-het.pdf}
}

@article{ijcm-nico,
author = {Madrid, N. and Ojeda-Aciego, M.},
journal = {Intl J of Computer Mathematics},
number = {3},
pages = {310--324},
title = {On the existence and unicity of stable models in normal residuated logic programs},
pdf = {./TR/ijcm-nico.pdf},
url = {http://dx.doi.org/10.1080/00207160.2011.5808428},
volume = {89},
year = 2012,
abstract = {We introduce a sufficient condition which guarantees the existence of stable models for a
normal residuated logic program interpreted on the truth-space $[0, 1]^n$. Specifically, the continuity
of the connectives involved in the program ensures the existence of stable models. Then,
we study conditions which guarantee the uniqueness of stable models in the particular case
of the product t-norm, its residuated implication, and the standard negation.
},
bdsk-url-1 = {./TR/ijcm-nico.pdf}
}

@article{amc11,
author = {Cabrera, I.P. and Cordero, P. and Guti\'errez, G. and Mart{\'\i}nez, J. and Ojeda-Aciego, M.},
date-modified = {2012-07-26 05:51:19 +0000},
journal = {Applied Mathematics and Computation},
number = {1},
pages = {31-44},
title = {Finitary coalgebraic multisemilattices and multilattices},
pdf = {./TR/amc11.pdf},
volume = {219 },
year = 2012,
abstract = {In this paper we continue the coalgebraization of the structure of multilattice. Specifically, we introduce  a coalgebraic characterization of the notion of finitary multi(semi)lattice, a  generalization of   that of semilattice which arises naturally in several areas of computer science and provides the possibility of handling non-determinism.
},
url = {http://dx.doi.org/10.1016/j.amc.2011.10.081}
}

@article{fundam11,
author = {Kr{\'\i}dlo, O. and Kraj{\v c}i, S. and Ojeda-Aciego, M.},
journal = {Fundamenta Informaticae},
volume = {115},
number = {4},
pages = {297--325},
title = {The category of {$L$}-{C}hu correspondences and the structure of {$L$}-bonds},
pdf = {./TR/fundamenta11.pdf},
url = {http://dx.doi.org/10.3233/FI-2012-657},
year = 2012,
abstract = {An $L$-fuzzy generalization of the so-called Chu correspondences between formal contexts forms a category called $L$-ChuCors. In this work we show that this category naturally embeds ChuCors, and prove that it is *-autonomous.
We also focus on the direct product of two $L$-fuzzy contexts, which is defined with the help of a binary operation, essentially a disjunction,  on a lattice of truth-values $L$.
},
bdsk-url-1 = {./TR/fundamenta11.pdf}
}

@inproceedings{cmmse11,
author = {Cabrera, I.P. and Cordero, P. and Guti\'errez, G. and Mart{\'\i}nez, J. and Ojeda-Aciego, M.},
booktitle = {Computational Methods in Mathematics, Science, and Engineering},
pdf = {./TR/cmmse11.pdf},
title = {Residuated operations in hyperstructures: residuated multilattices},
year = {2011},
abstract = {We initiate the exploration of the residuated operations in the framework of hyperstructures. We focus on the case of a  multilattice as underlying algebraic structure, introduce the notion of residuated multilattice and study some of its properties, among which we have shown that the idempotency of the monoidal operation characterises the subclass of Heyting algebras.}
}

@inproceedings{qr11,
author = {Burrieza, A. and Mu{\~n}oz, E. and Ojeda-Aciego, M.},
booktitle = {Proc. Intl Qualitative Reasoning Workshop 2011},
note = {Accepted},
title = {{PDL} for Qualitative Reasoning about moving objects: first steps},
url = {./TR/qr11.pdf},
year = 2011,
bdsk-url-1 = {./TR/qr11.pdf}
}

@article{wilf11,
author = {Dam\'asio, C.V. and Madrid, N. and Ojeda-Aciego, M.},
journal = {Lecture Notes in Computer Science},
pages = {115-122},
title = {On the notions of residuated-based coherence and bilattice-based consistence},
url = {./TR/wilf11.pdf},
volume = {6857},
year = 2011,
abstract = {Different notions of coherence and consistence have been proposed in the literature on fuzzy systems. In this work we focus on the relationship between some of the approaches developed, on the one hand, based of residuated lattices and, on the other hand, based on the theory of bilattices.},
bdsk-url-1 = {./TR/wilf11.pdf}
}

@article{iwann11-survey,
author = {Cabrera, I. P. and Cordero, P. and Ojeda-Aciego, M.},
journal = {Lecture Notes in Computer Science},
pages = {437--444},
title = {Non-deterministic algebraic structures for soft computing},
url = {./TR/iwann11.pdf},
volume = {6692},
year = 2011,
abstract = {The need of  considering non-determinism in theoretical computer science has been claimed by several authors in the literature. The notion of non-deterministic automata as a formal
model of computation is widely used, but the specific study of
non-determinism is useful, for instance, for natural language processing, in describing   interactive systems, for characterizing the flexibility allowed in the
design of a circuit or a network, etc.
The most suitable structures for constituting the foundation  of this
theoretical model of computation are non-deterministic algebras. The
interest on these generalized algebras has been growing in recent years,
both from a crisp and a  fuzzy standpoint.
This paper presents a survey of these
structures  in order to foster its applicability for the development of new soft computing techniques.},
bdsk-url-1 = {./TR/iwann11.pdf}
}

@article{iwann11,
author = {Juli\'an, P. and Medina, J. and Moreno, G. and Ojeda-Aciego, M.},
journal = {Lecture Notes in Computer Science},
pages = {429--436},
title = {A Static Preprocess for Improving Fuzzy Thresholded Tabulation},
url = {./TR/iwann11-malp.pdf},
volume = {6692},
year = 2011,
bdsk-url-1 = {./TR/iwann11-malp.pdf}
}

@inproceedings{icfca11,
author = {Kr{\'\i}dlo, O. and Kraj{\v c}i, S. and Ojeda-Aciego, M.},
booktitle = {Proc. of Intl Conf on Formal Concept Analysis},
pages = {39--52},
title = {Functorial connection between {$L$}-{ChuCors} and a category of supremum preserving mappings},
url = {./TR/icfca11.pdf},
year = {2011},
abstract = {The category of $L$-Chu correspondences between formal $L$-fuzzy contexts provides a categorical view on Formal Context Analysis. In this paper some interesting and useful properties are shown. The main aim of this paper is to introduce a functor between $L$-ChuCors and a category of supremum preserving mappings between completely   $L$-ordered sets.},
bdsk-url-1 = {./TR/icfca11.pdf}
}

@article{tfs-nico,
author = {Madrid, N. and Ojeda-Aciego, M.},
journal = {IEEE Transactions on Fuzzy Systems},
number = {4},
pages = {605--622},
title = {Measuring Inconsistency in Fuzzy Answer Set Semantics},
url = {http://dx.doi.org/10.1109/TFUZZ.2011.2114669},
pdf = {./TR/tfs2011.pdf},
volume = {19},
year = 2011,
abstract = {Recent approaches have shown  that the  measurement of  the amount of inconsistent information contained in a logic theory can be useful  to infer positive information.

This paper deals with the definition of measures of  inconsistency in the residuated logic programming paradigm under the fuzzy answer set semantics. This fuzzy framework provides a soft mechanism of controlling the amount of information inferred and thus, controlling the inconsistencies by modifying slightly the truth-values of some rules.
},
bdsk-url-1 = {http://dx.doi.org/10.1109/TFUZZ.2011.2114669}
}

@inproceedings{foci,
author = {Madrid, N. and Ojeda-Aciego, M.},
booktitle = {IEEE Symposium on Foundations of Computational Intelligence, FOCI 2011},
pages = {115--121},
title = {On the use of fuzzy stable models for inconsistent classical logic programs},
pdf = {./TR/foci.pdf},
year = {2011},
abstract = {We introduce a sufficient condition which guarantees the existence of stable models for a normal residuated logic program interpreted  on  the truth-space $[0,1]^n$. Specifically,  the continuity of the connectives involved in the program ensures the existence of stable models. Then, we focus on the assignment of a   fuzzy stable model semantics to inconsistent classical logic programs on the basis of the separation of the notion of inconsistence  and uncertainty. },
bdsk-url-1 = {./TR/foci.pdf}
}

@article{ijcm10,
author = {Kr{\'\i}dlo, O. and Ojeda-Aciego, M.},
journal = {Intl J of Computer Mathematics},
number = {9},
pages = {1808--1818},
pdf = {./TR/ijcm10.pdf},
title = {On ${L}$-fuzzy {C}hu correspondences},
url = {http://dx.doi.org/10.1080/00207160903494147},
volume = {88},
year = {2011},
abstract = {In this paper, we focus on the framework of Chu correspondences introduced by Mori for classical  formal concept analysis, and we propose a suitable extension of the framework  in a more general and flexible environment based on  $L$-fuzzy sets, and define the notions of $L$-Chu correspondence and of $L$-bond. After introducing the generalized framework, the sets of $L$-Chu correspondences and of $L$-bonds are proved to have the structure of complete lattice and, furthermore,  there exists a natural anti-isomorphism between them.},
bdsk-url-1 = {http://dx.doi.org/10.1080/00207160903494147}
}

@article{ijufks10,
author = {Burrieza, A. and Mu{\~n}oz, E. and Ojeda-Aciego, M.},
journal = {Intl J of Uncertainty, Fuzziness, and Knowledge-based Systems},
number = {1},
pages = {11-26},
pdf = {./TR/ijufks10.pdf},
title = {A {PDL} approach for qualitative velocity},
url = {http://dx.doi.org/10.1142/S021848851100685X},
volume = {19},
year = 2011,
abstract = {We introduce the syntax, semantics, and an axiom system for a PDL-based extension of the logic  for order of magnitude qualitative
reasoning, developed in order to deal with the concept of qualitative velocity, which together with qualitative distance and orientation, are important notions in order to represent spatial reasoning for moving objects, such as robots. The main advantages of using a PDL-based approach are,  on the one hand, all the well-known  advantages of using logic in AI, and, on the other hand, the possibility of constructing complex relations from simpler ones, the flexibility for using different levels of granularity, its possible extension by adding other spatial components, and the use of a language close to programming languages.
},
bdsk-url-1 = {http://dx.doi.org/10.1142/S021848851100685X}
}

@article{nilo-ins,
author = {Cabrera, I.P. and Cordero, P. and Guti\'errez, G. and Mart{\'\i}nez, J. and Ojeda-Aciego, M.},
journal = {Information Sciences},
number = {22},
pages = {4323--4335},
pdf = {./TR/ins-coalgebra.pdf},
title = {A coalgebraic approach to non-determinism: applications to multilattices},
url = {http://dx.doi.org/10.1016/j.ins.2010.07.002},
volume = {180},
year = {2010},
abstract = {Multilattices are a suitable generalization of lattices which enables to accommodate the formalization of non-deterministic computation; specifically, the algebraic characterization for multilattices provides a formal framework to develop tools in several fields of computer
science. On the other hand, the usefulness of coalgebra theory has been increasing in the recent years, and its importance  is undeniable. In this paper, somehow mimicking the use of universal algebra, we define a new kind of coalgebras (the ND-coalgebras) that allows to formalize  non-determinism, and show that  several concepts,
widely used in computer science are, indeed,  ND-coalgebras.
Within this formal context, we study a minimal set of properties which provides a  coalgebraic definition of multilattices.},
bdsk-url-1 = {http://dx.doi.org/10.1016/j.ins.2010.07.002}
}

@inproceedings{Cla10bonds,
author = {Kr{\'\i}dlo, O. and Kraj{\v c}i, S. and Ojeda-Aciego, M.},
booktitle = {Proc. of Concept Lattices and Applications, CLA 2010},
pages = {70--79},
title = {{$L$}-Bonds vs extents of direct products of two {$L$}-fuzzy contexts},
url = {http://CEUR-WS.org/Vol-672/paper7.pdf},
year = {2010},
abstract = {We focus on the direct product of two $L$-fuzzy contexts, which are defined with the help of a binary operation  on a lattice of truth-values $L$. This operation, essentially a disjunction, is defined as $k\ltimes l=\neg k\to l$, for $k,l\in L$ where negation is interpreted as $\neg l=l\to 0$.
We provide some results which extend previous work by Kr\"otzsch, Hitzler and Zhang.},
bdsk-url-1 = {http://CEUR-WS.org/Vol-672/paper7.pdf}
}

@inproceedings{Cla10attributes,
author = {Medina, J. and Ojeda-Aciego, M.},
booktitle = {Proc. of Concept Lattices and Applications, CLA 2010},
pages = {92--103},
title = {Towards attribute reduction in multi-adjoint concept lattices},
url = {http://CEUR-WS.org/Vol-672/paper9.pdf},
year = {2010},
abstract = {In Formal Concept Analysis, attribute reduction is a important step in order to reduce the complexity of the computation of the concept lattice. This reduction is more complex in fuzzy environments.   In this paper, we will present a first approximation to reduce the set of attributes in the multi-adjoint concept lattice.
The solution found is based on
the development of specific results which allow us to reduce the
number of attributes in the classical case, by detecting  some relatively
necessary and absolutely unnecessary attributes and, then, use linguistic
labels in order to obtain a method to reduce the number of   attributes  in a
multi-adjoint context, working up to some level of tolerance, and preserving the
original lattice structure of the set of concepts.},
bdsk-url-1 = {http://CEUR-WS.org/Vol-672/paper9.pdf}
}

@inproceedings{cmmse10Chu,
author = {Kr{\'\i}dlo, O. and Kraj{\v c}i, S. and Ojeda-Aciego, M.},
booktitle = {Computational Methods in Mathematics, Science, and Engineering},
pages = {583--588},
pdf = {./TR/Pkridlo.pdf},
title = {An embedding of {C}hu{C}ors in {$L$}-{C}hu{C}ors},
year = {2010},
abstract = {An $L$-fuzzy generalization of the so-called Chu correspondences between formal contexts forms a category called $L$-{C}hu{C}ors. In this work we show that this category naturally embeds {C}hu{C}ors.}
}

@inproceedings{cmmse10Nico,
author = {Madrid, N. and Ojeda-Aciego, M.},
booktitle = {Computational Methods in Mathematics, Science, and Engineering},
pages = {598--604},
title = {On the existence of stable models in normal residuated logic programs},
year = {2010},
abstract = {We introduce a sufficient condition which guarantees the existence of stable models for a normal residuated logic program interpreted  on  the truth-space $[0,1]^n$. Specifically,  the continuity of the connectives involved in the program ensures the existence of stable models.}
}

@inproceedings{cmmse10fca,
author = {Medina, J. and Ojeda-Aciego, M.},
booktitle = {Computational Methods in Mathematics, Science, and Engineering},
pages = {633--641},
pdf = {./TR/Pmedina.pdf},
title = {On multi-adjoint concept lattices based on heterogeneous conjunctors},
year = {2010},
abstract = {In formal concept analysis,  the sets of  attributes and  objects  are usually different, with different meaning  and, hence, it might not make sense to  evaluate them on the same carrier. In this context, the operators used  to obtain the concept lattice could be defined by considering   different lattices associated to attributes and objects.
Anyway there exist several reasons for which we need    to evaluate the set of attributes and objects in the same carrier. In this direction, we present in this paper a new concept lattice,  where the objects and attributes are evaluated on the same lattice $L$,  although   operators which evaluate objects and
attributes in different carriers are used.
Moreover, we have studied the relationship between the new  concept lattice  and the   other one obtained directly  considered different carriers to both set of attributes and objects.}
}

@inproceedings{nilo,
author = {Cabrera, I.P. and Cordero, P. and Guti\'errez, G. and Mart{\'\i}nez, J. and Ojeda-Aciego, M.},
booktitle = {Proc. of Physics and Computation},
title = {Coalgebras and non-determinism: an application to multilattices},
year = {2010},
abstract = {Multilattices are a suitable generalization of lattices which enables to accommodate the formalization of non-deterministic computation; specifically, the algebraic characterization for multilattices provides a formal framework to develop tools in several fields of computer
science. On the other hand, the usefulness of coalgebra theory has been increasing in the recent years, and its importance  is undeniable. In this work, we define a new kind of coalgebras (the ND-coalgebras) that allows to formalize  non-determinism, and show that  several concepts,
widely used in computer science are, indeed,  ND-coalgebras.
Within this formal context, we study a minimal set of properties which provides a  coalgebraic definition of multilattices.}
}

@inproceedings{prole10,
author = {Juli\'an, P. and Medina, J. and Moreno, G. and Ojeda-Aciego, M.},
booktitle = {Proc of PROLE'10},
note = {(Short note)},
title = {Efficient Thresholded Tabulation for Fuzzy Query Answering},
year = 2010,
abstract = {Fuzzy logic programming represents a flexible and powerful declarative paradigm amalgamating fuzzy logic and logic programming, for which there exists different promising approaches described in the literature. In this work we propose an improved fuzzy query answering procedure for the so-called multi-adjoint logic programming approach, which avoids the re-evaluation of goals and the generation of useless computations thanks to the combined use of tabulation with thresholding techniques. The general idea is that, when trying to perform a computation step by using a given program rule R, we firstly analyze if such step might contribute to reach further significant solutions (non-tabulated yet). When it is the case, it is possible to avoid useless computation steps via rule R by using thresholds and filters based on the truth degree of R, as well as a safe, accurate and dynamic estimation of the maximum truth degree associated to its body.}
}

@inproceedings{fuzzieee10,
author = {Madrid, N. and Ojeda-Aciego, M.},
booktitle = {IEEE Intl Conf on Fuzzy Systems (FUZZ-IEEE'10)},
pages = {2244--2250},
title = {Measuring instability in normal residuated logic programs: adding information},
url = {http://dx.doi.org/10.1109/FUZZY.2010.5584819},
year = 2010,
abstract = {Inconsistency in the framework of general residuated logic programs can be, somehow, decomposed in two notions: incoherence and instability. In this work, we  focus  on the measure of instability of normal residuated programs.    Some measures were already provided and initial results obtained in terms of the amount of information that have to be discarded in order to recover stability; in this paper, our interest is  focused precisely on the case in which stability can be recovered by adding information to our program.},
bdsk-url-1 = {http://dx.doi.org/10.1109/FUZZY.2010.5584819}
}

@article{ipmu10,
author = {Madrid, N. and Ojeda-Aciego, M.},
journal = {Communications in Computer and Information Science},
pages = {128--137},
pdf = {./TR/ipmu10.pdf},
title = {Measuring instability in normal residuated logic programs: discarding information},
url = {http://dx.doi.org/10.1007/978-3-642-14055-6_14},
volume = 80,
year = 2010,
abstract = {Inconsistency in the framework of general residuated logic programs can be, somehow, decomposed in two notions: incoherence and instability. In this work, we  focus  on the measure of instability of normal residuated programs.    Some measures are provided and initial results are obtained in terms of the amount of information that have to be discarded in order to recover stability.},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-642-14055-6_14}
}

@inproceedings{estylf10a,
author = {Cabrera, I.P. and Cordero, P. and Guti\'errez, G. and Mart{\'\i}nez, J. and Ojeda-Aciego, M.},
booktitle = {XV Spanish Conference on Fuzzy Logic and Technology},
pages = {175--180},
pdf = {./TR/estylf10a.pdf},
title = {On fuzzy homomorphisms between hyperrings},
year = 2010,
abstract = {We focus on the study of the structure of hyperrings;  in this paper, we recall
the basics of crisp homomorphisms between hyperstructures, particularly, between hyperrings and, then, the notion of fuzzy homomorphism between hyperrings is established and its main properties are analysed.}
}

@inproceedings{estylf10b,
author = {Madrid, N. and Ojeda-Aciego, M.},
booktitle = {XV Spanish Conference on Fuzzy Logic and Technology},
pages = {157--162},
pdf = {./TR/estylf10b.pdf},
title = {On the Notion of Coherence in Fuzzy Answer Set Semantics},
year = 2010,
abstract = {The notion of  coherence, introduced in the context of fuzzy answer set programming (FASP),  provides a metalogic condition on the obtained models in FASP. In this work, we relate it with the concept of $N$-contradiction which is used in the definition of antonyms. }
}

@article{mo-ins,
author = {Medina, J. and Ojeda-Aciego, M.},
date-modified = {2009-03-11 10:21:09 +0100},
journal = {Information Sciences},
number = 5,
pages = {712--725},
pdf = {./TR/t-concepts.pdf},
url = {http://dx.doi.org/10.1016/j.ins.2009.11.018},
volume = 180,
year = 2010,
abstract = {The t-concept lattice is introduced as a set of triples associated to graded
tabular information interpreted in a non-commutative fuzzy logic. Following the
general techniques of formal concept analysis, and based on the works by
Georgescu and Popescu,  given a non-commutative conjunctor it is possible to
provide generalizations of the mappings for the intension and the extension in
two different ways, and this  generates a pair of concept lattices. In this paper,
we show that the information common to both concept lattices can be seen as
a sublattice of the Cartesian product of both concept lattices. The multi-adjoint
framework can be applied to this general t-concept lattice, and its usefulness is
illustrated by a working example. },
bdsk-url-1 = {http://dx.doi.org/10.1016/j.ins.2009.11.018}
}

@book{ipmu-book,
editor = {Bouchon-Meunier, B. and Magdalena, L. and Ojeda-Aciego, M. and Verdegay, J.L. and Yager, R.R.},
publisher = {Springer-Verlag},
series = {Studies in fuzziness and soft computing},
title = {Foundations of reasoning under uncertainty},
url = {http://www.springer.com/engineering/book/978-3-642-10726-9},
volume = 249,
year = 2010,
abstract = {Uncertainty exists  almost  everywhere, except in the most idealized situations; it  is not only an inevitable and ubiquitous phenomenon, but is also a
fundamental scientific principle. Furthermore, uncertainty is
an attribute of information and, usually, decision-relevant information is
uncertain and/or imprecise, therefore the abilities to handle uncertain information and to reason from incomplete knowledge are crucial features of intelligent behaviour in complex and dynamic environments.
By carefully exploiting our tolerance for imprecision
and approximation we can often achieve tractability, robustness, and better
descriptions of reality than traditional deductive methods would allow us to obtain.
In conclusion, as we move further into the age of
machine intelligence,
the problem of reasoning under uncertainty, in other words, drawing conclusions from  partial knowledge, has  become a major research theme.

Not surprisingly, the rigorous treatment of uncertainty requires sophisticated
machinery, and the present volume is conceived as a contribution to a better
understanding of the foundations of  information processing and decision-making in an
environment of uncertainty, imprecision and partiality of truth.

%\vspace{\baselineskip}

This volume draws on papers presented at the
2008 Conference on Information Processing and Management of
Uncertainty (IPMU) which was held in M\'alaga, Spain, organized by the University of M\'alaga, and brought together some of the
world's leading experts in uncertainty handling.

Since its first edition, held in 1986, the focus of IPMU conferences has been on the development of foundations and technology needed for the construction of intelligent systems.
Over the years, IPMU  has grown steadily in visibility and importance, and has evolved into a leading conference in
its field, embracing a wide-variety of methodologies for dealing with
uncertainty and imprecision, and this explains the unusually wide variety of concepts, methods and techniques which are discussed in the book.  The growth in importance
of IPMU reflects the fact that as we move further into the age of machine intelligence
and mechanized decision-making, the issue of how to deal with uncertain information
becomes an issue of paramount concern.

The book starts with  a revisited approach for  possibilistic fuzzy regression methods proposed  by Bisserier \emph{et al.}, in which the identification problem is reformulated according to a new criterion that assesses the model fuzziness independently of the collected data. Later, Bonissone  \emph{et al.} propose the fundamentals to design and construct a forest'' of randomly generated fuzzy decision trees in an approach which combines  the robustness of multi-classifiers, the construction efficiency of decision trees, the power of the randomness to increase the diversity of the trees in the forest, and the flexibility of fuzzy logic and the fuzzy sets for data managing. The third contribution, by Delgado  \emph{et al.}, is related to
the well-known framework of mining association rules  for extracting useful knowledge from databases; they introduce so-called double rules as a new type of rules which in conjunction with exception rules will describe in more detail the relationship between two sets of items.
Next, Dubois discusses ignorance and contradiction, and argues that they cannot be viewed either as additional truth-values or processed in a truth-functional manner, and that doing it leads to weak or debatable uncertainty handling approaches.

The volume continues with Grzegorzewski's work, which introduces new algorithms
for calculating the proper approximations by trapezoidal fuzzy numbers
which preserves the expected interval. Next, Jenhani \emph{et al.} investigate the problem of measuring the
similarity degree between two normalized possibility distributions
encoding preferences or uncertain knowledge. Later, Juli\'an \emph{et al.} propose an improved
logic programming  which avoids the re-evaluation of
goals and the generation of useless computations thanks to the
combined use of tabulation with thresholding techniques. Then, Kacprzyk and Wilbik, focus on an extension of linguistic summarization of time series; ; in addition to the basic criterion of a degree of truth (validity), they also use  a degree of imprecision, specificity, fuzziness and focus as an additional criteria.

In the final part of the volume, Kalina \emph{et al.} discuss the possibility of applying the
modified level-dependent Choquet integral to a monopersonal
multicriterial decision-making problem; they propose an algorithm which produces an
outranking of objects taking into account an interaction between
criteria. Next, Llamazares and Marques Pereira consider mixture operators to aggregate
individual preferences and characterize those that allow to extend some
majorities rules, such as simple, Pareto and absolute special majorities, to the
field of gradual preferences. Later, Mercier \emph{et al.} concentrate on the links between the
different operations that can be used in the theory of belief functions  to correct the information provided by a source, given meta-knowledge about that source.
Then, Miranda  compares the different notions of conditional coherence
within the behavioural theory of imprecise probabilities when all
the referential spaces are finite. Finally, Soubaras focuses on evidential Markov chains as  a suitable generalization of classical Markov chains to the Dempster-Shafer theory, replacing the involved states by sets of states.

Last, but not least, we would like to thank the following institutions for their  help with the organization of the 12th IPMU Conference:
Ministerio de Educaci\'on y Ciencia, grant TIN2007-30838-E,
Junta de Andaluc\'\i a, grant RES. 2/07-OC,  Universidad de M\'alaga,   Diputaci\'on Provincial de M\'alaga,    Patronato de Turismo de la Costa del Sol,   Ayuntamiento de M\'alaga,   Ayuntamiento de Torremolinos,   European Society for Fuzzy Logic and Technology, EUSFLAT,
IEEE Computational Intelligence Society.
},
bdsk-url-1 = {http://www.springer.com/engineering/book/978-3-642-10726-9}
}

@incollection{ipmu-chapter,
author = {Juli\'an, P. and Medina, J. and Moreno, G. and Ojeda-Aciego, M.},
booktitle = {Foundations of reasoning under uncertainty},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {125--141},
publisher = {Springer-Verlag},
title = {Efficient thresholded tabulation for fuzzy query answering},
url = {http://www.springer.com/engineering/book/978-3-642-10726-9},
year = 2010,
abstract = {Fuzzy logic programming represents a flexible and powerful
declarative paradigm amalgamating fuzzy logic and logic
programming, for which there exists different promising approaches
described in the literature. In this paper we propose an improved
logic programming approach, which avoids the re-evaluation of
goals and the generation of useless computations thanks to the
combined use of tabulation with thresholding techniques. The
general idea is that, when trying to perform a computation step by
using a given program rule R, we firstly analyze if such step
might contribute to reach further significant solutions (non
tabulated yet). When it is the case, it is possible to avoid a
useless computation step via a rule R by using thresholds and
filters based on the truth degree of R, as well as a safe,
accurate and dynamic estimation of the maximum truth degree
associated to its body.},
bdsk-url-1 = {http://www.springer.com/engineering/book/978-3-642-10726-9}
}

@article{caepia09,
author = {Burrieza, A. and Mu{\~n}oz, E. and Ojeda-Aciego, M.},
journal = {Lecture Notes in Computer Science},
pages = {71-80},
pdf = {./TR/caepia09.pdf},
title = {Closeness and distance relations in order of magnitude qualitative reasoning via {PDL}},
url = {http://dx.doi.org/10.1007/978-3-642-14264-2_8},
volume = {5988},
year = 2010,
abstract = {The syntax, semantics and an axiom system for an extension of  Propositional Dynamic Logic (PDL) for order of magnitude qualitative
reasoning which formalizes the concepts of closeness and distance is introduced in this paper.  In doing this, we use some of the advantages of PDL: firstly, we exploit the possibility of constructing complex relations from simpler ones for defining the concept of closeness and other programming commands such as {\em while \dots\ do} and \emph{repeat \dots\ until}; secondly, we employ its theoretical support in order to show that the satisfiability problem is decidable. Moreover, the specific axioms of our logic have been obtained from the {\em minimal} set of formulas needed in our definition of qualitative sum of small, medium and large numbers.  We also present some of the advantages of our approach on the basis of an example.},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-642-14264-2_8}
}

@article{fuzzcong-amai,
author = {Cabrera, I. P. and Cordero, P. and Guti{\'e}rrez, G. and Mart{\'\i}nez, J. and Ojeda-Aciego, M.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Annals of Mathematics and Artificial Intelligence},
number = {3--4},
pages = {361--370},
pdf = {./TR/fuzzcong-amai.pdf},
title = {Congruence relations on some hyperstructures},
url = {http://dx.doi.org/10.1007/s10472-009-9146-5},
volume = 56,
year = 2009,
abstract = {In this work we study the structure of the set of congruences on several hyperstructures with one and two (hyper-)operations. On the one hand, we show  sufficient conditions guaranteeing that the set of congruences of an  nd-groupoid forms a complete lattice (which, in turn,  is a sublattice of the lattice of equivalence relations on the nd-groupoid).
On the other hand,  we focus on the study of the congruences on a multilattice; specifically, we prove that the set of congruences on an m-distributive multilattice forms a complete lattice and, moreover,  show that the classical relationship between homomorphisms and congruences can be adequately adapted to work with multilattices under suitable restrictions.},
bdsk-url-1 = {http://dx.doi.org/10.1007/s10472-009-9146-5}
}

@article{dos-sicomp,
author = {Straccia, U. and Ojeda-Aciego, M. and Dam{\'a}sio, C.V.},
date-modified = {2009-03-11 10:21:09 +0100},
journal = {SIAM J on Computing},
number = {5},
pages = {1881-1911},
pdf = {./TR/FixedPoints.pdf},
title = {On fixed-points of multi-valued functions on complete lattices and their application to generalized logic programs},
url = {http://dx.doi.org/10.1137/070695976},
volume = {38},
year = 2009,
abstract = {Unlike monotone single-valued
functions, multivalued mappings may have zero, one, or (possibly infinitely) many
minimal fixed-points.
The contribution of this work is twofold.  First, we overview and investigate the existence and computation of minimal fixed-points of multivalued mappings, whose domain is a complete
lattice and whose range is its power set.  Second, we show how these results are applied to a general form of logic programs, where the truth space is a complete lattice. We show that a multivalued
operator can be defined whose fixed-points are in one-to-one correspondence with the models of the logic program. },
bdsk-url-1 = {http://dx.doi.org/10.1137/070695976}
}

@inproceedings{fuzz-ieee09,
author = {Madrid, N. and Ojeda-Aciego, M.},
booktitle = {IEEE Intl Conf on Fuzzy Systems (FUZZ-IEEE'09)},
pages = {598--603},
pdf = {./TR/fuzz-ieee09.pdf},
title = {On the Measure of Incoherence in Extended Residuated Logic Programs},
url = {http://dx.doi.org/10.1109/FUZZY.2009.5277277},
year = 2009,
abstract = {In this paper we continue analyzing the introduction of negation into the framework of residuated logic programming; specifically, we focus on extended  programs, in which strong negation is introduced. The classical approach to extended logic programs consists in considering negated literals as new, independent, ones and, then apply the usual monotonic approach (based on the fix-point semantics and the $T_\mathbb{P}$ operator); if the least fix-point so obtained is inconsistent, then the approach fails and no meaning is attached to the program. This paper introduces several approaches to considering consistence (under the term \emph{coherence}) into a fuzzy setting, and studies some of their properties.},
bdsk-url-1 = {http://dx.doi.org/10.1109/FUZZY.2009.5277277}
}

@inproceedings{asc09,
author = {Medina, J. and Ojeda-Aciego, M.},
booktitle = {IASTED Conf on Artificial Intelligence and Soft Computing},
pages = {99--106},
pdf = {./TR/asc09.pdf},
title = {Taming non-commutativity in the framework of multi-adjoint concept lattices},
year = 2009,
abstract = {Sometimes, in real applications, we have to consider the use of non-commutative operators. However, it is interesting to be able to balance" of soften" the non-commutative character of the involved operators.

There exist some approaches to the construction of concept lattices based on non-commutative conjunctors $L\times L\to L$, but are based on the fact that the supports (or carriers) of the fuzzy subsets of both objects and attributes have to coincide.

Our contribution in this work is to present sufficient conditions in order to be able to construct concepts in a generalized fuzzy context in which the domain of the underlying conjunctors can be  $L_1\times L_2$ with $L_1\neq L_2$.}
}

@inproceedings{icfc09,
author = {Cabrera, I. P. and Cordero, P. and Guti{\'e}rrez, G. and Mart{\'\i}nez, J. and Ojeda-Aciego, M.},
booktitle = {Intl Conf on Fuzzy Computation},
pages = {59-67},
pdf = {./TR/icfc.pdf},
title = {On congruences and homomorphisms on some non-deterministic algebras},
year = 2009,
abstract = {Starting with the underlying motivation of developing a general theory of  $L$-fuzzy sets where~$L$ is a multilattice (a particular case of non-deterministic algebra), we study the relationship between the crisp notions of  congruence, homomorphism and substructure  on some non-deterministic algebras which have been used in the literature, i.e. hypergroups, and join spaces. Moreover, we provide suitable extensions of these notions to the fuzzy case.}
}

@article{iwann-survey,
author = {Cabrera, I. P. and Cordero, P. and Ojeda-Aciego, M.},
date-modified = {2009-03-11 10:21:09 +0100},
journal = {Lecture Notes in Computer Science},
pages = {236--244},
pdf = {./TR/iwann-survey.pdf},
title = {Fuzzy logic, soft computing, and applications},
url = {http://dx.doi.org/10.1007/978-3-642-02478-8_30},
volume = {5517},
year = 2009,
abstract = {We survey on the theoretical and practical developments of the theory of fuzzy logic and soft computing. Specifically, we briefly review the history and main milestones of   fuzzy logic (in the wide sense), the more recent development of soft computing, and finalise by presenting a panoramic view of applications:  from the most abstract to the most practical ones.},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-642-02478-8_30}
}

@inproceedings{MO-ifsa:2009,
author = {Medina, J. and Ojeda-Aciego, M.},
booktitle = {Intl Fuzzy Systems Association World Congress IFSA'09},
pages = {1091-1095},
pdf = {./TR/MO-IFSA09.pdf},
title = {On the representation theorem of multi-adjoint concept lattices},
year = {2009},
abstract = { Formal concept analysis   has become an important and appealing research topic. There exist a   number of different    fuzzy extensions of formal concept analysis and of its representation theorem, which gives conditions
for a complete lattice in order to be isomorphic to a
concept lattice.   In this paper we concentrate on the study of operational properties of the mappings $\alpha$ and $\beta$ required in   the representation theorem.}
}

@inproceedings{cmmse09,
author = {Kr{\'\i}dlo, O. and Ojeda-Aciego, M.},
booktitle = {Computational Methods in Mathematics, Science, and Engineering},
note = {Position paper},
pages = {608--617},
pdf = {./TR/cmmse09.pdf},
title = {On the ${L}$-fuzzy generalization of {C}hu correspondences},
year = {2009},
abstract = {In this position paper, we focus on the framework of Chu correspondences extending Mori's approach  to formal concept analysis by proposing suitable definitions of the required concepts in an L-fuzzy environment.}
}

@inproceedings{eurofuse09,
author = {Cabrera, I. P. and Cordero, P. and Guti{\'e}rrez, G. and Mart{\'\i}nez, J. and Ojeda-Aciego, M.},
booktitle = {EUROFUSE Workshop Preference Modelling and Decision Analysis},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {299-304},
pdf = {./TR/eurofuse09.pdf},
title = {On congruences, ideals and homomorphisms over multilattices},
year = 2009,
abstract = {In this paper, we focus on the notions of congruence, ideal and homomorphism on the generalized structure of multilattice.
We provide suitable definitions  of these notions in order to guarantee the classical relationship between these concepts.}
}

@article{wilf:2009,
author = {Madrid, N. and Ojeda-Aciego, M.},
date-modified = {2009-01-20 18:39:22 +0100},
journal = {Lect. Notes in Computer Science},
pages = {60--67},
pdf = {./TR/wilf2009.pdf},
title = {On coherence and consistence in fuzzy answer set semantics for residuated logic programs},
url = {http://dx.doi.org/10.1007/978-3-642-02282-1_8},
volume = {5571},
year = {2009},
abstract = {In this work we recall  the first steps towards the definition of
an answer set  semantics for residuated  logic programs with negation, and concentrate on the development of relationships between the notions of coherence and consistence of an  interpretation.},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-642-02282-1_8}
}

@article{bmoo-ijcm,
author = {Burrieza, A. and Mora, A. and Ojeda-Aciego, M. and Or{\l}owska, E},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Intl J on Computer Mathematics},
pages = {1852--1866},
pdf = {./TR/bmoo-ijcm.pdf},
title = {An implementation of a dual tableaux system for order-of-magnitude qualitative reasoning},
url = {http://dx.doi.org/10.1080/00207160902777906},
volume = {86},
year = 2009,
abstract = {Logic programming  has been used as a natural framework to
automate deduction    in the logic of order-of-magnitude reasoning.
Specifically, we introduce a Prolog implementation of    the
Rasiowa-Sikorski proof system associated to the relational
translation $Re(OM)$ of the multimodal logic of order-of-magnitude
qualitative reasoning $OM$.},
bdsk-url-1 = {http://dx.doi.org/10.1080/00207160902777906}
}

@article{prole08,
author = {Juli\'an-Iranzo, P. and Moreno, G. and Medina, J. and Ojeda-Aciego, M.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Electronic Notes in Theoretical Computer Science},
pages = {115--130},
pdf = {./TR/prole08.pdf},
title = {Thresholded Tabulation in a Fuzzy Logic Setting},
url = {http://dx.doi.org/10.1016/j.entcs.2009.07.063},
volume = {248},
year = 2009,
abstract = {Fuzzy logic programming represents a flexible and powerful
declarative paradigm amalgamating fuzzy logic and logic
programming, for which there exists different promising approaches
described in the literature. In this paper we propose an improved
logic programming approach, which avoids the re-evaluation of
goals and the generation of useless computations thanks to the
combined use of tabulation with thresholding techniques. The
general idea is that, when trying to perform a computation step by
using a given program rule R, we firstly analyze if such step
might contribute to reach further significant solutions (non
tabulated yet). When it is the case, it is possible to avoid a
useless computation step via a rule R by using thresholds and
filters based on the truth degree of R, as well as a safe,
accurate and dynamic estimation of the maximum truth degree
associated to its body.},
bdsk-url-1 = {http://dx.doi.org/10.1016/j.entcs.2009.07.063}
}

@article{fuzzcong-ijcm,
author = {Cabrera, I.P. and Cordero, P. and Guti{\'e}rrez, G. and Mart{\'\i}nez, J. and Ojeda-Aciego, M.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Intl J on Computer Mathematics},
pages = {1684--1695},
pdf = {./TR/fuzzcong-ijcm.pdf},
title = {Fuzzy congruence relations on nd-groupoids},
url = {http://dx.doi.org/10.1080/00207160902721797},
volume = {86},
year = 2009,
abstract = {In this work we introduce the notion of fuzzy congruence relation on an nd-groupoid and study conditions on the nd-groupoid which guarantee a complete lattice structure on the set of fuzzy congruence relations. The study of these conditions allowed to construct a counterexample
to the statement that the set of fuzzy congruences
on a hypergroupoid is a complete
lattice.},
bdsk-url-1 = {http://dx.doi.org/10.1080/00207160902721797}
}

@article{mor-fss-cmpi,
author = {Medina, J. and Ojeda-Aciego, M. and Ruiz-Calvi\~no, J.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Fuzzy Sets and Systems},
number = 2,
pages = {130--144},
pdf = {./TR/MACL-fss.pdf},
title = {Formal concept analysis via multi-adjoint concept lattices},
url = {http://dx.doi.org/10.1016/j.fss.2008.05.004},
volume = 160,
year = 2009,
abstract = {We investigate the use of multilattices as the set of truth-values underlying a general fuzzy logic programming framework. On the one hand, some theoretical results  about ideals of a multilattice are presented in order to provide an ideal-based semantics; on the other hand, a restricted semantics, in which interpretations assign elements of a multilattice to each propositional symbol,    is presented and analysed.},
bdsk-url-1 = {http://dx.doi.org/10.1016/j.fss.2008.05.004}
}

@inproceedings{flow:2008,
author = {Madrid, N. and Ojeda-Aciego, M.},
booktitle = {Proc of WI-IAT'08. Workshop on Fuzzy Logic in the Web},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {260--264},
pdf = {./TR/flow2008.pdf},
title = {Towards a fuzzy answer set semantics for residuated logic programs},
url = {http://dx.doi.org/10.1109/WIIAT.2008.357},
year = {2008},
abstract = {In this work we introduce the first steps towards the def- inition of an answer set semantics for residuated logic pro- grams with negation.},
bdsk-url-1 = {http://dx.doi.org/10.1109/WIIAT.2008.357}
}

@article{mor-aml,
author = {Medina, J. and Ojeda-Aciego, M. and Ruiz-Calvi\~no, J.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Applied Mathematics Letters},
number = 12,
pages = {1296--1300},
pdf = {./TR/FCA-aml.pdf},
title = {Relating generalized concept lattices with concept lattices for non-commutative conjunctors},
url = {http://dx.doi.org/10.1016/j.aml.2007.12.026},
volume = 21,
year = 2008,
abstract = {Generalized concept lattices have been recently proposed to deal with uncertainty or incomplete information as a non-symmetric generalization of the theory of fuzzy formal concept analysis. On the other hand, concept lattices have been defined as well in the framework of fuzzy logics with non-commutative conjunctors.

The contribution of this paper is to prove that any concept lattice for non- commutative fuzzy logic can be interpreted inside the framewok of generalized con- cept lattices, specifically, it is isomorphic to a sublattice of the cartesian product of two generalized concepts lattices.},
bdsk-url-1 = {http://dx.doi.org/10.1016/j.aml.2007.12.026}
}

@inproceedings{flins08,
author = {Cordero, P. and Guti\'errez, G. and Mart{\'\i}nez, J. and Ojeda-Aciego, M. and de las Pe{\~n}as, I.},
booktitle = {Intl FLINS Conference on Computational Intelligence in Decision and Control, FLINS'08},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {139--144},
pdf = {./TR/flins08.pdf},
title = {Congruence relations on multilattices},
year = 2008,
abstract = {We focus on a possible generalisation of the theory of congruences on a lattice to a more general framework. In this paper, we prove that the set of congruences on an m-distributive multilattice forms a complete lattice and, moreover, show that the classical relationship between homomorphisms and congruences can be adequately adapted to work with multilattices.}
}

@inproceedings{cmmse08a,
author = {Cordero, P. and Guti\'errez, G. and Mart{\'\i}nez, J. and Ojeda-Aciego, M. and de las Pe{\~n}as, I.},
booktitle = {Intl Conference on Mathematical Methods in Science and Engineering, CMMSE'08},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {151--159},
pdf = {./TR/cmmse08a.pdf},
title = {Fuzzy congruence relations on nd-groupoids},
year = 2008,
abstract = {In this work we introduce the notion of fuzzy congruence relation on an nd- groupoid and study conditions on the nd-groupoid which guarantee a complete lattice structure on the set of fuzzy congruence relations. The study of these conditions allowed to construct a counterexample to the statement that the set of fuzzy congruences on a hypergroupoid is a complete lattice.}
}

@inproceedings{cmmse08b,
author = {Burrieza, A. and Mora, A. and Ojeda-Aciego, M. and Or{\l}owska, E.},
booktitle = {Intl Conference on Mathematical Methods in Science and Engineering, CMMSE'08},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {93--102},
pdf = {./TR/cmmse08b.pdf},
title = {Implementing a relational system for order of magnitude reasoning},
year = 2008,
abstract = {This work concentrates on the automated deduction of logics of order-of-magnitude reasoning. Specifically, a Prolog implementation is presented for the Rasiowa- Sikorski proof system associated to the relational translation Re(OM) of the mul- timodal logic of qualitative order-of-magnitude reasoning OM.}
}

@inproceedings{estylf08a,
author = {Cordero, P. and Guti\'errez, G. and Mart{\'\i}nez, J. and Ojeda-Aciego, M. and de las Pe{\~n}as, I.},
booktitle = {XIV Spanish Conference on Fuzzy Logic and Technology},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {127--132},
pdf = {./TR/estylf08a.pdf},
title = {Congruence relations on hypergroupoids and nd-groupoids},
year = 2008,
abstract = {In this work we prove that the set of congruences on an nd-groupoid under suitable conditions is a complete lattice which is a sublattice of the lattice of equivalence relations on the nd-groupoid. The study of these conditions allowed to construct a counterexample to the statement that the set of (fuzzy) congruences on a hypergroupoid is a complete lattice.}
}

@inproceedings{estylf08b,
author = {Madrid, N. and Ojeda-Aciego, M.},
booktitle = {XIV Spanish Conference on Fuzzy Logic and Technology},
pages = {23--28},
pdf = {./TR/estylf08b.pdf},
title = {Towards an answer set semantics for residuated logic programs},
year = 2008,
abstract = {In this work we introduce the first steps towards the definition of an answer set semantics for residuated logic programs with negation.}
}

@article{iberamia08-bmo,
author = {Burrieza, A. and Mu{\~n}oz, E. and Ojeda-Aciego, M.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Lect. Notes in Artificial Intelligence},
pages = {11--20},
pdf = {./TR/iberamia08-bmo.pdf},
title = {A propositional dynamic logic approach for order-of-magnitude reasoning},
url = {http://dx.doi.org/10.1007/978-3-540-88309-8_2},
volume = {5290},
year = 2008,
abstract = {We introduce a Propositional Dynamic Logic for order of magnitude reasoning in order to formalize qualitative operations of sum and product. This new logic has enough expressive power to consider, for example, the concept of closeness, and to study some interesting proper- ties for the qualitative operations, together with the logical definability of these properties. Finally, we show the applicability of our approach on the basis of some examples.},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-540-88309-8_2}
}

@inproceedings{ipmu08,
author = {Juli\'an-Iranzo, P. and Moreno, G. and Medina, J. and Ojeda-Aciego, M. .},
booktitle = {Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU'08},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {505--512},
pdf = {./TR/ipmu08.pdf},
title = {Combining Tabulation and Thresholding Techniques for Executing Multi-Adjoint Logic Programs},
year = 2008,
abstract = {Multi-adjoint logic programming represents an extremely flexible attempt for fuzzifying logic programming, where the classical SLD-resolution principle has been extended to cope with imperfect information. In this paper we propose an enhanced tabulation-based query answering procedure, which avoids the generation of useless computations via thresholding techniques.}
}

@article{fss-lsc,
author = {Ojeda-Aciego, Manuel and Gottwald, Siegfried and H{\'a}jek, Petr},
journal = {Fuzzy Sets and Systems},
number = {10},
pages = {1129--1130},
title = {Preface to {M}athematical and {L}ogical {F}oundations of {S}oft {C}omputing"},
url = {http://dx.doi.org/10.1016/j.fss.2007.12.002},
volume = {159},
year = 2008,
bdsk-url-1 = {http://dx.doi.org/10.1016/j.fss.2007.12.002}
}

@article{powerset2-fss,
author = {Eklund, P. and Gal\'an, M.A. and Medina, J. and Ojeda-Aciego, M. and Valverde, A.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Fuzzy Sets and Systems},
number = 23,
pages = {2552--2574},
pdf = {./TR/fss-powerset2.pdf},
title = {Powersets of terms and composite monads},
url = {http://dx.doi.org/10.1016/j.fss.2007.06.002},
volume = 158,
year = 2007,
abstract = {Generalisation of the foundational basis for many-valued logic programming builds upon generalised terms in the form of powersets of terms. A categorical approach involving set and term functors as monads allows for a study of monad compositions that provide variable substitutions and compositions thereof. In this paper, substitutions and unifiers appear as constructs in Kleisli categories related to particular composed powerset term monads. Specifically, we show that a frequently used similarity-based approach to fuzzy unification is compatible with the categorical approach, and can be adequately extended in this setting; also some examples are included in order to illuminate the definitions.},
bdsk-url-1 = {http://dx.doi.org/10.1016/j.fss.2007.06.002}
}

@article{micai07-mor,
author = {Medina, J. and Ojeda-Aciego, M. and Ruiz-Calvi\~no, J.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Lect. Notes in Artificial Intelligence},
pages = {271--282},
pdf = {./TR/micai07-mor.pdf},
title = {On reachability of minimal models of multilattice-based logic programming},
url = {http://dx.doi.org/10.1007/978-3-540-76631-5_26},
volume = {4827},
year = 2007,
abstract = {In this paper some results are obtained regarding the existence and reachability of minimal fixed points for multiple-valued functions on a multilattice. The concept of inf-preserving multi-valued function is introduced, and shown to be a sufficient condition for the existence of minimal fixed point; then, we identify a sufficient condition granting that the immediate consequence operator for multilattice-based fuzzy logic programs is sup-preserving and, hence, computes minimal models in at most $\omega$ iterations.},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-540-76631-5_26}
}

@article{caepia07,
author = {Burrieza, A. and Mu{\~n}oz, E. and Ojeda-Aciego, M.},
booktitle = {Spanish Conference on AI},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Lect. Notes in Artificial Intelligence},
pages = {210--219},
pdf = {./TR/caepia07.pdf},
title = {A Logic for Order of Magnitude Reasoning with Negligibility, Non-Closeness and Distance},
url = {http://dx.doi.org/10.1007/978-3-540-75271-4_22},
volume = {4788},
year = 2007,
abstract = {This paper continues the research line on the multimodal logic of qualitative reasoning; specifically, it deals with the introduction of the notions non-closeness and distance. These concepts allow us to consider qualitative sum of medium and large numbers. We present a sound and complete axiomatization for this logic, together with some of its advantages by means of an example.},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-540-75271-4_22}
}

@inproceedings{eusflat07,
author = {Medina, J. and Ojeda-Aciego, M. and Ruiz-Calvi\~no, J.},
booktitle = {Intl Conference on Fuzzy Logic and Technology, vol. II},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {209--212},
title = {Concept lattices under non-commutative conjunctors are generalized concept lattices},
url = {http://www.eusflat.org/publications/proceedings/EUSFLAT_2007/papers/Ojeda-Aciego_Manuel_(121).pdf},
year = 2007,
abstract = {Generalized concept lattices have been recently proposed to deal with uncertainty or incomplete information as a non-symmetric generalization of the theory of fuzzy formal concept analysis. On the other hand, concept lattices have been defined as well in the framework of fuzzy logics with non- commutative conjunctors.

The contribution of this paper is to prove that any concept lattice for non-commutative fuzzy logic can be interpreted inside the framewok of generalized concept lattices, specifically, it is isomorphic to a sublattice of the cartesian product of two generalized concepts lattices.},
bdsk-url-1 = {http://www.eusflat.org/publications/proceedings/EUSFLAT_2007/papers/Ojeda-Aciego_Manuel_(121).pdf}
}

@article{jal05,
author = {Dam\'asio, C.V. and Medina, J. and Ojeda-Aciego, M.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Journal of Applied Logic},
number = {3},
pages = {435--458},
pdf = {./TR/jal-dmo.pdf},
title = {Termination of logic programs with imperfect information: applications and query procedure},
url = {http://dx.doi.org/10.1016/j.jal.2006.03.004},
volume = {5},
year = 2007,
abstract = {A general logic programming framework allowing for the combination of several adjoint lattices of truth-values is presented. The language is sorted, enabling the combination of several reasoning forms in the same knowledge base. The contribution of the paper is two-fold: on the one hand, sufficient conditions guaranteeing termination of all queries for the fix-point semantics for a wide class of sorted multi-adjoint logic programs are presented and related to some well-known probability-based formalisms; in addition, we specify a general non-deterministic tabulation goal-oriented query procedure for sorted multi-adjoint logic programs over complete lattices. We prove its soundness and completeness as well as independence of the selection ordering. We apply the termination results to probabilistic and fuzzy logic programming languages, enabling the use of the tabulation proof procedure for query answering.},
bdsk-url-1 = {http://dx.doi.org/10.1016/j.jal.2006.03.004}
}

@article{wilf07-mor,
author = {Medina, J. and Ojeda-Aciego, M. and Ruiz-Calvi\~no, J.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Lect. Notes in Artificial Intelligence},
pages = {37--44},
pdf = {./TR/wilf07-mor.pdf},
title = {A fixed-point theorem for multi-valued functions with application to multilattice-based logic programming},
url = {http://dx.doi.org/10.1007/978-3-540-73400-0_5},
volume = 4578,
year = 2007,
abstract = {This paper presents a computability theorem for fixed points of multi-valued functions defined on multilattices, which is later used in order to obtain conditions which ensure that the immediate consequence operator computes minimal models of multilattice-based logic programs in at most ? iterations.},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-540-73400-0_5}
}

@article{icfca-mor,
author = {Medina, J. and Ojeda-Aciego, M. and Ruiz-Calvi\~no, J.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Lect. Notes in Computer Science},
pages = {197--209},
pdf = {./TR/icfca-mor.pdf},
title = {On multi-adjoint concept lattices: definition and representation theorem},
url = {http://dx.doi.org/10.1007/978-3-540-70901-5_13},
volume = 4390,
year = 2007,
abstract = {Several fuzzifications of formal concept analysis have been proposed to deal with uncertainty or incomplete information. In this paper, we focus on the new paradigm of multi-adjoint concept lattices which embeds different fuzzy extensions of concept lattices, our main result being the representation theorem of this paradigm. As a consequence of this theorem, the representation theorems of the other paradigms can be proved more directly. Moreover, the multi-adjoint paradigm enriches the language providing greater flexibility to the user.},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-540-70901-5_13}
}

@article{fss-mor,
author = {Medina, J. and Ojeda-Aciego, M. and Ruiz-Calvi\~no, J.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Fuzzy Sets and Systems},
number = 6,
pages = {674--688},
pdf = {./TR/fss-mor.pdf},
title = {Fuzzy Logic Programming via Multilattices},
url = {http://dx.doi.org/10.1016/j.fss.2006.11.006},
volume = 158,
year = 2007,
abstract = {We investigate the use of multilattices as the set of truth-values underlying a general fuzzy logic programming framework. On the one hand, some theoretical results about ideals of a multilattice are presented in order to provide an ideal-based semantics; on the other hand, a restricted semantics, in which interpretations assign elements of a multilattice to each propositional symbol, is presented and analysed.},
bdsk-url-1 = {http://dx.doi.org/10.1016/j.fss.2006.11.006}
}

@article{tarski,
author = {Burrieza, A. and Ojeda-Aciego, M. and Or{\l}owska, E.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Lect. Notes in Computer Science},
pages = {105--124},
pdf = {./TR/tarski.pdf},
title = {Relational Approach to Order of Magnitude reasoning},
url = {http://dx.doi.org/10.1007/11964810_6},
volume = {4342},
year = 2006,
bdsk-url-1 = {http://dx.doi.org/10.1007/11964810_6}
}

@inproceedings{estylf06-mor,
author = {Medina, J. and Ojeda-Aciego, M. and Ruiz-Calvi\~no, J.},
booktitle = {13th Spanish Congress on Fuzzy Logic and Technology},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {147--152},
pdf = {./TR/estylf06-mor.pdf},
title = {Multi-adjoint concept lattices from a non-commutative perspective},
year = 2006
}

@inproceedings{fuzz-ieee06,
author = {Dam{\'a}sio, C. and Medina, J. and Ojeda-Aciego, M.},
booktitle = {Proc. IEEE Congress on Computational Intelligence (section Fuzzy Systems)},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {9576--9583},
pdf = {./TR/fuzz-ieee06.pdf},
title = {A tabulation procedure for first-order residuated logic programs: soundness, completeness and optimisations},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1681978},
year = 2006,
bdsk-url-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1681978}
}

@inproceedings{ipmu06-ss,
author = {Medina, J. and Ojeda-Aciego, M. and Ruiz-Calvi\~no, J.},
booktitle = {Information Processing and Management of Uncertainty, IPMU'06},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {463--470},
pdf = {./TR/ipmu2006-ss.pdf},
title = {On the ideal semantics of multilattice-based logic programs},
year = 2006
}

@inproceedings{ipmu06-tabling,
author = {Dam{\'a}sio, C. and Medina, J. and Ojeda-Aciego, M.},
booktitle = {Information Processing and Management of Uncertainty, IPMU'06},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {225--232},
pdf = {./TR/ipmu2006-tab.pdf},
title = {A tabulation procedure for first-order residuated logic programs},
year = 2006
}

@inproceedings{cmpi06,
author = {Medina, J. and Ojeda-Aciego, M. and Ruiz-Calvi\~no, J.},
booktitle = {Campus Multidisciplinar de Percepci{\'o}n e Inteligencia},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {751--762},
pdf = {./TR/cmpi06.pdf},
title = {Ret{\'\i}culos de conceptos multi-adjuntos},
year = 2006
}

@article{caepia05-lmq,
author = {Burrieza, A. and Mu{\~n}oz, E. and Ojeda-Aciego, M.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Lect. Notes in Artificial Intelligence},
pages = {370--378},
pdf = {./TR/caepia-bmo.pdf},
title = {Order of magnitude qualitative reasoning with bidirectional negligibility},
url = {http://dx.doi.org/10.1007/11881216_39},
volume = 4177,
year = 2006,
bdsk-url-1 = {http://dx.doi.org/10.1007/11881216_39}
}

@article{wilf05,
author = {Medina, J. and Ojeda-Aciego, M. and Ruiz-Calvi\~no, J.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Lect. Notes in Artificial Intelligence},
pages = {61--70},
pdf = {./TR/mor-wilf-cedi.pdf},
title = {Multi-lattices as a basis for generalized fuzzy logic programming},
url = {http://dx.doi.org/10.1007/11676935_8},
volume = 3849,
year = 2006,
bdsk-url-1 = {http://dx.doi.org/10.1007/11676935_8}
}

@article{msc-mmo,
author = {Medina, J. and M\'erida-Casermeiro, E. and Ojeda-Aciego, M.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Mathware \& Soft Computing},
pages = {199--216},
pdf = {./TR/msc-mmo.pdf},
title = {A neural implementation of multi-adjoint logic programs via sf-homogeneous programs},
url = {http://ic.ugr.es/Mathware/index.php/Mathware/article/viewFile/82/65},
volume = {XII},
year = 2005,
bdsk-url-1 = {http://ic.ugr.es/Mathware/index.php/Mathware/article/viewFile/82/65}
}

@inproceedings{epia-lmq,
author = {Burrieza, A. and Ojeda-Aciego, M.},
booktitle = {EPIA'05},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {33--37},
pdf = {./TR/epia-lmq-ieee.pdf},
publisher = {IEEE Press},
title = {On the modal logic of order-of-magnitude qualitative reasoning: a tableau calculus},
url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4145918},
year = 2005,
bdsk-url-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4145918}
}

@inproceedings{cedi,
author = {Medina, J. and Ojeda-Aciego, M. and Ruiz, J.},
booktitle = {Proc of L{\'o}gica Fuzzy \& Soft Computing},
date-modified = {2007-07-07 09:32:03 +0200},
pages = {19--26},
publisher = {Thomson},
title = {Fuzzy logic programming via multilattices: first results and prospects},
year = {2005}
}

@article{fi-bo,
author = {Burrieza, A. and Ojeda-Aciego, M.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Fundamenta Informaticae},
pages = {21--46},
pdf = {./TR/fi-bo.pdf},
title = {A multimodal logic approach to order of magnitude qualitative reasoning with comparability and negligibility relations},
url = {http://iospress.metapress.com/openurl.asp?genre=article&issn=0169-2968&volume=68&issue=1&spage=21},
volume = {68},
year = 2005,
bdsk-url-1 = {http://iospress.metapress.com/openurl.asp?genre=article&issn=0169-2968&volume=68&issue=1&spage=21}
}

@article{iwinac05,
author = {Medina, J. and M\'erida-Casermeiro, E. and Ojeda-Aciego, M.},
booktitle = {Proc. Intl. Conf. on the Interplay between Natural and Artificial Computation},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Lect. Notes in Computer Science},
pages = {521--530},
pdf = {./TR/iwinac.pdf},
title = {Interval-valued neural multi-adjoint logic programs},
url = {http://dx.doi.org/10.1007/11499220_53},
volume = {3561},
year = 2005,
bdsk-url-1 = {http://dx.doi.org/10.1007/11499220_53}
}

@article{iberamia04,
author = {Medina, J. and M\'erida-Casermeiro, E. and Ojeda-Aciego, M.},
booktitle = {Ibero-American Conference on Artificial Intelligence},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Lect. Notes in Artificial Intelligence},
pages = {717--726},
pdf = {./TR/sums.pdf},
title = {Decomposing Ordinal Sums in Neural Multi-Adjoint Logic Programs},
url = {http://dx.doi.org/10.1007/b102591},
volume = {3315},
year = 2004,
bdsk-url-1 = {http://dx.doi.org/10.1007/b102591}
}

@article{jelia04-sys,
author = {Ojeda-Aciego, M. and Valverde, A.},
booktitle = {Logics in Artificial Intelligence, JELIA'04},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Lect. Notes in Artificial Intelligence},
organization = {Lect. Notes in Artificial Intelligence 3229},
pages = {731--735},
pdf = {./TR/tascpl.pdf},
title = {tascpl: {TAS} solver for {C}lassical {P}ropositional {L}ogic},
volume = {3229},
year = 2004
}

@article{jelia04,
author = {Dam\'asio, C.V. and Medina, J. and Ojeda-Aciego, M.},
booktitle = {Logics in Artificial Intelligence, JELIA'04},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Lect. Notes in Artificial Intelligence},
pages = {260--273},
pdf = {./TR/jelia04.pdf},
title = {Sorted multi-adjoint logic programs: termination results and applications},
volume = {3229},
year = 2004
}

@inproceedings{ecai04,
author = {Dam\'asio, C.V. and Medina, J. and Ojeda-Aciego, M.},
booktitle = {European Conference on Artificial Intelligence},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {808--812},
pdf = {./TR/ecai04.pdf},
series = {Frontiers in Artificial Intelligence and Applications},
title = {A tabulation proof procedure for residuated logic programming},
volume = 110,
year = 2004
}

@inproceedings{estylf04-dmo,
author = {Dam\'asio, C.V. and Medina, J. and Ojeda-Aciego, M.},
booktitle = {12th Spanish Congress on Fuzzy Logic and Technology},
date-modified = {2009-01-20 16:15:50 +0100},
pdf = {./TR/estylf04-dmo.pdf},
title = {A termination theorem for sorted multi-adjoint logic programming},
year = 2004
}

@inproceedings{estylf04-mo,
author = {Medina, J. and Ojeda-Aciego, M.},
booktitle = {12th Spanish Congress on Fuzzy Logic and Technology},
date-modified = {2009-01-20 16:15:50 +0100},
pdf = {./TR/estylf04-mo.pdf},
title = {Extended homogenization for multi-adjoint logic programs},
year = 2004
}

@article{mmo-jal,
author = {Medina, J. and M\'erida-Casermeiro, E. and Ojeda-Aciego, M.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Journal of Applied Logic},
pages = {301--324},
pdf = {./TR/jal-mmo.pdf},
title = {A Neural Implementation of Multi-Adjoint Logic Programming},
url = {http://dx.doi.org/10.1016/j.jal.2004.03.006},
volume = {2/3},
year = 2004,
bdsk-url-1 = {http://dx.doi.org/10.1016/j.jal.2004.03.006}
}

@inproceedings{ipmu04-ss,
author = {Medina, J. and Ojeda-Aciego, M.},
booktitle = {Information Processing and Management of Uncertainty, IPMU'04},
date-modified = {2009-01-20 16:15:50 +0100},
note = {Invited talk of special session on Logic Programming with Imperfect Information},
pages = {823-828},
pdf = {./TR/ipmu2004-ss.pdf},
year = 2004
}

@inproceedings{ipmu04-dmo,
author = {Dam\'asio, C.V. and Medina, J. and Ojeda-Aciego, M.},
booktitle = {Information Processing and Management of Uncertainty, IPMU'04},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {1879-1886},
pdf = {./TR/ipmu2004-dmo.pdf},
title = {Termination Results for Sorted Multi-Adjoint Logic Programs},
year = 2004
}

@article{gaceta,
author = {Ojeda-Aciego, M.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {La Gaceta de la R.S.M.E.},
number = {1},
pages = {93--119},
pdf = {./TR/gaceta.pdf},
title = {L\'ogica, Matem\'atica, Deducci\'on Autom\'atica},
volume = {8},
year = 2005
}

@article{eusflat-fss,
author = {Medina, J. and Ojeda-Aciego, M. and Vojt\'a{\v s}, P.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Fuzzy Sets and Systems},
number = {1},
pages = {43--62},
pdf = {./TR/fss-eusflat.pdf},
title = {Similarity-based unification: a multi-adjoint approach},
url = {http://dx.doi.org/10.1016/j.fss.2003.11.005},
volume = {146},
year = 2004,
bdsk-url-1 = {http://dx.doi.org/10.1016/j.fss.2003.11.005}
}

@article{powerset-fss,
author = {Eklund, P. and Gal\'an, M.A. and Medina, J. and Ojeda-Aciego, M. and Valverde, A.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Fuzzy Sets and Systems},
number = 1,
pages = {213--225},
pdf = {./TR/fss-powerset.pdf},
title = {Similarities between powersets of terms},
url = {http://dx.doi.org/10.1016/j.fss.2003.10.021},
volume = 144,
year = 2004,
bdsk-url-1 = {http://dx.doi.org/10.1016/j.fss.2003.10.021}
}

@article{ercim,
author = {Ojeda-Aciego, M.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {La Gaceta de la R.S.M.E.},
number = 1,
pages = {37--52},
pdf = {./TR/ercim.pdf},
title = {Espa\~na entra a formar parte de {ERCIM}},
volume = 7,
year = 2004
}

@article{kybernetika,
author = {Ojeda-Aciego, M. and Vojt{\'a}{\v s}, P. and Zadro{\.z}ny, S.},
journal = {Kybernetika},
number = {5},
pages = {509--510},
title = {Guest editorial},
volume = {39},
year = 2003
}

@article{caepia-lmq,
author = {Burrieza, A. and Ojeda-Aciego, M.},
booktitle = {Spanish Conference on Artificial Intelligence},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Lect. Notes in Artificial Intelligence},
pages = {66--75},
pdf = {./TR/caepia-LQR.pdf},
title = {A multimodal logic approach to order of magnitude qualitative reasoning},
volume = {3040},
year = 2003
}

@inproceedings{caepia-bires,
author = {Medina, J. and Ojeda-Aciego, M. and Vojt{\'a}{\v s}, P.},
booktitle = {Spanish Conference on Artificial Intelligence},
date-modified = {2009-01-23 13:08:41 +0100},
organization = {Lect. Notes in Artificial Intelligence 3040},
pages = {608--617},
pdf = {./TR/caepia-bires.pdf},
title = {Towards biresiduated multi-adjoint logic programming},
year = 2003
}

@inproceedings{eusflat03,
author = {Medina, J. and Ojeda-Aciego, M.},
booktitle = {Intl Conference on Fuzzy Logic and Technology},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {640--644},
pdf = {./TR/eusflat03.pdf},
title = {Homogenizing multi-adjoint logic programs},
url = {http://www.eusflat.org/publications/proceedings/EUSFLAT_2003/papers/09Medina.pdf},
year = 2003,
bdsk-url-1 = {http://www.eusflat.org/publications/proceedings/EUSFLAT_2003/papers/09Medina.pdf}
}

@inproceedings{wst03,
author = {Dam\'asio, C.V. and Ojeda-Aciego, M.},
booktitle = {6th Intl Workshop on Termination, WST'03},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {40--43},
pdf = {./TR/wst.pdf},
title = {On termination of a tabulation procedure for residuated logic programming},
year = 2003
}

@incollection{bo03,
author = {Burrieza, A. and Ojeda-Aciego, M.},
booktitle = {Tecnociencia y Cultura a comienzos del siglo \textsc{xxi}},
date-modified = {2007-07-07 09:31:58 +0200},
editor = {Di\'eguez, A.},
pages = {161--177},
publisher = {Servicio de Publicaciones de la Universidad de M\'alaga},
title = {La incidencia de las Ciencias Formales en Computaci\'on},
year = 2004
}

@inproceedings{eann03,
author = {Medina, J. and M\'erida-Casermeiro, E. and Ojeda-Aciego, M.},
booktitle = {8th Conf. Engineering Applications of Neural Networks, EANN'03},
date-modified = {2009-01-20 16:15:50 +0100},
pdf = {./TR/eann2003.pdf},
title = {A Neural Approach to Diagnosis based on Extended Logic Programming},
year = 2003
}

@inproceedings{iwann03,
author = {Medina, J. and M\'erida-Casermeiro, E. and Ojeda-Aciego, M.},
booktitle = {7th Intl Work Conference on Artificial and Natural Neural Networks, IWANN'03},
date-modified = {2009-01-20 16:15:50 +0100},
organization = {Lect. Notes in Computer Science 2686},
pages = {654--661},
pdf = {./TR/iwann2003.pdf},
title = {A neural approach to extended logic programs},
year = 2003
}

@article{camwa,
author = {Eklund, P. and Gal\'an, M.A. and Medina, J. and Ojeda-Aciego, M. and Valverde, A.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Computers and Mathematics with Applications},
pages = {693--705},
pdf = {http://www.satd.uma.es/matap/investig/tr/MA-00-01.pdf},
title = {Set functors, {$L$}-fuzzy set categories and generalized terms},
volume = 43,
year = 2002,
}

@article{sl,
author = {Ojeda-Aciego, M. and de~Guzm\'an, I. P. and Brewka, G. and Pereira, L.M.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Studia Logica},
pages = {3--5},
title = {Preface to the special issue on Logics in Artificial Intelligence"},
url = {http://dx.doi.org/10.1023/A:1020530109551},
volume = 72,
year = 2002,
bdsk-url-1 = {http://dx.doi.org/10.1023/A:1020530109551}
}

@article{tas-sl,
author = {Guti\'errez, G. and de~Guzm\'an, I. P. and Mart{\'\i}nez, J. and Ojeda-Aciego, M. and Valverde, A.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Studia Logica},
pages = {33--60},
pdf = {./TR/TAS-studia.pdf},
title = {Satisfiability testing for {B}oolean formulas using {$\Delta$}-trees},
url = {http://dx.doi.org/10.1023/A:1020530109551},
volume = 72,
year = 2002,
bdsk-url-1 = {http://dx.doi.org/10.1023/A:1020530109551}
}

@inproceedings{jelia02,
author = {Kraj{\v ci}, S. and Lencses, R. and Medina, J. and Ojeda-Aciego, M. and Valverde, A. and Vojt\'a{\v s}, P.},
booktitle = {Logics in Artificial Intelligence, JELIA'02},
date-modified = {2009-01-20 16:15:50 +0100},
organization = {Lect. Notes in Artificial Intelligence 2424},
pages = {149--160},
pdf = {./TR/klmovv.pdf},
title = {Non-commutativity and expressive deductive logic databases},
year = 2002
}

@inproceedings{fqas,
author = {Kraj{\v ci}, S. and Lencses, R. and Medina, J. and Ojeda-Aciego, M. and Vojt{\'a}{\v s}, P.},
booktitle = {Flexible querying and answering systems, FQAS'02},
date-modified = {2009-01-23 13:07:41 +0100},
organization = {Lect. Notes in Artificial Intelligence 2522},
pages = {263--273},
pdf = {./TR/fqas.pdf},
title = {A similarity-based unification model for flexible querying},
year = 2002
}

@inproceedings{mmo-aimsa,
author = {Medina, J. and M{\'e}rida-Casermeiro, E. and Ojeda-Aciego, M.},
booktitle = {AI - Methodologies, Systems, Applications. AIMSA'02},
date-modified = {2009-01-20 16:15:50 +0100},
note = {213--222},
organization = {Lect. Notes in Computer Science~2443},
pdf = {./TR/aimsa-nn.pdf},
title = {A neural approach to abductive multi-adjoint reasoning},
year = 2002
}

@inproceedings{tas-mvl-aimsa,
author = {de Guzm\'an, I.P. and Ojeda-Aciego, M. and Valverde, A.},
booktitle = {AI - Methodologies, Systems, Applications. AIMSA'02},
date-modified = {2009-01-20 16:15:50 +0100},
organization = {Lect. Notes in Computer Science~2443},
pages = {223--232},
pdf = {./TR/tas0.pdf},
title = {Restricted {$\Delta$}-trees in Multiple-Valued Logics},
year = 2002
}

@inproceedings{tas-ib,
author = {de Guzm\'an, I.P. and Ojeda-Aciego, M. and Valverde, A.},
booktitle = {Advances in Artificial Intelligence, IBERAMIA'02},
date-modified = {2009-01-20 16:15:50 +0100},
organization = {Lect. Notes in Artificial Intelligence 2527},
pages = {161--171},
pdf = {./TR/agv-ib02.pdf},
title = {Restricted {$\Delta$}-trees and Reduction Theorems in Multiple-Valued Logics},
year = 2002
}

@inproceedings{ipmu-es,
author = {Medina, J. and Ojeda-Aciego, M.},
booktitle = {9th Information Processing and Management of Uncertainty in Knowledge-Based Systems Conference, IPMU 2002},
date-modified = {2009-01-20 16:15:50 +0100},
pdf = {./TR/ipmu2002-completitud.pdf},
title = {A new approach to completeness for multi-adjoint logic programming},
year = 2002
}

@inproceedings{ipmu-se,
author = {Eklund, P. and Gal\'an, M.A. and Medina, J. and Aciego, M. Ojeda and Valverde, A.},
booktitle = {9th Information Processing and Management of Uncertainty in Knowledge-Based Systems Conference, IPMU 2002},
date-modified = {2009-01-20 16:15:50 +0100},
title = {A framework for unification using powersets of terms},
year = 2002
}

@inproceedings{mmo-iclp,
author = {Medina, J. and M{\'e}rida-Casermeiro, E. and Ojeda-Aciego, M.},
booktitle = {Logic Programming. ICLP'02},
date-modified = {2009-01-20 16:15:50 +0100},
organization = {Lect. Notes in Computer Science~2401},
pages = {468},
pdf = {./TR/ICLP02#17.pdf},
title = {Multi-Adjoint Logic Programming: a Neural Net Approach},
year = 2002
}

@proceedings{EklundOjeda2002,
date-modified = {2009-01-20 16:15:50 +0100},
editor = {Eklund, P. and Ojeda-Aciego, M..},
organization = {Electronic Notes in Theoretical Computer Science},
title = {Preface to the special issue Unification in non-classical logics"},
url = {http://dx.doi.org/10.1016/S1571-0661(05)80517-1},
volume = {66.5},
year = 2002,
bdsk-url-1 = {http://dx.doi.org/10.1016/S1571-0661(05)80517-1}
}

@inproceedings{uncl-se,
author = {Eklund, P. and Gal\'an, M.A. and Ojeda-Aciego, J. Medina M.. and Valverde, A.},
booktitle = {Unification in non-classical logics},
date-modified = {2009-01-20 16:15:50 +0100},
organization = {Electronic Notes in Theoretical Computer Science},
title = {A categorical approach to unification of generalized terms},
url = {http://dx.doi.org/10.1016/S1571-0661(04)80513-9},
volume = {66.5},
year = 2002,
bdsk-url-1 = {http://dx.doi.org/10.1016/S1571-0661(04)80513-9}
}

@inproceedings{uncl-sk,
author = {Medina, J. and Ojeda-Aciego, M.. and Vojt\'a{\v s}, P.},
booktitle = {Unification in non-classical logics},
date-modified = {2009-01-20 16:15:50 +0100},
organization = {Electronic Notes in Theoretical Computer Science},
url = {http://dx.doi.org/10.1016/S1571-0661(04)80515-2},
volume = {66.5},
year = 2002,
bdsk-url-1 = {http://dx.doi.org/10.1016/S1571-0661(04)80515-2}
}

@inproceedings{estylf-foma,
author = {Medina, J. and Ojeda-Aciego, M..},
booktitle = {11th Spanish Congress on Fuzzy Logic and Technology},
date-modified = {2007-07-07 09:31:58 +0200},
title = {On first-order multi-adjoint logic programming},
year = 2002
}

@inproceedings{estylf-abd,
author = {Medina, J. and M\'erida-Casermeiro, E. and Ojeda-Aciego, M.},
booktitle = {11th Spanish Congress on Fuzzy Logic and Technology},
date-modified = {2007-07-07 09:31:58 +0200},
title = {Multi-adjoint abduction via neural nets},
year = 2002
}

@inproceedings{eusflat,
author = {Medina, J. and Ojeda-Aciego, M. and Vojt\'a{\v s}, P.},
booktitle = {Intl Conference on Fuzzy Logic and Technology},
date-modified = {2007-07-07 09:31:58 +0200},
title = {Similarity-based unification},
year = 2001
}

@article{tas-tcs,
author = {Aguilera, G. and P. de Guzm\'an, I. and Ojeda-Aciego, M. and Valverde, A.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Theoretical Computer Science},
number = {1/2},
pages = {81--112},
pdf = {./TR/tas-tcs.pdf},
title = {Reductions for non-clausal theorem proving},
url = {http://dx.doi.org/10.1016/S0304-3975(00)00044-X},
volume = 266,
year = 2001,
bdsk-url-1 = {http://dx.doi.org/10.1016/S0304-3975(00)00044-X}
}

@inproceedings{epia,
author = {Medina, J. and Ojeda-Aciego, M. and Vojt{\'a}{\v s}, P.},
booktitle = {Progress in Artificial Intelligence, EPIA'01},
date-modified = {2009-01-20 16:15:50 +0100},
organization = {Lect. Notes in Artificial Intelligence 2258},
pages = {290--297},
pdf = {./TR/EPIA-mov-c.pdf},
title = {A procedural semantics for multi-adjoint logic programming},
year = 2001
}

@inproceedings{iclp01,
author = {Medina, J. and Ojeda-Aciego, M. and Vojt{\'a}{\v s}, P.},
booktitle = {Logic Programming, ICLP'01},
date-modified = {2009-01-20 16:15:50 +0100},
organization = {Lect. Notes in Computer Science 2237},
pages = {269--283},
pdf = {./TR/mov-iclp-c.pdf},
title = {A Multi-Adjoint Logic Approach to Abductive Reasoning},
year = 2001
}

@article{lpnmr01,
author = {Medina, J. and Ojeda-Aciego, M. and Vojt{\'a}{\v s}, P.},
journal = {Lect. Notes in Artificial Intelligence},
pages = {351--364},
pdf = {./TR/mov-lpnmr-c.pdf},
title = {Multi-adjoint logic programming with continuous semantics},
volume = {2173},
year = 2001,
}

@inproceedings{ismvl,
author = {Eklund, P. and Gal\'an, M.A. and Medina, J. and Ojeda-Aciego, M.. and Valverde, A.},
booktitle = {Proc. 31st IEEE Intl. Symposium on Multiple-Valued Logic},
date-modified = {2007-07-07 09:31:58 +0200},
organization = {IEEE-CS},
pages = {367--372},
year = 2001
}

@inproceedings{fla,
author = {Eklund, P. and Gal\'an, M.A. and Medina, J. and Ojeda-Aciego, M.. and Valverde, A.},
booktitle = {2nd Intl {ICSC} Symposium on Fuzzy Logic and Applications},
date-modified = {2007-07-07 09:31:58 +0200},
title = {Set functors and {L}-fuzzy set categories: towards a fuzzy programming paradigm},
year = 2001
}

@inproceedings{fuzzieee,
author = {Medina, J. and Ojeda-Aciego, M. and Vojt{\'a}{\v s}, P.},
booktitle = {Proc. FUZZ-IEEE'01},
date-modified = {2009-01-23 13:07:58 +0100},
organization = {The 10th IEEE International Conference on Fuzzy Systems},
pdf = {./TR/med-oje-voj.pdf},
publisher = {IEEE Press},
title = {A completeness theorem for multi-adjoint logic programming},
year = 2001
}

@inproceedings{aciic:01,
author = {Merino, S. and Ojeda-Aciego, M.},
booktitle = {Primeras Jornadas sobre Avances Cient{\'\i}ficos en Ingenier{\'\i}a Industrial y Civil},
date-modified = {2007-07-07 09:31:58 +0200},
title = {Automatizaci\'on del dise\~no de torres},
year = 2001
}

@book{jelia-book,
editor = {Ojeda-Aciego, M. and P. de Guzm\'an, I. and Brewka, G. and Pereira, L.M.},
publisher = {Springer-Verlag},
series = {Lecture Notes in Artificial Intelligence},
title = {Logics in Artificial Intelligence},
volume = {1919},
year = 2000
}

@inproceedings{tas-jelia2000,
author = {Guti\'errez, G. and de~Guzm\'an, I. P. and Mart{\'\i}nez, J. and and M. Ojeda-Aciego and Valverde, A.},
booktitle = {Proc. of JELIA 2000},
date-modified = {2007-07-07 09:31:58 +0200},
pages = {179--192},
publisher = {Lect. Notes in Artif. Intelligence 1919},
title = {Reduction theorems for {B}oolean formulas using {$\Delta$}-trees},
year = 2000
}

@inproceedings{ipmu,
author = {Eklund, P. and Gal\'an, M. A. and Ojeda-Aciego, M. and Valverde, A.},
booktitle = {Proc. of IPMU 2000},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {1595-1599},
pdf = {./TR/ipmu.pdf},
series = {Information Processing and Management of Uncertainty in Knowledge-based Systems},
title = {Set functors and generalised terms},
volume = {III},
year = 2000
}

@inproceedings{linz,
author = {Eklund, P. and Gal\'an, M. A. and Ojeda-Aciego, M. and Valverde, A.},
booktitle = {21st Linz Seminar on Fuzzy Set Theory},
date-modified = {2007-07-07 09:31:58 +0200},
title = {Monad composition and generalised terms},
year = 2000
}

@inproceedings{estylf,
author = {Eklund, P. and Gal\'an, M. A. and Medina, J. and Ojeda-Aciego, M. and Valverde, A.},
booktitle = {Proc. of ESTYLF 2000, Spanish Congress on Fuzzy Logic and Technology},
date-modified = {2007-07-07 09:31:58 +0200},
pages = {155-160},
title = {Generalised terms and composition of monads},
year = 2000
}

@inproceedings{mfcsit,
author = {Eklund, P. and \'Angeles Gal\'an, M. and Medina, J. and Ojeda Aciego, M. and Valverde, A.},
booktitle = {Proceedings of MFCSIT 2000, Mathematical Foundations of Computer Science and Information Technology},
date-modified = {2009-01-20 16:15:50 +0100},
title = {A graphical approach to monad compositions},
url = {http://www.elsevier.nl/locate/entcs/volume40.html},
year = 2000,
bdsk-url-1 = {http://www.elsevier.nl/locate/entcs/volume40.html}
}

@inproceedings{salamanca,
author = {Aguilera, G. and de Guzm\'an, I. P. and Ojeda Aciego, M. and Valverde, A.},
booktitle = {1st Intl Congress on Tools for Teaching Logic},
date-modified = {2007-07-07 09:31:58 +0200},
title = {Master theses for providing feedback to the Logic Classroom},
year = 2000
}

@inproceedings{alhambra,
author = {Aguilera, G. and de Medina, J. and Ojeda Aciego, M. and Valverde, A.},
booktitle = {1st Joint Mathematical European-Arabic Conference},
date-modified = {2007-07-07 09:31:58 +0200},
title = {Generalized branching rules for negation normal forms},
year = 2000
}

@inproceedings{csi,
author = {Guti\'errez, G. and de~Guzm\'an, I. P. and Mart{\'\i}nez, J. and Ojeda-Aciego, M. and Valverde, A.},
booktitle = {Proc. of CSI 2000},
date-modified = {2009-01-20 16:15:50 +0100},
pdf = {./TR/CI&S-final.pdf},
title = {Representing {B}oolean formulas by using trees of implicants and implicates},
year = 2000
}

@article{soft,
author = {de~Guzm\'an, I. P. and Ojeda-Aciego, M. and Valverde, A.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Soft Computing},
number = 4,
pages = {157--166},
pdf = {./TR/TAS-M-SoftComp.pdf},
title = {Reducing signed propositional formulas},
volume = 2,
year = 1999
}

@article{amai,
author = {de~Guzm\'an, I. P. and Ojeda-Aciego, M. and Valverde, A.},
date-modified = {2009-01-20 16:15:50 +0100},
journal = {Annals of Mathematics and Artificial Intelligence},
pages = {2-23},
pdf = {./TR/TAS-amai.pdf},
title = {Implicates and reduction techniques for temporal logics},
volume = 27,
year = 1999
}

@inproceedings{lasvegas,
author = {de~Guzm\'an, I. P. and Ojeda-Aciego, M. and Valverde, A.},
booktitle = {Proc. of the Intl.~Conf.~on Artificial Intelligence, ICAI'99},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {177--183},
pdf = {./TR/ic-ai'99.pdf},
publisher = {C.S.R.E.A.},
title = {Multiple-valued tableaux with {$\Delta$}-reductions},
year = 1999
}

@inproceedings{conied,
author = {C\'ardenas, S. and Ojeda-Aciego, M. and S\'anchez, S.},
booktitle = {Congreso Nacional de Inform\'atica Educativa},
date-modified = {2007-07-07 09:31:58 +0200},
title = {Construcciones geom\'etricas con ordenador},
year = 1999
}

@inproceedings{jaem,
author = {Ojeda-Aciego, M. and S\'anchez, S.},
booktitle = {Jornadas de Aprendizaje y Ense\~nanza de las Matem\'aticas},
date-modified = {2007-07-07 09:31:58 +0200},
title = {Una experiencia geom\'etrica para estudiantes de ingenier{\'\i}a},
year = 1999
}

@inproceedings{jelia98,
author = {de~Guzm\'an, I. P. and Ojeda-Aciego, M. and Valverde, A.},
booktitle = {Proc. of JELIA'98},
date-modified = {2009-01-20 16:15:50 +0100},
pages = {309--323},
pdf = {./TR/jelia'98.pdf},
publisher = {Lect. Notes in Artif. Intelligence 1489},
title = {Implicates and reduction techniques for temporal logics},
year = 1998
}

@article{mathware,
author = {Aguilera, G. and de~Guzm\'an, I. P. and Ojeda-Aciego, M.},
date-modified = {2007-07-07 09:31:58 +0200},
journal = {Mathware \& Soft Computing},
number = 2,
pages = {99-127},
title = {A new reduction-based theorem prover for 3-valued logic},
volume = 4,
year = 1997
}

@inproceedings{logic97,
author = {Aguilera, G. and de~Guzm\'an, I. P. and Ojeda-Aciego, M.},
booktitle = {Proceedings of Logic Colloquium'97},
date-modified = {2007-07-07 09:31:58 +0200},
title = {DP-distributions: a new efficiency strategy for the {TAS} reduction method},
year = 1997
}

@inproceedings{nagoya,
author = {Aguilera, G. and de~Guzm\'an, I. P. and Ojeda-Aciego, M.},
booktitle = {Proceedings of the IJCAI'97 workshop on Model-based Automated Reasoning},
date-modified = {2007-07-07 09:31:58 +0200},
title = {Model building in 3-valued logic using the {TAS} reduction paradigm},
year = 1997
}

@inproceedings{dagstuhl,
author = {Aguilera, G. and de~Guzm\'an, I. P. and Ojeda-Aciego, M.},
booktitle = {Dagstuhl seminar: multiple valued logic},
date-modified = {2007-07-07 09:31:58 +0200},
title = {The {TAS} reduction method in multiple-valud logics},
year = 1997
}

@book{libro-logica,
author = {Ojeda-Aciego, M. and P. de Guzm\'an, I.},
publisher = {\'Agora},
title = {L\'ogica para la Computaci\'on (II)},
year = 1997
}

@book{libro-inf2,
author = {Pareja, C. and Ojeda-Aciego, M. and Andeyro, \'A. and Rossi, C.},
publisher = {Ra-Ma},
title = {Desarrollo de algoritmos y t{\'e}cnicas de programaci{\'o}n en {PASCAL}},
year = 1997
}

@inproceedings{iberamia96,
author = {Ojeda-Aciego, M. and de~Guzm\'an, I. P. and Enciso., M.},
booktitle = {Proceedings of Iberamia'96},
date-modified = {2007-07-07 09:31:58 +0200},
title = {Theorem proving for temporal logic using the {TAS} paradigm},
year = 1996
}

@inproceedings{prode96,
author = {Enciso, M. and de~Guzm\'an, I. P. and Moncada, J. and Ojeda-Aciego, M.},
booktitle = {Proceedings of AGP'96},
date-modified = {2007-07-07 09:31:58 +0200},
title = {Executing intensional logic with the {TAS} tool},
year = 1996
}

@inproceedings{barcelona,
author = {Ojeda-Aciego, M.},
booktitle = {2nd Conference on Multiple-Valued Logics for Computer Science Applications},
date-modified = {2007-07-07 09:31:58 +0200},
title = {Formal methods for normalization in first-order logic using the {TAS} methodology},
year = 1996
}

@inproceedings{lc:96,
author = {de Guzm\'an, I.P. and Ojeda-Aciego, M.},
booktitle = {Logic Colloquium'96},
date-modified = {2007-07-07 09:31:58 +0200},
title = {{TAS} methods in first-order logic},
year = 1996
}

@inproceedings{fmcs,
author = {de Guzm\'an, I.P. and Ojeda-Aciego, M.},
booktitle = {Foundations of Mathematics and Computer Science},
date-modified = {2007-07-07 09:31:58 +0200},
title = {A new approach to the translation into normal form},
year = 1996
}

@article{acta,
author = {de~Guzm\'an, I. P. and Ojeda, M. and Valverde, A.},
date-modified = {2007-07-07 09:31:58 +0200},
journal = {Acta Informatica},
pages = {61--78},
title = {A formal identification between tuples and lists with an application to list-arithmetic categories},
volume = 32,
year = 1995
}

@article{tas-jancl,
author = {Aguilera, G. and de~Guzm\'an, I. P. and Ojeda-Aciego, M.},
date-modified = {2007-07-07 09:31:58 +0200},
journal = {Journal of Applied Non-Classical Logics},
number = 1,
pages = {9--29},
title = {Increasing the efficiency of Automated Theorem Proving},
volume = 5,
year = 1995
}

@inproceedings{bielefeld,
author = {Aguilera, G. and de~Guzm\'an, I. P. and Ojeda-Aciego, M.},
booktitle = {Proceedings of KI-15, Workshop on Computational Propositional Logic},
date-modified = {2007-07-07 09:31:58 +0200},
month = sep,
title = {A new general approach to {ATP}s},
year = 1995
}

@inproceedings{lyon,
author = {de~Guzm\'an, I. P. and Ojeda-Aciego, M.},
booktitle = {Proceedings of {COST} action 15: Many-valued Logics for Computer Science Applications},
date-modified = {2007-07-07 09:31:58 +0200},
month = {dic},
title = {The {GIMAC} project},
year = 1995
}

@inproceedings{cade,
author = {Aguilera, G. and de~Guzm\'an, I. P. and Ojeda-Aciego, M.},
booktitle = {CADE workshop on Automated Model Building},
date-modified = {2007-07-07 09:31:58 +0200},
month = jun,
pages = {4--10},
title = {Automated Model Building via Syntactic Trees Transformations},
year = 1994
}

@inproceedings{tas-tablas,
author = {Aguilera, G. and de~Guzm\'an, I. P. and Gal\'an, Jos\'e L. and Ojeda-Aciego, M.},
booktitle = {GULP-PRODE '94 Joint Conference on Declarative Programming},
date-modified = {2007-07-07 09:31:58 +0200},
month = sep,
title = {{TAS-D}$^{++}$ vs tablas sem\'anticas},
year = 1994
}

@inproceedings{iberamia,
author = {Aguilera, G. and de~Guzm\'an, I. P. and Gal\'an, Jos\'e L. and Ojeda-Aciego., M.},
booktitle = {Proceedings of Iberamia'94},
date-modified = {2007-07-07 09:31:58 +0200},
month = oct,
pages = {44--59},
title = {Using {TAS-D}$^{++}$ for inferences.},
year = 1994
}

@article{jelia,
author = {Aguilera, G. and de~Guzm\'an, I. P. and Ojeda-Aciego, M.},
date-modified = {2007-07-07 09:31:58 +0200},
journal = {Lect. Notes in Artif. Intelligence 838},
month = sep,
pages = {198--216},
title = {{TAS-D}$^{++}$ Syntactic Trees Transformations for Automated Theorem Proving},
year = 1994
}

@book{libro-inf,
author = {Pareja, C. and Ojeda-Aciego, M. and Andeyro, \'A.},
publisher = {Ed. Complutense},
title = {Introducci\'on a la Inform\'atica},
year = 1994
}

@book{libro-calculo,
author = {Ojeda-Aciego, M.},
publisher = {\'Agora},
title = {C\'alculo para la Computaci\'on (I)},
year = 1993
}

@inproceedings{tas-nc,
author = {Aguilera, G. and de~Guzm\'an, I. P. and Ojeda-Aciego, M.},
booktitle = {Programaci\'on Declarativa},
date-modified = {2007-07-07 09:31:58 +0200},
month = sep,
pages = {275--290},
title = {Un algoritmo eficiente y paralelo para la transformaci\'on a forma normal conjuntiva},
year = 1993
}

@inproceedings{prode91,
author = {Ojeda-Aciego, M. and Valverde, A.},
booktitle = {Programaci\'on Declarativa},
date-modified = {2007-07-07 09:31:58 +0200},
title = {La teor{\'\i}a de categor{\'\i}as en la programaci\'on declarativa},
year = 1991
}


This file was generated by bibtex2html 1.96.