On the public citation graph

Partial deduction of logic programs wrt well-founded semantics

https://doi.org/10.1007/bf03038308
0 signed · 33 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-53162-9_41openalex-snapshot
Eliminating negation from normal 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-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-94-010-0526-5_18openalex-snapshot
Language and Equality Theory in Logic Programming
inferredcites →https://doi.org/10.1007/bf03037136openalex-snapshot
Specialisation of Prolog and FCP programs using abstract interpretation
inferredcites →https://doi.org/10.1007/bf03037145openalex-snapshot
Annotated bibliography on partial evaluation and mixed computation
inferredcites →https://doi.org/10.1007/bfb0013044openalex-snapshot
Soundness and completeness of partial deductions for well-founded semantics
inferredcites →https://doi.org/10.1016/0004-3702(88)90088-4openalex-snapshot
Explanation-based generalisation = partial evaluation
inferredcites →https://doi.org/10.1016/0304-3975(91)90004-lopenalex-snapshot
An analysis of loop checking mechanisms for logic programs
inferredcites →https://doi.org/10.1016/0304-3975(92)90285-nopenalex-snapshot
On the relations between stable and well-founded semantics of logic programs
inferredcites →https://doi.org/10.1016/0743-1066(90)90023-xopenalex-snapshot
A transformational approach to negation in logic programming
inferredcites →https://doi.org/10.1016/0743-1066(91)90027-mopenalex-snapshot
Partial evaluation in logic programming
inferredcites →https://doi.org/10.1016/0743-1066(93)90017-bopenalex-snapshot
Loop checking and negation
inferredcites →https://doi.org/10.1016/0743-1066(93)90021-8openalex-snapshot
Unfold⧸fold transformation of general logic programs for the well-founded semantics
inferredcites →https://doi.org/10.1016/0743-1066(93)90022-9openalex-snapshot
Loop checking in partial deduction
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50006-3openalex-snapshot
Towards a Theory of Declarative Knowledge
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50009-9openalex-snapshot
On the Declarative Semantics of Deductive Databases and Logic Programs
inferredcites →https://doi.org/10.1145/308386.308444openalex-snapshot
Unfounded sets and well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/73721.73724openalex-snapshot
A procedural semantics for well founded negation in logic programs
inferredcites →https://doi.org/10.7551/mitpress/5040.003.0027openalex-snapshot
Stable Model Semantics 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/3-540-45628-7_8openalex-snapshot
Transformation Systems and Nondeclarative Properties
inferred← citeshttps://doi.org/10.1007/978-3-319-27436-2_2openalex-snapshot
On Dual Programs in Co-Logic Programming
inferred← citeshttps://doi.org/10.1007/bf00125368openalex-snapshot
Intensional query answering by partial evaluation
inferred← citeshttps://doi.org/10.1007/bf03037222openalex-snapshot
Aggregation and negation-as-failure
inferred← citeshttps://doi.org/10.1007/bfb0021965openalex-snapshot
Belief dynamics, abduction, and databases
inferred← citeshttps://doi.org/10.1007/bfb0023802openalex-snapshot
Aggregation and well-founded semantics+
inferred← citeshttps://doi.org/10.1007/bfb0023808openalex-snapshot
Computation of non-ground disjunctive well-founded semantics with constraint logic programming
inferred← citeshttps://doi.org/10.1007/s00165-016-0404-0openalex-snapshot
On dual programs in co-logic programming and the Horn μ-calculus
inferred← citeshttps://doi.org/10.1016/0004-3702(94)00041-xopenalex-snapshot
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00115-xopenalex-snapshot
Characterizations of the disjunctive stable semantics by partial evaluation
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10003-1openalex-snapshot
A framework to incorporate non-monotonic reasoning into constraint logic programming
inferred← citeshttps://doi.org/10.1017/s147106840200145xopenalex-snapshot
Logic program specialisation through partial deduction: Control issues
inferred← citeshttps://doi.org/10.1080/11663081.1995.10510843openalex-snapshot
Knowledge base dynamics, abduction, and database updates
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.