On the public citation graph
Reasoning about Prolog programs: From modes through types to assertions
0 signed · 92 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-50940-2_30openalex-snapshot
Verifying correctness of logic programs
inferredcites →https://doi.org/10.1007/3-540-57182-5_1openalex-snapshot
On the unification free prolog programs
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.1016/0304-3975(88)90099-0openalex-snapshot
Inductive assertion method for logic programs
inferredcites →https://doi.org/10.1016/0743-1066(86)90014-2openalex-snapshot
The relation between logic and functional languages: a survey
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/177492.177673openalex-snapshot
On the occur-check-free PROLOG programs
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.1002/(sici)1097-024x(199911)29:13<1173::aid-spe276>3.3.co;2-oopenalex-snapshot
Declarative solutions to partitioned‐grid problems
inferred← citeshttps://doi.org/10.1007/10704567_19openalex-snapshot
On the Verification of Finite Failure
inferred← citeshttps://doi.org/10.1007/10705424_11openalex-snapshot
Termination Analysis of Tabled Logic Programs Using Mode and Type Information
inferred← citeshttps://doi.org/10.1007/10720327_10openalex-snapshot
Transformation of Left Terminating Programs
inferred← citeshttps://doi.org/10.1007/10720327_14openalex-snapshot
Annotations for Prolog – A Concept and Runtime Handling
inferred← citeshttps://doi.org/10.1007/10720327_16openalex-snapshot
Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programs
inferred← citeshttps://doi.org/10.1007/10722311_10openalex-snapshot
Tools for Search-Tree Visualisation: The APT Tool
inferred← citeshttps://doi.org/10.1007/10722311_11openalex-snapshot
Tools for Constraint Visualisation: The VIFID/TRIFID Tool
inferred← citeshttps://doi.org/10.1007/11916277_27openalex-snapshot
Context-Sensitive Multivariant Assertion Checking in Modular Programs
inferred← citeshttps://doi.org/10.1007/3-540-36607-5_1openalex-snapshot
Abstract Verification and Debugging of Constraint Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-45013-0_1openalex-snapshot
Abstract Diagnosis of Functional Programs
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_7openalex-snapshot
Program Debugging and Validation Using Semantic Approximations and Partial Specifications
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_4openalex-snapshot
The Declarative Side of Magic
inferred← citeshttps://doi.org/10.1007/3-540-48958-4_8openalex-snapshot
Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes
inferred← citeshttps://doi.org/10.1007/3-540-49481-2_43openalex-snapshot
A Framework for Assertion-based Debugging in Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-58431-5_20openalex-snapshot
A logic for variable aliasing in logic programs
inferred← citeshttps://doi.org/10.1007/3-540-60939-3_3openalex-snapshot
Transformation of left terminating programs: The reordering problem
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_17openalex-snapshot
Total correctness of logic programs: A formal approach
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_14openalex-snapshot
Prime factorizations of abstract domains using first-order logic
inferred← citeshttps://doi.org/10.1007/3-540-61739-6_44openalex-snapshot
Automated modular termination proofs for real Prolog programs
inferred← citeshttps://doi.org/10.1007/3-540-61756-6_96openalex-snapshot
Decidability of logic program semantics and applications to testing
inferred← citeshttps://doi.org/10.1007/3-540-62503-8_2openalex-snapshot
Proving properties of logic programs by abstract diagnosis
inferred← citeshttps://doi.org/10.1007/3-540-62718-9_7openalex-snapshot
Replacement can preserve termination
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_9openalex-snapshot
Temporal Mode-Checking for Runtime Monitoring of Privacy Policies
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_11openalex-snapshot
Specialising Interpreters Using Offline Partial Deduction
inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_26openalex-snapshot
Core TuLiP Logic Programming for Trust Management
inferred← citeshttps://doi.org/10.1007/978-3-642-04167-9_7openalex-snapshot
Towards Demonstrably Correct Compilation of Java Byte Code
inferred← citeshttps://doi.org/10.1007/978-3-642-12592-8_6openalex-snapshot
LP with Flexible Grouping and Aggregates Using Modes
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_15openalex-snapshot
Magically Constraining the Inverse Method Using Dynamic Polarity Assignment
inferred← citeshttps://doi.org/10.1007/978-3-642-25560-1_1openalex-snapshot
Understanding and Protecting Privacy: Formal Semantics and Principled Audit Mechanisms
inferred← citeshttps://doi.org/10.1007/978-3-642-60085-2_7openalex-snapshot
Using Global Analysis, Partial Specifications, and an Extensible Assertion Language for Program Validation and Debugging
inferred← citeshttps://doi.org/10.1007/bfb0056610openalex-snapshot
Derivation of proof methods by abstract interpretation
inferred← citeshttps://doi.org/10.1007/bfb0056613openalex-snapshot
An experiment in domain refinement: Type domains and type representations for logic programs
inferred← citeshttps://doi.org/10.1007/s002000100066openalex-snapshot
Termination of Simply-Moded Well-Typed Logic Programs under a Tabled Execution Mechanism
inferred← citeshttps://doi.org/10.1016/0743-1066(95)00150-6openalex-snapshot
A closer look at declarative interpretations
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.06.001openalex-snapshot
On the verification of finite failure
inferred← citeshttps://doi.org/10.1016/j.scico.2003.08.002openalex-snapshot
Abstract interpretation based verification of logic programs
inferred← citeshttps://doi.org/10.1016/s0167-6423(03)00023-6openalex-snapshot
On logic programs that always succeed
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00231-xopenalex-snapshot
Design of abstract domains using first-order logic
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00076-3openalex-snapshot
SLR inference: An inference system for fixed-mode logic programs, based on SLR parsing
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00144-6openalex-snapshot
Directional types and the annotation method
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10013-9openalex-snapshot
The theoretical foundations of LPTP (a logic program theorem prover)
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10025-0openalex-snapshot
Termination of well-moded programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10035-3openalex-snapshot
Verification of logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00067-9openalex-snapshot
Decidability of logic program semantics and applications to testing
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00112-4openalex-snapshot
Abstract Interpretation based Verification of Logic Programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00115-xopenalex-snapshot
On logic programs that do not fail
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00116-1openalex-snapshot
Properties of Input-Consuming Derivations
inferred← citeshttps://doi.org/10.1017/s1471068401001326openalex-snapshot
Properties of Input-Consuming Derivations
inferred← citeshttps://doi.org/10.1017/s1471068402001540openalex-snapshot
The witness properties and the semantics of the Prolog cut
inferred← citeshttps://doi.org/10.1017/s1471068403001662openalex-snapshot
Offline specialisation in Prolog using a hand-written compiler generator
inferred← citeshttps://doi.org/10.1017/s1471068411000032openalex-snapshot
A simple correctness proof for magic transformation
inferred← citeshttps://doi.org/10.1017/s1471068412000397openalex-snapshot
GEM: A distributed goal evaluation algorithm for trust management
inferred← citeshttps://doi.org/10.1023/a:1008741507024openalex-snapshot
Logic Program Synthesis as Problem Reduction Using Combining Forms
inferred← citeshttps://doi.org/10.1093/logcom/12.3.497openalex-snapshot
Generalizing Def and Pos to Type Analysis
inferred← citeshttps://doi.org/10.1093/logcom/ext071openalex-snapshot
Efficient generation of test data structures using constraint logic programming and program transformation
inferred← citeshttps://doi.org/10.1145/2046707.2046726openalex-snapshot
Policy auditing over incomplete logs
inferred← citeshttps://doi.org/10.1145/2810103.2813638openalex-snapshot
Equivalence-based Security for Querying Encrypted Databases
inferred← citeshttps://doi.org/10.1145/371282.371357openalex-snapshot
Termination proofs for logic programs with tabling
inferred← citeshttps://doi.org/10.1145/3731569.3764822openalex-snapshot
AutoMan: Facilitating Verified Distributed Systems Development Through Automatic Code Generation and Manual Optimizations
inferred← citeshttps://doi.org/10.1145/773184.773193openalex-snapshot
Termination of well-typed logic programs
inferred← citeshttps://doi.org/10.1184/r1/6467735openalex-snapshot
A Logical Method for Policy Enforcement over Evolving Audit Logs (CMU-CyLab-11-002)
inferred← citeshttps://doi.org/10.1184/r1/6468083openalex-snapshot
Temporal Mode-Checking for Runtime Monitoring of Privacy Policies (CMU-CyLab-14-005)
inferred← citeshttps://doi.org/10.21236/ada579934openalex-snapshot
A Logical Method for Policy Enforcement over Evolving Audit Logs
inferred← citeshttps://doi.org/10.29007/c25ropenalex-snapshot
Automated Theorem Proving for Prolog Verification
inferred← citeshttps://doi.org/10.3990/1.9789036528542openalex-snapshot
Tulip - reshaping trust management
inferred← citeshttps://doi.org/10.48550/arxiv.1012.2299openalex-snapshot
A Simple Correctness Proof for Magic Transformation
inferred← citeshttps://doi.org/10.48550/arxiv.1508.02448openalex-snapshot
Equivalence-based Security for Querying Encrypted Databases: Theory and Application to Privacy Policy Audits
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0003070openalex-snapshot
The (Lazy) Functional Side of Logic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0101023openalex-snapshot
Properties of Input-Consuming Derivations
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9906013openalex-snapshot
Combining Inclusion Polymorphism and Parametric Polymorphism
inferred← citeshttps://doi.org/10.5281/zenodo.26321openalex-snapshot
Ergebnisse Der Von Franz Werner Und Otto V. Wettstein Auf Den Ägäischen Inseln Unternommenen Sammelreisen. Ameisen.
inferred← citeshttps://doi.org/10.5281/zenodo.41652openalex-snapshot
Blind Channel Identification In Speech Using The Long-Term Average Speech Spectrum
inferred← citeshttps://doi.org/10.7551/mitpress/4283.003.0018openalex-snapshot
Programming with Global Analysis
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.