Bounded-overhead caching for definite-clause theorem proving
- 1 January 1993
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 11 (1) , 83-113
- https://doi.org/10.1007/bf00881901
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Iterative broadeningArtificial Intelligence, 1992
- Memoing for logic programsCommunications of the ACM, 1992
- Caching and lemmaizing in model elimination theorem proversPublished by Springer Nature ,1992
- Learning how to planRobotics and Autonomous Systems, 1991
- A general framework for reason maintenanceArtificial Intelligence, 1991
- Quantitative results concerning the utility of explanation-based learningArtificial Intelligence, 1990
- Non-Horn clause logic programming without contrapositivesJournal of Automated Reasoning, 1988
- OLD resolution with tabulationPublished by Springer Nature ,1986
- Depth-first iterative-deepeningArtificial Intelligence, 1985
- “Memo” Functions and Machine LearningNature, 1968