Ordered chaining for total orderings
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 435-450
- https://doi.org/10.1007/3-540-58156-1_32
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Hyper-chaining and knowledge-based theorem provingPublished by Springer Nature ,2005
- Rewrite-based Equational Theorem Proving with Selection and SimplificationJournal of Logic and Computation, 1994
- Simple LPO constraint solving methodsInformation Processing Letters, 1993
- Bi-rewriting, a term rewriting technique for monotonic order relationsPublished by Springer Nature ,1993
- Completeness of a prover for dense linear ordersJournal of Automated Reasoning, 1992
- Proving refutational completeness of theorem-proving strategiesJournal of the ACM, 1991
- Challenge problems in elementary calculusJournal of Automated Reasoning, 1990
- Str+ve $$\subseteq$$ : The Str+ve-based subset proverPublished by Springer Nature ,1990
- Completeness results for inequality proversArtificial Intelligence, 1985
- Proving Theorems with the Modification MethodSIAM Journal on Computing, 1975