Dedekind–MacNeille completion and Cartesian product of multi-adjoint lattices

DOI10.1080/00207160.2012.689826zbMath1269.06003OpenAlexW2086169736MaRDI QIDQ4903467

No author found.

Publication date: 22 January 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2012.689826

zbMATH Keywords

Cartesian productfuzzy logic programmingmulti-adjoint logic programmingdeclarative debugginglattice completionmulti-adjoint lattice

Mathematics Subject Classification ID

Complete lattices, completions (06B23) Logic programming (68N17)

Related Items

Beyond multi-adjoint logic programming ⋮ Multi-adjoint concept lattices with heterogeneous conjunctors and hedges.

Uses Software

• XPath

Cites Work

• Unnamed Item
• Unnamed Item
• A coalgebraic approach to non-determinism: applications to multilattices
• Fuzzy logic programming via multilattices
• Formal concept analysis via multi-adjoint concept lattices
• Duality for lattice-ordered algebras and for normal algebraizable logics
• Similarity-based unification: A multi-adjoint approach
• Dedekind-MacNeille completion of \(n\)-ordered sets
• Dual multi-adjoint concept lattices
• Qualified Logic Programming with Bivalued Predicates
• On the Notions of Residuated-Based Coherence and Bilattice-Based Consistence
• Kripke models for linear logic
• A declarative semantics for CLP with qualification and proximity
• Quantitative Logic Programming Revisited
• MacNeille completions and canonical extensions
• Boolean Algebras with Operators. Part I
• Bounded lattice expansions