On the public citation graph

Computing stable and partial stable models of extended disjunctive logic programs

https://doi.org/10.1007/bfb0030666
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-55602-8_180openalex-snapshot
Embedding negation as failure into a model generation theorem prover
inferredcites →https://doi.org/10.1007/3-540-56804-2_1openalex-snapshot
On extended disjunctive logic programs
inferredcites →https://doi.org/10.1007/bf01530802openalex-snapshot
Disjunctive LP+integrity constraints= stable model semantics
inferredcites →https://doi.org/10.1007/bf03037171openalex-snapshot
Stable semantics for disjunctive programs
inferredcites →https://doi.org/10.1007/bf03037172openalex-snapshot
A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics
inferredcites →https://doi.org/10.1016/0743-1066(85)90014-7openalex-snapshot
A deterministic prolog fixpoint semantics
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/0743-1066(93)90031-bopenalex-snapshot
The family of stable models
inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1142/9789812791245openalex-snapshot
Data Structures and Algorithms
inferredcites →https://doi.org/10.1145/153850.153864openalex-snapshot
Complexity aspects of various semantics for disjunctive databases
inferredcites →https://doi.org/10.3233/fi-1994-201236openalex-snapshot
SEMANTICS FOR DISJUNCTIVE LOGIC PROGRAMS WITH EXPLICIT AND DEFAULT NEGATION
inferredcites →https://doi.org/10.7551/mitpress/4307.003.0006openalex-snapshot
Implementing Stable Semantics by Linear Programming

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1997.2630openalex-snapshot
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation
inferred← citeshttps://doi.org/10.1007/1-4020-3092-4_1openalex-snapshot
Knowledge Representation with Logic Programs
inferred← citeshttps://doi.org/10.1007/11799573_26openalex-snapshot
Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic
inferred← citeshttps://doi.org/10.1007/3-540-45402-0_25openalex-snapshot
Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
inferred← citeshttps://doi.org/10.1007/3-540-46767-x_17openalex-snapshot
On the Role of Negation in Choice Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-60211-5_18openalex-snapshot
Logic and Databases: a 20 Year Retrospective -Updated in Honor of Ray Reiter
inferred← citeshttps://doi.org/10.1007/bf01530817openalex-snapshot
Jack Minker ? A profile
inferred← citeshttps://doi.org/10.1007/bfb0023799openalex-snapshot
Prolegomena to logic programming for non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1007/bfb0034719openalex-snapshot
On the computation of disjunctive stable models
inferred← citeshttps://doi.org/10.1007/bfb0054788openalex-snapshot
Knowledge representation with logic programs
inferred← citeshttps://doi.org/10.1007/s10472-007-9075-0openalex-snapshot
Partial equilibrium logic
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00116-1openalex-snapshot
Model generation and state generation for disjunctive logic programs
inferred← citeshttps://doi.org/10.1023/a:1018951805211openalex-snapshot
Logic knowledge bases with two default rules
inferred← citeshttps://doi.org/10.1080/11663081.2014.911520openalex-snapshot
Modeling the suppression task under weak completion and well-founded semantics
inferred← citeshttps://doi.org/10.1109/tkde.2003.1185840openalex-snapshot
Binding propagation techniques for the optimization of bound disjunctive queries
inferred← citeshttps://doi.org/10.1111/0824-7935.00168openalex-snapshot
Semantic Forcing in Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1145/1119439.1119440openalex-snapshot
Unfolding partiality and disjunctions in stable model semantics
inferred← citeshttps://doi.org/10.1613/jair.1.11236openalex-snapshot
A Core Method for the Weak Completion Semantics with Skeptical Abduction
inferred← citeshttps://doi.org/10.1613/jair.5581openalex-snapshot
On the Equivalence between Assumption-Based Argumentation and 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.