Dedekind–MacNeille completion and Cartesian product of multi-adjoint lattices
From MaRDI portal
Publication:4903467
DOI10.1080/00207160.2012.689826zbMath1269.06003MaRDI 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
Cartesian product; fuzzy logic programming; multi-adjoint logic programming; declarative debugging; lattice completion; multi-adjoint lattice
Related Items
Multi-adjoint concept lattices with heterogeneous conjunctors and hedges., Beyond multi-adjoint logic programming
Uses Software
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