On the public citation graph

On stratified disjunctive programs

https://doi.org/10.1007/bf01531083
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/bf00248321openalex-snapshot
Weak Generalized Closed World Assumption
inferredcites →https://doi.org/10.1007/bfb0000066openalex-snapshot
On indefinite databases and the closed world assumption
inferredcites →https://doi.org/10.1016/0743-1066(89)90032-0openalex-snapshot
Negation as Failure Using Tight Derivations for General Logic Programs
inferredcites →https://doi.org/10.1016/0743-1066(90)90033-2openalex-snapshot
A fixpoint semantics for disjunctive 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/c2013-0-07699-2openalex-snapshot
Foundations of Deductive Databases and Logic Programming
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language

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_18openalex-snapshot
Disjunctive Logic Programming: A Survey and Assessment
inferred← citeshttps://doi.org/10.1007/3-540-54563-8_124openalex-snapshot
Disjunctive logic programs and constraint processing
inferred← citeshttps://doi.org/10.1007/bf01543473openalex-snapshot
Generalized disjunctive well-founded semantics for logic programs
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90006-nopenalex-snapshot
Semantics of Horn and disjunctive logic programs
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90214-zopenalex-snapshot
Paraconsistent disjunctive deductive databases
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00106-gopenalex-snapshot
Bottom-up computation of perfect models for disjunctive theories
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90025-6openalex-snapshot
Logic programming and knowledge representation
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50013-7openalex-snapshot
Logic and Databases: A History of Deductive Databases
inferred← citeshttps://doi.org/10.1016/s0169-023x(97)00026-8openalex-snapshot
Top-down query processing in indefinite stratified databases
inferred← citeshttps://doi.org/10.1016/s0169-023x(99)00015-4openalex-snapshot
On cyclic covers and perfect models
inferred← citeshttps://doi.org/10.1023/a:1011271902410openalex-snapshot
An Extension to GCWA and Query Evaluation for Disjunctive Deductive Databases
inferred← citeshttps://doi.org/10.3233/fi-1997-32205openalex-snapshot
Combining Closed World Assumptions with Stable Negation
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.