On the public citation graph

Negation as Failure. Completeness of the Query Evaluation Process for horn clause programs with recursive definitions

https://doi.org/10.1007/bf02432149
0 signed · 17 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/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_3openalex-snapshot
On Closed World Data Bases
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1016/0304-3975(84)90017-3openalex-snapshot
Closures and fairness in the semantics of programming logic
inferredcites →https://doi.org/10.1016/0743-1066(84)90023-2openalex-snapshot
Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
inferredcites →https://doi.org/10.1016/0743-1066(85)90013-5openalex-snapshot
A basis for deductive database systems
inferredcites →https://doi.org/10.1016/0743-1066(86)90004-xopenalex-snapshot
A basis for deductive database systems II

What points at this work

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

inferred← citeshttps://doi.org/10.1007/1-4020-3092-4_1openalex-snapshot
Knowledge Representation with Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-16492-8_109openalex-snapshot
Completeness of the SLDNF-resolution for a class of logic programs
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_152openalex-snapshot
Unsolvable decision problems for PROLOG programs
inferred← citeshttps://doi.org/10.1007/bf03037151openalex-snapshot
Strict completion of Logic Programs
inferred← citeshttps://doi.org/10.1007/bfb0014975openalex-snapshot
Intensional negation of logic programs: Examples and implementation techniques
inferred← citeshttps://doi.org/10.1007/bfb0026306openalex-snapshot
Predicate inequalities as a basis for automated termination proofs for Prolog programs
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50015-9openalex-snapshot
Logic Programming
inferred← citeshttps://doi.org/10.1016/b978-0-934613-40-8.50006-3openalex-snapshot
Towards a Theory of Declarative Knowledge
inferred← citeshttps://doi.org/10.1145/143559.143689openalex-snapshot
A strategy for transforming generate and test logic programs
inferred← citeshttps://doi.org/10.1145/75427.75436openalex-snapshot
An interpreter for large knowledge bases
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.