References

  1. Lyublena Antova, Christoph Koch & Dan Olteanu (2009): 10^\voidb@x (10^\voidb@x 6LaTeX Error: Bad math environment delimiterSee the LaTeX manual or LaTeX Companion for explanation.Your command was ignored.Type I <command> <return> to replace it with another command,or <return> to continue without it.)LaTeX Error: Bad math environment delimiterSee the LaTeX manual or LaTeX Companion for explanation.Your command was ignored.Type I <command> <return> to replace it with another command,or <return> to continue without it. worlds and beyond: efficient representation and processing of incomplete information. VLDB J. 18(5), pp. 1021–1040, doi:10.1007/s00778-009-0149-y.
  2. Garrett Birkhoff (1967): Lattice Theory, 3rd edition. American Mathematical Society, Providence.
  3. Brian A. Davey & Hilary A. Priestley (2002): Introduction to Lattices and Order. Cambridge mathematical text books. Cambridge University Press, doi:10.1017/CBO9780511809088.
  4. Erich Grädel & Jouko A. Väänänen (2013): Dependence and Independence. Studia Logica 101(2), pp. 399–410, doi:10.1007/s11225-013-9479-2.
  5. Stephan Günnemann, Emmanuel Müller, Ines Färber & Thomas Seidl (2009): Detection of Orthogonal Concepts in Subspaces of High Dimensional Data. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM '09. ACM, New York, NY, USA, pp. 1317–1326, doi:10.1145/1645953.1646120.
  6. Dilian Gurov, Bjarte M. Østvold & Ina Schaefer (2011): A Hierarchical Variability Model for Software Product Lines. In: Leveraging Applications of Formal Methods, Verification, and Validation - International Workshops, SARS 2011 and MLSC 2011, Held Under the Auspices of ISoLA 2011 in Vienna, Austria, October 17-18, 2011. Revised Selected Papers, pp. 181–199, doi:10.1007/978-3-642-34781-8_15.
  7. Jean-Louis Lassez, V. L. Nguyen & Liz Sonenberg (1982): Fixed Point Theorems and Semantics: A Folk Tale. Information Processing Letters 14(3), pp. 112–116, doi:10.1016/0020-0190(82)90065-5.
  8. Yu-Ru Lin, Jimeng Sun, Paul Castro, Ravi Konuru, Hari Sundaram & Aisling Kelliher (2009): MetaFac: Community Discovery via Relational Hypergraph Factorization. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '09. ACM, New York, NY, USA, pp. 527–536, doi:10.1145/1557019.1557080.
  9. David Maier (1983): The Theory of Relational Databases. Computer Science Press. Accessible online at http://web.cecs.pdx.edu/~maier/TheoryBook/TRD.html..
  10. Dan Olteanu, Christoph Koch & Lyublena Antova (2008): World-set decompositions: Expressiveness and efficient algorithms. Theoretical Computer Science 403(2-3), pp. 265–284, doi:10.1016/j.tcs.2008.05.004.
  11. Dan Olteanu & Jakub Závodný (2015): Size Bounds for Factorised Representations of Query Results. ACM Trans. Database Syst. 40(1), pp. 2, doi:10.1145/2656335.
  12. Klaus Pohl, Günter Böckle & Frank van der Linden (2005): Software Product Line Engineering - Foundations, Principles, and Techniques. Springer, doi:10.1007/3-540-28901-1.
  13. Steffen Rendle (2013): Scaling Factorization Machines to Relational Data. PVLDB 6(5), pp. 337–348. Available at http://www.vldb.org/pvldb/vol6/p337-rendle.pdf.
  14. S. Roman (2008): Lattices and Ordered Sets. Springer. Available at https://books.google.com/books?id=NZN8aum26LgC.
  15. Ina Schaefer, Dilian Gurov & Siavash Soleimanifard (2010): Compositional Algorithmic Verification of Software Product Lines. In: Formal Methods for Components and Objects - 9th International Symposium, FMCO 2010, Graz, Austria, November 29 - December 1, 2010. Revised Papers, pp. 184–203, doi:10.1007/978-3-642-25271-6_10.
  16. Alfred Tarski (1955): A Lattice-Theoretical Fixpoint Theorem and Its Applications. Pacific journal of Mathematics 5(2), pp. 285–309, doi:10.2140/pjm.1955.5.285.
  17. Bruce W. Weide, Wayne D. Heym & Joseph E. Hollingsworth (1995): Reverse Engineering of Legacy Code Exposed. In: Proceedings of the 17th International Conference on Software Engineering, ICSE '95. ACM, New York, NY, USA, pp. 327–331, doi:10.1145/225014.225045.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org