Ordered direct implicational basis of a finite closure system

@article{Adaricheva2012OrderedDI,
  title={Ordered direct implicational basis of a finite closure system},
  author={Kira V. Adaricheva and James B. Nation and Robert Rand},
  journal={Discrete Applied Mathematics},
  year={2012},
  volume={161},
  pages={707-723}
}
Closure system on a finite set is a unifying concept in logic programming, relational data bases and knowledge systems. It can also be presented in the terms of finite lattices, and the tools of economic description of a finite lattice have long existed in lattice theory. We present this approach by describing the so-called D-basis and introducing the concept of ordered direct basis of an implicational system. A direct basis of a closure operator, or an implicational system, is a set of… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 17 references

Free Lattices

  • R. Freese, J. Ježek, J. B. Nation
  • Mathematical Surveys and Monographs 42, Amer…
  • 1995
Highly Influential
6 Excerpts

A theory of finite closure spaces based on implications

  • M. Wild
  • Adv. Math. 108
  • 1994
Highly Influential
3 Excerpts

On bases of closure systems without dcycles

  • K. Adaricheva, J. B. Nation
  • 2011

Join-semidistributive lattices and convex geometries

  • K. V. Adaricheva, V. A. Gorbunov, V. I. Tumanov
  • Adv. Math. 173
  • 2003
2 Excerpts

Free lattices , volume 42 of Mathematical Surveys and Monographs

  • R. Freese, J. Jezek, J. B. Nation
  • J . Logic Programming
  • 1995

Similar Papers

Loading similar papers…