On the public citation graph
Generalized disjunctive well-founded semantics for logic programs
0 signed · 47 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-52885-7_82openalex-snapshot
Generalized well-founded semantics for logic programs
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_32openalex-snapshot
Linear Resolution with Selection Function
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf01531083openalex-snapshot
On stratified disjunctive programs
inferredcites →https://doi.org/10.1007/bf02341854openalex-snapshot
Stable and extension class theory for logic programs and default logics
inferredcites →https://doi.org/10.1007/bfb0000066openalex-snapshot
On indefinite databases and the closed world assumption
inferredcites →https://doi.org/10.1007/bfb0012837openalex-snapshot
Procedural interpretation of non-horn logic programs
inferredcites →https://doi.org/10.1016/0004-3702(71)90012-9openalex-snapshot
Linear resolution with selection function
inferredcites →https://doi.org/10.1016/0020-0190(82)90035-7openalex-snapshot
An extension to linear resolution with selection function
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-12-450010-5.50022-0openalex-snapshot
Circumscription and Disjunctive Logic Programming
inferredcites →https://doi.org/10.1016/b978-0-444-88433-6.50029-0openalex-snapshot
The Well Founded Semantics for Disjunctive Logic Programs
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50005-1openalex-snapshot
Negation in Logic Programming
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.73723openalex-snapshot
Every logic program has a natural stratification and an iterated least fixed point model
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-54563-8_109openalex-snapshot
WF 3: A semantics for negation in normal disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_31openalex-snapshot
Semantics of disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/3-540-56039-4_45openalex-snapshot
Minimizing indefinite information in disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/978-3-540-75410-7_17openalex-snapshot
Consistent Data Integration in P2P Deductive Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-23032-5_6openalex-snapshot
Rules and Logic Programming for the Web
inferred← citeshttps://doi.org/10.1007/bf00881915openalex-snapshot
An alternative approach to the semantics of disjunctive logic programs and deductive databases
inferred← citeshttps://doi.org/10.1007/bf01530759openalex-snapshot
Overview of disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bf01530826openalex-snapshot
Static semantics for normal and disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bf01536399openalex-snapshot
On the computational cost of disjunctive logic programming: Propositional case
inferred← citeshttps://doi.org/10.1007/bf02341854openalex-snapshot
Stable and extension class theory for logic programs and default logics
inferred← citeshttps://doi.org/10.1007/bf02916589openalex-snapshot
Disjunctive logic and semantics of disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bfb0013071openalex-snapshot
Generalized negation as failure and semantics of normal disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bfb0030386openalex-snapshot
A tutorial on Nonmonotonic Reasoning
inferred← citeshttps://doi.org/10.1007/bfb0030664openalex-snapshot
Static semantics as program transformation and well-founded computation
inferred← citeshttps://doi.org/10.1007/bfb0054794openalex-snapshot
Abduction, argumentation and bi-disjunctive logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00022-xopenalex-snapshot
Autoepistemic logics as a unifying framework for the semantics of logic programs
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90024-8openalex-snapshot
Logic programming and negation: A survey
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90025-6openalex-snapshot
Logic programming and knowledge representation
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00179-xopenalex-snapshot
Abduction from logic programs: Semantics and complexity
inferred← citeshttps://doi.org/10.1016/s0743-1066(00)00004-2openalex-snapshot
Argumentation-based abduction in disjunctive logic programming
inferred← citeshttps://doi.org/10.1017/s1471068404002273openalex-snapshot
Optimization of bound disjunctive queries with constraints
inferred← citeshttps://doi.org/10.1023/a:1010744127526openalex-snapshot
On the Computation of the Disjunctive Well-Founded Semantics
inferred← citeshttps://doi.org/10.1145/3105831.3105837openalex-snapshot
Computing a Deterministic Semantics for P2P Deductive Databases
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20511openalex-snapshot
Conditional Abstract Dialectical Frameworks
inferred← citeshttps://doi.org/10.24963/kr.2021/32openalex-snapshot
Approximation Fixpoint Theory for Non-Deterministic Operators and Its Application in Disjunctive Logic Programming
inferred← citeshttps://doi.org/10.3233/fi-1999-40103openalex-snapshot
Processing Deductive Databases under the Disjunctive Stable Model Semantics
inferred← citeshttps://doi.org/10.3233/fun-2004-623-404openalex-snapshot
Query Compilation under the disjunctive well-founded semantics
inferred← citeshttps://doi.org/10.3233/fun-2005-67401openalex-snapshot
A New Partial Semantics for Disjunctive Deductive Databases
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.