On the public citation graph

Proving existential termination of normal logic programs

https://doi.org/10.1007/bfb0014328
0 signed · 50 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-15648-8_8openalex-snapshot
Proving termination of Prolog 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/3-540-56393-8_34openalex-snapshot
Termination proofs of well-moded logic programs via conditional rewrite systems
inferredcites →https://doi.org/10.1007/3-540-56868-9_16openalex-snapshot
Topics in termination
inferredcites →https://doi.org/10.1007/3-540-57182-5_1openalex-snapshot
On the unification free prolog programs
inferredcites →https://doi.org/10.1007/3-540-57529-4_47openalex-snapshot
Proving termination of logic programs by transforming them into equivalent term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-58431-5_16openalex-snapshot
Logic programs as term rewriting systems
inferredcites →https://doi.org/10.1007/3-540-58485-4_32openalex-snapshot
Directional type checking of logic programs
inferredcites →https://doi.org/10.1007/3-540-60299-2_26openalex-snapshot
On termination of constraint logic programs
inferredcites →https://doi.org/10.1007/3-540-60939-3_17openalex-snapshot
Termination of logic programs using semantic unification
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-83213-0openalex-snapshot
Prolog by Example
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bfb0023769openalex-snapshot
A transformational methodology for proving termination of logic programs
inferredcites →https://doi.org/10.1007/bfb0024661openalex-snapshot
Verification tools in the development of provably correct compilers
inferredcites →https://doi.org/10.1016/0743-1066(92)90045-5openalex-snapshot
Proving termination properties of prolog programs: A semantic approach
inferredcites →https://doi.org/10.1016/0743-1066(94)90004-3openalex-snapshot
A methodology for proving termination of logic programs
inferredcites →https://doi.org/10.1016/0743-1066(94)90027-2openalex-snapshot
Termination of logic programs: the never-ending story
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1109/mex.1987.4307074openalex-snapshot
The Art of Prolog
inferredcites →https://doi.org/10.1145/224164.224181openalex-snapshot
The functional side of logic programming
inferredcites →https://doi.org/10.1145/65979.65983openalex-snapshot
Static inference of modes and data dependencies in logic programs
inferredcites →https://doi.org/10.1613/jair.198openalex-snapshot
Practical Methods for Proving Termination of General Logic Programs
inferredcites →https://doi.org/10.7551/mitpress/4301.003.0029openalex-snapshot
Code generation for Mercury

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-47764-0_6openalex-snapshot
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-01854-1openalex-snapshot
Datalog and Logic Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-09870-8_7openalex-snapshot
Checking Termination of Logic Programs with Function Symbols through Linear Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-24599-5_45openalex-snapshot
Termination Analysis 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/978-3-540-25951-0_14openalex-snapshot
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-71410-1_13openalex-snapshot
Automated Termination Analysis for Logic Programs by Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-642-20551-4_12openalex-snapshot
Dependency Triples for Improving Termination Analysis of Logic Programs with Cut
inferred← citeshttps://doi.org/10.1007/bfb0037422openalex-snapshot
On the specification of visual languages: Multisets as first-class citizens
inferred← citeshttps://doi.org/10.1007/s13218-010-0015-5openalex-snapshot
Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving
inferred← citeshttps://doi.org/10.1017/s1471068402001400openalex-snapshot
Classes of terminating logic programs
inferred← citeshttps://doi.org/10.1017/s1471068404002017openalex-snapshot
cTI: a constraint-based termination inference tool for ISO-Prolog
inferred← citeshttps://doi.org/10.1017/s1471068409990068openalex-snapshot
Termination prediction for general logic programs
inferred← citeshttps://doi.org/10.1017/s1471068410000165openalex-snapshot
Automated termination analysis for logic programs with cut
inferred← citeshttps://doi.org/10.1017/s147106841300046xopenalex-snapshot
Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments
inferred← citeshttps://doi.org/10.1017/s1471068414000623openalex-snapshot
Checking termination of bottom-up evaluation of logic programs with function symbols
inferred← citeshttps://doi.org/10.1017/s1471068416000077openalex-snapshot
Using linear constraints for logic program termination analysis
inferred← citeshttps://doi.org/10.1145/1614431.1614433openalex-snapshot
Automated termination proofs for logic programs by term rewriting
inferred← citeshttps://doi.org/10.1145/2505879.2505883openalex-snapshot
Detecting decidable classes of finitely ground logic programs with function symbols
inferred← citeshttps://doi.org/10.1145/3143804openalex-snapshot
Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10669openalex-snapshot
Polynomially Bounded Logic Programs with Function Symbols: A New Decidable
inferred← citeshttps://doi.org/10.1613/jair.1.11408openalex-snapshot
Polynomial and Exponential Bounded Logic Programs with Function Symbols: Some New Decidable Classes
inferred← citeshttps://doi.org/10.2200/s00648ed1v01y201505dtm041openalex-snapshot
Datalog and Logic Databases
inferred← citeshttps://doi.org/10.4995/thesis/10251/11003openalex-snapshot
Towards a Framework for Proving Termination of Maude Programs
inferred← citeshttps://doi.org/10.4995/thesis/10251/19251openalex-snapshot
Termination of Narrowing: Automated Proofs and Modularity Properties
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.