An efficient strategy for non-Horn deductive databases
From MaRDI portal
Publication:753478
DOI10.1016/0304-3975(51)90010-2zbMath0716.68027OpenAlexW2091640551MaRDI QIDQ753478
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(51)90010-2
Related Items
SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy, Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction, SATCHMORE: SATCHMO with RElevancy, Dynamic maintenance of the transitive closure in disjunctive graphs, \(\mathcal I\)-SATCHMORE: An improvement of \(\mathcal A\)-SATCHMORE, The semantics of incomplete databases as an expression of preferences, Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving
Cites Work