Duality for goal-driven query processing in disjunctive deductive databases

DOI10.1023/A:1020109502432zbMath1003.68043OpenAlexW1502266817MaRDI QIDQ1598444

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)

Related Items

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

Uses Software

• DCTP
• SATCHMOREBID
• DWAM