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

DOI10.1080/00207160.2012.689826MaRDI QIDQ4903467zbMATH OpenOpenAlexWikidataFDO

Authors

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

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

Recommendations

• The Macneille Completion of a Uniquely Complemented Lattice
• On the MacNeille Completion of Weakly Dicomplemented Lattices
• scientific article; zbMATH DE number 4052306
• Tensor products of contexts and complete lattices
• A generalization of the Dedekind-MacNeille completion
• Affine completions of distributive lattices
• A monadic approach to the McNeille completion of a lattice
• ON n-MIXED PRODÜCT OF PSEUDOCOMPLEMENTED DISTRIBUTIVE LATTICES
• scientific article; zbMATH DE number 19630
• Residuated operators and Dedekind-MacNeille completion

Cites work

• scientific article; zbMATH DE number 2085246 (Why is no real title available?)
• scientific article; zbMATH DE number 1884400 (Why is no real title available?)
• A coalgebraic approach to non-determinism: applications to multilattices
• A declarative semantics for CLP with qualification and proximity
• Boolean Algebras with Operators. Part I
• Bounded lattice expansions
• Dedekind-MacNeille completion of \(n\)-ordered sets
• Dual multi-adjoint concept lattices
• Duality for lattice-ordered algebras and for normal algebraizable logics
• Formal concept analysis via multi-adjoint concept lattices
• Fuzzy logic programming via multilattices
• Kripke models for linear logic
• MacNeille completions and canonical extensions
• On the Notions of Residuated-Based Coherence and Bilattice-Based Consistence
• Qualified logic programming with bivalued predicates
• Quantitative Logic Programming Revisited
• Similarity-based unification: A multi-adjoint approach

Cited in

(3)

• Multi-adjoint concept lattices with heterogeneous conjunctors and hedges.
• Multi-adjoint lattices from adjoint triples with involutive negation
• Beyond multi-adjoint logic programming

Describes a project that uses

Uses Software

• XPath

This page was built for publication: Dedekind–MacNeille completion and Cartesian product of multi-adjoint lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903467)