Similarity-based unification: A multi-adjoint approach

From MaRDI portal
Publication:1876499

DOI10.1016/j.fss.2003.11.005zbMath1073.68026OpenAlexW2102885020MaRDI QIDQ1876499

Jesús Medina, Manuel Ojeda Aciego, Peter Vojtáš

Publication date: 20 August 2004

Published in: Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.fss.2003.11.005




Related Items (53)

Similarity-Based Equality with Lazy EvaluationOn the use of thresholds in multi-adjoint concept latticesBeyond multi-adjoint logic programmingMeta-logic programming for a synonymy logicOn fuzzy unfolding: A multi-adjoint approachThresholded semantic framework for a fully integrated fuzzy logic languageMeasures of inclusion and entropy based on the \(\varphi\)-index of inclusionSeeking a safe and efficient similarity-based unfolding ruleFuzzy logic programs as hypergraphs. Termination resultsMulti-adjoint lattice logic and truth-stressing hedgesAlgebraic structure and characterization of adjoint triplesA logical characterization of multi-adjoint algebrasHeterogeneous formal context and its decomposition by heterogeneous fuzzy subsetsImmediate consequences operator on generalized quantifiersTabulation proof procedures for fuzzy linguistic logic programmingMulti-adjoint algebras versus non-commutative residuated structuresOn stability of fuzzy formal concepts over randomized one-sided formal contextFrom Fuzzy to Annotated Semantic Web LanguagesThe fuzzy logic programming language FASILL: design and implementationMulti-adjoint property-oriented and object-oriented concept latticesFunctional degrees of inclusion and similarity between \(L\)-fuzzy setsDedekind–MacNeille completion and Cartesian product of multi-adjoint latticesFuzzy data exchangeConstraint heterogeneous concept lattices and concept lattices with heterogeneous hedgesA Transformation-based implementation for CLP with qualification and proximityFinitary coalgebraic multisemilattices and multilattices.Optimizing Fuzzy Logic Programs by Unfolding, Aggregation and FoldingProximity-based unification theoryMulti-adjoint concept lattices with heterogeneous conjunctors and hedges.Multi-adjoint t-concept latticesRough sets based on Galois connectionsUnnamed ItemA sound and complete semantics for a similarity-based logic programming languageOn reductants in the framework of multi-adjoint logic programmingImplication operators generating pairs of weak negations and their algebraic structureMulti-adjoint lattices from adjoint triples with involutive negationExtending fuzzy logics with many hedgesEfficient Unfolding of Fuzzy Connectives for Multi-adjoint Logic ProgramsOn Fuzzy Generalizations of Concept LatticesSymbolic Unfolding of Multi-adjoint Logic ProgramsModeling Interpretive Steps in Fuzzy Logic ComputationsOn Coherence and Consistence in Fuzzy Answer Set Semantics for Residuated Logic ProgramsFuzzy linguistic logic programming and its applicationsAdjoint Triples and Residuated AggregatorsA Fuzzy Extension of Data ExchangeFormal concept analysis via multi-adjoint concept latticesAn improved reductant calculus using fuzzy partial evaluation techniquesA hybrid programming scheme combining fuzzy-logic and functional-logic resourcesApproximate well-founded semantics, query answering and generalized normal logic programs over latticesTwo formalisms of extended possibilistic logic programming with context-dependent fuzzy unificationRandomized Fuzzy Formal Contexts and Relevance of One-Sided ConceptsEfficient Reductants Calculi using Partial Evaluation Techniques with ThresholdingOn heterogeneous formal contexts


Uses Software


Cites Work




This page was built for publication: Similarity-based unification: A multi-adjoint approach