Declarative PTIME queries for relational databases using quantifier elimination

DOI10.1093/LOGCOM/9.5.737MaRDI QIDQ4934813zbMATH OpenOpenAlexFDO

Authors Patrick Doherty, Witold Łukaszewicz, Andrzej Szałas

Publication date 30 January 2000

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/19474c76567e919f0dde403eec1b6959bac7227c

zbMATH Keywords

declarative query languagerelational deductive databasessemi-Horn query languageSHQL

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Publication:4943319
• Publication:4508935
• Relational queries computable in polynomial time
• Database Theory - ICDT 2005
• Polynomial queries to relational data bases

Cited in

(3)

• Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals
• scientific article; zbMATH DE number 1416103 (Why is no real title available?)
• Approximate databases: a support tool for approximate reasoning

This page was built for publication: Declarative PTIME queries for relational databases using quantifier elimination

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