Designing deductive databases

DOI10.1007/BF00244512zbMATH Open0647.68109OpenAlexW1992271858MaRDI QIDQ1104781FDOQ1104781

Authors: Paul Helman, Robert Veroff 

Publication date: 1988

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00244512

Recommendations

• Conceptual schemas applied to deductive databases
• scientific article; zbMATH DE number 545140
• The deevolution of concurrent logic programming languages
• scientific article; zbMATH DE number 62656
• On the efficiency of transforming database logic programs

zbMATH Keywords

relational databasestheorem proverdeductive databasesdatabase designintensional databasephysical optimization

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05)

Cited In (8)

• A deductive database approach for complex objects
• A family of NP-complete data aggregation problems
• Title not available (Why is that?)
• Conceptual schemas applied to deductive databases
• Title not available (Why is that?)
• Novelty in deductive databases
• KI 2004: Advances in Artificial Intelligence
• An empirical analysis of algorithms for partially Clairvoyant scheduling

This page was built for publication: Designing deductive databases

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