Duality for goal-driven query processing in disjunctive deductive databases

DOI10.1023/A:1020109502432MaRDI QIDQ1598444zbMATH OpenOpenAlexFDO

Authors Adnan Yahya

Publication date 15 October 2002

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

Full work available at URL https://doi.org/10.1023/a:1020109502432

zbMATH Keywords

disjunctive deductive databasesbottom-up query-answering procedures

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Theory and algorithms for disjunctive deductive databases
• scientific article; zbMATH DE number 5033761
• On the partial semantics for disjunctive deductive databases
• Querying disjunctive databases through nonmonotonic logics
• Publication:4943320
• An extension to GCWA and query evaluation for disjunctive deductive databases
• Deciding the bisimilarity relation between Datalog goals
• Paraconsistent disjunctive deductive databases
• scientific article; zbMATH DE number 4064539
• An alternative approach to the semantics of disjunctive logic programs and deductive databases

Cited in

(5)

• Computing only minimal answers in disjunctive deductive databases
• An extension to GCWA and query evaluation for disjunctive deductive databases
• SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy
• A relevance restriction strategy for automated deduction
• Complexity results for answer set programming with bounded predicate arities and implications

Describes a project that uses

Uses Software

• DWAM
• SATCHMOREBID
• DCTP

This page was built for publication: Duality for goal-driven query processing in disjunctive deductive databases

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