Relational lattices: from databases to universal algebra
DOI10.1016/J.JLAMP.2015.11.008zbMATH Open1372.68081OpenAlexW2265945562WikidataQ114851588 ScholiaQ114851588MaRDI QIDQ299191FDOQ299191
Tadeusz Litak, Szabolcs Mikulás, Jan Hidders
Publication date: 22 June 2016
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2015.11.008
Knowledge representation (68T30) Database theory (68P15) Logical aspects of lattices and related structures (03G10) Applications of universal algebra in computer science (08A70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Categorical logic and type theory
- A relational model of data for large shared data banks
- Supersolvable lattices
- Equivalences Among Relational Expressions with the Union and Difference Operators
- The decision problem for database dependencies
- Algebraization of quantifier logics, an introductory overview
- Logic in algebraic form. Three languages and theories
- Relational databases and Bell's theorem
- Fibrations and universal view updatability
- Varieties of Lattices
- Lenses, fibrations and universal translations
- The word problem for cancellation semigroups with zero
- The equational theory of CA3 is undecidable
- Equivalences among Relational Expressions
- Recursive Unsolvability of a problem of Thue
- Relational Lattices
- Fixed-Point Theory in the Varieties $\mathcal{D}_{n}$
- Equational Bases and Nonmodular Lattice Varieties
- Relational Lattices via Duality
- Database queries and constraints via lifting problems
- Toward a calculus of concepts
- Cylindric structures and dependencies in relational databases
- Polymorphic type inference for the relational algebra
- Relation algebras by games
- The relational model of data and cylindric algebras
Cited In (11)
- Relations as abstract datatypes: An institution to specify relations between algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relational Lattices
- LATTICES OF STRUCTURE MODELS AND DATABASE SCHEMES
- Embeddability into Relational Lattices Is Undecidable
- Relational Lattices via Duality
- Embeddability into relational lattices is undecidable
- Orbital concept lattices
- A new formalism for relational algebra
- The 11th IJCAR automated theorem proving system competition – CASC-J11
This page was built for publication: Relational lattices: from databases to universal algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299191)
