Boolean lattices of nested relations as a foundation for rule-based database languages

DOI10.1016/0169-023X(92)90033-8zbMATH Open0794.68042OpenAlexW1965304174MaRDI QIDQ4031367FDOQ4031367

Authors: Peter Sander 

Publication date: 1 April 1993

Published in: Data & Knowledge Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0169-023x(92)90033-8

Recommendations

• Negation in rule-based database languages: A survey
• Datalog extension for nested relations
• Bounded fixpoints for complex objects
• The living in a lattice rule language
• Rule-based languages

zbMATH Keywords

modularizationdeductive databasesnested relationsrule-based languagesdatabase languagesgeneralized partitioned normal form instances

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Database theory (68P15) Boolean algebras (Boolean rings) (06E99)

Cited In (2)

• Title not available (Why is that?)
• Nested Hoare Triples and Frame Rules for Higher-Order Store

This page was built for publication: Boolean lattices of nested relations as a foundation for rule-based database languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031367)