On the public citation graph
A transformational methodology for proving termination of logic programs
0 signed · 39 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-51081-8_138openalex-snapshot
An overview of Rewrite Rule Laboratory (RRL)
inferredcites →https://doi.org/10.1007/3-540-52837-7openalex-snapshot
Termination Proofs for Logic Programs
inferredcites →https://doi.org/10.1007/3-540-54415-1_50openalex-snapshot
Proving termination of general Prolog programs
inferredcites →https://doi.org/10.1007/978-1-4471-3494-7_11openalex-snapshot
On Using Mode Input-output for Transforming Logic Programs
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-94-009-0705-8_65openalex-snapshot
An Algebraic Approach to Verifiable Compiling Specification and Prototyping of the Procos Level 0 Programming Language
inferredcites →https://doi.org/10.1007/bf03037115openalex-snapshot
AND parallelism and nondeterminism in logic programs
inferredcites →https://doi.org/10.1016/0743-1066(88)90010-6openalex-snapshot
Automatic mode inference for logic programs
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1145/42282.42285openalex-snapshot
Efficient tests for top-down termination of logical rules
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-024x(199911)29:13<1173::aid-spe276>3.0.co;2-xopenalex-snapshot
Declarative solutions to partitioned-grid problems
inferred← citeshttps://doi.org/10.1007/3-540-48242-3_8openalex-snapshot
Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems
inferred← citeshttps://doi.org/10.1007/3-540-48958-4_16openalex-snapshot
Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations
inferred← citeshttps://doi.org/10.1007/3-540-56282-6_5openalex-snapshot
Tutorial on termination of logic programs
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_34openalex-snapshot
Termination proofs of well-moded logic programs via conditional rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_47openalex-snapshot
Proving termination of logic programs by transforming them into equivalent term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_48openalex-snapshot
Completeness of hierarchical combinations of term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_97openalex-snapshot
Simple termination of hierarchical combinations of term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_16openalex-snapshot
Logic programs as term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-60454-5_31openalex-snapshot
Incremental learning of logic programs
inferred← citeshttps://doi.org/10.1007/3-540-60939-3_17openalex-snapshot
Termination of logic programs using semantic unification
inferred← citeshttps://doi.org/10.1007/978-1-4471-3421-3_1openalex-snapshot
Rewriting Concepts in the Study of Termination of Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-25951-0_12openalex-snapshot
Characterisations of Termination in Logic Programming
inferred← citeshttps://doi.org/10.1007/bf03037949openalex-snapshot
Proving termination of GHC programs
inferred← citeshttps://doi.org/10.1007/bfb0014328openalex-snapshot
Proving existential termination of normal logic programs
inferred← citeshttps://doi.org/10.1007/bfb0014330openalex-snapshot
Some characteristics of strong innermost normalization
inferred← citeshttps://doi.org/10.1007/bfb0024661openalex-snapshot
Verification tools in the development of provably correct compilers
inferred← citeshttps://doi.org/10.1007/s002000100064openalex-snapshot
Termination of Logic Programs: Transformational Methods Revisited
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00075-8openalex-snapshot
Modular proofs for completeness of hierarchical term rewriting systems
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90004-3openalex-snapshot
A methodology for proving termination of logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90027-2openalex-snapshot
Termination of logic programs: the never-ending story
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00021-2openalex-snapshot
A framework for incremental learning of logic programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00215-7openalex-snapshot
Some characteristics of strong innermost normalization
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)00028-9openalex-snapshot
Transformational methodology for proving termination of logic programs
inferred← citeshttps://doi.org/10.1017/s1471068402001400openalex-snapshot
Classes of terminating logic programs
inferred← citeshttps://doi.org/10.1145/224164.224181openalex-snapshot
The functional side of logic programming
inferred← citeshttps://doi.org/10.1145/330643.330645openalex-snapshot
Constraint-based termination analysis of logic programs
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.