On the public citation graph

Intensional negation of logic programs: Examples and implementation techniques

https://doi.org/10.1007/bfb0014975
0 signed · 32 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_109openalex-snapshot
Completeness of the SLDNF-resolution for a class of logic programs
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.1007/bf02432149openalex-snapshot
Negation as Failure. Completeness of the Query Evaluation Process for horn clause programs with recursive definitions
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/0378-4754(83)90110-6openalex-snapshot
Fifth generation computer systems
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(85)90018-4openalex-snapshot
Negation as failure. II
inferredcites →https://doi.org/10.1016/0743-1066(86)90004-xopenalex-snapshot
A basis for deductive database systems II
inferredcites →https://doi.org/10.1016/c2013-0-07691-8openalex-snapshot
The Handbook of Artificial Intelligence
inferredcites →https://doi.org/10.1109/tse.1985.232527openalex-snapshot
Symbolic Semantics and Program Reduction
inferredcites →https://doi.org/10.1145/1005937.1005947openalex-snapshot
Logic for problem solving
inferredcites →https://doi.org/10.1145/322326.322339openalex-snapshot
Contributions to the Theory of Logic Programming
inferredcites →https://doi.org/10.1145/356924.356929openalex-snapshot
Logic and Databases: A Deductive Approach

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45628-7_19openalex-snapshot
Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_33openalex-snapshot
Efficient Negation Using Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/3-540-46584-7_9openalex-snapshot
How to Incorporate Negation in a Prolog Compiler?
inferred← citeshttps://doi.org/10.1007/3-540-55437-8_88openalex-snapshot
Negation in conclog
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_15openalex-snapshot
Extending constructive negation for partial functions in lazy functional-logic languages
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_5openalex-snapshot
Constructive Intensional Negation
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_20openalex-snapshot
Implementation Results in Classical Constructive Negation
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_25openalex-snapshot
Soundness and Completeness of an “Efficient” Negation for Prolog
inferred← citeshttps://doi.org/10.1007/bfb0017473openalex-snapshot
Compilative constructive negation in constraint logic programs
inferred← citeshttps://doi.org/10.1007/bfb0024196openalex-snapshot
Logic programming within a functional framework
inferred← citeshttps://doi.org/10.1007/s00354-008-0053-9openalex-snapshot
Implementing Constructive Intensional Negation
inferred← citeshttps://doi.org/10.1007/s10472-021-09764-0openalex-snapshot
The undecidability of proof search when equality is a logical connective
inferred← citeshttps://doi.org/10.1016/0743-1066(90)90023-xopenalex-snapshot
A transformational approach to negation in logic programming
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80064-1openalex-snapshot
First order compiler: A deterministic logic program synthesis algorithm
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.7551/mitpress/4298.003.0065openalex-snapshot
On Extra Variables in (Equational) Logic Programming
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.