Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction
- 1 January 1994
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 13 (2) , 189-210
- https://doi.org/10.1007/bf00881955
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Linear resolution for consequence findingArtificial Intelligence, 1992
- Caching and lemmaizing in model elimination theorem proversPublished by Springer Nature ,1992
- 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
- Problems and Promises of Computational LogicPublished by Springer Nature ,1990
- A logic for semantic interpretationPublished by Association for Computational Linguistics (ACL) ,1988
- Extending the ATMSArtificial Intelligence, 1986
- An assumption-based TMSArtificial Intelligence, 1986
- Causes for events: Their computation and applicationsPublished by Springer Nature ,1986
- Proving Theorems with the Modification MethodSIAM Journal on Computing, 1975