On the public citation graph

Determinacy Analysis for Logic Programs Using Mode and Type Information

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.
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.1006/jsco.1996.0038openalex-snapshot
A Methodology for Granularity-Based Control of Parallelism in Logic Programs
inferredcites →https://doi.org/10.1007/10722311_2openalex-snapshot
An Assertion Language for Constraint Logic Programs
inferredcites →https://doi.org/10.1007/11506676_2openalex-snapshot
Determinacy Analysis for Logic Programs Using Mode and Type Information
inferredcites →https://doi.org/10.1007/3-540-16492-8openalex-snapshot
Third International Conference on Logic Programming
inferredcites →https://doi.org/10.1007/3-540-19129-1_4openalex-snapshot
Unification Revisited
inferredcites →https://doi.org/10.1007/3-540-44898-5_8openalex-snapshot
Program Development Using Abstract Interpretation (And the Ciao System Preprocessor)
inferredcites →https://doi.org/10.1007/3-540-55253-7_10openalex-snapshot
Detecting determinate computations by bottom-up abstract interpretation
inferredcites →https://doi.org/10.1007/978-3-540-24836-1_7openalex-snapshot
Improved Compilation of Prolog to C Using Moded Types and Determinism Information
inferredcites →https://doi.org/10.1007/978-3-540-48085-3_13openalex-snapshot
An Overview of HAL
inferredcites →https://doi.org/10.1016/0743-1066(92)90032-xopenalex-snapshot
Deriving descriptions of possible values of program variables by means of abstract interpretation
inferredcites →https://doi.org/10.1016/0743-1066(93)00007-fopenalex-snapshot
Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions
inferredcites →https://doi.org/10.1016/0743-1066(94)90031-0openalex-snapshot
1983–1993: The wonder years of sequential Prolog implementation
inferredcites →https://doi.org/10.1016/c2013-0-07699-2openalex-snapshot
Foundations of Deductive Databases and Logic Programming
inferredcites →https://doi.org/10.1016/s0096-0551(96)00010-0openalex-snapshot
Improving the efficiency of nondeterministic independent and-parallel systems
inferredcites →https://doi.org/10.1016/s0096-0551(96)00011-2openalex-snapshot
Relating data-parallelism and (and-) parallelism in logic programs
inferredcites →https://doi.org/10.1016/s0743-1066(96)00068-4openalex-snapshot
The execution algorithm of mercury, an efficient purely declarative logic programming language
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sfcs.1979.1openalex-snapshot
A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality
inferredcites →https://doi.org/10.1145/109625.109635openalex-snapshot
Andorra I
inferredcites →https://doi.org/10.1145/135226.135233openalex-snapshot
A practical algorithm for exact array dependence analysis
inferredcites →https://doi.org/10.1145/161468.161472openalex-snapshot
Cost analysis of logic programs
inferredcites →https://doi.org/10.1145/504083.504085openalex-snapshot
Parallel execution of prolog programs
inferredcites →https://doi.org/10.1145/65979.65984openalex-snapshot
Functional computations in logic programs
inferredcites →https://doi.org/10.5555/1760267.1760278openalex-snapshot
Program development using abstract interpretation (and the ciao system preprocessor)
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0058openalex-snapshot
Fast and Precise Regular Approximations 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/11799573_12openalex-snapshot
Detecting Determinacy in Prolog Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_14openalex-snapshot
Testing Your (Static Analysis) Truths
inferred← citeshttps://doi.org/10.1007/978-3-319-30936-1_3openalex-snapshot
Counting Successes: Effects and Transformations for Non-deterministic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_9openalex-snapshot
Determinacy Inference for Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_14openalex-snapshot
An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy
inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_24openalex-snapshot
User-Definable Resource Bounds Analysis for Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-78769-3_10openalex-snapshot
Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-02846-5_10openalex-snapshot
Non-discriminating Arguments and Their Uses
inferred← citeshttps://doi.org/10.1007/s00354-008-0085-1openalex-snapshot
Automatic Inference of Determinacy and Mutual Exclusion for Logic Programs Using Mode and Type Analyses
inferred← citeshttps://doi.org/10.1016/j.scico.2005.02.006openalex-snapshot
Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
inferred← citeshttps://doi.org/10.1017/s1471068411000172openalex-snapshot
Parallel backtracking with answer memoing for independent and-parallelism
inferred← citeshttps://doi.org/10.20868/upm.thesis.14660openalex-snapshot
Estrategias Avanzadas de Tabulación y Paralelismo en Programas Lógicos = Advanced Evaluation Strategies for Tabling and Parallelism in Logic Programs
inferred← citeshttps://doi.org/10.20868/upm.thesis.9886openalex-snapshot
Un marco unificado para análisis de recursos y tiempo de ejecución, validación dinámica y pruebas unitarias = a Unified Framework for Resource and Execution Time Analysis, Run-Time Checking and Unit-Testing
showing the first 13 of 14 · page through all 14
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.