On the public citation graph

Horn equational theories and paramodulation

https://doi.org/10.1007/bf00248322
0 signed · 47 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-10009-1_25openalex-snapshot
Canonical forms and unification
inferredcites →https://doi.org/10.1007/3-540-13345-3_15openalex-snapshot
Oriented equational clauses as a programming language
inferredcites →https://doi.org/10.1007/3-540-15984-3_328openalex-snapshot
Unification in conditional-equational theories
inferredcites →https://doi.org/10.1007/3-540-17220-3_19openalex-snapshot
A general complete E-unification procedure
inferredcites →https://doi.org/10.1007/3-540-18088-5_6openalex-snapshot
On word problems in equational theories
inferredcites →https://doi.org/10.1007/3-540-19129-1_7openalex-snapshot
A completeness result for E-unification algorithms based on conditional narrowing
inferredcites →https://doi.org/10.1007/978-3-642-73005-4_21openalex-snapshot
Oldy But Goody Paramodulation Revisited
inferredcites →https://doi.org/10.1007/978-3-642-81952-0_26openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_17openalex-snapshot
E-Resolution: Extension of Resolution to Include the Equality Relation
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_19openalex-snapshot
Paramodulation and Theorem-Proving in First-Order Theories with Equality
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_33openalex-snapshot
Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_5openalex-snapshot
The Concept of Demodulation in Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-662-09691-8_11openalex-snapshot
Fair Conditional Term Rewriting Systems: Unification, Termination and Confluence
inferredcites →https://doi.org/10.1007/978-94-010-3072-4openalex-snapshot
Logical Writings
inferredcites →https://doi.org/10.1007/bf00244514openalex-snapshot
The problem of finding a strategy to control binary paramodulation
inferredcites →https://doi.org/10.1016/0168-0072(86)90069-2openalex-snapshot
Incorporating equality into logic programming via surface deduction
inferredcites →https://doi.org/10.1016/0304-3975(89)90004-2openalex-snapshot
Complete sets of transformations for general E-unification
inferredcites →https://doi.org/10.1016/0743-1066(84)90004-9openalex-snapshot
Equality, types, modules, and (why not?) generics for logic programming
inferredcites →https://doi.org/10.1016/0743-1066(84)90010-4openalex-snapshot
A theory of complete logic programs with equality
inferredcites →https://doi.org/10.1016/0743-1066(89)90028-9openalex-snapshot
Extending SLD resolution to equational horn clauses using E-unification
inferredcites →https://doi.org/10.1016/c2009-0-22103-9openalex-snapshot
Symbolic Logic and Mechanical Theorem Proving
inferredcites →https://doi.org/10.1016/s0049-237x(08)71923-2openalex-snapshot
Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving
inferredcites →https://doi.org/10.1090/psapm/019/0241195openalex-snapshot
A review of automatic theorem-proving
inferredcites →https://doi.org/10.1137/0204036openalex-snapshot
Proving Theorems with the Modification Method
inferredcites →https://doi.org/10.1137/0212006openalex-snapshot
A Technique for Establishing Completeness Results in Theorem Proving with Equality
inferredcites →https://doi.org/10.1145/1476936.1477034openalex-snapshot
Completeness results for e-resolution
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/321420.321429openalex-snapshot
The Concept of Demodulation in Theorem Proving
inferredcites →https://doi.org/10.1145/321679.321689openalex-snapshot
Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets
inferredcites →https://doi.org/10.1145/321850.321857openalex-snapshot
Unit Refutations and Horn Sets
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming
inferredcites →https://doi.org/10.1145/357162.357169openalex-snapshot
An Efficient Unification Algorithm
inferredcites →https://doi.org/10.21236/ada087640openalex-snapshot
Canonical Forms and Unification.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-54444-5_92openalex-snapshot
Narrowing as an incremental constraint satisfaction algorithm
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_8openalex-snapshot
Handling equality in logic programming via basic folding
inferred← citeshttps://doi.org/10.1007/978-3-642-75100-4_13openalex-snapshot
Linear Paramodulation modulo Equality
inferred← citeshttps://doi.org/10.1007/978-3-642-75182-0_48openalex-snapshot
ALPES A Programming Environment for Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-02711-0_2openalex-snapshot
A Completeness Proof Technique for Resolution with Equality
inferred← citeshttps://doi.org/10.1007/bf00249354openalex-snapshot
Inductive expansion: A calculus for verifying and synthesizing functional and logic programs
inferred← citeshttps://doi.org/10.1007/bf00252179openalex-snapshot
Linear and unit-resulting refutations for Horn theories
inferred← citeshttps://doi.org/10.1007/bf01058391openalex-snapshot
An intensional epistemic logic
inferred← citeshttps://doi.org/10.1007/bfb0018990openalex-snapshot
A model elimination calculus with built-in theories
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90063-nopenalex-snapshot
Conditional equational theories and complete sets of transformations
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00224-7openalex-snapshot
Incremental constraint satisfaction for equational logic programming
inferred← citeshttps://doi.org/10.1145/174130.174137openalex-snapshot
Z-module reasoning
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.