On the public citation graph

OTTER 3.3 reference manual.

https://doi.org/10.2172/822573
0 signed · 120 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-15976-2openalex-snapshot
Rewriting Techniques and Applications
inferredcites →https://doi.org/10.1007/3-540-61398-6openalex-snapshot
Automated Deduction in Equational Logic and Cubic Curves
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_19openalex-snapshot
The Linked Inference Principle, II: The User’s Viewpoint
inferredcites →https://doi.org/10.1007/978-1-4757-3188-0_16openalex-snapshot
Ivy: A Preprocessor and Proof Checker for First-Order Logic
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/bf00244283openalex-snapshot
The linked inference principle, I: The formal treatment
inferredcites →https://doi.org/10.1007/bf00244288openalex-snapshot
An overview of automated reasoning and related fields
inferredcites →https://doi.org/10.1007/bf00245024openalex-snapshot
Automated development of Tarski's geometry
inferredcites →https://doi.org/10.1007/bf00252178openalex-snapshot
Using hints to increase the effectiveness of an automated reasoning program: Case studies
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
inferredcites →https://doi.org/10.1016/0898-1221(94)00214-6openalex-snapshot
Automated reasoning about cubic curves
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/s0736-5853(86)80087-9openalex-snapshot
Automated Reasoning: Introduction and Applications
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1023/a:1010639725972openalex-snapshot
Solving Open Questions and Other Challenge Problems Using Proof Sketches
inferredcites →https://doi.org/10.1090/conm/029openalex-snapshot
Automated Theorem Proving: After 25 Years
inferredcites →https://doi.org/10.1142/4132openalex-snapshot
A Fascinating Country in the World of Computing
inferredcites →https://doi.org/10.2172/797949openalex-snapshot
MACE 2.0 reference manual and guide.
inferredcites →https://doi.org/10.2307/2274625openalex-snapshot
Larry Wos. Automated reasoning: 33 basic research problems. Prentice Hall, Englewood Cliffs, N.J., 1988, xiii + 319 pp.
inferredcites →https://doi.org/10.2307/3062209openalex-snapshot
Automated Reasoning with Otter

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11558590_4openalex-snapshot
Using a Theorem Prover for Reasoning on Constraint Problems
inferred← citeshttps://doi.org/10.1007/11663881_12openalex-snapshot
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover
inferred← citeshttps://doi.org/10.1007/11814771_7openalex-snapshot
Using the TPTP Language for Writing Derivations and Finite Interpretations
inferred← citeshttps://doi.org/10.1007/11856290_4openalex-snapshot
Semantic Guidance for Saturation Provers
inferred← citeshttps://doi.org/10.1007/978-3-030-29436-6_27openalex-snapshot
Old or Heavy? Decaying Gracefully with Age/Weight Shapes
inferred← citeshttps://doi.org/10.1007/978-3-030-77445-5_52openalex-snapshot
Heuristic Backward Chaining Based on Predicate Tensorization
inferred← citeshttps://doi.org/10.1007/978-3-030-86059-2_16openalex-snapshot
Learning Theorem Proving Components
inferred← citeshttps://doi.org/10.1007/978-3-030-90318-3_41openalex-snapshot
Inference Methods for Evaluable Knowledge Bases
inferred← citeshttps://doi.org/10.1007/978-3-031-43513-3_9openalex-snapshot
Lemmas: Generation, Selection, Application
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_22openalex-snapshot
Efficient Neural Clause-Selection Reinforcement
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_8openalex-snapshot
Ground Truth: Checking Vampire Proofs via Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-032-32589-1_4openalex-snapshot
Twitch: Learning Abstractions for Equational Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_3openalex-snapshot
Automated Reasoning in the Wild
inferred← citeshttps://doi.org/10.1007/978-3-319-42432-3_9openalex-snapshot
Automated Deduction in Ring Theory
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-66902-1_10openalex-snapshot
Goal-Sensitive Reasoning with Disconnection Tableaux
inferred← citeshttps://doi.org/10.1007/978-3-540-30132-5_97openalex-snapshot
Representing Knowledge in Controlled Natural Language: A Case Study
inferred← citeshttps://doi.org/10.1007/978-3-540-36841-0_60openalex-snapshot
Resonance restriction technique for the resolution-based retrieval of palindrome in Escherichia coli genome sequence
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-540-73954-8_8openalex-snapshot
SHRUTI: A Neurally Motivated Architecture for Rapid, Scalable Inference
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-540-75867-9_51openalex-snapshot
KRRT: Knowledge Representation and Reasoning Tutor System
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_12openalex-snapshot
Automating Algebraic Specifications of Non-freely Generated Data Types
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_24openalex-snapshot
Building Theorem Provers
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_3openalex-snapshot
On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-642-04893-7_11openalex-snapshot
First-Order Logic Formalisation of Arrow’s Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-10684-2_60openalex-snapshot
Automated Log Analysis of Infected Windows OS Using Mechanized Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-15431-7_1openalex-snapshot
Deduction in Existential Conjunctive First-Order Logic: An Algorithm and Experiments
inferred← citeshttps://doi.org/10.1007/978-3-642-17773-6_22openalex-snapshot
Robbing the Bank with a Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_15openalex-snapshot
Heaps and Data Structures: A Challenge for Automated Provers
inferred← citeshttps://doi.org/10.1007/978-3-642-28717-6_32openalex-snapshot
The TPTP Typed First-Order Form with Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-642-34481-7_82openalex-snapshot
Machine Learning Approach to Enhance the Design of Automated Theorem Provers
inferred← citeshttps://doi.org/10.1007/978-3-642-36213-2_11openalex-snapshot
Towards a Verified Reference Implementation of a Trusted Platform Module
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_13openalex-snapshot
Theorem Proving in Large Formal Mathematics as an Emerging AI Field
inferred← citeshttps://doi.org/10.1007/978-3-642-36675-8_4openalex-snapshot
Superposition for Bounded Domains
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-38574-2_29openalex-snapshot
TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-38574-2_8openalex-snapshot
System Description: E-KRHyper 1.4
inferred← citeshttps://doi.org/10.1007/978-3-662-43652-3_8openalex-snapshot
Towards B as a High-Level Constraint Modelling Language
inferred← citeshttps://doi.org/10.1007/978-90-481-9794-1_2openalex-snapshot
Using Mixture of Experts Method in Combining Search-Guiding Heuristics for Theorem Proving
inferred← citeshttps://doi.org/10.1007/s00012-004-1902-0openalex-snapshot
Automated discovery of single axioms for ortholattices
inferred← citeshttps://doi.org/10.1007/s00165-012-0264-1openalex-snapshot
Discovery of invariants through automated theory formation
inferred← citeshttps://doi.org/10.1007/s00233-005-0506-0openalex-snapshot
Levi’s Commutator Theorems for Cancellative Semigroups
inferred← citeshttps://doi.org/10.1007/s10472-009-9151-8openalex-snapshot
Automated verification of refinement laws
inferred← citeshttps://doi.org/10.1007/s10817-004-3243-2openalex-snapshot
Octopus: Combining Learning and Parallel Search
inferred← citeshttps://doi.org/10.1007/s10817-006-9044-zopenalex-snapshot
Searching for Shortest Single Axioms for Groups of Exponent 6
inferred← citeshttps://doi.org/10.1007/s10817-008-9115-4openalex-snapshot
First Order Stålmarck
inferred← citeshttps://doi.org/10.1007/s10817-009-9143-8openalex-snapshot
The TPTP Problem Library and Associated Infrastructure
inferred← citeshttps://doi.org/10.1007/s10817-010-9213-yopenalex-snapshot
On Deciding Satisfiability by Theorem Proving with Speculative Inferences
inferred← citeshttps://doi.org/10.1007/s10817-017-9407-7openalex-snapshot
The TPTP Problem Library and Associated Infrastructure
inferred← citeshttps://doi.org/10.1007/s10817-022-09628-0openalex-snapshot
Set of Support, Demodulation, Paramodulation: A Historical Perspective
inferred← citeshttps://doi.org/10.1007/s10817-024-09711-8openalex-snapshot
Investigations into Proof Structures
inferred← citeshttps://doi.org/10.1007/s10992-006-9038-7openalex-snapshot
Steps Toward a Computational Metaphysics
inferred← citeshttps://doi.org/10.1007/s10992-012-9240-8openalex-snapshot
First-Order Logic Formalisation of Impossibility Theorems in Preference Aggregation
inferred← citeshttps://doi.org/10.1007/s11225-005-8469-4openalex-snapshot
Double-Negation Elimination in Some Propositional Logics
inferred← citeshttps://doi.org/10.1007/s11334-006-0023-7openalex-snapshot
Modeling security as a dependability attribute: a refinement-based approach
inferred← citeshttps://doi.org/10.1007/s11334-012-0189-0openalex-snapshot
Invariant relations, invariant functions, and loop functions
inferred← citeshttps://doi.org/10.1016/j.artint.2007.04.017openalex-snapshot
Exploiting functional dependencies in declarative problem specifications
inferred← citeshttps://doi.org/10.1016/j.compind.2007.12.018openalex-snapshot
Verification, validation, qualification and certification of enterprise models: Statements and opportunities
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.027openalex-snapshot
Connecting Logical Representations and Efficient Computations
inferred← citeshttps://doi.org/10.1016/j.ins.2022.11.128openalex-snapshot
Fully reusing clause deduction algorithm based on standard contradiction separation rule
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/j.topol.2011.08.009openalex-snapshot
Ken Kunen: Algebraist
inferred← citeshttps://doi.org/10.1017/s1471068408003451openalex-snapshot
Checking the quality of clinical guidelines using automated reasoning tools
inferred← citeshttps://doi.org/10.1080/00048401003674482openalex-snapshot
A Computationally-Discovered Simplification of the Ontological Argument
inferred← citeshttps://doi.org/10.1080/00207540903564975openalex-snapshot
Combining RFID with ontologies to create smart objects
inferred← citeshttps://doi.org/10.1080/00927870902911797openalex-snapshot
Computer Solutions of Problems in Inverse Semigroups
inferred← citeshttps://doi.org/10.1080/08839510701252650openalex-snapshot
USING A THEOREM PROVER FOR REASONING ON CONSTRAINT PROBLEMS
inferred← citeshttps://doi.org/10.1090/s0002-9947-07-04391-7openalex-snapshot
When is the commutant of a Bol loop a subloop?
inferred← citeshttps://doi.org/10.1109/hicss.2007.568openalex-snapshot
Towards an Engineering Discipline of Computational Society
inferred← citeshttps://doi.org/10.1109/ifita.2009.55openalex-snapshot
Using First Order Logic to Reason about TCG's TPM Specification
inferred← citeshttps://doi.org/10.1109/isola.2006.76openalex-snapshot
Extending Source Code Generators for Evidence-Based Software Certification
inferred← citeshttps://doi.org/10.1109/syscon.2016.7490554openalex-snapshot
A consistency checking approach for system architecture
inferred← citeshttps://doi.org/10.1142/s0218213006003119openalex-snapshot
SEMANTIC DERIVATION VERIFICATION: TECHNIQUES AND IMPLEMENTATION
inferred← citeshttps://doi.org/10.1145/1459010.1459014openalex-snapshot
New results on rewrite-based satisfiability procedures
inferred← citeshttps://doi.org/10.1145/1836089.1836090openalex-snapshot
On theorem proving for program checking
inferred← citeshttps://doi.org/10.1145/2815782.2815823openalex-snapshot
Evaluating Resolution-Based Reasoning Heuristics for Connection Tableau
inferred← citeshttps://doi.org/10.1145/3670085.3670100openalex-snapshot
Ordered Inference in Sequent Calculi for Applied Logics
inferred← citeshttps://doi.org/10.1561/9781680838992openalex-snapshot
Machine Learning for Automated Theorem Proving: Learning to Solve SAT and QSAT
inferred← citeshttps://doi.org/10.1613/jair.3126openalex-snapshot
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
inferred← citeshttps://doi.org/10.18260/1-2--10079openalex-snapshot
Agent Based Realtime Pedagogy For Proof Construction
inferred← citeshttps://doi.org/10.18489/sacj.v45i0.33openalex-snapshot
Formal methods in software development: A road less travelled
inferred← citeshttps://doi.org/10.2172/822575openalex-snapshot
Short equational bases for ortholattices : proofs and countermodels.
inferred← citeshttps://doi.org/10.25368/2022.170openalex-snapshot
Putting ABox Updates into Action
inferred← citeshttps://doi.org/10.26686/ajl.v13i4.3923openalex-snapshot
Solutions to Some Open Problems from Slaney
inferred← citeshttps://doi.org/10.29007/1rhxopenalex-snapshot
Representation, Verification, and Visualization of Tarskian Interpretations for Typed First-order Logic
inferred← citeshttps://doi.org/10.29007/f997openalex-snapshot
Automated Theorem Proving using the TPTP Process Instruction Language
inferred← citeshttps://doi.org/10.29007/lvccopenalex-snapshot
Proceedings of the 6th IJCAR ATP System Competition (CASC-J6)
inferred← citeshttps://doi.org/10.29007/pqh1openalex-snapshot
Experiments with State-of-the-art Automated Provers on Problems in Tarskian Geometry
inferred← citeshttps://doi.org/10.29007/sd6topenalex-snapshot
Prover9 Unleashed: Automated Configuration for Enhanced Proof Discovery
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.3390/electronics14020401openalex-snapshot
Model Checking Using Large Language Models—Evaluation and Future Directions
inferred← citeshttps://doi.org/10.48456/tr-872openalex-snapshot
The integration of higher order interactive proof with first order automatic theorem proving
inferred← citeshttps://doi.org/10.48550/arxiv.1209.3914openalex-snapshot
Theorem Proving in Large Formal Mathematics as an Emerging AI Field
inferred← citeshttps://doi.org/10.48550/arxiv.2002.04955openalex-snapshot
The Space of Mathematical Software Systems -- A Survey of Paradigmatic Systems
inferred← citeshttps://doi.org/10.5220/0002159603500354openalex-snapshot
PROOF GRANULARITY AS AN EMPIRICAL PROBLEM?
inferred← citeshttps://doi.org/10.5555/1036843.1036870openalex-snapshot
Exploiting first-order regression in inductive policy selection
inferred← citeshttps://doi.org/10.70675/69a219a5zd6c2z401dz9dd2zfa340fb921e2openalex-snapshot
On the formalization of foundations of geometry
inferred← citeshttps://doi.org/10.70675/7c04be9bzbcd8z4c67z803cz59ec002165a9openalex-snapshot
Traitement de requêtes conjonctives avec négation : algorithmes et expérimentations
inferred← citeshttps://doi.org/10.7275/r5pz571nopenalex-snapshot
A bidirectional mapping between English and CNF-based reasoners
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.