Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 176-190
- https://doi.org/10.1007/3-540-63104-6_18
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- SATCHMORE: SATCHMO with RElevancyJournal of Automated Reasoning, 1995
- Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abductionJournal of Automated Reasoning, 1994
- An efficient strategy for non-Horn deductive databasesTheoretical Computer Science, 1991
- Query evaluation in recursive databases: bottom-up and top-down reconciledData & Knowledge Engineering, 1990
- Design of the Kernel Language for the Parallel Inference MachineThe Computer Journal, 1990
- The Alexander Method — A technique for the processing of recursive axioms in deductive databasesNew Generation Computing, 1986