On the public citation graph
A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints
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-55844-6_142openalex-snapshot
Comparing the Galois connection and widening/narrowing approaches to abstract interpretation
inferredcites →https://doi.org/10.1007/3-540-62718-9_12openalex-snapshot
Inferring argument size relationships with CLP( $$\mathcal{R}$$ )
inferredcites →https://doi.org/10.1007/3540539816_66openalex-snapshot
Proving termination of logic programs by exploiting term properties
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-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf01530930openalex-snapshot
Deriving constraints among argument sizes in logic programs
inferredcites →https://doi.org/10.1016/0304-3975(89)90070-4openalex-snapshot
Declarative modeling of the operational behavior of logic languages
inferredcites →https://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferredcites →https://doi.org/10.1016/0743-1066(95)00038-0openalex-snapshot
Generalized semantics and abstract interpretation for constraint logic programs
inferredcites →https://doi.org/10.1016/0743-1066(95)00064-xopenalex-snapshot
Analyzing logic programs using “prop”-ositional logic programs and a magic wand
inferredcites →https://doi.org/10.1109/lics.1991.151656openalex-snapshot
Prop revisited: propositional formula as abstract domain for groundness analysis
inferredcites →https://doi.org/10.1145/177492.177656openalex-snapshot
Suspension analyses for concurrent logic programs
inferredcites →https://doi.org/10.1145/326619.326789openalex-snapshot
Goal independency and call patterns in the analysis of logic programs
inferredcites →https://doi.org/10.1145/512760.512770openalex-snapshot
Automatic discovery of linear restraints among variables of a program
inferredcites →https://doi.org/10.7551/mitpress/4299.003.0011openalex-snapshot
Automatic Termination Analysis of Logic Programs
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-45744-5_1openalex-snapshot
Program Termination Analysis by Size-Change Graphs (Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-45789-5_11openalex-snapshot
A Few Graph-Based Relational Numerical Abstract Domains
inferred← citeshttps://doi.org/10.1007/3-540-45821-2_14openalex-snapshot
Program Termination Analysis in Polynomial Time
inferred← citeshttps://doi.org/10.1007/3-540-47764-0_10openalex-snapshot
Finite-Tree Analysis for Constraint Logic-Based Languages
inferred← citeshttps://doi.org/10.1007/3-540-48958-4_13openalex-snapshot
Inferring and Compiling Termination for Constraint Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_12openalex-snapshot
Size-Change Termination, Monotonicity Constraints and Ranking Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_9openalex-snapshot
Termination Analysis with Compositional Transition Invariants
inferred← citeshttps://doi.org/10.1007/bfb0053561openalex-snapshot
A polyvariant binding-time analysis for off-line partial deduction
inferred← citeshttps://doi.org/10.1016/j.ic.2004.04.005openalex-snapshot
Finite-tree analysis for constraint logic-based languages
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10024-9openalex-snapshot
Efficient goal directed bottom-up evaluation of logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00006-0openalex-snapshot
A semantic basis for the termination analysis of logic programs
inferred← citeshttps://doi.org/10.1145/1180475.1180480openalex-snapshot
Program termination analysis in polynomial time
inferred← citeshttps://doi.org/10.1145/1353445.1353450openalex-snapshot
Size-change termination with difference constraints
inferred← citeshttps://doi.org/10.1145/330643.330645openalex-snapshot
Constraint-based termination analysis of logic programs
inferred← citeshttps://doi.org/10.1145/3314221.3314643openalex-snapshot
Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programs
inferred← citeshttps://doi.org/10.1145/360204.360210openalex-snapshot
The size-change principle for program termination
inferred← citeshttps://doi.org/10.1145/373243.360210openalex-snapshot
The size-change principle for program termination
inferred← citeshttps://doi.org/10.11606/t.55.2009.tde-05082009-205709openalex-snapshot
Uma abordagem de predição da dinâmica comportamental de processos para prover autonomia a ambientes distribuídos
inferred← citeshttps://doi.org/10.3929/ethz-a-006707337openalex-snapshot
Termination Analysis for Bit-Vector Programs
inferred← citeshttps://doi.org/10.4204/eptcs.320.10openalex-snapshot
Distilling Programs to Prove Termination
inferred← citeshttps://doi.org/10.48550/arxiv.1808.02101openalex-snapshot
Size-Change Termination as a Contract
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0404055openalex-snapshot
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
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.