On the public citation graph
The notions of symptom and error in declarative diagnosis of logic programs
0 signed · 36 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-16492-8_76openalex-snapshot
Rational debugging in logic programming
inferredcites →https://doi.org/10.1007/3-540-50820-1_50openalex-snapshot
A grammatical view of logic programming
inferredcites →https://doi.org/10.1007/3-540-55844-6_149openalex-snapshot
Algorithmic debugging for lazy functional languages
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(51)90008-4openalex-snapshot
Programming in three-valued logic
inferredcites →https://doi.org/10.1016/0743-1066(87)90001-xopenalex-snapshot
Error diagnosis in logic programming an adaptation of E.Y. Shapiro's method
inferredcites →https://doi.org/10.1016/0743-1066(87)90007-0openalex-snapshot
Negation in logic programming
inferredcites →https://doi.org/10.1016/0743-1066(93)90033-dopenalex-snapshot
Proof method of partial correctness and weak completeness for normal logic programs
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50005-1openalex-snapshot
Negation in Logic Programming
inferredcites →https://doi.org/10.1016/c2013-0-07699-2openalex-snapshot
Foundations of Deductive Databases and Logic Programming
inferredcites →https://doi.org/10.1016/s0049-237x(08)71120-0openalex-snapshot
An Introduction to Inductive Definitions
inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1017/s095679680000109xopenalex-snapshot
Algorithmic debugging for lazy functional languages
inferredcites →https://doi.org/10.1145/113445.113472openalex-snapshot
Generalized algorithmic debugging and testing
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.2307/2274155openalex-snapshot
Handbook of mathematical logic, edited by Jon Barwise with the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, and A. S. Troelstra, Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 (© 1977), xi + 1165…
inferredcites →https://doi.org/10.7551/mitpress/1192.001.0001openalex-snapshot
Algorithmic Program Debugging
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10704567_19openalex-snapshot
On the Verification of Finite Failure
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/bfb0027780openalex-snapshot
Declarative debugging in constraint logic programming
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.06.001openalex-snapshot
On the verification of finite failure
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00376-6openalex-snapshot
An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00112-4openalex-snapshot
Abstract Interpretation based Verification of Logic Programs
inferred← citeshttps://doi.org/10.1145/2898434openalex-snapshot
Correctness and Completeness of Logic Programs
inferred← citeshttps://doi.org/10.4204/eptcs.385.20openalex-snapshot
On Feasibility of Declarative Diagnosis
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0012005openalex-snapshot
Value Withdrawal Explanation in CSP
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/4301.003.0032openalex-snapshot
Declarative Diagnosis Revisited
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.