Intuitionistic deductive databases and the polynomial time hierarchy

DOI10.1016/S0743-1066(96)00107-0MaRDI QIDQ4371994zbMATH OpenFDO

Authors Anthony J. Bonner

Publication date 20 April 1998

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0743-1066(96)00107-0

zbMATH Keywords

deductive databases

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 545140
• Hypothetical datalog: Complexity and expressibility
• Expressive power and complexity of partial models for disjunctive deductive databases
• scientific article; zbMATH DE number 4147465

Cited in

(4)

• Hierarchy theorems for kOBDDs and kIBDDs
• Primal Infon Logic: Derivability in Polynomial Time
• Intensional First-Order Logic for P2P Database Systems
• scientific article; zbMATH DE number 49786 (Why is no real title available?)

This page was built for publication: Intuitionistic deductive databases and the polynomial time hierarchy

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