On the public citation graph

Theorem proving for hierarchic first-order theories

https://doi.org/10.1007/bfb0013841
0 signed · 34 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-10856-4_85openalex-snapshot
On the power of algebraic specifications
inferredcites →https://doi.org/10.1007/3-540-16780-3_84openalex-snapshot
How to prove equivalence of term rewriting systems without induction
inferredcites →https://doi.org/10.1007/3-540-52885-7_95openalex-snapshot
Unification in a combination of equational theories: an efficient algorithm
inferredcites →https://doi.org/10.1007/3-540-53904-2_93openalex-snapshot
Goal directed strategies for paramodulation
inferredcites →https://doi.org/10.1007/3-540-53904-2_95openalex-snapshot
Proofs in parameterized specifications
inferredcites →https://doi.org/10.1007/978-94-009-6259-0_4openalex-snapshot
Correspondence Theory
inferredcites →https://doi.org/10.1007/bf00244275openalex-snapshot
Automated deduction by theory resolution
inferredcites →https://doi.org/10.1016/0304-3975(91)90004-lopenalex-snapshot
An analysis of loop checking mechanisms for logic programs
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50018-4openalex-snapshot
Algebraic Specification
inferredcites →https://doi.org/10.1016/s0049-237x(08)71097-8openalex-snapshot
An Introduction to First-Order Logic
inferredcites →https://doi.org/10.1016/s0076-5392(08)62322-xopenalex-snapshot
1 Elements of Mathematical Logic
inferredcites →https://doi.org/10.1016/s0747-7171(89)80022-7openalex-snapshot
Unification in a combination of arbitrary disjoint equational theories
inferredcites →https://doi.org/10.1093/logcom/4.3.217openalex-snapshot
Rewrite-based Equational Theorem Proving with Selection and Simplification
inferredcites →https://doi.org/10.1137/0204036openalex-snapshot
Proving Theorems with the Modification Method
inferredcites →https://doi.org/10.1142/1905openalex-snapshot
Theoretical Computer Science
inferredcites →https://doi.org/10.1145/41625.41635openalex-snapshot
Constraint logic programming
inferredcites →https://doi.org/10.1145/5383.5389openalex-snapshot
Equality-based binary resolution
inferredcites →https://doi.org/10.2307/2219318openalex-snapshot
Handbook of Philosophical Logic, Volume II. Extensions of Classical Logic.
inferredcites →https://doi.org/10.2307/2314853openalex-snapshot
Elements of Mathematical Logic.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11559306_1openalex-snapshot
A Comprehensive Framework for Combined Decision Procedures
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_58openalex-snapshot
Optimized translation of multi modal logic into predicate logic
inferred← citeshttps://doi.org/10.1007/3-540-60381-6_1openalex-snapshot
Associative-commutative superposition
inferred← citeshttps://doi.org/10.1007/978-1-4471-3421-3_13openalex-snapshot
From a Hilbert Calculus to its Model Theoretic Semantics
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-37651-1_1openalex-snapshot
Harald Ganzinger’s Legacy: Contributions to Logics and Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_5openalex-snapshot
Basics of Term Rewriting
inferred← citeshttps://doi.org/10.1007/bfb0013814openalex-snapshot
Algebraic and Logic Programming
inferred← citeshttps://doi.org/10.1007/bfb0014447openalex-snapshot
What is an Abstract Data Type, after all?
inferred← citeshttps://doi.org/10.1007/s10817-020-09567-8openalex-snapshot
Decidable $${\exists }^*{\forall }^*$$ First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates
inferred← citeshttps://doi.org/10.1016/0898-1221(94)00217-9openalex-snapshot
Towards automating duality
inferred← citeshttps://doi.org/10.1093/jigpal/1.1.69openalex-snapshot
Translation Methods for Non-Classical Logics: An Overview
inferred← citeshttps://doi.org/10.1093/jigpal/4.1.109openalex-snapshot
Computer Support for the Development and Investigation of Logics
inferred← citeshttps://doi.org/10.1109/lics.1993.287598openalex-snapshot
Set constraints are the monadic class
inferred← citeshttps://doi.org/10.22028/d291-26547openalex-snapshot
Superposition modulo theory
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.