On the public citation graph

Deriving constraints among argument sizes in logic programs

0 signed · 58 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-16492-8_104openalex-snapshot

Design overview of the NAIL! System

inferredcites →https://doi.org/10.1007/3-540-52837-7openalex-snapshot

Termination Proofs for Logic Programs

inferredcites →https://doi.org/10.1007/978-3-642-45535-3openalex-snapshot

Redundancy in Mathematical Programming

inferredcites →https://doi.org/10.1007/bf00934319openalex-snapshot

Minimal representation of convex polyhedral sets

inferredcites →https://doi.org/10.1016/0022-0000(89)90006-8openalex-snapshot

On the convergence of query evaluation

inferredcites →https://doi.org/10.1145/16856.16870openalex-snapshot

A message passing framework for logical query evaluation

inferredcites →https://doi.org/10.1145/16894.16870openalex-snapshot

A message passing framework for logical query evaluation

inferredcites →https://doi.org/10.1145/3979.3980openalex-snapshot

Implementation of logical query languages for databases

inferredcites →https://doi.org/10.1145/42282.42285openalex-snapshot

Efficient tests for top-down termination of logical rules

inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot

Convex Analysis

inferredcites →https://doi.org/10.4171/owr/2014/51openalex-snapshot

Combinatorial Optimization

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10720327_8openalex-snapshot

Specialising Finite Domain Programs Using Polyhedra

inferred← citeshttps://doi.org/10.1007/3-540-44404-1_23openalex-snapshot

An Abstract Interpretation Approach to Termination of Logic Programs

inferred← citeshttps://doi.org/10.1007/3-540-45635-x_17openalex-snapshot

Higher-Precision Groundness Analysis

inferred← citeshttps://doi.org/10.1007/3-540-48057-9_12openalex-snapshot

Using Acceptors as Transducers

inferred← citeshttps://doi.org/10.1007/3-540-49674-2_11openalex-snapshot

Unfolding the Mystery of Mergesort

inferred← citeshttps://doi.org/10.1007/3-540-49674-2_15openalex-snapshot

Constrained Regular Approximation of Logic Programs

inferred← citeshttps://doi.org/10.1007/3-540-53507-1_99openalex-snapshot

Static estimation of query sizes in horn programs

inferred← citeshttps://doi.org/10.1007/3-540-55015-1_13openalex-snapshot

On testing effective computability of magic programs

inferred← citeshttps://doi.org/10.1007/3-540-55844-6_142openalex-snapshot

Comparing the Galois connection and widening/narrowing approaches to abstract interpretation

inferred← citeshttps://doi.org/10.1007/3-540-55844-6_143openalex-snapshot

Derivation of linear size relations by abstract interpretation

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-57887-0_92openalex-snapshot

Constraint programming and database query languages

inferred← citeshttps://doi.org/10.1007/3-540-58156-1_22openalex-snapshot

Bottom-up evaluation of Datalog programs with arithmetic constraints

inferred← citeshttps://doi.org/10.1007/3-540-62718-9_12openalex-snapshot

Inferring argument size relationships with CLP( $$\mathcal{R}$$ )

inferred← citeshttps://doi.org/10.1007/3-540-63166-6_44openalex-snapshot

TermiLog: A system for checking termination of queries to logic programs

inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_10openalex-snapshot

Joining Abstract and Concrete Computations in Constraint Logic Programming

inferred← citeshttps://doi.org/10.1007/978-1-4615-5515-5_4openalex-snapshot

A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters

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-642-11999-6_8openalex-snapshot

Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation

inferred← citeshttps://doi.org/10.1007/978-3-642-12082-4openalex-snapshot

Advances in Databases and Information Systems

inferred← citeshttps://doi.org/10.1007/bf03038311openalex-snapshot

Deriving linear size relations for logic programs by abstract interpretation

inferred← citeshttps://doi.org/10.1007/bfb0013537openalex-snapshot

Reducing scheduling overheads for concurrent logic programs

inferred← citeshttps://doi.org/10.1007/bfb0027001openalex-snapshot

A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints

inferred← citeshttps://doi.org/10.1007/bfb0035010openalex-snapshot

Constraint databases: A survey

inferred← citeshttps://doi.org/10.1007/s002000100065openalex-snapshot

A General Framework for Automatic Termination Analysis of Logic Programs

inferred← citeshttps://doi.org/10.1016/0306-4379(95)00022-vopenalex-snapshot

Evaluation of regular nonlinear recursions by deductive database techniques

inferred← citeshttps://doi.org/10.1016/0743-1066(92)90030-7openalex-snapshot

Abstract interpretation and application to logic programs

inferred← citeshttps://doi.org/10.1016/0743-1066(93)90048-lopenalex-snapshot

Pushing constraint selections

inferred← citeshttps://doi.org/10.1016/0743-1066(94)00030-aopenalex-snapshot

Depth-bounded bottom-up evaluation 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/0743-1066(95)00038-0openalex-snapshot

Generalized semantics and abstract interpretation for constraint logic programs

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00297-8openalex-snapshot

Using acceptors as transducers

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.1017/s1471068402001400openalex-snapshot

Classes of terminating logic programs

inferred← citeshttps://doi.org/10.1023/a:1009747629591openalex-snapshot

A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters

inferred← citeshttps://doi.org/10.1145/113413.113433openalex-snapshot

Termination detection in logic programs using argument sizes (extended abstract)

inferred← citeshttps://doi.org/10.1145/137097.137111openalex-snapshot

Constraints and redundancy in datalog

inferred← citeshttps://doi.org/10.1145/137097.137897openalex-snapshot

Pushing constraint selections

inferred← citeshttps://doi.org/10.1145/161468.161472openalex-snapshot

Cost analysis of logic programs

inferred← citeshttps://doi.org/10.1145/182591.182599openalex-snapshot

Constraints among argument sizes in logic programs (extended abstract)

inferred← citeshttps://doi.org/10.1145/190616.190619openalex-snapshot

Database querying and constraint programming

inferred← citeshttps://doi.org/10.1145/212433.212447openalex-snapshot

Constraint programming and database languages

inferred← citeshttps://doi.org/10.1145/298514.298541openalex-snapshot

Deriving constraints among argument sizes in logic programs (extended abstract)

inferred← citeshttps://doi.org/10.1145/330643.330645openalex-snapshot

Constraint-based termination analysis of logic programs

inferred← citeshttps://doi.org/10.14236/ewic/adbis1997.20openalex-snapshot

Safety, Translation and Evaluation of Alignment Calculus

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0012008openalex-snapshot

A General Framework for Automatic Termination Analysis of Logic Programs

inferred← citeshttps://doi.org/10.7551/mitpress/4283.003.0033openalex-snapshot

Lower-bound Time-complexity 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.