Duality for goal-driven query processing in disjunctive deductive databases

Journal of Automated Reasoning

Volumn 28, Issue 1, 2002, Pages 1-34

  Yahya, Adnan H ^a  

^a BIRZEIT UNIVERSITY   (Palestine)

Author keywords

Database updates; Deductive databases; Duality; Model generation; Query processing

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DATABASE SYSTEMS; FORMAL LOGIC;

DISJUNCTIVE DEDUCTIVE DATABASES; DUALITY; GOAL-DRIVEN QUERY PROCESSING; MODEL GENERATION;

QUERY LANGUAGES;

EID: 0036163278     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1020109502432     Document Type: Article

References (44)

1. Magic sets and other strange ways to implement logic programs
2. Hyper tableaux - The next generation
3. FDPLL - a first-order Davis-Putnam-Logemann-Loveland procedure
4. Hyper tableaux
5. Query evaluation in recursive databases: Bottom-up and top-down reconciled
6. Minimal model generation with positive unit hyper-resolution tableaux
7. Positive unit hyper-resolution tableaux and their application to minimal model generation
8. Efficient goal directed bottom-up evaluation of logic programs
9. An efficient strategy for non-horn deductive databases
10. Progress report on the disjunctive deductive database system dlv
11. Bottom-up computation of perfect models for disjunctive stratified theories
12. Cooperation between top-down and bottom-up theorem provers
13. View updates in disjunctive deductive databases
14. Nonhorn magic sets to incorporate top-down inference into bottom-up theorem proving
15. On compiling queries in recursive first-order databases
16. A fixpoint characterization of abductive logic programs
17. Top-down deduction in indefinite deductive databases
18. DCTP - a disconnection calculus theorem prover-system (Abstract)
19. Semantics for horn and disjunctive logic programs
20. Satchmore: Satchmo with relevancy
21. SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy
22. Nonmonotonic reasoning based on minimal model generation and its implementation
23. Satchmo: A theorem prover implemented in prolog
24. On indefinite databases and the closed world assumption
25. A tableau calculus for minimal model reasoning
26. Refutation search for horn sets by a subgoal extraction method
27. On the relationship between non-horn magic sets and relevancy testing
28. DWAM - a WAM model extension for disjunctive logic programming
29. Generating relevant models
30. Top-down vs. bottom-up revisited
31. On closed world databases
32. The Alexander method: A technique for the processing of recursive axioms in deductive databases
33. Backward chaining evaluation in stratified disjunctive theories
34. Model generation and state generation for disjunctive logic programs
35. Goal-directed query processing in disjunctive logic databases
36. Meta interpretation of the model elimination theorem proving procedure for deduction and abduction
37. Choosing directions of rules
38. Generalized query answering in disjunctive deductive databases: Procedural and nonmonotonic aspects
39. Minimal model generation for refined answering of generalized queries in disjunctive deductive databases
40. A goal-driven approach to efficient query processing in disjunctive deductive databases
41. Deduction in non-horn databases
42. Representations for disjunctive deductive databases