On the public citation graph
Experiments with discrimination-tree indexing and path indexing for term retrieval
0 signed · 129 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-16492-8_105openalex-snapshot
A superimposed codeword indexing scheme for very large Prolog databases
inferredcites →https://doi.org/10.1007/3-540-16780-3_123openalex-snapshot
Paths to high-performance automated theorem proving
inferredcites →https://doi.org/10.1007/3-540-51081-8_136openalex-snapshot
Fast Knuth-Bendix completion: Summary
inferredcites →https://doi.org/10.1007/3-540-52885-7_77openalex-snapshot
Parallelizing the closure computation in automated deduction
inferredcites →https://doi.org/10.1007/bf00881866openalex-snapshot
Flatterms, discrimination nets, and fast term rewriting
inferredcites →https://doi.org/10.1007/bfb0000052openalex-snapshot
Logic machine architecture: Kernel functions
inferredcites →https://doi.org/10.1016/0004-3702(80)90024-7openalex-snapshot
Artificial intelligence programming
inferredcites →https://doi.org/10.1016/0021-8693(92)90162-fopenalex-snapshot
Absorption and idempotency criteria for a problem in near-Boolean algebras
inferredcites →https://doi.org/10.1016/0098-3004(76)90046-7openalex-snapshot
Computers and Mathematics with Applications
inferredcites →https://doi.org/10.1016/0898-1221(76)90002-xopenalex-snapshot
Complexity and related enhancements for automated theorem-proving programs
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/321812.321814openalex-snapshot
A New Class of Automated Theorem-Proving Algorithms
inferredcites →https://doi.org/10.21236/ada460990openalex-snapshot
The Path-Indexing Method for Indexing Terms
inferredcites →https://doi.org/10.2172/6569195openalex-snapshot
A tutorial on the construction of high-performance resolution/paramodulation systems
inferredcites →https://doi.org/10.4324/9781315802251openalex-snapshot
Artificial Intelligence Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/er.1222openalex-snapshot
Performance of thermostatic and electronic valves controlling the compressor capacity
inferred← citeshttps://doi.org/10.1002/spe.896openalex-snapshot
Improving the efficiency of inductive logic programming systems
inferred← citeshttps://doi.org/10.1007/11617990_2openalex-snapshot
A Content Based Mathematical Search Engine: Whelp
inferred← citeshttps://doi.org/10.1007/3-540-40006-0_15openalex-snapshot
Partially Adaptive Code Trees
inferred← citeshttps://doi.org/10.1007/3-540-44881-0_26openalex-snapshot
Equational Prover of Theorema
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_19openalex-snapshot
On the Evaluation of Indexing Techniques for Theorem Proving
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_3openalex-snapshot
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_3openalex-snapshot
A Taxonomy of Theorem-Proving Strategies
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_168openalex-snapshot
Caching and lemmaizing in model elimination theorem provers
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_56openalex-snapshot
Associative-commutative discrimination nets
inferred← citeshttps://doi.org/10.1007/3-540-58402-1_12openalex-snapshot
An implementation technique for a class of bottom-up procedures
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_75openalex-snapshot
STORM: A many-to-one associative-commutative matcher
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_74openalex-snapshot
On gaining efficiency in completion-based theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_113openalex-snapshot
Advanced indexing operations on substitution trees
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_124openalex-snapshot
Path indexing for AC-theories
inferred← citeshttps://doi.org/10.1007/3-540-61630-6_2openalex-snapshot
An algorithm for the retrieval of unifiers from discrimination trees
inferred← citeshttps://doi.org/10.1007/3-540-61697-7_30openalex-snapshot
A deductive database for mathematical formulas
inferred← citeshttps://doi.org/10.1007/3-540-61697-7_6openalex-snapshot
WALDMEISTER: High performance equation theorem proving
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_5openalex-snapshot
Dedam: A kernel of data structures and algorithms for automated deduction with equality clauses
inferred← citeshttps://doi.org/10.1007/3-540-63792-3_1openalex-snapshot
Efficient data structures for deduction systems
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-29436-6_29openalex-snapshot
Faster, Higher, Stronger: E 2.3
inferred← citeshttps://doi.org/10.1007/978-3-030-86205-3_10openalex-snapshot
Fast and Slow Enigmas and Parental Guidance
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_10openalex-snapshot
An Efficient Subsumption Test Pipeline for BS(LRA) Clauses
inferred← citeshttps://doi.org/10.1007/978-3-031-30820-8_10openalex-snapshot
Extending a High-Performance Prover to Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_31openalex-snapshot
Computing Ground Congruence Classes
inferred← citeshttps://doi.org/10.1007/978-3-032-07021-0openalex-snapshot
Intelligent Computer Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-032-07021-0_4openalex-snapshot
Growing Mathlib: maintenance of a large scale mathematical library
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_14openalex-snapshot
Incremental Forward Reasoning for White-Box Proof Search
inferred← citeshttps://doi.org/10.1007/978-3-032-32592-1_2openalex-snapshot
A Two-Watched Literal Scheme for First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_15openalex-snapshot
System Description: E 0.81
inferred← citeshttps://doi.org/10.1007/978-3-540-27818-4_2openalex-snapshot
Efficient Retrieval of Mathematical Statements
inferred← citeshttps://doi.org/10.1007/978-3-540-27866-5_87openalex-snapshot
Concurrent Table Accesses in Parallel Tabled Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-30211-7_21openalex-snapshot
A Persistent Feature-Object Database for Intelligent Text Archive Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-39917-9_10openalex-snapshot
Efficient Data Structures for Inductive Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_34openalex-snapshot
Efficient Instance Retrieval with Standard and Relational Path Indexing
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_1openalex-snapshot
Non Commutative Logic: A Survey (Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-45206-5_22openalex-snapshot
SOLAR: A Consequence Finding System for Advanced Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_14openalex-snapshot
LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_36openalex-snapshot
Hyper Tableaux with Equality
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_37openalex-snapshot
System Description: E- KRHyper
inferred← citeshttps://doi.org/10.1007/978-3-642-14203-1_32openalex-snapshot
Perfect Discrimination Graphs: Indexing Terms with Integer Exponents
inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_37openalex-snapshot
Fingerprint Indexing for Paramodulation and Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_3openalex-snapshot
Simple and Efficient Clause Subsumption with Feature Vector Indexing
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_5openalex-snapshot
MACE4 and SEM: A Comparison of Finite Model Generators
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_49openalex-snapshot
System Description: E 1.8
inferred← citeshttps://doi.org/10.1007/978-94-011-3488-0_15openalex-snapshot
Automated Reasoning and Bledsoe’s Dream for the Field
inferred← citeshttps://doi.org/10.1007/bf00244283openalex-snapshot
The linked inference principle, I: The formal treatment
inferred← citeshttps://doi.org/10.1007/bf00249023openalex-snapshot
The problem of choosing the type of subsumption to use
inferred← citeshttps://doi.org/10.1007/bf00881872openalex-snapshot
Automated proofs of equality problems in Overbeek's competition
inferred← citeshttps://doi.org/10.1007/bf00881885openalex-snapshot
Formula databases for high-performance resolution/paramodulation systems
inferred← citeshttps://doi.org/10.1007/bf00885766openalex-snapshot
Improving the efficiency of a hyperlinking-based theorem prover by incremental evaluation with network structures
inferred← citeshttps://doi.org/10.1007/bf01543481openalex-snapshot
The application of automated reasoning to questions in mathematics and logic
inferred← citeshttps://doi.org/10.1007/bf02944895openalex-snapshot
Dynamic analysis of evaporator characteristics
inferred← citeshttps://doi.org/10.1007/bf03037315openalex-snapshot
On semantic resolution with lemmaizing and contraction and a formal treatment of caching
inferred← citeshttps://doi.org/10.1007/bfb0013052openalex-snapshot
Controlling redundancy in large search spaces: Argonne-style theorem proving through the years
inferred← citeshttps://doi.org/10.1007/bfb0026818openalex-snapshot
Design and implementation of jump tables for fast indexing of logic programs
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/s10817-012-9249-2openalex-snapshot
Multi-Completion with Termination Tools
inferred← citeshttps://doi.org/10.1007/s10817-014-9309-xopenalex-snapshot
A Complete Superposition Calculus for Primal Grammars
inferred← citeshttps://doi.org/10.1007/s10817-015-9348-yopenalex-snapshot
The Higher-Order Prover Leo-II
inferred← citeshttps://doi.org/10.1016/0167-739x(93)90007-copenalex-snapshot
Automated theorem-proving research in the Fifth Generation Computer Systems Project: Model generation theorem provers
inferred← citeshttps://doi.org/10.1016/j.ic.2004.10.012openalex-snapshot
Efficient instance retrieval with standard and relational path indexing
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.12.031openalex-snapshot
Model Evolution with equality — Revised and implemented
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10013-4openalex-snapshot
Efficient access mechanisms for tabled logic programs
inferred← citeshttps://doi.org/10.1017/s0956796800003907openalex-snapshot
Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories
inferred← citeshttps://doi.org/10.1023/a:1005843632307openalex-snapshot
Otter - The CADE-13 Competition Incarnations
inferred← citeshttps://doi.org/10.1023/a:1005872405899openalex-snapshot
WALDMEISTER - High-Performance Equational Deduction
inferred← citeshttps://doi.org/10.1023/a:1005992522805openalex-snapshot
An Algorithm for the Retrieval of Unifiers from Discrimination Trees
inferred← citeshttps://doi.org/10.1023/a:1006469202251openalex-snapshot
Parallelization of a Hyper-Linking–Based Theorem Prover
inferred← citeshttps://doi.org/10.1023/b:jars.0000029963.64213.acopenalex-snapshot
Fast Term Indexing with Coded Context Trees
inferred← citeshttps://doi.org/10.1086/590198openalex-snapshot
Two Ways of Analogy: Extending the Study of Analogies to Mathematical Domains
inferred← citeshttps://doi.org/10.1093/logcom/exn061openalex-snapshot
The Hyper Tableaux Calculus with Equality and an Application to Finite Model Computation
inferred← citeshttps://doi.org/10.1109/synasc.2017.00036openalex-snapshot
System Description: Statistical Parsing of Informalized Mizar Formulas
inferred← citeshttps://doi.org/10.1142/9789812813411_0048openalex-snapshot
Logical Basis for the Automation of Reasoning: Case Studies
inferred← citeshttps://doi.org/10.1142/s0218213006002588openalex-snapshot
MoMM — FAST INTERREDUCTION AND RETRIEVAL IN LARGE LIBRARIES OF FORMALIZED MATHEMATICS
inferred← citeshttps://doi.org/10.1145/1614431.1614437openalex-snapshot
Higher-order term indexing using substitution trees
inferred← citeshttps://doi.org/10.1145/232706.232722openalex-snapshot
Principles and practice of unification factoring
inferred← citeshttps://doi.org/10.1145/266670.266696openalex-snapshot
Experiments with subdivision of search in distributed theorem proving
inferred← citeshttps://doi.org/10.1145/2723372.2750544openalex-snapshot
Identifying the Extent of Completeness of Query Answers over Partially Complete Databases
inferred← citeshttps://doi.org/10.1145/3573105.3575671openalex-snapshot
Aesop: White-Box Best-First Proof Search for Lean
inferred← citeshttps://doi.org/10.17664/ksgee.2013.9.2.016openalex-snapshot
Experimental Study on the MIMO Control Algorithm of a Multi-Heat Pump Based on PRBS Identification Scheme
inferred← citeshttps://doi.org/10.17664/ksgee.2013.9.3.011openalex-snapshot
Transient Performance of a System Heat Pump with the Variation of Compressor Speed and EEV Openings
inferred← citeshttps://doi.org/10.29007/9hw9openalex-snapshot
Lazy and Eager Patterns in High-Performance Automated Theorem Proving
inferred← citeshttps://doi.org/10.3103/s0146411611070054openalex-snapshot
On the calculus of positively constructed formulas for automated theorem proving
inferred← citeshttps://doi.org/10.3115/1071884.1071908openalex-snapshot
An indexing scheme for typed feature structures
inferred← citeshttps://doi.org/10.3233/aic-2010-0461openalex-snapshot
An application of automated reasoning in natural language question answering
inferred← citeshttps://doi.org/10.3233/aic-2010-0465openalex-snapshot
SOLAR: An automated deduction system for consequence finding
inferred← citeshttps://doi.org/10.4204/eptcs.311.2openalex-snapshot
Proceedings of the Second International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements
inferred← citeshttps://doi.org/10.4204/eptcs.311.8openalex-snapshot
Proceedings of the Second International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements
inferred← citeshttps://doi.org/10.4204/eptcs.325.40openalex-snapshot
A Low-Level Index for Distributed Logic Programming
inferred← citeshttps://doi.org/10.4204/eptcs.53.2openalex-snapshot
Nonuniform Coercions via Unification Hints
inferred← citeshttps://doi.org/10.46298/lmcs-17(4:21)2021openalex-snapshot
Adaptive Non-linear Pattern Matching Automata
inferred← citeshttps://doi.org/10.5121/ijaia.2021.12604openalex-snapshot
A New Perspective of Paramodulation Complexity by Solving 100 Sliding Block Puzzles
inferred← citeshttps://doi.org/10.70675/3ca47f5aza306z4af4z9346zaa1e7a1b40f8openalex-snapshot
Méthodes pour le raisonnement d'ordre supérieur dans SMT
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.