On the public citation graph

From disjunctive programs to abduction

https://doi.org/10.1007/bfb0030658
0 signed · 20 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/bf03037169openalex-snapshot
Classical negation in logic programs and disjunctive databases
inferredcites →https://doi.org/10.1016/0004-3702(87)90043-9openalex-snapshot
Nonmonotonic logic and temporal projection
inferredcites →https://doi.org/10.1016/0743-1066(93)90035-fopenalex-snapshot
Representing action and change by logic programs
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.1016/b978-1-4832-1452-8.50123-8openalex-snapshot
On Positive Occurrences of Negation as Failure
inferredcites →https://doi.org/10.1016/c2013-0-07699-2openalex-snapshot
Foundations of Deductive Databases and Logic Programming
inferredcites →https://doi.org/10.1093/logcom/5.5.553openalex-snapshot
Representing Incomplete Knowledge in Abductive Logic Programming
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0014openalex-snapshot
Splitting a Logic Program

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-59487-6_25openalex-snapshot
Embedding circumscriptive theories in general disjunctive programs
inferred← citeshttps://doi.org/10.1007/bf01530759openalex-snapshot
Overview of disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bf02916880openalex-snapshot
Argumentation in disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bfb0054794openalex-snapshot
Abduction, argumentation and bi-disjunctive logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(00)00004-2openalex-snapshot
Argumentation-based abduction in disjunctive logic programming
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00125-2openalex-snapshot
Representing actions in logic programs and default theories a situation calculus approach
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10001-2openalex-snapshot
Negation as failure in the head
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00073-4openalex-snapshot
Abductive logic programming and disjunctive logic programming: their relationship and transferability
inferred← citeshttps://doi.org/10.1017/s1471068403001960openalex-snapshot
Abduction in well-founded semantics and generalized stable models via tabled dual programs
inferred← citeshttps://doi.org/10.1017/s1471068404002224openalex-snapshot
Abductive logic programs with penalization: semantics, complexity and implementation
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0312057openalex-snapshot
Abduction in Well-Founded Semantics and Generalized Stable Models
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.