FLORA: Implementing an efficient DOOD system using a tabling logic engine

DOI10.1007/3-540-44957-4_72MaRDI QIDQ2767130zbMATH OpenFDO

Authors Guizhen Yang, Michael Kifer

Publication date 28 January 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-44957-4_72

zbMATH Keywords

deductive object-oriented databases

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• XSB: extending Prolog with tabled logic programming
• Efficient access mechanisms for tabled logic programs
• Tabling with answer subsumption: implementation, applications and performance
• A simple scheme for implementing tabled logic programming systems based on dynamic reordering of alternatives
• Logic Programming and Nonmonotonic Reasoning

Cited in

(2)

• FLORA
• Integrating logic rules with everything else, seamlessly

Describes a project that uses

Uses Software

• XSB
• HiLog

This page was built for publication: FLORA: Implementing an efficient DOOD system using a tabling logic engine

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