On the public citation graph

System description: Proof planning in higher-order logic with λClam

https://doi.org/10.1007/bfb0054254
0 signed · 92 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-52885-7_123openalex-snapshot
The OYSTER-CLAM system
inferredcites →https://doi.org/10.1007/bf00244460openalex-snapshot
Productive use of failure in inductive proof
inferredcites →https://doi.org/10.1007/bfb0012819openalex-snapshot
9th International Conference on Automated Deduction
inferredcites →https://doi.org/10.1007/bfb0012826openalex-snapshot
The use of explicit plans to guide inductive proofs
inferredcites →https://doi.org/10.1007/bfb0013606openalex-snapshot
A logic programming approach to implementing higher-Order term rewriting
inferredcites →https://doi.org/10.1007/bfb0105418openalex-snapshot
Higher-order annotated terms for proof search
inferredcites →https://doi.org/10.1016/0004-3702(93)90079-qopenalex-snapshot
Rippling: A heuristic for guiding inductive proofs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/https://dx.doi.org/10.6028/nist.ir.7268openalex-snapshot
Workshop on the Evaluation of a Tactical Decision Aid Display
inferred← citeshttps://doi.org/10.1007/10704567_12openalex-snapshot
Logical and Meta-Logical Frameworks
inferred← citeshttps://doi.org/10.1007/10720084_13openalex-snapshot
Modular Redundancy for Theorem Proving
inferred← citeshttps://doi.org/10.1007/10722086_7openalex-snapshot
MSPASS: Modal Reasoning by Translation and First-Order Resolution
inferred← citeshttps://doi.org/10.1007/11527695_15openalex-snapshot
Clause Form Conversions for Boolean Circuits
inferred← citeshttps://doi.org/10.1007/11532231_18openalex-snapshot
System Description: Multi A Multi-strategy Proof Planner
inferred← citeshttps://doi.org/10.1007/11559306_12openalex-snapshot
Proving and Disproving Termination of Higher-Order Functions
inferred← citeshttps://doi.org/10.1007/11560647_11openalex-snapshot
Upside-Down Transformation in SOL/Connection Tableaux and Its Application
inferred← citeshttps://doi.org/10.1007/11617990_10openalex-snapshot
A Tool for Automated Theorem Proving in Agda
inferred← citeshttps://doi.org/10.1007/11812289_9openalex-snapshot
Synthesizing Proof Planning Methods and Ω-Ants Agents from Mathematical Knowledge
inferred← citeshttps://doi.org/10.1007/11826095openalex-snapshot
OMDoc – An Open Markup Format for Mathematical Documents [version 1.2]
inferred← citeshttps://doi.org/10.1007/11829263_5openalex-snapshot
Best-First Rippling
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_23openalex-snapshot
A Semantics for Proof Plans with Applications to Interactive Proof Planning
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_25openalex-snapshot
Proof Development with ΩMEGA: √2 Is Irrational
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_6openalex-snapshot
Searching for Invariants Using Temporal Resolution
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_14openalex-snapshot
Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_39openalex-snapshot
An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_6openalex-snapshot
Logic Program Synthesis in a Higher-Order Setting
inferred← citeshttps://doi.org/10.1007/3-540-45470-5_28openalex-snapshot
Inductive Theorem Proving and Computer Algebra in the MathWeb Software Bus
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_12openalex-snapshot
Proof Development with Ωmega
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_7openalex-snapshot
A Critique of Proof Planning
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_11openalex-snapshot
Counting the Number of Equivalent Binary Resolution Proofs
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_13openalex-snapshot
A Comparison of Two Proof Critics: Power vs. Robustness
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-45793-3_39openalex-snapshot
Extraction of Proofs from the Clausal Normal Form Transformation
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_1openalex-snapshot
Proofs About Lists Using Ellipsis
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_18openalex-snapshot
Simplification of Horn Clauses That Are Clausal Forms of Guarded Formulas
inferred← citeshttps://doi.org/10.1007/3-540-48958-4_19openalex-snapshot
Abstract: Proof Planning with Program Schemas
inferred← citeshttps://doi.org/10.1007/978-3-030-77879-8_5openalex-snapshot
Proof Mechanization: From Dream to Reality
inferred← citeshttps://doi.org/10.1007/978-3-319-11271-8_11openalex-snapshot
A Generalisation of the Hyperresolution Principle to First Order Gödel Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-24615-2_3openalex-snapshot
Mechanised Reasoning and Model Generation for Extended Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-24773-9_8openalex-snapshot
Monodic ASMs and Temporal Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_21openalex-snapshot
Chain Resolution for the Semantic Web
inferred← citeshttps://doi.org/10.1007/978-3-540-30210-0_19openalex-snapshot
Four Approaches to Automated Reasoning with Differential Algebraic Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-30221-6_2openalex-snapshot
Ωmega: Computer Supported Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_17openalex-snapshot
Bridging Theorem Proving and Mathematical Knowledge Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-540-32275-7_27openalex-snapshot
Can a Higher-Order and a First-Order Theorem Prover Cooperate?
inferred← citeshttps://doi.org/10.1007/978-3-540-39715-1_10openalex-snapshot
Combining an Inference Engine with Databases: A Rule Server
inferred← citeshttps://doi.org/10.1007/978-3-540-39993-3_16openalex-snapshot
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_22openalex-snapshot
IsaPlanner: A Prototype Proof Planner in Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_45openalex-snapshot
Tool Integration for Reasoned Programming
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-71070-7_41openalex-snapshot
THF0 – The Core of the TPTP Language for Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_20openalex-snapshot
SRASS - A Semantic Relevance Axiom Selection System
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_33openalex-snapshot
Proving Termination by Bounded Increase
inferred← citeshttps://doi.org/10.1007/978-3-540-85110-3_47openalex-snapshot
On Correctness of Mathematical Texts from a Logical and Practical Point of View
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_3openalex-snapshot
Trust and Automation in Verification Tools
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_25openalex-snapshot
Termination Analysis by Dependency Pairs and Inductive Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_8openalex-snapshot
Progress in the Development of Automated Theorem Proving for Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-04222-5_18openalex-snapshot
Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-14052-5_21openalex-snapshot
Case-Analysis for Rippling and Inductive Proof
inferred← citeshttps://doi.org/10.1007/978-3-642-14203-1_24openalex-snapshot
Focused Inductive Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_25openalex-snapshot
System Description: SPASS-FD
inferred← citeshttps://doi.org/10.1007/978-3-642-25070-5_2openalex-snapshot
Exploring the Foundations of Discrete Analytical Geometry in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-642-27503-6_64openalex-snapshot
Research of Semantic Web Model and Reasoning Based on F-Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-27534-0_14openalex-snapshot
On the Satisfiability and Validity Problems in the Propositional Gödel Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-29485-3_9openalex-snapshot
Nuprl as Logical Framework for Automating Proofs in Category Theory
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-35308-6_21openalex-snapshot
Coherent and Strongly Discrete Rings in Type Theory
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-37651-1_1openalex-snapshot
Harald Ganzinger’s Legacy: Contributions to Logics and Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_15openalex-snapshot
First-Order Resolution Methods for Modal Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-38574-2_12openalex-snapshot
Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_15openalex-snapshot
Non-cyclic Sorts for First-Order Satisfiability
inferred← citeshttps://doi.org/10.1007/978-94-017-0253-9_11openalex-snapshot
Proof Development with Ωmega: The Irrationality of $$\sqrt 2$$
inferred← citeshttps://doi.org/10.1007/s10817-009-9138-5openalex-snapshot
Crystal: Integrating Structured Queries into a Tactic Language
inferred← citeshttps://doi.org/10.1007/s10817-010-9177-yopenalex-snapshot
The Use of Embeddings to Provide a Clean Separation of Term and Annotation for Higher Order Rippling
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50005-8openalex-snapshot
Automation of Higher-Order Logic
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50012-6openalex-snapshot
Equality Reasoning in Sequent-Based Calculi
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50017-5openalex-snapshot
Classical Type Theory
inferred← citeshttps://doi.org/10.1016/j.artint.2007.11.004openalex-snapshot
Proof planning with multiple strategies
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.004openalex-snapshot
Failure Reasoning in Multiple-Strategy Proof Planning
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.01.006openalex-snapshot
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.025openalex-snapshot
On the Comparison of Proof Planning Systems: , Ωmega and IsaPlanner
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.063openalex-snapshot
Hiproofs: A Hierarchical Notion of Proof Tree
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.09.019openalex-snapshot
Enhancing Theorem Prover Interfaces with Program Slice Information
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.002openalex-snapshot
TPS: A hybrid automatic-interactive system for developing proofs
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.007openalex-snapshot
A proof-centric approach to mathematical assistants
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.008openalex-snapshot
Computer supported mathematics with Ωmega
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.009openalex-snapshot
SAD as a mathematical assistant—how should we go from here to there?
inferred← citeshttps://doi.org/10.1016/j.jal.2005.10.010openalex-snapshot
Supporting the formal verification of mathematical texts
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00285-3openalex-snapshot
A Proof-Planning Framework with explicit Abstractions based on Indexed Formulas
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80615-2openalex-snapshot
MBase: Representing mathematical Knowledge in a Relational Data Base
inferred← citeshttps://doi.org/10.1109/ase.2001.989817openalex-snapshot
Higher order function synthesis through proof planning
inferred← citeshttps://doi.org/10.4018/jdm.2000100101openalex-snapshot
Formal Approaches to Systems Analysis Using UML
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.