Closures in Binary Partial Algebras

Authors:
Guo-Qiang Zhang
Affiliations:
Department of Electrical Engineering and Computer Science, Case Western Reserve University, Cleveland, Ohio 44022, USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 12
Cited 0

Logic of domains

Logic of domains
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Domain theory

Handbook of logic in computer science (vol. 3)
Resolution proof systems: an algebraic theory

Resolution proof systems: an algebraic theory
The Kleene-Schützenberger theorem for formal power series in partially commuting variables

Information and Computation
Initial Algebra Semantics and Continuous Algebras

Journal of the ACM (JACM)
Algebraic Semantics of Imperative Programs

Algebraic Semantics of Imperative Programs
Logic for Applications

Logic for Applications
Automata and Computability

Automata and Computability
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Introduction to Algorithms

Introduction to Algorithms
The equational theory of regular words

Information and Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

Two procedures for computing closures in binary partial algebras (BPA) are introduced: a Fibonacci-style procedure for closures in associative BPAs, and a multistage procedure for closures in associative, commutative and idempotent BPAs. Ramifications in areas such as resolution theorem proving, graph-theoretic algorithms, formal languages and formal concept analysis are discussed. In particular, the multistage procedure, when applied to formal concept analysis, results in a new algorithm outperforming leading algorithms for computing concept sets.