Linearly bounded reformulations of unary databases

DOI10.1007/3-540-44914-0_9MaRDI QIDQ4536722zbMATH OpenFDO

Authors Rada Chirkova, R. Genesereth

Publication date 6 August 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44914-0_9

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Linearly bounded reformulations of conjunctive databases. (Extended abstract)
• Reusing and modifying rulebases by predicate substitution
• On the efficiency of transforming database logic programs
• Generating plans from proofs. The interpolation-based approach to query reformulation
• Data independent recursion in deductive databases

Cited in

(1)

• Linearly bounded reformulations of conjunctive databases. (Extended abstract)

Describes a project that uses

Uses Software

• BREAKUP

This page was built for publication: Linearly bounded reformulations of unary databases

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