On the public citation graph

Partial evidential stable models for disjunctive deductive databases

https://doi.org/10.1007/bfb0054790
0 signed · 35 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-54563-8_109openalex-snapshot
WF 3: A semantics for negation in normal disjunctive logic programs
inferredcites →https://doi.org/10.1007/3-540-59487-6_3openalex-snapshot
Abduction over 3-valued extended logic programs
inferredcites →https://doi.org/10.1007/3-540-63255-7_20openalex-snapshot
A general framework for revising nonmonotonic theories
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf01530802openalex-snapshot
Disjunctive LP+integrity constraints= stable model semantics
inferredcites →https://doi.org/10.1007/bf01530826openalex-snapshot
Static semantics for normal and disjunctive logic programs
inferredcites →https://doi.org/10.1007/bf03037169openalex-snapshot
Classical negation in logic programs and disjunctive databases
inferredcites →https://doi.org/10.1007/bf03037171openalex-snapshot
Stable semantics for disjunctive programs
inferredcites →https://doi.org/10.1007/bfb0031745openalex-snapshot
The expressive power of partial models for disjunctive deductive databases
inferredcites →https://doi.org/10.1007/bfb0031746openalex-snapshot
Stable model checking for disjunctive logic programs
inferredcites →https://doi.org/10.1016/0004-3702(93)90090-xopenalex-snapshot
Skeptical reason maintenance and belief revision
inferredcites →https://doi.org/10.1016/0743-1066(91)90014-gopenalex-snapshot
Bilattices and the semantics of logic programming
inferredcites →https://doi.org/10.1016/0743-1066(94)00023-yopenalex-snapshot
On the equivalence of semantics for normal logic programs
inferredcites →https://doi.org/10.1016/0743-1066(95)00119-0openalex-snapshot
A fixpoint characterization of abductive 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/s0743-1066(96)00115-xopenalex-snapshot
Characterizations of the disjunctive stable semantics by partial evaluation
inferredcites →https://doi.org/10.1016/s0743-1066(96)00116-1openalex-snapshot
Model generation and state generation for disjunctive logic programs
inferredcites →https://doi.org/10.1023/a:1018947420290openalex-snapshot
On the partial semantics for disjunctive deductive databases
inferredcites →https://doi.org/10.1145/298514.298559openalex-snapshot
Three-valued formalization of logic programming
inferredcites →https://doi.org/10.1145/308386.308444openalex-snapshot
Unfounded sets and well-founded semantics for general logic programs
inferredcites →https://doi.org/10.7551/mitpress/4283.003.0032openalex-snapshot
A Characterization Of The Partial Stable Models For Disjunctive Deductive Databases
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0027openalex-snapshot
Disjunctive Semantics Based upon Partial and Bottom-Up Evaluation

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-46564-2_15openalex-snapshot
Clausal Deductive Databases and a General Framework for Semantics in Disjunctive Deductive Databases
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_32openalex-snapshot
Modular Paracoherent Answer Sets
inferred← citeshttps://doi.org/10.1007/bfb0056015openalex-snapshot
An alternating well-founded semantics for query answering in disjunctive databases
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/j.artint.2016.01.011openalex-snapshot
Semi-equilibrium models for paracoherent answer set programs
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103519openalex-snapshot
Paracoherent answer set computation
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00099-xopenalex-snapshot
Recovery of (non)monotonic theories
inferred← citeshttps://doi.org/10.1017/s1471068419000139openalex-snapshot
Paracoherent Answer Set Semantics meets Argumentation Frameworks
inferred← citeshttps://doi.org/10.1017/s1471068419000176openalex-snapshot
Better Paracoherent Answer Sets with Less Resources
inferred← citeshttps://doi.org/10.1023/a:1013180132511openalex-snapshot
Using clausal deductive databases for defining semantics in disjunctive deductive databases
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10679openalex-snapshot
On the Computation of Paracoherent Answer Sets
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11540openalex-snapshot
Externally Supported Models for Efficient Computation of Paracoherent Answer Sets
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.