Closures in Binary Partial Algebras

DOI10.1016/j.entcs.2009.11.023zbMath1344.08002OpenAlexW2097716146MaRDI QIDQ2994476

No author found.

Publication date: 1 August 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.11.023

zbMATH Keywords

algorithmspartial algebrasformal concept analysisresolution principleclosures

Mathematics Subject Classification ID

Knowledge representation (68T30) Partial algebras (08A55) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Cites Work

• Proceedings of the 19th conference on mathematical foundations of programming semantics (MFPS XIX), Montreal, Canada, March 19--22, 2003
• A completeness theorem for Kleene algebras and the algebra of regular events
• The equational theory of regular words
• Partial algebras-survey of a unifying approach towards a two-valued model theory for partial algebras
• The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
• Initial Algebra Semantics and Continuous Algebras
• Comparing performance of algorithms for generating concept lattices
• Continuous Lattices and Domains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Closures in Binary Partial Algebras