On the public citation graph

Things to Know when Implementing KBO

https://doi.org/10.1007/s10817-006-9031-4
0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-45744-5_19openalex-snapshot
On the Evaluation of Indexing Techniques for Theorem Proving
inferredcites →https://doi.org/10.1007/3-540-57499-9_23openalex-snapshot
Rules and strategies for program transformation
inferredcites →https://doi.org/10.1007/978-3-540-25984-8_3openalex-snapshot
Efficient Checking of Term Ordering Constraints
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1016/b978-0-08-012975-4.50028-xopenalex-snapshot
Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.
inferredcites →https://doi.org/10.1016/b978-044450813-3/50011-4openalex-snapshot
Rewriting
inferredcites →https://doi.org/10.1016/b978-044450813-3/50029-1openalex-snapshot
Combining Superposition, Sorts and Splitting
inferredcites →https://doi.org/10.1017/s0960129500001560openalex-snapshot
Comprehending monads
inferredcites →https://doi.org/10.1023/a:1005806324129openalex-snapshot
The TPTP Problem Library
inferredcites →https://doi.org/10.1142/s0218213006002564openalex-snapshot
THINGS TO KNOW WHEN IMPLEMENTING LPO
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferredcites →https://doi.org/10.22028/d291-41574openalex-snapshot
WALDMEISTER : Development of a High Performance Completion-Based Theorem Prover

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4532643openalex-extracted
inferred← citeshttps://doi.org/10.1007/978-3-030-11245-5_2openalex-snapshot
Program Synthesis with Equivalence Reduction
inferred← citeshttps://doi.org/10.1007/978-3-030-17462-0_11openalex-snapshot
Extending a Brainiac Prover to Lambda-Free Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_35openalex-snapshot
Twee: An Equational Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_28openalex-snapshot
Partial Redundancy in Saturation
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_29openalex-snapshot
Term Ordering Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-07151-0_20openalex-snapshot
AC-KBO Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-63046-5_27openalex-snapshot
A Transfinite Knuth–Bendix Order for Lambda-Free Higher-Order Terms
inferred← citeshttps://doi.org/10.1007/978-3-319-96418-8_29openalex-snapshot
Towards a Unified Ordering for Superposition-Based Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_26openalex-snapshot
An Extension of the Knuth-Bendix Ordering with LPO-Like Properties
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_29openalex-snapshot
On Transfinite Knuth-Bendix Orders
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_49openalex-snapshot
System Description: E 1.8
inferred← citeshttps://doi.org/10.1007/s10009-021-00639-7openalex-snapshot
Extending a brainiac prover to lambda-free higher-order logic
inferred← citeshttps://doi.org/10.1007/s11786-020-00474-0openalex-snapshot
Relaxed Weighted Path Order in Theorem Proving
inferred← citeshttps://doi.org/10.1016/j.knosys.2022.110217openalex-snapshot
An efficient contradiction separation based automated deduction algorithm for enhancing reasoning capability
inferred← citeshttps://doi.org/10.1016/j.knosys.2023.111238openalex-snapshot
A complementary ratio based clause selection method for contradiction separation dynamic deduction
inferred← citeshttps://doi.org/10.1017/s1471068415000083openalex-snapshot
AC-KBO revisited
inferred← citeshttps://doi.org/10.29007/lvccopenalex-snapshot
Proceedings of the 6th IJCAR ATP System Competition (CASC-J6)
inferred← citeshttps://doi.org/10.3233/aic-2012-0512openalex-snapshot
The CADE-23 Automated Theorem Proving System Competition – CASC-23
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.