On the public citation graph

On word problems in Horn theories

https://doi.org/10.1007/bfb0012854
0 signed · 33 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-2_9openalex-snapshot
Termination
inferredcites →https://doi.org/10.1007/3-540-15984-3_294openalex-snapshot
A confluence criterion based on the generalised Newman Lemma
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-19242-5openalex-snapshot
Conditional Term Rewriting Systems
inferredcites →https://doi.org/10.1007/3-540-19242-5_12openalex-snapshot
On word problems in Horn theories
inferredcites →https://doi.org/10.1007/bfb0039613openalex-snapshot
Ground term confluence in parametric conditional equational specifications
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/b978-0-08-012975-4.50028-xopenalex-snapshot
Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jsco.1996.0075openalex-snapshot
Oriented Equational Logic Programming is Complete
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_57openalex-snapshot
OBJ: Programming with equalities, subsorts, overloading and parameterization
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_136openalex-snapshot
Order-sorted completion: The many-sorted way
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_99openalex-snapshot
Completion-time optimization of rewrite-time goal solving
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_105openalex-snapshot
On restrictions of ordered paramodulation with simplification
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_109openalex-snapshot
On fairness of completion-based theorem proving strategies
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_140openalex-snapshot
Canonical sets of horn clauses
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_78openalex-snapshot
A maximal-literal unit strategy for horn clauses
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_89openalex-snapshot
Completion of first-order clauses with equality by strict superposition
inferred← citeshttps://doi.org/10.1007/3-540-54317-1_92openalex-snapshot
Completion procedures as semidecision procedures
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_12openalex-snapshot
On notions of inductive validity for first-order equational clauses
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_26openalex-snapshot
Efficient Encodings of First-Order Horn Formulas in Equational Logic
inferred← citeshttps://doi.org/10.1007/bf01534452openalex-snapshot
Reasoning with conditional axioms
inferred← citeshttps://doi.org/10.1007/s10817-022-09656-wopenalex-snapshot
Semantically-Guided Goal-Sensitive Reasoning: Decision Procedures and the Koala Prover
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90105-qopenalex-snapshot
Order-sorted completion: the many-sorted way
inferred← citeshttps://doi.org/10.1016/b978-0-12-046371-8.50011-0openalex-snapshot
Completion Algorithms for Conditional Rewriting Systems11This work was partially supported by the GRECO de Programmation of the CNRS.
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50011-4openalex-snapshot
Rewriting
inferred← citeshttps://doi.org/10.1016/s0747-7171(06)80002-7openalex-snapshot
Deductive and inductive synthesis of equational programs
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80131-9openalex-snapshot
Theorem-proving with resolution and superposition
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80134-4openalex-snapshot
On word problems in horn theories
inferred← citeshttps://doi.org/10.1093/logcom/4.3.217openalex-snapshot
Rewrite-based Equational Theorem Proving with Selection and Simplification
inferred← citeshttps://doi.org/10.5555/100296.100318openalex-snapshot
System support for modular order-sorted horn clause specifications
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93980openalex-snapshot
Automated deduction with built-in theories: completeness results and constraint solving techniques
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.